if (!current_node) throw_error(static_class_name(), func, "current node is nil");
tree_command_unit temp;
size_accumulator += current_node->packed_size() + temp.packed_size();
if (!current_node) throw_error(static_class_name(), func, "current node is nil");
tree_command_unit temp;
size_accumulator += current_node->packed_size() + temp.packed_size();
-LOG(a_sprintf("packing node %x", current_node));
-LOG(a_sprintf("size A %d", packed_form.length()));
+//LOG(a_sprintf("packing node %x", current_node));
+//LOG(a_sprintf("size A %d", packed_form.length()));
int accum = 0; // where we accumulate the length of the packed form.
for (iterator zip2 = start(postfix); (curr = (packable_tree *)zip2.next()); )
calcit(accum, curr);
int accum = 0; // where we accumulate the length of the packed form.
for (iterator zip2 = start(postfix); (curr = (packable_tree *)zip2.next()); )
calcit(accum, curr);
for (iterator zip2 = start(postfix); (curr = (packable_tree *)zip2.next()); )
packit(packed_form, curr);
for (iterator zip2 = start(postfix); (curr = (packable_tree *)zip2.next()); )
packit(packed_form, curr);
bool failure = false; // set to true if errors occurred.
// the packed tree is traversed by grabbing a command and then doing what
bool failure = false; // set to true if errors occurred.
// the packed tree is traversed by grabbing a command and then doing what