Question:
What operates the txstate ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: this thread


Question:
Where does this thread operate ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: the txstate


Question:
Should some messages like sizemessage create a new txstate ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: No


Question:
Does this thread operate the txstate ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: Yes


Question:
Does the code associate the remote txstate with the thread processing this message ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: Yes


Question:
Do we acquire a lock on the txstate , on which this thread operates ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: Yes


Question:
Does the code associate with the thread processing this message the remote txstate ?
```java
public TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }
```

Answer: Yes


Question:
For what purpose do http : / / www . idrsolutions . com / access - pdf - viewer - features - from - your - code see ?
```java
@ Override @ Suppress Warnings ( STRING ) public Object execute Command ( final int command ID , final Object [ ] args ) { if ( ! is Setup ) { throw new Runtime Exception ( STRING ) ; } return current Commands . execute Command ( command ID , args ) ; }
```

Answer: for full


Question:
Do a vector3 contain the smallest x , y , and z values ?
```java
public static Vector 3 min ( Vector 3 o1 , Vector 3 o2 ) { return new Vector 3 ( Math . min ( o1 . x , o2 . x ) , Math . min ( o1 . y , o2 . y ) , Math . min ( o1 . z , o2 . z ) ) ; }
```

Answer: Yes


Question:
Does the code encode the algorithm identifier in der form to the stream ?
```java
public void encode ( Output Stream out ) throws IO Exception { Der Output Stream tmp = new Der Output Stream ( ) ; alg Id . encode ( tmp ) ; out . write ( tmp . to Byte Array ( ) ) ; }
```

Answer: Yes


Question:
When do _ autoengineer become null ?
```java
protected void wait Until Stopped ( ) { boolean done Waiting = BOOL ; while ( ! done Waiting ) { if ( auto Engineer != null ) { done Waiting = auto Engineer . is Stopped ( ) ; } else { done Waiting = BOOL ; } if ( ! done Waiting ) { try { Thread . sleep ( NUM ) ; } catch ( Interrupted Exception e ) { } } } }
```

Answer: during wait


Question:
Is player considered in combat if he ' s been attacked or has attacked less or equal 10s before ?
```java
public boolean is In Combat ( ) { return ( ( ( System . current Time Millis ( ) - last Attacked Milis ) <= NUM ) || ( ( System . current Time Millis ( ) - last Attack Milis ) <= NUM ) ) ; }
```

Answer: Yes


Question:
Has he attacked less or equal 10s before ?
```java
public boolean is In Combat ( ) { return ( ( ( System . current Time Millis ( ) - last Attacked Milis ) <= NUM ) || ( ( System . current Time Millis ( ) - last Attack Milis ) <= NUM ) ) ; }
```

Answer: Yes


Question:
Does the code create a d3d - based backbuffer ?
```java
@ Override public Volatile Image create Back Buffer ( W Component Peer peer ) { Component target = ( Component ) peer . get Target ( ) ; int w = Math . max ( NUM , target . get Width ( ) ) ; int h = Math . max ( NUM , target . get Height ( ) ) ; return new Sun Volatile Image ( target , w , h , Boolean . TRUE ) ; }
```

Answer: Yes


Question:
Does the code return the image wrapper ?
```java
@ Override public Volatile Image create Back Buffer ( W Component Peer peer ) { Component target = ( Component ) peer . get Target ( ) ; int w = Math . max ( NUM , target . get Width ( ) ) ; int h = Math . max ( NUM , target . get Height ( ) ) ; return new Sun Volatile Image ( target , w , h , Boolean . TRUE ) ; }
```

Answer: Yes


Question:
Does an intent create a shortcut to launch the provided script in a terminal ?
```java
public static Intent build Terminal Shortcut Intent ( File script , Parcelable icon Resource ) { Intent intent = new Intent ( ) ; intent . put Extra ( Intent . EXTRA SHORTCUT INTENT , build Start In Terminal Intent ( script ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT NAME , script . get Name ( ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT ICON RESOURCE , icon Resource ) ; return intent ; }
```

Answer: Yes


Question:
Do the provided script launch in a terminal a shortcut ?
```java
public static Intent build Terminal Shortcut Intent ( File script , Parcelable icon Resource ) { Intent intent = new Intent ( ) ; intent . put Extra ( Intent . EXTRA SHORTCUT INTENT , build Start In Terminal Intent ( script ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT NAME , script . get Name ( ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT ICON RESOURCE , icon Resource ) ; return intent ; }
```

Answer: Yes


Question:
Does the code create a spider with pageprocessor ?
```java
public static Spider create ( Page Processor page Processor ) { return new Spider ( page Processor ) ; }
```

Answer: Yes


Question:
Does the code add an exceptional successor ?
```java
public void add Exceptional Successor ( Block Impl b , Type Mirror cause ) { if ( exceptional Successors == null ) { exceptional Successors = new Hash Map < > ( ) ; } Set < Block > blocks = exceptional Successors . get ( cause ) ; if ( blocks == null ) { blocks = new Hash Set < Block > ( ) ; exceptional Successors . put ( cause , blocks ) ; } blocks . add ( b ) ; b . add Predecessor ( this ) ; }
```

Answer: Yes


Question:
Do most other rolls have a minimum value of zero ?
```java
public MM Roll ( MM Random rng , int max ) { super ( max , NUM ) ; this . total = rng . random Int ( this . faces ) + this . min ; all . add Element ( this . total ) ; }
```

Answer: Yes


Question:
Does the code load the handles database from disk ?
```java
public void load ( Input Stream in Stream ) throws IO Exception { Properties properties = new Properties ( ) ; properties . load ( in Stream ) ; for ( Map . Entry < Object , Object > property : properties . entry Set ( ) ) { String handle Id = ( String ) property . get Key ( ) ; String value = ( String ) property . get Value ( ) ; Property Table handle Properties = new Property Table ( ) ; JSON Object json Object = ( JSON Object ) JSON Value . parse ( value ) ; if ( json Object != null ) { handle Properties . put All ( json Object ) ; } Handle handle = new Handle ( ) ; handle . set Id ( handle Id ) ; handle . set Properties ( handle Properties ) ; handles . put ( handle Id , handle ) ; } }
```

Answer: Yes


Question:
In which direction does the code load the handles database ?
```java
public void load ( Input Stream in Stream ) throws IO Exception { Properties properties = new Properties ( ) ; properties . load ( in Stream ) ; for ( Map . Entry < Object , Object > property : properties . entry Set ( ) ) { String handle Id = ( String ) property . get Key ( ) ; String value = ( String ) property . get Value ( ) ; Property Table handle Properties = new Property Table ( ) ; JSON Object json Object = ( JSON Object ) JSON Value . parse ( value ) ; if ( json Object != null ) { handle Properties . put All ( json Object ) ; } Handle handle = new Handle ( ) ; handle . set Id ( handle Id ) ; handle . set Properties ( handle Properties ) ; handles . put ( handle Id , handle ) ; } }
```

Answer: from disk


Question:
Do resetting a custom model initialize the model to its state when it was first created ?
```java
public Service Call < Void > reset Customization ( String customization Id ) { Validator . not Null ( customization Id , STRING ) ; Request Builder request Builder = Request Builder . post ( String . format ( PATH RESET , customization Id ) ) ; return create Service Call ( request Builder . build ( ) , Response Converter Utils . get Void ( ) ) ; }
```

Answer: Yes


Question:
Does the code join the given list of strings using the given delimiter delim ?
```java
public String join ( List < String > list , String delim ) { String Builder sb = new String Builder ( ) ; String loop Delim = STRING ; for ( String s : list ) { sb . append ( loop Delim ) ; sb . append ( s ) ; loop Delim = delim ; } return sb . to String ( ) ; }
```

Answer: Yes


Question:
Does a position have an altitude value ?
```java
public boolean has Altitude ( ) { return ! Double . is Na N ( altitude ) ; }
```

Answer: Yes


Question:
Has the table name exist in the table_schema already ?
```java
private boolean is Value Exists ( Cursor cursor , String table Name ) { boolean exist = BOOL ; if ( cursor . move To First ( ) ) { do { String name = cursor . get String ( cursor . get Column Index Or Throw ( Const . Table Schema . COLUMN NAME ) ) ; if ( name . equals Ignore Case ( table Name ) ) { exist = BOOL ; break ; } } while ( cursor . move To Next ( ) ) ; } return exist ; }
```

Answer: Yes


Question:
Do downstream tools store it into a introspection file ?
```java
public void add Comment ( String line ) { comments . add ( line ) ; }
```

Answer: Yes


Question:
Do downstream tools use the d - bus model ?
```java
public void add Comment ( String line ) { comments . add ( line ) ; }
```

Answer: Yes


Question:
Does the code add a comment line to a d - bus model ?
```java
public void add Comment ( String line ) { comments . add ( line ) ; }
```

Answer: Yes


Question:
Do downstream tools generate code ?
```java
public void add Comment ( String line ) { comments . add ( line ) ; }
```

Answer: Yes


Question:
Does the code handle the response data for creating a simple resource with content ?
```java
private void handle Simple Resource ( final String target Uri , final Handler < Resource Node > handler , final Buffer data , final String e Tag ) { String resource Name = Expansion Delta Util . extract Collection From Path ( target Uri ) ; if ( log . is Trace Enabled ( ) ) { log . trace ( STRING + resource Name ) ; } handler . handle ( new Resource Node ( resource Name , data , e Tag , target Uri ) ) ; }
```

Answer: Yes


Question:
Does the code add a new match to the repository ?
```java
@ Override public void add Match ( final String match , final T value , final boolean immutable Match ) { add Match ( match , value , immutable Match , BOOL ) ; }
```

Answer: Yes


