void function ( long arg0 , long arg1 , int arg2 ) { saveRemainderValue ( arg1 , arg2 ) ; value = ( unique ) ? ( Object ) new Long ( arg0 ) : new LongTreeList ( arg0 ) ; }
add a value on a tree node end without roll out the completly tree . this reduce the size of the tree if there are large enties with a high significance . for example : if you have large strings which are different on the on the first 3 charchters . then you need only a tree size of 3 . concode_field_sep IndexNode[] EMPTY_NODES concode_elem_sep char[] remainderKey concode_elem_sep boolean unique concode_elem_sep IndexNode[] nodes concode_elem_sep Object value concode_elem_sep char digit concode_field_sep IndexNode addNode concode_elem_sep void addNode concode_elem_sep void saveValue concode_elem_sep void save concode_elem_sep void load concode_elem_sep void saveRemainderValue concode_elem_sep void saveRemainderValue concode_elem_sep IndexNode addRootValue concode_elem_sep IndexNode addRootValue concode_elem_sep IndexNode loadRef concode_elem_sep char[] getRemainderValue concode_elem_sep void removeNode concode_elem_sep IndexNode createIndexNode concode_elem_sep void moveRemainderValue concode_elem_sep int findNodePos concode_elem_sep int findNodePos concode_elem_sep char getDigit concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep IndexNode addRoot concode_elem_sep IndexNode addRoot concode_elem_sep void saveNode concode_elem_sep void clearValue concode_elem_sep Object getValue concode_elem_sep void moveRemainderValueSub concode_elem_sep IndexNode getChildNode concode_elem_sep int findNodeInsertPos concode_elem_sep void saveRef concode_elem_sep boolean getUnique concode_elem_sep IndexNode[] getChildNodes