public static SM_SYSTEM_MESSAGE STR_SKILL_SUCC_ReturnHome_A_TO_B  ( String skillcaster , String skillname ) { return new SM_SYSTEM_MESSAGE ( 1200916 , skillcaster , skillname ) ; }

[% Skillcaster] utilizado [% de habilidad].


public static void main  ( String [ ] args ) { System . out . println ( OS ) ; if ( isWindows ( ) ) { System . out . println ( "This is Windows" ) ; } else if ( isMac ( ) ) { System . out . println ( "This is Mac" ) ; } else if ( isUnix ( ) ) { System . out . println ( "This is Unix or Linux" ) ; } else if ( isSolaris ( ) ) { System . out . println ( "This is Solaris" ) ; } else { System . out . println ( "Your OS is not support!!" ) ; } }


public static int jdkToClassVersion  ( @ NotNull String version ) { int dot = version . indexOf ( '.' ) ; if ( dot != - 1 ) { dot ++ ; int end = version . length ( ) ; for ( int i = dot ; i < end ; i ++ ) { if ( ! Character . isDigit ( version . charAt ( i ) ) ) { end = i ; break ; } } if ( end > dot ) { int major = Integer . valueOf ( version . substring ( dot , end ) ) ; if ( major > 0 ) { return major + 44 ; } } } return - 1 ; }

Convierte una cadena JDK como 1.6.0_65 al número de versión de archivo de clase correspondiente, por ejemplo.50


public boolean contains  ( int index ) { return index >= getFirst ( ) && index <= getLast ( ) ; }

Prueba si el artículo está contenido por rango


public static final void sort  ( int [ ] a , double [ ] b , int begin , int end ) { mergesort ( a , b , begin , end - 1 ) ; }

Ordene dos matrices simultáneamente, utilizando el orden de clasificación de los valores en la primera matriz para determinar el orden de clasificación para ambas matrices.


protected boolean matchChildSequence  ( QName element , int event ) throws XNIException { if ( fCurrentChildDepth >= fCurrentChildSequence . length ) { int tmpCurrentChildSequence [ ] = new int [ fCurrentChildSequence . length ] ; System . arraycopy ( fCurrentChildSequence , 0 , tmpCurrentChildSequence , 0 , fCurrentChildSequence . length ) ; fCurrentChildSequence = new int [ fCurrentChildDepth * 2 ] ; System . arraycopy ( tmpCurrentChildSequence , 0 , fCurrentChildSequence , 0 , tmpCurrentChildSequence . length ) ; } if ( fIsResolveElement ) { if ( event == XPointerPart . EVENT_ELEMENT_START ) { fCurrentChildSequence [ fCurrentChildDepth ] = fCurrentChildPosition ; fCurrentChildDepth ++ ; fCurrentChildPosition = 1 ; if ( ( fCurrentChildDepth <= fFoundDepth ) || ( fFoundDepth == 0 ) ) { if ( checkMatch ( ) ) { fIsElementFound = true ; fFoundDepth = fCurrentChildDepth ; } else { fIsElementFound = false ; fFoundDepth = 0 ; } } } else if ( event == XPointerPart . EVENT_ELEMENT_END ) { if ( fCurrentChildDepth == fFoundDepth ) { fIsElementFound = true ; } else if ( ( ( fCurrentChildDepth < fFoundDepth ) && ( fFoundDepth != 0 ) ) || ( ( fCurrentChildDepth > fFoundDepth ) && ( fFoundDepth == 0 ) ) ) { fIsElementFound = false ; } fCurrentChildSequence [ fCurrentChildDepth ] = 0 ; fCurrentChildDepth -- ; fCurrentChildPosition = fCurrentChildSequence [ fCurrentChildDepth ] + 1 ; } else if ( event == XPointerPart . EVENT_ELEMENT_EMPTY ) { fCurrentChildSequence [ fCurrentChildDepth ] = fCurrentChildPosition ; fCurrentChildPosition ++ ; if ( checkMatch ( ) ) { fWasOnlyEmptyElementFound = ! fIsElementFound ; fIsElementFound = true ; } else { fIsElementFound = false ; fWasOnlyEmptyElementFound = false ; } } } return fIsElementFound ; }

Coincide con la posición de elemento actual en el árbol de documentos con la posición de elemento especificada en el esquema del elemento XPointer.


private void compactAbstractionChain  ( D d3 , D d2 ) { if ( d3 != d2 ) { D pred = d3 . getPredecessor ( ) ; if ( pred != null && pred != d2 ) d3 . setPredecessor ( d2 ) ; } }

Comprueba si la nueva abstracción es el sucesor directo de la abstracción original dada a la función de flujo.Si no, la cadena de abstracciones está compactada a la longitud 1.


@ Override public void populateExpression  ( Object objValue ) { if ( windBarbsPanel != null ) { if ( objValue instanceof String ) { windBarbsPanel . populateExpression ( ( String ) objValue ) ; } } }


private void removeUnneededVisualizationCards  ( ) { Map < String , VisualizationCardData > removableVisualizationCards = new HashMap < > ( ) ; Map < String , VisualizationCardData > visualizationCards = cardListAdapter . getVisualizationCards ( ) ; for ( Map . Entry < String , VisualizationCardData > visualizationCardDataEntry : visualizationCards . entrySet ( ) ) { String nodeId = visualizationCardDataEntry . getKey ( ) ; VisualizationCardData visualizationCard = visualizationCardDataEntry . getValue ( ) ; if ( ! isRequestingSensorEventData ( nodeId , visualizationCard . getDataBatch ( ) . getSource ( ) ) ) { removableVisualizationCards . put ( nodeId , visualizationCard ) ; continue ; } } for ( Map . Entry < String , VisualizationCardData > visualizationCardDataEntry : removableVisualizationCards . entrySet ( ) ) { Log . d ( TAG , "Removing unneeded visualization card: " + visualizationCardDataEntry . getValue ( ) . getHeading ( ) ) ; cardListAdapter . remove ( visualizationCardDataEntry . getValue ( ) ) ; } }

Elimina todas las visualizaciones del adaptador de la lista de tarjetas que actualmente no se solicitan


public static void writeLines  ( Collection < ? > lines , String lineEnding , OutputStream output ) throws IOException { writeLines ( lines , lineEnding , output , Charset . defaultCharset ( ) ) ; }

Escribe el valor <código> TOSTRING () </ CODE> de cada elemento en una colección en una línea de línea </ código> de Outputstream </ código>, utilizando la codificación de caracteres predeterminada de la plataforma y la línea de finalización específica.


private Filter addFilter  ( FilterNode node ) { Filter filter = node . getFilter ( ) ; FilterConfigInterface filterConfig = node . getFilterConfig ( ) ; if ( filter instanceof LogicFilterImpl ) { List < Filter > filterList = new ArrayList < Filter > ( ) ; createFilterList ( node , filterList ) ; return filterConfig . createLogicFilter ( filterList ) ; } List < Expression > parameterFilter = new ArrayList < Expression > ( ) ; if ( filter instanceof FidFilterImpl ) { createExpressionParameterList ( node , 1 , parameterFilter ) ; } else if ( filter instanceof BinaryTemporalOperator ) { createExpressionParameterList ( node , 2 , parameterFilter ) ; } else if ( filter instanceof PropertyIsBetween ) { createExpressionParameterList ( node , 3 , parameterFilter ) ; } else if ( filter instanceof PropertyIsNull ) { createExpressionParameterList ( node , 1 , parameterFilter ) ; } else if ( filter instanceof PropertyIsLike ) { createExpressionParameterList ( node , 6 , parameterFilter ) ; } else if ( filter instanceof BinarySpatialOperator ) { createExpressionParameterList ( node , 2 , parameterFilter ) ; } else if ( filter instanceof BinaryComparisonAbstract ) { if ( filter instanceof Not ) { createExpressionParameterList ( node , 1 , parameterFilter ) ; } else if ( filter instanceof PropertyIsGreaterThan ) { createExpressionParameterList ( node , 2 , parameterFilter ) ; } else { createExpressionParameterList ( node , 3 , parameterFilter ) ; } } else { return filter ; } return filterConfig . createFilter ( parameterFilter ) ; }


public void writePacket  ( byte [ ] buffer , SocketAddress dest ) throws IOException { DatagramPacket dp = new DatagramPacket ( buffer , buffer . length , dest ) ; socket . send ( dp ) ; }

Envía un paquete al <Código> destarch especificado </ code>.


public SortByName ( ) { this . caseSensitive = false ; }


public boolean isAllViewersUptodate  ( ) { for ( IDirectableViewer viewer : viewers ) { if ( ! viewer . isUptoDate ( ) ) { return false ; } } return true ; }

Devuelve verdadero, si todos los espectadores son uptodate


public static String humanReadableInt  ( long number ) { long absNumber = Math . abs ( number ) ; double result = number ; String suffix = "" ; if ( absNumber < 1024 ) { } else if ( absNumber < 1024 * 1024 ) { result = number / 1024.0 ; suffix = "k" ; } else if ( absNumber < 1024 * 1024 * 1024 ) { result = number / ( 1024.0 * 1024 ) ; suffix = "m" ; } else { result = number / ( 1024.0 * 1024 * 1024 ) ; suffix = "g" ; } return oneDecimal . format ( result ) + suffix ; }

Dado un entero, devuelva una cadena que se encuentra en un formato legible aproximado, pero humano.Utiliza las bases 'K', 'M', y 'G' por 1024, 1024 ** 2, y 1024 ** 3.


private void acquireWakeLockAndStartService  ( Context context ) { acquireWakeLock ( context ) ; startPrecacheService ( context ) ; }

Adquirir el Wakelock y iniciar el recacaco.


public void startDocument  ( ) { fValueStores . clear ( ) ; fIdentityConstraint2ValueStoreMap . clear ( ) ; fGlobalIDConstraintMap . clear ( ) ; fGlobalMapStack . removeAllElements ( ) ; }

Restablece el caché de restricción de identidad.


public Headers headers  ( ) { return rawResponse . headers ( ) ; }


public static SM_SYSTEM_MESSAGE STR_MSG_COMBAT_OTHER_NPC_BLOCK  ( String value0 , String value1 ) { return new SM_SYSTEM_MESSAGE ( 1260217 , value0 , value1 ) ; }


public static void validateName  ( String nameOfStream ) throws InvalidStreamNameException  { String reason = null ; char chars [ ] = nameOfStream . toCharArray ( ) ; char c ; for ( int i = 0 ; i < chars . length ; i ++ ) { c = chars [ i ] ; if ( c == 0 ) { reason = "null character not allowed @" + i ; break ; } else if ( c == '/' ) { reason = "'/' not allowed @" + i ; break ; } else if ( c > '\u0000' && c < '\u001f' || c > '\u007f' && c < '\u009F' || c > '\ud800' && c < '\uf8ff' || c > '\ufff0' && c < '\uffff' ) { reason = "invalid charater @" + i ; break ; } } if ( null != reason ) { throw new InvalidStreamNameException ( nameOfStream , reason ) ; } if ( isReservedStreamName ( nameOfStream ) ) { throw new InvalidStreamNameException ( nameOfStream , "Stream Name is reserved" ) ; } }


public boolean decrypt  ( ByteBuffer buf ) { final byte [ ] data = buf . array ( ) ; final int size = buf . remaining ( ) ; byte [ ] clientPacketKey = keys [ CLIENT ] ; int arrayIndex = buf . arrayOffset ( ) + buf . position ( ) ; int prev = data [ arrayIndex ] ; data [ arrayIndex ++ ] ^= ( clientPacketKey [ 0 ] & 0xff ) ; for ( int i = 1 ; i < size ; i ++ , arrayIndex ++ ) { int curr = data [ arrayIndex ] & 0xff ; data [ arrayIndex ] ^= ( staticKey [ i & 63 ] & 0xff ) ^ ( clientPacketKey [ i & 7 ] & 0xff ) ^ prev ; prev = curr ; } long oldKey = ( ( ( long ) clientPacketKey [ 0 ] & 0xff ) << 0 ) | ( ( ( long ) clientPacketKey [ 1 ] & 0xff ) << 8 ) | ( ( ( long ) clientPacketKey [ 2 ] & 0xff ) << 16 ) | ( ( ( long ) clientPacketKey [ 3 ] & 0xff ) << 24 ) | ( ( ( long ) clientPacketKey [ 4 ] & 0xff ) << 32 ) | ( ( ( long ) clientPacketKey [ 5 ] & 0xff ) << 40 ) | ( ( ( long ) clientPacketKey [ 6 ] & 0xff ) << 48 ) | ( ( ( long ) clientPacketKey [ 7 ] & 0xff ) << 56 ) ; oldKey += size ; if ( validateClientPacket ( buf ) ) { clientPacketKey [ 0 ] = ( byte ) ( oldKey >> 0 & 0xff ) ; clientPacketKey [ 1 ] = ( byte ) ( oldKey >> 8 & 0xff ) ; clientPacketKey [ 2 ] = ( byte ) ( oldKey >> 16 & 0xff ) ; clientPacketKey [ 3 ] = ( byte ) ( oldKey >> 24 & 0xff ) ; clientPacketKey [ 4 ] = ( byte ) ( oldKey >> 32 & 0xff ) ; clientPacketKey [ 5 ] = ( byte ) ( oldKey >> 40 & 0xff ) ; clientPacketKey [ 6 ] = ( byte ) ( oldKey >> 48 & 0xff ) ; clientPacketKey [ 7 ] = ( byte ) ( oldKey >> 56 & 0xff ) ; return true ; } return false ; }

Decrypt Client Packet de este byteBuffer Si la descifrado tiene éxito, actualice la clave del cliente


