Question:
Does the code find the index with the specified name using case insensitive matching ?
```java
public I Index find Index ( String name ) { return find Index ( name , BOOL ) ; }
```

Answer: Yes


Question:
Did a new mapentryinfokey use to keep it in mapversiontable ?
```java
public Map Entry Info Key ( Object value , Object key , Reference Queue < Object > queue ) { super ( value , queue ) ; hash Code = hash Code ^ key . hash Code ( ) ; key = key ; }
```

Answer: Yes


Question:
Does the code create a new mapentryinfokey , used to keep it in mapversiontable ?
```java
public Map Entry Info Key ( Object value , Object key , Reference Queue < Object > queue ) { super ( value , queue ) ; hash Code = hash Code ^ key . hash Code ( ) ; key = key ; }
```

Answer: Yes


Question:
Does the code create the rcs keystore ?
```java
private static void create Key Store ( ) throws Key Store Exception , IO Exception { if ( s Key Store != null ) { return ; } try { s Key Store = Key Store . get Instance ( get Keystore Type ( ) ) ; synchronized ( Key Store Manager . class ) { s Key Store . load ( null , KEYSTORE PASSWORD . to Char Array ( ) ) ; } save Key Store To File ( s Key Store ) ; } catch ( No Such Algorithm Exception e ) { throw new Key Store Exception ( STRING , e ) ; } catch ( Certificate Exception e ) { throw new Key Store Exception ( STRING , e ) ; } }
```

Answer: Yes


Question:
Does the code add the given number of period units to this date ?
```java
public Julian Date add ( int units , int amount ) { Julian Date date = null ; synchronized ( gc ) { gc . set Time ( get Java Date ( ) ) ; gc . add ( units , amount ) ; date = new Julian Date ( gc . get Time ( ) ) ; } return date ; }
```

Answer: Yes


Question:
For what purpose did the browser ( user ) authenticate ?
```java
public static void do Web Artifact ( Http Servlet Request request , Http Servlet Response response , String target ) throws IO Exception , SAML Exception { do SSO ( request , response , target , SAML Constants . SAML AWARE NAMING ) ; }
```

Answer: to openam


Question:
Did this method do the saml web - browser profile with artifact ?
```java
public static void do Web Artifact ( Http Servlet Request request , Http Servlet Response response , String target ) throws IO Exception , SAML Exception { do SSO ( request , response , target , SAML Constants . SAML AWARE NAMING ) ; }
```

Answer: Yes


Question:
How did this method do the saml web - browser profile ?
```java
public static void do Web Artifact ( Http Servlet Request request , Http Servlet Response response , String target ) throws IO Exception , SAML Exception { do SSO ( request , response , target , SAML Constants . SAML AWARE NAMING ) ; }
```

Answer: with artifact


Question:
Is this method do designed to do the saml web - browser profile with artifact ?
```java
public static void do Web Artifact ( Http Servlet Request request , Http Servlet Response response , String target ) throws IO Exception , SAML Exception { do SSO ( request , response , target , SAML Constants . SAML AWARE NAMING ) ; }
```

Answer: Yes


Question:
Can it call this method to complete the single sign on to the target host and be redirected to the specified target site once the browser ( user ) authenticated to openam ?
```java
public static void do Web Artifact ( Http Servlet Request request , Http Servlet Response response , String target ) throws IO Exception , SAML Exception { do SSO ( request , response , target , SAML Constants . SAML AWARE NAMING ) ; }
```

Answer: Yes


Question:
Do it complete the single sign on to the target host ?
```java
public static void do Web Artifact ( Http Servlet Request request , Http Servlet Response response , String target ) throws IO Exception , SAML Exception { do SSO ( request , response , target , SAML Constants . SAML AWARE NAMING ) ; }
```

Answer: Yes


Question:
Does the code update the documents with partial updates with the given fields ?
```java
public void updates ( String type , List < String > ids , Metacat Context metacat Context , Object Node node ) { if ( ids == null || ids . is Empty ( ) ) { return ; } try { RETRY ES PUBLISH . call ( null ) ; } catch ( Exception e ) { log . error ( String . format ( STRING , type , ids ) , e ) ; Counter Wrapper . increment Counter ( STRING ) ; log ( STRING , type , ids . to String ( ) , null , e . get Message ( ) , e , BOOL ) ; } }
```

Answer: Yes


Question:
Does the code add " val " months to the month object that contains " time " and ?
```java
@ Override public Enter From Date To To Date Activity . Time Object add ( long time , int val ) { Calendar c = Calendar . get Instance ( ) ; c . set Time In Millis ( time ) ; c . add ( Calendar . MONTH , val ) ; return time Object From Calendar ( c ) ; }
```

Answer: Yes


Question:
Does unit test create one ( or more ) namespaces ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: Yes


Question:
What can we list ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: the namespaces


Question:
What can we obtain ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: the servicedescription


Question:
Can we obtain the effective properties for each namespace ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: Yes


Question:
Can we list the namespaces ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: Yes


Question:
Do we update each namespace ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: Yes


Question:
Can we obtain the servicedescription ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: Yes


Question:
Can we delete each namespace ?
```java
public void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }
```

Answer: Yes


Question:
Does the code add a protocol to the current pipeline this ?
```java
public void add ( Protocol protocol ) { if ( protocol List != null ) { protocol List . add ( protocol ) ; protocol . init ( user Connection ) ; } else { throw new Null Pointer Exception ( STRING ) ; } }
```

Answer: Yes


Question:
What does the code add to the current pipeline this ?
```java
public void add ( Protocol protocol ) { if ( protocol List != null ) { protocol List . add ( protocol ) ; protocol . init ( user Connection ) ; } else { throw new Null Pointer Exception ( STRING ) ; } }
```

Answer: a protocol


Question:
Will this call the . init method the current pipeline ?
```java
public void add ( Protocol protocol ) { if ( protocol List != null ) { protocol List . add ( protocol ) ; protocol . init ( user Connection ) ; } else { throw new Null Pointer Exception ( STRING ) ; } }
```

Answer: Yes


Question:
Does the code tell ?
```java
private boolean is Number ( String string ) { String s = string . trim ( ) ; if ( s . length ( ) < NUM ) return BOOL ; double value = NUM ; try { value = Double . parse Double ( s ) ; } catch ( Number Format Exception e ) { return BOOL ; } return BOOL ; }
```

Answer: Yes


Question:
Do the string contain a number ?
```java
private boolean is Number ( String string ) { String s = string . trim ( ) ; if ( s . length ( ) < NUM ) return BOOL ; double value = NUM ; try { value = Double . parse Double ( s ) ; } catch ( Number Format Exception e ) { return BOOL ; } return BOOL ; }
```

Answer: No


Question:
Does the code initialize the calculated values ?
```java
private void initialize Values ( ) { mn Size = Math . min ( get Measured Height ( ) , get Measured Width ( ) ) ; mn Ring Radius = ( int ) ( mn Size - mn Ring Width ) / NUM ; mn Inner Circle Radius = ( int ) ( mn Size - ( mn Ring Width * NUM ) ) / NUM ; mn View Center = mn Size / NUM ; mn Line Width = STATUS SYMBOL WIDTH PERCENT * mn Size ; }
```

Answer: Yes


Question:
Does the code create the gradle wrapper in the project in the project ?
```java
@ Visible For Testing public static boolean create Gradle Wrapper ( @ Not Null File project Dir Path , @ Not Null String gradle Version ) throws IO Exception { File project Wrapper Dir Path = new File ( project Dir Path , FD GRADLE WRAPPER ) ; if ( ! project Wrapper Dir Path . is Directory ( ) ) { File wrapper Src Dir Path = new File ( Template Manager . get Template Root Folder ( ) , FD GRADLE WRAPPER ) ; if ( ! wrapper Src Dir Path . exists ( ) ) { for ( File root : Template Manager . get Extra Template Root Folders ( ) ) { wrapper Src Dir Path = new File ( root , FD GRADLE WRAPPER ) ; if ( wrapper Src Dir Path . exists ( ) ) { break ; } else { wrapper Src Dir Path = null ; } } } if ( wrapper Src Dir Path == null ) { return BOOL ; } copy Dir Content ( wrapper Src Dir Path , project Dir Path ) ; } File wrapper Properties File = get Gradle Wrapper Properties File Path ( project Dir Path ) ; update Gradle Distribution Url ( gradle Version , wrapper Properties File ) ; return BOOL ; }
```

Answer: Yes


Question:
Does the code create the gradle wrapper in the project ?
```java
@ Visible For Testing public static boolean create Gradle Wrapper ( @ Not Null File project Dir Path , @ Not Null String gradle Version ) throws IO Exception { File project Wrapper Dir Path = new File ( project Dir Path , FD GRADLE WRAPPER ) ; if ( ! project Wrapper Dir Path . is Directory ( ) ) { File wrapper Src Dir Path = new File ( Template Manager . get Template Root Folder ( ) , FD GRADLE WRAPPER ) ; if ( ! wrapper Src Dir Path . exists ( ) ) { for ( File root : Template Manager . get Extra Template Root Folders ( ) ) { wrapper Src Dir Path = new File ( root , FD GRADLE WRAPPER ) ; if ( wrapper Src Dir Path . exists ( ) ) { break ; } else { wrapper Src Dir Path = null ; } } } if ( wrapper Src Dir Path == null ) { return BOOL ; } copy Dir Content ( wrapper Src Dir Path , project Dir Path ) ; } File wrapper Properties File = get Gradle Wrapper Properties File Path ( project Dir Path ) ; update Gradle Distribution Url ( gradle Version , wrapper Properties File ) ; return BOOL ; }
```

Answer: Yes


Question:
What have the same data ?
```java
@ Override public boolean equals ( final Object o ) { if ( this == o ) return BOOL ; if ( ! ( o instanceof Header ) ) { return BOOL ; } return name . equals ( ( ( Header ) o ) . name ) ; }
```

Answer: the headers


Question:
Do the headers have the same data ?
```java
@ Override public boolean equals ( final Object o ) { if ( this == o ) return BOOL ; if ( ! ( o instanceof Header ) ) { return BOOL ; } return name . equals ( ( ( Header ) o ) . name ) ; }
```

