docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1ObjectIdentifier . getInstance ASN1TaggedObject . getObject ASN1OctetString . getOctets ASN1ObjectIdentifier . <unk> |
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1ObjectIdentifier . instance ASN1ObjectIdentifier . getInstance ASN1OctetString . getOctets ASN1TaggedObject . getObject ASN1OctetString . getOctets ASN1ObjectIdentifier . <unk> |
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1OctetString . getInstance ASN1ObjectIdentifier . <init> ASN1OctetString . getInstance ASN1ObjectIdentifier . <init> |
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1OctetString . getInstance ASN1ObjectIdentifier . <init> |
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1OctetString . getInstance ASN1OctetString . getOctets |
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1OctetString . getOctets ASN1ObjectIdentifier . <init> ASN1TaggedObject . getObject ASN1ObjectIdentifier . <init> |
return an object identifier from a tagged object | ASN1TaggedObject . getObject ASN1OctetString . getOctets ASN1ObjectIdentifier . <init> |
return an ASN1 sequence from a tagged object | ASN1TaggedObject . getObject ASN1Sequence . cast ASN1Sequence . instance ASN1Sequence . cast |
return an ASN1 sequence from a tagged object | ASN1TaggedObject . getObject ASN1Sequence . cast ASN1TaggedObject . <unk> ASN1TaggedObject . getObject ASN1Sequence . cast ASN1TaggedObject . getClass |
return an ASN1 sequence from a tagged object | ASN1TaggedObject . getObject ASN1Sequence . getInstance ASN1TaggedObject . <unk> ASN1Sequence . instance ASN1Sequence . cast ASN1TaggedObject . getClass |
return an ASN1 sequence from a tagged object | ASN1TaggedObject . getObject ASN1Sequence . getInstance ASN1TaggedObject . <unk> ASN1TaggedObject . getObject ASN1Sequence . cast ASN1TaggedObject . getClass |
this method is part of the get instance pattern that is used with tagged objects | ASN1TaggedObject . instance ASN1TaggedObject . cast ASN1TaggedObject . getTagNo Book . getInstance ASN1TaggedObject . getTagNo Object . getClass |
return an evidence object from the given object | ASN1TaggedObject . instance ASN1TaggedObject . getInstance |
add new element with given value to the tree if there is no other element with the same value in that tree | AVLTree . <init> AVLTree . <unk> AVLTree . <init> AVLTree . <unk> AVLTree . <unk> AVLTree . balance |
add new element with given value to the tree if there is no other element with the same value in that tree | AVLTree . <init> AVLTree . <unk> AVLTree . <init> AVLTree . <unk> AVLTree . balance |
rearrange collection into <unk> order | AVLTree . <init> AVLTree . addElement AVLTree . elements Enumeration . hasMoreElements Enumeration . nextElement |
the tree root | AVLTree . <init> AVLTree . insert AVLTree . <unk> AVLTree . remove AVLTree . insert AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
recursive add insert method | AVLTree . <init> Comparable . cast Comparable . compareTo AVLTree . <unk> |
implement left rotation | AVLTree . <unk> AVLTree . <unk> AVLTree . <init> AVLTree . <unk> AVLTree . <unk> AVLTree . <init> AVLTree . <unk> AVLTree . <unk> |
implement left rotation | AVLTree . <unk> AVLTree . <unk> AVLTree . <init> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <init> AVLTree . <unk> AVLTree . <unk> |
remove a node from the tree | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> Math . max |
balance the tree | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . balance |
remove a mapping with key key from this tree | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> Math . max |
recursively writes to the vector left subtree elements , root value and then right subtree elements | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> Vector . addElement AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
<unk> <unk> , <unk> <unk> <unk> <unk> | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
check all of the avl tree invariants | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
insert a node into a tree | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
insert new node | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
insert new tree | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
rebalance the avl tree | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . height AVLTree . rotateRight AVLTree . rotateLeft AVLTree . <unk> AVLTree . rebalance |
recursively writes to the vector left subtree elements , root value and then right subtree elements | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> Vector . addElement AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
index of the parent node for the current index in the inner array | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
rotate binary tree node with left child | AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
sub tree height | AVLTree . <unk> AVLTree . <unk> Array . getElement Array . getSize AVLTree . height Math . max |
insert into a subtree | AVLTree . <unk> AVLTree . <unk> Comparable . compareTo AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> Comparable . compareTo AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
<unk> <unk> <unk> <unk> la <unk> <unk> ds | AVLTree . <unk> AVLTree . <unk> |
<unk> <unk> <unk> una <unk> <unk> , <unk> <unk> <unk> <unk> | AVLTree . <unk> AVLTree . <unk> |
double rotates a node with its left child | AVLTree . <unk> AVLTree . <unk> |
double rotates a node with its right child | AVLTree . <unk> AVLTree . <unk> |
find a tree | AVLTree . <unk> AVLTree . <unk> |
find an item in the tree | AVLTree . <unk> AVLTree . <unk> |
fix a case three <unk> | AVLTree . <unk> AVLTree . <unk> |
fix a case two <unk> | AVLTree . <unk> AVLTree . <unk> |
give an avl node current , performs a case two double rotation | AVLTree . <unk> AVLTree . <unk> |
perform left right rotation around the given root and the roots left child | AVLTree . <unk> AVLTree . <unk> |
perform right left rotation around the given root and the roots right child | AVLTree . <unk> AVLTree . <unk> |
the left right rotation of a tree node | AVLTree . <unk> AVLTree . <unk> |
the right left rotation of a tree node | AVLTree . <unk> AVLTree . <unk> |
<unk> e <unk> <unk> con <unk> <unk> <unk> <unk> | AVLTree . <unk> AVLTree . balance |
ensure that this binary search tree object does not contain a specified element | AVLTree . <unk> AVLTree . deleteEntry |
find the smallest item in the tree | AVLTree . <unk> AVLTree . elementAt |
core functions | AVLTree . <unk> AVLTree . getHeight AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . getHeight AVLTree . <unk> AVLTree . <unk> AVLTree . getHeight Math . max |
delete an element from the tree | AVLTree . <unk> AVLTree . getLeftNode AVLTree . getParentNode AVLTree . <unk> AVLTree . getElement |
remove the specified node from the <unk> , returning an appropriate replacement node | AVLTree . <unk> AVLTree . height AVLTree . <unk> AVLTree . <unk> Math . max AVLTree . height |
check the balance for each node <unk> and call required methods for balancing the tree until the root is reached | AVLTree . <unk> AVLTree . height AVLTree . rotateRight AVLTree . <unk> AVLTree . height AVLTree . rotateLeft AVLTree . <unk> AVLTree . <unk> |
check the balance for each node recursively and call required methods for balancing the <unk> | AVLTree . <unk> AVLTree . height AVLTree . rotateRight AVLTree . <unk> AVLTree . height AVLTree . rotateLeft AVLTree . <unk> AVLTree . <unk> |
check the balance for each tree | AVLTree . <unk> AVLTree . height AVLTree . rotateRight AVLTree . <unk> AVLTree . height AVLTree . rotateLeft AVLTree . <unk> AVLTree . <unk> |
remove the desired avl tree node from the avl tree | AVLTree . <unk> AVLTree . remove |
task finds the value to copy up to the target and then removes the copied value | AVLTree . <unk> AVLTree . removeEntry AVLTree . rebalance AVLTree . <unk> AVLTree . removeEntry AVLTree . rebalance |
check the balance for each node <unk> and call required methods for balancing the tree until the root is reached | AVLTree . <unk> AVLTree . rotateRight AVLTree . <unk> AVLTree . rotateLeft AVLTree . <unk> AVLTree . <unk> |
rebalance method called by insert and remove | AVLTree . <unk> AVLTree . setHeight AVLTree . isRoot AVLTree . parent AVLTree . setHeight AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . left AVLTree . setHeight AVLTree . right AVLTree . setHeight |
rebalance method called by insert and remove | AVLTree . <unk> AVLTree . setHeight AVLTree . isRoot AVLTree . parent AVLTree . setHeight AVLTree . <unk> AVLTree . <unk> AVLTree . left AVLTree . setHeight AVLTree . right AVLTree . setHeight |
calculate <unk> <unk> | AVLTree . <unk> ArrayList . add AVLTree . <unk> |
traverse the tree in in order | AVLTree . <unk> ArrayList . add AVLTree . <unk> |
return a primitive array of the elements in the current tree | AVLTree . <unk> ArrayList . toArray |
return an array representation of the avl tree | AVLTree . <unk> ArrayList . toArray |
helper functions | AVLTree . <unk> ArrayList < Integer > . add AVLTree . <unk> |
restore the avl properties , if necessary , by rotations and balance factor adjustments between the element actually deleted and a specified ancestor of the avl entry object actually deleted | AVLTree . <unk> Comparable . cast Comparable . compareTo AVLTree . rotateRight AVLTree . rotateLeft |
return the difference between left subtree depth and right subtree depth | AVLTree . <unk> Math . abs |
recursive version of depth | AVLTree . <unk> Math . max AVLTree . <unk> Math . max |
the left rotation of a tree node | AVLTree . <unk> Math . max AVLTree . <unk> Math . max |
the right rotation of a tree node | AVLTree . <unk> Math . max AVLTree . <unk> Math . max |
internal recursive method for removing the minimum item throws no such element exception if the item does not exist | AVLTree . <unk> Math . max AVLTree . height Math . abs AVLTree . height AVLTree . <unk> AVLTree . <unk> AVLTree . height Math . max AVLTree . height Math . abs AVLTree . height AVLTree . <unk> AVLTree . <unk> |
internal recursive method for removing the maximum item throws no such element exception if the item does not exist | AVLTree . <unk> Math . max Math . abs AVLTree . <unk> AVLTree . <unk> AVLTree . height Math . max AVLTree . height AVLTree . <unk> AVLTree . <unk> |
after inserting a node , it is necessary to check each of the nodes ancestors for consistency with the rules of avl | AVLTree . <unk> Node . getLeftChild AVLTree . rotateLeft AVLTree . rotateRight Node . getRightChild AVLTree . <unk> AVLTree . rotateRight Node . getParent AVLTree . rotateLeft |
remove and returns an entry from the dictionary | AVLTree . <unk> Position . element AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . rebalance |
create and returns a string with a post order traversal of this tree | AVLTree . <unk> String . trim |
create and returns a string with a pre order traversal of this tree | AVLTree . <unk> String . trim |
create and returns a string with an in order traversal of this tree | AVLTree . <unk> String . trim |
add a new node to the tree | AVLTree . add AVLTree . rotate |
delete a node with a given value from the avl tree | AVLTree . delete AVLTree . balance |
dont use this its broken | AVLTree . depth AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> AVLTree . depth AVLTree . <unk> AVLTree . depth AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
perform a rotation on the provided node based on the height difference of the left and the right children | AVLTree . difference AVLTree . <unk> AVLTree . difference AVLTree . <unk> AVLTree . <unk> AVLTree . difference AVLTree . <unk> AVLTree . <unk> AVLTree . <unk> |
delete the key from the tree | AVLTree . find AVLTree . <unk> |
remove a node from a avl <unk> , while balancing will be done if necessary | AVLTree . find AVLTree . <unk> |
find an item in the tree | AVLTree . find AVLTree . elementAt |
login of given user to the system | AVLTree . find LinkedList . getFirst |
decrease in delta the priority of <unk> | AVLTree . find TreeNode . getValue ArrayList < Pair > . get ArrayList < Pair > . size ArrayList < Pair > . get AVLTree . find TreeNode . setValue |
increase in delta the priority of <unk> | AVLTree . find TreeNode . getValue ArrayList < Pair > . size ArrayList < Pair > . get TreeNode . setValue |
left rotation | AVLTree . getData AVLTree . getRight AVLTree . setData AVLTree . getRight AVLTree . setRight AVLTree . setData AVLTree . getLeft AVLTree . setRight AVLTree . getLeft AVLTree . setLeft AVLTree . setLeft AVLTree . height AVLTree . height |
left rotation | AVLTree . getData AVLTree . getRight AVLTree . setData AVLTree . getRight AVLTree . setRight AVLTree . setData AVLTree . getLeft AVLTree . setRight AVLTree . setLeft AVLTree . setLeft AVLTree . height AVLTree . height |
compute the balance of the tree | AVLTree . getLeft AVLTree . getRight AVLTree . getLeft |
compute the balance of the tree | AVLTree . getRight AVLTree . getLeft AVLTree . getRight |
give an avl node checks the structure property and performs rotations if necessary to keep the tree balanced | AVLTree . height AVLTree . <unk> AVLTree . <unk> AVLTree . height AVLTree . <unk> AVLTree . <unk> Math . max |
calculate the height of a tree | AVLTree . height AVLTree . <unk> |
return whether a node has balance factor between 1 and 1 | AVLTree . height AVLTree . left AVLTree . height |
rotate binary tree node with left child | AVLTree . height AVLTree . max AVLTree . height AVLTree . max |
<unk> una <unk> <unk> , che <unk> <unk> avl a <unk> di una <unk> <unk> a <unk> | AVLTree . height AVLTree . max |
rotate binary tree node with right child | AVLTree . height AVLTree . max |
return whether a node has balance factor between 1 and 1 | AVLTree . height AVLTree . right AVLTree . height |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.