public static Pair < Double , Double > computeSequenceDiversityRatio  ( Alignment alignment , int kmer , int step , int minDepth , ProgressListener progressListener ) throws CanceledException { progressListener . setTasks ( "Computing diversity ratio k/n" , "" ) ; progressListener . setMaximum ( alignment . getNumberOfSequences ( ) ) ; progressListener . setProgress ( 0 ) ; int firstCol = Integer . MAX_VALUE ; int lastCol = 0 ; for ( int row = 0 ; row < alignment . getNumberOfSequences ( ) ; row ++ ) { Lane lane = alignment . getLane ( row ) ; firstCol = Math . min ( firstCol , lane . getFirstNonGapPosition ( ) ) ; lastCol = Math . max ( firstCol , lane . getLastNonGapPosition ( ) ) ; } Set < String > words = new HashSet < > ( ) ; List < Pair < Integer , Integer > > listKN = new LinkedList < > ( ) ; for ( int col = firstCol ; col <= lastCol ; col += step ) { words . clear ( ) ; int n = 0 ; for ( int row = 0 ; row < alignment . getNumberOfSequences ( ) ; row ++ ) { Lane lane = alignment . getLane ( row ) ; if ( col >= lane . getFirstNonGapPosition ( ) && col + kmer <= lane . getLastNonGapPosition ( ) ) { int start = col - lane . getFirstNonGapPosition ( ) ; String word = lane . getBlock ( ) . substring ( start , start + kmer ) ; if ( ! ( word . contains ( "-" ) || word . contains ( "N" ) ) ) { words . add ( word ) ; n ++ ; } } if ( n >= minDepth ) { listKN . add ( new Pair < > ( words . size ( ) , n ) ) ; } progressListener . incrementProgress ( ) ; } } if ( listKN . size ( ) == 0 ) return new Pair < > ( 0.0 , 0.0 ) ; double averageK = 0 ; double averageN = 0 ; for ( Pair < Integer , Integer > kn : listKN ) { averageK += kn . getFirst ( ) ; averageN += kn . getSecond ( ) ; } averageK /= listKN . size ( ) ; averageN /= listKN . size ( ) ; return new Pair < > ( averageK , averageN ) ; }

calcula el índice de diversidad basado en K-MER


public ArrayFieldVector < T > solve  ( ArrayFieldVector < T > b ) { final int m = pivot . length ; final int length = b . getDimension ( ) ; if ( length != m ) { throw new MathIllegalArgumentException ( LocalizedCoreFormats . DIMENSIONS_MISMATCH , length , m ) ; } if ( singular ) { throw new MathIllegalArgumentException ( LocalizedCoreFormats . SINGULAR_MATRIX ) ; } final T [ ] bp = MathArrays . buildArray ( field , m ) ; for ( int row = 0 ; row < m ; row ++ ) { bp [ row ] = b . getEntry ( pivot [ row ] ) ; } for ( int col = 0 ; col < m ; col ++ ) { final T bpCol = bp [ col ] ; for ( int i = col + 1 ; i < m ; i ++ ) { bp [ i ] = bp [ i ] . subtract ( bpCol . multiply ( lu [ i ] [ col ] ) ) ; } } for ( int col = m - 1 ; col >= 0 ; col -- ) { bp [ col ] = bp [ col ] . divide ( lu [ col ] [ col ] ) ; final T bpCol = bp [ col ] ; for ( int i = 0 ; i < col ; i ++ ) { bp [ i ] = bp [ i ] . subtract ( bpCol . multiply ( lu [ i ] [ col ] ) ) ; } } return new ArrayFieldVector < T > ( bp , false ) ; }

Resolver la ecuación lineal a y veces;X = B. <P> La matriz A está implícita aquí.Es </ p>


public Builder withRationaleDialogMsg  ( @ StringRes int rationaleMsgRes ) { buildObj . rationaleDialogMsgRes = rationaleMsgRes ; buildObj . showRationaleDialog = true ; return this ; }

Establece el mensaje de diálogo Justifica


private boolean canAddTask  ( ) { return tCur == null ; }

Devuelve si la cola de tareas no está llena.


public CommitPreparedTransactionSpaceOperationRequest ( ) { }


public static String loadFileToString  ( String sFilename ) { StringBuffer sb = new StringBuffer ( ) ; try { BufferedReader in = new BufferedReader ( new FileReader ( sFilename ) ) ; String line ; while ( ( line = in . readLine ( ) ) != null ) { sb . append ( line ) ; } in . close ( ) ; } catch ( Exception e ) { System . err . println ( "Coult not load file:" + sFilename ) ; e . printStackTrace ( System . err ) ; } return sb . toString ( ) ; }

Carga los contenidos de un archivo en una cadena, <i> sin preservar las nuevas líneas </ i>.


public static void writeLines  ( File file , String encoding , Collection < ? > lines , boolean append ) throws IOException { writeLines ( file , encoding , lines , null , append ) ; }

Escribe el valor <código> TOSTRING () </ CODE> de cada elemento en una colección en el archivo <codigo> especificado </ código> línea por línea, opcionalmente anexar.Se utilizará la codificación de carácter especificada y la finalización de línea predeterminada.


public static final void fillPolygon  ( GL2 gl , Polygon p ) { RenderUtilities . fillPolygon ( gl , p . getVertices ( ) ) ; }


public boolean intersects  ( S2Cell cell ) { if ( isEmpty ( ) ) { return false ; } if ( contains ( cell . getCenter ( ) ) ) { return true ; } if ( cell . contains ( getCenter ( ) . toPoint ( ) ) ) { return true ; } if ( ! intersects ( cell . getRectBound ( ) ) ) { return false ; } S2Point [ ] cellV = new S2Point [ 4 ] ; S2LatLng [ ] cellLl = new S2LatLng [ 4 ] ; for ( int i = 0 ; i < 4 ; ++ i ) { cellV [ i ] = cell . getVertex ( i ) ; cellLl [ i ] = new S2LatLng ( cellV [ i ] ) ; if ( contains ( cellLl [ i ] ) ) { return true ; } } for ( int i = 0 ; i < 4 ; ++ i ) { S1Interval edgeLng = S1Interval . fromPointPair ( cellLl [ i ] . lng ( ) . radians ( ) , cellLl [ ( i + 1 ) & 3 ] . lng ( ) . radians ( ) ) ; if ( ! lng . intersects ( edgeLng ) ) { continue ; } final S2Point a = cellV [ i ] ; final S2Point b = cellV [ ( i + 1 ) & 3 ] ; if ( edgeLng . contains ( lng . lo ( ) ) ) { if ( intersectsLngEdge ( a , b , lat , lng . lo ( ) ) ) { return true ; } } if ( edgeLng . contains ( lng . hi ( ) ) ) { if ( intersectsLngEdge ( a , b , lat , lng . hi ( ) ) ) { return true ; } } if ( intersectsLatEdge ( a , b , lat . lo ( ) , lng ) ) { return true ; } if ( intersectsLatEdge ( a , b , lat . hi ( ) , lng ) ) { return true ; } } return false ; }

Devuelve VERDADERO si este rectángulo se cruza la celda dada.(Esta es una prueba exacta y puede ser bastante costosa, consulte también Mayintersters a continuación.)


protected void processBasicReport  ( SerialMessage serialMessage , int offset , int endpoint ) throws ZWaveSerialMessageException { int value = serialMessage . getMessagePayloadByte ( offset + 1 ) ; logger . debug ( String . format ( "NODE %d: Basic report, value = 0x%02X" , this . getNode ( ) . getNodeId ( ) , value ) ) ; ZWaveCommandClassValueEvent zEvent = new ZWaveCommandClassValueEvent ( this . getNode ( ) . getNodeId ( ) , endpoint , this . getCommandClass ( ) , value ) ; this . getController ( ) . notifyEventListeners ( zEvent ) ; }

Procesa un mensaje básico_report / básico_set.


public static final String concatGroups  ( Matcher matcher ) { StringBuilder b = new StringBuilder ( ) ; final int numGroups = matcher . groupCount ( ) ; for ( int i = 1 ; i <= numGroups ; i ++ ) { String s = matcher . group ( i ) ; if ( s != null ) { b . append ( s ) ; } } return b . toString ( ) ; }

Método de conveniencia para tomar todos los grupos que coinciden con nulos en un matador regex y devolverlos como una cadena concatenada.


private void sendBroadcastOperationFinished  ( Target target , RemoteOperation operation , RemoteOperationResult result ) { Intent intent = new Intent ( ACTION_OPERATION_FINISHED ) ; intent . putExtra ( EXTRA_RESULT , result ) ; if ( target . mAccount != null ) { intent . putExtra ( EXTRA_ACCOUNT , target . mAccount ) ; } else { intent . putExtra ( EXTRA_SERVER_URL , target . mServerUrl ) ; } sendStickyBroadcast ( intent ) ; }

Envía una transmisión local cuando una Operaciones finaliza para las actividades interesadas C una actualización de su vista, las transmisiones locales solo se entregan a las actividades en el mismo proceso.


public int addItemToEnd  ( String productId , BigDecimal amount , BigDecimal quantity , BigDecimal unitPrice , HashMap < String , GenericValue > features , HashMap < String , Object > attributes , String prodCatalogId , String itemType , ProductConfigWrapper configWrapper , LocalDispatcher dispatcher , Boolean triggerExternalOps , Boolean triggerPriceRules ) throws CartItemModifyException , ItemNotFoundException { return addItemToEnd ( ShoppingCartItem . makeItem ( null , productId , amount , quantity , unitPrice , null , null , null , null , null , features , attributes , prodCatalogId , configWrapper , itemType , null , dispatcher , this , triggerExternalOps , triggerPriceRules , null , Boolean . FALSE , Boolean . FALSE ) ) ; }

Agregue un artículo al carrito de compras.


@ SuppressWarnings ( "unchecked" ) public CompositeFileComparator ( Comparator < File > ... delegates ) { if ( delegates == null ) { this . delegates = ( Comparator < File > [ ] ) NO_COMPARATORS ; } else { this . delegates = ( Comparator < File > [ ] ) new Comparator < ? > [ delegates . length ] ; System . arraycopy ( delegates , 0 , this . delegates , 0 , delegates . length ) ; } }

Cree un comparador compuesto para el conjunto de comparadores de delegados.


public void adjustBeginLineColumn  ( int newLine , int newCol ) { int start = tokenBegin ; int len ; if ( bufpos >= tokenBegin ) { len = bufpos - tokenBegin + inBuf + 1 ; } else { len = bufsize - tokenBegin + bufpos + 1 + inBuf ; } int i = 0 , j = 0 , k = 0 ; int nextColDiff = 0 , columnDiff = 0 ; while ( i < len && bufline [ j = start % bufsize ] == bufline [ k = ++ start % bufsize ] ) { bufline [ j ] = newLine ; nextColDiff = columnDiff + bufcolumn [ k ] - bufcolumn [ j ] ; bufcolumn [ j ] = newCol + columnDiff ; columnDiff = nextColDiff ; i ++ ; } if ( i < len ) { bufline [ j ] = newLine ++ ; bufcolumn [ j ] = newCol + columnDiff ; while ( i ++ < len ) { if ( bufline [ j = start % bufsize ] != bufline [ ++ start % bufsize ] ) bufline [ j ] = newLine ++ ; else bufline [ j ] = newLine ; } } line = bufline [ j ] ; column = bufcolumn [ j ] ; }

Método para ajustar los números de línea y columna para el inicio de un token.


public void multLocal  ( float scalar ) { m00 *= scalar ; m01 *= scalar ; m02 *= scalar ; m03 *= scalar ; m10 *= scalar ; m11 *= scalar ; m12 *= scalar ; m13 *= scalar ; m20 *= scalar ; m21 *= scalar ; m22 *= scalar ; m23 *= scalar ; m30 *= scalar ; m31 *= scalar ; m32 *= scalar ; m33 *= scalar ; }

<CÓDIGO> MULT </ CODE> Multiplica esta matriz por un escalar.


boolean isOptimal  ( ) { final double [ ] objectiveFunctionRow = getRow ( 0 ) ; final int end = getRhsOffset ( ) ; for ( int i = getNumObjectiveFunctions ( ) ; i < end ; i ++ ) { final double entry = objectiveFunctionRow [ i ] ; if ( Precision . compareTo ( entry , 0d , epsilon ) < 0 ) { return false ; } } return true ; }

Devuelve si el problema está en un estado óptimo.


public String makeLinkFull  ( HttpServletRequest request , HttpServletResponse response , String url ) { return makeLink ( request , response , url , true , null , null ) ; }

Scipio: construye un enlace de ruta completa (HTTPS según sea necesario).


@ Override public void characters  ( XMLString text , Augmentations augs ) throws XNIException { if ( text . length == 0 ) { return ; } try { if ( fDocumentHandler != null ) { fDocumentHandler . characters ( text . ch , text . offset , text . length ) ; } if ( fContentHandler != null ) { fContentHandler . characters ( text . ch , text . offset , text . length ) ; } } catch ( SAXException e ) { throw new XNIException ( e ) ; } }


public ChangeSet removeFromCollection  ( String path , Serializable itemToRemove ) { return add ( new RemoveFromCollectionSpaceEntryMutator ( path , itemToRemove ) ) ; }

Elimina el artículo dado de una propiedad de colección.


public RemoteEventBusPacket ( ITemplateHolder templateHolder , RemoteEvent re , int TTL , NotifyContext notifyContext , boolean fromReplication ) { super ( ( OperationID ) null , templateHolder , null , 0 ) ; if ( re instanceof EntryArrivedRemoteEvent ) super . setOperationID ( ( ( EntryArrivedRemoteEvent ) re ) . getOperationID ( ) ) ; _remoteEvent = re ; _TTL = TTL ; _notifyContext = notifyContext ; _fromReplication = fromReplication ; }

Construya una instancia de evento remoto móvil, al instanciar un paquete de autobuses y adjuntarlo un evento remoto.


public void addAll  ( List < String > stringValues ) { for ( String stringValue : stringValues ) { add ( stringValue ) ; } }

Agregue todas las cuerdas en la lista a esta columna


public boolean forall  ( P2SetVisitor v ) { oldSet . forall ( v ) ; newSet . forall ( v ) ; return v . getReturnValue ( ) ; }

Llama al método de visita V en todos los nodos en este conjunto.


private void readObjectNoData  ( ) throws InvalidObjectException  { throw new InvalidObjectException ( "Permissions must be specified" ) ; }

Lanza una excepción para asegurar que se suministraran los datos para establecer el campo Permisos en una matriz vacía.


protected MarketEditAlbumQuery albumId  ( int value ) { return unsafeParam ( "album_id" , value ) ; }


public long size  ( ) { return sequence . values ( ) . stream ( ) . mapToInt ( null ) . sum ( ) ; }

Devuelve el número de eventos contiene en esta secuencia.


public PhotosImplementor ( PhotosModel model , PhotosView view ) { this . model = model ; this . view = view ; }


private static void start  ( Context context , Class < ? > daemonClazzName , int interval ) { String cmd = context . getDir ( BIN_DIR_NAME , Context . MODE_PRIVATE ) . getAbsolutePath ( ) + File . separator + DAEMON_BIN_NAME ; StringBuilder cmdBuilder = new StringBuilder ( ) ; cmdBuilder . append ( cmd ) ; cmdBuilder . append ( " -p " ) ; cmdBuilder . append ( context . getPackageName ( ) ) ; cmdBuilder . append ( " -s " ) ; cmdBuilder . append ( daemonClazzName . getName ( ) ) ; cmdBuilder . append ( " -t " ) ; cmdBuilder . append ( interval ) ; try { Runtime . getRuntime ( ) . exec ( cmdBuilder . toString ( ) ) . waitFor ( ) ; } catch ( IOException | InterruptedException e ) { Log . e ( TAG , "start daemon error: " + e . getMessage ( ) ) ; } }