Answer: Yes


Question:
Does the code instantiate a new env var model ?
```java
public Env Var Model ( Environment Manager Interface env Mgr ) { this . env Mgr = env Mgr ; if ( columns . is Empty ( ) ) { columns . add ( Localisation . get String ( Env Var Dlg . class , STRING ) ) ; columns . add ( Localisation . get String ( Env Var Dlg . class , STRING ) ) ; columns . add ( Localisation . get String ( Env Var Dlg . class , STRING ) ) ; } }
```

Answer: Yes


Question:
Does the code create a copy of a bit string ?
```java
public Bit Vector ( Bit Vector s ) { bits = new int [ s . bits . length ] ; this . nbits = s . nbits ; System . arraycopy ( s . bits , NUM , this . bits , NUM , s . bits . length ) ; }
```

Answer: Yes


Question:
Does the code write the data for this segment to the stream in valid jpeg format ?
```java
void write ( Image Output Stream ios , JPEG Image Writer writer ) throws IO Exception { write ( ios , null , writer ) ; }
```

Answer: Yes


Question:
Does the code assume ?
```java
void write ( Image Output Stream ios , JPEG Image Writer writer ) throws IO Exception { write ( ios , null , writer ) ; }
```

Answer: Yes


Question:
Does the specified implement the proper interface so that we don ' t have to do that for every request ?
```java
@ Suppress Warnings ( STRING ) private Class validate Class ( Client Config cfg ) { Class clazz = null ; try { clazz = Class . for Name ( cfg . get Access Request Handler Classname ( ) ) ; } catch ( final Class Not Found Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } Object inst = null ; try { inst = Injector Holder . get Instance ( clazz ) ; } catch ( Configuration Exception | Provision Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } Access Request Handler handler = null ; try { handler = ( Access Request Handler ) inst ; } catch ( final Class Cast Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } return clazz ; }
```

Answer: Yes


Question:
What implements the proper interface so that we don ' t have to do that for every request ?
```java
@ Suppress Warnings ( STRING ) private Class validate Class ( Client Config cfg ) { Class clazz = null ; try { clazz = Class . for Name ( cfg . get Access Request Handler Classname ( ) ) ; } catch ( final Class Not Found Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } Object inst = null ; try { inst = Injector Holder . get Instance ( clazz ) ; } catch ( Configuration Exception | Provision Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } Access Request Handler handler = null ; try { handler = ( Access Request Handler ) inst ; } catch ( final Class Cast Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } return clazz ; }
```

Answer: the specified


Question:
Do we do that for every request ?
```java
@ Suppress Warnings ( STRING ) private Class validate Class ( Client Config cfg ) { Class clazz = null ; try { clazz = Class . for Name ( cfg . get Access Request Handler Classname ( ) ) ; } catch ( final Class Not Found Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } Object inst = null ; try { inst = Injector Holder . get Instance ( clazz ) ; } catch ( Configuration Exception | Provision Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } Access Request Handler handler = null ; try { handler = ( Access Request Handler ) inst ; } catch ( final Class Cast Exception e ) { LOG . error ( STRING + cfg . get Access Request Handler Classname ( ) + STRING + cfg . get Name ( ) + STRING , e ) ; return null ; } return clazz ; }
```

Answer: Yes


Question:
Do we pass in the alt - tab state ?
```java
void compute Min Max Scroll ( Array List < T > data , boolean launched With Alt Tab , boolean launched From Home ) { m Task Progress Map . clear ( ) ; if ( data . is Empty ( ) ) { m Min Scroll P = m Max Scroll P = NUM ; return ; } int task Height = m Task Rect . height ( ) ; float p At Bottom Of Stack Rect = screen Y To Curve Progress ( m Stack Visible Rect . bottom ) ; float p Within Affiliate Top = screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Within Affiliation Offset ) ; float scale = curve Progress To Scale ( p Within Affiliate Top ) ; int scale Y Offset = ( int ) ( ( ( NUM - scale ) * task Height ) / NUM ) ; p Within Affiliate Top = screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Within Affiliation Offset + scale Y Offset ) ; float p Within Affiliate Offset = p At Bottom Of Stack Rect - p Within Affiliate Top ; float p Between Affiliate Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Between Affiliation Offset ) ; float p Task Height Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - task Height ) ; float p Nav Bar Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - ( m Stack Visible Rect . bottom - m Stack Rect . bottom ) ) ; float p At Back Most Card Top = NUM ; float p At Front Most Card Top = p At Back Most Card Top ; int task Count = data . size ( ) ; for ( int i = NUM ; i < task Count ; i ++ ) { m Task Progress Map . put ( data . get ( i ) , p At Front Most Card Top ) ; if ( i < ( task Count - NUM ) ) { float p Peek = p Between Affiliate Offset ; p At Front Most Card Top += p Peek ; } } m Max Scroll P = p At Front Most Card Top - ( ( NUM - p Task Height Offset - p Nav Bar Offset ) ) ; m Min Scroll P = data . size ( ) == NUM ? Math . max ( m Max Scroll P , NUM ) : NUM ; if ( launched With Alt Tab && launched From Home ) { m Initial Scroll P = m Max Scroll P ; } else { m Initial Scroll P = p At Front Most Card Top - NUM ; } m Initial Scroll P = Math . min ( m Max Scroll P , Math . max ( NUM , m Initial Scroll P ) ) ; }
```

Answer: Yes


Question:
Does the code compute the minimum and maximum scroll progress values ?
```java
void compute Min Max Scroll ( Array List < T > data , boolean launched With Alt Tab , boolean launched From Home ) { m Task Progress Map . clear ( ) ; if ( data . is Empty ( ) ) { m Min Scroll P = m Max Scroll P = NUM ; return ; } int task Height = m Task Rect . height ( ) ; float p At Bottom Of Stack Rect = screen Y To Curve Progress ( m Stack Visible Rect . bottom ) ; float p Within Affiliate Top = screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Within Affiliation Offset ) ; float scale = curve Progress To Scale ( p Within Affiliate Top ) ; int scale Y Offset = ( int ) ( ( ( NUM - scale ) * task Height ) / NUM ) ; p Within Affiliate Top = screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Within Affiliation Offset + scale Y Offset ) ; float p Within Affiliate Offset = p At Bottom Of Stack Rect - p Within Affiliate Top ; float p Between Affiliate Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Between Affiliation Offset ) ; float p Task Height Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - task Height ) ; float p Nav Bar Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - ( m Stack Visible Rect . bottom - m Stack Rect . bottom ) ) ; float p At Back Most Card Top = NUM ; float p At Front Most Card Top = p At Back Most Card Top ; int task Count = data . size ( ) ; for ( int i = NUM ; i < task Count ; i ++ ) { m Task Progress Map . put ( data . get ( i ) , p At Front Most Card Top ) ; if ( i < ( task Count - NUM ) ) { float p Peek = p Between Affiliate Offset ; p At Front Most Card Top += p Peek ; } } m Max Scroll P = p At Front Most Card Top - ( ( NUM - p Task Height Offset - p Nav Bar Offset ) ) ; m Min Scroll P = data . size ( ) == NUM ? Math . max ( m Max Scroll P , NUM ) : NUM ; if ( launched With Alt Tab && launched From Home ) { m Initial Scroll P = m Max Scroll P ; } else { m Initial Scroll P = p At Front Most Card Top - NUM ; } m Initial Scroll P = Math . min ( m Max Scroll P , Math . max ( NUM , m Initial Scroll P ) ) ; }
```

Answer: Yes


Question:
Does we need to pass in the alt - tab state ?
```java
void compute Min Max Scroll ( Array List < T > data , boolean launched With Alt Tab , boolean launched From Home ) { m Task Progress Map . clear ( ) ; if ( data . is Empty ( ) ) { m Min Scroll P = m Max Scroll P = NUM ; return ; } int task Height = m Task Rect . height ( ) ; float p At Bottom Of Stack Rect = screen Y To Curve Progress ( m Stack Visible Rect . bottom ) ; float p Within Affiliate Top = screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Within Affiliation Offset ) ; float scale = curve Progress To Scale ( p Within Affiliate Top ) ; int scale Y Offset = ( int ) ( ( ( NUM - scale ) * task Height ) / NUM ) ; p Within Affiliate Top = screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Within Affiliation Offset + scale Y Offset ) ; float p Within Affiliate Offset = p At Bottom Of Stack Rect - p Within Affiliate Top ; float p Between Affiliate Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - m Between Affiliation Offset ) ; float p Task Height Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - task Height ) ; float p Nav Bar Offset = p At Bottom Of Stack Rect - screen Y To Curve Progress ( m Stack Visible Rect . bottom - ( m Stack Visible Rect . bottom - m Stack Rect . bottom ) ) ; float p At Back Most Card Top = NUM ; float p At Front Most Card Top = p At Back Most Card Top ; int task Count = data . size ( ) ; for ( int i = NUM ; i < task Count ; i ++ ) { m Task Progress Map . put ( data . get ( i ) , p At Front Most Card Top ) ; if ( i < ( task Count - NUM ) ) { float p Peek = p Between Affiliate Offset ; p At Front Most Card Top += p Peek ; } } m Max Scroll P = p At Front Most Card Top - ( ( NUM - p Task Height Offset - p Nav Bar Offset ) ) ; m Min Scroll P = data . size ( ) == NUM ? Math . max ( m Max Scroll P , NUM ) : NUM ; if ( launched With Alt Tab && launched From Home ) { m Initial Scroll P = m Max Scroll P ; } else { m Initial Scroll P = p At Front Most Card Top - NUM ; } m Initial Scroll P = Math . min ( m Max Scroll P , Math . max ( NUM , m Initial Scroll P ) ) ; }
```

Answer: Yes