Question:
Does the user open a file ?
```java
void open ( ) { if ( ! main Frame . can Navigate Away ( ) ) { return ; } if ( ask To Save ( ) ) { return ; } boolean loading = BOOL ; Save Type file Type ; try Again : while ( loading ) { int value = save Open File Chooser . show Open Dialog ( main Frame ) ; if ( value != J File Chooser . APPROVE OPTION ) { return ; } loading = BOOL ; file Type = convert Filter To Type ( save Open File Chooser . get File Filter ( ) ) ; final File f = save Open File Chooser . get Selected File ( ) ; if ( ! file Type . is Valid ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING , STRING , J Option Pane . WARNING MESSAGE ) ; loading = BOOL ; continue ; } switch ( file Type ) { case XML ANALYSIS : if ( ! f . get Name ( ) . ends With ( STRING ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , L10 N . get Local String ( STRING , STRING ) ) ; loading = BOOL ; continue try Again ; } if ( ! main Frame . open Analysis ( f , file Type ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBP FILE : if ( ! open FBP File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBA FILE : if ( ! open FBA File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; default : assert BOOL ; } } }
```

Answer: Yes


Question:
Does the user want to open a file when ?
```java
void open ( ) { if ( ! main Frame . can Navigate Away ( ) ) { return ; } if ( ask To Save ( ) ) { return ; } boolean loading = BOOL ; Save Type file Type ; try Again : while ( loading ) { int value = save Open File Chooser . show Open Dialog ( main Frame ) ; if ( value != J File Chooser . APPROVE OPTION ) { return ; } loading = BOOL ; file Type = convert Filter To Type ( save Open File Chooser . get File Filter ( ) ) ; final File f = save Open File Chooser . get Selected File ( ) ; if ( ! file Type . is Valid ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING , STRING , J Option Pane . WARNING MESSAGE ) ; loading = BOOL ; continue ; } switch ( file Type ) { case XML ANALYSIS : if ( ! f . get Name ( ) . ends With ( STRING ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , L10 N . get Local String ( STRING , STRING ) ) ; loading = BOOL ; continue try Again ; } if ( ! main Frame . open Analysis ( f , file Type ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBP FILE : if ( ! open FBP File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBA FILE : if ( ! open FBA File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; default : assert BOOL ; } } }
```

Answer: Yes


Question:
Have two containers contain same things ?
```java
public boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }
```

Answer: Yes


Question:
What have contain same things ?
```java
public boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }
```

Answer: two containers


Question:
Can tests if two containers have contain same things . be used to answer the alias query ?
```java
public boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }
```

Answer: Yes


Question:
What have two containers contain ?
```java
public boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }
```

Answer: same things


Question:
Be vincenty be the geographic pole at any distance short of antipodal standpoint / forepoint ?
```java
public static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }
```

Answer: No


Question:
Does the code compute the distance between two points on an ellipsoid iteratively ?
```java
public static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }
```

Answer: Yes


Question:
How does the code compute the distance between two points on an ellipsoid ?
```java
public static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }
```

Answer: iteratively


Question:
What be not the geographic pole at any distance short of antipodal standpoint / forepoint ?
```java
public static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }
```

Answer: vincenty


Question:
Does the statement push the topology ( if not null ) to it when entering the scope ?
```java
@ Override public void enter Scope ( final I Scope scope ) { super . enter Scope ( scope ) ; final I Topology topo = Cast . as Topology ( scope , topology . value ( scope ) ) ; if ( topo != null ) { previous . set ( scope . set Topology ( topo ) ) ; } }
```

Answer: Yes


Question:
Does the statement remember the one that was previously pushed when entering the scope ?
```java
@ Override public void enter Scope ( final I Scope scope ) { super . enter Scope ( scope ) ; final I Topology topo = Cast . as Topology ( scope , topology . value ( scope ) ) ; if ( topo != null ) { previous . set ( scope . set Topology ( topo ) ) ; } }
```

Answer: Yes


Question:
Does the code get the singleton object ?
```java
public static Safe Android Classes And Methods v ( ) { if ( v == null ) v = new Safe Android Classes And Methods ( ) ; return v ; }
```

Answer: Yes


Question:
Do a train run the end of the stream for each message i d at ?
```java
@ Override public void end Of Stream ( ) throws Ade Exception , Ade Flow Exception { for ( Entry < String , Perodicity Bounder > last : m last Seen . entry Set ( ) ) { final Perodicity Bounder pb = last . get Value ( ) ; pb . train ( last . get Key ( ) ) ; } m trained = BOOL ; }
```

Answer: Yes


Question:
What runs the end of the stream ?
```java
@ Override public void end Of Stream ( ) throws Ade Exception , Ade Flow Exception { for ( Entry < String , Perodicity Bounder > last : m last Seen . entry Set ( ) ) { final Perodicity Bounder pb = last . get Value ( ) ; pb . train ( last . get Key ( ) ) ; } m trained = BOOL ; }
```

Answer: a train


Question:
Will this function parse that to determine what dataobject it should be associated with and its units ?
```java
private Map < String , Metric Header Info > process CSV File Data Header ( Db Client db Client , Storage System storage System , String director Name , List < String > headers ) { Map < String , Metric Header Info > metric To Object Map = new Hash Map < > ( ) ; for ( String header : headers ) { Matcher matcher = METRIC NAME PATTERN . matcher ( header ) ; if ( matcher . matches ( ) ) { String name = matcher . group ( NUM ) ; if ( ! METRICS NAMES TO GATHER . contains ( name ) ) { continue ; } String object Name = matcher . group ( NUM ) ; String units = matcher . group ( NUM ) ; if ( Strings . is Null Or Empty ( object Name ) ) { object Name = EMPTY ; } Storage HA Domain vplex Director = lookup V Plex Director By Name ( db Client , storage System , director Name ) ; if ( object Name . equals ( EMPTY ) ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . DIRECTOR ; header Info . director = vplex Director ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } else { Storage Port storage Port = lookup V Plex Front Storage Port By Name ( db Client , vplex Director , object Name ) ; if ( storage Port != null ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . PORT ; header Info . director = vplex Director ; header Info . port = storage Port ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } } } } return metric To Object Map ; }
```

Answer: Yes


Question:
Do this function determine ?
```java
private Map < String , Metric Header Info > process CSV File Data Header ( Db Client db Client , Storage System storage System , String director Name , List < String > headers ) { Map < String , Metric Header Info > metric To Object Map = new Hash Map < > ( ) ; for ( String header : headers ) { Matcher matcher = METRIC NAME PATTERN . matcher ( header ) ; if ( matcher . matches ( ) ) { String name = matcher . group ( NUM ) ; if ( ! METRICS NAMES TO GATHER . contains ( name ) ) { continue ; } String object Name = matcher . group ( NUM ) ; String units = matcher . group ( NUM ) ; if ( Strings . is Null Or Empty ( object Name ) ) { object Name = EMPTY ; } Storage HA Domain vplex Director = lookup V Plex Director By Name ( db Client , storage System , director Name ) ; if ( object Name . equals ( EMPTY ) ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . DIRECTOR ; header Info . director = vplex Director ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } else { Storage Port storage Port = lookup V Plex Front Storage Port By Name ( db Client , vplex Director , object Name ) ; if ( storage Port != null ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . PORT ; header Info . director = vplex Director ; header Info . port = storage Port ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } } } } return metric To Object Map ; }
```

Answer: Yes


Question:
Will headers contain each of the strings delimited by ?
```java
private Map < String , Metric Header Info > process CSV File Data Header ( Db Client db Client , Storage System storage System , String director Name , List < String > headers ) { Map < String , Metric Header Info > metric To Object Map = new Hash Map < > ( ) ; for ( String header : headers ) { Matcher matcher = METRIC NAME PATTERN . matcher ( header ) ; if ( matcher . matches ( ) ) { String name = matcher . group ( NUM ) ; if ( ! METRICS NAMES TO GATHER . contains ( name ) ) { continue ; } String object Name = matcher . group ( NUM ) ; String units = matcher . group ( NUM ) ; if ( Strings . is Null Or Empty ( object Name ) ) { object Name = EMPTY ; } Storage HA Domain vplex Director = lookup V Plex Director By Name ( db Client , storage System , director Name ) ; if ( object Name . equals ( EMPTY ) ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . DIRECTOR ; header Info . director = vplex Director ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } else { Storage Port storage Port = lookup V Plex Front Storage Port By Name ( db Client , vplex Director , object Name ) ; if ( storage Port != null ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . PORT ; header Info . director = vplex Director ; header Info . port = storage Port ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } } } } return metric To Object Map ; }
```

Answer: Yes


Question:
Does the code create a new empty keyset ?
```java
public Key Set ( ) { this . keys = new Linked List < > ( ) ; this . lookup = new Tree Map < > ( ) ; }
```

Answer: Yes


Question:
Have we pushed the bottom element off the bottom of the screen when we did not need to ?
```java
private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }
```

Answer: Yes


Question:
Have we dragged the bottom of the list too low ?
```java
private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }
```

Answer: Yes


Question:
What did we not need when ?
```java
private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }
```

Answer: to


Question:
Did we need to when ?
```java
private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }
```

Answer: No


Question:
Does the code create a polyline / polygon shape from a set of points ?
```java
protected Shape create Shape ( int [ ] x Points , int [ ] y Points , int n Points , boolean close , boolean biased ) { float offset = biased ? ( float ) bias : NUM ; General Path path = new General Path ( General Path . WIND EVEN ODD ) ; if ( n Points > NUM ) { path . move To ( x Points [ NUM ] + offset , y Points [ NUM ] + offset ) ; int last X = x Points [ NUM ] ; int last Y = y Points [ NUM ] ; if ( close && ( Math . abs ( x Points [ n Points - NUM ] - last X ) < NUM ) && ( Math . abs ( y Points [ n Points - NUM ] - last Y ) < NUM ) ) { n Points -- ; } for ( int i = NUM ; i < n Points ; i ++ ) { if ( ( Math . abs ( x Points [ i ] - last X ) > NUM ) || ( Math . abs ( y Points [ i ] - last Y ) > NUM ) ) { path . line To ( x Points [ i ] + offset , y Points [ i ] + offset ) ; last X = x Points [ i ] ; last Y = y Points [ i ] ; } } if ( close ) path . close Path ( ) ; } return path ; }
```

Answer: Yes