public static void main  ( String [ ] args ) throws Exception { int maxHTTPThreadCount = 2 * Runtime . getRuntime ( ) . availableProcessors ( ) ; List < String > bindIPPorts = new ArrayList < > ( ) ; Path stateDir = Paths . get ( System . getProperty ( "user.home" ) , "lucene" , "server" ) ; for ( int i = 0 ; i < args . length ; i ++ ) { if ( args [ i ] . equals ( "-maxHTTPThreadCount" ) ) { if ( args . length == i + 1 ) { throw new IllegalArgumentException ( "no value specified after -maxHTTPThreadCount" ) ; } maxHTTPThreadCount = Integer . parseInt ( args [ i + 1 ] ) ; i ++ ; } else if ( args [ i ] . equals ( "-stateDir" ) ) { if ( args . length == i + 1 ) { throw new IllegalArgumentException ( "no value specified after -stateDir" ) ; } stateDir = Paths . get ( args [ i + 1 ] ) ; i ++ ; } else if ( args [ i ] . equals ( "-ipPort" ) ) { if ( args . length == i + 1 ) { throw new IllegalArgumentException ( "no value specified after -ipPort" ) ; } bindIPPorts . add ( args [ i + 1 ] ) ; i ++ ; } else { System . err . println ( "ERROR: unknown command line option " + args [ i ] ) ; usage ( ) ; System . exit ( - 1 ) ; } } if ( bindIPPorts . isEmpty ( ) ) { bindIPPorts . add ( "127.0.0.1:4000" ) ; } new Server ( "main" , stateDir , 50 , 10 , bindIPPorts ) . run ( new CountDownLatch ( 1 ) ) ; }


public void internalize  ( byte [ ] optionsArray ) { int pos = 4 ; byte code , length ; byte value [ ] ; while ( optionsArray [ pos ] != ( byte ) 255 ) { code = optionsArray [ pos ++ ] ; length = optionsArray [ pos ++ ] ; value = getArrayOption ( length , pos , optionsArray ) ; setOption ( code , value ) ; pos += length ; } }

Convierte una matriz de opciones de byte a una lista vinculada


public static void formatUid  ( PrintWriter pw , int uid ) { if ( uid < Process . FIRST_APPLICATION_UID ) { pw . print ( uid ) ; } else { pw . print ( 'u' ) ; pw . print ( getUserId ( uid ) ) ; final int appId = getAppId ( uid ) ; if ( appId >= FIRST_ISOLATED_UID && appId <= LAST_ISOLATED_UID ) { pw . print ( 'i' ) ; pw . print ( appId - FIRST_ISOLATED_UID ) ; } else if ( appId >= Process . FIRST_APPLICATION_UID ) { pw . print ( 'a' ) ; pw . print ( appId - Process . FIRST_APPLICATION_UID ) ; } else { pw . print ( 's' ) ; pw . print ( appId ) ; } } }

Generar una representación de texto del VUID, rompiendo sus componentes individuales: usuario, aplicación, aislado, etc.


public static void drawVerticalMarginIndicator  ( Graphics2D g , String text , int x , int y1 , int y2 ) { if ( y1 > y2 ) { int temp = y1 ; y1 = y2 ; y2 = temp ; } if ( text == null ) { g . drawLine ( x , y1 , x , y2 ) ; g . drawLine ( x , y1 , x - CONNECTION_ARROW_SIZE , y1 + CONNECTION_ARROW_SIZE ) ; g . drawLine ( x , y1 , x + CONNECTION_ARROW_SIZE , y1 + CONNECTION_ARROW_SIZE ) ; g . drawLine ( x , y2 , x - CONNECTION_ARROW_SIZE , y2 - CONNECTION_ARROW_SIZE ) ; g . drawLine ( x , y2 , x + CONNECTION_ARROW_SIZE , y2 - CONNECTION_ARROW_SIZE ) ; return ; } Canvas c = new Canvas ( ) ; FontMetrics fm = c . getFontMetrics ( sFont ) ; g . setFont ( sFont ) ; int padding = 4 ; Rectangle2D bounds = fm . getStringBounds ( text , g ) ; int th = ( int ) bounds . getHeight ( ) ; int offset = 3 * CONNECTION_ARROW_SIZE ; int h = ( ( y2 - y1 ) - ( th + 2 * padding ) ) / 2 ; if ( h <= padding ) { g . drawLine ( x , y1 , x , y2 ) ; g . drawString ( text , ( int ) ( x - bounds . getWidth ( ) / 2 ) + offset , y2 - h - padding ) ; g . drawLine ( x - CONNECTION_ARROW_SIZE , y1 , x + CONNECTION_ARROW_SIZE , y1 ) ; g . drawLine ( x - CONNECTION_ARROW_SIZE , y2 , x + CONNECTION_ARROW_SIZE , y2 ) ; } else { g . drawLine ( x , y1 , x , y1 + h ) ; g . drawLine ( x , y2 - h , x , y2 ) ; g . drawString ( text , ( int ) ( x - bounds . getWidth ( ) / 2 ) , y2 - h - padding ) ; g . drawLine ( x , y1 , x - CONNECTION_ARROW_SIZE , y1 + CONNECTION_ARROW_SIZE ) ; g . drawLine ( x , y1 , x + CONNECTION_ARROW_SIZE , y1 + CONNECTION_ARROW_SIZE ) ; g . drawLine ( x , y2 , x - CONNECTION_ARROW_SIZE , y2 - CONNECTION_ARROW_SIZE ) ; g . drawLine ( x , y2 , x + CONNECTION_ARROW_SIZE , y2 - CONNECTION_ARROW_SIZE ) ; } }

Función de utilidad para dibujar un indicador de margen vertical.


Node matchNodeOrParent  ( Node node ) { if ( fCurrentNode == null ) return null ; for ( Node n = fCurrentNode ; n != fRoot ; n = n . getParentNode ( ) ) { if ( node == n ) return n ; } return null ; }

Nodo de retorno, si coincide con o cualquier padre si coincide.


public void internalTransform  ( Body b , String phaseName , Map < String , String > options ) { JimpleBody body = ( JimpleBody ) b ; if ( Options . v ( ) . verbose ( ) ) G . v ( ) . out . println ( "[" + body . getMethod ( ) . getName ( ) + "] Folding Jimple constructors..." ) ; Analysis analysis = new Analysis ( new BriefUnitGraph ( body ) ) ; Chain < Unit > units = body . getUnits ( ) ; List < Unit > stmtList = new ArrayList < Unit > ( ) ; stmtList . addAll ( units ) ; for ( Unit u : stmtList ) { Stmt s = ( Stmt ) u ; if ( isCopy ( s ) ) continue ; if ( isConstructor ( s ) ) continue ; Fact before = analysis . getFlowBefore ( s ) ; for ( ValueBox usebox : s . getUseBoxes ( ) ) { Value value = usebox . getValue ( ) ; if ( ! ( value instanceof Local ) ) continue ; Local local = ( Local ) value ; if ( before . get ( local ) != null ) throw new RuntimeException ( "Use of an unitialized value " + "before constructor call; are you sure this " + "bytecode is verifiable?\n" + s ) ; } } for ( Unit u : stmtList ) { Stmt s = ( Stmt ) u ; if ( isNew ( s ) ) { units . remove ( s ) ; } } for ( Unit u : stmtList ) { Stmt s = ( Stmt ) u ; Fact before = analysis . getFlowBefore ( s ) ; Fact after = analysis . getFlowAfter ( s ) ; if ( isCopy ( s ) ) { Stmt newStmt = before . get ( rhsLocal ( s ) ) ; if ( newStmt != null ) units . remove ( s ) ; } else if ( after . alloc ( ) != null ) { Stmt newStmt = before . get ( base ( s ) ) ; setBase ( s , lhsLocal ( newStmt ) ) ; units . insertBefore ( newStmt , s ) ; for ( Local l : before . get ( newStmt ) ) { if ( l . equals ( base ( s ) ) ) continue ; units . insertAfter ( Jimple . v ( ) . newAssignStmt ( l , base ( s ) ) , s ) ; } } } }

Este método empuja a todos los NewExpr hacia abajo para ser el STMT directamente antes de cada invocación del inicio


public CM_MAC_ADDRESS ( int opcode , State state , State ... restStates ) { super ( opcode , state , restStates ) ; }

Construye nueva instancia de <tt> cm_mac_address </ tt> Packet


private String printEFormat  ( double x ) { if ( conversionCharacter == 'e' ) return eFormatString ( x , 'e' ) ; else return eFormatString ( x , 'E' ) ; }

Método de formato para el carácter de conversión E o E.


@ Override public void startElement  ( String name , AttributeList atts ) throws SAXException { if ( abandonHope ) { return ; } if ( saxParser == null ) { String prefix = "" ; if ( name . indexOf ( ':' ) > 0 ) { prefix = name . substring ( 0 , name . indexOf ( ':' ) ) ; } String localName = name ; if ( localName . indexOf ( ':' ) > 0 ) { localName = localName . substring ( localName . indexOf ( ':' ) + 1 ) ; } String namespaceURI = null ; if ( prefix . equals ( "" ) ) { namespaceURI = atts . getValue ( "xmlns" ) ; } else { namespaceURI = atts . getValue ( "xmlns:" + prefix ) ; } String saxParserClass = getCatalogParser ( namespaceURI , localName ) ; if ( saxParserClass == null ) { abandonHope = true ; if ( namespaceURI == null ) { debug . message ( 2 , "No Catalog parser for " + name ) ; } else { debug . message ( 2 , "No Catalog parser for " + "{" + namespaceURI + "}" + name ) ; } return ; } try { saxParser = ( SAXCatalogParser ) Class . forName ( saxParserClass , true , loader != null ? loader : this . getClass ( ) . getClassLoader ( ) ) . newInstance ( ) ; saxParser . setCatalog ( catalog ) ; saxParser . startDocument ( ) ; saxParser . startElement ( name , atts ) ; } catch ( ClassNotFoundException cnfe ) { saxParser = null ; abandonHope = true ; debug . message ( 2 , cnfe . toString ( ) ) ; } catch ( InstantiationException ie ) { saxParser = null ; abandonHope = true ; debug . message ( 2 , ie . toString ( ) ) ; } catch ( IllegalAccessException iae ) { saxParser = null ; abandonHope = true ; debug . message ( 2 , iae . toString ( ) ) ; } catch ( ClassCastException cce ) { saxParser = null ; abandonHope = true ; debug . message ( 2 , cce . toString ( ) ) ; } } else { saxParser . startElement ( name , atts ) ; } }

El método SAX <CODE> STARTELEMENT </ CODE>.<p /> <p> El analógico se selecciona en función del espacio de nombres del primer elemento encontrado en el catálogo. </ p>


public LeastSquaresBuilder maxEvaluations  ( final int newMaxEvaluations ) { this . maxEvaluations = newMaxEvaluations ; return this ; }


@ Override public boolean equals  ( Object other ) { if ( this == other ) { return true ; } if ( other == null || getClass ( ) != other . getClass ( ) ) { return false ; } DictionaryByteArrayWrapper otherObjectToCompare = ( DictionaryByteArrayWrapper ) other ; if ( data . length != otherObjectToCompare . data . length ) { return false ; } return ByteUtil . UnsafeComparer . INSTANCE . equals ( data , otherObjectToCompare . data ) ; }

Este método comparará 2 objetos de dictionarytEarrayWrapt.


public static int [ ] readInts  ( ) { return new In ( ) . readAllInts ( ) ; }

Lee todos los enteros de entrada estándar y los devuelve una matriz de enteros.


public void showContent  ( ) { switchState ( CONTENT , null , null , null , null , null , Collections . < Integer > emptyList ( ) ) ; }

Ocultar todos los demás estados y mostrar contenido.


public static String makeSafe  ( String s ) { return ( s == null ) ? "" : s ; }

Función auxiliar para hacer que las cuerdas nulas sean seguras para las comparaciones, etc.


public void resetPotentialWithRank  ( int rank , int chanceOnThirdLine ) { setPotentialByLine ( 0 , - rank ) ; setPotentialByLine ( 1 , - rank ) ; if ( getPotentialByLine ( 2 ) == 0 ) { setPotentialByLine ( 2 , ( Randomizer . nextInt ( 100 ) < chanceOnThirdLine ) ? - rank : 0 ) ; } else { setPotentialByLine ( 2 , - rank ) ; } }

Establece el potencial actual con un rango y la posibilidad determinada en una tercera línea.


public static boolean verifyPermissions  ( int ... grantResults ) { if ( grantResults . length == 0 ) { return false ; } for ( int result : grantResults ) { if ( result != PackageManager . PERMISSION_GRANTED ) { return false ; } } return true ; }

Cheques Se han otorgado todos los permisos dados.


public BpmResult ( final String errorMessage ) { success = false ; this . errorMessage = errorMessage ; }

Instanciate un bPMoperationResult de no éxito con un mensaje de error y un tipo de error.


@ deprecated public StringTokenizer ( String str , UnicodeSet delim , boolean returndelims , boolean coalescedelims ) { this . m_source_ = str ; this . m_length_ = str . length ( ) ; if ( delim == null ) { this . m_delimiters_ = EMPTY_DELIMITER_ ; } else { this . m_delimiters_ = delim ; } this . m_returnDelimiters_ = returndelims ; this . m_coalesceDelimiters_ = coalescedelims ; this . m_tokenOffset_ = - 1 ; this . m_tokenSize_ = - 1 ; if ( this . m_length_ == 0 ) { this . m_nextOffset_ = - 1 ; } else { this . m_nextOffset_ = 0 ; if ( ! returndelims ) { this . m_nextOffset_ = getNextNonDelimiter ( 0 ) ; } } }


@ Override public boolean hasFixedPropertiesArray  ( ) { return false ; }

Verdadero si el paquete de entrada tiene una matriz de propiedades fijas.


public boolean hasApiCapability  ( SerialMessageClass capability ) { return apiCapabilities . contains ( capability ) ; }

Comprueba si la API serie admite la capacidad dada.