Question:
Does the code compute the final values for edge functions ?
```java
private void compute Values ( ) { logger . debug ( STRING ) ; Map < N , Set < D > > all Seeds = new Hash Map < N , Set < D > > ( initial Seeds ) ; for ( N unbalanced Ret Site : unbalanced Ret Sites ) { Set < D > seeds = all Seeds . get ( unbalanced Ret Site ) ; if ( seeds == null ) { seeds = new Hash Set < D > ( ) ; all Seeds . put ( unbalanced Ret Site , seeds ) ; } seeds . add ( zero Value ) ; } for ( Entry < N , Set < D > > seed : all Seeds . entry Set ( ) ) { N start Point = seed . get Key ( ) ; for ( D val : seed . get Value ( ) ) { set Val ( start Point , val , value Lattice . bottom Element ( ) ) ; Pair < N , D > super Graph Node = new Pair < N , D > ( start Point , val ) ; schedule Value Processing ( new Value Propagation Task ( super Graph Node ) ) ; } } logger . debug ( STRING ) ; try { executor . await Completion ( ) ; } catch ( Interrupted Exception e ) { e . print Stack Trace ( ) ; } Set < N > all Non Call Start Nodes = icfg . all Non Call Start Nodes ( ) ; @ Suppress Warnings ( STRING ) N [ ] non Call Start Nodes Array = ( N [ ] ) new Object [ all Non Call Start Nodes . size ( ) ] ; int i = NUM ; for ( N n : all Non Call Start Nodes ) { non Call Start Nodes Array [ i ] = n ; i ++ ; } for ( int t = NUM ; t < num Threads ; t ++ ) { Value Computation Task task = new Value Computation Task ( non Call Start Nodes Array , t ) ; schedule Value Computation Task ( task ) ; } try { executor . await Completion ( ) ; } catch ( Interrupted Exception e ) { e . print Stack Trace ( ) ; } }
```

Answer: Yes


Question:
What did the code hardcod ?
```java
protected final static void init Hard Coded Properties ( Properties p ) { String Tokenizer tokenizer ; tokenizer = new String Tokenizer ( title , STRING ) ; tokenizer . next Token ( ) ; p . put ( Title , tokenizer . next Token ( ) ) ; tokenizer = new String Tokenizer ( version , STRING ) ; tokenizer . next Token ( ) ; p . put ( Version , tokenizer . next Token ( ) ) ; tokenizer = new String Tokenizer ( build , STRING ) ; tokenizer . next Token ( ) ; try { p . put ( Build Date , tokenizer . next Token ( ) ) ; } catch ( No Such Element Exception e ) { } }
```

Answer: default properties


Question:
Did the code hardcod default properties ?
```java
protected final static void init Hard Coded Properties ( Properties p ) { String Tokenizer tokenizer ; tokenizer = new String Tokenizer ( title , STRING ) ; tokenizer . next Token ( ) ; p . put ( Title , tokenizer . next Token ( ) ) ; tokenizer = new String Tokenizer ( version , STRING ) ; tokenizer . next Token ( ) ; p . put ( Version , tokenizer . next Token ( ) ) ; tokenizer = new String Tokenizer ( build , STRING ) ; tokenizer . next Token ( ) ; try { p . put ( Build Date , tokenizer . next Token ( ) ) ; } catch ( No Such Element Exception e ) { } }
```

Answer: Yes


Question:
Is a step moved in the pipeline any ?
```java
@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }
```

Answer: Yes


Question:
Do we re ?
```java
@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }
```

Answer: Yes


Question:
Do we sort the previews ?
```java
@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }
```

Answer: Yes


Question:
What do we sort ?
```java
@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }
```

Answer: the previews


Question:
Does all entities and character references replace in a specified string ?
```java
public static String replace All ( String source ) { int region Start = NUM ; for ( String entity = get Next Entity ( source , region Start ) ; entity != null ; entity = get Next Entity ( source , region Start ) ) { String replacement = Entity Map . get ( entity ) ; if ( replacement == null ) { region Start += entity . length ( ) ; continue ; } source = source . replace ( entity , replacement ) ; region Start += replacement . length ( ) ; } return source ; }
```

Answer: Yes


Question:
Does function hybrid - wumpus - agent return an action <br> ?
```java
@ Override public Action execute ( Percept percept ) { kb . make Percept Sentence ( ( Agent Percept ) percept , t ) ; kb . tell Temporal Physics Sentences ( t ) ; Agent Position current = kb . ask Current Position ( t ) ; Set < Room > safe = kb . ask Safe Rooms ( t ) ; if ( kb . ask Glitter ( t ) ) { Set < Room > goals = new Linked Hash Set < Room > ( ) ; goals . add ( new Room ( NUM , NUM ) ) ; plan . add ( new Grab ( ) ) ; plan . add All ( plan Route ( current , goals , safe ) ) ; plan . add ( new Climb ( ) ) ; } Set < Room > unvisited = kb . ask Unvisited Rooms ( t ) ; if ( plan . is Empty ( ) ) { plan . add All ( plan Route ( current , Set Ops . intersection ( unvisited , safe ) , safe ) ) ; } if ( plan . is Empty ( ) && kb . ask Have Arrow ( t ) ) { Set < Room > possible Wumpus = kb . ask Possible Wumpus Rooms ( t ) ; plan . add All ( plan Shot ( current , possible Wumpus , safe ) ) ; } if ( plan . is Empty ( ) ) { Set < Room > not Unsafe = kb . ask Not Unsafe Rooms ( t ) ; plan . add All ( plan Route ( current , Set Ops . intersection ( unvisited , not Unsafe ) , safe ) ) ; } if ( plan . is Empty ( ) ) { Set < Room > start = new Linked Hash Set < Room > ( ) ; start . add ( new Room ( NUM , NUM ) ) ; plan . add All ( plan Route ( current , start , safe ) ) ; plan . add ( new Climb ( ) ) ; } Action action = plan . remove ( ) ; kb . make Action Sentence ( action , t ) ; t = t + NUM ; return action ; }
```

Answer: Yes


Question:
Does the given value belong the bin ?
```java
private int find Bin ( double value ) { return Fast Math . min ( Fast Math . max ( ( int ) Fast Math . ceil ( ( value - min ) / delta ) - NUM , NUM ) , bin Count - NUM ) ; }
```

Answer: Yes


Question:
Where does the given value belong ?
```java
private int find Bin ( double value ) { return Fast Math . min ( Fast Math . max ( ( int ) Fast Math . ceil ( ( value - min ) / delta ) - NUM , NUM ) , bin Count - NUM ) ; }
```

Answer: the bin


Question:
Does the streaminputreader method reset the input stream count simply ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
Do the implementation of this class need to reopen the stream at the beginning of the source file ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
Does the implementation of this class reopen the stream at the beginning of the source file ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
Does the code close the current connection ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
Do the streaminputreader method close the input stream simply ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
Does the code reset the datainputstream to the beginning by closing the current connection and reopening it ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
What does the code reset to the beginning by closing the current connection and reopening it ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: the datainputstream


Question:
Does the code reopen it ?
```java
protected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }
```

Answer: Yes


Question:
Does it declare a serialversionuid ?
```java
public static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }
```

Answer: Yes


Question:
Does a class need to declare a serialversionuid , i . e . ?
```java
public static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }
```

Answer: Yes


Question:
Does a class declare a serialversionuid ?
```java
public static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }
```

Answer: Yes


Question:
Does it implement the java . io . serializable interface ?
```java
public static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }
```

Answer: Yes


Question:
Does the code resolve the given class name as primitive class if appropriate ?
```java
public static Class resolve Primitive Class Name ( String name ) { Class result = null ; if ( name != null && name . length ( ) <= NUM ) { result = primitive Type Name Map . get ( name ) ; } return result ; }
```

Answer: Yes


Question:
Does the code update the value graph to account for a given instruction ?
```java
private void process Instruction ( Instruction s ) { if ( s . is Dynamic Linking Point ( ) ) { process Call ( s ) ; } else if ( Move . conforms ( s ) ) { process Move ( s ) ; } else if ( s . operator ( ) == PI ) { process Pi ( s ) ; } else if ( New . conforms ( s ) ) { process New ( s ) ; } else if ( New Array . conforms ( s ) ) { process New Array ( s ) ; } else if ( Unary . conforms ( s ) ) { process Unary ( s ) ; } else if ( Guarded Unary . conforms ( s ) ) { process Guarded Unary ( s ) ; } else if ( Null Check . conforms ( s ) ) { process Null Check ( s ) ; } else if ( Zero Check . conforms ( s ) ) { process Zero Check ( s ) ; } else if ( Binary . conforms ( s ) ) { process Binary ( s ) ; } else if ( Guarded Binary . conforms ( s ) ) { process Guarded Binary ( s ) ; } else if ( Inline Guard . conforms ( s ) ) { process Inline Guard ( s ) ; } else if ( If Cmp . conforms ( s ) ) { process If Cmp ( s ) ; } else if ( Call . conforms ( s ) ) { process Call ( s ) ; } else if ( Monitor Op . conforms ( s ) ) { process Call ( s ) ; } else if ( Prepare . conforms ( s ) ) { process Call ( s ) ; } else if ( Attempt . conforms ( s ) ) { process Call ( s ) ; } else if ( Cache Op . conforms ( s ) ) { process Call ( s ) ; } else if ( A Load . conforms ( s ) ) { process A Load ( s ) ; } else if ( Put Field . conforms ( s ) ) { process Put Field ( s ) ; } else if ( Put Static . conforms ( s ) ) { process Put Static ( s ) ; } else if ( A Store . conforms ( s ) ) { process A Store ( s ) ; } else if ( Phi . conforms ( s ) ) { process Phi ( s ) ; } else if ( s . operator ( ) == IR PROLOGUE ) { process Prologue ( s ) ; } }
```

Answer: Yes


Question:
Did it perform the mqtt subscribe or unsubscribe when either the subscribe or unsubscribe buttons are pressed ?
```java
public void subscription ( String topic , int qos , boolean sub ) { set Title Text ( STRING ) ; if ( connected ) { try { String [ ] these Topics = new String [ NUM ] ; int [ ] these Qo S = new int [ NUM ] ; these Topics [ NUM ] = topic ; these Qo S [ NUM ] = qos ; synchronized ( this ) { if ( sub ) { write Logln ( STRING + topic + STRING + qos ) ; } else { write Logln ( STRING + topic ) ; } } if ( sub ) { mqtt . subscribe ( these Topics , these Qo S ) ; } else { mqtt . unsubscribe ( these Topics ) ; } } catch ( Exception ex ) { set Title Text ( STRING ) ; J Option Pane . show Message Dialog ( frame , ex . get Message ( ) , STRING , J Option Pane . ERROR MESSAGE ) ; } } else { set Title Text ( STRING ) ; } }
```

