docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
read all field annotations from one type | ArrayList . <init> Class . getDeclaredFields Field . isAnnotationPresent Field . getAnnotation List . add Field . setAccessible |
todo document and test | ArrayList . <init> Class . getDeclaredMethods Method . getAnnotation List . add Class . getSuperclass Collections . unmodifiableList |
find all the matching index items that match the given type and instantiate them | ArrayList . <init> Class . instance Class . cast Field . cast Field . getType Method . instance Method . getReturnType AssertionError . <init> Class . cast List . add |
find all the matching index items that match the given type and instantiate them | ArrayList . <init> Class . instance Class . cast Field . instance Field . getType Method . instance Method . cast Method . getReturnType AssertionError . <init> Class . isAssignableFrom List . add |
find all the matching index items that match the given type and instantiate them | ArrayList . <init> Class . instance Class . cast Field . instance Field . getType Method . instance Method . getReturnType AssertionError . <init> Class . cast List . add |
return a list of children , that contain values from the given class | ArrayList . <init> Class . isAssignableFrom List . add |
to get all final nodes | ArrayList . <init> Collection . add Collection . addAll |
return all <unk> of this class | ArrayList . <init> Collection . add Factory . Constructor Collection . add |
get all the field references for a given class including the superclasses | ArrayList . <init> Collection . add Factory . Field Collection . add |
add a branch in this node | ArrayList . <init> Collection . add |
add the wrapper around all input collection elements | ArrayList . <init> Collection . add |
obtain the processors to be applied to metadata once merging is complete | ArrayList . <init> Collection . add |
retrieve the set of active grammar implementations | ArrayList . <init> Collection . add |
return a extractor group with a set of extractor able <unk> the provided mime type | ArrayList . <init> Collection . add |
return an enumeration of the constant attribute names and values | ArrayList . <init> Collection . add |
get a list of all property sets that extend the given property set | ArrayList . <init> Collection . addAll |
may not be called while creating the model | ArrayList . <init> Collection . addAll |
lazy initializes variable items | ArrayList . <init> Collection . iterator Iterator . next Pair . instance Pair . cast Collection . add Collections . unmodifiableCollection |
set the positions of the <unk> according to the given possible positions in ascending order | ArrayList . <init> Collection . size ArrayList . <init> ArrayList . addAll ArrayList . size ArrayList . add |
create new result object with supplied instances parameter | ArrayList . <init> Collection < Object > . iterator Iterator . hasNext Iterator . next Collection . add |
add the first data providers to the validator | ArrayList . <init> Collections . addAll |
create an invocation can be a statement or an expression | ArrayList . <init> Collections . addAll |
get a range between offset and offset + limit of data from this history , that was caused by an entity with the given name | ArrayList . <init> Collections . copy List . add |
get a range between offset and offset + limit of data from this history | ArrayList . <init> Collections . copy List . add |
compute the inverse of the composition of the <unk> | ArrayList . <init> Collections . reverse List . add |
list of <unk> most suitable for compaction | ArrayList . <init> Collections . reverse List . iterator Iterator . next Iterator . remove List . add Iterator . remove List . add List . size List . addAll List . clear List . size Math . min List . addAll List . clear List . iterator Iterator . hasNext Iterator . next Iterator . remove List . add Collections . reverse |
trim out tokens that are subsets of each other | ArrayList . <init> Collections . sort ListIterator . hasNext ListIterator . next ListIterator . previous |
this method acts as a composite that runs all post processors that access the bean before its registration sequentially and according to their order | ArrayList . <init> Collections . sort |
create a new buffer with given limits | ArrayList . <init> Collections . synchronizedList AtomicLong . <init> |
method description | ArrayList . <init> Collections . unmodifiableCollection ArrayList . <init> Collection . add Collections . unmodifiableCollection |
follow the link | ArrayList . <init> Collections . unmodifiableList |
notify the change listeners that items have been added | ArrayList . <init> Collections . unmodifiableList |
notify the change listeners that items have been removed | ArrayList . <init> Collections . unmodifiableList |
notify the change listeners that items have been replaced | ArrayList . <init> Collections . unmodifiableList |
return an unmodifiable list of the series | ArrayList . <init> Collections . unmodifiableList |
return association with features for this concept | ArrayList . <init> Collections . unmodifiableList |
notify the change listeners that items have been added | ArrayList . <init> Collections . unmodifiableSet |
notify the change listeners that items have been removed | ArrayList . <init> Collections . unmodifiableSet |
return a list of the nodes of the graph sorted <unk> | ArrayList . <init> Comparator . <init> Comparator . compare PriorityQueue . <init> LinkedList . <init> Map . values Queue . add List . add Queue . isEmpty Queue . poll List . add Queue . add List . remove HashSet < Object > . <init> Set < Object > . add |
load the descriptors in this case means filtering the descriptor from the master extension list | ArrayList . <init> Descriptor . <unk> List . add |
load the descriptors in this case means filtering the descriptor from the master extension list | ArrayList . <init> Descriptor . getClass Types . <unk> Descriptor . getClass Class . cast Types . erasure List . add |
load the descriptors in this case means filtering the descriptor from the master extension list | ArrayList . <init> Descriptor . getClass Types . <unk> ParameterizedType . instance Descriptor . getClass Class . cast Types . erasure List . add |
load the descriptors in this case means filtering the descriptor from the master extension list | ArrayList . <init> Descriptor . getClass Types . <unk> ParameterizedType . instance Types . <unk> Class . cast Types . erasure List . add |
return a list of categorical variables that can be represented as dimensions | ArrayList . <init> Entity . <unk> |
s polynomials of non <unk> polynomials | ArrayList . <init> Entry . getKey Entry . getValue List . isEmpty List . add |
follow the link | ArrayList . <init> Entry . getValue Entry . getKey Entry . getValue List . add Collections . unmodifiableList |
use a factory to produce one work target instance per core onthe machine and schedules them with the work scheduler provided , andreturns an work future aggregate that allows you to track their <unk> | ArrayList . <init> Factory . make List . add |
return all <unk> of this class | ArrayList . <init> Factory . Method Collection . add Factory . Constructor Collection . add |
collect all preferences that are defined in the derived class | ArrayList . <init> Field . getType Field . get List . add |
create list of inputs to this application | ArrayList . <init> Field . getType Field . get List . add |
create list of inputs to this plug in | ArrayList . <init> Field . getType List . add |
parse the given text code and produce an array of search term objects that describe text to match as well <unk> about the way it should be used | ArrayList . <init> Field > . <init> Field > . hasNext Field > . next Field . getName Field > . put StringBuffer . <init> String . charAt Character . isWhitespace StringBuffer . length List . add StringBuffer . toString StringBuffer . <init> Field > . get StringBuffer . <init> StringBuffer . append List . add List . toArray |
parse the given text and produce an array of search term objects that describe text to match as well <unk> about the way it should be used | ArrayList . <init> Field > . <init> Field > . iterator Field > . next Field > . put StringBuffer . <init> String . charAt Character . isWhitespace StringBuffer . length StringBuffer . toString List . add StringBuffer . <init> Field > . get StringBuffer . <init> StringBuffer . append Character . isWhitespace StringBuffer . append StringBuffer . toString List . add List . toArray |
parse the given text and produce an array of search term objects that describe text to match as well <unk> about the way it should be used | ArrayList . <init> Field > . <init> Field > . iterator Field > . next Field > . put StringBuffer . <init> String . charAt Character . isWhitespace StringBuffer . toString List . add StringBuffer . <init> StringBuffer . toString Field > . get StringBuffer . <init> StringBuffer . append Character . isWhitespace StringBuffer . append StringBuffer . length List . add StringBuffer . toString List . add List . toArray |
search in folders on the level of the parent folder of uri | ArrayList . <init> File . getParentFile File . listFiles File . isDirectory File . equals File . toURI List . add List . size List . get |
search the closest n objects to position pos in collection objects using transformation | ArrayList . <init> Function < Point > . apply Point . distance List . add Collections . sort ArrayList . <init> List . size Math . min List . add |
search the closest n objects to position pos in collection objects using transformation | ArrayList . <init> Function < Point > . apply Point . distance List . add Collections . sort ArrayList . <init> List . subList List . size List . subList List . add |
return sorted copy of input | ArrayList . <init> Generation . sort Generation . <unk> |
convert a population of <unk> into evaluated <unk> | ArrayList . <init> GeneticAlgorithm . <unk> ArrayList . add |
this method finds the smallest cost path for the given <unk> to traverse from the start node to the end node on the given map | ArrayList . <init> HashMap . <init> ArrayList . add Collections . min ArrayList . remove ArrayList . add HashMap . get HashMap . put ArrayList . remove ArrayList . contains Math . max ArrayList . add LinkedList . <init> LinkedList . addFirst |
this method performs a non recursive breadth first search for a node equal to target | ArrayList . <init> HashMap . <init> List . add List . remove Map . put Map . get List . add |
get the block distribution with data values inside a region | ArrayList . <init> HashMap . <init> Region . <unk> Region . <unk> Vector . getBlockX Vector . getBlockY Vector . getBlockZ Vector . getBlockX Vector . getBlockY Vector . getBlockZ Vector . <init> Map . containsKey Map . put List . add Map . containsKey Map . put Collections . sort |
get the block distribution with data values inside a region | ArrayList . <init> HashMap . <init> Region . <unk> Region . <unk> Vector . getBlockX Vector . getBlockY Vector . getBlockZ Vector . getBlockX Vector . getBlockY Vector . getBlockZ Vector . <init> Map . containsKey Map . put List . add Map . put Collections . sort |
get the block distribution with data values inside a region | ArrayList . <init> HashMap . <init> Region . <unk> Region . <unk> Vector . getBlockX Vector . getBlockY Vector . getBlockZ Vector . getBlockX Vector . getBlockY Vector . getBlockZ Vector . <init> Map . put List . add Map . containsKey Map . put Collections . sort |
create an array heap | ArrayList . <init> HashMap . <init> |
return a list of parameter values for a specified run of the design | ArrayList . <init> HashMap . get List . add |
get the list of file hash map entry pointers for the values , sorted in ascending file position order | ArrayList . <init> HashMap . values List . addAll Collections . sort |
give a list of results , this method produces an object <unk> the provided original results with data needed to <unk> the results with respect to resource names , their types and <unk> | ArrayList . <init> HashMap < Integer , List > . <init> Map < Integer , List > . get ArrayList . <init> Map < Integer , List > . put List . add Map < Integer , List > . keySet Query . setParameter Query . getResultList List < Object [] > . cast Resource > . <init> Integer . cast String . cast Integer . cast String . cast Boolean . cast Resource . <init> Integer . cast String . cast Integer . cast String . cast Boolean . cast Resource . <init> Resource > . add Resource . clone ArrayList . <init> List . add List . iterator ArrayList . <init> Iterator . next List . add Iterator . remove List . add ArrayList . <init> List . add |
give a list of results , this method produces an object <unk> the provided original results with data needed to <unk> the results with respect to resource names , their types and <unk> | ArrayList . <init> HashMap < Integer , List > . <init> Map < Integer , List > . get ArrayList . <init> Map < Integer , List > . put List . add Query . setParameter Query . getResultList List < Object [] > . cast Resource > . <init> Integer . cast String . cast Integer . cast String . cast Boolean . cast Resource . <init> Integer . cast String . cast Integer . cast String . cast Boolean . cast Resource . <init> Resource > . add Resource . clone ArrayList . <init> List . add List . size List . iterator ArrayList . <init> Iterator . next List . add Iterator . remove List . add List . size ArrayList . <init> List . add |
generate the code for the parser , and writes it to the specified print stream | ArrayList . <init> HashMap < Integer > . <init> ArrayList . <init> HashMap < Integer > . <init> LinkedList . <init> Deque . add Deque . isEmpty Deque . poll List . add List . size Map < Integer > . put Map . values Deque . add Map < Integer > . containsKey List . add Map < Integer > . put Map . values List . add List . size Map < Integer > . put List . size List . get PrintStream . println Map < Integer > . get PrintStream . println List . get PrintStream . println List . get Map . isEmpty PrintStream . println Map < Integer > . get Map . get PrintStream . println Map < Integer > . get Map . containsKey Map . get PrintStream . println Map < Integer > . get PrintStream . println HashSet . <init> Map . entrySet Entry . getKey PrintStream . println Map < Integer > . get PrintStream . println Set . addAll HashMap < Map < Integer , List > > . <init> Map . entrySet Entry . getValue Map < Map < Integer , List > > . get HashMap < Integer , List > . <init> Map < Map < Integer , List > > . put Map < Integer , List > . get LinkedList . <init> Map < Integer , List > . put Entry . getKey List . add Map < Map < Integer , List > > . entrySet Entry < Map < Integer , List > > . getValue PrintStream . print Entry < Integer , List > . getValue PrintStream . print PrintStream . println Entry < Integer , List > . getKey Entry < Map < Integer , List > > . getKey PrintStream . println Map . keySet Set . addAll Entry . getValue PrintStream . println Map < Integer > . get PrintStream . println Set . addAll PrintStream . println Map . size PrintStream . println Entry . getValue Map < Integer > . get PrintStream . println |
generate the code for the parser , and writes it to the specified print stream | ArrayList . <init> HashMap < Integer > . <init> ArrayList . <init> HashMap < Integer > . <init> LinkedList . <init> Deque . add Deque . poll Map < Integer > . containsKey List . add List . size Map < Integer > . put Deque . add List . add List . size Map < Integer > . put List . add Map < Integer > . put List . size List . get PrintStream . println Map < Integer > . get PrintStream . println List . size PrintStream . println List . get Map . isEmpty PrintStream . println Map . containsKey PrintStream . println Map . get Map < Integer > . get Map . containsKey Map . get PrintStream . println Map < Integer > . get Map . get PrintStream . println Map < Integer > . get PrintStream . println HashSet . <init> Map . entrySet PrintStream . println Entry . getValue Map < Integer > . get PrintStream . println Map . keySet Set . addAll Entry . getValue Entry . getKey PrintStream . println Map < Integer > . get PrintStream . println Set . addAll Map . entrySet Entry . getValue PrintStream . println Map < Integer > . get PrintStream . println Set . addAll PrintStream . println Map . entrySet Entry . getKey Map < Integer > . get PrintStream . println |
generate the code for the parser , and writes it to the specified print stream | ArrayList . <init> HashMap < Integer > . <init> ArrayList . <init> HashMap < Integer > . <init> LinkedList . <init> Deque . add Deque . poll Map < Integer > . containsKey List . add Map < Integer > . put Deque . add List . add Map < Integer > . put List . add List . size Map < Integer > . put List . size List . get PrintStream . println Map < Integer > . get PrintStream . println List . size PrintStream . println List . size List . get Map . isEmpty PrintStream . println Map < Integer > . get Map . get PrintStream . println Map < Integer > . get Map . get PrintStream . println Map < Integer > . get PrintStream . println HashSet . <init> Map . entrySet Entry . getKey PrintStream . println Map < Integer > . get PrintStream . println Set . addAll HashMap < Map < Integer , List > > . <init> Map . entrySet Entry . getKey Entry . getValue Map < Map < Integer , List > > . get HashMap < Integer , List > . <init> Map < Map < Integer , List > > . put Map < Integer , List > . get LinkedList . <init> Map < Integer , List > . put Entry . getKey List . add Entry < Map < Integer , List > > . getValue PrintStream . print PrintStream . println Entry < Integer , List > . getKey Map < Integer > . get PrintStream . println Set . addAll Map . entrySet Entry . getValue PrintStream . println Set . addAll Set . toArray PrintStream . println Map . entrySet Entry . getKey Map < Integer > . get PrintStream . println |
this method initializes all <unk> required to run the algorithm | ArrayList . <init> HashMap < Integer > . <init> Map < Integer > . put List . add |
list all types known to the system | ArrayList . <init> HashMap < String > . entrySet ArrayList . add |
compute a pre <unk> of all non fixed tiles by propagating the pairwise models | ArrayList . <init> HashSet . iterator ArrayList . add Iterator . hasNext ArrayList . add ListIterator . hasNext ListIterator . next ListIterator . hasNext ListIterator . next ListIterator . remove ListIterator . next ListIterator . add ListIterator . previous |
compute a pre <unk> of all non fixed tiles by propagating the pairwise models | ArrayList . <init> HashSet . size HashSet . iterator ArrayList . add Iterator . next ArrayList . add ArrayList . listIterator ArrayList . size ListIterator . next ListIterator . hasNext ListIterator . next ListIterator . remove ListIterator . hasNext ListIterator . next ListIterator . add ListIterator . previous |
perform a proximity radius fetch on the given query | ArrayList . <init> HashSet < String > . <init> ArrayList < String > . <init> List < String > . add Arrays . asList HashSet < String > . <init> Set < String > . removeAll ArrayList < String > . <init> Set < String > . addAll ArrayList . <init> List . add Collections . sort Math . min List . subList List . add Collections . sort List . subList List . size List < String > . size Math . max String . substring ArrayList < String > . <init> List < String > . clear String . length String . substring List < String > . add List < < Double > > . get List < String > . add List < String > . size ArrayList < String > . <init> List < String > . add List < String > . addAll List . size ArrayList . <init> List . subList Math . min List . add |
perform a proximity radius fetch on the given query | ArrayList . <init> HashSet < String > . <init> ArrayList < String > . <init> List < String > . add Arrays . asList HashSet < String > . <init> Set < String > . removeAll ArrayList < String > . <init> String . trim Query . declareParameters List < Object > . isEmpty List . cast ArrayList < Object > . <init> List < Object > . add List < Object > . toArray Query . <unk> List . cast Set < String > . addAll ArrayList . <init> List . add Collections . sort List . subList List . size List . contains List . add Collections . sort List . size List . subList List < String > . size Math . max String . substring ArrayList < String > . <init> List < String > . clear String . length String . substring List < String > . add List < String > . size List < < Double > > . get List < String > . get List < String > . add ArrayList < String > . <init> List < String > . add List < String > . addAll List . size List . get List . subList List . size List . remove |
perform a proximity radius fetch on the given query | ArrayList . <init> HashSet < String > . <init> ArrayList < String > . <init> List < String > . add Arrays . asList List < String > . isEmpty HashSet < String > . <init> Set < String > . removeAll ArrayList < String > . <init> Set < String > . addAll ArrayList . <init> List . add Collections . sort List . subList List . size List . contains List . add Collections . sort Math . min List . subList List < String > . size String . substring String . length String . substring ArrayList < String > . <init> List < String > . clear String . length String . substring List < String > . contains List < String > . add List < String > . size List < String > . add List < String > . get List < String > . add List < < Double > > . get ArrayList < String > . <init> List < String > . add List < String > . addAll List . get ArrayList . <init> List . subList Math . min List . add |
perform a proximity radius fetch on the given query | ArrayList . <init> HashSet < String > . <init> ArrayList < String > . <init> List < String > . add Arrays . asList List < String > . isEmpty List < < Double > > . get HashSet < String > . <init> Set < String > . removeAll ArrayList < String > . <init> Set < String > . addAll ArrayList . <init> List . add Collections . sort Math . min List . subList List . add Collections . sort List . size Math . min List . subList String . length String . substring String . length ArrayList < String > . <init> List < String > . clear String . length String . substring List < String > . contains List < String > . add List < String > . size List < String > . get List < String > . add Arrays . asList ArrayList < String > . <init> List < String > . add List < String > . addAll List . size List . get ArrayList . <init> Math . min List . add |
perform a proximity radius fetch on the given query | ArrayList . <init> HashSet < String > . <init> ArrayList < String > . <init> List < String > . add Arrays . asList List < String > . isEmpty List < < Double > > . get HashSet < String > . <init> Set < String > . removeAll ArrayList < String > . <init> String . trim Query . declareParameters Query . execute List . cast ArrayList < Object > . <init> List < Object > . add Query . <unk> List . cast Set < String > . addAll ArrayList . <init> List . add Collections . sort List . size Math . min List . subList List . add Collections . sort List . subList List . size List . subList Math . max String . substring ArrayList < String > . <init> List < String > . clear String . length String . substring List < String > . add List < String > . size List < < Double > > . get List < String > . get List < String > . add List < < Double > > . get Arrays . asList List < < Double > > . get ArrayList < String > . <init> List < String > . add List < String > . addAll List . size ArrayList . <init> List . size Math . min List . add |
parse annotations | ArrayList . <init> HashSet < String > . <init> Object . getClass Field . getAnnotation Option . name Field . getName Field . getType Map < Class , Class > > . get Option . name Class > . newInstance Set < String > . contains String . length Set < String > . contains List . add Set < String > . add Field . getAnnotation Field . getType |
return a list of signals that are selected in an edit window | ArrayList . <init> Highlighter . <unk> List . size List . get Iterator . next List . add Highlighter . <unk> List . addAll Collections . sort |
all the cells accessible from the origin cell are returned without any ordering | ArrayList . <init> Iterator . hasNext Iterator . next Collection . add |
create iterator which walks the route , and only returns nodes which matches the given set of criteria | ArrayList . <init> Iterator . hasNext Iterator . next List . add |
get all the <unk> related to this time series | ArrayList . <init> Iterator < Entry < Thread , Map > > . hasNext Iterator < Entry < Thread , Map > > . next Entry < Thread , Map > . getKey Entry < Thread , Map > . getValue Map . get Map . remove List . add Iterator < Entry < Thread , Map > > . remove |
return all instances registered to this particular name for this discovery type | ArrayList . <init> Iterator < Service > . hasNext Iterator < Service > . next Service . getMetadata List < String > . contains Map < String , String > . get List . add |
look up extension type lists by asking the container for types with any javax | ArrayList . <init> Key . get List . add List . isEmpty Class . getName List . size |
return an iterator of bean property assoc one that are not embedded | ArrayList . <init> LinkedHashMap < String > . values ArrayList . add |
return bean property assoc many for this descriptor | ArrayList . <init> LinkedHashMap < String > . values ArrayList . add |
warn <unk> for <unk> : work in progress | ArrayList . <init> LinkedList . <init> ArrayList . add LinkedList . add ArrayList < < Data > > . remove |
return all nodes of the model as a list | ArrayList . <init> LinkedList . <init> List . add List . remove List . add Iterator . hasNext Iterator . next List . add |
get all tiles overlapping an area | ArrayList . <init> LinkedList . <init> Queue . add Queue . poll List . add Double . <init> Double . equals List . add Queue . add |
perform breadth first traversal of the tree | ArrayList . <init> LinkedList . <init> Queue . add Queue . isEmpty Queue . poll List . add Queue . add |
get the default geometry of an instance | ArrayList . <init> LinkedList < Group > . <init> Queue < Group > . add List < QName > . size List < QName > . get LinkedList < Group > . <init> Group . getProperty Group . instance Group . cast Queue < Group > . add List < QName > . size Group . instance Collection . addAll Collection . isEmpty Queue < Group > . isEmpty Queue < Group > . poll Collection . isEmpty Collection . addAll Group . getPropertyNames Group . getProperty Group . instance Group . cast Queue < Group > . add Collection . addAll |
greatest common divisor | ArrayList . <init> List . add ArrayList . <init> List . add List . get |
least common multiple | ArrayList . <init> List . add ArrayList . <init> List . add List . size List . get |
minimal ordered groebner basis | ArrayList . <init> List . add ArrayList . <init> List . remove List . add ArrayList . <init> List . addAll Condition . <unk> List . add Collections . reverse List . size List . remove Condition . <unk> List . add |
minimal ordered groebner basis | ArrayList . <init> List . add ArrayList . <init> List . remove List . add ArrayList . <init> List . addAll Condition . <unk> List . add List . size List . remove Condition . <unk> List . add |
minimal ordered groebner basis | ArrayList . <init> List . add ArrayList . <init> List . size List . remove ArrayList . <init> List . addAll Condition . <unk> List . add Collections . reverse List . size List . remove Condition . <unk> List . add |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.