public void collapse  ( DefaultMutableTreeNode v ) { if ( v == null ) v = ( DefaultMutableTreeNode ) fileTree . getModel ( ) . getRoot ( ) ; for ( Enumeration descendants = v . depthFirstEnumeration ( ) ; descendants . hasMoreElements ( ) ; ) { v = ( DefaultMutableTreeNode ) descendants . nextElement ( ) ; fileTree . collapsePath ( new TreePath ( v . getPath ( ) ) ) ; } }


La clase solo contiene métodos estáticos.


public static Zmat aib  ( Zutmat U , Zmat B ) throws JampackException { int i , j , k ; Z x = new Z ( ) ; U . getProperties ( ) ; B . getProperties ( ) ; if ( U . nr != U . nc ) throw new JampackException ( "Rectangular matrix." ) ; if ( U . nr != B . nr ) throw new JampackException ( "Inconsistent dimensions." ) ; Zmat X = new Zmat ( B ) ; for ( i = U . nr - 1 ; i >= 0 ; i -- ) for ( j = 0 ; j < B . nc ; j ++ ) { for ( k = i + 1 ; k < U . nc ; k ++ ) { X . re [ i ] [ j ] = X . re [ i ] [ j ] - U . re [ i ] [ k ] * X . re [ k ] [ j ] + U . im [ i ] [ k ] * X . im [ k ] [ j ] ; X . im [ i ] [ j ] = X . im [ i ] [ j ] - U . im [ i ] [ k ] * X . re [ k ] [ j ] - U . re [ i ] [ k ] * X . im [ k ] [ j ] ; } if ( U . re [ i ] [ i ] == 0.0 && U . im [ i ] [ i ] == 0.0 ) throw new JampackException ( "Zero diagonal in solving riangular system" ) ; X . put0 ( i , j , x . Div ( X . get0 ( i , j ) , U . get0 ( i , i ) ) ) ; } return X ; }

Soluciona UX = B, donde eres un zutmat yb es un zmat.


public LocalUnitPair ( Local local , Unit unit ) { this . local = local ; this . unit = unit ; }

Construye un Localunitpair de un objeto unitario y un objeto local.


public void updateXmlConfigEntry  ( String configEntry , String configValue ) throws IOException { String spaceConfigURL = JProperties . getURL ( getServiceName ( ) ) ; ReplaceInFileUtils updateFile = new ReplaceInFileUtils ( spaceConfigURL ) ; updateFile . xmlReplace ( configEntry , configValue ) ; updateFile . close ( ) ; }

Actualizar la entrada de configuración especificada.


private void replicateAndfreeCacheContextTxn  ( Context context , ServerTransaction transaction ) { try { replicateAndfreeCache ( context ) ; } catch ( RuntimeException ex ) { if ( _logger . isLoggable ( Level . SEVERE ) ) { _logger . log ( Level . SEVERE , "Failed to perform sync-replication on transactionId: " + transaction , ex ) ; } } }

Replicar y liberar el contexto de caché y registrar el error.


public CollectionsImplementor ( CollectionsModel model , CollectionsView view ) { this . model = model ; this . view = view ; }


@ Override public Histogram histogram  ( ) { return hist ; }

Devuelve el histograma que se aproxima a la distribución de unión de los valores de campo de los resultados de la consulta.


public Boolean isDirected  ( ) { return m_directed ; }

Indica si los bordes de este gráfico están dirigidos o no están dirigidos.


public void startValueScope  ( ) { fValuesCount = 0 ; for ( int i = 0 ; i < fFieldCount ; i ++ ) { fLocalValues [ i ] = null ; fLocalValueTypes [ i ] = 0 ; fLocalItemValueTypes [ i ] = null ; } }

Empezar el alcance de la tienda de valor.


public static SM_SYSTEM_MESSAGE STR_SKILL_SUCC_MoveBehindATK_A_TO_ME  ( String skillcaster , int num0 , String skillname ) { return new SM_SYSTEM_MESSAGE ( 1200685 , skillcaster , num0 , skillname ) ; }

[% Skillcaster] ha infligido% de daño NUM0 en usted mediante el uso de [% de habilidad].


public ProductConfigWrapperException ( String message ) { super ( message ) ; }

Crea una nueva instancia de ProductConfigWrapperException


public void assertContains  ( Predicate < HarEntry > predicate ) { assertThat ( trafficLogProvider . get ( ) , new TrafficLogContains ( Collections . singletonList ( predicate ) ) ) ; }

Verifica que el registro de tráfico contenga al menos una entrada que coincida con el predicado


public DocumentNGramDistroGraph mergeDistroGraph  ( DocumentNGramDistroGraph dgOtherGraph ) { EdgeCachedLocator ecLocator = new EdgeCachedLocator ( 10 ) ; DocumentNGramDistroGraph res = ( DocumentNGramDistroGraph ) clone ( ) ; for ( int iCurLvl = MinSize ; iCurLvl <= MaxSize ; iCurLvl ++ ) { UniqueVertexGraph gGraph = res . getGraphLevelByNGramSize ( iCurLvl ) ; UniqueVertexGraph gOtherGraph = dgOtherGraph . getGraphLevelByNGramSize ( iCurLvl ) ; if ( gOtherGraph == null ) continue ; java . util . Iterator iIter = gOtherGraph . getEdgeSet ( ) . iterator ( ) ; while ( iIter . hasNext ( ) ) { WeightedEdge weCurItem = ( WeightedEdge ) iIter . next ( ) ; String sHead = weCurItem . getVertexA ( ) . getLabel ( ) ; String sTail = weCurItem . getVertexB ( ) . getLabel ( ) ; WeightedEdge weMyCurItem = ( WeightedEdge ) ecLocator . locateDirectedEdgeInGraph ( gGraph , weCurItem . getVertexA ( ) , weCurItem . getVertexB ( ) ) ; if ( weMyCurItem == null ) { try { weMyCurItem = gGraph . addEdge ( weCurItem . getVertexA ( ) , weCurItem . getVertexB ( ) , weCurItem . getWeight ( ) ) ; ecLocator . addedEdge ( weMyCurItem ) ; } catch ( Exception ex ) { ex . printStackTrace ( System . err ) ; continue ; } } Distribution d1 = ( Distribution ) res . EdgeDistros . get ( weMyCurItem ) ; if ( d1 == null ) d1 = new Distribution ( ) ; Distribution d2 = ( Distribution ) dgOtherGraph . EdgeDistros . get ( weCurItem ) ; if ( d2 == null ) d2 = new Distribution ( ) ; res . EdgeDistros . put ( weMyCurItem , d2 . addTo ( d1 ) ) ; if ( weMyCurItem != null ) { double dWeight = weCurItem . getWeight ( ) + weMyCurItem . getWeight ( ) ; weMyCurItem . setWeight ( dWeight ) ; } } } return res ; }

TODO: Corrección combina los datos del gráfico de documentos [DGotherGraph] a los datos de este gráfico, agregando todos los bordes existentes y sumando los valores de histograma de las distribuciones de borde de ambos gráficos.El gráfico actual se modifica, convirtiéndose en el gráfico fusionado.


private void ensureTextSet  ( ) { if ( _text . limit ( ) == 0 ) { checkState ( _map != null , "Neither JSON text nor map has been set" ) ; _text . clear ( ) ; try { JsonHelper . writeJson ( new ByteBufferOutputStream ( _text ) , _map ) ; _text . flip ( ) ; } catch ( Exception e ) { if ( Iterables . tryFind ( Throwables . getCausalChain ( e ) , Predicates . instanceOf ( BufferOverflowException . class ) ) . isPresent ( ) ) { byte [ ] utf8 = JsonHelper . asUtf8Bytes ( _map ) ; _text = ByteBuffer . wrap ( utf8 ) ; } else { throw Throwables . propagate ( e ) ; } } } }

Asegura que el texto UTF-8 se haya establecido directamente o convirtiendo indirectamente el contenido del mapa a JSON.


public void apply  ( ) { assert useWeight ; String value = mWeight > 0 ? formatFloatAttribute ( mWeight ) : null ; component . setAttribute ( ANDROID_URI , ATTR_LAYOUT_WEIGHT , value ) ; if ( mClearWeights != null ) { for ( NlComponent n : mClearWeights ) { if ( getWeight ( n ) > 0.0f ) { n . setAttribute ( ANDROID_URI , ATTR_LAYOUT_WEIGHT , null ) ; } } } if ( mNewWeightSum > 0.0 ) { layout . setAttribute ( ANDROID_URI , ATTR_WEIGHT_SUM , formatFloatAttribute ( mNewWeightSum ) ) ; } }


public Access substituted  ( Collection < TypeVariable > original , List < TypeVariable > substitution ) { ASTNode$State state = state ( ) ; try { return ( Access ) cloneSubtree ( ) ; } finally { } }

Construye una copia de este nodo de acceso donde todas las apariciones de variables de tipo en la lista de parámetros de tipo original han sido reemplazadas por los parámetros del tipo de sustitución.


public static SM_SYSTEM_MESSAGE STR_SKILL_SUCC_Shield_PROTECT_A_to_B  ( String skilltarget , String skillcaster ) { return new SM_SYSTEM_MESSAGE ( 1201175 , skilltarget , skillcaster ) ; }

[% SkillTarget] Bloqueado [% Skillcaster] Ataque con el efecto protector de protección.


public static final MediaFormat createSubtitleFormat  ( String title , String language ) { MediaFormat format = new MediaFormat ( ) ; format . setString ( KEY_TITLE , title ) ; format . setString ( KEY_LANGUAGE , language ) ; return format ; }


protected void reportFatalError  ( String msgId , Object [ ] args ) throws XNIException { fErrorReporter . reportError ( XMLMessageFormatter . XML_DOMAIN , msgId , args , XMLErrorReporter . SEVERITY_FATAL_ERROR ) ; }

Función de conveniencia utilizada en todos los escáneres XML.


public NodeLinkTreeLayout ( String group ) { super ( group ) ; m_orientation = Constants . ORIENT_LEFT_RIGHT ; }

Crea un nuevo NodelinkTreelayout.Se asume una orientación de izquierda a derecha.


@ TargetApi ( Build . VERSION_CODES . KITKAT ) public void show  ( ) { if ( isShow ) return ; initTN ( ) ; try { show . invoke ( mTN ) ; } catch ( InvocationTargetException | IllegalAccessException e ) { e . printStackTrace ( ) ; } isShow = true ; if ( mDuration > LENGTH_ALWAYS ) { handler . postDelayed ( hideRunnable , mDuration * 1000 ) ; } }

Mostrar la vista para la duración especificada.


public JsonArrayRequest ( int method , String url , JSONArray jsonRequest , Listener < JSONArray > listener , ErrorListener errorListener ) { super ( method , url , ( jsonRequest == null ) ? null : jsonRequest . toString ( ) , listener , errorListener ) ; }


public static final void sort  ( int [ ] a , double [ ] b , int length ) { mergesort ( a , b , 0 , length - 1 ) ; }

Ordene dos matrices simultáneamente, utilizando el orden de clasificación de los valores en la primera matriz para determinar el orden de clasificación para ambas matrices.


public EntryClass ( Class clazz , EntryClass superclass ) throws MarshalException { name = clazz . getName ( ) ; this . superclass = superclass ; ClassMapper . EntryField [ ] fields = ClassMapper . getFields ( clazz ) ; numFields = fields . length ; computeHash ( fields ) ; }

Solo debe ser llamado por clase de clase


private Node namedItem  ( Element topLevel , String name ) { Node node ; Node result ; synchronized ( topLevel ) { node = topLevel . getFirstChild ( ) ; while ( node != null ) { if ( node instanceof Element ) { if ( collectionMatch ( ( Element ) node , name ) ) return node ; else if ( recurse ( ) ) { result = namedItem ( ( Element ) node , name ) ; if ( result != null ) return result ; } } node = node . getNextSibling ( ) ; } return node ; } }

La función recursiva devuelve un elemento de un tipo particular con el nombre especificado (<TT> ID </ TT> Atributo).


private void initParser  ( ) { catalogResolver = new CatalogResolver ( catalogManager ) ; SAXParserFactory spf = SAXParserFactory . newInstance ( ) ; spf . setNamespaceAware ( namespaceAware ) ; spf . setValidating ( validating ) ; try { saxParser = spf . newSAXParser ( ) ; parser = saxParser . getParser ( ) ; documentHandler = null ; dtdHandler = null ; } catch ( Exception ex ) { ex . printStackTrace ( ) ; } }


No se puede crear una nueva instancia de Ioutils.


public void abortIfRunning  ( ) { if ( mRunning ) { if ( ! mScroller . isFinished ( ) ) { mAbort = true ; mScroller . forceFinished ( true ) ; } finish ( ) ; mAbort = false ; } }


private static Entry [ ] delete  ( Entry [ ] attrs , int i ) { int len = attrs . length - 1 ; Entry [ ] nattrs = new Entry [ len ] ; System . arraycopy ( attrs , 0 , nattrs , 0 , i ) ; System . arraycopy ( attrs , i + 1 , nattrs , i , len - i ) ; return nattrs ; }

Devuelva una nueva matriz que contiene todo menos el elemento dado.


protected void drawDataSet  ( Canvas c , IRadarDataSet dataSet , int mostEntries ) { float phaseX = mAnimator . getPhaseX ( ) ; float phaseY = mAnimator . getPhaseY ( ) ; float sliceangle = mChart . getSliceAngle ( ) ; float factor = mChart . getFactor ( ) ; MPPointF center = mChart . getCenterOffsets ( ) ; MPPointF pOut = MPPointF . getInstance ( 0 , 0 ) ; Path surface = mDrawDataSetSurfacePathBuffer ; surface . reset ( ) ; boolean hasMovedToPoint = false ; for ( int j = 0 ; j < dataSet . getEntryCount ( ) ; j ++ ) { mRenderPaint . setColor ( dataSet . getColor ( j ) ) ; RadarEntry e = dataSet . getEntryForIndex ( j ) ; Utils . getPosition ( center , ( e . getY ( ) - mChart . getYChartMin ( ) ) * factor * phaseY , sliceangle * j * phaseX + mChart . getRotationAngle ( ) , pOut ) ; if ( Float . isNaN ( pOut . x ) ) continue ; if ( ! hasMovedToPoint ) { surface . moveTo ( pOut . x , pOut . y ) ; hasMovedToPoint = true ; } else surface . lineTo ( pOut . x , pOut . y ) ; } if ( dataSet . getEntryCount ( ) > mostEntries ) { surface . lineTo ( center . x , center . y ) ; } surface . close ( ) ; if ( dataSet . isDrawFilledEnabled ( ) ) { final Drawable drawable = dataSet . getFillDrawable ( ) ; if ( drawable != null ) { drawFilledPath ( c , surface , drawable ) ; } else { drawFilledPath ( c , surface , dataSet . getFillColor ( ) , dataSet . getFillAlpha ( ) ) ; } } mRenderPaint . setStrokeWidth ( dataSet . getLineWidth ( ) ) ; mRenderPaint . setStyle ( Paint . Style . STROKE ) ; if ( ! dataSet . isDrawFilledEnabled ( ) || dataSet . getFillAlpha ( ) < 255 ) c . drawPath ( surface , mRenderPaint ) ; MPPointF . recycleInstance ( center ) ; MPPointF . recycleInstance ( pOut ) ; }