Answer: Yes


Question:
Are any exceptions caught in a dialog box ?
```java
public void subscription ( String topic , int qos , boolean sub ) { set Title Text ( STRING ) ; if ( connected ) { try { String [ ] these Topics = new String [ NUM ] ; int [ ] these Qo S = new int [ NUM ] ; these Topics [ NUM ] = topic ; these Qo S [ NUM ] = qos ; synchronized ( this ) { if ( sub ) { write Logln ( STRING + topic + STRING + qos ) ; } else { write Logln ( STRING + topic ) ; } } if ( sub ) { mqtt . subscribe ( these Topics , these Qo S ) ; } else { mqtt . unsubscribe ( these Topics ) ; } } catch ( Exception ex ) { set Title Text ( STRING ) ; J Option Pane . show Message Dialog ( frame , ex . get Message ( ) , STRING , J Option Pane . ERROR MESSAGE ) ; } } else { set Title Text ( STRING ) ; } }
```

Answer: Yes


Question:
Did it write an entry in the history log if the history window is open when either the subscribe or unsubscribe buttons are pressed ?
```java
public void subscription ( String topic , int qos , boolean sub ) { set Title Text ( STRING ) ; if ( connected ) { try { String [ ] these Topics = new String [ NUM ] ; int [ ] these Qo S = new int [ NUM ] ; these Topics [ NUM ] = topic ; these Qo S [ NUM ] = qos ; synchronized ( this ) { if ( sub ) { write Logln ( STRING + topic + STRING + qos ) ; } else { write Logln ( STRING + topic ) ; } } if ( sub ) { mqtt . subscribe ( these Topics , these Qo S ) ; } else { mqtt . unsubscribe ( these Topics ) ; } } catch ( Exception ex ) { set Title Text ( STRING ) ; J Option Pane . show Message Dialog ( frame , ex . get Message ( ) , STRING , J Option Pane . ERROR MESSAGE ) ; } } else { set Title Text ( STRING ) ; } }
```

Answer: Yes


Question:
Must it have an even multiple of 4 data characters ( not counting \ n ) , padded out with = as needed ?
```java
public byte [ ] decode ( String s ) { byte [ ] b = new byte [ ( s . length ( ) / NUM ) * NUM ] ; int cycle = NUM ; int combined = NUM ; int j = NUM ; int len = s . length ( ) ; int dummies = NUM ; for ( int i = NUM ; i < len ; i ++ ) { int c = s . char At ( i ) ; int value = ( c <= NUM ) ? char To Value [ c ] : IGNORE ; switch ( value ) { case IGNORE : break ; case PAD : value = NUM ; dummies ++ ; default : switch ( cycle ) { case NUM : combined = value ; cycle = NUM ; break ; case NUM : combined <<= NUM ; combined |= value ; cycle = NUM ; break ; case NUM : combined <<= NUM ; combined |= value ; cycle = NUM ; break ; case NUM : combined <<= NUM ; combined |= value ; b [ j + NUM ] = ( byte ) combined ; combined >>>= NUM ; b [ j + NUM ] = ( byte ) combined ; combined >>>= NUM ; b [ j ] = ( byte ) combined ; j += NUM ; cycle = NUM ; break ; } break ; } } if ( cycle != NUM ) { throw new Array Index Out Of Bounds Exception ( STRING ) ; } j -= dummies ; if ( b . length != j ) { byte [ ] b2 = new byte [ j ] ; System . arraycopy ( b , NUM , b2 , NUM , j ) ; b = b2 ; } return b ; }
```

Answer: Yes


Question:
Do this method mark parameter with the specified index as output ?
```java
public void register Out Param ( int index , int type ) throws SQL Exception { FB Procedure Param param = get Input Param ( index ) ; if ( param == null || param == Null Param . NULL PARAM ) { param = get Output Param ( index ) ; } else { add Output Param ( param ) ; if ( ! param . is Value Set ( ) ) { input Params . set ( param . get Position ( ) , null ) ; } } if ( param == null || param == Null Param . NULL PARAM ) { throw new SQL Exception ( STRING , SQL State Constants . SQL STATE INVALID COLUMN ) ; } param . set Type ( type ) ; }
```

Answer: Yes


Question:
What do this method mark with the specified index as output ?
```java
public void register Out Param ( int index , int type ) throws SQL Exception { FB Procedure Param param = get Input Param ( index ) ; if ( param == null || param == Null Param . NULL PARAM ) { param = get Output Param ( index ) ; } else { add Output Param ( param ) ; if ( ! param . is Value Set ( ) ) { input Params . set ( param . get Position ( ) , null ) ; } } if ( param == null || param == Null Param . NULL PARAM ) { throw new SQL Exception ( STRING , SQL State Constants . SQL STATE INVALID COLUMN ) ; } param . set Type ( type ) ; }
```

Answer: parameter


Question:
Is this used to output them as such ?
```java
void write Maps ( Enumeration maps ) throws IO Exception { if ( maps != null ) { while ( maps . has More Elements ( ) ) { Map map = ( Map ) maps . next Element ( ) ; String name = map . get Name ( ) ; incr Indent ( ) ; indent Smart ( ) ; write ( STRING ) ; if ( name != null ) { write ( STRING ) ; write ( name ) ; write ( STRING ) ; } else { write ( STRING ) ; } write Line Separator ( ) ; incr Indent ( ) ; Attribute Set [ ] areas = map . get Areas ( ) ; if ( areas != null ) { for ( int counter = NUM , max Counter = areas . length ; counter < max Counter ; counter ++ ) { indent Smart ( ) ; write ( STRING ) ; write Attributes ( areas [ counter ] ) ; write ( STRING ) ; write Line Separator ( ) ; } } decr Indent ( ) ; indent Smart ( ) ; write ( STRING ) ; write Line Separator ( ) ; decr Indent ( ) ; } } }
```

Answer: Yes


Question:
Did the code use to convert raw characters to their escaped version when these raw version can not be used as part of an ascii string literal ?
```java
protected String add escapes ( String str ) { String Buffer retval = new String Buffer ( ) ; char ch ; for ( int i = NUM ; i < str . length ( ) ; i ++ ) { switch ( str . char At ( i ) ) { case NUM : continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; case STRING : retval . append ( STRING ) ; continue ; default : if ( ( ch = str . char At ( i ) ) < NUM || ch > NUM ) { String s = STRING + Integer . to String ( ch , NUM ) ; retval . append ( STRING + s . substring ( s . length ( ) - NUM , s . length ( ) ) ) ; } else { retval . append ( ch ) ; } continue ; } } return retval . to String ( ) ; }
```

Answer: Yes


Question:
Do a string object represent this byte ' s value ?
```java
public java . lang . String to String ( ) { return Integer . to String ( value ) ; }
```

Answer: Yes


Question:
Is a pathiterator used to figure out the points to use to add to the toshape ?
```java
public static General Path append Shape Edge ( General Path to Shape , General Path add Shape , boolean line To ) { boolean DEBUG = Debug . debugging ( STRING ) ; int point Count = NUM ; if ( add Shape == null ) { return to Shape ; } if ( to Shape == null ) { return add Shape ; } to Shape . append ( add Shape , line To ) ; return to Shape ; }
```

Answer: Yes


Question:
Do the points use to add to the toshape ?
```java
public static General Path append Shape Edge ( General Path to Shape , General Path add Shape , boolean line To ) { boolean DEBUG = Debug . debugging ( STRING ) ; int point Count = NUM ; if ( add Shape == null ) { return to Shape ; } if ( to Shape == null ) { return add Shape ; } to Shape . append ( add Shape , line To ) ; return to Shape ; }
```

Answer: Yes


Question:
Do you want it to be a polygon ?
```java
public static General Path append Shape Edge ( General Path to Shape , General Path add Shape , boolean line To ) { boolean DEBUG = Debug . debugging ( STRING ) ; int point Count = NUM ; if ( add Shape == null ) { return to Shape ; } if ( to Shape == null ) { return add Shape ; } to Shape . append ( add Shape , line To ) ; return to Shape ; }
```

Answer: Yes


Question:
Do you close the path yourself ?
```java
public static General Path append Shape Edge ( General Path to Shape , General Path add Shape , boolean line To ) { boolean DEBUG = Debug . debugging ( STRING ) ; int point Count = NUM ; if ( add Shape == null ) { return to Shape ; } if ( to Shape == null ) { return add Shape ; } to Shape . append ( add Shape , line To ) ; return to Shape ; }
```

Answer: Yes


Question:
What is used to figure out the points to use to add to the toshape ?
```java
public static General Path append Shape Edge ( General Path to Shape , General Path add Shape , boolean line To ) { boolean DEBUG = Debug . debugging ( STRING ) ; int point Count = NUM ; if ( add Shape == null ) { return to Shape ; } if ( to Shape == null ) { return add Shape ; } to Shape . append ( add Shape , line To ) ; return to Shape ; }
```

Answer: a pathiterator


Question:
Do you need to close the path yourself if you want it to be a polygon ?
```java
public static General Path append Shape Edge ( General Path to Shape , General Path add Shape , boolean line To ) { boolean DEBUG = Debug . debugging ( STRING ) ; int point Count = NUM ; if ( add Shape == null ) { return to Shape ; } if ( to Shape == null ) { return add Shape ; } to Shape . append ( add Shape , line To ) ; return to Shape ; }
```

Answer: Yes


