id stringlengths 11 16 | language stringclasses 2
values | question stringlengths 13 844 | answer stringlengths 1 900 | code stringlengths 162 27.4k | code_original stringlengths 162 26k | code_word_count int64 51 5.96k |
|---|---|---|---|---|---|---|
java-test-4936 | java | What might all islands be touching ? | a chunk - area | private List < End Island > find Surrounding Islands ( int chunk X , int chunk Y , int chunks Per Fragment X , int chunks Per Fragment Y ) { List < End Island > result = new Linked List < End Island > ( ) ; for ( int y = - SURROUNDING CHUNKS ; y <= chunks Per Fragment Y + SURROUNDING CHUNKS ; y ++ ) { for ( int x = - S... | private List < EndIsland > findSurroundingIslands ( int chunkX , int chunkY , int chunksPerFragmentX , int chunksPerFragmentY ) { List < EndIsland > result = new LinkedList < EndIsland > ( ) ; for ( int y = - SURROUNDING_CHUNKS ; y <= chunksPerFragmentY + SURROUNDING_CHUNKS ; y ++ ) { for ( int x = - SURROUNDING_CHUNKS... | 135 |
java-test-4937 | java | What does this method query for installed packages that can respond to an intent with the specified action ? | the package manager | public static boolean is Intent Available ( Context context , String action ) { final Package Manager package Manager = context . get Package Manager ( ) ; final Intent intent = new Intent ( action ) ; Log . d ( MP TAG , STRING + action ) ; List < Resolve Info > list = package Manager . query Intent Services ( intent ,... | public static boolean isIntentAvailable ( Context context , String action ) { final PackageManager packageManager = context . getPackageManager ( ) ; final Intent intent = new Intent ( action ) ; Log . d ( MP_TAG , STRING + action ) ; List < ResolveInfo > list = packageManager . queryIntentServices ( intent , PackageMa... | 84 |
java-test-4938 | java | What does the code indicate ? | whether the specified action can be used as an intent | public static boolean is Intent Available ( Context context , String action ) { final Package Manager package Manager = context . get Package Manager ( ) ; final Intent intent = new Intent ( action ) ; Log . d ( MP TAG , STRING + action ) ; List < Resolve Info > list = package Manager . query Intent Services ( intent ,... | public static boolean isIntentAvailable ( Context context , String action ) { final PackageManager packageManager = context . getPackageManager ( ) ; final Intent intent = new Intent ( action ) ; Log . d ( MP_TAG , STRING + action ) ; List < ResolveInfo > list = packageManager . queryIntentServices ( intent , PackageMa... | 84 |
java-test-4940 | java | What did the code set ? | the attributes of the column | public void add Column ( Class class Type , boolean read Only , String header ) { m model Header Class . add ( class Type ) ; set Column Read Only ( m model Header Class . size ( ) - NUM , read Only ) ; add Column ( header ) ; W List Item Renderer renderer = ( W List Item Renderer ) get Item Renderer ( ) ; renderer . s... | public void addColumn ( Class classType , boolean readOnly , String header ) { m_modelHeaderClass . add ( classType ) ; setColumnReadOnly ( m_modelHeaderClass . size ( ) - _NUM , readOnly ) ; addColumn ( header ) ; WListItemRenderer renderer = ( WListItemRenderer ) getItemRenderer ( ) ; renderer . setColumnClass ( ( re... | 97 |
java-test-4943 | java | What do the dbftablemodel represent ? | the attribute data for the list objects | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4944 | java | What handles multi - part geometries because it ' s assumed that the sorting of the graphic types have been handled and that any sub - lists are meant to be multi - part geometries . if the filepath hasn ' t been set in the esrishapeexport class , the user will be asked to provide it ? | this export | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4945 | java | What does the code write ? | esrigraphiclists | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4946 | java | Where is the dbftablemodel representing the attribute data for the list objects stored ? | under the dbf_attribute key | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4947 | java | What does the code assume ? | that the dbftablemodel representing the attribute data for the list objects is stored as an attribute in the esrigraphiclist under the dbf_attribute key . this export handles multi - part geometries , because it ' s assumed that the sorting of the graphic types have been handled and that any sub - lists are meant to be... | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4948 | java | What does it ' s assume ? | that the sorting of the graphic types have been handled and that any sub - lists are meant to be multi - part geometries | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4949 | java | What is stored under the dbf_attribute key ? | the dbftablemodel representing the attribute data for the list objects | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4950 | java | What is representing the attribute data for the list objects ? | the dbftablemodel | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4951 | java | Why does this export handle multi - part geometries ? | because it ' s assumed that the sorting of the graphic types have been handled and that any sub - lists are meant to be multi - part geometries . if the filepath hasn ' t been set in the esrishapeexport class , the user will be asked to provide it | protected void export ( Esri Graphic List eg List ) { Object obj = eg List . get Attribute ( DBF ATTRIBUTE ) ; if ( obj == null ) { eg List . put Attribute ( DBF ATTRIBUTE , get Master DBF ( ) ) ; } ese Interfaces . add ( new ESE Interface ( eg List , file Path , null ) ) ; write Files ( ) ; } | protected void export ( EsriGraphicList egList ) { Object obj = egList . getAttribute ( DBF_ATTRIBUTE ) ; if ( obj == null ) { egList . putAttribute ( DBF_ATTRIBUTE , getMasterDBF ( ) ) ; } eseInterfaces . add ( new ESEInterface ( egList , filePath , null ) ) ; writeFiles ( ) ; } | 73 |
java-test-4953 | java | What does the code load ? | the checkpoints from the given stream | public Checkpoint Manager ( Network Parameters params , @ Nullable Input Stream input Stream ) throws IO Exception { this . params = check Not Null ( params ) ; if ( input Stream == null ) input Stream = open Stream ( params ) ; check Not Null ( input Stream ) ; input Stream = new Buffered Input Stream ( input Stream )... | public CheckpointManager ( NetworkParameters params , @ Nullable InputStream inputStream ) throws IOException { this . params = checkNotNull ( params ) ; if ( inputStream == null ) inputStream = openStream ( params ) ; checkNotNull ( inputStream ) ; inputStream = new BufferedInputStream ( inputStream ) ; inputStream . ... | 148 |
java-test-4955 | java | What can use to index into the basic blocks quickly ? | getbasicblock ( int ) | public void reset Basic Block Map ( ) { basic Block Map = new Basic Block [ get Max Basic Block Number ( ) + NUM ] ; for ( Enumeration < Basic Block > bb Enum = cfg . basic Blocks ( ) ; bb Enum . has More Elements ( ) ; ) { Basic Block block = bb Enum . next Element ( ) ; basic Block Map [ block . get Number ( ) ] = bl... | public void resetBasicBlockMap ( ) { basicBlockMap = new BasicBlock [ getMaxBasicBlockNumber ( ) + _NUM ] ; for ( Enumeration < BasicBlock > bbEnum = cfg . basicBlocks ( ) ; bbEnum . hasMoreElements ( ) ; ) { BasicBlock block = bbEnum . nextElement ( ) ; basicBlockMap [ block . getNumber ( ) ] = block ; } } | 84 |
java-test-4956 | java | What can getbasicblock ( int ) use ? | to index into the basic blocks quickly | public void reset Basic Block Map ( ) { basic Block Map = new Basic Block [ get Max Basic Block Number ( ) + NUM ] ; for ( Enumeration < Basic Block > bb Enum = cfg . basic Blocks ( ) ; bb Enum . has More Elements ( ) ; ) { Basic Block block = bb Enum . next Element ( ) ; basic Block Map [ block . get Number ( ) ] = bl... | public void resetBasicBlockMap ( ) { basicBlockMap = new BasicBlock [ getMaxBasicBlockNumber ( ) + _NUM ] ; for ( Enumeration < BasicBlock > bbEnum = cfg . basicBlocks ( ) ; bbEnum . hasMoreElements ( ) ; ) { BasicBlock block = bbEnum . nextElement ( ) ; basicBlockMap [ block . getNumber ( ) ] = block ; } } | 84 |
java-test-4957 | java | What does the code restore ? | the state of an valuerange | private void read Object ( Object Input Stream s ) throws IO Exception , Class Not Found Exception , Invalid Object Exception { s . default Read Object ( ) ; if ( min Smallest > min Largest ) { throw new Invalid Object Exception ( STRING ) ; } if ( max Smallest > max Largest ) { throw new Invalid Object Exception ( STR... | private void readObject ( ObjectInputStream s ) throws IOException , ClassNotFoundException , InvalidObjectException { s . defaultReadObject ( ) ; if ( minSmallest > minLargest ) { throw new InvalidObjectException ( STRING ) ; } if ( maxSmallest > maxLargest ) { throw new InvalidObjectException ( STRING ) ; } if ( minL... | 89 |
java-test-4958 | java | Does this use this ? | No | public String Buffer generate Pattern ( String Buffer result , boolean escape Unprintable , boolean include Strings ) { result . append ( STRING ) ; int count = get Range Count ( ) ; if ( count > NUM && get Range Start ( NUM ) == MIN VALUE && get Range End ( count - NUM ) == MAX VALUE ) { result . append ( STRING ) ; f... | public StringBuffer _generatePattern ( StringBuffer result , boolean escapeUnprintable , boolean includeStrings ) { result . append ( STRING ) ; int count = getRangeCount ( ) ; if ( count > _NUM && getRangeStart ( _NUM ) == MIN_VALUE && getRangeEnd ( count - _NUM ) == MAX_VALUE ) { result . append ( STRING ) ; for ( in... | 332 |
java-test-4959 | java | What does not use this ? | this | public String Buffer generate Pattern ( String Buffer result , boolean escape Unprintable , boolean include Strings ) { result . append ( STRING ) ; int count = get Range Count ( ) ; if ( count > NUM && get Range Start ( NUM ) == MIN VALUE && get Range End ( count - NUM ) == MAX VALUE ) { result . append ( STRING ) ; f... | public StringBuffer _generatePattern ( StringBuffer result , boolean escapeUnprintable , boolean includeStrings ) { result . append ( STRING ) ; int count = getRangeCount ( ) ; if ( count > _NUM && getRangeStart ( _NUM ) == MIN_VALUE && getRangeEnd ( count - _NUM ) == MAX_VALUE ) { result . append ( STRING ) ; for ( in... | 332 |
java-test-4960 | java | What does this not use ? | this | public String Buffer generate Pattern ( String Buffer result , boolean escape Unprintable , boolean include Strings ) { result . append ( STRING ) ; int count = get Range Count ( ) ; if ( count > NUM && get Range Start ( NUM ) == MIN VALUE && get Range End ( count - NUM ) == MAX VALUE ) { result . append ( STRING ) ; f... | public StringBuffer _generatePattern ( StringBuffer result , boolean escapeUnprintable , boolean includeStrings ) { result . append ( STRING ) ; int count = getRangeCount ( ) ; if ( count > _NUM && getRangeStart ( _NUM ) == MIN_VALUE && getRangeEnd ( count - _NUM ) == MAX_VALUE ) { result . append ( STRING ) ; for ( in... | 332 |
java-test-4961 | java | What does the code get ? | whether the supplied cardinal number is included in the current range | public boolean is In Range ( int index ) { if ( m Upper == - NUM ) { throw new Runtime Exception ( STRING ) ; } if ( m Invert ) { return ! m Select Flags [ index ] ; } else { return m Select Flags [ index ] ; } } | public boolean isInRange ( int index ) { if ( m_Upper == - _NUM ) { throw new RuntimeException ( STRING ) ; } if ( m_Invert ) { return ! m_SelectFlags [ index ] ; } else { return m_SelectFlags [ index ] ; } } | 56 |
java-test-4962 | java | What does the code create ? | a modifiablehyperboundingbox with given min and max | public Modifiable Hyper Bounding Box ( int dim , double min , double max ) { super ( ) ; this . min = new double [ dim ] ; this . max = new double [ dim ] ; Arrays . fill ( this . min , min ) ; Arrays . fill ( this . max , max ) ; } | public ModifiableHyperBoundingBox ( int dim , double min , double max ) { super ( ) ; this . min = new double [ dim ] ; this . max = new double [ dim ] ; Arrays . fill ( this . min , min ) ; Arrays . fill ( this . max , max ) ; } | 63 |
java-test-4965 | java | Where should this be not executed ? | on the main / ui thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4966 | java | For what purpose do disk access include this ? | so this should not be executed on the main / ui thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4967 | java | What should be not executed on the main / ui thread ? | this | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4968 | java | What should you call to initialize it on a background thread instead ? | initdiskcache | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4969 | java | When does an imageprovider not initialize the disk cache ? | when it is created | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4970 | java | What does an imageprovider not initialize when it is created ? | the disk cache | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4971 | java | What does not initialize the disk cache when it is created ? | an imageprovider | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4972 | java | What does the code initialize ? | the disk cache | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4973 | java | Should this be executed on the main / ui thread ? | No | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4974 | java | What should you call initdiskcache instead ? | to initialize it on a background thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4975 | java | Does an imageprovider initialize the disk cache when it is created ? | No | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4976 | java | Where do you initialize it ? | on a background thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } try { m Disk Lru Ca... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } try { mDiskLruCache = DiskLruCache . ope... | 180 |
java-test-4977 | java | Where does the code append a number to the given stringbuffer ? | in the given radix | public static String Buffer append Number ( String Buffer result , int n , int radix , int min Digits ) throws Illegal Argument Exception { if ( radix < NUM || radix > NUM ) { throw new Illegal Argument Exception ( STRING + radix ) ; } int abs = n ; if ( n < NUM ) { abs = - n ; result . append ( STRING ) ; } recursive ... | public static StringBuffer appendNumber ( StringBuffer result , int n , int radix , int minDigits ) throws IllegalArgumentException { if ( radix < _NUM || radix > _NUM ) { throw new IllegalArgumentException ( STRING + radix ) ; } int abs = n ; if ( n < _NUM ) { abs = - n ; result . append ( STRING ) ; } recursiveAppend... | 92 |
java-test-4978 | java | What do you have ? | more fields | protected void update User Fields ( U user , U updated User , U current User ) { log . debug ( STRING + user ) ; if ( user . is Roles Editable ( ) ) { log . debug ( STRING + user ) ; Set < String > roles = user . get Roles ( ) ; if ( updated User . is Unverified ( ) ) { if ( ! user . has Role ( Role . UNVERIFIED ) ) { ... | protected void updateUserFields ( U user , U updatedUser , U currentUser ) { log . debug ( STRING + user ) ; if ( user . isRolesEditable ( ) ) { log . debug ( STRING + user ) ; Set < String > roles = user . getRoles ( ) ; if ( updatedUser . isUnverified ( ) ) { if ( ! user . hasRole ( Role . UNVERIFIED ) ) { makeUnveri... | 183 |
java-test-4979 | java | What does the code update ? | the fields of the users | protected void update User Fields ( U user , U updated User , U current User ) { log . debug ( STRING + user ) ; if ( user . is Roles Editable ( ) ) { log . debug ( STRING + user ) ; Set < String > roles = user . get Roles ( ) ; if ( updated User . is Unverified ( ) ) { if ( ! user . has Role ( Role . UNVERIFIED ) ) { ... | protected void updateUserFields ( U user , U updatedUser , U currentUser ) { log . debug ( STRING + user ) ; if ( user . isRolesEditable ( ) ) { log . debug ( STRING + user ) ; Set < String > roles = user . getRoles ( ) ; if ( updatedUser . isUnverified ( ) ) { if ( ! user . hasRole ( Role . UNVERIFIED ) ) { makeUnveri... | 183 |
java-test-4980 | java | What does the code report ? | a two arguments error | void error ( String key , String arg 1 , String arg 2 ) throws SAX Exception { had Error = BOOL ; if ( eh == null ) return ; eh . error ( new SAX Parse Exception ( localizer . message ( key , arg 1 , arg 2 ) , locator ) ) ; } | void error ( String key , String arg1 , String arg2 ) throws SAXException { hadError = _BOOL ; if ( eh == null ) return ; eh . error ( new SAXParseException ( localizer . message ( key , arg1 , arg2 ) , locator ) ) ; } | 58 |
java-test-4986 | java | Till when will message be stored if callback is not set yet ? | until it is initialized | private boolean send Message To Default Callback ( final Plugin Result message ) { if ( js Default Callback == null ) { default Callback Stored Results . add ( message ) ; return BOOL ; } message . set Keep Callback ( BOOL ) ; js Default Callback . send Plugin Result ( message ) ; return BOOL ; } | private boolean sendMessageToDefaultCallback ( final PluginResult message ) { if ( jsDefaultCallback == null ) { defaultCallbackStoredResults . add ( message ) ; return _BOOL ; } message . setKeepCallback ( _BOOL ) ; jsDefaultCallback . sendPluginResult ( message ) ; return _BOOL ; } | 61 |
java-test-4987 | java | What are we broadcasting through it ? | different events | private boolean send Message To Default Callback ( final Plugin Result message ) { if ( js Default Callback == null ) { default Callback Stored Results . add ( message ) ; return BOOL ; } message . set Keep Callback ( BOOL ) ; js Default Callback . send Plugin Result ( message ) ; return BOOL ; } | private boolean sendMessageToDefaultCallback ( final PluginResult message ) { if ( jsDefaultCallback == null ) { defaultCallbackStoredResults . add ( message ) ; return _BOOL ; } message . setKeepCallback ( _BOOL ) ; jsDefaultCallback . sendPluginResult ( message ) ; return _BOOL ; } | 61 |
java-test-4988 | java | When do we receive a callback ? | on initialization ( device ready ) | private boolean send Message To Default Callback ( final Plugin Result message ) { if ( js Default Callback == null ) { default Callback Stored Results . add ( message ) ; return BOOL ; } message . set Keep Callback ( BOOL ) ; js Default Callback . send Plugin Result ( message ) ; return BOOL ; } | private boolean sendMessageToDefaultCallback ( final PluginResult message ) { if ( jsDefaultCallback == null ) { defaultCallbackStoredResults . add ( message ) ; return _BOOL ; } message . setKeepCallback ( _BOOL ) ; jsDefaultCallback . sendPluginResult ( message ) ; return _BOOL ; } | 61 |
java-test-4994 | java | When do expected attributes occur ? | during starttime and endtime | public void process ( List < Object > appear Attrs , long occur Time ) { if ( expired ) { throw new Illegal State Exception ( STRING ) ; } switch ( status ) { case not sure : if ( occur Time < window . start Time ) { break ; } else if ( occur Time >= window . start Time && occur Time <= window . end Time ) { if ( expec... | public void process ( List < Object > appearAttrs , long occurTime ) { if ( expired ) { throw new IllegalStateException ( STRING ) ; } switch ( status ) { case not_sure : if ( occurTime < window . startTime ) { break ; } else if ( occurTime >= window . startTime && occurTime <= window . endTime ) { if ( expectAttrs . e... | 151 |
java-test-4995 | java | What does the code validate ? | the view parameter expressions | public static Expr Node [ ] validate ( String view Name , Event Type event Type , Statement Context statement Context , List < Expr Node > expressions , boolean allow Constant Result ) throws View Parameter Exception { List < Expr Node > results = new Array List < Expr Node > ( ) ; int expression Number = NUM ; Stream ... | public static ExprNode [ ] validate ( String viewName , EventType eventType , StatementContext statementContext , List < ExprNode > expressions , boolean allowConstantResult ) throws ViewParameterException { List < ExprNode > results = new ArrayList < ExprNode > ( ) ; int expressionNumber = _NUM ; StreamTypeService str... | 210 |
java-test-4996 | java | What does p not evaluate ? | the expression | public static Expr Node [ ] validate ( String view Name , Event Type event Type , Statement Context statement Context , List < Expr Node > expressions , boolean allow Constant Result ) throws View Parameter Exception { List < Expr Node > results = new Array List < Expr Node > ( ) ; int expression Number = NUM ; Stream ... | public static ExprNode [ ] validate ( String viewName , EventType eventType , StatementContext statementContext , List < ExprNode > expressions , boolean allowConstantResult ) throws ViewParameterException { List < ExprNode > results = new ArrayList < ExprNode > ( ) ; int expressionNumber = _NUM ; StreamTypeService str... | 210 |
java-test-4997 | java | What does the code return ? | the validated expression | public static Expr Node [ ] validate ( String view Name , Event Type event Type , Statement Context statement Context , List < Expr Node > expressions , boolean allow Constant Result ) throws View Parameter Exception { List < Expr Node > results = new Array List < Expr Node > ( ) ; int expression Number = NUM ; Stream ... | public static ExprNode [ ] validate ( String viewName , EventType eventType , StatementContext statementContext , List < ExprNode > expressions , boolean allowConstantResult ) throws ViewParameterException { List < ExprNode > results = new ArrayList < ExprNode > ( ) ; int expressionNumber = _NUM ; StreamTypeService str... | 210 |
java-test-4998 | java | Does p evaluate the expression ? | No | public static Expr Node [ ] validate ( String view Name , Event Type event Type , Statement Context statement Context , List < Expr Node > expressions , boolean allow Constant Result ) throws View Parameter Exception { List < Expr Node > results = new Array List < Expr Node > ( ) ; int expression Number = NUM ; Stream ... | public static ExprNode [ ] validate ( String viewName , EventType eventType , StatementContext statementContext , List < ExprNode > expressions , boolean allowConstantResult ) throws ViewParameterException { List < ExprNode > results = new ArrayList < ExprNode > ( ) ; int expressionNumber = _NUM ; StreamTypeService str... | 210 |
java-test-4999 | java | What does not evaluate the expression ? | p | public static Expr Node [ ] validate ( String view Name , Event Type event Type , Statement Context statement Context , List < Expr Node > expressions , boolean allow Constant Result ) throws View Parameter Exception { List < Expr Node > results = new Array List < Expr Node > ( ) ; int expression Number = NUM ; Stream ... | public static ExprNode [ ] validate ( String viewName , EventType eventType , StatementContext statementContext , List < ExprNode > expressions , boolean allowConstantResult ) throws ViewParameterException { List < ExprNode > results = new ArrayList < ExprNode > ( ) ; int expressionNumber = _NUM ; StreamTypeService str... | 210 |
java-test-5000 | java | What do that extraction save since k - best extraction involves the recomputation of features to get the component values when only the 1 - best string is desired ? | a lot of time | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5001 | java | What do you call directly ? | getkthhyp ( ) or getkthderivation ( ) | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5002 | java | What ll you want if you want intermediate access to the k - best derivations ? | to call getkthhyp ( ) or getkthderivation ( ) directly | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5003 | java | What do you want ? | intermediate access to the k - best derivations | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5004 | java | What saves a lot of time since k - best extraction involves the recomputation of features to get the component values when only the 1 - best string is desired ? | that extraction | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5005 | java | Why do that extraction save a lot of time when only the 1 - best string is desired ? | since k - best extraction involves the recomputation of features to get the component values | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5006 | java | When do that extraction save a lot of time since k - best extraction involves the recomputation of features to get the component values ? | when only the 1 - best string is desired | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5007 | java | What do it write the results ? | to the bufferedwriter passed in | public void lazy K Best Extract On HG ( Hyper Graph hg , int top N , Buffered Writer out ) throws IO Exception { reset State ( ) ; if ( null == hg . goal Node ) return ; for ( int k = NUM ; k <= top N ; k ++ ) { String hyp Str = get Kth Hyp ( hg . goal Node , k ) ; if ( null == hyp Str ) break ; out . write ( hyp Str )... | public void lazyKBestExtractOnHG ( HyperGraph hg , int topN , BufferedWriter out ) throws IOException { resetState ( ) ; if ( null == hg . goalNode ) return ; for ( int k = _NUM ; k <= topN ; k ++ ) { String hypStr = getKthHyp ( hg . goalNode , k ) ; if ( null == hypStr ) break ; out . write ( hypStr ) ; out . write ( ... | 105 |
java-test-5008 | java | What does the code build ? | the pet table definitions | public static Linked Hash Set < Physical Table Definition > build Pet Table Definitions ( Test Dimensions test Dimensions ) { return Utils . as Linked Hash Set ( new Physical Table Definition ( ALL PETS , DAY . build Zoned Time Grain ( Date Time Zone . UTC ) , test Dimensions . get Dimension Configurations By Api Name ... | public static LinkedHashSet < PhysicalTableDefinition > buildPetTableDefinitions ( TestDimensions testDimensions ) { return Utils . asLinkedHashSet ( new PhysicalTableDefinition ( ALL_PETS , DAY . buildZonedTimeGrain ( DateTimeZone . UTC ) , testDimensions . getDimensionConfigurationsByApiName ( BREED , SEX , SPECIES )... | 71 |
java-test-5009 | java | What has layout time changed ? | to a new minute . process effect that might be having on intensity | @ edu . umd . cs . findbugs . annotations . Suppress FB Warnings ( value = STRING , justification = STRING ) protected void new Internal Minute ( ) { double orig Current = m Current Intensity ; int orig State = m State ; int steps = get Number Of Steps ( ) ; if ( ( m Transition Duration > NUM ) && ( steps > NUM ) ) { d... | @ edu . umd . cs . findbugs . annotations . SuppressFBWarnings ( value = STRING , justification = STRING ) protected void newInternalMinute ( ) { double origCurrent = mCurrentIntensity ; int origState = mState ; int steps = getNumberOfSteps ( ) ; if ( ( mTransitionDuration > _NUM ) && ( steps > _NUM ) ) { double stepsP... | 466 |
java-test-5010 | java | What has changed to a new minute . process effect that might be having on intensity ? | layout time | @ edu . umd . cs . findbugs . annotations . Suppress FB Warnings ( value = STRING , justification = STRING ) protected void new Internal Minute ( ) { double orig Current = m Current Intensity ; int orig State = m State ; int steps = get Number Of Steps ( ) ; if ( ( m Transition Duration > NUM ) && ( steps > NUM ) ) { d... | @ edu . umd . cs . findbugs . annotations . SuppressFBWarnings ( value = STRING , justification = STRING ) protected void newInternalMinute ( ) { double origCurrent = mCurrentIntensity ; int origState = mState ; int steps = getNumberOfSteps ( ) ; if ( ( mTransitionDuration > _NUM ) && ( steps > _NUM ) ) { double stepsP... | 466 |
java-test-5011 | java | What did this implementation assume currently ? | there ' s a fixed number of steps between min and max brightness | @ edu . umd . cs . findbugs . annotations . Suppress FB Warnings ( value = STRING , justification = STRING ) protected void new Internal Minute ( ) { double orig Current = m Current Intensity ; int orig State = m State ; int steps = get Number Of Steps ( ) ; if ( ( m Transition Duration > NUM ) && ( steps > NUM ) ) { d... | @ edu . umd . cs . findbugs . annotations . SuppressFBWarnings ( value = STRING , justification = STRING ) protected void newInternalMinute ( ) { double origCurrent = mCurrentIntensity ; int origState = mState ; int steps = getNumberOfSteps ( ) ; if ( ( mTransitionDuration > _NUM ) && ( steps > _NUM ) ) { double stepsP... | 466 |
java-test-5014 | java | What reuses in ultra low memory environments ? | the above method | public static synchronized void index Document ( Code Index Document code Index Document ) throws IO Exception { Queue < Code Index Document > queue = new Concurrent Linked Queue < > ( ) ; queue . add ( code Index Document ) ; index Documents ( queue ) ; queue = null ; } | public static synchronized void indexDocument ( CodeIndexDocument codeIndexDocument ) throws IOException { Queue < CodeIndexDocument > queue = new ConcurrentLinkedQueue < > ( ) ; queue . add ( codeIndexDocument ) ; indexDocuments ( queue ) ; queue = null ; } | 55 |
java-test-5015 | java | How does the above method reuse possibly better in ultra low memory environments ? | by creating a queue with one element | public static synchronized void index Document ( Code Index Document code Index Document ) throws IO Exception { Queue < Code Index Document > queue = new Concurrent Linked Queue < > ( ) ; queue . add ( code Index Document ) ; index Documents ( queue ) ; queue = null ; } | public static synchronized void indexDocument ( CodeIndexDocument codeIndexDocument ) throws IOException { Queue < CodeIndexDocument > queue = new ConcurrentLinkedQueue < > ( ) ; queue . add ( codeIndexDocument ) ; indexDocuments ( queue ) ; queue = null ; } | 55 |
java-test-5024 | java | What does the code update ? | the label field of the invalidtgt | private void update Volume Labels ( Volume trusted Src , Volume invalid Tgt ) { Virtual Array invalid Tgt VA = db Client . query Object ( Virtual Array . class , invalid Tgt . get Virtual Array ( ) ) ; String Builder new Label = new String Builder ( ) ; new Label . append ( trusted Src . get Label ( ) ) ; new Label . a... | private void updateVolumeLabels ( Volume trustedSrc , Volume invalidTgt ) { VirtualArray invalidTgtVA = dbClient . queryObject ( VirtualArray . class , invalidTgt . getVirtualArray ( ) ) ; StringBuilder newLabel = new StringBuilder ( ) ; newLabel . append ( trustedSrc . getLabel ( ) ) ; newLabel . append ( STRING ) ; n... | 432 |
java-test-5025 | java | What does the code update if the volume is fronted by a vplex volume ? | the target vplex volume label | private void update Volume Labels ( Volume trusted Src , Volume invalid Tgt ) { Virtual Array invalid Tgt VA = db Client . query Object ( Virtual Array . class , invalid Tgt . get Virtual Array ( ) ) ; String Builder new Label = new String Builder ( ) ; new Label . append ( trusted Src . get Label ( ) ) ; new Label . a... | private void updateVolumeLabels ( Volume trustedSrc , Volume invalidTgt ) { VirtualArray invalidTgtVA = dbClient . queryObject ( VirtualArray . class , invalidTgt . getVirtualArray ( ) ) ; StringBuilder newLabel = new StringBuilder ( ) ; newLabel . append ( trustedSrc . getLabel ( ) ) ; newLabel . append ( STRING ) ; n... | 432 |
java-test-5027 | java | How does the value of the designated parameter set ? | using the given object | protected void fill Parameter ( Prepared Statement stmt , int idx , Jdbc Type Field field , @ Nullable Object field Val ) throws Cache Exception { try { if ( field Val != null ) { if ( field . get Java Field Type ( ) == UUID . class ) { switch ( field . get Database Field Type ( ) ) { case Types . BINARY : field Val = ... | protected void fillParameter ( PreparedStatement stmt , int idx , JdbcTypeField field , @ Nullable Object fieldVal ) throws CacheException { try { if ( fieldVal != null ) { if ( field . getJavaFieldType ( ) == UUID . class ) { switch ( field . getDatabaseFieldType ( ) ) { case Types . BINARY : fieldVal = U . uuidToByte... | 172 |
java-test-5028 | java | What will readallasync make ? | repeated attempts to read data into the transfer buffers defined in the list of asynctransfer instances | static public long read All Async ( final I Async Opener opener , final List < Async Transfer > transfers ) throws IO Exception { int ntries = NUM ; long total Bytes Read = NUM ; final long total Bytes Expected ; { long n = NUM ; for ( Async Transfer transfer : transfers ) { n += transfer . m bytes To Read ; } total By... | static public long readAllAsync ( final IAsyncOpener opener , final List < AsyncTransfer > transfers ) throws IOException { int ntries = _NUM ; long totalBytesRead = _NUM ; final long totalBytesExpected ; { long n = _NUM ; for ( AsyncTransfer transfer : transfers ) { n += transfer . m_bytesToRead ; } totalBytesExpected... | 425 |
java-test-5029 | java | What defined in the list of asynctransfer instances ? | the transfer buffers | static public long read All Async ( final I Async Opener opener , final List < Async Transfer > transfers ) throws IO Exception { int ntries = NUM ; long total Bytes Read = NUM ; final long total Bytes Expected ; { long n = NUM ; for ( Async Transfer transfer : transfers ) { n += transfer . m bytes To Read ; } total By... | static public long readAllAsync ( final IAsyncOpener opener , final List < AsyncTransfer > transfers ) throws IOException { int ntries = _NUM ; long totalBytesRead = _NUM ; final long totalBytesExpected ; { long n = _NUM ; for ( AsyncTransfer transfer : transfers ) { n += transfer . m_bytesToRead ; } totalBytesExpected... | 425 |
java-test-5030 | java | Where did the transfer buffers define ? | in the list of asynctransfer instances | static public long read All Async ( final I Async Opener opener , final List < Async Transfer > transfers ) throws IO Exception { int ntries = NUM ; long total Bytes Read = NUM ; final long total Bytes Expected ; { long n = NUM ; for ( Async Transfer transfer : transfers ) { n += transfer . m bytes To Read ; } total By... | static public long readAllAsync ( final IAsyncOpener opener , final List < AsyncTransfer > transfers ) throws IOException { int ntries = _NUM ; long totalBytesRead = _NUM ; final long totalBytesExpected ; { long n = _NUM ; for ( AsyncTransfer transfer : transfers ) { n += transfer . m_bytesToRead ; } totalBytesExpected... | 425 |
java-test-5031 | java | What will make repeated attempts to read data into the transfer buffers defined in the list of asynctransfer instances ? | readallasync | static public long read All Async ( final I Async Opener opener , final List < Async Transfer > transfers ) throws IO Exception { int ntries = NUM ; long total Bytes Read = NUM ; final long total Bytes Expected ; { long n = NUM ; for ( Async Transfer transfer : transfers ) { n += transfer . m bytes To Read ; } total By... | static public long readAllAsync ( final IAsyncOpener opener , final List < AsyncTransfer > transfers ) throws IOException { int ntries = _NUM ; long totalBytesRead = _NUM ; final long totalBytesExpected ; { long n = _NUM ; for ( AsyncTransfer transfer : transfers ) { n += transfer . m_bytesToRead ; } totalBytesExpected... | 425 |
java-test-5032 | java | Do readallasync read data into the transfer buffers defined in the list of asynctransfer instances ? | No | static public long read All Async ( final I Async Opener opener , final List < Async Transfer > transfers ) throws IO Exception { int ntries = NUM ; long total Bytes Read = NUM ; final long total Bytes Expected ; { long n = NUM ; for ( Async Transfer transfer : transfers ) { n += transfer . m bytes To Read ; } total By... | static public long readAllAsync ( final IAsyncOpener opener , final List < AsyncTransfer > transfers ) throws IOException { int ntries = _NUM ; long totalBytesRead = _NUM ; final long totalBytesExpected ; { long n = _NUM ; for ( AsyncTransfer transfer : transfers ) { n += transfer . m_bytesToRead ; } totalBytesExpected... | 425 |
java-test-5035 | java | What does the code calculate from the header information ? | the unpadded size of the data segment | long true Data Size ( ) { if ( ! is Valid Header ( ) ) { return NUM ; } int naxis = get Int Value ( NAXIS , NUM ) ; if ( naxis == NUM ) { return NUM ; } get Int Value ( BITPIX ) ; int [ ] axes = new int [ naxis ] ; for ( int axis = NUM ; axis <= naxis ; axis += NUM ) { axes [ axis - NUM ] = get Int Value ( NAXI Sn . n ... | long trueDataSize ( ) { if ( ! isValidHeader ( ) ) { return _NUM ; } int naxis = getIntValue ( NAXIS , _NUM ) ; if ( naxis == _NUM ) { return _NUM ; } getIntValue ( BITPIX ) ; int [ ] axes = new int [ naxis ] ; for ( int axis = _NUM ; axis <= naxis ; axis += _NUM ) { axes [ axis - _NUM ] = getIntValue ( NAXISn . n ( ax... | 233 |
java-test-5036 | java | How do serialization handle ? | a little bit better | private void read Object ( Object Input Stream in ) throws IO Exception , Class Not Found Exception { in . default Read Object ( ) ; i18 n = Environment . get I 18 n ( ) ; bean Context Child Support = new Bean Context Child Support ( this ) ; } | private void readObject ( ObjectInputStream in ) throws IOException , ClassNotFoundException { in . defaultReadObject ( ) ; i18n = Environment . getI18n ( ) ; beanContextChildSupport = new BeanContextChildSupport ( this ) ; } | 54 |
java-test-5037 | java | In which direction is each stage hashed ? | to one of the b buckets | public final int [ ] hash Signature ( final int [ ] signature ) { int [ ] hash = new int [ stages ] ; int rows = signature . length / stages ; for ( int i = NUM ; i < signature . length ; i ++ ) { int stage = Math . min ( i / rows , stages - NUM ) ; hash [ stage ] = ( int ) ( ( hash [ stage ] + ( long ) signature [ i ]... | public final int [ ] hashSignature ( final int [ ] signature ) { int [ ] hash = new int [ stages ] ; int rows = signature . length / stages ; for ( int i = _NUM ; i < signature . length ; i ++ ) { int stage = Math . min ( i / rows , stages - _NUM ) ; hash [ stage ] = ( int ) ( ( hash [ stage ] + ( long ) signature [ i ... | 103 |
java-test-5039 | java | What will this method not issue to the sax listener in contrast to the traverse ( ) method ? | startdocument ( ) and enddocument ( ) events | public void traverse Fragment ( Node pos ) throws org . xml . sax . SAX Exception { Node top = pos ; while ( null != pos ) { start Node ( pos ) ; Node next Node = pos . get First Child ( ) ; while ( null == next Node ) { end Node ( pos ) ; if ( top . equals ( pos ) ) break ; next Node = pos . get Next Sibling ( ) ; if ... | public void traverseFragment ( Node pos ) throws org . xml . sax . SAXException { Node top = pos ; while ( null != pos ) { startNode ( pos ) ; Node nextNode = pos . getFirstChild ( ) ; while ( null == nextNode ) { endNode ( pos ) ; if ( top . equals ( pos ) ) break ; nextNode = pos . getNextSibling ( ) ; if ( null == n... | 149 |
java-test-5040 | java | Will this method issue startdocument ( ) and enddocument ( ) events to the sax listener in contrast to the traverse ( ) method ? | No | public void traverse Fragment ( Node pos ) throws org . xml . sax . SAX Exception { Node top = pos ; while ( null != pos ) { start Node ( pos ) ; Node next Node = pos . get First Child ( ) ; while ( null == next Node ) { end Node ( pos ) ; if ( top . equals ( pos ) ) break ; next Node = pos . get Next Sibling ( ) ; if ... | public void traverseFragment ( Node pos ) throws org . xml . sax . SAXException { Node top = pos ; while ( null != pos ) { startNode ( pos ) ; Node nextNode = pos . getFirstChild ( ) ; while ( null == nextNode ) { endNode ( pos ) ; if ( top . equals ( pos ) ) break ; nextNode = pos . getNextSibling ( ) ; if ( null == n... | 149 |
java-test-5041 | java | What does the code perform ? | a pre - order traversal non - recursive style | public void traverse Fragment ( Node pos ) throws org . xml . sax . SAX Exception { Node top = pos ; while ( null != pos ) { start Node ( pos ) ; Node next Node = pos . get First Child ( ) ; while ( null == next Node ) { end Node ( pos ) ; if ( top . equals ( pos ) ) break ; next Node = pos . get Next Sibling ( ) ; if ... | public void traverseFragment ( Node pos ) throws org . xml . sax . SAXException { Node top = pos ; while ( null != pos ) { startNode ( pos ) ; Node nextNode = pos . getFirstChild ( ) ; while ( null == nextNode ) { endNode ( pos ) ; if ( top . equals ( pos ) ) break ; nextNode = pos . getNextSibling ( ) ; if ( null == n... | 149 |
java-test-5042 | java | What is using to eliminate the deprecation warning ? | a java . io . bufferedreader | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5043 | java | What did we use originally ? | the method itself | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5044 | java | What do alan brighton suggest ? | using a java . io . bufferedreader to eliminate the deprecation warning | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5045 | java | When do we note that this doesn ' t work . we now use a simple method that largely ignores character encodings and only uses the " \ n " as the line separator . this method is slow regardless ? | more recently | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5046 | java | Where is this method slow regardless ? | in the current version | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5047 | java | What does a simple method ignore largely ? | character encodings | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5048 | java | What do we note more recently ? | that this doesn ' t work . we now use a simple method that largely ignores character encodings and only uses the " \ n " as the line separator . this method is slow regardless | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5049 | java | What did a java . io . bufferedreader use ? | to eliminate the deprecation warning | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5050 | java | What does a simple method use as the line separator largely largely ? | the " \ n " | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5051 | java | What suggested using a java . io . bufferedreader to eliminate the deprecation warning ? | alan brighton | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5052 | java | What did we use now ? | a simple method that largely ignores character encodings and only uses the " \ n " as the line separator | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5058 | java | What does the code create ? | the command string for deleting file system mount | public String format Un Mount Cmd ( String data Mover , String path , String protocol ) { String Builder cmd = new String Builder ( ) ; cmd . append ( STRING ) ; cmd . append ( data Mover ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( path ) ; return cmd . to String ( )... | public String formatUnMountCmd ( String dataMover , String path , String protocol ) { StringBuilder cmd = new StringBuilder ( ) ; cmd . append ( STRING ) ; cmd . append ( dataMover ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( path ) ; return cmd . toString ( ) ; } | 80 |
java-test-5059 | java | What does the code load ? | the zone info map | private static Map < String , Object > load Zone Info Map ( Input Stream in ) throws IO Exception { Map < String , Object > map = new Concurrent Hash Map < String , Object > ( ) ; Data Input Stream din = new Data Input Stream ( in ) ; try { read Zone Info Map ( din , map ) ; } finally { try { din . close ( ) ; } catch ... | private static Map < String , Object > loadZoneInfoMap ( InputStream in ) throws IOException { Map < String , Object > map = new ConcurrentHashMap < String , Object > ( ) ; DataInputStream din = new DataInputStream ( in ) ; try { readZoneInfoMap ( din , map ) ; } finally { try { din . close ( ) ; } catch ( IOException ... | 114 |
java-test-5060 | java | What is these parameters determine effectively ? | how close to their start points the line segments intersect | public static Point 2 D intersect Param ( Point 2 D u0 , Point 2 D v0 , Point 2 D u1 , Point 2 D v1 ) { double det = determinant 2 by 2 ( v1 , v0 ) ; if ( Double . is Na N ( det ) || det == NUM ) { return null ; } double x00 = u0 . get X ( ) ; double y00 = u0 . get Y ( ) ; double x10 = u1 . get X ( ) ; double y10 = u1 ... | public static Point2D intersectParam ( Point2D u0 , Point2D v0 , Point2D u1 , Point2D v1 ) { double det = determinant2by2 ( v1 , v0 ) ; if ( Double . isNaN ( det ) || det == _NUM ) { return null ; } double x00 = u0 . getX ( ) ; double y00 = u0 . getY ( ) ; double x10 = u1 . getX ( ) ; double y10 = u1 . getY ( ) ; doubl... | 218 |
java-test-5061 | java | What contains taxonomy information ? | the supplied reader | public static boolean has Taxonomy Info ( Sequences Reader reader ) { final File taxon File = new File ( reader . path ( ) , TAXONOMY FILE ) ; final File mapping File = new File ( reader . path ( ) , TAXONOMY TO SEQUENCE FILE ) ; if ( taxon File . exists ( ) && mapping File . exists ( ) ) { return BOOL ; } else if ( ta... | public static boolean hasTaxonomyInfo ( SequencesReader reader ) { final File taxonFile = new File ( reader . path ( ) , TAXONOMY_FILE ) ; final File mappingFile = new File ( reader . path ( ) , TAXONOMY_TO_SEQUENCE_FILE ) ; if ( taxonFile . exists ( ) && mappingFile . exists ( ) ) { return _BOOL ; } else if ( taxonFil... | 107 |
java-test-5062 | java | What does the supplied reader contain ? | taxonomy information | public static boolean has Taxonomy Info ( Sequences Reader reader ) { final File taxon File = new File ( reader . path ( ) , TAXONOMY FILE ) ; final File mapping File = new File ( reader . path ( ) , TAXONOMY TO SEQUENCE FILE ) ; if ( taxon File . exists ( ) && mapping File . exists ( ) ) { return BOOL ; } else if ( ta... | public static boolean hasTaxonomyInfo ( SequencesReader reader ) { final File taxonFile = new File ( reader . path ( ) , TAXONOMY_FILE ) ; final File mappingFile = new File ( reader . path ( ) , TAXONOMY_TO_SEQUENCE_FILE ) ; if ( taxonFile . exists ( ) && mappingFile . exists ( ) ) { return _BOOL ; } else if ( taxonFil... | 107 |
java-test-5064 | java | What does the code remove from the given subtree ? | the largest key and associated value | private Node delete Max ( Node x ) { if ( x . right == null ) return x . left ; x . right = delete Max ( x . right ) ; x . size = NUM + size ( x . left ) + size ( x . right ) ; x . height = NUM + Math . max ( height ( x . left ) , height ( x . right ) ) ; return balance ( x ) ; } | private Node deleteMax ( Node x ) { if ( x . right == null ) return x . left ; x . right = deleteMax ( x . right ) ; x . size = _NUM + size ( x . left ) + size ( x . right ) ; x . height = _NUM + Math . max ( height ( x . left ) , height ( x . right ) ) ; return balance ( x ) ; } | 86 |
java-test-5066 | java | Where should the point be considered ? | in or out of the polygon | private static Boolean is Inside Polygon ( final Geo Point point , final List < Geo Point > poly Points ) { final double latitude = point . get Latitude ( ) ; final double longitude = point . get Longitude ( ) ; final double sin Latitude = Math . sin ( latitude ) ; final double cos Latitude = Math . cos ( latitude ) ; ... | private static Boolean isInsidePolygon ( final GeoPoint point , final List < GeoPoint > polyPoints ) { final double latitude = point . getLatitude ( ) ; final double longitude = point . getLongitude ( ) ; final double sinLatitude = Math . sin ( latitude ) ; final double cosLatitude = Math . cos ( latitude ) ; final dou... | 403 |
java-test-5067 | java | For what purpose do based on point order whether the point should be considered in or out of the polygon determine ? | for a specified point and a list of poly points | private static Boolean is Inside Polygon ( final Geo Point point , final List < Geo Point > poly Points ) { final double latitude = point . get Latitude ( ) ; final double longitude = point . get Longitude ( ) ; final double sin Latitude = Math . sin ( latitude ) ; final double cos Latitude = Math . cos ( latitude ) ; ... | private static Boolean isInsidePolygon ( final GeoPoint point , final List < GeoPoint > polyPoints ) { final double latitude = point . getLatitude ( ) ; final double longitude = point . getLongitude ( ) ; final double sinLatitude = Math . sin ( latitude ) ; final double cosLatitude = Math . cos ( latitude ) ; final dou... | 403 |
java-test-5070 | java | What is starting at path ? | sub - tree | public void update Sub Tree Checking Consistency ( Tree Path path ) { if ( is Path Greyed ( path ) ) { for ( Tree Path child Path : get Children Path ( path ) ) { update Sub Tree Checking Consistency ( child Path ) ; } update Path Greyness ( path ) ; } else { if ( is Path Checked ( path ) ) { check Sub Tree ( path ) ; ... | public void updateSubTreeCheckingConsistency ( TreePath path ) { if ( isPathGreyed ( path ) ) { for ( TreePath childPath : getChildrenPath ( path ) ) { updateSubTreeCheckingConsistency ( childPath ) ; } updatePathGreyness ( path ) ; } else { if ( isPathChecked ( path ) ) { checkSubTree ( path ) ; } else { uncheckSubTre... | 91 |
java-test-5071 | java | When do offers need a warning ? | before expiring | private void check Warnings ( ) { List < Offer > list = market . get Offers Older Than ( TIME TO WARNING ) ; long time = System . current Time Millis ( ) ; for ( Offer offer : list ) { long time Diff = time - time Stamp ; if ( time Stamp != NUM && ( ( time - offer . get Timestamp ( ) - TIME TO WARNING * NUM ) > time Di... | private void checkWarnings ( ) { List < Offer > list = market . getOffersOlderThan ( TIME_TO_WARNING ) ; long time = System . currentTimeMillis ( ) ; for ( Offer offer : list ) { long timeDiff = time - timeStamp ; if ( timeStamp != _NUM && ( ( time - offer . getTimestamp ( ) - TIME_TO_WARNING * _NUM ) > timeDiff ) ) { ... | 191 |
java-test-5072 | java | What computes in two passes ( one forward , one reverse over the instructions from start to end ? | control and barrier ( acquire / release ) dependences | private void compute Control And Barrier Dependences ( Instruction start , Instruction end ) { Dep Graph Node last Total Barrier = null ; Dep Graph Node last GC Barrier = null ; Dep Graph Node last Acquire = null ; for ( Dep Graph Node pnode = ( Dep Graph Node ) first Node ( ) ; pnode != null ; pnode = ( Dep Graph Node... | private void computeControlAndBarrierDependences ( Instruction start , Instruction end ) { DepGraphNode lastTotalBarrier = null ; DepGraphNode lastGCBarrier = null ; DepGraphNode lastAcquire = null ; for ( DepGraphNode pnode = ( DepGraphNode ) firstNode ( ) ; pnode != null ; pnode = ( DepGraphNode ) pnode . getNext ( )... | 491 |
java-test-5073 | java | Where do control and barrier ( acquire / release ) dependences compute ? | in two passes ( one forward , one reverse over the instructions from start to end | private void compute Control And Barrier Dependences ( Instruction start , Instruction end ) { Dep Graph Node last Total Barrier = null ; Dep Graph Node last GC Barrier = null ; Dep Graph Node last Acquire = null ; for ( Dep Graph Node pnode = ( Dep Graph Node ) first Node ( ) ; pnode != null ; pnode = ( Dep Graph Node... | private void computeControlAndBarrierDependences ( Instruction start , Instruction end ) { DepGraphNode lastTotalBarrier = null ; DepGraphNode lastGCBarrier = null ; DepGraphNode lastAcquire = null ; for ( DepGraphNode pnode = ( DepGraphNode ) firstNode ( ) ; pnode != null ; pnode = ( DepGraphNode ) pnode . getNext ( )... | 491 |
java-test-5074 | java | What creates in this group container ? | sub groupcontainers | public Set create Sub Group Containers ( Set group Container Names ) throws AM Exception , SSO Exception { Iterator iter = group Container Names . iterator ( ) ; Set group Containers = new Hash Set ( ) ; while ( iter . has Next ( ) ) { String group Container DN = AM Naming Attr Manager . get Naming Attr ( GROUP CONTAIN... | public Set createSubGroupContainers ( Set groupContainerNames ) throws AMException , SSOException { Iterator iter = groupContainerNames . iterator ( ) ; Set groupContainers = new HashSet ( ) ; while ( iter . hasNext ( ) ) { String groupContainerDN = AMNamingAttrManager . getNamingAttr ( GROUP_CONTAINER ) + STRING + ( (... | 131 |
java-test-5075 | java | What do it have ? | index > = min | private boolean remove Task ( Task t , int min ) { for ( int i = tasks . size ( ) ; -- i >= min ; ) { if ( tasks . get ( i ) == t ) { tasks . remove ( i ) ; if ( i < first Pending ) { first Pending -- ; for ( int j = threads . size ( ) ; -- j >= NUM ; ) { Task Thread thread = threads . get ( j ) ; if ( thread . task ==... | private boolean removeTask ( Task t , int min ) { for ( int i = tasks . size ( ) ; -- i >= min ; ) { if ( tasks . get ( i ) == t ) { tasks . remove ( i ) ; if ( i < firstPending ) { firstPending -- ; for ( int j = threads . size ( ) ; -- j >= _NUM ; ) { TaskThread thread = threads . get ( j ) ; if ( thread . task == t ... | 130 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.