void updateItem  ( Barcode barcode ) { mBarcode = barcode ; postInvalidate ( ) ; }

Actualiza la instancia de código de barras de la detección del marco más reciente.Invalida las partes relevantes de la superposición para activar un Redraw.


public EncounterResult encounterPokemon  ( ) throws LoginFailedException , RemoteServerException  { return AsyncHelper . toBlocking ( encounterPokemonAsync ( ) ) ; }


private synchronized void updateContainerXML  ( ) throws IOException , ParserConfigurationException  { synchronized ( _lock ) { if ( _containerEntry == null ) return ; } if ( m_ContainerFile != null && ! m_ContainerFile . exists ( ) ) { m_ContainerFile . createNewFile ( ) ; if ( _logger . isLoggable ( Level . FINE ) ) { _logger . fine ( "Created new " + m_ContainerFile + " XML file for " + _containerName + " container." ) ; } } DocumentBuilderFactory factory = DocumentBuilderFactory . newInstance ( ) ; DocumentBuilder builder = factory . newDocumentBuilder ( ) ; m_containerFileDocument = builder . newDocument ( ) ; m_rootContainerElement = m_containerFileDocument . createElement ( _containerName ) ; m_rootSpaceElement = m_containerFileDocument . createElement ( SPACE_TAG ) ; m_rootContainerElement . appendChild ( m_rootSpaceElement ) ; synchronized ( _lock ) { if ( _containerEntry != null ) updateContainerXMLTree ( _containerEntry . getName ( ) , _containerEntry . getSpaceAttributes ( ) ) ; } saveState ( ) ; }

Cree (si no existe) y actualice el contenedor XML, que contendrá todos los espacios presentes y sus atributos relevantes.


public Vector3f mult  ( Vector3f vec , Vector3f product ) { if ( null == product ) { product = new Vector3f ( ) ; } float x = vec . x ; float y = vec . y ; float z = vec . z ; product . x = m00 * x + m01 * y + m02 * z ; product . y = m10 * x + m11 * y + m12 * z ; product . z = m20 * x + m21 * y + m22 * z ; return product ; }

Multiplica esta matriz 3x3 por el vector VEC 1x3 y almacena el resultado en el producto.


public static boolean isUrl  ( String s ) { if ( isEmpty ( s ) ) return defaultEmptyOK ; if ( s . indexOf ( "://" ) != - 1 ) return true ; return false ; }

Isurl devuelve verdadero si la cadena contiene: //


public static JsonArray array  ( double ... values ) { if ( values == null ) { throw new NullPointerException ( "values is null" ) ; } JsonArray array = new JsonArray ( ) ; for ( double value : values ) { array . add ( value ) ; } return array ; }

Crea un nuevo JSONARRAY que contiene las representaciones de JSON de los valores dichos de doble </ código>.


public void insertEntry  ( Context context , IEntryHolder entryHolder , boolean origin , boolean shouldReplicate ) throws SAException { }

Inserta una nueva entrada al almacenamiento de SA.


public PlacesCheckinQuery latitude  ( Float value ) { return unsafeParam ( "latitude" , value ) ; }

Latitud geográfica del check-in, en grados (de "-90" a "90").


public void loadBcpFile  ( String bcpFilename , String delimiter , List < Attribute > attributes , String dateFormatString , IntSourceConnectionManager connectionManager , int sourceAttribute ) { loadBcpFile ( bcpFilename , delimiter , attributes , connectionManager , dateFormatString != null ? new SimpleDateFormat ( dateFormatString ) : null , sourceAttribute ) ; }

Carga el contenido de un archivo delimitado en una base de datos de prueba.


public void write  ( byte b [ ] , int off , int len ) { if ( len == 0 ) return ; ensureCapacity ( len ) ; System . arraycopy ( b , off , _buffer , _count , len ) ; _count += len ; }

Escribe <code> len </ code> bytes de la matriz de bytes especificada que comienza en offset <code> off </ code> a este flujo de salida de matriz de bytes.


public Builder cacheInMemory  ( ) { cacheInMemory = true ; return this ; }

La imagen cargada se almacenará en caché en la memoria.


public boolean isLeaf  ( ) { return this . left == null ; }

Devuelve VERDADERO si este nodo es un nodo de hoja.


public static synchronized void indexDocuments  ( Queue < CodeIndexDocument > codeIndexDocumentQueue ) throws IOException { Directory dir = FSDirectory . open ( Paths . get ( Properties . getProperties ( ) . getProperty ( Values . INDEXLOCATION , Values . DEFAULTINDEXLOCATION ) ) ) ; Directory facetsdir = FSDirectory . open ( Paths . get ( Properties . getProperties ( ) . getProperty ( Values . FACETSLOCATION , Values . DEFAULTFACETSLOCATION ) ) ) ; Analyzer analyzer = new CodeAnalyzer ( ) ; IndexWriterConfig iwc = new IndexWriterConfig ( analyzer ) ; FacetsConfig facetsConfig = new FacetsConfig ( ) ; SearchcodeLib scl = new SearchcodeLib ( ) ; iwc . setOpenMode ( IndexWriterConfig . OpenMode . CREATE_OR_APPEND ) ; IndexWriter writer = new IndexWriter ( dir , iwc ) ; TaxonomyWriter taxoWriter = new DirectoryTaxonomyWriter ( facetsdir ) ; try { CodeIndexDocument codeIndexDocument = codeIndexDocumentQueue . poll ( ) ; int count = 0 ; while ( codeIndexDocument != null ) { Singleton . getLogger ( ) . info ( "Indexing file " + codeIndexDocument . getRepoLocationRepoNameLocationFilename ( ) ) ; Singleton . decrementCodeIndexLinesCount ( codeIndexDocument . getCodeLines ( ) ) ; Document doc = new Document ( ) ; Field pathField = new StringField ( "path" , codeIndexDocument . getRepoLocationRepoNameLocationFilename ( ) , Field . Store . YES ) ; doc . add ( pathField ) ; facetsConfig = new FacetsConfig ( ) ; facetsConfig . setIndexFieldName ( Values . LANGUAGENAME , Values . LANGUAGENAME ) ; facetsConfig . setIndexFieldName ( Values . REPONAME , Values . REPONAME ) ; facetsConfig . setIndexFieldName ( Values . CODEOWNER , Values . CODEOWNER ) ; if ( Helpers . isNullEmptyOrWhitespace ( codeIndexDocument . getLanguageName ( ) ) == false ) { doc . add ( new SortedSetDocValuesFacetField ( Values . LANGUAGENAME , codeIndexDocument . getLanguageName ( ) ) ) ; } if ( Helpers . isNullEmptyOrWhitespace ( codeIndexDocument . getRepoName ( ) ) == false ) { doc . add ( new SortedSetDocValuesFacetField ( Values . REPONAME , codeIndexDocument . getRepoName ( ) ) ) ; } if ( Helpers . isNullEmptyOrWhitespace ( codeIndexDocument . getCodeOwner ( ) ) == false ) { doc . add ( new SortedSetDocValuesFacetField ( Values . CODEOWNER , codeIndexDocument . getCodeOwner ( ) ) ) ; } scl . addToSpellingCorrector ( codeIndexDocument . getContents ( ) ) ; StringBuilder indexContents = new StringBuilder ( ) ; indexContents . append ( codeIndexDocument . getFileName ( ) ) ; indexContents . append ( " " ) ; indexContents . append ( codeIndexDocument . getFileLocationFilename ( ) ) ; indexContents . append ( " " ) ; indexContents . append ( codeIndexDocument . getFileLocation ( ) ) ; indexContents . append ( scl . splitKeywords ( codeIndexDocument . getContents ( ) ) ) ; indexContents . append ( scl . codeCleanPipeline ( codeIndexDocument . getContents ( ) ) ) ; indexContents . append ( scl . findInterestingKeywords ( codeIndexDocument . getContents ( ) ) ) ; String toIndex = indexContents . toString ( ) . toLowerCase ( ) ; doc . add ( new TextField ( Values . REPONAME , codeIndexDocument . getRepoName ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . FILENAME , codeIndexDocument . getFileName ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . FILELOCATION , codeIndexDocument . getFileLocation ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . FILELOCATIONFILENAME , codeIndexDocument . getFileLocationFilename ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . MD5HASH , codeIndexDocument . getMd5hash ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . LANGUAGENAME , codeIndexDocument . getLanguageName ( ) , Field . Store . YES ) ) ; doc . add ( new IntField ( Values . CODELINES , codeIndexDocument . getCodeLines ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . CONTENTS , toIndex , Field . Store . NO ) ) ; doc . add ( new TextField ( Values . REPOLOCATION , codeIndexDocument . getRepoRemoteLocation ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . CODEOWNER , codeIndexDocument . getCodeOwner ( ) , Field . Store . YES ) ) ; doc . add ( new TextField ( Values . CODEID , codeIndexDocument . getHash ( ) , Field . Store . YES ) ) ; doc . add ( new LongField ( Values . MODIFIED , new Date ( ) . getTime ( ) , Field . Store . YES ) ) ; writer . updateDocument ( new Term ( Values . PATH , codeIndexDocument . getRepoLocationRepoNameLocationFilename ( ) ) , facetsConfig . build ( taxoWriter , doc ) ) ; count ++ ; if ( count >= 1000 ) { codeIndexDocument = null ; } else { codeIndexDocument = codeIndexDocumentQueue . poll ( ) ; } } } finally { try { writer . close ( ) ; } finally { taxoWriter . close ( ) ; } Singleton . getLogger ( ) . info ( "Closing writers" ) ; } }

Dada una cola de documentos para indexar, índicelos al apartar la cola limitada a 1000 artículos.Este método debe sincronizarse ya que no hemos agregado ninguna lógica para tratar con múltiples hilos escribiendo en el índice.TODO Investigue cómo Lucene trata con múltiples escrituras, TODO hace que el límite de 1000 configurable


public VideoAddToAlbumQuery albumIds  ( Integer ... value ) { return unsafeParam ( "album_ids" , value ) ; }


private static int decodeDigit  ( int [ ] counters ) throws NotFoundException  { float bestVariance = MAX_AVG_VARIANCE ; int bestMatch = - 1 ; int max = PATTERNS . length ; for ( int i = 0 ; i < max ; i ++ ) { int [ ] pattern = PATTERNS [ i ] ; float variance = patternMatchVariance ( counters , pattern , MAX_INDIVIDUAL_VARIANCE ) ; if ( variance < bestVariance ) { bestVariance = variance ; bestMatch = i ; } } if ( bestMatch >= 0 ) { return bestMatch ; } else { throw NotFoundException . getNotFoundInstance ( ) ; } }

Intenta decodificar una secuencia de líneas negras / blancas de ITF en un solo dígito.


private PollingUtil ( ) { throw new Error ( "Do not need instantiate!" ) ; }


public boolean canCausePartialRendering  ( ) { return ! myDryRun ; }

Si hay un error, ¿puede causar un proyecto que se representa parcialmente?


@ Deployment ( resources = { "org/activiti/engine/test/api/runtime/oneTaskProcess.bpmn20.xml" } ) public void testProcessDefinitionEvents  ( ) throws Exception  { ProcessDefinition processDefinition = repositoryService . createProcessDefinitionQuery ( ) . processDefinitionKey ( "oneTaskProcess" ) . singleResult ( ) ; assertNotNull ( processDefinition ) ; assertEquals ( 2 , listener . getEventsReceived ( ) . size ( ) ) ; assertTrue ( listener . getEventsReceived ( ) . get ( 0 ) instanceof ActivitiEntityEvent ) ; ActivitiEntityEvent event = ( ActivitiEntityEvent ) listener . getEventsReceived ( ) . get ( 0 ) ; assertEquals ( ActivitiEventType . ENTITY_CREATED , event . getType ( ) ) ; assertEquals ( processDefinition . getId ( ) , ( ( ProcessDefinition ) event . getEntity ( ) ) . getId ( ) ) ; event = ( ActivitiEntityEvent ) listener . getEventsReceived ( ) . get ( 1 ) ; assertEquals ( ActivitiEventType . ENTITY_INITIALIZED , event . getType ( ) ) ; assertEquals ( processDefinition . getId ( ) , ( ( ProcessDefinition ) event . getEntity ( ) ) . getId ( ) ) ; listener . clearEventsReceived ( ) ; repositoryService . setProcessDefinitionCategory ( processDefinition . getId ( ) , "test" ) ; assertEquals ( 1 , listener . getEventsReceived ( ) . size ( ) ) ; assertTrue ( listener . getEventsReceived ( ) . get ( 0 ) instanceof ActivitiEntityEvent ) ; event = ( ActivitiEntityEvent ) listener . getEventsReceived ( ) . get ( 0 ) ; assertEquals ( ActivitiEventType . ENTITY_UPDATED , event . getType ( ) ) ; assertEquals ( processDefinition . getId ( ) , ( ( ProcessDefinition ) event . getEntity ( ) ) . getId ( ) ) ; assertEquals ( "test" , ( ( ProcessDefinition ) event . getEntity ( ) ) . getCategory ( ) ) ; listener . clearEventsReceived ( ) ; repositoryService . suspendProcessDefinitionById ( processDefinition . getId ( ) ) ; repositoryService . activateProcessDefinitionById ( processDefinition . getId ( ) ) ; assertEquals ( 2 , listener . getEventsReceived ( ) . size ( ) ) ; event = ( ActivitiEntityEvent ) listener . getEventsReceived ( ) . get ( 0 ) ; assertEquals ( processDefinition . getId ( ) , ( ( ProcessDefinition ) event . getEntity ( ) ) . getId ( ) ) ; assertEquals ( ActivitiEventType . ENTITY_SUSPENDED , event . getType ( ) ) ; event = ( ActivitiEntityEvent ) listener . getEventsReceived ( ) . get ( 1 ) ; assertEquals ( ActivitiEventType . ENTITY_ACTIVATED , event . getType ( ) ) ; assertEquals ( processDefinition . getId ( ) , ( ( ProcessDefinition ) event . getEntity ( ) ) . getId ( ) ) ; listener . clearEventsReceived ( ) ; repositoryService . deleteDeployment ( processDefinition . getDeploymentId ( ) , true ) ; deploymentIdFromDeploymentAnnotation = null ; assertEquals ( 1 , listener . getEventsReceived ( ) . size ( ) ) ; assertTrue ( listener . getEventsReceived ( ) . get ( 0 ) instanceof ActivitiEntityEvent ) ; event = ( ActivitiEntityEvent ) listener . getEventsReceived ( ) . get ( 0 ) ; assertEquals ( ActivitiEventType . ENTITY_DELETED , event . getType ( ) ) ; assertEquals ( processDefinition . getId ( ) , ( ( ProcessDefinition ) event . getEntity ( ) ) . getId ( ) ) ; listener . clearEventsReceived ( ) ; }