Question:
Does the code delete a specified authentication module instance ?
```java
public void delete Authentication Instance ( String name ) throws AM Configuration Exception { AM Authentication Instance instance = get Authentication Instance ( name ) ; if ( instance == null ) { throw new AM Configuration Exception ( BUNDLE NAME , STRING , new Object [ ] { name } ) ; } if ( is Module Instance In Use ( name ) ) { throw new AM Configuration Exception ( BUNDLE NAME , STRING , new Object [ ] { name } ) ; } String type = get Auth Instance Type ( name ) ; Service Config service Config = instance . get Service Config ( ) ; if ( service Config == null ) { throw new AM Configuration Exception ( BUNDLE NAME , STRING , new Object [ ] { type } ) ; } try { if ( name . equals ( type ) ) { Map attrs = service Config . get Attributes Without Defaults ( ) ; if ( attrs != null ) { service Config . remove Attributes ( attrs . key Set ( ) ) ; } } else { String service Name = service Config . get Service Name ( ) ; Service Config Manager scm = new Service Config Manager ( service Name , token ) ; Service Config org Config = scm . get Organization Config ( realm , null ) ; org Config . remove Sub Config ( name ) ; } if ( is Inherited Auth Instance ( name ) ) { Set < String > module Names = new Hash Set < String > ( ) ; module Names . add ( name ) ; org Service Config . remove Attribute Values ( IS Auth Constants . AUTH ALLOWED MODULES , module Names ) ; } if ( ! System Properties . is Server Mode ( ) ) { build Module Instance For Service ( realm , service Config . get Service Name ( ) ) ; } } catch ( Exception e ) { throw new AM Configuration Exception ( e ) ; } }
```

Answer: Yes


Question:
Do we make additional http requests in the current produce ( ) call ?
```java
private boolean should Make Request ( ) { boolean should Make Request = last Request Completed Time == - NUM ; should Make Request |= next != null ; should Make Request |= ( have More Pages && conf . pagination . mode != Pagination Mode . LINK HEADER ) ; should Make Request |= System . current Time Millis ( ) > last Request Completed Time + conf . polling Interval && conf . http Mode == Http Client Mode . POLLING ; return should Make Request ; }
```

Answer: Yes


Question:
Do we return the current batch ?
```java
private boolean should Make Request ( ) { boolean should Make Request = last Request Completed Time == - NUM ; should Make Request |= next != null ; should Make Request |= ( have More Pages && conf . pagination . mode != Pagination Mode . LINK HEADER ) ; should Make Request |= System . current Time Millis ( ) > last Request Completed Time + conf . polling Interval && conf . http Mode == Http Client Mode . POLLING ; return should Make Request ; }
```

Answer: Yes


Question:
Should we continue making additional http requests in the current produce ( ) call or whether to return the current batch ?
```java
private boolean should Make Request ( ) { boolean should Make Request = last Request Completed Time == - NUM ; should Make Request |= next != null ; should Make Request |= ( have More Pages && conf . pagination . mode != Pagination Mode . LINK HEADER ) ; should Make Request |= System . current Time Millis ( ) > last Request Completed Time + conf . polling Interval && conf . http Mode == Http Client Mode . POLLING ; return should Make Request ; }
```

Answer: Yes


Question:
What does a new ddl parser for mysql not include ?
```java
public My Sql Ddl Parser ( ) { super ( STRING ) ; }
```

Answer: view definitions


Question:
Does a new ddl parser for mysql include view definitions ?
```java
public My Sql Ddl Parser ( ) { super ( STRING ) ; }
```

Answer: No


Question:
Does the code create a new ddl parser for mysql that does not include view definitions ?
```java
public My Sql Ddl Parser ( ) { super ( STRING ) ; }
```

Answer: Yes


Question:
Does the code get current value of field mfirstdownloadrepeat ?
```java
public boolean is First Download Repeat ( ) throws Illegal Access Exception { return m First Download Repeat . get Boolean ( m Repeat Wrapper ) ; }
```

Answer: Yes


Question:
Did the code cretae a bufferedimage from an imageproducer ?
```java
public static Buffered Image create Image ( Image Producer producer ) { Pixel Grabber pg = new Pixel Grabber ( producer , NUM , NUM , - NUM , - NUM , null , NUM , NUM ) ; try { pg . grab Pixels ( ) ; } catch ( Interrupted Exception e ) { throw new Runtime Exception ( STRING ) ; } if ( ( pg . status ( ) & Image Observer . ABORT ) != NUM ) throw new Runtime Exception ( STRING ) ; if ( ( pg . status ( ) & Image Observer . ERROR ) != NUM ) throw new Runtime Exception ( STRING ) ; Buffered Image p = new Buffered Image ( pg . get Width ( ) , pg . get Height ( ) , Buffered Image . TYPE INT ARGB ) ; p . set RGB ( NUM , NUM , pg . get Width ( ) , pg . get Height ( ) , ( int [ ] ) pg . get Pixels ( ) , NUM , pg . get Width ( ) ) ; return p ; }
```

Answer: Yes


Question:
Do them exceed the max length of a tag entry ?
```java
private static Map . Entry < String , String > maybe Truncate Tag Entry ( Map . Entry < String , String > tag entry ) { String k = tag entry . get Key ( ) ; String v = tag entry . get Value ( ) ; if ( k . length ( ) + v . length ( ) <= MAX TAG KEY VAL CHARS - NUM ) return tag entry ; if ( k . length ( ) > TRUNCATE TAG NAME ) k = k . substring ( NUM , TRUNCATE TAG NAME ) ; if ( k . length ( ) + v . length ( ) > MAX TAG KEY VAL CHARS - NUM ) v = v . substring ( NUM , MAX TAG KEY VAL CHARS - NUM - k . length ( ) ) ; return Simple Map Entry . create ( k , v ) ; }
```

Answer: Yes


Question:
Did the user want to save the network ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: Yes


Question:
Do the saving process set to null the synapse sets ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: Yes


Question:
Do the saving process set the synapse sets to null ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: Yes


Question:
Does the user save the network ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: Yes


Question:
When did the user continue using the network since the saving process sets the synapse sets to null ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: after saving


Question:
Did the user continue using the network since the saving process sets the synapse sets to null after saving ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: Yes


Question:
Do the user use the network ?
```java
public void post Save Re Init ( ) { if ( is Use Group Level Settings ( ) ) { in Synapse Set = in Temp ; ex Synapse Set = ex Temp ; in Temp = null ; ex Temp = null ; } }
```

Answer: Yes


Question:
Does the passed status indicate ?
```java
protected boolean is Task Successful ( Task Status task Status ) { return ( Task Status . READY == task Status ) ; }
```

Answer: Yes


Question:
What does the code find by role name ?
```java
public Role find Role By Role Name ( String role Name ) { return role Repository . find Top By Role Name ( role Name ) ; }
```

Answer: role


Question:
Does the code find role by role name ?
```java
public Role find Role By Role Name ( String role Name ) { return role Repository . find Top By Role Name ( role Name ) ; }
```

Answer: Yes


Question:
Can rmiregistry accept incoming calls now ?
```java
public synchronized void start ( ) throws Remote Exception { if ( ! is Running ( ) ) { if ( ssf != null ) { registry = Locate Registry . create Registry ( port , null , ssf ) ; } else { registry = Locate Registry . create Registry ( port ) ; } is Running = BOOL ; } }
```

Answer: Yes


Question:
What can rmiregistry accept now ?
```java
public synchronized void start ( ) throws Remote Exception { if ( ! is Running ( ) ) { if ( ssf != null ) { registry = Locate Registry . create Registry ( port , null , ssf ) ; } else { registry = Locate Registry . create Registry ( port ) ; } is Running = BOOL ; } }
```

Answer: incoming calls


Question:
Is this method used to delete the workflow matrix details ?
```java
@ Transactional public void delete Work Flowfor Object ( final Map workflowsearchparams ) { final Criteria work Flow Crit = get Criteria For Deleteor Modify ( workflowsearchparams ) ; for ( final Work Flow Matrix matrix : ( List < Work Flow Matrix > ) work Flow Crit . list ( ) ) { workflow Matrix Repository . delete ( matrix ) ; } }
```

Answer: Yes


Question:
Is this method called to clear any actions that have not been completed ?
```java
protected synchronized void clear Remaining Actions ( ) { for ( int i = active Action List . size ( ) - NUM ; i >= NUM ; i -- ) { Transit Section Action tsa = active Action List . get ( i ) ; Thread t = tsa . get Waiting Thread ( ) ; if ( t != null ) { t . interrupt ( ) ; } if ( tsa . get Waiting For Sensor ( ) ) { tsa . dispose Sensor Listener ( ) ; } tsa . initialize ( ) ; active Action List . remove ( i ) ; } }
```

Answer: Yes


Question:
Do a sequence number add at the rear of the given fileext ?
```java
private static String gen Class ID ( String file Ext , int reg Level ) { boolean is Cls ID Exist = BOOL ; String appendix , tem Cls ID , tem Cls ID Key , tem File Ext ; tem File Ext = file Ext . trim ( ) ; if ( tem File Ext . char At ( NUM ) == STRING ) { tem File Ext = tem File Ext . substring ( NUM ) ; } int i = NUM ; while ( ( is Cls ID Exist ) && ( i < MAX CLSID NUMBER ) ) { appendix = Integer . to String ( i ) ; tem Cls ID = STRING + tem File Ext + appendix ; if ( tem Cls ID != null ) { tem Cls ID Key = get Cls ID Key ( tem Cls ID , reg Level ) ; if ( tem Cls ID Key != null ) { is Cls ID Exist = is Sub Key Exist ( tem Cls ID Key , reg Level ) ; if ( ! is Cls ID Exist ) { return tem Cls ID ; } } } i ++ ; } return null ; }
```

Answer: Yes


Question:
Till when do the signalbarrier and block claim ?
```java
public void await ( ) throws Interrupted Exception { Thread t = Thread . current Thread ( ) ; if ( ! owner Access . compare And Set ( this , null , t ) ) { throw new Illegal State Exception ( STRING ) ; } Lock Support . park ( this ) ; owner Access . compare And Set ( this , t , null ) ; if ( t . is Interrupted ( ) ) throw new Interrupted Exception ( ) ; }
```

Answer: until signaled


Question:
Does the code carry all overflows to the more significant bits / bytes over ?
```java
public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return copy ; } } byte [ ] out = new byte [ copy . length + NUM ] ; out [ NUM ] = NUM ; System . arraycopy ( copy , NUM , out , NUM , copy . length ) ; return out ; }
```