Question:
Did extra code info give in the given stream ?
```java
private static void write Extra Codes ( int char Offset , byte [ ] bytes , byte extra Code Modifier , Extra Codes Stream extra Codes ) throws IO Exception { int num Chars = extra Codes . get Num Chars ( ) ; if ( num Chars < char Offset ) { int fill Chars = char Offset - num Chars ; extra Codes . write Fill ( fill Chars , INTERNATIONAL EXTRA PLACEHOLDER ) ; extra Codes . increment Num Chars ( fill Chars ) ; } if ( bytes != null ) { extra Codes . write ( bytes ) ; extra Codes . increment Num Chars ( NUM ) ; } else { int last Idx = extra Codes . get Length ( ) - NUM ; if ( last Idx >= NUM ) { byte last Byte = extra Codes . get ( last Idx ) ; last Byte += extra Code Modifier ; extra Codes . set ( last Idx , last Byte ) ; } else { extra Codes . write ( extra Code Modifier ) ; extra Codes . set Unprintable Prefix Len ( NUM ) ; } } }
```

Answer: Yes


Question:
Does the code translate a disassembled program to reil code ?
```java
public Reil Program < Instruction Type > translate ( final I Translation Environment environment , final List < ? extends I Block Container < Instruction Type > > functions ) throws Internal Translation Exception { Preconditions . check Not Null ( environment , STRING ) ; final Reil Program < Instruction Type > program = new Reil Program < Instruction Type > ( ) ; for ( final I Block Container < Instruction Type > function : functions ) { program . add Function ( function , translate ( environment , function ) ) ; } return program ; }
```

Answer: Yes


Question:
Does the code translate to reil code a disassembled program ?
```java
public Reil Program < Instruction Type > translate ( final I Translation Environment environment , final List < ? extends I Block Container < Instruction Type > > functions ) throws Internal Translation Exception { Preconditions . check Not Null ( environment , STRING ) ; final Reil Program < Instruction Type > program = new Reil Program < Instruction Type > ( ) ; for ( final I Block Container < Instruction Type > function : functions ) { program . add Function ( function , translate ( environment , function ) ) ; } return program ; }
```

Answer: Yes


Question:
Does the code remove a result listener ?
```java
public void remove Result Listener ( Result Listener listener ) { listener List . remove ( listener ) ; }
```

Answer: Yes


Question:
In which direction do 4 roads run ?
```java
public Array List < Building Template > generate City ( boolean generic Road ) { int width = map Settings . get Board Width ( ) ; int height = map Settings . get Board Height ( ) ; int roads = map Settings . get City Blocks ( ) ; roads = ( roads * Math . min ( width , height ) ) / NUM ; String city Type = map Settings . get City Type ( ) ; city Plan = new Hash Set < Coords > ( ) ; if ( generic Road ) { add Generic Road ( ) ; } if ( city Type . equals Ignore Case ( STRING ) ) build Hub City ( width , height , roads ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Metro City ( width , height ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Grid City ( width , height , ( roads + NUM ) / NUM ) ; else if ( city Type . equals Ignore Case ( STRING ) ) return build Town ( width , height , roads , map Settings . get Town Size ( ) ) ; else return new Array List < Building Template > ( ) ; return place Buildings ( NUM ) ; }
```

Answer: east west


Question:
Will this function generate a city with a grid lay out . 4 rounds running north and south and 4 roads running east west ?
```java
public Array List < Building Template > generate City ( boolean generic Road ) { int width = map Settings . get Board Width ( ) ; int height = map Settings . get Board Height ( ) ; int roads = map Settings . get City Blocks ( ) ; roads = ( roads * Math . min ( width , height ) ) / NUM ; String city Type = map Settings . get City Type ( ) ; city Plan = new Hash Set < Coords > ( ) ; if ( generic Road ) { add Generic Road ( ) ; } if ( city Type . equals Ignore Case ( STRING ) ) build Hub City ( width , height , roads ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Metro City ( width , height ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Grid City ( width , height , ( roads + NUM ) / NUM ) ; else if ( city Type . equals Ignore Case ( STRING ) ) return build Town ( width , height , roads , map Settings . get Town Size ( ) ) ; else return new Array List < Building Template > ( ) ; return place Buildings ( NUM ) ; }
```

Answer: Yes


Question:
Does the code create a declaration annotatedtypevariable for typevariable ?
```java
private Annotated Type Variable create Annotated Type Var ( final Type Variable type Variable , final Annotated Type Factory type Factory ) { return ( Annotated Type Variable ) type Factory . get Annotated Type ( type Variable . as Element ( ) ) ; }
```

Answer: Yes


Question:
Will the implementation of this method create a local session for the local user identified by the information in the map meaningful only for sp side ?
```java
public Object create Session ( Map info , Http Servlet Request request , Http Servlet Response response , String Buffer target Application ) throws Session Exception { debug . message ( STRING + info ) ; return info . get ( Session Provider . PRINCIPAL NAME ) ; }
```

Answer: Yes


Question:
Does this method provide access to locale sensitive decimal style symbols ?
```java
public static Decimal Style of ( Locale locale ) { Objects . require Non Null ( locale , STRING ) ; Decimal Style info = CACHE . get ( locale ) ; if ( info == null ) { info = create ( locale ) ; CACHE . put If Absent ( locale , info ) ; info = CACHE . get ( locale ) ; } return info ; }
```

Answer: Yes


Question:
Does the code obtain the decimalstyle for the specified locale ?
```java
public static Decimal Style of ( Locale locale ) { Objects . require Non Null ( locale , STRING ) ; Decimal Style info = CACHE . get ( locale ) ; if ( info == null ) { info = create ( locale ) ; CACHE . put If Absent ( locale , info ) ; info = CACHE . get ( locale ) ; } return info ; }
```

Answer: Yes


Question:
Does the code add an unspecified amount of tabstop elements as properties to the paragraph ?
```java
public Paragraph add Tab Stops ( Tab Stop ... tab Stops ) { add Tab Stops As Property ( Arrays . as List ( tab Stops ) ) ; return this ; }
```

Answer: Yes


Question:
Does the code write the result set of a query to a file in the csv format ?
```java
public int write ( Connection conn , String output File Name , String sql , String charset ) throws SQL Exception { Statement stat = conn . create Statement ( ) ; Result Set rs = stat . execute Query ( sql ) ; int rows = write ( output File Name , rs , charset ) ; stat . close ( ) ; return rows ; }
```

Answer: Yes


Question:
Does the code create a header by reading the information from the input stream ?
```java
public static Header read Header ( Array Data Input dis ) throws Truncated File Exception , IO Exception { Header my Header = new Header ( ) ; try { my Header . read ( dis ) ; } catch ( EOF Exception e ) { if ( e . get Cause ( ) instanceof Truncated File Exception ) { throw e ; } return null ; } return my Header ; }
```

Answer: Yes


Question:
Does the code load the section order ( if available ) for this service ?
```java
private boolean load Section Order ( ) { return load Section Order ( service Name + FILENAME SUFFIX ) ; }
```

Answer: Yes


Question:
Does the code get the entity at the specified revision ?
```java
@ Nullable public T ENTITY find Revision ( int id , int revision Number ) { T ENTITY result = null ; try { begin ( ) ; Audit Reader reader = Audit Reader Factory . get ( get Entity Manager ( ) ) ; result = reader . find ( entity Class , id , revision Number ) ; commit ( ) ; } catch ( No Result Exception e ) { rollback ( ) ; LOG . warn ( STRING + revision Number + STRING + id ) ; } finally { cleanup ( ) ; } return result ; }
```

Answer: Yes


Question:
Does the code indicate ?
```java
public boolean is Empty ( ) { return map . is Empty ( ) ; }
```

Answer: Yes


Question:
Is user inform ?
```java
private void notify Listeners ( Object object , Json Object config ) { for ( Property Change Listener config Update : listener ) { config Update . property Change ( new Property Change Event ( this , STRING , config , config ) ) ; } }
```

Answer: Yes


Question:
Is by the ui used to inform user what the status of the setup is this since it can take a long time ?
```java
private void notify Listeners ( Object object , Json Object config ) { for ( Property Change Listener config Update : listener ) { config Update . property Change ( new Property Change Event ( this , STRING , config , config ) ) ; } }
```

Answer: Yes


Question:
Do the status of the setup be what ?
```java
private void notify Listeners ( Object object , Json Object config ) { for ( Property Change Listener config Update : listener ) { config Update . property Change ( new Property Change Event ( this , STRING , config , config ) ) ; } }
```

Answer: Yes


Question:
Did the code given a time when a particular state changes from inactive to active , and a time when a particular state changes from active to inactive determine ?
```java
private boolean is Active ( Calendar active Start , Calendar inactive Start ) { if ( inactive Start != null && active Start != null && inactive Start . before ( active Start ) ) return ! is Active ( inactive Start , active Start ) ; Calendar current = Calendar . get Instance ( ) ; return ! ( active Start != null && current . before ( active Start ) ) && ! ( inactive Start != null && current . after ( inactive Start ) ) ; }
```

Answer: Yes


Question:
Does the code request the read lock . block until a read operation can be performed safely ?
```java
public synchronized void read Request ( ) { if ( current Writers == NUM && writer Locks . size ( ) == NUM ) { ++ current Readers ; } else { ++ queued Readers ; try { wait ( ) ; } catch ( Interrupted Exception e ) { } } }
```

Answer: Yes