Prueba Crear, actualizar y eliminar eventos de definiciones de proceso.


public VisibilityFilter ( Visualization vis , String group , Predicate p ) { super ( vis , group ) ; setPredicate ( p ) ; }


public WallPinQuery ( VkApiClient client , UserActor actor , int postId ) { super ( client , "wall.pin" , OkResponse . class ) ; accessToken ( actor . getAccessToken ( ) ) ; postId ( postId ) ; }

Crea una instancia abstractQueryBuilder que se puede usar para construir una solicitud API con varios parámetros


@ Override public int hashCode  ( ) { if ( _stubId != null ) return _stubId . hashCode ( ) ; return _part . hashCode ( ) ; }

Devuelva el <código> Hashcode </ Code> del Código Embedded <> TransactionParticipant </ Code>.


@ Override public int read  ( byte [ ] b ) throws IOException  { return read ( b , 0 , b . length ) ; }

Lea el número especificado de bytes en una matriz.


protected void dismissProgress  ( ) { if ( progress != null ) { progress . dismiss ( ) ; progress = null ; } }

Descartar y despejar el campo de diálogo de progreso.


public static AbstractStepperType createType  ( int stepType , StepperLayout stepperLayout ) { switch ( stepType ) { case AbstractStepperType . DOTS : return new DotsStepperType ( stepperLayout ) ; case AbstractStepperType . PROGRESS_BAR : return new ProgressBarStepperType ( stepperLayout ) ; case AbstractStepperType . TABS : return new TabsStepperType ( stepperLayout ) ; default : Log . e ( TAG , "Unsupported type: " + stepType ) ; throw new IllegalArgumentException ( "Unsupported type: " + stepType ) ; } }

Crea un tipo paso a paso para los argumentos proporcionados.


private void drawAsBarChart  ( Node v , NodeView nv , NodeData data ) { long count ; int [ ] array ; if ( scaleBy == ScaleBy . Summarized || v . getOutDegree ( ) == 0 ) { count = data . getCountSummarized ( ) ; array = data . getSummarized ( ) ; } else { count = data . getCountAssigned ( ) ; array = data . getAssigned ( ) ; } Point2D location = nv . getLocation ( ) ; Rectangle box = new Rectangle ( ) ; viewer . trans . w2d ( new Rectangle ( 0 , 0 , MainViewer . XSTEP , MainViewer . YSTEP ) , box ) ; int width ; if ( array . length <= 1 ) width = 30 ; else width = ( int ) ( 30.0 / array . length * ( Math . sqrt ( array . length ) ) ) ; box . setRect ( box . x , box . y , width , Math . min ( 2 * maxNodeHeight , box . height ) ) ; if ( location == null ) return ; Point apt = viewer . trans . w2d ( location ) ; if ( v . getOutDegree ( ) == 0 || count > 0 ) { nv . setShape ( NodeView . RECT_NODE ) ; nv . setWidth ( ( int ) Math . round ( ( array . length ) * box . getWidth ( ) ) ) ; nv . setHeight ( ( int ) Math . round ( box . getHeight ( ) ) ) ; } else { nv . setShape ( NodeView . OVAL_NODE ) ; nv . setWidth ( 1 ) ; nv . setHeight ( 1 ) ; } apt . x -= nv . getWidth ( ) >> 1 ; apt . y -= box . getHeight ( ) / 2 ; if ( data . getUpPValue ( ) >= 0 ) { gc . setColor ( pvalueColor ) ; Stroke oldStroke = gc . getStroke ( ) ; int leftWidth = getWidthForPValue ( data . getUpPValue ( ) ) ; gc . setStroke ( new BasicStroke ( leftWidth ) ) ; gc . drawLine ( apt . x - 1 , apt . y , apt . x - 1 , apt . y + nv . getHeight ( ) ) ; gc . setStroke ( oldStroke ) ; } if ( data . getDownPValue ( ) >= 0 ) { gc . setColor ( pvalueColor ) ; Stroke oldStroke = gc . getStroke ( ) ; int rightWidth = getWidthForPValue ( data . getDownPValue ( ) ) ; gc . setStroke ( new BasicStroke ( rightWidth ) ) ; gc . drawLine ( apt . x + nv . getWidth ( ) + 1 , apt . y , apt . x + nv . getWidth ( ) + 1 , apt . y + nv . getHeight ( ) ) ; gc . setStroke ( oldStroke ) ; } if ( v . getOutDegree ( ) == 0 || count > 0 ) { for ( int i = 0 ; i < array . length ; i ++ ) { gc . setColor ( Color . WHITE ) ; gc . fill ( new Rectangle2D . Double ( apt . x + i * box . getWidth ( ) , apt . y , box . getWidth ( ) , box . getHeight ( ) ) ) ; gc . setColor ( doc . getColorByIndex ( i ) ) ; double height = box . getHeight ( ) / ( double ) getMaxNodeHeight ( ) * getScaledSize ( array [ i ] ) ; gc . fill ( new Rectangle2D . Double ( apt . x + i * box . getWidth ( ) , apt . y + ( box . getHeight ( ) - height ) , box . getWidth ( ) , height ) ) ; gc . setColor ( Color . GRAY ) ; gc . draw ( new Rectangle2D . Double ( apt . x + i * box . getWidth ( ) , apt . y , box . getWidth ( ) , box . getHeight ( ) ) ) ; } } else nv . draw ( gc , viewer . trans ) ; }


@ Override public final void startGroup  ( Augmentations augs ) throws XNIException { ++ fDepth ; initializeContentModelStacks ( ) ; fMixed = false ; }

Un inicio de un modelo de contenido mixto o de niños.Un modelo de contenido mixto será seguido inmediatamente por una llamada al método <código> PCDATA () </ CODE>.Un modelo de contenido de niños contendrá grupos y / o elementos adicionales.


public static void e  ( String tag , String msg ) { if ( sLevel > LEVEL_ERROR ) { return ; } Log . e ( tag , msg ) ; }

Enviar un mensaje de registro de errores


public static void wtf  ( String tag , String msg ) { wtf ( tag , msg , null ) ; }

Imprime un mensaje en afirmación de prioridad.


private void moveRecords  ( Segment seg , ByteBuffer max , boolean deleteFromSource ) { checkWritesAllowed ( ) ; ByteBuffer from = seg . getMin ( ) ; ByteBuffer toExclusive = successor ( max ) ; int batchSize = scanBatchSize ( ) ; Iterator < List < ByteBuffer > > batchIter = Iterators . partition ( _dao . scanRecords ( seg . getDataId ( ) , from , toExclusive , batchSize , Integer . MAX_VALUE ) , batchSize ) ; while ( batchIter . hasNext ( ) ) { List < ByteBuffer > records = batchIter . next ( ) ; addAll ( records ) ; if ( deleteFromSource ) { _dao . prepareUpdate ( _name ) . deleteRecords ( seg . getDataId ( ) , records ) . execute ( ) ; } } seg . setMin ( toExclusive ) ; }

Mover / Copiar registros de segmento de un segmento que no se encuentra en el mapa de segmento a los segmentos que son.


public boolean initialiseAR  ( int videoWidth , int videoHeight , String cameraParaPath , int cameraIndex , boolean cameraIsFrontFacing ) { if ( ! initedNative ) { Log . e ( TAG , "Cannot initialise camera because native interface not inited." ) ; return false ; } this . frameWidth = videoWidth ; this . frameHeight = videoHeight ; this . cameraIndex = cameraIndex ; this . cameraIsFrontFacing = cameraIsFrontFacing ; if ( ! NativeInterface . arwStartRunning ( "-format=NV21" , cameraParaPath , 10.0f , 10000.0f ) ) { Log . e ( TAG , "Error starting video" ) ; return false ; } debugImageData = new byte [ frameWidth * frameHeight * 4 ] ; debugImageColors = new int [ frameWidth * frameHeight ] ; debugBitmap = Bitmap . createBitmap ( frameWidth , frameHeight , Bitmap . Config . ARGB_8888 ) ; return true ; }

Inicializa el ArtOolkit utilizando el tamaño de video especificado.


public void dispose  ( ) { FileUtil . delete ( myRootDir ) ; }

Elimina todos los directorios en esta estructura de archivos.


public double standardDeviation  ( boolean bOnlyValue ) { return Math . sqrt ( variance ( bOnlyValue ) ) ; }

Calcula la desviación estándar (raíz cuadrada de la varianza) de la distribución, ya sea para los valores solamente, o teniendo en cuenta las claves.


@ Override public boolean hasField  ( String fldName ) { return ss1 . hasField ( fldName ) || ss2 . hasField ( fldName ) ; }

Devuelve VERDADERO si el campo especificado se encuentra en cualquiera de las exploraciones subyacentes.


public void createEdgesConnecting  ( UniqueVertexGraph gGraph , String sStartNode , List lOtherNodes , HashMap hAppearenceHistogram ) { double dStartWeight = 0 ; double dIncreaseWeight = 0 ; if ( lOtherNodes != null ) if ( lOtherNodes . size ( ) == 0 ) { VertexImpl v = new VertexImpl ( ) ; v . setLabel ( sStartNode ) ; try { gGraph . add ( v ) ; } catch ( Exception e ) { e . printStackTrace ( ) ; } return ; } java . util . Iterator iIter = lOtherNodes . iterator ( ) ; Vertex vOldA = utils . locateVertexInGraph ( gGraph , sStartNode ) ; Vertex vA ; if ( vOldA != null ) vA = vOldA ; else { vA = new VertexImpl ( ) ; vA . setLabel ( sStartNode ) ; try { gGraph . add ( vA ) ; } catch ( Exception e ) { } } List lOldEdges ; lOldEdges = gGraph . getEdges ( vA ) ; int iCnt = 0 ; while ( iIter . hasNext ( ) ) { VertexImpl vB = new VertexImpl ( ) ; vB . setLabel ( ( String ) iIter . next ( ) ) ; double dOldWeight = 0 ; double dNewWeight = 0 ; dStartWeight = ScalingFunction ( Math . abs ( ++ iCnt - ( lOtherNodes . size ( ) / 2 ) ) ) ; dIncreaseWeight = dStartWeight ; if ( eclLocator == null ) eclLocator = new EdgeCachedLocator ( 10 ) ; WeightedEdge weCorrectEdge = ( WeightedEdge ) eclLocator . locateDirectedEdgeInGraph ( gGraph , vA , vB ) ; if ( weCorrectEdge == null ) dNewWeight = dStartWeight ; else { dOldWeight = weCorrectEdge . getWeight ( ) ; dNewWeight = dOldWeight + dIncreaseWeight ; } try { if ( weCorrectEdge == null ) { WeightedEdge e = gGraph . addEdge ( vA , vB , dNewWeight ) ; eclLocator . addedEdge ( e ) ; } else weCorrectEdge . setWeight ( dNewWeight ) ; } catch ( Exception e ) { e . printStackTrace ( ) ; } } }

Crea un borde en [GGRAPH] que conecta [SBASENODE] a cada nodo en la lista de nodos [LotherNodes].Si existe un borde, su peso se incrementa por [Peso de iInmease], de lo contrario, su peso está configurado en [ISTARTEWEY]


public Variance ( boolean isBiasCorrected ) { this ( new SecondMoment ( ) , true , isBiasCorrected ) ; }

Construye una variación con la propiedad <código> isbiascorrectecorecitection especificada.


public void removeFilter  ( JpaRepositoryFilter filter ) { filters . remove ( filter ) ; }


public void searchLf0InCartTree  ( HTSModel m , FeatureVector fv , FeatureDefinition featureDef , double uvthresh ) { for ( int s = 0 ; s < numStates ; s ++ ) { PdfLeafNode node = ( PdfLeafNode ) lf0Tree [ s ] . interpretToNode ( fv , 1 ) ; m . setLf0Mean ( s , node . getMean ( ) ) ; m . setLf0Variance ( s , node . getVariance ( ) ) ; if ( node . getVoicedWeight ( ) > uvthresh ) m . setVoiced ( s , true ) ; else m . setVoiced ( s , false ) ; } }

Búsquedas FV en el carro de LF0Tree [] Conjunto de árboles, por estado y llenan la información en el HTSMODEL M.


@ SuppressWarnings ( "unchecked" ) public JavaRDD < MapWritable > readData  ( ) throws IOException , PIRException  { logger . info ( "Reading data " ) ; JavaRDD < MapWritable > jsonRDD ; Job job = Job . getInstance ( ) ; String baseQuery = SystemConfiguration . getProperty ( "pir.baseQuery" ) ; String jobName = "pirSpark_base_" + baseQuery + "_" + System . currentTimeMillis ( ) ; job . setJobName ( jobName ) ; job . getConfiguration ( ) . setBoolean ( "mapreduce.input.fileinputformat.input.dir.recursive" , true ) ; job . getConfiguration ( ) . set ( "query" , baseQuery ) ; logger . debug ( "queryType = " + bVars . getQueryInfo ( ) . getQueryType ( ) ) ; logger . debug ( "QuerySchemaLoader.getSchemaNames().size() = " + QuerySchemaRegistry . getNames ( ) . size ( ) ) ; for ( String name : QuerySchemaRegistry . getNames ( ) ) { logger . debug ( "schemaName = " + name ) ; } job . getConfiguration ( ) . set ( "dataSchemaName" , qSchema . getDataSchemaName ( ) ) ; job . getConfiguration ( ) . set ( "data.schemas" , SystemConfiguration . getProperty ( "data.schemas" ) ) ; String classString = SystemConfiguration . getProperty ( "pir.baseInputFormat" ) ; Class < ? extends BaseInputFormat < Text , MapWritable > > inputClass ; try { inputClass = ( Class < ? extends BaseInputFormat < Text , MapWritable > > ) Class . forName ( classString ) ; } catch ( ClassNotFoundException | ClassCastException e ) { throw new PIRException ( classString + " cannot be instantiated or does not extend BaseInputFormat" , e ) ; } job . setInputFormatClass ( inputClass ) ; FileInputFormat . setInputPaths ( job , inputData ) ; jsonRDD = sc . newAPIHadoopRDD ( job . getConfiguration ( ) , inputClass , Text . class , MapWritable . class ) . values ( ) . coalesce ( numDataPartitions ) ; if ( qSchema . getFilter ( ) != null ) { return jsonRDD . filter ( new FilterData ( accum , bVars ) ) ; } else { logger . info ( "qSchema.getFilter() is null" ) ; return jsonRDD ; } }

