/** * Returns an estimate of the memory footprint in bytes of this node * list and all its subtrees. * * @return the size of this list of subtrees in bytes */ int listSize() { int result = memSize(); for (Iterator it = iterator(); it.hasNext(); ) { ASTNode child = (ASTNode) it.next(); result += child.treeSize(); } return result; } }
/** * Returns an estimate of the memory footprint in bytes of this node * list and all its subtrees. * * @return the size of this list of subtrees in bytes */ int listSize() { int result = memSize(); for (Iterator it = iterator(); it.hasNext(); ) { ASTNode child = (ASTNode) it.next(); result += child.treeSize(); } return result; } }
/** * Returns an estimate of the memory footprint in bytes of this node * list and all its subtrees. * * @return the size of this list of subtrees in bytes */ int listSize() { int result = memSize(); for (Iterator it = iterator(); it.hasNext(); ) { ASTNode child = (ASTNode) it.next(); result += child.treeSize(); } return result; } }
/** * Returns an estimate of the memory footprint in bytes of this node * list and all its subtrees. * * @return the size of this list of subtrees in bytes */ int listSize() { int result = memSize(); for (Iterator it = iterator(); it.hasNext(); ) { ASTNode child = (ASTNode) it.next(); result += child.treeSize(); } return result; } }
/** * Returns an estimate of the memory footprint in bytes of this node * list and all its subtrees. * * @return the size of this list of subtrees in bytes */ int listSize() { int result = memSize(); for (Iterator it = iterator(); it.hasNext(); ) { ASTNode child = (ASTNode) it.next(); result += child.treeSize(); } return result; } }
/** * Returns an estimate of the memory footprint in bytes of this node * list and all its subtrees. * * @return the size of this list of subtrees in bytes */ int listSize() { int result = memSize(); for (Iterator it = iterator(); it.hasNext(); ) { ASTNode child = (ASTNode) it.next(); result += child.treeSize(); } return result; } }