Question:
How might inputs be passed ?
```java
public static boolean check CP Reblock ( Execution Context ec , String varin ) throws DML Runtime Exception { Cacheable Data < ? > obj = ec . get Cacheable Data ( varin ) ; Matrix Characteristics mc = ec . get Matrix Characteristics ( varin ) ; long rows = mc . get Rows ( ) ; long cols = mc . get Cols ( ) ; long nnz = mc . get Non Zeros ( ) ; if ( ! Configuration Manager . is Dynamic Recompilation ( ) || ! Optimizer Utils . is Hybrid Execution Mode ( ) ) { return BOOL ; } Matrix Format Meta Data iimd = ( Matrix Format Meta Data ) obj . get Meta Data ( ) ; if ( obj . get RDD Handle ( ) != null && iimd . get Input Info ( ) != Input Info . Binary Block Input Info && iimd . get Input Info ( ) != Input Info . Binary Cell Input Info ) { return BOOL ; } if ( rows <= NUM || cols <= NUM ) { return BOOL ; } double sp = Optimizer Utils . get Sparsity ( rows , cols , nnz ) ; double mem = Matrix Block . estimate Size In Memory ( rows , cols , sp ) ; if ( ! Optimizer Utils . is Valid CP Dimensions ( rows , cols ) || ! Optimizer Utils . is Valid CP Matrix Size ( rows , cols , sp ) || mem >= Optimizer Utils . get Local Mem Budget ( ) ) { return BOOL ; } long est Filesize = ( long ) ( NUM * mem ) ; long cp Threshold = CP REBLOCK THRESHOLD SIZE * Optimizer Utils . get Parallel Text Read Parallelism ( ) ; return ( est Filesize < cp Threshold ) ; }
```

Answer: via rdds


Question:
What do the knowledgeedge ' s represent ?
```java
public final Iterator < Knowledge Edge > required Edges Iterator ( ) { Set < Knowledge Edge > edges = new Hash Set < > ( ) ; for ( Ordered Pair < Set < My Node > > o : required Rules Specs ) { final Set < My Node > first = o . get First ( ) ; for ( My Node s1 : first ) { final Set < My Node > second = o . get Second ( ) ; for ( My Node s2 : second ) { if ( ! s1 . equals ( s2 ) ) { edges . add ( new Knowledge Edge ( s1 . get Name ( ) , s2 . get Name ( ) ) ) ; } } } } return edges . iterator ( ) ; }
```

Answer: required edges


Question:
When did garbage collect ?
```java
static void increment Keep Alive Count ( ) { synchronized ( keep Alive Lock ) { keep Alive Count ++ ; if ( reaper == null ) { reaper = Access Controller . do Privileged ( new New Thread Action ( new Reaper ( ) , STRING , BOOL ) ) ; reaper . start ( ) ; } if ( gc Latency Request == null ) { gc Latency Request = GC . request Latency ( gc Interval ) ; } } }
```

Answer: while exported


Question:
What converts to corresponding outputindex ?
```java
private int index To Output Index ( int parameter Index ) throws SQL Exception { try { if ( output Parameter Mapper [ parameter Index - NUM ] == - NUM ) { throw new SQL Exception ( STRING + parameter Index + STRING ) ; } return output Parameter Mapper [ parameter Index - NUM ] ; } catch ( Array Index Out Of Bounds Exception array Index Out Of Bounds Exception ) { if ( parameter Index < NUM ) { throw new SQL Exception ( STRING + parameter Index + STRING ) ; } throw new SQL Exception ( STRING + parameter Index + STRING + params . size ( ) ) ; } }
```

Answer: parameter index


Question:
What is this called the first time ?
```java
private int inject Callbacks ( final Callback [ ] real Callbacks , final int state ) throws Auth Login Exception { if ( authentication Context . has More Requirements ( ) ) { if ( real Callbacks != null ) { authentication Context . submit Requirements ( real Callbacks ) ; } if ( authentication Context . has More Requirements ( ) ) { return inject And Return ( state ) ; } else { return finish Login Module ( state ) ; } } return process Error ( bundle . get String ( STRING ) , STRING ) ; }
```

Answer: realcallbacks


Question:
Must the string be contain any ' \ n ' ?
```java
public void print ( String s ) { writer . print ( s ) ; }
```

Answer: No


Question:
What must be not contain any ' \ n ' ?
```java
public void print ( String s ) { writer . print ( s ) ; }
```

Answer: the string


Question:
How did the queue names sorted list store ?
```java
public static String construct Queue Names Redis Key ( String shard Name ) { return String . format ( STRING , PINLATER QUEUE NAMES KEY PREFIX , shard Name ) ; }
```

Answer: in redis


Question:
What does the code add to the registry returning a new membership key ?
```java
void add ( Membership Key Impl key ) { Inet Address group = key . group ( ) ; List < Membership Key Impl > keys ; if ( groups == null ) { groups = new Hash Map < Inet Address , List < Membership Key Impl > > ( ) ; keys = null ; } else { keys = groups . get ( group ) ; } if ( keys == null ) { keys = new Linked List < Membership Key Impl > ( ) ; groups . put ( group , keys ) ; } keys . add ( key ) ; }
```

Answer: membership


Question:
In which direction does the code traverse the graph ?
```java
private void traverse ( int distance , Word Token token , Immutable Stack < Word Token > history , Traverse Predicate predicate ) { final int new Distance = distance - NUM ; if ( new Distance <= NUM ) { return ; } for ( final Edge e : edges . get ( token ) ) { final Word Token other = e . get Other ( token ) ; if ( ! history . contains ( other ) && predicate . test ( e . get Dependency ( ) , token , other , history ) ) { final Immutable Stack < Word Token > stack = history . push ( other ) ; traverse ( new Distance , other , stack , predicate ) ; } } }
```

Answer: from token


Question:
What evaluates on the body ?
```java
public final void hack Gravity ( double rsize , Node root ) { Math Vector pos 0 = ( Math Vector ) pos . clone ( ) ; HG hg = new HG ( this , pos ) ; hg = root . walk Sub Tree ( rsize * rsize , hg ) ; phi = hg . phi 0 ; new Acc = hg . acc 0 ; }
```

Answer: gravitational field


Question:
What do all threads reach ?
```java
public void await ( int ID ) throws Interrupted Exception { if ( parties == NUM ) return ; final boolean start Condition = competition Condition ; int competing For = ( locks . length * NUM - NUM - ID ) / NUM ; while ( competing For >= NUM ) { final Lock node = locks [ competing For ] ; if ( node . try Lock ( ) ) { synchronized ( node ) { while ( competition Condition == start Condition ) node . wait ( ) ; } node . unlock ( ) ; wake Up Target ( competing For * NUM + NUM ) ; wake Up Target ( competing For * NUM + NUM ) ; return ; } else { if ( competing For == NUM ) break ; competing For = ( competing For - NUM ) / NUM ; } } competition Condition = ! competition Condition ; wake Up Target ( NUM ) ; }
```

Answer: this barrier


Question:
How does the revocation status of a list of certificates check ?
```java
static OCSP Response check ( List < Cert Id > cert Ids , URI responder URI , X509 Certificate issuer Cert , X509 Certificate responder Cert , Date date , List < Extension > extensions ) throws IO Exception , Cert Path Validator Exception { byte [ ] bytes = null ; OCSP Request request = null ; try { request = new OCSP Request ( cert Ids , extensions ) ; bytes = request . encode Bytes ( ) ; } catch ( IO Exception ioe ) { throw new Cert Path Validator Exception ( STRING , ioe ) ; } Input Stream in = null ; Output Stream out = null ; byte [ ] response = null ; try { URL url = responder URI . to URL ( ) ; if ( debug != null ) { debug . println ( STRING + url ) ; } Http URL Connection con = ( Http URL Connection ) url . open Connection ( ) ; con . set Connect Timeout ( CONNECT TIMEOUT ) ; con . set Read Timeout ( CONNECT TIMEOUT ) ; con . set Do Output ( BOOL ) ; con . set Do Input ( BOOL ) ; con . set Request Method ( STRING ) ; con . set Request Property ( STRING , STRING ) ; con . set Request Property ( STRING , String . value Of ( bytes . length ) ) ; out = con . get Output Stream ( ) ; out . write ( bytes ) ; out . flush ( ) ; if ( debug != null && con . get Response Code ( ) != Http URL Connection . HTTP OK ) { debug . println ( STRING + con . get Response Code ( ) + STRING + con . get Response Message ( ) ) ; } in = con . get Input Stream ( ) ; int content Length = con . get Content Length ( ) ; if ( content Length == - NUM ) { content Length = Integer . MAX VALUE ; } response = new byte [ content Length > NUM ? NUM : content Length ] ; int total = NUM ; while ( total < content Length ) { int count = in . read ( response , total , response . length - total ) ; if ( count < NUM ) break ; total += count ; if ( total >= response . length && total < content Length ) { response = Arrays . copy Of ( response , total * NUM ) ; } } response = Arrays . copy Of ( response , total ) ; } catch ( IO Exception ioe ) { throw new Cert Path Validator Exception ( STRING , ioe , null , - NUM , Basic Reason . UNDETERMINED REVOCATION STATUS ) ; } finally { if ( in != null ) { try { in . close ( ) ; } catch ( IO Exception ioe ) { throw ioe ; } } if ( out != null ) { try { out . close ( ) ; } catch ( IO Exception ioe ) { throw ioe ; } } } OCSP Response ocsp Response = null ; try { ocsp Response = new OCSP Response ( response ) ; } catch ( IO Exception ioe ) { throw new Cert Path Validator Exception ( ioe ) ; } ocsp Response . verify ( cert Ids , issuer Cert , responder Cert , date , request . get Nonce ( ) ) ; return ocsp Response ; }
```

Answer: using ocsp


Question:
What does the code reset if the stream has been marked ?
```java
@ Override public void reset ( ) throws IO Exception { f Input Stream . reset ( ) ; }
```

Answer: the stream


Question:
Does the code reposition it at the mark ?
```java
@ Override public void reset ( ) throws IO Exception { f Input Stream . reset ( ) ; }
```

Answer: No


Question:
Do adding a new event to the queue preserve the temporal order of the events in the queue ?
```java
public void add Event ( Sim Event new Event ) { new Event . set Serial ( serial ++ ) ; sorted Set . add ( new Event ) ; }
```

Answer: No


Question:
Does this method validate sql syntax ?
```java
private void validate Sql Statement ( String sql , int jdbc Statement Index ) { Assert . is True ( String Utils . is Not Blank ( sql ) , STRING + jdbc Statement Index + STRING ) ; }
```

Answer: No