Método para leer en los datos de un formato de entrada permitido, filtrar y devolver un RDD de los elementos de datos de MAPWRIBUTE


public static boolean hasAnnotationMirror  ( Element element , Class < ? extends Annotation > annotation , ProcessingEnvironment env ) { Elements elements = env . getElementUtils ( ) ; for ( AnnotationMirror annotationMirror : element . getAnnotationMirrors ( ) ) { if ( annotationMirror . getAnnotationType ( ) . asElement ( ) . equals ( elements . getTypeElement ( annotation . getCanonicalName ( ) ) ) ) { return true ; } } return false ; }

Devuelve la anotación especificada, NULL no existe.


void clearWeight  ( NlComponent n ) { if ( mClearWeights == null ) { mClearWeights = new ArrayList < NlComponent > ( ) ; } mClearWeights . add ( n ) ; }

Marca que el nodo dado debe limpiarse al aplicar el nuevo tamaño


private void correctErrors  ( byte [ ] codewordBytes , int numDataCodewords ) throws ChecksumException { int numCodewords = codewordBytes . length ; int [ ] codewordsInts = new int [ numCodewords ] ; for ( int i = 0 ; i < numCodewords ; i ++ ) { codewordsInts [ i ] = codewordBytes [ i ] & 0xFF ; } int numECCodewords = codewordBytes . length - numDataCodewords ; try { rsDecoder . decode ( codewordsInts , numECCodewords ) ; } catch ( ReedSolomonException ignored ) { throw ChecksumException . getChecksumInstance ( ) ; } for ( int i = 0 ; i < numDataCodewords ; i ++ ) { codewordBytes [ i ] = ( byte ) codewordsInts [ i ] ; } }

Dados los datos y los códigos de códigos de corrección de errores recibidos, posiblemente corrompidos por errores, intentos de corregir los errores en el lugar utilizando la corrección de errores de Reed-Solomon.


public void changed  ( DiscoveryEvent e ) { ServiceRegistrar [ ] proxys = e . getRegistrars ( ) ; Map groupsMap = e . getGroups ( ) ; HashMap changedGroupsMap = new HashMap ( proxys . length ) ; for ( int i = 0 ; i < proxys . length ; i ++ ) { synchronized ( discoveredSet ) { ProxyReg reg = findReg ( proxys [ i ] ) ; if ( reg != null ) { String [ ] newGroups = ( String [ ] ) groupsMap . get ( reg . proxy ) ; reg . setMemberGroups ( newGroups ) ; changedGroupsMap . put ( reg . proxy , newGroups ) ; } } } notifyListener ( changedGroupsMap , CHANGED ) ; }

Llamado por <CÓDIGO> LookupDiscovery </ Code> para enviar un evento modificado a este oyente cuando ese <código> lookupdiscovery </ code> ha determinado que los grupos miembros de un registrador previamente descubierto (Reg) han cambiado.Este método extrae y registra la información apropiada del evento modificado dado, y luego envía un evento modificado a los oyentes apropiados registrados con este <código> lookupdiscoverymanager </ code>.


@ Override public void renderLimitLines  ( Canvas c ) { List < LimitLine > limitLines = mXAxis . getLimitLines ( ) ; if ( limitLines == null || limitLines . size ( ) <= 0 ) return ; float [ ] position = mRenderLimitLinesBuffer ; position [ 0 ] = 0 ; position [ 1 ] = 0 ; for ( int i = 0 ; i < limitLines . size ( ) ; i ++ ) { LimitLine l = limitLines . get ( i ) ; if ( ! l . isEnabled ( ) ) continue ; position [ 0 ] = l . getLimit ( ) ; position [ 1 ] = 0.f ; mTrans . pointValuesToPixel ( position ) ; renderLimitLineLine ( c , l , position ) ; renderLimitLineLabel ( c , l , position , 2.f + l . getYOffset ( ) ) ; } }

Dibuja las limitaciones asociadas con este eje a la pantalla.


public int entries  ( ) { return m_entries ; }

Obtenga el número de entradas en el histograma.Esto debe corresponder a la cantidad de veces que se ha utilizado el método de llenado.


private void addInsertionsToAlignment  ( SortedMap < Integer , Collection < Pair < Integer , String > > > pos2Insertions , Alignment alignment , ProgressListener progressListener ) throws CanceledException { if ( alignment . getReference ( ) . getLength ( ) > 0 ) { Lane reference = alignment . getReference ( ) ; int offset = 0 ; for ( Integer col : pos2Insertions . keySet ( ) ) { int maxInsertion = 0 ; Collection < Pair < Integer , String > > insertions = pos2Insertions . get ( col ) ; for ( Pair < Integer , String > pair : insertions ) { maxInsertion = Math . max ( maxInsertion , pair . getSecond ( ) . length ( ) ) ; } col += offset ; if ( maxInsertion > 0 ) { if ( col < reference . getLeadingGaps ( ) ) { reference . setLeadingGaps ( reference . getLeadingGaps ( ) + maxInsertion ) ; } else if ( col < reference . getLeadingGaps ( ) + reference . getBlock ( ) . length ( ) ) { int insertAfter = col - reference . getLeadingGaps ( ) ; reference . setBlock ( reference . getBlock ( ) . substring ( 0 , insertAfter + 1 ) + gaps ( maxInsertion ) + reference . getBlock ( ) . substring ( insertAfter + 1 , reference . getBlock ( ) . length ( ) ) ) ; } else if ( col > reference . getLeadingGaps ( ) + reference . getBlock ( ) . length ( ) ) { reference . setTrailingGaps ( reference . getTrailingGaps ( ) + maxInsertion ) ; } offset += maxInsertion ; } for ( int i = col + 1 ; i < col + maxInsertion + 1 ; i ++ ) { alignment . getInsertionsIntoReference ( ) . add ( i ) ; } progressListener . checkForCancel ( ) ; } } if ( alignment . getNumberOfSequences ( ) > 0 ) { for ( int row = 0 ; row < alignment . getNumberOfSequences ( ) ; row ++ ) { alignment . getLane ( row ) . setBlock ( alignment . getLane ( row ) . getBlock ( ) . toUpperCase ( ) ) ; } int offset = 0 ; for ( Integer col : pos2Insertions . keySet ( ) ) { int maxInsertion = 0 ; Collection < Pair < Integer , String > > insertions = pos2Insertions . get ( col ) ; for ( Pair < Integer , String > pair : insertions ) { maxInsertion = Math . max ( maxInsertion , pair . getSecond ( ) . length ( ) ) ; } col += offset ; if ( maxInsertion > 0 ) { Set < Integer > seen = new HashSet < > ( ) ; for ( Pair < Integer , String > pair : insertions ) { int row = pair . getFirst ( ) ; seen . add ( row ) ; String insert = pair . getSecond ( ) ; Lane lane = alignment . getLane ( row ) ; if ( col < lane . getLeadingGaps ( ) ) { lane . setLeadingGaps ( lane . getLeadingGaps ( ) + maxInsertion ) ; } else if ( col < lane . getLeadingGaps ( ) + lane . getBlock ( ) . length ( ) ) { int insertAfter = col - lane . getLeadingGaps ( ) ; lane . setBlock ( lane . getBlock ( ) . substring ( 0 , insertAfter + 1 ) + insert . toLowerCase ( ) + gaps ( maxInsertion - insert . length ( ) ) + lane . getBlock ( ) . substring ( insertAfter + 1 , lane . getBlock ( ) . length ( ) ) ) ; } else if ( col > lane . getLeadingGaps ( ) + lane . getBlock ( ) . length ( ) ) { lane . setTrailingGaps ( lane . getTrailingGaps ( ) + maxInsertion ) ; } } for ( int row = 0 ; row < alignment . getNumberOfSequences ( ) ; row ++ ) { if ( ! seen . contains ( row ) ) { Lane lane = alignment . getLane ( row ) ; if ( col < lane . getLeadingGaps ( ) ) { lane . setLeadingGaps ( lane . getLeadingGaps ( ) + maxInsertion ) ; } else if ( col < lane . getLeadingGaps ( ) + lane . getBlock ( ) . length ( ) ) { int insertAfter = col - lane . getLeadingGaps ( ) ; lane . setBlock ( lane . getBlock ( ) . substring ( 0 , insertAfter + 1 ) + gaps ( maxInsertion ) + lane . getBlock ( ) . substring ( insertAfter + 1 , lane . getBlock ( ) . length ( ) ) ) ; } else if ( col > lane . getLeadingGaps ( ) + lane . getBlock ( ) . length ( ) ) { lane . setTrailingGaps ( lane . getTrailingGaps ( ) + maxInsertion ) ; } } } offset += maxInsertion ; } progressListener . checkForCancel ( ) ; } } }

Añadir las inserciones dadas a la alineación.


private void loadLabelText  ( JLabel component , String text ) { StringBuffer result = new StringBuffer ( ) ; boolean haveMnemonic = false ; char mnemonic = '\0' ; int mnemonicIndex = - 1 ; for ( int i = 0 ; i < text . length ( ) ; i ++ ) { if ( text . charAt ( i ) == '&' ) { i ++ ; if ( i == text . length ( ) ) { break ; } if ( ! haveMnemonic && text . charAt ( i ) != '&' ) { haveMnemonic = true ; mnemonic = text . charAt ( i ) ; mnemonicIndex = result . length ( ) ; } } result . append ( text . charAt ( i ) ) ; } component . setText ( result . toString ( ) ) ; if ( haveMnemonic ) { component . setDisplayedMnemonic ( mnemonic ) ; component . setDisplayedMnemonicIndex ( mnemonicIndex ) ; } }

Inicialmente generado por IntelliJ de un archivo. Forma, luego se registró.


public AuditLogEntry ( Calendar time , UserInfo user , AuditLogAction action ) { this ( time , user , action , null , null , null , null , null ) ; }


@ Override public long skip  ( long n ) throws IOException  { long bytesSkipped = fInputStream . skip ( n << 1 ) ; if ( ( bytesSkipped & 1 ) != 0 ) { int b = fInputStream . read ( ) ; if ( b == - 1 ) { expectedTwoBytes ( ) ; } ++ bytesSkipped ; } return bytesSkipped >> 1 ; }

Omitir personajes.Este método bloqueará hasta que se disponga de algunos caracteres, se produce un error de E / S, o se alcanza el extremo del flujo.


private int [ ] createPalette  ( ) { int [ ] palette = new int [ PALETTE_SIZE ] ; float [ ] hsv = new float [ 3 ] ; hsv [ 1 ] = hsv [ 2 ] = 1 ; for ( int i = 0 ; i < PALETTE_SIZE ; i ++ ) { hsv [ 0 ] = ( HUE_END - HUE_BEGIN ) * i / PALETTE_SIZE + HUE_BEGIN ; palette [ i ] = Color . HSVToColor ( hsv ) ; } return palette ; }

Pre-calcule una paleta que se utilizará para traducir entre la distancia de punto y el color RGB.


public TAC2008TopicFileSet ( String sTopicXMLFile , String sCorpusRootDir ) throws ParserConfigurationException , SAXException , IOException  { TopicFile = sTopicXMLFile ; CorpusDir = sCorpusRootDir ; DocumentBuilderFactory docBuilderFactory = DocumentBuilderFactory . newInstance ( ) ; DocumentBuilder docBuilder = docBuilderFactory . newDocumentBuilder ( ) ; TopicXMLDoc = docBuilder . parse ( new File ( sTopicXMLFile ) ) ; Categories = null ; TrainingFiles = null ; TestFiles = null ; }

Inicializa el conjunto de documentos, dado un archivo XML del tema TAC2008.


static Collection < ViewAnimationInfo > generate  ( int delta , boolean isSelected , @ NonNull RecyclerView . LayoutManager layoutManager , int centerViewPos , boolean isCollapsed ) { final List < ViewAnimationInfo > infoViews = new ArrayList < > ( ) ; View view ; int viewPosition ; ViewAnimationInfo info ; int isSelectedKoef ; int collapseKoef ; for ( int count = layoutManager . getChildCount ( ) , i = 0 ; i < count ; i ++ ) { view = layoutManager . getChildAt ( i ) ; viewPosition = layoutManager . getPosition ( view ) ; if ( viewPosition == centerViewPos ) { continue ; } info = new ViewAnimationInfo ( ) ; info . view = view ; info . startLeft = layoutManager . getDecoratedLeft ( view ) ; info . startRight = layoutManager . getDecoratedRight ( view ) ; info . top = layoutManager . getDecoratedTop ( view ) ; info . bottom = layoutManager . getDecoratedBottom ( view ) ; if ( viewPosition < centerViewPos ) { isSelectedKoef = isSelected ? - 1 : 1 ; collapseKoef = isCollapsed ? centerViewPos - viewPosition : 1 ; info . finishLeft = info . startLeft + delta * isSelectedKoef * collapseKoef ; info . finishRight = info . startRight + delta * isSelectedKoef * collapseKoef ; } else { isSelectedKoef = isSelected ? 1 : - 1 ; collapseKoef = isCollapsed ? viewPosition - centerViewPos : 1 ; info . finishLeft = info . startLeft + delta * isSelectedKoef * collapseKoef ; info . finishRight = info . startRight + delta * isSelectedKoef * collapseKoef ; } infoViews . add ( info ) ; } return infoViews ; }

Generar la colección para animaciones abiertas / cierres o turnos.


public static Experiment createExperimentWithRule  ( ) { Experiment experiment = ExperimentFactory . createExperiment ( ) ; experiment . rule = "(salary < 10000) && (state = 'VA')" ; return experiment ; }

Crea un experimento básico con los valores predeterminados requeridos y la regla de valor opcional.(¡NO ID NO ID!) Los valores son un nombre, la aplicación predeterminada, una hora de inicio y finalización, el porcentaje de muestreo (100%) y una regla simple.


