0 && go); i--)\\n { // remove element from parentMatrix\\n atualNode = parentMatrix[randomChild][i];\\n if (atualNode != randomParent) {\\n proxNode = atualNode;\\n parentMatrix[randomChild][i] = lastNode;\\n lastNode = proxNode;\\n }\\n else {\\n parentMatrix[randomChild][i] = lastNode;\\n go = false;\\n }\\n }\\n if ((childMatrix[randomParent][0] != 1) &&\\n (childMatrix[randomParent][0] != 1)) {\\n lastNode = childMatrix[randomParent][\\n childMatrix[randomParent][0] - 1];\\n go = true;\\n for (int i = (childMatrix[randomParent][0] - 1); (i > 0 &&\\n go); i--) { // remove element from childMatrix\\n atualNode = childMatrix[randomParent][i];\\n if (atualNode != randomChild) {\\n proxNode = atualNode;\\n childMatrix[randomParent][i] = lastNode;\\n lastNode = proxNode;\\n }\\n else {\\n childMatrix[randomParent][i] = lastNode;\\n go = false;\\n }\\n } // end of for\\n }\\n childMatrix[randomParent][(childMatrix[randomParent][0] - 1)] = -4;\\n childMatrix[randomParent][0]--;\\n parentMatrix[randomChild][(parentMatrix[randomChild][0] - 1)] = -4;\\n parentMatrix[randomChild][0]--;\\n }\\n }\",\n \"public boolean isChild(){\\r\\n return(leftleaf == null) && (rightleaf == null)); \\r\\n }\",\n \"public BinaryNode removeNode(BinaryNode node){\\n if(isLeaf(node)){//base case\\n BinaryNode parent = (BinaryNode) node.getParent();\\n if(parent == null){\\n root = null;\\n }\\n else{\\n parent.removeChild(node);\\n }\\n size--;\\n return parent;\\n }\\n BinaryNode lower = descendant(node);\\n promote(lower, node);\\n return removeNode(lower);\\n }\",\n \"public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {\\n TreeNode cur = root;\\n while (true) {\\n if (cur.val > p.val && cur.val > q.val) cur = cur.left;\\n else if (cur.val < p.val && cur.val < q.val) cur = cur.right;\\n else return cur;\\n }\\n}\",\n \"public boolean remove(int v) {\\n if (!isIn(v)) return false;\\n TNode t = root;\\n\\n if (v == root.element) {\\n if (t.left.right == null) {\\n root = new TNode(t.left.element, t.left.left, t.right);\\n }\\n else {\\n TNode r = t.left.right;\\n while (r.right != null) {\\n r = r.right;\\n }\\n root = new TNode(r.element, t.left, t.right);\\n r = null;\\n }\\n return true;\\n }\\n\\n while (t != null) {\\n if (v < t.element) {\\n if (t.left.element == v) {\\n if (t.left.left == null && t.left.right == null) {\\n t.left = null; // remove if leaf\\n }\\n else if (t.left.left != null && t.left.right == null) {\\n t.left = t.left.left; // make left its left subtree if no right subtree\\n }\\n else { // replace node with largest node in left subtree\\n TNode r = t.left.right;\\n while (r.right != null) {\\n r = r.right;\\n }\\n t.left = new TNode(r.element, t.left.left, t.left.right);\\n if (t.left.right.element == t.left.element) t.left.right = null;\\n }\\n return true;\\n }\\n t = t.left;\\n }\\n else {\\n if (t.right.element == v) {\\n if (t.right.left == null && t.right.right == null) {\\n t.right = null; // remove if leaf\\n }\\n else if (t.right.right != null && t.right.left == null) {\\n t.right = t.right.right; // make right its right subtree if no left subtree\\n }\\n else { // replace node with largest node in left subtree\\n TNode r = t.right.left;\\n while (r.right != null) {\\n r = r.right;\\n }\\n t.right = new TNode(r.element, t.right.left, t.right.right);\\n if (t.right.left.element == t.right.element) t.right.left = null;\\n }\\n return true;\\n }\\n t = t.right;\\n }\\n }\\n\\n return true;\\n }\",\n \"public TreeNode lowestCommonAncestor2(TreeNode root, TreeNode p, TreeNode q) {\\r\\n\\t\\t if(root == null || p == root || q == root)\\r\\n\\t return root;\\r\\n\\t \\r\\n\\t TreeNode left = lowestCommonAncestor(root.left, p, q);\\r\\n\\t TreeNode right = lowestCommonAncestor(root.right, p, q);\\r\\n\\t \\r\\n\\t if(left == null && right != null) { // both on right\\r\\n\\t return right;\\r\\n\\t }\\r\\n\\t if(right == null && left != null) { // both on left\\r\\n\\t return left;\\r\\n\\t }\\r\\n\\t if(right == null && left == null) { // not in left and right\\r\\n\\t return null;\\r\\n\\t }\\r\\n\\t return root; // right != null && left != null, one in left, one in right\\r\\n\\t }\",\n \"private boolean isLeftChild(Node curr) {\\n\\t\\tif(curr.parent.left == curr) {\\n return true;\\n } else {\\n return false;\\n }\\n\\t}\",\n \"private int left(int parent) {\\n\\t\\treturn (parent*2)+1;\\n\\t}\",\n \"private Node caseTwoChildren(Node deleteThis) {\\r\\n\\r\\n Node next = getMin(deleteThis.getRight()),\\r\\n child, parent;\\r\\n deleteThis.setKey(next.getKey());\\r\\n child = next.getRight();\\r\\n parent = next.getParent();\\r\\n if (parent.getLeft() == next) {\\r\\n parent.setLeft(child);\\r\\n } else {\\r\\n parent.setRight(child);\\r\\n }\\r\\n if (child != null) {\\r\\n child.setParent(parent);\\r\\n }\\r\\n return next;\\r\\n }\",\n \"public Node opposite(Node n) {\\n\\t if (from == n)\\n\\t\\treturn to;\\n\\t if (to == n)\\n\\t\\treturn from;\\n\\t return null;\\n\\t}\",\n \"void fixViolation(Node node){\\n\\t\\tNode parentPtr = nil;\\n\\t\\tNode grParentPtr = nil;\\n\\t\\t\\n\\t\\twhile( node != root && node.colour != \\\"Black\\\" && node.parent.colour == \\\"Red\\\" && node.parent.parent != nil){\\n\\t\\t\\t\\n\\t\\t\\tparentPtr = node.parent;\\n\\t\\t\\tgrParentPtr = node.parent.parent;\\n\\t\\t\\t//case A\\n\\t\\t\\t//parent of node is the left child of grandparent\\n\\t\\t\\tif(parentPtr == grParentPtr.left){\\n\\t\\t\\t\\tNode unclePtr = grParentPtr.right;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//case 1 \\n\\t\\t\\t\\t//Uncle is red in color\\n\\t\\t\\t\\tif(unclePtr != nil && unclePtr.colour == \\\"Red\\\"){\\n\\t\\t\\t\\t\\tgrParentPtr.colour = \\\"Red\\\";\\n\\t\\t\\t\\t\\tparentPtr.colour = \\\"Black\\\";\\n\\t\\t\\t\\t\\tunclePtr.colour = \\\"Black\\\";\\n\\t\\t\\t\\t\\tnode = grParentPtr;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t//case 2\\n\\t\\t\\t\\t\\t//of node is the right child of its parent\\n\\t\\t\\t\\t\\tif(node == parentPtr.right){\\n\\t\\t\\t\\t\\t\\trotateLeft(parentPtr);\\n\\t\\t\\t\\t\\t\\tnode = parentPtr;\\n\\t\\t\\t\\t\\t\\tparentPtr = node.parent;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//case 3\\n\\t\\t\\t\\t\\t//node is the left child of its parent left rotation is required\\n\\t\\t\\t\\t\\trotateRight(grParentPtr);\\n\\t\\t\\t\\t\\tString temp = parentPtr.colour;\\n\\t\\t\\t\\t\\tparentPtr.colour = grParentPtr.colour;\\n\\t\\t\\t\\t\\tgrParentPtr.colour = temp;\\n\\t\\t\\t\\t\\tnode = parentPtr;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//case B\\n\\t\\t\\t//parent of the node is the right child of grand parent\\n\\t\\t\\tif(parentPtr == grParentPtr.right){\\n\\t\\t\\t\\tNode unclePtr = grParentPtr.left;\\n\\t\\t\\t\\t//case 1\\n\\t\\t\\t\\t//uncle pointer is red\\n\\t\\t\\t\\tif(unclePtr != nil && unclePtr.colour == \\\"Red\\\"){\\n\\t\\t\\t\\t\\tgrParentPtr.colour = \\\"Red\\\";\\n\\t\\t\\t\\t\\tparentPtr.colour = \\\"Black\\\";\\n\\t\\t\\t\\t\\tunclePtr.colour = \\\"Black\\\";\\n\\t\\t\\t\\t\\tnode = grParentPtr;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t//case 2\\n\\t\\t\\t\\t\\t//node is the left child of its parent right rotation is required\\n\\t\\t\\t\\t\\tif(node == parentPtr.left){\\n\\t\\t\\t\\t\\t\\trotateRight(parentPtr);\\n\\t\\t\\t\\t\\t\\tnode = parentPtr;\\n\\t\\t\\t\\t\\t\\tparentPtr = node.parent;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//case 3\\n\\t\\t\\t\\t\\t//node is the right child of its parent left rotation is required\\n\\t\\t\\t\\t\\trotateLeft(grParentPtr);\\n\\t\\t\\t\\t\\tString temp = parentPtr.colour;\\n\\t\\t\\t\\t\\tparentPtr.colour = grParentPtr.colour;\\n\\t\\t\\t\\t\\tgrParentPtr.colour = temp;\\n\\t\\t\\t\\t\\tnode = parentPtr;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\troot.colour = \\\"Black\\\";\\n\\t}\",\n \"public void delete(K key)\\r\\n\\t{\\r\\n\\t\\tif(search(key) == null) \\r\\n\\t\\t{\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\tif(root == null) \\r\\n\\t\\t{\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\tBSTNode<E,K> node = root;\\r\\n\\t\\tBSTNode<E,K> child = null;\\r\\n\\t\\tBSTNode<E,K> parent1 = null;\\r\\n\\t\\tBSTNode<E,K> parent2 = null;;\\r\\n\\t\\tboolean Left = true;\\r\\n\\t\\tboolean Left2 = false;\\r\\n\\t\\tboolean found = false;\\r\\n\\t\\t\\r\\n\\t\\twhile(!found)\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(node.getKey().compareTo(key) == 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tfound = true;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if(key.compareTo(node.getKey())<=-1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(node.getLeft() != null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tparent1 = node;\\r\\n\\t\\t\\t\\t\\tnode = node.getLeft();\\r\\n\\t\\t\\t\\t\\tLeft = true;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if(key.compareTo(node.getKey()) >= 1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(node.getRight() != null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tparent1 = node;\\r\\n\\t\\t\\t\\t\\tnode = node.getRight();\\r\\n\\t\\t\\t\\t\\tLeft = false;\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tif(node.getLeft() != null && node.getRight() != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tchild = node.getRight();\\r\\n\\t\\t\\tparent2 = node;\\r\\n\\t\\t\\twhile(child.getLeft() != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tparent2 = child;\\r\\n\\t\\t\\t\\tchild = child.getLeft();\\r\\n\\t\\t\\t\\tLeft2 = true;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif(Left2)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tparent2.setLeft(child.getLeft());\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tparent2.setRight(child.getLeft());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tchild.setLeft(node.getLeft());\\r\\n\\t\\t\\tchild.setRight(node.getRight());\\r\\n\\t\\t}\\r\\n\\t\\telse if(node.getLeft() == null && node.getRight() != null)\\r\\n\\t\\t{\\r\\n\\t\\t child = node.getRight();\\r\\n\\t\\t}\\r\\n\\t\\telse if(node.getLeft() != null && node.getRight() == null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tchild = node.getLeft();\\r\\n\\t\\t}\\r\\n\\t\\telse if(node.getLeft() == null && node.getRight() == null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(Left)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tparent1.setLeft(null);\\r\\n\\t\\t\\t} \\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tparent1.setRight(null);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\tif(root == node)\\r\\n\\t\\t{\\r\\n\\t\\t\\troot = child;\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tif(Left) \\r\\n\\t\\t{\\r\\n\\t\\t\\tparent1.setLeft(child);\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tparent1.setRight(child);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public Node deleteBST(Node root, int key) {\\n if (root == null) {\\n return root;\\n }\\n if (key < root.key) {\\n root.left = deleteBST(root.left, key);\\n } else if (key > root.key) {\\n root.right = deleteBST(root.right, key);\\n } // deletes the target key node\\n else {\\n // condition if node has only one child or no child\\n if ((root.left == null) || (root.right == null)) {\\n Node temp = null;\\n if (temp == root.left) {\\n temp = root.right;\\n } else {\\n temp = root.left;\\n }\\n\\n // Condition if there's no child\\n if (temp == null) {\\n temp = root;\\n root = null;\\n // else if there's one child\\n } else\\n {\\n root = temp;\\n }\\n } else {\\n // Gets the Inorder traversal inlined with the node w/ two children\\n Node temp = minNode(root.right);\\n // Stores the inorder successor's node to this node\\n root.key = temp.key;\\n // Delete the inorder successor\\n root.right = deleteBST(root.right, temp.key);\\n }\\n }\\n // Condition if there's only one child then returns the root\\n if (root == null) {\\n return root;\\n }\\n // Gets the updated height of the BST\\n root.height = maxInt(heightBST(root.left), heightBST(root.right)) + 1;\\n int balance = getBalance(root); \\n \\n // If this node becomes unbalanced, then there are 4 cases \\n // Left Left Case \\n if (balance > 1 && getBalance(root.left) >= 0) \\n return rightRotate(root); \\n\\n // Left Right Case \\n if (balance > 1 && getBalance(root.left) < 0) \\n { \\n root.left = leftRotate(root.left); \\n return rightRotate(root); \\n } \\n\\n // Right Right Case \\n if (balance < -1 && getBalance(root.right) <= 0) \\n return leftRotate(root); \\n\\n // Right Left Case \\n if (balance < -1 && getBalance(root.right) > 0) \\n { \\n root.right = rightRotate(root.right); \\n return leftRotate(root); \\n } \\n return root;\\n\\n }\",\n \"private int pushDown(int start_index) {\\n\\t\\tif(left(start_index)<heap.size()-1 && hasTwoChildren(start_index)==false) {\\n\\t\\t\\tif(heap.get(left(start_index)).priority< heap.get(start_index).priority){\\n\\t\\t\\t\\tswap(start_index,left(start_index));\\n\\t\\t\\t\\treturn pushDown(left(start_index));\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\treturn start_index;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if (hasTwoChildren(start_index)){\\n\\t\\t\\tint priorityLeft= heap.get(left(start_index)).priority;\\n\\t\\t\\tint priorityRight= heap.get(right(start_index)).priority;\\n\\t\\t\\tint priorityParent= heap.get(start_index).priority;\\n\\t\\t\\tif(priorityLeft<=priorityRight && priorityLeft<priorityParent){\\n\\t\\t\\t\\tswap(start_index,left(start_index));\\n\\t\\t\\t\\treturn pushDown(left(start_index));\\n\\t\\t\\t}\\n\\t\\t\\telse if (priorityRight<priorityLeft && priorityRight<priorityParent) {\\n\\t\\t\\t\\tswap(start_index,right(start_index));\\n\\t\\t\\t\\treturn pushDown(right(start_index));\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\treturn start_index;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn start_index;\\n\\t\\t}\\n\\n\\t}\",\n \"private boolean hasParent(int index) {\\n return index > 1;\\n }\",\n \"private BSTnode<K> actualDelete(BSTnode<K> n, K key) {\\n\\t\\tif (n == null) {\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\n\\t\\tif (key.equals(n.getKey())) {\\n\\t\\t\\t// n is the node to be removed\\n\\t\\t\\tif (n.getLeft() == null && n.getRight() == null) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n\\t\\t\\tif (n.getLeft() == null) {\\n\\t\\t\\t\\treturn n.getRight();\\n\\t\\t\\t}\\n\\t\\t\\tif (n.getRight() == null) {\\n\\t\\t\\t\\treturn n.getLeft();\\n\\t\\t\\t}\\n\\n\\t\\t\\t// if we get here, then n has 2 children\\n\\t\\t\\tK smallVal = smallest(n.getRight());\\n\\t\\t\\tn.setKey(smallVal);\\n\\t\\t\\tn.setRight(actualDelete(n.getRight(), smallVal));\\n\\t\\t\\treturn n;\\n\\t\\t}\\n\\n\\t\\telse if (key.compareTo(n.getKey()) < 0) {\\n\\t\\t\\tn.setLeft(actualDelete(n.getLeft(), key));\\n\\t\\t\\treturn n;\\n\\t\\t}\\n\\n\\t\\telse {\\n\\t\\t\\tn.setRight(actualDelete(n.getRight(), key));\\n\\t\\t\\treturn n;\\n\\t\\t}\\n\\t}\",\n \"protected int swim(int ind) {\\n if (ind == 1) return ind;\\n\\n int curVal = heap[ind];\\n int parentInd = ind / 2;\\n int parentVal = heap[parentInd];\\n \\n if (parentVal < curVal) {\\n // move up\\n swap(ind, parentInd);\\n return swim(parentInd);\\n } else {\\n return ind;\\n }\\n }\",\n \"int solve(int p, int current) {\\n int id = getId(p, current);\\n if (p >= 0 && memo.containsKey(id)) {\\n return memo.get(id);\\n }\\n List<Integer> adjList = adj.get(current);\\n int n = adjList.size();\\n if (n == 0) {\\n throw new RuntimeException();\\n }\\n if ((n == 2 && p >= 0) || (n == 1 && p < 0)) {\\n // should cut the nodes under current\\n int ans = getDepth(p, current) - 1;\\n // System.out.println(\\\"ans(\\\" + p + \\\",\\\" + current + \\\")=\\\" + ans);\\n memo.put(id, ans);\\n return ans;\\n }\\n if (n == 1) {\\n // System.out.println(\\\"ans(\\\" + p + \\\",\\\" + current + \\\")=nochild\\\");\\n return 0;\\n }\\n int ans = Integer.MAX_VALUE;\\n\\n for (int i = 0; i < n; i++) {\\n int a = adjList.get(i);\\n if (a == p) {\\n continue;\\n }\\n for (int j = i + 1; j < n; j++) {\\n int b = adjList.get(j);\\n if (b == p) {\\n continue;\\n }\\n // try a & b combo\\n int tmp = solve(current, a);\\n tmp += solve(current, b);\\n for (int k = 0; k < n; k++) {\\n int c = adjList.get(k);\\n if (c != a && c != b && c != p) {\\n tmp += getDepth(current, c);\\n }\\n }\\n ans = Math.min(ans, tmp);\\n }\\n }\\n memo.put(id, ans);\\n // System.out.println(\\\"ans(\\\" + p + \\\",\\\" + current + \\\")=\\\" + ans);\\n return ans;\\n }\",\n \"boolean deadEnd(Node root, int min, int max) \\n{ \\n // if the root is null or the recursion moves \\n // after leaf node it will return false \\n // i.e no dead end. \\n if (root==null) \\n return false; \\n \\n // if this occurs means dead end is present. \\n if (min == max) \\n return true; \\n \\n // heart of the recursion lies here. \\n return deadEnd(root.left, min, root.data - 1)|| \\n deadEnd(root.right, root.data + 1, max); \\n}\",\n \"public Node getSuccessor(Node deleteThisNode){\\n Node successor = null;\\n Node successorParent = null;\\n Node current = deleteThisNode.right;\\n \\n while (current != null){\\n successorParent = successor;\\n successor = current;\\n current = current.left;\\n }\\n \\n // check if successor has right child (we know it does not have left)\\n // if it does, add it to the left of successor parent\\n \\n if (successor != deleteThisNode.right){\\n successorParent.left = successor.right;\\n successor.right = deleteThisNode.right;\\n }\\n \\n return successor;\\n }\",\n \"@Test\\n void removeLeaves_on3HeightLeftSpindlyTree_returnsCorrectTree() {\\n IntTree tree = new IntTree(6,\\n 5, 2,\\n 4, null, null, null,\\n 1, 3);\\n IntTreeProblems.removeLeaves(tree);\\n IntTree expected = new IntTree(6,\\n 5, null,\\n 4);\\n assertThat(tree).isEqualTo(expected);\\n }\",\n \"public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {\\n TreeNode suc = null;\\n while (root != null) {\\n if (root.val > p.val) {\\n suc = root;\\n root = root.left;\\n }\\n else {\\n root = root.right;\\n }\\n }\\n return suc;\\n }\",\n \"public boolean isRoot() { return getAncestorCount()<2; }\",\n \"TreeNode<T> getParent();\",\n \"public boolean isPreBST2(int [] arr){\\n if(arr == null || arr.length == 0)\\n return false;\\n return isPreBST_Help2(arr, 0, arr.length-1, Integer.MAX_VALUE, Integer.MIN_VALUE);\\n }\",\n \"public int inorderSuccessor(Node node, int value){\\n Node startNode = findNode(node, value);\\n if (startNode.right != null){\\n // case 1: node has right subtree: find min node in right subtree\\n return findMinValue(startNode.right);\\n } else {\\n // case 2: node has no right subtree: go to nearest ancestor for which given node would be in left subtree.\\n Node successor = null;\\n Node ancestor = node;\\n while (ancestor != startNode){\\n if (startNode.value <= ancestor.value) {\\n successor = ancestor;\\n ancestor = ancestor.left;\\n } else {\\n ancestor = ancestor.right;\\n }\\n }\\n if (successor != null){\\n return successor.value;\\n } else {\\n // successor not found, return -1.\\n return -1;\\n }\\n }\\n }\",\n \"private static boolean helper(TreeNode left, TreeNode right) {\\n \\tif(left == null || right == null){\\n \\t\\treturn left == right;\\n \\t}\\n \\tif(left.val != right.val){\\n \\t\\treturn false;\\n \\t}\\n\\t\\treturn helper(left.right,right.left) && helper(left.left,right.right);\\n\\t}\",\n \"private TSTNode<E> deleteNodeRecursion(TSTNode<E> currentNode) {\\n \\n if(currentNode == null) return null;\\n if(currentNode.relatives[TSTNode.EQKID] != null || currentNode.data != null) return null; // can't delete this node if it has a non-null eq kid or data\\n\\n TSTNode<E> currentParent = currentNode.relatives[TSTNode.PARENT];\\n\\n // if we've made it this far, then we know the currentNode isn't null, but its data and equal kid are null, so we can delete the current node\\n // (before deleting the current node, we'll move any lower nodes higher in the tree)\\n boolean lokidNull = currentNode.relatives[TSTNode.LOKID] == null;\\n boolean hikidNull = currentNode.relatives[TSTNode.HIKID] == null;\\n\\n ////////////////////////////////////////////////////////////////////////\\n // Add by Cheok. To resolve java.lang.NullPointerException\\n // I am not sure this is the correct solution, as I have not gone\\n // through this sourc code in detail.\\n if (currentParent == null && currentNode == this.rootNode) {\\n // if this executes, then current node is root node\\n rootNode = null;\\n return null;\\n }\\n // Add by Cheok. To resolve java.lang.NullPointerException\\n ////////////////////////////////////////////////////////////////////////\\n\\n // now find out what kind of child current node is\\n int childType;\\n if(currentParent.relatives[TSTNode.LOKID] == currentNode) {\\n childType = TSTNode.LOKID;\\n } else if(currentParent.relatives[TSTNode.EQKID] == currentNode) {\\n childType = TSTNode.EQKID;\\n } else if(currentParent.relatives[TSTNode.HIKID] == currentNode) {\\n childType = TSTNode.HIKID;\\n } else {\\n // if this executes, then current node is root node\\n rootNode = null;\\n return null;\\n }\\n\\n if(lokidNull && hikidNull) {\\n // if we make it to here, all three kids are null and we can just delete this node\\n currentParent.relatives[childType] = null;\\n return currentParent;\\n }\\n\\n // if we make it this far, we know that EQKID is null, and either HIKID or LOKID is null, or both HIKID and LOKID are NON-null\\n if(lokidNull) {\\n currentParent.relatives[childType] = currentNode.relatives[TSTNode.HIKID];\\n currentNode.relatives[TSTNode.HIKID].relatives[TSTNode.PARENT] = currentParent;\\n return currentParent;\\n }\\n\\n if(hikidNull) {\\n currentParent.relatives[childType] = currentNode.relatives[TSTNode.LOKID];\\n currentNode.relatives[TSTNode.LOKID].relatives[TSTNode.PARENT] = currentParent;\\n return currentParent;\\n }\\n\\n int deltaHi = currentNode.relatives[TSTNode.HIKID].splitchar - currentNode.splitchar;\\n int deltaLo = currentNode.splitchar - currentNode.relatives[TSTNode.LOKID].splitchar;\\n int movingKid;\\n TSTNode<E> targetNode;\\n \\n // if deltaHi is equal to deltaLo, then choose one of them at random, and make it \\\"further away\\\" from the current node's splitchar\\n if(deltaHi == deltaLo) {\\n if(Math.random() < 0.5) {\\n deltaHi++;\\n } else {\\n deltaLo++;\\n }\\n }\\n\\n\\tif(deltaHi > deltaLo) {\\n movingKid = TSTNode.HIKID;\\n targetNode = currentNode.relatives[TSTNode.LOKID];\\n } else {\\n movingKid = TSTNode.LOKID;\\n targetNode = currentNode.relatives[TSTNode.HIKID];\\n }\\n\\n while(targetNode.relatives[movingKid] != null) targetNode = targetNode.relatives[movingKid];\\n \\n // now targetNode.relatives[movingKid] is null, and we can put the moving kid into it.\\n targetNode.relatives[movingKid] = currentNode.relatives[movingKid];\\n\\n // now we need to put the target node where the current node used to be\\n currentParent.relatives[childType] = targetNode;\\n targetNode.relatives[TSTNode.PARENT] = currentParent;\\n\\n if(!lokidNull) currentNode.relatives[TSTNode.LOKID] = null;\\n if(!hikidNull) currentNode.relatives[TSTNode.HIKID] = null;\\n\\n // note that the statements above ensure currentNode is completely dereferenced, and so it will be garbage collected\\n return currentParent;\\n }\",\n \"public void delete(Integer data) {\\n ArrayList<Node> parents = new ArrayList<>();\\n Node nodeDel = this.root;\\n Node parent = this.root;\\n Node imBalance;\\n Integer balanceFactor;\\n boolean isLeftChild = false;\\n if (nodeDel == null) {\\n return;\\n }\\n while (nodeDel != null && !nodeDel.getData().equals(data)) {\\n parent = nodeDel;\\n if (data < nodeDel.getData()) {\\n nodeDel = nodeDel.getLeftChild();\\n isLeftChild = true;\\n } else {\\n nodeDel = nodeDel.getRightChild();\\n isLeftChild = false;\\n }\\n parents.add(nodeDel);\\n }\\n\\n if (nodeDel == null) {\\n return;\\n// delete a leaf node\\n } else if (nodeDel.getLeftChild() == null && nodeDel.getRightChild() == null) {\\n if (nodeDel == root) {\\n root = null;\\n } else {\\n if (isLeftChild) {\\n parent.setLeftChild(null);\\n } else {\\n parent.setRightChild(null);\\n }\\n }\\n }\\n// deleting a node with degree of one\\n else if (nodeDel.getRightChild() == null) {\\n if (nodeDel == root) {\\n root = nodeDel.getLeftChild();\\n } else if (isLeftChild) {\\n parent.setLeftChild(nodeDel.getLeftChild());\\n } else {\\n parent.setRightChild(nodeDel.getLeftChild());\\n }\\n } else if (nodeDel.getLeftChild() == null) {\\n if (nodeDel == root) {\\n root = nodeDel.getRightChild();\\n } else if (isLeftChild) {\\n parent.setLeftChild(nodeDel.getRightChild());\\n } else {\\n parent.setRightChild(nodeDel.getRightChild());\\n }\\n }\\n // deleting a node with degree of two\\n else {\\n Integer minimumData = minimumData(nodeDel.getRightChild());\\n delete(minimumData);\\n nodeDel.setData(minimumData);\\n }\\n parent.setHeight(maximum(height(parent.getLeftChild()), height(parent.getRightChild())));\\n balanceFactor = getBalance(parent);\\n if (balanceFactor <= 1 && balanceFactor >= -1) {\\n for (int i = parents.size() - 1; i >= 0; i--) {\\n imBalance = parents.get(i);\\n balanceFactor = getBalance(imBalance);\\n if (balanceFactor > 1 || balanceFactor < -1) {\\n if (imBalance.getData() > parent.getData()) {\\n parent.setRightChild(rotateCase(imBalance, data, balanceFactor));\\n } else\\n parent.setLeftChild(rotateCase(imBalance, data, balanceFactor));\\n break;\\n }\\n }\\n }\\n }\",\n \"private static <K extends Comparable<? super K>, V> @Nullable Node<K, V> removeAndCopy0(\\n K key, @Var Node<K, V> current) {\\n\\n @Var int comp = key.compareTo(current.getKey());\\n\\n if (comp < 0) {\\n // key < current.data\\n if (current.left == null) {\\n // Target key is not in map.\\n return current;\\n }\\n\\n // Go down leftwards, keeping a red node.\\n\\n if (!Node.isRed(current.left) && !Node.isRed(current.left.left)) {\\n // Push red to left if necessary.\\n current = makeLeftRed(current);\\n }\\n\\n // recursive descent\\n Node<K, V> newLeft = removeAndCopy0(key, current.left);\\n current = current.withLeftChild(newLeft);\\n\\n } else {\\n // key >= current.data\\n if ((comp > 0) && (current.right == null)) {\\n // Target key is not in map.\\n return current;\\n }\\n\\n if (Node.isRed(current.left)) {\\n // First chance to push red to right.\\n current = rotateClockwise(current);\\n\\n // re-update comp\\n comp = key.compareTo(current.getKey());\\n assert comp >= 0;\\n }\\n\\n if ((comp == 0) && (current.right == null)) {\\n assert current.left == null;\\n // We can delete the node easily, it's a leaf.\\n return null;\\n }\\n\\n if (!Node.isRed(current.right) && !Node.isRed(current.right.left)) {\\n // Push red to right.\\n current = makeRightRed(current);\\n\\n // re-update comp\\n comp = key.compareTo(current.getKey());\\n assert comp >= 0;\\n }\\n\\n if (comp == 0) {\\n // We have to delete current, but is has children.\\n // We replace current with the smallest node in the right subtree (the \\\"successor\\\"),\\n // and delete that (leaf) node there.\\n\\n @Var Node<K, V> successor = current.right;\\n while (successor.left != null) {\\n successor = successor.left;\\n }\\n\\n // Delete the successor\\n Node<K, V> newRight = removeMininumNodeInTree(current.right);\\n // and replace current with it\\n current =\\n new Node<>(\\n successor.getKey(),\\n successor.getValue(),\\n current.left,\\n newRight,\\n current.getColor());\\n\\n } else {\\n // key > current.data\\n // Go down rightwards.\\n\\n Node<K, V> newRight = removeAndCopy0(key, current.right);\\n current = current.withRightChild(newRight);\\n }\\n }\\n\\n return restoreInvariants(current);\\n }\",\n \"@Override\\n\\tpublic Node removeNode() {\\n\\t\\tif(isEmpty())\\n\\t\\t\\treturn null;\\n\\t\\t// BreadthFirstSearch using a queue, first in first out principle\\n\\t\\treturn frontier.removeFirst();\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60396385","0.60282964","0.59549886","0.59470344","0.5929041","0.5881228","0.58704805","0.5831419","0.58075243","0.58030146","0.57874364","0.57837915","0.5773333","0.57644385","0.57363176","0.567833","0.56563234","0.5635917","0.56310904","0.56310904","0.56299144","0.5629397","0.561067","0.5604864","0.5604468","0.5593267","0.5590262","0.55843836","0.5580578","0.55801815","0.5572295","0.55695796","0.5560451","0.5554747","0.55528414","0.55269015","0.55205536","0.5512345","0.55078214","0.5502714","0.54908293","0.5484812","0.5479639","0.546738","0.54549474","0.5437851","0.54307884","0.5426308","0.5422893","0.5415797","0.5414743","0.541272","0.54043514","0.54009753","0.5393237","0.5391479","0.53852946","0.53848886","0.5379949","0.5374544","0.5372682","0.53685015","0.5368149","0.5358308","0.53578377","0.5355036","0.5351663","0.53515327","0.5346945","0.53381187","0.53303814","0.5324987","0.53234327","0.53186035","0.53184265","0.5311686","0.5309999","0.5307445","0.530586","0.5302401","0.5300016","0.5299865","0.5292928","0.5292541","0.5291967","0.5289054","0.5288486","0.5288086","0.5286234","0.52856714","0.5284912","0.5281133","0.5275561","0.5274065","0.5260748","0.52595884","0.5258231","0.52579534","0.5252611","0.52458984","0.5245421"],"string":"[\n \"0.60396385\",\n \"0.60282964\",\n \"0.59549886\",\n \"0.59470344\",\n \"0.5929041\",\n \"0.5881228\",\n \"0.58704805\",\n \"0.5831419\",\n \"0.58075243\",\n \"0.58030146\",\n \"0.57874364\",\n \"0.57837915\",\n \"0.5773333\",\n \"0.57644385\",\n \"0.57363176\",\n \"0.567833\",\n \"0.56563234\",\n \"0.5635917\",\n \"0.56310904\",\n \"0.56310904\",\n \"0.56299144\",\n \"0.5629397\",\n \"0.561067\",\n \"0.5604864\",\n \"0.5604468\",\n \"0.5593267\",\n \"0.5590262\",\n \"0.55843836\",\n \"0.5580578\",\n \"0.55801815\",\n \"0.5572295\",\n \"0.55695796\",\n \"0.5560451\",\n \"0.5554747\",\n \"0.55528414\",\n \"0.55269015\",\n \"0.55205536\",\n \"0.5512345\",\n \"0.55078214\",\n \"0.5502714\",\n \"0.54908293\",\n \"0.5484812\",\n \"0.5479639\",\n \"0.546738\",\n \"0.54549474\",\n \"0.5437851\",\n \"0.54307884\",\n \"0.5426308\",\n \"0.5422893\",\n \"0.5415797\",\n \"0.5414743\",\n \"0.541272\",\n \"0.54043514\",\n \"0.54009753\",\n \"0.5393237\",\n \"0.5391479\",\n \"0.53852946\",\n \"0.53848886\",\n \"0.5379949\",\n \"0.5374544\",\n \"0.5372682\",\n \"0.53685015\",\n \"0.5368149\",\n \"0.5358308\",\n \"0.53578377\",\n \"0.5355036\",\n \"0.5351663\",\n \"0.53515327\",\n \"0.5346945\",\n \"0.53381187\",\n \"0.53303814\",\n \"0.5324987\",\n \"0.53234327\",\n \"0.53186035\",\n \"0.53184265\",\n \"0.5311686\",\n \"0.5309999\",\n \"0.5307445\",\n \"0.530586\",\n \"0.5302401\",\n \"0.5300016\",\n \"0.5299865\",\n \"0.5292928\",\n \"0.5292541\",\n \"0.5291967\",\n \"0.5289054\",\n \"0.5288486\",\n \"0.5288086\",\n \"0.5286234\",\n \"0.52856714\",\n \"0.5284912\",\n \"0.5281133\",\n \"0.5275561\",\n \"0.5274065\",\n \"0.5260748\",\n \"0.52595884\",\n \"0.5258231\",\n \"0.52579534\",\n \"0.5252611\",\n \"0.52458984\",\n \"0.5245421\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":34696,"cells":{"query":{"kind":"string","value":"Question 3: Diameter of Binary Tree Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. Example: TREE = [1, 2, 3, 4, 5] Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3]. Note: The length of path between two nodes is represented by the number of edges between them. [V 1 = E] true for all trees / Result Analysis: Runtime: 8 ms, faster than 15.74% of Java online submissions for Diameter of Binary Tree. Memory Usage: 36.1 MB, less than 99.80% of Java online submissions for Diameter of Binary Tree. ^^^ Why this implementation is slow? ^^^ &&& I used two recursions? Maybe I can move code here [cacheD = Math.max(cacheD, leftH + rightH);] to the static maxDepth function above? see link <a href = \" &&&"},"document":{"kind":"string","value":"public int diameter(TreeNode root) {\n if (root == null) {\n return 0;\n }\n diameter(root.left);\n diameter(root.right);\n int leftH = maxDepth(root.left);\n int rightH = maxDepth(root.right);\n cacheD = Math.max(cacheD, leftH + rightH);\n return cacheD;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private int[] diameterOfBinaryTree(Node node) {\n\n if (node.left == null && node.right == null) {\n return new int[]{1, 1};\n }\n\n int[] left = {0, 0};\n int[] right = {0, 0};\n\n if (node.left != null)\n left = diameterOfBinaryTree(node.left);\n\n if (node.right != null)\n right = diameterOfBinaryTree(node.right);\n\n\n int[] retArr = new int[2];\n int maxHeightTillNow = Math.max(left[0], right[0]);\n retArr[0] = maxHeightTillNow + 1;\n int maxTillNow = Math.max(left[1], right[1]);\n retArr[1] = left[0] + right[0] > maxTillNow ? left[0] + right[0] : maxTillNow;\n return retArr;\n }","public int diameterOfBinaryTree2(TreeNode root) {\n Height height = new Height();\n return diameterOfBinaryTree2Helper(root, height);\n }","public int height(Node tree){\n\t\tif(tree == null){\n\t\t\treturn 0;\n\t\t}\n\t\telse{\n\t\t\tint lheight = height(tree.getLeft());\n\t\t\tint rheight = height(tree.getRight());\n\t\t\t\n\t\t\t//take the branch which is longer\n\t\t\tif(lheight>rheight){\n\t\t\t\treturn (lheight+1);\n\t\t\t}\n\t\t\telse{\n\t\t\t\treturn(rheight+1);\n\t\t\t}\n\t\t}\n\t}","default int calcHeight() throws NotATreeException {\n\n int[] roots = getSources();\n\n if (roots.length == 0) {\n throw new NotATreeException();\n }\n\n class WrappedCalcLongestPath {\n private int calcLongestPath(int node, TIntList path) throws CycleDetectedException {\n\n if (!containsNode(node)) {\n throw new IllegalArgumentException(\"node \"+ node + \" was not found\");\n }\n\n if (isSink(node)) {\n return path.size()-1;\n }\n\n TIntList lengths = new TIntArrayList();\n for (int edge : getOutEdges(node)) {\n\n int nextNode = getHeadNode(edge);\n\n TIntList newPath = new TIntArrayList(path);\n newPath.add(nextNode);\n\n if (path.contains(nextNode)) {\n throw new CycleDetectedException(newPath);\n }\n\n lengths.add(calcLongestPath(nextNode, newPath));\n }\n\n return lengths.max();\n }\n }\n\n // it is ok if there are multiple roots (see example of enzyme-classification-cv where it misses the root that\n // connect children EC 1.-.-.-, EC 2.-.-.-, ..., EC 6.-.-.-)\n /*if (roots.length > 1) {\n throw new NotATreeMultipleRootsException(roots);\n }*/\n\n return new WrappedCalcLongestPath().calcLongestPath(roots[0], new TIntArrayList(new int[] {roots[0]}));\n }","private static int heightOfTree(Tree tree) {\n\n if(tree == null){\n return 0;\n }\n int leftHeight = 0;\n if(tree.left!=null){\n leftHeight = heightOfTree(tree.left);\n }\n int rightHeight = 0;\n if(tree.right!=null){\n rightHeight = heightOfTree(tree.right);\n }\n return (Math.max(leftHeight, rightHeight))+1;\n\n }","public int diameterOfBinaryTree(TreeNode root) {\n return helper(root).diameter;\n }","int computeHeight() {\n Node<Integer>[] nodes = new Node[parent.length];\n for (int i = 0; i < parent.length; i++) {\n nodes[i] = new Node<Integer>();\n }\n int rootIndex = 0;\n for (int childIndex = 0; childIndex < parent.length; childIndex++) {\n if (parent[childIndex] == -1) {\n rootIndex = childIndex;\n } else {\n nodes[parent[childIndex]].addChild(nodes[childIndex]);\n }\n }\n return getDepth(nodes[rootIndex]);\n }","public int findHieghtOfTree(Node r) {\r\n\t\tif(r==null) \r\n\t\t\treturn 0;\r\n\t\tif(r.left==null && r.right==null)\r\n\t\t\treturn 0;\r\n\t\telse {\r\n\t\t\t\r\n\t\t\tint left=1,right=1;\r\n\t\t\tif(r.left!=null)\r\n\t\t\t\tleft=left+findHieghtOfTree(r.left);\r\n\t\t\tif(r.right!=null)\r\n\t\t\t\tright=right+findHieghtOfTree(r.right);\r\n\t\t\tif(left>right) \r\n\t\t\t\treturn left; \r\n\t\t\telse \r\n\t\t\t\treturn right;\r\n\t\t}\r\n\t\t\r\n\t}","private int calcNodeHeight(Node t) {\n\t\t\tif(t == null) return 0; //Base case of an empty tree. Has a height of zero. T is the root!\n\n\t\t\treturn (Math.max(calcNodeHeight(t.left), calcNodeHeight(t.right)) + 1); //The height of a binary tree is the height of the root's largest subtree + 1 for the root\n\t\t}","public int diameter(TreeNode root) {\n\t\tif(root == null) return 0;\n\t\t\n\t\tint lheight = height(root.left);\n\t\tint rheight = height(root.right);\n\t\t\n\t\tint ldiameter = diameter(root.left);\n\t\tint rdiameter = diameter(root.right);\n\t\t\n\t\treturn Math.max(lheight + rheight + 1, Math.max(ldiameter, rdiameter));\n\t}","private int height(Node<T> node){\n if(node == null)\n return 0;\n // get height of left and right side\n int left = height(node.left);\n int right = height(node.right);\n\n // height will be Max of height of left and right + 1 (Own level)\n return 1 + Math.max(left, right );\n\n }","public int getHeight (BinaryTreeNode<T> treeNode) {\n if (treeNode == null) {\n return 0;\n }\n return 1 + Math.max(getHeight(treeNode.left), getHeight(treeNode.right));\n }","@Override\r\n\tpublic double getDepth()\r\n\t{\r\n\r\n\t\tList<Entity> roots = new Stack<Entity>();\r\n\t\troots.addAll(getRoots());\r\n\r\n\t\tif (roots.size() == 0) {\r\n\t\t\tlogger.error(\"There is no root for this lexical semantic resource.\");\r\n\t\t\treturn Double.NaN;\r\n\t\t}\r\n\t\telse if (roots.size() > 1) {\r\n\t\t\tlogger.error(\"There are several roots for this lexical semantic resource.\");\r\n\t\t\treturn Double.NaN;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tEntity root = roots.get(0);\r\n\t\t\t// return getEccentricity(root);\r\n\r\n\t\t\tdouble maxPathLength = 0.0;\r\n\t\t\tdouble[] returnValues = computeShortestPathLengths(root, 0.0,\r\n\t\t\t\t\tmaxPathLength, new HashSet<Entity>());\r\n\t\t\tmaxPathLength = returnValues[1];\r\n\t\t\treturn maxPathLength;\r\n\t\t}\r\n\t}","public int minDepth() {\r\n\t\tint height = Integer.MAX_VALUE;\r\n\t\tif (left != null)\r\n\t\t\theight = Math.min(height, left.height() + 1);\r\n\t\tif (right != null)\r\n\t\t\theight = Math.min(height, right.height() + 1);\r\n\t\tif (left == null && right == null)\r\n\t\t\theight = 0;\r\n\t\treturn height;\r\n\t}","public int diameterOfBinaryTreeBF(TreeNode root) {\n if (root == null) {\n return 0;\n }\n int leftHeight = height(root.left);\n int rightHeight = height(root.right);\n int leftDiameter = diameterOfBinaryTreeBF(root.left);\n int rightDiameter = diameterOfBinaryTreeBF(root.right);\n return Math.max((leftHeight + rightHeight), Math.max(leftDiameter, rightDiameter));\n }","public int maxDepht(Node node){\n //if a tree is empty then return 0\n if (node == null)\n return 0;\n\n else {\n //compute the depth of each subtree\n int leftDepth = maxDepht(node.left);\n int rightDepth = maxDepht(node.right);\n\n if (leftDepth > rightDepth)\n return leftDepth+1;\n else\n return rightDepth+1;\n }\n }","public static void main(String[] args) \n { \n BinaryTree tree = new BinaryTree(); \n \n tree.root = new Node(1); \n tree.root.left = new Node(2); \n tree.root.right = new Node(3); \n tree.root.left.left = new Node(4); \n tree.root.left.right = new Node(5); \n \n System.out.println(\"Height of tree is : \" + \n tree.maxDepth(tree.root));\n System.out.println(\"Height of tree is by recur : \" + \n tree.heigth(tree.root));\n System.out.println(\"Diameter of tree is : \" + \n tree.getdiameter(tree.root));\n }","public int depthHelp(BSTNode<E,K> node)\r\n\t{\r\n\t\tint sum1 = 0;\r\n\t\tint sum2 = 0;\r\n\t\tif(node.getLeft() != null)\r\n\t\t{\r\n\t\t\tsum1 += depthHelp(node.getLeft());\r\n\t\t}\r\n\t\tif(node.getRight() != null)\r\n\t\t{\r\n\t\t\tsum2 += depthHelp(node.getRight());\r\n\t\t}\r\n\t\tif(node.getLeft() == null && node.getRight() == null)\r\n\t\t{\r\n\t\t\treturn 1;\r\n\t\t}\r\n\t\tif(sum1>sum2)\r\n\t\t{\r\n\t\t\treturn sum1 +1;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\treturn sum2 +1;\r\n\t\t}\r\n\t}","private int height(TreeNode<E> node) {\n\t\tif(isEmpty()) //if tree is empty\n\t\t\treturn 0; //height is 0 for empty tree\n\t\tif(node.right == null && node.left == null) //current node has no children\n\t\t\treturn 1; //return 1\n\t\tif(node.left == null) //current node has only a right child\n\t\t\treturn 1 + height(node.right); //return 1 + height of right subtree\n\t\tif(node.right == null) //current node has only a left child\n\t\t\treturn 1 + height(node.left); //return 1 + height of left subtree\n\t\t//The below cases are for when the current node has two children\n\t\tif(height(node.left) > height(node.right)) //if left height is greater than right height\n\t\t\treturn 1 + height(node.left); //return 1 + height of left subtree\n\t\telse //if right height is greater than left height\n\t\t\treturn 1 + height(node.right); //return 1 + height of right subtree\n\t}","public static <E extends Comparable> int deep(TreeNode<E> root) {\r\n \r\n Queue<TreeNode<E>> queue = new LinkedList<>();\r\n \r\n int deep = 0;\r\n \r\n queue.add(root);\r\n TreeNode<E> startNewLine = root;\r\n \r\n while(!queue.isEmpty()) {\r\n TreeNode<E> currentNode = queue.poll();\r\n if(currentNode == startNewLine) {\r\n startNewLine = null;\r\n deep ++;\r\n }\r\n if(currentNode.getLeft() != null) queue.add(currentNode.getLeft());\r\n if(startNewLine == null) {\r\n startNewLine = currentNode.getLeft();\r\n }\r\n if(currentNode.getRight()!= null) queue.add(currentNode.getRight());\r\n if(startNewLine == null) {\r\n startNewLine = currentNode.getRight();\r\n }\r\n }\r\n \r\n \r\n return deep;\r\n }","@Test\n public void getHeight() {\n Node node = new Node(150);\n node.setLeft(new Node(120));\n node.setRight(new Node(40));\n Node root = new Node(110);\n root.setLeft(new Node(80));\n root.setRight(node);\n assertEquals(2, BinarySearchTree.getHeight(root));\n }","public int findHeight(Node temp) {\n\t\t\n\t\t\n\t\t//check whether tree is empty\n\t\tif(root==null) {\n\t\t\t\n\t\t\tSystem.out.println(\"Tree is Empty\");\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\t\n\t\t\tint leftHeight=0; int rightHeight=0;\n\t\t//Calculate height of left subtree\n\t\t\tif(temp.left !=null) \n\t\t\t\t\n\t\t\t\tleftHeight = findHeight(temp.left);\n\t\t\tif(temp.right !=null) \n\t\t\t\t\n\t\t\t\trightHeight = findHeight(temp.right);\n\t\t\t\t\n\t\t\tint max = (leftHeight > rightHeight)? leftHeight: rightHeight;\n\t\t\t\n\t\t\treturn (max+1);\n\t\t\t\n\t\t\t\n\t\t}\n\t\t\n\t}","public int depth(){\n if(root!=null){ // มี node ใน tree\n return height(root);\n }\n else {return -1;}\n }","public int getHeight(){\n\t\tint h=maxDepth(root);\n\t\treturn h;\n\t}","public int solution(Tree T) {\n if(T == null)\n {\n return 0;\n\n }\n //Check if the tree has no children\n if(T.l == null && T.r == null)\n {\n return 0;\n }\n\n\n AtomicInteger leftSide = new AtomicInteger(0);\n AtomicInteger rightSide = new AtomicInteger(0);\n\n if(T.l != null) traverseTree(T.l, 0, true, leftSide);\n if(T.r != null) traverseTree(T.r, 0, false, rightSide);\n\n\n if(leftSide.intValue() > rightSide.intValue())\n {\n return leftSide.intValue();\n }\n else{\n return rightSide.intValue();\n }\n\n }","@Override\n\tpublic int height() {\n\t\tif (this.valCount == 0) { // if empty leaf\n\t\t\treturn 0;\n\t\t}\n\t\tint max = 1; \n\t\tfor (int i = 0; i < childCount; ++i) { // finds longest route among children\n\t\t\tmax = Math.max(max, children[i].height() + 1);\n\t\t}\n\t\treturn max;\n\t}","private int heightBST(Node tree) {\n if (tree == null) {\n return 0;\n }\n return tree.height;\n }","public int depth() { return Math.max(left.depth(), right.depth()) + 1; }","private void getSizeDfs(int nodeIdx, int parentNodeIdx){\r\n\t\tsubTreeSize[nodeIdx] = 1;\t\t//include this node\r\n\t\tmaxSubTreeSize[nodeIdx] = 0;\t//exclude this node\r\n\t\t\r\n\t\t//recursively get the size of children and add up\r\n\t\tfor(Integer idx: cities[nodeIdx].adjacentNodeIndices){\r\n\t\t\tif(parentNodeIdx == idx || visited[idx]) continue;\r\n\t\t\t\r\n\t\t\tgetSizeDfs(idx, nodeIdx);\r\n\t\t\tsubTreeSize[nodeIdx] += subTreeSize[idx];\r\n\t\t\t\r\n\t\t\tif(subTreeSize[idx] > maxSubTreeSize[nodeIdx])\r\n\t\t\t\tmaxSubTreeSize[nodeIdx] = subTreeSize[idx];\r\n\t\t}\r\n\t}","int height(TreeNode root) \n { \n if (root == null) \n return 0; \n else\n { \n /* compute height of each subtree */\n int lheight = height(root.left); \n int rheight = height(root.right); \n \n /* use the larger one */\n if (lheight > rheight) \n return(lheight+1); \n else return(rheight+1); \n } \n }","public static int diameter(Graph g) {\n // Step 1 : Check if a graph is tree or not\n if (isCyclic(g)) {\n return -1;\n }\n\n // Step 2 : Pass a random node to a BFS and get a Vertex \n Random ran = new Random();\n int noOfVertex = g.verts.size();\n int randomNode = ran.nextInt((noOfVertex - 1) + 1) + 1;\n Vertex node = breathFirstSearch(g, g.verts.get(randomNode));\n\n //Step 3: Get the random node and do the BFS again\n node = breathFirstSearch(g, node);\n\n return node.distance;\n }","int maxDepth();","public static void main(String[] args){\n\n// BinaryTree binaryTree = new BinaryTree(1);\n// binaryTree.insert(\"L\", 2);\n// binaryTree.insert(\"LL\", 4);\n// binaryTree.insert(\"LR\", 5);\n// binaryTree.insert(\"R\", 3);\n// binaryTree.getHeight(binaryTree.root);\n// System.out.println(binaryTree.maxDiameter);\n\n Scanner in = new Scanner(System.in);\n int T = in.nextInt();\n int X = in.nextInt();\n BinaryTree binaryTree = new BinaryTree(X);\n for(int j=0;j<T-1;j++){\n String where = in.next();\n int k = in.nextInt();\n binaryTree.insert(where, k);\n }\n binaryTree.getHeight(binaryTree.root);\n// binaryTree.traverse(binaryTree.root);\n System.out.println(binaryTree.maxDiameter);\n }","public int depth ( BinTree tree){\n\t\tint x = 1; \n\t\twhile( tree.left != null){\n\t\t\ttree= tree.left;\n\t\t\tx++;\n\t\t}\n\t\treturn x;\n\t}","int get_height(Node node) {\n\t\tif (node == null) \n\t\t\treturn 0;\n\t\telse if (node.leftChild == null && node.rightChild == null)\n\t\t\treturn 0;\t\t\n\t\telse return 1 + max(get_height(node.leftChild), get_height(node.rightChild));\n\t}","public static void main(String[] args) {\n LongestUnivaluePath solution = new LongestUnivaluePath();\n // Example 1:\n //Input:\n //\n // 5\n // / \\\n // 4 5\n // / \\ \\\n // 1 1 5\n //Output: 2\n TreeNode root = new TreeNode(5);\n root.left = new TreeNode(4);\n root.left.left = new TreeNode(1);\n root.left.right = new TreeNode(1);\n root.right = new TreeNode(5);\n root.right.right = new TreeNode(5);\n System.out.println(solution.longestUnivaluePath(root));\n\n // Example 2:\n //Input:\n //\n // 1\n // / \\\n // 4 5\n // / \\ \\\n // 4 4 5\n //Output: 2\n root = new TreeNode(1);\n root.left = new TreeNode(4);\n root.left.left = new TreeNode(4);\n root.left.right = new TreeNode(4);\n root.right = new TreeNode(5);\n root.right.right = new TreeNode(5);\n System.out.println(solution.longestUnivaluePath(root));\n\n\n // 1\n // 2 2\n // 2 2 2\n // 2\n // output: 3\n root = new TreeNode(1);\n root.left = new TreeNode(2);\n root.left.left = new TreeNode(2);\n root.left.left.left = new TreeNode(2);\n root.left.right = new TreeNode(2);\n root.right = new TreeNode(2);\n root.right.right = new TreeNode(2);\n System.out.println(solution.longestUnivaluePath(root));\n\n // 1\n root = new TreeNode(1);\n System.out.println(solution.longestUnivaluePath(root));\n\n // empty\n root = new TreeNode(1);\n System.out.println(solution.longestUnivaluePath(null));\n\n\n // 1\n // 3 2\n // 3 2 2\n // 2 2\n // 2 2\n // 4 2\n // output: 4\n root = new TreeNode(1);\n root.left = new TreeNode(3);\n root.left.left = new TreeNode(3);\n root.left.left.left = new TreeNode(2);\n root.left.right = new TreeNode(2);\n root.left.right.right = new TreeNode(2);\n root.left.right.right.left = new TreeNode(2);\n root.left.right.right.left.left = new TreeNode(4);\n root.left.right.right.right = new TreeNode(2);\n root.left.right.right.right.right = new TreeNode(2);\n root.right = new TreeNode(2);\n root.right.right = new TreeNode(2);\n System.out.println(solution.longestUnivaluePath(root));\n\n //Input :\n // 2\n // / \\\n // 7 2\n // / \\ \\\n // 1 1 2\n //Output : 2\n root = new TreeNode(2);\n root.left = new TreeNode(7);\n root.left.left = new TreeNode(1);\n root.left.right = new TreeNode(1);\n root.right = new TreeNode(2);\n root.right.right = new TreeNode(2);\n System.out.println(solution.longestUnivaluePath(root));\n\n //\n //Input :\n // 4\n // / \\\n // 4 4\n // / \\ \\\n // 4 9 5\n //Output : 3\n root = new TreeNode(4);\n root.left = new TreeNode(4);\n root.left.left = new TreeNode(4);\n root.left.right = new TreeNode(9);\n root.right = new TreeNode(4);\n root.right.right = new TreeNode(5);\n System.out.println(solution.longestUnivaluePath(root));\n\n\n //\n //Input :\n // 4\n // / \\\n // 4 4\n // / \\ \\\n // 4 9 5\n // / \\\n // 5 5\n //Output : 3\n root = new TreeNode(4);\n root.left = new TreeNode(4);\n root.left.left = new TreeNode(4);\n root.left.right = new TreeNode(9);\n root.right = new TreeNode(4);\n root.right.right = new TreeNode(5);\n root.right.right.left = new TreeNode(5);\n root.right.right.right = new TreeNode(5);\n System.out.println(solution.longestUnivaluePath(root));\n }","int depth(BTNode node) {\n int d = 0;\n while (node != root) {\n node = node.parent;\n d++;\n }\n return d;\n }","public int heightNodes(Node N) {\n if(N == null) return 0;\n if((N.getRight() == null) && (N.getLeft() == null)) return 0;\n int left = heightNodes(N.getLeft());\n int right = heightNodes(N.getRight());\n\n if(left > right) return 1 + left;\n else return 1 + right;\n\n }","int height(Node root) { return (root != null) ? Math.max(height(root.left), height(root.right)) + 1 : 0;}","private int height(Node<T> node){\n if(node == null){\n return 0;\n }else{\n int leftHight = height(node.left) + 1;\n int rightHight = height(node.right) + 1;\n if(leftHight > rightHight){\n return leftHight;\n }else{\n return rightHight;\n }\n }\n }","int treeSize() {\n return\n memSize()\n + initializers.listSize()\n + updaters.listSize()\n + (optionalConditionExpression == null ? 0 : getExpression().treeSize())\n + (body == null ? 0 : getBody().treeSize()); }","public int longestPath(TreeNode node) {\n if (node == null) {\n return 0;\n }\n // Get the max length from left and right\n int maxLeft = longestPath(node.left);\n int maxRight = longestPath(node.right);\n // Calculate the current max length\n int maxLeftSoFar = 0;\n int maxRightSoFar = 0;\n // Compare parent node with child node\n // If they are the same, extend the max length by one\n if (node.left != null && node.left.val == node.val) {\n maxLeftSoFar = maxLeft + 1;\n }\n if (node.right != null && node.right.val == node.val) {\n maxRightSoFar = maxRight + 1;\n }\n // Update the max with the sum of left and right length\n max = Math.max(max, maxLeftSoFar + maxRightSoFar);\n // Return the max from left and right to upper node\n // since only one side path is valid\n return Math.max(maxLeftSoFar, maxRightSoFar);\n }","private static int getTreeSize(int totalSize) {\n if (totalSize <= 32) {\n return 0;\n } else {\n // TODO: Clojure does ((realSize - 1) >>> 5) << 5); is that faster?\n return ((totalSize - 1) & (~0x1F));\n }\n }","int height(Node node) {\r\n\t\tif (node == null) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tint left = height(node.left);\r\n\t\tint right = height(node.right);\r\n\t\tint max = Integer.max(left, right);\r\n\t\treturn max + 1;\r\n\t}","public int depth(){\n\t\tint depth = 0;\n\t\tif(this.isEmpty()){\n\t\t\treturn depth;\n\t\t} else {\n\t\t\tdepth= 1;\n\t\t}\n\t\tQueue queue = new Queue();\n\t\tqueue.enqueue(this);\n\t\t\n\t\twhile(!queue.isEmpty()){\n\t\t\tBinaryTree tree = (BinaryTree) queue.dequeue();\n\t\t\tif(tree.left.getElement()!=null){\n\t\t\t\tqueue.enqueue(tree.left);\n\t\t\t\tdepth++;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn depth;\n\t}","private int getHeightofNode(TreeNode node){\n if (node == null) return 0;\n if (getColor(node) == RED) {\n return Math.max(getHeightofNode(node.left), getHeightofNode(node.right));\n } else {\n return Math.max(getHeightofNode(node.left), getHeightofNode(node.right))+1;\n }\n }","private int getDepthRecursive(Node currNode) {\n int max = 0;\n int val;\n\n // Return 0 if this Node is null or if it is invalid.\n if (currNode == null || currNode.key < 0) return 0;\n\n // Finds the maximum depth of this Node's subtrees.\n for (int i = 0; i < getNumChildren(); ++i) {\n val = getDepthRecursive(currNode.children[i]);\n max = Math.max(max, val);\n\n }\n\n // Returns the maximum depth of this Node's subtree plus one.\n return max + 1;\n\n }","private static int maxDepth(TreeNode node) {\r\n\t\tif (node == null) return 0;\r\n\t\treturn 1 + Math.max(maxDepth(node.left), maxDepth(node.right));\r\n\t}","public int height(){\r\n \r\n // call the recursive method with the root\r\n return height(root);\r\n }","public int size() {\n if (root == null) return 0;\n if (root.left == null && root.right == null) return 1;\n else {\n int treeSize = 0;\n treeSize = size(root, treeSize);\n return treeSize;\n }\n }","public int calculateSize(NoArvore tree)\n {\n int size = 0;\n if (tree == null)\n return 0;\n else {\n size = calculateSize (tree.getEsquerda()) + calculateSize (tree.getDireita()) + 1;\n return size;\n }\n }","int depth();","int depth();","int getRecursionDepth();","private Integer getDepth(BinaryNode node, int depth) {\n\n if (node == null) return depth;\n else return Math.max(getDepth(node.left, depth + 1),getDepth(node.right, depth + 1));\n }","public int height(){\n int level=0;\n \n //if is empty, we finish\n if(this.isEmpty()){\n return level;\n \n \n }else{\n //count this level and check the level under its childs recursively\n int levelSubTree1,levelSubTree2;\n \n levelSubTree1=1 + this.right.height();\n levelSubTree2=1 + this.left.height();\n \n //get the higher height\n if(levelSubTree1> levelSubTree2){\n level=levelSubTree1;\n }else{\n level=levelSubTree2;\n }\n }\n return level;\n }","public int height()\r\n {\r\n if(this.isLeaf())\r\n {\r\n return 0;\r\n }\r\n else if (this.getLeft()!=null&&this.getRight()==null)\r\n {\r\n return this.getLeft().height()+1;\r\n }\r\n else if(this.getLeft()==null&&this.getRight()!=null)\r\n {\r\n return this.getRight().height()+1;\r\n }\r\n else\r\n {\r\n return Math.max(this.getLeft().height(),this.getRight().height())+1;\r\n }\r\n }","int height(Node root) {\n\t\tif (root == null)\n\t\t\treturn 0;\n\t\telse {\n\t\t\t/* compute height of each subtree */\n\t\t\tint lheight = height(root.left);\n\n\t\t\tint rheight = height(root.right);\n\n\t\t\t/* use the larger one */\n\t\t\tif (lheight > rheight) {\n\t\t\t\t//System.out.println(\"lheight : \" + lheight + \" rheight : \" + rheight + \" root data : \" + root.data);\n\t\t\t\treturn (lheight + 1);\n\t\t\t} else {\n\t\t\t\t//System.out.println(\"lheight : \" + lheight + \" rheight : \" + rheight + \" root data : \" + root.data);\n\t\t\t\treturn (rheight + 1);\n\t\t\t}\n\t\t}\n\t}","public int maxDepth2(Node root) {\r\n\t\tif(root == null) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\t\r\n\t\tQueue<Node> queue = new LinkedList<Node>();\r\n\t\tqueue.offer(root);\r\n\t\t\r\n\t\tint depth = 0;\r\n\t\t\r\n\t\twhile(!queue.isEmpty()) {\r\n\t\t\tint levelSize = queue.size();\r\n\t\t\t\r\n\t\t\tdepth++;\r\n\t\t\t\r\n\t\t\tfor(int i=0; i<levelSize; i++) {\r\n\t\t\t\tNode current = queue.poll();\r\n\t\t\t\t\r\n\t\t\t\tfor(Node node : current.children) {\r\n\t\t\t\t\tqueue.offer(node);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\treturn depth;\r\n\t}","private int height( BinaryNode<AnyType> t )\r\n\t{\r\n\t\tif( t == null )\r\n\t\t\treturn -1;\r\n\t\telse\r\n\t\t\treturn 1 + Math.max( height( t.left ), height( t.right ) ); \r\n\t}","private int height(BSTNode<K, V> node) {\r\n if (node == null) {\r\n return 0;\r\n } else {\r\n if (height(node.left) >= height(node.right)) {\r\n return 1 + height(node.left);\r\n } else {\r\n return 1 + height(node.right);\r\n }\r\n }\r\n }","private int recSize(BSTNode<T> node) {\n\t\tif (node == null)\n\t\t\treturn 0;\n\t\telse\n\t\t\treturn recSize(node.getLeft()) + recSize(node.getRight()) + 1;\n\t}","int height(Node root)\n {\n if (root == null)\n return 0;\n else\n {\n /* compute height of each subtree */\n int lheight = height(root.left);\n int rheight = height(root.right);\n\n /* use the larger one */\n if (lheight > rheight)\n return(lheight+1);\n else return(rheight+1);\n }\n }","public int computeHeight(Node root){\n\t if(root == null)\n\t return 0;\n\t /* Calculate recursively */\n\t return Math.max(computeHeight(root.leftChild), computeHeight(root.rightChild)) + 1;\n\t }","private static int height(TreeNode n){\n\t\tif(n==null)\n\t\t\treturn 0;\n\t\treturn 1+Math.max(height(n.left), height(n.right));\n\t}","public int treeHeight() {\n return height(root);\n }","int height(Node root) {\n\t\tif (root == null)\n\t\t\treturn 0;\n\t\telse {\n\t\t\t //compute height of each subtree \n\t\t\tint lheight = height(root.left);\n\t\t\tint rheight = height(root.right);\n\n\t\t\t// use the larger one \n\t\t\tif (lheight > rheight)\n\t\t\t\treturn (lheight + 1);\n\t\t\telse\n\t\t\t\treturn (rheight + 1);\n\t\t}\n\t}","public int getHeight(){ \n\t if (left == null && right == null){\n\t\treturn 1;\n\t }else if (left == null){\n\t\treturn 1 + right.getHeight();\n\t }else if (right == null){\n\t\treturn 1 + left.getHeight();\n\t }else{\n\t\tif (right.getHeight() >= left.getHeight()){\n\t\t return 1 + right.getHeight();\n\t\t}else{\n\t\t return 1 + left.getHeight();\n\t\t}\n\t }\n\t}","private int height(BinaryNode<AnyType> t) {\r\n\t\tif (t == null)\r\n\t\t\treturn -1;\r\n\t\telse\r\n\t\t\treturn 1 + Math.max(height(t.left), height(t.right));\r\n\t}","private int calcHeight(ChartOptions options) {\n Node n = this; // current node in the level\n int realHeight = 0;\n boolean samelevel = true; // next node in same level?\n while (n != null && samelevel) {\n int tmpHeight = 0;\n if (n.typ.matches(NodeType.TERM, NodeType.NONTERM, NodeType.EXCEPTION)) {\n tmpHeight = n.size.getHeight();\n } else if (n.typ == NodeType.ITER) {\n tmpHeight = n.sub.calcHeight(options);\n } else if (n.typ == NodeType.OPT) {\n tmpHeight = n.sub.calcHeight(options);\n } else if (n.typ == NodeType.PREDICATE) {\n tmpHeight = n.size.getHeight();\n } else if (n.typ == NodeType.RERUN) {\n tmpHeight = n.sub.calcHeight(options);\n } else if (n.typ == NodeType.ALT) {\n tmpHeight = n.sub.calcHeight(options);\n } else if (n.typ == NodeType.EPS) {\n tmpHeight = options.fontHeight() * 3 / 2;\n if (realHeight < tmpHeight) {\n tmpHeight = options.fontHeight()\n + options.componentGapHeight();\n } else {\n tmpHeight = 0;\n }\n }\n realHeight = Math.max(realHeight, tmpHeight);\n if (n.up) {\n samelevel = false;\n }\n n = n.next;\n }\n return realHeight;\n }","int getMax_depth();","public static int diameter(Graph graph) {\n Set<List<Vertex>> listSetVertex=breadthFirstSearch(graph);\n int distance=0;\n for(List<Vertex> lv: listSetVertex){\n for(Vertex va:lv){\n for(Vertex vb:lv){\n if(va.equals(vb)){\n continue;\n }\n int shortDistance=shortestDistance(graph, va, vb);\n distance=distance<shortDistance?shortDistance:distance;\n }\n }\n\n }\n return distance; // this should be changed\n }","public double getDepth();","int treeSize() {\n return memSize() + (this.expression == null ? 0 : getExpression().treeSize()) + (this.typeArguments == null ? 0 : this.typeArguments.listSize()) + (this.methodName == null ? 0 : getName().treeSize());\n }","public int height(Node node) \n {\n \t if (node == null) return 0;\n \t return 1 + max(height(node.left), height(node.right));\n }","int depth(Node root) {\n\t\tif (root == null) return 0;\n\t\treturn Math.max(depth(root.left), depth(root.right)) + 1 ;\n\t}","private int getHeight(Node n) {\n\t\tif (n==null)\n\t\t\treturn 0;\n\t\tint heightLeft = getHeight(n.left);\n\t\tif (heightLeft==-1)\n\t\t\treturn -1;\n\t\t\n\t\tint heightRight = getHeight(n.right);\n\t\tif (heightRight==-1) \n\t\t\treturn -1;\n\t\t\n\t\tif(Math.abs(heightRight-heightLeft) > 1)\n\t\t\treturn -1;\n\t\telse\n\t\t\treturn 1+Math.max(getHeight(n.left), getHeight(n.right));\n\t}","private static int height(TreeNode node) {\n\t\t\n\t\tif(node == null)\n\t\t\treturn 0;\n\n\t\treturn (Math.max(height(node.left) , height(node.right)) + 1);\n\t}","public int getDepth(HuffmanTreeNode node) {\n\t\tif (node == null)\n\t\t\treturn 0;\n\t\telse {\n\t\t\tint leftDepth = getDepth(node.getLeft());\n\t\t\tint rightDepth = getDepth(node.getRight());\n\t\t\t\n\t\t\tif (leftDepth > rightDepth)\n\t\t\t\treturn (leftDepth+1);\n\t\t\telse\n\t\t\t\treturn (rightDepth+1);\n\t\t}\n\t}","public int calculateNodeDepth(Node startNode) {\n\t\tint depthCounter = 0;\n\t\t// start from zero\n\t\tif (!(startNode == this.mRoot)) {\n\t\t\twhile (startNode.getParent() != this.mRoot) {\n\t\t\t\tstartNode = startNode.getParent();\n\t\t\t\tdepthCounter++;\n\t\t\t\t// count upwards while the node's parent is not root\n\t\t\t}\n\t\t} else {\n\t\t\treturn 0;\n\t\t}\n\t\treturn depthCounter;\n\t\t// return the count\n\t}","public int depth ();","int treeSize() {\r\n\t\treturn\r\n\t\t\tmemSize()\r\n\t\t\t+ (this.expression == null ? 0 : getExpression().treeSize())\r\n\t\t\t+ (this.newArguments.listSize())\r\n\t\t\t+ (this.constructorArguments.listSize())\r\n\t\t\t+ (this.baseClasses.listSize())\r\n\t\t\t+ (this.declarations.listSize())\r\n\t;\r\n\t}","public int height(Node root) {\n if(root!=null) {\n if(root.left == null && root.right ==null) {\n return 0;\n }\n return maxDepth(height(root.left), height(root.right)) + 1;\n } else {\n return 0;\n }\n }","public int treeHigh(TreeNode node) \n { \n if (node == null) \n return 0; \n else \n { \n /* compute the depth of each subtree */\n int lDepth = treeHigh(node.left); \n int rDepth = treeHigh(node.right); \n \n /* use the larger one */\n if (lDepth > rDepth) \n return (lDepth + 1); \n else \n return (rDepth + 1); \n } \n }","private int height(BSTNode root) {\r\n \r\n // if the root is null, return 0\r\n if (null == root) {\r\n \r\n return 0;\r\n }\r\n \r\n // find the height of the left subtree\r\n int heightLeftSub = height(root.left);\r\n \r\n // find the height of the right subtree\r\n int heightRightSub = height(root.right);\r\n \r\n // return the greatest subtree value plus 1 for the height\r\n return Math.max(heightLeftSub, heightRightSub) + 1; \r\n }","public interface MaximumDepthOfBinaryTree {\n int maxDepth(TreeNode root);\n}","int height(Node node){\r\n\t\tif( node == null ) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\treturn Math.max( height(node.left), height(node.right) ) + 1 ;\r\n\t}","public static int depth(Node root, Node node){\n\n if(node!=root){ // node มีตัวตน\n return 1 + depth (root,node.parent) ; // depth = length(path{node->root})\n\n }\n else {\n return 0;\n }\n\n }","public int size(){\n if(root!=null){ // มี node ใน tree\n return size(root);\n }\n else{\n return 0; // tree เปล่า size 0\n }\n }","int getTemporaryMaxDepth();","private int getDepthRaw(TreeNode root){\n if (root == null) {\n return 0;\n }\n\n int left = getDepthRaw(root.left);\n int right = getDepthRaw(root.right);\n if (left == -1 || right == -1) {\n return -1;\n }else{\n if (Math.abs(left - right) > 1) {\n return -1;\n }else{\n return Math.max(left, right) + 1;\n }\n }\n }","private static double weightedNodeHeightHelper(PhyloTreeNode node) {\n if(node == null) {\n return 0;\n }\n else{\n return Math.max(node.getDistanceToChild() + weightedNodeHeightHelper(node.getLeftChild()),\n node.getDistanceToChild() + weightedNodeHeightHelper(node.getRightChild()));\n }\n }","public static int height(BinaryTreeNode<Integer> root) {\n if(root == null){\n return 0;\n }\n int sum = 0;\n if(root.leftChild != null){\n sum = Math.max(sum, height(root.leftChild));\n }\n if(root.rightChild != null){\n sum = Math.max(sum, height(root.rightChild));\n }\n return sum+1;\n }","public int totalPathLength(BSTnode<K> n, int num) {\n\t\tif (n == null) {\n\t\t\treturn num;// return pathlength to that point\n\t\t}\n\t\tnum++;// increment pathlength\n\t\tif (n.getLeft() == null && n.getRight() == null) {\n\t\t\treturn num;// return pathlength to that point\n\t\t} else {\n\t\t\t// return totalPathLengths of right and left subtrees\n\t\t\treturn totalPathLength(n.getLeft(), num) + totalPathLength(n.getRight(), num);\n\t\t}\n\t}","public int treeDepth(TreeNode root){\n if(root == null){\n return 0;\n }\n return 1 + Math.max(treeDepth(root.left), treeDepth(root.right));\n }","public int numTrees(int n) {\n if(n<=1)\n return 1;\n int[] dp = new int[n+1];\n dp[0] = 1;\n dp[1] = 1;\n dp[2] = 2;\n \n for(int i=3;i<=n;i++){\n int sum = 0;\n for(int a=0;a<i;a++){\n sum+=dp[0+a]*dp[i-1-a];\n }\n dp[i] = sum;\n //if i is odd then add the i/2 dp after you multiply by 2\n }\n return dp[n];\n }","static int maximumDepth( TreeNode node, int depth ) {\n if ( node == null ) {\n // The tree is empty. Return 0.\n return 0;\n }\n else if ( node.left == null && node.right == null) {\n // The node is a leaf, so the maximum depth in this\n // subtree is the depth of this node (the only leaf \n // that it contains).\n return depth;\n }\n else {\n // Get the maximum depths for the two subtrees of this\n // node. Return the larger of the two values, which\n // represents the maximum in the tree overall.\n int leftMax = maximumDepth(node.left, depth + 1);\n int rightMax = maximumDepth(node.right, depth + 1);\n if (leftMax > rightMax)\n return leftMax;\n else\n return rightMax;\n }\n }","public int treeSize(BinaryTreeNode root) {\n\t\tint size = 0;\n\t\tif (root == null) {\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tBinaryTreeNode temp;\n\t\t\tQueue<BinaryTreeNode> q = new LinkedList<BinaryTreeNode>();\n\t\t\tq.add(root);\n\n\t\t\twhile (!q.isEmpty()) {\n\t\t\t\ttemp = q.poll();\n\t\t\t\tsize++;\n\t\t\t\tif (temp.getLeft() != null)\n\t\t\t\t\tq.add(temp.getLeft());\n\t\t\t\tif (temp.getRight() != null)\n\t\t\t\t\tq.add(temp.getRight());\n\t\t\t}\n\t\t}\n\t\treturn size;\n\t}","public static int getNodeDepth(BinaryTreeNode node) {\n int depth = 0;\n while (node != null) {\n node = node.parent;\n depth++;\n }\n return depth;\n }","public double getTreeSize()\n {\n return treesize; \n }"],"string":"[\n \"private int[] diameterOfBinaryTree(Node node) {\\n\\n if (node.left == null && node.right == null) {\\n return new int[]{1, 1};\\n }\\n\\n int[] left = {0, 0};\\n int[] right = {0, 0};\\n\\n if (node.left != null)\\n left = diameterOfBinaryTree(node.left);\\n\\n if (node.right != null)\\n right = diameterOfBinaryTree(node.right);\\n\\n\\n int[] retArr = new int[2];\\n int maxHeightTillNow = Math.max(left[0], right[0]);\\n retArr[0] = maxHeightTillNow + 1;\\n int maxTillNow = Math.max(left[1], right[1]);\\n retArr[1] = left[0] + right[0] > maxTillNow ? left[0] + right[0] : maxTillNow;\\n return retArr;\\n }\",\n \"public int diameterOfBinaryTree2(TreeNode root) {\\n Height height = new Height();\\n return diameterOfBinaryTree2Helper(root, height);\\n }\",\n \"public int height(Node tree){\\n\\t\\tif(tree == null){\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tint lheight = height(tree.getLeft());\\n\\t\\t\\tint rheight = height(tree.getRight());\\n\\t\\t\\t\\n\\t\\t\\t//take the branch which is longer\\n\\t\\t\\tif(lheight>rheight){\\n\\t\\t\\t\\treturn (lheight+1);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\treturn(rheight+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"default int calcHeight() throws NotATreeException {\\n\\n int[] roots = getSources();\\n\\n if (roots.length == 0) {\\n throw new NotATreeException();\\n }\\n\\n class WrappedCalcLongestPath {\\n private int calcLongestPath(int node, TIntList path) throws CycleDetectedException {\\n\\n if (!containsNode(node)) {\\n throw new IllegalArgumentException(\\\"node \\\"+ node + \\\" was not found\\\");\\n }\\n\\n if (isSink(node)) {\\n return path.size()-1;\\n }\\n\\n TIntList lengths = new TIntArrayList();\\n for (int edge : getOutEdges(node)) {\\n\\n int nextNode = getHeadNode(edge);\\n\\n TIntList newPath = new TIntArrayList(path);\\n newPath.add(nextNode);\\n\\n if (path.contains(nextNode)) {\\n throw new CycleDetectedException(newPath);\\n }\\n\\n lengths.add(calcLongestPath(nextNode, newPath));\\n }\\n\\n return lengths.max();\\n }\\n }\\n\\n // it is ok if there are multiple roots (see example of enzyme-classification-cv where it misses the root that\\n // connect children EC 1.-.-.-, EC 2.-.-.-, ..., EC 6.-.-.-)\\n /*if (roots.length > 1) {\\n throw new NotATreeMultipleRootsException(roots);\\n }*/\\n\\n return new WrappedCalcLongestPath().calcLongestPath(roots[0], new TIntArrayList(new int[] {roots[0]}));\\n }\",\n \"private static int heightOfTree(Tree tree) {\\n\\n if(tree == null){\\n return 0;\\n }\\n int leftHeight = 0;\\n if(tree.left!=null){\\n leftHeight = heightOfTree(tree.left);\\n }\\n int rightHeight = 0;\\n if(tree.right!=null){\\n rightHeight = heightOfTree(tree.right);\\n }\\n return (Math.max(leftHeight, rightHeight))+1;\\n\\n }\",\n \"public int diameterOfBinaryTree(TreeNode root) {\\n return helper(root).diameter;\\n }\",\n \"int computeHeight() {\\n Node<Integer>[] nodes = new Node[parent.length];\\n for (int i = 0; i < parent.length; i++) {\\n nodes[i] = new Node<Integer>();\\n }\\n int rootIndex = 0;\\n for (int childIndex = 0; childIndex < parent.length; childIndex++) {\\n if (parent[childIndex] == -1) {\\n rootIndex = childIndex;\\n } else {\\n nodes[parent[childIndex]].addChild(nodes[childIndex]);\\n }\\n }\\n return getDepth(nodes[rootIndex]);\\n }\",\n \"public int findHieghtOfTree(Node r) {\\r\\n\\t\\tif(r==null) \\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\tif(r.left==null && r.right==null)\\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\telse {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint left=1,right=1;\\r\\n\\t\\t\\tif(r.left!=null)\\r\\n\\t\\t\\t\\tleft=left+findHieghtOfTree(r.left);\\r\\n\\t\\t\\tif(r.right!=null)\\r\\n\\t\\t\\t\\tright=right+findHieghtOfTree(r.right);\\r\\n\\t\\t\\tif(left>right) \\r\\n\\t\\t\\t\\treturn left; \\r\\n\\t\\t\\telse \\r\\n\\t\\t\\t\\treturn right;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"private int calcNodeHeight(Node t) {\\n\\t\\t\\tif(t == null) return 0; //Base case of an empty tree. Has a height of zero. T is the root!\\n\\n\\t\\t\\treturn (Math.max(calcNodeHeight(t.left), calcNodeHeight(t.right)) + 1); //The height of a binary tree is the height of the root's largest subtree + 1 for the root\\n\\t\\t}\",\n \"public int diameter(TreeNode root) {\\n\\t\\tif(root == null) return 0;\\n\\t\\t\\n\\t\\tint lheight = height(root.left);\\n\\t\\tint rheight = height(root.right);\\n\\t\\t\\n\\t\\tint ldiameter = diameter(root.left);\\n\\t\\tint rdiameter = diameter(root.right);\\n\\t\\t\\n\\t\\treturn Math.max(lheight + rheight + 1, Math.max(ldiameter, rdiameter));\\n\\t}\",\n \"private int height(Node<T> node){\\n if(node == null)\\n return 0;\\n // get height of left and right side\\n int left = height(node.left);\\n int right = height(node.right);\\n\\n // height will be Max of height of left and right + 1 (Own level)\\n return 1 + Math.max(left, right );\\n\\n }\",\n \"public int getHeight (BinaryTreeNode<T> treeNode) {\\n if (treeNode == null) {\\n return 0;\\n }\\n return 1 + Math.max(getHeight(treeNode.left), getHeight(treeNode.right));\\n }\",\n \"@Override\\r\\n\\tpublic double getDepth()\\r\\n\\t{\\r\\n\\r\\n\\t\\tList<Entity> roots = new Stack<Entity>();\\r\\n\\t\\troots.addAll(getRoots());\\r\\n\\r\\n\\t\\tif (roots.size() == 0) {\\r\\n\\t\\t\\tlogger.error(\\\"There is no root for this lexical semantic resource.\\\");\\r\\n\\t\\t\\treturn Double.NaN;\\r\\n\\t\\t}\\r\\n\\t\\telse if (roots.size() > 1) {\\r\\n\\t\\t\\tlogger.error(\\\"There are several roots for this lexical semantic resource.\\\");\\r\\n\\t\\t\\treturn Double.NaN;\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tEntity root = roots.get(0);\\r\\n\\t\\t\\t// return getEccentricity(root);\\r\\n\\r\\n\\t\\t\\tdouble maxPathLength = 0.0;\\r\\n\\t\\t\\tdouble[] returnValues = computeShortestPathLengths(root, 0.0,\\r\\n\\t\\t\\t\\t\\tmaxPathLength, new HashSet<Entity>());\\r\\n\\t\\t\\tmaxPathLength = returnValues[1];\\r\\n\\t\\t\\treturn maxPathLength;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public int minDepth() {\\r\\n\\t\\tint height = Integer.MAX_VALUE;\\r\\n\\t\\tif (left != null)\\r\\n\\t\\t\\theight = Math.min(height, left.height() + 1);\\r\\n\\t\\tif (right != null)\\r\\n\\t\\t\\theight = Math.min(height, right.height() + 1);\\r\\n\\t\\tif (left == null && right == null)\\r\\n\\t\\t\\theight = 0;\\r\\n\\t\\treturn height;\\r\\n\\t}\",\n \"public int diameterOfBinaryTreeBF(TreeNode root) {\\n if (root == null) {\\n return 0;\\n }\\n int leftHeight = height(root.left);\\n int rightHeight = height(root.right);\\n int leftDiameter = diameterOfBinaryTreeBF(root.left);\\n int rightDiameter = diameterOfBinaryTreeBF(root.right);\\n return Math.max((leftHeight + rightHeight), Math.max(leftDiameter, rightDiameter));\\n }\",\n \"public int maxDepht(Node node){\\n //if a tree is empty then return 0\\n if (node == null)\\n return 0;\\n\\n else {\\n //compute the depth of each subtree\\n int leftDepth = maxDepht(node.left);\\n int rightDepth = maxDepht(node.right);\\n\\n if (leftDepth > rightDepth)\\n return leftDepth+1;\\n else\\n return rightDepth+1;\\n }\\n }\",\n \"public static void main(String[] args) \\n { \\n BinaryTree tree = new BinaryTree(); \\n \\n tree.root = new Node(1); \\n tree.root.left = new Node(2); \\n tree.root.right = new Node(3); \\n tree.root.left.left = new Node(4); \\n tree.root.left.right = new Node(5); \\n \\n System.out.println(\\\"Height of tree is : \\\" + \\n tree.maxDepth(tree.root));\\n System.out.println(\\\"Height of tree is by recur : \\\" + \\n tree.heigth(tree.root));\\n System.out.println(\\\"Diameter of tree is : \\\" + \\n tree.getdiameter(tree.root));\\n }\",\n \"public int depthHelp(BSTNode<E,K> node)\\r\\n\\t{\\r\\n\\t\\tint sum1 = 0;\\r\\n\\t\\tint sum2 = 0;\\r\\n\\t\\tif(node.getLeft() != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tsum1 += depthHelp(node.getLeft());\\r\\n\\t\\t}\\r\\n\\t\\tif(node.getRight() != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tsum2 += depthHelp(node.getRight());\\r\\n\\t\\t}\\r\\n\\t\\tif(node.getLeft() == null && node.getRight() == null)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn 1;\\r\\n\\t\\t}\\r\\n\\t\\tif(sum1>sum2)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn sum1 +1;\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn sum2 +1;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private int height(TreeNode<E> node) {\\n\\t\\tif(isEmpty()) //if tree is empty\\n\\t\\t\\treturn 0; //height is 0 for empty tree\\n\\t\\tif(node.right == null && node.left == null) //current node has no children\\n\\t\\t\\treturn 1; //return 1\\n\\t\\tif(node.left == null) //current node has only a right child\\n\\t\\t\\treturn 1 + height(node.right); //return 1 + height of right subtree\\n\\t\\tif(node.right == null) //current node has only a left child\\n\\t\\t\\treturn 1 + height(node.left); //return 1 + height of left subtree\\n\\t\\t//The below cases are for when the current node has two children\\n\\t\\tif(height(node.left) > height(node.right)) //if left height is greater than right height\\n\\t\\t\\treturn 1 + height(node.left); //return 1 + height of left subtree\\n\\t\\telse //if right height is greater than left height\\n\\t\\t\\treturn 1 + height(node.right); //return 1 + height of right subtree\\n\\t}\",\n \"public static <E extends Comparable> int deep(TreeNode<E> root) {\\r\\n \\r\\n Queue<TreeNode<E>> queue = new LinkedList<>();\\r\\n \\r\\n int deep = 0;\\r\\n \\r\\n queue.add(root);\\r\\n TreeNode<E> startNewLine = root;\\r\\n \\r\\n while(!queue.isEmpty()) {\\r\\n TreeNode<E> currentNode = queue.poll();\\r\\n if(currentNode == startNewLine) {\\r\\n startNewLine = null;\\r\\n deep ++;\\r\\n }\\r\\n if(currentNode.getLeft() != null) queue.add(currentNode.getLeft());\\r\\n if(startNewLine == null) {\\r\\n startNewLine = currentNode.getLeft();\\r\\n }\\r\\n if(currentNode.getRight()!= null) queue.add(currentNode.getRight());\\r\\n if(startNewLine == null) {\\r\\n startNewLine = currentNode.getRight();\\r\\n }\\r\\n }\\r\\n \\r\\n \\r\\n return deep;\\r\\n }\",\n \"@Test\\n public void getHeight() {\\n Node node = new Node(150);\\n node.setLeft(new Node(120));\\n node.setRight(new Node(40));\\n Node root = new Node(110);\\n root.setLeft(new Node(80));\\n root.setRight(node);\\n assertEquals(2, BinarySearchTree.getHeight(root));\\n }\",\n \"public int findHeight(Node temp) {\\n\\t\\t\\n\\t\\t\\n\\t\\t//check whether tree is empty\\n\\t\\tif(root==null) {\\n\\t\\t\\t\\n\\t\\t\\tSystem.out.println(\\\"Tree is Empty\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t\\n\\t\\t\\tint leftHeight=0; int rightHeight=0;\\n\\t\\t//Calculate height of left subtree\\n\\t\\t\\tif(temp.left !=null) \\n\\t\\t\\t\\t\\n\\t\\t\\t\\tleftHeight = findHeight(temp.left);\\n\\t\\t\\tif(temp.right !=null) \\n\\t\\t\\t\\t\\n\\t\\t\\t\\trightHeight = findHeight(temp.right);\\n\\t\\t\\t\\t\\n\\t\\t\\tint max = (leftHeight > rightHeight)? leftHeight: rightHeight;\\n\\t\\t\\t\\n\\t\\t\\treturn (max+1);\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public int depth(){\\n if(root!=null){ // มี node ใน tree\\n return height(root);\\n }\\n else {return -1;}\\n }\",\n \"public int getHeight(){\\n\\t\\tint h=maxDepth(root);\\n\\t\\treturn h;\\n\\t}\",\n \"public int solution(Tree T) {\\n if(T == null)\\n {\\n return 0;\\n\\n }\\n //Check if the tree has no children\\n if(T.l == null && T.r == null)\\n {\\n return 0;\\n }\\n\\n\\n AtomicInteger leftSide = new AtomicInteger(0);\\n AtomicInteger rightSide = new AtomicInteger(0);\\n\\n if(T.l != null) traverseTree(T.l, 0, true, leftSide);\\n if(T.r != null) traverseTree(T.r, 0, false, rightSide);\\n\\n\\n if(leftSide.intValue() > rightSide.intValue())\\n {\\n return leftSide.intValue();\\n }\\n else{\\n return rightSide.intValue();\\n }\\n\\n }\",\n \"@Override\\n\\tpublic int height() {\\n\\t\\tif (this.valCount == 0) { // if empty leaf\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tint max = 1; \\n\\t\\tfor (int i = 0; i < childCount; ++i) { // finds longest route among children\\n\\t\\t\\tmax = Math.max(max, children[i].height() + 1);\\n\\t\\t}\\n\\t\\treturn max;\\n\\t}\",\n \"private int heightBST(Node tree) {\\n if (tree == null) {\\n return 0;\\n }\\n return tree.height;\\n }\",\n \"public int depth() { return Math.max(left.depth(), right.depth()) + 1; }\",\n \"private void getSizeDfs(int nodeIdx, int parentNodeIdx){\\r\\n\\t\\tsubTreeSize[nodeIdx] = 1;\\t\\t//include this node\\r\\n\\t\\tmaxSubTreeSize[nodeIdx] = 0;\\t//exclude this node\\r\\n\\t\\t\\r\\n\\t\\t//recursively get the size of children and add up\\r\\n\\t\\tfor(Integer idx: cities[nodeIdx].adjacentNodeIndices){\\r\\n\\t\\t\\tif(parentNodeIdx == idx || visited[idx]) continue;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgetSizeDfs(idx, nodeIdx);\\r\\n\\t\\t\\tsubTreeSize[nodeIdx] += subTreeSize[idx];\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(subTreeSize[idx] > maxSubTreeSize[nodeIdx])\\r\\n\\t\\t\\t\\tmaxSubTreeSize[nodeIdx] = subTreeSize[idx];\\r\\n\\t\\t}\\r\\n\\t}\",\n \"int height(TreeNode root) \\n { \\n if (root == null) \\n return 0; \\n else\\n { \\n /* compute height of each subtree */\\n int lheight = height(root.left); \\n int rheight = height(root.right); \\n \\n /* use the larger one */\\n if (lheight > rheight) \\n return(lheight+1); \\n else return(rheight+1); \\n } \\n }\",\n \"public static int diameter(Graph g) {\\n // Step 1 : Check if a graph is tree or not\\n if (isCyclic(g)) {\\n return -1;\\n }\\n\\n // Step 2 : Pass a random node to a BFS and get a Vertex \\n Random ran = new Random();\\n int noOfVertex = g.verts.size();\\n int randomNode = ran.nextInt((noOfVertex - 1) + 1) + 1;\\n Vertex node = breathFirstSearch(g, g.verts.get(randomNode));\\n\\n //Step 3: Get the random node and do the BFS again\\n node = breathFirstSearch(g, node);\\n\\n return node.distance;\\n }\",\n \"int maxDepth();\",\n \"public static void main(String[] args){\\n\\n// BinaryTree binaryTree = new BinaryTree(1);\\n// binaryTree.insert(\\\"L\\\", 2);\\n// binaryTree.insert(\\\"LL\\\", 4);\\n// binaryTree.insert(\\\"LR\\\", 5);\\n// binaryTree.insert(\\\"R\\\", 3);\\n// binaryTree.getHeight(binaryTree.root);\\n// System.out.println(binaryTree.maxDiameter);\\n\\n Scanner in = new Scanner(System.in);\\n int T = in.nextInt();\\n int X = in.nextInt();\\n BinaryTree binaryTree = new BinaryTree(X);\\n for(int j=0;j<T-1;j++){\\n String where = in.next();\\n int k = in.nextInt();\\n binaryTree.insert(where, k);\\n }\\n binaryTree.getHeight(binaryTree.root);\\n// binaryTree.traverse(binaryTree.root);\\n System.out.println(binaryTree.maxDiameter);\\n }\",\n \"public int depth ( BinTree tree){\\n\\t\\tint x = 1; \\n\\t\\twhile( tree.left != null){\\n\\t\\t\\ttree= tree.left;\\n\\t\\t\\tx++;\\n\\t\\t}\\n\\t\\treturn x;\\n\\t}\",\n \"int get_height(Node node) {\\n\\t\\tif (node == null) \\n\\t\\t\\treturn 0;\\n\\t\\telse if (node.leftChild == null && node.rightChild == null)\\n\\t\\t\\treturn 0;\\t\\t\\n\\t\\telse return 1 + max(get_height(node.leftChild), get_height(node.rightChild));\\n\\t}\",\n \"public static void main(String[] args) {\\n LongestUnivaluePath solution = new LongestUnivaluePath();\\n // Example 1:\\n //Input:\\n //\\n // 5\\n // / \\\\\\n // 4 5\\n // / \\\\ \\\\\\n // 1 1 5\\n //Output: 2\\n TreeNode root = new TreeNode(5);\\n root.left = new TreeNode(4);\\n root.left.left = new TreeNode(1);\\n root.left.right = new TreeNode(1);\\n root.right = new TreeNode(5);\\n root.right.right = new TreeNode(5);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n // Example 2:\\n //Input:\\n //\\n // 1\\n // / \\\\\\n // 4 5\\n // / \\\\ \\\\\\n // 4 4 5\\n //Output: 2\\n root = new TreeNode(1);\\n root.left = new TreeNode(4);\\n root.left.left = new TreeNode(4);\\n root.left.right = new TreeNode(4);\\n root.right = new TreeNode(5);\\n root.right.right = new TreeNode(5);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n\\n // 1\\n // 2 2\\n // 2 2 2\\n // 2\\n // output: 3\\n root = new TreeNode(1);\\n root.left = new TreeNode(2);\\n root.left.left = new TreeNode(2);\\n root.left.left.left = new TreeNode(2);\\n root.left.right = new TreeNode(2);\\n root.right = new TreeNode(2);\\n root.right.right = new TreeNode(2);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n // 1\\n root = new TreeNode(1);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n // empty\\n root = new TreeNode(1);\\n System.out.println(solution.longestUnivaluePath(null));\\n\\n\\n // 1\\n // 3 2\\n // 3 2 2\\n // 2 2\\n // 2 2\\n // 4 2\\n // output: 4\\n root = new TreeNode(1);\\n root.left = new TreeNode(3);\\n root.left.left = new TreeNode(3);\\n root.left.left.left = new TreeNode(2);\\n root.left.right = new TreeNode(2);\\n root.left.right.right = new TreeNode(2);\\n root.left.right.right.left = new TreeNode(2);\\n root.left.right.right.left.left = new TreeNode(4);\\n root.left.right.right.right = new TreeNode(2);\\n root.left.right.right.right.right = new TreeNode(2);\\n root.right = new TreeNode(2);\\n root.right.right = new TreeNode(2);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n //Input :\\n // 2\\n // / \\\\\\n // 7 2\\n // / \\\\ \\\\\\n // 1 1 2\\n //Output : 2\\n root = new TreeNode(2);\\n root.left = new TreeNode(7);\\n root.left.left = new TreeNode(1);\\n root.left.right = new TreeNode(1);\\n root.right = new TreeNode(2);\\n root.right.right = new TreeNode(2);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n //\\n //Input :\\n // 4\\n // / \\\\\\n // 4 4\\n // / \\\\ \\\\\\n // 4 9 5\\n //Output : 3\\n root = new TreeNode(4);\\n root.left = new TreeNode(4);\\n root.left.left = new TreeNode(4);\\n root.left.right = new TreeNode(9);\\n root.right = new TreeNode(4);\\n root.right.right = new TreeNode(5);\\n System.out.println(solution.longestUnivaluePath(root));\\n\\n\\n //\\n //Input :\\n // 4\\n // / \\\\\\n // 4 4\\n // / \\\\ \\\\\\n // 4 9 5\\n // / \\\\\\n // 5 5\\n //Output : 3\\n root = new TreeNode(4);\\n root.left = new TreeNode(4);\\n root.left.left = new TreeNode(4);\\n root.left.right = new TreeNode(9);\\n root.right = new TreeNode(4);\\n root.right.right = new TreeNode(5);\\n root.right.right.left = new TreeNode(5);\\n root.right.right.right = new TreeNode(5);\\n System.out.println(solution.longestUnivaluePath(root));\\n }\",\n \"int depth(BTNode node) {\\n int d = 0;\\n while (node != root) {\\n node = node.parent;\\n d++;\\n }\\n return d;\\n }\",\n \"public int heightNodes(Node N) {\\n if(N == null) return 0;\\n if((N.getRight() == null) && (N.getLeft() == null)) return 0;\\n int left = heightNodes(N.getLeft());\\n int right = heightNodes(N.getRight());\\n\\n if(left > right) return 1 + left;\\n else return 1 + right;\\n\\n }\",\n \"int height(Node root) { return (root != null) ? Math.max(height(root.left), height(root.right)) + 1 : 0;}\",\n \"private int height(Node<T> node){\\n if(node == null){\\n return 0;\\n }else{\\n int leftHight = height(node.left) + 1;\\n int rightHight = height(node.right) + 1;\\n if(leftHight > rightHight){\\n return leftHight;\\n }else{\\n return rightHight;\\n }\\n }\\n }\",\n \"int treeSize() {\\n return\\n memSize()\\n + initializers.listSize()\\n + updaters.listSize()\\n + (optionalConditionExpression == null ? 0 : getExpression().treeSize())\\n + (body == null ? 0 : getBody().treeSize()); }\",\n \"public int longestPath(TreeNode node) {\\n if (node == null) {\\n return 0;\\n }\\n // Get the max length from left and right\\n int maxLeft = longestPath(node.left);\\n int maxRight = longestPath(node.right);\\n // Calculate the current max length\\n int maxLeftSoFar = 0;\\n int maxRightSoFar = 0;\\n // Compare parent node with child node\\n // If they are the same, extend the max length by one\\n if (node.left != null && node.left.val == node.val) {\\n maxLeftSoFar = maxLeft + 1;\\n }\\n if (node.right != null && node.right.val == node.val) {\\n maxRightSoFar = maxRight + 1;\\n }\\n // Update the max with the sum of left and right length\\n max = Math.max(max, maxLeftSoFar + maxRightSoFar);\\n // Return the max from left and right to upper node\\n // since only one side path is valid\\n return Math.max(maxLeftSoFar, maxRightSoFar);\\n }\",\n \"private static int getTreeSize(int totalSize) {\\n if (totalSize <= 32) {\\n return 0;\\n } else {\\n // TODO: Clojure does ((realSize - 1) >>> 5) << 5); is that faster?\\n return ((totalSize - 1) & (~0x1F));\\n }\\n }\",\n \"int height(Node node) {\\r\\n\\t\\tif (node == null) {\\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\t}\\r\\n\\t\\tint left = height(node.left);\\r\\n\\t\\tint right = height(node.right);\\r\\n\\t\\tint max = Integer.max(left, right);\\r\\n\\t\\treturn max + 1;\\r\\n\\t}\",\n \"public int depth(){\\n\\t\\tint depth = 0;\\n\\t\\tif(this.isEmpty()){\\n\\t\\t\\treturn depth;\\n\\t\\t} else {\\n\\t\\t\\tdepth= 1;\\n\\t\\t}\\n\\t\\tQueue queue = new Queue();\\n\\t\\tqueue.enqueue(this);\\n\\t\\t\\n\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\tBinaryTree tree = (BinaryTree) queue.dequeue();\\n\\t\\t\\tif(tree.left.getElement()!=null){\\n\\t\\t\\t\\tqueue.enqueue(tree.left);\\n\\t\\t\\t\\tdepth++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn depth;\\n\\t}\",\n \"private int getHeightofNode(TreeNode node){\\n if (node == null) return 0;\\n if (getColor(node) == RED) {\\n return Math.max(getHeightofNode(node.left), getHeightofNode(node.right));\\n } else {\\n return Math.max(getHeightofNode(node.left), getHeightofNode(node.right))+1;\\n }\\n }\",\n \"private int getDepthRecursive(Node currNode) {\\n int max = 0;\\n int val;\\n\\n // Return 0 if this Node is null or if it is invalid.\\n if (currNode == null || currNode.key < 0) return 0;\\n\\n // Finds the maximum depth of this Node's subtrees.\\n for (int i = 0; i < getNumChildren(); ++i) {\\n val = getDepthRecursive(currNode.children[i]);\\n max = Math.max(max, val);\\n\\n }\\n\\n // Returns the maximum depth of this Node's subtree plus one.\\n return max + 1;\\n\\n }\",\n \"private static int maxDepth(TreeNode node) {\\r\\n\\t\\tif (node == null) return 0;\\r\\n\\t\\treturn 1 + Math.max(maxDepth(node.left), maxDepth(node.right));\\r\\n\\t}\",\n \"public int height(){\\r\\n \\r\\n // call the recursive method with the root\\r\\n return height(root);\\r\\n }\",\n \"public int size() {\\n if (root == null) return 0;\\n if (root.left == null && root.right == null) return 1;\\n else {\\n int treeSize = 0;\\n treeSize = size(root, treeSize);\\n return treeSize;\\n }\\n }\",\n \"public int calculateSize(NoArvore tree)\\n {\\n int size = 0;\\n if (tree == null)\\n return 0;\\n else {\\n size = calculateSize (tree.getEsquerda()) + calculateSize (tree.getDireita()) + 1;\\n return size;\\n }\\n }\",\n \"int depth();\",\n \"int depth();\",\n \"int getRecursionDepth();\",\n \"private Integer getDepth(BinaryNode node, int depth) {\\n\\n if (node == null) return depth;\\n else return Math.max(getDepth(node.left, depth + 1),getDepth(node.right, depth + 1));\\n }\",\n \"public int height(){\\n int level=0;\\n \\n //if is empty, we finish\\n if(this.isEmpty()){\\n return level;\\n \\n \\n }else{\\n //count this level and check the level under its childs recursively\\n int levelSubTree1,levelSubTree2;\\n \\n levelSubTree1=1 + this.right.height();\\n levelSubTree2=1 + this.left.height();\\n \\n //get the higher height\\n if(levelSubTree1> levelSubTree2){\\n level=levelSubTree1;\\n }else{\\n level=levelSubTree2;\\n }\\n }\\n return level;\\n }\",\n \"public int height()\\r\\n {\\r\\n if(this.isLeaf())\\r\\n {\\r\\n return 0;\\r\\n }\\r\\n else if (this.getLeft()!=null&&this.getRight()==null)\\r\\n {\\r\\n return this.getLeft().height()+1;\\r\\n }\\r\\n else if(this.getLeft()==null&&this.getRight()!=null)\\r\\n {\\r\\n return this.getRight().height()+1;\\r\\n }\\r\\n else\\r\\n {\\r\\n return Math.max(this.getLeft().height(),this.getRight().height())+1;\\r\\n }\\r\\n }\",\n \"int height(Node root) {\\n\\t\\tif (root == null)\\n\\t\\t\\treturn 0;\\n\\t\\telse {\\n\\t\\t\\t/* compute height of each subtree */\\n\\t\\t\\tint lheight = height(root.left);\\n\\n\\t\\t\\tint rheight = height(root.right);\\n\\n\\t\\t\\t/* use the larger one */\\n\\t\\t\\tif (lheight > rheight) {\\n\\t\\t\\t\\t//System.out.println(\\\"lheight : \\\" + lheight + \\\" rheight : \\\" + rheight + \\\" root data : \\\" + root.data);\\n\\t\\t\\t\\treturn (lheight + 1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//System.out.println(\\\"lheight : \\\" + lheight + \\\" rheight : \\\" + rheight + \\\" root data : \\\" + root.data);\\n\\t\\t\\t\\treturn (rheight + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public int maxDepth2(Node root) {\\r\\n\\t\\tif(root == null) {\\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tQueue<Node> queue = new LinkedList<Node>();\\r\\n\\t\\tqueue.offer(root);\\r\\n\\t\\t\\r\\n\\t\\tint depth = 0;\\r\\n\\t\\t\\r\\n\\t\\twhile(!queue.isEmpty()) {\\r\\n\\t\\t\\tint levelSize = queue.size();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tdepth++;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int i=0; i<levelSize; i++) {\\r\\n\\t\\t\\t\\tNode current = queue.poll();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor(Node node : current.children) {\\r\\n\\t\\t\\t\\t\\tqueue.offer(node);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn depth;\\r\\n\\t}\",\n \"private int height( BinaryNode<AnyType> t )\\r\\n\\t{\\r\\n\\t\\tif( t == null )\\r\\n\\t\\t\\treturn -1;\\r\\n\\t\\telse\\r\\n\\t\\t\\treturn 1 + Math.max( height( t.left ), height( t.right ) ); \\r\\n\\t}\",\n \"private int height(BSTNode<K, V> node) {\\r\\n if (node == null) {\\r\\n return 0;\\r\\n } else {\\r\\n if (height(node.left) >= height(node.right)) {\\r\\n return 1 + height(node.left);\\r\\n } else {\\r\\n return 1 + height(node.right);\\r\\n }\\r\\n }\\r\\n }\",\n \"private int recSize(BSTNode<T> node) {\\n\\t\\tif (node == null)\\n\\t\\t\\treturn 0;\\n\\t\\telse\\n\\t\\t\\treturn recSize(node.getLeft()) + recSize(node.getRight()) + 1;\\n\\t}\",\n \"int height(Node root)\\n {\\n if (root == null)\\n return 0;\\n else\\n {\\n /* compute height of each subtree */\\n int lheight = height(root.left);\\n int rheight = height(root.right);\\n\\n /* use the larger one */\\n if (lheight > rheight)\\n return(lheight+1);\\n else return(rheight+1);\\n }\\n }\",\n \"public int computeHeight(Node root){\\n\\t if(root == null)\\n\\t return 0;\\n\\t /* Calculate recursively */\\n\\t return Math.max(computeHeight(root.leftChild), computeHeight(root.rightChild)) + 1;\\n\\t }\",\n \"private static int height(TreeNode n){\\n\\t\\tif(n==null)\\n\\t\\t\\treturn 0;\\n\\t\\treturn 1+Math.max(height(n.left), height(n.right));\\n\\t}\",\n \"public int treeHeight() {\\n return height(root);\\n }\",\n \"int height(Node root) {\\n\\t\\tif (root == null)\\n\\t\\t\\treturn 0;\\n\\t\\telse {\\n\\t\\t\\t //compute height of each subtree \\n\\t\\t\\tint lheight = height(root.left);\\n\\t\\t\\tint rheight = height(root.right);\\n\\n\\t\\t\\t// use the larger one \\n\\t\\t\\tif (lheight > rheight)\\n\\t\\t\\t\\treturn (lheight + 1);\\n\\t\\t\\telse\\n\\t\\t\\t\\treturn (rheight + 1);\\n\\t\\t}\\n\\t}\",\n \"public int getHeight(){ \\n\\t if (left == null && right == null){\\n\\t\\treturn 1;\\n\\t }else if (left == null){\\n\\t\\treturn 1 + right.getHeight();\\n\\t }else if (right == null){\\n\\t\\treturn 1 + left.getHeight();\\n\\t }else{\\n\\t\\tif (right.getHeight() >= left.getHeight()){\\n\\t\\t return 1 + right.getHeight();\\n\\t\\t}else{\\n\\t\\t return 1 + left.getHeight();\\n\\t\\t}\\n\\t }\\n\\t}\",\n \"private int height(BinaryNode<AnyType> t) {\\r\\n\\t\\tif (t == null)\\r\\n\\t\\t\\treturn -1;\\r\\n\\t\\telse\\r\\n\\t\\t\\treturn 1 + Math.max(height(t.left), height(t.right));\\r\\n\\t}\",\n \"private int calcHeight(ChartOptions options) {\\n Node n = this; // current node in the level\\n int realHeight = 0;\\n boolean samelevel = true; // next node in same level?\\n while (n != null && samelevel) {\\n int tmpHeight = 0;\\n if (n.typ.matches(NodeType.TERM, NodeType.NONTERM, NodeType.EXCEPTION)) {\\n tmpHeight = n.size.getHeight();\\n } else if (n.typ == NodeType.ITER) {\\n tmpHeight = n.sub.calcHeight(options);\\n } else if (n.typ == NodeType.OPT) {\\n tmpHeight = n.sub.calcHeight(options);\\n } else if (n.typ == NodeType.PREDICATE) {\\n tmpHeight = n.size.getHeight();\\n } else if (n.typ == NodeType.RERUN) {\\n tmpHeight = n.sub.calcHeight(options);\\n } else if (n.typ == NodeType.ALT) {\\n tmpHeight = n.sub.calcHeight(options);\\n } else if (n.typ == NodeType.EPS) {\\n tmpHeight = options.fontHeight() * 3 / 2;\\n if (realHeight < tmpHeight) {\\n tmpHeight = options.fontHeight()\\n + options.componentGapHeight();\\n } else {\\n tmpHeight = 0;\\n }\\n }\\n realHeight = Math.max(realHeight, tmpHeight);\\n if (n.up) {\\n samelevel = false;\\n }\\n n = n.next;\\n }\\n return realHeight;\\n }\",\n \"int getMax_depth();\",\n \"public static int diameter(Graph graph) {\\n Set<List<Vertex>> listSetVertex=breadthFirstSearch(graph);\\n int distance=0;\\n for(List<Vertex> lv: listSetVertex){\\n for(Vertex va:lv){\\n for(Vertex vb:lv){\\n if(va.equals(vb)){\\n continue;\\n }\\n int shortDistance=shortestDistance(graph, va, vb);\\n distance=distance<shortDistance?shortDistance:distance;\\n }\\n }\\n\\n }\\n return distance; // this should be changed\\n }\",\n \"public double getDepth();\",\n \"int treeSize() {\\n return memSize() + (this.expression == null ? 0 : getExpression().treeSize()) + (this.typeArguments == null ? 0 : this.typeArguments.listSize()) + (this.methodName == null ? 0 : getName().treeSize());\\n }\",\n \"public int height(Node node) \\n {\\n \\t if (node == null) return 0;\\n \\t return 1 + max(height(node.left), height(node.right));\\n }\",\n \"int depth(Node root) {\\n\\t\\tif (root == null) return 0;\\n\\t\\treturn Math.max(depth(root.left), depth(root.right)) + 1 ;\\n\\t}\",\n \"private int getHeight(Node n) {\\n\\t\\tif (n==null)\\n\\t\\t\\treturn 0;\\n\\t\\tint heightLeft = getHeight(n.left);\\n\\t\\tif (heightLeft==-1)\\n\\t\\t\\treturn -1;\\n\\t\\t\\n\\t\\tint heightRight = getHeight(n.right);\\n\\t\\tif (heightRight==-1) \\n\\t\\t\\treturn -1;\\n\\t\\t\\n\\t\\tif(Math.abs(heightRight-heightLeft) > 1)\\n\\t\\t\\treturn -1;\\n\\t\\telse\\n\\t\\t\\treturn 1+Math.max(getHeight(n.left), getHeight(n.right));\\n\\t}\",\n \"private static int height(TreeNode node) {\\n\\t\\t\\n\\t\\tif(node == null)\\n\\t\\t\\treturn 0;\\n\\n\\t\\treturn (Math.max(height(node.left) , height(node.right)) + 1);\\n\\t}\",\n \"public int getDepth(HuffmanTreeNode node) {\\n\\t\\tif (node == null)\\n\\t\\t\\treturn 0;\\n\\t\\telse {\\n\\t\\t\\tint leftDepth = getDepth(node.getLeft());\\n\\t\\t\\tint rightDepth = getDepth(node.getRight());\\n\\t\\t\\t\\n\\t\\t\\tif (leftDepth > rightDepth)\\n\\t\\t\\t\\treturn (leftDepth+1);\\n\\t\\t\\telse\\n\\t\\t\\t\\treturn (rightDepth+1);\\n\\t\\t}\\n\\t}\",\n \"public int calculateNodeDepth(Node startNode) {\\n\\t\\tint depthCounter = 0;\\n\\t\\t// start from zero\\n\\t\\tif (!(startNode == this.mRoot)) {\\n\\t\\t\\twhile (startNode.getParent() != this.mRoot) {\\n\\t\\t\\t\\tstartNode = startNode.getParent();\\n\\t\\t\\t\\tdepthCounter++;\\n\\t\\t\\t\\t// count upwards while the node's parent is not root\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\treturn depthCounter;\\n\\t\\t// return the count\\n\\t}\",\n \"public int depth ();\",\n \"int treeSize() {\\r\\n\\t\\treturn\\r\\n\\t\\t\\tmemSize()\\r\\n\\t\\t\\t+ (this.expression == null ? 0 : getExpression().treeSize())\\r\\n\\t\\t\\t+ (this.newArguments.listSize())\\r\\n\\t\\t\\t+ (this.constructorArguments.listSize())\\r\\n\\t\\t\\t+ (this.baseClasses.listSize())\\r\\n\\t\\t\\t+ (this.declarations.listSize())\\r\\n\\t;\\r\\n\\t}\",\n \"public int height(Node root) {\\n if(root!=null) {\\n if(root.left == null && root.right ==null) {\\n return 0;\\n }\\n return maxDepth(height(root.left), height(root.right)) + 1;\\n } else {\\n return 0;\\n }\\n }\",\n \"public int treeHigh(TreeNode node) \\n { \\n if (node == null) \\n return 0; \\n else \\n { \\n /* compute the depth of each subtree */\\n int lDepth = treeHigh(node.left); \\n int rDepth = treeHigh(node.right); \\n \\n /* use the larger one */\\n if (lDepth > rDepth) \\n return (lDepth + 1); \\n else \\n return (rDepth + 1); \\n } \\n }\",\n \"private int height(BSTNode root) {\\r\\n \\r\\n // if the root is null, return 0\\r\\n if (null == root) {\\r\\n \\r\\n return 0;\\r\\n }\\r\\n \\r\\n // find the height of the left subtree\\r\\n int heightLeftSub = height(root.left);\\r\\n \\r\\n // find the height of the right subtree\\r\\n int heightRightSub = height(root.right);\\r\\n \\r\\n // return the greatest subtree value plus 1 for the height\\r\\n return Math.max(heightLeftSub, heightRightSub) + 1; \\r\\n }\",\n \"public interface MaximumDepthOfBinaryTree {\\n int maxDepth(TreeNode root);\\n}\",\n \"int height(Node node){\\r\\n\\t\\tif( node == null ) {\\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\t}\\r\\n\\t\\treturn Math.max( height(node.left), height(node.right) ) + 1 ;\\r\\n\\t}\",\n \"public static int depth(Node root, Node node){\\n\\n if(node!=root){ // node มีตัวตน\\n return 1 + depth (root,node.parent) ; // depth = length(path{node->root})\\n\\n }\\n else {\\n return 0;\\n }\\n\\n }\",\n \"public int size(){\\n if(root!=null){ // มี node ใน tree\\n return size(root);\\n }\\n else{\\n return 0; // tree เปล่า size 0\\n }\\n }\",\n \"int getTemporaryMaxDepth();\",\n \"private int getDepthRaw(TreeNode root){\\n if (root == null) {\\n return 0;\\n }\\n\\n int left = getDepthRaw(root.left);\\n int right = getDepthRaw(root.right);\\n if (left == -1 || right == -1) {\\n return -1;\\n }else{\\n if (Math.abs(left - right) > 1) {\\n return -1;\\n }else{\\n return Math.max(left, right) + 1;\\n }\\n }\\n }\",\n \"private static double weightedNodeHeightHelper(PhyloTreeNode node) {\\n if(node == null) {\\n return 0;\\n }\\n else{\\n return Math.max(node.getDistanceToChild() + weightedNodeHeightHelper(node.getLeftChild()),\\n node.getDistanceToChild() + weightedNodeHeightHelper(node.getRightChild()));\\n }\\n }\",\n \"public static int height(BinaryTreeNode<Integer> root) {\\n if(root == null){\\n return 0;\\n }\\n int sum = 0;\\n if(root.leftChild != null){\\n sum = Math.max(sum, height(root.leftChild));\\n }\\n if(root.rightChild != null){\\n sum = Math.max(sum, height(root.rightChild));\\n }\\n return sum+1;\\n }\",\n \"public int totalPathLength(BSTnode<K> n, int num) {\\n\\t\\tif (n == null) {\\n\\t\\t\\treturn num;// return pathlength to that point\\n\\t\\t}\\n\\t\\tnum++;// increment pathlength\\n\\t\\tif (n.getLeft() == null && n.getRight() == null) {\\n\\t\\t\\treturn num;// return pathlength to that point\\n\\t\\t} else {\\n\\t\\t\\t// return totalPathLengths of right and left subtrees\\n\\t\\t\\treturn totalPathLength(n.getLeft(), num) + totalPathLength(n.getRight(), num);\\n\\t\\t}\\n\\t}\",\n \"public int treeDepth(TreeNode root){\\n if(root == null){\\n return 0;\\n }\\n return 1 + Math.max(treeDepth(root.left), treeDepth(root.right));\\n }\",\n \"public int numTrees(int n) {\\n if(n<=1)\\n return 1;\\n int[] dp = new int[n+1];\\n dp[0] = 1;\\n dp[1] = 1;\\n dp[2] = 2;\\n \\n for(int i=3;i<=n;i++){\\n int sum = 0;\\n for(int a=0;a<i;a++){\\n sum+=dp[0+a]*dp[i-1-a];\\n }\\n dp[i] = sum;\\n //if i is odd then add the i/2 dp after you multiply by 2\\n }\\n return dp[n];\\n }\",\n \"static int maximumDepth( TreeNode node, int depth ) {\\n if ( node == null ) {\\n // The tree is empty. Return 0.\\n return 0;\\n }\\n else if ( node.left == null && node.right == null) {\\n // The node is a leaf, so the maximum depth in this\\n // subtree is the depth of this node (the only leaf \\n // that it contains).\\n return depth;\\n }\\n else {\\n // Get the maximum depths for the two subtrees of this\\n // node. Return the larger of the two values, which\\n // represents the maximum in the tree overall.\\n int leftMax = maximumDepth(node.left, depth + 1);\\n int rightMax = maximumDepth(node.right, depth + 1);\\n if (leftMax > rightMax)\\n return leftMax;\\n else\\n return rightMax;\\n }\\n }\",\n \"public int treeSize(BinaryTreeNode root) {\\n\\t\\tint size = 0;\\n\\t\\tif (root == null) {\\n\\t\\t\\treturn 0;\\n\\t\\t} else {\\n\\t\\t\\tBinaryTreeNode temp;\\n\\t\\t\\tQueue<BinaryTreeNode> q = new LinkedList<BinaryTreeNode>();\\n\\t\\t\\tq.add(root);\\n\\n\\t\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t\\ttemp = q.poll();\\n\\t\\t\\t\\tsize++;\\n\\t\\t\\t\\tif (temp.getLeft() != null)\\n\\t\\t\\t\\t\\tq.add(temp.getLeft());\\n\\t\\t\\t\\tif (temp.getRight() != null)\\n\\t\\t\\t\\t\\tq.add(temp.getRight());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn size;\\n\\t}\",\n \"public static int getNodeDepth(BinaryTreeNode node) {\\n int depth = 0;\\n while (node != null) {\\n node = node.parent;\\n depth++;\\n }\\n return depth;\\n }\",\n \"public double getTreeSize()\\n {\\n return treesize; \\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6939645","0.6825121","0.6787434","0.6785547","0.6697764","0.6617622","0.6600313","0.65899205","0.6559915","0.6532196","0.6423342","0.64022285","0.639164","0.63834673","0.6380965","0.63644403","0.6362598","0.6360202","0.635288","0.63322145","0.63317895","0.63312817","0.6318241","0.62746406","0.6262702","0.62391806","0.62021464","0.61624324","0.6146244","0.6137","0.6135519","0.6119047","0.6103544","0.6097815","0.60939956","0.60936624","0.60884476","0.60752165","0.60742414","0.6066226","0.6061463","0.6055092","0.6045317","0.6040068","0.6037863","0.6029614","0.6015395","0.6004859","0.59983236","0.5997544","0.59755933","0.5966994","0.5966994","0.5954007","0.5951195","0.59506315","0.5948249","0.59457946","0.59448034","0.5944548","0.5943597","0.5938942","0.5936446","0.5931325","0.59237957","0.59233457","0.59156555","0.5903061","0.5901826","0.59003603","0.58938676","0.5892433","0.5890194","0.58661485","0.5865479","0.5862721","0.584794","0.58436716","0.5835676","0.5822754","0.5812124","0.5801654","0.5762625","0.5762539","0.5747911","0.57424414","0.5728017","0.5725018","0.5722494","0.5718316","0.5715889","0.5715185","0.5714678","0.57107943","0.57104546","0.57049865","0.57048845","0.57009506","0.5696714","0.56963944"],"string":"[\n \"0.6939645\",\n \"0.6825121\",\n \"0.6787434\",\n \"0.6785547\",\n \"0.6697764\",\n \"0.6617622\",\n \"0.6600313\",\n \"0.65899205\",\n \"0.6559915\",\n \"0.6532196\",\n \"0.6423342\",\n \"0.64022285\",\n \"0.639164\",\n \"0.63834673\",\n \"0.6380965\",\n \"0.63644403\",\n \"0.6362598\",\n \"0.6360202\",\n \"0.635288\",\n \"0.63322145\",\n \"0.63317895\",\n \"0.63312817\",\n \"0.6318241\",\n \"0.62746406\",\n \"0.6262702\",\n \"0.62391806\",\n \"0.62021464\",\n \"0.61624324\",\n \"0.6146244\",\n \"0.6137\",\n \"0.6135519\",\n \"0.6119047\",\n \"0.6103544\",\n \"0.6097815\",\n \"0.60939956\",\n \"0.60936624\",\n \"0.60884476\",\n \"0.60752165\",\n \"0.60742414\",\n \"0.6066226\",\n \"0.6061463\",\n \"0.6055092\",\n \"0.6045317\",\n \"0.6040068\",\n \"0.6037863\",\n \"0.6029614\",\n \"0.6015395\",\n \"0.6004859\",\n \"0.59983236\",\n \"0.5997544\",\n \"0.59755933\",\n \"0.5966994\",\n \"0.5966994\",\n \"0.5954007\",\n \"0.5951195\",\n \"0.59506315\",\n \"0.5948249\",\n \"0.59457946\",\n \"0.59448034\",\n \"0.5944548\",\n \"0.5943597\",\n \"0.5938942\",\n \"0.5936446\",\n \"0.5931325\",\n \"0.59237957\",\n \"0.59233457\",\n \"0.59156555\",\n \"0.5903061\",\n \"0.5901826\",\n \"0.59003603\",\n \"0.58938676\",\n \"0.5892433\",\n \"0.5890194\",\n \"0.58661485\",\n \"0.5865479\",\n \"0.5862721\",\n \"0.584794\",\n \"0.58436716\",\n \"0.5835676\",\n \"0.5822754\",\n \"0.5812124\",\n \"0.5801654\",\n \"0.5762625\",\n \"0.5762539\",\n \"0.5747911\",\n \"0.57424414\",\n \"0.5728017\",\n \"0.5725018\",\n \"0.5722494\",\n \"0.5718316\",\n \"0.5715889\",\n \"0.5715185\",\n \"0.5714678\",\n \"0.57107943\",\n \"0.57104546\",\n \"0.57049865\",\n \"0.57048845\",\n \"0.57009506\",\n \"0.5696714\",\n \"0.56963944\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7320134"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":34697,"cells":{"query":{"kind":"string","value":"BEGIN: Added by zhanghongxing at 20130109 for full preview"},"document":{"kind":"string","value":"public static String initialVideoQuality(Context context, int currentCameraId) {\n int backCameraId = CameraHolder.instance().getBackCameraId();\n String defaultStr = null;\n if (currentCameraId == backCameraId) {\n// defaultStr = context.getString(R.string.pref_back_video_quality_default);\n defaultStr = SystemProperties.get(BACK_CAMERA_DEFAULT_VIDEO_QUALITY_VALUE,\"\");\n } else {\n// defaultStr = context.getString(R.string.pref_front_video_quality_default);\n defaultStr = SystemProperties.get(FRONT_CAMERA_DEFAULT_VIDEO_QUALITY_VALUE,\"\");\n }\n int quality = 0;\n if(defaultStr == null || defaultStr.length() < 1) {\n ArrayList<String> supprotedQuality = getSupportedVideoQuality();\n String[] candidateArray = (currentCameraId == backCameraId) ? \n context.getResources().getStringArray(R.array.pref_video_quality_entryvalues):\n context.getResources().getStringArray(R.array.pref_front_video_quality_entryvalues);\n for(String candidate:candidateArray) {\n if(supprotedQuality.indexOf(candidate) >= 0) {\n defaultStr = candidate;\n break;\n }\n }\n }\n\n if(defaultStr != null) {\n quality = Integer.valueOf(defaultStr);\n if (CamcorderProfile.hasProfile(currentCameraId, quality)) {\n SharedPreferences.Editor editor = ComboPreferences\n .get(context).edit();\n editor.putString(KEY_VIDEO_QUALITY, defaultStr);\n editor.apply();\n return defaultStr;\n }\n }\n return Integer.toString(CamcorderProfile.QUALITY_HIGH);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["@Override\n public void func_104112_b() {\n \n }","@Override\r\n\tprotected void doF4() {\n\t\t\r\n\t}","public void mo38117a() {\n }","@Override\n\tpublic void grabar() {\n\t\t\n\t}","@Override\n\tpublic void show4() {\n\t\t\n\t}","protected boolean func_70814_o() { return true; }","@Override\r\n\tprotected void doF8() {\n\t\t\r\n\t}","public void mo4359a() {\n }","@Override\n public void perish() {\n \n }","@Override\n\tprotected void update() {\n\t\t\n\t}","@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}","@Override\n public void inizializza() {\n\n super.inizializza();\n }","@Override\r\n\tprotected void doF6() {\n\t\t\r\n\t}","public final void mo51373a() {\n }","@Override\n\tprotected void getExras() {\n\n\t}","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","@Override\n\tpublic void view() {\n\t\t\n\t}","@Override\r\n\tpublic void tires() {\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","private static void cajas() {\n\t\t\n\t}","@Override\n\tpublic void gravarBd() {\n\t\t\n\t}","@Override\r\n\tprotected void func03() {\n\t\t\r\n\t}","public void mo55254a() {\n }","@Override\n\tpublic void comer() {\n\t\t\n\t}","private static void previewBb() {\n try {\n populateBillboard();\n billboard.previewBillboard();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }","public void designBasement() {\n\t\t\r\n\t}","@Override\n\tpublic void ligar() {\n\t\t\n\t}","@Override\r\n\tvoid func04() {\n\t\t\r\n\t}","@Override\n\tpublic void anular() {\n\n\t}","public void autoDetails() {\n\t\t\r\n\t}","protected void previewStarted() {\n\n }","@Override\n\tprotected void interr() {\n\t}","private void kk12() {\n\n\t}","public void gored() {\n\t\t\n\t}","private stendhal() {\n\t}","@Override\n\tprotected void initdata() {\n\n\t}","protected boolean func_70041_e_() { return false; }","@Override\n public int describeContents() { return 0; }","@Override\r\n\tprotected void doF3() {\n\t\t\r\n\t}","public void mo12628c() {\n }","@Override\n public void settings() {\n // TODO Auto-generated method stub\n \n }","@Override\r\n\t\t\tpublic void func02() {\n\t\t\t\t\r\n\t\t\t}","public static void listing5_14() {\n }","@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","public void mo12930a() {\n }","static void feladat4() {\n\t}","public void mo68520e() {\n super.mo68520e();\n C26780aa.m87959a(this.itemView, mo75290r(), this.f77546j);\n C24942al.m81837c(mo75261ab(), this.f89221bo);\n C24958f.m81905a().mo65273b(this.f77546j).mo65266a(\"result_ad\").mo65276b(\"otherclick\").mo65283e(\"video\").mo65270a(mo75261ab());\n }","public void mo6081a() {\n }","@Override\n\tpublic void entrenar() {\n\t\t\n\t}","private void m50366E() {\n }","@Override\r\n\tpublic void dormir() {\n\t\t\r\n\t}","Editor mo117962b();","public anywheresoftware.b4a.objects.PanelWrapper _asview() throws Exception{\nif (true) return _wholescreen;\n //BA.debugLineNum = 37;BA.debugLine=\"End Sub\";\nreturn null;\n}","@Override\n\tpublic void preUpdate() {\n\n\t}","@Override\n\tpublic void onLoad() {\n\t\t\n\t}","default void show1() {\n\t\t\n\t\t\n\t}","private void createDisplayEditOverlay() {\n\t}","private void strin() {\n\n\t}","@Override\n\t\t\t\t\t\t\tpublic void onFbcompleate() {\n\n\t\t\t\t\t\t\t}","static void feladat9() {\n\t}","@Override\n protected void getExras() {\n }","@Override\n\t\t\tpublic void ic() {\n\t\t\t\t\n\t\t\t}","@Override\r\n\tprotected void doF7() {\n\t\t\r\n\t}","@Override\r\n\tpublic void rozmnozovat() {\n\t}","public void mo115190b() {\n }","public void mo9848a() {\n }","@Override\r\n\tprotected void InitData() {\n\t\t\r\n\t}","@Override\n\tprotected void initData() {\n\t\t\n\t}","@Override\n\tpublic void pausaParaComer() {\n\n\t}","protected void mo6255a() {\n }","public void mo21825b() {\n }","@Override\n\tpublic void nadar() {\n\t\t\n\t}","public void mo1531a() {\n }","public void skystonePos4() {\n }","public void m23075a() {\n }","@Override\r\n\tpublic void publierEnchere() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\r\n\t}","@Override\r\n\tpublic void stehReagieren() {\r\n\t\t//\r\n\t}","@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","private void edit() {\n\n\t}","@Override\r\n\tpublic void anularFact() {\n\t\t\r\n\t}","@Override\n\tpublic void nghe() {\n\n\t}","@Override\r\n\tpublic void display() {\n\r\n\t}","public void skystonePos6() {\n }","@Override\n\tprotected void UpdateUI() {\n\t\t\n\t}","@Override\n\tprotected void UpdateUI() {\n\t\t\n\t}","@Override\r\n\tpublic void display() {\n\t\t\r\n\t}","@Override\r\n\tpublic void display() {\n\t\t\r\n\t}","@Override\r\n\t\tpublic void init() {\n\t\t\t\r\n\t\t}","@Override\n public int describeContents() {\n// ignore for now\n return 0;\n }","ZHDraweeView mo91981h();","@Override\r\n\tpublic void dispase() {\n\r\n\t}","public static void listing5_16() {\n }","private void m50367F() {\n }"],"string":"[\n \"@Override\\n public void func_104112_b() {\\n \\n }\",\n \"@Override\\r\\n\\tprotected void doF4() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo38117a() {\\n }\",\n \"@Override\\n\\tpublic void grabar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void show4() {\\n\\t\\t\\n\\t}\",\n \"protected boolean func_70814_o() { return true; }\",\n \"@Override\\r\\n\\tprotected void doF8() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo4359a() {\\n }\",\n \"@Override\\n public void perish() {\\n \\n }\",\n \"@Override\\n\\tprotected void update() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void comer() \\r\\n\\t{\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n public void inizializza() {\\n\\n super.inizializza();\\n }\",\n \"@Override\\r\\n\\tprotected void doF6() {\\n\\t\\t\\r\\n\\t}\",\n \"public final void mo51373a() {\\n }\",\n \"@Override\\n\\tprotected void getExras() {\\n\\n\\t}\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"@Override\\n\\tpublic void view() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void tires() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"private static void cajas() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void gravarBd() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tprotected void func03() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo55254a() {\\n }\",\n \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"private static void previewBb() {\\n try {\\n populateBillboard();\\n billboard.previewBillboard();\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public void designBasement() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void ligar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tvoid func04() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void anular() {\\n\\n\\t}\",\n \"public void autoDetails() {\\n\\t\\t\\r\\n\\t}\",\n \"protected void previewStarted() {\\n\\n }\",\n \"@Override\\n\\tprotected void interr() {\\n\\t}\",\n \"private void kk12() {\\n\\n\\t}\",\n \"public void gored() {\\n\\t\\t\\n\\t}\",\n \"private stendhal() {\\n\\t}\",\n \"@Override\\n\\tprotected void initdata() {\\n\\n\\t}\",\n \"protected boolean func_70041_e_() { return false; }\",\n \"@Override\\n public int describeContents() { return 0; }\",\n \"@Override\\r\\n\\tprotected void doF3() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo12628c() {\\n }\",\n \"@Override\\n public void settings() {\\n // TODO Auto-generated method stub\\n \\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void func02() {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"public static void listing5_14() {\\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"public void mo12930a() {\\n }\",\n \"static void feladat4() {\\n\\t}\",\n \"public void mo68520e() {\\n super.mo68520e();\\n C26780aa.m87959a(this.itemView, mo75290r(), this.f77546j);\\n C24942al.m81837c(mo75261ab(), this.f89221bo);\\n C24958f.m81905a().mo65273b(this.f77546j).mo65266a(\\\"result_ad\\\").mo65276b(\\\"otherclick\\\").mo65283e(\\\"video\\\").mo65270a(mo75261ab());\\n }\",\n \"public void mo6081a() {\\n }\",\n \"@Override\\n\\tpublic void entrenar() {\\n\\t\\t\\n\\t}\",\n \"private void m50366E() {\\n }\",\n \"@Override\\r\\n\\tpublic void dormir() {\\n\\t\\t\\r\\n\\t}\",\n \"Editor mo117962b();\",\n \"public anywheresoftware.b4a.objects.PanelWrapper _asview() throws Exception{\\nif (true) return _wholescreen;\\n //BA.debugLineNum = 37;BA.debugLine=\\\"End Sub\\\";\\nreturn null;\\n}\",\n \"@Override\\n\\tpublic void preUpdate() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void onLoad() {\\n\\t\\t\\n\\t}\",\n \"default void show1() {\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"private void createDisplayEditOverlay() {\\n\\t}\",\n \"private void strin() {\\n\\n\\t}\",\n \"@Override\\n\\t\\t\\t\\t\\t\\t\\tpublic void onFbcompleate() {\\n\\n\\t\\t\\t\\t\\t\\t\\t}\",\n \"static void feladat9() {\\n\\t}\",\n \"@Override\\n protected void getExras() {\\n }\",\n \"@Override\\n\\t\\t\\tpublic void ic() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"@Override\\r\\n\\tprotected void doF7() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void rozmnozovat() {\\n\\t}\",\n \"public void mo115190b() {\\n }\",\n \"public void mo9848a() {\\n }\",\n \"@Override\\r\\n\\tprotected void InitData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void pausaParaComer() {\\n\\n\\t}\",\n \"protected void mo6255a() {\\n }\",\n \"public void mo21825b() {\\n }\",\n \"@Override\\n\\tpublic void nadar() {\\n\\t\\t\\n\\t}\",\n \"public void mo1531a() {\\n }\",\n \"public void skystonePos4() {\\n }\",\n \"public void m23075a() {\\n }\",\n \"@Override\\r\\n\\tpublic void publierEnchere() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void stehReagieren() {\\r\\n\\t\\t//\\r\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"private void edit() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void anularFact() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void nghe() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void display() {\\n\\r\\n\\t}\",\n \"public void skystonePos6() {\\n }\",\n \"@Override\\n\\tprotected void UpdateUI() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void UpdateUI() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void display() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void display() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\t\\tpublic void init() {\\n\\t\\t\\t\\r\\n\\t\\t}\",\n \"@Override\\n public int describeContents() {\\n// ignore for now\\n return 0;\\n }\",\n \"ZHDraweeView mo91981h();\",\n \"@Override\\r\\n\\tpublic void dispase() {\\n\\r\\n\\t}\",\n \"public static void listing5_16() {\\n }\",\n \"private void m50367F() {\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5810648","0.5795296","0.57892185","0.57589626","0.57398736","0.56720537","0.5667089","0.5651319","0.5626834","0.5626373","0.5596035","0.55824715","0.5577117","0.55719155","0.55716455","0.55661833","0.55661833","0.55661833","0.55661833","0.55661833","0.55661833","0.55661833","0.556552","0.5551601","0.5550636","0.5550636","0.5524192","0.5517499","0.55116946","0.54784876","0.547693","0.5476293","0.54710466","0.54594445","0.54359204","0.5422793","0.5418735","0.541755","0.5405325","0.54044485","0.54031605","0.54020995","0.539528","0.539002","0.53898585","0.5382258","0.5381789","0.5381673","0.53695405","0.5364595","0.53588396","0.53582305","0.5356943","0.5353165","0.534929","0.53411996","0.5339127","0.5325508","0.53243583","0.53228015","0.5322361","0.53165084","0.53085816","0.53071046","0.53050524","0.53043056","0.5292839","0.52913696","0.5282044","0.5278379","0.52740145","0.527243","0.52608156","0.5256864","0.52534974","0.52521074","0.5237297","0.5235732","0.52313364","0.5229276","0.5225163","0.52202487","0.5217457","0.520201","0.5201796","0.52005976","0.5200554","0.5198784","0.51978326","0.51973325","0.5194777","0.51851296","0.51851296","0.5183877","0.5183877","0.51824343","0.51816475","0.5179229","0.51772875","0.5174151","0.51696783"],"string":"[\n \"0.5810648\",\n \"0.5795296\",\n \"0.57892185\",\n \"0.57589626\",\n \"0.57398736\",\n \"0.56720537\",\n \"0.5667089\",\n \"0.5651319\",\n \"0.5626834\",\n \"0.5626373\",\n \"0.5596035\",\n \"0.55824715\",\n \"0.5577117\",\n \"0.55719155\",\n \"0.55716455\",\n \"0.55661833\",\n \"0.55661833\",\n \"0.55661833\",\n \"0.55661833\",\n \"0.55661833\",\n \"0.55661833\",\n \"0.55661833\",\n \"0.556552\",\n \"0.5551601\",\n \"0.5550636\",\n \"0.5550636\",\n \"0.5524192\",\n \"0.5517499\",\n \"0.55116946\",\n \"0.54784876\",\n \"0.547693\",\n \"0.5476293\",\n \"0.54710466\",\n \"0.54594445\",\n \"0.54359204\",\n \"0.5422793\",\n \"0.5418735\",\n \"0.541755\",\n \"0.5405325\",\n \"0.54044485\",\n \"0.54031605\",\n \"0.54020995\",\n \"0.539528\",\n \"0.539002\",\n \"0.53898585\",\n \"0.5382258\",\n \"0.5381789\",\n \"0.5381673\",\n \"0.53695405\",\n \"0.5364595\",\n \"0.53588396\",\n \"0.53582305\",\n \"0.5356943\",\n \"0.5353165\",\n \"0.534929\",\n \"0.53411996\",\n \"0.5339127\",\n \"0.5325508\",\n \"0.53243583\",\n \"0.53228015\",\n \"0.5322361\",\n \"0.53165084\",\n \"0.53085816\",\n \"0.53071046\",\n \"0.53050524\",\n \"0.53043056\",\n \"0.5292839\",\n \"0.52913696\",\n \"0.5282044\",\n \"0.5278379\",\n \"0.52740145\",\n \"0.527243\",\n \"0.52608156\",\n \"0.5256864\",\n \"0.52534974\",\n \"0.52521074\",\n \"0.5237297\",\n \"0.5235732\",\n \"0.52313364\",\n \"0.5229276\",\n \"0.5225163\",\n \"0.52202487\",\n \"0.5217457\",\n \"0.520201\",\n \"0.5201796\",\n \"0.52005976\",\n \"0.5200554\",\n \"0.5198784\",\n \"0.51978326\",\n \"0.51973325\",\n \"0.5194777\",\n \"0.51851296\",\n \"0.51851296\",\n \"0.5183877\",\n \"0.5183877\",\n \"0.51824343\",\n \"0.51816475\",\n \"0.5179229\",\n \"0.51772875\",\n \"0.5174151\",\n \"0.51696783\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":34698,"cells":{"query":{"kind":"string","value":"END: Added by zhanghongxing at 20130109 BEGIN: Added by zhanghongxing at 20130410"},"document":{"kind":"string","value":"public String initialVideoQuality() {\n int backCameraId = CameraHolder.instance().getBackCameraId();\n String defaultStr = null;\n if (mCameraId == backCameraId) {\n// defaultStr = mContext.getString(R.string.pref_back_video_quality_default);\n defaultStr = SystemProperties.get(BACK_CAMERA_DEFAULT_VIDEO_QUALITY_VALUE,\"\");\n } else {\n// defaultStr = mContext.getString(R.string.pref_front_video_quality_default);\n defaultStr = SystemProperties.get(FRONT_CAMERA_DEFAULT_VIDEO_QUALITY_VALUE,\"\");\n }\n int quality = 0;\n if(defaultStr == null || defaultStr.length() < 1) {\n ArrayList<String> supprotedQuality = getSupportedVideoQuality();\n String[] candidateArray = (mCameraId == backCameraId) ?\n mContext.getResources().getStringArray(R.array.pref_video_quality_entryvalues) :\n mContext.getResources().getStringArray(R.array.pref_front_video_quality_entryvalues);\n\n for(String candidate:candidateArray) {\n if(supprotedQuality.indexOf(candidate) >= 0) {\n defaultStr = candidate;\n break;\n }\n }\n }\n if(defaultStr != null) {\n quality = Integer.valueOf(defaultStr);\n if (CamcorderProfile.hasProfile(mCameraId, quality)) {\n SharedPreferences.Editor editor = ComboPreferences\n .get(mContext).edit();\n editor.putString(KEY_VIDEO_QUALITY, defaultStr);\n editor.apply();\n return defaultStr;\n }\n }\n return Integer.toString(CamcorderProfile.QUALITY_HIGH);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["@Override\n public void func_104112_b() {\n \n }","private void kk12() {\n\n\t}","private static void cajas() {\n\t\t\n\t}","public void mo38117a() {\n }","private void m50366E() {\n }","public void method_4270() {}","public void mo4359a() {\n }","public final void mo51373a() {\n }","public void mo115190b() {\n }","public void mo12628c() {\n }","public abstract void mo70713b();","@Override\r\n\t\t\tpublic void func02() {\n\t\t\t\t\r\n\t\t\t}","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo12930a() {\n }","public void mo55254a() {\n }","static void feladat9() {\n\t}","@Override\r\n\tprotected void func03() {\n\t\t\r\n\t}","@Override\n\tpublic void comer() {\n\t\t\n\t}","protected boolean func_70814_o() { return true; }","static void feladat4() {\n\t}","@Override\r\n\tvoid func04() {\n\t\t\r\n\t}","@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}","public void mo6081a() {\n }","public void mo21825b() {\n }","void mo57277b();","public void mo9848a() {\n }","public void mo21779D() {\n }","private void strin() {\n\n\t}","public void mo21793R() {\n }","public void mo21877s() {\n }","public abstract void mo6549b();","public void mo21794S() {\n }","public void mo21787L() {\n }","public void mo1531a() {\n }","public void mo97908d() {\n }","public void mo3749d() {\n }","static void feladat6() {\n\t}","public void mo21782G() {\n }","public void mo21878t() {\n }","public void mo3376r() {\n }","public void m23075a() {\n }","@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","public void mo21791P() {\n }","public void mo21785J() {\n }","@Override\r\n\tprotected void doF8() {\n\t\t\r\n\t}","private void poetries() {\n\n\t}","public void skystonePos4() {\n }","@Override\r\n\tprotected void doF4() {\n\t\t\r\n\t}","public void gored() {\n\t\t\n\t}","void mo80457c();","void mo57278c();","public void mo23813b() {\n }","static void feladat7() {\n\t}","protected void mo6255a() {\n }","public abstract void mo27385c();","public void mo1403c() {\n }","@Override\n\tprotected void getExras() {\n\n\t}","public void mo21795T() {\n }","void mo72113b();","public void mo9137b() {\n }","public abstract void mo56925d();","public void mo115188a() {\n }","public void skystonePos6() {\n }","public void mo44053a() {\n }","void m1864a() {\r\n }","@Override\n\tpublic void gravarBd() {\n\t\t\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","public void mo21783H() {\n }","protected boolean func_70041_e_() { return false; }","private void m50367F() {\n }","public void mo21792Q() {\n }","public static void listing5_14() {\n }","public void mo21879u() {\n }","@Override\r\n\tpublic void tires() {\n\t\t\r\n\t}","public void mo56167c() {\n }","void mo21072c();","void mo41083a();","void mo41086b();","public void mo97906c() {\n }","void mo80455b();","@Override\r\n\tprotected void doF6() {\n\t\t\r\n\t}","public void mo21781F() {\n }","public void mo21789N() {\n }","@Override\r\n\tpublic void dormir() {\n\t\t\r\n\t}","void mo119582b();","public void mo3370l() {\n }","public void baocun() {\n\t\t\n\t}","void mo80452a();","public final void mo91715d() {\n }","void mo3194r();","static void feladat8() {\n\t}","public void mo9233aH() {\n }","@Override\n\tprotected void interr() {\n\t}","@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}"],"string":"[\n \"@Override\\n public void func_104112_b() {\\n \\n }\",\n \"private void kk12() {\\n\\n\\t}\",\n \"private static void cajas() {\\n\\t\\t\\n\\t}\",\n \"public void mo38117a() {\\n }\",\n \"private void m50366E() {\\n }\",\n \"public void method_4270() {}\",\n \"public void mo4359a() {\\n }\",\n \"public final void mo51373a() {\\n }\",\n \"public void mo115190b() {\\n }\",\n \"public void mo12628c() {\\n }\",\n \"public abstract void mo70713b();\",\n \"@Override\\r\\n\\t\\t\\tpublic void func02() {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo12930a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"static void feladat9() {\\n\\t}\",\n \"@Override\\r\\n\\tprotected void func03() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"protected boolean func_70814_o() { return true; }\",\n \"static void feladat4() {\\n\\t}\",\n \"@Override\\r\\n\\tvoid func04() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void comer() \\r\\n\\t{\\n\\t\\t\\r\\n\\t}\",\n \"public void mo6081a() {\\n }\",\n \"public void mo21825b() {\\n }\",\n \"void mo57277b();\",\n \"public void mo9848a() {\\n }\",\n \"public void mo21779D() {\\n }\",\n \"private void strin() {\\n\\n\\t}\",\n \"public void mo21793R() {\\n }\",\n \"public void mo21877s() {\\n }\",\n \"public abstract void mo6549b();\",\n \"public void mo21794S() {\\n }\",\n \"public void mo21787L() {\\n }\",\n \"public void mo1531a() {\\n }\",\n \"public void mo97908d() {\\n }\",\n \"public void mo3749d() {\\n }\",\n \"static void feladat6() {\\n\\t}\",\n \"public void mo21782G() {\\n }\",\n \"public void mo21878t() {\\n }\",\n \"public void mo3376r() {\\n }\",\n \"public void m23075a() {\\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"public void mo21791P() {\\n }\",\n \"public void mo21785J() {\\n }\",\n \"@Override\\r\\n\\tprotected void doF8() {\\n\\t\\t\\r\\n\\t}\",\n \"private void poetries() {\\n\\n\\t}\",\n \"public void skystonePos4() {\\n }\",\n \"@Override\\r\\n\\tprotected void doF4() {\\n\\t\\t\\r\\n\\t}\",\n \"public void gored() {\\n\\t\\t\\n\\t}\",\n \"void mo80457c();\",\n \"void mo57278c();\",\n \"public void mo23813b() {\\n }\",\n \"static void feladat7() {\\n\\t}\",\n \"protected void mo6255a() {\\n }\",\n \"public abstract void mo27385c();\",\n \"public void mo1403c() {\\n }\",\n \"@Override\\n\\tprotected void getExras() {\\n\\n\\t}\",\n \"public void mo21795T() {\\n }\",\n \"void mo72113b();\",\n \"public void mo9137b() {\\n }\",\n \"public abstract void mo56925d();\",\n \"public void mo115188a() {\\n }\",\n \"public void skystonePos6() {\\n }\",\n \"public void mo44053a() {\\n }\",\n \"void m1864a() {\\r\\n }\",\n \"@Override\\n\\tpublic void gravarBd() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo21783H() {\\n }\",\n \"protected boolean func_70041_e_() { return false; }\",\n \"private void m50367F() {\\n }\",\n \"public void mo21792Q() {\\n }\",\n \"public static void listing5_14() {\\n }\",\n \"public void mo21879u() {\\n }\",\n \"@Override\\r\\n\\tpublic void tires() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo56167c() {\\n }\",\n \"void mo21072c();\",\n \"void mo41083a();\",\n \"void mo41086b();\",\n \"public void mo97906c() {\\n }\",\n \"void mo80455b();\",\n \"@Override\\r\\n\\tprotected void doF6() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo21781F() {\\n }\",\n \"public void mo21789N() {\\n }\",\n \"@Override\\r\\n\\tpublic void dormir() {\\n\\t\\t\\r\\n\\t}\",\n \"void mo119582b();\",\n \"public void mo3370l() {\\n }\",\n \"public void baocun() {\\n\\t\\t\\n\\t}\",\n \"void mo80452a();\",\n \"public final void mo91715d() {\\n }\",\n \"void mo3194r();\",\n \"static void feladat8() {\\n\\t}\",\n \"public void mo9233aH() {\\n }\",\n \"@Override\\n\\tprotected void interr() {\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60856426","0.6040467","0.5917225","0.5910467","0.5860383","0.5854304","0.5828831","0.5789919","0.57702047","0.5723163","0.56806046","0.56771356","0.56692713","0.56692713","0.56692713","0.56692713","0.56692713","0.56692713","0.56692713","0.56631166","0.5661934","0.56576747","0.56475276","0.5636912","0.5635235","0.5627136","0.56232995","0.5616974","0.5614956","0.5613699","0.5611889","0.5611653","0.5610558","0.56080157","0.5601024","0.55990994","0.5579335","0.55767995","0.55606943","0.555172","0.5545502","0.5534229","0.5532837","0.552987","0.55233485","0.5518741","0.55181545","0.55159986","0.55158126","0.5508477","0.55080324","0.55066407","0.55027","0.54969203","0.5492972","0.549214","0.5485174","0.5484172","0.54783845","0.54768205","0.54638535","0.5461189","0.5460407","0.54597294","0.54585665","0.54555434","0.5451604","0.54458535","0.54447216","0.5439091","0.5436609","0.54340994","0.5430312","0.5430312","0.54269975","0.54266846","0.5423033","0.5422221","0.54190814","0.5411094","0.5408745","0.54057294","0.5394915","0.5393622","0.5393376","0.5390272","0.53807986","0.5379021","0.53765386","0.53728914","0.5371666","0.5368242","0.5365119","0.5363769","0.5357163","0.535393","0.5346474","0.5345229","0.5342226","0.5340733","0.5326068"],"string":"[\n \"0.60856426\",\n \"0.6040467\",\n \"0.5917225\",\n \"0.5910467\",\n \"0.5860383\",\n \"0.5854304\",\n \"0.5828831\",\n \"0.5789919\",\n \"0.57702047\",\n \"0.5723163\",\n \"0.56806046\",\n \"0.56771356\",\n \"0.56692713\",\n \"0.56692713\",\n \"0.56692713\",\n \"0.56692713\",\n \"0.56692713\",\n \"0.56692713\",\n \"0.56692713\",\n \"0.56631166\",\n \"0.5661934\",\n \"0.56576747\",\n \"0.56475276\",\n \"0.5636912\",\n \"0.5635235\",\n \"0.5627136\",\n \"0.56232995\",\n \"0.5616974\",\n \"0.5614956\",\n \"0.5613699\",\n \"0.5611889\",\n \"0.5611653\",\n \"0.5610558\",\n \"0.56080157\",\n \"0.5601024\",\n \"0.55990994\",\n \"0.5579335\",\n \"0.55767995\",\n \"0.55606943\",\n \"0.555172\",\n \"0.5545502\",\n \"0.5534229\",\n \"0.5532837\",\n \"0.552987\",\n \"0.55233485\",\n \"0.5518741\",\n \"0.55181545\",\n \"0.55159986\",\n \"0.55158126\",\n \"0.5508477\",\n \"0.55080324\",\n \"0.55066407\",\n \"0.55027\",\n \"0.54969203\",\n \"0.5492972\",\n \"0.549214\",\n \"0.5485174\",\n \"0.5484172\",\n \"0.54783845\",\n \"0.54768205\",\n \"0.54638535\",\n \"0.5461189\",\n \"0.5460407\",\n \"0.54597294\",\n \"0.54585665\",\n \"0.54555434\",\n \"0.5451604\",\n \"0.54458535\",\n \"0.54447216\",\n \"0.5439091\",\n \"0.5436609\",\n \"0.54340994\",\n \"0.5430312\",\n \"0.5430312\",\n \"0.54269975\",\n \"0.54266846\",\n \"0.5423033\",\n \"0.5422221\",\n \"0.54190814\",\n \"0.5411094\",\n \"0.5408745\",\n \"0.54057294\",\n \"0.5394915\",\n \"0.5393622\",\n \"0.5393376\",\n \"0.5390272\",\n \"0.53807986\",\n \"0.5379021\",\n \"0.53765386\",\n \"0.53728914\",\n \"0.5371666\",\n \"0.5368242\",\n \"0.5365119\",\n \"0.5363769\",\n \"0.5357163\",\n \"0.535393\",\n \"0.5346474\",\n \"0.5345229\",\n \"0.5342226\",\n \"0.5340733\",\n \"0.5326068\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":34699,"cells":{"query":{"kind":"string","value":"END: Added by zhanghongxing at 20130410"},"document":{"kind":"string","value":"public static void initialCameraPictureSize(\n Context context, Parameters parameters, int currentCameraId) {\n // When launching the camera app first time, we will set the picture\n // size to the first one in the list defined in \"arrays.xml\" and is also\n // supported by the driver.\n List<Size> supported = parameters.getSupportedPictureSizes();\n if (supported == null) return;\n //BEGIN: Added by zhanghongxing at 2013-01-09 for full preview\n int backCameraId = CameraHolder.instance().getBackCameraId();\n String defaultStr = null;\n String[] candidateArray = null;\n if (currentCameraId == backCameraId) {\n// defaultStr = context.getString(R.string.pref_back_camera_picturesize_default);\n candidateArray = context.getResources().getStringArray(\n R.array.pref_camera_picturesize_entryvalues);\n defaultStr = SystemProperties.get(BACK_CAMERA_DEFAULT_PICTURE_SIZE_VALUE,\"\");\n } else {\n //BEGIN: Modified by zhanghongxing at 2013-04-09 for FBD-96/97\n // defaultStr = null;\n// defaultStr = context.getString(R.string.pref_front_camera_picturesize_default);\n candidateArray = context.getResources().getStringArray(\n R.array.pref_front_camera_picturesize_entryvalues);\n defaultStr = SystemProperties.get(FRONT_CAMERA_DEFAULT_PICTURE_SIZE_VALUE,\"\");\n //END: Modified by zhanghongxing at 2013-04-09 for FBD-96/97\n }\n\n //END: Added by zhanghongxing at 2013-01-09\n for (String candidate : candidateArray) {\n if (setCameraPictureSize(candidate, supported, parameters)) {\n if (defaultStr == null || defaultStr.length() < 1) {\n SharedPreferences.Editor editor = ComboPreferences\n .get(context).edit();\n editor.putString(KEY_PICTURE_SIZE, candidate);\n editor.apply();\n return;\n } else {\n if (candidate.equals(defaultStr)) {\n SharedPreferences.Editor editor = ComboPreferences\n .get(context).edit();\n editor.putString(KEY_PICTURE_SIZE, candidate);\n editor.apply();\n return;\n }\n }\n //END: Modified by zhanghongxing at 2013-01-09\n }\n }\n Log.e(TAG, \"No supported picture size found\");\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private static void cajas() {\n\t\t\n\t}","@Override\n public void func_104112_b() {\n \n }","private void kk12() {\n\n\t}","private void strin() {\n\n\t}","public void mo38117a() {\n }","@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}","protected boolean func_70814_o() { return true; }","@Override\n\tpublic void comer() {\n\t\t\n\t}","public void mo4359a() {\n }","public void mo12628c() {\n }","@Override\r\n\tprotected void doF8() {\n\t\t\r\n\t}","@Override\r\n\t\t\tpublic void func02() {\n\t\t\t\t\r\n\t\t\t}","public final void mo51373a() {\n }","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tprotected void func03() {\n\t\t\r\n\t}","private void m50366E() {\n }","private void poetries() {\n\n\t}","public void gored() {\n\t\t\n\t}","@Override\n\tprotected void getExras() {\n\n\t}","public void method_4270() {}","@Override\n\tpublic void gravarBd() {\n\t\t\n\t}","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","@Override\n\tpublic void grabar() {\n\t\t\n\t}","@Override\r\n\tvoid func04() {\n\t\t\r\n\t}","@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","@Override\r\n\tpublic void tires() {\n\t\t\r\n\t}","public void mo6081a() {\n }","@Override\n\tprotected void interr() {\n\t}","public void mo55254a() {\n }","static void feladat9() {\n\t}","@Override\r\n\tpublic void dormir() {\n\t\t\r\n\t}","public abstract void mo70713b();","protected boolean func_70041_e_() { return false; }","@Override\r\n\tprotected void doF4() {\n\t\t\r\n\t}","public void mo12930a() {\n }","public void skystonePos4() {\n }","@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","public void mo115190b() {\n }","@Override\n\tpublic void anular() {\n\n\t}","@Override\n\tpublic void ligar() {\n\t\t\n\t}","public void mo9848a() {\n }","static void feladat4() {\n\t}","@Override\n public void perish() {\n \n }","public void baocun() {\n\t\t\n\t}","@Override\n\tpublic void nadar() {\n\t\t\n\t}","protected void mo6255a() {\n }","public void skystonePos6() {\n }","public abstract void mo6549b();","@Override\n\tpublic void entrenar() {\n\t\t\n\t}","public void mo21877s() {\n }","@Override\r\n\tprotected void doF6() {\n\t\t\r\n\t}","@Override\n\tprotected void initdata() {\n\n\t}","@Override\r\n\tpublic void rozmnozovat() {\n\t}","public void mo21825b() {\n }","static void feladat7() {\n\t}","private void parseData() {\n\t\t\r\n\t}","private stendhal() {\n\t}","static void feladat6() {\n\t}","void mo57277b();","public abstract void mo27385c();","public void mo3376r() {\n }","@Override\n\tpublic void nghe() {\n\n\t}","@Override\n protected void getExras() {\n }","public void mo21779D() {\n }","@Override\n\tpublic void emprestimo() {\n\n\t}","private zza.zza()\n\t\t{\n\t\t}","public void mo21793R() {\n }","public abstract void mo56925d();","static void feladat8() {\n\t}","public void mo97908d() {\n }","public void mo21794S() {\n }","@Override\n public void inizializza() {\n\n super.inizializza();\n }","private void init() {\n\n\t}","public void mo21878t() {\n }","public void mo21787L() {\n }","public void Exterior() {\n\t\t\r\n\t}","void mo80457c();","public void mo21791P() {\n }","public void mo21782G() {\n }","public void mo1531a() {\n }","public void m23075a() {\n }","void mo57278c();","public void mo3749d() {\n }","@Override\r\n\t\tpublic void init() {\n\t\t\t\r\n\t\t}","public void mo21785J() {\n }","@Override\n\t\t\tpublic void ic() {\n\t\t\t\t\n\t\t\t}","@Override\n\tprotected void update() {\n\t\t\n\t}","public static void listing5_14() {\n }","@Override\n\tprotected void initData() {\n\t\t\n\t}","private void init() {\n\n\n\n }","@Override\n\tpublic void sacrifier() {\n\t\t\n\t}","public void mo3370l() {\n }","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}"],"string":"[\n \"private static void cajas() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void func_104112_b() {\\n \\n }\",\n \"private void kk12() {\\n\\n\\t}\",\n \"private void strin() {\\n\\n\\t}\",\n \"public void mo38117a() {\\n }\",\n \"@Override\\r\\n\\tpublic void comer() \\r\\n\\t{\\n\\t\\t\\r\\n\\t}\",\n \"protected boolean func_70814_o() { return true; }\",\n \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"public void mo4359a() {\\n }\",\n \"public void mo12628c() {\\n }\",\n \"@Override\\r\\n\\tprotected void doF8() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void func02() {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"public final void mo51373a() {\\n }\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void func03() {\\n\\t\\t\\r\\n\\t}\",\n \"private void m50366E() {\\n }\",\n \"private void poetries() {\\n\\n\\t}\",\n \"public void gored() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void getExras() {\\n\\n\\t}\",\n \"public void method_4270() {}\",\n \"@Override\\n\\tpublic void gravarBd() {\\n\\t\\t\\n\\t}\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"@Override\\n\\tpublic void grabar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tvoid func04() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"@Override\\r\\n\\tpublic void tires() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo6081a() {\\n }\",\n \"@Override\\n\\tprotected void interr() {\\n\\t}\",\n \"public void mo55254a() {\\n }\",\n \"static void feladat9() {\\n\\t}\",\n \"@Override\\r\\n\\tpublic void dormir() {\\n\\t\\t\\r\\n\\t}\",\n \"public abstract void mo70713b();\",\n \"protected boolean func_70041_e_() { return false; }\",\n \"@Override\\r\\n\\tprotected void doF4() {\\n\\t\\t\\r\\n\\t}\",\n \"public void mo12930a() {\\n }\",\n \"public void skystonePos4() {\\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"public void mo115190b() {\\n }\",\n \"@Override\\n\\tpublic void anular() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void ligar() {\\n\\t\\t\\n\\t}\",\n \"public void mo9848a() {\\n }\",\n \"static void feladat4() {\\n\\t}\",\n \"@Override\\n public void perish() {\\n \\n }\",\n \"public void baocun() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void nadar() {\\n\\t\\t\\n\\t}\",\n \"protected void mo6255a() {\\n }\",\n \"public void skystonePos6() {\\n }\",\n \"public abstract void mo6549b();\",\n \"@Override\\n\\tpublic void entrenar() {\\n\\t\\t\\n\\t}\",\n \"public void mo21877s() {\\n }\",\n \"@Override\\r\\n\\tprotected void doF6() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tprotected void initdata() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void rozmnozovat() {\\n\\t}\",\n \"public void mo21825b() {\\n }\",\n \"static void feladat7() {\\n\\t}\",\n \"private void parseData() {\\n\\t\\t\\r\\n\\t}\",\n \"private stendhal() {\\n\\t}\",\n \"static void feladat6() {\\n\\t}\",\n \"void mo57277b();\",\n \"public abstract void mo27385c();\",\n \"public void mo3376r() {\\n }\",\n \"@Override\\n\\tpublic void nghe() {\\n\\n\\t}\",\n \"@Override\\n protected void getExras() {\\n }\",\n \"public void mo21779D() {\\n }\",\n \"@Override\\n\\tpublic void emprestimo() {\\n\\n\\t}\",\n \"private zza.zza()\\n\\t\\t{\\n\\t\\t}\",\n \"public void mo21793R() {\\n }\",\n \"public abstract void mo56925d();\",\n \"static void feladat8() {\\n\\t}\",\n \"public void mo97908d() {\\n }\",\n \"public void mo21794S() {\\n }\",\n \"@Override\\n public void inizializza() {\\n\\n super.inizializza();\\n }\",\n \"private void init() {\\n\\n\\t}\",\n \"public void mo21878t() {\\n }\",\n \"public void mo21787L() {\\n }\",\n \"public void Exterior() {\\n\\t\\t\\r\\n\\t}\",\n \"void mo80457c();\",\n \"public void mo21791P() {\\n }\",\n \"public void mo21782G() {\\n }\",\n \"public void mo1531a() {\\n }\",\n \"public void m23075a() {\\n }\",\n \"void mo57278c();\",\n \"public void mo3749d() {\\n }\",\n \"@Override\\r\\n\\t\\tpublic void init() {\\n\\t\\t\\t\\r\\n\\t\\t}\",\n \"public void mo21785J() {\\n }\",\n \"@Override\\n\\t\\t\\tpublic void ic() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"@Override\\n\\tprotected void update() {\\n\\t\\t\\n\\t}\",\n \"public static void listing5_14() {\\n }\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"private void init() {\\n\\n\\n\\n }\",\n \"@Override\\n\\tpublic void sacrifier() {\\n\\t\\t\\n\\t}\",\n \"public void mo3370l() {\\n }\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6020223","0.59031326","0.58782667","0.5822086","0.5766079","0.57604635","0.5733331","0.57191753","0.5669558","0.56587505","0.56453997","0.56349295","0.56270885","0.56269544","0.56269544","0.5623402","0.5601934","0.5601235","0.5596461","0.55774516","0.5563393","0.5558804","0.55569625","0.55569625","0.55569625","0.55569625","0.55569625","0.55569625","0.55569625","0.5553649","0.55498207","0.55337644","0.55258137","0.5524319","0.5514897","0.5514029","0.5506898","0.54989564","0.5488618","0.5458852","0.5457648","0.544757","0.5442577","0.54373026","0.5437062","0.54205966","0.5416526","0.54158694","0.54109085","0.540613","0.54059696","0.53995204","0.53905535","0.5390486","0.53802514","0.5366424","0.5356811","0.53545845","0.5352328","0.53475106","0.5342739","0.53228545","0.531745","0.5316733","0.53148466","0.5314305","0.5311365","0.5308965","0.53027415","0.53004235","0.5298477","0.5298218","0.52973056","0.52925205","0.52910995","0.5278606","0.5269861","0.52630585","0.5262448","0.52586854","0.5257878","0.5257474","0.5251207","0.52503246","0.5249662","0.52457243","0.5245177","0.52448076","0.5244783","0.52379113","0.5227896","0.52192724","0.5205932","0.51997805","0.5199198","0.519734","0.5192651","0.5189962","0.5189231","0.5188241","0.5188241"],"string":"[\n \"0.6020223\",\n \"0.59031326\",\n \"0.58782667\",\n \"0.5822086\",\n \"0.5766079\",\n \"0.57604635\",\n \"0.5733331\",\n \"0.57191753\",\n \"0.5669558\",\n \"0.56587505\",\n \"0.56453997\",\n \"0.56349295\",\n \"0.56270885\",\n \"0.56269544\",\n \"0.56269544\",\n \"0.5623402\",\n \"0.5601934\",\n \"0.5601235\",\n \"0.5596461\",\n \"0.55774516\",\n \"0.5563393\",\n \"0.5558804\",\n \"0.55569625\",\n \"0.55569625\",\n \"0.55569625\",\n \"0.55569625\",\n \"0.55569625\",\n \"0.55569625\",\n \"0.55569625\",\n \"0.5553649\",\n \"0.55498207\",\n \"0.55337644\",\n \"0.55258137\",\n \"0.5524319\",\n \"0.5514897\",\n \"0.5514029\",\n \"0.5506898\",\n \"0.54989564\",\n \"0.5488618\",\n \"0.5458852\",\n \"0.5457648\",\n \"0.544757\",\n \"0.5442577\",\n \"0.54373026\",\n \"0.5437062\",\n \"0.54205966\",\n \"0.5416526\",\n \"0.54158694\",\n \"0.54109085\",\n \"0.540613\",\n \"0.54059696\",\n \"0.53995204\",\n \"0.53905535\",\n \"0.5390486\",\n \"0.53802514\",\n \"0.5366424\",\n \"0.5356811\",\n \"0.53545845\",\n \"0.5352328\",\n \"0.53475106\",\n \"0.5342739\",\n \"0.53228545\",\n \"0.531745\",\n \"0.5316733\",\n \"0.53148466\",\n \"0.5314305\",\n \"0.5311365\",\n \"0.5308965\",\n \"0.53027415\",\n \"0.53004235\",\n \"0.5298477\",\n \"0.5298218\",\n \"0.52973056\",\n \"0.52925205\",\n \"0.52910995\",\n \"0.5278606\",\n \"0.5269861\",\n \"0.52630585\",\n \"0.5262448\",\n \"0.52586854\",\n \"0.5257878\",\n \"0.5257474\",\n \"0.5251207\",\n \"0.52503246\",\n \"0.5249662\",\n \"0.52457243\",\n \"0.5245177\",\n \"0.52448076\",\n \"0.5244783\",\n \"0.52379113\",\n \"0.5227896\",\n \"0.52192724\",\n \"0.5205932\",\n \"0.51997805\",\n \"0.5199198\",\n \"0.519734\",\n \"0.5192651\",\n \"0.5189962\",\n \"0.5189231\",\n \"0.5188241\",\n \"0.5188241\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":346,"numItemsPerPage":100,"numTotalItems":136513,"offset":34600,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sInJlcG9JZHMiOlsiNjc1Mzc3Mjk2YzBkMWNiNGEwNmY5MzlkIl0sImlhdCI6MTc5MDg4NzI1NCwianRpIjoiMDhlOTBkNDEtMGQ0OC00NzI2LWExNzktMzMxMTI3ODE3YzQ0Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhLXYxIiwiZXhwIjoxNzkwODkwODU0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.3kFuxkR3CNDhlqsav8XBLVFOC_zYHEyWdL52NP3Cd3YB_7ZvxnCStQSgiajFeUY93U4MyQYXeWe79KFs__gPBA","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":136513,"numBytesParquet":1558040430}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 7 33.1k | document stringlengths 7 335k | metadata dict | negatives listlengths 3 101 | negative_scores listlengths 3 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
Gets the user attributes that were injected | public Map<String, Map<String, String>> getUserAttributes() {
return m_userAttributes;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"IAttributes getAttributes();",
"public Hashtable getUserProperties() {\n PropertyHelper ph = PropertyHelper.getPropertyHelper(this);\n return ph.getUserProperties();\n }",
"Attributes getAttributes();",
"Map<String, Object> getAttributes();",
"Map<String, Object> getAttributes();",
"M... | [
"0.65240693",
"0.65003556",
"0.6445756",
"0.63711894",
"0.63711894",
"0.63711894",
"0.6280774",
"0.62443095",
"0.60949606",
"0.6090853",
"0.60644996",
"0.60644996",
"0.60298866",
"0.6004378",
"0.60036534",
"0.5994209",
"0.59725744",
"0.59144086",
"0.5893534",
"0.58927673",
"0... | 0.7263961 | 0 |
Load a template file from this package. | public static String getTemplate(String template) {
return templates.get(template);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Templates load(URL fileSource) throws Exception {\n return m_factory.newTemplates(new StreamSource(fileSource.openStream()));\n }",
"private String loadTemplate(String fileName)\n throws IOException, URISyntaxException\n {\n File file = new File(resolveResourcePath(this.TEMPLATE_PATH + f... | [
"0.7058184",
"0.7042138",
"0.6858148",
"0.66828924",
"0.66394246",
"0.64422226",
"0.6294819",
"0.60753167",
"0.604996",
"0.5990038",
"0.59057885",
"0.58817536",
"0.58178097",
"0.57685006",
"0.56887835",
"0.56698763",
"0.56421083",
"0.55889386",
"0.55451065",
"0.5480533",
"0.5... | 0.4745064 | 100 |
Load a template file from this package. | public static String getTemplate(String template, Pair<String, String>... replacements) {
String ret = getTemplate(template);
if (ret != null) {
for (Pair<String, String> p : replacements) {
ret = ret.replaceAll(p.fst, p.snd);
}
}
return ret... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Templates load(URL fileSource) throws Exception {\n return m_factory.newTemplates(new StreamSource(fileSource.openStream()));\n }",
"private String loadTemplate(String fileName)\n throws IOException, URISyntaxException\n {\n File file = new File(resolveResourcePath(this.TEMPLATE_PATH + f... | [
"0.7058184",
"0.7042138",
"0.6858148",
"0.66828924",
"0.66394246",
"0.64422226",
"0.6294819",
"0.60753167",
"0.604996",
"0.5990038",
"0.59057885",
"0.58817536",
"0.58178097",
"0.57685006",
"0.56887835",
"0.56698763",
"0.56421083",
"0.55889386",
"0.55451065",
"0.5480533",
"0.5... | 0.0 | -1 |
Load a template file from this package. | public static Element getXmlTemplate(String template, Pair<String, String>... replacements) {
return parseSafe(getTemplate(template, replacements));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Templates load(URL fileSource) throws Exception {\n return m_factory.newTemplates(new StreamSource(fileSource.openStream()));\n }",
"private String loadTemplate(String fileName)\n throws IOException, URISyntaxException\n {\n File file = new File(resolveResourcePath(this.TEMPLATE_PATH + f... | [
"0.7058184",
"0.7042138",
"0.6858148",
"0.66828924",
"0.66394246",
"0.64422226",
"0.6294819",
"0.60753167",
"0.604996",
"0.5990038",
"0.59057885",
"0.58817536",
"0.58178097",
"0.57685006",
"0.56887835",
"0.56698763",
"0.56421083",
"0.55889386",
"0.55451065",
"0.5480533",
"0.5... | 0.0 | -1 |
/mQueue mq = new mQueue(1); mq.enqueue(2); mq.dequeue(); mq.enqueue(3); mq.printQueue(); | public static void main(String ar[]){
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void printQueue();",
"void runQueue();",
"public void onQueue();",
"public static void main(String args[]) {\r\n /* Create a queue with items 1 2 3 */\r\n Queue q = new Queue();\r\n q.stack1 = new Stack<>();\r\n q.stack2 = new Stack<>();\r\n enQueue(q, 1);\r\n ... | [
"0.7926221",
"0.7392837",
"0.7276956",
"0.7244996",
"0.72438437",
"0.7242408",
"0.7175411",
"0.7175411",
"0.71611345",
"0.71331483",
"0.7116509",
"0.70359",
"0.7023963",
"0.7003775",
"0.69779783",
"0.69430786",
"0.6930225",
"0.69230074",
"0.6913003",
"0.69009167",
"0.6843414"... | 0.0 | -1 |
sanity: jar, no classifier and file exists | private PluginInfo extractPluginInfo(Artifact artifact) {
if (artifact != null
&& "jar".equals(artifact.getExtension())
&& "".equals(artifact.getClassifier())
&& artifact.getFile() != null) {
Path artifactPath = artifact.getFile().toPath();
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static boolean isJar(){\n\t\tString str = IOHandler.class.getResource(\"IOHandler.class\").toString();\n\t\treturn str.toLowerCase().startsWith(\"jar\") && JAROVERRIDE;\n\t}",
"boolean hasOutputjar();",
"String validateBundleAndGetFilename( final URL url,\n fina... | [
"0.6287036",
"0.62603676",
"0.5952196",
"0.5946392",
"0.58811164",
"0.57940334",
"0.57506627",
"0.570503",
"0.5660741",
"0.56289804",
"0.56150055",
"0.55885446",
"0.55867547",
"0.5569983",
"0.5558822",
"0.55300754",
"0.5528013",
"0.55242026",
"0.5523052",
"0.54616785",
"0.545... | 0.0 | -1 |
Decode a new RescueObject from the buffer | public RescueObject readObject(int timestamp, Object source) {
int type = readInt();
if (type==RescueConstants.TYPE_NULL) return null;
int id = readInt();
int size = readInt();
RescueObject result = RescueObject.newObject(type);
if (result==null) skip(size);
else if (size>0) {
result.read... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected abstract void DecodeFromCBORObject(CBORObject messageObject) throws CoseException;",
"public abstract Object decode(InputStream is) ;",
"void decodeObject();",
"Object decode(String encoded);",
"void decode2(DataBuffer buffer, T object);",
"public Object decode(Object pObject) throws DecoderExc... | [
"0.6657247",
"0.62646264",
"0.6094158",
"0.6057751",
"0.60015047",
"0.57604855",
"0.5733122",
"0.563861",
"0.5594124",
"0.55746067",
"0.55661345",
"0.5547842",
"0.5534293",
"0.55094016",
"0.5498344",
"0.5472301",
"0.5470789",
"0.54595083",
"0.5455558",
"0.54483426",
"0.539718... | 0.56181073 | 8 |
Decode a set of objects from the buffer. | public RescueObject[] readObjects(int timestamp, Object source) {
List<RescueObject> result = new ArrayList<RescueObject>();
int count = readInt();
for (int i = 0; i < count; ++i) {
RescueObject next = readObject(timestamp, source);
result.add(ne... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void decodeObjectArray();",
"public abstract Object decode(InputStream is) ;",
"void decode2(DataBuffer buffer, T object);",
"void decodeObject();",
"void decode(Collection<Frame> into, ShareableBytes bytes)\n {\n decode(into, bytes, HEADER_LENGTH);\n }",
"T decode1(DataBuffer buffer);",
"... | [
"0.6806104",
"0.6452783",
"0.62920433",
"0.6274992",
"0.61933714",
"0.59041154",
"0.581771",
"0.57022876",
"0.56619006",
"0.56480736",
"0.55685014",
"0.5456892",
"0.54225045",
"0.53976667",
"0.53762627",
"0.52763104",
"0.5264474",
"0.52630085",
"0.5250304",
"0.51968247",
"0.5... | 0.0 | -1 |
Decode a set of commands from the buffer. | public Command[] readCommands() {
List<Command> result = new ArrayList<Command>();
Command next = null;
do {
next = readCommand();
if (next!=null) {
result.add(next);
}
} while (next!=null);
return (Command[])result.toArray(new Command[0]);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static Command decode(ByteBuf buffer) {\n\t\tbyte [] bucket = readPackageFromBuffer(buffer);\n\t\t\n\t\t//read the type\n\t\tCommand.Type type = Command.Type.getTypeForValue(bucket[0]);\n\t\t\n\t\t//call the factory with the actual type to give a hint to it of wth this package is about\n\t\treturn CommandFa... | [
"0.6586838",
"0.57796913",
"0.5647252",
"0.5624028",
"0.55957514",
"0.54946667",
"0.5474025",
"0.54472333",
"0.5354116",
"0.52613604",
"0.5193898",
"0.5182187",
"0.51698565",
"0.5134869",
"0.5129288",
"0.5090621",
"0.50757325",
"0.50608087",
"0.5021737",
"0.50103056",
"0.4974... | 0.54527354 | 7 |
Manipulates the map once available. This callback is triggered when the map is ready to be used. This is where we can add markers or lines, add listeners or move the camera. In this case, we just add a marker near Sydney, Australia. If Google Play services is not installed on the device, the user will be prompted to in... | @Override
public void onMapReady(GoogleMap googleMap) {
final LatLng thirdIntersection = new LatLng(45.425329, -75.682833);
final LatLng fourthIntersection = new LatLng(45.426029, -75.681261);
mMap = googleMap;
// Moving the camera
LatLngBounds Ottawa = new LatLngBounds(new ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void onMapReady(GoogleMap googleMap) {\n Geocoder geoCoder = new Geocoder(getActivity(), Locale.getDefault());\n double lat, lng;\n try {\n List<Address> addresses = geoCoder.getFromLocationName(\"Western Sydney Paramatta, NSW\", 5);\n ... | [
"0.81888163",
"0.80429345",
"0.80365956",
"0.803331",
"0.7998251",
"0.79769045",
"0.79576075",
"0.79573464",
"0.7954103",
"0.79424566",
"0.79369086",
"0.79300386",
"0.79146415",
"0.79048055",
"0.78882027",
"0.7884916",
"0.7884916",
"0.7884916",
"0.7884916",
"0.78779477",
"0.7... | 0.0 | -1 |
TODO Autogenerated method stub | public static void main(String[] args) {
int a = 80;
if (a > 100)
System.out.println("a > 100");
else if (a > 50)
System.out.println("50 < a < 100");
else
System.out.println("50 > a");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
Constructor Privado// Constructor Privado | public static GestorPersonas instanciar(){
if(gestor == null){
gestor = new GestorPersonas();
}
return gestor;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Constructor() {\r\n\t\t \r\n\t }",
"public Constructor(){\n\t\t\n\t}",
"public Curso() {\r\n }",
"public Pasien() {\r\n }",
"private Rekenhulp()\n\t{\n\t}",
"public Pitonyak_09_02() {\r\n }",
"public Alojamiento() {\r\n\t}",
"public Odontologo() {\n }",
"public CyanSus() {\n\n }",
"pub... | [
"0.8289099",
"0.8074334",
"0.7694526",
"0.7693531",
"0.7593976",
"0.7550665",
"0.75476426",
"0.75470215",
"0.75060683",
"0.74973184",
"0.74966156",
"0.7491612",
"0.7415499",
"0.7414383",
"0.7396446",
"0.7393599",
"0.73895675",
"0.7383053",
"0.73624146",
"0.73611253",
"0.73447... | 0.0 | -1 |
Si el profesor es nulo o apellido, nombre y cx son nulos devolvemos error. | @Override
public String modificarProfesor(Profesor profesor, String apellidos, String nombres, Cargo cargo) {
if( profesor == null || ( apellidos == null && nombres == null && cargo == null )){ //Si todos los parametros son nulos devolvemos error.
return ERROR_MOD_PROFESOR;
}
//Si algun parametro es nul... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void estiloError() {\r\n /**Bea y Jose**/\r\n\t}",
"private boolean hasErroNome(String nome) {\r\n\t\terroNome.setText(\"\");\r\n\t\terroNome.setFont(new Font(\"Arial\", Font.BOLD, 12));\r\n\t\terroNome.setBounds(150, 155, 250, 20);\r\n\t\terroNome.setForeground(Color.RED);\r\n\r\n\t\tif (!Validacao.v... | [
"0.62304485",
"0.6102016",
"0.5900753",
"0.5824673",
"0.5812289",
"0.5800452",
"0.5794738",
"0.5775948",
"0.5750142",
"0.5733098",
"0.5722045",
"0.5656525",
"0.5652414",
"0.5650151",
"0.5641382",
"0.56086",
"0.55971074",
"0.5596901",
"0.55724376",
"0.55695426",
"0.55417526",
... | 0.5743051 | 9 |
Si el alumno es nulo o apellido, nombre y cx son nulos devolvemos error. | @Override
public String modificarAlumno(Alumno alumno, String apellidos, String nombres, String cx) {
if( alumno == null || ( apellidos == null && nombres == null && cx == null )){
return ERROR_MOD_ALUMNO;
}
//Si algun parametro es nulo no lo modificamos.
if( apellidos != null && !apellidos.isEmpty())... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void exibeDataNascimentoInvalida() {\n JOptionPane.showMessageDialog(\n null,\n Constantes.GERENCIAR_FUNCIONARIO_DATA_NASCIMENTO_INVALIDA,\n Constantes.GERENCIAR_FUNCIONARIO_TITULO,\n JOptionPane.PLAIN_MESSAGE\n );\n }",
"private... | [
"0.577391",
"0.5744817",
"0.5730135",
"0.5724948",
"0.5714076",
"0.57103926",
"0.56949353",
"0.5692869",
"0.56895006",
"0.5664888",
"0.55847",
"0.55598325",
"0.55106086",
"0.54842526",
"0.5478851",
"0.5450035",
"0.54451483",
"0.5444557",
"0.5420594",
"0.5406711",
"0.5405497",... | 0.6181495 | 0 |
Initializes the UI components. | private void initComponents()
{
dataPanel = new TransparentPanel();
dataPanel.setLayout(new BoxLayout(dataPanel, BoxLayout.Y_AXIS));
// info text
infoTextArea = new JTextArea();
infoTextArea.setEditable(false);
infoTextArea.setFocusable(false);
infoTextArea.s... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void initialize()\n {\n uiFactory.configureUIComponent(this, UI_PREFIX);\n\n initializeFields();\n initializeLabels();\n initLayout();\n }",
"private void initComponents()\n {\n //LAYOUT\n initLayoutComponents();\n \n //TRANSITION COMPONE... | [
"0.83491236",
"0.82560277",
"0.815828",
"0.8133378",
"0.8133378",
"0.8036985",
"0.79693073",
"0.7901185",
"0.7895634",
"0.78853106",
"0.78370506",
"0.7820781",
"0.7781579",
"0.77037716",
"0.76980466",
"0.7675194",
"0.7659282",
"0.76276267",
"0.76275086",
"0.76073843",
"0.7596... | 0.0 | -1 |
Shows an input dialog to the user to obtain the master password. | public static String showInput(final boolean prevSuccess)
{
try
{
if(!SwingUtilities.isEventDispatchThread())
{
SwingUtilities.invokeAndWait(new Runnable()
{
@Override
public void run()
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void showPasswordPrompt();",
"public Optional<String> showPasswordDialog() {\n Dialog<String> passwordDialog = new Dialog<>();\n try {\n FXMLLoader loader = new FXMLLoader(getClass().getResource(\"/dialog/password_dialog.fxml\"));\n passwordDialog.setTitle(\"Password\")... | [
"0.7836111",
"0.71928775",
"0.6851471",
"0.67691606",
"0.663687",
"0.6521976",
"0.6480499",
"0.64284164",
"0.63986075",
"0.6392517",
"0.63698965",
"0.63169956",
"0.6263292",
"0.6257578",
"0.62165725",
"0.6184688",
"0.610138",
"0.60870945",
"0.6083228",
"0.607554",
"0.6067841"... | 0.66019076 | 5 |
OK button click event handler. Retrieves the password and hides the dialog. | public void actionPerformed(ActionEvent e)
{
JButton sourceButton = (JButton) e.getSource();
if (sourceButton.equals(okButton))
{
password
= new String(
currentPasswdField.getPassword());
}
// hide dialog and unblock applica... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void handleOKPressed() {\n\n if (Authenticator.validatePassword(accountId.getText(), password.getText())) {\n application.accountLogging(accountId.getText());\n confirmLogin = true;\n dialogStage.close();\n } else {\n errorMessage.setVisi... | [
"0.7286021",
"0.71971244",
"0.7191876",
"0.6922297",
"0.6893226",
"0.6865769",
"0.6772449",
"0.6654296",
"0.6607686",
"0.65678704",
"0.6564384",
"0.6524942",
"0.6503753",
"0.6495977",
"0.63977593",
"0.6362196",
"0.6295957",
"0.62635094",
"0.62635094",
"0.6249435",
"0.6249435"... | 0.700109 | 3 |
Resets the password by clearing the input field and setting password to null. Disables the OK button. | private void resetPassword()
{
password = null;
currentPasswdField.setText("");
currentPasswdField.requestFocusInWindow();
okButton.setEnabled(false);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void clearPassword() {\n\t\tpassword.setValue(\"\");\n\t}",
"private void clearPassword() {\n \n password_ = getDefaultInstance().getPassword();\n }",
"private void clearPassword() {\n \n password_ = getDefaultInstance().getPassword();\n }",
"public void clearPass... | [
"0.7807023",
"0.7724014",
"0.7724014",
"0.7474212",
"0.7349754",
"0.7307844",
"0.7307844",
"0.726463",
"0.7254223",
"0.7229523",
"0.721388",
"0.7179509",
"0.7159924",
"0.7159924",
"0.7159924",
"0.7143144",
"0.70253193",
"0.6982907",
"0.6981588",
"0.68861187",
"0.6819178",
"... | 0.8783485 | 0 |
Disables OK button if the password input field is empty. | public void keyReleased(KeyEvent event)
{
JPasswordField source = (JPasswordField) event.getSource();
if (currentPasswdField.equals(source))
{
String password = new String(currentPasswdField.getPassword());
okButton.setEnabled(password.length() > 0);
passw... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean validatePassword() {\r\n\t\tif (txtPassword.getValue() == null || txtPassword.getValue().length() == 0 || !txtPassword.getValue().equals(txtRetypePassword.getValue()))\r\n\t\t\treturn false;\r\n\t\treturn true;\r\n\t}",
"public void showPasswordPrompt();",
"private void validatePasswordField() {... | [
"0.6924749",
"0.6808536",
"0.68004906",
"0.6762109",
"0.66462076",
"0.66153467",
"0.6612078",
"0.655869",
"0.6450365",
"0.63724303",
"0.6333926",
"0.63201106",
"0.63171524",
"0.63071555",
"0.6303194",
"0.6293386",
"0.62890303",
"0.6284021",
"0.6270456",
"0.6251021",
"0.624928... | 0.60526794 | 44 |
Creates the icon component to show on the left of this dialog. | private static Component createIconComponent()
{
JPanel wrapIconPanel = new TransparentPanel(new BorderLayout());
JLabel iconLabel = new JLabel();
iconLabel.setIcon(DesktopUtilActivator.getResources()
.getImage("service.gui.icons.AUTHORIZATION_ICON"));
wrapIconPanel.ad... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Icon createIcon();",
"private void addLeftDrawable() {\n\n// mBusinessTitle.setCompoundDrawables(getDrawable(R.drawable.ic_assignment_black_24dp), null, null, null );\n//\n// mBusinessPhone.setCompoundDrawables(getDrawable(R.drawable.ic_settings_phone_black_24dp), null, null, null );\n//\n// ... | [
"0.6049935",
"0.6049614",
"0.5846608",
"0.5711566",
"0.5557573",
"0.5547622",
"0.54376596",
"0.54019827",
"0.54004604",
"0.5385306",
"0.53660786",
"0.5349998",
"0.5334201",
"0.5325924",
"0.53168154",
"0.5315743",
"0.5282528",
"0.5273268",
"0.5272801",
"0.5253091",
"0.52349776... | 0.63510543 | 0 |
Close the connection when an exception is raised. | @Override
public void exceptionCaught(
ChannelHandlerContext ctx, ExceptionEvent e) {
logger.log(
Level.WARNING,
"Unexpected exception from downstream.",
e.getCause());
e.getChannel().close();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n public void close() throws Exception {\r\n if (connection != null){\r\n connection.close();\r\n }\r\n }",
"@Override\r\n\tpublic void close()\r\n {\r\n\t\ttry\r\n {\r\n\t connection.close();\r\n }\r\n\t\tcatch (final SQLException e)\r\n ... | [
"0.7704999",
"0.76463586",
"0.73903507",
"0.73521256",
"0.7350661",
"0.7295211",
"0.7225442",
"0.7179988",
"0.71199733",
"0.7105953",
"0.708345",
"0.7079227",
"0.70501345",
"0.70449096",
"0.7011599",
"0.70075023",
"0.7004892",
"0.6974568",
"0.6963415",
"0.69564366",
"0.695279... | 0.0 | -1 |
startActivityForResult(new Intent(this, SignUpActivity.class), Constants.LOGIN_REQUEST_CODE); // startActivityForResult(new Intent(this, SignUpAnimActivity.class), CustomConstants.LOGIN_REQUEST_CODE); overridePendingTransition(android.R.anim.fade_in, android.R.anim.fade_out); | @Override
public void onSignUpBtnClick() {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void onClick(View v) {\n Intent intent = new Intent(getApplicationContext(), SignupActivity.class);\n startActivityForResult(intent, REQUEST_SIGNUP);\n finish();\n //overridePendingTransition(R.anim.push_left_in, R.anim.push_... | [
"0.79529136",
"0.7719733",
"0.7719733",
"0.7719733",
"0.76908135",
"0.7679662",
"0.7678577",
"0.7563611",
"0.7482957",
"0.7482957",
"0.74801135",
"0.7474714",
"0.7474714",
"0.7400814",
"0.71848977",
"0.6920363",
"0.67243576",
"0.6713769",
"0.6620932",
"0.66197264",
"0.6605415... | 0.0 | -1 |
method to do Default Twitter Login | public void customLoginTwitter() {
//check if user is already authenticated or not
if (getTwitterSession() == null) {
//if user is not authenticated start authenticating
client.authorize(this, new Callback<TwitterSession>() {
@Override
public void... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void loginToTwitter() \n\t{\n\t\t// Check if already logged in\n\t\tif (!isTwitterLoggedInAlready())\n\t\t{\n\t\t\tConfigurationBuilder builder = new ConfigurationBuilder();\n\t\t\tbuilder.setOAuthConsumerKey(TWITTER_CONSUMER_KEY);\n\t\t\tbuilder.setOAuthConsumerSecret(TWITTER_CONSUMER_SECRET);\n\t\t\tConf... | [
"0.81358784",
"0.7981332",
"0.75590086",
"0.6899625",
"0.6775129",
"0.6770102",
"0.6629314",
"0.6487787",
"0.6479826",
"0.62615293",
"0.61992764",
"0.6182109",
"0.616705",
"0.61626846",
"0.6131995",
"0.61079437",
"0.608493",
"0.60632753",
"0.6054289",
"0.60511017",
"0.6047653... | 0.76584274 | 2 |
Do something with result, which provides a TwitterSession for making API calls | @Override
public void success(Result<TwitterSession> result) {
TwitterSession twitterSession = result.data;
fetchTwitterEmail(twitterSession);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void success(Result<TwitterSession> result) {\n TwitterSession twitterSession = result.data;\n fetchTwitterAccount();\n dismiss();\n }",
"@Override\n public void success(Result<TwitterSession> res... | [
"0.74701095",
"0.7051076",
"0.6891637",
"0.67282504",
"0.6688561",
"0.6449489",
"0.6331767",
"0.6219302",
"0.5916956",
"0.57969034",
"0.5781216",
"0.5776666",
"0.56855464",
"0.56745154",
"0.560139",
"0.5585477",
"0.55712485",
"0.5554317",
"0.5554317",
"0.5554016",
"0.5546272"... | 0.7393259 | 1 |
Do something on failure | @Override
public void failure(TwitterException e) {
Toast.makeText(SignInActivity.this, "Failed to authenticate. Please try again.", Toast.LENGTH_SHORT).show();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\t\t\t\tpublic void doFail() {\n\t\t\t\t}",
"@Override\n\t\t\tpublic void onFail(int code) {\n\t\t\t\t\n\t\t\t}",
"public void onFailure();",
"void failed (Exception e);",
"@Override\r\n\tpublic void onFail() {\n\t\tif(bSendStatus)\r\n\t\t\tnativeadstatus(E_ONFAIL);\r\n\t}",
"@Override\n\t\t\t... | [
"0.797733",
"0.7426651",
"0.741109",
"0.7362279",
"0.73250866",
"0.7318276",
"0.724924",
"0.7134308",
"0.71182775",
"0.7116118",
"0.7116118",
"0.7116118",
"0.70874393",
"0.699894",
"0.6984025",
"0.69831604",
"0.6969433",
"0.6962387",
"0.6928869",
"0.69030887",
"0.68835557",
... | 0.0 | -1 |
get authenticates user session | private TwitterSession getTwitterSession() {
TwitterSession session = TwitterCore.getInstance().getSessionManager().getActiveSession();
return session;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"AuthenticationSessionModel getAuthenticationSession();",
"public User getSession(){\n\t\treturn this.session;\n\t}",
"@Override\n\tpublic UtenteBase getSessionUser() {\n\t\tUtenteBase user = (UtenteBase) getThreadLocalRequest().getSession().getAttribute(\"user\");\n\t\treturn user;\n\t}",
"public PSUserSessi... | [
"0.77115107",
"0.6974206",
"0.6960993",
"0.6919943",
"0.6838701",
"0.67474264",
"0.6736425",
"0.66870296",
"0.6655697",
"0.6655697",
"0.65911233",
"0.65285915",
"0.6470589",
"0.64701897",
"0.6452095",
"0.644481",
"0.6437737",
"0.64318836",
"0.6407925",
"0.63847536",
"0.638262... | 0.0 | -1 |
here it will give u only email and rest of other information u can get from TwitterSession | @Override
public void success(Result<String> result) {
Log.e("User Id : ", twitterSession.getUserName() + "");
Log.e("data", "User Id : " + twitterSession.getUserId() + "\nScreen Name : " + twitterSession.getUserName() + "\nEmail Id : " + result.data);
twitter... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"String getUserMail();",
"java.lang.String getUserEmail();",
"private void getUserData() {\n TwitterApiClient twitterApiClient = TwitterCore.getInstance().getApiClient();\n AccountService statusesService = twitterApiClient.getAccountService();\n Call<User> call = statusesService.verifyCrede... | [
"0.6424152",
"0.6304413",
"0.6223149",
"0.62183535",
"0.61959827",
"0.6082992",
"0.6082992",
"0.6082992",
"0.6082992",
"0.6082992",
"0.6082992",
"0.6031432",
"0.5957002",
"0.5922208",
"0.5922208",
"0.5922208",
"0.5922208",
"0.5922208",
"0.59164214",
"0.5888849",
"0.57918775",... | 0.54749984 | 62 |
Constructs a new ToolBarIO utility based on the given container | public ToolBarIO(ToolBarContainer container) {
this.container = container;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public JMTToolBar createToolbar() {\r\n \t\tJMTToolBar toolbar = new JMTToolBar(JMTImageLoader.getImageLoader());\r\n \t\t// Builds an array with all actions to be put in the toolbar\r\n \t\tAbstractJmodelAction[] actions = new AbstractJmodelAction[] { newModel, openModel, saveModel, null,\r\n \t\t\t\t// editUndo,... | [
"0.6068602",
"0.5909185",
"0.5901344",
"0.58474976",
"0.5808736",
"0.57406527",
"0.5714742",
"0.5701048",
"0.56454235",
"0.55854714",
"0.55522984",
"0.5506214",
"0.5501391",
"0.54640144",
"0.5431828",
"0.5419608",
"0.5401972",
"0.5370422",
"0.5360069",
"0.53326607",
"0.532056... | 0.76790756 | 0 |
Saves the current toolbar configuration into an XML stream. The stream is not closed at the end of the operation. | public void writeXML(OutputStream stream) throws IOException {
PrintWriter out = new PrintWriter(stream);
out.println("<?xml version=\"1.0\"?>");
out.println("<VLToolBars version=\"1.0\">");
xmlWriteContainer(out);
out.println("</VLToolBars>");
out.flush();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void saveConfig() {\r\n\t\ttry {\r\n\t\t\tPrintWriter out = new PrintWriter(new OutputStreamWriter(new BufferedOutputStream(new FileOutputStream(\"open-ig-mapeditor-config.xml\"), 64 * 1024), \"UTF-8\"));\r\n\t\t\ttry {\r\n\t\t\t\tout.printf(\"<?xml version='1.0' encoding='UTF-8'?>%n\");\r\n\t\t\t\tout.printf(\"<m... | [
"0.62331134",
"0.5725623",
"0.5666499",
"0.5529024",
"0.5498629",
"0.548621",
"0.5481827",
"0.54687315",
"0.5400398",
"0.53972733",
"0.536529",
"0.5347742",
"0.5317737",
"0.52561086",
"0.52415985",
"0.5238229",
"0.52382207",
"0.5217738",
"0.5196471",
"0.5189623",
"0.5155646",... | 0.6636509 | 0 |
public void authBTBULK(WebDriver wd,String OrderId) | public void authBTBULK(WebDriver wd)
{
try{
Thread.sleep(4000);
wd.findElement(By.id("userMenu")).click();
wd.manage().timeouts().implicitlyWait(7, TimeUnit.SECONDS);
System.out.println("menu clicked");
Thread.sleep(2000);
wd.findElement(By.xpath("//a[@title='... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void myorders() {\r\n\t\t\tdriver.findElement(orders).click();\r\n\t\t\t\r\n\t\t\t}",
"public void myorders() {\n\t\t\t\r\n\t\t\t\r\n\t\tBy my=By.xpath(\"//a[@href='/my/orders/create?form']\");\r\n\t\tWebElement We_my=wt.ElementToBeClickable(my, 20);\r\n\t\tWe_my.click();\r\n\t\t}",
"public void clickO... | [
"0.59302807",
"0.5645778",
"0.5641207",
"0.55712885",
"0.54250765",
"0.52076966",
"0.5202752",
"0.51874906",
"0.51667035",
"0.51647395",
"0.5152615",
"0.5147477",
"0.5120998",
"0.50839615",
"0.5078475",
"0.5074156",
"0.50508916",
"0.5047318",
"0.50368166",
"0.502012",
"0.5019... | 0.75211257 | 0 |
Constructs ThresholdEventRule object for the given parameters | public ThresholdEventRule(String name, String name_lt, String name_gt, String d_lt, String d_gt, String sensorName, int val, boolean hideFromFeed, int timeout){
super(name, hideFromFeed, timeout);
this.name_lt = name_lt;
this.name_gt = name_gt;
this.description_lt = d_lt;
this.de... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void create(Rule event);",
"Rule createRule();",
"Rule createRule();",
"Rule createRule();",
"public EvelThresholdCross( String evname,String evid,\r\n\t\t\t String tcriticality,\r\n\t String tname,\r\n\t String tthresholdCrossed,... | [
"0.6097776",
"0.5650052",
"0.5650052",
"0.5650052",
"0.55581427",
"0.5233215",
"0.516055",
"0.5137203",
"0.5090275",
"0.50501305",
"0.50406665",
"0.49859107",
"0.49728283",
"0.48947805",
"0.48910952",
"0.48375967",
"0.48016554",
"0.4787663",
"0.47627822",
"0.4759298",
"0.4738... | 0.64199424 | 0 |
A threshold test doesn't make sense for digital inputs | public Event testEvent(InputChangeEvent ie, boolean override) {
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"float getThreshold();",
"@Test\n public void testThreshold() {\n final ThresholdCircuitBreaker circuit = new ThresholdCircuitBreaker(threshold);\n circuit.incrementAndCheckState(9L);\n assertFalse(\"Circuit opened before reaching the threshold\", circuit.incrementAndCheckState(1L));\n ... | [
"0.72092164",
"0.7065629",
"0.67947656",
"0.67416745",
"0.6661507",
"0.66388506",
"0.6609002",
"0.6606454",
"0.65807164",
"0.65761447",
"0.6571461",
"0.64482975",
"0.6435993",
"0.6408817",
"0.6379987",
"0.6377688",
"0.6366689",
"0.636141",
"0.6359453",
"0.6342381",
"0.6326043... | 0.0 | -1 |
Tests whether a given SensorChangeEvent corresponds to this EventRules sensor | public Event testEvent(SensorChangeEvent se, boolean override) throws PhidgetException {
Sensor eventSensor;
eventSensor = sensorController.getSensor(se.getIndex(), Sensor.sensorType.ANALOG, se.getSource());
if(eventSensor != null && eventSensor.getName().equals(sensorName)){
int cu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean hasChangeEvent();",
"public boolean check(EventType event);",
"private static boolean atSensor(SensorEvent e, int x, int y) {\n return e.getXpos() == x && e.getYpos() == y;\n }",
"public abstract boolean isBefore(SoSensor s);",
"public static boolean checkSensorState()\n\t{\n\t\tboolean s... | [
"0.6444825",
"0.61602986",
"0.571948",
"0.5616343",
"0.55727583",
"0.5530366",
"0.55258024",
"0.5445177",
"0.5422443",
"0.54131895",
"0.5409794",
"0.5344064",
"0.5330093",
"0.5329738",
"0.53249425",
"0.5315179",
"0.5296776",
"0.52737457",
"0.52445334",
"0.52015305",
"0.519183... | 0.5262373 | 18 |
Test the current state of the ThresholdEventRule | @Override
public Event testEvent() throws PhidgetException {
if((sensorController.getVal(sensorName) > threshold)){
return new Event(name_gt,description_gt, hideFromFeed);
} else {
return new Event(name_lt,description_lt, hideFromFeed);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void testThreshold() {\n final ThresholdCircuitBreaker circuit = new ThresholdCircuitBreaker(threshold);\n circuit.incrementAndCheckState(9L);\n assertFalse(\"Circuit opened before reaching the threshold\", circuit.incrementAndCheckState(1L));\n }",
"public interface ITh... | [
"0.63079584",
"0.59760714",
"0.5790021",
"0.567573",
"0.5516128",
"0.54145485",
"0.53749484",
"0.5369953",
"0.5369917",
"0.5363285",
"0.5362855",
"0.53594697",
"0.53254426",
"0.5241489",
"0.52351004",
"0.52264893",
"0.5198643",
"0.5198115",
"0.5184706",
"0.5172335",
"0.51535"... | 0.6060534 | 1 |
Tests whether an event name corresponds to this event rule | @Override
public boolean isCorrespondingTo(String eventName) {
return eventName.equals(name) || eventName.equals(name_lt) || eventName.equals(name_gt) ;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public boolean isCorrespondingTo(Event event){\n String n = event.getName();\n return n.equals(name) || n.equals(name_lt) || n.equals(name_gt);\n }",
"public boolean isEvent(String eventName) {\r\n\t\tboolean result = false;\r\n\t\tfor (Event e : events) {\r\n\t\t\tif (e.getName()... | [
"0.68328637",
"0.648308",
"0.63196445",
"0.6228689",
"0.619435",
"0.6056454",
"0.60493004",
"0.593311",
"0.5872691",
"0.58708686",
"0.5833317",
"0.5785219",
"0.5736995",
"0.5736995",
"0.5736995",
"0.5736995",
"0.5736995",
"0.5736995",
"0.5736995",
"0.5736995",
"0.5736995",
... | 0.66499686 | 1 |
Tests whether an Event corresponds to this event rule | @Override
public boolean isCorrespondingTo(Event event){
String n = event.getName();
return n.equals(name) || n.equals(name_lt) || n.equals(name_gt);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean check(EventType event);",
"boolean handlesEventsOfType(RuleEventType type);",
"public boolean match(Event e);",
"boolean hasEvent();",
"@objid (\"0480e45a-6886-42c0-b13c-78b8ab8f713d\")\n boolean isIsEvent();",
"boolean isSetEvent();",
"public boolean isSameEvent(Event event) {\n ... | [
"0.69599336",
"0.68395746",
"0.6762504",
"0.6713724",
"0.6645588",
"0.6459451",
"0.6245893",
"0.62118596",
"0.6199168",
"0.6185918",
"0.6168351",
"0.6151681",
"0.5946153",
"0.5931738",
"0.59119475",
"0.589026",
"0.58753824",
"0.5853012",
"0.58364505",
"0.579822",
"0.57539827"... | 0.6419129 | 6 |
for any class that implements interface the interface wants the class to use this interface and implement that method | public void fly()
{
System.out.println("Sparrow flying high...");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic void implements_(JDefinedClass cls) {\n\n\t}",
"@Override\n public boolean isInterface() { return false; }",
"@Override\n\tpublic void setInterface(Class<T> interfaceClass) {\n\t\t\n\t}",
"public interface zzo\n extends IInterface\n{\n\n public abstract void zze(AdRequestParcel a... | [
"0.7212551",
"0.6865493",
"0.6646974",
"0.663472",
"0.6582853",
"0.6582853",
"0.6514299",
"0.6496444",
"0.6420433",
"0.64144474",
"0.64109594",
"0.6406529",
"0.63685805",
"0.6330072",
"0.63278526",
"0.6315444",
"0.63143003",
"0.631357",
"0.6313091",
"0.62769324",
"0.62453896"... | 0.0 | -1 |
This method makes an initial entry into RBT_MONITORING table with trace result as null | public String startMonitor(String msisdn, String traceType) {
synchronized (_monitorSubMap) {
StringBuffer reason = new StringBuffer();
if (!canMonitor(msisdn, traceType, reason))
return reason.toString();
_monitorSubMap.put(msisdn, traceType);
_dbManager.insertMonitor(msisdn, null, traceType, MONITOR... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected abstract AbstractMonitorTrace createMonitorTrace();",
"protected abstract void trace_pre_updates();",
"@Override\n\tpublic EntryMessage traceEntry() {\n\t\treturn null;\n\t}",
"private void main_flow() throws SQLException {\n start_operation_complete_monitoring(this);\r\n BuffDBWriter... | [
"0.5493768",
"0.5214974",
"0.5165327",
"0.5124356",
"0.50806504",
"0.50223494",
"0.49738538",
"0.49691033",
"0.49228194",
"0.4903861",
"0.48995653",
"0.48724335",
"0.48534685",
"0.48483092",
"0.48104534",
"0.47889665",
"0.47828358",
"0.4737218",
"0.47017166",
"0.46811014",
"0... | 0.0 | -1 |
This method updates the trace entry in RBT_MONITORING to trace completed state | public String endMonitor(String msisdn) {
synchronized (_monitorSubMap) {
if (_monitorSubMap.containsKey(msisdn)) {
notifyWaitingThread(msisdn);
return RESPONSE_SUCCESS;
}
else
return RESPONSE_NO_ACTIVE_MONITOR;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tprotected void done() {\n\t\t//close the monitor \n\t\tprogressMonitorReporter.closeMonitor();\n\t\t\n\t\t//Inform application that operation isn't being in progress. \n\t\tapplicationInteractor.setOperationInProgress(false);\n\t}",
"public void handleSimStatusCompleted() {\n }",
"public void s... | [
"0.5461959",
"0.5370526",
"0.5293653",
"0.5272235",
"0.5256873",
"0.52481294",
"0.52050453",
"0.516602",
"0.5163003",
"0.5154772",
"0.51432073",
"0.5109479",
"0.51033115",
"0.50916266",
"0.50914145",
"0.5078604",
"0.50604457",
"0.5046195",
"0.5028395",
"0.5026941",
"0.5023865... | 0.0 | -1 |
This method makes/updates entry in RBT_MONITORING table | public void endNode(String msisdn, RBTNode node) {
if (_monitorNodeMap.containsKey(msisdn)) {
updateMonitor(msisdn, node);
deregisterSubNode(msisdn);
boolean endMonitor = false;
boolean successResponse = node.getNodeRespone().equals(RBTNode.RESPONSE_SUCCESS);
if (node.getNodeRespone() != null && !succe... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"int updateByPrimaryKey(BasicInfoAnodeBurningLossRate record);",
"@Override\n\tpublic void updateEntries(Reservation reservation) {\n\t\tresTable.save(reservation);\n\t\t\n\t}",
"int updateByPrimaryKey(HrHBscCpuQos record);",
"public boolean putMonitor(Hardware monitor) {\n if (monitors.size() < Workin... | [
"0.56163144",
"0.5438994",
"0.5426346",
"0.5425503",
"0.53670454",
"0.53453135",
"0.53026253",
"0.52880543",
"0.5284425",
"0.5276252",
"0.5235994",
"0.51840276",
"0.5174057",
"0.5171656",
"0.5164549",
"0.51640457",
"0.51557773",
"0.5153044",
"0.5133838",
"0.50944537",
"0.5088... | 0.0 | -1 |
This method checks of monitoring can happen for this number/node | public boolean canMonitor(String msisdn, String traceType, StringBuffer reason) {
// checking the configuration if can monitor for this number
String numbersList = CacheManagerUtil.getParametersCacheManager().getParameter(MONITOR,
"MONITOR_NUMBERS", "").getValue();
StringTokenizer stk = new StringTokenizer(nu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean isMonitoringEnabled();",
"boolean isMonitoring();",
"boolean isMonitoring();",
"public static boolean isMonitoring(){\n\t\treturn ZMonitorManager.getInstance().getMonitorLifecycle().isMonitorStarted();\n\t}",
"protected boolean hasMonitoringPermissions() {\r\n\t\tfinal Jenkins jenkins = Jenkins.get... | [
"0.7352734",
"0.7197518",
"0.7197518",
"0.6690785",
"0.6491473",
"0.6460803",
"0.63179415",
"0.62685347",
"0.6099622",
"0.6074146",
"0.6058055",
"0.59777313",
"0.58776724",
"0.5877234",
"0.58520997",
"0.58062506",
"0.57929623",
"0.5752425",
"0.5720218",
"0.5706002",
"0.569366... | 0.57801557 | 17 |
This method stores the subscriber as key & node as value in hashmap indicating trace is on for the sub | protected void registerSubNode(String msisdn, RBTNode node) {
synchronized (_monitorNodeMap) {
if (!_monitorNodeMap.containsKey(msisdn)) {
node.setNodeStartTime(new Date());
_monitorNodeMap.put(msisdn, node);
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Object visitMapOfReferences(MapOfReferencesNode node, Object state);",
"public void sinkCounterMap(){\n for(int i=1; i<(sinkCounter+1); i++){\n sinkCounterMap.put(i,1); //sink is included in basin count;\n \n }\n }",
"public Map<String, SmsHandy> getSubscriber() {\n\t\tre... | [
"0.55333245",
"0.51128644",
"0.5109088",
"0.50135326",
"0.4924413",
"0.4840653",
"0.48261833",
"0.48118067",
"0.47924998",
"0.4791846",
"0.4754216",
"0.4744032",
"0.47393793",
"0.47278866",
"0.47265318",
"0.47094598",
"0.47035965",
"0.46610937",
"0.46491274",
"0.46340632",
"0... | 0.50518024 | 3 |
Initiates the copy monitoring request | public String processCopyMonitor(HashMap<String, String> map) {
String cCode = map.get(param_ccode);
String vCode = map.get(param_vcode);
Clip clip = null;
if (cCode != null)
clip = getClipByPromoID(cCode);
else if (vCode != null)
clip = getClipByVCode(vCode);
if (clip == null) {
_logger.warn("RBT:... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setCopyRequestId(long copyRequestId);",
"private void startASpaceCopyProcess(final RemoteDBConnectDialogLight sourceRCD, final String sourceTitle,\n final int sourceUrlIndex) {\n Thread performer = new Thread(new Runnable() {\n public void run(... | [
"0.5747704",
"0.5710498",
"0.56593937",
"0.5376758",
"0.53588355",
"0.5188794",
"0.51712066",
"0.51499104",
"0.51414067",
"0.5128834",
"0.50980526",
"0.5062987",
"0.5062969",
"0.50479776",
"0.5015568",
"0.5007338",
"0.49836034",
"0.4977858",
"0.4974786",
"0.4971459",
"0.49656... | 0.5346962 | 5 |
TODO Autogenerated method stub | public String processThirdPartyMonitor(HashMap<String, String> map) {
String traceType = map.get(param_tracetype);
String msisdn = map.get(param_msisdn);
String url = Utility.getBaseURLForSubscriber(msisdn);
if (traceType.equals(TRACE_TYPE_AUTODIAL))
url += "/autodial.jsp?";
else if (traceType.equals(TRACE... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
This function is to assert Staff page heading. | public void assertStaffPageHeading() {
waitForElement(xpathHeading);
String actualHeading = assertAndGetText(xpathHeading);
logger.info("# Staff page header: " + actualHeading);
assertEquals(actualHeading, HEADING,
"Actual heading '" + actualHeading + "' should be same as exp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Then(\"^check the heading of the page$\")\r\n\tpublic void check_the_heading_of_the_page() throws Exception {\n\t\tString heading=driver.findElement(By.xpath(\".//*[@id='mainCnt']/div[1]/div[1]/h1\")).getText();\r\n\t\tif(heading.contentEquals(\"Hotel Booking Application\")) {\r\n\t\t\tSystem.out.println(\"conten... | [
"0.69463724",
"0.68656355",
"0.6847113",
"0.6746404",
"0.66615796",
"0.6576038",
"0.6552036",
"0.6550421",
"0.6532739",
"0.6491938",
"0.6470482",
"0.6447524",
"0.6446351",
"0.639351",
"0.63921344",
"0.6373771",
"0.63736874",
"0.63681054",
"0.63410217",
"0.6320604",
"0.6284755... | 0.86504006 | 0 |
This function is to create new staff with staff name & branch name. | public int createNewStaff(String name, String branch) {
clickOnBtn(ActionsEnum.Create.name());
fillCreateOrEditForm(name, branch);
clickOnBtn(ActionsEnum.Save.name());
waitForElementInvisibility(xpathBtn.replace("*btn*", ActionsEnum.Save.name()));
int id = getMaxId();
log... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int createNewStaff(String name, int branchId) {\n clickOnBtn(ActionsEnum.Create.name());\n fillCreateOrEditForm(name, branchId);\n clickOnBtn(ActionsEnum.Save.name());\n waitForElementInvisibility(xpathBtn.replace(\"*btn*\", ActionsEnum.Save.name()));\n int id = getMaxId()... | [
"0.7519248",
"0.6802246",
"0.6643687",
"0.6593604",
"0.64376247",
"0.6268547",
"0.6255431",
"0.6228949",
"0.6207386",
"0.6102436",
"0.6076676",
"0.6060557",
"0.6023377",
"0.5958735",
"0.59425795",
"0.5873306",
"0.57865775",
"0.576511",
"0.5681106",
"0.565167",
"0.5613755",
... | 0.76708704 | 0 |
This is to create new staff with staff name & branch id. | public int createNewStaff(String name, int branchId) {
clickOnBtn(ActionsEnum.Create.name());
fillCreateOrEditForm(name, branchId);
clickOnBtn(ActionsEnum.Save.name());
waitForElementInvisibility(xpathBtn.replace("*btn*", ActionsEnum.Save.name()));
int id = getMaxId();
lo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int createNewStaff(String name, String branch) {\n clickOnBtn(ActionsEnum.Create.name());\n fillCreateOrEditForm(name, branch);\n clickOnBtn(ActionsEnum.Save.name());\n waitForElementInvisibility(xpathBtn.replace(\"*btn*\", ActionsEnum.Save.name()));\n int id = getMaxId();... | [
"0.7860095",
"0.6970212",
"0.67890483",
"0.67050683",
"0.65583205",
"0.65309095",
"0.645054",
"0.63883275",
"0.6387148",
"0.6273906",
"0.62178844",
"0.6178063",
"0.6172199",
"0.6155939",
"0.6116637",
"0.60930824",
"0.5927283",
"0.58306473",
"0.57966703",
"0.57875276",
"0.5749... | 0.77924186 | 1 |
This function is to update Staff's details. | public void updateStaffDetails(String action, String name, String branch) {
fillCreateOrEditForm(name, branch);
clickOnBtn(action);
waitForElementInvisibility(xpathBtn.replace("*btn*", action));
logger.info("# Updated staff details");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic int updateStaff(int staff_id) throws Exception {\n\t\treturn dao.update(staff_id);\n\t}",
"public boolean updateStaff(Staff staff) {\n\t\treturn false;\n\t}",
"@PutMapping(\"/updateStaff\")\n\tpublic Staff updateStaff(@RequestBody Staff staff) {\n\t\treturn staffService.updateStaff(staff);\... | [
"0.73178273",
"0.7219777",
"0.7108861",
"0.7038735",
"0.6925801",
"0.6757835",
"0.67238355",
"0.66878957",
"0.6647443",
"0.6592112",
"0.6262261",
"0.62309253",
"0.6193259",
"0.6172353",
"0.61344886",
"0.6120151",
"0.6115328",
"0.60451484",
"0.60423297",
"0.6021205",
"0.598561... | 0.67809486 | 5 |
This is function is to create or cancel staff. | public int createAndCancel(String name, String branch) {
clickOnBtn(ActionsEnum.Create.name());
fillCreateOrEditForm(name, branch);
clickOnBtn(ActionsEnum.Cancel.name());
waitForElementInvisibility(xpathBtn.replace("*btn*", ActionsEnum.Cancel.name()));
return getMaxId();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int createNewStaff(String name, String branch) {\n clickOnBtn(ActionsEnum.Create.name());\n fillCreateOrEditForm(name, branch);\n clickOnBtn(ActionsEnum.Save.name());\n waitForElementInvisibility(xpathBtn.replace(\"*btn*\", ActionsEnum.Save.name()));\n int id = getMaxId();... | [
"0.5862157",
"0.5846986",
"0.5705904",
"0.56990993",
"0.56407934",
"0.56160736",
"0.56064194",
"0.5577184",
"0.55709654",
"0.54971975",
"0.54637945",
"0.5433525",
"0.5394933",
"0.5276706",
"0.5260797",
"0.5255054",
"0.5213853",
"0.52110094",
"0.51800257",
"0.5155408",
"0.5148... | 0.0 | -1 |
This function is to assert staff by id, name & branch. | public void assertStaffRowBy(int id, String name, String branch) {
mapStaff = getStaffRowById(id);
assertEquals(mapStaff.get("ID"), String.valueOf(id),
"Actual ID " + mapStaff.get("ID") + "should be same as expected " + id);
assertEquals(mapStaff.get("Name"), name,
"Actua... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void assertDetailsOnEditForm(int id, String name, String branch) {\n \twaitForElementVisibility(xpathFormHeading);\n String actualId = assertAndGetAttributeValue(xpathIdTF, \"value\");\n String actualName = assertAndGetAttributeValue(xpathNameTF, \"value\");\n String actualBranch = g... | [
"0.6507917",
"0.62897754",
"0.5909511",
"0.58960694",
"0.5890232",
"0.5789678",
"0.5784295",
"0.56374526",
"0.56366134",
"0.5622519",
"0.5514065",
"0.54769003",
"0.54676646",
"0.5459703",
"0.54280055",
"0.5342056",
"0.53285736",
"0.53015816",
"0.52999586",
"0.5282803",
"0.527... | 0.77924794 | 0 |
This function is to navigate to Staff's Details Page corresponding to given staff's id. | public void navigateToStaffDetailPageById(int id) {
String rowIndex = String.valueOf(getRowIndexById(id));
String xpathIdLink = xpathTableCell.replace("*row*", rowIndex).replace("*col*", "1");
xpathIdLink = xpathIdLink + "//a";
assertAndClick(xpathIdLink);
logger.info("# Clicked ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@GetMapping(\"/{staffId}\")\n\tpublic ResponseEntity<?> viewStaff(@PathVariable(\"staffId\") int sid) {\n\t\tUniversityStaffMember staff = universityService.viewStaff(sid);\n\t\tif (staff == null)\n\t\t\tthrow new DataNotFoundException(\"Request\", \"Staff with id \" + sid + \" not found\");\n\t\telse\n\t\t\tretur... | [
"0.6412144",
"0.6299987",
"0.62883854",
"0.6139518",
"0.59513164",
"0.59265286",
"0.58844626",
"0.5837285",
"0.5804313",
"0.57790685",
"0.57584435",
"0.57316613",
"0.573164",
"0.5726486",
"0.5672381",
"0.56644285",
"0.5648798",
"0.56238353",
"0.5607486",
"0.5588148",
"0.55390... | 0.8495822 | 0 |
This function is to click on actions(View, Edit, Delete) button corresponding to staff's id. | public void clickOnActionCorrespondingToId(String action, int id) {
String rowIndex = String.valueOf(getRowIndexById(id));
String xpathRowView = xpathRowAction.replace("*row*", rowIndex);
xpathRowView = xpathRowView.replace("*btn*", action);
assertAndClick(xpathRowView);
logger.i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void clickEditButton(){\r\n\t\t\r\n\t\tMcsElement.getElementByXpath(driver, \"//div[contains(@class,'x-tab-panel-noborder') and not(contains(@class,'x-hide-display'))]//button[contains(@class,'icon-ov-edit')]\").click();\r\n\t\t\r\n\t}",
"public void clickEdit() {\r\n\t\tEdit.click();\r\n\t}",
"public v... | [
"0.6816067",
"0.6674824",
"0.6592661",
"0.6569482",
"0.6473347",
"0.6469729",
"0.6332489",
"0.6319479",
"0.61191654",
"0.6021792",
"0.59804666",
"0.59752524",
"0.5949495",
"0.59427756",
"0.59208715",
"0.5867518",
"0.5779524",
"0.5777191",
"0.5748007",
"0.573556",
"0.5732393",... | 0.629889 | 8 |
This function is to assert details on Staff's Edit Form corresponding to staff's id. | public void assertDetailsOnEditForm(int id, String name, String branch) {
waitForElementVisibility(xpathFormHeading);
String actualId = assertAndGetAttributeValue(xpathIdTF, "value");
String actualName = assertAndGetAttributeValue(xpathNameTF, "value");
String actualBranch = getSelectTextBy... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\r\n\tpublic void validEditTest() {\n\t\tadminUserEdit.clickAdminLink();\r\n\t\tadminUserEdit.clickUserListLink();\r\n\t\tadminUserEdit.clickEditUserLink();\r\n\t\t\r\n\t\t// Assertion\r\n\t\tString Actual = adminUserEdit.Assertion();\r\n\t\tString Expected = \"Hari\";\r\n\t\tassertEquals(Actual, Expected);\r... | [
"0.6520432",
"0.65013784",
"0.64034545",
"0.6351799",
"0.6268184",
"0.62460077",
"0.61787903",
"0.6173032",
"0.6169989",
"0.60546964",
"0.6050475",
"0.6036361",
"0.59823066",
"0.5974722",
"0.58323973",
"0.583164",
"0.58286524",
"0.57956004",
"0.57928807",
"0.57874554",
"0.576... | 0.70564103 | 0 |
This function is to assert Confirmation modal corresponding to staff's id. | public void assertDeleteConfirmationModalForStaff(int id) {
waitForElementVisibility(xpathDeleteConfMsg);
String actualMsg = assertAndGetAttributeValue(xpathDeleteConfMsg, "innerText");
logger.info("# Delete confirmation modal: " + actualMsg);
String expetedMsg = CONFIRMATION_MSG.replace... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Then(\"^He should get a ticket confirmation$\")\n\tpublic void heShouldGetATicketConfirmation() throws Exception {\n\t\tdante.should(seeThat(FlySearchResult.displayed(),\n\t\t\t\thasItem(\"(Clic para ver el adjunto)\")));\n\t}",
"public void testShowModalDialog() {\n System.out.println(\"showModalDialog\... | [
"0.5892561",
"0.58862364",
"0.57559484",
"0.57202315",
"0.570488",
"0.5661978",
"0.5612681",
"0.55196",
"0.55013096",
"0.54961073",
"0.5485267",
"0.5439774",
"0.5370626",
"0.53497165",
"0.53493077",
"0.5332318",
"0.53285134",
"0.53279287",
"0.5311669",
"0.5237866",
"0.5226979... | 0.7904595 | 0 |
This function is to click on the Delete button on the Delete Confirmation modal. | public void deleteStaff(String action) {
assertAndClick(xpathDeleteFormBtn.replace("*btn*", action));
waitForElementInvisibility(xpathDeleteFormBtn.replace("*btn*", action));
logger.info("# Clicked on '" + action + "' button on Delete confirmation modal");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void clickOnDeleteButton() {\r\n\t\tsafeClick(addMarkerOkButton.replace(\".ant-modal-footer button.ant-btn.ant-btn-primary\",\r\n\t\t\t\t\".ant-btn.ant-btn-danger.ant-btn-circle\"), MEDIUMWAIT);\r\n\t}",
"public void clickConfirmDeleteButton() {\n // GeneralUtilities.waitSomeSeconds(1);\n ... | [
"0.8201773",
"0.7983248",
"0.77470535",
"0.75036794",
"0.7374992",
"0.7298952",
"0.7263668",
"0.70193607",
"0.6998378",
"0.69800675",
"0.6893328",
"0.6829489",
"0.66862315",
"0.6673335",
"0.661929",
"0.6599424",
"0.65989363",
"0.65970474",
"0.6573842",
"0.6553292",
"0.6553081... | 0.64011663 | 28 |
This function is to assert validation message for Staff's name field on Create or Edit form. | public void assertValidationMsg(String txt, String msg) {
clickOnBtn(ActionsEnum.Create.name());
waitForElementVisibility(xpathFormHeading);
String actual = assertAndGetAttributeValue(xpathFormHeading, "innerText");
assertEquals(actual, FORM_HEADING,
"Actual heading '" + actu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\r\n\tpublic void testNameValid() {\r\n\t\tassertTrue(Activity5Query.isNameCorrect(\"JANE\"));\r\n\t\tassertTrue(Activity5Query.isNameCorrect(\"John\"));\r\n\t\tassertTrue(Activity5Query.isNameCorrect(\"Mary\"));\r\n\t\tassertTrue(Activity5Query.isNameCorrect(\" Kurisu\"));\r\n\t\tassertTrue(Activity5Query.... | [
"0.66263485",
"0.65617085",
"0.6404713",
"0.63903224",
"0.63641125",
"0.62437564",
"0.62060153",
"0.61909354",
"0.6164648",
"0.6161921",
"0.61610657",
"0.61590874",
"0.61462104",
"0.6143911",
"0.6132892",
"0.61027735",
"0.60880446",
"0.60830224",
"0.60609704",
"0.60583556",
"... | 0.6374701 | 4 |
This function is to get the staff row corresponding to given staff's id. | public Map<String, String> getStaffRowById(int id) {
String rowIndex = String.valueOf(getRowIndexById(id));
String xpathRow = xpathTableCell.replace("*row*", rowIndex);
mapStaff = new HashMap<String, String>();
mapStaff.put("ID", assertAndGetText(xpathRow.replace("*col*", "1")));
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic Staff selectByPrimaryKey(Integer id) {\n\t\treturn staffMapper.selectByPrimaryKey(id);\n\t}",
"private Staff findById(String id) throws Exception{\n if(StringUtils.isBlank(id) || StringUtils.equalsIgnoreCase(id, \"0\"))\n throw new Exception(\"Invalid staff id\");\n\n ... | [
"0.7639758",
"0.71796715",
"0.7084527",
"0.7058009",
"0.6740907",
"0.6589868",
"0.65558755",
"0.6472172",
"0.63806283",
"0.6349593",
"0.6314046",
"0.6285282",
"0.62512445",
"0.62438935",
"0.6224949",
"0.619099",
"0.61538464",
"0.6110964",
"0.6062434",
"0.60245323",
"0.5978591... | 0.76929563 | 0 |
This function is to get the row index corresponding to staff's id. | public int getRowIndexById(int id) {
String xpathRowsWithIdCell = xpathTableCell.replace("*col*", "1");
int rowIndex = 1;
String xpath = xpathRowsWithIdCell.replace("*row*", String.valueOf(rowIndex));
while (isElementPresent(xpath)) {
if (assertAndGetText(xpath).equals(Strin... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int getRowIndex(T obj) {\r\n\t\tlogger.trace(\"Enter getRowIndex\");\r\n\t\tlogger.trace(\"Exit getRowIndex\");\r\n\t\treturn data.indexOf(obj);\r\n\t}",
"public int getIndexNumber(){\n return id;\r\n }",
"int getRowId();",
"int getRowId();",
"int getRowId();",
"int getRowId();",
"int getRow... | [
"0.67887443",
"0.6562203",
"0.65397197",
"0.65397197",
"0.65397197",
"0.65397197",
"0.65397197",
"0.64976305",
"0.6486875",
"0.645352",
"0.6268333",
"0.62600136",
"0.61874455",
"0.6169001",
"0.616459",
"0.61612755",
"0.61524564",
"0.61419815",
"0.61015546",
"0.60587317",
"0.6... | 0.6777741 | 1 |
This function is to fill the details on the Create or Edit Staff Form. | private void fillCreateOrEditForm(String name, String branch) {
waitForElementVisibility(xpathFormHeading);
String actual = assertAndGetAttributeValue(xpathFormHeading, "innerText");
assertEquals(actual, FORM_HEADING,
"Actual heading '" + actual + "' should be same as expected headin... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void fillCreateOrEditForm(String name, int branchId) {\n waitForElementVisibility(xpathFormHeading);\n String actual = assertAndGetAttributeValue(xpathFormHeading, \"innerText\");\n assertEquals(actual, FORM_HEADING,\n \"Actual heading '\" + actual + \"' should be same as ex... | [
"0.6525524",
"0.65046424",
"0.6333074",
"0.6302612",
"0.6243908",
"0.60953456",
"0.6085076",
"0.60785246",
"0.59988546",
"0.59431404",
"0.5934198",
"0.5924593",
"0.58925164",
"0.58882296",
"0.5876743",
"0.5873368",
"0.585362",
"0.58328927",
"0.58265644",
"0.5807625",
"0.58029... | 0.64485884 | 2 |
This function is to fill the details on the Create or Edit Staff Form. | private void fillCreateOrEditForm(String name, int branchId) {
waitForElementVisibility(xpathFormHeading);
String actual = assertAndGetAttributeValue(xpathFormHeading, "innerText");
assertEquals(actual, FORM_HEADING,
"Actual heading '" + actual + "' should be same as expected heading... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void addContactDetails() {\n firstNameField.setText(contact.getFirstName());\n middleNameField.setText(contact.getMiddleName());\n lastNameField.setText(contact.getLastName());\n\n homePhoneField.setText(contact.getHomePhone());\n workPhoneField.setText(contact.getWorkPhon... | [
"0.65046424",
"0.64485884",
"0.6333074",
"0.6302612",
"0.6243908",
"0.60953456",
"0.6085076",
"0.60785246",
"0.59988546",
"0.59431404",
"0.5934198",
"0.5924593",
"0.58925164",
"0.58882296",
"0.5876743",
"0.5873368",
"0.585362",
"0.58328927",
"0.58265644",
"0.5807625",
"0.5802... | 0.6525524 | 0 |
This function is to get the max Id on the Staff page. | public int getMaxId() {
int count = driver.findElements(By.xpath(xpathTableRows)).size();
int maxID = -1;
if (count > 0) {
maxID = Integer.parseInt(assertAndGetText(xpathTableRows + "[" + count + "]//td[1]"));
}
return maxID;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int getLastID() {\n\t\t\n\t\tArrayList<Integer> domandeIdList = new ArrayList<>();\n\t\tdomandeIdList.add(0);\n\t\tDB db = getDB();\n\t\tMap<Long, Domanda> domande = db.getTreeMap(\"domande\");\n\t\t\n\t\tfor(Map.Entry<Long, Domanda> domanda : domande.entrySet())\n\t\t\tif(domanda.getValue() instanceof Dom... | [
"0.70883423",
"0.7047765",
"0.69316536",
"0.67871505",
"0.66897035",
"0.6602659",
"0.6481553",
"0.64153564",
"0.6387265",
"0.6362319",
"0.6362085",
"0.631231",
"0.62269497",
"0.62211",
"0.61813766",
"0.61376363",
"0.6134027",
"0.611131",
"0.60939217",
"0.6088839",
"0.608476",... | 0.67253935 | 4 |
This function is to click on the button based on button text. | private void clickOnBtn(String btnTxt) {
waitForElementClickable(xpathBtn.replace("*btn*", btnTxt));
assertAndClick(xpathBtn.replace("*btn*", btnTxt));
logger.info("# Clicked on '" + btnTxt + "' button");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void clickOnText(String text);",
"public void clickOnSearchButton() {\n elementControl.clickElement(searchButton);\n }",
"@And (\"^I click on \\\"([^\\\"]*)\\\"$\")\n\tpublic void click_on(String object){\n\t\tString result = selenium.clickButton(object);\n\t\tAssert.assertEquals(selenium.resu... | [
"0.71568173",
"0.71494454",
"0.70674926",
"0.70347166",
"0.6969011",
"0.69350123",
"0.6834227",
"0.6833055",
"0.68169415",
"0.67661965",
"0.67558086",
"0.6745273",
"0.672664",
"0.6726343",
"0.66963315",
"0.66855526",
"0.6639536",
"0.66015196",
"0.65924007",
"0.65888965",
"0.6... | 0.7100262 | 2 |
This function is to assert that save button should be disabled. | public void assertSaveBtnDisable() {
assertTrue(isElementPresent(xpathDisabledSaveBtn), "Save button should be disabled.");
logger.info("# 'Save' button is disabled.");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void enableSaveButton()\n {\n boilerplate.getSaveButton().setDisable(false);\n }",
"@Test\n public void testifyBtn() throws InterruptedException {\n onView(withId(R.id.SaveButton)).check(matches(isDisplayed()));\n\n }",
"void setSaveButtonEnabled(boolean isEnabled);",
"public... | [
"0.691821",
"0.666445",
"0.6642705",
"0.6615878",
"0.65137464",
"0.6484277",
"0.64431536",
"0.6439775",
"0.6407644",
"0.63424414",
"0.63143706",
"0.63054657",
"0.6271561",
"0.62560564",
"0.624779",
"0.6237211",
"0.61363983",
"0.61272144",
"0.6101737",
"0.60831934",
"0.6079994... | 0.8706264 | 0 |
This function is to search staffs on the Staff page. | public void searchStaff(String searchTxt) {
assertAndType(xpathSearchTF, searchTxt);
clickOnBtn(SEARCH_A_STAFF);
logger.info("# Performed staff search for '" + searchTxt + "'");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public List<StaffPojo> staffSearchByName(String sname) {\n\t\treturn staffDao.staffSearchByName(sname);\n\t}",
"private static void searchStaffByName(){\n\t\tshowMessage(\"type the name you are looking for: \\n\");\n\t\tString name = getUserTextTyped();\n\t\tToScreen.listEmployee(EmployeeSearch.employee(employee... | [
"0.7275795",
"0.6922622",
"0.6900557",
"0.6633207",
"0.64860743",
"0.6334683",
"0.62601477",
"0.6258119",
"0.6217497",
"0.6157502",
"0.6151007",
"0.6149501",
"0.61415327",
"0.6074678",
"0.60650086",
"0.6058798",
"0.60269254",
"0.6022068",
"0.5996625",
"0.5927888",
"0.5910713"... | 0.7108881 | 1 |
This function is to return list of all rows present on Staff page. | private List<List<String>> getAllRows() {
List<List<String>> rowLst = new ArrayList<List<String>>();
int rowIndex = 1;
String xpathRow = xpathTableRow.replace("*row*", String.valueOf(rowIndex));
while (isElementPresent(xpathRow) && isElementVisible(xpathRow)) {
List<String> r... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public List<StaffPojo> viewAllStaff() {\n\t\treturn staffDao.viewAllStaff();\n\t}",
"@Override\n\tpublic List<Staff> FindAll() {\n\t\treturn sessionFactory.getCurrentSession()\n\t\t\t\t.createQuery(\"from Staff\")\n\t\t\t\t.list();\n\t}",
"@GetMapping\n\tpublic List<UniversityStaffMember> viewAllStaffs() {\n\t... | [
"0.7224744",
"0.7007723",
"0.6970695",
"0.6891952",
"0.6700388",
"0.663982",
"0.6609283",
"0.65989435",
"0.6563515",
"0.65630823",
"0.6459788",
"0.63388675",
"0.632897",
"0.62467533",
"0.61869466",
"0.61750895",
"0.5983324",
"0.59765637",
"0.59378093",
"0.5853829",
"0.5848226... | 0.0 | -1 |
This function is to assert that search text or searched keyword is present in searched result. | public void assertSearchResult(String searchKeyword) {
List<List<String>> rowLst = getAllRows();
assertTrue(rowLst.size() > 0, "Search is not performed.");
boolean isPresent;
for (List<String> row : rowLst) {
isPresent = false;
for (String col : row) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n\tpublic void VerifyTheSearchResult() {\n\t\tString searchString = \"The Choice\";\n\t\thomePage.search(searchString);\n\t\tString searchTitle = resultPage.getSearchResultTitle();\n\t\tAssert.assertTrue(searchTitle.contains(searchString));\n\t}",
"@Test\n public void keywordSearchTest() throws Interrup... | [
"0.7470331",
"0.7360747",
"0.72711694",
"0.7134648",
"0.7106943",
"0.69926393",
"0.68057066",
"0.66127527",
"0.6535635",
"0.6523841",
"0.6480688",
"0.64557934",
"0.64218205",
"0.6407722",
"0.6348752",
"0.6247387",
"0.6207014",
"0.61936283",
"0.61476505",
"0.614511",
"0.613323... | 0.74479926 | 1 |
This function is to assert that searched text is not present in the search result. Negation keyword search | public void assertSearchResultShouldNotContain(String searchKeyword) {
List<List<String>> rowLst = getAllRows();
for (List<String> row : rowLst) {
boolean isPresent = false;
for (String col : row) {
if (col.toLowerCase().contains(searchKeyword.toLowerCase())) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void assertTextNotPresent ( final String text ) {\r\n try {\r\n assertFalse( driver.getPageSource().contains( text ) );\r\n }\r\n catch ( final Exception e ) {\r\n fail();\r\n }\r\n }",
"@Test \r\n public void shouldNotFindWordIntoTheDictionary() {\r\n... | [
"0.70002365",
"0.6900305",
"0.68370914",
"0.6790943",
"0.6693215",
"0.6675539",
"0.66210437",
"0.6553022",
"0.64277464",
"0.64177686",
"0.6299225",
"0.6291308",
"0.6163955",
"0.6121244",
"0.598097",
"0.5972084",
"0.58661246",
"0.5814235",
"0.57962763",
"0.5750946",
"0.5748914... | 0.7153169 | 0 |
This function is to assert that searched keyword should be present atleast in one of the searched staffs | public void assertAtleatOneResultFound(String searchKeyword) {
List<List<String>> rowLst = getAllRows();
boolean isPresent = false;
for (List<String> row : rowLst) {
for (String col : row) {
if (col.toLowerCase().contains(searchKeyword.toLowerCase())) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void userExist() {\n String username = argument.substring(0, 15);\n boolean found = false;\n\n for(int i = 0; i<users.size(); i++){\n if(users.get(i).substring(0, 15).trim().toLowerCase().contains(username.trim().toLowerCase())){\n found = true;\n ... | [
"0.58702546",
"0.58563906",
"0.5830665",
"0.5825671",
"0.57707185",
"0.5770509",
"0.57471114",
"0.5735521",
"0.569609",
"0.568474",
"0.5640544",
"0.5629266",
"0.56222147",
"0.5580717",
"0.5569716",
"0.54741675",
"0.5441089",
"0.543694",
"0.5414147",
"0.54104006",
"0.54038346"... | 0.56673425 | 10 |
Se genera el constructor de la clase e inicializa la variable _target | public ClickButtonAction() {
_target = new TargetComponent();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public TargetClass() {\n super();\n }",
"protected ForContainerCreation(Class<?> target) {\n this.target = target;\n }",
"public ConstructedObjectInput(AppContext c,Class<T> target){\n \tthis(c,target,c.getClassMap(target));\n }",
"public Target()\n\t{\n\t\tx = 2.0;\... | [
"0.8060281",
"0.74505204",
"0.72758156",
"0.6936934",
"0.67218137",
"0.67218137",
"0.66944426",
"0.63604206",
"0.6332866",
"0.6308902",
"0.62424994",
"0.62336993",
"0.6208373",
"0.61978346",
"0.6162484",
"0.6134538",
"0.6125266",
"0.6091297",
"0.60903096",
"0.6087108",
"0.608... | 0.60948825 | 17 |
Se genera el metodo encargado de ejecutar la tarea dar click | @Override
public Task Execute(IParam params) {
GeneralParams param = (GeneralParams)params;
return Task.where(param.where, Click.on(_target.Execute(params)));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\t\t\tpublic void mouseClicked(MouseEvent e) {\n\t\t\t\tSystem.out.println(\"vai ficar clikando ai a toa? PATETA\");\n\t\t\t\t\n\t\t\t}",
"@Override\n\tpublic void EjecutaGui() {\n\t\tSystem.out.println(\"Ejecucion en ventana del ejercicio 2 del grupo 3\");\n\t}",
"@Override\n\tprotected void OnClic... | [
"0.6472971",
"0.6217208",
"0.618606",
"0.6125002",
"0.61079127",
"0.6085084",
"0.60850537",
"0.60807776",
"0.6079841",
"0.60478574",
"0.6042949",
"0.6038992",
"0.6034965",
"0.6014732",
"0.601445",
"0.6003733",
"0.5994961",
"0.5993557",
"0.5968081",
"0.59655136",
"0.596237",
... | 0.0 | -1 |
Create an entity for this test. This is a static method, as tests for other entities might also need it, if they test an entity which requires the current entity. | public static SalesJaniCalc createEntity(EntityManager em) {
SalesJaniCalc salesJaniCalc = new SalesJaniCalc()
.mablaghJani(DEFAULT_MABLAGH_JANI)
.mablaghMaliEjbari(DEFAULT_MABLAGH_MALI_EJBARI)
.tedadRooz(DEFAULT_TEDAD_ROOZ)
.tarikhShoroFaaliat(DEFAULT_TARIKH_SHOR... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Entity createEntity();",
"T createEntity();",
"protected abstract ENTITY createEntity();",
"void create(E entity);",
"void create(T entity);",
"E create(E entity);",
"E create(E entity);",
"protected abstract EntityBase createEntity() throws Exception;",
"TestEntity buildEntity () {\n TestEn... | [
"0.77237844",
"0.75048935",
"0.7488585",
"0.736279",
"0.73147863",
"0.71573627",
"0.71573627",
"0.715141",
"0.7148617",
"0.7077601",
"0.7016931",
"0.6804163",
"0.6752578",
"0.6741185",
"0.6741185",
"0.6711834",
"0.6682166",
"0.6668473",
"0.66409945",
"0.6625449",
"0.66251147"... | 0.0 | -1 |
Executes the search, and checks that the default entity is returned | private void defaultSalesJaniCalcShouldBeFound(String filter) throws Exception {
restSalesJaniCalcMockMvc.perform(get("/api/sales-jani-calcs?sort=id,desc&" + filter))
.andExpect(status().isOk())
.andExpect(content().contentType(MediaType.APPLICATION_JSON_UTF8_VALUE))
.andExpe... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"abstract public boolean performSearch();",
"private void executeSearch() {\n if (!view.getSearchContent().getText().isEmpty()) {\n SearchModuleDataHolder filter = SearchModuleDataHolder.getSearchModuleDataHolder();\n //set search content text for full text search\n filter.... | [
"0.62747425",
"0.62287664",
"0.602412",
"0.59602237",
"0.58934677",
"0.5878962",
"0.583616",
"0.58002096",
"0.5778839",
"0.5778574",
"0.5762508",
"0.5760238",
"0.574392",
"0.5743293",
"0.57001936",
"0.56943953",
"0.56920964",
"0.5657031",
"0.5645491",
"0.5643414",
"0.56392866... | 0.0 | -1 |
Executes the search, and checks that the default entity is not returned | private void defaultSalesJaniCalcShouldNotBeFound(String filter) throws Exception {
restSalesJaniCalcMockMvc.perform(get("/api/sales-jani-calcs?sort=id,desc&" + filter))
.andExpect(status().isOk())
.andExpect(content().contentType(MediaType.APPLICATION_JSON_UTF8_VALUE))
.andE... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"abstract public boolean performSearch();",
"private void executeSearch() {\n if (!view.getSearchContent().getText().isEmpty()) {\n SearchModuleDataHolder filter = SearchModuleDataHolder.getSearchModuleDataHolder();\n //set search content text for full text search\n filter.... | [
"0.62589395",
"0.6218506",
"0.6082156",
"0.5994531",
"0.59762806",
"0.59283507",
"0.59174293",
"0.58518654",
"0.5797316",
"0.5794766",
"0.5779155",
"0.57745475",
"0.5763264",
"0.5742193",
"0.57290816",
"0.5713039",
"0.56897426",
"0.5649169",
"0.56415546",
"0.55876696",
"0.557... | 0.0 | -1 |
TODO Autogenerated method stub | public static void addActionListener(Compile compile) {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
byte[] bytes = getClass().getResourceAsStream("/fifa18.png").readAllBytes(); | public byte[] getImage(String file) throws Exception{
byte[] bytes = getClass().getResourceAsStream(file).readAllBytes();
return bytes;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static byte[] readResource(String name) throws IOException {\n byte[] buf = new byte[1024];\n\n InputStream in = Main.class.getResourceAsStream(name);\n ByteArrayOutputStream bout = new ByteArrayOutputStream();\n int n;\n while ((n = in.read(buf)) > 0) {\n bout.write(buf, 0, n);\n ... | [
"0.74399567",
"0.66437507",
"0.6337318",
"0.6259473",
"0.6207971",
"0.6157633",
"0.61526364",
"0.61414284",
"0.61145484",
"0.6085173",
"0.6080399",
"0.6080254",
"0.6064101",
"0.60600996",
"0.6016598",
"0.6002317",
"0.5992501",
"0.5989434",
"0.59884495",
"0.5905609",
"0.590498... | 0.7301524 | 1 |
Listener per icone del NavigationView | private void setNavigationViewActionListener() {
navigationView.setNavigationItemSelectedListener(
item -> {
Runnable r = HomeController.getHomeControllerInstance().getNavigationViewOnOptionsItemSelected(this, item.getItemId());
try {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic void onNaviViewLoaded() {\n\t\t\n\t}",
"private void implementListener() {\n binding.nvView.setNavigationItemSelectedListener(new NavigationView.OnNavigationItemSelectedListener() {\n @Override\n public boolean onNavigationItemSelected(@NonNull MenuItem menuItem) ... | [
"0.7721537",
"0.74908024",
"0.68085223",
"0.67793614",
"0.6751021",
"0.6692963",
"0.6604967",
"0.6576125",
"0.6570137",
"0.65465826",
"0.64870995",
"0.6480047",
"0.6475948",
"0.6475948",
"0.6467237",
"0.64194983",
"0.6386278",
"0.63761544",
"0.63709",
"0.6347544",
"0.6347276"... | 0.72590876 | 2 |
Listener per icone della toolbar | @Override
public boolean onOptionsItemSelected(@NonNull MenuItem item) {
Runnable onOptionsItemSelected = settingsController.getOnOptionsItemSelected(item.getItemId());
try {
onOptionsItemSelected.run();
return false;
}catch(NullPointerException e) {
Utili... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public interface OnToolBarListener {\n\n public void onToolBarActionStart();\n\n public void onToolBarStateChanged(boolean visible);\n\n public void onToolBarActionEnd();\n}",
"@Override\n public void setToolbar(MToolBar arg0)\n {\n \n }",
"public void toolbarImplementacionIsmael() {\n... | [
"0.7827643",
"0.7529672",
"0.7496069",
"0.72174966",
"0.7105174",
"0.6880561",
"0.6815782",
"0.67450327",
"0.6727445",
"0.6722214",
"0.6672408",
"0.6645781",
"0.66390055",
"0.66367334",
"0.6607724",
"0.65997875",
"0.6541169",
"0.65286225",
"0.65272313",
"0.65074235",
"0.65021... | 0.0 | -1 |
Before using and getting results from vision, we need to start the visionControl. It is possible to leave the vision control operating continuously if wanted, or to make it run only at specific times. This choice would depend on several things, but regardless it's important to make sure vision control is running. | @Override
public void initialize(ActionControl control) {
mVisionControl.start();
// We can set different options to vision control, which allow to configure the operation
// of vision. It is possible that the actual code which is running the vision will completely ignore
// the opt... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void start() {\r\n vcr().start();\t\r\n }",
"public void startTracking()\n\t{\t\n\t\tProcessBuilder starterProcess = new ProcessBuilder(\"ssh\", \n\t\t\t\t\t\t\t\t\t\t\"pi@\" + RASPBERRY_PI_LOCATION,\n\t\t\t\t\t\t\t\t\t\t\"\\\"sudo /home/pi/code/stop_vision.sh && /home/pi/code/start_vision.sh \" + \n\... | [
"0.6492931",
"0.6388566",
"0.6266141",
"0.62302756",
"0.62110585",
"0.62046826",
"0.6175667",
"0.6168639",
"0.615682",
"0.6139256",
"0.61206806",
"0.61167276",
"0.6106159",
"0.60845953",
"0.6045557",
"0.60438555",
"0.6039404",
"0.6031625",
"0.60122716",
"0.5995333",
"0.599413... | 0.593637 | 29 |
Now that the vision is running and configured, we can query it for results. However, the vision code could take some time to analyze results, and thus we may not always have results. In addition, we might want to use each result only once, which is way we clear the result using the parameter, which means an additional ... | @Override
public void execute(ActionControl control) {
Optional<VisionResult> optional = mVisionControl.getLatestResult(true);
// We need to handle two cases now: we have a new result, or we don't.
if (optional.isPresent()) {
// if we have a new result, we can get an Analysis obj... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"List<GameResult> getAllResults();",
"SearchResult getBestResult(List<SearchResult> results, SearchQuery query);",
"@Test\n\tvoid getResultsTest() {\n\t\tassertEquals(22, utilities.getResults(-21));\n\t\tassertEquals(20, utilities.getResults(-20));\n\t\tassertEquals(40, utilities.getResults(-19));\n\t\tassertEq... | [
"0.59206736",
"0.5784467",
"0.56334877",
"0.5631158",
"0.55077255",
"0.5479337",
"0.54742837",
"0.54712194",
"0.54636234",
"0.5414579",
"0.54108346",
"0.5294776",
"0.5290727",
"0.5272359",
"0.5263507",
"0.5255377",
"0.5233431",
"0.518487",
"0.51839834",
"0.51832926",
"0.51715... | 0.5266232 | 14 |
in here we need to determine when to stop the action. This usually depends on the vision, and is up to the specific situation. | @Override
public boolean isFinished() {
return false;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void finalAction(){\n Robot.stop();\n requestOpModeStop();\n }",
"boolean shouldStop();",
"StopAction createStopAction();",
"public void stop(boolean returnAction) {\n if(threadSound != null)threadSound.interrupt();\n selectedWord = null;\n if (!dataGame.isTrai... | [
"0.7191204",
"0.6772933",
"0.654733",
"0.6449016",
"0.639687",
"0.6387902",
"0.63260245",
"0.6305087",
"0.6251389",
"0.6242758",
"0.62226367",
"0.6217687",
"0.6180873",
"0.6173065",
"0.61652696",
"0.6163463",
"0.6162337",
"0.61463803",
"0.6144429",
"0.61434937",
"0.6138687",
... | 0.0 | -1 |
since we started the vision in initialize, we need to stop it here. we can also modify the options as a deinitialization. | @Override
public void end(FinishReason reason) {
mVisionControl.stop();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void initialize() {\n \tRobot.conveyor.stop();\n }",
"protected void initialize() {\n \tthis.running= false;\n }",
"@Override\n protected void initialize() {\n arm.getElbow().enableCoastMode();\n arm.getElbow().stop();\n arm.getWrist().enableCoastMode();\n arm.getWrist().stop... | [
"0.6270502",
"0.61714774",
"0.606971",
"0.5971248",
"0.5955609",
"0.5869331",
"0.58129275",
"0.5762662",
"0.5724607",
"0.5723435",
"0.57144284",
"0.57127553",
"0.5675303",
"0.56351185",
"0.56283754",
"0.5605567",
"0.5586696",
"0.5566056",
"0.55602056",
"0.5558152",
"0.5557020... | 0.54573154 | 35 |
///////////////////////////////////////////////////////////////// // public methods //// | public static void main(String args[]) throws DuplicateNMRRequestException {
// Constants...
final String vendor = "xilinx";
final String family = "virtex2";
final String part = "XC2V8000FF1517";
// *** Comment out the above name and
// use the following part if you ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"private stendhal() {\n\t}",
"@Override\n\tprotected void interr() {\n\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n public v... | [
"0.65948933",
"0.6475392",
"0.63615495",
"0.632693",
"0.62893796",
"0.62046444",
"0.6188225",
"0.6075393",
"0.6058208",
"0.6040633",
"0.6040633",
"0.60404086",
"0.60386187",
"0.60386187",
"0.6020168",
"0.60170305",
"0.6006618",
"0.6004605",
"0.59884095",
"0.59869736",
"0.5976... | 0.0 | -1 |
///////////////////////////////////////////////////////////////// // protected methods //// | protected void _init(EdifCell cell, int maxLUTs, int maxFFs, int maxBlockRAMs, int maxMult, int maxDCM, int maxIO)
throws OverutilizationEstimatedStopException, OverutilizationHardStopException, IllegalArgumentException {
// !!! Ordering matters, the super call to _init should be last !!!
ad... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n protected void prot() {\n }",
"private stendhal() {\n\t}",
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override... | [
"0.68144447",
"0.6787026",
"0.67088044",
"0.6616515",
"0.65669245",
"0.65584975",
"0.64969265",
"0.642418",
"0.6404177",
"0.63160753",
"0.62508935",
"0.6239731",
"0.62272894",
"0.6196991",
"0.6192827",
"0.6192827",
"0.61916935",
"0.6190131",
"0.61769617",
"0.6166845",
"0.6166... | 0.0 | -1 |
If only use onNext(), could use Consumer to replace the completed implementation of FlowableSubscriber | @Test
public void simplifiedFlowableDemo() {
StringBuilder sb = new StringBuilder();
Flowable<String> flowable = Flowable.create(new FlowableOnSubscribe<String>() {
@Override
public void subscribe(FlowableEmitter<String> flowableEmitter) throws Exception {
fl... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Flow.Subscriber<T> subscriber();",
"public abstract void onNext();",
"public interface SubscriberOnNextListener<T> {\n void onNext(T t);\n}",
"@Override\n public void onNext(final T value) {\n innerHandler.onNext(value);\n idlenessSource.check();\n }",
"@Override\n public void... | [
"0.6538536",
"0.64861494",
"0.6426278",
"0.62150997",
"0.6209898",
"0.6100831",
"0.5992279",
"0.59386677",
"0.5854315",
"0.57946813",
"0.5777331",
"0.57459426",
"0.5737318",
"0.57123536",
"0.57104194",
"0.57006466",
"0.56958014",
"0.56809044",
"0.56804836",
"0.5678352",
"0.56... | 0.56888694 | 17 |
Constructor for the class | public Parser(
String fileName,
Hash<String> movieTable,
Hash<String> reviewerTable,
SparseMatrix matrix) {
this.inputFile = fileName;
this.movieTable = movieTable;
this.reviewerTable = reviewerTable;
this.matrix = matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Constructor() {\r\n\t\t \r\n\t }",
"public Constructor(){\n\t\t\n\t}",
"public CyanSus() {\n\n }",
"public PSRelation()\n {\n }",
"public _355() {\n\n }",
"public Pitonyak_09_02() {\r\n }",
"private Instantiation(){}",
"public Chick() {\n\t}",
"public CSSTidier() {\n\t}",
"public Chauf... | [
"0.8684979",
"0.83157516",
"0.7531155",
"0.7512286",
"0.7384737",
"0.7306363",
"0.72895694",
"0.7229921",
"0.71888965",
"0.7186963",
"0.7162534",
"0.7162355",
"0.71531713",
"0.71493727",
"0.7139213",
"0.7135244",
"0.71339834",
"0.713029",
"0.7116769",
"0.70741767",
"0.7068038... | 0.0 | -1 |
parses the file and decides which method to call to store the information in the hash tables and/or sparse matrix | public void parseFile() {
File file = new File(inputFile);
try {
Scanner scan = new Scanner(file);
while (scan.hasNextLine()) {
String line = scan.nextLine();
line = line.replaceAll("\\s+", " ").trim();
if (line.isEmpty()) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String[] args) throws IOException{\n\r\n\t\tjava.io.FileReader fr = new FileReader(args[0]);\r\n\t\tBufferedReader reader = new BufferedReader(fr);\r\n\t\tString method = \"arg1\";\r\n\t\tString method2 = \"arg2\";\r\n\t\t\r\n\t\t//read method\r\n\t\tif(args.length >2){\r\n\t\t\tmethod = ar... | [
"0.58024013",
"0.5726659",
"0.5581044",
"0.55556613",
"0.5521982",
"0.55085397",
"0.5488091",
"0.54857934",
"0.5457352",
"0.5454117",
"0.5451734",
"0.54082817",
"0.5392376",
"0.53864604",
"0.5376953",
"0.5338905",
"0.5335901",
"0.5331296",
"0.5322104",
"0.5320802",
"0.5289665... | 0.5322572 | 18 |
This decides where to add the fields | public void add(String[] fields) {
// 0->reviewer, 1->Movie, 2->rating
if (Integer.parseInt(fields[2]) < 1 || Integer.parseInt(
fields[2]) > 10) {
System.out.println("Bad score |" + fields[2]
+ "|. Scores must be between 1 and 10.");
return;
}... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setupFields()\n {\n FieldInfo field = null;\n field = new FieldInfo(this, \"ID\", Constants.DEFAULT_FIELD_LENGTH, null, null);\n field.setDataClass(Integer.class);\n field.setHidden(true);\n field = new FieldInfo(this, \"LastChanged\", Constants.DEFAULT_FIELD_LENGT... | [
"0.67543054",
"0.6711566",
"0.64935386",
"0.64738524",
"0.64183533",
"0.6272493",
"0.6248808",
"0.6194286",
"0.61548483",
"0.61099136",
"0.6101098",
"0.6062876",
"0.60038304",
"0.5963505",
"0.5961629",
"0.59362155",
"0.59164476",
"0.5830117",
"0.5798028",
"0.5787094",
"0.5779... | 0.0 | -1 |
This chooses which table and matrix to delete from | public void delete(String tableName, String name) {
boolean delete;
if (tableName.equals("reviewer")) {
tableName = tableName.substring(0, 1).toUpperCase() + tableName
.substring(1);
delete = reviewerTable.delete(name, tableName);
if (delete) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void toDelete() {\n if(toCount()==0)\n {\n JOptionPane.showMessageDialog(rootPane,\"No paint detail has been currently added\");\n }\n else\n {\n String[] choices={\"Delete First Row\",\"Delete Last Row\",\"Delete With Index\"};\n int opti... | [
"0.63384265",
"0.6193763",
"0.61930186",
"0.61404",
"0.61068726",
"0.6017905",
"0.5983335",
"0.59827137",
"0.5942993",
"0.5932235",
"0.5908093",
"0.5879147",
"0.58290035",
"0.58157885",
"0.5814763",
"0.5780957",
"0.57685554",
"0.5765194",
"0.57641244",
"0.5753603",
"0.5751438... | 0.62205815 | 1 |
This chooses which table to print | public void print(String tableName, String name) {
if (name.equals("reviewer")) {
System.out.println("Reviewers:");
reviewerTable.printTable();
}
else { // then it is the movie
System.out.println("Movies:");
movieTable.printTable();
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void printTable(String type){\n\t\tSystem.out.println(\"\\n\\t\\t\\t\\t \" + type + \" Probing Analysis (Table size = \" + tableSize + \")\");\n\t\tSystem.out.println(\"\\t\\t ----- Inserts ------ ----------- Probes ---------- --------- Clusters ---------\");\n\t\tSystem.out.printf(\"%5s %10s %10s ... | [
"0.7095318",
"0.70271736",
"0.7003852",
"0.69064003",
"0.6876714",
"0.6847819",
"0.6826254",
"0.6755751",
"0.67500705",
"0.6680367",
"0.66717166",
"0.66628754",
"0.6650262",
"0.663988",
"0.66234386",
"0.65732545",
"0.6551911",
"0.6538181",
"0.65064335",
"0.6489565",
"0.648233... | 0.7202132 | 0 |
Prints the ratings that are in the sparse matrix | public void printRatings() {
// print the ratings
// get the sparse matrix class
// get the movie singly linked list
// to string on each entry of the lists
// Print out the reviewers and their count first
ReviewerList rL = matrix.getReviewers();
MSLList mL = matr... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void printSparse(){\n\t\tint NonZero=0;\n\t\tfor(int i=0;i<row;i++) {\n\t\t\tfor(int j=0;j<col;j++) {\n\t\t\t\tSystem.out.print(matrix[i][j]+\"\\t\");\n\t\t\t\tif(matrix[i][j]!=0) {\n\t\t\t\t\tNonZero++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t\tnumNonZero=NonZero;\n\t}",
"public... | [
"0.72182035",
"0.67134315",
"0.6674304",
"0.63318765",
"0.6320872",
"0.60553336",
"0.6017062",
"0.6007887",
"0.5919233",
"0.5884451",
"0.5878987",
"0.58359605",
"0.58145934",
"0.5752901",
"0.5703727",
"0.56973714",
"0.5581071",
"0.55805665",
"0.55769086",
"0.55730575",
"0.556... | 0.74298435 | 0 |
This chooses which table to list the movies or reviews from | public void list(String tableName, String name) {
if (tableName.equals("reviewer")) {
// make sure the name exists in the table
// if the return is null or a tombstone then it does not exist
int val = reviewerTable.search(name);
if (reviewerTable.getHashTable()[va... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void print(String tableName, String name) {\n if (name.equals(\"reviewer\")) {\n System.out.println(\"Reviewers:\");\n reviewerTable.printTable();\n }\n else { // then it is the movie\n System.out.println(\"Movies:\");\n movieTable.printTable(... | [
"0.605967",
"0.5475531",
"0.54391354",
"0.5394254",
"0.5380521",
"0.5357537",
"0.5340776",
"0.53122735",
"0.52724046",
"0.524262",
"0.5225694",
"0.5194167",
"0.5183032",
"0.5154712",
"0.51298714",
"0.51173115",
"0.51103526",
"0.50918615",
"0.50826925",
"0.5079184",
"0.5065384... | 0.6096436 | 0 |
This chooses which table to list closest movie or reviewer similar | public void similar(String tableName, String name) {
String simName = null;
float score = 11;
float val = 0;
int simCount = 0;
if (tableName.equals("reviewer")) {
if (matrix.getReviewers().contains(name) != null) {
// Node with the reference to the lis... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void list(String tableName, String name) {\n if (tableName.equals(\"reviewer\")) {\n // make sure the name exists in the table\n // if the return is null or a tombstone then it does not exist\n int val = reviewerTable.search(name);\n if (reviewerTable.getHa... | [
"0.5684668",
"0.5664923",
"0.56049794",
"0.51965714",
"0.5116956",
"0.5104782",
"0.5082653",
"0.50704175",
"0.5066733",
"0.5025459",
"0.4986848",
"0.49379414",
"0.48770547",
"0.4830466",
"0.48287237",
"0.4804085",
"0.47794166",
"0.47758785",
"0.4769953",
"0.47666648",
"0.4747... | 0.6754435 | 0 |
Splits the string without the command into a String Array | public String[] split(String lineWithoutCmd) {
String[] fields = new String[2];
// position of the first space
int pos = lineWithoutCmd.indexOf(" ");
// The name of the hashTable
String tableName = lineWithoutCmd.substring(0, pos);
// The name of the movie or reviewer
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static String[] splitCommand(String command) {\n java.util.List<String> matchList = new java.util.ArrayList<>();\n\n Pattern regex = Pattern.compile(\"[^\\\\s\\\"']+|\\\"([^\\\"]*)\\\"|'([^']*)'\");\n Matcher regexMatcher = regex.matcher(command);\n while (regexMatcher.find()) {\... | [
"0.6883944",
"0.6641889",
"0.64672613",
"0.6359679",
"0.63135886",
"0.6294272",
"0.6251741",
"0.6208367",
"0.61419463",
"0.61151403",
"0.61027604",
"0.610249",
"0.610146",
"0.609363",
"0.6084161",
"0.60604835",
"0.60521305",
"0.6013222",
"0.5995275",
"0.5908122",
"0.59068274"... | 0.56939125 | 37 |
Question 1: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. <a href=" | public static int maxDepth(TreeNode root) {
if (root == null) {
return 0;
}
return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"int maxDepth();",
"int getMax_depth();",
"@Override\n\tpublic int height() {\n\t\tif (this.valCount == 0) { // if empty leaf\n\t\t\treturn 0;\n\t\t}\n\t\tint max = 1; \n\t\tfor (int i = 0; i < childCount; ++i) { // finds longest route among children\n\t\t\tmax = Math.max(max, children[i].height() + 1);\n\t\t}\... | [
"0.796388",
"0.7664488",
"0.71615696",
"0.7150787",
"0.71318793",
"0.710841",
"0.70947117",
"0.7031649",
"0.69854254",
"0.6963577",
"0.6947917",
"0.69309366",
"0.69153076",
"0.6903907",
"0.688269",
"0.6876561",
"0.68259704",
"0.6796992",
"0.67957324",
"0.6795363",
"0.67901003... | 0.65179664 | 49 |
Question 2: Given a binary tree, determine if it is heightbalanced. For this problem, a heightbalanced binary tree is defined as: a binary tree in which the depth of the two subtrees of every node never differ by more than 1. <a href = " Method 1 of Question 2: [I am using the maxDepth method above] | public boolean isBalanced(TreeNode root) {
//base case:
if (root == null) {
return true;
} else if (Math.abs(maxDepth(root.right) - maxDepth(root.left)) > 1) {
return false;
}
return isBalanced(root.left) && isBalanced(root.right);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int checkHeight(Node root){\n\t\tif(root == null)\n\t\t\treturn 0;\n\t\tif(root.left == null && root.right == null)\n\t\t\treturn 1;\n\t\tint leftH = checkHeight(root.left);\n\t\tif(leftH == Integer.MIN_VALUE) //left subtree not balanced\n\t\t\treturn Integer.MIN_VALUE;\n\t\tint rightH = checkHeight(root.ri... | [
"0.70995593",
"0.70922",
"0.68579704",
"0.68021286",
"0.67899114",
"0.6730185",
"0.67245555",
"0.67049927",
"0.66818273",
"0.6610974",
"0.65776616",
"0.6577211",
"0.6556271",
"0.65562654",
"0.6548483",
"0.65431505",
"0.65399647",
"0.6539095",
"0.65381056",
"0.6503218",
"0.646... | 0.617392 | 43 |
Method 2 of Question 2: [from bottom to up, if a node satisfy the requirement, then simply "disappear" it and consider it's parent] ^^^ Important: there is a super hard to think case in this implementation, which corresponds to tree2 and tree3, which we should consider to always return 1 when left == 1 || right == 1 | public boolean isBalanced2(TreeNode root) {
return checkBalance(root) != -1;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private IAVLNode findSuccessor(IAVLNode node) \r\n\t {\r\n\t\t if(node.getRight().getHeight() != -1) \r\n\t\t\t return minPointer(node.getRight());\r\n\t\t IAVLNode parent = node.getParent();\r\n\t\t while(parent.getHeight() != -1 && node == parent.getRight())\r\n\t\t {\r\n\t\t\t node = parent;\r\n\t... | [
"0.60396385",
"0.60282964",
"0.59549886",
"0.59470344",
"0.5929041",
"0.5881228",
"0.58704805",
"0.5831419",
"0.58075243",
"0.58030146",
"0.57874364",
"0.57837915",
"0.5773333",
"0.57644385",
"0.57363176",
"0.567833",
"0.56563234",
"0.5635917",
"0.56310904",
"0.56310904",
"0.... | 0.0 | -1 |
Question 3: Diameter of Binary Tree Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. Example: TREE = [1, 2, 3, 4, 5] Return 3, which is the len... | public int diameter(TreeNode root) {
if (root == null) {
return 0;
}
diameter(root.left);
diameter(root.right);
int leftH = maxDepth(root.left);
int rightH = maxDepth(root.right);
cacheD = Math.max(cacheD, leftH + rightH);
return cacheD;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int[] diameterOfBinaryTree(Node node) {\n\n if (node.left == null && node.right == null) {\n return new int[]{1, 1};\n }\n\n int[] left = {0, 0};\n int[] right = {0, 0};\n\n if (node.left != null)\n left = diameterOfBinaryTree(node.left);\n\n ... | [
"0.6939645",
"0.6825121",
"0.6787434",
"0.6785547",
"0.6697764",
"0.6617622",
"0.6600313",
"0.65899205",
"0.6559915",
"0.6532196",
"0.6423342",
"0.64022285",
"0.639164",
"0.63834673",
"0.6380965",
"0.63644403",
"0.6362598",
"0.6360202",
"0.635288",
"0.63322145",
"0.63317895",... | 0.7320134 | 0 |
BEGIN: Added by zhanghongxing at 20130109 for full preview | public static String initialVideoQuality(Context context, int currentCameraId) {
int backCameraId = CameraHolder.instance().getBackCameraId();
String defaultStr = null;
if (currentCameraId == backCameraId) {
// defaultStr = context.getString(R.string.pref_back_video_quality_default);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void func_104112_b() {\n \n }",
"@Override\r\n\tprotected void doF4() {\n\t\t\r\n\t}",
"public void mo38117a() {\n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void show4() {\n\t\t\n\t}",
"protected boolean func_70814_o() { return true;... | [
"0.5810648",
"0.5795296",
"0.57892185",
"0.57589626",
"0.57398736",
"0.56720537",
"0.5667089",
"0.5651319",
"0.5626834",
"0.5626373",
"0.5596035",
"0.55824715",
"0.5577117",
"0.55719155",
"0.55716455",
"0.55661833",
"0.55661833",
"0.55661833",
"0.55661833",
"0.55661833",
"0.5... | 0.0 | -1 |
END: Added by zhanghongxing at 20130109 BEGIN: Added by zhanghongxing at 20130410 | public String initialVideoQuality() {
int backCameraId = CameraHolder.instance().getBackCameraId();
String defaultStr = null;
if (mCameraId == backCameraId) {
// defaultStr = mContext.getString(R.string.pref_back_video_quality_default);
defaultStr = SystemProperties.get(BA... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void func_104112_b() {\n \n }",
"private void kk12() {\n\n\t}",
"private static void cajas() {\n\t\t\n\t}",
"public void mo38117a() {\n }",
"private void m50366E() {\n }",
"public void method_4270() {}",
"public void mo4359a() {\n }",
"public final voi... | [
"0.60856426",
"0.6040467",
"0.5917225",
"0.5910467",
"0.5860383",
"0.5854304",
"0.5828831",
"0.5789919",
"0.57702047",
"0.5723163",
"0.56806046",
"0.56771356",
"0.56692713",
"0.56692713",
"0.56692713",
"0.56692713",
"0.56692713",
"0.56692713",
"0.56692713",
"0.56631166",
"0.5... | 0.0 | -1 |
END: Added by zhanghongxing at 20130410 | public static void initialCameraPictureSize(
Context context, Parameters parameters, int currentCameraId) {
// When launching the camera app first time, we will set the picture
// size to the first one in the list defined in "arrays.xml" and is also
// supported by the driver.
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static void cajas() {\n\t\t\n\t}",
"@Override\n public void func_104112_b() {\n \n }",
"private void kk12() {\n\n\t}",
"private void strin() {\n\n\t}",
"public void mo38117a() {\n }",
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"protected boolean func_70814_o(... | [
"0.6020223",
"0.59031326",
"0.58782667",
"0.5822086",
"0.5766079",
"0.57604635",
"0.5733331",
"0.57191753",
"0.5669558",
"0.56587505",
"0.56453997",
"0.56349295",
"0.56270885",
"0.56269544",
"0.56269544",
"0.5623402",
"0.5601934",
"0.5601235",
"0.5596461",
"0.55774516",
"0.55... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.