Question:
What does this method not validate ?
```java
private void validate Sql Statement ( String sql , int jdbc Statement Index ) { Assert . is True ( String Utils . is Not Blank ( sql ) , STRING + jdbc Statement Index + STRING ) ; }
```

Answer: sql syntax


Question:
What does a panel do ?
```java
public static J Panel create Vertical Panel ( String title ) { J Panel panel = new J Panel ( ) ; panel . set Layout ( new Grid Layout ( NUM , NUM ) ) ; if ( title != null ) { panel . set Border ( Border Factory . create Titled Border ( Border Factory . create Etched Border ( ) , title ) ) ; } else { panel . set Border ( Border Factory . create Etched Border ( ) ) ; } return panel ; }
```

Answer: vertical layout


Question:
What is at most on the beginning of the bottom stack ?
```java
private void clamp Position To Bottom Stack Start ( Stack Scroll State . View State child View State , int child Height ) { child View State . y Translation = Math . min ( child View State . y Translation , m Inner Height - m Bottom Stack Peek Size - m Collapse Second Card Padding - child Height ) ; }
```

Answer: its end


Question:
How does the code validate the points for the state of the given cell if the cell is not collapsed ?
```java
public mx Rectangle validate Points ( mx Cell State parent State , Object cell ) { mx Cell State state = get State ( cell ) ; double min X = NUM ; double min Y = NUM ; double max X = NUM ; double max Y = NUM ; mx I Graph Model model = graph . get Model ( ) ; boolean is Edge = model . is Edge ( cell ) ; if ( state != null ) { if ( state . is Invalid ( ) ) { mx Geometry geo = graph . get Cell Geometry ( cell ) ; if ( is Edge ) { Object source = get Visible Terminal ( cell , BOOL ) ; if ( source != null && ! model . is Ancestor ( source , cell ) ) { Object p = model . get Parent ( source ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , source ) ; } Object target = get Visible Terminal ( cell , BOOL ) ; if ( target != null && ! model . is Ancestor ( target , cell ) ) { Object p = model . get Parent ( target ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , target ) ; } set Terminal Points ( state ) ; update Points ( state , geo . get Points ( ) , source , target ) ; update Terminal Points ( state , source , target ) ; update Edge Bounds ( state ) ; state . set Absolute Offset ( get Point ( state , geo ) ) ; } else if ( geo != null && geo . is Relative ( ) && parent State != null && model . is Edge ( parent State . get Cell ( ) ) ) { mx Point origin = get Point ( parent State , geo ) ; if ( origin != null ) { state . set X ( origin . get X ( ) ) ; state . set Y ( origin . get Y ( ) ) ; origin . set X ( ( origin . get X ( ) / scale ) - translate . get X ( ) ) ; origin . set Y ( ( origin . get Y ( ) / scale ) - translate . get Y ( ) ) ; state . set Origin ( origin ) ; child Moved ( parent State , state ) ; } } state . set Invalid ( BOOL ) ; } if ( is Edge || model . is Vertex ( cell ) ) { update Label Bounds ( state ) ; mx Rectangle bb = update Bounding Box ( state ) ; min X = bb . get X ( ) ; min Y = bb . get Y ( ) ; max X = bb . get X ( ) + bb . get Width ( ) ; max Y = bb . get Y ( ) + bb . get Height ( ) ; } } if ( state != null && ( ! graph . is Cell Collapsed ( cell ) || cell == current Root ) ) { int child Count = model . get Child Count ( cell ) ; for ( int i = NUM ; i < child Count ; i ++ ) { Object child = model . get Child At ( cell , i ) ; mx Rectangle bounds = validate Points ( state , child ) ; min X = Math . min ( min X , bounds . get X ( ) ) ; min Y = Math . min ( min Y , bounds . get Y ( ) ) ; max X = Math . max ( max X , bounds . get X ( ) + bounds . get Width ( ) ) ; max Y = Math . max ( max Y , bounds . get Y ( ) + bounds . get Height ( ) ) ; } } return new mx Rectangle ( min X , min Y , max X - min X , max Y - min Y ) ; }
```

Answer: recursively


Question:
Does the code return the bounding box of all visited states as a rectangle ?
```java
public mx Rectangle validate Points ( mx Cell State parent State , Object cell ) { mx Cell State state = get State ( cell ) ; double min X = NUM ; double min Y = NUM ; double max X = NUM ; double max Y = NUM ; mx I Graph Model model = graph . get Model ( ) ; boolean is Edge = model . is Edge ( cell ) ; if ( state != null ) { if ( state . is Invalid ( ) ) { mx Geometry geo = graph . get Cell Geometry ( cell ) ; if ( is Edge ) { Object source = get Visible Terminal ( cell , BOOL ) ; if ( source != null && ! model . is Ancestor ( source , cell ) ) { Object p = model . get Parent ( source ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , source ) ; } Object target = get Visible Terminal ( cell , BOOL ) ; if ( target != null && ! model . is Ancestor ( target , cell ) ) { Object p = model . get Parent ( target ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , target ) ; } set Terminal Points ( state ) ; update Points ( state , geo . get Points ( ) , source , target ) ; update Terminal Points ( state , source , target ) ; update Edge Bounds ( state ) ; state . set Absolute Offset ( get Point ( state , geo ) ) ; } else if ( geo != null && geo . is Relative ( ) && parent State != null && model . is Edge ( parent State . get Cell ( ) ) ) { mx Point origin = get Point ( parent State , geo ) ; if ( origin != null ) { state . set X ( origin . get X ( ) ) ; state . set Y ( origin . get Y ( ) ) ; origin . set X ( ( origin . get X ( ) / scale ) - translate . get X ( ) ) ; origin . set Y ( ( origin . get Y ( ) / scale ) - translate . get Y ( ) ) ; state . set Origin ( origin ) ; child Moved ( parent State , state ) ; } } state . set Invalid ( BOOL ) ; } if ( is Edge || model . is Vertex ( cell ) ) { update Label Bounds ( state ) ; mx Rectangle bb = update Bounding Box ( state ) ; min X = bb . get X ( ) ; min Y = bb . get Y ( ) ; max X = bb . get X ( ) + bb . get Width ( ) ; max Y = bb . get Y ( ) + bb . get Height ( ) ; } } if ( state != null && ( ! graph . is Cell Collapsed ( cell ) || cell == current Root ) ) { int child Count = model . get Child Count ( cell ) ; for ( int i = NUM ; i < child Count ; i ++ ) { Object child = model . get Child At ( cell , i ) ; mx Rectangle bounds = validate Points ( state , child ) ; min X = Math . min ( min X , bounds . get X ( ) ) ; min Y = Math . min ( min Y , bounds . get Y ( ) ) ; max X = Math . max ( max X , bounds . get X ( ) + bounds . get Width ( ) ) ; max Y = Math . max ( max Y , bounds . get Y ( ) + bounds . get Height ( ) ) ; } } return new mx Rectangle ( min X , min Y , max X - min X , max Y - min Y ) ; }
```

Answer: No


Question:
What might an example serve best ?
```java
public static String collapse ( String name ) { if ( name == null ) { return null ; } int break Point = name . last Index Of ( STRING ) ; if ( break Point < NUM ) { return name ; } return collapse Qualifier ( name . substring ( NUM , break Point ) , BOOL ) + name . substring ( break Point ) ; }
```

Answer: to explain


Question:
Where is this method invoked from the event handler ?
```java
void dispatch Committed Text ( String str , long when ) { if ( str == null ) return ; if ( composed Text == null ) { Attributed String attrstr = new Attributed String ( str ) ; post Input Method Event ( Input Method Event . INPUT METHOD TEXT CHANGED , attrstr . get Iterator ( ) , str . length ( ) , null , null , when ) ; } else { committed Text = str ; } }
```

Answer: in canvas


Question:
What overlap the specified rectangle ?
```java
public Iterable < Divider > dividers That Overlap ( final Rectangle r ) { if ( r == null ) { throw new Illegal Argument Exception ( STRING ) ; } return dividers That Overlap ( get Model ( ) , r ) ; }
```

Answer: the dividers


Question:
What do a string represent ?
```java
public static String cutpoints To String ( double [ ] cut Points , boolean [ ] cut And Left ) { String Buffer text = new String Buffer ( STRING ) ; if ( cut Points == null ) { text . append ( STRING ) ; } else { text . append ( STRING + cut Points . length + STRING ) ; for ( int i = NUM ; i < cut Points . length ; i ++ ) { text . append ( STRING + cut Points [ i ] + STRING ) ; text . append ( STRING + cut And Left [ i ] + STRING ) ; } text . append ( STRING ) ; } return text . to String ( ) ; }
```

Answer: the cutpoints


Question:
What adds to the list of features while increasing or maintaining the current accuracy ?
```java
static protected int SFS Select Feature ( Set < Integer > available , Data Set data Set , Set < Integer > cat To Remove , Set < Integer > num To Remove , Set < Integer > cat Selecteed , Set < Integer > num Selected , Object evaluater , int folds , Random rand , double [ ] Pbest Score , int min Features ) { int n Cat = data Set . get Num Categorical Vars ( ) ; int cur Best = - NUM ; double cur Best Score = Double . POSITIVE INFINITY ; for ( int feature : available ) { remove Feature ( feature , n Cat , cat To Remove , num To Remove ) ; Data Set work On = data Set . shallow Clone ( ) ; Remove Attribute Transform remove = new Remove Attribute Transform ( work On , cat To Remove , num To Remove ) ; work On . apply Transform ( remove ) ; double score = get Score ( work On , evaluater , folds , rand ) ; if ( score < cur Best Score ) { cur Best Score = score ; cur Best = feature ; } add Feature ( feature , n Cat , cat To Remove , num To Remove ) ; } if ( cur Best Score <= NUM && Pbest Score [ NUM ] <= NUM && cat Selecteed . size ( ) + num Selected . size ( ) >= min Features ) return - NUM ; if ( cur Best Score < Pbest Score [ NUM ] || cat Selecteed . size ( ) + num Selected . size ( ) < min Features || Math . abs ( Pbest Score [ NUM ] - cur Best Score ) < NUM ) { Pbest Score [ NUM ] = cur Best Score ; add Feature ( cur Best , n Cat , cat Selecteed , num Selected ) ; remove Feature ( cur Best , n Cat , cat To Remove , num To Remove ) ; available . remove ( cur Best ) ; return cur Best ; } else return - NUM ; }
```