private BpmResult logOnGoogleAuth  ( final LoginData loginData ) { OkHttpClient http ; CredentialProvider cp ; http = new OkHttpClient ( ) ; final String authCode = loginData . getToken ( ) ; final boolean saveAuth = config . getBool ( ConfigKey . LOGIN_SAVE_AUTH ) ; boolean shouldRefresh = false ; if ( loginData . isSavedToken ( ) && saveAuth ) { shouldRefresh = true ; } try { final GoogleUserCredentialProvider provider ; if ( shouldRefresh ) { provider = new GoogleUserCredentialProvider ( http , authCode ) ; } else { provider = new GoogleUserCredentialProvider ( http ) ; provider . login ( authCode ) ; } if ( provider . isTokenIdExpired ( ) ) { throw new LoginFailedException ( ) ; } cp = provider ; if ( saveAuth && ! shouldRefresh ) { config . setString ( ConfigKey . LOGIN_GOOGLE_AUTH_TOKEN , provider . getRefreshToken ( ) ) ; } else if ( ! saveAuth ) { deleteLoginData ( LoginType . GOOGLE_AUTH ) ; } } catch ( LoginFailedException | RemoteServerException e ) { deleteLoginData ( LoginType . GOOGLE_APP_PASSWORD ) ; return new BpmResult ( e . getMessage ( ) ) ; } try { prepareLogin ( cp , http ) ; return new BpmResult ( ) ; } catch ( LoginFailedException | RemoteServerException e ) { deleteLoginData ( LoginType . ALL ) ; return new BpmResult ( e . getMessage ( ) ) ; } }


@ SuppressWarnings ( { "unchecked" , "cast" } ) public LShiftExpr fullCopy  ( ) { LShiftExpr tree = ( LShiftExpr ) copy ( ) ; if ( children != null ) { for ( int i = 0 ; i < children . length ; ++ i ) { ASTNode child = ( ASTNode ) children [ i ] ; if ( child != null ) { child = child . fullCopy ( ) ; tree . setChild ( child , i ) ; } } } return tree ; }

Cree una copia profunda del subárbol AST en este nodo.La copia está colgando, es decir, no tiene padre.


@ Override public final void run  ( ) { boolean deadlock = false ; while ( ! deadlock ) { try { long [ ] ids = tmx . findDeadlockedThreads ( ) ; if ( ids != null ) { deadlock = true ; ThreadInfo [ ] tis = tmx . getThreadInfo ( ids , true , true ) ; String info = "DeadLock Found!\n" ; for ( ThreadInfo ti : tis ) { info += ti . toString ( ) ; } for ( ThreadInfo ti : tis ) { LockInfo [ ] locks = ti . getLockedSynchronizers ( ) ; MonitorInfo [ ] monitors = ti . getLockedMonitors ( ) ; if ( locks . length == 0 && monitors . length == 0 ) { continue ; } ThreadInfo dl = ti ; info += "Java-level deadlock:\n" ; info += "\t" + dl . getThreadName ( ) + " is waiting to lock " + dl . getLockInfo ( ) . toString ( ) + " which is held by " + dl . getLockOwnerName ( ) + "\n" ; while ( ( dl = tmx . getThreadInfo ( new long [ ] { dl . getLockOwnerId ( ) } , true , true ) [ 0 ] ) . getThreadId ( ) != ti . getThreadId ( ) ) { info += "\t" + dl . getThreadName ( ) + " is waiting to lock " + dl . getLockInfo ( ) . toString ( ) + " which is held by " + dl . getLockOwnerName ( ) + "\n" ; } } log . warn ( info ) ; if ( doWhenDL == RESTART ) { System . exit ( ExitCode . CODE_RESTART ) ; } } Thread . sleep ( sleepTime ) ; } catch ( Exception e ) { log . warn ( "DeadLockDetector: " + e , e ) ; } } }


private void calcAngles  ( ) { mDrawAngles = new float [ mData . getYValCount ( ) ] ; mAbsoluteAngles = new float [ mData . getYValCount ( ) ] ; float yValueSum = mData . getYValueSum ( ) ; List < IPieDataSet > dataSets = mData . getDataSets ( ) ; int cnt = 0 ; for ( int i = 0 ; i < mData . getDataSetCount ( ) ; i ++ ) { IPieDataSet set = dataSets . get ( i ) ; for ( int j = 0 ; j < set . getEntryCount ( ) ; j ++ ) { mDrawAngles [ cnt ] = calcAngle ( Math . abs ( set . getEntryForIndex ( j ) . getVal ( ) ) , yValueSum ) ; if ( cnt == 0 ) { mAbsoluteAngles [ cnt ] = mDrawAngles [ cnt ] ; } else { mAbsoluteAngles [ cnt ] = mAbsoluteAngles [ cnt - 1 ] + mDrawAngles [ cnt ] ; } cnt ++ ; } } }

Calcula los ángulos necesarios para las rodajas de gráficos.


protected void onPrepareRequest  ( HttpUriRequest request ) throws IOException { }

Llamado antes de que se ejecute la solicitud usando el HTTPClient subyacente.<p> sobrescribir en subclases para aumentar la solicitud. </ p>


protected void removeContainer  ( ) throws Throwable  { if ( containerId == null ) { return ; } sendDeleteContainerRequest ( ) ; waitForPropertyValue ( provisioningTaskLink , MockTaskState . class , "taskInfo.stage" , TaskState . TaskStage . FINISHED ) ; if ( ! isMockTarget ( ) ) { Thread . sleep ( 2000L ) ; } verifyContainerDoesNotExist ( containerId ) ; }

Retire el contenedor creado previamente utilizando CreateContainer ()


public static StorableActivityFence during  ( @ ActivityType int ... activityTypes ) { return new StorableActivityFence ( activityTypes , DURING_TYPE ) ; }

Crea una valla de actividad almacenable que será válida cuando el usuario está realizando una de las actividades dadas.


public float [ ] evaluate  ( DataFrame dataset ) { List < String > correctSequences = dataset . javaRDD ( ) . map ( new RowToStringFunction ( 1 ) ) . collect ( ) ; long beginTime = System . currentTimeMillis ( ) ; DataFrame output = cmmModel . transform ( dataset ) ; long endTime = System . currentTimeMillis ( ) ; if ( verbose ) { System . out . println ( " Number of sentences = " + correctSequences . size ( ) ) ; long duration = ( endTime - beginTime ) ; System . out . println ( "  Total tagging time = " + duration + " ms." ) ; System . out . println ( "Average tagging time = " + ( ( float ) duration ) / correctSequences . size ( ) + " ms." ) ; } List < String > automaticSequences = output . javaRDD ( ) . map ( new RowToStringFunction ( 1 ) ) . collect ( ) ; return Evaluator . evaluate ( automaticSequences , correctSequences ) ; }

Evalúa la exactitud de un modelo CMM en un marco de datos en oraciones etiquetadas.


@ Override public void updateFields  ( DataSourceAttributeListInterface attributeData ) { }


@ Override public boolean isEmpty  ( ) { return mSize <= 0 ; }

Devuelve verdadero si el mapa de matriz no contiene artículos.


private void doPostConfigurationOfProcessControlTags  ( ) { for ( Long key : getKeys ( ) ) { doPostDbLoading ( get ( key ) ) ; } }

Asegura que las etiquetas Viva, de estado y comunidad tengan la identificación del proceso establecida.


public void stopPreview  ( ) { if ( camera != null && previewing ) { camera . stopPreview ( ) ; previewCallback . setHandler ( null , 0 ) ; autoFocusCallback . setHandler ( null , 0 ) ; previewing = false ; } }

Le dice a la cámara que deje de dibujar marcos de vista previa.


public final char yycharat  ( int pos ) { return zzBuffer [ zzStartRead + pos ] ; }

Devuelve el personaje en la posición <tt> pos </ tt> del texto correspondiente.Es equivalente a YyText (). Charat (POS), pero más rápido


public WallGetByIdQueryWithExtended ( VkApiClient client , UserActor actor , String ... posts ) { super ( client , "wall.getById" , GetByIdExtendedResponse . class ) ; accessToken ( actor . getAccessToken ( ) ) ; posts ( posts ) ; extended ( true ) ; }

Crea una instancia abstractQueryBuilder que se puede usar para construir una solicitud API con varios parámetros


ConfigurationError ( String msg , Exception x )  { super ( msg ) ; this . exception = x ; }

Construya una nueva instancia con la cadena de detalles especificada y la excepción.


private void openLogFile  ( ) throws IOException  { try { close ( ) ; } catch ( IOException e ) { } logName = versionName ( logfilePrefix ) ; log = new RandomAccessFile ( logName , "rw" ) ; logFD = log . getFD ( ) ; if ( logBytes == 0 ) { format = FORMAT_PADDED ; writeInt ( log , MAGIC ) ; writeInt ( log , format ) ; logBytes = ( intBytes + intBytes ) ; } else { log . seek ( logBytes ) ; } log . setLength ( logBytes ) ; log . write ( zeroBuf ) ; logFD . sync ( ) ; }

Abre el archivo de registro de actualización incremental en modo lectura / escritura.Si no existe el archivo, se crea.


public static CanFollow fromSnippets  ( KindredSnippets [ ] snippets ) { for ( KindredSnippets obj : snippets ) { if ( obj instanceof CanFollow ) { return ( CanFollow ) obj ; } } return null ; }

Encuentra el fragmento de canje en los fragmentos.


int positionEnd  ( ) { return positionStart + itemCount ; }

Devuelve el índice uno más allá del último elemento en el rango afectado.


public static User createFromJSONString  ( String json ) { return new GsonBuilder ( ) . create ( ) . fromJson ( json , User . class ) ; }


public String prototype  ( cp_info constant_pool [ ] ) { CONSTANT_Utf8_info cm , dm ; String s ; cm = ( CONSTANT_Utf8_info ) ( constant_pool [ name_index ] ) ; dm = ( CONSTANT_Utf8_info ) ( constant_pool [ descriptor_index ] ) ; s = ClassFile . access_string ( access_flags , " " ) ; if ( s . compareTo ( "" ) != 0 ) s = s + " " ; return s + ClassFile . parseDesc ( dm . convert ( ) , "" ) + " " + cm . convert ( ) ; }


public void delete  ( final PutFlags ... f ) { if ( SHOULD_CHECK ) { checkNotClosed ( ) ; txn . checkReady ( ) ; txn . checkWritesAllowed ( ) ; } final int flags = mask ( f ) ; checkRc ( LIB . mdb_cursor_del ( ptrCursor , flags ) ) ; }

Eliminar teclas de corriente / par de datos.<P> Esta función elimina la tecla / pareja de datos a la que se refiere el cursor.


@ Override public final void processValues  ( final DataTagValueUpdate dataTagValueUpdate ) throws JMSException { if ( LOGGER . isDebugEnabled ( ) ) { LOGGER . debug ( "entering processValues()..." ) ; } if ( this . isEnabled ) { SourceDataTagValue sdtValue = ( SourceDataTagValue ) dataTagValueUpdate . getValues ( ) . iterator ( ) . next ( ) ; jmsTemplate . setPriority ( sdtValue . getPriority ( ) ) ; jmsTemplate . setTimeToLive ( sdtValue . getTimeToLive ( ) ) ; if ( sdtValue . isGuaranteedDelivery ( ) ) { LOGGER . debug ( "\t sending PERSISTENT message" ) ; jmsTemplate . setDeliveryMode ( javax . jms . DeliveryMode . PERSISTENT ) ; } else { LOGGER . debug ( "\t sending NON-PERSISTENT message" ) ; jmsTemplate . setDeliveryMode ( javax . jms . DeliveryMode . NON_PERSISTENT ) ; } jmsTemplate . convertAndSend ( dataTagValueUpdate ) ; } else { LOGGER . debug ( "DAQ in test mode; not sending the value to JMS" ) ; } LOGGER . debug ( "leaving processValues()" ) ; }

Envíe la recopilación de actualizaciones utilizando la placa JMSTEMPLINE ActiveMQ.


public static Map < String , Object > alwaysNsfProcessor  ( DispatchContext dctx , Map < String , ? extends Object > context ) { Locale locale = ( Locale ) context . get ( "locale" ) ; Map < String , Object > result = ServiceUtil . returnSuccess ( ) ; BigDecimal processAmount = ( BigDecimal ) context . get ( "processAmount" ) ; Debug . logInfo ( "Test Processor NSF Credit Card" , module ) ; String refNum = UtilDateTime . nowAsString ( ) ; result . put ( "authResult" , Boolean . FALSE ) ; result . put ( "resultNsf" , Boolean . TRUE ) ; result . put ( "processAmount" , processAmount ) ; result . put ( "authRefNum" , refNum ) ; result . put ( "authAltRefNum" , refNum ) ; result . put ( "authFlag" , "N" ) ; result . put ( "authMessage" , UtilProperties . getMessage ( resource , "AccountingPaymentTestProcessor" , locale ) ) ; return result ; }

SIEMPRE NSF (no fondos suficientes) procesador


public final void writeLine  ( final IFallback object ) throws DataFallbackException { String str = object . toString ( ) ; try { output . write ( str ) ; output . newLine ( ) ; output . flush ( ) ; } catch ( IOException e ) { throw new DataFallbackException ( "writeLine() : An error has ocurred while trying to write in the " + getDataFile ( ) . getName ( ) + " file " + e . getMessage ( ) ) ; } if ( LOG . isDebugEnabled ( ) ) { LOG . debug ( "writeLine() - The object with id " + object . getId ( ) + " has been logged to the " + dataFile . getPath ( ) + " file" ) ; } }

Escribe un objeto en uno de los archivos de deformación.


public boolean isCritical  ( ) { return true ; }

¿Es este un comando crítico que solo se puede ejecutar cuando no se está ejecutando otro comando?


private static boolean ignoreUsage  ( UsageInfo usage ) { if ( usage . getReference ( ) instanceof GlobReference && usage instanceof SafeDeleteUsageInfo ) { PsiElement referencedElement = ( ( SafeDeleteUsageInfo ) usage ) . getReferencedElement ( ) ; PsiFileSystemItem file = ResolveUtil . asFileSystemItemSearch ( referencedElement ) ; String relativePath = getBlazePackageRelativePathToFile ( file ) ; if ( relativePath == null ) { return false ; } return ! ( ( GlobReference ) usage . getReference ( ) ) . matchesDirectly ( relativePath , file . isDirectory ( ) ) ; } return false ; }

Mantenemos globos que hacen referencia al archivo directamente (es decir, sin comodines), y eliminamos todas las referencias indirectas a los efectos de la acción 'Eliminar seguro'.


public boolean isGlobalScope  ( ) { return true ; }

Obtener alcance global en lugar de seleccionado