Answer: Yes


Question:
What does the code carry to the more significant bits / bytes over ?
```java
public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return copy ; } } byte [ ] out = new byte [ copy . length + NUM ] ; out [ NUM ] = NUM ; System . arraycopy ( copy , NUM , out , NUM , copy . length ) ; return out ; }
```

Answer: all overflows


Question:
Does the code treat the byte [ ] as an unsigned series of bytes , most significant bits first ?
```java
public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return copy ; } } byte [ ] out = new byte [ copy . length + NUM ] ; out [ NUM ] = NUM ; System . arraycopy ( copy , NUM , out , NUM , copy . length ) ; return out ; }
```

Answer: Yes


Question:
Does the first ( last added ) element remove in the stack ?
```java
public T pop ( ) { length -- ; return elements . remove ( length ) ; }
```

Answer: Yes


Question:
Are any nan values in either a or b ignored in computing the error ?
```java
public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; } } return sum ; }
```

Answer: Yes


Question:
Does the code build the sum of the squared difference of all elements with the same index numbers in the arrays ?
```java
public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; } } return sum ; }
```

Answer: Yes


Question:
Does the code find the last assignment to the given string local by searching upwards from the given statement ?
```java
private String find Last String Assignment ( Stmt stmt , Local local , Bi Di Interprocedural CFG < Unit , Soot Method > cfg ) { if ( stmt instanceof Assign Stmt ) { Assign Stmt assign = ( Assign Stmt ) stmt ; if ( assign . get Left Op ( ) == local ) { if ( assign . get Right Op ( ) instanceof String Constant ) return ( ( String Constant ) assign . get Right Op ( ) ) . value ; } } for ( Unit pred : cfg . get Preds Of ( stmt ) ) { if ( ! ( pred instanceof Stmt ) ) continue ; String last Assignment = find Last String Assignment ( ( Stmt ) pred , local , cfg ) ; if ( last Assignment != null ) return last Assignment ; } return null ; }
```

Answer: Yes


Question:
What does the code add into redis for application server and management console ?
```java
@ Override public void create Redis App Key ( Application application , String docker Manager IP , String server Port , String server Manager Port ) { String suffix Cloud Unit = application . get Suffix Cloud Unit IO ( ) ; Jedis Pool pool = null ; Jedis jedis = null ; try { pool = new Jedis Pool ( new Jedis Pool Config ( ) , redis Ip , Integer . parse Int ( redis Port ) , NUM ) ; jedis = pool . get Resource ( ) ; String sub Name Space = concat Sub Name Space ( application ) ; String key = sub Name Space + suffix Cloud Unit ; String frontend = STRING + key . to Lower Case ( ) ; jedis . rpush ( frontend , key . to Lower Case ( ) ) ; jedis . rpush ( frontend , STRING + docker Manager IP + STRING + server Port ) ; String frontend Server Manager = STRING + key . to Lower Case ( ) ; jedis . rpush ( frontend Server Manager , key . to Lower Case ( ) ) ; jedis . rpush ( frontend Server Manager , STRING + docker Manager IP + STRING + server Manager Port ) ; } catch ( Jedis Connection Exception | Unsupported Encoding Exception e ) { logger . error ( STRING , e ) ; } finally { if ( jedis != null ) { pool . destroy ( ) ; } } }
```

Answer: two keys


Question:
Does the code add two keys into redis for application server and management console ?
```java
@ Override public void create Redis App Key ( Application application , String docker Manager IP , String server Port , String server Manager Port ) { String suffix Cloud Unit = application . get Suffix Cloud Unit IO ( ) ; Jedis Pool pool = null ; Jedis jedis = null ; try { pool = new Jedis Pool ( new Jedis Pool Config ( ) , redis Ip , Integer . parse Int ( redis Port ) , NUM ) ; jedis = pool . get Resource ( ) ; String sub Name Space = concat Sub Name Space ( application ) ; String key = sub Name Space + suffix Cloud Unit ; String frontend = STRING + key . to Lower Case ( ) ; jedis . rpush ( frontend , key . to Lower Case ( ) ) ; jedis . rpush ( frontend , STRING + docker Manager IP + STRING + server Port ) ; String frontend Server Manager = STRING + key . to Lower Case ( ) ; jedis . rpush ( frontend Server Manager , key . to Lower Case ( ) ) ; jedis . rpush ( frontend Server Manager , STRING + docker Manager IP + STRING + server Manager Port ) ; } catch ( Jedis Connection Exception | Unsupported Encoding Exception e ) { logger . error ( STRING , e ) ; } finally { if ( jedis != null ) { pool . destroy ( ) ; } } }
```

Answer: Yes


Question:
Does the behavior of the method test in the case of null input char array ?
```java
public void test PBE Key Spec 1 ( ) { try { PBE Key Spec pbeks = new PBE Key Spec ( null ) ; assert True ( STRING + STRING , pbeks . get Password ( ) . length == NUM ) ; } catch ( Null Pointer Exception e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBE Key Spec pbeks = new PBE Key Spec ( password ) ; password [ NUM ] ++ ; assert False ( STRING + STRING , password [ NUM ] == pbeks . get Password ( ) [ NUM ] ) ; }
```

Answer: Yes