Answer: one feature


Question:
What did gossip not produce for a specific period ?
```java
public static boolean is Node Group Available ( Service Host host , Node Group State local State ) { if ( Node Group Utils . is Membership Settled ( host , host . get Maintenance Interval Micros ( ) , local State ) && Node Group Utils . has Membership Quorum ( host , local State ) ) { return BOOL ; } return BOOL ; }
```

Answer: changes


Question:
Did gossip produce changes for a specific period ?
```java
public static boolean is Node Group Available ( Service Host host , Node Group State local State ) { if ( Node Group Utils . is Membership Settled ( host , host . get Maintenance Interval Micros ( ) , local State ) && Node Group Utils . has Membership Quorum ( host , local State ) ) { return BOOL ; } return BOOL ; }
```

Answer: No


Question:
What did not produce changes for a specific period ?
```java
public static boolean is Node Group Available ( Service Host host , Node Group State local State ) { if ( Node Group Utils . is Membership Settled ( host , host . get Maintenance Interval Micros ( ) , local State ) && Node Group Utils . has Membership Quorum ( host , local State ) ) { return BOOL ; } return BOOL ; }
```

Answer: gossip


Question:
What did the code init into the cache array ?
```java
private void init Vold Fstab To Cache ( ) throws IO Exception { cache . clear ( ) ; Buffered Reader br = new Buffered Reader ( new File Reader ( VOLD FSTAB ) ) ; String tmp = null ; while ( ( tmp = br . read Line ( ) ) != null ) { if ( tmp . starts With ( HEAD ) ) { cache . add ( tmp ) ; } } br . close ( ) ; cache . trim To Size ( ) ; }
```

Answer: the words


Question:
What do we visit more than once more than once ?
```java
private Set < CCFG Node > handle Method Call Node ( CCFG Node node , Stack < Method Call > call Stack , Set < CCFG Node > handled ) { CCFG Method Call Node call Node = ( CCFG Method Call Node ) node ; update Call Stack For Call Node ( call Stack , call Node ) ; return filter Handled Map For Method Call Node ( call Node , handled ) ; }
```

Answer: some nodes


Question:
What can the host no longer receive after calling this ?
```java
public void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }
```

Answer: extension updates


Question:
Can the host receive extension updates after calling this ?
```java
public void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }
```

Answer: No


Question:
What do the activity or service hold ?
```java
public void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }
```

Answer: this host


Question:
What can no longer receive extension updates after calling this ?
```java
public void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }
```

Answer: the host


Question:
What has the correct chronology ?
```java
private void validate Chrono ( Temporal Accessor temporal ) { Objects . require Non Null ( temporal , STRING ) ; Chronology temporal Chrono = temporal . query ( Temporal Queries . chronology ( ) ) ; if ( temporal Chrono != null && chrono . equals ( temporal Chrono ) == BOOL ) { throw new Date Time Exception ( STRING + chrono . get Id ( ) + STRING + temporal Chrono . get Id ( ) ) ; } }
```

Answer: the temporal


Question:
What can wrap the supplied cursor with one that will also account for header and footer views ?
```java
public void add Header View ( View v , Object data , boolean is Selectable ) { if ( m Adapter != null ) { throw new Illegal State Exception ( STRING ) ; } Fixed View Info info = new Fixed View Info ( ) ; info . view = v ; info . data = data ; info . is Selectable = is Selectable ; m Header View Infos . add ( info ) ; }
```

Answer: listview


Question:
Can views added using this call take focus if they want ?
```java
public void add Header View ( View v , Object data , boolean is Selectable ) { if ( m Adapter != null ) { throw new Illegal State Exception ( STRING ) ; } Fixed View Info info = new Fixed View Info ( ) ; info . view = v ; info . data = data ; info . is Selectable = is Selectable ; m Header View Infos . add ( info ) ; }
```

Answer: No


Question:
What fixes the problem of registering a subnode before its father node ?
```java
void export Children ( Snmp Mib Oid brother ) throws Illegal Access Exception { if ( brother == null ) return ; final long [ ] oid = new long [ NUM ] ; for ( int i = NUM ; i < nb Children ; i ++ ) { final Snmp Mib Node child = children . element At ( i ) ; if ( child == null ) continue ; oid [ NUM ] = var List [ i ] ; brother . register Node ( oid , NUM , child ) ; } }
```

Answer: a patch


Question:
What can a closed stream not perform ?
```java
public void close ( ) throws java . io . IO Exception { flush ( ) ; }
```

Answer: output operations


Question:
What did the close method of outputstream do ?
```java
public void close ( ) throws java . io . IO Exception { flush ( ) ; }
```

Answer: nothing


Question:
Can a closed stream perform output operations ?
```java
public void close ( ) throws java . io . IO Exception { flush ( ) ; }
```

Answer: No


Question:
What does not consume the excluded character ?
```java
private String next To Internal ( String excluded ) { int start = pos ; for ( ; pos < in . length ( ) ; pos ++ ) { char c = in . char At ( pos ) ; if ( c == STRING || c == STRING || excluded . index Of ( c ) != - NUM ) { return in . substring ( start , pos ) ; } } return in . substring ( start ) ; }
```

Answer: this


Question:
Does this consume the excluded character ?
```java
private String next To Internal ( String excluded ) { int start = pos ; for ( ; pos < in . length ( ) ; pos ++ ) { char c = in . char At ( pos ) ; if ( c == STRING || c == STRING || excluded . index Of ( c ) != - NUM ) { return in . substring ( start , pos ) ; } } return in . substring ( start ) ; }
```

Answer: No


Question:
What does the code add to the collection of crossings ?
```java
protected void add Crossing ( Boundary Crossing bc ) { crossings . add ( bc ) ; }
```

Answer: a boundarycrossing


Question:
How does the code find the web - inf ?
```java
private void locate Uri Root ( File f ) { String t Uri Base = uri Base ; if ( t Uri Base == null ) { t Uri Base = STRING ; } try { if ( f . exists ( ) ) { f = new File ( f . get Canonical Path ( ) ) ; while ( f != null ) { File g = new File ( f , STRING ) ; if ( g . exists ( ) && g . is Directory ( ) ) { uri Root = f . get Canonical Path ( ) ; uri Base = t Uri Base ; if ( log . is Loggable ( Level . INFO ) ) { log . info ( Localizer . get Message ( STRING , uri Root ) ) ; } break ; } if ( f . exists ( ) && f . is Directory ( ) ) { t Uri Base = STRING + f . get Name ( ) + STRING + t Uri Base ; } String f Parent = f . get Parent ( ) ; if ( f Parent == null ) { break ; } else { f = new File ( f Parent ) ; } } if ( uri Root != null ) { File froot = new File ( uri Root ) ; uri Root = froot . get Canonical Path ( ) ; } } } catch ( IO Exception ioe ) { } }
```

Answer: dir


Question:
What should we require maybe ?
```java
private void locate Uri Root ( File f ) { String t Uri Base = uri Base ; if ( t Uri Base == null ) { t Uri Base = STRING ; } try { if ( f . exists ( ) ) { f = new File ( f . get Canonical Path ( ) ) ; while ( f != null ) { File g = new File ( f , STRING ) ; if ( g . exists ( ) && g . is Directory ( ) ) { uri Root = f . get Canonical Path ( ) ; uri Base = t Uri Base ; if ( log . is Loggable ( Level . INFO ) ) { log . info ( Localizer . get Message ( STRING , uri Root ) ) ; } break ; } if ( f . exists ( ) && f . is Directory ( ) ) { t Uri Base = STRING + f . get Name ( ) + STRING + t Uri Base ; } String f Parent = f . get Parent ( ) ; if ( f Parent == null ) { break ; } else { f = new File ( f Parent ) ; } } if ( uri Root != null ) { File froot = new File ( uri Root ) ; uri Root = froot . get Canonical Path ( ) ; } } } catch ( IO Exception ioe ) { } }
```

Answer: the docbase


Question:
What does the code add to the table ?
```java
void add Index ( Index index ) { indexes . add ( index ) ; }
```

Answer: this index


Question:
What does further post - processing of the volume encounter when ?
```java
private void persist Volume Native ID ( Db Client db Client , URI volume Id , String native ID , Calendar creation Time ) throws IO Exception { Volume volume = db Client . query Object ( Volume . class , volume Id ) ; volume . set Creation Time ( creation Time ) ; volume . set Native Id ( native ID ) ; volume . set Native Guid ( Native GUID Generator . generate Native Guid ( db Client , volume ) ) ; db Client . update Object ( volume ) ; }
```

Answer: some error


Question:
Do we delete it ?
```java
private void persist Volume Native ID ( Db Client db Client , URI volume Id , String native ID , Calendar creation Time ) throws IO Exception { Volume volume = db Client . query Object ( Volume . class , volume Id ) ; volume . set Creation Time ( creation Time ) ; volume . set Native Id ( native ID ) ; volume . set Native Guid ( Native GUID Generator . generate Native Guid ( db Client , volume ) ) ; db Client . update Object ( volume ) ; }
```

Answer: No


Question:
When do we persist it so that if when further post - processing of the volume encounters some error , we would be able to have some reference to the volume and we could attempt to delete it ?
```java
private void persist Volume Native ID ( Db Client db Client , URI volume Id , String native ID , Calendar creation Time ) throws IO Exception { Volume volume = db Client . query Object ( Volume . class , volume Id ) ; volume . set Creation Time ( creation Time ) ; volume . set Native Id ( native ID ) ; volume . set Native Guid ( Native GUID Generator . generate Native Guid ( db Client , volume ) ) ; db Client . update Object ( volume ) ; }
```

Answer: immediately


