returns true if { @ code a } and { @ code b } are equal

public static boolean equals ( type a , type b ) { if ( a = = b ) { / / also handles ( a = = null & & b = = null ) return true ; } else if ( a instanceof class ) { / / class already specifies equals ( ) return a equals ( b ) ; } else if ( a instanceof parameterized type ) { if ( ! ( b instanceof parameterized type ) ) { return false ; } / / todo : save a clone ( ) call parameterized type pa = ( parameterized type ) a ; parameterized type pb = ( parameterized type ) b ; return objects equals ( pa get owner type ( ) , pb get owner type ( ) ) & & pa get raw type ( ) equals ( pb get raw type ( ) ) & & arrays equals ( pa get actual type arguments ( ) , pb get actual type arguments ( ) ) ; } else if ( a instanceof generic array type ) { if ( ! ( b instanceof generic array type ) ) { return false ; } generic array type ga = ( generic array type ) a ; generic array type gb = ( generic array type ) b ; return equals ( ga get generic component type ( ) , gb get generic component type ( ) ) ; } else if ( a instanceof wildcard type ) { if ( ! ( b instanceof wildcard type ) ) { return false ; } wildcard type wa = ( wildcard type ) a ; wildcard type wb = ( wildcard type ) b ; return arrays equals ( wa get upper bounds ( ) , wb get upper bounds ( ) ) & & arrays equals ( wa get lower bounds ( ) , wb get lower bounds ( ) ) ; } else if ( a instanceof type variable ) { if ( ! ( b instanceof type variable ) ) { return false ; } type variable < ? > va = ( type variable ) a ; type variable < ? > vb = ( type variable ) b ; return va get generic declaration ( ) = = vb get generic declaration ( ) & & va get name ( ) equals ( vb get name ( ) ) ; } else { / / this isn ' t a type we support could be a generic array type , wildcard type , etc return false ; } }


public list < timeline event > get events ( ) { return events ; }


static notification sender no op ( ) { return ( principal , message data ) - > true ; }


deserializes processes the section contributions component

protected void process section contributions ( pdb byte reader reader , task monitor monitor , boolean skip ) throws pdb exception , cancelled exception { if ( length section contribution substream = = 0 ) { return ; } if ( skip ) { reader skip ( length section contribution substream ) ; return ; } pdb byte reader substream reader = reader get sub pdb byte reader ( length section contribution substream ) ; / / system out println ( substream reader dump ( 0x 2 0 0 ) ) ; long version = substream reader parse unsigned int val ( ) ; if ( version = = scv1400 ) { / / long version 2 = substream reader parse unsigned int val ( ) ; while ( substream reader has more ( ) ) { monitor check canceled ( ) ; abstract section contribution section contribution = new section contribution 1 4 0 0 ( ) ; section contribution deserialize ( substream reader ) ; section contribution list add ( section contribution ) ; } } else if ( version = = scv600 ) { / / long version 2 = substream reader parse unsigned int val ( ) ; while ( substream reader has more ( ) ) { monitor check canceled ( ) ; abstract section contribution section contribution = new section contribution 6 0 0 ( ) ; section contribution deserialize ( substream reader ) ; section contribution list add ( section contribution ) ; } } / / todo : don ' t know when section contribution 2 0 0 is the type to use don ' t know if / / this part could be the default of process section contribs within / / debug info and if the above part ( test for svc600 and svc1400 would / / be the override method for database information new else { while ( substream reader has more ( ) ) { monitor check canceled ( ) ; abstract section contribution section contribution = new section contribution 4 0 0 ( ) ; section contribution deserialize ( substream reader ) ; section contribution list add ( section contribution ) ; } } }


is called by the { @ link org apache flink streaming api graph stream graph # add operator ( integer , string , stream operator , type information , type information , string ) } method when the { @ link org apache flink streaming api graph stream graph } is generated the method is called with the output { @ link type information } which is also used for the { @ link org apache flink streaming runtime tasks stream task } output serializer

void set output type ( type information < out > out type info , execution config execution config ) ;


returns { @ literal true } if this type of attribute is a code attribute

public boolean is code attribute ( ) { return false ; }


get the record with the minimum key value which is greater than the specified key

public d b record get record after ( long key ) throws i o exception { synchronized ( db ) { if ( root buffer id < 0 ) { return null ; } try { long key record node leaf = node mgr get long key node ( root buffer id ) get leaf node ( key ) ; return leaf get record after ( key , schema ) ; } finally { node mgr release nodes ( ) ; } } }


set the list of container update requests to inform the < code > resource manager < code > about the containers that need to be updated

public abstract void set update requests ( list < update container request > update requests ) ;


assert the evaluation result of two row expressions equivalent no matter they are constants or remaining row expressions

private static void assert row expression evaluation equals ( object left , object right ) { if ( right instanceof row expression ) { assert true ( left instanceof row expression ) ; / / assert equals ( ( ( row expression ) left ) get type ( ) , ( ( row expression ) right ) get type ( ) ) ; if ( left instanceof constant expression ) { if ( is removable cast ( right ) ) { assert row expression evaluation equals ( left , ( ( call expression ) right ) get arguments ( ) get ( 0 ) ) ; return ; } assert true ( right instanceof constant expression ) ; assert row expression evaluation equals ( ( ( constant expression ) left ) get value ( ) , ( ( constant expression ) left ) get value ( ) ) ; } else if ( left instanceof input reference expression | | left instanceof variable reference expression ) { assert equals ( left , right ) ; } else if ( left instanceof call expression ) { assert true ( right instanceof call expression ) ; assert equals ( ( ( call expression ) left ) get function handle ( ) , ( ( call expression ) right ) get function handle ( ) ) ; assert equals ( ( ( call expression ) left ) get arguments ( ) size ( ) , ( ( call expression ) right ) get arguments ( ) size ( ) ) ; for ( int i = 0 ; i < ( ( call expression ) left ) get arguments ( ) size ( ) ; i + + ) { assert row expression evaluation equals ( ( ( call expression ) left ) get arguments ( ) get ( i ) , ( ( call expression ) right ) get arguments ( ) get ( i ) ) ; } } else if ( left instanceof special form expression ) { assert true ( right instanceof special form expression ) ; assert equals ( ( ( special form expression ) left ) get form ( ) , ( ( special form expression ) right ) get form ( ) ) ; assert equals ( ( ( special form expression ) left ) get arguments ( ) size ( ) , ( ( special form expression ) right ) get arguments ( ) size ( ) ) ; for ( int i = 0 ; i < ( ( special form expression ) left ) get arguments ( ) size ( ) ; i + + ) { assert row expression evaluation equals ( ( ( special form expression ) left ) get arguments ( ) get ( i ) , ( ( special form expression ) right ) get arguments ( ) get ( i ) ) ; } } else { assert true ( left instanceof lambda definition expression ) ; assert true ( right instanceof lambda definition expression ) ; assert equals ( ( ( lambda definition expression ) left ) get arguments ( ) , ( ( lambda definition expression ) right ) get arguments ( ) ) ; assert equals ( ( ( lambda definition expression ) left ) get argument types ( ) , ( ( lambda definition expression ) right ) get argument types ( ) ) ; assert row expression evaluation equals ( ( ( lambda definition expression ) left ) get body ( ) , ( ( lambda definition expression ) right ) get body ( ) ) ; } } else { / / we have constants ; directly compare if ( left instanceof block ) { assert true ( right instanceof block ) ; assert equals ( block to slice ( ( block ) left ) , block to slice ( ( block ) right ) ) ; } else { assert equals ( left , right ) ; } } }


set the default ' testonly ' value for this package

private void set default test only ( boolean test only ) { default test only = test only ; }


tests that the { @ link slot report } sent to the rm does not contain out datedstale information as slots are being requested from the tm this is a probabilistic test case and needs to be executed several times to produce a failure without the fix for flink - 12865

public void test slot report does not contain stale information ( ) throws exception { final one shot latch received slot request = new one shot latch ( ) ; final completable future < void > verify slot report future = new completable future < > ( ) ; final one shot latch terminate slot report verification = new one shot latch ( ) ; final testing resource manager gateway testing resource manager gateway = new testing resource manager gateway ( ) ; / / assertions for this test testing resource manager gateway set task executor heartbeat consumer ( ( ignored , heartbeat payload ) - > { try { final array list < slot status > slots = lists new array list ( heartbeat payload get slot report ( ) ) ; assert that ( slots , has size ( 1 ) ) ; final slot status slot status = slots get ( 0 ) ; log info ( " received slot status : { } " , slot status ) ; if ( received slot request is triggered ( ) ) { assert that ( slot status get allocation i d ( ) , is ( not null value ( ) ) ) ; } else { assert that ( slot status get allocation i d ( ) , is ( null value ( ) ) ) ; } } catch ( assertion error e ) { verify slot report future complete exceptionally ( e ) ; } if ( terminate slot report verification is triggered ( ) ) { verify slot report future complete ( null ) ; } } ) ; final completable future < resource i d > task executor registration future = new completable future < > ( ) ; testing resource manager gateway set send slot report function ( ignored - > { task executor registration future complete ( null ) ; return completable future completed future ( acknowledge get ( ) ) ; } ) ; rpc register gateway ( testing resource manager gateway get address ( ) , testing resource manager gateway ) ; resource manager leader retriever notify listener ( testing resource manager gateway get address ( ) , testing resource manager gateway get fencing token ( ) to u u i d ( ) ) ; final task manager services task manager services = new task manager services builder ( ) set task slot table ( new allocate slot notifying task slot table ( received slot request ) ) build ( ) ; final task executor task executor = create task executor ( task manager services ) ; final resource i d task executor resource id = task manager services get unresolved task manager location ( ) get resource i d ( ) ; task executor start ( ) ; final task executor gateway task executor gateway = task executor get self gateway ( task executor gateway class ) ; final scheduled executor service heartbeat executor = java util concurrent executors new single thread scheduled executor ( ) ; try { task executor registration future get ( ) ; final one shot latch schedule first heartbeat = new one shot latch ( ) ; final resource i d resource manager resource id = testing resource manager gateway get own resource id ( ) ; final long heartbeat interval = 5l ; heartbeat executor schedule with fixed delay ( ( ) - > { schedule first heartbeat trigger ( ) ; task executor gateway heartbeat from resource manager ( resource manager resource id ) ; } , 0l , heartbeat interval , time unit milliseconds ) ; schedule first heartbeat await ( ) ; slot i d slot id = new slot i d ( task executor resource id , 0 ) ; final completable future < acknowledge > request slot future = task executor gateway request slot ( slot id , job id , new allocation i d ( ) , resource profile zero , " foobar " , testing resource manager gateway get fencing token ( ) , timeout ) ; request slot future get ( ) ; terminate slot report verification trigger ( ) ; verify slot report future get ( ) ; } finally { executor utils graceful shutdown ( timeout to milliseconds ( ) , time unit milliseconds , heartbeat executor ) ; rpc utils terminate rpc endpoint ( task executor , timeout ) ; } }


get unsorted unmodifiable list of all processor context registers ( include base context register and children )

public list < register > get context registers ( ) { return context registers ; }


get maximum retry attempts for the register stream operation

public int get register stream max retries ( ) { return register stream max retries ; }


build name id if there are no explicitly defined name i d formats , include the default format see : http : saml 2int orgprofilecurrent # section 9 2

protected name i d build name id ( final request abstract type authn request , final object assertion , final saml registered service service , final saml registered service service provider metadata facade adaptor , final message context message context ) throws saml exception { val supported name formats = get supported name id formats ( service , adaptor ) ; val required name format = get required name id format if any ( authn request ) ; validate required name id format if any ( authn request , adaptor , supported name formats , required name format ) ; val nameid = determine name id ( authn request , assertion , supported name formats , service , adaptor ) ; return finalize name id ( nameid , authn request , assertion , supported name formats , service , adaptor ) ; }


rejects the update for the given resource type and sends an nack request ( request with last accepted version ) to the management server

protected final void nack response ( resource type type , string nonce , string error detail ) { string version info = get current version ( type ) ; logger log ( xds log level info , " sending nack for { 0 } update , nonce : { 1 } , current version : { 2 } " , type , nonce , version info ) ; collection < string > resources = get subscribed resources ( type ) ; if ( resources = = null ) { resources = collections empty list ( ) ; } ads stream send discovery request ( type , version info , resources , nonce , error detail ) ; }


public void add next value ( object val ) { long new val = long parse long ( val to string ( ) ) ; if ( this max val < new val ) { this max val = new val ; } }


function for mapping from batch return type to response type often these two types are exactly the same so it ' s just a pass - thru

protected abstract func 1 < batch return type , response type > get batch return type to response type mapper ( ) ;


sets the specified boolean at the specified absolute { @ code index } in this buffer this method does not modify { @ code reader index } or { @ code writer index } of this buffer

public abstract byte buf set boolean ( int index , boolean value ) ;


test that our local ip address is not null

public void test local host has an address ( ) throws exception { assert not null ( get local i p addr ( ) ) ; }


get all the key - value pairs with the given key and the time range from all the existing windows this iterator must be closed after use the time range is inclusive and applies to the starting timestamp of the window for example , if we have the following windows : + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + | key | start time | end time | + - - - - - - - + - - - - - - - - - - - - + - - - - - - - - - - + | a | 10 | 20 | + - - - - - - - + - - - - - - - - - - - - + - - - - - - - - - - + | a | 15 | 25 | + - - - - - - - + - - - - - - - - - - - - + - - - - - - - - - - + | a | 20 | 30 | + - - - - - - - + - - - - - - - - - - - - + - - - - - - - - - - + | a | 25 | 35 | + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - and we call { @ code store fetch ( " a " , instant of epoch milli ( 10 ) , instant of epoch milli ( 20 ) ) } then the results will contain the first three windows from the table above , i e , all those where 10 & lt ; = start time & lt ; = 20 for each key , the iterator guarantees ordering of windows , starting from the oldestearliest available window to the newestlatest window

window store iterator < v > fetch ( k key , instant time from , instant time to ) throws illegal argument exception ;


public void test array of number only ( ) { / / todo : test array of number only }


wait till all the recursive task for add replica to volume completed

private void wait for sub task to finish ( queue < recursive action > sub task queue , list < i o exception > exceptions ) throws i o exception { while ( ! sub task queue is empty ( ) ) { recursive action task = sub task queue poll ( ) ; if ( task ! = null ) { task join ( ) ; } } if ( ! exceptions is empty ( ) ) { throw multiple i o exception create i o exception ( exceptions ) ; } }


return the cookie " max - age " attribute in seconds a positive value indicates when the cookie expires relative to the current time a value of 0 means the cookie should expire immediately a negative value means no " max - age " attribute in which case the cookie is removed when the browser is closed

public duration get max age ( ) { return this max age ; }


specifies that records of the same key are joinable if their timestamps are within { @ code time difference ms } , i e , the timestamp of a record from the secondary stream is max { @ code time difference ms } earlier or later than the timestamp of the record from the primary stream

public static join windows of ( final long time difference ms ) throws illegal argument exception { / / this is a static factory method , so we initialize grace and retention to the defaults return new join windows ( time difference ms , time difference ms , - 1l , default retention ms ) ; }


adds { @ code element } to the { @ code immutable list }

public builder < e > add ( e element ) { check not null ( element ) ; get ready to expand to ( size + 1 ) ; contents [ size + + ] = element ; return this ; }


reverse the least significant { @ code n } bytes this interprets the bits as an { @ code n } - byte value and changes the endianness any bits outside of the interpretation are truncated , i e , become unknown

public masked long byte swap ( int n ) { return from mask and value ( token field byte swap ( msk , n ) , token field byte swap ( val , n ) ) ; }


verifies that { @ code invokable } produces a { @ link null pointer exception } or { @ link unsupported operation exception } when the parameter in position { @ code param index } is null if this parameter is marked nullable , this method does nothing

private void test parameter ( object instance , invokable < ? , ? > invokable , int param index , class < ? > tested class ) { if ( is primitive or nullable ( invokable get parameters ( ) get ( param index ) ) ) { return ; / / there ' s nothing to test } object [ ] params = build param list ( invokable , param index ) ; try { @ suppress warnings ( " unchecked " ) / / we ' ll get a runtime exception if the type is wrong invokable < object , ? > unsafe = ( invokable < object , ? > ) invokable ; unsafe invoke ( instance , params ) ; assert fail ( " no exception thrown for parameter at index " + param index + " from " + invokable + arrays to string ( params ) + " for " + tested class ) ; } catch ( invocation target exception e ) { throwable cause = e get cause ( ) ; if ( policy is expected type ( cause ) ) { return ; } assertion failed error error = new assertion failed error ( string format ( " wrong exception thrown from % s when passing null to % s parameter at index % s % n " + " full parameters : % s % n " + " actual exception message : % s " , invokable , invokable get parameters ( ) get ( param index ) get type ( ) , param index , arrays to string ( params ) , cause ) ) ; error init cause ( cause ) ; throw error ; } catch ( illegal access exception e ) { throw new runtime exception ( e ) ; } }


public void set config ( element conf ) { / / get the flag from the config ( defaults to true if not set ) create queue = get create flag ( conf ) ; / / no config can be set when no policy is defined and we use defaults if ( conf ! = null ) { default queue name = conf get attribute ( " queue " ) ; / / a queue read from the config could be illegal check it : fall back to / / the config default if it is the case / / however we cannot clean the name as a nested name is allowed if ( ! is valid queue name ( default queue name ) ) { log error ( " default rule configured with an illegal queue name : ' { } ' " , default queue name ) ; default queue name = null ; } } / / the queue name does not have to be set and we really use " default " if ( default queue name = = null | | default queue name is empty ( ) ) { default queue name = assure root ( yarn configuration default queue name ) ; } else { default queue name = assure root ( default queue name ) ; } log debug ( " default rule instantiated with queue name : { } , " + " and create flag : { } " , default queue name , create queue ) ; }


get a crumb from multipart form data and validate it against other data in the current request the salt and request parameter that is used is defined by the current configuration

public boolean validate crumb ( servlet request request , multipart form data parser parser ) { crumb issuer descriptor < crumb issuer > desc = get descriptor ( ) ; string crumb field = desc get crumb request field ( ) ; string crumb salt = desc get crumb salt ( ) ; return validate crumb ( request , crumb salt , parser get ( crumb field ) ) ; }


convert the given object to string with each line indented by 4 spaces ( except the first line )

private string to indented string ( object o ) { if ( o = = null ) { return " null " ; } return o to string ( ) replace ( " \ n " , " \ n " ) ; }


set the fetch position to the committed position ( if there is one ) or reset it using the offset reset policy the user has configured

private boolean update fetch positions ( final timer timer ) { / / if any partitions have been truncated due to a leader change , we need to validate the offsets fetcher validate offsets if needed ( ) ; cached subscription hash all fetch positions = subscriptions has all fetch positions ( ) ; if ( cached subscription hash all fetch positions ) return true ; / / if there are any partitions which do not have a valid position and are not / / awaiting reset , then we need to fetch committed offsets we will only do a / / coordinator lookup if there are partitions which have missing positions , so / / a consumer with manually assigned partitions can avoid a coordinator dependence / / by always ensuring that assigned partitions have an initial position if ( coordinator ! = null & & ! coordinator refresh committed offsets if needed ( timer ) ) return false ; / / if there are partitions still needing a position and a reset policy is defined , / / request reset using the default policy if no reset strategy is defined and there / / are partitions with a missing position , then we will raise an exception subscriptions reset initializing positions ( ) ; / / finally send an asynchronous request to lookup and update the positions of any / / partitions which are awaiting reset fetcher reset offsets if needed ( ) ; return true ; }


public rpc context set remote address ( inet socket address address ) { this remote address = address ; return this ; }


returns specified application cache directory cache directory will be created on sd card by defined path if card is mounted and app has appropriate permission else - android defines cache directory on device ' s file system

public static file get own cache directory ( context context , string cache dir , boolean prefer external ) { file app cache dir = null ; if ( prefer external & & media mounted equals ( environment get external storage state ( ) ) & & has external storage permission ( context ) ) { app cache dir = new file ( environment get external storage directory ( ) , cache dir ) ; } if ( app cache dir = = null | | ( ! app cache dir exists ( ) & & ! app cache dir mkdirs ( ) ) ) { app cache dir = context get cache dir ( ) ; } return app cache dir ; }


creates a random string whose length is the number of characters specified characters will be chosen from the set of alpha - numeric characters as indicated by the arguments

public static string random ( final int count , final boolean letters , final boolean numbers ) { return random ( count , 0 , 0 , letters , numbers ) ; }


returns the computed value or throws a { @ link query exception } on failure or a { @ link interrupted exception } on interruption

t call ( ) throws query exception , interrupted exception ;


same as { @ link application # on trim memory ( int level ) }


returns the { @ link smtp command } for the given command name

public static smtp command value of ( char sequence command name ) { object util check not null ( command name , " command name " ) ; smtp command command = commands get ( command name to string ( ) ) ; return command ! = null ? command : new smtp command ( ascii string of ( command name ) ) ; }


public void array of string test ( ) { / / todo : test array of string }


sets the current generation stamp for legacy blocks

public void set legacy generation stamp ( long stamp ) { legacy generation stamp set current value ( stamp ) ; }


waits for any action to complete , or the timeout to elapse the thread must wait at least for the specified timeout , unless some action completes in the meantime it ' s not allowed to return 0 too early note that it ' s acceptable to return ( any value ) later than specified by the timeout

int wait for next completion ( int timeout seconds ) throws interrupted exception ;


gets a registered { @ link catalog } by name

optional < catalog > get catalog ( string catalog name ) ;


one request followed by one response the server returns the client payload as - is

public com google common util concurrent listenable future < io grpc benchmarks proto messages simple response > unary call ( io grpc benchmarks proto messages simple request request ) { return io grpc stub client calls future unary call ( get channel ( ) new call ( get unary call method ( ) , get call options ( ) ) , request ) ; }


public void map string test ( ) { / / todo : test map string }


subscribe to the given list of topics to get dynamically assigned partitions < b > topic subscriptions are not incremental this list will replace the current assignment ( if there is one ) < b > note that it is not possible to combine topic subscription with group management with manual partition assignment through { @ link # assign ( collection ) } if the given list of topics is empty , it is treated the same as { @ link # unsubscribe ( ) } as part of group management , the consumer will keep track of the list of consumers that belong to a particular group and will trigger a rebalance operation if any one of the following events are triggered : number of partitions change for any of the subscribed topics a subscribed topic is created or deleted an existing member of the consumer group is shutdown or fails a new member is added to the consumer group when any of these events are triggered , the provided listener will be invoked first to indicate that the consumer ' s assignment has been revoked , and then again when the new assignment has been received note that rebalances will only occur during an active call to { @ link # poll ( duration ) } , so callbacks will also only be invoked during that time the provided listener will immediately override any listener set in a previous call to subscribe it is guaranteed , however , that the partitions revokedassigned through this interface are from topics subscribed in this call see { @ link consumer rebalance listener } for more details

public void subscribe ( collection < string > topics , consumer rebalance listener listener ) { acquire and ensure open ( ) ; try { maybe throw invalid group id exception ( ) ; if ( topics = = null ) throw new illegal argument exception ( " topic collection to subscribe to cannot be null " ) ; if ( topics is empty ( ) ) { / / treat subscribing to empty topic list as the same as unsubscribing this unsubscribe ( ) ; } else { for ( string topic : topics ) { if ( topic = = null | | topic trim ( ) is empty ( ) ) throw new illegal argument exception ( " topic collection to subscribe to cannot contain null or empty topic " ) ; } throw if no assignors configured ( ) ; fetcher clear buffered data for unassigned topics ( topics ) ; log info ( " subscribed to topic ( s ) : { } " , utils join ( topics , " , " ) ) ; if ( this subscriptions subscribe ( new hash set < > ( topics ) , listener ) ) metadata request update for new topics ( ) ; } } finally { release ( ) ; } }


public static sys info new instance ( ) { if ( shell linux ) { return new sys info linux ( ) ; } if ( shell windows ) { return new sys info windows ( ) ; } throw new unsupported operation exception ( " could not determine os " ) ; }


a sensible default implementation of { @ link # sub set ( object , object ) } in terms of { @ link # head set ( object ) } and { @ link # tail set ( object ) } in some situations , you may wish to override { @ link # sub set ( object , object ) } to forward to this implementation

protected sorted set < e > standard sub set ( e from element , e to element ) { return tail set ( from element ) head set ( to element ) ; }


initialize custom signers and register them with the aws sdk

public void init custom signers ( ) { string [ ] custom signers = owner conf get trimmed strings ( custom signers ) ; if ( custom signers = = null | | custom signers length = = 0 ) { / / no custom signers specified , nothing to do log debug ( " no custom signers specified " ) ; return ; } for ( string custom signer : custom signers ) { string [ ] parts = custom signer split ( " : " ) ; if ( ! ( parts length = = 1 | | parts length = = 2 | | parts length = = 3 ) ) { string message = " invalid format ( expected name , name : signer class , " + " name : signer class : signer initializer class ) " + " for custom signer : [ " + custom signer + " ] " ; log error ( message ) ; throw new illegal argument exception ( message ) ; } if ( parts length = = 1 ) { / / nothing to do trying to use a pre - defined signer } else { / / register any custom signer maybe register signer ( parts [ 0 ] , parts [ 1 ] , owner conf ) ; / / if an initializer is specified , take care of instantiating it and / / setting it up if ( parts length = = 3 ) { class < ? extends aws signer initializer > clazz = null ; try { clazz = ( class < ? extends aws signer initializer > ) owner conf get class by name ( parts [ 2 ] ) ; } catch ( class not found exception e ) { throw new runtime exception ( string format ( " signer initializer class " + " [ % s ] not found for signer [ % s ] " , parts [ 2 ] , parts [ 0 ] ) , e ) ; } log debug ( " creating signer initializer : [ { } ] for signer : [ { } ] " , parts [ 2 ] , parts [ 0 ] ) ; aws signer initializer signer initializer = reflection utils new instance ( clazz , null ) ; initializers add ( signer initializer ) ; signer initializer register store ( bucket name , owner conf , delegation token provider , owner ugi ) ; } } } }


returns a single socket or else a not found code

public io grpc channelz v 1 get socket response get socket ( io grpc channelz v 1 get socket request request ) { return io grpc stub client calls blocking unary call ( get channel ( ) , get get socket method ( ) , get call options ( ) , request ) ; }


includes the defined { @ link schema support feature } to the newexisting set of supported features

public builder include schema support features ( schema support feature schema support feature ) { this schema support features add all ( arrays stream ( schema support feature ) collect ( collectors to list ( ) ) ) ; return this ; }


public long get next pointer ( ) { return internals get next pointer ( ) ; }


returns a single subchannel , or else a not found code

public void get subchannel ( io grpc channelz v 1 get subchannel request request , io grpc stub stream observer < io grpc channelz v 1 get subchannel response > response observer ) { io grpc stub client calls async unary call ( get channel ( ) new call ( get get subchannel method ( ) , get call options ( ) ) , request , response observer ) ; }


continue execution and block until either a breakpoint hits or error occurs

private void continue execution ( task monitor monitor ) throws cancelled exception { emulator set halt ( false ) ; do { execute instruction ( true , monitor ) ; } while ( ! emulator get halt ( ) ) ; }


public map < string , map < string , string > > get map map string ( ) { return map map string ; }


test the property ' array array of integer '

public void array array of integer test ( ) { / / todo : test array array of integer }


public void perform edit ( ) throws interrupted exception { if ( remaining edits ( ) = = 0 ) { return ; } if ( batch cursor = = current batch size ( ) ) { prepare new batch ( ) ; } item update update = current batch get ( batch cursor ) ; / / rewrite mentions to new items recon entity rewriter rewriter = new recon entity rewriter ( library , update get item id ( ) ) ; try { update = rewriter rewrite ( update ) ; } catch ( new item not created yet exception e ) { logger warn ( " failed to rewrite update on entity " + update get item id ( ) + " missing entity : " + e get missing entity ( ) + " skipping update " ) ; batch cursor + + ; return ; } try { / / new item if ( update is new ( ) ) { recon entity id value new cell = ( recon entity id value ) update get item id ( ) ; update = update normalize labels and aliases ( ) ; item document item document = datamodel make item document ( update get item id ( ) , update get labels ( ) stream ( ) collect ( collectors to list ( ) ) , update get descriptions ( ) stream ( ) collect ( collectors to list ( ) ) , update get aliases ( ) stream ( ) collect ( collectors to list ( ) ) , update get added statement groups ( ) , collections empty map ( ) ) ; item document created doc = editor create item document ( item document , summary , tags ) ; library set qid ( new cell get recon internal id ( ) , created doc get entity id ( ) get id ( ) ) ; } else { / / existing item item document current document = ( item document ) current docs get ( update get item id ( ) get id ( ) ) ; list < monolingual text value > labels = update get labels ( ) stream ( ) collect ( collectors to list ( ) ) ; labels add all ( update get labels if new ( ) stream ( ) filter ( label - > ! current document get labels ( ) contains key ( label get language code ( ) ) ) collect ( collectors to list ( ) ) ) ; list < monolingual text value > descriptions = update get descriptions ( ) stream ( ) collect ( collectors to list ( ) ) ; descriptions add all ( update get descriptions if new ( ) stream ( ) filter ( desc - > ! current document get descriptions ( ) contains key ( desc get language code ( ) ) ) collect ( collectors to list ( ) ) ) ; editor update terms statements ( current document , labels , descriptions , update get aliases ( ) stream ( ) collect ( collectors to list ( ) ) , new array list < monolingual text value > ( ) , update get added statements ( ) stream ( ) collect ( collectors to list ( ) ) , update get deleted statements ( ) stream ( ) collect ( collectors to list ( ) ) , summary , tags ) ; } } catch ( media wiki api error exception e ) { / / todo find a way to report these errors to the user in a nice way logger warn ( " media wiki error while editing [ " + e get error code ( ) + " ] : " + e get error message ( ) ) ; } catch ( i o exception e ) { logger warn ( " io error while editing : " + e get message ( ) ) ; } batch cursor + + ; }


set the value of the { @ code if - modified - since } header the date should be specified as the number of milliseconds since january 1 , 1970 gmt

s if modified since ( zoned date time if modified since ) ;


public static boolean un undo log delete lock ( ) { return get root session manager ( ) un scheduled lock ( undolog delete ) ; }


returns task description that will be available via task manager

protected string get description ( persistent task < params > task in progress ) { return " id = " + task in progress get id ( ) ; }


return the configured { @ link path matcher }

public path matcher get path matcher ( ) { return this path matcher ; }


set the number of units in a group this format does not support groups

public void set group size ( int group size ) { throw new unsupported operation exception ( " groups are not supported " ) ; }


finds the best suit constructor for creating an instance of a class the principle is that the constructor with least parameters and has no self type parameter will be the best suit one to create instance

protected constructor < ? > find best suit constructor ( class < ? > model class ) { constructor < ? > [ ] constructors = model class get declared constructors ( ) ; if ( constructors length = = 0 ) throw new lite pal support exception ( model class get name ( ) + " has no constructor lite pal could not handle it " ) ; constructor < ? > best suit constructor = null ; int min constructor param length = integer max value ; for ( constructor < ? > constructor : constructors ) { class < ? > [ ] types = constructor get parameter types ( ) ; boolean can use this constructor = true ; / / under some conditions , constructor can not use for create instance for ( class < ? > parameter type : types ) { if ( parameter type = = model class | | parameter type get name ( ) starts with ( " com android " ) & & parameter type get name ( ) ends with ( " instant reload exception " ) ) { / / we can not use this constructor can use this constructor = false ; break ; } } if ( can use this constructor ) { / / we can use this constructor if ( types length < min constructor param length ) { / / find the constructor with least parameter best suit constructor = constructor ; min constructor param length = types length ; } } } if ( best suit constructor ! = null ) { best suit constructor set accessible ( true ) ; } else { string builder builder = new string builder ( model class get name ( ) ) append ( " has no suited constructor to new instance constructors defined in class : " ) ; for ( constructor < ? > constructor : constructors ) { builder append ( " \ n " ) append ( constructor to string ( ) ) ; } throw new lite pal support exception ( builder to string ( ) ) ; } return best suit constructor ; }


public static consent reminder options value of ( final int value ) { return arrays stream ( values ( ) ) filter ( v - > v get value ( ) = = value ) find first ( ) or else throw ( illegal argument exception : : new ) ; }


removes a resource for the specified interval

public boolean remove interval ( reservation interval interval , resource resource ) { long start time = interval get start time ( ) ; long end time = interval get end time ( ) ; / / if the resource to be subtracted is less than the minimum resource in / / the range , abort removal to avoid negative capacity / / todo revesit decrementing end time if ( ! resources fits in ( resource , get minimum capacity in interval ( new reservation interval ( start time , end time - 1 ) ) ) ) { log info ( " request to remove more resources than what is available " ) ; return false ; } if ( start time > = 0 & & end time > start time & & end time < = time period ) { return super remove interval ( interval , resource ) ; } else { log info ( " interval extends beyond the end time " + time period ) ; return false ; } }


returns a fully - populated { @ link recipient } based off of a { @ link signal service address } , creating one in the database if necessary convenience overload of { @ link # external push ( context , uuid , string , boolean ) }

public static @ non null recipient external push ( @ non null context context , @ non null signal service address signal service address ) { return external push ( context , signal service address get uuid ( ) or null ( ) , signal service address get number ( ) or null ( ) , false ) ; }


removes an interest in connects and reads for this selection key while maintaining other interests

public static void set connect and read interested ( selection key selection key ) throws cancelled key exception { selection key interest ops ( selection key interest ops ( ) | selection key op connect | selection key op read ) ; }


convert a key to a fully qualified path this includes fixing up the uri so that if it ends with a trailing slash , that is corrected , similar to { @ code path normalize path ( ) }

public path key to qualified path ( string key ) { return qualify ( key to path ( key ) ) ; }


< code > optional string msg = 1 ; < code >

public com google protobuf byte string get msg bytes ( ) { java lang object ref = msg ; if ( ref instanceof string ) { com google protobuf byte string b = com google protobuf byte string copy from utf 8 ( ( java lang string ) ref ) ; msg = b ; return b ; } else { return ( com google protobuf byte string ) ref ; } }


convert the given object to string with each line indented by 4 spaces ( except the first line )

private string to indented string ( object o ) { if ( o = = null ) { return " null " ; } return o to string ( ) replace ( " \ n " , " \ n " ) ; }


format url template using given variables

public string url ( map < string , string > variables ) { string url = this url ; / / go through variables and replace placeholders for ( map entry < string , server variable > variable : this variables entry set ( ) ) { string name = variable get key ( ) ; server variable server variable = variable get value ( ) ; string value = server variable default value ; if ( variables ! = null & & variables contains key ( name ) ) { value = variables get ( name ) ; if ( server variable enum values size ( ) > 0 & & ! server variable enum values contains ( value ) ) { throw new runtime exception ( " the variable " + name + " in the server url has invalid value " + value + " " ) ; } } url = url replace all ( " \ \ { " + name + " \ \ } " , value ) ; } return url ; }


a useful placeholder for { @ link checked function } s that want to always return { @ code true }

protected boolean always replace resource ( final response response ) { return true ; }


{ @ inherit doc } the default implementation returns the result of calling { @ link # visit children } on { @ code ctx }

@ override public t visit join term ( eql base parser join term context ctx ) { return visit children ( ctx ) ; }


public synchronized void sync ( ) throws i o exception { if ( no buffered records > 0 ) { super sync ( ) ; / / no of records writable utils write v int ( out , no buffered records ) ; / / write ' keys ' and lengths write buffer ( key len buffer ) ; write buffer ( key buffer ) ; / / write ' values ' and lengths write buffer ( val len buffer ) ; write buffer ( val buffer ) ; / / flush the file - stream out flush ( ) ; / / reset internal states key len buffer reset ( ) ; key buffer reset ( ) ; val len buffer reset ( ) ; val buffer reset ( ) ; no buffered records = 0 ; } }


gets the current x coordinates for the all pointers mutable array is exposed for performance reasons and is not to be modified by the callers

public float [ ] get current x ( ) { return m current x ; }


returns the cleanup time for a window , which is { @ code window max timestamp + allowed lateness } in case this leads to a value greated than { @ link long # max value } then a cleanup time of { @ link long # max value } is returned

private long cleanup time ( w window ) { if ( window assigner is event time ( ) ) { long cleanup time = math max ( 0 , window max timestamp ( ) + allowed lateness ) ; return cleanup time > = window max timestamp ( ) ? cleanup time : long max value ; } else { return math max ( 0 , window max timestamp ( ) ) ; } }


deletes this key ( and disposes the key )

public void delete ( ) { check ( advapi 3 2 instance reg delete key ( handle , path ) ) ; dispose ( ) ; }


associates the ( { @ code row key } , { @ code column key } ) pair with { @ code value } in the built table duplicate key pairs are not allowed and will cause { @ link # build } to fail

public builder < r , c , v > put ( r row key , c column key , v value ) { cells add ( cell of ( row key , column key , value ) ) ; return this ; }


the " bulk " version of the remainder warning : this function will modify the " dividend " inputs

public void remainder ( byte [ ] [ ] dividend , int [ ] divisor ) { for ( int i = dividend length - divisor length ; i > = 0 ; i - - ) { for ( int j = 0 ; j < divisor length ; j + + ) { for ( int k = 0 ; k < dividend [ i ] length ; k + + ) { int ratio = div table [ dividend [ i + divisor length - 1 ] [ k ] & 0x 0 0 f f ] [ divisor [ divisor length - 1 ] ] ; dividend [ j + i ] [ k ] = ( byte ) ( ( dividend [ j + i ] [ k ] & 0x 0 0 f f ) ^ mul table [ ratio ] [ divisor [ j ] ] ) ; } } } }


attempt to write multiple { @ link byte buf } objects

private int do write multiple ( channel outbound buffer in ) throws exception { final long max bytes per gathering write = config ( ) get max bytes per gathering write ( ) ; iov array array = ( ( epoll event loop ) event loop ( ) ) clean iov array ( ) ; array max bytes ( max bytes per gathering write ) ; in for each flushed message ( array ) ; if ( array count ( ) > = 1 ) { / / todo : handle the case where cnt = = 1 specially return write bytes multiple ( in , array ) ; } / / cnt = = 0 , which means the outbound buffer contained empty buffers only in remove bytes ( 0 ) ; return 0 ; }


a sensible default implementation of { @ link # sub map ( object , object ) } in terms of { @ link # head map ( object ) } and { @ link # tail map ( object ) } in some situations , you may wish to override { @ link # sub map ( object , object ) } to forward to this implementation

protected sorted map < k , v > standard sub map ( k from key , k to key ) { check argument ( unsafe compare ( from key , to key ) < = 0 , " from key must be < = to key " ) ; return tail map ( from key ) head map ( to key ) ; }


returns the zero based index of the column of the cell being tracked by this editor

public int get column ( ) { return column ; }


set the matcher for the workers portion of the response

public bulk index by scroll response matcher slices ( matcher < collection < ? extends bulk index by scroll response matcher > > slices matcher ) { this slices matcher = slices matcher ; return this ; }


public static void axpy ( double a , double [ ] x , double [ ] y ) { preconditions check argument ( x length = = y length , " array dimension mismatched " ) ; f2j blas daxpy ( x length , a , x , 1 , y , 1 ) ; }


returns whether the complete pattern sequence has been matched

public boolean is matching ( ) { return matching ; }


default byte [ ] get bytes ( big integer value , int size ) { byte [ ] bytes = new byte [ size ] ; put big integer ( bytes , 0 , size , value ) ; return bytes ; }


find the fields constant that matches field id , throwing an exception if it is not found

public static fields find by thrift id or throw ( int field id ) { fields fields = find by thrift id ( field id ) ; if ( fields = = null ) throw new illegal argument exception ( " field " + field id + " doesn ' t exist ! " ) ; return fields ; }


< b > note : this is the default model of how to let users search for things in ghidra this is not a tool to allow regex searching , but instead allows users to perform searches while using familiar globbing characters such as ' ' and ' ? ' < b > this method can be used with { @ link matcher # matches ( ) } or { @ link matcher # find ( ) } create a regular expression from the given input < b > note : < b > the regular expression created by this method is not a pure regular expression more specifically , many regular expression characters passed to this method will be escaped ( see { @ link # escape all regex characters ( string ) } also , globbing characters < b > < u > will < u > < b > be changed from a regular expression meaning to a command - line style glob meaning < b > note : < b > this method < b > will < b > escape regular expression characters , such as : ? $ and many others thus , this method is not meant to < b > accept < b > regular expressions , but rather < b > generates < b > regular expressions

public static pattern create search pattern ( string input , boolean case sensitive ) { int options = 0 ; if ( ! case sensitive ) { options | = pattern case insensitive ; } pattern p = create pattern ( input , true , options ) ; return p ; }


whether the return value represents an asynchronous , future - like type with success and error callbacks if this method returns { @ code true } , then { @ link # to listenable future } is invoked next if it returns { @ code false } , then { @ link # handle return value } is called note : this method will only be invoked after { @ link # supports return type ( org springframework core method parameter ) } is called and it returns { @ code true }

boolean is async return value ( object return value , method parameter return type ) ;


validates the status of an < code > http u r l connection < code > against an expected http status code if the current status code is not the expected one it throws an exception with a detail message using server side error messages if available < b > note : < b > this method will throw the deserialized exception even if not declared in the < code > throws < code > of the method signature

public static void validate response ( http u r l connection conn , int expected status ) throws i o exception { if ( conn get response code ( ) ! = expected status ) { exception to throw ; input stream es = null ; try { es = conn get error stream ( ) ; map json = json serialization map reader ( ) read value ( es ) ; json = ( map ) json get ( error json ) ; string ex class = ( string ) json get ( error classname json ) ; string ex msg = ( string ) json get ( error message json ) ; if ( ex class ! = null ) { try { class loader cl = http exception utils class get class loader ( ) ; class klass = cl load class ( ex class ) ; constructor constr = klass get constructor ( string class ) ; to throw = ( exception ) constr new instance ( ex msg ) ; } catch ( exception ex ) { to throw = new i o exception ( string format ( " http status [ % d ] , exception [ % s ] , message [ % s ] , url [ % s ] " , conn get response code ( ) , ex class , ex msg , conn get u r l ( ) ) ) ; } } else { string msg = ( ex msg ! = null ) ? ex msg : conn get response message ( ) ; to throw = new i o exception ( string format ( " http status [ % d ] , message [ % s ] , url [ % s ] " , conn get response code ( ) , msg , conn get u r l ( ) ) ) ; } } catch ( exception ex ) { to throw = new i o exception ( string format ( " http status [ % d ] , message [ % s ] , url [ % s ] , exception [ % s ] " , conn get response code ( ) , conn get response message ( ) , conn get u r l ( ) , ex to string ( ) ) , ex ) ; } finally { if ( es ! = null ) { try { es close ( ) ; } catch ( i o exception ex ) { / / ignore } } } throw ex ( to throw ) ; } }


returns the future register value at the specified address that occurred because of a flow from the from addr if no future value is stored , it will return the value stored in the program the value returned may not have a complete value for the requested register

public register value get register value ( register register , address from addr , address dest addr ) { if ( is flow active ( ) & & dest addr compare to ( start addr ) > = 0 & & dest addr compare to ( current address ) < = 0 ) { return get register value ( register ) ; } map < address , map < register , register value > > future register state map = no address future register state map ; if ( dest addr ! = address no address ) { future register state map = future flow register state maps get ( dest addr ) ; } map < register , register value > map = null ; if ( future register state map ! = null ) { map = future register state map get ( from addr ) ; } if ( map ! = null ) { register value value = map get ( register get base register ( ) ) ; if ( value ! = null ) { return value get register value ( register ) ; } } return program context get register value ( register , dest addr ) ; }


checks whether the given access flags are valid field access flags , throwing a parse exception if they aren ' t

private void check field access flags ( int required set member access flags , int required unset member access flags ) throws parse exception { if ( ( ( required set member access flags | required unset member access flags ) & ~ class constants valid acc field ) ! = 0 ) { throw new parse exception ( " invalid method access modifier for field before " + reader location description ( ) ) ; } }


determines if found ascii strings are valid strings , and creates them if so

private void find strings ( final program program , address set view address set , int minimum string length , int align val , boolean require null termination , boolean include all char widths , task monitor monitor ) { found string callback found string callback = found string - > create string if valid ( found string , program , address set , monitor ) ; string searcher searcher = new string searcher ( program , minimum string length , align val , include all char widths , require null termination ) ; searcher search ( address set , found string callback , true , monitor ) ; }


returns the hostname verifier it should be used in https u r l connections

public hostname verifier get hostname verifier ( ) { if ( mode ! = mode client ) { throw new illegal state exception ( " factory is not in client mode actual mode is " + mode to string ( ) ) ; } return hostname verifier ; }


called by framework code to determine whether a node is finished this will only be called on this node when all of its inputs are finished


the manager ( merge resolver ) for a particular merge phase should call this when its phase or sub - phase begins the string array should match one that the returned by merge resolver get phases ( )

public void set in progress ( string [ ] merge phase ) { merge progress panel set in progress ( merge phase ) ; }


public void set result ( vv result ) { out val f 1 = result ; out collect ( out val ) ; }


provides an on click for the portion of the main view that is dimmed the listener is not triggered if the panel is in a collapsed or a hidden position if the on click listener is not provided , the clicks on the dimmed area are passed through to the main layout

public void set fade on click listener ( view on click listener listener ) { m fade on click listener = listener ; }


checks if quota needs to be synchronized or not

private boolean is quota sync required ( long ns quota , long ss quota ) { / / check if quota is enabled for router or not if ( router is quota enabled ( ) ) { if ( ( ns quota ! = hdfs constants quota dont set | | ss quota ! = hdfs constants quota dont set ) ) { return true ; } } return false ; }


contributes environment variables used for a build this method can be called repeatedly for the same { @ link run } , thus the computation of this method needs to be efficient if you have a time - consuming computation , one strategy is to take the hit once and then add the result as { @ link invisible action } to { @ link run } , then reuse those values later on this method gets invoked concurrently for multiple { @ link run } s that are being built at the same time , so it must be concurrent - safe when building environment variables for a build , jenkins will also invoke { @ link # build environment for ( job , env vars , task listener ) } this method only needs to add variables that are scoped to builds

public void build environment for ( @ non null run r , @ non null env vars envs , @ non null task listener listener ) throws i o exception , interrupted exception { }


find the fields constant that matches field id , or null if its not found

public static fields find by thrift id ( int field id ) { switch ( field id ) { case 1 : / / name return name ; case 2 : / / times return times ; default : return null ; } }


test the property ' namespace wrapped array '

public void namespace wrapped array test ( ) { / / todo : test namespace wrapped array }


disable initiating a gv1 - > gv2 auto - migration you can still recognize a group has been auto - migrated

public synchronized boolean disable gv 1 auto migrate initiation ( ) { return feature flags internal user ( ) & & get boolean ( gv2 disable automigrate initiation , false ) ; }


public void annotate ( exception with context ex ) { ex add context ( " ( locals array set ; primary ) " ) ; primary annotate ( ex ) ; int sz = secondaries size ( ) ; for ( int label = 0 ; label < sz ; label + + ) { locals array la = secondaries get ( label ) ; if ( la ! = null ) { ex add context ( " ( locals array set : primary for caller " + hex u 2 ( label ) + ' ) ' ) ; la get primary ( ) annotate ( ex ) ; } } }


a ( self - inverse ) bijection which converts the ordering on unsigned longs to the ordering on longs , that is , { @ code a < = b } as unsigned longs if and only if { @ code flip ( a ) < = flip ( b ) } as signed longs

private static long flip ( long a ) { return a ^ long min value ; }


public boolean get more results ( ) throws s q l exception { check closed ( ) ; return false ; }


returns the left child of the given node

private static r b node left of ( r b node p ) { return ( p = = null ) ? null : p left ; }


is the ugi managed by the ugi or an external subject ?

private boolean is hadoop login ( ) { / / checks if the private hadoop login context is managing the ugi return get login ( ) ! = null ; }


decommissioning using a post - configured exclude hosts file

public void test add new exclude path to configuration ( ) throws exception { configuration conf = new configuration ( ) ; rm = new mock r m ( conf ) ; rm start ( ) ; mock n m nm 1 = rm register node ( " host 1 : 1234 " , 5120 ) ; mock n m nm 2 = rm register node ( " host 2 : 5678 " , 10240 ) ; cluster metrics metrics = cluster metrics get metrics ( ) ; assert ( metrics ! = null ) ; int initial metric count = metrics get num decommisioned n ms ( ) ; node heartbeat response node heartbeat = nm 1 node heartbeat ( true ) ; assert assert equals ( node action normal , node heartbeat get node action ( ) ) ; node heartbeat = nm 2 node heartbeat ( true ) ; assert assert equals ( node action normal , node heartbeat get node action ( ) ) ; write to hosts file ( " host 2 " ) ; conf set ( yarn configuration rm nodes exclude file path , host file get absolute path ( ) ) ; rm get nodes list manager ( ) refresh nodes ( conf ) ; check decommissioned n m count ( rm , + + initial metric count ) ; node heartbeat = nm 1 node heartbeat ( true ) ; assert assert equals ( " node should not have been decommissioned " , node action normal , node heartbeat get node action ( ) ) ; node heartbeat = nm 2 node heartbeat ( true ) ; assert assert equals ( " node should have been decommissioned but is in state " + node heartbeat get node action ( ) , node action shutdown , node heartbeat get node action ( ) ) ; }


returns whether the upstream source is ready this method may be called when the renderer is in the following states : { @ link # state enabled } , { @ link # state started }

protected final boolean is source ready ( ) { return has read stream to end ( ) ? stream is final : assertions check not null ( stream ) is ready ( ) ; }


set the value of the ' { @ code onmouseup } ' attribute may be a runtime expression

public void set onmouseup ( string onmouseup ) { this onmouseup = onmouseup ; }


helper to be used by subclasses to emit simple warnings

protected void warning ( string type ) { add issue ( type , null , q a warning severity warning , 1 ) ; }


returns a builder object for creating classpath arguments

public classpath builder classpath ( ) { return classpath ; }


public void map map anytype test ( ) { / / todo : test map map anytype }


return an { @ linkplain enumeration enumeration } of the preferred { @ linkplain locale locales } configured in this mock request if no locales have been explicitly configured , the default , preferred { @ link locale } for the server mocked by this request is { @ link locale # english } in contrast to the servlet specification , this mock implementation does not take into consideration any locales specified via the { @ code accept - language } header

public enumeration < locale > get locales ( ) { return collections enumeration ( this locales ) ; }


tests that if local recovery is enabled we won ' t spread out tasks when recovering for regional failover

public void test local recovery region ( ) throws exception { test local recovery internal ( " region " ) ; }


public void declawed test ( ) { / / todo : test declawed }


create an instance with the given { @ link org springframework messaging simp simp message type }

public static simp message header accessor create ( simp message type message type ) { return new simp message header accessor ( message type , null ) ; }


unset an erasure coding policy from the given path

void unset erasure coding policy ( final string src arg , final boolean log retry cache ) throws i o exception , unresolved link exception , safe mode exception , access control exception { final string operation name = " unset erasure coding policy " ; check operation ( operation category write ) ; check erasure coding supported ( operation name ) ; file status resulting stat = null ; final f s permission checker pc = get permission checker ( ) ; f s permission checker set operation type ( operation name ) ; write lock ( ) ; try { check operation ( operation category write ) ; check name node safe mode ( " cannot unset erasure coding policy on " + src arg ) ; resulting stat = f s dir erasure coding op unset erasure coding policy ( this , src arg , pc , log retry cache ) ; } finally { write unlock ( operation name , get lock report info supplier ( src arg , null , resulting stat ) ) ; } get edit log ( ) log sync ( ) ; log audit event ( true , operation name , src arg , null , resulting stat ) ; }


returns the unique least value of type { @ code c } that is greater than { @ code value } , or { @ code null } if none exists inverse operation to { @ link # previous }


called < b > before < b > any initialisation has been done this can for example be useful to change configuration settings before anything that uses those properties is created allows to tweak the process engine by passing the { @ link process engine configuration impl } which allows tweaking it programmatically an example is the jdbc url when a { @ link process engine configurator } instance wants to change it , it needs to do it in this method , or otherwise the datasource would already have been created with the ' old ' value for the jdbc url

void before init ( process engine configuration impl process engine configuration ) ;


triggers any actions that have not yet been triggered and that are scheduled to be triggered at or before this scheduler ' s present time

public void trigger actions ( ) { trigger actions ( time ) ; }


returns { @ code true } if the { @ link item # wipeout } permission is enabled , { @ code false } otherwise the " wipe out workspace " action available on jobs is controlled by the { @ link item # build } permission for some specific projects , however , it is not acceptable to let users have this possibility , even it they can trigger builds as such , when enabling the { @ code hudson security wipe out permission } system property , a new " wipe out " permission will allow to have greater control on the " wipe out workspace " action

public static boolean is wipe out permission enabled ( ) { return system properties get boolean ( " hudson security wipe out permission " ) ; }


previously , it was possible to create partitioned state with < code > null < code > namespace this test makes sure that this is prohibited now

public void test require non null namespace ( ) throws exception { final abstract keyed state backend < integer > backend = create keyed backend ( int serializer instance ) ; value state descriptor < int value > kv id = new value state descriptor < > ( " id " , int value class , new int value ( - 1 ) ) ; try { backend get partitioned state ( null , void namespace serializer instance , kv id ) ; fail ( " did not throw expected null pointer exception " ) ; } catch ( null pointer exception ignored ) { } try { backend get partitioned state ( void namespace instance , null , kv id ) ; fail ( " did not throw expected null pointer exception " ) ; } catch ( null pointer exception ignored ) { } try { backend get partitioned state ( null , null , kv id ) ; fail ( " did not throw expected null pointer exception " ) ; } catch ( null pointer exception ignored ) { } backend dispose ( ) ; }


test serialization of outer boolean types

public void fake outer boolean serialize test ( ) throws api exception { boolean body = null ; boolean response = api fake outer boolean serialize ( body ) ; / / todo : test validations }


creates a drawable with the { @ link rounding options } and { @ link border options } applied to it

public drawable rounded drawable ( resources resources , drawable drawable , @ nullable border options border options , @ nullable rounding options rounding options ) { if ( border options ! = null & & border options width > 0 ) { return rounded drawable with border ( resources , drawable , border options , rounding options ) ; } else { return rounded drawable without border ( resources , drawable , rounding options ) ; } }


executes the given closure on each element in the collection if the input collection or closure is null , there is no change made

public static < e > void for all do ( collection < e > collection , closure < e > closure ) { if ( collection = = null | | closure = = null ) return ; int index = 0 ; for ( e e : collection ) { closure execute ( index + + , e ) ; } }


the following tests are failing on azure and the azure file system code needs to be modified to make them pass a separate work item has been opened for this

public void test move file under parent ( ) throws throwable { }


sets the { @ link query config } object that references the desired query to use when fetching the data

public builder set query config ( query config query config ) { this query config = query config ; return this ; }


verifies that once all shard copies on the new version , we should turn off the translog retention for indices with soft - deletes

public void test turn off translog retention after upgraded ( ) throws exception { if ( is running against old cluster ( ) ) { create index ( index , settings builder ( ) put ( index metadata index number of shards setting get key ( ) , 1 ) put ( index metadata index number of replicas setting get key ( ) , 1 ) put ( index settings index soft deletes setting get key ( ) , true ) build ( ) ) ; ensure green ( index ) ; int num docs = random int between ( 10 , 100 ) ; for ( int i = 0 ; i < num docs ; i + + ) { index document ( integer to string ( random int between ( 1 , 100 ) ) ) ; if ( rarely ( ) ) { flush ( index , random boolean ( ) ) ; } } } else { ensure green ( index ) ; flush ( index , true ) ; assert empty translog ( index ) ; ensure peer recovery retention leases renewed and synced ( index ) ; } }


return the { @ link job details } } for the given job

job details get available job details ( job i d job id ) ;


get the type of converter as defined by the { @ link # type config } configuration

public converter type type ( ) { return converter type with name ( get string ( type config ) ) ; }


test that creating one tree multimap from another does not copy the comparators from the source tree multimap

public void test create from tree multimap ( ) { multimap < double , double > tree = tree multimap create ( key comparator , value comparator ) ; tree put ( 1 0 , 2 0 ) ; tree put ( 2 0 , 3 0 ) ; tree put ( 3 0 , 4 0 ) ; tree put ( 4 0 , 5 0 ) ; tree multimap < double , double > copy from tree = tree multimap create ( tree ) ; assert equals ( tree , copy from tree ) ; assert same ( ordering natural ( ) , copy from tree key comparator ( ) ) ; assert same ( ordering natural ( ) , copy from tree value comparator ( ) ) ; assert same ( ordering natural ( ) , copy from tree get ( 1 0 ) comparator ( ) ) ; }


create an instance of { @ link consumed } with provided processor name

public static < k , v > consumed < k , v > as ( final string processor name ) { return new consumed < > ( null , null , null , null , processor name ) ; }


associates a byte array with the given name

public void put bytes ( string name , byte [ ] value ) { map put ( name , value ) ; }


return the { @ link request upgrade strategy } for web socket requests

public request upgrade strategy get upgrade strategy ( ) { return this upgrade strategy ; }


public boolean is empty ( ) { return fifo queue is empty ( ) & & head record = = null ; }


void handle ( consumer record < string , bytes > record ) ;


removes the download with the given id does nothing if a download with the given id does not exist this method may be slow and shouldn ' t normally be called on the main thread

void remove download ( string id ) throws i o exception ;


discards data from the buffer up to the first sps , where { @ code data position ( ) } is interpreted as the length of the buffer when the method returns , { @ code data position ( ) } will contain the new length of the buffer if the buffer is not empty it is guaranteed to start with an sps

public static void discard to sps ( byte buffer data ) { int length = data position ( ) ; int consecutive zeros = 0 ; int offset = 0 ; while ( offset + 1 < length ) { int value = data get ( offset ) & 0x f f ; if ( consecutive zeros = = 3 ) { if ( value = = 1 & & ( data get ( offset + 1 ) & 0x 1 f ) = = h264 nal unit type sps ) { / / copy from this nal unit onwards to the start of the buffer byte buffer offset data = data duplicate ( ) ; offset data position ( offset - 3 ) ; offset data limit ( length ) ; data position ( 0 ) ; data put ( offset data ) ; return ; } } else if ( value = = 0 ) { consecutive zeros + + ; } if ( value ! = 0 ) { consecutive zeros = 0 ; } offset + + ; } / / empty the buffer if the sps nal unit was not found data clear ( ) ; }


queues a write operation to be handled by the event loop this can be called by any thread and is the api available for non - selector threads to schedule writes when invoked from the selector thread the write will be executed right away

public void queue write ( write operation write operation ) { if ( is on current thread ( ) ) { write to channel ( write operation ) ; } else { queued writes offer ( write operation ) ; if ( is open ( ) = = false ) { boolean was removed = queued writes remove ( write operation ) ; if ( was removed ) { write operation get listener ( ) accept ( null , new closed selector exception ( ) ) ; } } else { wakeup ( ) ; } } }


produce a j s o n array containing the values of the members of this j s o n object

public j s o n array to j s o n array ( j s o n array names ) throws j s o n exception { if ( names = = null | | names length ( ) = = 0 ) { return null ; } j s o n array ja = new j s o n array ( ) ; for ( int i = 0 ; i < names length ( ) ; i + = 1 ) { ja put ( this opt ( names get string ( i ) ) ) ; } return ja ; }


for j unit testing only , set the option for resolving a conflict

void set conflict decision ( int decision ) { if ( decision < canceled | | decision > keep all ) { throw new illegal argument exception ( ) ; } conflict option = decision ; }


get the translog location after executing the operation

public translog location get translog location ( ) { return translog location ; }


get the value of this metrics center point

public double center value ( ) { return this center value ; }


returns an array containing containing only elements found in { @ code first } and also in { @ code second } the returned elements are in the same order as in { @ code first }

public static < t > t [ ] intersect ( class < t > array type , t [ ] first , t [ ] second ) { list < t > result = intersect ( first , second ) ; return result to array ( ( t [ ] ) array new instance ( array type , result size ( ) ) ) ; }


calculate the beginning and ending address of the biggest region around addr that does not contain any symbol this was not working correctly and it is too difficult to find the biggest region for which there is no codeunit , and where the volatile and readonly properties don ' t vary so now we assume that biggest hole we can find is just 1 byte

private string build hole ( address addr ) { / / address space addrspace = addr get address space ( ) ; / / address before , after ; / / memory block block = program get memory ( ) get block ( addr ) ; / / boolean readonly ; / / boolean is volatile = is volatile no data ( addr ) ; / / if ( block ! = null ) { / / before = block get start ( ) ; / / after = block get end ( ) ; / / readonly = ! block is write ( ) ; / / } / / else { / / before = addrspace get address ( 0 ) ; / / after = addrspace get max address ( ) ; / / readonly = false ; / / } / / code unit cubefore = listing get defined code unit before ( addr ) ; / / if ( cubefore ! = null ) { / / address tmp = cubefore get max address ( ) ; / / if ( tmp get address space ( ) get base space i d ( ) = = addrspace get base space i d ( ) ) { / / tmp = tmp add ( 1 ) ; / / if ( tmp get offset ( ) < = addr get offset ( ) ) { / / if ( tmp get offset ( ) > before get offset ( ) ) / / before = tmp ; / / } / / else { / / address is inside codeunit / / tmp = cubefore get max address ( ) ; / / if ( tmp get offset ( ) < after get offset ( ) ) / / after = tmp ; / / tmp = cubefore get min address ( ) ; / / if ( tmp get offset ( ) > before get offset ( ) ) / / before = tmp ; / / } / / } / / } / / code unit cuafter = listing get defined code unit after ( addr ) ; / / if ( cuafter ! = null ) { / / address tmp = cuafter get min address ( ) ; / / if ( ( tmp get address space ( ) = = addrspace ) ) { / / tmp = tmp subtract ( 1 ) ; / / if ( tmp get offset ( ) < after get offset ( ) ) { / / after = tmp ; / / } / / } / / } / / return build hole x m l ( addrspace get physical space ( ) get name ( ) , before get offset ( ) , / / after get offset ( ) , readonly , is volatile ) ; boolean readonly = is read only no data ( addr ) ; boolean isvolatile = is volatile no data ( addr ) ; return build hole x m l ( addr get address space ( ) get physical space ( ) get name ( ) , addr get offset ( ) , addr get offset ( ) , readonly , isvolatile ) ; }


should this request trigger a refresh ( { @ linkplain refresh policy # immediate } , the default ) , wait for a refresh ( { @ linkplain refresh policy # wait until } ) , or proceed ignore refreshes entirely ( { @ linkplain refresh policy # none } )

public refresh policy get refresh policy ( ) { return refresh policy ; }


add a user with optional salted password hash

void add user ( string username , char [ ] salted password hash ) throws duplicate name exception , i o exception { if ( salted password hash = = null & & enable local passwords ) { salted password hash = get default password hash ( ) ; } add user ( username , salted password hash , null ) ; }


helper method to determine a { @ link org apache calcite rel core table scan } ' s collation

public static list < rel collation > table ( rel opt table table ) { / / behavior change since calcite - 4215 : the default collations is null / / in flink , the default is an empty list list < rel collation > collations = table get collation list ( ) ; return collations = = null ? collections empty list ( ) : collations ; }


get an optional attribute value from the annotation

optional < object > get value ( string attribute name ) ;


generates a process - wide unique sequence number

public static int unique sequence id ( ) { return sequence increment and get ( ) ; }


check if the given { @ link signal } is the same as this instance if not an { @ link illegal state exception } will be thrown

public void expect ( signal signal ) { if ( this ! = signal ) { throw new illegal state exception ( " unexpected signal : " + signal ) ; } }


check if we have violated our quota for any metric that has a configured quota

public void check quotas ( ) { check quotas ( time milliseconds ( ) ) ; }


set the < code > execution type request < code > of the requested container

public void set execution type request ( execution type request exec spec ) { throw new unsupported operation exception ( ) ; }


returns the estimated usage frequency of the item

public int frequency ( long o ) { return ( int ) sketch estimate count ( o ) ; }


check if input decompression emulation is enabled or not default is { @ code false }

static boolean is input compression emulation enabled ( configuration conf ) { return conf get boolean ( input decompression emulation enable , false ) ; }


returns true if this file is a directory always returns false for classpath files on android , an { @ link file type # internal } handle to an empty directory will return false on the desktop , an { @ link file type # internal } handle to a directory on the classpath will return false

public boolean is directory ( ) { return preloader is directory ( file ) ; }


hack to rethrow unknown exceptions from compile :

static < t extends throwable > void rethrow ( throwable t ) throws t { throw ( t ) t ; }


returns the section header with the specified name , or null if no section exists with that name

public elf section header get section ( string name ) { list < elf section header > list = new array list < > ( ) ; for ( elf section header section header : section headers ) { if ( name ! = null & & name equals ( section header get name as string ( ) ) ) { list add ( section header ) ; } } if ( list size ( ) = = 0 ) { return null ; } if ( list size ( ) > 1 ) { throw new runtime exception ( " > 1 section with name of " + name ) ; } return list get ( 0 ) ; }


discover the vendor ' s fpga devices with execution time constraint

list < fpga device > discover ( int timeout ) ;


unmaps the block from memory see munmap ( 2 ) there isn ' t any portable way to unmap a memory region in java so we use the sun nio method here note that unmapping a memory region could cause crashes if code continues to reference the unmapped code however , if we don ' t manually unmap the memory , we are dependent on the finalizer to do it , and we have no idea when the finalizer will run

public static void munmap ( mapped byte buffer buffer ) { if ( cleaner util unmap supported ) { try { cleaner util get cleaner ( ) free buffer ( buffer ) ; } catch ( i o exception e ) { log info ( " failed to unmap the buffer " , e ) ; } } else { log trace ( cleaner util unmap not supported reason ) ; } }


compute the hash of the murmur hash 3 x 6 4 128 hashing function note , this hashing function might be used to persist hashes , so if the way hashes are computed changes for some reason , it needs to be addressed ( like in bloom filter and murmur hash field )

public static hash 1 2 8 hash 1 2 8 ( byte [ ] key , int offset , int length , long seed , hash 1 2 8 hash ) { long h 1 = seed ; long h 2 = seed ; if ( length > = 16 ) { final int len 1 6 = length & 0x f f f f f f f 0 ; / / higher multiple of 16 that is lower than or equal to length final int end = offset + len 1 6 ; for ( int i = offset ; i < end ; i + = 16 ) { long k 1 = byte utils read long l e ( key , i ) ; long k 2 = byte utils read long l e ( key , i + 8 ) ; k 1 * = c1 ; k 1 = long rotate left ( k 1 , 31 ) ; k 1 * = c2 ; h 1 ^ = k 1 ; h 1 = long rotate left ( h 1 , 27 ) ; h 1 + = h 2 ; h 1 = h 1 * 5 + 0x 5 2dce 7 2 9 ; k 2 * = c2 ; k 2 = long rotate left ( k 2 , 33 ) ; k 2 * = c1 ; h 2 ^ = k 2 ; h 2 = long rotate left ( h 2 , 31 ) ; h 2 + = h 1 ; h 2 = h 2 * 5 + 0x 3 8 4 9 5ab 5 ; } / / advance offset to the unprocessed tail of the data offset = end ; } long k 1 = 0 ; long k 2 = 0 ; switch ( length & 15 ) { case 15 : k 2 ^ = ( key [ offset + 14 ] & 0x f f l ) < < 48 ; case 14 : k 2 ^ = ( key [ offset + 13 ] & 0x f f l ) < < 40 ; case 13 : k 2 ^ = ( key [ offset + 12 ] & 0x f f l ) < < 32 ; case 12 : k 2 ^ = ( key [ offset + 11 ] & 0x f f l ) < < 24 ; case 11 : k 2 ^ = ( key [ offset + 10 ] & 0x f f l ) < < 16 ; case 10 : k 2 ^ = ( key [ offset + 9 ] & 0x f f l ) < < 8 ; case 9 : k 2 ^ = ( key [ offset + 8 ] & 0x f f l ) < < 0 ; k 2 * = c2 ; k 2 = long rotate left ( k 2 , 33 ) ; k 2 * = c1 ; h 2 ^ = k 2 ; case 8 : k 1 ^ = ( key [ offset + 7 ] & 0x f f l ) < < 56 ; case 7 : k 1 ^ = ( key [ offset + 6 ] & 0x f f l ) < < 48 ; case 6 : k 1 ^ = ( key [ offset + 5 ] & 0x f f l ) < < 40 ; case 5 : k 1 ^ = ( key [ offset + 4 ] & 0x f f l ) < < 32 ; case 4 : k 1 ^ = ( key [ offset + 3 ] & 0x f f l ) < < 24 ; case 3 : k 1 ^ = ( key [ offset + 2 ] & 0x f f l ) < < 16 ; case 2 : k 1 ^ = ( key [ offset + 1 ] & 0x f f l ) < < 8 ; case 1 : k 1 ^ = ( key [ offset ] & 0x f f l ) ; k 1 * = c1 ; k 1 = long rotate left ( k 1 , 31 ) ; k 1 * = c2 ; h 1 ^ = k 1 ; } h 1 ^ = length ; h 2 ^ = length ; h 1 + = h 2 ; h 2 + = h 1 ; h 1 = fmix ( h 1 ) ; h 2 = fmix ( h 2 ) ; h 1 + = h 2 ; h 2 + = h 1 ; hash h 1 = h 1 ; hash h 2 = h 2 ; return hash ; }


set an array of string values as optional parameter for the builder

public b opt ( @ nonnull final string key , @ nonnull final string values ) { mandatory keys remove ( key ) ; options set strings ( key , values ) ; return get this builder ( ) ; }


public auth filter builder < c , p , t > set authorizer ( authorizer < p > authorizer ) { this authorizer = authorizer ; return this ; }


set whether the configured { @ link # set encoding encoding } of this filter is supposed to override existing response encodings default is " false " , i e do not modify the encoding switch this to " true " to enforce the specified encoding for responses in any case

public void set force response encoding ( boolean force response encoding ) { this force response encoding = force response encoding ; }


desugar the classes that are in the inputs specified in the command line arguments

private void desugar classes in input ( input file provider input files , output file provider output file provider , class loader loader , @ nullable class reader factory classpath reader , dependency collector deps collector , class reader factory bootclasspath reader , @ nullable core library support core library support , class vs interface interface cache , immutable set builder < string > interface lambda method collector , invocation site transformation record builder call site record , boot class path digest boot class path digest , class attribute record class attribute record , nest digest nest digest , immutable set builder < class name > required runtime support types , class member retarget config class member retarget config ) throws i o exception { for ( file content provider < ? extends input stream > input file provider : iterables concat ( input files to input file streams ( ) , nest digest get companion file providers ( ) ) ) { string input filename = input file provider get binary path name ( ) ; if ( " module - info class " equals ( input filename ) | | input filename starts with ( " meta - inf / versions / " ) ) { continue ; / / drop module - info class and meta - inf / versions / since d 8 will drop them anyway } if ( output file provider desugar deps filename equals ( input filename ) ) { / / todo ( kmb ) : rule out that this happens or merge input file with what ' s in deps collector continue ; / / skip as we ' re writing a new file like this at the end or don ' t want it } try ( input stream content = input file provider get ( ) ) { / / we can write classes uncompressed since they need to be converted to dex format / / for android anyways resources are written as they were in the input jar to avoid / / any danger of accidentally uncompressed resources ending up in an apk we also simply / / copy classes from desugar ' s runtime library , which we build so they need no desugaring / / the runtime library typically uses constructs we ' d otherwise desugar , so it ' s easier / / to just skip it should it appear as a regular input ( for idempotency ) if ( input filename ends with ( " class " ) & & class name from class file name ( input filename ) is desugar eligible ( ) ) { class reader reader = rewriter reader ( content ) ; unprefixing class writer writer = rewriter writer ( class writer compute maxs ) ; class visitor visitor = create class visitors for classes in inputs ( loader , classpath reader , deps collector , bootclasspath reader , core library support , interface cache , interface lambda method collector , writer , reader , nest digest , call site record , boot class path digest , class attribute record , required runtime support types , class member retarget config ) ; if ( writer = = visitor ) { / / just copy the input if there are no rewritings output file provider write ( input filename , reader b ) ; } else { reader accept ( visitor , custom attributes , class reader expand frames ) ; string filename = writer get class name ( ) + " class " ; check state ( ( options core library & & core library support ! = null ) | | filename equals ( input filename ) ) ; output file provider write ( filename , writer to byte array ( ) ) ; } } else { / / most other files ( and directories ) we want to just copy , but string output filename = input filename ; if ( options core library & & core library support ! = null & & input filename ends with ( " / " ) ) { / / rename core library directories together with files in them output filename = core library support rename core library ( input filename ) ; } else if ( core library support ! = null & & ! input filename ends with ( " / " ) & & input filename starts with ( " meta - inf / services / " ) ) { / / rename j u service loader files for renamed core libraries so they ' re found string service name = input filename substring ( " meta - inf / services / " length ( ) ) ; if ( ! service name contains ( " / " ) & & core library support is renamed core library ( service name replace ( ' ' , ' / ' ) ) ) { output filename = " meta - inf / services / " + core library support rename core library ( service name replace ( ' ' , ' / ' ) ) replace ( ' / ' , ' ' ) ; } } output file provider copy from ( input filename , input files , output filename ) ; } } } }


uses a custom partitioner for the grouping


called when data is written to the audio processor

void handle buffer ( byte buffer buffer ) ;


no - init mode , the oap just starts up , but wouldn ' t do storage init

public static boolean is no init mode ( ) { return " no - init " equals ( mode ) ; }


convert the value from one storage unit to another

private double convert storage unit ( double value , storage unit source unit , storage unit target unit ) { double byte value = source unit to bytes ( value ) ; return target unit from bytes ( byte value ) ; }


returns the name of this symbol this value could be null since some libraries only export by ordinal value

string get name ( ) { return symbol name ; }


returns the glyph pages for this unicode font

public list get glyph pages ( ) { return glyph pages ; }


public static void put ( @ non null final string key , final float value ) { put ( key , value , get default s p utils ( ) ) ; }


transforms a set of imports to a map with key config to model import ( import ) and value the import string

private map < string , string > get all imports mappings ( set < string > all imports ) { map < string , string > result = new hash map < > ( ) ; all imports for each ( next import - > { string mapping = config import mapping ( ) get ( next import ) ; if ( mapping ! = null ) { result put ( mapping , next import ) ; } else { result put all ( config to model import map ( next import ) ) ; } } ) ; return result ; }


invoked immediately after the start of concurrent handling , in the same thread that started it this method may be used to detect the start of concurrent processing with the given { @ code deferred result } the { @ code deferred result } may have already been set , for example at the time of its creation or by another thread

default < t > void pre process ( native web request request , deferred result < t > deferred result ) throws exception { }


public static void validate encoding format options ( readable config table options ) { json options validate encoding format options ( table options ) ; / / validator for { @ link schema include } if ( table options get ( schema include ) ) { throw new validation exception ( string format ( " debezium json serialization doesn ' t support ' % s % s ' option been set to true " , identifier , schema include key ( ) ) ) ; } }


parses the given settings and creates the appropriate { @ link after effect }

private static after effect parse after effect ( version index created version , settings settings ) { string after effect = settings get ( " after effect " ) ; after effect effect = after effects get ( after effect ) ; if ( effect = = null ) { string replacement = legacy after effects get ( after effect ) ; if ( replacement ! = null ) { if ( index created version on or after ( version v 7 0 0 ) ) { throw new illegal argument exception ( " after effect [ " + after effect + " ] isn ' t supported anymore , please use another effect " ) ; } else { deprecation logger deprecate ( after effect + " after effect replaced " , " after effect [ " + after effect + " ] isn ' t supported anymore and has arbitrarily been replaced with [ " + replacement + " ] " ) ; effect = after effects get ( replacement ) ; assert effect ! = null ; } } } if ( effect = = null ) { throw new illegal argument exception ( " unsupported after effect [ " + after effect + " ] , expected one of " + after effects key set ( ) ) ; } return effect ; }


test the property ' enum string required '

public void enum string required test ( ) { / / todo : test enum string required }


void executes huge script in reasonable time ( ) throws s q l exception { database populator add script ( default schema ( ) ) ; database populator add script ( resource ( " db - test - data - huge sql " ) ) ; database populator utils execute ( database populator , db ) ; }


public double get ( int i , int j ) { return data [ j * m + i ] ; }


finds the type parameter for the given class

public static class < ? > get type parameter ( class < ? > klass ) { return get type parameter ( klass , object class ) ; }


copies the selected contents of this text field to the { @ link clipboard } implementation set on this text field , then removes it

public void cut ( ) { cut ( programmatic change events ) ; }


test serialization of outer number types

public void fake outer number serialize ( big decimal body , handler < async result < big decimal > > result handler ) { delegate fake outer number serialize ( body , result handler ) ; }


returns the data object at the given cell location we need to check first to make sure the rowcol values map to a valid cell

public instruction table data object get cell data ( int row , int col ) { if ( get model ( ) = = null ) { return null ; } if ( row < 0 | | col < 0 ) { return null ; } if ( get model ( ) get row count ( ) < = row | | get model ( ) get column count ( ) < = col ) { return null ; } return ( instruction table data object ) get model ( ) get value at ( row , col ) ; }


private int get key length ( int index ) throws i o exception { return key type read length ( buffer , buffer get int ( base + ( index * entry size ) ) ) ; }


read a string as a v int n , followed by n bytes in text format

public static string read string ( data input in ) throws i o exception { int length = read v int ( in ) ; if ( length = = - 1 ) return null ; byte [ ] buffer = new byte [ length ] ; in read fully ( buffer ) ; return text decode ( buffer ) ; }


gets the read - only view of all the builds

public run list < run t > get builds ( ) { return run list from runs ( get runs ( ) values ( ) ) ; }


find the fields constant that matches field id , throwing an exception if it is not found

public static fields find by thrift id or throw ( int field id ) { fields fields = find by thrift id ( field id ) ; if ( fields = = null ) throw new illegal argument exception ( " field " + field id + " doesn ' t exist ! " ) ; return fields ; }


runs the specified command using the current program

public final boolean run command ( command cmd ) { return cmd apply to ( current program ) ; }


public static command result exec cmd ( final string command , final boolean is rooted , final boolean is need result msg ) { return exec cmd ( new string [ ] { command } , is rooted , is need result msg ) ; }


public static string format ( double value , int fraction digits ) { return format ( value , false , 1 , fraction digits , true ) ; }


returns the total number of translog operations recovered so far

public synchronized int recovered operations ( ) { return recovered ; }


can be used to collect objects from the iterable is a terminating operation

public final optional < e > last ( ) { var list = last ( 1 ) as list ( ) ; if ( list is empty ( ) ) { return optional empty ( ) ; } return optional of ( list get ( 0 ) ) ; }


get the allocation tags of the constraint

public set < string > get allocation tags ( ) { return allocation tags ; }


common code for checking that x + width and y + height are within image bounds

private static void check final image bounds ( bitmap source , int x , int y , int width , int height ) { preconditions check argument ( x + width < = source get width ( ) , " x + width must be < = bitmap width ( ) " ) ; preconditions check argument ( y + height < = source get height ( ) , " y + height must be < = bitmap height ( ) " ) ; }


public string get sc a e t h flow points ( ) { return sc a e t h flow points ; }


the value of the inner class info index item must be a valid index into the constant pool table the constant pool entry at that index must be a constant class info structure representing c the remaining items in the classes array entry give information about c

public int get inner class info index ( ) { return inner class info index & 0xffff ; }


resolves a file syntax tree in the specified environment and compiles it to a program this operation mutates the syntax tree , both by resolving identifiers and recording local variables , and in case of error , by appending to { @ code file errors ( ) }

public static program compile file ( starlark file file , resolver module env ) throws syntax error exception { resolver resolve file ( file , env ) ; if ( ! file ok ( ) ) { throw new syntax error exception ( file errors ( ) ) ; } / / extract load statements immutable list builder < string > loads = immutable list builder ( ) ; immutable list builder < location > load locations = immutable list builder ( ) ; for ( statement stmt : file get statements ( ) ) { if ( stmt instanceof load statement ) { load statement load = ( load statement ) stmt ; string module = load get import ( ) get value ( ) ; loads add ( module ) ; load locations add ( load get import ( ) get location ( ) ) ; } } return new program ( file get resolved function ( ) , loads build ( ) , load locations build ( ) ) ; }


public boolean get prefix ns boolean ( ) { return prefix ns boolean ; }


public void test capitalization ( ) { / / todo : test capitalization }


public static command result exec cmd ( final list < string > commands ) { return exec cmd ( commands = = null ? null : commands to array ( new string [ ] { } ) , false , true ) ; }


visit a parse tree produced by the { @ code show functions } labeled alternative in { @ link sql base parser # statement }

t visit show functions ( sql base parser show functions context ctx ) ;


sets a single { @ code reserved word mappings } and returns a reference to this builder so that the methods can be chained together

public builder with reserved word mapping ( string key , string value ) { if ( this reserved word mappings = = null ) { this reserved word mappings = new hash map < > ( ) ; } this reserved word mappings put ( key , value ) ; return this ; }


public void test number only ( ) { / / todo : test number only }


adds a number of occurrences of an element to this { @ code immutable multiset }

public builder < e > add copies ( e element , int occurrences ) { contents add ( check not null ( element ) , occurrences ) ; return this ; }


public void direct map test ( ) { / / todo : test direct map }


public base configuration properties loader get loader ( final resource resource , final string name ) { val filename = string utils default string ( resource get filename ( ) ) to lower case ( ) ; if ( filename ends with ( " properties " ) ) { return new simple configuration properties loader ( this configuration cipher executor , name , resource ) ; } if ( filename ends with ( " groovy " ) ) { return new groovy configuration properties loader ( this configuration cipher executor , name , get application profiles ( environment ) , resource ) ; } if ( filename ends with ( " yaml " ) | | filename ends with ( " yml " ) ) { return new yaml configuration properties loader ( this configuration cipher executor , name , resource ) ; } throw new illegal argument exception ( " unable to determine configuration loader for " + resource ) ; }


gets the register spec to use to hold the object to synchronize on , for a synchronized method

private register spec get synch reg ( ) { / * * we use the register that is just past the deepest possible * stack element , with a minimum of v 1 since v 0 is what ' s * always used to hold the caught exception when unwinding we * don ' t need to do anything else special at this level , since * later passes will merely notice the highest register used * by explicit inspection * / int reg = get normal reg count ( ) ; return register spec make ( ( reg < 1 ) ? 1 : reg , type object ) ; }


remove any values from a bucket and the base values too

public static void remove base and bucket overrides ( final string bucket , final configuration conf , final string options ) { for ( string option : options ) { conf unset ( option ) ; } remove bucket overrides ( bucket , conf , options ) ; }


returns an immutable map containing the given entries , in order

public static < k , v > immutable map < k , v > of ( k k 1 , v v 1 , k k 2 , v v 2 , k k 3 , v v 3 ) { check entry not null ( k 1 , v 1 ) ; check entry not null ( k 2 , v 2 ) ; check entry not null ( k 3 , v 3 ) ; return regular immutable map create ( 3 , new object [ ] { k 1 , v 1 , k 2 , v 2 , k 3 , v 3 } ) ; }


finds all history directories with a timestamp component by scanning the filesystem used when the job history server is started

protected list < file status > find timestamped directories ( ) throws i o exception { list < file status > fs list = job history utils local globber ( done dir fc , done dir prefix path , done before serial tail ) ; return fs list ; }