Question:
Does pbekeyspec ( char [ ] test ?
```java
public void test PBE Key Spec 1 ( ) { try { PBE Key Spec pbeks = new PBE Key Spec ( null ) ; assert True ( STRING + STRING , pbeks . get Password ( ) . length == NUM ) ; } catch ( Null Pointer Exception e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBE Key Spec pbeks = new PBE Key Spec ( password ) ; password [ NUM ] ++ ; assert False ( STRING + STRING , password [ NUM ] == pbeks . get Password ( ) [ NUM ] ) ; }
```

Answer: Yes


Question:
Does this interactive exchange allow user to trust the ssl at the first time browsing this site ?
```java
@ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + tenant ) ; try { Relying Party rp = validate Relying Party ( request , tenant ) ; if ( rp != null ) { logger . info ( STRING + rp . get Url ( ) ) ; URL rp Url = new URL ( rp . get Url ( ) ) ; URL redirect Url = new URL ( rp Url . get Protocol ( ) , rp Url . get Host ( ) , rp Url . get Port ( ) , STRING ) ; String redirect Url Str = redirect Url . to String ( ) + STRING + sso SSL Dummy Query String ( request ) ; response . send Redirect ( redirect Url Str ) ; } else { logger . error ( STRING + tenant + STRING ) ; send Error ( locale , response , STRING ) ; } } catch ( Exception e ) { logger . error ( STRING , e ) ; send Error ( locale , response , e . get Localized Message ( ) ) ; } }
```

Answer: Yes


Question:
Do user trust the ssl at the first time ?
```java
@ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + tenant ) ; try { Relying Party rp = validate Relying Party ( request , tenant ) ; if ( rp != null ) { logger . info ( STRING + rp . get Url ( ) ) ; URL rp Url = new URL ( rp . get Url ( ) ) ; URL redirect Url = new URL ( rp Url . get Protocol ( ) , rp Url . get Host ( ) , rp Url . get Port ( ) , STRING ) ; String redirect Url Str = redirect Url . to String ( ) + STRING + sso SSL Dummy Query String ( request ) ; response . send Redirect ( redirect Url Str ) ; } else { logger . error ( STRING + tenant + STRING ) ; send Error ( locale , response , STRING ) ; } } catch ( Exception e ) { logger . error ( STRING , e ) ; send Error ( locale , response , e . get Localized Message ( ) ) ; } }
```

Answer: Yes


Question:
Do handle ssl for ngc be to host login page from iframe which would fails silently if the server site is not trusted by browser ?
```java
@ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + tenant ) ; try { Relying Party rp = validate Relying Party ( request , tenant ) ; if ( rp != null ) { logger . info ( STRING + rp . get Url ( ) ) ; URL rp Url = new URL ( rp . get Url ( ) ) ; URL redirect Url = new URL ( rp Url . get Protocol ( ) , rp Url . get Host ( ) , rp Url . get Port ( ) , STRING ) ; String redirect Url Str = redirect Url . to String ( ) + STRING + sso SSL Dummy Query String ( request ) ; response . send Redirect ( redirect Url Str ) ; } else { logger . error ( STRING + tenant + STRING ) ; send Error ( locale , response , STRING ) ; } } catch ( Exception e ) { logger . error ( STRING , e ) ; send Error ( locale , response , e . get Localized Message ( ) ) ; } }
```

Answer: Yes


Question:
What do user trust at the first time ?
```java
@ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + tenant ) ; try { Relying Party rp = validate Relying Party ( request , tenant ) ; if ( rp != null ) { logger . info ( STRING + rp . get Url ( ) ) ; URL rp Url = new URL ( rp . get Url ( ) ) ; URL redirect Url = new URL ( rp Url . get Protocol ( ) , rp Url . get Host ( ) , rp Url . get Port ( ) , STRING ) ; String redirect Url Str = redirect Url . to String ( ) + STRING + sso SSL Dummy Query String ( request ) ; response . send Redirect ( redirect Url Str ) ; } else { logger . error ( STRING + tenant + STRING ) ; send Error ( locale , response , STRING ) ; } } catch ( Exception e ) { logger . error ( STRING , e ) ; send Error ( locale , response , e . get Localized Message ( ) ) ; } }
```

Answer: the ssl


Question:
What does uri represent ?
```java
public static boolean is SSH ( String uri ) { return uri != null && uri . starts With ( STRING ) ; }
```

Answer: ssh connection


Question:
Does uri represent ssh connection ?
```java
public static boolean is SSH ( String uri ) { return uri != null && uri . starts With ( STRING ) ; }
```

Answer: Yes


Question:
Does the code select a format from a custom pattern ?
```java
private static Date Time Formatter create Formatter For Pattern ( String pattern ) { if ( pattern == null || pattern . length ( ) == NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Date Time Formatter formatter = null ; synchronized ( c Patterned Cache ) { formatter = c Patterned Cache . get ( pattern ) ; if ( formatter == null ) { Date Time Formatter Builder builder = new Date Time Formatter Builder ( ) ; parse Pattern To ( builder , pattern ) ; formatter = builder . to Formatter ( ) ; c Patterned Cache . put ( pattern , formatter ) ; } } return formatter ; }
```

Answer: Yes


Question:
What should be not constructed in standard programming ?
```java
private Grid Filename Utils ( ) { }
```

Answer: instances


Question:
Should instances be constructed in standard programming ?
```java
private Grid Filename Utils ( ) { }
```

Answer: No


Question:
Does the code append the given column specification to the right hand side of all columns ?
```java
public void append Column ( Column Spec column Spec ) { check Not Null ( column Spec , STRING ) ; col Specs . add ( column Spec ) ; }
```

Answer: Yes


Question:
Does the code compare ?
```java
static boolean less Equal ( Object v1 , Object v2 ) { v1 = maybe Convert To String ( v1 ) ; v2 = maybe Convert To String ( v2 ) ; if ( Objects . equals ( v1 , v2 ) ) { return BOOL ; } return less ( v1 , v2 ) ; }
```

Answer: Yes


Question:
Does the code add a new workspace component to the archive ?
```java
Archived Component add Component ( final Workspace Component workspace Component ) { Archived Component component = new Archived Component ( serializer , workspace Component ) ; archived Components . add ( component ) ; component Uris . put ( workspace Component , component . uri ) ; return component ; }
```

Answer: Yes


Question:
Does the code create a new nodesearch instance with filters ?
```java
public Node Search ( Accessibility Service accessibility Service , Custom Label Manager label Manager , Search Text Formatter text Formatter , List < Search Result Filter > filters ) { this ( accessibility Service , label Manager , text Formatter ) ; m Filters . add All ( filters ) ; }
```

Answer: Yes


Question:
Does the code create a generic uri from the given string ?
```java
public URI ( String nuri ) throws Malformed URI Exception { uri = nuri ; colon Location = nuri . index Of ( STRING ) ; fragment Location = URI Classifier . get Fragment Location ( nuri ) ; if ( colon Location == - NUM || colon Location > fragment Location || colon Location == NUM ) throw new Malformed URI Exception ( STRING + uri + STRING , uri ) ; }
```

Answer: Yes


Question:
Does the mutator do anything on an empty collection actually ?
```java
private static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }
```

Answer: Yes


Question:
What do calling a mutator throws always ?
```java
private static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }
```

Answer: uoe


Question:
Do calling a mutator throws uoe always ?
```java
private static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }
```

Answer: Yes


Question:
Does the mutator do anything actually on an empty collection ?
```java
private static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }
```

Answer: Yes


Question:
Is java . time found on classpath ?
```java
public static boolean has Three Ten ( ) { try { Class . for Name ( STRING ) ; return BOOL ; } catch ( Class Not Found Exception e ) { return BOOL ; } }
```

Answer: Yes


Question:
Does the code find all implementations of a particular interface ?
```java
public static List < Class < ? > > find All Implementations ( Class < ? > restriction Class ) { if ( restriction Class == null ) { return Collections . empty List ( ) ; } if ( ! contains ( restriction Class ) ) { ELKI Service Loader . load ( restriction Class ) ; ELKI Service Scanner . load ( restriction Class ) ; } Entry e = data . get ( restriction Class ) ; if ( e == null ) { return Collections . empty List ( ) ; } Array List < Class < ? > > ret = new Array List < > ( e . len ) ; for ( int pos = NUM ; pos < e . len ; pos ++ ) { Class < ? > c = e . clazzes [ pos ] ; if ( c == null ) { c = try Load Class ( e . names [ pos ] ) ; if ( c == null ) { LOG . warning ( STRING + e . names [ pos ] + STRING + restriction Class . get Name ( ) ) ; c = FAILED LOAD ; } e . clazzes [ pos ] = c ; } if ( c == FAILED LOAD ) { continue ; } if ( ! ret . contains ( c ) ) { ret . add ( c ) ; } } return ret ; }
```

Answer: Yes


Question:
Did the method use to add a file for the recent menu ?
```java
public void add Recent File ( File f ) { if ( null != f ) { recent Files . add ( f ) ; } }
```

Answer: Yes


Question:
Do a flag indicate ?
```java
public static boolean verbose ( ) { return c Verbose . get ( ) ; }
```

Answer: Yes


Question:
Does the code get a flag indicating that verbose logging is required ?
```java
public static boolean verbose ( ) { return c Verbose . get ( ) ; }
```

Answer: Yes


Question:
Does the computed classpath contain the jre ?
```java
public void test Compute Classpath For Jre ( ) throws Core Exception { assert Equals ( NUM , java Project A . get Raw Classpath ( ) . length ) ; List < File > actual Cp = get List Of Files ( GWT Compile Runner . compute Classpath ( java Project A ) ) ; assert Equals ( NUM , actual Cp . size ( ) ) ; }
```

Answer: No


Question:
What does the computed classpath not contain ?
```java
public void test Compute Classpath For Jre ( ) throws Core Exception { assert Equals ( NUM , java Project A . get Raw Classpath ( ) . length ) ; List < File > actual Cp = get List Of Files ( GWT Compile Runner . compute Classpath ( java Project A ) ) ; assert Equals ( NUM , actual Cp . size ( ) ) ; }
```

Answer: the jre


Question:
Do the cut the text into blocks of at least block_minimum_character_size characters , aligned on the ends of paragraphs ?
```java
private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Offset ( offset ) ; offset += BLOCK MINIMUM CHARACTER LENGTH ; } } m Block Indices = new int [ m Block End Lines . length ] ; for ( int i = NUM ; i < m Block End Lines . length ; i ++ ) { m Block Indices [ i ] = INVALID BLOCK INDEX ; } }
```

Answer: Yes


Question:
Does the code create the initial block structure cutting the text into blocks of at least block_minimum_character_size characters , aligned on the ends of paragraphs ?
```java
private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Offset ( offset ) ; offset += BLOCK MINIMUM CHARACTER LENGTH ; } } m Block Indices = new int [ m Block End Lines . length ] ; for ( int i = NUM ; i < m Block End Lines . length ; i ++ ) { m Block Indices [ i ] = INVALID BLOCK INDEX ; } }
```

Answer: Yes


Question:
Did blocks of at least block_minimum_character_size characters align on the ends of paragraphs ?
```java
private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Offset ( offset ) ; offset += BLOCK MINIMUM CHARACTER LENGTH ; } } m Block Indices = new int [ m Block End Lines . length ] ; for ( int i = NUM ; i < m Block End Lines . length ; i ++ ) { m Block Indices [ i ] = INVALID BLOCK INDEX ; } }
```

Answer: Yes


Question:
Does it place them into the first empty slot if items are still left after doing so if items are still left after doing so ?
```java
public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get Amount ( ) > NUM ; s += NUM ) { int start = slots [ s ] ; int end = slots [ s + NUM ] ; int delta = start < end ? NUM : - NUM ; for ( int i = start ; i != end && stack . get Amount ( ) > NUM ; i += delta ) { if ( ! item Shift Click Allowed ( i , stack ) ) { continue ; } Item Stack current Stack = get Item ( i ) ; if ( current Stack == null ) { if ( stack . get Amount ( ) > stack . get Max Stack Size ( ) ) { set Item ( i , max Stack ) ; stack . set Amount ( stack . get Amount ( ) - stack . get Max Stack Size ( ) ) ; } else { Item Stack final Stack = stack . clone ( ) ; set Item ( i , final Stack ) ; stack . set Amount ( NUM ) ; } } else if ( current Stack . is Similar ( stack ) ) { int amount = current Stack . get Amount ( ) ; int max Stack Size = Math . min ( current Stack . get Max Stack Size ( ) , get Max Stack Size ( ) ) ; int transfer = Math . min ( stack . get Amount ( ) , max Stack Size - amount ) ; if ( transfer > NUM ) { current Stack . set Amount ( amount + transfer ) ; stack . set Amount ( stack . get Amount ( ) - transfer ) ; } set Item ( i , current Stack ) ; } } } if ( stack . get Amount ( ) <= NUM ) { stack = null ; } return stack ; }
```

Answer: Yes


Question:
How are the slots supplied first ?
```java
public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get Amount ( ) > NUM ; s += NUM ) { int start = slots [ s ] ; int end = slots [ s + NUM ] ; int delta = start < end ? NUM : - NUM ; for ( int i = start ; i != end && stack . get Amount ( ) > NUM ; i += delta ) { if ( ! item Shift Click Allowed ( i , stack ) ) { continue ; } Item Stack current Stack = get Item ( i ) ; if ( current Stack == null ) { if ( stack . get Amount ( ) > stack . get Max Stack Size ( ) ) { set Item ( i , max Stack ) ; stack . set Amount ( stack . get Amount ( ) - stack . get Max Stack Size ( ) ) ; } else { Item Stack final Stack = stack . clone ( ) ; set Item ( i , final Stack ) ; stack . set Amount ( NUM ) ; } } else if ( current Stack . is Similar ( stack ) ) { int amount = current Stack . get Amount ( ) ; int max Stack Size = Math . min ( current Stack . get Max Stack Size ( ) , get Max Stack Size ( ) ) ; int transfer = Math . min ( stack . get Amount ( ) , max Stack Size - amount ) ; if ( transfer > NUM ) { current Stack . set Amount ( amount + transfer ) ; stack . set Amount ( stack . get Amount ( ) - transfer ) ; } set Item ( i , current Stack ) ; } } } if ( stack . get Amount ( ) <= NUM ) { stack = null ; } return stack ; }
```

Answer: in pairs


Question:
Will this try to fill up all partial slots first ?
```java
public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get Amount ( ) > NUM ; s += NUM ) { int start = slots [ s ] ; int end = slots [ s + NUM ] ; int delta = start < end ? NUM : - NUM ; for ( int i = start ; i != end && stack . get Amount ( ) > NUM ; i += delta ) { if ( ! item Shift Click Allowed ( i , stack ) ) { continue ; } Item Stack current Stack = get Item ( i ) ; if ( current Stack == null ) { if ( stack . get Amount ( ) > stack . get Max Stack Size ( ) ) { set Item ( i , max Stack ) ; stack . set Amount ( stack . get Amount ( ) - stack . get Max Stack Size ( ) ) ; } else { Item Stack final Stack = stack . clone ( ) ; set Item ( i , final Stack ) ; stack . set Amount ( NUM ) ; } } else if ( current Stack . is Similar ( stack ) ) { int amount = current Stack . get Amount ( ) ; int max Stack Size = Math . min ( current Stack . get Max Stack Size ( ) , get Max Stack Size ( ) ) ; int transfer = Math . min ( stack . get Amount ( ) , max Stack Size - amount ) ; if ( transfer > NUM ) { current Stack . set Amount ( amount + transfer ) ; stack . set Amount ( stack . get Amount ( ) - transfer ) ; } set Item ( i , current Stack ) ; } } } if ( stack . get Amount ( ) <= NUM ) { stack = null ; } return stack ; }
```

Answer: Yes


Question:
Do this fill all partial slots ?
```java
public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get Amount ( ) > NUM ; s += NUM ) { int start = slots [ s ] ; int end = slots [ s + NUM ] ; int delta = start < end ? NUM : - NUM ; for ( int i = start ; i != end && stack . get Amount ( ) > NUM ; i += delta ) { if ( ! item Shift Click Allowed ( i , stack ) ) { continue ; } Item Stack current Stack = get Item ( i ) ; if ( current Stack == null ) { if ( stack . get Amount ( ) > stack . get Max Stack Size ( ) ) { set Item ( i , max Stack ) ; stack . set Amount ( stack . get Amount ( ) - stack . get Max Stack Size ( ) ) ; } else { Item Stack final Stack = stack . clone ( ) ; set Item ( i , final Stack ) ; stack . set Amount ( NUM ) ; } } else if ( current Stack . is Similar ( stack ) ) { int amount = current Stack . get Amount ( ) ; int max Stack Size = Math . min ( current Stack . get Max Stack Size ( ) , get Max Stack Size ( ) ) ; int transfer = Math . min ( stack . get Amount ( ) , max Stack Size - amount ) ; if ( transfer > NUM ) { current Stack . set Amount ( amount + transfer ) ; stack . set Amount ( stack . get Amount ( ) - transfer ) ; } set Item ( i , current Stack ) ; } } } if ( stack . get Amount ( ) <= NUM ) { stack = null ; } return stack ; }
```

Answer: Yes


Question:
Does the code create a national number from a number string ?
```java
private String number To National ( String number ) { final Phone Number Util util = Phone Number Util . get Instance ( ) ; try { final Phonenumber . Phone Number phone Number = util . parse ( number , m Country Code ) ; return String . value Of ( phone Number . get National Number ( ) ) ; } catch ( Number Parse Exception e ) { return STRING ; } }
```

Answer: Yes


Question:
Does the code restore the original headless setting of when the jvm was started ?
```java
public static void restore Headless Mode ( ) { if ( Graphics Environment . is Headless ( ) && ! is Default Headless ) { set Headless ( BOOL ) ; } }
```

Answer: Yes


Question:
Does the code generate a set of n random distinct byte [ ] keys in sorted order in sorted order ?
```java
public byte [ ] [ ] generate Keys ( final int nkeys ) { if ( nkeys < NUM ) throw new Illegal Argument Exception ( ) ; if ( nkeys > max Keys ) throw new Illegal Argument Exception ( ) ; final Set < byte [ ] > set = new Tree Set < byte [ ] > ( Bytes Util . Unsigned Byte Array Comparator . INSTANCE ) ; final byte [ ] [ ] keys = new byte [ max Keys ] [ ] ; int n = NUM ; while ( n < max Keys ) { final byte [ ] key = new byte [ r . next Int ( max Key Length ) + NUM ] ; r . next Bytes ( key ) ; if ( set . add ( key ) ) { keys [ n ++ ] = key ; } } Arrays . sort ( keys , Bytes Util . Unsigned Byte Array Comparator . INSTANCE ) ; for ( int i = nkeys ; i < max Keys ; i ++ ) { keys [ i ] = null ; } return keys ; }
```

Answer: Yes


Question:
Does the method expect a string ?
```java
public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password Verification Prefix ( ) ) ; }
```

Answer: Yes


Question:
Does the method allow to set the password verification prefix ?
```java
public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password Verification Prefix ( ) ) ; }
```

Answer: Yes


Question:
Does which set the password verification prefix ?
```java
public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password Verification Prefix ( ) ) ; }
```

Answer: Yes


Question:
Do no rows satisfy the criteria ?
```java
public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) ) { return null ; } else if ( result List . size ( ) == NUM ) { return result List . get ( NUM ) ; } else { throw new SQL Exception ( String . format ( STRING , result List . size ( ) ) ) ; } }
```

Answer: Yes


Question:
Do more than one row satisfy the criteria ?
```java
public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) ) { return null ; } else if ( result List . size ( ) == NUM ) { return result List . get ( NUM ) ; } else { throw new SQL Exception ( String . format ( STRING , result List . size ( ) ) ) ; } }
```

Answer: Yes


Question:
Does the entire method need to be synchronized since this includes taking the event out from the queue and processing the event since this includes taking the event out from the queue and processing the event ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: No


Question:
Do we need to provide exclusive access over the code where an event is removed from the queue only ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: Yes


Question:
Do we provide exclusive access over the code where an event is removed from the queue ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: Yes


Question:
Where is an event removed from the queue ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: where


Question:
What does we take from the queue ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: the event


Question:
Is an event removed from the queue where ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: Yes


Question:
What is removed from the queue where ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: an event


Question:
Does we take the event from the queue ?
```java
void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait ( wait Time ) ; } else { wait ( ) ; } } } catch ( Interrupted Exception e ) { } if ( event Queue . size ( ) > NUM ) { event Info = ( Event Info ) event Queue . remove ( NUM ) ; } } if ( event Info != null ) { process Event ( event Info ) ; } else { if ( auto Closing Clips . size ( ) > NUM ) { close Auto Closing Clips ( ) ; } if ( line Monitors . size ( ) > NUM ) { monitor Lines ( ) ; } } }
```

Answer: Yes


Question:
Does the url represent a local db ?
```java
public static boolean is Local DB ( String db URL ) throws Invalid Exception { if ( db URL == null ) { throw new Invalid Exception ( STRING ) ; } return db URL . starts With ( STRING ) || db URL . starts With ( STRING ) ; }
```

Answer: Yes


Question:
Can it hold at least the number of components specified by the minimum capacity argument ?
```java
public void ensure Capacity ( int min Capacity ) { delegate . ensure Capacity ( min Capacity ) ; }
```

Answer: Yes


Question:
Does the code increase the capacity of this list if necessary to ensure that it can hold at least the number of components specified by the minimum capacity argument ?
```java
public void ensure Capacity ( int min Capacity ) { delegate . ensure Capacity ( min Capacity ) ; }
```

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 Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; final int last Bottom = get Lowest 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 ) ; } offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { int next Position = last Position + NUM ; fill Down ( next Position , get Next Child Downs Top ( next Position ) ) ; 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 Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; final int last Bottom = get Lowest 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 ) ; } offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { int next Position = last Position + NUM ; fill Down ( next Position , get Next Child Downs Top ( next Position ) ) ; 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 Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; final int last Bottom = get Lowest 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 ) ; } offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { int next Position = last Position + NUM ; fill Down ( next Position , get Next Child Downs Top ( next Position ) ) ; 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 Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; final int last Bottom = get Lowest 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 ) ; } offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { int next Position = last Position + NUM ; fill Down ( next Position , get Next Child Downs Top ( next Position ) ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }
```

Answer: No


Question:
Does the code evaluate a subset of attributes ?
```java
@ Override public double evaluate Subset ( Bit Set subset ) throws Exception { double num = NUM ; double denom = NUM ; float corr ; int larger , smaller ; for ( int i = NUM ; i < m num Attribs ; i ++ ) { if ( i != m class Index ) { if ( subset . get ( i ) ) { if ( i > m class Index ) { larger = i ; smaller = m class Index ; } else { smaller = i ; larger = m class Index ; } if ( m corr matrix [ larger ] [ smaller ] == - NUM ) { corr = correlate ( i , m class Index ) ; m corr matrix [ larger ] [ smaller ] = corr ; num += ( m std devs [ i ] * corr ) ; } else { num += ( m std devs [ i ] * m corr matrix [ larger ] [ smaller ] ) ; } } } } for ( int i = NUM ; i < m num Attribs ; i ++ ) { if ( i != m class Index ) { if ( subset . get ( i ) ) { denom += ( NUM * m std devs [ i ] * m std devs [ i ] ) ; for ( int j = NUM ; j < m corr matrix [ i ] . length - NUM ; j ++ ) { if ( subset . get ( j ) ) { if ( m corr matrix [ i ] [ j ] == - NUM ) { corr = correlate ( i , j ) ; m corr matrix [ i ] [ j ] = corr ; denom += ( NUM * m std devs [ i ] * m std devs [ j ] * corr ) ; } else { denom += ( NUM * m std devs [ i ] * m std devs [ j ] * m corr matrix [ i ] [ j ] ) ; } } } } } } if ( denom < NUM ) { denom *= - NUM ; } if ( denom == NUM ) { return ( NUM ) ; } double merit = ( num / Math . sqrt ( denom ) ) ; if ( merit < NUM ) { merit *= - NUM ; } return merit ; }
```

Answer: Yes


Question:
Does the code add an interface ref constant ?
```java
public Interface Method Ref Constant add Interface Ref ( String class Name , String name , String type ) { Interface Method Ref Constant entry = get Interface Ref ( class Name , name , type ) ; if ( entry != null ) return entry ; Class Constant class Entry = add Class ( class Name ) ; Name And Type Constant type Entry = add Name And Type ( name , type ) ; entry = new Interface Method Ref Constant ( this , entries . size ( ) , class Entry . get Index ( ) , type Entry . get Index ( ) ) ; add Constant ( entry ) ; return entry ; }
```

Answer: Yes