=low){ \\r\\n //calculate mid\\r\\n int mid = low + (high - low)/2; \\r\\n //if key =intArray[mid] return mid\\r\\n if (intArray[mid] == key){ \\r\\n return mid; \\r\\n } \\r\\n //if intArray[mid] > key then key is in left half of array\\r\\n if (intArray[mid] > key){ \\r\\n return binary_Search(intArray, low, mid-1, key);//recursively search for key \\r\\n }else //key is in right half of the array\\r\\n { \\r\\n return binary_Search(intArray, mid+1, high, key);//recursively search for key \\r\\n } \\r\\n } \\r\\n return -1; \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0888861a6a1f1c2e0ac894029eef490d\",\n \"score\": \"0.6995969\",\n \"text\": \"public static <T extends Comparable<T>> void binarySearch(T[] array, T key) {\\n\\n\\t\\t//System.out.println(\\\"Input for binary search is\\\");\\n\\t\\t//printArray(array);\\n\\n\\t\\tT[] a = bubbleSort(array);\\n\\t\\tint l = 0, r = a.length - 1;\\n\\t\\twhile (l <= r) {\\n\\t\\t\\tint mid = (l + r) / 2;\\n\\t\\t\\tif (a[mid].compareTo(key) == 0) {\\n\\t\\t\\t\\tSystem.out.println(key + \\\" found at position \\\" + (mid + 1));\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tif (a[mid].compareTo(key) > 0)\\n\\t\\t\\t\\tr = mid - 1;\\n\\t\\t\\telse\\n\\t\\t\\t\\tl = mid + 1;\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Not found\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66ffe5b440ef4159536aa270a33d514b\",\n \"score\": \"0.6986646\",\n \"text\": \"void binarySearch(int []arr, int low, int key, int high) {\\n\\t\\t\\n\\t\\tint mid = (low + high) / 2;\\n\\t\\t\\n\\t\\tif (low > high) {\\n\\t\\t\\tfound = false;\\n\\t\\t}\\n\\t\\t\\n\\t\\telse {\\n\\t\\t\\t\\n\\t\\t\\tif (arr[mid] == key) {\\n\\t\\t\\t\\tfound = true;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\telse if (arr[mid] > key) {\\n\\t\\t\\t\\tbinarySearch(arr, low, key, mid - 1);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbinarySearch(arr, mid + 1, key, high);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38784ca12314a07d532327a57bd451b2\",\n \"score\": \"0.69771546\",\n \"text\": \"public static int linearSearch( int array[], int key ) \\r\\n { \\r\\n for ( int n = 0; n < array.length; n++ ) \\r\\n if ( array[ n ] == key )\\r\\n return n;\\r\\n\\r\\n return -1;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caa6366eaf7a4aa4a5df2d22747d51a7\",\n \"score\": \"0.6974158\",\n \"text\": \"public int searchIndex(int a[], int l, int h, int x);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42808b83947729f421d313b023b7dc3f\",\n \"score\": \"0.69624984\",\n \"text\": \"public static int binSearch(int[] valArray, int valueToSearch, int offSet, int length){\\n if(length <= 0 || offSet >= valArray.length){\\n return -1;\\n }\\n\\n int middleIndex = (length/2)+offSet;\\n int middleValue = valArray[middleIndex];\\n\\n //check if value is value were looking for\\n if (middleValue == valueToSearch){\\n return middleIndex;\\n }\\n\\n //if value is greater than value were looking for our value has to be to the left in the array\\n if (middleValue > valueToSearch){\\n int leftLength = middleIndex-offSet;\\n return binSearch(valArray, valueToSearch, offSet, leftLength);\\n }\\n\\n //if middle value is less than our value search the right half\\n int rightOffSet = middleIndex+1;\\n int rightLength = length+offSet-rightOffSet;\\n return binSearch(valArray, valueToSearch, rightOffSet, rightLength);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa1919b8894e82f827efc6ca6b7cf243\",\n \"score\": \"0.6962367\",\n \"text\": \"private static int searchForElement(int[] arr, int num) {\\n int first = 0, mid = 0;\\n int last = arr.length - 1;\\n while (first <= last) {\\n mid = (first + last) / 2;\\n if (num == arr[mid])\\n return mid;\\n if (num < arr[mid])\\n last = mid - 1;\\n else\\n first = mid + 1;\\n }\\n return -1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72c72b3090bb969d28a17a2721223007\",\n \"score\": \"0.6960579\",\n \"text\": \"public static int bitonicArraySearch(int a[], int low, int high, int target) {\\n\\t\\tif (high == low) return a[high];\\n\\t\\tint mid = low + (high-low)/2;\\n\\t\\tboolean max_on_right = false, max_on_left = false;\\n\\t\\tif ( a[mid] > a[mid-1] && a[mid] < a[mid+1] ) max_on_right = true;\\n\\t\\tif ( a[mid] > a[mid+1] && a[mid] < a[mid-1] ) max_on_left = true;\\n\\t\\tSystem.out.println(mid);\\n\\t\\tif ( a[mid] == target ) return mid;\\n\\t\\t\\n\\t\\t// now check, if element at mid is smaller than target and check where is max\\n\\t\\t// depending on that do a bitonic search based on the side of the max\\n\\t\\telse if ( a[mid] < target && max_on_right ) \\n\\t\\t\\treturn bitonicArraySearch(a, mid+1, high, target);\\n\\t\\t\\n\\t\\telse if ( a[mid] < target && max_on_left ) \\n\\t\\t\\treturn bitonicArraySearch(a, low, mid-1, target);\\n\\t\\t\\n\\t\\t// else if target number is smaller do ascending binary search on left sub array and \\n\\t\\t// descending binary search on the right sub array\\n\\t\\telse if ( a[mid] > target ) {\\n\\t\\t\\tint index = ascendingBinarySearch(a, low, mid-1, target);\\n\\t\\t\\tif (index != Integer.MIN_VALUE) return index;\\n\\t\\t\\t\\n\\t\\t\\tint index2 = descendingBinarySearch(a, mid+1, high, target);\\n\\t\\t\\tif (index2 != Integer.MIN_VALUE) return index2;\\n\\t\\t}\\n\\t\\treturn mid;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77d6ee44c2a2bf70ca4cbba4997a8a3b\",\n \"score\": \"0.6950822\",\n \"text\": \"public static int bSearch(int[] arr, int lo, int hi, int key){\\n\\t\\n\\t\\tint mid = lo+(hi-lo)/2;//calc mid\\t\\n\\t\\n\\t\\tif(lo>hi){//base case\\n\\t\\t\\tif(arr[mid]!=0){\\n\\t\\t\\t\\tif(arr[mid]<key){\\n\\t\\t\\t\\t\\tmid++;\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\n\\t\\t\\treturn mid;\\t\\n\\t\\t}\\n\\t\\n\\t\\tif(key == arr[mid]){//test to see if you found it\\n\\t\\t\\treturn mid;\\n\\t\\t}\\n\\t\\n\\t\\tif(key <= arr[mid]){\\n\\t\\t\\thi = mid-1;\\n\\t\\t}\\n\\t\\n\\t\\tif(key >= arr[mid]){\\n\\t\\t\\tlo = mid+1;\\n\\t\\t}\\n\\t\\t//adjust hi or lo < or >\\n\\t\\n\\t\\treturn bSearch(arr,lo,hi,key);\\n\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8666d5b13dc80405f575051c3d94169c\",\n \"score\": \"0.6943089\",\n \"text\": \"public static int search(int input[]) {\\n\\n\\t\\tint low = 0;\\n\\t\\tint high = input.length - 1;\\n\\n\\t\\twhile (low < high) {\\n\\n\\t\\t\\tint mid = (low + high) / 2;\\n\\n\\t\\t\\tif (mid % 2 == 0) {\\n\\t\\t\\t\\tif (input[mid] == input[mid + 1])\\n\\t\\t\\t\\t\\tlow = mid + 2;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\thigh = mid - 1;\\n\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (input[mid] == input[mid - 1])\\n\\t\\t\\t\\t\\tlow = mid + 1;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\thigh = mid - 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn input[low];\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07aae977a6b81da2cea5911e426dbb41\",\n \"score\": \"0.69174606\",\n \"text\": \"public static void main(String[] args) {\\n int[] array = {11, 22, 55, 88, 121, 122, 132};\\n System.out.println(Arrays.toString(array));\\n //Arrays.sort(array);\\n //System.out.println(Arrays.toString(array));\\n int result = binarySearch(array, 0, ((array.length - 1) / 2), array.length - 1, 22);\\n if (result == -1) {\\n System.out.println(\\\"The element is not found in the array\\\");\\n } else {\\n System.out.println(\\\"Index of the element is = \\\" + result);\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49c838931940154cbeb07eb871478196\",\n \"score\": \"0.6916895\",\n \"text\": \"public static int binarySearch(int[] elems, int low, int high, int targetVal) {\\n\\t\\twhile (low <= high) {\\n\\t\\t\\tint pivot = (low + high) >>> 1; // divided by 2\\n\\t\\t\\tint pivotVal = elems[pivot];\\n\\t\\n\\t\\t\\tif (pivotVal < targetVal) {\\n\\t\\t\\t\\tlow = pivot + 1; // shift forwards the lower limit to be ahead of pivot\\n\\t\\t\\t} else if (pivotVal > targetVal) {\\n\\t\\t\\t\\thigh = pivot - 1; // shift backwards the higher limit to be before pivot\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn pivot + 1; // key found, + 1 so it acts as a factor for our particular interest\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn low; // key not found, but we keep the current low limit\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"246fa8767e2531ed9b89fcd500aebddc\",\n \"score\": \"0.6916018\",\n \"text\": \"public static int bitonicArraySearch2(int a[], int low, int high, int target) {\\n\\t\\tif (high == low) return a[high];\\n\\t\\tint mid = low + (high-low)/2;\\n\\t\\tboolean max_on_right = false, max_on_left = false;\\n\\t\\tif ( a[mid] > a[mid-1] && a[mid] < a[mid+1] ) max_on_right = true;\\n\\t\\tif ( a[mid] > a[mid+1] && a[mid] < a[mid-1] ) max_on_left = true;\\n\\t\\t\\n\\t\\tSystem.out.println(max_on_right + \\\" \\\" + max_on_left + \\\" \\\" + a[mid]);\\n\\t\\tif ( a[mid] == target ) return mid;\\n\\t\\t\\n\\t\\t// now check, if element at mid is smaller than target and check where is max\\n\\t\\t// depending on that do a bitonic search based on the side of the max\\n\\t\\telse if ( max_on_right ) \\n\\t\\t\\treturn bitonicArraySearch(a, mid+1, high, target);\\n\\t\\t\\n\\t\\telse if ( max_on_left ) \\n\\t\\t\\treturn bitonicArraySearch(a, low, mid-1, target);\\n\\t\\t\\n\\t\\t// else if target number is smaller do ascending binary search on left sub array and \\n\\t\\t// descending binary search on the right sub array\\n\\t\\telse {\\n\\t\\t\\tint index = ascendingBinarySearch(a, 0, mid-1, target);\\n\\t\\t\\tif (index != Integer.MIN_VALUE) return index;\\n\\t\\t\\tint index2 = descendingBinarySearch(a, mid+1, a.length, target);\\n\\t\\t\\tif (index2 != Integer.MIN_VALUE) return index2;\\n\\t\\t}\\n\\t\\treturn mid;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5155308b469cfaa68498a8092004a5fe\",\n \"score\": \"0.6911695\",\n \"text\": \"public int search(int value)\\n {\\n int index; // Loop control variable\\n int position; // Position the value is found at\\n boolean found; // Flag indicating search results\\n\\n // Element 0 is the starting point of the search.\\n index = 0;\\n\\n // Store the default values position and found.\\n position = -1;\\n found = false;\\n\\n // Search the array.\\n while (!found && index < array.length)\\n {\\n comparisons++;\\n if (array[index] == value)\\n {\\n found = true;\\n position = index;\\n }\\n index++;\\n }\\n\\n // Return the found element's position,\\n // or -1 if not found.\\n return position;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"731e298958d2818aec7ae4ce0e653672\",\n \"score\": \"0.68915534\",\n \"text\": \"public static int linearSearch(int[] array, int key) {\\r\\n for (int i = 0; i < array.length; i++) {\\r\\n\\r\\n if (key == array[i]) {\\r\\n return i;\\r\\n }\\r\\n }\\r\\n\\r\\n return -1;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a36874c57ae2fc1567e545ca1dc65f19\",\n \"score\": \"0.6891427\",\n \"text\": \"public static int binarySearch(int[] list,int key){\\n int low=0;\\n int high=list.length-1;\\n while (high>low){\\n int mid=(low+high)/2;\\n if (key<list[mid])\\n high=mid-1;\\n else if(key==list[mid])\\n return mid;\\n else\\n low=mid+1;\\n }\\n return -low-1;\\n //return -low-1;means KEY NOT FOUND,并且给出关键字应该插入的地方.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3429f5357cb7265158917186d1e0cf9c\",\n \"score\": \"0.68886334\",\n \"text\": \"public static int indexOf(byte[] array, int search) {\\n return indexOf(array, search, 0, array.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9059ea5a643c8ee3af1f6830c4dceb3a\",\n \"score\": \"0.686133\",\n \"text\": \"public static int indexOf(byte[] array, int search, int offs, int len) {\\n for (int i = 0; i < len; i ++) {\\n if (array[offs + i] == (byte) search) {\\n return offs + i;\\n }\\n }\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7e51fdce89a0a55ed30c5860537197b\",\n \"score\": \"0.68445385\",\n \"text\": \"int find(int[] array, int element);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f088d760d77bc67d4cc4a0992923d76b\",\n \"score\": \"0.6820951\",\n \"text\": \"public static int binarySearchRecursive(int[] arr, int start, int end, int value) {\\n int mid = (start + end) / 2;\\n if (arr[mid] == value) return mid;\\n return arr[mid] < value ? binarySearchRecursive(arr, mid + 1, end, value) : binarySearchRecursive(arr, start, mid - 1, value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44c30bd12052eac83ae05b5407bed984\",\n \"score\": \"0.68174857\",\n \"text\": \"private int binarySearchRecursive(int[] input, int low, int high, int elementToFind) {\\n\\n int mid = (low + high) / 2;\\n\\n if (low > high) {\\n return -1;\\n } else if (elementToFind == input[mid]) {\\n return mid;\\n } else if (elementToFind < input[mid]) {\\n return binarySearchRecursive(input, low, mid - 1, elementToFind);\\n } else {\\n return binarySearchRecursive(input, mid + 1, high, elementToFind);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f83d0212f781405497583dac7ed61468\",\n \"score\": \"0.6803211\",\n \"text\": \"public int binarySearch(int[] numbers, int numberToSearchFor) {\\n\\t\\tint sortedNumbers[] = this.sortingAlgorithm.sort(numbers);\\n\\t\\t//Searching for input number\\n\\t\\t\\n\\t\\treturn - 3;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d4c058b7595dab5b2ea70dc82a979fb\",\n \"score\": \"0.67703944\",\n \"text\": \"private int letSearch(Integer[] a, Integer value){\\n\\t\\tint begin = 0;\\n\\t\\tint middle = a.length/2;\\n\\t\\tint end = a.length - 1; \\n\\t\\t\\n\\t\\tif(a.length == 0)\\n\\t\\t\\treturn -1;\\n\\t\\t\\n\\t\\twhile(begin < end){ // will stop when one element is left to be compared , < (not !=) because in case of middle be 0, when going to the left end will become negative\\n\\t\\t\\t\\n\\t\\t\\tif(a[middle].intValue() == value.intValue()){\\n\\t\\t\\t\\treturn middle;\\n\\t\\t\\t}else if(a[middle].intValue() > value.intValue()){ // defines new search area in the left\\n\\t\\t\\t\\tend = middle - 1; // excluding middle since it was already compared\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tbegin = middle + 1;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tmiddle = (end + begin) / 2; // defines new middle\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn a[middle].intValue() == value.intValue() ? middle : -1; // testing the last element, last chance!\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecf6a03f10a73b64c82f46f0844734a1\",\n \"score\": \"0.6766379\",\n \"text\": \"int search(int inorder[], int l, int h, int value) {\\n\\t\\tint i;\\n\\t\\tfor (i = l; i <= h; i++) {\\n\\t\\t\\tif (inorder[i] == value)\\n\\t\\t\\t\\treturn i;\\n\\t\\t}\\n\\t\\treturn i;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3841bdc9735a5d7bcd4b6e8e0b125afa\",\n \"score\": \"0.6762306\",\n \"text\": \"private static int BinarySearch(int[] A, int low, int high, int target){\\n while(low <= high){\\n int mid = low + (high - low) / 2;\\n if(A[mid] == target) return mid;\\n if(target < A[mid]) high = mid - 1;\\n else low = mid + 1;\\n }\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae3c6d4be3f4d23f3615fff2a1285f05\",\n \"score\": \"0.673912\",\n \"text\": \"private static int binarySearch(int[] sorted, int test, int loIndex, int hiIndex) {\\n\\n //The middle index of the sorted array\\n int middleIndex = (loIndex + hiIndex)/2;\\n\\n //Test value is not in array\\n if(loIndex > hiIndex) {\\n return -1;\\n }\\n //If test value is greater than the value at the middle of array,\\n //narrow search to second half of array\\n else if(test > sorted[middleIndex]) {\\n return binarySearch(sorted, test, middleIndex+1, hiIndex);\\n }\\n //If test value is less than the value at the middle of array,\\n //narrow search to first half of array\\n else if(test < sorted[middleIndex]) {\\n return binarySearch(sorted, test, loIndex, middleIndex-1);\\n }\\n //OR the test value IS the value at the middle index,\\n //so just return the middle index\\n else return middleIndex;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84b8406d9bbbcf23f98c770635a70837\",\n \"score\": \"0.67362946\",\n \"text\": \"public static int search(int key, int[] a)\\r\\n {\\r\\n /*\\r\\n * call search with 0 as the low and the length of the array as hi\\r\\n */\\r\\n return search(key, a, 0, a.length);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8c7deee87395340da2882d56e7f7256\",\n \"score\": \"0.6715115\",\n \"text\": \"public static boolean search(int[] A, int value, int index)\\n\\t{\\n\\t\\tfor(int i=0; i<A.length; i++)\\n\\t\\t{\\n\\t\\t\\tif(value == A[i])\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\t\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d838f076395076b6d8272df385947c9\",\n \"score\": \"0.67108494\",\n \"text\": \"private int indexOf(int[] array, int v) {\\n\\t\\tfor (int i=0; i<array.length; i++) {\\n\\t\\t\\tif (array[i] == v) return i;\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"483348825464b0cfe53dee0617db644b\",\n \"score\": \"0.66978717\",\n \"text\": \"private static int findPosBinarySearch(int[] arr, int lo, int hi, int selected) {\\n\\t\\tif(lo>=hi) {\\n\\t\\t\\treturn (selected>arr[lo])?lo+1:lo; \\n\\t\\t}\\t\\t\\n\\t\\t\\tint mid = lo+(hi-lo)/2;\\n\\t\\t\\tif(arr[mid]==selected) {\\n\\t\\t\\t\\treturn mid+1;\\n\\t\\t\\t}\\n\\t\\t\\tif(arr[mid]>selected) {\\n\\t\\t\\t\\treturn findPosBinarySearch(arr,lo,mid-1,selected);\\n\\t\\t\\t}\\n\\t\\t\\treturn findPosBinarySearch(arr,mid+1,hi,selected);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2971b92ba27fbf3d1aa3d7396f436410\",\n \"score\": \"0.66853005\",\n \"text\": \"int\\nbinarySearch(\\nint\\narr[], \\nint\\nl, \\nint\\nr, \\nint\\nx) \\n\\n{ \\n\\nif\\n(r >= l) \\n\\n{ \\n\\nint\\nmid = l + (r - l) / \\n2\\n; \\n\\n\\n// If the element is present at \\n\\n// one of the middle 3 positions \\n\\nif\\n(arr[mid] == x) \\n\\nreturn\\nmid; \\n\\nif\\n(mid > l && arr[mid - \\n1\\n] == x) \\n\\nreturn\\n(mid - \\n1\\n); \\n\\nif\\n(mid < r && arr[mid + \\n1\\n] == x) \\n\\nreturn\\n(mid + \\n1\\n); \\n\\n\\n// If element is smaller than mid, then \\n\\n// it can only be present in left subarray \\n\\nif\\n(arr[mid] > x) \\n\\nreturn\\nbinarySearch(arr, l, mid - \\n2\\n, x); \\n\\n\\n// Else the element can only be present \\n\\n// in right subarray \\n\\nreturn\\nbinarySearch(arr, mid + \\n2\\n, r, x); \\n\\n} \\n\\n\\n// We reach here when element is \\n\\n// not present in array \\n\\nreturn\\n-\\n1\\n; \\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c234abde47d3734db10dd519168b27a7\",\n \"score\": \"0.668194\",\n \"text\": \"private static int binarySearch(int arr[], int lo, int hi, int x) {\\n\\t\\tif(x<arr[lo]) {\\n\\t\\t\\treturn lo;\\n\\t\\t}\\n\\t\\tif(x>arr[hi]) {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tint mid = lo+(hi-lo)/2;\\n\\t\\tif(x==arr[mid]) {\\n\\t\\t\\treturn binarySearch(arr,mid+1,hi,x);\\n\\t\\t}\\n\\t\\t\\t\\n\\t\\tif(arr[mid]<x){\\n\\t\\t\\t if(mid+1<=hi && x<arr[mid+1]) {\\n\\t\\t\\t \\treturn mid+1;\\n\\t\\t\\t }\\n\\t\\t return binarySearch(arr,mid+1,hi,x);\\n\\t }else{\\n\\t \\tif(mid-1>=lo && x>=arr[mid-1]) {\\n\\t \\t\\treturn mid;\\n\\t \\t}\\n\\t return binarySearch(arr,lo,mid-1,x);\\t\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b93988c8521aedb50c1c5031bd679e7\",\n \"score\": \"0.6678014\",\n \"text\": \"public static int linearSearch(int[] arr, int num){\\n\\t\\t\\n\\t\\tfor(int i = 0; i < arr.length ; i++) {\\n\\t\\t\\tif(arr[i] == num) {\\n\\t\\t\\t\\treturn i;\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"778c360b52b9a19e2bc61c13d4a0de09\",\n \"score\": \"0.66777104\",\n \"text\": \"private int findIndex(int off)\\n{\\n int sidx = Arrays.binarySearch(java_offset,0,max_java,off);\\n if (sidx > 0) return sidx;\\n sidx = -sidx - 2;\\n if (sidx < 0) sidx = 0;\\n return sidx;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a30a42711bcc969d8c802553cbfd0cc\",\n \"score\": \"0.66723365\",\n \"text\": \"public static int sequentialSearch(int[] array, int value) {\\n int index; // Loop control variable \\n int element; // Element the value is fount at\\n boolean found; // Flag indicating search results\\n \\n // Element 0 is starting point of search\\n index = 0;\\n \\n // Store the default values element and found\\n element = -1;\\n found=false;\\n \\n // Search the array\\n while(!found && index <array.length){\\n \\n if(array[index] == value){\\n found=true;\\n element = index;\\n }\\n index++;\\n \\n }\\n return element;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8ee868a2cdcfa7432f4a9c18be32494\",\n \"score\": \"0.6662775\",\n \"text\": \"private int binarySearchIn(int[] nums, int target, int startIndex, int endIndex) {\\n int left = startIndex, right = endIndex;\\n while (left <= right) {\\n int mid = (right - left) / 2 + left;\\n if (nums[mid] == target) {\\n return mid;\\n } else if (nums[mid] < target) {\\n left = mid + 1;\\n } else {\\n right = mid - 1;\\n }\\n }\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"669a8709cfa885296926f87a817cbd38\",\n \"score\": \"0.66458714\",\n \"text\": \"public static int binarySearch(int[] array, int l, int r, int element) { //O(log_2_N) melhor loca\\n int mid;\\n while (l <= r) {\\n mid = l + (r - l) / 2; // or mid = (l+r)/2\\n if (element == array[mid])\\n return mid;\\n else if (element > array[mid])\\n l = mid + 1;\\n else\\n r = mid - 1;\\n }\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b070db71bec8ddf7febf6c0d8c07e4a8\",\n \"score\": \"0.66317534\",\n \"text\": \"private static int find(char[] array, char value) {\\n\\t\\tfor(int i=0; i<array.length; i++) {\\n\\t\\t\\tif(array[i] == value)\\n\\t\\t\\t\\treturn i;\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9ccff05fd01f896f59187bd59566d7e\",\n \"score\": \"0.6623941\",\n \"text\": \"public int linearSearch(int[] arr, int start, int end, int searchElement){\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tif(arr.length== 0)\\r\\n\\t\\t\\t\\tthrow new AssertionError();\\r\\n\\t\\t if(end<start)\\r\\n\\t\\t\\t return -1;\\r\\n\\t\\t if(arr[start]== searchElement)\\r\\n\\t\\t\\t return start;\\r\\n\\t\\t if(arr[end]== searchElement)\\r\\n\\t\\t\\t return end;\\r\\n\\t\\t return linearSearch(arr,start+1, end-1, searchElement);\\r\\n\\t\\t}\\r\\n\\t\\tcatch(AssertionError e) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Array cannot be empty!!\\\");\\r\\n\\t\\t}\\r\\n\\t\\treturn -1;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c155b59fc7c5faab6ab0da02bb4937a\",\n \"score\": \"0.6619216\",\n \"text\": \"private int binarySearch(E item) {\\n\\t\\treturn Collections.binarySearch(this, item);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1656fa39d19b3190fa8848ab7afa42cf\",\n \"score\": \"0.6603382\",\n \"text\": \"public static void binarySearchIntDesc() {\\n int size = 10;\\n\\n int n = (int) (Math.random() * 1000);\\n System.out.println(\\\"Search for: \\\" + n);\\n\\n int[] data = ArrayUtil.randomArray(size);\\n\\n // DISPLAY RANDOM SEARCH NUMBER\\n ArrayUtil.display(data);\\n\\n // BINARY SEARCH UNSORTED ARRAY\\n ArrayUtil.binarySearchAscending(data, n);\\n\\n// mid = ArrayUtil.binarySearch(data, n);\\n // SORT \\n ArrayUtil.selectionSortAscInt(data);\\n\\n // DISPLAY SORTED ARRAY\\n ArrayUtil.display(data);\\n\\n // BINARY SEARCH SORTED ARRAY\\n ArrayUtil.binarySearchAscending(data, n);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed545d99e71a616c3ddaa4edae9bf0\",\n \"score\": \"0.6601334\",\n \"text\": \"public int binarySearch(int[] nums, int i, int j, int target) {\\n while (i < j) {\\n int mid = i + (j - i)/2;\\n if (target <= nums[mid]) {\\n j = mid;\\n } else {\\n i = mid + 1;\\n }\\n }\\n return i;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba3b1bfc5cea8f288241230fb283dd7b\",\n \"score\": \"0.6597848\",\n \"text\": \"static int linearSearch(int[] arr,int target)\\n\\t{\\n\\t\\tif(arr.length==0)\\n\\t\\t{\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<arr.length;i++)\\n\\t\\t{\\n\\t\\t\\t// check for element at every index\\n\\t\\t\\tint element=arr[i];\\n\\t\\t\\tif(target==element)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e28c524c92a16c6da81946b9d2d8e4e\",\n \"score\": \"0.65972424\",\n \"text\": \"int search(int arr[], int n, int x) {\\n for (int i = 0; i < n; i++) {\\n // Return the index of the element if the element\\n // is found\\n if (arr[i] == x) {\\n return i;\\n }\\n }\\n\\n // return -1 if the element is not found\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abde2ed47294273361e20365fb4e1ba1\",\n \"score\": \"0.6593752\",\n \"text\": \"private int binarySearch(final int data[], final int startIndex, final int endIndex, final int searchedNumber) {\\n if (startIndex <= endIndex) {\\n int mid = startIndex + (endIndex - startIndex) / 2;\\n\\n // First thing first check if the searched number is the middle element\\n if (data[mid] == searchedNumber)\\n return mid;\\n\\n // If the searched number is smaller than mid, then it can only be present in left subarray (if the array is sorted)\\n if (data[mid] > searchedNumber)\\n return binarySearch(data, startIndex, mid - 1, searchedNumber);\\n\\n // Else the element can only be present in right subarray (if the array is sorted)\\n return binarySearch(data, mid + 1, endIndex, searchedNumber);\\n }\\n\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9de51e6ced72cb991a3e613e17e36fe0\",\n \"score\": \"0.6590779\",\n \"text\": \"@Test\\n\\t\\t\\tpublic void binarySearchTest() {\\n\\t\\t\\t\\tMyCalculator bc = new MyCalculator();\\n\\t\\t\\t\\tfloat actual = bc.binarySearch(array1,10);\\n\\t\\t\\t\\tassertEquals(\\\"not found\\\",-1,actual,0.0);\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84e564f83278a31e65c62784b0d2a24d\",\n \"score\": \"0.6585557\",\n \"text\": \"public int search(String value) {\\n\\t\\tfor (int i = 0; i < array.length; i++) {\\n\\t\\t\\tif (array[i].equals(value)) {\\n\\t\\t\\t\\treturn i + 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7f20765472e19256407e30981169016\",\n \"score\": \"0.65762407\",\n \"text\": \"public int linearSearch(int[] searchArray, int element, int index) {\\n\\t\\tint indexResult = -1;\\n\\t\\tif (index < searchArray.length) {\\n\\t\\t\\tif (searchArray[index] == element) {\\n\\t\\t\\t\\tindexResult = index;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tindexResult = linearSearch(searchArray, element, index + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn indexResult;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1192dc6fe06b4b62784ce798f7c767c\",\n \"score\": \"0.65493244\",\n \"text\": \"static int binarySearchRotated(int[] arr,int key) {\\n int start = 0;\\n int end = arr.length - 1;\\n\\n while(start <= end) {\\n int mid = start + (end-start)/2 ;\\n\\n if(arr[mid] == key) return mid;\\n\\n // arr[mid ... end] is sorted\\n if(arr[mid] <= arr[end]) {\\n if(key > arr[mid] && key <= arr[end]) {\\n start = mid + 1;\\n } else {\\n end = mid - 1;\\n }\\n\\n } else {\\n if(key >= arr[start] & key < arr[mid]) {\\n end = mid - 1;\\n } else {\\n start = mid + 1;\\n }\\n }\\n\\n }\\n\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d029585f1aff6e7b13820d8e918b6dd7\",\n \"score\": \"0.6548368\",\n \"text\": \"public static int linSearch(int[] a, int target){\\n\\tfor(int i = 0; i < a.length; i++){\\n\\t if(a[i] == target){\\n\\t\\treturn i;\\n\\t\\t }\\n\\t}\\n\\n\\treturn -1;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"686f5b30b7f142b241e5d4f9892ea84f\",\n \"score\": \"0.65436447\",\n \"text\": \"public int binarySearch(int arr[], int n, int target) {\\n int l = 0, r = n - 1;\\n while(l <= r) {\\n //int mid = (l + r) / 2;\\n int mid = l + (r - l) / 2;\\n if(arr[mid] == target) {\\n return mid;\\n // search in [l, mid - 1]\\n } else if(target < arr[mid]) {\\n r = mid - 1;\\n // search in [mid + 1, r]\\n } else {\\n l = mid + 1;\\n }\\n }\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ffd267b04e7438af8b465f3900f6711\",\n \"score\": \"0.6536392\",\n \"text\": \"public void test_search() {\\n\\tassertEquals(-1, BinarySearch.search(this.sortedArray, 100));\\n\\n\\tassertEquals(69, BinarySearch.search(this.sortedArray, 69));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"296053191ae14e503511e3c3739e31a7\",\n \"score\": \"0.65323436\",\n \"text\": \"public static int search(int key, int[] a, int lo, int hi)\\r\\n {\\n int mid = lo + (hi - lo) / 2;\\r\\n\\r\\n /*\\r\\n * compare the two integers a[mid] and key. A return value of 0 means\\r\\n * they are equal, less than 0 means a[mid] is smaller than key, and\\r\\n * greater than 0 means a[mid] is bigger than key\\r\\n * \\r\\n */\\r\\n int cmp = Integer.compare(a[mid], key);\\r\\n\\r\\n /*\\r\\n * hi is less than or equal to low that means that the two indices have\\r\\n * converged and the key has not been found. Multiply -1 by mid -1 to\\r\\n * signify the last index the key was smaller than.\\r\\n * \\r\\n */\\r\\n if (hi <= lo)\\r\\n return -1 * (mid - 1);\\r\\n\\r\\n /*\\r\\n * if cmp is greater than 0, then we need to search the left half of the\\r\\n * array, so pass lo and mid as the start and end indices.\\r\\n */\\r\\n if (cmp > 0)\\r\\n return search(key, a, lo, mid);\\r\\n /*\\r\\n * if cmp is less than 0, then we need to search the right half of the\\r\\n * array, so pass mid+1 and hi as the start and end indices.\\r\\n */\\r\\n else if (cmp < 0)\\r\\n return search(key, a, mid + 1, hi);\\r\\n /*\\r\\n * If both other conditons aren't met, then cmp is equal to zero and mid\\r\\n * is equal to the key, so we can return key\\r\\n */\\r\\n else\\r\\n return mid;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30696e12b5b403a430e86348b7ce247a\",\n \"score\": \"0.6516751\",\n \"text\": \"public int firstOccuBinarySearch(int[] array, int target) {\\n if (array == null || array.length == 0) {return -1;}\\n // start code from here\\n int left = 0;\\n int right = array.length - 1;\\n while (left < right - 1) {\\n int mid = left + (right - left) / 2;\\n if (array[mid] >= target) {\\n right = mid;\\n } else {\\n left = mid;\\n }\\n }\\n //postprocessing:\\n //1. if array only has 1 element\\n //2. if array only has 2 element\\n //3. more than 2 element and jump into while loop, but out of loop, decide left or right which is target\\n //4. more than 2 element and jump into while loop, but out of loop, left and right all not equals to target\\n if (array[left] == target) { return left;}\\n if (array[right] == target) { return right;}\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d881ce21d55d9d9d40a12747095012a8\",\n \"score\": \"0.6513192\",\n \"text\": \"static void search(int array[],int lb,int ub,int key) {\\r\\n\\t\\tif(lb<ub) {\\r\\n\\t\\t\\tint mid=(ub-lb)/2;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(array[mid]==key) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"found at \\\"+mid+\\\" index\\\");\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(key<array[mid]) {\\r\\n\\t\\t\\t\\tsearch(array,lb,mid-1,key);\\r\\n\\t\\t\\t}else {\\r\\n\\t\\t\\t\\tsearch(array,mid+1,ub,key);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"535c53c577ddfd91a89f8536e1f69a4d\",\n \"score\": \"0.6505545\",\n \"text\": \"public static int Search(int a[], int k) {\\n int index = timesSorted(a, a.length);\\n int low = 0, high = a.length - 1;\\n\\n int leftHalf = binarySearch(a, k, low, index - 1);\\n int rightHalf = binarySearch(a, k, index, high);\\n\\n if (leftHalf == -1 && rightHalf == -1) {\\n return leftHalf;\\n } else {\\n if (leftHalf != -1)\\n return leftHalf;\\n else\\n return rightHalf;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b12c29a63ba0c046dd5d51117e783ebc\",\n \"score\": \"0.65036535\",\n \"text\": \"protected int binarySearch(Comparable key) {\\n\\t\\t\\tif (entries.size() == 0)\\n\\t\\t\\t\\treturn -1;\\n\\t\\t\\tList sepValues = new MappedList(entries, new AbstractFunction() {\\n\\t\\t\\t\\tpublic Object invoke(Object entry) {\\n\\t\\t\\t\\t\\treturn separator(entry).sepValue();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\tint minIndex = Collections.binarySearch(sepValues, key);\\n\\t\\t\\treturn (duplicate) ? leftMostSearch(sepValues, minIndex, key)\\n\\t\\t\\t\\t\\t: minIndex;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84bceb5fb6f91d9f334279815d5de56e\",\n \"score\": \"0.65033907\",\n \"text\": \"public static int indexOf(byte[] array, int search, int offs) {\\n return indexOf(array, search, offs, array.length - offs);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b25f80dee947918b49ef7229b0eef1a\",\n \"score\": \"0.6499691\",\n \"text\": \"public static int binarySearchInt(int arr[], int l, int r, int x) \\n\\t{ \\n\\t\\tif ( r>= l) { \\n\\t\\t\\tint mid = l + (r - l) / 2; \\n\\n\\t\\t\\t// If the element is present at the \\n\\t\\t\\t// middle itself \\n\\t\\t\\tif (arr[mid] == x) \\n\\t\\t\\t\\treturn mid; \\n\\n\\t\\t\\t// If element is smaller than mid, then \\n\\t\\t\\t// it can only be present in left subarray \\n\\t\\t\\tif (arr[mid] > x) \\n\\t\\t\\t\\treturn binarySearchInt(arr, l, mid - 1, x); \\n\\n\\t\\t\\t// Else the element can only be present \\n\\t\\t\\t// in right subarray \\n\\t\\t\\treturn binarySearchInt(arr, mid + 1, r, x); \\n\\t\\t} \\n\\t\\t// We reach here when element is not present \\n\\t\\t// in array \\n\\t\\treturn -1; \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a2ca3329c757fcae56bedd7da22b222\",\n \"score\": \"0.6498952\",\n \"text\": \"public static int binarySearch(int arr[], int l, int r, int x)\\n\\t{\\n\\t\\twhile (l <= r)\\n\\t\\t{\\n\\t\\t\\tint m = l + (r-l)/2;\\n\\n\\t\\t\\t// Check if x is present at mid\\n\\t\\t\\tif (arr[m] == x)\\n\\t\\t\\t\\treturn m;\\n\\n\\t\\t\\t// If x greater, ignore left half\\n\\t\\t\\tif (arr[m] < x)\\n\\t\\t\\t\\tl = m + 1;\\n\\n\\t\\t\\t// If x is smaller, ignore right half\\n\\t\\t\\telse\\n\\t\\t\\t\\tr = m - 1;\\n\\t\\t}\\n\\t\\t// if we reach here, then element was\\n\\t\\t// not present\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a3a94796be01227a2082449fe037f93\",\n \"score\": \"0.64941907\",\n \"text\": \"public static int search(int arr[], int x, int n) \\n { \\n // Initialize fibonacci numbers\\n int fib2 = 0; \\n int fib1 = 1; \\n int fib = fib2 + fib1; \\n \\n // store the smallest Fibonacci Number greater than or equal to n\\n while (fib < n) \\n { \\n fib2 = fib1; \\n fib1 = fib; \\n fib = fib2 + fib1; \\n } \\n \\n int offset = -1; \\n\\n while (fib > 1) \\n { \\n // Check if fib2 is a valid location \\n int i = min(offset+fib2, n-1); \\n \\n if (arr[i] < x) \\n { \\n fib = fib1; \\n fib1 = fib2; \\n fib2 = fib - fib1; \\n offset = i; \\n } \\n \\n else if (arr[i] > x) \\n { \\n fib = fib2; \\n fib1 = fib1 - fib2; \\n fib2 = fib - fib1; \\n } \\n \\n else return i; \\n } \\n \\n if(fib1 == 1 && arr[offset+1] == x) \\n return offset+1; \\n \\n // element not found\\n return -1; \\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":2099,"cells":{"query_id":{"kind":"string","value":"92b46b25e32629b8ff7b9dee0501f4fd"},"query":{"kind":"string","value":"Produces an iterator of focus nodes for a given value node. This operation can only be called for node expressions where isReversible returns true and may throw an IllegalStateException otherwise."},"positive_passages":{"kind":"list like","value":[{"docid":"81245ab7103edc5faaca2c688b5286a5","score":"0.5240167","text":"ExtendedIterator<RDFNode> evalReverse(RDFNode valueNode, NodeExpressionContext context);","title":""}],"string":"[\n {\n \"docid\": \"81245ab7103edc5faaca2c688b5286a5\",\n \"score\": \"0.5240167\",\n \"text\": \"ExtendedIterator<RDFNode> evalReverse(RDFNode valueNode, NodeExpressionContext context);\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"d4bfcae0f3f6e6f76b24a497ff4705c5","score":"0.5784367","text":"IIterator<T> getValueIterator();","title":""},{"docid":"78dcb8c5c1010fa64bc96fdd80ad63e7","score":"0.57574534","text":"public Iterator<Node<V>> iterator()\n\t{\n\t\treturn new FwdIterator(min());\n\t}","title":""},{"docid":"5a8398007972ca1e4b14c49851cca9ad","score":"0.5719198","text":"ExtendedIterator<RDFNode> eval(RDFNode focusNode, NodeExpressionContext context);","title":""},{"docid":"b1b1811e2d6277993f3d39222a6442f6","score":"0.55910945","text":"public SequenceIterator iterate() throws XPathException {\n\n if (inputIterator == null) {\n return inputIterator = expression.iterate(savedXPathContext);\n } else {\n // In an ideal world this shouldn't happen: if the value is needed more than once, we should\n // have chosen a MemoClosure.\n\n // Changed Feb 2015 to throw an exception. Processing the expression more than once is not only\n // inefficient, it is wrong in the case where node-identity affects the outcome. See for example\n // test case fn-fold-left-018\n\n //return inputIterator.getAnother();\n throw new IllegalStateException(\"A Closure can only be read once\");\n }\n }","title":""},{"docid":"d6e0153878140aba7bce3ac7e84c304a","score":"0.5589804","text":"IReverseIterator<T> getValueReverseIterator();","title":""},{"docid":"49880c34d4822ceef664fd860be2b089","score":"0.5524666","text":"@Override\n public TreeNodeIterator iterator() {\n return new TreeNodeIterator() {\n\n /**\n * Returns the leftmost node of the current tree node if the\n * current tree node is not a leaf\n *\n * @return leftmost node of the current tree node if the current\n * tree node is not a leaf\n * @throws TreeNodeException an exception that is thrown in case\n * if the current tree node is a leaf\n */\n @Override\n protected TreeNode<T> leftMostNode() {\n return leftNode;\n }\n\n /**\n * Returns the right sibling node of the current tree node if the\n * current tree node is not root\n *\n * @return right sibling node of the current tree node if the current\n * tree node is not root\n * @throws TreeNodeException an exception that may be thrown in case if\n * the current tree node is root\n */\n @Override\n protected TreeNode<T> rightSiblingNode() {\n return rightNode;\n }\n\n };\n }","title":""},{"docid":"e6e68bfd51e38f88c9b68acf2a8ec430","score":"0.5514566","text":"@Override\n public Iterator<E> iterator() {\n return new Iterator<E>() {\n ArrayDeque<Node> usedStack = new ArrayDeque<>();\n Node cursor = null;\n Node max = maxNode();\n boolean removable = false;\n\n /**\n * Returns whether next() will return a new element of the tree or throw an exception.\n * @return true if tree has more elements to be iterated over, false otherwise\n */\n @Override\n public boolean hasNext() {\n return cursor != max;\n }\n\n /**\n * Returns next element stored inside RedBlackTree by natural ordering.\n * @return net element\n */\n @Override\n public E next() {\n if(cursor == null) {\n cursor = minNode();\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n if(hasNext()) {\n if(cursor.right.data != null) {\n cursor = getClosestNode(cursor);\n } else if(cursor != root) {\n while (cursor.equals(usedStack.peek()) ) {\n cursor = cursor.father;\n usedStack.pop();\n }\n }\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n throw new NoSuchElementException(\"No more elements in RedBlackTree.\");\n }\n }\n }\n\n /**\n * Deletes last element returned by next(). Can only be called ONCE after a call to next().\n */\n @Override\n public void remove() {\n if(removable) {\n delete(usedStack.peek());\n size--;\n removable = false;\n } else {\n throw new IllegalStateException(\"Next method hasn't been called or remove has already been called after last next call.\");\n }\n }\n };\n }","title":""},{"docid":"8c01f01385fcee8c7b48edc4977d1cf5","score":"0.5472712","text":"public Iterator<V> valueIterator() \n\t{\n\t\treturn new ValuesIterator<V>(iterator());\n\t}","title":""},{"docid":"0184c4672787c35fe6f1c6a21094fac0","score":"0.5427549","text":"public Iterator<T> iterator() {\n\t\treturn new ValueIterator();\n\t}","title":""},{"docid":"d79747087c5fcee016aa91bed779925a","score":"0.5297795","text":"@Override\n public Iterator<K> iterator() {\n List<K> keys = new ArrayList<K>();\n this.iteratorHelper(this.root, keys);\n return keys.iterator();\n }","title":""},{"docid":"20b9f690a7b5f7be158fe7c4d05284a9","score":"0.5253278","text":"public Iterator<Tree<V>> iterator() {\n return new PreorderIterator(this);\n }","title":""},{"docid":"67dd3a8fe1d9c2b8bb6c0fc8dfe7d39b","score":"0.52071685","text":"public Iterator<ParseTree> iterator() {\n return getChildren().iterator();\n }","title":""},{"docid":"c509e4608cdc561466aeece5886adcea","score":"0.51848793","text":"public Iterator<Node<V>> iterator( int start, int end )\n\t{\n\t\treturn new FwdIterator(min(start,end));\n\t}","title":""},{"docid":"d784462670c4e7a53e5e7f128e9ba474","score":"0.5166541","text":"public Node searchBSTIterative(int value) {\n\t\tif (isEmpty())\n\t\t\treturn null;\n\t\tNode currentNode = root;\n\t\twhile (currentNode != null) {\n\t\t\tif (currentNode.getData() == value)\n\t\t\t\treturn currentNode;\n\t\t\tif (currentNode.getData() > value) {\n\t\t\t\tcurrentNode = currentNode.getLeft();\n\t\t\t} else {\n\t\t\t\tcurrentNode = currentNode.getRight();\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"Not found in tree\");\n\t\treturn null;\n\t}","title":""},{"docid":"aabc2accd26090539155a23e194b2078","score":"0.5133213","text":"public Iterator<E> rIterator() {\n return new Iterator<E>() {\n ArrayDeque<Node> usedStack = new ArrayDeque<>();\n Node cursor = null;\n Node min = minNode();\n boolean removable = false;\n\n /**\n * Returns whether next() will return a new element of the tree or throw an exception.\n * @return true if tree has more elements to be iterated over, false otherwise\n */\n @Override\n public boolean hasNext() {\n return cursor != min;\n }\n /**\n * Returns next element stored inside RedBlackTree by reversed natural ordering.\n * @return net element\n */\n @Override\n public E next() {\n if(cursor == null) {\n cursor = maxNode();\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n if(hasNext() ) {\n if(cursor.left.data != null) {\n cursor = rGetClosestNode(cursor);\n } else if(cursor != root) {\n while (cursor == usedStack.peek() ) {\n cursor = cursor.father;\n usedStack.pop();\n }\n }\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n throw new NoSuchElementException(\"No more elements in RedBlackTree\");\n }\n }\n }\n /**\n * Deletes last element returned by next(). Can only be called ONCE after a call to next().\n */\n @Override\n public void remove() {\n if(removable) {\n delete(usedStack.peek());\n size--;\n removable = false;\n } else {\n throw new IllegalStateException(\"Next method hasn't been called or remove has already been called after last next call.\");\n }\n }\n };\n }","title":""},{"docid":"da9c3848c6ecdf114fe97b53d118c166","score":"0.5102733","text":"public SequenceIterator iterate(XPathContext context) throws XPathException {\n Controller controller = context.getController();\n if (controller.isTracing()) {\n String label = argument[1].evaluateAsString(context).toString();\n Value value = Value.asValue(ExpressionTool.eagerEvaluate(argument[0], context));\n notifyListener(label, value, context);\n return value.iterate();\n } else {\n PrintStream out = controller.getTraceFunctionDestination();\n if (out == null) {\n return argument[0].iterate(context);\n } else {\n return new TracingIterator(argument[0].iterate(context),\n argument[1].evaluateAsString(context).toString(),\n out);\n }\n }\n }","title":""},{"docid":"6de4eab34cf2e04b52328300853c0b3d","score":"0.5091297","text":"public Iterator<V> values()\n\t{\n\t\treturn new ValueIteratorHelper();\n\t}","title":""},{"docid":"d0555a8260baf7a8b5d61cd29e015251","score":"0.5038293","text":"@Override\n\tpublic Iterator<T> iterator() {\n\t\treturn new Iterator<T>() {\n\t\t\tnode<T> tmp = sentinel.getNext();\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\tif(tmp.getIndex() == 1) {\n\t\t\t\t\tSystem.out.println(tmp.getValue());\n\t\t\t\t}\n\t\t\t\ttmp = tmp.getNext();\n\t\t\t\treturn (tmp != sentinel.getNext())?true:false;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic T next() {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn tmp.getValue();\n\t\t\t}\n\t\t};\n\t}","title":""},{"docid":"02ced93522a59edfd311633037ce3903","score":"0.5005548","text":"public Iterator<WeightedNode> iterator() {\n \t\t// reverse the linked list, so that elements are returned in order\n \t\t// from start to end of the path.\n \t\tList<WeightedNode> nodes = new LinkedList<WeightedNode>();\n \t\tfor (WeightedNodePath curNode = this; curNode != null; curNode = curNode.path) {\n \t\t\tnodes.add(0, curNode.getEnd());\n \t\t}\n \t\treturn nodes.iterator();\n \t}","title":""},{"docid":"f4c24e14eff979090554db6c49bb65f9","score":"0.49584135","text":"public Iterator depthFirstIterator() {\n return new DepthFirstIterator();\n }","title":""},{"docid":"f36da0328d60c401df684612900347fd","score":"0.49528655","text":"public ReversibleIterator<T> iterator();","title":""},{"docid":"0feed381a4455e83b5ac7023c53c0ba4","score":"0.4911567","text":"public Iterator<V> values() {\n return new ValueIterator<V>();\n }","title":""},{"docid":"c1d7ad4c258b49ea2825b9a9b85d8cbc","score":"0.49026865","text":"@Override \n\tpublic Iterator<Node> iterator(){\n\t\treturn new NodeSetIterator(this.adaptee);\n\t}","title":""},{"docid":"3089c4a9a15e04c950ea324624a4e805","score":"0.48923516","text":"public interface NodeExpression {\n\n\t/**\n\t * Produces an iterator of value nodes for a given focus node.\n\t * @param focusNode the focus node\n\t * @param context the context\n\t * @return an iterator (never null)\n\t */\n\tExtendedIterator<RDFNode> eval(RDFNode focusNode, NodeExpressionContext context);\n\t\n\t\n\t/**\n\t * Produces an iterator of focus nodes for a given value node.\n\t * This operation can only be called for node expressions where isReversible returns true\n\t * and may throw an IllegalStateException otherwise.\n\t * @param valueNode the value node\n\t * @param context the context\n\t * @return an iterator (never null)\n\t */\n\tExtendedIterator<RDFNode> evalReverse(RDFNode valueNode, NodeExpressionContext context);\n\t\n\t\n\t/**\n\t * Produces a \"functional\" syntax used to display node expressions in a compact form.\n\t * @return the functional syntax for this expression\n\t */\n\tString getFunctionalSyntax();\n\t\n\t\n\tList<NodeExpression> getInputExpressions();\n\t\n\t\n\t/**\n\t * Gets the shape of the output data (if known), based on a context shape.\n\t * For example, for a path expression it would try to infer the output shape from the sh:class or sh:node\n\t * of the property (path).\n\t * @param contextShape the shape where the evaluation would start, e.g. the node shape of the sh:values statement\n\t * @return an output shape or null if unknown\n\t */\n\tResource getOutputShape(Resource contextShape);\n\t\n\t\n\t/**\n\t * Gets the RDF node that was used to construct the expression, in the SHACL node expressions syntax.\n\t * @return the RDF node\n\t */\n\tRDFNode getRDFNode();\n\t\n\t\n\tString getTypeId();\n\t\n\t\n\t/**\n\t * Checks if this expression could be evaluated in the reverse direction, with a value given and\n\t * then finding all focus nodes.\n\t * The function evalReverse can then be called.\n\t * NOTE THAT THIS IS CURRENTLY BARELY IMPLEMENTED.\n\t * @param context the context\n\t * @return true if reversible\n\t */\n\tboolean isReversible(NodeExpressionContext context);\n\t\n\t\n\tvoid visit(NodeExpressionVisitor visitor);\n}","title":""},{"docid":"c4c6c2f6c736e6dd4be5c0670a834bc6","score":"0.48776418","text":"public Iterator<K> iterator() {\n return new BSTDictionaryIterator<K>(root); // replace this stub with your code\n }","title":""},{"docid":"d464d3cdcca018afdeff08ed87526156","score":"0.48453903","text":"public Iterable<V> getDescendantValues() {\n return getValues(getDescendantNodes());\n }","title":""},{"docid":"15cef9e4018e2c6a2c367b464cf17c95","score":"0.48445535","text":"public Iterator<K> keyIterator(K from) {\n return new Cursor<K, V>(this, root, from);\n }","title":""},{"docid":"a50e63aa4b557db016f838212b33598e","score":"0.48434702","text":"public Iterator<E> iterator(){ \n\t\ttry {\n\t\t\treturn new BSTIterator<E>(this); \n\t\t} catch (Exception e) {\n\t\t\treturn null;\n\t\t}\n\t}","title":""},{"docid":"dea3d6e1cc43580e7fa9f5ab34e99b10","score":"0.4839796","text":"public ReversibleIterator<T> iterator(T start);","title":""},{"docid":"440432edea7ca1e83d5b7bef02ef27a6","score":"0.47971332","text":"@Override\r\n\tpublic Iterator<T> iterator() \r\n\t{\r\n\t\treturn new BSTIterator(root);\r\n\t}","title":""},{"docid":"36b23b007dda3a7062110370d50e677d","score":"0.47837463","text":"public Iterator getReferenceablePropertyIterator() {\n \t\treturn getPropertyClosureIterator();\n \t}","title":""},{"docid":"0f510d5287703161636ceec7c5767136","score":"0.47692433","text":"@Override\n public E next() {\n if(cursor == null) {\n cursor = minNode();\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n if(hasNext()) {\n if(cursor.right.data != null) {\n cursor = getClosestNode(cursor);\n } else if(cursor != root) {\n while (cursor.equals(usedStack.peek()) ) {\n cursor = cursor.father;\n usedStack.pop();\n }\n }\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n throw new NoSuchElementException(\"No more elements in RedBlackTree.\");\n }\n }\n }","title":""},{"docid":"9dcdb32aebe6e6a3a797768796cf989a","score":"0.47578025","text":"public Iterator<E> iterator() {\n return map.values().iterator();\n }","title":""},{"docid":"51ac182af2e3f74fbc8e9c07f75617c5","score":"0.4754215","text":"@Override\n public E next() {\n if(cursor == null) {\n cursor = maxNode();\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n if(hasNext() ) {\n if(cursor.left.data != null) {\n cursor = rGetClosestNode(cursor);\n } else if(cursor != root) {\n while (cursor == usedStack.peek() ) {\n cursor = cursor.father;\n usedStack.pop();\n }\n }\n usedStack.push(cursor);\n removable = true;\n return cursor.data;\n } else {\n throw new NoSuchElementException(\"No more elements in RedBlackTree\");\n }\n }\n }","title":""},{"docid":"e50829a808b3dda5fdb3bf421c135463","score":"0.47436032","text":"@Override\n public Item next() throws QueryException {\n if(iter == null) iter = root.iter(qc);\n // filter sequence\n for(Item item; (item = qc.next(iter)) != null;) {\n if(match(item, qc)) return item;\n }\n return null;\n }","title":""},{"docid":"d77f5260f11d78d256c1ae084aa95cde","score":"0.47381052","text":"@Override\r\n\tpublic Iterator<ObjectLabel> iterator() {\r\n\t\treturn new Iterator<ObjectLabel>() {\r\n\t\t\t\r\n\t\t\tprivate ScopeChain c = ScopeChain.this;\r\n\r\n\t\t\t@Override\r\n\t\t\tpublic boolean hasNext() {\r\n\t\t\t\treturn c != null;\r\n\t\t\t}\r\n\r\n\t\t\t@Override\r\n\t\t\tpublic ObjectLabel next() {\r\n\t\t\t\tObjectLabel objlabel = c.obj;\r\n\t\t\t\tc = c.next;\r\n\t\t\t\treturn objlabel;\r\n\t\t\t}\r\n\r\n\t\t\t@Override\r\n\t\t\tpublic void remove() {\r\n\t\t\t\tthrow new UnsupportedOperationException();\r\n\t\t\t}\r\n\t\t};\r\n\t}","title":""},{"docid":"8a96dbe083fbfe5a957376f786f73fec","score":"0.47358242","text":"public final Node getValueNode() {\n/* 47 */ return this.valueNode;\n/* */ }","title":""},{"docid":"b29f2ccd99a9fff31fbe131b29298c16","score":"0.47202852","text":"private java.util.Iterator<T> inOrderTraversal() {\n\n\t\t final int expectedNodeCount = nodeCount;\n\t\t final java.util.Stack<Node> stack = new java.util.Stack<>();\n\t\t stack.push(root);\n\n\t\t return new java.util.Iterator<T>() {\n\t\t Node trav = root;\n\n\t\t @Override\n\t\t public boolean hasNext() {\n\t\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\n\t\t return root != null && !stack.isEmpty();\n\t\t }\n\n\t\t @Override\n\t\t public T next() {\n\n\t\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\n\n\t\t // Dig left\n\t\t while (trav != null && trav.left != null) {\n\t\t stack.push(trav.left);\n\t\t trav = trav.left;\n\t\t }\n\n\t\t Node node = stack.pop();\n\n\t\t // Try moving down right once\n\t\t if (node.right != null) {\n\t\t stack.push(node.right);\n\t\t trav = node.right;\n\t\t }\n\n\t\t return node.data;\n\t\t }\n\n\t\t @Override\n\t\t public void remove() {\n\t\t throw new UnsupportedOperationException();\n\t\t }\n\t\t };\n\t\t }","title":""},{"docid":"cbe1861ec1fb173389f8ec470d34d57f","score":"0.47169992","text":"@Override\n public java.util.Iterator<E> iterator() {\n return new Iterator<E>() {\n Node<E> cursor = first;\n int innerModCount = modCount;\n\n @Override\n public boolean hasNext() {\n if (this.innerModCount != modCount) {\n throw new ConcurrentModificationException();\n }\n return this.cursor != null;\n }\n\n @Override\n public E next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n E rst = cursor.date;\n cursor = cursor.next;\n return rst;\n }\n };\n }","title":""},{"docid":"b67cff8812c6d328f1094fc2995b77e5","score":"0.47015068","text":"public Iterator<Node<V>> reverseIterator()\n\t{\n\t\treturn new RevIterator(max());\n\t}","title":""},{"docid":"725d156eca6e49047cf98a9308d90e58","score":"0.46986902","text":"public Iterator<T> reverseIterator() {\n\t\treturn new ReverseValueIterator();\n\t}","title":""},{"docid":"58a2d54429ebc1a731523786eb48495d","score":"0.46864107","text":"public java.util.Iterator<Element> iterator ();","title":""},{"docid":"0250adabe2ec440f54eae01f773a80c6","score":"0.46715158","text":"public Iterator<T> iteratorBack(){\n return new Iterator<T>()\n {\n private LNode current = head;\n\n public boolean hasNext(){\n return current != null;\n }\n public T next(){\n if(!hasNext()){\n throw new NoSuchElementException();\n }\n T value = current.getValue();\n current = current.getPrev();\n return value;\n }\n public void remove(){\n throw new UnsupportedOperationException();\n }\n };\n }","title":""},{"docid":"47b5a1ea36264b3b586f19f394bdb37b","score":"0.46533602","text":"public Iterator nodesBeforeEdges(Object composite);","title":""},{"docid":"83c5d8217e5c1ea6189079193e4f09c2","score":"0.4637214","text":"private java.util.Iterator<T> preOrderTraversal() {\n\n\t\t final int expectedNodeCount = nodeCount;\n\t\t final java.util.Stack<Node> stack = new java.util.Stack<>();\n\t\t stack.push(root);\n\n\t\t return new java.util.Iterator<T>() {\n\t\t @Override\n\t\t public boolean hasNext() {\n\t\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\n\t\t return root != null && !stack.isEmpty();\n\t\t }\n\n\t\t @Override\n\t\t public T next() {\n\t\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\n\t\t Node node = stack.pop();\n\t\t if (node.right != null) stack.push(node.right);\n\t\t if (node.left != null) stack.push(node.left);\n\t\t return node.data;\n\t\t }\n\n\t\t @Override\n\t\t public void remove() {\n\t\t throw new UnsupportedOperationException();\n\t\t }\n\t\t };\n\t\t }","title":""},{"docid":"3a0db8675ce1f22e0b528b4f8ae18050","score":"0.462676","text":"public Iterator<E> iterator(){\r\n\t return root.getEntities().iterator();\r\n\t}","title":""},{"docid":"9b642e2f3402211f2564f22445177d5e","score":"0.4609351","text":"public Iterator<String> iterator() {\n\t\treturn _values.iterator();\n\t}","title":""},{"docid":"5d13fca4868573a1d0143416ba1d590f","score":"0.45978376","text":"private int getIndexOfPreviousValue(Node<T> node, T value) {\n for (int i = 1; i < node.numberOfKeys(); i++) {\n Key<T> t = node.getKey(i);\n if (t.getElemento().compareTo(value) >= 0) {\n return i - 1;\n }\n }\n return node.numberOfKeys() - 1;\n }","title":""},{"docid":"a916a1ad22637570470157564dad4c89","score":"0.45951307","text":"private int getIndexOfNextValue(Node<T> node, T value) {\n for (int i = 0; i < node.numberOfKeys(); i++) {\n Key<T> t = node.getKey(i);\n if (t.getElemento().compareTo(value) >= 0) {\n return i;\n }\n }\n return node.numberOfKeys() - 1;\n }","title":""},{"docid":"52b80f3175a6c92af9ffc3fccfda24f6","score":"0.45870438","text":"SequencesIterator iterator();","title":""},{"docid":"db1faf123129979bb15a9b6d2ea534fd","score":"0.45833883","text":"public Iterator<Node<V>> iterator( Interval interval )\n\t{\n\t\treturn new FwdIterator(min(interval.getStart(),interval.getEnd()));\n\t}","title":""},{"docid":"fb4b7e9676fdb3751330385e017c893c","score":"0.45750493","text":"public Iterator nodes(Object composite);","title":""},{"docid":"bf1d90a48ace967e99c86c64d0583d85","score":"0.45599526","text":"public Iterator iterator()\n {\n return this.tuples.values( ).iterator( );\n }","title":""},{"docid":"4961f96fd43a3e1caedd2467d236a0e8","score":"0.45597723","text":"public LocalValueEnumerator GetLocalValueEnumerator() \r\n {\r\n // Do not allow foreign threads access. \r\n // (This is a noop if this Object is not assigned to a Dispatcher.) \r\n //\r\n this.VerifyAccess(); \r\n\r\n int effectiveValuesCount = EffectiveValuesCount;\r\n LocalValueEntry[] snapshot = new LocalValueEntry[effectiveValuesCount];\r\n int count = 0; \r\n\r\n // Iterate through the sorted effectiveValues \r\n for (int i=0; i<effectiveValuesCount; i++) \r\n {\r\n DependencyProperty dp = DependencyProperty.RegisteredPropertyList.List[_effectiveValues[i].PropertyIndex]; \r\n if (dp != null)\r\n {\r\n Object localValue = ReadLocalValueEntry(new EntryIndex(i), dp, false /* allowDeferredReferences */);\r\n if (localValue != DependencyProperty.UnsetValue) \r\n {\r\n snapshot[count++] = new LocalValueEntry(dp, localValue); \r\n } \r\n }\r\n } \r\n\r\n return new LocalValueEnumerator(snapshot, count);\r\n }","title":""},{"docid":"50e4331b322b70d11b3330cfe238243a","score":"0.4556994","text":"public PositionIterator getPositionIterator();","title":""},{"docid":"84a68b02dc8111f79ba3101d155e726b","score":"0.45513403","text":"private Node<T> getNode(T value) {\n Node<T> node = root;\n while (node != null) {\n Key<T> lesser = node.getKey(0);\n if (value.compareTo(lesser.getElemento()) < 0) {\n if (node.numberOfChildren() > 0) {\n node = node.getChild(0);\n } else {\n node = null;\n }\n continue;\n }\n\n int numberOfKeys = node.numberOfKeys();\n int last = numberOfKeys - 1;\n Key<T> greater = node.getKey(last);\n if (value.compareTo(greater.getElemento()) > 0) {\n if (node.numberOfChildren() > numberOfKeys) {\n node = node.getChild(numberOfKeys);\n } else {\n node = null;\n }\n continue;\n }\n\n for (int i = 0; i < numberOfKeys; i++) {\n Key<T> currentValue = node.getKey(i);\n if (currentValue.getElemento().compareTo(value) == 0) {\n return node;\n }\n\n int next = i + 1;\n if (next <= last) {\n Key<T> nextValue = node.getKey(next);\n if (currentValue.getElemento().compareTo(value) < 0 && nextValue.getElemento().compareTo(value) > 0) {\n if (next < node.numberOfChildren()) {\n node = node.getChild(next);\n break;\n }\n return null;\n }\n }\n }\n }\n return null;\n }","title":""},{"docid":"70304509195eb4f3fe1e957011047c0b","score":"0.45427054","text":"@JsMethod\n\tpublic abstract NodeIterator createNodeIterator(final Node root, final double whatToShow, final NodeFilter filter,\n\t\t\tfinal boolean entityReferenceExpansion);","title":""},{"docid":"dc15f01f95d11e49665fbcdb85dea03d","score":"0.4527541","text":"public Iterable<Position<E>> breadthfirst( ) {\n \n List<Position<E>> snapshot = new ArrayList<>( );\n \n if (!isEmpty( )) {\n Queue<Position<E>> fringe = new LinkedQueue<Position<E>>( );\n fringe.enqueue(root( ));\n // start with the root\n while (!fringe.isEmpty( )) {\n Position<E> p = fringe.dequeue( );\n // remove from front of the queue\n snapshot.add(p);\n // report this position\n for (Position<E> c : children(p))\n fringe.enqueue(c);\n // add children to back of queue\n }\n }\n return snapshot;\n }","title":""},{"docid":"b6d6d61d3b2200a8f6321b1d07602581","score":"0.45268598","text":"public Integer[] getToNodeWithValue(int searchValue) {\n if (root.getData() == searchValue) {\n return new Integer[]{searchValue};\n } else {\n List<Integer> path = new ArrayList<>();\n root.getToNode(searchValue, path);\n return path.toArray(new Integer[path.size()]);\n }\n }","title":""},{"docid":"54b7bc810c05ec96c8a3c206d81cc0e3","score":"0.45254812","text":"public Iterator values() {\n return _values.values().iterator();\n }","title":""},{"docid":"ccb8a4f56f5da3c8ce61809a1e66eb44","score":"0.45247597","text":"@Override\n public Iterator<K> iterator()\n {\n final int MODIFICATION_COUNT = modificationCount;\n\n return new Iterator<K>()\n {\n int index, keysLeft = keyCount;\n\n @Override\n public boolean hasNext()\n {\n if (MODIFICATION_COUNT != modificationCount) throw new ConcurrentModificationException();\n return keysLeft != 0;\n }\n\n @Override\n public K next()\n {\n while (keys[index] == null || keys[index] == TOMBSTONE) index++;\n keysLeft--;\n return keys[index++];\n }\n };\n }","title":""},{"docid":"1b88abd2629dea181a90427032c29306","score":"0.45172945","text":"@Override\n public Iterator<T> iterator() {\n return new Iterator<T>() {\n AbstractStoreContainer<T> currentContainer = head;\n int currentCounter = 0;\n\n @Override\n public boolean hasNext() {\n if (currentContainer == null) return false;\n if (currentCounter < currentContainer.size()) return true;\n if (currentContainer.getNext() == null) {\n currentContainer = null;\n currentCounter = 0;\n return false;\n }\n do {\n currentContainer = currentContainer.getNext();\n }\n while (currentContainer != null\n && currentContainer.size() == 0);\n if (currentContainer == null) return false;\n currentCounter = 0;\n return true;\n }\n\n @Override\n public T next() {\n if (currentContainer != null) {\n return currentContainer.get(currentCounter++);\n }\n return null;\n }\n };\n }","title":""},{"docid":"68de3a684272436dda721e82fa92a706","score":"0.45122877","text":"public Iterable<T> elements() {\n\t\treturn new ValueIterable();\n\t}","title":""},{"docid":"ca31a1929301a7595930fade575eea78","score":"0.45081913","text":"public Iterator iterator() {\n return new Iterator() {\n private int cursor = 0;\n private int lastRet = -1;\n\n public boolean hasNext() {\n return cursor != size();\n }\n\n public Object next() {\n try {\n final Object next = get(cursor);\n lastRet = cursor++;\n return next;\n } catch(IndexOutOfBoundsException e) {\n final NoSuchElementException nsee = new NoSuchElementException();\n nsee.initCause(e);\n throw nsee;\n }\n }\n\n public void remove() {\n if (lastRet == -1) {\n throw new IllegalStateException(\"next() must be called before remove()\");\n }\n\n TransformedEventList.this.remove(lastRet);\n if (lastRet < cursor) {\n cursor--;\n }\n lastRet = -1;\n }\n };\n }","title":""},{"docid":"330003a38f2b508aa07b4fa73d02917b","score":"0.45010677","text":"Iterator<E> iterator();","title":""},{"docid":"330003a38f2b508aa07b4fa73d02917b","score":"0.45010677","text":"Iterator<E> iterator();","title":""},{"docid":"5a373efe42a23c70aaf8f96ca6591b0c","score":"0.44995368","text":"public Iterator getDescendants(final Component c) {\n List list = new ArrayList(12);\n SwingEngine.traverse(c, list);\n return list.iterator();\n }","title":""},{"docid":"e8b5b69c12c0059e479b850edfdb85bf","score":"0.44987068","text":"public abstract zzbk<E> iterator();","title":""},{"docid":"d86f6b790cd48c4ec3652248084f2194","score":"0.44931588","text":"public Iterator<PartialTree> iterator() {\n\t\treturn new PartialTreeListIterator(this);\n\t}","title":""},{"docid":"0ea36a536288a789c0402315d09d6d10","score":"0.44829714","text":"public Iterator<String> iterator() {\n\t\t\t\treturn new RWayTrieIterator(prefix);\r\n\t\t\t}","title":""},{"docid":"3718b965c587b1d97ccfd68cc9ed6590","score":"0.4475268","text":"public abstract void iterate(Object value);","title":""},{"docid":"e3e6cad09629f8e34b423970eba4a437","score":"0.44710416","text":"@OslcName(\"focusNode\")\n @OslcPropertyDefinition(ShDomainConstants.SHACL_NAMSPACE + \"focusNode\")\n @OslcOccurs(Occurs.ExactlyOne)\n @OslcReadOnly(false)\n public URI getFocusNode()\n {\n // Start of user code getterInit:focusNode\n // End of user code\n return focusNode;\n }","title":""},{"docid":"744ae99982ecf0478c124e246fa68329","score":"0.44689217","text":"public int getStartFromNode(int value) {\n\t\tNode node = getNode(friendList, value);\n\t\treturn node.getStart();\n\t}","title":""},{"docid":"ac6d7f17fdd630b2c2da9229adc24961","score":"0.44678575","text":"public Iterator<K> keyIterator() {\n reap();\n final Iterator<IdentityWeakReference> iterator = backingStore.keySet().iterator();\n // IMPORTANT: Don't use oal.util.FilterIterator here:\n // We need *strong* reference to current key after setNext()!!!\n return new Iterator<K>() {\n // holds strong reference to next element in backing iterator:\n private Object next = null;\n // the backing iterator was already consumed:\n private boolean nextIsSet = false;\n\n @Override\n public boolean hasNext() {\n return nextIsSet || setNext();\n }\n\n @Override\n @SuppressWarnings(\"unchecked\")\n public K next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n assert nextIsSet;\n try {\n return (K) next;\n } finally {\n // release strong reference and invalidate current value:\n nextIsSet = false;\n next = null;\n }\n }\n\n @Override\n public void remove() {\n throw new UnsupportedOperationException();\n }\n\n private boolean setNext() {\n assert !nextIsSet;\n while (iterator.hasNext()) {\n next = iterator.next().get();\n if (next == null) {\n // the key was already GCed, we can remove it from backing map:\n iterator.remove();\n } else {\n // unfold \"null\" special value:\n if (next == NULL) {\n next = null;\n }\n return nextIsSet = true;\n }\n }\n return false;\n }\n };\n }","title":""},{"docid":"0a3797999f30ce0bf468a90c12b49d99","score":"0.44673106","text":"@Override\n public boolean findElement(int value) {\n Node node = rootNode;\n\n while (node != null) {\n if (value == node.getValue()) {\n return true;\n }\n if (value < node.getValue()) {\n node = node.getLeftChild();\n } else {\n node = node.getRightChild();\n }\n }\n return false;\n }","title":""},{"docid":"572cfdf3c958755cb7d01531b19cb7c4","score":"0.44600046","text":"@Override\n public Iterator<T> iterator()\n {\n return variableIterator.iterator();\n }","title":""},{"docid":"2ba501874e814bb03e8619dfc254f772","score":"0.4455563","text":"public Iterator<E> iterator() {\n return new Iterator<E>() {\n Node<E> node = head;\n long modCount = modificationCount;\n\n public boolean hasNext() {\n if (modCount != modificationCount) throw new ConcurrentModificationException(\n \"Structure Modified after Iterator Creation\"\n );\n return node != null;\n }\n\n public E next() {\n E obj = node.data;\n node = node.next;\n return obj;\n }\n\n public void remove() {\n throw new UnsupportedOperationException();\n }\n };\n }","title":""},{"docid":"16c8c5643cc2a970732e920260609cec","score":"0.4446679","text":"public Iterator<Integer> getIterator() {\n return sequence.iterator();\n }","title":""},{"docid":"ffd891c7a119e99f3d0e200c97311c63","score":"0.44396567","text":"public Iterator<Map.Entry<K, V2>> entryIterator() {\n return Iterators.transform(this.fromMap.entrySet().iterator(), Maps.asEntryToEntryFunction(this.transformer));\n }","title":""},{"docid":"f0cac5220bb166adfc5ed17b39b5b908","score":"0.44385076","text":"public T getCursor() { return isEmpty() ? null : nodes.peek().getValue(); }","title":""},{"docid":"3550d163cf3991ad711c63a08b839b41","score":"0.44314724","text":"@Override\n\tpublic Iterator<Integer> iterator() {\n\t\treturn new StackIterator<Integer>(head);\n\t}","title":""},{"docid":"6f581502d1fd2e4111f34c9c3a12b0b9","score":"0.44296095","text":"@JsMethod\n\tpublic abstract NodeIterator createNodeIterator(final Node root);","title":""},{"docid":"18b6b864573c39f8c1b0fe5fe161e341","score":"0.44279638","text":"public Iterator<String> iterator() {\n return mMap.values().iterator();\n }","title":""},{"docid":"e92e394e8cd9264feb1fdbe5bbd63d40","score":"0.44236866","text":"@Override\r\n\tpublic Iterator<T> iterator() {\r\n\t\t//this method is outlined for you... just fill out next() and hasNext()\r\n\t\t//NO ADDITIONAL ANYTHING (METHODS, VARIABLES, ETC.) INSIDE THE ANONYMOUS CLASS\r\n\t\t//You may NOT override remove() or any other iterator methods\r\n\t\treturn new Iterator<T>() {\r\n\t\t\t//starts at the head\r\n\t\t\t/**\r\n\t\t\t * current is used as a dummy head.\r\n\t\t\t */\r\n\t\t\tprivate Node<T> current = head;\r\n\t\t\tprivate Node<T> nextN;\r\n\t\t\tprivate int counter = 0;\r\n\r\n\t\t\t/**\r\n\t\t\t * This method checks if there is a next item.\r\n\t\t\t * It does so by simply checking if the current node is not null.\r\n\t\t\t * The reason being is when the method next() is called, the current node will point to the next node until the end.\r\n\t\t\t * it will return false if the current node is false.\r\n\t\t\t * @return true if next exists, false otherwise.\r\n\t\t\t */\r\n\t\t\t@Override\r\n\t\t\tpublic boolean hasNext() {\r\n\t\t\t\t//O(1)\r\n\t\t\t\tboolean next = false;\r\n\t\t\t\tif(current != null){\r\n\t\t\t\t\tnext = true;\r\n\t\t\t\t}else{\r\n\t\t\t\t\tnext = false;\r\n\t\t\t\t}\r\n\t\t\t\treturn next;\r\n\t\t\t}\r\n\r\n\t\t\t/**\r\n\t\t\t * This method simply returns the next item.\r\n\t\t\t * It is important to understand that the iterator only stands between two nodes or indexes.\r\n\t\t\t *\r\n\t\t\t * @return the item next in the list.\r\n\t\t\t */\r\n\t\t\t@Override\r\n\t\t\tpublic T next() {\r\n\t\t\t\t//O(1)\r\n\t\t\t\tT temp;\r\n\t\t\t\tif (current == null) {\r\n\t\t\t\t\tthrow new NoSuchElementException();\r\n\t\t\t\t} else {\r\n\t\t\t\t\t//counter++;\r\n\t\t\t\t\ttemp = current.value;\r\n\t\t\t\t\tcurrent = current.next;\r\n\t\t\t\t}\r\n\t\t\t\t//System.out.println(counter);\r\n\t\t\t\treturn temp;\r\n\t\t\t}\r\n\t\t};\r\n\t}","title":""},{"docid":"0916c1bf026d6f639f286bdf3454d09c","score":"0.44226897","text":"private java.util.Iterator<T> levelOrderTraversal() {\n\n\t\t final int expectedNodeCount = nodeCount;\n\t\t final java.util.Queue<Node> queue = new java.util.LinkedList<>();\n\t\t queue.offer(root);\n\n\t\t return new java.util.Iterator<T>() {\n\t\t @Override\n\t\t public boolean hasNext() {\n\t\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\n\t\t return root != null && !queue.isEmpty();\n\t\t }\n\n\t\t @Override\n\t\t public T next() {\n\t\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\n\t\t Node node = queue.poll();\n\t\t if (node.left != null) queue.offer(node.left);\n\t\t if (node.right != null) queue.offer(node.right);\n\t\t return node.data;\n\t\t }\n\n\t\t @Override\n\t\t public void remove() {\n\t\t throw new UnsupportedOperationException();\n\t\t }\n\t\t };\n\t\t }","title":""},{"docid":"144979bf1252e2ef47cc6f0b85276ac0","score":"0.44161862","text":"public Iterator<T> iterator(){\n return new Iterator<T>()\n {\n private LNode current = head;\n\n public boolean hasNext(){\n return current != null;\n }\n public T next(){\n if(!hasNext()){\n throw new NoSuchElementException();\n }\n T value = current.getValue();\n current = current.getNext();\n return value;\n }\n public void remove(){\n throw new UnsupportedOperationException();\n }\n };\n }","title":""},{"docid":"f356300fb2ab3af226c32890ab360c9c","score":"0.44119856","text":"@Override\n public Integer next() {\n if (peekValue != null) {\n Integer toReturn = peekValue;\n peekValue = null;\n return toReturn;\n }\n if (!iter.hasNext()) {\n return null;\n }\n return iter.next();\n }","title":""},{"docid":"8579543018a10d1e230a7c2dbb46bea9","score":"0.44098204","text":"Iterator<Object> iterator();","title":""},{"docid":"2865454599442e50e3c921a149f9445f","score":"0.44092295","text":"@JsMethod\n\tpublic abstract NodeIterator createNodeIterator(final Node root, final double whatToShow);","title":""},{"docid":"2e107d93e7c48273a8aee237ceac07a5","score":"0.44025406","text":"@Override\n\tpublic Iterator<Node> iterator(){\n\t\tIterator<Node> it = new Iterator<Node>(){\n\t\t\t\n\t\t\tprivate int currentIndex;\n\n\t\t\t@Override\n\t\t\t/**Method to see if the iterator has a next value.\n\t\t\t * @return Returns true or false if the hashtable has another node.\n\t\t\t */\n\t\t\tpublic boolean hasNext() {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn currentIndex < sizeOfArray;\n\t\t\t}\n\t\t\t/**Method for getting the next node.\n\t\t\t * @return returns a Node in the Hashtable.\n\t\t\t */\n\t\t\t@Override\n\t\t\tpublic Node next() {\n\t\t\t\treturn nodeArray[currentIndex++];\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic void remove() {\n\t\t\t}\n\t\t};\n\t\treturn it;\n\t}","title":""},{"docid":"4f7e010dc084c03e98fb57cd20d9d8b5","score":"0.44018084","text":"public Iterator iterator();","title":""},{"docid":"5dd16f03b0fc86f5edebe90e1bb35ffe","score":"0.44004977","text":"public Iterator<Map.Entry<K, V>> entryIterator() {\n return Maps.asMapEntryIterator(this.set, this.function);\n }","title":""},{"docid":"f77e3fa373b60003a48d8fc0eebee5b9","score":"0.43992388","text":"@Override\r\n public Iterator<List<Operand<?>>> iterator() {\r\n\r\n if (!tf.scope().env().isEager()) {\r\n throw new UnsupportedOperationException(\r\n \"Cannot iterate through a \" + \"dataset in graph mode.\");\r\n }\r\n\r\n DatasetIterator iterator = makeOneShotIterator();\r\n\r\n return new Iterator<List<Operand<?>>>() {\r\n private DatasetOptional nextOptional = iterator.getNextAsOptional();\r\n\r\n @Override\r\n public boolean hasNext() {\r\n return nextOptional.hasValue().data().getBoolean();\r\n }\r\n\r\n @Override\r\n public List<Operand<?>> next() {\r\n List<Operand<?>> result = nextOptional.getValue();\r\n nextOptional = iterator.getNextAsOptional();\r\n return result;\r\n }\r\n };\r\n }","title":""},{"docid":"606d457daebd487d178d228b834511c5","score":"0.439735","text":"public Iterable<T> forwardIterator()\n {\n return variableIterator.forwardIterator();\n }","title":""},{"docid":"80df198e4e1e6a83bc207a2e7820f870","score":"0.43940446","text":"public Iterator<E> iterator();","title":""},{"docid":"80df198e4e1e6a83bc207a2e7820f870","score":"0.43940446","text":"public Iterator<E> iterator();","title":""},{"docid":"80df198e4e1e6a83bc207a2e7820f870","score":"0.43940446","text":"public Iterator<E> iterator();","title":""},{"docid":"f6c2aab2e1706d7a1c64cd951db65018","score":"0.4390991","text":"public Iterator<T> iterator() {\r\n return new ForwardDequeIterator<T>(this);\r\n }","title":""},{"docid":"c3cef6074d6f3255337cb2b5ec8aade8","score":"0.43787694","text":"public Tree<V> next() {\n Tree<V> result = position;\n if (!position.isLeaf()) {\n position = position.firstChild();\n } else if (position.hasNextSibling()) {\n position = position.nextSibling();\n } else {\n do {\n position = position.parent();\n } while (!position.hasNextSibling() && position != limit);\n if (position == limit) {\n position = null;\n } else {\n position = position.nextSibling();\n }\n }\n return result;\n }","title":""},{"docid":"79db2dc564f8a1069f287328d6cfaf9d","score":"0.43773192","text":"@Override\r\n public Iterator iterator() {\r\n return new LinkedStackIterator();\r\n }","title":""}],"string":"[\n {\n \"docid\": \"d4bfcae0f3f6e6f76b24a497ff4705c5\",\n \"score\": \"0.5784367\",\n \"text\": \"IIterator<T> getValueIterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78dcb8c5c1010fa64bc96fdd80ad63e7\",\n \"score\": \"0.57574534\",\n \"text\": \"public Iterator<Node<V>> iterator()\\n\\t{\\n\\t\\treturn new FwdIterator(min());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a8398007972ca1e4b14c49851cca9ad\",\n \"score\": \"0.5719198\",\n \"text\": \"ExtendedIterator<RDFNode> eval(RDFNode focusNode, NodeExpressionContext context);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1b1811e2d6277993f3d39222a6442f6\",\n \"score\": \"0.55910945\",\n \"text\": \"public SequenceIterator iterate() throws XPathException {\\n\\n if (inputIterator == null) {\\n return inputIterator = expression.iterate(savedXPathContext);\\n } else {\\n // In an ideal world this shouldn't happen: if the value is needed more than once, we should\\n // have chosen a MemoClosure.\\n\\n // Changed Feb 2015 to throw an exception. Processing the expression more than once is not only\\n // inefficient, it is wrong in the case where node-identity affects the outcome. See for example\\n // test case fn-fold-left-018\\n\\n //return inputIterator.getAnother();\\n throw new IllegalStateException(\\\"A Closure can only be read once\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6e0153878140aba7bce3ac7e84c304a\",\n \"score\": \"0.5589804\",\n \"text\": \"IReverseIterator<T> getValueReverseIterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49880c34d4822ceef664fd860be2b089\",\n \"score\": \"0.5524666\",\n \"text\": \"@Override\\n public TreeNodeIterator iterator() {\\n return new TreeNodeIterator() {\\n\\n /**\\n * Returns the leftmost node of the current tree node if the\\n * current tree node is not a leaf\\n *\\n * @return leftmost node of the current tree node if the current\\n * tree node is not a leaf\\n * @throws TreeNodeException an exception that is thrown in case\\n * if the current tree node is a leaf\\n */\\n @Override\\n protected TreeNode<T> leftMostNode() {\\n return leftNode;\\n }\\n\\n /**\\n * Returns the right sibling node of the current tree node if the\\n * current tree node is not root\\n *\\n * @return right sibling node of the current tree node if the current\\n * tree node is not root\\n * @throws TreeNodeException an exception that may be thrown in case if\\n * the current tree node is root\\n */\\n @Override\\n protected TreeNode<T> rightSiblingNode() {\\n return rightNode;\\n }\\n\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6e68bfd51e38f88c9b68acf2a8ec430\",\n \"score\": \"0.5514566\",\n \"text\": \"@Override\\n public Iterator<E> iterator() {\\n return new Iterator<E>() {\\n ArrayDeque<Node> usedStack = new ArrayDeque<>();\\n Node cursor = null;\\n Node max = maxNode();\\n boolean removable = false;\\n\\n /**\\n * Returns whether next() will return a new element of the tree or throw an exception.\\n * @return true if tree has more elements to be iterated over, false otherwise\\n */\\n @Override\\n public boolean hasNext() {\\n return cursor != max;\\n }\\n\\n /**\\n * Returns next element stored inside RedBlackTree by natural ordering.\\n * @return net element\\n */\\n @Override\\n public E next() {\\n if(cursor == null) {\\n cursor = minNode();\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n if(hasNext()) {\\n if(cursor.right.data != null) {\\n cursor = getClosestNode(cursor);\\n } else if(cursor != root) {\\n while (cursor.equals(usedStack.peek()) ) {\\n cursor = cursor.father;\\n usedStack.pop();\\n }\\n }\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n throw new NoSuchElementException(\\\"No more elements in RedBlackTree.\\\");\\n }\\n }\\n }\\n\\n /**\\n * Deletes last element returned by next(). Can only be called ONCE after a call to next().\\n */\\n @Override\\n public void remove() {\\n if(removable) {\\n delete(usedStack.peek());\\n size--;\\n removable = false;\\n } else {\\n throw new IllegalStateException(\\\"Next method hasn't been called or remove has already been called after last next call.\\\");\\n }\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c01f01385fcee8c7b48edc4977d1cf5\",\n \"score\": \"0.5472712\",\n \"text\": \"public Iterator<V> valueIterator() \\n\\t{\\n\\t\\treturn new ValuesIterator<V>(iterator());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0184c4672787c35fe6f1c6a21094fac0\",\n \"score\": \"0.5427549\",\n \"text\": \"public Iterator<T> iterator() {\\n\\t\\treturn new ValueIterator();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d79747087c5fcee016aa91bed779925a\",\n \"score\": \"0.5297795\",\n \"text\": \"@Override\\n public Iterator<K> iterator() {\\n List<K> keys = new ArrayList<K>();\\n this.iteratorHelper(this.root, keys);\\n return keys.iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20b9f690a7b5f7be158fe7c4d05284a9\",\n \"score\": \"0.5253278\",\n \"text\": \"public Iterator<Tree<V>> iterator() {\\n return new PreorderIterator(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67dd3a8fe1d9c2b8bb6c0fc8dfe7d39b\",\n \"score\": \"0.52071685\",\n \"text\": \"public Iterator<ParseTree> iterator() {\\n return getChildren().iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c509e4608cdc561466aeece5886adcea\",\n \"score\": \"0.51848793\",\n \"text\": \"public Iterator<Node<V>> iterator( int start, int end )\\n\\t{\\n\\t\\treturn new FwdIterator(min(start,end));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d784462670c4e7a53e5e7f128e9ba474\",\n \"score\": \"0.5166541\",\n \"text\": \"public Node searchBSTIterative(int value) {\\n\\t\\tif (isEmpty())\\n\\t\\t\\treturn null;\\n\\t\\tNode currentNode = root;\\n\\t\\twhile (currentNode != null) {\\n\\t\\t\\tif (currentNode.getData() == value)\\n\\t\\t\\t\\treturn currentNode;\\n\\t\\t\\tif (currentNode.getData() > value) {\\n\\t\\t\\t\\tcurrentNode = currentNode.getLeft();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tcurrentNode = currentNode.getRight();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Not found in tree\\\");\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aabc2accd26090539155a23e194b2078\",\n \"score\": \"0.5133213\",\n \"text\": \"public Iterator<E> rIterator() {\\n return new Iterator<E>() {\\n ArrayDeque<Node> usedStack = new ArrayDeque<>();\\n Node cursor = null;\\n Node min = minNode();\\n boolean removable = false;\\n\\n /**\\n * Returns whether next() will return a new element of the tree or throw an exception.\\n * @return true if tree has more elements to be iterated over, false otherwise\\n */\\n @Override\\n public boolean hasNext() {\\n return cursor != min;\\n }\\n /**\\n * Returns next element stored inside RedBlackTree by reversed natural ordering.\\n * @return net element\\n */\\n @Override\\n public E next() {\\n if(cursor == null) {\\n cursor = maxNode();\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n if(hasNext() ) {\\n if(cursor.left.data != null) {\\n cursor = rGetClosestNode(cursor);\\n } else if(cursor != root) {\\n while (cursor == usedStack.peek() ) {\\n cursor = cursor.father;\\n usedStack.pop();\\n }\\n }\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n throw new NoSuchElementException(\\\"No more elements in RedBlackTree\\\");\\n }\\n }\\n }\\n /**\\n * Deletes last element returned by next(). Can only be called ONCE after a call to next().\\n */\\n @Override\\n public void remove() {\\n if(removable) {\\n delete(usedStack.peek());\\n size--;\\n removable = false;\\n } else {\\n throw new IllegalStateException(\\\"Next method hasn't been called or remove has already been called after last next call.\\\");\\n }\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da9c3848c6ecdf114fe97b53d118c166\",\n \"score\": \"0.5102733\",\n \"text\": \"public SequenceIterator iterate(XPathContext context) throws XPathException {\\n Controller controller = context.getController();\\n if (controller.isTracing()) {\\n String label = argument[1].evaluateAsString(context).toString();\\n Value value = Value.asValue(ExpressionTool.eagerEvaluate(argument[0], context));\\n notifyListener(label, value, context);\\n return value.iterate();\\n } else {\\n PrintStream out = controller.getTraceFunctionDestination();\\n if (out == null) {\\n return argument[0].iterate(context);\\n } else {\\n return new TracingIterator(argument[0].iterate(context),\\n argument[1].evaluateAsString(context).toString(),\\n out);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6de4eab34cf2e04b52328300853c0b3d\",\n \"score\": \"0.5091297\",\n \"text\": \"public Iterator<V> values()\\n\\t{\\n\\t\\treturn new ValueIteratorHelper();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0555a8260baf7a8b5d61cd29e015251\",\n \"score\": \"0.5038293\",\n \"text\": \"@Override\\n\\tpublic Iterator<T> iterator() {\\n\\t\\treturn new Iterator<T>() {\\n\\t\\t\\tnode<T> tmp = sentinel.getNext();\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic boolean hasNext() {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\tif(tmp.getIndex() == 1) {\\n\\t\\t\\t\\t\\tSystem.out.println(tmp.getValue());\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttmp = tmp.getNext();\\n\\t\\t\\t\\treturn (tmp != sentinel.getNext())?true:false;\\n\\t\\t\\t}\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic T next() {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\treturn tmp.getValue();\\n\\t\\t\\t}\\n\\t\\t};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02ced93522a59edfd311633037ce3903\",\n \"score\": \"0.5005548\",\n \"text\": \"public Iterator<WeightedNode> iterator() {\\n \\t\\t// reverse the linked list, so that elements are returned in order\\n \\t\\t// from start to end of the path.\\n \\t\\tList<WeightedNode> nodes = new LinkedList<WeightedNode>();\\n \\t\\tfor (WeightedNodePath curNode = this; curNode != null; curNode = curNode.path) {\\n \\t\\t\\tnodes.add(0, curNode.getEnd());\\n \\t\\t}\\n \\t\\treturn nodes.iterator();\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4c24e14eff979090554db6c49bb65f9\",\n \"score\": \"0.49584135\",\n \"text\": \"public Iterator depthFirstIterator() {\\n return new DepthFirstIterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f36da0328d60c401df684612900347fd\",\n \"score\": \"0.49528655\",\n \"text\": \"public ReversibleIterator<T> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0feed381a4455e83b5ac7023c53c0ba4\",\n \"score\": \"0.4911567\",\n \"text\": \"public Iterator<V> values() {\\n return new ValueIterator<V>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1d7ad4c258b49ea2825b9a9b85d8cbc\",\n \"score\": \"0.49026865\",\n \"text\": \"@Override \\n\\tpublic Iterator<Node> iterator(){\\n\\t\\treturn new NodeSetIterator(this.adaptee);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3089c4a9a15e04c950ea324624a4e805\",\n \"score\": \"0.48923516\",\n \"text\": \"public interface NodeExpression {\\n\\n\\t/**\\n\\t * Produces an iterator of value nodes for a given focus node.\\n\\t * @param focusNode the focus node\\n\\t * @param context the context\\n\\t * @return an iterator (never null)\\n\\t */\\n\\tExtendedIterator<RDFNode> eval(RDFNode focusNode, NodeExpressionContext context);\\n\\t\\n\\t\\n\\t/**\\n\\t * Produces an iterator of focus nodes for a given value node.\\n\\t * This operation can only be called for node expressions where isReversible returns true\\n\\t * and may throw an IllegalStateException otherwise.\\n\\t * @param valueNode the value node\\n\\t * @param context the context\\n\\t * @return an iterator (never null)\\n\\t */\\n\\tExtendedIterator<RDFNode> evalReverse(RDFNode valueNode, NodeExpressionContext context);\\n\\t\\n\\t\\n\\t/**\\n\\t * Produces a \\\"functional\\\" syntax used to display node expressions in a compact form.\\n\\t * @return the functional syntax for this expression\\n\\t */\\n\\tString getFunctionalSyntax();\\n\\t\\n\\t\\n\\tList<NodeExpression> getInputExpressions();\\n\\t\\n\\t\\n\\t/**\\n\\t * Gets the shape of the output data (if known), based on a context shape.\\n\\t * For example, for a path expression it would try to infer the output shape from the sh:class or sh:node\\n\\t * of the property (path).\\n\\t * @param contextShape the shape where the evaluation would start, e.g. the node shape of the sh:values statement\\n\\t * @return an output shape or null if unknown\\n\\t */\\n\\tResource getOutputShape(Resource contextShape);\\n\\t\\n\\t\\n\\t/**\\n\\t * Gets the RDF node that was used to construct the expression, in the SHACL node expressions syntax.\\n\\t * @return the RDF node\\n\\t */\\n\\tRDFNode getRDFNode();\\n\\t\\n\\t\\n\\tString getTypeId();\\n\\t\\n\\t\\n\\t/**\\n\\t * Checks if this expression could be evaluated in the reverse direction, with a value given and\\n\\t * then finding all focus nodes.\\n\\t * The function evalReverse can then be called.\\n\\t * NOTE THAT THIS IS CURRENTLY BARELY IMPLEMENTED.\\n\\t * @param context the context\\n\\t * @return true if reversible\\n\\t */\\n\\tboolean isReversible(NodeExpressionContext context);\\n\\t\\n\\t\\n\\tvoid visit(NodeExpressionVisitor visitor);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4c6c2f6c736e6dd4be5c0670a834bc6\",\n \"score\": \"0.48776418\",\n \"text\": \"public Iterator<K> iterator() {\\n return new BSTDictionaryIterator<K>(root); // replace this stub with your code\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d464d3cdcca018afdeff08ed87526156\",\n \"score\": \"0.48453903\",\n \"text\": \"public Iterable<V> getDescendantValues() {\\n return getValues(getDescendantNodes());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15cef9e4018e2c6a2c367b464cf17c95\",\n \"score\": \"0.48445535\",\n \"text\": \"public Iterator<K> keyIterator(K from) {\\n return new Cursor<K, V>(this, root, from);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a50e63aa4b557db016f838212b33598e\",\n \"score\": \"0.48434702\",\n \"text\": \"public Iterator<E> iterator(){ \\n\\t\\ttry {\\n\\t\\t\\treturn new BSTIterator<E>(this); \\n\\t\\t} catch (Exception e) {\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dea3d6e1cc43580e7fa9f5ab34e99b10\",\n \"score\": \"0.4839796\",\n \"text\": \"public ReversibleIterator<T> iterator(T start);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"440432edea7ca1e83d5b7bef02ef27a6\",\n \"score\": \"0.47971332\",\n \"text\": \"@Override\\r\\n\\tpublic Iterator<T> iterator() \\r\\n\\t{\\r\\n\\t\\treturn new BSTIterator(root);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36b23b007dda3a7062110370d50e677d\",\n \"score\": \"0.47837463\",\n \"text\": \"public Iterator getReferenceablePropertyIterator() {\\n \\t\\treturn getPropertyClosureIterator();\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f510d5287703161636ceec7c5767136\",\n \"score\": \"0.47692433\",\n \"text\": \"@Override\\n public E next() {\\n if(cursor == null) {\\n cursor = minNode();\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n if(hasNext()) {\\n if(cursor.right.data != null) {\\n cursor = getClosestNode(cursor);\\n } else if(cursor != root) {\\n while (cursor.equals(usedStack.peek()) ) {\\n cursor = cursor.father;\\n usedStack.pop();\\n }\\n }\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n throw new NoSuchElementException(\\\"No more elements in RedBlackTree.\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dcdb32aebe6e6a3a797768796cf989a\",\n \"score\": \"0.47578025\",\n \"text\": \"public Iterator<E> iterator() {\\n return map.values().iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51ac182af2e3f74fbc8e9c07f75617c5\",\n \"score\": \"0.4754215\",\n \"text\": \"@Override\\n public E next() {\\n if(cursor == null) {\\n cursor = maxNode();\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n if(hasNext() ) {\\n if(cursor.left.data != null) {\\n cursor = rGetClosestNode(cursor);\\n } else if(cursor != root) {\\n while (cursor == usedStack.peek() ) {\\n cursor = cursor.father;\\n usedStack.pop();\\n }\\n }\\n usedStack.push(cursor);\\n removable = true;\\n return cursor.data;\\n } else {\\n throw new NoSuchElementException(\\\"No more elements in RedBlackTree\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e50829a808b3dda5fdb3bf421c135463\",\n \"score\": \"0.47436032\",\n \"text\": \"@Override\\n public Item next() throws QueryException {\\n if(iter == null) iter = root.iter(qc);\\n // filter sequence\\n for(Item item; (item = qc.next(iter)) != null;) {\\n if(match(item, qc)) return item;\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d77f5260f11d78d256c1ae084aa95cde\",\n \"score\": \"0.47381052\",\n \"text\": \"@Override\\r\\n\\tpublic Iterator<ObjectLabel> iterator() {\\r\\n\\t\\treturn new Iterator<ObjectLabel>() {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tprivate ScopeChain c = ScopeChain.this;\\r\\n\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic boolean hasNext() {\\r\\n\\t\\t\\t\\treturn c != null;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic ObjectLabel next() {\\r\\n\\t\\t\\t\\tObjectLabel objlabel = c.obj;\\r\\n\\t\\t\\t\\tc = c.next;\\r\\n\\t\\t\\t\\treturn objlabel;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void remove() {\\r\\n\\t\\t\\t\\tthrow new UnsupportedOperationException();\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a96dbe083fbfe5a957376f786f73fec\",\n \"score\": \"0.47358242\",\n \"text\": \"public final Node getValueNode() {\\n/* 47 */ return this.valueNode;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b29f2ccd99a9fff31fbe131b29298c16\",\n \"score\": \"0.47202852\",\n \"text\": \"private java.util.Iterator<T> inOrderTraversal() {\\n\\n\\t\\t final int expectedNodeCount = nodeCount;\\n\\t\\t final java.util.Stack<Node> stack = new java.util.Stack<>();\\n\\t\\t stack.push(root);\\n\\n\\t\\t return new java.util.Iterator<T>() {\\n\\t\\t Node trav = root;\\n\\n\\t\\t @Override\\n\\t\\t public boolean hasNext() {\\n\\t\\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\\n\\t\\t return root != null && !stack.isEmpty();\\n\\t\\t }\\n\\n\\t\\t @Override\\n\\t\\t public T next() {\\n\\n\\t\\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\\n\\n\\t\\t // Dig left\\n\\t\\t while (trav != null && trav.left != null) {\\n\\t\\t stack.push(trav.left);\\n\\t\\t trav = trav.left;\\n\\t\\t }\\n\\n\\t\\t Node node = stack.pop();\\n\\n\\t\\t // Try moving down right once\\n\\t\\t if (node.right != null) {\\n\\t\\t stack.push(node.right);\\n\\t\\t trav = node.right;\\n\\t\\t }\\n\\n\\t\\t return node.data;\\n\\t\\t }\\n\\n\\t\\t @Override\\n\\t\\t public void remove() {\\n\\t\\t throw new UnsupportedOperationException();\\n\\t\\t }\\n\\t\\t };\\n\\t\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbe1861ec1fb173389f8ec470d34d57f\",\n \"score\": \"0.47169992\",\n \"text\": \"@Override\\n public java.util.Iterator<E> iterator() {\\n return new Iterator<E>() {\\n Node<E> cursor = first;\\n int innerModCount = modCount;\\n\\n @Override\\n public boolean hasNext() {\\n if (this.innerModCount != modCount) {\\n throw new ConcurrentModificationException();\\n }\\n return this.cursor != null;\\n }\\n\\n @Override\\n public E next() {\\n if (!hasNext()) {\\n throw new NoSuchElementException();\\n }\\n E rst = cursor.date;\\n cursor = cursor.next;\\n return rst;\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b67cff8812c6d328f1094fc2995b77e5\",\n \"score\": \"0.47015068\",\n \"text\": \"public Iterator<Node<V>> reverseIterator()\\n\\t{\\n\\t\\treturn new RevIterator(max());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"725d156eca6e49047cf98a9308d90e58\",\n \"score\": \"0.46986902\",\n \"text\": \"public Iterator<T> reverseIterator() {\\n\\t\\treturn new ReverseValueIterator();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58a2d54429ebc1a731523786eb48495d\",\n \"score\": \"0.46864107\",\n \"text\": \"public java.util.Iterator<Element> iterator ();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0250adabe2ec440f54eae01f773a80c6\",\n \"score\": \"0.46715158\",\n \"text\": \"public Iterator<T> iteratorBack(){\\n return new Iterator<T>()\\n {\\n private LNode current = head;\\n\\n public boolean hasNext(){\\n return current != null;\\n }\\n public T next(){\\n if(!hasNext()){\\n throw new NoSuchElementException();\\n }\\n T value = current.getValue();\\n current = current.getPrev();\\n return value;\\n }\\n public void remove(){\\n throw new UnsupportedOperationException();\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47b5a1ea36264b3b586f19f394bdb37b\",\n \"score\": \"0.46533602\",\n \"text\": \"public Iterator nodesBeforeEdges(Object composite);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83c5d8217e5c1ea6189079193e4f09c2\",\n \"score\": \"0.4637214\",\n \"text\": \"private java.util.Iterator<T> preOrderTraversal() {\\n\\n\\t\\t final int expectedNodeCount = nodeCount;\\n\\t\\t final java.util.Stack<Node> stack = new java.util.Stack<>();\\n\\t\\t stack.push(root);\\n\\n\\t\\t return new java.util.Iterator<T>() {\\n\\t\\t @Override\\n\\t\\t public boolean hasNext() {\\n\\t\\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\\n\\t\\t return root != null && !stack.isEmpty();\\n\\t\\t }\\n\\n\\t\\t @Override\\n\\t\\t public T next() {\\n\\t\\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\\n\\t\\t Node node = stack.pop();\\n\\t\\t if (node.right != null) stack.push(node.right);\\n\\t\\t if (node.left != null) stack.push(node.left);\\n\\t\\t return node.data;\\n\\t\\t }\\n\\n\\t\\t @Override\\n\\t\\t public void remove() {\\n\\t\\t throw new UnsupportedOperationException();\\n\\t\\t }\\n\\t\\t };\\n\\t\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a0db8675ce1f22e0b528b4f8ae18050\",\n \"score\": \"0.462676\",\n \"text\": \"public Iterator<E> iterator(){\\r\\n\\t return root.getEntities().iterator();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b642e2f3402211f2564f22445177d5e\",\n \"score\": \"0.4609351\",\n \"text\": \"public Iterator<String> iterator() {\\n\\t\\treturn _values.iterator();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d13fca4868573a1d0143416ba1d590f\",\n \"score\": \"0.45978376\",\n \"text\": \"private int getIndexOfPreviousValue(Node<T> node, T value) {\\n for (int i = 1; i < node.numberOfKeys(); i++) {\\n Key<T> t = node.getKey(i);\\n if (t.getElemento().compareTo(value) >= 0) {\\n return i - 1;\\n }\\n }\\n return node.numberOfKeys() - 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a916a1ad22637570470157564dad4c89\",\n \"score\": \"0.45951307\",\n \"text\": \"private int getIndexOfNextValue(Node<T> node, T value) {\\n for (int i = 0; i < node.numberOfKeys(); i++) {\\n Key<T> t = node.getKey(i);\\n if (t.getElemento().compareTo(value) >= 0) {\\n return i;\\n }\\n }\\n return node.numberOfKeys() - 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52b80f3175a6c92af9ffc3fccfda24f6\",\n \"score\": \"0.45870438\",\n \"text\": \"SequencesIterator iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db1faf123129979bb15a9b6d2ea534fd\",\n \"score\": \"0.45833883\",\n \"text\": \"public Iterator<Node<V>> iterator( Interval interval )\\n\\t{\\n\\t\\treturn new FwdIterator(min(interval.getStart(),interval.getEnd()));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb4b7e9676fdb3751330385e017c893c\",\n \"score\": \"0.45750493\",\n \"text\": \"public Iterator nodes(Object composite);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf1d90a48ace967e99c86c64d0583d85\",\n \"score\": \"0.45599526\",\n \"text\": \"public Iterator iterator()\\n {\\n return this.tuples.values( ).iterator( );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4961f96fd43a3e1caedd2467d236a0e8\",\n \"score\": \"0.45597723\",\n \"text\": \"public LocalValueEnumerator GetLocalValueEnumerator() \\r\\n {\\r\\n // Do not allow foreign threads access. \\r\\n // (This is a noop if this Object is not assigned to a Dispatcher.) \\r\\n //\\r\\n this.VerifyAccess(); \\r\\n\\r\\n int effectiveValuesCount = EffectiveValuesCount;\\r\\n LocalValueEntry[] snapshot = new LocalValueEntry[effectiveValuesCount];\\r\\n int count = 0; \\r\\n\\r\\n // Iterate through the sorted effectiveValues \\r\\n for (int i=0; i<effectiveValuesCount; i++) \\r\\n {\\r\\n DependencyProperty dp = DependencyProperty.RegisteredPropertyList.List[_effectiveValues[i].PropertyIndex]; \\r\\n if (dp != null)\\r\\n {\\r\\n Object localValue = ReadLocalValueEntry(new EntryIndex(i), dp, false /* allowDeferredReferences */);\\r\\n if (localValue != DependencyProperty.UnsetValue) \\r\\n {\\r\\n snapshot[count++] = new LocalValueEntry(dp, localValue); \\r\\n } \\r\\n }\\r\\n } \\r\\n\\r\\n return new LocalValueEnumerator(snapshot, count);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50e4331b322b70d11b3330cfe238243a\",\n \"score\": \"0.4556994\",\n \"text\": \"public PositionIterator getPositionIterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84a68b02dc8111f79ba3101d155e726b\",\n \"score\": \"0.45513403\",\n \"text\": \"private Node<T> getNode(T value) {\\n Node<T> node = root;\\n while (node != null) {\\n Key<T> lesser = node.getKey(0);\\n if (value.compareTo(lesser.getElemento()) < 0) {\\n if (node.numberOfChildren() > 0) {\\n node = node.getChild(0);\\n } else {\\n node = null;\\n }\\n continue;\\n }\\n\\n int numberOfKeys = node.numberOfKeys();\\n int last = numberOfKeys - 1;\\n Key<T> greater = node.getKey(last);\\n if (value.compareTo(greater.getElemento()) > 0) {\\n if (node.numberOfChildren() > numberOfKeys) {\\n node = node.getChild(numberOfKeys);\\n } else {\\n node = null;\\n }\\n continue;\\n }\\n\\n for (int i = 0; i < numberOfKeys; i++) {\\n Key<T> currentValue = node.getKey(i);\\n if (currentValue.getElemento().compareTo(value) == 0) {\\n return node;\\n }\\n\\n int next = i + 1;\\n if (next <= last) {\\n Key<T> nextValue = node.getKey(next);\\n if (currentValue.getElemento().compareTo(value) < 0 && nextValue.getElemento().compareTo(value) > 0) {\\n if (next < node.numberOfChildren()) {\\n node = node.getChild(next);\\n break;\\n }\\n return null;\\n }\\n }\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70304509195eb4f3fe1e957011047c0b\",\n \"score\": \"0.45427054\",\n \"text\": \"@JsMethod\\n\\tpublic abstract NodeIterator createNodeIterator(final Node root, final double whatToShow, final NodeFilter filter,\\n\\t\\t\\tfinal boolean entityReferenceExpansion);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc15f01f95d11e49665fbcdb85dea03d\",\n \"score\": \"0.4527541\",\n \"text\": \"public Iterable<Position<E>> breadthfirst( ) {\\n \\n List<Position<E>> snapshot = new ArrayList<>( );\\n \\n if (!isEmpty( )) {\\n Queue<Position<E>> fringe = new LinkedQueue<Position<E>>( );\\n fringe.enqueue(root( ));\\n // start with the root\\n while (!fringe.isEmpty( )) {\\n Position<E> p = fringe.dequeue( );\\n // remove from front of the queue\\n snapshot.add(p);\\n // report this position\\n for (Position<E> c : children(p))\\n fringe.enqueue(c);\\n // add children to back of queue\\n }\\n }\\n return snapshot;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6d6d61d3b2200a8f6321b1d07602581\",\n \"score\": \"0.45268598\",\n \"text\": \"public Integer[] getToNodeWithValue(int searchValue) {\\n if (root.getData() == searchValue) {\\n return new Integer[]{searchValue};\\n } else {\\n List<Integer> path = new ArrayList<>();\\n root.getToNode(searchValue, path);\\n return path.toArray(new Integer[path.size()]);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54b7bc810c05ec96c8a3c206d81cc0e3\",\n \"score\": \"0.45254812\",\n \"text\": \"public Iterator values() {\\n return _values.values().iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccb8a4f56f5da3c8ce61809a1e66eb44\",\n \"score\": \"0.45247597\",\n \"text\": \"@Override\\n public Iterator<K> iterator()\\n {\\n final int MODIFICATION_COUNT = modificationCount;\\n\\n return new Iterator<K>()\\n {\\n int index, keysLeft = keyCount;\\n\\n @Override\\n public boolean hasNext()\\n {\\n if (MODIFICATION_COUNT != modificationCount) throw new ConcurrentModificationException();\\n return keysLeft != 0;\\n }\\n\\n @Override\\n public K next()\\n {\\n while (keys[index] == null || keys[index] == TOMBSTONE) index++;\\n keysLeft--;\\n return keys[index++];\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b88abd2629dea181a90427032c29306\",\n \"score\": \"0.45172945\",\n \"text\": \"@Override\\n public Iterator<T> iterator() {\\n return new Iterator<T>() {\\n AbstractStoreContainer<T> currentContainer = head;\\n int currentCounter = 0;\\n\\n @Override\\n public boolean hasNext() {\\n if (currentContainer == null) return false;\\n if (currentCounter < currentContainer.size()) return true;\\n if (currentContainer.getNext() == null) {\\n currentContainer = null;\\n currentCounter = 0;\\n return false;\\n }\\n do {\\n currentContainer = currentContainer.getNext();\\n }\\n while (currentContainer != null\\n && currentContainer.size() == 0);\\n if (currentContainer == null) return false;\\n currentCounter = 0;\\n return true;\\n }\\n\\n @Override\\n public T next() {\\n if (currentContainer != null) {\\n return currentContainer.get(currentCounter++);\\n }\\n return null;\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68de3a684272436dda721e82fa92a706\",\n \"score\": \"0.45122877\",\n \"text\": \"public Iterable<T> elements() {\\n\\t\\treturn new ValueIterable();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca31a1929301a7595930fade575eea78\",\n \"score\": \"0.45081913\",\n \"text\": \"public Iterator iterator() {\\n return new Iterator() {\\n private int cursor = 0;\\n private int lastRet = -1;\\n\\n public boolean hasNext() {\\n return cursor != size();\\n }\\n\\n public Object next() {\\n try {\\n final Object next = get(cursor);\\n lastRet = cursor++;\\n return next;\\n } catch(IndexOutOfBoundsException e) {\\n final NoSuchElementException nsee = new NoSuchElementException();\\n nsee.initCause(e);\\n throw nsee;\\n }\\n }\\n\\n public void remove() {\\n if (lastRet == -1) {\\n throw new IllegalStateException(\\\"next() must be called before remove()\\\");\\n }\\n\\n TransformedEventList.this.remove(lastRet);\\n if (lastRet < cursor) {\\n cursor--;\\n }\\n lastRet = -1;\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"330003a38f2b508aa07b4fa73d02917b\",\n \"score\": \"0.45010677\",\n \"text\": \"Iterator<E> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"330003a38f2b508aa07b4fa73d02917b\",\n \"score\": \"0.45010677\",\n \"text\": \"Iterator<E> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a373efe42a23c70aaf8f96ca6591b0c\",\n \"score\": \"0.44995368\",\n \"text\": \"public Iterator getDescendants(final Component c) {\\n List list = new ArrayList(12);\\n SwingEngine.traverse(c, list);\\n return list.iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8b5b69c12c0059e479b850edfdb85bf\",\n \"score\": \"0.44987068\",\n \"text\": \"public abstract zzbk<E> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d86f6b790cd48c4ec3652248084f2194\",\n \"score\": \"0.44931588\",\n \"text\": \"public Iterator<PartialTree> iterator() {\\n\\t\\treturn new PartialTreeListIterator(this);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ea36a536288a789c0402315d09d6d10\",\n \"score\": \"0.44829714\",\n \"text\": \"public Iterator<String> iterator() {\\n\\t\\t\\t\\treturn new RWayTrieIterator(prefix);\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3718b965c587b1d97ccfd68cc9ed6590\",\n \"score\": \"0.4475268\",\n \"text\": \"public abstract void iterate(Object value);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3e6cad09629f8e34b423970eba4a437\",\n \"score\": \"0.44710416\",\n \"text\": \"@OslcName(\\\"focusNode\\\")\\n @OslcPropertyDefinition(ShDomainConstants.SHACL_NAMSPACE + \\\"focusNode\\\")\\n @OslcOccurs(Occurs.ExactlyOne)\\n @OslcReadOnly(false)\\n public URI getFocusNode()\\n {\\n // Start of user code getterInit:focusNode\\n // End of user code\\n return focusNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"744ae99982ecf0478c124e246fa68329\",\n \"score\": \"0.44689217\",\n \"text\": \"public int getStartFromNode(int value) {\\n\\t\\tNode node = getNode(friendList, value);\\n\\t\\treturn node.getStart();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac6d7f17fdd630b2c2da9229adc24961\",\n \"score\": \"0.44678575\",\n \"text\": \"public Iterator<K> keyIterator() {\\n reap();\\n final Iterator<IdentityWeakReference> iterator = backingStore.keySet().iterator();\\n // IMPORTANT: Don't use oal.util.FilterIterator here:\\n // We need *strong* reference to current key after setNext()!!!\\n return new Iterator<K>() {\\n // holds strong reference to next element in backing iterator:\\n private Object next = null;\\n // the backing iterator was already consumed:\\n private boolean nextIsSet = false;\\n\\n @Override\\n public boolean hasNext() {\\n return nextIsSet || setNext();\\n }\\n\\n @Override\\n @SuppressWarnings(\\\"unchecked\\\")\\n public K next() {\\n if (!hasNext()) {\\n throw new NoSuchElementException();\\n }\\n assert nextIsSet;\\n try {\\n return (K) next;\\n } finally {\\n // release strong reference and invalidate current value:\\n nextIsSet = false;\\n next = null;\\n }\\n }\\n\\n @Override\\n public void remove() {\\n throw new UnsupportedOperationException();\\n }\\n\\n private boolean setNext() {\\n assert !nextIsSet;\\n while (iterator.hasNext()) {\\n next = iterator.next().get();\\n if (next == null) {\\n // the key was already GCed, we can remove it from backing map:\\n iterator.remove();\\n } else {\\n // unfold \\\"null\\\" special value:\\n if (next == NULL) {\\n next = null;\\n }\\n return nextIsSet = true;\\n }\\n }\\n return false;\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a3797999f30ce0bf468a90c12b49d99\",\n \"score\": \"0.44673106\",\n \"text\": \"@Override\\n public boolean findElement(int value) {\\n Node node = rootNode;\\n\\n while (node != null) {\\n if (value == node.getValue()) {\\n return true;\\n }\\n if (value < node.getValue()) {\\n node = node.getLeftChild();\\n } else {\\n node = node.getRightChild();\\n }\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"572cfdf3c958755cb7d01531b19cb7c4\",\n \"score\": \"0.44600046\",\n \"text\": \"@Override\\n public Iterator<T> iterator()\\n {\\n return variableIterator.iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ba501874e814bb03e8619dfc254f772\",\n \"score\": \"0.4455563\",\n \"text\": \"public Iterator<E> iterator() {\\n return new Iterator<E>() {\\n Node<E> node = head;\\n long modCount = modificationCount;\\n\\n public boolean hasNext() {\\n if (modCount != modificationCount) throw new ConcurrentModificationException(\\n \\\"Structure Modified after Iterator Creation\\\"\\n );\\n return node != null;\\n }\\n\\n public E next() {\\n E obj = node.data;\\n node = node.next;\\n return obj;\\n }\\n\\n public void remove() {\\n throw new UnsupportedOperationException();\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16c8c5643cc2a970732e920260609cec\",\n \"score\": \"0.4446679\",\n \"text\": \"public Iterator<Integer> getIterator() {\\n return sequence.iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffd891c7a119e99f3d0e200c97311c63\",\n \"score\": \"0.44396567\",\n \"text\": \"public Iterator<Map.Entry<K, V2>> entryIterator() {\\n return Iterators.transform(this.fromMap.entrySet().iterator(), Maps.asEntryToEntryFunction(this.transformer));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0cac5220bb166adfc5ed17b39b5b908\",\n \"score\": \"0.44385076\",\n \"text\": \"public T getCursor() { return isEmpty() ? null : nodes.peek().getValue(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3550d163cf3991ad711c63a08b839b41\",\n \"score\": \"0.44314724\",\n \"text\": \"@Override\\n\\tpublic Iterator<Integer> iterator() {\\n\\t\\treturn new StackIterator<Integer>(head);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f581502d1fd2e4111f34c9c3a12b0b9\",\n \"score\": \"0.44296095\",\n \"text\": \"@JsMethod\\n\\tpublic abstract NodeIterator createNodeIterator(final Node root);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18b6b864573c39f8c1b0fe5fe161e341\",\n \"score\": \"0.44279638\",\n \"text\": \"public Iterator<String> iterator() {\\n return mMap.values().iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e92e394e8cd9264feb1fdbe5bbd63d40\",\n \"score\": \"0.44236866\",\n \"text\": \"@Override\\r\\n\\tpublic Iterator<T> iterator() {\\r\\n\\t\\t//this method is outlined for you... just fill out next() and hasNext()\\r\\n\\t\\t//NO ADDITIONAL ANYTHING (METHODS, VARIABLES, ETC.) INSIDE THE ANONYMOUS CLASS\\r\\n\\t\\t//You may NOT override remove() or any other iterator methods\\r\\n\\t\\treturn new Iterator<T>() {\\r\\n\\t\\t\\t//starts at the head\\r\\n\\t\\t\\t/**\\r\\n\\t\\t\\t * current is used as a dummy head.\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\tprivate Node<T> current = head;\\r\\n\\t\\t\\tprivate Node<T> nextN;\\r\\n\\t\\t\\tprivate int counter = 0;\\r\\n\\r\\n\\t\\t\\t/**\\r\\n\\t\\t\\t * This method checks if there is a next item.\\r\\n\\t\\t\\t * It does so by simply checking if the current node is not null.\\r\\n\\t\\t\\t * The reason being is when the method next() is called, the current node will point to the next node until the end.\\r\\n\\t\\t\\t * it will return false if the current node is false.\\r\\n\\t\\t\\t * @return true if next exists, false otherwise.\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic boolean hasNext() {\\r\\n\\t\\t\\t\\t//O(1)\\r\\n\\t\\t\\t\\tboolean next = false;\\r\\n\\t\\t\\t\\tif(current != null){\\r\\n\\t\\t\\t\\t\\tnext = true;\\r\\n\\t\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t\\tnext = false;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\treturn next;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t/**\\r\\n\\t\\t\\t * This method simply returns the next item.\\r\\n\\t\\t\\t * It is important to understand that the iterator only stands between two nodes or indexes.\\r\\n\\t\\t\\t *\\r\\n\\t\\t\\t * @return the item next in the list.\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic T next() {\\r\\n\\t\\t\\t\\t//O(1)\\r\\n\\t\\t\\t\\tT temp;\\r\\n\\t\\t\\t\\tif (current == null) {\\r\\n\\t\\t\\t\\t\\tthrow new NoSuchElementException();\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t//counter++;\\r\\n\\t\\t\\t\\t\\ttemp = current.value;\\r\\n\\t\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//System.out.println(counter);\\r\\n\\t\\t\\t\\treturn temp;\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0916c1bf026d6f639f286bdf3454d09c\",\n \"score\": \"0.44226897\",\n \"text\": \"private java.util.Iterator<T> levelOrderTraversal() {\\n\\n\\t\\t final int expectedNodeCount = nodeCount;\\n\\t\\t final java.util.Queue<Node> queue = new java.util.LinkedList<>();\\n\\t\\t queue.offer(root);\\n\\n\\t\\t return new java.util.Iterator<T>() {\\n\\t\\t @Override\\n\\t\\t public boolean hasNext() {\\n\\t\\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\\n\\t\\t return root != null && !queue.isEmpty();\\n\\t\\t }\\n\\n\\t\\t @Override\\n\\t\\t public T next() {\\n\\t\\t if (expectedNodeCount != nodeCount) throw new java.util.ConcurrentModificationException();\\n\\t\\t Node node = queue.poll();\\n\\t\\t if (node.left != null) queue.offer(node.left);\\n\\t\\t if (node.right != null) queue.offer(node.right);\\n\\t\\t return node.data;\\n\\t\\t }\\n\\n\\t\\t @Override\\n\\t\\t public void remove() {\\n\\t\\t throw new UnsupportedOperationException();\\n\\t\\t }\\n\\t\\t };\\n\\t\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"144979bf1252e2ef47cc6f0b85276ac0\",\n \"score\": \"0.44161862\",\n \"text\": \"public Iterator<T> iterator(){\\n return new Iterator<T>()\\n {\\n private LNode current = head;\\n\\n public boolean hasNext(){\\n return current != null;\\n }\\n public T next(){\\n if(!hasNext()){\\n throw new NoSuchElementException();\\n }\\n T value = current.getValue();\\n current = current.getNext();\\n return value;\\n }\\n public void remove(){\\n throw new UnsupportedOperationException();\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f356300fb2ab3af226c32890ab360c9c\",\n \"score\": \"0.44119856\",\n \"text\": \"@Override\\n public Integer next() {\\n if (peekValue != null) {\\n Integer toReturn = peekValue;\\n peekValue = null;\\n return toReturn;\\n }\\n if (!iter.hasNext()) {\\n return null;\\n }\\n return iter.next();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8579543018a10d1e230a7c2dbb46bea9\",\n \"score\": \"0.44098204\",\n \"text\": \"Iterator<Object> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2865454599442e50e3c921a149f9445f\",\n \"score\": \"0.44092295\",\n \"text\": \"@JsMethod\\n\\tpublic abstract NodeIterator createNodeIterator(final Node root, final double whatToShow);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e107d93e7c48273a8aee237ceac07a5\",\n \"score\": \"0.44025406\",\n \"text\": \"@Override\\n\\tpublic Iterator<Node> iterator(){\\n\\t\\tIterator<Node> it = new Iterator<Node>(){\\n\\t\\t\\t\\n\\t\\t\\tprivate int currentIndex;\\n\\n\\t\\t\\t@Override\\n\\t\\t\\t/**Method to see if the iterator has a next value.\\n\\t\\t\\t * @return Returns true or false if the hashtable has another node.\\n\\t\\t\\t */\\n\\t\\t\\tpublic boolean hasNext() {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\treturn currentIndex < sizeOfArray;\\n\\t\\t\\t}\\n\\t\\t\\t/**Method for getting the next node.\\n\\t\\t\\t * @return returns a Node in the Hashtable.\\n\\t\\t\\t */\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic Node next() {\\n\\t\\t\\t\\treturn nodeArray[currentIndex++];\\n\\t\\t\\t}\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void remove() {\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\treturn it;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f7e010dc084c03e98fb57cd20d9d8b5\",\n \"score\": \"0.44018084\",\n \"text\": \"public Iterator iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dd16f03b0fc86f5edebe90e1bb35ffe\",\n \"score\": \"0.44004977\",\n \"text\": \"public Iterator<Map.Entry<K, V>> entryIterator() {\\n return Maps.asMapEntryIterator(this.set, this.function);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f77e3fa373b60003a48d8fc0eebee5b9\",\n \"score\": \"0.43992388\",\n \"text\": \"@Override\\r\\n public Iterator<List<Operand<?>>> iterator() {\\r\\n\\r\\n if (!tf.scope().env().isEager()) {\\r\\n throw new UnsupportedOperationException(\\r\\n \\\"Cannot iterate through a \\\" + \\\"dataset in graph mode.\\\");\\r\\n }\\r\\n\\r\\n DatasetIterator iterator = makeOneShotIterator();\\r\\n\\r\\n return new Iterator<List<Operand<?>>>() {\\r\\n private DatasetOptional nextOptional = iterator.getNextAsOptional();\\r\\n\\r\\n @Override\\r\\n public boolean hasNext() {\\r\\n return nextOptional.hasValue().data().getBoolean();\\r\\n }\\r\\n\\r\\n @Override\\r\\n public List<Operand<?>> next() {\\r\\n List<Operand<?>> result = nextOptional.getValue();\\r\\n nextOptional = iterator.getNextAsOptional();\\r\\n return result;\\r\\n }\\r\\n };\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"606d457daebd487d178d228b834511c5\",\n \"score\": \"0.439735\",\n \"text\": \"public Iterable<T> forwardIterator()\\n {\\n return variableIterator.forwardIterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80df198e4e1e6a83bc207a2e7820f870\",\n \"score\": \"0.43940446\",\n \"text\": \"public Iterator<E> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80df198e4e1e6a83bc207a2e7820f870\",\n \"score\": \"0.43940446\",\n \"text\": \"public Iterator<E> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80df198e4e1e6a83bc207a2e7820f870\",\n \"score\": \"0.43940446\",\n \"text\": \"public Iterator<E> iterator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6c2aab2e1706d7a1c64cd951db65018\",\n \"score\": \"0.4390991\",\n \"text\": \"public Iterator<T> iterator() {\\r\\n return new ForwardDequeIterator<T>(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3cef6074d6f3255337cb2b5ec8aade8\",\n \"score\": \"0.43787694\",\n \"text\": \"public Tree<V> next() {\\n Tree<V> result = position;\\n if (!position.isLeaf()) {\\n position = position.firstChild();\\n } else if (position.hasNextSibling()) {\\n position = position.nextSibling();\\n } else {\\n do {\\n position = position.parent();\\n } while (!position.hasNextSibling() && position != limit);\\n if (position == limit) {\\n position = null;\\n } else {\\n position = position.nextSibling();\\n }\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79db2dc564f8a1069f287328d6cfaf9d\",\n \"score\": \"0.43773192\",\n \"text\": \"@Override\\r\\n public Iterator iterator() {\\r\\n return new LinkedStackIterator();\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":20,"numItemsPerPage":100,"numTotalItems":995064,"offset":2000,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3ODg2ODY2Mywic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzg4NzIyNjMsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.QhS2sI4WxXgnT5whMvHCC2wbAd35YjLTpXrgOdS2dP11MKtEgj6WURf8uQXsaJpm3pGkH4o_kCU7r_CnkJUICg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":995064,"numBytesParquet":17569818855}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query_id stringlengths 32 32 | query stringlengths 7 129k | positive_passages listlengths 1 1 | negative_passages listlengths 88 101 |
|---|---|---|---|
5da8c54902a1cd356afac54d1f2eec70 | / / / / / / / / | [
{
"docid": "c20d7a60cf3cd3e942ad96167e521342",
"score": "0.0",
"text": "public int getXTranslate() {\n/* 273 */ return this.xtranslate;\n/* */ }",
"title": ""
}
] | [
{
"docid": "c4e34c80d133071eef375083d1e10433",
"score": "0.5237768",
"text": "public void findPath()\r\n\t{\r\n\t\tBinaryHeap openlist = new BinaryHeap(XmultY);\r\n\t\tArrayList<Integer> closedlist = new ArrayList<Integer>();\r\n\t\tfor(int i=0; i<XmultY; i++) {closedlist.add(0);}\r\n\t\tint currentTile... |
8f1bd922492f29d28d8302384fce9467 | This method shuts down all the threads | [
{
"docid": "7210c9bba14d26820b2291441fb124f7",
"score": "0.6403817",
"text": "public static void shutDownSchedulers() {\n if (mExecutor != null) {\n mExecutor.shutdown();\n }\n }",
"title": ""
}
] | [
{
"docid": "692996010ce7699b4a2779eda78a6d3f",
"score": "0.80003214",
"text": "private static void shutDownAll(){\n\n /**\n * shutdown pictures download threads pool.\n * */\n ThreadPools.getInstance().shutDown();\n }",
"title": ""
},
{
"docid": "285aba4b89d6... |
78e7c372b3c080b5a5bdecbd7850c9e3 | Copy the current onetimepassword to the clipboard. This is a callback for onclick on the password TextView. | [
{
"docid": "311835a4b0b9ac66e99fcaf54d2ed420",
"score": "0.7599063",
"text": "@SuppressLint(\"NewApi\")\n\tpublic void copyToClipboard(View view) {\n\t\t// Gets a handle to the clipboard service.\n\t\tClipboardManager cm = (ClipboardManager) getSystemService(CLIPBOARD_SERVICE);\n\t\tcm.setText(otpView.g... | [
{
"docid": "f4a99a9044b46328dbc7a8281d59aa01",
"score": "0.6910979",
"text": "@SuppressWarnings(\"deprecation\")\n\tprivate void copyToClipboard(String text) {\n\t\tObject clipboardManager = mContext.getSystemService(Context.CLIPBOARD_SERVICE);\n\t\t\t\t\t\n\t\t// If it is an instance of the ClipboardMa... |
a171d9eb7ea7d4c01f1a5eea88dcf7a6 | TODO: Parallelize this in a forkjoin approach | [
{
"docid": "d94d19ce222b67e0a63ccf9f710afa65",
"score": "0.0",
"text": "public void reduce(Text key, Iterable<PatientObservationFact> values, Context context) throws IOException, InterruptedException {\n\t\tboolean matches = true;\n\t\tfor(I2B2QueryPanel panel : query.getPanels()) {\n\t\t\tmatches = pan... | [
{
"docid": "73f3bb6981fb7404ffcdb3b8fa514cf8",
"score": "0.57401913",
"text": "ArrayList<Long> factorizeParaRun(long num) {\n\tbwait = new CyclicBarrier(q + 1);\n\tbfinish = new CyclicBarrier(q + 1);\n int numberOfPrimes = countAllPrimes();\n int startpoint, stoppoint;\n int primeSum = 0;\n ArrayLis... |
2a18175e5311eb0835077e8053908a49 | when we create a campaign, we need to get the specific map with the name of Stirng | [
{
"docid": "064101aebc6c5429bdcfd91924e9604e",
"score": "0.0",
"text": "public Matrix loadMap2(ArrayList<Matrix> allMaps, String string) throws IOException{\n\t\tfor(Matrix matrix: allMaps)\n\t\t{\n\t\t\tif(matrix.getName().equals(string)){\n\t\t\t\tnewMatrix = matrix;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\t... | [
{
"docid": "382bee6e5b323d5b4bdba5d6b4a0bdb8",
"score": "0.5872159",
"text": "String getMapId();",
"title": ""
},
{
"docid": "297185a35a8ee44e722803536be24ae4",
"score": "0.58584505",
"text": "String getMapName();",
"title": ""
},
{
"docid": "aef6cbba140a74e26afd98684a862... |
f388b7351de91ceced98e07bad0e8afe | Returns the type registration data at the index | [
{
"docid": "e39013d949b2990224085d2467295b3c",
"score": "0.5907431",
"text": "public TypeSpecification getTypeData(int I) {\n\t\t\treturn ((I < 0) || (I > this.TypeRegistrationDatas.size()))?null:this.TypeRegistrationDatas.get(I);\n\t\t}",
"title": ""
}
] | [
{
"docid": "46bab8b75c1309880f7e7fc0e6fcf2d3",
"score": "0.7352221",
"text": "public int getType(int index) {\n\treturn(type[index]);\n }",
"title": ""
},
{
"docid": "df3b6d1ba17be0ce575d5b758cbde193",
"score": "0.6864087",
"text": "public int getType(int index) {\n return ... |
9526c738bceb750d84ec28be8d294843 | Called when another activity is taking focus. | [
{
"docid": "bd3df72ad59b4679e3b46d3e7a0bfb8e",
"score": "0.0",
"text": "@Override\n protected void onPause() {\n super.onPause();\n Log.d(msg, \"The onPause() event\");\n }",
"title": ""
}
] | [
{
"docid": "61c9cc91b0b811d9908eb1d59116f24e",
"score": "0.69760025",
"text": "public void onLoseFocus() {\n\t}",
"title": ""
},
{
"docid": "62b50a64eed9a67885e7840fd982fca7",
"score": "0.6722185",
"text": "public void requestFocus() { getWindow().requestFocus(); }",
"title": ""... |
4e006e82036a02580269bea868c340ef | Subclasses should override this to process the container in its specific way. | [
{
"docid": "443f6e51911ecf4f548529a2e9d201b6",
"score": "0.0",
"text": "protected abstract void process(IdentificationRequest request,\n ContainerSignatureMatchCollection matches) throws IOException;",
"title": ""
}
] | [
{
"docid": "9e8629ced62a55ad1be791787c89f9d2",
"score": "0.6278673",
"text": "@Override\r\n\tpublic void process() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "db3bc7f76676daedaca874e55778e2fd",
"score": "0.6175998",
"text": "public void process(EntityContainer entityContainer) {\n\t\... |
c7d870fec3a7d66563f0aec4bed0d53b | Filter specific bunny ideas from the list of bunnies. | [
{
"docid": "2aae6645d86d278a093425d9cc60a1d2",
"score": "0.76495147",
"text": "public static void filterBunny(String userInput, ArrayList<Bunny> bunniesList)\n throws MissingFilterOptionsException, NoFilteredItemsException, CommandInvalidException {\n\n // for returning filter options ... | [
{
"docid": "0f9879b147a357b0747c853b165b909e",
"score": "0.56697",
"text": "public void testFilterBType(){\n Habit habit = new Habit(\"adding habit\", \"for test\",new Date());\n HabitEventHistory eventHistory = new HabitEventHistory();\n ArrayList<HabitEvent> returnedEventList = ev... |
bbe0c377c9b99fe889ee3f158d217024 | Converts a QuestionCountry object to an ContentValues object | [
{
"docid": "6952c1c401b1310d8b9d541a54528485",
"score": "0.7475972",
"text": "private static ContentValues getContentValues(QuestionCountry questionCountry) {\n ContentValues values = new ContentValues();\n values.put(QuestionTable.Cols.ID, String.valueOf(questionCountry.getId()));\n ... | [
{
"docid": "10b6953313e54247e77be8f6039a45f5",
"score": "0.67249024",
"text": "private ContentValues getValues() {\n if(values == null) {\n Gson gson = new Gson();\n String json = obscuredPreferences.getString(country, null);\n this.values = (json != null) ? gson.... |
1bb7ff175b6fba47c3a9daaa7594ec25 | / return true: if handle event return false: need further processing by super() | [
{
"docid": "bcaf981518b7bcc1f954849d2b44daf1",
"score": "0.0",
"text": "@Override\n\t\t\t\t\tpublic boolean onGroupClick(ExpandableListView parent, View view, int groupPosition, long id) {\n\t\t\t\t\t\t\n\t\t\t\t\t\tList<String> list = listDataChild.get(listDataHeader.get(groupPosition));\n\t\t\t\t\t\tL... | [
{
"docid": "913a093bd0d7cb5694660774c3c60c9d",
"score": "0.7767164",
"text": "@Override\n protected boolean handle() {\n return true;\n }",
"title": ""
},
{
"docid": "e96d83a94b08212e772f5cfd9bd92049",
"score": "0.77551156",
"text": "@... |
6eb24511764ddf261389d0943ad588e7 | Provide a suitable constructor (depends on the kind of dataset) | [
{
"docid": "39c74ab75e18e98d3f40a337dcd021fd",
"score": "0.0",
"text": "public ServiceOpSearchAdapter(ArrayList<QueryDocumentSnapshot> list) {\n docList = list;\n opList = new ArrayList<>();\n for(int i = 0; i < docList.size(); i++){\n opList.add(docList.get(i).getId());\... | [
{
"docid": "210aa05adc0f7a7fae3a17f420554014",
"score": "0.71878785",
"text": "public Dataset() {\n\t\tthis(\"new\", null, null, new Globals());\n\t}",
"title": ""
},
{
"docid": "2f63ea655f0496d850019ff28251a741",
"score": "0.7069924",
"text": "public abstract Dataset initDataset();"... |
76d75b0460d4529b7cd3c243e576f6ae | Delete Recruiter By Username | [
{
"docid": "68b4f2de9c3ffc96960457091c1e580a",
"score": "0.7386237",
"text": "public abstract boolean deleteRecruiter(Recruiter recruiter);",
"title": ""
}
] | [
{
"docid": "a1847d585e8c9609acf778691f652881",
"score": "0.7402119",
"text": "void deleteUser(String username);",
"title": ""
},
{
"docid": "37e617b5c5156542fb77cd4bf8e82797",
"score": "0.7301259",
"text": "public void deleteUser(String userName);",
"title": ""
},
{
"doci... |
a147742fe3ced66dc8643ecc0dbe2e55 | Cannot assign a reference to a branch + ambiguous target hash. Expect a BAD_REQUEST error. | [
{
"docid": "fe131a561ee2b06ab2723edd3a2c0a7d",
"score": "0.7822472",
"text": "@Test\n @NessieApiVersions(versions = NessieApiVersion.V2)\n public void assignReferenceToBranchAmbiguous() {\n NessieError error =\n expectError(\n rest().body(Branch.of(\"etl2\", \"~1\")).put(\"trees/e... | [
{
"docid": "3d827cc753a513fd6314ed5e93341197",
"score": "0.7797958",
"text": "@Test\n @NessieApiVersions(versions = NessieApiVersion.V2)\n public void assignReferenceFromBranchUnambiguousExpectedHashNonExistent() {\n NessieError error = expectError(rest().body(etl1).put(\"trees/base@cafebabe~1\"), ... |
3cfb5f66e97531e52f2386bcf38aef62 | / Replace header with new name from the matching condition | [
{
"docid": "b6367c1dd2ca46600d51d2f89672d947",
"score": "0.76007247",
"text": "@SuppressWarnings(\"unchecked\")\n @Test\n public void testReplaceHeaderNewNameFromCondition() {\n try {\n String filterScript = \"require [\\\"editheader\\\", \\\"variables\\\"];\\n\"\n ... | [
{
"docid": "2b60b6095f31735b7f72fd65314c5dd2",
"score": "0.73703545",
"text": "@SuppressWarnings(\"unchecked\")\n @Test\n public void testReplaceNameOfHeader() {\n try {\n String filterScript = \"require [\\\"editheader\\\"];\\n\"\n + \" replaceheader :newname ... |
974e5d621d7c925adb57d5d2ce09a9ba | TODO add your handling code here: | [
{
"docid": "8097f0fae837b1986807ba9a47fab9b1",
"score": "0.0",
"text": "private void valorImportanciaActionPerformed(java.awt.event.ActionEvent evt) {\n }",
"title": ""
}
] | [
{
"docid": "69ade76a69c0f6c07e66b5d0e5136eb3",
"score": "0.5675384",
"text": "@Override\r\n\tpublic void grabar() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "f0705d77863f0fa7c516a99a8eca8134",
"score": "0.56071687",
"text": "private void zbudujSciezkeiRozpocznij() {\n\t\t\r\n\t}",
... |
6c3cf86ca818def6f476396d4e35b4b0 | 1. Simulation. O(1) time, because we try up to 24 60 times; O(1) space. | [
{
"docid": "655a3954f6fbc4dd90d3cb1f2a1486d6",
"score": "0.0",
"text": "public String nextClosestTime(String time) {\n\t\t// Convert the input to the amount of minutes, which is \n\t\t// the smallest unit to go. \n\t\t// Integer.parseInt() allows you to convert String \"15\" to int 15. \n\t\tint minutes... | [
{
"docid": "c6b6d64dd33be5de45d1c2f4ff559f48",
"score": "0.58564246",
"text": "@Test\n\tpublic void id630_1() throws Exception {\n\t\tString weekdayNormalHourly = String.valueOf((int) (Math.random()*100000));\n\t\tString weekdayLateNightHourly = String.valueOf((int) (Math.random()*100000));\n\t\tString ... |
d62b2689976071269eb41011dc032101 | / WARNING Removed try catching itself possible behaviour change. | [
{
"docid": "038279c1f95e59f03a72857fa39c30c0",
"score": "0.0",
"text": "@Override\n public int max() {\n Object object = this.mutex;\n // MONITORENTER : object\n // MONITOREXIT : object\n return this.list.max();\n }",
"title": ""
}
] | [
{
"docid": "311f27793dd5a5e79f6df043b4ba5e98",
"score": "0.6165016",
"text": "@Override\n\tpublic void catchChange() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "5c970a26c34eccae700bb056caa1c74f",
"score": "0.61056936",
"text": "public void testBug401088a() {\n runConformTest(new... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "26e04ae0a56e7c7ee239205fd829e272",
"score": "0.0",
"text": "@Override\n\tpublic PaypalCustomer getPaypalCustomerByPaypalId(String paypalId) {\n\t\tPersistenceManager pm = pmf.getPersistenceManager();\n\t\tpm.currentTransaction().begin();\n\t\ttry{\n\t\t\tQuery query = pm.newQuery(PaypalCusto... | [
{
"docid": "ef1b6c3f597a66c59960d73eadee6f25",
"score": "0.6904447",
"text": "private void apparence()\n\t\t{\n\n\t\t}",
"title": ""
},
{
"docid": "4862518dedb9e169c3cc620e5ebe04c5",
"score": "0.6696056",
"text": "@Override\r\n\tpublic void atura() {\n\t\t\r\n\t}",
"title": ""
... |
b843842f8abcc0a9a632e0a2e1eb459c | repeated .protocol.Block block = 1; | [
{
"docid": "d8e005b514ff10dd75ba303557e52d17",
"score": "0.0",
"text": "public org.tron.protos.Protocol.Block.Builder addBlockBuilder() {\n return getBlockFieldBuilder().addBuilder(\n org.tron.protos.Protocol.Block.getDefaultInstance());\n }",
"title": ""
}
] | [
{
"docid": "844d4034d540b612daf6026cb49f8fe6",
"score": "0.6154311",
"text": "public static interface ITepeeBlock { }",
"title": ""
},
{
"docid": "e196cf09a7f78bc0573b5bf9a7670425",
"score": "0.61522007",
"text": "public static interface IBedouinBlock { }",
"title": ""
},
{
... |
13f2e5de1452a18d4e02a00823d3a5c8 | Tweaking the image metadata to override default subsampling(4:2:0) with 4:4:4. | [
{
"docid": "b70d988a9ddb2ae71192b32be6d8f6a6",
"score": "0.72294736",
"text": "private void setJpegSubsamplingMode(IIOMetadata metadata)\n throws IIOInvalidTreeException {\n Node rootNode = metadata.getAsTree(JPEG.nativeImageMetadataFormatName);\n boolean metadataUpdated = false;\n ... | [
{
"docid": "7a109810ce649aac3497334a2ab6e94c",
"score": "0.55639225",
"text": "public JDialogSubsample( ViewUserInterface ui, ModelImage sourceImage, int subsampleSize ) {\r\n super( false );\r\n this.image = sourceImage;\r\n this.userInterface = ui;\r\n parentFrame = image.g... |
bf76099714ef6cbc610e118b1b014dab | int status = mBluetoothAdapter.getState(); | [
{
"docid": "937f30c7403ba6966b00318997fbfef3",
"score": "0.0",
"text": "public void switchStatus(boolean status) {\n bleSwitch.setChecked(status);\n if (status) {\n //scanBLE();\n }\n }",
"title": ""
}
] | [
{
"docid": "0477e3f231008cb903c989a5eefe3c5b",
"score": "0.7505084",
"text": "private void checkBTstatus()\n {\n //check that device has bluetooth and that it is turned on\n\n if(btAdapter==null)\n {\n Toast.makeText(getBaseContext(), \"Bluetooth is not supported\", To... |
9fb7e344cb30c36ec169e8552ddb478a | Gets the value of postalCodeModified | [
{
"docid": "1b1c7c9c9462377e4c50bca29fc7372e",
"score": "0.7406391",
"text": "public boolean isPostalCodeModified()\r\n\t{\r\n\t\treturn postalCodeModified;\r\n\t}",
"title": ""
}
] | [
{
"docid": "da61e86922e73843d564589f7684d0ea",
"score": "0.72794485",
"text": "public String getPostalCode() {\n return this.postalCode;\n }",
"title": ""
},
{
"docid": "da61e86922e73843d564589f7684d0ea",
"score": "0.72794485",
"text": "public String getPostalCode() {\n ... |
6a284df50a637f36f1d467449836cbf1 | / / Iterative factorial method. | [
{
"docid": "41ac688eb314a7f8349d96b266981474",
"score": "0.77447575",
"text": "public static int factorialIter(int n) {\n int result = 1;\n for (int k = 1; k <= n; k++) {\n result *= k;\n }\n return result;\n }",
"title": ""
}
] | [
{
"docid": "d283e69f9329da023385b4e62dd5914c",
"score": "0.77243793",
"text": "public void calc_factorial() {\n\t\tgetInput();\n\t\tattach(expression, 1);\n\t\t\n\t\tfor (int i=1; i<= fact; i++) {\n\t\t\t// result = result*i;\n\t\t\t\n\t\t\tif (i <= 10) {\n\t\t\t\tObjectListNode p = expression.getFirstN... |
14728eea12d30c57d90b3a4bcb909e5f | TODO Autogenerated method stub To show current date in the datepicker | [
{
"docid": "1a5decf8f392fb41f04eac5a21e8c6f3",
"score": "0.0",
"text": "@Override\n public void onClick(View v) {\n Calendar mcurrentDate = Calendar.getInstance();\n mYear = mcurrentDate.get(Calendar.YEAR);\n mMonth = mcurrentDate.get(Calendar.MONT... | [
{
"docid": "4c0b679a3ee38c69035ca91405307f74",
"score": "0.72491884",
"text": "public void setCurrentDateOnView() {\n\n //dpResult = (DatePicker) findViewById(R.id.dpResult);\n\n final Calendar c = Calendar.getInstance();\n year = c.get(Calendar.YEAR);\n month = c.get(Calenda... |
1b544633c2886b0d8ef18c775c81cd06 | / renamed from: b | [
{
"docid": "b67104c60632a21ae8dd9b534130db1c",
"score": "0.0",
"text": "public E mo3249b() {\n int i = this.f2518b;\n if (i != this.f2519c) {\n return this.f2517a[i];\n }\n throw new ArrayIndexOutOfBoundsException();\n }",
"title": ""
}
] | [
{
"docid": "a7553d4ec452d9f1207d39b9a8b2e63f",
"score": "0.6155996",
"text": "interface b {\n void a(RecyclerView.b0 b0Var);\n\n void b(RecyclerView.b0 b0Var, RecyclerView.l.c cVar, RecyclerView.l.c cVar2);\n\n void c(RecyclerView.b0 b0Var, RecyclerView.l.c cVar, RecyclerView.l.c cV... |
8c02ed4da57a49b0ea04c08caca325f9 | call "shutDownEvent" method on listeners | [
{
"docid": "185353694c3015b4c874bc5a51caf598",
"score": "0.74991184",
"text": "private void schedulerShutDownEventInternal() {\n for (EventSchedulerListener listener : eventSchedulerListeners)\n listener.shutDownEvent();\n }",
"title": ""
}
] | [
{
"docid": "5c274f14f02f571207207c591cc8aa5f",
"score": "0.750574",
"text": "public void shutdown() \n\t{\n\t ListenerManager listenerMgr = ListenerManager.GetInstance();\n listenerMgr.Unsubscribe(rlImpl);\n listenerMgr.Unsubscribe(alImpl);\n\t}",
"title": ""
},
{
"docid": "bcb13941bc... |
26aec5b4d811c61f34baf7c04796b828 | This method removes head of this queue | [
{
"docid": "f38bcf95c0557bdcf522cfe4178257d3",
"score": "0.0",
"text": "@Override\r\n public E poll() {\r\n return priQueue.poll();\r\n }",
"title": ""
}
] | [
{
"docid": "9028143cd706a6ac24233c84f51e2c3c",
"score": "0.7849836",
"text": "public void removeFirst() {\n\t\t\thead = head.next;\n\t\t\tsize--;\n\t\t}",
"title": ""
},
{
"docid": "4e6fa7e5621a15979429cbb179d357ed",
"score": "0.7468351",
"text": "public void removeFirst() {\n ... |
01887e1533ac6f8c6e5d9741ee419a6e | Returns true if field squareStatus is set (has been assigned a value) and false otherwise | [
{
"docid": "024b820157721409036ac689c0806115",
"score": "0.8479128",
"text": "public boolean isSetSquareStatus() {\n return this.squareStatus != null;\n }",
"title": ""
}
] | [
{
"docid": "64e804282103435114acd97594d00285",
"score": "0.7884341",
"text": "public boolean isSetSquareStatuses() {\n return this.squareStatuses != null;\n }",
"title": ""
},
{
"docid": "ff39ab0cdbc559ade933f97286edaac8",
"score": "0.74131477",
"text": "public boolean isSetSquar... |
0ea09b2f4079f19b5d67f9a1541504d9 | Pull an arbitrary minimal entry from the queue. | [
{
"docid": "83920c13f560876a778c384b758725be",
"score": "0.0",
"text": "public Pair<K, V> pull();",
"title": ""
}
] | [
{
"docid": "8379bed02a13cfb83f53c1206c15e0a2",
"score": "0.7151914",
"text": "public E poll(){\n if (queue.isEmpty()){\n return null;\n }\n E temp = queue.get(0);\n queue.remove(0);\n return temp;\n }",
"title": ""
},
{
"docid": "6da6609300287... |
fe6f1b8ea14394975307320199cac4aa | Returns true if at least one user is in the project with the given id. Otherwise, returns false. | [
{
"docid": "941fe60b9b857c8e515554e9bf4d6ff7",
"score": "0.68479264",
"text": "private static boolean usersInProject(Vector p_userIds, long p_projectId)\n throws Exception\n {\n boolean usersInProject = false;\n if (p_projectId > 0)\n {\n String sql = Projec... | [
{
"docid": "1483503060aec64b09ef8fe30f2a4c75",
"score": "0.7001944",
"text": "public boolean userExists(String id) {\n return getUserFromGivenId(id) != null;\n }",
"title": ""
},
{
"docid": "797725cbfaed8b128011d69df59466cc",
"score": "0.6825142",
"text": "public boolean ch... |
6b333ab38eb8461be00f2e1ae2fbbc51 | Each server can set a cronExpression for the scheduler. If the cronExpression is null, then the job is run immediately and once. Otherwise, it is added to the scheduler for immediate execution and run according to the cronExpression. | [
{
"docid": "82ff74e4f766c2207977651702fdfa98",
"score": "0.690411",
"text": "public void setCronExpression(String cronExpression) {\n\t\tthis.cronExpression = cronExpression;\n\t}",
"title": ""
}
] | [
{
"docid": "c1d0ae3713465ef8652d92ebe04a8ad0",
"score": "0.7014474",
"text": "public void setCronExpression(String cronExpression) {\r\n\t\tthis.cronExpression = cronExpression;\r\n\t}",
"title": ""
},
{
"docid": "a9559dc3d91515a4a2ae660418290b7e",
"score": "0.66124445",
"text": "Sch... |
e7392165aad9a67183290e5af885ecef | the function call timePassed() on all sprites. | [
{
"docid": "37899edbb386f666bb09d294040cd4a3",
"score": "0.8005517",
"text": "public void notifyAllTimePassed() {\n List<Sprite> sprites = new ArrayList<Sprite>(this.spriteList);\n for (Sprite sp : sprites) {\n sp.timePassed();\n }\n }",
"title": ""
}
] | [
{
"docid": "1d9419a94433538eb2cb2cbcfcacdd34",
"score": "0.7984284",
"text": "public void notifyAllTimePassed() {\r\n List<Sprite> copy = new ArrayList<>(this.sprites);\r\n for (Sprite s: copy) {\r\n s.timePassed();\r\n }\r\n }",
"title": ""
},
{
"docid": "... |
0a04ab5469745394608581ccd430de8f | / Pagamenti Quote Provider | [
{
"docid": "3d1f1c02cec7a7884715bcb8f06b2e0c",
"score": "0.0",
"text": "public QuotaAnnuale createPagamentoProviderPerQuotaAnnuale(Long providerId, Integer annoRiferimento, boolean primoAnno);",
"title": ""
}
] | [
{
"docid": "6a6cf2bf91c5c541c7d952f964ab21c7",
"score": "0.6892803",
"text": "Quote createQuote();",
"title": ""
},
{
"docid": "ee52aa6ebeb2547333677000c8f4992f",
"score": "0.6522258",
"text": "QuoteItem createQuoteItem();",
"title": ""
},
{
"docid": "0fb061104bffbec030e8... |
d91c9d007dda04d1dcd992caf597251d | checks if a specific symbol is already taken or not. | [
{
"docid": "457823c778291bfc09477ab1a4d347af",
"score": "0.6763404",
"text": "boolean isSymbolFound(String symbol);",
"title": ""
}
] | [
{
"docid": "2322de7b24154c0926d6dafe74b0dfff",
"score": "0.6914841",
"text": "public final boolean checkSymbol(final char sym) {\n\t\tif (_sym == sym) {\n\t\t\tnextSymbol();\n\t\t\treturn true;\n\t\t} else {\n\t\t\terror(XDEF.XDEF410, symToName(sym)); //'&{0}' expected\n\t\t\treturn false;\n\t\t}\n\t}",... |
8d635ed2deac9d209618d8a60d604aec | verify the required parameter 'body' is set | [
{
"docid": "16c8c4b6e78f71d4444cedc08929a69c",
"score": "0.0",
"text": "@SuppressWarnings(\"rawtypes\")\n private com.squareup.okhttp.Call purchaseShipmentValidateBeforeCall(PurchaseShipmentRequest body, final ProgressResponseBody.ProgressListener progressListener, final ProgressRequestBody.ProgressR... | [
{
"docid": "a5c9923e8c3b72c87241860d0d13aeca",
"score": "0.6652389",
"text": "public boolean needsBody() {\n\t\treturn body;\n\t}",
"title": ""
},
{
"docid": "7dd9c98d3723833dee4a3a93e471187a",
"score": "0.65817124",
"text": "public static void checkBody(String value) {\n if (... |
3cc21096b6eca779a688539d1968913e | Handle action bar item clicks here. The action bar will automatically handle clicks on the Home/Up button, so long as you specify a parent activity in AndroidManifest.xml. | [
{
"docid": "293801ef0dae6c75f2f60b5d37082116",
"score": "0.0",
"text": "@Override\n public boolean onOptionsItemSelected(MenuItem item) {\n switch (item.getItemId()) {\n case R.id.action_settings:\n return true;\n }\n return super.onOptionsItemSelected(i... | [
{
"docid": "7c8036532d9f85ff825fd1f6fa38243a",
"score": "0.78716177",
"text": "@Override\n public boolean onOptionsItemSelected(MenuItem item) {\n switch (item.getItemId()) {\n // Respond to the action bar's Up/Home button\n case android.R.id.home:\n // Lau... |
52cac5fef626096912c9428e2fafee80 | This vector rotated 180 degrees counterclockwise. Creates a new vector. | [
{
"docid": "791d2859a58e183ca60d183bfa45a773",
"score": "0.72124946",
"text": "Vec2f rotatedDegrees180();",
"title": ""
}
] | [
{
"docid": "9fdc898d1c4b3e77a7ab9b9471fb5286",
"score": "0.6942618",
"text": "Vec2f rotatedDegrees90();",
"title": ""
},
{
"docid": "e05d80a208df81ea1a1abe0214b840f8",
"score": "0.67405224",
"text": "Vec2f rotatedDegrees270();",
"title": ""
},
{
"docid": "dc4f049cb3d86526... |
b7955505f88c81a37573c575a7af038d | usado no momento de criar a LISTA_SALAS do Banco de Dados | [
{
"docid": "b7198cb3b45d7ba37c51228501ae4722",
"score": "0.0",
"text": "public void setDadosSalaDisponivel(int indicePredio, int numHorarios, int numDias);",
"title": ""
}
] | [
{
"docid": "ee02475153f56d033d4be80e91f1fec3",
"score": "0.6621432",
"text": "public Cine(List<Sala> salas){\r\n this.sala=salas;\r\n this.programaciones=new ArrayList<>();\r\n this.horariosFunciones=new ArrayList<>();\r\n }",
"title": ""
},
{
"docid": "eb3a7f4870d14534ba077287f1... |
ce6154b3f18284936d1daf5e440d2493 | parameters needed in searching book slots | [
{
"docid": "7230b711731038908c5a67abd3f225a6",
"score": "0.0",
"text": "public void searchItem(String clientEnc, String env_encoding)\n throws UnsupportedEncodingException, cwSysMessage {\n String var;\n Long temp_l;\n Boolean temp_b;\n searchItemParam = new Hashtable();... | [
{
"docid": "586816a446fa14aeb8947d08980f289f",
"score": "0.69370204",
"text": "void searchBook() {\r\n\t}",
"title": ""
},
{
"docid": "20d9251bcc610ee9490bc68eeb598fd3",
"score": "0.68758774",
"text": "void searchBook() {\n\t}",
"title": ""
},
{
"docid": "99b91d17a2cca5fc... |
e07a7564f931dbe24ff81dc25ccd1fe4 | string topic = 1; | [
{
"docid": "a9b399731a3f0deafd0190c62abf1456",
"score": "0.0",
"text": "public Builder setTopicBytes(\n com.google.protobuf.ByteString value) {\n copyOnWrite();\n instance.setTopicBytes(value);\n return this;\n }",
"title": ""
}
] | [
{
"docid": "e29908514869c448f44653772ab65b1a",
"score": "0.70488656",
"text": "String getTopic();",
"title": ""
},
{
"docid": "e29908514869c448f44653772ab65b1a",
"score": "0.70488656",
"text": "String getTopic();",
"title": ""
},
{
"docid": "e29908514869c448f44653772ab65b... |
79c72b17c402932b73501f2b62b60b9c | Takes in an entryIExample, ICategory, Userand adds it to the database. | [
{
"docid": "da9eaa4ed92c1a1843f009fe2b14f4fc",
"score": "0.0",
"text": "public Long store(IEntry e) {\n\t\treturn db.store(e);\n\t}",
"title": ""
}
] | [
{
"docid": "9139dbda758411ee3ac8276389cc6a32",
"score": "0.6144535",
"text": "void insertUser(User user);",
"title": ""
},
{
"docid": "beebe7a4f37594e6578c5a8775e68b8c",
"score": "0.61267245",
"text": "void insertUser(BlogUser user) throws DAOException;",
"title": ""
},
{
... |
2ee8c2e0fa91b0f6a65df858f0d5809b | Created by Administrator on 20160227. | [
{
"docid": "ad7e62b3cfa4be051f227b1c01010911",
"score": "0.0",
"text": "public interface UserFansService {\n String processMsg(MsgRequest msgRequest, TaskCode taskCode, String webRootPath, String webUrl);\n}",
"title": ""
}
] | [
{
"docid": "33d41636b65afa8267c9085dae3d1a2d",
"score": "0.64623415",
"text": "private void apparence() {\r\n\r\n\t}",
"title": ""
},
{
"docid": "05a606445504484958a1c21e14b7198e",
"score": "0.6263829",
"text": "@Override\r\n\tpublic void sapace() {\n\t\t\r\n\t}",
"title": ""
}... |
182cc170baba91e5b8b8e33d0cbe8ee2 | Toast.makeText(getActivity(), "button clicked", Toast.LENGTH_SHORT).show(); | [
{
"docid": "925a80f596a84ddd0ecd96c6cbbf51fd",
"score": "0.0",
"text": "public void onClick(View v) {\n \t\t\tif(isNetworkAvailable())\n \t\t\t{\n \t\t\t\t\n \t\t\tLog.d(\"internet\",\"internet\");\n \t\t\tIntent i=new Intent(getActivity(),MainActivity_coins.class);\n \t\t\tstartActivi... | [
{
"docid": "effbbe89e50ba0dfcef7efa612625b69",
"score": "0.82823575",
"text": "@Override\n\tpublic void onClick(View v) {\n\t\tToast.makeText(getActivity(), \"123\", Toast.LENGTH_SHORT).show();\n\t}",
"title": ""
},
{
"docid": "32aa1f48e5ef85f96e8894e831df811d",
"score": "0.7906878",
... |
074e8e57fbc6195306b70a895e8b1c77 | Constructor for deleting expense items using index. | [
{
"docid": "44ed3ec67bbb0e1291deaba7b5aa45b1",
"score": "0.8014023",
"text": "public DeleteExpenseCommand(int index) {\n assert index > 0 : \"Expense item number should be greater than 0\";\n this.hasCurrency = false;\n this.hasCurrency = false;\n this.hasIndex = true;\n ... | [
{
"docid": "0f9fa97963bf8854e2740ed64db882a3",
"score": "0.6583658",
"text": "public DeleteCommand(int index) {\n this.index = index;\n }",
"title": ""
},
{
"docid": "ae462194e89b04fb5fb41c1981f95ebc",
"score": "0.6476616",
"text": "void deleteWithdrawal(int index);",
"... |
067c9e7d9eea3e67c5df2f7681e48a7d | required .protoc.PageHelper pageHelper = 2; | [
{
"docid": "6ec2d0df3f99c25395c9d65f70e06a27",
"score": "0.0",
"text": "public boolean hasPageHelper() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }",
"title": ""
}
] | [
{
"docid": "05d6d5fab00dfc1c990ab16e78ad2f91",
"score": "0.74926615",
"text": "lanyotech.cn.park.protoc.CommonProtoc.PageHelperOrBuilder getPageHelperOrBuilder();",
"title": ""
},
{
"docid": "05d6d5fab00dfc1c990ab16e78ad2f91",
"score": "0.74926615",
"text": "lanyotech.cn.park.protoc.... |
3b0c68ec63f26912b3a8524241ef5f60 | Perform the test for the given matrix column (A108) and row (B61). | [
{
"docid": "da5936163b8e88cd947d1345564d16ca",
"score": "0.61122525",
"text": "public void testA108_B61() {\n test_id = getTestId(\"A108\", \"B61\", \"12\");\n\n NonRootModelElement src = selectA(\"A108\");\n\n NonRootModelElement dest = selectB(\"B61\");\n\n A_B_Action(src, ... | [
{
"docid": "2dfa92af6f3d33c89d8ab44b794c6b3d",
"score": "0.59769547",
"text": "public void testA110_B61() {\n test_id = getTestId(\"A110\", \"B61\", \"198\");\n\n NonRootModelElement src = selectA(\"A110\");\n\n NonRootModelElement dest = selectB(\"B61\");\n\n A_B_Action(src,... |
3bee523406b34203486208c3f4d48bf3 | metodo para eliminar un elemento de un diccionario (completo, con testear, falta terminar compress). | [
{
"docid": "816ec67850bb2df99811c6b6d523644c",
"score": "0.0",
"text": "public void delete(DNA key){\n int reference_page = this.getReference(key);\n ArrayList<Integer> content = this.fm.read(reference_page); this.in_counter++;\n\n if(this.debug)\n System.out.println(\"Li... | [
{
"docid": "50b59a4fe9badef0d22e74036401811c",
"score": "0.7215832",
"text": "public void eliminar();",
"title": ""
},
{
"docid": "50b59a4fe9badef0d22e74036401811c",
"score": "0.7215832",
"text": "public void eliminar();",
"title": ""
},
{
"docid": "f4124bb42e95b93cee2db3... |
99716e99daebe631ab0a87dec828a24c | Created by zhenhui on 18/4/5. | [
{
"docid": "2eefb47ccc5fcac8207957161c7fa425",
"score": "0.0",
"text": "public interface HomeView {\n}",
"title": ""
}
] | [
{
"docid": "cdf542363f5b089e84183e3d9020935f",
"score": "0.6483043",
"text": "@Override\n\t protected void ramana() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "f0705d77863f0fa7c516a99a8eca8134",
"score": "0.62076354",
"text": "private void zbudujSciezkeiRozpocznij() {\n\t\t\r\n\t}",
... |
1a3c0ea03b26ad2aab34b88815a84aa8 | accountNum, type, balance passed on constructor | [
{
"docid": "3d82e291312909bf3ccb0b91a97a119d",
"score": "0.0",
"text": "@Test\n\tpublic void shouldBeAbleToDepositFunds() {\n\t\tBankAccount underTest = new BankAccount(\"1111\", \"Checking\", 5000.05);\n\t\tunderTest.deposit(500.05);\n\t\tdouble check = underTest.getBalance();\n\t\tassertEquals(5500.10... | [
{
"docid": "c397bfa769070eec79f25fb00fb00a12",
"score": "0.8218276",
"text": "Account(String name, String accNo, String type, double balance) {\n this.name = name; //Assign values.\n this.accNo = accNo;\n this.type = type;\n this.balance = balance;\n }",
"tit... |
3f74d7c5bde69530d5dac74eacb1240e | Write a single byte to the output buffer. The parameter is actually an int, which will be truncated to a byte. | [
{
"docid": "888d02026c18f428d5fda12d2e106937",
"score": "0.6816323",
"text": "public void write(int b) throws IOException {\n checkWhetherClosed();\n try {\n buffer.put((byte)b);\n } catch (BufferOverflowException boe) {\n writeBeyond();\n ... | [
{
"docid": "f9212e2ffbb640d614ca725a6b6ce4a0",
"score": "0.7560728",
"text": "@Override\n\tpublic final void writeByte(int value) {\n\t\tensureNewDataFits(1);\n\t\tbuffer[pos] = (byte)value;\n\t\tbytesAdded(1);\n\t}",
"title": ""
},
{
"docid": "b335005749f714f29e03ddf36aed8f46",
"score":... |
40c7d2c349f238d7ea5e01b5fc34b0a4 | This method was generated by MyBatis Generator. This method corresponds to the database table x$schema_flattened_keys | [
{
"docid": "352e89f29a02a511286726b7864056f3",
"score": "0.0",
"text": "protected Criteria createCriteriaInternal() {\n Criteria criteria = new Criteria();\n return criteria;\n }",
"title": ""
}
] | [
{
"docid": "fa8ea9953a9c7d8eed03ce5e28dae799",
"score": "0.63241637",
"text": "@JsonIgnore\n\t@Override\n\tpublic String[] getKeyColumns() {\n\t\treturn keyColumns;\n\t}",
"title": ""
},
{
"docid": "50ba74351c6b2b20a10f67fcdfd44b0f",
"score": "0.5867607",
"text": "public XSchemaFlatt... |
17a5ae11de6ea94b0410d5beefcdcaea | Q1Q5 + getSumPop(): int + getTotalFinesperCap(): Map // TreeMap for order // truncated result 4 digits + getAveResMV(zipCode) : int // truncated integer (not rounded) + getAveResTLA(zipCode) : int // truncated integer (not rounded) + getTotalResMVperCap()(zipCode) : int // truncated integer (not rounded) Solution to Q1 | [
{
"docid": "eef495b2e2989bcd8858b321c4f67658",
"score": "0.49633488",
"text": "public int getSumPop() {\n\t\t// populate the popMap if haven't\n\t\tif(popMap == null || popMap.isEmpty()) {\n\t\t\tprocessPop(pops);\t\t\t\t\t\n\t\t}\n\t\tint sum = 0;\n\t\tif(popMap.size() != 0) {\n\t\t\tfor(Integer v : po... | [
{
"docid": "fc9a74bb02b1ad9a962cd900cea698b6",
"score": "0.6570776",
"text": "public TreeMap<Integer, Double> getTotalFinesperCap(){\n\t\tif (totalFinesperCap!=null) {\n\t\t // do nothing \n\t\t} else {\n\t\t// populate the popMap if haven't\n\t\tif(popMap == null || popMap.isEmpty()) {\n\t\t\tproces... |
18a4bacfb1276ed2195754a04ce2918f | This method was generated by MyBatis Generator. This method corresponds to the database table package_item | [
{
"docid": "98c82600b947fafef2baf87346c5e73c",
"score": "0.0",
"text": "public Criteria createCriteria() {\n Criteria criteria = createCriteriaInternal();\n if (oredCriteria.size() == 0) {\n oredCriteria.add(criteria);\n }\n return criteria;\n }",
"title": "... | [
{
"docid": "fd9dbeeeda35a70c08d1e2be37e2d654",
"score": "0.593883",
"text": "@Mapper\npublic interface ItemDao {\n\n String TABLE_NAME = \" `tb_item` \";\n\n String SELECT_FILED = \" `id`, `title`, `sell_point`, `price`, `num`, \" +\n \"`barcode`, `image`, `cid`, `status`, `created`, `u... |
d55ae7652a299d1a6f8cc2054f106eac | Set the value related to the column: contract_type | [
{
"docid": "ca57e5fb506d81f2c0b54cb85e0cf54a",
"score": "0.6720271",
"text": "public void setContractType (java.lang.String contractType) {\r\n\t\tthis.contractType = contractType;\r\n\t}",
"title": ""
}
] | [
{
"docid": "a91a747541bb4a15e4ebd71319d5aaa6",
"score": "0.6992147",
"text": "public void setIContractType(Char4 param){\r\n \r\n if (param != null){\r\n //update the setting tracker\r\n ... |
f32028f6a5787d3b008457bf94000a88 | A human readable message indicating details about the transition. +optional optional string message = 5; | [
{
"docid": "29c27912a5f8691472b3e99927b66399",
"score": "0.0",
"text": "public Builder clearMessage() {\n bitField0_ = (bitField0_ & ~0x00000010);\n message_ = getDefaultInstance().getMessage();\n onChanged();\n return this;\n }",
"title": ""
}
] | [
{
"docid": "8eee782f5fa1c8bd42d8cfbbaef8b493",
"score": "0.6877681",
"text": "private void emitTransitionErrorMessage(String message) {\n Rule rule = target.getAssociatedRule();\n emitError(message, rule.getLocation(), /* exitCode= */ null);\n }",
"title": ""
},
{
"docid": "34a1... |
3056e40a9ec38d5ff288c40a2eec915e | The result of a binary operation is always nonnull. | [
{
"docid": "77274866e6a8f9a4f77169f5e1961e2d",
"score": "0.0",
"text": "@Override\n public Void visitBinary(BinaryTree node, AnnotatedTypeMirror type) {\n if (type.getUnderlyingType().getKind().isPrimitive()) {\n type.replaceAnnotation(PRIMITIVE);\n } else {\n... | [
{
"docid": "4c2b1aeb6fe5557e85ca9c07e6cdbbce",
"score": "0.65132546",
"text": "public int getOpRet(){\n\t\tint r = (opRet == true? 1:0);\n\t\treturn r;\n\t}",
"title": ""
},
{
"docid": "65e1f231551e8722c3163dabd859fa86",
"score": "0.6429047",
"text": "default public BooleanCompution ... |
9e62d9b2c308b8c496d982d23e8aaaec | For JSR 223 support: see | [
{
"docid": "eb33ecffdd283b43c67b0703e7ac3746",
"score": "0.0",
"text": "public void setGlobalVariables(GlobalVariables globalVariables) {\n this.globalVariables = globalVariables;\n }",
"title": ""
}
] | [
{
"docid": "2b5de469a1d69133b229f17ffaba35d2",
"score": "0.5564696",
"text": "zzzc mo2778i();",
"title": ""
},
{
"docid": "45afb26f2b720193501013efaece8576",
"score": "0.52807313",
"text": "public java.lang.String getRequestProperty(java.lang.String r1) {\n /*\n // Can'... |
912a93a22618296c24e3f2d20fc6afe8 | Sets the value of the 'field940' field. | [
{
"docid": "de81f886759b38416e3533546b5d4213",
"score": "0.8327326",
"text": "public void setField940(java.lang.CharSequence value) {\n this.field940 = value;\n }",
"title": ""
}
] | [
{
"docid": "25910db02a64042ab22e2cbd31bbd925",
"score": "0.81918",
"text": "public com.maxpoint.cascading.avro.TestExtraLarge.Builder setField940(java.lang.CharSequence value) {\n validate(fields()[940], value);\n this.field940 = value;\n fieldSetFlags()[940] = true;\n return this; \... |
8b4da61f3582e94ff6fe9ef8f66a8187 | Get the height and width of an image (used for collision) | [
{
"docid": "a645d3ccaf63aeae7293d93213c7ef9f",
"score": "0.0",
"text": "@Override\n protected void getImageDimensions() {\n width = 64;\n height = 48;\n }",
"title": ""
}
] | [
{
"docid": "8baefea63f9b3dba4efd096137b9d62f",
"score": "0.77736264",
"text": "int getImageHeight();",
"title": ""
},
{
"docid": "3b712b967d95ddde487447f9f2d4f666",
"score": "0.7666016",
"text": "public int height() { return _image.getHeight(); }",
"title": ""
},
{
"docid... |
83ad0a4dc7b67ee3280bde0b054cc6af | repeated .org.roylance.yaorm.Task flattened_tasks = 3; | [
{
"docid": "2e1d2eca7d07e520233681a3dfad3874",
"score": "0.5967008",
"text": "java.util.List<? extends org.roylance.yaorm.TestingModel.TaskOrBuilder>\n getFlattenedTasksOrBuilderList();",
"title": ""
}
] | [
{
"docid": "d0312d9abc588586efc653f3100f7168",
"score": "0.72368914",
"text": "org.roylance.yaorm.TestingModel.Task getFlattenedTasks(int index);",
"title": ""
},
{
"docid": "c41665e0420a069f81b8cc046a35d98f",
"score": "0.657654",
"text": "org.roylance.yaorm.TestingModel.TaskOrBuilde... |
4ccb49cb19155989bc0cdccce894e6b2 | / 1192: / 1193: | [
{
"docid": "b5f3269fff52cfb341650fd26d7f1e9b",
"score": "0.0",
"text": "public void run()\r\n/* 1194: */ {\r\n/* 1195:1182 */ super.run();\r\n/* 1196:1183 */ if ((this.firstLink.isAPrimed(\"cause\")) && (this.secondLink.isAPrimed(\"cause\")) && \r\n/* 1197:1184 */ (this.first... | [
{
"docid": "1e42965b53595d0956d4b7848857dc1f",
"score": "0.5505653",
"text": "private String intIP2StringIP(int ip) {\n/* 229 */ return (ip & 0xFF) + \".\" + (ip >> 8 & 0xFF) + \".\" + (ip >> 16 & 0xFF) + \".\" + (ip >> 24 & 0xFF);\n/* */ }",
"title": ""
},
{
"docid": "30721c34732f... |
465c47fc2dcb85a845638adc9f206c3b | cmd id:0x020f required uint64 user_id = 1; | [
{
"docid": "fb3d9d9b4638765e8d8946a7732022bf",
"score": "0.0",
"text": "public Builder setUserId(long value) {\n bitField0_ |= 0x00000001;\n userId_ = value;\n onChanged();\n return this;\n }",
"title": ""
}
] | [
{
"docid": "1064b635711818b8069a90a27a733c23",
"score": "0.6687645",
"text": "public Long getUserID()\n/* */ {\n/* 64 */ return this.userID;\n/* */ }",
"title": ""
},
{
"docid": "39b01ca4728632185a04bbf6ccc7758e",
"score": "0.65477264",
"text": "java.lang.String getU... |
1aa14e77c16fe86adf2e4366a12883a0 | method getDdbiom Return the 'ddbiom' class variable as a String | [
{
"docid": "b3dbcd1692c6e16adc27a8408d2ffbea",
"score": "0.6997776",
"text": "public String getDdbiom(String s) {\n return ((ddbiom != FLOATNULL) ? new Float(ddbiom).toString() : \"\");\n }",
"title": ""
}
] | [
{
"docid": "97ebaf14d3909de3f11b2bd70caa6a1d",
"score": "0.7238703",
"text": "public float getDdbiom() {\n return ddbiom;\n }",
"title": ""
},
{
"docid": "fc9670be58b331e7dccc0383786c2194",
"score": "0.70033514",
"text": "public String getDob() {\n return dob.get();\n }... |
b02f3e9e0682aef45268c1701b22ae0f | Set the pooling support for the Geronimo Connection Manager. Geronimo provides two kinds of pool: single and partitioned. | [
{
"docid": "6cea9de49ca2629fc466756f9d25bcd1",
"score": "0.6440729",
"text": "public void setPoolingSupport(final PoolingSupport support) {\r\n\t\tthis.poolingSupport = support;\r\n\t}",
"title": ""
}
] | [
{
"docid": "6b293fc52df026f688bd85ef4583f473",
"score": "0.6130768",
"text": "public void setPoolSize(int poolSize) {\n this.poolSize = poolSize;\n }",
"title": ""
},
{
"docid": "72f9e657c21c19eff9bce2cdb72efb7e",
"score": "0.61162835",
"text": "public interface ConnectionP... |
b2701166592cb39be4776e6e7852abca | Function to retrieve list of all sales employees in database. | [
{
"docid": "d63d9f8e7de1204b3e19482b2c59a166",
"score": "0.83509356",
"text": "public static List<SalesEmployee> getAllSalesEmployees(){\n if (c == null) {\n c = getConnection();\n }\n List<SalesEmployee> salesEmployees = new ArrayList<>();\n try {\n Sta... | [
{
"docid": "b7fba7c1a5eec4de167ca93e65afcac4",
"score": "0.7918433",
"text": "public List<Employee> getAllEmployees() {\n\t\tSession session = sessionFactory.openSession();\r\n\t\tString hql = \"FROM Employee\";\r\n\t\tQuery query = session.createQuery(hql);\r\n\t\t@SuppressWarnings(\"unchecked\")\r\n\t... |
77d4fdabb2ae935d4e320088bef0eb10 | A method that is used for padding. If the number of characters is less than 15, the field will be padded. If it is bigger than 15, it will be truncated. Author of this method is Prof. Paul Bonenfant | [
{
"docid": "113555f095b283fce36715664804cbd3",
"score": "0.6223538",
"text": "public static String padName(String name) {\n if (name.length() > NAME_SIZE) {\n name = name.substring(0, NAME_SIZE);\n } else {\n String format = \"%-\" + NAME_SIZE + \"s\";\n na... | [
{
"docid": "ebc8914ad238f5ae3fd9032bf2be9751",
"score": "0.7304176",
"text": "public String pad(String num, int fieldWidth)\r\n {\r\n if (fieldWidth <= 0) // Error\r\n return num;\r\n\r\n int leadingSpaces;\r\n leadingSpaces = fieldWidth - num.length();\r\n\r\n if (leadingSpaces < 0) /... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "d941bce2c59cf1ed242473fca2cbf6c5",
"score": "0.0",
"text": "@Override\r\n public long getItemId(int position) {\n return 0;\r\n }",
"title": ""
}
] | [
{
"docid": "ffe5fe3cec40acf4b0b07ea257dfa06a",
"score": "0.6831473",
"text": "private void apparence()\r\n\t\t{\r\n\r\n\t\t}",
"title": ""
},
{
"docid": "838a915c9ea69d56cc37df198cff9cb2",
"score": "0.67589027",
"text": "@Override\n\t\t\t\tpublic void pintar() {\n\t\t\t\t\t\n\t\t\t\t... |
b54dbc580a78da9f18285406bc4a454b | Gets the pagamento stage. | [
{
"docid": "e0df0c1abffc61db2f349799f883db03",
"score": "0.84417677",
"text": "public Stage getPagamentoStage() {\n\t\t\treturn pagamentoStage;\n\t\t}",
"title": ""
}
] | [
{
"docid": "9037ab55fb90167cd93b6b882d2d575a",
"score": "0.65265894",
"text": "public String getStage() {\n return stage;\n }",
"title": ""
},
{
"docid": "8390145ab7c08c9d71cc02b60a3613c1",
"score": "0.64781845",
"text": "@Schema(required = true, description = \"Current sta... |
0386fff5882682712e9bddcf0b983345 | operations in background thread | [
{
"docid": "2e07a05ab03746834336465a46d4a19b",
"score": "0.0",
"text": "@Override\n public void onNext(Object value) {\n Log.e(TAG, \"onNext() called with: value = [\" + value + \"]\");\n }",
"title": ""
}
] | [
{
"docid": "2c39a8c4eaca7cd7e166ab0ca48e99f9",
"score": "0.7453199",
"text": "@Override\n public void run() {\n // do some background work here.\n }",
"title": ""
},
{
"docid": "46e9e254e8e5dc51b954b2d568265a26",
"score": "0.67... |
f1419cddfa8ae726a19489a0ba2d2ba7 | repeated .UnreceivedMsg.Res.Msg msg = 1; | [
{
"docid": "4d76f699eaff1d3bca93088bf06f2922",
"score": "0.0",
"text": "public Builder setMsg(\n int index, Msg value) {\n copyOnWrite();\n instance.setMsg(index, value);\n return this;\n }",
"title": ""
}
] | [
{
"docid": "9f55de1861325e80c3f4428f173075f1",
"score": "0.76763403",
"text": "UnreceivedMsg.Res getUnreceivedMsgRes();",
"title": ""
},
{
"docid": "d69171f99a686ca3ba082ffaf6020005",
"score": "0.64069337",
"text": "private void sendReceiveRes(){\n\t}",
"title": ""
},
{
"... |
225e7d911b2c7f76761c2af305064b9b | Random random = new Random(); // option 2 | [
{
"docid": "4186ce123ccf8e02ab2578fdecb9f9cc",
"score": "0.0",
"text": "public void shuffle() {\n\t\tfor (int i = 0; i < cards.size(); i++) { // you can do it from cards.size() - 1 to 0\n\t\t\t// Random random = new Random(); // option 1\n\t\t\tint j = randomSingleton.nextInt(cards.size() - i) + i;\n\t\... | [
{
"docid": "13797f15eaf71411b6c2404b2f645423",
"score": "0.77589166",
"text": "static double random() {\r\n\t\treturn Math.random();\r\n\t}",
"title": ""
},
{
"docid": "519cba7a00d22bea565351948e21c220",
"score": "0.7234053",
"text": "public Generator(){\n random = new Random(... |
660fbae18a021f82e792646a6084d98b | Detect if the floating view is collapsed or expanded. | [
{
"docid": "af5fba38494c9ef21738cdd6c9bccf1e",
"score": "0.77993935",
"text": "private boolean isViewCollapsed() {\n return mFloatingView == null || mFloatingView.findViewById(R.id.collapse_view).getVisibility() == View.VISIBLE;\n }",
"title": ""
}
] | [
{
"docid": "1828df5c688bc5307249793c7627a6c5",
"score": "0.6713036",
"text": "public boolean isLayoutExpand() {\n \t\treturn ((this.layout & LAYOUT_EXPAND) == LAYOUT_EXPAND);\n \t}",
"title": ""
},
{
"docid": "594b76446cf76b9a30a308c29651a75e",
"score": "0.64322585",
"text": "public ... |
7b33a21f34bf8ede1cee3dce1a302a8c | Returns false, if the archived data is not valid; true otherwise | [
{
"docid": "84db0ad8a0c8c0801b8f99a7da1eefc6",
"score": "0.5418052",
"text": "protected boolean isValid()\n\t{\n\t\treturn this.isValid;\n\t}",
"title": ""
}
] | [
{
"docid": "7136100d2f46f4a7b320db7469eb6c4c",
"score": "0.6435481",
"text": "public boolean isValidData() {\n\t\treturn true;\n\t}",
"title": ""
},
{
"docid": "20c0e0bd38e66dce8bed7e8a02fce335",
"score": "0.61477196",
"text": "default boolean isValidForImportArchive(FolderImportCont... |
ee44b264607b0746a4d7962e6cd24091 | / 427: / 428: | [
{
"docid": "e66142c471a0d8d03f1bafe36084000b",
"score": "0.0",
"text": "public int getNivelPorDefecto()\r\n/* 429: */ {\r\n/* 430:596 */ this.nivelPorDefecto = 0;\r\n/* 431:597 */ if (getListaNivelCuentaCombo().isEmpty()) {\r\n/* 432:598 */ addErrorMessage(getLanguageController().getM... | [
{
"docid": "a3def2258601d63c48bf6eff66c59697",
"score": "0.5919259",
"text": "public void mo12628c() {\n }",
"title": ""
},
{
"docid": "4afa01a4b454e63c281ef04c9ae86fef",
"score": "0.57282764",
"text": "void mo12463P();",
"title": ""
},
{
"docid": "1e7d3de5ceb10fff... |
2aa8957eaa70172897ef34a7601cdfde | Initialise all of the panels in GameView. | [
{
"docid": "834b7638a1ae4333b71155352c25d82b",
"score": "0.70876914",
"text": "private void createPanels(){\n this.board = createBoard();\n this.greenPanel = createGreenPanel();\n this.yellowPanel = createYellowPanel();\n this.yellowCemetery = createYellowCemetery();\n ... | [
{
"docid": "872772ee96d462c5c15cc8bb1aab6a22",
"score": "0.70283383",
"text": "@SuppressWarnings(\"serial\")\n private void initializePanels() {\n my_jframe = new JFrame();\n my_jframe.setLayout(new GridBagLayout());\n my_game_timer = new AbstractAction() {\n public void actionPerformed(f... |
9e729f8bc56bf110af1411411d62f5bc | Search by Cloud Platform .sdxsvccommon.SearchByCloudPlatform searchByCloudPlatform = 2; | [
{
"docid": "b0deac955955cf84d59f59a3f241605a",
"score": "0.7513877",
"text": "@java.lang.Override\n public com.cloudera.thunderhead.service.sdxsvccommon.SDXSvcCommonProto.SearchByCloudPlatform getSearchByCloudPlatform() {\n if (searchByCase_ == 2) {\n return (com.cloudera.thunderhead.ser... | [
{
"docid": "70822235d55a1a25954830e984ec8b89",
"score": "0.8605751",
"text": "com.cloudera.thunderhead.service.sdxsvccommon.SDXSvcCommonProto.SearchByCloudPlatform getSearchByCloudPlatform();",
"title": ""
},
{
"docid": "70822235d55a1a25954830e984ec8b89",
"score": "0.86048186",
"text... |
ff32e7b3e5d8e49c0ba906e573f0c8c9 | Returns the string value of an attribute. | [
{
"docid": "69b05b849e137bb15cd0f7ecbbb23db8",
"score": "0.0",
"text": "protected String getURIString(XMLStreamReader reader, String name) {\n return StAXHelper.getAttributeAsURIString(reader, name);\n }",
"title": ""
}
] | [
{
"docid": "a0daada131786c330b355feed1179cc4",
"score": "0.75772685",
"text": "public String getStringValueOf(String attribute) {\n\t\treturn conf.getProperty(attribute);\n\t}",
"title": ""
},
{
"docid": "a3746c6457f77aac65b3613cf786f580",
"score": "0.7543031",
"text": "java.lang.Str... |
ece5015430623531d7d10f338cd64055 | Get the session object | [
{
"docid": "1c1c05733d2593c094a244c0e9601feb",
"score": "0.0",
"text": "public static boolean replyEmail(MemberBean member, StudentEntryBean studentEntry, String body, String username, String password) {\n Properties props = new Properties();\n props.put(\"mail.smtp.host\", \"smtp.gmail.com\");\n pro... | [
{
"docid": "5971a643174f7bdaed1495badfdcb517",
"score": "0.83399016",
"text": "public static Session getSession()\n {\n return session;\n }",
"title": ""
},
{
"docid": "7de319bb13d2dd3b84bcfa27bf9b5856",
"score": "0.8194047",
"text": "public Session getUserSession();",
... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "fb0cd1164b1309dc5339e4eb370715e0",
"score": "0.0",
"text": "@Override\n public void onNothingSelected(AdapterView<?> parent) {\n\n }",
"title": ""
}
] | [
{
"docid": "b7c706d331e2b507ec0ff8404ad87dc7",
"score": "0.69742316",
"text": "@Override\r\n\t\t\tpublic void crispel() {\n\t\t\t\t\r\n\t\t\t}",
"title": ""
},
{
"docid": "76b3966c8e3f64884c4127d1a3df09a8",
"score": "0.68059677",
"text": "@Override\r\n\t\t\tpublic void maruti() {\n\t... |
960f627336d9a94764f9330189208795 | something went completely south (like no internet connection) | [
{
"docid": "1a81f0c46fafc7fa8e6fa6449c2c1e37",
"score": "0.0",
"text": "@Override\r\n public void onFailure(Call<Recipe> call, Throwable t) {\n Log.d(\"Error\", t.getMessage());\r\n }",
"title": ""
}
] | [
{
"docid": "80deff98f28200c76b0f5a5a7962d181",
"score": "0.62935174",
"text": "private void internetCheck() {\n NoNet.monitor(this)\n .poll()\n .snackbar();\n }",
"title": ""
},
{
"docid": "fcf4e4c571ad4ff3eb57856383a6e4b3",
"score": "0.6292889",
... |
3e411c1aaf1e07600b608bd52cc7f2e9 | Handle navigation view item clicks here. | [
{
"docid": "99c29cc5c60e27088ce9e7256c7e1679",
"score": "0.0",
"text": "@SuppressWarnings(\"StatementWithEmptyBody\")\n @Override\n public boolean onNavigationItemSelected(MenuItem item) {\n int viewId = item.getItemId();\n Fragment fragment = null;\n String title = getString(... | [
{
"docid": "31e747c60e29111e9a3bbd193bd4ee26",
"score": "0.7226646",
"text": "@Override\n public void onClick(View view) {\n listener.onItemClick(fragmentPoint);\n }",
"title": ""
},
{
"docid": "e0add0a97018cb0ceba2b80f2f797e12",
"score": "0.7168989",... |
92b82f009168d35b51151ce9f7d58031 | Very conservative algorithm for now | [
{
"docid": "40a004ccd64c6fd9e12f326459e7e0ae",
"score": "0.0",
"text": "public boolean isReversible(ShapesGraph shapesGraph) {\n\t\treturn input == null && !isMaybeInferred(shapesGraph) && jenaPath == null;\n\t}",
"title": ""
}
] | [
{
"docid": "c5072843230bb89e864dbf64c85f228a",
"score": "0.59872776",
"text": "static void compute() {\n Queue<Integer> q = new ArrayDeque<Integer>();\n for(int i = 0; i < N; i++) {\n if(in_degree[i] == 0) {\n q.add(i);\n }\n }\n\n while(!... |
8875569b26a25d6e8f4ddb257f3023b7 | Touches all Strimzi custom resources of given kind to make sure they are stored under the new version. It is using the replace command to make sure this happens. | [
{
"docid": "c461c9c03cfdd728b95b35d0e8807047",
"score": "0.6241953",
"text": "@SuppressWarnings({\"unchecked\"})\n private <R extends CustomResource, L extends CustomResourceList<R>> void storeCrsUnderNewVersionForKind(String kind) {\n MixedOperation<R, L, ?> op = VERSIONED_OPERATIONS.get(kind... | [
{
"docid": "7b9da0e5b493c4845156eda50d421146",
"score": "0.6633648",
"text": "@SuppressWarnings({\"rawtypes\", \"unchecked\"})\n protected CustomResource replace(String kind, CustomResource cr) {\n MixedOperation<CustomResource, CustomResourceList, ?> op = VERSIONED_OPERATIONS.get(kind).apply(... |
121c3fac3ba0f7bc4ac17e42028baf1d | /////// GET RULES ///////// | [
{
"docid": "871ba20ba78345acfc0587ac29cc9a0f",
"score": "0.0",
"text": "@RequestMapping(value = \"/rules/{id}\", method = RequestMethod.POST) \n\tpublic @ResponseBody ResponseEntity<Rule> addClusterRule(@PathVariable(\"id\") String id, @RequestBody Rule rule) {\n\t\t\n\t\t// Validate parameters\n\t\tif(... | [
{
"docid": "5a7d01b5c19318a7d115958842a35be7",
"score": "0.6271023",
"text": "Rules getRules();",
"title": ""
},
{
"docid": "865a6dfab3cee321daa5a5b813b5056a",
"score": "0.6138802",
"text": "private Rules() {\n\t\t}",
"title": ""
},
{
"docid": "1ae154b6a54c3630b7deb01a201... |
be6c1046d7f5cb6936d2c6c6ad9c1752 | Take user's guess, turn into Character object, store in Character ArrayList. | [
{
"docid": "3b8b6a9205abac33741b5ccc61b0e209",
"score": "0.6483979",
"text": "public static ArrayList<Character> allGuesses(char c, ArrayList<Character> a) {\n // Converting the char to Character object.\n Character userGuess = new Character(c);\n\n // Boolean used to help figure ou... | [
{
"docid": "6ee7d1712c7dbae0bba6765410e7f17e",
"score": "0.6635521",
"text": "@Override\n\tpublic Set<String> makeGuess(char guess) throws GuessAlreadyMadeException \n\t{\n\t\t//boolean duplicate = false; //I can't remeber why I am creating this\n\t\tString guessed = Character.toString(guess);\n\t\tif(... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "c80ba21c29b7feaad9b21c92524ec8ac",
"score": "0.0",
"text": "public void addNextBtnListener(ActionListener listenForNextBtn) {\n\t\n\t\tnextBtn.addActionListener(listenForNextBtn);\n\t}",
"title": ""
}
] | [
{
"docid": "74a4209c94e08d9f5eb0b60e580f5e04",
"score": "0.68867725",
"text": "@Override\r\n\tpublic void comit() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "b645eacb329adc01490ab5013a6c4f7f",
"score": "0.67295986",
"text": "@Override\n\t\t\tpublic void perfom() {\n\n\t\t\t}",
"t... |
ab2b886397cae432f57183cb72840183 | Sets the parcel value for this PrintDataInfo. | [
{
"docid": "dd8b1ca4d5b6c4f0abaada895e6c5b80",
"score": "0.66983557",
"text": "public void setParcel(Parcel parcel) {\r\n this.parcel = parcel;\r\n }",
"title": ""
}
] | [
{
"docid": "4346fda44c75b49844cb712396538b09",
"score": "0.58335686",
"text": "public void setParcelNumber(Long parcelNumber) {\r\n this.parcelNumber = parcelNumber;\r\n }",
"title": ""
},
{
"docid": "66a539a74de30c3765c01625ad0e4c9e",
"score": "0.58330846",
"text": "public... |
3cc21096b6eca779a688539d1968913e | Handle action bar item clicks here. The action bar will automatically handle clicks on the Home/Up button, so long as you specify a parent activity in AndroidManifest.xml. | [
{
"docid": "1a239553d1a9a50807c9256d7901f3e1",
"score": "0.0",
"text": "@Override\n public boolean onOptionsItemSelected(MenuItem item) {\n int id = item.getItemId();\n\n //noinspection SimplifiableIfStatement\n if (id == R.id.action_settings) {\n return true;\n ... | [
{
"docid": "b8e4c898e0fef512a106f88d82c2d741",
"score": "0.7730601",
"text": "@Override\n public boolean onOptionsItemSelected(MenuItem item) {\n switch (item.getItemId()) {\n case android.R.id.home:\n // up arrow in action bar clicked - goto main activity\n ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "cecafdaf1d270f5da514f86df2502090",
"score": "0.0",
"text": "@Override\n\tpublic boolean keyTyped(char character) {\n\t\treturn false;\n\t}",
"title": ""
}
] | [
{
"docid": "3d9823aba51891281b4bbd4b1818b970",
"score": "0.6671074",
"text": "@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "0b5b11f4251ace8b3d0f5ead186f7beb",
"score": "0.6567672",
"text": "@Override\n\tpublic void comer() {\n\t\t\n\t}",
"ti... |
623cd953d0808ed7d2762fbe30c50e36 | required string roomId = 1; | [
{
"docid": "a6d11bfdee88af91e51c30783951fdea",
"score": "0.61780167",
"text": "public java.lang.String getRoomId() {\n java.lang.Object ref = roomId_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ... | [
{
"docid": "e231cf7924c46d02e25b1c9864bf964d",
"score": "0.7243459",
"text": "java.lang.String getRoomId();",
"title": ""
},
{
"docid": "e231cf7924c46d02e25b1c9864bf964d",
"score": "0.7243459",
"text": "java.lang.String getRoomId();",
"title": ""
},
{
"docid": "92139bed1b... |
a83e4d0b47dec86db251ad3b7cd55068 | Class constructor assigning name, type and date to the object. | [
{
"docid": "99c96096b18a1ff9742a0ae9d7f24b66",
"score": "0.0",
"text": "public Deadline(String taskName, String date) {\n super(taskName);\n type = \"deadline\";\n this.date = date;\n }",
"title": ""
}
] | [
{
"docid": "96675e41cf283a909e8ca09c112ac9a6",
"score": "0.6576973",
"text": "public Date() {\n\t\tsuper();\n\t}",
"title": ""
},
{
"docid": "29bff5fc8cfd0e6a2680d41a6bd319cc",
"score": "0.64994055",
"text": "public Date( )\r\n {\r\n month = \"January\";\r\n da... |
1cfaa241acb7b1637cae7fbaa7fe5176 | Print the circle info | [
{
"docid": "935ddd4238265cbef1c764dd44bedf4b",
"score": "0.8144934",
"text": "public void printCircle() {\n System.out.println(\"The circle is created \" + getDateCreated()\n + \" and the radius is \" + radius);\n }",
"title": ""
}
] | [
{
"docid": "35624b5d9d152ff445093240d4a00d31",
"score": "0.82071936",
"text": "public void printCircle() {\n System.out.println(\"The circle is created \" + getDateCreated()\n + \" and the radius is \" + radius);\n }",
"title": ""
},
{
"docid": "fdc465a3d2782def1b711... |
66d4a33324aded78122f2fc044da30b6 | build the decode helper tree from the codewords | [
{
"docid": "3ef2cb2a58a7049785ea8f519f5630ee",
"score": "0.7414251",
"text": "DecodeAux make_decode_tree(){\n int top=0;\n DecodeAux t=new DecodeAux();\n int[] ptr0=t.ptr0=new int[entries*2];\n int[] ptr1=t.ptr1=new int[entries*2];\n int[] codelist=make_words(c.lengthlist, c.entries);\n\n... | [
{
"docid": "5a8e4741a15f5d9efd32cb324e7fe365",
"score": "0.62338907",
"text": "public String decode(String code, Tree tree) {\n\n StringBuilder result = new StringBuilder();\n\n Node node = _root;\n int counter = 0;\n\n for (int i = 0; i < code.length(); i++) {\n\n ... |
dad6e8d4854ca474f0079e3ad310ae18 | Returns true if the first period contains the second periods | [
{
"docid": "6257369ca6746e7a979402c61a9b6267",
"score": "0.63924384",
"text": "public static boolean containsPeriod(Date startDate1, Date endDate1, Date startDate2, Date endDate2) {\n\t\treturn DateUtils.isBeforeEquals(startDate1, startDate2) && DateUtils.isAfterEquals(endDate1, endDate2);\n\t}",
"t... | [
{
"docid": "84bb17b54f381d1ffa93c1fbf1abac2c",
"score": "0.7192509",
"text": "public boolean overlaps(Period period2)\n {\n return this.end.isLater(period2.start) && period2.end.isLater(this.start);\n }",
"title": ""
},
{
"docid": "06091579461cc87e3eb1352bb88b8d51",
"score": "0... |
d02b05adba30e78d9199eb495fb84f1e | Set the UI Type. The type of the criteria as reported in the UI. This tends to be more descriptive and useful for a user. | [
{
"docid": "9640c87bb54f7cd48885ec7cbf2e881f",
"score": "0.8021182",
"text": "public void setUiType(String uiType) {\n this.uiType = uiType;\n }",
"title": ""
}
] | [
{
"docid": "c1356f01bad86d28a090565826869184",
"score": "0.7052337",
"text": "public String getUiType() {\n return uiType;\n }",
"title": ""
},
{
"docid": "68d7717239214c04f818253dd2c9e270",
"score": "0.68226045",
"text": "public void setType (String Type);",
"title": "... |
7ad19d281489ff014d81bae1d0afc786 | Get the first dictionary provider that was load with class T and for locale. | [
{
"docid": "4b54a22b7f2fd9ce5c0e28ac2d5a2002",
"score": "0.75210077",
"text": "public <T> T getDictionaryProvider(Class<T> providerClass, Locale locale) {\n\n for (DictionaryProvider dp : getProviders()) {\n if (providerClass.isInstance(dp) && dp.isForLocale(locale)) {\n return providerCl... | [
{
"docid": "c1fa5c0f6a4050d6ed2f3b45f487467e",
"score": "0.6697195",
"text": "public <T> T getDictionaryProvider(Class<T> providerClass) {\n\n for (DictionaryProvider dp : getProviders()) {\n if (providerClass.isInstance(dp)) {\n return providerClass.cast(dp);\n }\n }\n\n retur... |
a3ddea51a6e68af36d99fd5787258f24 | = a list of values in b, separated by ", " and delimited by "[", "]" | [
{
"docid": "debd995cdc3d9286d860e5859cfe879b",
"score": "0.6345891",
"text": "public <V> String toStringB(V[] b) {\n StringBuilder resb= new StringBuilder(\"[\");\n for (int h= 0; h < b.length; h= h + 1) {\n if (h > 0) resb.append(\", \");\n resb.append(b[h]);\n ... | [
{
"docid": "4864bc6abf1d755eb12b128a29a3d4d9",
"score": "0.6044317",
"text": "public String convertStringListToString (String value[], String listDelimiter);",
"title": ""
},
{
"docid": "8753ae26e8677c973710da4b7449dc9f",
"score": "0.58222294",
"text": "public String toStringB(double... |
bbcf24d1514880f330132a1011efed12 | Helper method to binarysearch the index of a given value in an array. | [
{
"docid": "4c8a5ecc0e9b8dafcca4d75bf940b7a6",
"score": "0.7602016",
"text": "private static int indexOf(Object array, Object value) {\n if (array instanceof int[]) {\n return Arrays.binarySearch((int[]) array, (Integer) value);\n } else if (array instanceof long[]) {\n return Arrays.bin... | [
{
"docid": "cfa354ecde62f591ec6abf49e9046cb7",
"score": "0.7999843",
"text": "private static int binarySearch(int[] array, int val) {\n\t\tint i = 0;\n\t\tint j = array.length;\n\t\twhile (i < j) {\n\t\t\tint m = (i + j) / 2;\n\t\t\tif (array[m] > val) {\n\t\t\t\tj = m;\n\t\t\t} else if (array[m] == val... |
92b46b25e32629b8ff7b9dee0501f4fd | Produces an iterator of focus nodes for a given value node. This operation can only be called for node expressions where isReversible returns true and may throw an IllegalStateException otherwise. | [
{
"docid": "81245ab7103edc5faaca2c688b5286a5",
"score": "0.5240167",
"text": "ExtendedIterator<RDFNode> evalReverse(RDFNode valueNode, NodeExpressionContext context);",
"title": ""
}
] | [
{
"docid": "d4bfcae0f3f6e6f76b24a497ff4705c5",
"score": "0.5784367",
"text": "IIterator<T> getValueIterator();",
"title": ""
},
{
"docid": "78dcb8c5c1010fa64bc96fdd80ad63e7",
"score": "0.57574534",
"text": "public Iterator<Node<V>> iterator()\n\t{\n\t\treturn new FwdIterator(min());\... |