Node function ( int arg0 ) { Node loc0 = nPrimaryNode ; while ( arg0 -- > 0 ) { loc0 = loc0 . nNext ; } return loc0 ; }
returns the node for a given index , using the ordinal position of the index within the table object . concode_field_sep Node nPrimaryNode concode_elem_sep Object[] oData concode_elem_sep int tableId concode_elem_sep int iPos concode_field_sep int getRealSize concode_elem_sep int getStorageSize concode_elem_sep void keepInMemory concode_elem_sep void clearNodeLinks concode_elem_sep long getId concode_elem_sep void setInMemory concode_elem_sep void delete concode_elem_sep void setPos concode_elem_sep Row getUpdatedRow concode_elem_sep boolean isDeleted concode_elem_sep Node getNextNode concode_elem_sep boolean hasChanged concode_elem_sep int getPos concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep boolean isInMemory concode_elem_sep boolean isKeepInMemory concode_elem_sep void setStorageSize concode_elem_sep void write concode_elem_sep void write concode_elem_sep Object[] getData