void function ( int arg0 , LongRange arg1 ) { if ( start >= arg1 . min && end <= arg1 . max ) { if ( outputs == null ) { outputs = new ArrayList < > ( ) ; } outputs . add ( arg0 ) ; } else if ( left != null ) { assert right != null ; left . addOutputs ( arg0 , arg1 ) ; right . addOutputs ( arg0 , arg1 ) ; } }
recursively assigns range outputs to each node . concode_field_sep List<Integer> outputs concode_elem_sep int[] leafCounts concode_elem_sep int leafUpto concode_elem_sep int missingCount concode_elem_sep LongRangeNode left concode_elem_sep LongRangeNode root concode_elem_sep long start concode_elem_sep long[] boundaries concode_elem_sep long end concode_elem_sep LongRangeNode right concode_elem_sep int leafIndex concode_field_sep void add concode_elem_sep LongRangeNode split concode_elem_sep void indent concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep void toString concode_elem_sep int fillCounts concode_elem_sep int rollup