Question:
What is to determine if the binary data contains a serialised session object ?
```java
@ Suppress Warnings ( STRING ) private boolean is Token Valid For Compression ( byte [ ] blob ) { if ( blob == null ) { return BOOL ; } String contents ; try { contents = blob Utils . to UTF 8 ( blob ) ; } catch ( Unsupported Encoding Exception e ) { return BOOL ; } if ( ! contents . starts With ( STRING ) ) { return BOOL ; } if ( ! contents . ends With ( STRING ) ) { return BOOL ; } Set < String > keys = new Hash Set < String > ( ) ; keys . add All ( replacement . key Set ( ) ) ; keys . add All ( replacement . values ( ) ) ; for ( String key : keys ) { if ( contents . contains ( key ) ) { return BOOL ; } } return BOOL ; }
```

Answer: the objective


Question:
Where is file loaded when ?
```java
protected void configure By File ( @ Test Data File @ Non Nls @ Not Null String file Path ) { try { final File io File = new File ( get Test Data Path ( ) + file Path ) ; String file Text = File Util Rt . load File ( io File , Charset Toolkit . UTF 8 , BOOL ) ; configure From File Text ( io File . get Name ( ) , file Text ) ; } catch ( IO Exception e ) { throw new Runtime Exception ( e ) ; } }
```

Answer: in editor


Question:
What does the code add to each closed subpath ?
```java
public List < Integer > replace Close With Line ( ) { List < Integer > modified Subpaths Indices = new Array List < > ( ) ; int i = NUM ; for ( Subpath subpath : subpaths ) { if ( subpath . is Closed ( ) ) { subpath . set Closed ( BOOL ) ; subpath . add Segment ( new Line ( subpath . get Last Point ( ) , subpath . get Start Point ( ) ) ) ; modified Subpaths Indices . add ( i ) ; } ++ i ; } return modified Subpaths Indices ; }
```

Answer: additional line


Question:
Do a character number include in the caption ?
```java
private void caption Put ( int value , String text ) { caption Map . put ( new Integer ( value ) , text ) ; }
```

Answer: No


Question:
What does the iterator return for use by the application ?
```java
public Id Search Results search Identities ( Id Type type , String pattern , Map av Pairs , boolean recursive , int max Results , int max Time , Set return Attributes , boolean return All Attributes ) throws Id Repo Exception , SSO Exception { Id Search Control crtl = new Id Search Control ( ) ; crtl . set Search Modifiers ( Id Search Op Modifier . OR , av Pairs ) ; crtl . set Recursive ( recursive ) ; crtl . set Max Results ( max Results ) ; crtl . set Time Out ( max Time ) ; crtl . set Return Attributes ( return Attributes ) ; crtl . set All Return Attributes ( return All Attributes ) ; Crest Query crest Query = new Crest Query ( pattern ) ; return search Identities ( type , crest Query , crtl ) ; }
```

Answer: amidentity objects


Question:
What defined in plugins ?
```java
public static void register Condition ( String condition Name , Class < ? extends Attribute Filter Condition > condition Class ) { String [ ] new Condition Names = new String [ CONDITION NAMES . length + NUM ] ; System . arraycopy ( CONDITION NAMES , NUM , new Condition Names , NUM , CONDITION NAMES . length ) ; new Condition Names [ new Condition Names . length - NUM ] = condition Name ; CONDITION NAMES = new Condition Names ; Class < ? > [ ] new Condition Classes = new Class [ CONDITION IMPLEMENTATIONS . length + NUM ] ; System . arraycopy ( CONDITION IMPLEMENTATIONS , NUM , new Condition Classes , NUM , CONDITION IMPLEMENTATIONS . length ) ; new Condition Classes [ new Condition Classes . length - NUM ] = condition Class ; CONDITION IMPLEMENTATIONS = new Condition Classes ; }
```

Answer: filter conditions


Question:
For what purpose do they present to the user ?
```java
private void add System Imes ( Set < String > exclude Packages ) { final Context context = get Activity ( ) ; if ( context == null ) return ; Input Method Manager imm = ( Input Method Manager ) context . get System Service ( Context . INPUT METHOD SERVICE ) ; List < Input Method Info > imis = imm . get Input Method List ( ) ; for ( Input Method Info imi : imis ) { try { if ( imi . is Default ( context ) && is System Package ( imi . get Package Name ( ) ) ) { exclude Packages . add ( imi . get Package Name ( ) ) ; } } catch ( Resources . Not Found Exception rnfe ) { } } }
```

Answer: for toggling


Question:
What installed pre ?
```java
private void add System Imes ( Set < String > exclude Packages ) { final Context context = get Activity ( ) ; if ( context == null ) return ; Input Method Manager imm = ( Input Method Manager ) context . get System Service ( Context . INPUT METHOD SERVICE ) ; List < Input Method Info > imis = imm . get Input Method List ( ) ; for ( Input Method Info imi : imis ) { try { if ( imi . is Default ( context ) && is System Package ( imi . get Package Name ( ) ) ) { exclude Packages . add ( imi . get Package Name ( ) ) ; } } catch ( Resources . Not Found Exception rnfe ) { } } }
```

Answer: input methods


Question:
What does this return for the caller to extract the output variables ?
```java
private Execution Context execute Using Simplified Compilation Chain ( String dml Script File Path , boolean is File , Map < String , String > arg Vals , boolean parse Py DML , String [ ] inputs , String [ ] outputs , Local Variable Map input Symbol Table , String config File Path ) throws IO Exception , DML Exception { DML Config config = ( config File Path == null ) ? new DML Config ( ) : new DML Config ( config File Path ) ; for ( Entry < String , String > param : additional Configs . entry Set ( ) ) { config . set Text Value ( param . get Key ( ) , param . get Value ( ) ) ; } Configuration Manager . set Global Config ( config ) ; Compiler Config cconf = new Compiler Config ( ) ; cconf . set ( Config Type . IGNORE UNSPECIFIED ARGS , BOOL ) ; cconf . set ( Config Type . REJECT READ WRITE UNKNOWNS , BOOL ) ; cconf . set ( Config Type . ALLOW CSE PERSISTENT READS , BOOL ) ; Configuration Manager . set Global Config ( cconf ) ; String dml Script Str = DML Script . read DML Script ( is File ? STRING : STRING , dml Script File Path ) ; if ( monitor Utils != null ) { monitor Utils . set DML String ( dml Script Str ) ; } rtprog = null ; A Parser Wrapper parser = A Parser Wrapper . create Parser ( parse Py DML ) ; DML Program prog ; if ( is File ) { prog = parser . parse ( dml Script File Path , null , arg Vals ) ; } else { prog = parser . parse ( null , dml Script Str , arg Vals ) ; } DML Translator dmlt = new DML Translator ( prog ) ; dmlt . live Variable Analysis ( prog ) ; dmlt . validate Parse Tree ( prog ) ; dmlt . construct Hops ( prog ) ; dmlt . rewrite Hops DAG ( prog ) ; Explain . explain ( prog ) ; if ( input Symbol Table != null ) { Rewrite Remove Persistent Read Write rewrite = new Rewrite Remove Persistent Read Write ( inputs , outputs , input Symbol Table ) ; Program Rewriter rewriter 2 = new Program Rewriter ( rewrite ) ; rewriter 2 . rewrite Program Hop DA Gs ( prog ) ; } dmlt . construct Lops ( prog ) ; rtprog = prog . get Runtime Program ( config ) ; if ( Optimizer Utils . is Opt Level ( Optimization Level . O4 GLOBAL TIME MEMORY ) ) { rtprog = Global Optimizer Wrapper . optimize Program ( prog , rtprog ) ; } Explain Counts counts = Explain . count Distributed Operations ( rtprog ) ; Statistics . reset No Of Compiled Jobs ( counts . num Jobs ) ; DML Script . init Hadoop Execution ( config ) ; JMLC Utils . cleanup Runtime Program ( rtprog , outputs ) ; Execution Context ec = Execution Context Factory . create Context ( rtprog ) ; if ( input Symbol Table != null ) { ec . set Variables ( input Symbol Table ) ; } rtprog . execute ( ec ) ; if ( monitor Utils != null ) monitor Utils . set Explain Output ( Explain . explain ( rtprog ) ) ; return ec ; }
```

Answer: the executioncontext


Question:
What does the code add to the colour map ?
```java
private void extend Colour Map ( int highest ) { for ( int i = m color List . size ( ) ; i < highest ; i ++ ) { Color pc = m Default Colors [ i % NUM ] ; int ija = i / NUM ; ija *= NUM ; for ( int j = NUM ; j < ija ; j ++ ) { pc = pc . brighter ( ) ; } m color List . add ( pc ) ; } }
```

Answer: more colours


Question:
What can be applied on the result got ?
```java
protected void process Result ( final Operation operation , final Object result , final Command command Obj ) throws Base Collection Exception { Processor processor = null ; processor = operation . get Processor ( ) ; if ( null != processor ) { List < Object > args List = new Array List < Object > ( ) ; args List . add ( Util . normalized Read Args ( key Map , command Obj . retreive Arguments ( ) ) ) ; args List . add ( command Obj . get Command Index ( ) ) ; processor . set Prerequisite Objects ( args List ) ; processor . process Result ( operation , result , key Map ) ; } else { LOGGER . debug ( STRING ) ; } }
```

Answer: multiple processors


Question:
What can be applied on the processed result ?
```java
protected void process Result ( final Operation operation , final Object result , final Command command Obj ) throws Base Collection Exception { Processor processor = null ; processor = operation . get Processor ( ) ; if ( null != processor ) { List < Object > args List = new Array List < Object > ( ) ; args List . add ( Util . normalized Read Args ( key Map , command Obj . retreive Arguments ( ) ) ) ; args List . add ( command Obj . get Command Index ( ) ) ; processor . set Prerequisite Objects ( args List ) ; processor . process Result ( operation , result , key Map ) ; } else { LOGGER . debug ( STRING ) ; } }
```

Answer: multiple decorators


