docstring stringlengths 3 2.38k | code stringlengths 9 99.4k |
|---|---|
create a new immutable type builder for a <unk> a given class | ArrayList . <init> Collections . emptyList |
database item constructor | ArrayList . <init> Collections . emptyList |
get the defined commands or an empty list | ArrayList . <init> Collections . emptyList |
get the defined script files or an empty list | ArrayList . <init> Collections . emptyList |
get the imports for the specified <unk> | ArrayList . <init> Collections . emptyList |
return a copy of the specified list | ArrayList . <init> Collections . emptyList |
return a list of the visible nodes that overlap the specified point in the same order <unk> be considered for event dispatching , topmost leaf first | ArrayList . <init> Collections . emptyList |
return the method plugins in the current method library | ArrayList . <init> Collections . emptyList |
set all data table items currently selected | ArrayList . <init> Collections . emptyList |
set the preferred video camera path , and notifies listeners of this change | ArrayList . <init> Collections . emptyList |
set the filter class | ArrayList . <init> Collections . emptyMap Builder . add |
return a result with all callbacks canceled | ArrayList . <init> Collections . emptyMap List . add |
return a list of resources files with file name and file extension contained in the directory | ArrayList . <init> Collections . emptySet Files . walkFileTree <unk> < Path > . <init> Path . getFileName Pattern . matcher List < String > . add |
use by count faces Set , Set , <unk> | ArrayList . <init> Collections . emptySet |
discover what serial ports are available | ArrayList . <init> Collections . list List . add |
set <unk> test suite | ArrayList . <init> Collections . list List . iterator Iterator . hasNext Iterator . next Collections . list List . addAll List . iterator Iterator . hasNext Iterator . next List . add Collections . shuffle Iterator . hasNext |
print all relations between combinations of s subject e predicate that give a match with an e object greater than flag <unk> | ArrayList . <init> Collections . list ObjectVector . getVector Vector . copy ObjectVector . getVector Vector . release Collections . list Vector . <unk> String . format ObjectVector . getObject String . cast List < String > . add List < String > . size String . format ObjectVector . getObject |
singleton that returns the resource loader for loading <unk> configuration | ArrayList . <init> Collections . list URL . openStream BufferedReader . <init> BufferedReader . readLine String . trim String . startsWith String . split Integer . parseInt Class . forName Class < URLStreamHandlerFactory > . cast Class < URLStreamHandlerFactory > . newInstance URLStreamHandlerFactory . createURLStreamH... |
implementation of the abstract method cell <unk> matrix cell | ArrayList . <init> Collections . max List < < Integer > > . add |
parse a raw data report file into a list of instance data | ArrayList . <init> Collections . min ArrayList . <init> List < Row > . add Cell . <unk> String . equals List . add |
join the elements of the provided array into a single string containing the provided list of elements | ArrayList . <init> Collections . replaceAll |
destroy the managed <unk> beans in the reverse order they were added | ArrayList . <init> Collections . reverse <unk> . cast <unk> . destroy List . clear |
destroy the joined <unk> beans in the reverse order they were added | ArrayList . <init> Collections . reverse <unk> . cast <unk> . destroy |
destroy the joined <unk> beans in the reverse order they were added | ArrayList . <init> Collections . reverse <unk> . instance <unk> . cast <unk> . destroy List . clear |
reverse the order of the elements | ArrayList . <init> Collections . reverse ArrayList . <init> |
navigate along the path given | ArrayList . <init> Collections . reverse ArrayList . indexOf ArrayList . size ArrayList . get Point . <init> Condition . <init> Time . waitFor |
compute start times for elements in front of the representative | ArrayList . <init> Collections . reverse ArrayList < Date > . <init> List < Date > . add Collections . reverse |
the selected rows of the last column with a non empty selection | ArrayList . <init> Collections . reverse Collections . emptyList |
sort the adapters items with the given comparator | ArrayList . <init> Collections . reverse Collections . sort |
return a list containing the image layer objects <unk> the canvas object , ordered by the rendering order used <unk> image renderer during rendering | ArrayList . <init> Collections . reverse Collections . unmodifiableList |
<unk> an ordering to be imposed on the map keys | ArrayList . <init> Collections . reverse Comparator . <init> List . indexOf Comparable . instance Comparable . cast Comparable . compareTo System . identityHashCode |
<unk> an ordering to be imposed on the map keys | ArrayList . <init> Collections . reverse Comparator . <init> List . indexOf Comparable . instance Comparable . compareTo System . identityHashCode |
either load or unload the layer , if any , for a set of modules | ArrayList . <init> Collections . reverse HashMap . <init> List . iterator Map . get String . cast String . lastIndexOf String . substring List . cast ArrayList . <init> Map . put Iterator . hasNext String . cast ClassLoader . getResource List . add Iterator . hasNext Entry . cast List . cast ErrorManager . notify |
reduce the bdd tree deleting redundant nodes | ArrayList . <init> Collections . reverse HashMap . <init> Vertex . isLeaf Boolean . toString Integer . toString ArrayList . <init> ArrayList < Vertex > . add HashMap < String , ArrayList < Vertex > > . put HashMap < String , ArrayList < Vertex > > . keySet HashMap < String , ArrayList < Vertex > > . get ArrayList < Ver... |
either load or unload the layer , if any , for a set of modules | ArrayList . <init> Collections . reverse HashMap < Collection < URL > > . <init> LinkedHashSet < URL > . <init> Map < Collection < URL > > . put LinkedHashSet < URL > . <init> Map < Collection < URL > > . put Map < Collection < URL > > . get LinkedHashSet < URL > . <init> Map < Collection < URL > > . put Map < String >... |
either load or unload the layer , if any , for a set of modules | ArrayList . <init> Collections . reverse HashMap < List < URL > > . <init> ArrayList < URL > . <init> Map < List < URL > > . put ArrayList < URL > . <init> Map < List < URL > > . put Map < String > . get String . lastIndexOf String . substring Map < List < URL > > . get ArrayList < URL > . <init> Map < List < URL > > .... |
initialize the all <unk> nodes map variable | ArrayList . <init> Collections . reverse HashMap < String > . <init> HashMap < String , < String [] , String [] , String [] , String [] , String > > . keySet HashMap < String , < String [] , String [] , String [] , String [] , String > > . get HashMap < String > . put |
return all element handles related to available bindings | ArrayList . <init> Collections . reverse Iterator . hasNext Iterator . next ArrayList . contains ArrayList . add |
initialize the first group of setup passes | ArrayList . <init> Collections . reverse LinkedList . addFirst |
return all element handles related to available bindings | ArrayList . <init> Collections . reverse List . iterator Iterator . hasNext ArrayList . contains ArrayList . add |
return all element handles related to available bindings | ArrayList . <init> Collections . reverse List . iterator Iterator . next ArrayList . contains ArrayList . add |
return an iterator over the dependency manager <unk> the declared references in reversed declaration order | ArrayList . <init> Collections . reverse List . iterator |
add additional soft clipped bases at the three and or 5 end of the <unk> | ArrayList . <init> Collections . reverse List . size List . get List . remove List . add List . get List . remove List . add Collections . reverse |
<unk> find the def which a use is associated with , because the later one <unk> previous one | ArrayList . <init> Collections . reverse List . size Map < Integer > . put |
generate reflected binary gray codes | ArrayList . <init> Collections . reverse List < Integer > . add |
create a sequence of operations which than could be used in push , pull , reset , revert commands | ArrayList . <init> Collections . reverse Pair . getLeft Pair . getRight Key . cast Pair . getRight List . add Pair . getRight List . add |
flip this polygon | ArrayList . <init> Collections . reverse Polygon . <init> |
find the build that matches the given project name | ArrayList . <init> Collections . reverse String . trim |
return a text representation of the tagging for this <unk> , using the specified tag format | ArrayList . <init> Collections . reverse StringBuffer . <init> StringBuffer . append StringBuffer . toString |
create a copy of the supplied list of context configuration <unk> reverse order | ArrayList . <init> Collections . reverse |
get a copy of the test execution listener test execution listeners registered for this test context manager in reverse order | ArrayList . <init> Collections . reverse |
get shortest path | ArrayList . <init> Collections . reverse |
get the ancestors of the current node , with the deepest node first | ArrayList . <init> Collections . reverse |
http manual | ArrayList . <init> Collections . reverse |
lista <unk> | ArrayList . <init> Collections . reverse |
notify the listeners that the context is being destroyed , in the reverse order from how they were notified at initialization | ArrayList . <init> Collections . reverse |
return a list of paths from the <unk> path , down to the current path | ArrayList . <init> Collections . reverse |
return a reversed copy of this route | ArrayList . <init> Collections . reverse |
return last maven project from projects being built that has this mojo defined | ArrayList . <init> Collections . reverse |
return overlays in the order they were added | ArrayList . <init> Collections . reverse |
return the closest non extended element type for a given extended type | ArrayList . <init> Collections . reverse |
return the contents of the buffer | ArrayList . <init> Collections . reverse |
return the managed shapes in reverse order | ArrayList . <init> Collections . reverse |
return the topmost node containing the given point , in view coordinates | ArrayList . <init> Collections . reverse |
reverse a pad value list | ArrayList . <init> Collections . reverse |
reverse entire collection , this will work only for list implementation because they only have order | ArrayList . <init> Collections . reverse |
reverse pad state list | ArrayList . <init> Collections . reverse |
reverse the order of a collection | ArrayList . <init> Collections . reverse |
set the list of listeners to already supplied argument | ArrayList . <init> Collections . reverse |
similar to collections | ArrayList . <init> Collections . reverse |
keep only non overlapping matches alignments while <unk> alignments with high score <unk> TODO : this is a heuristic , is the problem np complete ? = probably , see maximum set packing | ArrayList . <init> Collections . reverseOrder Collections . sort ArrayList . <init> ArrayList . add ArrayList . remove ArrayList . size ArrayList . get ArrayList . set ArrayList . add |
keep only non overlapping matches alignments while <unk> alignments with high score <unk> TODO : this is a heuristic , is the problem np complete ? = probably , see maximum set packing | ArrayList . <init> Collections . reverseOrder Collections . sort ArrayList . <init> ArrayList . get ArrayList . add ArrayList . remove ArrayList . size ArrayList . get ArrayList . set ArrayList . add |
remove positions in <unk> positions from positions , and <unk> the remaining positions accordingly | ArrayList . <init> Collections . reverseOrder Collections . sort ArrayList . <init> Iterator < Integer > . hasNext Iterator < Integer > . next Iterator < Integer > . remove Collection < Integer > . add Iterator < Integer > . remove Collection < Integer > . add Collection < Integer > . clear Collection < Integer > . add... |
return the list of top n similar historical <unk> pairs | ArrayList . <init> Collections . reverseOrder Collections . sort ArrayList . add |
return an list of n transactions , ordered by increasing age | ArrayList . <init> Collections . reverseOrder Collections . sort Date . compareTo ArrayList . size |
this method remove node a from the graph if : node a and node b are not linked by an edge | ArrayList . <init> Collections . reverseOrder Collections . sort HashSet . <init> HashSet . contains HashSet . <init> HashSet . removeAll HashSet . remove HashSet . size HashSet . containsAll HashSet . add HashMap < HashSet > . <init> |
get a list of items from the bag , sorted to place the items with the highest count first | ArrayList . <init> Collections . reverseOrder Collections . sort |
perform the allocation with the vertex ordered according to largest first order | ArrayList . <init> Collections . reverseOrder Collections . sort |
group collection of objects by given object property using provided group order | ArrayList . <init> Collections . reverseOrder TreeSet . <init> LinkedHashSet . <init> HashMap . <init> Iterator . hasNext Iterator . next Map . put Set . add Set . iterator Iterator . hasNext Iterator . next Collection . add |
apply the cross over operation to the selected candidates | ArrayList . <init> Collections . shuffle ArrayList . <init> List . iterator Iterator . hasNext Iterator . next List . addAll List . add |
apply the cross over operation to the selected candidates | ArrayList . <init> Collections . shuffle ArrayList . <init> List . iterator Iterator . next Iterator . hasNext Iterator . next List . addAll List . add |
choose a random node from whole cluster | ArrayList . <init> Collections . shuffle ArrayList . <init> Set < Node > . contains Set < Node > . add List . add |
return a random sample of n elements from b | ArrayList . <init> Collections . shuffle ArrayList . <init> |
this method isnt much good | ArrayList . <init> Collections . shuffle ArrayList . iterator Iterator . next String . cast |
return a iterator for the <unk> list | ArrayList . <init> Collections . shuffle ArrayList . iterator |
send a tcp connect back request to up to two connected <unk> | ArrayList . <init> Collections . shuffle Iterator . hasNext Iterator . next Connection . <unk> Connection . send |
implement cross validation to the items specified | ArrayList . <init> Collections . shuffle List . get List . add List . size Collections . shuffle List . add List . size Evaluation . <init> StringBuffer . <init> Boolean . <init> Evaluation . <unk> Evaluation . <unk> Evaluation . <unk> Evaluation . <unk> Evaluation . <unk> Evaluation . toSummaryString Evaluation . <ini... |
get random city , method mainly for test purposes | ArrayList . <init> Collections . shuffle List . get |
randomly chooses a room within the given collection that has <unk> one adjacent empty space | ArrayList . <init> Collections . shuffle List . get |
send a udp connect back request to up to 4 and at least two connected <unk> | ArrayList . <init> Collections . shuffle List . iterator Connection . <unk> Connection . send |
send a udp connect back request to up to 4 and at least two connected <unk> | ArrayList . <init> Collections . shuffle List . iterator Iterator . hasNext Iterator . next Connection . <unk> Connection . send |
return the contract that increases <unk> the most | ArrayList . <init> Collections . shuffle List . iterator Iterator . hasNext Iterator . next |
send a tcp connect back request to up to two connected <unk> | ArrayList . <init> Collections . shuffle List . iterator Iterator . next Connection . send |
apply the cross over operation to the selected candidates | ArrayList . <init> Collections . shuffle List . size ArrayList . <init> List . iterator Iterator . hasNext Iterator . next List . addAll List . add |
implement cross validation to the items specified | ArrayList . <init> Collections . shuffle List . size List . get List . add List . get List . add List . size Collections . shuffle List . size List . get List . add List . get List . add List . size Evaluation . <init> StringBuffer . <init> Boolean . <init> Evaluation . <unk> Evaluation . <unk> Evaluation . <unk> Evalu... |
traverse network <unk> forward and backward to identify <unk> connections and neurons | ArrayList . <init> Collections . shuffle List . size List . get Set . add |
create a random genotype by shuffling the order of alleles | ArrayList . <init> Collections . shuffle List . size List . get |
get k centers randomly from the passed in list of points , attaches <unk> to them , and returns the list of centers | ArrayList . <init> Collections . shuffle List . size List . subList Integer . intValue List . subList List . size List . get List . set |
obtain up to quantity related <unk> to show random related <unk> <unk> <unk> by the given user | ArrayList . <init> Collections . shuffle List . size Math . min HashSet . <init> Set . add |
traverse network <unk> forward and backward to identify <unk> connections and neurons | ArrayList . <init> Collections . shuffle List . size Set . add |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.