Test/Text/codeqa_test.jsonl

{"question_id": "d8eda6cc-39f0-4ea1-83f6-b1a4d48c4403", "question": "Does the code find the index with the specified name using case insensitive matching ?\n```java\npublic I Index find Index ( String name ) { return find Index ( name , BOOL ) ; }\n```", "answer": "Yes"}
{"question_id": "73b8c784-48c7-49f6-b98b-f0752decb5ff", "question": "Did a new mapentryinfokey use to keep it in mapversiontable ?\n```java\npublic Map Entry Info Key ( Object value , Object key , Reference Queue < Object > queue ) { super ( value , queue ) ; hash Code = hash Code ^ key . hash Code ( ) ; key = key ; }\n```", "answer": "Yes"}
{"question_id": "0d1578da-4e81-4cc3-9110-550e26af1432", "question": "Does the code create a new mapentryinfokey , used to keep it in mapversiontable ?\n```java\npublic Map Entry Info Key ( Object value , Object key , Reference Queue < Object > queue ) { super ( value , queue ) ; hash Code = hash Code ^ key . hash Code ( ) ; key = key ; }\n```", "answer": "Yes"}
{"question_id": "ab6596fe-2b99-4b11-b858-718d049df61d", "question": "Does the code create the rcs keystore ?\n```java\nprivate 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "6d904af1-661b-497e-a6aa-377e75929918", "question": "Does the code add the given number of period units to this date ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "8e05d3d8-3dab-483a-9dd1-fde76c93c3a3", "question": "For what purpose did the browser ( user ) authenticate ?\n```java\npublic 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 ) ; }\n```", "answer": "to openam"}
{"question_id": "27588f56-c27c-4528-9e85-43fae68523aa", "question": "Did this method do the saml web - browser profile with artifact ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "0f731471-9324-4694-bc95-5171d3d99004", "question": "How did this method do the saml web - browser profile ?\n```java\npublic 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 ) ; }\n```", "answer": "with artifact"}
{"question_id": "006534b4-4b0c-426e-b746-54fd2e8a576c", "question": "Is this method do designed to do the saml web - browser profile with artifact ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "7c2bdf41-2baa-481c-9794-a09876ef69d3", "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 ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "0475bd7c-215a-42f0-bad3-cd3b6442a847", "question": "Do it complete the single sign on to the target host ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "a868a050-616a-439e-88c3-7151ad9dc00f", "question": "Does the code update the documents with partial updates with the given fields ?\n```java\npublic 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "46e0c0cd-489c-4a12-a3b4-429aab282034", "question": "Does the code add \" val \" months to the month object that contains \" time \" and ?\n```java\n@ 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "72737bc2-340c-459f-9056-40efa228e600", "question": "Does unit test create one ( or more ) namespaces ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "Yes"}
{"question_id": "7bc0f556-88c6-488e-8e40-a52c2b3698a6", "question": "What can we list ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "the namespaces"}
{"question_id": "1f2c066c-1cf9-4730-95b0-7811185f5e74", "question": "What can we obtain ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "the servicedescription"}
{"question_id": "3d976dcc-61ef-42a3-aba2-decf66213c68", "question": "Can we obtain the effective properties for each namespace ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "Yes"}
{"question_id": "e6abb760-0415-40a6-ad93-d7ccf8bc2d2d", "question": "Can we list the namespaces ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "Yes"}
{"question_id": "e1ced494-4a2c-4acd-8ca5-9bf4b801fa72", "question": "Do we update each namespace ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "Yes"}
{"question_id": "5b717f10-028e-4825-ba12-444d72dbedc9", "question": "Can we obtain the servicedescription ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "Yes"}
{"question_id": "0036766e-aa96-41d1-9449-c18f5cc82101", "question": "Can we delete each namespace ?\n```java\npublic void test create 01 ( ) throws Exception { final String namespace 2 = STRING + UUID . random UUID ( ) ; do Test Create ( namespace 2 ) ; }\n```", "answer": "Yes"}
{"question_id": "d2b10c2e-516e-4f0f-a373-e8c0e8586032", "question": "Does the code add a protocol to the current pipeline this ?\n```java\npublic void add ( Protocol protocol ) { if ( protocol List != null ) { protocol List . add ( protocol ) ; protocol . init ( user Connection ) ; } else { throw new Null Pointer Exception ( STRING ) ; } }\n```", "answer": "Yes"}
{"question_id": "58bbe1c8-b7f6-4188-b7b5-9095f11383c2", "question": "What does the code add to the current pipeline this ?\n```java\npublic void add ( Protocol protocol ) { if ( protocol List != null ) { protocol List . add ( protocol ) ; protocol . init ( user Connection ) ; } else { throw new Null Pointer Exception ( STRING ) ; } }\n```", "answer": "a protocol"}
{"question_id": "096fe689-ec59-4415-ba7f-e741e026fbb5", "question": "Will this call the . init method the current pipeline ?\n```java\npublic void add ( Protocol protocol ) { if ( protocol List != null ) { protocol List . add ( protocol ) ; protocol . init ( user Connection ) ; } else { throw new Null Pointer Exception ( STRING ) ; } }\n```", "answer": "Yes"}
{"question_id": "2679a251-ebec-4b0b-83c0-124e6c4c7b34", "question": "Does the code tell ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "f2fd8e13-4c8c-42de-bd27-275a7d39e5a5", "question": "Do the string contain a number ?\n```java\nprivate 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 ; }\n```", "answer": "No"}
{"question_id": "c18d7b26-5b28-4471-880a-57e33610cb58", "question": "Does the code initialize the calculated values ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "8a099b2a-10f5-49fd-88ba-879fb1160d67", "question": "Does the code create the gradle wrapper in the project in the project ?\n```java\n@ 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 ; }\n```", "answer": "Yes"}
{"question_id": "79c14f83-f098-466e-8d61-7df9e47b513f", "question": "Does the code create the gradle wrapper in the project ?\n```java\n@ 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 ; }\n```", "answer": "Yes"}
{"question_id": "6849a130-ab2b-406f-825a-3a761d522ac8", "question": "What have the same data ?\n```java\n@ Override public boolean equals ( final Object o ) { if ( this == o ) return BOOL ; if ( ! ( o instanceof Header ) ) { return BOOL ; } return name . equals ( ( ( Header ) o ) . name ) ; }\n```", "answer": "the headers"}
{"question_id": "09a69d4c-34fd-47ff-a63c-6dd458171af8", "question": "Do the headers have the same data ?\n```java\n@ Override public boolean equals ( final Object o ) { if ( this == o ) return BOOL ; if ( ! ( o instanceof Header ) ) { return BOOL ; } return name . equals ( ( ( Header ) o ) . name ) ; }\n```", "answer": "Yes"}
{"question_id": "9982aa8b-b4af-4bde-9505-571c98b053e5", "question": "Does the code instantiate a new env var model ?\n```java\npublic 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 ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "4768e894-d6b2-4152-80f0-9017bc2f04a1", "question": "Does the code create a copy of a bit string ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "f86c6cf4-33b5-4c73-bc72-cdb2e3684e87", "question": "Does the code write the data for this segment to the stream in valid jpeg format ?\n```java\nvoid write ( Image Output Stream ios , JPEG Image Writer writer ) throws IO Exception { write ( ios , null , writer ) ; }\n```", "answer": "Yes"}
{"question_id": "cd29380f-73dc-462e-8111-641a9b24bc70", "question": "Does the code assume ?\n```java\nvoid write ( Image Output Stream ios , JPEG Image Writer writer ) throws IO Exception { write ( ios , null , writer ) ; }\n```", "answer": "Yes"}
{"question_id": "824c64ed-4ad3-411b-926f-767e36d45efc", "question": "Does the specified implement the proper interface so that we don ' t have to do that for every request ?\n```java\n@ 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 ; }\n```", "answer": "Yes"}
{"question_id": "e3340f00-bb06-405a-9a41-4a172d4f864d", "question": "What implements the proper interface so that we don ' t have to do that for every request ?\n```java\n@ 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 ; }\n```", "answer": "the specified"}
{"question_id": "78a62bdc-49a5-4cf5-ba47-4bcde3d6d8bb", "question": "Do we do that for every request ?\n```java\n@ 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 ; }\n```", "answer": "Yes"}
{"question_id": "fa2f74a1-c03f-47f7-a950-1c52f90e3e6c", "question": "Do we pass in the alt - tab state ?\n```java\nvoid 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 ) ) ; }\n```", "answer": "Yes"}
{"question_id": "d47aa07c-677e-4edb-afb5-242ea295389b", "question": "Does the code compute the minimum and maximum scroll progress values ?\n```java\nvoid 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 ) ) ; }\n```", "answer": "Yes"}
{"question_id": "5d75dda4-00ee-48f5-8f12-32dccfd2aeff", "question": "Does we need to pass in the alt - tab state ?\n```java\nvoid 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 ) ) ; }\n```", "answer": "Yes"}
{"question_id": "ff12a91d-a066-4de2-9244-d7fc490b9942", "question": "Does the code compute the final values for edge functions ?\n```java\nprivate 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 ( ) ; } }\n```", "answer": "Yes"}
{"question_id": "607116f2-a31e-4447-b7f0-13124f55fc35", "question": "What did the code hardcod ?\n```java\nprotected 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 ) { } }\n```", "answer": "default properties"}
{"question_id": "30486221-344c-4aa2-a74c-8236b21e8e7a", "question": "Did the code hardcod default properties ?\n```java\nprotected 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 ) { } }\n```", "answer": "Yes"}
{"question_id": "f417e4d9-8ddb-425e-a759-5ca5539f0f4f", "question": "Is a step moved in the pipeline any ?\n```java\n@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }\n```", "answer": "Yes"}
{"question_id": "44b9961e-745d-4d16-a2ca-14b95ab1e883", "question": "Do we re ?\n```java\n@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }\n```", "answer": "Yes"}
{"question_id": "7c6e3638-a9f2-4c25-956d-abbe48cd8256", "question": "Do we sort the previews ?\n```java\n@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }\n```", "answer": "Yes"}
{"question_id": "62396c6e-7438-4908-aab1-38361e80d789", "question": "What do we sort ?\n```java\n@ Subscribe public synchronized void on Step Moved ( Step Moved Event event ) { Platform Impl . run And Wait ( null ) ; }\n```", "answer": "the previews"}
{"question_id": "179edb3c-dde3-4506-ae62-0de9ebc159b7", "question": "Does all entities and character references replace in a specified string ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "e25f5add-d24b-4777-bbbe-3fea7253a7aa", "question": "Does function hybrid - wumpus - agent return an action <br> ?\n```java\n@ 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 ; }\n```", "answer": "Yes"}
{"question_id": "3cdf7998-d810-4afb-a901-229a9758873b", "question": "Does the given value belong the bin ?\n```java\nprivate int find Bin ( double value ) { return Fast Math . min ( Fast Math . max ( ( int ) Fast Math . ceil ( ( value - min ) / delta ) - NUM , NUM ) , bin Count - NUM ) ; }\n```", "answer": "Yes"}
{"question_id": "2c7b86e4-8ac2-496d-a5f0-561ec590ca84", "question": "Where does the given value belong ?\n```java\nprivate int find Bin ( double value ) { return Fast Math . min ( Fast Math . max ( ( int ) Fast Math . ceil ( ( value - min ) / delta ) - NUM , NUM ) , bin Count - NUM ) ; }\n```", "answer": "the bin"}
{"question_id": "6aaa8ac8-1c58-41d3-a051-f5229c774d1c", "question": "Does the streaminputreader method reset the input stream count simply ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "9c842b61-df12-4d9f-96a5-c0a032461f78", "question": "Do the implementation of this class need to reopen the stream at the beginning of the source file ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "12ba21a6-0955-4655-b784-fea5af4ef4bd", "question": "Does the implementation of this class reopen the stream at the beginning of the source file ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "aecb9df2-d1ee-43ba-9be9-36ced566a615", "question": "Does the code close the current connection ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "fcd2f953-8dbb-4205-9184-96e8b4bb9c27", "question": "Do the streaminputreader method close the input stream simply ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "dcf572da-daca-480d-86e7-c0da0e8d89da", "question": "Does the code reset the datainputstream to the beginning by closing the current connection and reopening it ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "94e69a05-16e5-499f-93bf-75fc447eeb1b", "question": "What does the code reset to the beginning by closing the current connection and reopening it ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "the datainputstream"}
{"question_id": "94e873ee-ceb5-4cf0-9cae-98571d1df894", "question": "Does the code reopen it ?\n```java\nprotected void reopen ( ) throws IO Exception { if ( input Stream != null ) { Debug . message ( STRING , STRING ) ; input Stream . close ( ) ; } input Stream Count = NUM ; }\n```", "answer": "Yes"}
{"question_id": "0d61b688-d45c-415a-8981-50977a357ef8", "question": "Does it declare a serialversionuid ?\n```java\npublic static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }\n```", "answer": "Yes"}
{"question_id": "027d8665-dbc9-45a4-a0e8-b7d3cb14d97a", "question": "Does a class need to declare a serialversionuid , i . e . ?\n```java\npublic static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }\n```", "answer": "Yes"}
{"question_id": "d5a829ee-148e-419a-ab30-6d31aa2e40f0", "question": "Does a class declare a serialversionuid ?\n```java\npublic static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }\n```", "answer": "Yes"}
{"question_id": "a0066cab-3b40-4def-b585-f78365b74714", "question": "Does it implement the java . io . serializable interface ?\n```java\npublic static boolean needs UID ( String classname ) { boolean result ; try { result = needs UID ( Class . for Name ( classname ) ) ; } catch ( Exception e ) { result = BOOL ; } return result ; }\n```", "answer": "Yes"}
{"question_id": "2e34de96-7969-4151-a6c1-ea21000bcfaa", "question": "Does the code resolve the given class name as primitive class if appropriate ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "3952e9bf-68f4-4362-a086-1886f493ad4e", "question": "Does the code update the value graph to account for a given instruction ?\n```java\nprivate 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "00f6c2be-6cb5-43ae-b288-49e165cdd147", "question": "Did it perform the mqtt subscribe or unsubscribe when either the subscribe or unsubscribe buttons are pressed ?\n```java\npublic 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "dfb38b6e-f1fd-4d96-83b5-fc39add231ec", "question": "Are any exceptions caught in a dialog box ?\n```java\npublic 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "c156e67f-56be-42d4-88e0-15e04d7981c3", "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 ?\n```java\npublic 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "d3f67b98-f6cc-4f27-91cc-8c51481e376b", "question": "Must it have an even multiple of 4 data characters ( not counting \\ n ) , padded out with = as needed ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "119d1cae-08e9-4963-92ea-b2890183f6ce", "question": "Do this method mark parameter with the specified index as output ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "37673406-dbcb-4898-b51a-c21026d2bfc6", "question": "What do this method mark with the specified index as output ?\n```java\npublic 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 ) ; }\n```", "answer": "parameter"}
{"question_id": "7239726f-2aed-490f-8507-f4edc0f3a503", "question": "Is this used to output them as such ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "Yes"}
{"question_id": "80dc38f8-402a-489f-afc1-67b077f4f826", "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 ?\n```java\nprotected 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 ( ) ; }\n```", "answer": "Yes"}
{"question_id": "4eb17df0-2e22-4c56-9b39-ec1c860249c5", "question": "Do a string object represent this byte ' s value ?\n```java\npublic java . lang . String to String ( ) { return Integer . to String ( value ) ; }\n```", "answer": "Yes"}
{"question_id": "5db5e26a-15ad-47ca-9c86-79c1ead3a0d2", "question": "Is a pathiterator used to figure out the points to use to add to the toshape ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "60a1239c-574a-495c-81ef-665ffc526680", "question": "Do the points use to add to the toshape ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "59294aa9-5ec7-4905-8d1e-925dc22a76a1", "question": "Do you want it to be a polygon ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "8e782cf4-6c8a-4df6-8a3d-ef0338b8fa04", "question": "Do you close the path yourself ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "5fe78fdd-50f6-4f20-89a0-e626d8033a57", "question": "What is used to figure out the points to use to add to the toshape ?\n```java\npublic 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 ; }\n```", "answer": "a pathiterator"}
{"question_id": "5f3972db-86ce-45ec-8004-0ec4302af92a", "question": "Do you need to close the path yourself if you want it to be a polygon ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "24f3fb87-479e-4369-a968-bdc12a62867a", "question": "Does the code delete a specified authentication module instance ?\n```java\npublic 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "b0441044-8308-4d7c-bd1f-3fb5e3bdd2eb", "question": "Do we make additional http requests in the current produce ( ) call ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "73eb9c06-bb4c-49d3-9ad0-5884960c07d6", "question": "Do we return the current batch ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "89d80b93-a4ef-49be-9ebe-785a79581f09", "question": "Should we continue making additional http requests in the current produce ( ) call or whether to return the current batch ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "f4ba8b97-0e9f-42d7-80d7-d2eea3a71edf", "question": "What does a new ddl parser for mysql not include ?\n```java\npublic My Sql Ddl Parser ( ) { super ( STRING ) ; }\n```", "answer": "view definitions"}
{"question_id": "26182ab4-0959-4222-8d15-12d6fd5b8575", "question": "Does a new ddl parser for mysql include view definitions ?\n```java\npublic My Sql Ddl Parser ( ) { super ( STRING ) ; }\n```", "answer": "No"}
{"question_id": "a9618ac7-2bd9-44fd-a6c5-d78e69f0929b", "question": "Does the code create a new ddl parser for mysql that does not include view definitions ?\n```java\npublic My Sql Ddl Parser ( ) { super ( STRING ) ; }\n```", "answer": "Yes"}
{"question_id": "78c24b38-2aaf-4ddd-b78d-c9f80b99f3f2", "question": "Does the code get current value of field mfirstdownloadrepeat ?\n```java\npublic boolean is First Download Repeat ( ) throws Illegal Access Exception { return m First Download Repeat . get Boolean ( m Repeat Wrapper ) ; }\n```", "answer": "Yes"}
{"question_id": "7f6e8b24-d029-47f7-a9de-28f915bb9ee9", "question": "Did the code cretae a bufferedimage from an imageproducer ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "17d79e12-d8fe-4721-a462-abee50321ea0", "question": "Do them exceed the max length of a tag entry ?\n```java\nprivate 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "f0b7380e-455b-474e-bb9d-cbef38824875", "question": "Did the user want to save the network ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "c54e9777-307a-4ab4-96d4-d8a7d862d7a8", "question": "Do the saving process set to null the synapse sets ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "bbfdd018-5ea8-4ad3-b062-65ee042050d2", "question": "Do the saving process set the synapse sets to null ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "82e0d7db-c02a-4516-a90d-896d4fd12d69", "question": "Does the user save the network ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "a71b11e6-252c-4b9c-9428-dd616708e735", "question": "When did the user continue using the network since the saving process sets the synapse sets to null ?\n```java\npublic 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 ; } }\n```", "answer": "after saving"}
{"question_id": "73c3f857-03af-452b-be0e-a09c1179119f", "question": "Did the user continue using the network since the saving process sets the synapse sets to null after saving ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "ca0c3f2f-2c5a-4fcb-b428-ecc030761ee6", "question": "Do the user use the network ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "fcff11fe-6e77-4dc5-9190-f24321fbc23b", "question": "Does the passed status indicate ?\n```java\nprotected boolean is Task Successful ( Task Status task Status ) { return ( Task Status . READY == task Status ) ; }\n```", "answer": "Yes"}
{"question_id": "cbb19682-6886-4ce6-9602-41e6ad667892", "question": "What does the code find by role name ?\n```java\npublic Role find Role By Role Name ( String role Name ) { return role Repository . find Top By Role Name ( role Name ) ; }\n```", "answer": "role"}
{"question_id": "ad3df8ae-c303-4e0e-aace-36c4ab670c1a", "question": "Does the code find role by role name ?\n```java\npublic Role find Role By Role Name ( String role Name ) { return role Repository . find Top By Role Name ( role Name ) ; }\n```", "answer": "Yes"}
{"question_id": "4a7a3605-36cb-47e2-80fc-f0dedbaa096d", "question": "Can rmiregistry accept incoming calls now ?\n```java\npublic 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 ; } }\n```", "answer": "Yes"}
{"question_id": "8d1b336f-b7ac-4037-82fe-6ba5ed59c268", "question": "What can rmiregistry accept now ?\n```java\npublic 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 ; } }\n```", "answer": "incoming calls"}
{"question_id": "b4d4c59f-536f-4531-8e6c-a43eb15e71e6", "question": "Is this method used to delete the workflow matrix details ?\n```java\n@ 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "148250bd-5b3f-4aae-98fc-bbd56190b584", "question": "Is this method called to clear any actions that have not been completed ?\n```java\nprotected 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 ) ; } }\n```", "answer": "Yes"}
{"question_id": "68272de7-20e0-4abe-a50e-6118ee82efef", "question": "Do a sequence number add at the rear of the given fileext ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "85e0b30b-cdc0-446e-983e-774416ad1ff3", "question": "Till when do the signalbarrier and block claim ?\n```java\npublic 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 ( ) ; }\n```", "answer": "until signaled"}
{"question_id": "3778bd16-8316-4659-8f7c-c21d9cc221a6", "question": "Does the code carry all overflows to the more significant bits / bytes over ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "86d6da20-27bc-4b8d-95a1-028f11e92484", "question": "What does the code carry to the more significant bits / bytes over ?\n```java\npublic 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 ; }\n```", "answer": "all overflows"}
{"question_id": "0b6cf94f-da87-4c12-985c-511a06a31528", "question": "Does the code treat the byte [ ] as an unsigned series of bytes , most significant bits first ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "a6079d8e-c30c-44ca-b5d7-ad53a3d11473", "question": "Does the first ( last added ) element remove in the stack ?\n```java\npublic T pop ( ) { length -- ; return elements . remove ( length ) ; }\n```", "answer": "Yes"}
{"question_id": "b637ec0b-9b5c-4f87-91e8-06260ea869b8", "question": "Are any nan values in either a or b ignored in computing the error ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "2c810f26-8a65-44ea-9b0b-760944037dd0", "question": "Does the code build the sum of the squared difference of all elements with the same index numbers in the arrays ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "734ee75c-ffc1-45cb-b16f-49673c0a6bb8", "question": "Does the code find the last assignment to the given string local by searching upwards from the given statement ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "475fbe81-34b2-4449-8b5c-553a380f03dd", "question": "What does the code add into redis for application server and management console ?\n```java\n@ 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 ( ) ; } } }\n```", "answer": "two keys"}
{"question_id": "26bbddac-2c95-4ffa-ab72-345f17a71674", "question": "Does the code add two keys into redis for application server and management console ?\n```java\n@ 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 ( ) ; } } }\n```", "answer": "Yes"}
{"question_id": "ec66dfaf-667f-4432-8599-40d1af401747", "question": "Does the behavior of the method test in the case of null input char array ?\n```java\npublic 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 ] ) ; }\n```", "answer": "Yes"}
{"question_id": "e6a7c097-7206-483e-b15d-cdac21bd263b", "question": "Does pbekeyspec ( char [ ] test ?\n```java\npublic 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 ] ) ; }\n```", "answer": "Yes"}
{"question_id": "9c6d90ae-fb54-4077-84ca-e1d1c1fef834", "question": "Does this interactive exchange allow user to trust the ssl at the first time browsing this site ?\n```java\n@ 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 ( ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "8f711a07-c7b5-4a18-9eff-b87ecda1ceb9", "question": "Do user trust the ssl at the first time ?\n```java\n@ 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 ( ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "f50b5f66-6b9f-4911-a97c-c73c92b725f9", "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 ?\n```java\n@ 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 ( ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "1986fcba-3d41-48cb-9645-db1395867ce9", "question": "What do user trust at the first time ?\n```java\n@ 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 ( ) ) ; } }\n```", "answer": "the ssl"}
{"question_id": "76b3415b-c024-4677-b2f2-9e54066a1d05", "question": "What does uri represent ?\n```java\npublic static boolean is SSH ( String uri ) { return uri != null && uri . starts With ( STRING ) ; }\n```", "answer": "ssh connection"}
{"question_id": "cbb323ea-1a4c-4e03-8114-b13ed11040e8", "question": "Does uri represent ssh connection ?\n```java\npublic static boolean is SSH ( String uri ) { return uri != null && uri . starts With ( STRING ) ; }\n```", "answer": "Yes"}
{"question_id": "507793b0-2041-4667-874c-d5a4411b9b02", "question": "Does the code select a format from a custom pattern ?\n```java\nprivate 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 ; }\n```", "answer": "Yes"}
{"question_id": "9cceea01-8e5f-4661-9600-ef7b902e50f4", "question": "What should be not constructed in standard programming ?\n```java\nprivate Grid Filename Utils ( ) { }\n```", "answer": "instances"}
{"question_id": "2724a4d9-a240-4a33-9b97-1c880fd2a9aa", "question": "Should instances be constructed in standard programming ?\n```java\nprivate Grid Filename Utils ( ) { }\n```", "answer": "No"}
{"question_id": "8a3842bd-81a6-4aa2-bb9b-0d31b73675f2", "question": "Does the code append the given column specification to the right hand side of all columns ?\n```java\npublic void append Column ( Column Spec column Spec ) { check Not Null ( column Spec , STRING ) ; col Specs . add ( column Spec ) ; }\n```", "answer": "Yes"}
{"question_id": "49208ae8-16fd-48c1-a4c3-7ad9d4755ba9", "question": "Does the code compare ?\n```java\nstatic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "c27a7d39-afc0-46c4-9bdf-ba7e7ac00e74", "question": "Does the code add a new workspace component to the archive ?\n```java\nArchived 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 ; }\n```", "answer": "Yes"}
{"question_id": "b9615cc4-247e-4315-8f02-6d774c8fdd83", "question": "Does the code create a new nodesearch instance with filters ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "a7f3865c-568f-4f97-ac7f-861c8a239d14", "question": "Does the code create a generic uri from the given string ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "35a94972-dea7-4bff-99c9-0dfcf57183f6", "question": "Does the mutator do anything on an empty collection actually ?\n```java\nprivate static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }\n```", "answer": "Yes"}
{"question_id": "38d5a324-d149-49ec-b80c-672db6913978", "question": "What do calling a mutator throws always ?\n```java\nprivate static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }\n```", "answer": "uoe"}
{"question_id": "e5f0831d-6b10-44d4-a301-e99aed9beb15", "question": "Do calling a mutator throws uoe always ?\n```java\nprivate static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }\n```", "answer": "Yes"}
{"question_id": "c0db8483-b196-40c2-900b-9b7c79095e9a", "question": "Does the mutator do anything actually on an empty collection ?\n```java\nprivate static void test Empty Coll Mutators Always Throw ( Collection < Integer > c ) { if ( ! c . is Empty ( ) ) { fail ( STRING ) ; } THROWS ( Unsupported Operation Exception . class , null ) ; }\n```", "answer": "Yes"}
{"question_id": "815c22ba-76e9-4549-b4a1-fee814e70b4b", "question": "Is java . time found on classpath ?\n```java\npublic static boolean has Three Ten ( ) { try { Class . for Name ( STRING ) ; return BOOL ; } catch ( Class Not Found Exception e ) { return BOOL ; } }\n```", "answer": "Yes"}
{"question_id": "d5896f0f-f171-42e7-b9cd-fbdc4c2c7cfc", "question": "Does the code find all implementations of a particular interface ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "ae7fe90c-fd46-4f79-bc17-4f52468f68ed", "question": "Did the method use to add a file for the recent menu ?\n```java\npublic void add Recent File ( File f ) { if ( null != f ) { recent Files . add ( f ) ; } }\n```", "answer": "Yes"}
{"question_id": "ad50240b-379b-40c5-a3de-8a5a8e990827", "question": "Do a flag indicate ?\n```java\npublic static boolean verbose ( ) { return c Verbose . get ( ) ; }\n```", "answer": "Yes"}
{"question_id": "f0906cb6-b55e-47da-88cb-f29d27ecdf5e", "question": "Does the code get a flag indicating that verbose logging is required ?\n```java\npublic static boolean verbose ( ) { return c Verbose . get ( ) ; }\n```", "answer": "Yes"}
{"question_id": "aa3e98d2-835b-4b28-b6ca-bbb3602aa688", "question": "Does the computed classpath contain the jre ?\n```java\npublic 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 ( ) ) ; }\n```", "answer": "No"}
{"question_id": "ddc3b4c6-620f-48d1-9a98-da7e2fe16bb1", "question": "What does the computed classpath not contain ?\n```java\npublic 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 ( ) ) ; }\n```", "answer": "the jre"}
{"question_id": "df231cad-89e9-435f-a274-efc9f09b5813", "question": "Do the cut the text into blocks of at least block_minimum_character_size characters , aligned on the ends of paragraphs ?\n```java\nprivate 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 ; } }\n```", "answer": "Yes"}
{"question_id": "3e1650c7-bde2-411d-96f1-97a01cf7b3c1", "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 ?\n```java\nprivate 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 ; } }\n```", "answer": "Yes"}
{"question_id": "5ff53ce1-da98-4814-b78f-38c06cbe763b", "question": "Did blocks of at least block_minimum_character_size characters align on the ends of paragraphs ?\n```java\nprivate 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 ; } }\n```", "answer": "Yes"}
{"question_id": "bd2bbeda-b9e9-4835-a573-b0bae93bde14", "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 ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "f92b2db1-0738-4ca7-b318-5dadd3d32e6d", "question": "How are the slots supplied first ?\n```java\npublic 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 ; }\n```", "answer": "in pairs"}
{"question_id": "88f38644-a091-4e4a-80dd-570c3a1c6354", "question": "Will this try to fill up all partial slots first ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "0e15daa7-8b2f-4811-af5b-f58e63b9f27d", "question": "Do this fill all partial slots ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "51f39e6d-624d-4f7f-bf5a-6eb96b47d8ba", "question": "Does the code create a national number from a number string ?\n```java\nprivate 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 ; } }\n```", "answer": "Yes"}
{"question_id": "8fd78928-697d-4d25-937f-71d7dede044c", "question": "Does the code restore the original headless setting of when the jvm was started ?\n```java\npublic static void restore Headless Mode ( ) { if ( Graphics Environment . is Headless ( ) && ! is Default Headless ) { set Headless ( BOOL ) ; } }\n```", "answer": "Yes"}
{"question_id": "e5be2979-7779-4514-9a62-56af327674dd", "question": "Does the code generate a set of n random distinct byte [ ] keys in sorted order in sorted order ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "89820152-a9ec-40de-8392-c3b180a43186", "question": "Does the method expect a string ?\n```java\npublic 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 ( ) ) ; }\n```", "answer": "Yes"}
{"question_id": "7bef6d2c-3424-423c-aaa5-b1b4f1be8bb6", "question": "Does the method allow to set the password verification prefix ?\n```java\npublic 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 ( ) ) ; }\n```", "answer": "Yes"}
{"question_id": "446bb62a-995c-4623-9ff1-ee57eb9ade17", "question": "Does which set the password verification prefix ?\n```java\npublic 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 ( ) ) ; }\n```", "answer": "Yes"}
{"question_id": "7ff63298-50b6-4831-9c40-0f1421c3bc36", "question": "Do no rows satisfy the criteria ?\n```java\npublic 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 ( ) ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "5af388c2-0832-4b1e-b3f4-99c2065c2e4a", "question": "Do more than one row satisfy the criteria ?\n```java\npublic 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 ( ) ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "d23416dc-a8e9-46b0-b9d2-194295f5b1c0", "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 ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "No"}
{"question_id": "f0689969-7a7c-487f-b982-b54eb48cea56", "question": "Do we need to provide exclusive access over the code where an event is removed from the queue only ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "Yes"}
{"question_id": "3d0e7802-362b-4256-b88e-bc740043d478", "question": "Do we provide exclusive access over the code where an event is removed from the queue ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "Yes"}
{"question_id": "910ac780-28fb-432d-8d95-ee8f408e1c9a", "question": "Where is an event removed from the queue ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "where"}
{"question_id": "58b75d3b-9c38-4c72-a72a-5623865106f9", "question": "What does we take from the queue ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "the event"}
{"question_id": "4f3fd816-66e2-4eca-abc8-d0ed89062956", "question": "Is an event removed from the queue where ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "Yes"}
{"question_id": "433cae79-a108-4e7e-8d55-63c43436ffb1", "question": "What is removed from the queue where ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "an event"}
{"question_id": "162e2a2e-4408-4e2a-816b-aef947fe4bb3", "question": "Does we take the event from the queue ?\n```java\nvoid 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 ( ) ; } } }\n```", "answer": "Yes"}
{"question_id": "50104110-8443-4f9f-b449-25944080370f", "question": "Does the url represent a local db ?\n```java\npublic 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 ) ; }\n```", "answer": "Yes"}
{"question_id": "a49ed80d-bddd-4ee0-8547-90781852998c", "question": "Can it hold at least the number of components specified by the minimum capacity argument ?\n```java\npublic void ensure Capacity ( int min Capacity ) { delegate . ensure Capacity ( min Capacity ) ; }\n```", "answer": "Yes"}
{"question_id": "045444f4-6a42-49d1-bd54-6eaa4752853a", "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 ?\n```java\npublic void ensure Capacity ( int min Capacity ) { delegate . ensure Capacity ( min Capacity ) ; }\n```", "answer": "Yes"}
{"question_id": "28d60baf-b37f-485e-a6ec-e9f9b5cb875d", "question": "Have we pushed the bottom element off the bottom of the screen when we did not need to ?\n```java\nprivate 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 ( ) ; } } } }\n```", "answer": "Yes"}
{"question_id": "0974364c-916e-4e3f-ba22-a64e6f5721c3", "question": "Have we dragged the bottom of the list too low ?\n```java\nprivate 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 ( ) ; } } } }\n```", "answer": "Yes"}
{"question_id": "9eb06e10-128a-4b72-8a5a-52bb68239b96", "question": "What did we not need when ?\n```java\nprivate 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 ( ) ; } } } }\n```", "answer": "to"}
{"question_id": "bbe1438f-cba3-4afe-b9e8-413ab596cfd7", "question": "Did we need to when ?\n```java\nprivate 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 ( ) ; } } } }\n```", "answer": "No"}
{"question_id": "9270eb40-7653-4a57-a709-149f5bedc2cd", "question": "Does the code evaluate a subset of attributes ?\n```java\n@ 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 ; }\n```", "answer": "Yes"}
{"question_id": "9d19cc10-3cad-4e4a-9c1e-572b9efda516", "question": "Does the code add an interface ref constant ?\n```java\npublic 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 ; }\n```", "answer": "Yes"}
{"question_id": "964d0789-0b09-417c-9b6d-d507f675db28", "question": "What operates the txstate ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "this thread"}
{"question_id": "b11e6bc9-16be-4424-b59b-876ffc097718", "question": "Where does this thread operate ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "the txstate"}
{"question_id": "ead71f70-addf-48b1-ae36-731c44596b5b", "question": "Should some messages like sizemessage create a new txstate ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "No"}
{"question_id": "c2b15d13-facb-4db5-bd52-1179101dde78", "question": "Does this thread operate the txstate ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "Yes"}
{"question_id": "7ddb7292-801e-4a8a-8fc2-157945e7a8d1", "question": "Does the code associate the remote txstate with the thread processing this message ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "Yes"}
{"question_id": "4c14b6be-f1cc-4d53-bdb9-0d563a0d3806", "question": "Do we acquire a lock on the txstate , on which this thread operates ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "Yes"}
{"question_id": "b9016160-f64b-4f9d-91c6-8d7a1a8420c6", "question": "Does the code associate with the thread processing this message the remote txstate ?\n```java\npublic TX State Proxy masquerade As ( Transaction Message msg ) throws Interrupted Exception { if ( msg . get TX Uniq Id ( ) == NOTX || ! msg . can Participate In Transaction ( ) ) { return null ; } TX Id key = new TX Id ( msg . get Member To Masquerade As ( ) , msg . get TX Uniq Id ( ) ) ; TX State Proxy val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { boolean success = get Lock ( val , key ) ; while ( ! success ) { val = get Or Set Hosted TX State ( key , msg ) ; if ( val != null ) { success = get Lock ( val , key ) ; } else { break ; } } } set TX State ( val ) ; return val ; }\n```", "answer": "Yes"}
{"question_id": "55b20672-8834-406e-814d-5fcd79b894c7", "question": "For what purpose do http : / / www . idrsolutions . com / access - pdf - viewer - features - from - your - code see ?\n```java\n@ Override @ Suppress Warnings ( STRING ) public Object execute Command ( final int command ID , final Object [ ] args ) { if ( ! is Setup ) { throw new Runtime Exception ( STRING ) ; } return current Commands . execute Command ( command ID , args ) ; }\n```", "answer": "for full"}
{"question_id": "e381bb7f-772b-4d61-8a11-4c5e05c1412a", "question": "Do a vector3 contain the smallest x , y , and z values ?\n```java\npublic static Vector 3 min ( Vector 3 o1 , Vector 3 o2 ) { return new Vector 3 ( Math . min ( o1 . x , o2 . x ) , Math . min ( o1 . y , o2 . y ) , Math . min ( o1 . z , o2 . z ) ) ; }\n```", "answer": "Yes"}
{"question_id": "5e256437-c12c-4c2b-9fee-9fb16d18f5c5", "question": "Does the code encode the algorithm identifier in der form to the stream ?\n```java\npublic void encode ( Output Stream out ) throws IO Exception { Der Output Stream tmp = new Der Output Stream ( ) ; alg Id . encode ( tmp ) ; out . write ( tmp . to Byte Array ( ) ) ; }\n```", "answer": "Yes"}
{"question_id": "4ade92df-07c0-4a7a-9e59-f06b0010bf25", "question": "When do _ autoengineer become null ?\n```java\nprotected void wait Until Stopped ( ) { boolean done Waiting = BOOL ; while ( ! done Waiting ) { if ( auto Engineer != null ) { done Waiting = auto Engineer . is Stopped ( ) ; } else { done Waiting = BOOL ; } if ( ! done Waiting ) { try { Thread . sleep ( NUM ) ; } catch ( Interrupted Exception e ) { } } } }\n```", "answer": "during wait"}
{"question_id": "dfcc6aa0-663c-416a-8ed0-1c849b2baea7", "question": "Is player considered in combat if he ' s been attacked or has attacked less or equal 10s before ?\n```java\npublic boolean is In Combat ( ) { return ( ( ( System . current Time Millis ( ) - last Attacked Milis ) <= NUM ) || ( ( System . current Time Millis ( ) - last Attack Milis ) <= NUM ) ) ; }\n```", "answer": "Yes"}
{"question_id": "b2440f75-96bd-42b4-a66b-00979b435dc1", "question": "Has he attacked less or equal 10s before ?\n```java\npublic boolean is In Combat ( ) { return ( ( ( System . current Time Millis ( ) - last Attacked Milis ) <= NUM ) || ( ( System . current Time Millis ( ) - last Attack Milis ) <= NUM ) ) ; }\n```", "answer": "Yes"}
{"question_id": "77780bdf-960f-45e5-87eb-06c5182a6320", "question": "Does the code create a d3d - based backbuffer ?\n```java\n@ Override public Volatile Image create Back Buffer ( W Component Peer peer ) { Component target = ( Component ) peer . get Target ( ) ; int w = Math . max ( NUM , target . get Width ( ) ) ; int h = Math . max ( NUM , target . get Height ( ) ) ; return new Sun Volatile Image ( target , w , h , Boolean . TRUE ) ; }\n```", "answer": "Yes"}
{"question_id": "a68d735d-9965-49cd-99cf-cdb5c2564485", "question": "Does the code return the image wrapper ?\n```java\n@ Override public Volatile Image create Back Buffer ( W Component Peer peer ) { Component target = ( Component ) peer . get Target ( ) ; int w = Math . max ( NUM , target . get Width ( ) ) ; int h = Math . max ( NUM , target . get Height ( ) ) ; return new Sun Volatile Image ( target , w , h , Boolean . TRUE ) ; }\n```", "answer": "Yes"}
{"question_id": "4a6c4de2-2bd3-461c-85a7-4b556ae1e6f8", "question": "Does an intent create a shortcut to launch the provided script in a terminal ?\n```java\npublic static Intent build Terminal Shortcut Intent ( File script , Parcelable icon Resource ) { Intent intent = new Intent ( ) ; intent . put Extra ( Intent . EXTRA SHORTCUT INTENT , build Start In Terminal Intent ( script ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT NAME , script . get Name ( ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT ICON RESOURCE , icon Resource ) ; return intent ; }\n```", "answer": "Yes"}
{"question_id": "7184f7c3-a3ce-42dc-96d6-3035bc3a3f73", "question": "Do the provided script launch in a terminal a shortcut ?\n```java\npublic static Intent build Terminal Shortcut Intent ( File script , Parcelable icon Resource ) { Intent intent = new Intent ( ) ; intent . put Extra ( Intent . EXTRA SHORTCUT INTENT , build Start In Terminal Intent ( script ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT NAME , script . get Name ( ) ) ; intent . put Extra ( Intent . EXTRA SHORTCUT ICON RESOURCE , icon Resource ) ; return intent ; }\n```", "answer": "Yes"}
{"question_id": "e15645da-3d45-4618-8db8-ff23babe61be", "question": "Does the code create a spider with pageprocessor ?\n```java\npublic static Spider create ( Page Processor page Processor ) { return new Spider ( page Processor ) ; }\n```", "answer": "Yes"}
{"question_id": "ce76f61e-e28b-4c27-911f-297200756f1b", "question": "Does the code add an exceptional successor ?\n```java\npublic void add Exceptional Successor ( Block Impl b , Type Mirror cause ) { if ( exceptional Successors == null ) { exceptional Successors = new Hash Map < > ( ) ; } Set < Block > blocks = exceptional Successors . get ( cause ) ; if ( blocks == null ) { blocks = new Hash Set < Block > ( ) ; exceptional Successors . put ( cause , blocks ) ; } blocks . add ( b ) ; b . add Predecessor ( this ) ; }\n```", "answer": "Yes"}
{"question_id": "ba53b8de-3f3d-4873-be67-1be28aa9a407", "question": "Do most other rolls have a minimum value of zero ?\n```java\npublic MM Roll ( MM Random rng , int max ) { super ( max , NUM ) ; this . total = rng . random Int ( this . faces ) + this . min ; all . add Element ( this . total ) ; }\n```", "answer": "Yes"}
{"question_id": "caf20e86-f864-4104-bda3-3105ec84d824", "question": "Does the code load the handles database from disk ?\n```java\npublic void load ( Input Stream in Stream ) throws IO Exception { Properties properties = new Properties ( ) ; properties . load ( in Stream ) ; for ( Map . Entry < Object , Object > property : properties . entry Set ( ) ) { String handle Id = ( String ) property . get Key ( ) ; String value = ( String ) property . get Value ( ) ; Property Table handle Properties = new Property Table ( ) ; JSON Object json Object = ( JSON Object ) JSON Value . parse ( value ) ; if ( json Object != null ) { handle Properties . put All ( json Object ) ; } Handle handle = new Handle ( ) ; handle . set Id ( handle Id ) ; handle . set Properties ( handle Properties ) ; handles . put ( handle Id , handle ) ; } }\n```", "answer": "Yes"}
{"question_id": "d20d6d49-f2de-49a3-bf0b-af2df6be7c4c", "question": "In which direction does the code load the handles database ?\n```java\npublic void load ( Input Stream in Stream ) throws IO Exception { Properties properties = new Properties ( ) ; properties . load ( in Stream ) ; for ( Map . Entry < Object , Object > property : properties . entry Set ( ) ) { String handle Id = ( String ) property . get Key ( ) ; String value = ( String ) property . get Value ( ) ; Property Table handle Properties = new Property Table ( ) ; JSON Object json Object = ( JSON Object ) JSON Value . parse ( value ) ; if ( json Object != null ) { handle Properties . put All ( json Object ) ; } Handle handle = new Handle ( ) ; handle . set Id ( handle Id ) ; handle . set Properties ( handle Properties ) ; handles . put ( handle Id , handle ) ; } }\n```", "answer": "from disk"}
{"question_id": "244bccb8-1dea-45bf-9270-935e746ea6e8", "question": "Do resetting a custom model initialize the model to its state when it was first created ?\n```java\npublic Service Call < Void > reset Customization ( String customization Id ) { Validator . not Null ( customization Id , STRING ) ; Request Builder request Builder = Request Builder . post ( String . format ( PATH RESET , customization Id ) ) ; return create Service Call ( request Builder . build ( ) , Response Converter Utils . get Void ( ) ) ; }\n```", "answer": "Yes"}
{"question_id": "3a8a780d-4063-4ad9-9303-0feb1d21d2c8", "question": "Does the code join the given list of strings using the given delimiter delim ?\n```java\npublic String join ( List < String > list , String delim ) { String Builder sb = new String Builder ( ) ; String loop Delim = STRING ; for ( String s : list ) { sb . append ( loop Delim ) ; sb . append ( s ) ; loop Delim = delim ; } return sb . to String ( ) ; }\n```", "answer": "Yes"}
{"question_id": "24d52658-3020-434f-9324-529ab138ddb2", "question": "Does a position have an altitude value ?\n```java\npublic boolean has Altitude ( ) { return ! Double . is Na N ( altitude ) ; }\n```", "answer": "Yes"}
{"question_id": "2425e2b1-f75f-4561-9199-6f679da2ef79", "question": "Has the table name exist in the table_schema already ?\n```java\nprivate boolean is Value Exists ( Cursor cursor , String table Name ) { boolean exist = BOOL ; if ( cursor . move To First ( ) ) { do { String name = cursor . get String ( cursor . get Column Index Or Throw ( Const . Table Schema . COLUMN NAME ) ) ; if ( name . equals Ignore Case ( table Name ) ) { exist = BOOL ; break ; } } while ( cursor . move To Next ( ) ) ; } return exist ; }\n```", "answer": "Yes"}
{"question_id": "7a5f1195-df88-4583-b3c2-5c038bea9651", "question": "Do downstream tools store it into a introspection file ?\n```java\npublic void add Comment ( String line ) { comments . add ( line ) ; }\n```", "answer": "Yes"}
{"question_id": "8d61e75d-cadf-4903-ac39-cd05cad059c9", "question": "Do downstream tools use the d - bus model ?\n```java\npublic void add Comment ( String line ) { comments . add ( line ) ; }\n```", "answer": "Yes"}
{"question_id": "88af77f9-9c21-4fad-9550-57f98e809aa7", "question": "Does the code add a comment line to a d - bus model ?\n```java\npublic void add Comment ( String line ) { comments . add ( line ) ; }\n```", "answer": "Yes"}
{"question_id": "5f562d66-5844-461f-acd1-9880db9ebe6e", "question": "Do downstream tools generate code ?\n```java\npublic void add Comment ( String line ) { comments . add ( line ) ; }\n```", "answer": "Yes"}
{"question_id": "c4481d5a-797d-415d-962a-3d293d9162e7", "question": "Does the code handle the response data for creating a simple resource with content ?\n```java\nprivate void handle Simple Resource ( final String target Uri , final Handler < Resource Node > handler , final Buffer data , final String e Tag ) { String resource Name = Expansion Delta Util . extract Collection From Path ( target Uri ) ; if ( log . is Trace Enabled ( ) ) { log . trace ( STRING + resource Name ) ; } handler . handle ( new Resource Node ( resource Name , data , e Tag , target Uri ) ) ; }\n```", "answer": "Yes"}
{"question_id": "6b939048-a0e4-468a-89cb-ebc9e373e595", "question": "Does the code add a new match to the repository ?\n```java\n@ Override public void add Match ( final String match , final T value , final boolean immutable Match ) { add Match ( match , value , immutable Match , BOOL ) ; }\n```", "answer": "Yes"}
{"question_id": "dbc519b2-96c4-4211-a96a-54f6fd087ade", "question": "Does the user open a file ?\n```java\nvoid open ( ) { if ( ! main Frame . can Navigate Away ( ) ) { return ; } if ( ask To Save ( ) ) { return ; } boolean loading = BOOL ; Save Type file Type ; try Again : while ( loading ) { int value = save Open File Chooser . show Open Dialog ( main Frame ) ; if ( value != J File Chooser . APPROVE OPTION ) { return ; } loading = BOOL ; file Type = convert Filter To Type ( save Open File Chooser . get File Filter ( ) ) ; final File f = save Open File Chooser . get Selected File ( ) ; if ( ! file Type . is Valid ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING , STRING , J Option Pane . WARNING MESSAGE ) ; loading = BOOL ; continue ; } switch ( file Type ) { case XML ANALYSIS : if ( ! f . get Name ( ) . ends With ( STRING ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , L10 N . get Local String ( STRING , STRING ) ) ; loading = BOOL ; continue try Again ; } if ( ! main Frame . open Analysis ( f , file Type ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBP FILE : if ( ! open FBP File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBA FILE : if ( ! open FBA File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; default : assert BOOL ; } } }\n```", "answer": "Yes"}
{"question_id": "c43ea37f-e652-4aca-a1a8-519e15b1b1aa", "question": "Does the user want to open a file when ?\n```java\nvoid open ( ) { if ( ! main Frame . can Navigate Away ( ) ) { return ; } if ( ask To Save ( ) ) { return ; } boolean loading = BOOL ; Save Type file Type ; try Again : while ( loading ) { int value = save Open File Chooser . show Open Dialog ( main Frame ) ; if ( value != J File Chooser . APPROVE OPTION ) { return ; } loading = BOOL ; file Type = convert Filter To Type ( save Open File Chooser . get File Filter ( ) ) ; final File f = save Open File Chooser . get Selected File ( ) ; if ( ! file Type . is Valid ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING , STRING , J Option Pane . WARNING MESSAGE ) ; loading = BOOL ; continue ; } switch ( file Type ) { case XML ANALYSIS : if ( ! f . get Name ( ) . ends With ( STRING ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , L10 N . get Local String ( STRING , STRING ) ) ; loading = BOOL ; continue try Again ; } if ( ! main Frame . open Analysis ( f , file Type ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBP FILE : if ( ! open FBP File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; case FBA FILE : if ( ! open FBA File ( f ) ) { J Option Pane . show Message Dialog ( save Open File Chooser , STRING ) ; loading = BOOL ; continue try Again ; } break ; default : assert BOOL ; } } }\n```", "answer": "Yes"}
{"question_id": "3272498c-5bba-456e-841c-544764a93dc1", "question": "Have two containers contain same things ?\n```java\npublic boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }\n```", "answer": "Yes"}
{"question_id": "428ba25a-61c9-4725-93d4-f8ea3accfefe", "question": "What have contain same things ?\n```java\npublic boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }\n```", "answer": "two containers"}
{"question_id": "47bf9f67-4c01-4b2e-8802-a9fc02a90a66", "question": "Can tests if two containers have contain same things . be used to answer the alias query ?\n```java\npublic boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }\n```", "answer": "Yes"}
{"question_id": "2bfabc18-be54-427c-b68a-a13ca9daacf3", "question": "What have two containers contain ?\n```java\npublic boolean has Non Empty Intersection ( Pt Sens Visitor < Var Type > other ) { for ( Map . Entry < Node , List < Var Type > > entry : table View . entry Set ( ) ) { Node var = entry . get Key ( ) ; List < Var Type > list 1 = entry . get Value ( ) ; List < Var Type > list 2 = other . get CS List ( var ) ; if ( list 1 . size ( ) == NUM || list 2 . size ( ) == NUM ) continue ; for ( Var Type cv 1 : list 1 ) { for ( Var Type cv 2 : list 2 ) if ( cv 1 . intersect ( cv 2 ) ) return BOOL ; } } return BOOL ; }\n```", "answer": "same things"}
{"question_id": "9ee87818-50fa-427e-b2de-33fb3736e9f9", "question": "Be vincenty be the geographic pole at any distance short of antipodal standpoint / forepoint ?\n```java\npublic static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }\n```", "answer": "No"}
{"question_id": "69d1d653-7b22-475f-ab83-8bdcac2c12b0", "question": "Does the code compute the distance between two points on an ellipsoid iteratively ?\n```java\npublic static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }\n```", "answer": "Yes"}
{"question_id": "20b56614-abe3-453f-91dd-f2be3c571f1c", "question": "How does the code compute the distance between two points on an ellipsoid ?\n```java\npublic static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }\n```", "answer": "iteratively"}
{"question_id": "e554fbf2-a7ac-4ab9-b301-a408291f8b57", "question": "What be not the geographic pole at any distance short of antipodal standpoint / forepoint ?\n```java\npublic static double ellipsoidal Distance ( Lat Lon p1 , Lat Lon p2 , double equatorial Radius , double polar Radius ) { final double F = ( equatorial Radius - polar Radius ) / equatorial Radius ; final double R = NUM - F ; final double EPS = NUM ; if ( p1 == null || p2 == null ) { throw new Illegal Argument Exception ( STRING ) ; } double GLAT 1 = p1 . get Latitude ( ) . radians ; double GLAT 2 = p2 . get Latitude ( ) . radians ; double TU 1 = R * Math . sin ( GLAT 1 ) / Math . cos ( GLAT 1 ) ; double TU 2 = R * Math . sin ( GLAT 2 ) / Math . cos ( GLAT 2 ) ; double CU 1 = NUM / Math . sqrt ( TU 1 * TU 1 + NUM ) ; double SU 1 = CU 1 * TU 1 ; double CU 2 = NUM / Math . sqrt ( TU 2 * TU 2 + NUM ) ; double S = CU 1 * CU 2 ; double BAZ = S * TU 2 ; double FAZ = BAZ * TU 1 ; double GLON 1 = p1 . get Longitude ( ) . radians ; double GLON 2 = p2 . get Longitude ( ) . radians ; double X = GLON 2 - GLON 1 ; double D , SX , CX , SY , CY , Y , SA , C2 A , CZ , E , C ; do { SX = Math . sin ( X ) ; CX = Math . cos ( X ) ; TU 1 = CU 2 * SX ; TU 2 = BAZ - SU 1 * CU 2 * CX ; SY = Math . sqrt ( TU 1 * TU 1 + TU 2 * TU 2 ) ; CY = S * CX + FAZ ; Y = Math . atan 2 ( SY , CY ) ; SA = S * SX / SY ; C2 A = - SA * SA + NUM ; CZ = FAZ + FAZ ; if ( C2 A > NUM ) { CZ = - CZ / C2 A + CY ; } E = CZ * CZ * NUM - NUM ; C = ( ( - NUM * C2 A + NUM ) * F + NUM ) * C2 A * F / NUM ; D = X ; X = ( ( E * CY * C + CZ ) * SY * C + Y ) * SA ; X = ( NUM - C ) * X * F + GLON 2 - GLON 1 ; } while ( Math . abs ( D - X ) > EPS ) ; X = Math . sqrt ( ( NUM / R / R - NUM ) * C2 A + NUM ) + NUM ; X = ( X - NUM ) / X ; C = NUM - X ; C = ( X * X / NUM + NUM ) / C ; D = ( NUM * X * X - NUM ) * X ; X = E * CY ; S = NUM - E - E ; S = ( ( ( ( SY * SY * NUM - NUM ) * S * CZ * D / NUM - X ) * D / NUM + CZ ) * SY * D + Y ) * C * equatorial Radius * R ; return S ; }\n```", "answer": "vincenty"}
{"question_id": "9b2c884c-32e2-4cff-bdda-5b6188694de4", "question": "Does the statement push the topology ( if not null ) to it when entering the scope ?\n```java\n@ Override public void enter Scope ( final I Scope scope ) { super . enter Scope ( scope ) ; final I Topology topo = Cast . as Topology ( scope , topology . value ( scope ) ) ; if ( topo != null ) { previous . set ( scope . set Topology ( topo ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "d7116c3e-6458-4c33-8043-8d618a3b4b6e", "question": "Does the statement remember the one that was previously pushed when entering the scope ?\n```java\n@ Override public void enter Scope ( final I Scope scope ) { super . enter Scope ( scope ) ; final I Topology topo = Cast . as Topology ( scope , topology . value ( scope ) ) ; if ( topo != null ) { previous . set ( scope . set Topology ( topo ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "a6facf1d-7d9d-47c4-93a9-1225e8401523", "question": "Does the code get the singleton object ?\n```java\npublic static Safe Android Classes And Methods v ( ) { if ( v == null ) v = new Safe Android Classes And Methods ( ) ; return v ; }\n```", "answer": "Yes"}
{"question_id": "0975ab68-bd01-402a-955a-6877ca5cfcf0", "question": "Do a train run the end of the stream for each message i d at ?\n```java\n@ Override public void end Of Stream ( ) throws Ade Exception , Ade Flow Exception { for ( Entry < String , Perodicity Bounder > last : m last Seen . entry Set ( ) ) { final Perodicity Bounder pb = last . get Value ( ) ; pb . train ( last . get Key ( ) ) ; } m trained = BOOL ; }\n```", "answer": "Yes"}
{"question_id": "08e1d2cc-750f-48da-8786-d72fccf8d1e7", "question": "What runs the end of the stream ?\n```java\n@ Override public void end Of Stream ( ) throws Ade Exception , Ade Flow Exception { for ( Entry < String , Perodicity Bounder > last : m last Seen . entry Set ( ) ) { final Perodicity Bounder pb = last . get Value ( ) ; pb . train ( last . get Key ( ) ) ; } m trained = BOOL ; }\n```", "answer": "a train"}
{"question_id": "323468fe-c0e0-4541-9d9d-d254373f3645", "question": "Will this function parse that to determine what dataobject it should be associated with and its units ?\n```java\nprivate Map < String , Metric Header Info > process CSV File Data Header ( Db Client db Client , Storage System storage System , String director Name , List < String > headers ) { Map < String , Metric Header Info > metric To Object Map = new Hash Map < > ( ) ; for ( String header : headers ) { Matcher matcher = METRIC NAME PATTERN . matcher ( header ) ; if ( matcher . matches ( ) ) { String name = matcher . group ( NUM ) ; if ( ! METRICS NAMES TO GATHER . contains ( name ) ) { continue ; } String object Name = matcher . group ( NUM ) ; String units = matcher . group ( NUM ) ; if ( Strings . is Null Or Empty ( object Name ) ) { object Name = EMPTY ; } Storage HA Domain vplex Director = lookup V Plex Director By Name ( db Client , storage System , director Name ) ; if ( object Name . equals ( EMPTY ) ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . DIRECTOR ; header Info . director = vplex Director ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } else { Storage Port storage Port = lookup V Plex Front Storage Port By Name ( db Client , vplex Director , object Name ) ; if ( storage Port != null ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . PORT ; header Info . director = vplex Director ; header Info . port = storage Port ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } } } } return metric To Object Map ; }\n```", "answer": "Yes"}
{"question_id": "4fcd6e70-3bae-48fb-af8d-232c861a9108", "question": "Do this function determine ?\n```java\nprivate Map < String , Metric Header Info > process CSV File Data Header ( Db Client db Client , Storage System storage System , String director Name , List < String > headers ) { Map < String , Metric Header Info > metric To Object Map = new Hash Map < > ( ) ; for ( String header : headers ) { Matcher matcher = METRIC NAME PATTERN . matcher ( header ) ; if ( matcher . matches ( ) ) { String name = matcher . group ( NUM ) ; if ( ! METRICS NAMES TO GATHER . contains ( name ) ) { continue ; } String object Name = matcher . group ( NUM ) ; String units = matcher . group ( NUM ) ; if ( Strings . is Null Or Empty ( object Name ) ) { object Name = EMPTY ; } Storage HA Domain vplex Director = lookup V Plex Director By Name ( db Client , storage System , director Name ) ; if ( object Name . equals ( EMPTY ) ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . DIRECTOR ; header Info . director = vplex Director ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } else { Storage Port storage Port = lookup V Plex Front Storage Port By Name ( db Client , vplex Director , object Name ) ; if ( storage Port != null ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . PORT ; header Info . director = vplex Director ; header Info . port = storage Port ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } } } } return metric To Object Map ; }\n```", "answer": "Yes"}
{"question_id": "f975053e-45da-4a47-93d0-f4595d567e94", "question": "Will headers contain each of the strings delimited by ?\n```java\nprivate Map < String , Metric Header Info > process CSV File Data Header ( Db Client db Client , Storage System storage System , String director Name , List < String > headers ) { Map < String , Metric Header Info > metric To Object Map = new Hash Map < > ( ) ; for ( String header : headers ) { Matcher matcher = METRIC NAME PATTERN . matcher ( header ) ; if ( matcher . matches ( ) ) { String name = matcher . group ( NUM ) ; if ( ! METRICS NAMES TO GATHER . contains ( name ) ) { continue ; } String object Name = matcher . group ( NUM ) ; String units = matcher . group ( NUM ) ; if ( Strings . is Null Or Empty ( object Name ) ) { object Name = EMPTY ; } Storage HA Domain vplex Director = lookup V Plex Director By Name ( db Client , storage System , director Name ) ; if ( object Name . equals ( EMPTY ) ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . DIRECTOR ; header Info . director = vplex Director ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } else { Storage Port storage Port = lookup V Plex Front Storage Port By Name ( db Client , vplex Director , object Name ) ; if ( storage Port != null ) { Metric Header Info header Info = new Metric Header Info ( ) ; header Info . type = Metric Header Info . Type . PORT ; header Info . director = vplex Director ; header Info . port = storage Port ; header Info . units = units ; metric To Object Map . put ( header , header Info ) ; } } } } return metric To Object Map ; }\n```", "answer": "Yes"}
{"question_id": "b62c7cf3-7f8b-4965-bef8-b28452699774", "question": "Does the code create a new empty keyset ?\n```java\npublic Key Set ( ) { this . keys = new Linked List < > ( ) ; this . lookup = new Tree Map < > ( ) ; }\n```", "answer": "Yes"}
{"question_id": "b9f4a65d-933f-421e-a7f0-71afbecedb60", "question": "Have we pushed the bottom element off the bottom of the screen when we did not need to ?\n```java\nprivate void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }\n```", "answer": "Yes"}
{"question_id": "b4a24484-51a0-47e8-b2f3-cc46c9f6fcda", "question": "Have we dragged the bottom of the list too low ?\n```java\nprivate void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }\n```", "answer": "Yes"}
{"question_id": "23c5fec2-9ce6-4160-8ccf-bf0a4603ae3d", "question": "What did we not need when ?\n```java\nprivate void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }\n```", "answer": "to"}
{"question_id": "b8fc1e79-a3de-4e85-8443-2f819f45c256", "question": "Did we need to when ?\n```java\nprivate void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Scroll Child Top ( ) ; final int start = m List Padding . top ; final int end = ( get Bottom ( ) - get Top ( ) ) - m List Padding . bottom ; int top Offset = first Top - start ; final int last Bottom = get Scroll Child Bottom ( ) ; int last Position = m First Position + child Count - NUM ; if ( top Offset > NUM ) { if ( last Position < m Item Count - NUM || last Bottom > end ) { if ( last Position == m Item Count - NUM ) { top Offset = Math . min ( top Offset , last Bottom - end ) ; } try Offset Children Top And Bottom ( - top Offset ) ; if ( last Position < m Item Count - NUM ) { fill Down ( last Position + NUM , get Fill Child Top ( ) + m Divider Height ) ; adjust Views Up Or Down ( ) ; } } else if ( last Position == m Item Count - NUM ) { adjust Views Up Or Down ( ) ; } } } }\n```", "answer": "No"}
{"question_id": "2ea2d127-795c-4e6e-8642-eed6b5e45472", "question": "Does the code create a polyline / polygon shape from a set of points ?\n```java\nprotected Shape create Shape ( int [ ] x Points , int [ ] y Points , int n Points , boolean close , boolean biased ) { float offset = biased ? ( float ) bias : NUM ; General Path path = new General Path ( General Path . WIND EVEN ODD ) ; if ( n Points > NUM ) { path . move To ( x Points [ NUM ] + offset , y Points [ NUM ] + offset ) ; int last X = x Points [ NUM ] ; int last Y = y Points [ NUM ] ; if ( close && ( Math . abs ( x Points [ n Points - NUM ] - last X ) < NUM ) && ( Math . abs ( y Points [ n Points - NUM ] - last Y ) < NUM ) ) { n Points -- ; } for ( int i = NUM ; i < n Points ; i ++ ) { if ( ( Math . abs ( x Points [ i ] - last X ) > NUM ) || ( Math . abs ( y Points [ i ] - last Y ) > NUM ) ) { path . line To ( x Points [ i ] + offset , y Points [ i ] + offset ) ; last X = x Points [ i ] ; last Y = y Points [ i ] ; } } if ( close ) path . close Path ( ) ; } return path ; }\n```", "answer": "Yes"}
{"question_id": "0b881270-855c-4cbd-af81-a7d168b46d97", "question": "Did extra code info give in the given stream ?\n```java\nprivate static void write Extra Codes ( int char Offset , byte [ ] bytes , byte extra Code Modifier , Extra Codes Stream extra Codes ) throws IO Exception { int num Chars = extra Codes . get Num Chars ( ) ; if ( num Chars < char Offset ) { int fill Chars = char Offset - num Chars ; extra Codes . write Fill ( fill Chars , INTERNATIONAL EXTRA PLACEHOLDER ) ; extra Codes . increment Num Chars ( fill Chars ) ; } if ( bytes != null ) { extra Codes . write ( bytes ) ; extra Codes . increment Num Chars ( NUM ) ; } else { int last Idx = extra Codes . get Length ( ) - NUM ; if ( last Idx >= NUM ) { byte last Byte = extra Codes . get ( last Idx ) ; last Byte += extra Code Modifier ; extra Codes . set ( last Idx , last Byte ) ; } else { extra Codes . write ( extra Code Modifier ) ; extra Codes . set Unprintable Prefix Len ( NUM ) ; } } }\n```", "answer": "Yes"}
{"question_id": "bcec5ace-522a-4ab2-9d1d-4b33835d7716", "question": "Does the code translate a disassembled program to reil code ?\n```java\npublic Reil Program < Instruction Type > translate ( final I Translation Environment environment , final List < ? extends I Block Container < Instruction Type > > functions ) throws Internal Translation Exception { Preconditions . check Not Null ( environment , STRING ) ; final Reil Program < Instruction Type > program = new Reil Program < Instruction Type > ( ) ; for ( final I Block Container < Instruction Type > function : functions ) { program . add Function ( function , translate ( environment , function ) ) ; } return program ; }\n```", "answer": "Yes"}
{"question_id": "1a797ba2-9aff-4274-b117-63144cd81abe", "question": "Does the code translate to reil code a disassembled program ?\n```java\npublic Reil Program < Instruction Type > translate ( final I Translation Environment environment , final List < ? extends I Block Container < Instruction Type > > functions ) throws Internal Translation Exception { Preconditions . check Not Null ( environment , STRING ) ; final Reil Program < Instruction Type > program = new Reil Program < Instruction Type > ( ) ; for ( final I Block Container < Instruction Type > function : functions ) { program . add Function ( function , translate ( environment , function ) ) ; } return program ; }\n```", "answer": "Yes"}
{"question_id": "851a9128-4a77-41b7-931c-d34290aa6597", "question": "Does the code remove a result listener ?\n```java\npublic void remove Result Listener ( Result Listener listener ) { listener List . remove ( listener ) ; }\n```", "answer": "Yes"}
{"question_id": "44abfae0-41e7-46ca-ab9c-3c06df045328", "question": "In which direction do 4 roads run ?\n```java\npublic Array List < Building Template > generate City ( boolean generic Road ) { int width = map Settings . get Board Width ( ) ; int height = map Settings . get Board Height ( ) ; int roads = map Settings . get City Blocks ( ) ; roads = ( roads * Math . min ( width , height ) ) / NUM ; String city Type = map Settings . get City Type ( ) ; city Plan = new Hash Set < Coords > ( ) ; if ( generic Road ) { add Generic Road ( ) ; } if ( city Type . equals Ignore Case ( STRING ) ) build Hub City ( width , height , roads ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Metro City ( width , height ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Grid City ( width , height , ( roads + NUM ) / NUM ) ; else if ( city Type . equals Ignore Case ( STRING ) ) return build Town ( width , height , roads , map Settings . get Town Size ( ) ) ; else return new Array List < Building Template > ( ) ; return place Buildings ( NUM ) ; }\n```", "answer": "east west"}
{"question_id": "48c841db-bf15-4f8a-8141-18db689b3693", "question": "Will this function generate a city with a grid lay out . 4 rounds running north and south and 4 roads running east west ?\n```java\npublic Array List < Building Template > generate City ( boolean generic Road ) { int width = map Settings . get Board Width ( ) ; int height = map Settings . get Board Height ( ) ; int roads = map Settings . get City Blocks ( ) ; roads = ( roads * Math . min ( width , height ) ) / NUM ; String city Type = map Settings . get City Type ( ) ; city Plan = new Hash Set < Coords > ( ) ; if ( generic Road ) { add Generic Road ( ) ; } if ( city Type . equals Ignore Case ( STRING ) ) build Hub City ( width , height , roads ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Metro City ( width , height ) ; else if ( city Type . equals Ignore Case ( STRING ) ) build Grid City ( width , height , ( roads + NUM ) / NUM ) ; else if ( city Type . equals Ignore Case ( STRING ) ) return build Town ( width , height , roads , map Settings . get Town Size ( ) ) ; else return new Array List < Building Template > ( ) ; return place Buildings ( NUM ) ; }\n```", "answer": "Yes"}
{"question_id": "d88817a0-634f-4aa4-85c9-692c79ec520d", "question": "Does the code create a declaration annotatedtypevariable for typevariable ?\n```java\nprivate Annotated Type Variable create Annotated Type Var ( final Type Variable type Variable , final Annotated Type Factory type Factory ) { return ( Annotated Type Variable ) type Factory . get Annotated Type ( type Variable . as Element ( ) ) ; }\n```", "answer": "Yes"}
{"question_id": "fcd11f52-3e3b-4098-95be-e899cd74d688", "question": "Will the implementation of this method create a local session for the local user identified by the information in the map meaningful only for sp side ?\n```java\npublic Object create Session ( Map info , Http Servlet Request request , Http Servlet Response response , String Buffer target Application ) throws Session Exception { debug . message ( STRING + info ) ; return info . get ( Session Provider . PRINCIPAL NAME ) ; }\n```", "answer": "Yes"}
{"question_id": "9874b7bf-e8b7-4d3f-80ec-7c6aef6dd8e9", "question": "Does this method provide access to locale sensitive decimal style symbols ?\n```java\npublic static Decimal Style of ( Locale locale ) { Objects . require Non Null ( locale , STRING ) ; Decimal Style info = CACHE . get ( locale ) ; if ( info == null ) { info = create ( locale ) ; CACHE . put If Absent ( locale , info ) ; info = CACHE . get ( locale ) ; } return info ; }\n```", "answer": "Yes"}
{"question_id": "3f07f3c3-82a8-4dd3-af73-33b9294c0b74", "question": "Does the code obtain the decimalstyle for the specified locale ?\n```java\npublic static Decimal Style of ( Locale locale ) { Objects . require Non Null ( locale , STRING ) ; Decimal Style info = CACHE . get ( locale ) ; if ( info == null ) { info = create ( locale ) ; CACHE . put If Absent ( locale , info ) ; info = CACHE . get ( locale ) ; } return info ; }\n```", "answer": "Yes"}
{"question_id": "0d386802-6e8d-4242-896a-e8bafab460be", "question": "Does the code add an unspecified amount of tabstop elements as properties to the paragraph ?\n```java\npublic Paragraph add Tab Stops ( Tab Stop ... tab Stops ) { add Tab Stops As Property ( Arrays . as List ( tab Stops ) ) ; return this ; }\n```", "answer": "Yes"}
{"question_id": "8b4f75b0-e2fd-496c-a7d2-baa53828e6c0", "question": "Does the code write the result set of a query to a file in the csv format ?\n```java\npublic int write ( Connection conn , String output File Name , String sql , String charset ) throws SQL Exception { Statement stat = conn . create Statement ( ) ; Result Set rs = stat . execute Query ( sql ) ; int rows = write ( output File Name , rs , charset ) ; stat . close ( ) ; return rows ; }\n```", "answer": "Yes"}
{"question_id": "93f7a914-ee2d-4189-ad49-2b1990cc496e", "question": "Does the code create a header by reading the information from the input stream ?\n```java\npublic static Header read Header ( Array Data Input dis ) throws Truncated File Exception , IO Exception { Header my Header = new Header ( ) ; try { my Header . read ( dis ) ; } catch ( EOF Exception e ) { if ( e . get Cause ( ) instanceof Truncated File Exception ) { throw e ; } return null ; } return my Header ; }\n```", "answer": "Yes"}
{"question_id": "96c65026-990a-4f0c-bba5-c215c385980b", "question": "Does the code load the section order ( if available ) for this service ?\n```java\nprivate boolean load Section Order ( ) { return load Section Order ( service Name + FILENAME SUFFIX ) ; }\n```", "answer": "Yes"}
{"question_id": "6a0a9911-d503-4d86-94fa-13ad84f54d23", "question": "Does the code get the entity at the specified revision ?\n```java\n@ Nullable public T ENTITY find Revision ( int id , int revision Number ) { T ENTITY result = null ; try { begin ( ) ; Audit Reader reader = Audit Reader Factory . get ( get Entity Manager ( ) ) ; result = reader . find ( entity Class , id , revision Number ) ; commit ( ) ; } catch ( No Result Exception e ) { rollback ( ) ; LOG . warn ( STRING + revision Number + STRING + id ) ; } finally { cleanup ( ) ; } return result ; }\n```", "answer": "Yes"}
{"question_id": "05683b47-6f42-463b-9c6b-4d2e3a7ba9fa", "question": "Does the code indicate ?\n```java\npublic boolean is Empty ( ) { return map . is Empty ( ) ; }\n```", "answer": "Yes"}
{"question_id": "f82f1c93-c5ae-432b-a1e1-51331d63da11", "question": "Is user inform ?\n```java\nprivate void notify Listeners ( Object object , Json Object config ) { for ( Property Change Listener config Update : listener ) { config Update . property Change ( new Property Change Event ( this , STRING , config , config ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "c06dc524-ddb3-4b38-9436-d84967ff7766", "question": "Is by the ui used to inform user what the status of the setup is this since it can take a long time ?\n```java\nprivate void notify Listeners ( Object object , Json Object config ) { for ( Property Change Listener config Update : listener ) { config Update . property Change ( new Property Change Event ( this , STRING , config , config ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "ce4150fd-97b5-474a-ba3c-d4d09d2f7a12", "question": "Do the status of the setup be what ?\n```java\nprivate void notify Listeners ( Object object , Json Object config ) { for ( Property Change Listener config Update : listener ) { config Update . property Change ( new Property Change Event ( this , STRING , config , config ) ) ; } }\n```", "answer": "Yes"}
{"question_id": "97efa6d6-cbd3-4ef8-88be-df6c2b6089b8", "question": "Did the code given a time when a particular state changes from inactive to active , and a time when a particular state changes from active to inactive determine ?\n```java\nprivate boolean is Active ( Calendar active Start , Calendar inactive Start ) { if ( inactive Start != null && active Start != null && inactive Start . before ( active Start ) ) return ! is Active ( inactive Start , active Start ) ; Calendar current = Calendar . get Instance ( ) ; return ! ( active Start != null && current . before ( active Start ) ) && ! ( inactive Start != null && current . after ( inactive Start ) ) ; }\n```", "answer": "Yes"}
{"question_id": "9f519a49-046a-4328-900f-227cd69dc1da", "question": "Does the code request the read lock . block until a read operation can be performed safely ?\n```java\npublic synchronized void read Request ( ) { if ( current Writers == NUM && writer Locks . size ( ) == NUM ) { ++ current Readers ; } else { ++ queued Readers ; try { wait ( ) ; } catch ( Interrupted Exception e ) { } } }\n```", "answer": "Yes"}
{"question_id": "7515bc3b-2c1c-4396-932a-ea045cbb973f", "question": "How might inputs be passed ?\n```java\npublic static boolean check CP Reblock ( Execution Context ec , String varin ) throws DML Runtime Exception { Cacheable Data < ? > obj = ec . get Cacheable Data ( varin ) ; Matrix Characteristics mc = ec . get Matrix Characteristics ( varin ) ; long rows = mc . get Rows ( ) ; long cols = mc . get Cols ( ) ; long nnz = mc . get Non Zeros ( ) ; if ( ! Configuration Manager . is Dynamic Recompilation ( ) || ! Optimizer Utils . is Hybrid Execution Mode ( ) ) { return BOOL ; } Matrix Format Meta Data iimd = ( Matrix Format Meta Data ) obj . get Meta Data ( ) ; if ( obj . get RDD Handle ( ) != null && iimd . get Input Info ( ) != Input Info . Binary Block Input Info && iimd . get Input Info ( ) != Input Info . Binary Cell Input Info ) { return BOOL ; } if ( rows <= NUM || cols <= NUM ) { return BOOL ; } double sp = Optimizer Utils . get Sparsity ( rows , cols , nnz ) ; double mem = Matrix Block . estimate Size In Memory ( rows , cols , sp ) ; if ( ! Optimizer Utils . is Valid CP Dimensions ( rows , cols ) || ! Optimizer Utils . is Valid CP Matrix Size ( rows , cols , sp ) || mem >= Optimizer Utils . get Local Mem Budget ( ) ) { return BOOL ; } long est Filesize = ( long ) ( NUM * mem ) ; long cp Threshold = CP REBLOCK THRESHOLD SIZE * Optimizer Utils . get Parallel Text Read Parallelism ( ) ; return ( est Filesize < cp Threshold ) ; }\n```", "answer": "via rdds"}
{"question_id": "cbf9ad63-38be-4326-8c2c-f9f21c66cb9d", "question": "What do the knowledgeedge ' s represent ?\n```java\npublic final Iterator < Knowledge Edge > required Edges Iterator ( ) { Set < Knowledge Edge > edges = new Hash Set < > ( ) ; for ( Ordered Pair < Set < My Node > > o : required Rules Specs ) { final Set < My Node > first = o . get First ( ) ; for ( My Node s1 : first ) { final Set < My Node > second = o . get Second ( ) ; for ( My Node s2 : second ) { if ( ! s1 . equals ( s2 ) ) { edges . add ( new Knowledge Edge ( s1 . get Name ( ) , s2 . get Name ( ) ) ) ; } } } } return edges . iterator ( ) ; }\n```", "answer": "required edges"}
{"question_id": "c85d9c42-7cab-41ae-929b-94cc98d164f9", "question": "When did garbage collect ?\n```java\nstatic void increment Keep Alive Count ( ) { synchronized ( keep Alive Lock ) { keep Alive Count ++ ; if ( reaper == null ) { reaper = Access Controller . do Privileged ( new New Thread Action ( new Reaper ( ) , STRING , BOOL ) ) ; reaper . start ( ) ; } if ( gc Latency Request == null ) { gc Latency Request = GC . request Latency ( gc Interval ) ; } } }\n```", "answer": "while exported"}
{"question_id": "df4300e0-4a1d-4644-a403-ca9271bb599f", "question": "What converts to corresponding outputindex ?\n```java\nprivate int index To Output Index ( int parameter Index ) throws SQL Exception { try { if ( output Parameter Mapper [ parameter Index - NUM ] == - NUM ) { throw new SQL Exception ( STRING + parameter Index + STRING ) ; } return output Parameter Mapper [ parameter Index - NUM ] ; } catch ( Array Index Out Of Bounds Exception array Index Out Of Bounds Exception ) { if ( parameter Index < NUM ) { throw new SQL Exception ( STRING + parameter Index + STRING ) ; } throw new SQL Exception ( STRING + parameter Index + STRING + params . size ( ) ) ; } }\n```", "answer": "parameter index"}
{"question_id": "f448a17f-9975-47e0-967b-96e76dec1d8e", "question": "What is this called the first time ?\n```java\nprivate int inject Callbacks ( final Callback [ ] real Callbacks , final int state ) throws Auth Login Exception { if ( authentication Context . has More Requirements ( ) ) { if ( real Callbacks != null ) { authentication Context . submit Requirements ( real Callbacks ) ; } if ( authentication Context . has More Requirements ( ) ) { return inject And Return ( state ) ; } else { return finish Login Module ( state ) ; } } return process Error ( bundle . get String ( STRING ) , STRING ) ; }\n```", "answer": "realcallbacks"}
{"question_id": "ee126648-b85f-4830-80c6-241c4fe22045", "question": "Must the string be contain any ' \\ n ' ?\n```java\npublic void print ( String s ) { writer . print ( s ) ; }\n```", "answer": "No"}
{"question_id": "024ae4ae-f06b-40ff-ae34-1a6a9360668f", "question": "What must be not contain any ' \\ n ' ?\n```java\npublic void print ( String s ) { writer . print ( s ) ; }\n```", "answer": "the string"}
{"question_id": "9cd583d2-81b7-4dff-9806-92f296822960", "question": "How did the queue names sorted list store ?\n```java\npublic static String construct Queue Names Redis Key ( String shard Name ) { return String . format ( STRING , PINLATER QUEUE NAMES KEY PREFIX , shard Name ) ; }\n```", "answer": "in redis"}
{"question_id": "8a887a7a-216e-41f0-a854-8b18097c6207", "question": "What does the code add to the registry returning a new membership key ?\n```java\nvoid add ( Membership Key Impl key ) { Inet Address group = key . group ( ) ; List < Membership Key Impl > keys ; if ( groups == null ) { groups = new Hash Map < Inet Address , List < Membership Key Impl > > ( ) ; keys = null ; } else { keys = groups . get ( group ) ; } if ( keys == null ) { keys = new Linked List < Membership Key Impl > ( ) ; groups . put ( group , keys ) ; } keys . add ( key ) ; }\n```", "answer": "membership"}
{"question_id": "b4bf7a4f-63f6-4489-b1b3-e9f2f2a39f6d", "question": "In which direction does the code traverse the graph ?\n```java\nprivate void traverse ( int distance , Word Token token , Immutable Stack < Word Token > history , Traverse Predicate predicate ) { final int new Distance = distance - NUM ; if ( new Distance <= NUM ) { return ; } for ( final Edge e : edges . get ( token ) ) { final Word Token other = e . get Other ( token ) ; if ( ! history . contains ( other ) && predicate . test ( e . get Dependency ( ) , token , other , history ) ) { final Immutable Stack < Word Token > stack = history . push ( other ) ; traverse ( new Distance , other , stack , predicate ) ; } } }\n```", "answer": "from token"}
{"question_id": "4fd72dfe-757e-44a8-96b9-80e204d252f8", "question": "What evaluates on the body ?\n```java\npublic final void hack Gravity ( double rsize , Node root ) { Math Vector pos 0 = ( Math Vector ) pos . clone ( ) ; HG hg = new HG ( this , pos ) ; hg = root . walk Sub Tree ( rsize * rsize , hg ) ; phi = hg . phi 0 ; new Acc = hg . acc 0 ; }\n```", "answer": "gravitational field"}
{"question_id": "3f68a04e-6319-477f-9ce2-c23e303b8472", "question": "What do all threads reach ?\n```java\npublic void await ( int ID ) throws Interrupted Exception { if ( parties == NUM ) return ; final boolean start Condition = competition Condition ; int competing For = ( locks . length * NUM - NUM - ID ) / NUM ; while ( competing For >= NUM ) { final Lock node = locks [ competing For ] ; if ( node . try Lock ( ) ) { synchronized ( node ) { while ( competition Condition == start Condition ) node . wait ( ) ; } node . unlock ( ) ; wake Up Target ( competing For * NUM + NUM ) ; wake Up Target ( competing For * NUM + NUM ) ; return ; } else { if ( competing For == NUM ) break ; competing For = ( competing For - NUM ) / NUM ; } } competition Condition = ! competition Condition ; wake Up Target ( NUM ) ; }\n```", "answer": "this barrier"}
{"question_id": "2fd216c6-a6f4-40cf-9e4a-123cfbae7415", "question": "How does the revocation status of a list of certificates check ?\n```java\nstatic OCSP Response check ( List < Cert Id > cert Ids , URI responder URI , X509 Certificate issuer Cert , X509 Certificate responder Cert , Date date , List < Extension > extensions ) throws IO Exception , Cert Path Validator Exception { byte [ ] bytes = null ; OCSP Request request = null ; try { request = new OCSP Request ( cert Ids , extensions ) ; bytes = request . encode Bytes ( ) ; } catch ( IO Exception ioe ) { throw new Cert Path Validator Exception ( STRING , ioe ) ; } Input Stream in = null ; Output Stream out = null ; byte [ ] response = null ; try { URL url = responder URI . to URL ( ) ; if ( debug != null ) { debug . println ( STRING + url ) ; } Http URL Connection con = ( Http URL Connection ) url . open Connection ( ) ; con . set Connect Timeout ( CONNECT TIMEOUT ) ; con . set Read Timeout ( CONNECT TIMEOUT ) ; con . set Do Output ( BOOL ) ; con . set Do Input ( BOOL ) ; con . set Request Method ( STRING ) ; con . set Request Property ( STRING , STRING ) ; con . set Request Property ( STRING , String . value Of ( bytes . length ) ) ; out = con . get Output Stream ( ) ; out . write ( bytes ) ; out . flush ( ) ; if ( debug != null && con . get Response Code ( ) != Http URL Connection . HTTP OK ) { debug . println ( STRING + con . get Response Code ( ) + STRING + con . get Response Message ( ) ) ; } in = con . get Input Stream ( ) ; int content Length = con . get Content Length ( ) ; if ( content Length == - NUM ) { content Length = Integer . MAX VALUE ; } response = new byte [ content Length > NUM ? NUM : content Length ] ; int total = NUM ; while ( total < content Length ) { int count = in . read ( response , total , response . length - total ) ; if ( count < NUM ) break ; total += count ; if ( total >= response . length && total < content Length ) { response = Arrays . copy Of ( response , total * NUM ) ; } } response = Arrays . copy Of ( response , total ) ; } catch ( IO Exception ioe ) { throw new Cert Path Validator Exception ( STRING , ioe , null , - NUM , Basic Reason . UNDETERMINED REVOCATION STATUS ) ; } finally { if ( in != null ) { try { in . close ( ) ; } catch ( IO Exception ioe ) { throw ioe ; } } if ( out != null ) { try { out . close ( ) ; } catch ( IO Exception ioe ) { throw ioe ; } } } OCSP Response ocsp Response = null ; try { ocsp Response = new OCSP Response ( response ) ; } catch ( IO Exception ioe ) { throw new Cert Path Validator Exception ( ioe ) ; } ocsp Response . verify ( cert Ids , issuer Cert , responder Cert , date , request . get Nonce ( ) ) ; return ocsp Response ; }\n```", "answer": "using ocsp"}
{"question_id": "eb72bc1c-a618-476a-8bff-b650d94d8c6d", "question": "What does the code reset if the stream has been marked ?\n```java\n@ Override public void reset ( ) throws IO Exception { f Input Stream . reset ( ) ; }\n```", "answer": "the stream"}
{"question_id": "64f3a76f-a6d0-4f19-a192-161c9433cab8", "question": "Does the code reposition it at the mark ?\n```java\n@ Override public void reset ( ) throws IO Exception { f Input Stream . reset ( ) ; }\n```", "answer": "No"}
{"question_id": "a83c7c5e-642c-4483-84ae-f07018d7e94c", "question": "Do adding a new event to the queue preserve the temporal order of the events in the queue ?\n```java\npublic void add Event ( Sim Event new Event ) { new Event . set Serial ( serial ++ ) ; sorted Set . add ( new Event ) ; }\n```", "answer": "No"}
{"question_id": "17f41e80-5138-4f38-b631-9130a50afdf5", "question": "Does this method validate sql syntax ?\n```java\nprivate void validate Sql Statement ( String sql , int jdbc Statement Index ) { Assert . is True ( String Utils . is Not Blank ( sql ) , STRING + jdbc Statement Index + STRING ) ; }\n```", "answer": "No"}
{"question_id": "00f1a140-ce58-4914-84eb-573572238d07", "question": "What does this method not validate ?\n```java\nprivate void validate Sql Statement ( String sql , int jdbc Statement Index ) { Assert . is True ( String Utils . is Not Blank ( sql ) , STRING + jdbc Statement Index + STRING ) ; }\n```", "answer": "sql syntax"}
{"question_id": "2b227394-f650-4ba2-ba29-5eb8ee6db7d0", "question": "What does a panel do ?\n```java\npublic static J Panel create Vertical Panel ( String title ) { J Panel panel = new J Panel ( ) ; panel . set Layout ( new Grid Layout ( NUM , NUM ) ) ; if ( title != null ) { panel . set Border ( Border Factory . create Titled Border ( Border Factory . create Etched Border ( ) , title ) ) ; } else { panel . set Border ( Border Factory . create Etched Border ( ) ) ; } return panel ; }\n```", "answer": "vertical layout"}
{"question_id": "1c945a80-ae1f-4565-8907-26dad48fd224", "question": "What is at most on the beginning of the bottom stack ?\n```java\nprivate void clamp Position To Bottom Stack Start ( Stack Scroll State . View State child View State , int child Height ) { child View State . y Translation = Math . min ( child View State . y Translation , m Inner Height - m Bottom Stack Peek Size - m Collapse Second Card Padding - child Height ) ; }\n```", "answer": "its end"}
{"question_id": "e4bbb8df-c32a-44c1-8991-c40b141fd9fb", "question": "How does the code validate the points for the state of the given cell if the cell is not collapsed ?\n```java\npublic mx Rectangle validate Points ( mx Cell State parent State , Object cell ) { mx Cell State state = get State ( cell ) ; double min X = NUM ; double min Y = NUM ; double max X = NUM ; double max Y = NUM ; mx I Graph Model model = graph . get Model ( ) ; boolean is Edge = model . is Edge ( cell ) ; if ( state != null ) { if ( state . is Invalid ( ) ) { mx Geometry geo = graph . get Cell Geometry ( cell ) ; if ( is Edge ) { Object source = get Visible Terminal ( cell , BOOL ) ; if ( source != null && ! model . is Ancestor ( source , cell ) ) { Object p = model . get Parent ( source ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , source ) ; } Object target = get Visible Terminal ( cell , BOOL ) ; if ( target != null && ! model . is Ancestor ( target , cell ) ) { Object p = model . get Parent ( target ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , target ) ; } set Terminal Points ( state ) ; update Points ( state , geo . get Points ( ) , source , target ) ; update Terminal Points ( state , source , target ) ; update Edge Bounds ( state ) ; state . set Absolute Offset ( get Point ( state , geo ) ) ; } else if ( geo != null && geo . is Relative ( ) && parent State != null && model . is Edge ( parent State . get Cell ( ) ) ) { mx Point origin = get Point ( parent State , geo ) ; if ( origin != null ) { state . set X ( origin . get X ( ) ) ; state . set Y ( origin . get Y ( ) ) ; origin . set X ( ( origin . get X ( ) / scale ) - translate . get X ( ) ) ; origin . set Y ( ( origin . get Y ( ) / scale ) - translate . get Y ( ) ) ; state . set Origin ( origin ) ; child Moved ( parent State , state ) ; } } state . set Invalid ( BOOL ) ; } if ( is Edge || model . is Vertex ( cell ) ) { update Label Bounds ( state ) ; mx Rectangle bb = update Bounding Box ( state ) ; min X = bb . get X ( ) ; min Y = bb . get Y ( ) ; max X = bb . get X ( ) + bb . get Width ( ) ; max Y = bb . get Y ( ) + bb . get Height ( ) ; } } if ( state != null && ( ! graph . is Cell Collapsed ( cell ) || cell == current Root ) ) { int child Count = model . get Child Count ( cell ) ; for ( int i = NUM ; i < child Count ; i ++ ) { Object child = model . get Child At ( cell , i ) ; mx Rectangle bounds = validate Points ( state , child ) ; min X = Math . min ( min X , bounds . get X ( ) ) ; min Y = Math . min ( min Y , bounds . get Y ( ) ) ; max X = Math . max ( max X , bounds . get X ( ) + bounds . get Width ( ) ) ; max Y = Math . max ( max Y , bounds . get Y ( ) + bounds . get Height ( ) ) ; } } return new mx Rectangle ( min X , min Y , max X - min X , max Y - min Y ) ; }\n```", "answer": "recursively"}
{"question_id": "12eccbb7-c25f-4b83-b69e-6b14984498ce", "question": "Does the code return the bounding box of all visited states as a rectangle ?\n```java\npublic mx Rectangle validate Points ( mx Cell State parent State , Object cell ) { mx Cell State state = get State ( cell ) ; double min X = NUM ; double min Y = NUM ; double max X = NUM ; double max Y = NUM ; mx I Graph Model model = graph . get Model ( ) ; boolean is Edge = model . is Edge ( cell ) ; if ( state != null ) { if ( state . is Invalid ( ) ) { mx Geometry geo = graph . get Cell Geometry ( cell ) ; if ( is Edge ) { Object source = get Visible Terminal ( cell , BOOL ) ; if ( source != null && ! model . is Ancestor ( source , cell ) ) { Object p = model . get Parent ( source ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , source ) ; } Object target = get Visible Terminal ( cell , BOOL ) ; if ( target != null && ! model . is Ancestor ( target , cell ) ) { Object p = model . get Parent ( target ) ; mx Cell State pstate = get State ( p ) ; validate Points ( pstate , target ) ; } set Terminal Points ( state ) ; update Points ( state , geo . get Points ( ) , source , target ) ; update Terminal Points ( state , source , target ) ; update Edge Bounds ( state ) ; state . set Absolute Offset ( get Point ( state , geo ) ) ; } else if ( geo != null && geo . is Relative ( ) && parent State != null && model . is Edge ( parent State . get Cell ( ) ) ) { mx Point origin = get Point ( parent State , geo ) ; if ( origin != null ) { state . set X ( origin . get X ( ) ) ; state . set Y ( origin . get Y ( ) ) ; origin . set X ( ( origin . get X ( ) / scale ) - translate . get X ( ) ) ; origin . set Y ( ( origin . get Y ( ) / scale ) - translate . get Y ( ) ) ; state . set Origin ( origin ) ; child Moved ( parent State , state ) ; } } state . set Invalid ( BOOL ) ; } if ( is Edge || model . is Vertex ( cell ) ) { update Label Bounds ( state ) ; mx Rectangle bb = update Bounding Box ( state ) ; min X = bb . get X ( ) ; min Y = bb . get Y ( ) ; max X = bb . get X ( ) + bb . get Width ( ) ; max Y = bb . get Y ( ) + bb . get Height ( ) ; } } if ( state != null && ( ! graph . is Cell Collapsed ( cell ) || cell == current Root ) ) { int child Count = model . get Child Count ( cell ) ; for ( int i = NUM ; i < child Count ; i ++ ) { Object child = model . get Child At ( cell , i ) ; mx Rectangle bounds = validate Points ( state , child ) ; min X = Math . min ( min X , bounds . get X ( ) ) ; min Y = Math . min ( min Y , bounds . get Y ( ) ) ; max X = Math . max ( max X , bounds . get X ( ) + bounds . get Width ( ) ) ; max Y = Math . max ( max Y , bounds . get Y ( ) + bounds . get Height ( ) ) ; } } return new mx Rectangle ( min X , min Y , max X - min X , max Y - min Y ) ; }\n```", "answer": "No"}
{"question_id": "7d927bca-c2cd-456f-b19b-6207baf3bc04", "question": "What might an example serve best ?\n```java\npublic static String collapse ( String name ) { if ( name == null ) { return null ; } int break Point = name . last Index Of ( STRING ) ; if ( break Point < NUM ) { return name ; } return collapse Qualifier ( name . substring ( NUM , break Point ) , BOOL ) + name . substring ( break Point ) ; }\n```", "answer": "to explain"}
{"question_id": "35cafd5c-80d5-4ab3-84dc-ec6696f7e3f2", "question": "Where is this method invoked from the event handler ?\n```java\nvoid dispatch Committed Text ( String str , long when ) { if ( str == null ) return ; if ( composed Text == null ) { Attributed String attrstr = new Attributed String ( str ) ; post Input Method Event ( Input Method Event . INPUT METHOD TEXT CHANGED , attrstr . get Iterator ( ) , str . length ( ) , null , null , when ) ; } else { committed Text = str ; } }\n```", "answer": "in canvas"}
{"question_id": "ce6fe253-a5e8-41b8-951a-7f3c6f0abf6f", "question": "What overlap the specified rectangle ?\n```java\npublic Iterable < Divider > dividers That Overlap ( final Rectangle r ) { if ( r == null ) { throw new Illegal Argument Exception ( STRING ) ; } return dividers That Overlap ( get Model ( ) , r ) ; }\n```", "answer": "the dividers"}
{"question_id": "19d2e918-954f-4f30-b4ff-796226eda0fe", "question": "What do a string represent ?\n```java\npublic static String cutpoints To String ( double [ ] cut Points , boolean [ ] cut And Left ) { String Buffer text = new String Buffer ( STRING ) ; if ( cut Points == null ) { text . append ( STRING ) ; } else { text . append ( STRING + cut Points . length + STRING ) ; for ( int i = NUM ; i < cut Points . length ; i ++ ) { text . append ( STRING + cut Points [ i ] + STRING ) ; text . append ( STRING + cut And Left [ i ] + STRING ) ; } text . append ( STRING ) ; } return text . to String ( ) ; }\n```", "answer": "the cutpoints"}
{"question_id": "0b72890d-6780-4bef-8858-8953550626d2", "question": "What adds to the list of features while increasing or maintaining the current accuracy ?\n```java\nstatic protected int SFS Select Feature ( Set < Integer > available , Data Set data Set , Set < Integer > cat To Remove , Set < Integer > num To Remove , Set < Integer > cat Selecteed , Set < Integer > num Selected , Object evaluater , int folds , Random rand , double [ ] Pbest Score , int min Features ) { int n Cat = data Set . get Num Categorical Vars ( ) ; int cur Best = - NUM ; double cur Best Score = Double . POSITIVE INFINITY ; for ( int feature : available ) { remove Feature ( feature , n Cat , cat To Remove , num To Remove ) ; Data Set work On = data Set . shallow Clone ( ) ; Remove Attribute Transform remove = new Remove Attribute Transform ( work On , cat To Remove , num To Remove ) ; work On . apply Transform ( remove ) ; double score = get Score ( work On , evaluater , folds , rand ) ; if ( score < cur Best Score ) { cur Best Score = score ; cur Best = feature ; } add Feature ( feature , n Cat , cat To Remove , num To Remove ) ; } if ( cur Best Score <= NUM && Pbest Score [ NUM ] <= NUM && cat Selecteed . size ( ) + num Selected . size ( ) >= min Features ) return - NUM ; if ( cur Best Score < Pbest Score [ NUM ] || cat Selecteed . size ( ) + num Selected . size ( ) < min Features || Math . abs ( Pbest Score [ NUM ] - cur Best Score ) < NUM ) { Pbest Score [ NUM ] = cur Best Score ; add Feature ( cur Best , n Cat , cat Selecteed , num Selected ) ; remove Feature ( cur Best , n Cat , cat To Remove , num To Remove ) ; available . remove ( cur Best ) ; return cur Best ; } else return - NUM ; }\n```", "answer": "one feature"}
{"question_id": "762dd5e2-936e-4a03-a32a-02d9d69c1b01", "question": "What did gossip not produce for a specific period ?\n```java\npublic static boolean is Node Group Available ( Service Host host , Node Group State local State ) { if ( Node Group Utils . is Membership Settled ( host , host . get Maintenance Interval Micros ( ) , local State ) && Node Group Utils . has Membership Quorum ( host , local State ) ) { return BOOL ; } return BOOL ; }\n```", "answer": "changes"}
{"question_id": "ecab8f05-17d3-4611-a7d1-fd52c9dc8f8b", "question": "Did gossip produce changes for a specific period ?\n```java\npublic static boolean is Node Group Available ( Service Host host , Node Group State local State ) { if ( Node Group Utils . is Membership Settled ( host , host . get Maintenance Interval Micros ( ) , local State ) && Node Group Utils . has Membership Quorum ( host , local State ) ) { return BOOL ; } return BOOL ; }\n```", "answer": "No"}
{"question_id": "b45f2c9b-c5df-4f53-bbaa-090a70c8dd90", "question": "What did not produce changes for a specific period ?\n```java\npublic static boolean is Node Group Available ( Service Host host , Node Group State local State ) { if ( Node Group Utils . is Membership Settled ( host , host . get Maintenance Interval Micros ( ) , local State ) && Node Group Utils . has Membership Quorum ( host , local State ) ) { return BOOL ; } return BOOL ; }\n```", "answer": "gossip"}
{"question_id": "b8b10087-2d53-4682-901f-3d64335cfd49", "question": "What did the code init into the cache array ?\n```java\nprivate void init Vold Fstab To Cache ( ) throws IO Exception { cache . clear ( ) ; Buffered Reader br = new Buffered Reader ( new File Reader ( VOLD FSTAB ) ) ; String tmp = null ; while ( ( tmp = br . read Line ( ) ) != null ) { if ( tmp . starts With ( HEAD ) ) { cache . add ( tmp ) ; } } br . close ( ) ; cache . trim To Size ( ) ; }\n```", "answer": "the words"}
{"question_id": "c0992443-7dc8-4785-a7d2-e64e62a79b59", "question": "What do we visit more than once more than once ?\n```java\nprivate Set < CCFG Node > handle Method Call Node ( CCFG Node node , Stack < Method Call > call Stack , Set < CCFG Node > handled ) { CCFG Method Call Node call Node = ( CCFG Method Call Node ) node ; update Call Stack For Call Node ( call Stack , call Node ) ; return filter Handled Map For Method Call Node ( call Node , handled ) ; }\n```", "answer": "some nodes"}
{"question_id": "64288b40-c8c5-4d63-b6f6-886e35b6ff82", "question": "What can the host no longer receive after calling this ?\n```java\npublic void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }\n```", "answer": "extension updates"}
{"question_id": "419f4e42-02c3-4bca-9155-47f79171e190", "question": "Can the host receive extension updates after calling this ?\n```java\npublic void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }\n```", "answer": "No"}
{"question_id": "875ecba2-0b74-497f-9341-f469b4d9ef41", "question": "What do the activity or service hold ?\n```java\npublic void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }\n```", "answer": "this host"}
{"question_id": "fb1f2000-b023-4742-b677-454fe5284ce6", "question": "What can no longer receive extension updates after calling this ?\n```java\npublic void destroy ( ) { m Destroyed = BOOL ; m Handler . remove Callbacks And Messages ( null ) ; if ( m Service != null ) { try { m Service . listen To ( null , m Callback ) ; m Context . unbind Service ( m Connection ) ; } catch ( Remote Exception e ) { } } }\n```", "answer": "the host"}
{"question_id": "a04f694f-a018-44da-99cb-1984e44dae5a", "question": "What has the correct chronology ?\n```java\nprivate void validate Chrono ( Temporal Accessor temporal ) { Objects . require Non Null ( temporal , STRING ) ; Chronology temporal Chrono = temporal . query ( Temporal Queries . chronology ( ) ) ; if ( temporal Chrono != null && chrono . equals ( temporal Chrono ) == BOOL ) { throw new Date Time Exception ( STRING + chrono . get Id ( ) + STRING + temporal Chrono . get Id ( ) ) ; } }\n```", "answer": "the temporal"}
{"question_id": "d6ee2f52-3316-4114-aff4-c79d834d0f22", "question": "What can wrap the supplied cursor with one that will also account for header and footer views ?\n```java\npublic void add Header View ( View v , Object data , boolean is Selectable ) { if ( m Adapter != null ) { throw new Illegal State Exception ( STRING ) ; } Fixed View Info info = new Fixed View Info ( ) ; info . view = v ; info . data = data ; info . is Selectable = is Selectable ; m Header View Infos . add ( info ) ; }\n```", "answer": "listview"}
{"question_id": "cca4c5dc-cc36-4c5e-becf-04033613d6e9", "question": "Can views added using this call take focus if they want ?\n```java\npublic void add Header View ( View v , Object data , boolean is Selectable ) { if ( m Adapter != null ) { throw new Illegal State Exception ( STRING ) ; } Fixed View Info info = new Fixed View Info ( ) ; info . view = v ; info . data = data ; info . is Selectable = is Selectable ; m Header View Infos . add ( info ) ; }\n```", "answer": "No"}
{"question_id": "3076492d-c416-4219-a47b-cd3fd0a316ee", "question": "What fixes the problem of registering a subnode before its father node ?\n```java\nvoid export Children ( Snmp Mib Oid brother ) throws Illegal Access Exception { if ( brother == null ) return ; final long [ ] oid = new long [ NUM ] ; for ( int i = NUM ; i < nb Children ; i ++ ) { final Snmp Mib Node child = children . element At ( i ) ; if ( child == null ) continue ; oid [ NUM ] = var List [ i ] ; brother . register Node ( oid , NUM , child ) ; } }\n```", "answer": "a patch"}
{"question_id": "89c7a393-bedc-4de0-807d-f53d844eaaf6", "question": "What can a closed stream not perform ?\n```java\npublic void close ( ) throws java . io . IO Exception { flush ( ) ; }\n```", "answer": "output operations"}
{"question_id": "d3d0a663-6fef-48a8-bd81-0ab061491fa2", "question": "What did the close method of outputstream do ?\n```java\npublic void close ( ) throws java . io . IO Exception { flush ( ) ; }\n```", "answer": "nothing"}
{"question_id": "a30e1170-0212-45cc-bb05-51240998dd5f", "question": "Can a closed stream perform output operations ?\n```java\npublic void close ( ) throws java . io . IO Exception { flush ( ) ; }\n```", "answer": "No"}
{"question_id": "499a7dcd-740e-4833-ad0a-b7f735efbdd2", "question": "What does not consume the excluded character ?\n```java\nprivate String next To Internal ( String excluded ) { int start = pos ; for ( ; pos < in . length ( ) ; pos ++ ) { char c = in . char At ( pos ) ; if ( c == STRING || c == STRING || excluded . index Of ( c ) != - NUM ) { return in . substring ( start , pos ) ; } } return in . substring ( start ) ; }\n```", "answer": "this"}
{"question_id": "6dd7a73d-ccdf-4ce9-b1b3-9c95995fe973", "question": "Does this consume the excluded character ?\n```java\nprivate String next To Internal ( String excluded ) { int start = pos ; for ( ; pos < in . length ( ) ; pos ++ ) { char c = in . char At ( pos ) ; if ( c == STRING || c == STRING || excluded . index Of ( c ) != - NUM ) { return in . substring ( start , pos ) ; } } return in . substring ( start ) ; }\n```", "answer": "No"}
{"question_id": "13f4ae15-7ece-4a4e-8542-089f4f436255", "question": "What does the code add to the collection of crossings ?\n```java\nprotected void add Crossing ( Boundary Crossing bc ) { crossings . add ( bc ) ; }\n```", "answer": "a boundarycrossing"}
{"question_id": "aeff058f-e326-486a-8894-9450d1014e2c", "question": "How does the code find the web - inf ?\n```java\nprivate void locate Uri Root ( File f ) { String t Uri Base = uri Base ; if ( t Uri Base == null ) { t Uri Base = STRING ; } try { if ( f . exists ( ) ) { f = new File ( f . get Canonical Path ( ) ) ; while ( f != null ) { File g = new File ( f , STRING ) ; if ( g . exists ( ) && g . is Directory ( ) ) { uri Root = f . get Canonical Path ( ) ; uri Base = t Uri Base ; if ( log . is Loggable ( Level . INFO ) ) { log . info ( Localizer . get Message ( STRING , uri Root ) ) ; } break ; } if ( f . exists ( ) && f . is Directory ( ) ) { t Uri Base = STRING + f . get Name ( ) + STRING + t Uri Base ; } String f Parent = f . get Parent ( ) ; if ( f Parent == null ) { break ; } else { f = new File ( f Parent ) ; } } if ( uri Root != null ) { File froot = new File ( uri Root ) ; uri Root = froot . get Canonical Path ( ) ; } } } catch ( IO Exception ioe ) { } }\n```", "answer": "dir"}
{"question_id": "80ac0c58-1cef-421d-8631-42372a2f8679", "question": "What should we require maybe ?\n```java\nprivate void locate Uri Root ( File f ) { String t Uri Base = uri Base ; if ( t Uri Base == null ) { t Uri Base = STRING ; } try { if ( f . exists ( ) ) { f = new File ( f . get Canonical Path ( ) ) ; while ( f != null ) { File g = new File ( f , STRING ) ; if ( g . exists ( ) && g . is Directory ( ) ) { uri Root = f . get Canonical Path ( ) ; uri Base = t Uri Base ; if ( log . is Loggable ( Level . INFO ) ) { log . info ( Localizer . get Message ( STRING , uri Root ) ) ; } break ; } if ( f . exists ( ) && f . is Directory ( ) ) { t Uri Base = STRING + f . get Name ( ) + STRING + t Uri Base ; } String f Parent = f . get Parent ( ) ; if ( f Parent == null ) { break ; } else { f = new File ( f Parent ) ; } } if ( uri Root != null ) { File froot = new File ( uri Root ) ; uri Root = froot . get Canonical Path ( ) ; } } } catch ( IO Exception ioe ) { } }\n```", "answer": "the docbase"}
{"question_id": "fd4cc1f9-c400-4864-9a82-8dd0b09c0e13", "question": "What does the code add to the table ?\n```java\nvoid add Index ( Index index ) { indexes . add ( index ) ; }\n```", "answer": "this index"}
{"question_id": "60c0a79f-f8f1-4904-a984-fb379040dd7a", "question": "What does further post - processing of the volume encounter when ?\n```java\nprivate void persist Volume Native ID ( Db Client db Client , URI volume Id , String native ID , Calendar creation Time ) throws IO Exception { Volume volume = db Client . query Object ( Volume . class , volume Id ) ; volume . set Creation Time ( creation Time ) ; volume . set Native Id ( native ID ) ; volume . set Native Guid ( Native GUID Generator . generate Native Guid ( db Client , volume ) ) ; db Client . update Object ( volume ) ; }\n```", "answer": "some error"}
{"question_id": "87b0a040-cafc-4550-92d7-e62df1435b76", "question": "Do we delete it ?\n```java\nprivate void persist Volume Native ID ( Db Client db Client , URI volume Id , String native ID , Calendar creation Time ) throws IO Exception { Volume volume = db Client . query Object ( Volume . class , volume Id ) ; volume . set Creation Time ( creation Time ) ; volume . set Native Id ( native ID ) ; volume . set Native Guid ( Native GUID Generator . generate Native Guid ( db Client , volume ) ) ; db Client . update Object ( volume ) ; }\n```", "answer": "No"}
{"question_id": "30b49fc3-3b42-4f36-9472-b8df18f0dfe0", "question": "When do we persist it so that if when further post - processing of the volume encounters some error , we would be able to have some reference to the volume and we could attempt to delete it ?\n```java\nprivate void persist Volume Native ID ( Db Client db Client , URI volume Id , String native ID , Calendar creation Time ) throws IO Exception { Volume volume = db Client . query Object ( Volume . class , volume Id ) ; volume . set Creation Time ( creation Time ) ; volume . set Native Id ( native ID ) ; volume . set Native Guid ( Native GUID Generator . generate Native Guid ( db Client , volume ) ) ; db Client . update Object ( volume ) ; }\n```", "answer": "immediately"}
{"question_id": "496cb96f-e3d0-45bf-a509-0b92e3c82a59", "question": "What is to determine if the binary data contains a serialised session object ?\n```java\n@ Suppress Warnings ( STRING ) private boolean is Token Valid For Compression ( byte [ ] blob ) { if ( blob == null ) { return BOOL ; } String contents ; try { contents = blob Utils . to UTF 8 ( blob ) ; } catch ( Unsupported Encoding Exception e ) { return BOOL ; } if ( ! contents . starts With ( STRING ) ) { return BOOL ; } if ( ! contents . ends With ( STRING ) ) { return BOOL ; } Set < String > keys = new Hash Set < String > ( ) ; keys . add All ( replacement . key Set ( ) ) ; keys . add All ( replacement . values ( ) ) ; for ( String key : keys ) { if ( contents . contains ( key ) ) { return BOOL ; } } return BOOL ; }\n```", "answer": "the objective"}
{"question_id": "4e3340bd-c006-4c6c-abe9-8903eb235e29", "question": "Where is file loaded when ?\n```java\nprotected void configure By File ( @ Test Data File @ Non Nls @ Not Null String file Path ) { try { final File io File = new File ( get Test Data Path ( ) + file Path ) ; String file Text = File Util Rt . load File ( io File , Charset Toolkit . UTF 8 , BOOL ) ; configure From File Text ( io File . get Name ( ) , file Text ) ; } catch ( IO Exception e ) { throw new Runtime Exception ( e ) ; } }\n```", "answer": "in editor"}
{"question_id": "db856f05-d3c8-4ace-a0c4-26f4111c3fe3", "question": "What does the code add to each closed subpath ?\n```java\npublic List < Integer > replace Close With Line ( ) { List < Integer > modified Subpaths Indices = new Array List < > ( ) ; int i = NUM ; for ( Subpath subpath : subpaths ) { if ( subpath . is Closed ( ) ) { subpath . set Closed ( BOOL ) ; subpath . add Segment ( new Line ( subpath . get Last Point ( ) , subpath . get Start Point ( ) ) ) ; modified Subpaths Indices . add ( i ) ; } ++ i ; } return modified Subpaths Indices ; }\n```", "answer": "additional line"}
{"question_id": "6ffc3aa4-63de-4e5f-911e-46fc2f7ebe61", "question": "Do a character number include in the caption ?\n```java\nprivate void caption Put ( int value , String text ) { caption Map . put ( new Integer ( value ) , text ) ; }\n```", "answer": "No"}
{"question_id": "a399364f-762e-43aa-9d5d-98ea7b9b45ed", "question": "What does the iterator return for use by the application ?\n```java\npublic Id Search Results search Identities ( Id Type type , String pattern , Map av Pairs , boolean recursive , int max Results , int max Time , Set return Attributes , boolean return All Attributes ) throws Id Repo Exception , SSO Exception { Id Search Control crtl = new Id Search Control ( ) ; crtl . set Search Modifiers ( Id Search Op Modifier . OR , av Pairs ) ; crtl . set Recursive ( recursive ) ; crtl . set Max Results ( max Results ) ; crtl . set Time Out ( max Time ) ; crtl . set Return Attributes ( return Attributes ) ; crtl . set All Return Attributes ( return All Attributes ) ; Crest Query crest Query = new Crest Query ( pattern ) ; return search Identities ( type , crest Query , crtl ) ; }\n```", "answer": "amidentity objects"}
{"question_id": "e2c77a03-9833-471a-beab-f4edb343e715", "question": "What defined in plugins ?\n```java\npublic static void register Condition ( String condition Name , Class < ? extends Attribute Filter Condition > condition Class ) { String [ ] new Condition Names = new String [ CONDITION NAMES . length + NUM ] ; System . arraycopy ( CONDITION NAMES , NUM , new Condition Names , NUM , CONDITION NAMES . length ) ; new Condition Names [ new Condition Names . length - NUM ] = condition Name ; CONDITION NAMES = new Condition Names ; Class < ? > [ ] new Condition Classes = new Class [ CONDITION IMPLEMENTATIONS . length + NUM ] ; System . arraycopy ( CONDITION IMPLEMENTATIONS , NUM , new Condition Classes , NUM , CONDITION IMPLEMENTATIONS . length ) ; new Condition Classes [ new Condition Classes . length - NUM ] = condition Class ; CONDITION IMPLEMENTATIONS = new Condition Classes ; }\n```", "answer": "filter conditions"}
{"question_id": "c4dd601f-5ce0-4df0-8b2d-546b3eaf2b4c", "question": "For what purpose do they present to the user ?\n```java\nprivate void add System Imes ( Set < String > exclude Packages ) { final Context context = get Activity ( ) ; if ( context == null ) return ; Input Method Manager imm = ( Input Method Manager ) context . get System Service ( Context . INPUT METHOD SERVICE ) ; List < Input Method Info > imis = imm . get Input Method List ( ) ; for ( Input Method Info imi : imis ) { try { if ( imi . is Default ( context ) && is System Package ( imi . get Package Name ( ) ) ) { exclude Packages . add ( imi . get Package Name ( ) ) ; } } catch ( Resources . Not Found Exception rnfe ) { } } }\n```", "answer": "for toggling"}
{"question_id": "72f8fae0-1ed8-4ee3-b6a2-392604d7bb7b", "question": "What installed pre ?\n```java\nprivate void add System Imes ( Set < String > exclude Packages ) { final Context context = get Activity ( ) ; if ( context == null ) return ; Input Method Manager imm = ( Input Method Manager ) context . get System Service ( Context . INPUT METHOD SERVICE ) ; List < Input Method Info > imis = imm . get Input Method List ( ) ; for ( Input Method Info imi : imis ) { try { if ( imi . is Default ( context ) && is System Package ( imi . get Package Name ( ) ) ) { exclude Packages . add ( imi . get Package Name ( ) ) ; } } catch ( Resources . Not Found Exception rnfe ) { } } }\n```", "answer": "input methods"}
{"question_id": "1bba9b05-171e-44a6-944a-617bc02f3935", "question": "What does this return for the caller to extract the output variables ?\n```java\nprivate Execution Context execute Using Simplified Compilation Chain ( String dml Script File Path , boolean is File , Map < String , String > arg Vals , boolean parse Py DML , String [ ] inputs , String [ ] outputs , Local Variable Map input Symbol Table , String config File Path ) throws IO Exception , DML Exception { DML Config config = ( config File Path == null ) ? new DML Config ( ) : new DML Config ( config File Path ) ; for ( Entry < String , String > param : additional Configs . entry Set ( ) ) { config . set Text Value ( param . get Key ( ) , param . get Value ( ) ) ; } Configuration Manager . set Global Config ( config ) ; Compiler Config cconf = new Compiler Config ( ) ; cconf . set ( Config Type . IGNORE UNSPECIFIED ARGS , BOOL ) ; cconf . set ( Config Type . REJECT READ WRITE UNKNOWNS , BOOL ) ; cconf . set ( Config Type . ALLOW CSE PERSISTENT READS , BOOL ) ; Configuration Manager . set Global Config ( cconf ) ; String dml Script Str = DML Script . read DML Script ( is File ? STRING : STRING , dml Script File Path ) ; if ( monitor Utils != null ) { monitor Utils . set DML String ( dml Script Str ) ; } rtprog = null ; A Parser Wrapper parser = A Parser Wrapper . create Parser ( parse Py DML ) ; DML Program prog ; if ( is File ) { prog = parser . parse ( dml Script File Path , null , arg Vals ) ; } else { prog = parser . parse ( null , dml Script Str , arg Vals ) ; } DML Translator dmlt = new DML Translator ( prog ) ; dmlt . live Variable Analysis ( prog ) ; dmlt . validate Parse Tree ( prog ) ; dmlt . construct Hops ( prog ) ; dmlt . rewrite Hops DAG ( prog ) ; Explain . explain ( prog ) ; if ( input Symbol Table != null ) { Rewrite Remove Persistent Read Write rewrite = new Rewrite Remove Persistent Read Write ( inputs , outputs , input Symbol Table ) ; Program Rewriter rewriter 2 = new Program Rewriter ( rewrite ) ; rewriter 2 . rewrite Program Hop DA Gs ( prog ) ; } dmlt . construct Lops ( prog ) ; rtprog = prog . get Runtime Program ( config ) ; if ( Optimizer Utils . is Opt Level ( Optimization Level . O4 GLOBAL TIME MEMORY ) ) { rtprog = Global Optimizer Wrapper . optimize Program ( prog , rtprog ) ; } Explain Counts counts = Explain . count Distributed Operations ( rtprog ) ; Statistics . reset No Of Compiled Jobs ( counts . num Jobs ) ; DML Script . init Hadoop Execution ( config ) ; JMLC Utils . cleanup Runtime Program ( rtprog , outputs ) ; Execution Context ec = Execution Context Factory . create Context ( rtprog ) ; if ( input Symbol Table != null ) { ec . set Variables ( input Symbol Table ) ; } rtprog . execute ( ec ) ; if ( monitor Utils != null ) monitor Utils . set Explain Output ( Explain . explain ( rtprog ) ) ; return ec ; }\n```", "answer": "the executioncontext"}
{"question_id": "b6e30320-c2c1-4b51-b2e0-c77566bc2ed0", "question": "What does the code add to the colour map ?\n```java\nprivate void extend Colour Map ( int highest ) { for ( int i = m color List . size ( ) ; i < highest ; i ++ ) { Color pc = m Default Colors [ i % NUM ] ; int ija = i / NUM ; ija *= NUM ; for ( int j = NUM ; j < ija ; j ++ ) { pc = pc . brighter ( ) ; } m color List . add ( pc ) ; } }\n```", "answer": "more colours"}
{"question_id": "d74146d1-150f-4835-9db4-92c19cc3389f", "question": "What can be applied on the result got ?\n```java\nprotected void process Result ( final Operation operation , final Object result , final Command command Obj ) throws Base Collection Exception { Processor processor = null ; processor = operation . get Processor ( ) ; if ( null != processor ) { List < Object > args List = new Array List < Object > ( ) ; args List . add ( Util . normalized Read Args ( key Map , command Obj . retreive Arguments ( ) ) ) ; args List . add ( command Obj . get Command Index ( ) ) ; processor . set Prerequisite Objects ( args List ) ; processor . process Result ( operation , result , key Map ) ; } else { LOGGER . debug ( STRING ) ; } }\n```", "answer": "multiple processors"}
{"question_id": "f14037e1-e391-4766-a771-6ea40c78dee2", "question": "What can be applied on the processed result ?\n```java\nprotected void process Result ( final Operation operation , final Object result , final Command command Obj ) throws Base Collection Exception { Processor processor = null ; processor = operation . get Processor ( ) ; if ( null != processor ) { List < Object > args List = new Array List < Object > ( ) ; args List . add ( Util . normalized Read Args ( key Map , command Obj . retreive Arguments ( ) ) ) ; args List . add ( command Obj . get Command Index ( ) ) ; processor . set Prerequisite Objects ( args List ) ; processor . process Result ( operation , result , key Map ) ; } else { LOGGER . debug ( STRING ) ; } }\n```", "answer": "multiple decorators"}
{"question_id": "61469a8d-b524-4e41-b9af-50ac6a423508", "question": "What apply different types of decorators above the processed result ?\n```java\nprotected void process Result ( final Operation operation , final Object result , final Command command Obj ) throws Base Collection Exception { Processor processor = null ; processor = operation . get Processor ( ) ; if ( null != processor ) { List < Object > args List = new Array List < Object > ( ) ; args List . add ( Util . normalized Read Args ( key Map , command Obj . retreive Arguments ( ) ) ) ; args List . add ( command Obj . get Command Index ( ) ) ; processor . set Prerequisite Objects ( args List ) ; processor . process Result ( operation , result , key Map ) ; } else { LOGGER . debug ( STRING ) ; } }\n```", "answer": "directormetrics"}
{"question_id": "8c44bb44-3f51-4c5c-a680-b9da9223dda0", "question": "In which direction is it called to add certain system threads to the system thread group ?\n```java\nvoid add ( Thread t ) { synchronized ( this ) { if ( destroyed ) { throw new Illegal Thread State Exception ( ) ; } if ( threads == null ) { threads = new Thread [ NUM ] ; } else if ( nthreads == threads . length ) { threads = Arrays . copy Of ( threads , nthreads * NUM ) ; } threads [ nthreads ] = t ; nthreads ++ ; n Unstarted Threads -- ; } }\n```", "answer": "from vm"}
{"question_id": "67117e6c-1920-4293-915f-cf64890acacc", "question": "What does the code execute on each item in a collection ?\n```java\npublic static void apply ( Collection coll , Function func ) { for ( Iterator i = coll . iterator ( ) ; i . has Next ( ) ; ) { func . execute ( i . next ( ) ) ; } }\n```", "answer": "a function"}
{"question_id": "914c95d5-3e06-4d20-a859-f32195303c3f", "question": "Does the code accumulate the result ?\n```java\npublic static void apply ( Collection coll , Function func ) { for ( Iterator i = coll . iterator ( ) ; i . has Next ( ) ; ) { func . execute ( i . next ( ) ) ; } }\n```", "answer": "No"}
{"question_id": "7dc6b371-9d2c-465a-a8eb-a698521a070a", "question": "What does the code not accumulate ?\n```java\npublic static void apply ( Collection coll , Function func ) { for ( Iterator i = coll . iterator ( ) ; i . has Next ( ) ; ) { func . execute ( i . next ( ) ) ; } }\n```", "answer": "the result"}
{"question_id": "de4f5546-3cbd-4707-899c-374fb57bd855", "question": "What does the code end ?\n```java\npublic void end ( ) { while ( ! subreports . is Empty ( ) ) { String subreport = subreports . pop ( ) ; add Log Entry ( new Subreport End Entry ( subreport ) ) ; } this . end Date = new Date ( ) ; }\n```", "answer": "all subreports"}
{"question_id": "4812c863-b000-4d0c-bb99-4e5bd1b91f2c", "question": "What does this add ?\n```java\npublic void update Timers And Events ( Process Definition Entity process Definition , Process Definition Entity previous Process Definition , Parsed Deployment parsed Deployment ) { Process process = parsed Deployment . get Process Model For Process Definition ( process Definition ) ; Bpmn Model bpmn Model = parsed Deployment . get Bpmn Model For Process Definition ( process Definition ) ; event Subscription Manager . remove Obsolete Message Event Subscriptions ( previous Process Definition ) ; event Subscription Manager . add Message Event Subscriptions ( process Definition , process , bpmn Model ) ; event Subscription Manager . remove Obsolete Signal Event Sub Scription ( previous Process Definition ) ; event Subscription Manager . add Signal Event Subscriptions ( Context . get Command Context ( ) , process Definition , process , bpmn Model ) ; timer Manager . remove Obsolete Timers ( process Definition ) ; timer Manager . schedule Timers ( process Definition , process ) ; }\n```", "answer": "new ones"}
{"question_id": "36675601-bf6e-41ed-8caf-c51e77167c2b", "question": "What did the code push onto the stack ?\n```java\npublic void push ( Awtree Node p element ) { if ( p element == null ) return ; node list . add ( p element ) ; }\n```", "answer": "p_element"}
{"question_id": "1ff208b8-9c34-458d-9832-fb4cda9a05b4", "question": "What does not have valid boundaries ?\n```java\npublic Tile Directory ( ) { tilename = STRING ; this . tile ID = - NUM ; westlon = eastlon = northlat = southlat = Float . Na N ; }\n```", "answer": "this object"}
{"question_id": "8e3f4733-cb60-4251-9913-0179a5ee82c4", "question": "Does this object have valid boundaries ?\n```java\npublic Tile Directory ( ) { tilename = STRING ; this . tile ID = - NUM ; westlon = eastlon = northlat = southlat = Float . Na N ; }\n```", "answer": "No"}
{"question_id": "aa69f39d-fdb9-4fb2-ba20-10dd652e6fd4", "question": "What does this object not have ?\n```java\npublic Tile Directory ( ) { tilename = STRING ; this . tile ID = - NUM ; westlon = eastlon = northlat = southlat = Float . Na N ; }\n```", "answer": "valid boundaries"}
{"question_id": "c480a030-6e27-42e3-a634-8f9ca00ab69b", "question": "Does it resolve it ?\n```java\npublic void resolve Urls ( ) { try { pool = Executors . new Fixed Thread Pool ( num Threads ) ; Buffered Reader buff Read = new Buffered Reader ( new File Reader ( new File ( urls File ) ) ) ; String url Str = null ; while ( ( url Str = buff Read . read Line ( ) ) != null ) { LOG . info ( STRING + url Str ) ; pool . execute ( new Resolver Thread ( url Str ) ) ; } buff Read . close ( ) ; pool . await Termination ( NUM , Time Unit . SECONDS ) ; } catch ( Exception e ) { pool . shutdown Now ( ) ; LOG . info ( String Utils . stringify Exception ( e ) ) ; } pool . shutdown ( ) ; LOG . info ( STRING + num Total . get ( ) + STRING + num Resolved . get ( ) + STRING + num Errored . get ( ) + STRING + total Time . get ( ) / num Total . get ( ) ) ; }\n```", "answer": "No"}
{"question_id": "181114e8-f222-47a8-a00a-51a1ac93135e", "question": "How are irregular ( non - boundary ) bcis encoded immediately after the boundary numbers ?\n```java\npublic int encode BCI ( int bci ) { if ( bci <= NUM || bci > get Length ( ) ) return bci ; Object map 0 = get Insn Map ( ) ; int i , len ; if ( shrink Maps && map 0 instanceof byte [ ] ) { byte [ ] map = ( byte [ ] ) map 0 ; len = map . length ; i = Arrays . binary Search ( map , ( byte ) ( bci + Byte . MIN VALUE ) ) ; } else if ( shrink Maps && map 0 instanceof short [ ] ) { short [ ] map = ( short [ ] ) map 0 ; len = map . length ; i = Arrays . binary Search ( map , ( short ) ( bci + Short . MIN VALUE ) ) ; } else { int [ ] map = ( int [ ] ) map 0 ; len = map . length ; i = Arrays . binary Search ( map , bci ) ; } assert ( i != - NUM ) ; assert ( i != NUM ) ; assert ( i != len ) ; assert ( i != - len - NUM ) ; return ( i >= NUM ) ? i : len + bci - ( - i - NUM ) ; }\n```", "answer": "compactly"}
{"question_id": "2d1c62d4-9d1b-42cf-b016-31ef337f4db6", "question": "What will stop at the first match ?\n```java\npublic static String Buffer read Content ( File file , Map < String [ ] , String > replace Map ) throws IO Exception { String Buffer content = new String Buffer ( ) ; Buffered Reader reader = new Buffered Reader ( new Input Stream Reader ( new File Input Stream ( file ) , ENCODING UTF 8 ) ) ; String line = null ; String current End String = null ; try { while ( ( line = reader . read Line ( ) ) != null ) { if ( current End String != null ) { if ( line . contains ( current End String ) ) { current End String = null ; } continue ; } if ( replace Map != null ) { for ( Entry < String [ ] , String > entry : replace Map . entry Set ( ) ) { if ( line . contains ( entry . get Key ( ) [ NUM ] ) ) { current End String = ( entry . get Key ( ) [ NUM ] != null && ! line . contains ( entry . get Key ( ) [ NUM ] ) ) ? entry . get Key ( ) [ NUM ] : null ; line = entry . get Value ( ) ; break ; } } } content . append ( line + LINE BREAK ) ; } } finally { try { reader . close ( ) ; } catch ( Exception ex ) { } } return content ; }\n```", "answer": "the reading"}
{"question_id": "72711bdd-dd09-459a-b9b4-da70dcec71b9", "question": "What can you use to implement a simple request / reply mechanism ?\n```java\npublic synchronized Temporary Queue create Temporary Queue ( ) throws JMS Exception { ensure Open ( ) ; if ( logger . is Loggable ( Level . FINE ) ) { logger . log ( Level . FINE , STRING ) ; } return new GS Temporary Queue Impl ( m session ID + STRING + get Random Int ( ) , m session ID ) ; }\n```", "answer": "temporary destinations"}
{"question_id": "10006502-9f44-426b-9953-d5c1c48653d8", "question": "How does the code update the solr document for the given table entity ?\n```java\npublic Future < Void > update Table Entity Async ( Table Entity table Entity , boolean commit ) { update Table Entity ( table Entity , commit ) ; return new Async Result < Void > ( null ) ; }\n```", "answer": "asynchronly"}
{"question_id": "a69dbcfb-31b4-4c47-a207-5f62f3c6c4e9", "question": "Does the pushback buffer contain any available bytes ?\n```java\n@ Override public int read ( ) throws IO Exception { if ( buf == null ) { throw new IO Exception ( ) ; } if ( pos < buf . length ) { return ( buf [ pos ++ ] & NUM ) ; } return in . read ( ) ; }\n```", "answer": "No"}
{"question_id": "b222038a-1e9b-488a-abe0-db21f32807d9", "question": "What keeps within the allowed range and the image on screen ?\n```java\nprivate void fit To Bounds ( boolean center , Scale And Translate scale And Translate ) { if ( pan Limit == PAN LIMIT OUTSIDE && is Image Ready ( ) ) { center = BOOL ; } Point F v Translate = scale And Translate . translate ; float scale = limited Scale ( scale And Translate . scale ) ; float scale Width = scale * s Width ( ) ; float scale Height = scale * s Height ( ) ; if ( pan Limit == PAN LIMIT CENTER && is Image Ready ( ) ) { v Translate . x = Math . max ( v Translate . x , get Width ( ) / NUM - scale Width ) ; v Translate . y = Math . max ( v Translate . y , get Height ( ) / NUM - scale Height ) ; } else if ( center ) { v Translate . x = Math . max ( v Translate . x , get Width ( ) - scale Width ) ; v Translate . y = Math . max ( v Translate . y , get Height ( ) - scale Height ) ; } else { v Translate . x = Math . max ( v Translate . x , - scale Width ) ; v Translate . y = Math . max ( v Translate . y , - scale Height ) ; } float max Tx ; float max Ty ; if ( pan Limit == PAN LIMIT CENTER && is Image Ready ( ) ) { max Tx = Math . max ( NUM , get Width ( ) / NUM ) ; max Ty = Math . max ( NUM , get Height ( ) / NUM ) ; } else if ( center ) { max Tx = Math . max ( NUM , ( get Width ( ) - scale Width ) / NUM ) ; max Ty = Math . max ( NUM , ( get Height ( ) - scale Height ) / NUM ) ; } else { max Tx = Math . max ( NUM , get Width ( ) ) ; max Ty = Math . max ( NUM , get Height ( ) ) ; } v Translate . x = Math . min ( v Translate . x , max Tx ) ; v Translate . y = Math . min ( v Translate . y , max Ty ) ; scale And Translate . scale = scale ; }\n```", "answer": "scale"}
{"question_id": "2f791248-3b95-4d20-b245-f6aa4905a653", "question": "What defined in the application dictionary ?\n```java\npublic String sql AD get Sequences ( String vendor Name , String catalog Name , String schema Name ) { String table Name = STRING ; Array List < String > column Names = new Array List < String > ( ) ; column Names . add ( STRING ) ; column Names . add ( STRING ) ; column Names . add ( STRING ) ; Array List < String > alias Names = new Array List < String > ( ) ; alias Names . add ( STRING ) ; alias Names . add ( STRING ) ; alias Names . add ( STRING ) ; Array List < String > conditions = new Array List < String > ( ) ; conditions . add ( STRING ) ; Array List < String > sort Columns = new Array List < String > ( ) ; sort Columns . add ( STRING ) ; return sql select ( vendor Name , catalog Name , schema Name , table Name , null , column Names , alias Names , conditions , sort Columns , BOOL ) ; }\n```", "answer": "sequence counters"}