Question:
What apply different types of decorators above the processed result ?
```java
protected void process Result ( final Operation operation , final Object result , final Command command Obj ) throws Base Collection Exception { Processor processor = null ; processor = operation . get Processor ( ) ; if ( null != processor ) { List < Object > args List = new Array List < Object > ( ) ; args List . add ( Util . normalized Read Args ( key Map , command Obj . retreive Arguments ( ) ) ) ; args List . add ( command Obj . get Command Index ( ) ) ; processor . set Prerequisite Objects ( args List ) ; processor . process Result ( operation , result , key Map ) ; } else { LOGGER . debug ( STRING ) ; } }
```

Answer: directormetrics


Question:
In which direction is it called to add certain system threads to the system thread group ?
```java
void add ( Thread t ) { synchronized ( this ) { if ( destroyed ) { throw new Illegal Thread State Exception ( ) ; } if ( threads == null ) { threads = new Thread [ NUM ] ; } else if ( nthreads == threads . length ) { threads = Arrays . copy Of ( threads , nthreads * NUM ) ; } threads [ nthreads ] = t ; nthreads ++ ; n Unstarted Threads -- ; } }
```

Answer: from vm


Question:
What does the code execute on each item in a collection ?
```java
public static void apply ( Collection coll , Function func ) { for ( Iterator i = coll . iterator ( ) ; i . has Next ( ) ; ) { func . execute ( i . next ( ) ) ; } }
```

Answer: a function


Question:
Does the code accumulate the result ?
```java
public static void apply ( Collection coll , Function func ) { for ( Iterator i = coll . iterator ( ) ; i . has Next ( ) ; ) { func . execute ( i . next ( ) ) ; } }
```

Answer: No


Question:
What does the code not accumulate ?
```java
public static void apply ( Collection coll , Function func ) { for ( Iterator i = coll . iterator ( ) ; i . has Next ( ) ; ) { func . execute ( i . next ( ) ) ; } }
```

Answer: the result


Question:
What does the code end ?
```java
public void end ( ) { while ( ! subreports . is Empty ( ) ) { String subreport = subreports . pop ( ) ; add Log Entry ( new Subreport End Entry ( subreport ) ) ; } this . end Date = new Date ( ) ; }
```

Answer: all subreports


Question:
What does this add ?
```java
public void update Timers And Events ( Process Definition Entity process Definition , Process Definition Entity previous Process Definition , Parsed Deployment parsed Deployment ) { Process process = parsed Deployment . get Process Model For Process Definition ( process Definition ) ; Bpmn Model bpmn Model = parsed Deployment . get Bpmn Model For Process Definition ( process Definition ) ; event Subscription Manager . remove Obsolete Message Event Subscriptions ( previous Process Definition ) ; event Subscription Manager . add Message Event Subscriptions ( process Definition , process , bpmn Model ) ; event Subscription Manager . remove Obsolete Signal Event Sub Scription ( previous Process Definition ) ; event Subscription Manager . add Signal Event Subscriptions ( Context . get Command Context ( ) , process Definition , process , bpmn Model ) ; timer Manager . remove Obsolete Timers ( process Definition ) ; timer Manager . schedule Timers ( process Definition , process ) ; }
```

Answer: new ones


Question:
What did the code push onto the stack ?
```java
public void push ( Awtree Node p element ) { if ( p element == null ) return ; node list . add ( p element ) ; }
```

Answer: p_element


Question:
What does not have valid boundaries ?
```java
public Tile Directory ( ) { tilename = STRING ; this . tile ID = - NUM ; westlon = eastlon = northlat = southlat = Float . Na N ; }
```

Answer: this object


Question:
Does this object have valid boundaries ?
```java
public Tile Directory ( ) { tilename = STRING ; this . tile ID = - NUM ; westlon = eastlon = northlat = southlat = Float . Na N ; }
```

Answer: No


Question:
What does this object not have ?
```java
public Tile Directory ( ) { tilename = STRING ; this . tile ID = - NUM ; westlon = eastlon = northlat = southlat = Float . Na N ; }
```

Answer: valid boundaries


Question:
Does it resolve it ?
```java
public void resolve Urls ( ) { try { pool = Executors . new Fixed Thread Pool ( num Threads ) ; Buffered Reader buff Read = new Buffered Reader ( new File Reader ( new File ( urls File ) ) ) ; String url Str = null ; while ( ( url Str = buff Read . read Line ( ) ) != null ) { LOG . info ( STRING + url Str ) ; pool . execute ( new Resolver Thread ( url Str ) ) ; } buff Read . close ( ) ; pool . await Termination ( NUM , Time Unit . SECONDS ) ; } catch ( Exception e ) { pool . shutdown Now ( ) ; LOG . info ( String Utils . stringify Exception ( e ) ) ; } pool . shutdown ( ) ; LOG . info ( STRING + num Total . get ( ) + STRING + num Resolved . get ( ) + STRING + num Errored . get ( ) + STRING + total Time . get ( ) / num Total . get ( ) ) ; }
```

Answer: No


Question:
How are irregular ( non - boundary ) bcis encoded immediately after the boundary numbers ?
```java
public int encode BCI ( int bci ) { if ( bci <= NUM || bci > get Length ( ) ) return bci ; Object map 0 = get Insn Map ( ) ; int i , len ; if ( shrink Maps && map 0 instanceof byte [ ] ) { byte [ ] map = ( byte [ ] ) map 0 ; len = map . length ; i = Arrays . binary Search ( map , ( byte ) ( bci + Byte . MIN VALUE ) ) ; } else if ( shrink Maps && map 0 instanceof short [ ] ) { short [ ] map = ( short [ ] ) map 0 ; len = map . length ; i = Arrays . binary Search ( map , ( short ) ( bci + Short . MIN VALUE ) ) ; } else { int [ ] map = ( int [ ] ) map 0 ; len = map . length ; i = Arrays . binary Search ( map , bci ) ; } assert ( i != - NUM ) ; assert ( i != NUM ) ; assert ( i != len ) ; assert ( i != - len - NUM ) ; return ( i >= NUM ) ? i : len + bci - ( - i - NUM ) ; }
```

Answer: compactly


Question:
What will stop at the first match ?
```java
public static String Buffer read Content ( File file , Map < String [ ] , String > replace Map ) throws IO Exception { String Buffer content = new String Buffer ( ) ; Buffered Reader reader = new Buffered Reader ( new Input Stream Reader ( new File Input Stream ( file ) , ENCODING UTF 8 ) ) ; String line = null ; String current End String = null ; try { while ( ( line = reader . read Line ( ) ) != null ) { if ( current End String != null ) { if ( line . contains ( current End String ) ) { current End String = null ; } continue ; } if ( replace Map != null ) { for ( Entry < String [ ] , String > entry : replace Map . entry Set ( ) ) { if ( line . contains ( entry . get Key ( ) [ NUM ] ) ) { current End String = ( entry . get Key ( ) [ NUM ] != null && ! line . contains ( entry . get Key ( ) [ NUM ] ) ) ? entry . get Key ( ) [ NUM ] : null ; line = entry . get Value ( ) ; break ; } } } content . append ( line + LINE BREAK ) ; } } finally { try { reader . close ( ) ; } catch ( Exception ex ) { } } return content ; }
```

Answer: the reading


Question:
What can you use to implement a simple request / reply mechanism ?
```java
public synchronized Temporary Queue create Temporary Queue ( ) throws JMS Exception { ensure Open ( ) ; if ( logger . is Loggable ( Level . FINE ) ) { logger . log ( Level . FINE , STRING ) ; } return new GS Temporary Queue Impl ( m session ID + STRING + get Random Int ( ) , m session ID ) ; }
```

Answer: temporary destinations


Question:
How does the code update the solr document for the given table entity ?
```java
public Future < Void > update Table Entity Async ( Table Entity table Entity , boolean commit ) { update Table Entity ( table Entity , commit ) ; return new Async Result < Void > ( null ) ; }
```

Answer: asynchronly


Question:
Does the pushback buffer contain any available bytes ?
```java
@ Override public int read ( ) throws IO Exception { if ( buf == null ) { throw new IO Exception ( ) ; } if ( pos < buf . length ) { return ( buf [ pos ++ ] & NUM ) ; } return in . read ( ) ; }
```

Answer: No


Question:
What keeps within the allowed range and the image on screen ?
```java
private void fit To Bounds ( boolean center , Scale And Translate scale And Translate ) { if ( pan Limit == PAN LIMIT OUTSIDE && is Image Ready ( ) ) { center = BOOL ; } Point F v Translate = scale And Translate . translate ; float scale = limited Scale ( scale And Translate . scale ) ; float scale Width = scale * s Width ( ) ; float scale Height = scale * s Height ( ) ; if ( pan Limit == PAN LIMIT CENTER && is Image Ready ( ) ) { v Translate . x = Math . max ( v Translate . x , get Width ( ) / NUM - scale Width ) ; v Translate . y = Math . max ( v Translate . y , get Height ( ) / NUM - scale Height ) ; } else if ( center ) { v Translate . x = Math . max ( v Translate . x , get Width ( ) - scale Width ) ; v Translate . y = Math . max ( v Translate . y , get Height ( ) - scale Height ) ; } else { v Translate . x = Math . max ( v Translate . x , - scale Width ) ; v Translate . y = Math . max ( v Translate . y , - scale Height ) ; } float max Tx ; float max Ty ; if ( pan Limit == PAN LIMIT CENTER && is Image Ready ( ) ) { max Tx = Math . max ( NUM , get Width ( ) / NUM ) ; max Ty = Math . max ( NUM , get Height ( ) / NUM ) ; } else if ( center ) { max Tx = Math . max ( NUM , ( get Width ( ) - scale Width ) / NUM ) ; max Ty = Math . max ( NUM , ( get Height ( ) - scale Height ) / NUM ) ; } else { max Tx = Math . max ( NUM , get Width ( ) ) ; max Ty = Math . max ( NUM , get Height ( ) ) ; } v Translate . x = Math . min ( v Translate . x , max Tx ) ; v Translate . y = Math . min ( v Translate . y , max Ty ) ; scale And Translate . scale = scale ; }
```

Answer: scale