docstring
stringlengths
3
2.38k
code
stringlengths
9
99.4k
time invoke all c returns results of all completed tasks
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ArrayList < Callable < String > > . <init> List < Callable < String > > . add ExecutorService . invokeAll Future < String > . get
time invoke all c returns results of all completed tasks
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ArrayList < Callable < String > > . <init> List < Callable < String > > . add ExecutorService . invokeAll List < Future < String > > . size
time invoke any c throws execution exception if no task completes
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ArrayList < Callable < String > > . <init> List < Callable < String > > . add ExecutorService . invokeAny
get queue returns the work queue , which contains queued tasks
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> CountDownLatch . <init> CountDownLatch . countDown CountDownLatch . await FutureTask . <init> ThreadPoolExecutor . execute CountDownLatch . await ThreadPoolExecutor . getQueue BlockingQueue < Runnable > . contains BlockingQueue < Runnable > . size CountDownLatch . countDown
get queue returns the work queue , which contains queued tasks
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> CountDownLatch . <init> CountDownLatch . countDown ThreadPoolExecutor . getQueue CountDownLatch . await FutureTask . <init> ThreadPoolExecutor . execute CountDownLatch . await ThreadPoolExecutor . getQueue BlockingQueue < Runnable > . contains CountDownLatch . countDown
block on submit callable throws interrupted exception if caller interrupted
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> Runnable . <init> Thread . <init> Callable < Object > . <init> <unk> . submit Thread . <unk> Thread . sleep Thread . start Thread . sleep Thread . interrupt
get the <unk> matrix
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> Runnable . <init> ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination
perform any bookkeeping needed when we connect
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> Runnable . <init> ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown
multi threaded performance test
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> Thread . sleep System . currentTimeMillis CountDownLatch . countDown Future < List < < String > > > . get System . currentTimeMillis String . format
get largest pool size increases , but doesnt <unk> , when multiple threads active
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . <unk> ThreadPoolExecutor . execute Thread . sleep
be terminating is not true when running or when terminated
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . <unk> ThreadPoolExecutor . execute ThreadPoolExecutor . <unk> ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination ThreadPoolExecutor . <unk>
be terminating is not true when running or when terminated
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . <unk> ThreadPoolExecutor . execute ThreadPoolExecutor . <unk> ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination
be terminating is not true when running or when terminated
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . <unk> ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination ThreadPoolExecutor . isTerminated ThreadPoolExecutor . <unk>
be terminating is not true when running or when terminated
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . <unk> ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination
create a benchmark thread pool
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . <unk>
get largest pool size increases , but doesnt <unk> , when multiple threads active
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . execute Thread . sleep ThreadPoolExecutor . <unk>
get completed task count increases , but doesnt <unk> , when tasks complete
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . execute Thread . sleep ThreadPoolExecutor . shutdown
be terminating is not true when running or when terminated
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . execute ThreadPoolExecutor . <unk> ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination ThreadPoolExecutor . <unk>
be terminating is not true when running or when terminated
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . execute ThreadPoolExecutor . <unk> ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination
<unk> all core threads starts all core pool size threads
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . getPoolSize ThreadPoolExecutor . <unk> ThreadPoolExecutor . getPoolSize ThreadPoolExecutor . <unk> ThreadPoolExecutor . getPoolSize
be terminated is false before termination , true after
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init> ThreadPoolExecutor . isTerminated ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown
construct a new web socket message queue
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init>
obtain instance of executor
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init>
set up the <unk>
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . <init>
shut down now returns a list containing tasks that were not run
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . execute ThreadPoolExecutor . shutdownNow ThreadPoolExecutor . isShutdown List . size
shut down now returns a list containing tasks that were not run
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . execute ThreadPoolExecutor . shutdownNow
be terminated is false before termination , true after
ArrayBlockingQueue < Runnable > . <init> ThreadPoolExecutor . isTerminated ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown ThreadPoolExecutor . awaitTermination ThreadPoolExecutor . isTerminated
service requests
ArrayBlockingQueue < Runnable > . size ThreadPoolExecutor . execute ServerSocket . accept ThreadPoolExecutor . execute ThreadPoolExecutor . shutdown
retorna o <unk> <unk> da <unk> se a <unk> <unk> <unk> , a thread e <unk> <unk> que <unk> dado <unk> <unk>
ArrayBlockingQueue < Segment > . take Utilities . <unk>
initialize asynchronous logging
ArrayBlockingQueue < String > . <init> ArrayBlockingQueue < String > . offer
this test uses two consumers and one producer which will make consumers faster then producer
ArrayBlockingQueue < String > . <init> Consumer . <init> Thread . <init> Thread . start Thread . <init> Thread . start Thread . <init> Thread . start
this test uses two <unk> and one consumer which will make consumers slower then producer
ArrayBlockingQueue < String > . <init> Consumer . <init> Thread . start Thread . <init> Thread . start
main entry point for running test scenario
ArrayBlockingQueue < String > . <init> Executors . newSingleThreadExecutor ExecutorService . execute Executors . newFixedThreadPool ExecutorService . execute
main entry point for running test scenario
ArrayBlockingQueue < String > . <init> Executors . newSingleThreadExecutor ExecutorService . execute Executors . newSingleThreadExecutor ExecutorService . execute
this method reads in the
ArrayBlockingQueue < String > . <init> HashMap < String , Integer > . <init> HashMap < String , HashMap < String , Integer > > . <init> TreeSet < String > . <init> TreeSet < String > . add String . <init> FileInputStream . <init> XMLInputFactory . newFactory GZIPInputStream . <init> ByteArrayInputStream . <init> XMLInputFactory . createXMLEventReader XMLEventReader . nextEvent XMLEvent . isStartElement XMLEvent . asStartElement QName . <init> XMLEvent . asStartElement QName . <init> XMLEvent . asStartElement QName . <init> HashMap < String , Integer > . get HashMap < String , Integer > . put ArrayBlockingQueue < String > . size ArrayBlockingQueue < String > . peek TreeSet < String > . contains HashMap < String , Integer > . <init> HashMap < String , HashMap < String , Integer > > . put HashMap < String , HashMap < String , Integer > > . get HashMap < String , Integer > . containsKey HashMap < String , Integer > . get HashMap < String , Integer > . put HashMap < String , Integer > . get HashMap < String , Integer > . put ArrayBlockingQueue < String > . size ArrayBlockingQueue < String > . poll ArrayBlockingQueue < String > . offer ArrayBlockingQueue < String > . peek HashMap < String , HashMap < String , Integer > > . put HashMap < String , HashMap < String , Integer > > . get HashMap < String , Integer > . containsKey HashMap < String , Integer > . get HashMap < String , Integer > . put HashMap < String , Integer > . containsKey HashMap < String , Integer > . get HashMap < String , Integer > . put ArrayBlockingQueue < String > . poll ArrayBlockingQueue < String > . offer ArrayBlockingQueue < String > . clear ByteArrayInputStream . close
be called as an extension of the constructor
ArrayBlockingQueue < String > . <init> InputStreamReader . <init> BufferedReader . <init> Socket . getOutputStream PrintWriter . <init> String . <init> BufferedReader . readLine String . equals JLabel . setText BlockingQueue < String > . take PrintWriter . println PrintWriter . flush String . split JFrame . setVisible Thread . <init> Thread . start
this checks to make sure that tags are always get <unk> larger over time
ArrayBlockingQueue < String > . <init> Object . <init> CountDownLatch . <init> CountDownLatch . countDown CountDownLatch . await Queue < String > . offer CountDownLatch . countDown CountDownLatch . await Queue < String > . toArray
add a string or a series of strings to the <unk> queue
ArrayBlockingQueue < String > . offer ArrayBlockingQueue < String > . take ArrayBlockingQueue < String > . offer ArrayBlockingQueue < String > . take ArrayBlockingQueue < String > . offer
queue a message to be sent to the server its a limited <unk> : if more than max queued message messages pending , delete the oldest one
ArrayBlockingQueue < String > . poll ArrayBlockingQueue < String > . add
send first message in queue , if any
ArrayBlockingQueue < String > . size ArrayBlockingQueue < String > . poll
process a message
ArrayBlockingQueue < String > . take String . equals
determine if there is a deadlock and if so , stop the test
ArrayBlockingQueue < Throwable > . offer Thread . interrupt
stop the test due to a timeout
ArrayBlockingQueue < Throwable > . offer Thread . interrupt
move or get this record and cache multiple records if possible
ArrayCache . <init> ArrayCache . get Integer . <init> ArrayCache . getEndIndex Vector . instance Vector . size Vector . cast Vector . get Vector . cast Vector . instance Integer . <init> ArrayCache . set Vector . cast Vector < Object > . size Vector < Object > . get Vector . instance ArrayCache . set Vector < Object > . size Integer . <init>
get the converted value for the specified key and input pairs
ArrayCache . <unk> ArrayCache . <unk>
put the converted value for the specified key and input pairs
ArrayCache . <unk> ArrayCache . <unk>
search through the buffers for this bookmark
ArrayCache . get Vector . instance Vector . cast Vector . get Object . equals
set this element to this object
ArrayCache . size ArrayCache . <unk> ArrayCache . size ArrayCache . add
clear the queue and resets the sequence number counter to zero
ArrayDeque . <init> ArrayDeque . clear PriorityQueue . <init> PriorityQueue . clear
will create a new java
ArrayDeque . <init> Deque . add
perform a breadth first search on a given node
ArrayDeque . <init> Queue . add ArrayDeque . <init> Trees . <unk>
call in the executor thread when the node has finished refreshing
ArrayDeque . add Object . notifyAll
evaluate a concat of operands
ArrayDeque . size ArrayDeque . pop ArrayDeque . push
return a copy of this deque
ArrayDeque . <init> Array . <unk>
offer first x succeeds
ArrayDeque . <init> ArrayDeque . <unk> ArrayDeque . peekFirst
to array with <unk> aray type throws cce
ArrayDeque . <init> ArrayDeque . add AbstractCollection . toArray
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . hasNext Iterator . next ArrayDeque . remove
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . add ArrayDeque . removeFirst
put the list entry length in statistics
ArrayDeque . <init> ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . poll ArrayDeque . add ArrayList . size DescriptiveStatistics . addValue
perform a breadth first search for a matching game state
ArrayDeque . <init> ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . remove ArrayDeque . add
perform a breadth first search for a matching game state
ArrayDeque . <init> ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . remove String . equals ArrayDeque . add
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . add ArrayDeque . isEmpty Integer . <init> ArrayDeque . add ArrayDeque . removeFirst
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add ArrayDeque . iterator Iterator . hasNext Integer . intValue Iterator . next
perform a breadth first search for a matching game state
ArrayDeque . <init> ArrayDeque . add ArrayDeque . remove ArrayDeque . add
represent a <unk> in terms of the current column non basic variables and adds it to the map <unk>
ArrayDeque . <init> ArrayDeque . add ArrayDeque . removeFirst HashMap < TreeMap > . get Entry . getKey ArrayDeque . add BigInteger . negate Map . get Map . put Map . remove Map . put
<unk> three step i 4 : reconstruct the original image by removing extra pixels
ArrayDeque . <init> ArrayDeque . add BufferedImage . <init> ArrayDeque . poll
transitively reduce g
ArrayDeque . <init> ArrayDeque . add HashMap < HashSet > . <init> ArrayDeque . descendingIterator HashSet . <init> HashMap < HashSet > . put HashSet . add HashMap < HashSet > . get HashSet . contains HashSet . add HashSet . remove HashSet . <init> HashSet . contains HashSet . add
transitively reduce g
ArrayDeque . <init> ArrayDeque . add HashMap < HashSet > . <init> ArrayDeque . descendingIterator HashSet . <init> HashMap < HashSet > . put HashSet . contains HashSet . add HashSet . remove HashSet . <init> HashSet . contains HashSet . add
transitively reduce g
ArrayDeque . <init> ArrayDeque . add HashMap < HashSet > . <init> HashSet . <init> HashMap < HashSet > . put HashSet . add HashMap < HashSet > . get HashSet . add HashSet . remove HashSet . <init> HashSet . add
transitively reduce g
ArrayDeque . <init> ArrayDeque . add HashMap < HashSet > . <init> HashSet . <init> HashMap < HashSet > . put HashSet . contains HashSet . add HashSet . contains HashSet . add HashSet . remove HashSet . <init> HashSet . contains HashSet . add
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . hasNext Integer . intValue Iterator . next Integer . intValue ArrayDeque . remove
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Iterator . next Integer . cast Integer . intValue ArrayDeque . remove
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . iterator Iterator . next Integer . intValue
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . descendingIterator Integer . cast Integer . intValue ArrayDeque . remove
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . iterator Integer . intValue Iterator . next Integer . intValue
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . iterator Iterator . next
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Integer . intValue Iterator . next Integer . intValue
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Integer . intValue Iterator . next
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Iterator . next ArrayDeque . remove
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add Integer . <init> ArrayDeque . add Iterator . hasNext Integer . intValue Iterator . next Integer . intValue ArrayDeque . remove
descend iterator ordering is reverse fifo
ArrayDeque . <init> ArrayDeque . add Iterator . hasNext Iterator . next ArrayDeque . remove
iterator ordering is fifo
ArrayDeque . <init> ArrayDeque . add Iterator . hasNext Iterator . next Integer . cast Integer . intValue
add event to the time window for the specified timestamp
ArrayDeque . <init> ArrayDeque . add Pair < Long , ArrayDeque > . <init> ArrayDeque < Pair < Long , ArrayDeque > > . add Map < ArrayDeque > . put ArrayDeque < Pair < Long , ArrayDeque > > . getLast Pair < Long , ArrayDeque > . getFirst Map < ArrayDeque > . put ArrayDeque . <init> Pair < Long , ArrayDeque > . <init> Map < ArrayDeque > . put ArrayDeque < Pair < Long , ArrayDeque > > . add
add event to the time window for the specified timestamp
ArrayDeque . <init> ArrayDeque . add Pair < Long , ArrayDeque > . <init> ArrayDeque < Pair < Long , ArrayDeque > > . add Map < ArrayDeque > . put ArrayDeque < Pair < Long , ArrayDeque > > . getLast Pair < Long , ArrayDeque > . getFirst Pair < Long , ArrayDeque > . getSecond Map < ArrayDeque > . put ArrayDeque . <init> Pair < Long , ArrayDeque > . <init> Map < ArrayDeque > . put ArrayDeque < Pair < Long , ArrayDeque > > . add
add event to the time window for the specified timestamp
ArrayDeque . <init> ArrayDeque . add Pair < Long , ArrayDeque > . <init> ArrayDeque < Pair < Long , ArrayDeque > > . add Map < ArrayDeque > . put ArrayDeque < Pair < Long , ArrayDeque > > . getLast Pair < Long , ArrayDeque > . getSecond Map < ArrayDeque > . put ArrayDeque . <init> Pair < Long , ArrayDeque > . <init> Map < ArrayDeque > . put ArrayDeque < Pair < Long , ArrayDeque > > . add
a constructor of array deque
ArrayDeque . <init> ArrayDeque . add
return the values for the filter , using the supplied result events to ask filter parameters for the value to filter for
ArrayDeque . <init> ArrayDeque . addAll ArrayDeque . <init>
create and returns new selection instance by merging current and provided data ordering
ArrayDeque . <init> ArrayDeque . addFirst ArrayDeque . addAll
add first x succeeds
ArrayDeque . <init> ArrayDeque . addFirst ArrayDeque . peekFirst ArrayDeque . peekLast
add first x succeeds
ArrayDeque . <init> ArrayDeque . addFirst ArrayDeque . peekLast
follow the goal node via a chain of parents to the start and returns that as a deque
ArrayDeque . <init> ArrayDeque . addFirst
add last x succeeds
ArrayDeque . <init> ArrayDeque . addLast ArrayDeque . peekFirst
this method uses array deque data structure as queue deque to find the <unk> position
ArrayDeque . <init> ArrayDeque . addLast ArrayDeque . size ArrayDeque . <init> ArrayDeque . pop ArrayDeque . addLast ArrayDeque . <init> ArrayDeque . pop ArrayDeque . addLast ArrayDeque . pop ArrayDeque . isEmpty ArrayDeque . add ArrayDeque . size ArrayDeque . pop ArrayDeque . add ArrayDeque . <init>
force all pending transitions to be completed immediately
ArrayDeque . <init> ArrayDeque . clear Factory . cancel Runnable . run ArrayDeque . poll Runnable . run Factory . <unk> Runnable . run
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . isEmpty ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . isEmpty ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . isEmpty Integer . <init> ArrayDeque . add ArrayDeque . isEmpty ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . isEmpty Integer . <init> ArrayDeque . add ArrayDeque . isEmpty Integer . <init> ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty
be empty is true before add , false after
ArrayDeque . <init> ArrayDeque . isEmpty Integer . <init> ArrayDeque . add Integer . <init> ArrayDeque . add ArrayDeque . removeFirst ArrayDeque . isEmpty