public int mouseDragged  ( int x , int y ) { if ( mMouseMode == MouseMode . SELECT ) { ConstraintWidget widget = mClickListener . mHitWidget ; if ( widget != null && widget . getParent ( ) instanceof ConstraintWidgetContainer ) { if ( ! mSelection . contains ( widget ) ) { if ( ! ( isShiftDown ( ) || isControlDown ( ) ) ) { mSelection . clear ( ) ; } mSelection . add ( widget ) ; } else if ( isControlDown ( ) ) { mSelection . remove ( widget ) ; } } if ( ! mSelection . isEmpty ( ) ) { mMouseMode = MouseMode . MOVE ; } } int directionLockedStatus = Selection . DIRECTION_UNLOCKED ; mLastMousePosition . setLocation ( x , y ) ; switch ( mMouseMode ) { case MOVE : { if ( ! mSelection . isEmpty ( ) ) { for ( Selection . Element selection : mSelection . getElements ( ) ) { boolean didResetAutoConnections = false ; for ( ConstraintAnchor anchor : selection . widget . getAnchors ( ) ) { if ( anchor . isConnected ( ) && anchor . getConnectionCreator ( ) == ConstraintAnchor . AUTO_CONSTRAINT_CREATOR ) { anchor . getOwner ( ) . resetAnchor ( anchor ) ; WidgetDecorator . getConstraintHandle ( anchor ) . stopLock ( ) ; didResetAutoConnections = true ; } } if ( didResetAutoConnections ) { mSelection . addModifiedWidget ( selection . widget ) ; } for ( ConstraintWidget widget : mWidgetsScene . getWidgets ( ) ) { widget . disconnectUnlockedWidget ( selection . widget ) ; mSelection . addModifiedWidget ( widget ) ; } } boolean snapPosition = mSelection . hasSingleElement ( ) ; if ( ! mSelection . hasSingleElement ( ) && mSelection . getSelectionBounds ( ) != null ) { Selection . Element bounds = mSelection . getSelectionBounds ( ) ; bounds . widget . setParent ( mWidgetsScene . getRoot ( ) ) ; directionLockedStatus = mWidgetMotion . dragWidget ( getStartPoint ( ) , bounds , x , y , true , isShiftDown ( ) , mViewTransform ) ; mSelection . updatePositionsFromBounds ( ) ; } else { for ( Selection . Element selection : mSelection . getElements ( ) ) { directionLockedStatus = mWidgetMotion . dragWidget ( getStartPoint ( ) , selection , x , y , snapPosition , isShiftDown ( ) , mViewTransform ) ; } } for ( Selection . Element selection : mSelection . getElements ( ) ) { mSelection . addModifiedWidget ( selection . widget ) ; } mSelection . fireContinuousChange ( ) ; } } break ; case RESIZE : { if ( mSelection . getSelectedResizeHandle ( ) != null ) { Selection . Element selection = mSelection . getFirstElement ( ) ; if ( mSelection . getSelectedResizeHandle ( ) != null && ! selection . widget . isRoot ( ) && ! selection . widget . isRootContainer ( ) ) { ArrayList < ConstraintWidget > widgetsToCheck = new ArrayList < ConstraintWidget > ( ) ; for ( ConstraintWidget w : mWidgetsScene . getWidgets ( ) ) { widgetsToCheck . add ( w ) ; } mWidgetResize . resizeWidget ( widgetsToCheck , selection . widget , mSelection . getSelectedResizeHandle ( ) , mSelection . getOriginalWidgetBounds ( ) , x , y ) ; mSelection . addModifiedWidget ( selection . widget ) ; } } } break ; case CONNECT : { if ( mSelection . getSelectedAnchor ( ) != null && mSelection . hasSingleElement ( ) ) { ConstraintWidget selectedWidget = mSelection . getFirstElement ( ) . widget ; mDragListener . populate ( ) ; mDragListener . find ( mViewTransform . getSwingFX ( getLastPoint ( ) . x ) , mViewTransform . getSwingFY ( getLastPoint ( ) . y ) ) ; ConstraintAnchor anchor = mDragListener . getConstraintAnchor ( ) ; if ( anchor != null && anchor != mSelection . getSelectedAnchor ( ) && mSelection . getSelectedAnchor ( ) . isValidConnection ( anchor ) && mSelection . getSelectedAnchor ( ) . isConnectionAllowed ( anchor . getOwner ( ) , anchor ) ) { if ( mSelection . getConnectionCandidateAnchor ( ) != anchor ) { if ( mSelection . getConnectionCandidateAnchor ( ) != null ) { if ( getSnapshot ( ) != null ) { getSnapshot ( ) . applyTo ( selectedWidget ) ; mSelection . addModifiedWidget ( selectedWidget ) ; } } mSelection . setConnectionCandidateAnchor ( anchor ) ; } if ( mSelection . getSelectedAnchor ( ) . getTarget ( ) != mSelection . getConnectionCandidateAnchor ( ) ) { int margin = 0 ; boolean useExistingDistance = ! mUseDefinedMargin ; if ( isControlDown ( ) ) { useExistingDistance = ! useExistingDistance ; } ConstraintHandle handle = WidgetInteractionTargets . constraintHandle ( mSelection . getSelectedAnchor ( ) ) ; ConstraintHandle handleTarget = WidgetInteractionTargets . constraintHandle ( mSelection . getConnectionCandidateAnchor ( ) ) ; int existingDistance = handle . getCreationMarginFrom ( handleTarget ) ; if ( useExistingDistance ) { margin = existingDistance ; } else { if ( existingDistance >= sMargin ) { margin = sMargin ; } } if ( handleTarget . getAnchor ( ) . getType ( ) == handle . getAnchor ( ) . getType ( ) ) { if ( handleTarget . getOwner ( ) . isRootContainer ( ) ) { margin = Math . max ( SnapPlacement . DEFAULT_MARGIN , margin ) ; } else { margin = 0 ; } } ConstraintAnchor . Strength strength = ConstraintAnchor . Strength . STRONG ; if ( isShiftDown ( ) ) { strength = ConstraintAnchor . Strength . WEAK ; } ConstraintWidget widget = mSelection . getSelectedAnchor ( ) . getOwner ( ) ; widget . connect ( mSelection . getSelectedAnchor ( ) , mSelection . getConnectionCandidateAnchor ( ) , margin , strength , ConstraintAnchor . USER_CREATOR ) ; mSelection . addModifiedWidget ( widget ) ; mSelection . setLastConnectedAnchor ( mSelection . getSelectedAnchor ( ) ) ; } } else { if ( mSelection . getConnectionCandidateAnchor ( ) != null ) { mSelection . setConnectionCandidateAnchor ( null ) ; if ( getSnapshot ( ) != null ) { getSnapshot ( ) . applyTo ( selectedWidget ) ; mSelection . addModifiedWidget ( selectedWidget ) ; } } } } } break ; } return directionLockedStatus ; }


public Iterator < E > iterator  ( E head , E tail ) { return new PatchingIterator ( innerChain , head , tail ) ; }

Devuelve un iterador sobre esta cadena, comenzando a la cabeza y alcanzando la cola (inclusive).


public static void checkRangeInclusive  ( double value , double lo , double hi ) { if ( value < lo || value > hi ) { throw new MathIllegalArgumentException ( LocalizedCoreFormats . OUT_OF_RANGE_SIMPLE , value , lo , hi ) ; } }

Comprueba que el valor dado está estrictamente dentro del rango [LO, HI].


public double averageSpeed  ( double seconds ) { long now = Minecraft . getSystemTime ( ) ; ListIterator < entry > it = _data . listIterator ( _data . size ( ) ) ; double out = 0 ; entry last = null ; int j = 0 ; while ( it . hasPrevious ( ) ) { entry i = it . previous ( ) ; if ( now - i . ts > seconds * 1000 ) break ; if ( last == null ) { last = i ; continue ; } j ++ ; double tdelta = ( .001 * ( last . ts - i . ts ) ) ; double ddelta = ( last . data . subtract ( i . data ) . lengthVector ( ) ) ; out = out + ddelta / tdelta ; } if ( j == 0 ) return out ; return out / j ; }

Obtenga la velocidad escaláquera promedio del dispositivo en el período de tiempo especificado.Devuelve m / s.


private void observeChangingBook  ( ) { Observable < Book > observable = bookRepository . observeChangingBooks ( ) . filter ( null ) . observeOn ( AndroidSchedulers . mainThread ( ) ) ; subscribe ( observable , null , null , null ) ; }

Ejemplo para suscribirse a observable, lo que emite muchos eventos.


public String name  ( ) { return name ; }

Devuelve el nombre de la meta que genera este método.


@ NonNull private List < String > mapObsoleteElements  ( List < String > names ) { List < String > elementsToRemove = new ArrayList < > ( names . size ( ) ) ; for ( String name : names ) { if ( name . startsWith ( "android" ) ) continue ; elementsToRemove . add ( name ) ; } return elementsToRemove ; }

Muestra todas las vistas que no comienzan con el espacio de nombres "Android".


public boolean bdd  ( ) { return soot . PhaseOptions . getBoolean ( options , "bdd" ) ; }

Utilice BDDS - Use la versión BDD de PADDLE.Causa Rema para usar versiones BDD de sus componentes.


public static byte [ ] toByteArray  ( URI uri ) throws IOException  { return IOUtils . toByteArray ( uri . toURL ( ) ) ; }

Obtenga los contenidos de un <código> URI </ CODE> como un byte [] </ código>.


private void noSuccessor  ( ) { if ( compute == FRAMES ) { Label l = new Label ( ) ; l . frame = new Frame ( ) ; l . frame . owner = l ; l . resolve ( this , code . length , code . data ) ; previousBlock . successor = l ; previousBlock = l ; } else { currentBlock . outputStackMax = maxStackSize ; } currentBlock = null ; }

Termina el bloque básico actual.Este método debe usarse en el caso donde el bloque básico actual no tenga ningún sucesor.


private boolean readLine  ( InputStream in , StringBuffer buf ) throws IOException { while ( true ) { int c = in . read ( ) ; if ( c < 0 ) return ( buf . length ( ) > 0 ) ; if ( c == '\r' ) { in . mark ( 1 ) ; c = in . read ( ) ; if ( c != '\n' ) in . reset ( ) ; return ( true ) ; } if ( c == '\n' ) return ( true ) ; buf . append ( ( char ) c ) ; } }


@ Override public void deleteObject  ( String sObjectName , String sObjectCategory ) { int index ; super . deleteObject ( sObjectName , sObjectCategory ) ; ArrayList < String > nlist = ( ArrayList < String > ) loadObject ( sObjectCategory , ListCategoryName ) ; index = nlist . indexOf ( sObjectName ) ; nlist . remove ( index ) ; super . saveObject ( nlist , sObjectCategory , ListCategoryName ) ; }


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

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


public JobRowFilter ( @ NotNull String filterQuery ) throws BadFilterException { LOG . trace ( "filterQuery: {}" , filterQuery ) ; Matcher tokenizedQuery = QUERY_PATTERN . matcher ( filterQuery ) ; if ( ! tokenizedQuery . matches ( ) ) { LOG . debug ( FILTER_INVALID . logFormat ( filterQuery ) ) ; throw new BadFilterException ( FILTER_INVALID . format ( filterQuery ) ) ; } jobField = extractJobField ( tokenizedQuery ) ; operation = extractOperation ( tokenizedQuery ) ; values = extractValues ( tokenizedQuery , filterQuery ) ; }

Analiza la consulta del filtro URL ApiJobStore y genera el objeto JobrowFilter.


@ Override public void scrollToTop  ( ) { view . scrollToTop ( ) ; }


@ Override public void insertData  ( int offset , String arg ) throws DOMException { throw new DOMException ( DOMException . NOT_SUPPORTED_ERR , "Method not supported" ) ; }

Inserte una cadena en el desplazamiento de la unidad de 16 bits especificado.


public boolean hasColumn  ( String columnName , int type , int size , boolean isNullable ) { ColumnInfo info = ( ColumnInfo ) this . columnsByName . get ( columnName . toUpperCase ( ) ) ; if ( info == null ) { info = ( ColumnInfo ) this . columnsByName . get ( columnName ) ; } if ( info != null ) { if ( info . isNullable ( ) != isNullable ) return false ; type = normalizeType ( type , - 1 ) ; int infoType = normalizeType ( info . getType ( ) , info . getSize ( ) ) ; if ( type == Types . VARCHAR && size != info . getSize ( ) ) { return false ; } if ( type == Types . DOUBLE && info . getType ( ) == Types . FLOAT ) { return info . getSize ( ) == 8 ; } if ( type == Types . DOUBLE && ( info . getType ( ) == Types . DECIMAL || info . getType ( ) == Types . NUMERIC ) ) { return true ; } if ( type == Types . BIGINT ) { return infoType == type || infoType == Types . NUMERIC ; } return infoType == type ; } return false ; }

¿La tabla tiene una columna que coincide con el nombre <código> </ código>, <Code> Tipo </ código>, <Código> Tamaño </ código> y <code> isAnullable </ code>?


public Iterator iterator  ( ) { return new COWIterator ( getArray ( ) , 0 ) ; }

Devuelve un iterador sobre los elementos en esta lista en la secuencia adecuada.<p> El iterador devuelto proporciona una instantánea del estado de la lista cuando se construyó el iterador.No se necesita sincronización al tiempo que atraviesa el iterador.El iterador lo hace <em> no </ em> admite el método <tt> eliminar </ tt>.


@ Override public final long readLong  ( ) { final int byte1 = bs . readByte ( ) ; final int byte2 = bs . readByte ( ) ; final int byte3 = bs . readByte ( ) ; final int byte4 = bs . readByte ( ) ; final long byte5 = bs . readByte ( ) ; final long byte6 = bs . readByte ( ) ; final long byte7 = bs . readByte ( ) ; final long byte8 = bs . readByte ( ) ; return ( long ) ( ( byte8 << 56 ) + ( byte7 << 48 ) + ( byte6 << 40 ) + ( byte5 << 32 ) + ( byte4 << 24 ) + ( byte3 << 16 ) + ( byte2 << 8 ) + byte1 ) ; }


public PartialUniqueIndex ( String indexName , Extractor [ ] extractors , int initialCapacity ) { this ( indexName , extractors , initialCapacity , DEFAULT_LOAD_FACTOR ) ; }

Construye un nuevo y vacío <tt> wealpool </ tt> con la capacidad inicial dada y el factor de carga predeterminado, que es <tt> 0.75 </ tt>.


private void waitOnMutateResourceOntology  ( String resourceTypeId ) { MindmapsGraph graph = Mindmaps . factory ( Mindmaps . DEFAULT_URI , keySpace ) . getGraph ( ) ; for ( int i = 0 ; i < numberOfOntologyChecks ; i ++ ) { boolean isOntologyComplete = true ; graph . rollback ( ) ; ResourceType resource = graph . getResourceType ( resourceTypeId ) ; if ( resource == null ) continue ; RoleType degreeOwner = graph . getRoleType ( GraqlType . HAS_RESOURCE_OWNER . getId ( resourceTypeId ) ) ; if ( degreeOwner == null ) continue ; RoleType degreeValue = graph . getRoleType ( GraqlType . HAS_RESOURCE_VALUE . getId ( resourceTypeId ) ) ; if ( degreeValue == null ) continue ; RelationType relationType = graph . getRelationType ( GraqlType . HAS_RESOURCE . getId ( resourceTypeId ) ) ; if ( relationType == null ) continue ; for ( String type : subtypes ) { Collection < RoleType > roles = graph . getType ( type ) . playsRoles ( ) ; if ( ! roles . contains ( degreeOwner ) ) { isOntologyComplete = false ; break ; } } if ( isOntologyComplete ) return ; } throw new RuntimeException ( ErrorMessage . ONTOLOGY_MUTATION . getMessage ( "Failed to confirm ontology is present after mutation." ) ) ; }

Asegura que la mutación de ontología realizada por análisis se vea persistiendo antes de continuar.En casos raros, como las máquinas subprocesas, o las personas con alto retraso al motor, la mutación de la ontología no se persiste a tiempo para que la tarea OLAP continúe.Este método obliga a los análisis a esperar y garantizar que la ontología se persiga antes de continuar.


public boolean isDragging  ( ) { return transferHandler . isDragging ( ) ; }

Cheques Si una operación de arrastre está sucediendo actualmente


public LeastSquaresBuilder target  ( final double [ ] newTarget ) { return target ( new ArrayRealVector ( newTarget , false ) ) ; }


public String geom_verify_name  ( ) { return soot . PhaseOptions . getString ( options , "geom-verify-name" ) ; }

Archivo de verificación - nombre de archivo para el archivo de verificación.Si desea comparar la precisión de los puntos: a los resultados con otros solucionadores (por ejemplo, PADDLE), puede usar el 'archivo de verificación' para especificar la lista de métodos (Formato de firma del método de hollín) que sean accesibles por ese solucionador.Durante las evaluaciones internas (consulte la opción Geom-Eal), solo consideramos los métodos que son comunes a ambos solucionadores.


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

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


public void disableSamples  ( Collection < String > sampleNames ) { int size = disabledSamples . size ( ) ; Set < String > newDisabled = new HashSet < > ( ) ; newDisabled . addAll ( disabledSamples ) ; newDisabled . addAll ( sampleNames ) ; if ( newDisabled . size ( ) != size ) { if ( originalData == null ) { originalData = new DataTable ( ) ; originalData . copy ( this ) ; } copyEnabled ( newDisabled , originalData ) ; disabledSamples . clear ( ) ; disabledSamples . addAll ( newDisabled ) ; } }


public DatabaseGetSchoolClassesQuery ( VkApiClient client ) { super ( client , "database.getSchoolClasses" , Utils . buildParametrizedType ( List . class , Utils . buildParametrizedType ( List . class , JsonObject . class ) ) ) ; }

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


public void sort  ( final Comparator < ? super T > comparator ) { Collections . sort ( this . data , comparator ) ; this . notifyItemRangeChanged ( 0 , this . getItemCount ( ) ) ; }

Ordena la lista dada con el comparador dado.El algoritmo es estable, lo que significa que los elementos iguales no se reordenan.


public void partitionWithPercent  ( boolean withPercent ) { this . withPercent = withPercent ; if ( withPercent ) chartUtils = ChartHelper . generateSimpleRadiusWithPercent ( chartData , ( int ) side ) ; else chartUtils = ChartHelper . generateSimpleRadius ( chartData , ( int ) side ) ; animateValue = - 1 ; invalidate ( ) ; }

Esta propiedad definirá el ancho de las particiones (igual o acc. Al porcentaje)


Collection < ? extends ClientRequestResult > handleCommandHandleRequest  ( final ClientRequest commandRequest ) { switch ( commandRequest . getResultType ( ) ) { case TRANSFER_COMMAND_HANDLES_LIST : return commandExecutionManager . processRequest ( commandRequest . getTagIds ( ) ) ; default : LOG . error ( "handleCommandHandleRequest() - Could not generate response message. Unknown enum ResultType " + commandRequest . getResultType ( ) ) ; } return null ; }

Método interno que maneja las solicitudes de CommandTagHandle


private static final UByte [ ] mkValues  ( ) { UByte [ ] ret = new UByte [ 256 ] ; for ( int i = Byte . MIN_VALUE ; i <= Byte . MAX_VALUE ; i ++ ) ret [ i & MAX_VALUE ] = new UByte ( ( byte ) i ) ; return ret ; }

Generar un valor en caché para cada valor de byte.


@ Override public int hashCode  ( ) { final int prime = 31 ; int result = 1 ; result = prime * result + ( ( getId ( ) == null ) ? 0 : getId ( ) . hashCode ( ) ) ; result = prime * result + ( ( getCatalogId ( ) == null ) ? 0 : getCatalogId ( ) . hashCode ( ) ) ; result = prime * result + ( ( getKey ( ) == null ) ? 0 : getKey ( ) . hashCode ( ) ) ; result = prime * result + ( ( getName ( ) == null ) ? 0 : getName ( ) . hashCode ( ) ) ; result = prime * result + ( ( getEnable ( ) == null ) ? 0 : getEnable ( ) . hashCode ( ) ) ; result = prime * result + ( ( getRemark ( ) == null ) ? 0 : getRemark ( ) . hashCode ( ) ) ; result = prime * result + ( ( getCreateBy ( ) == null ) ? 0 : getCreateBy ( ) . hashCode ( ) ) ; result = prime * result + ( ( getCreateTime ( ) == null ) ? 0 : getCreateTime ( ) . hashCode ( ) ) ; result = prime * result + ( ( getUpdateBy ( ) == null ) ? 0 : getUpdateBy ( ) . hashCode ( ) ) ; result = prime * result + ( ( getUpdateTime ( ) == null ) ? 0 : getUpdateTime ( ) . hashCode ( ) ) ; return result ; }

Este método fue generado por MyBatis Generator.Este método corresponde a la tabla de la base de datos SYS_DIC_INDEX


public Object [ ] copyRemaining  ( ) { return index <= args . length ? Arrays . copyOfRange ( args , index , args . length ) : new Object [ 0 ] ; }

Devuelve los argumentos desde la posición actual hasta el final de la lista de argumentos en una matriz recién asignada.<p> Si la posición actual está fuera de la lista de argumentos, devuelve una matriz vacía. </ p>


private RecyclerView . ItemDecoration parseTransforms  ( String raw ) { if ( raw == null ) { return null ; } float scaleX = 0f , scaleY = 0f ; int translateX = 0 , translateY = 0 ; float opacity = 0f ; int rotate = 0 ; Matcher matcher = transformPattern . matcher ( raw ) ; while ( matcher . find ( ) ) { String match = matcher . group ( ) ; String name = matcher . group ( 1 ) ; try { switch ( name ) { case "scale" : scaleX = Float . parseFloat ( matcher . group ( 2 ) ) ; scaleY = Float . parseFloat ( matcher . group ( 3 ) ) ; break ; case "translate" : translateX = Integer . parseInt ( matcher . group ( 2 ) ) ; translateY = Integer . parseInt ( matcher . group ( 3 ) ) ; break ; case "opacity" : opacity = Float . parseFloat ( matcher . group ( 2 ) ) ; break ; case "rotate" : rotate = Integer . parseInt ( matcher . group ( 2 ) ) ; break ; default : WXLogUtils . e ( TAG , "Invaild transform expression:" + match ) ; break ; } } catch ( NumberFormatException e ) { WXLogUtils . e ( "" , e ) ; WXLogUtils . e ( TAG , "Invaild transform expression:" + match ) ; } } return new TransformItemDecoration ( getOrientation ( ) == VERTICAL , opacity , translateX , translateY , rotate , scaleX , scaleY ) ; }

Estas funciones de transformación son compatibles: - `Escala (X, Y)`: Elemento de escala, X e Y debe ser un número de flotador positivo.- `Traducir (X, Y)`: Traducir elemento, `X` y` Y` SHOULE SER NÚMEROS INTEGER.- `Opacidad (N)`: Cambie la transparencia del artículo, `N` debe en '[0,1.0]`.- `Gire (N)`: Gire el elemento, n es un número entero.


public CropImageTransform ( Random random , int cropTop , int cropLeft , int cropBottom , int cropRight ) { super ( random ) ; this . cropTop = cropTop ; this . cropLeft = cropLeft ; this . cropBottom = cropBottom ; this . cropRight = cropRight ; converter = new OpenCVFrameConverter . ToMat ( ) ; }

Construye una instancia de ImageTransform.


public void testParentWithNoteParent  ( ) { FileDirectory para4 = FileDirectoryFinder . findOne ( FileDirectoryFinder . name ( ) . eq ( "PARA4.0" ) ) ; assertEquals ( "projects" , para4 . getParentDirectoryWithSameNote ( ) . getName ( ) ) ; FileDirectory src = FileDirectoryFinder . findOne ( FileDirectoryFinder . name ( ) . eq ( "src" ) ) ; assertNull ( src . getParentDirectoryWithSameNote ( ) ) ; FileDirectory temp = FileDirectoryFinder . findOne ( FileDirectoryFinder . name ( ) . eq ( "temp" ) ) ; assertNull ( temp . getParentDirectoryWithSameNote ( ) ) ; FileDirectory system32 = FileDirectoryFinder . findOne ( FileDirectoryFinder . name ( ) . eq ( "system32" ) ) ; assertNull ( system32 . getParentDirectoryWithSameNote ( ) ) ; }

Relación de prueba <Nombre de la relación = "ParentDirectoryWithSamenote" relacionado con la cardinalidad = "FILEDIRTORY" CARDINALIDAD = "uno a uno"> esta.drive = filedirectory.dive y este.parentdirectoryid = filedirectory.filedirectoryid y esta.note = filedirectory.note </ relation>


public XtnEntry createTransactionEntryIfAbsent  ( ServerTransaction txn , XtnEntry newXtnEntry ) { XtnEntry cur ; cur = addTransactionIfAbsent ( newXtnEntry ) ; if ( cur != newXtnEntry ) return cur ; if ( isTransactionWithLease ( txn ) ) addTransactionWithLease ( txn ) ; return newXtnEntry ; }

Cree nuevos transacciones y agréguelo a la lista de transacciones administradas si tal XTN no existe.Si existe = devolverlo


public WallSearchQueryWithExtended fields  ( EnumParam ... value ) { return unsafeParam ( "fields" , value ) ; }


public void drawResultBitmap  ( Bitmap barcode ) { resultBitmap = barcode ; invalidate ( ) ; }

Dibuja un mapa de bits con los puntos de resultados resaltados en lugar de la pantalla de escaneo en vivo.


@ Deprecated public int _INVALID_getAmount  ( ) { return NumberConversions . ceil ( getAmount ( ) ) ; }

Este método existe por razones legacy para proporcionar compatibilidad hacia atrás.No existirá en tiempo de ejecución y no debe usarse bajo ninguna circunstancia.


private void timeout  ( ) throws Exception  { int t = _timerLogical ++ ; _time += _waitInterval ; Map < WatchedObject , Collection < WatchedObject > > watchedObjects = new HashMap < WatchedObject , Collection < WatchedObject > > ( ) ; for ( Iterator < WeakReference < WatchedObject > > iter = _watchedObjects . iterator ( ) ; iter . hasNext ( ) ; ) { WeakReference < WatchedObject > w = iter . next ( ) ; WatchedObject watched = w . get ( ) ; if ( watched == null || ! watched . isInUse ( ) ) { iter . remove ( ) ; continue ; } int time = watched . getTime ( ) ; if ( time == UNWATCHED ) continue ; if ( t - time < _timeoutLogical ) continue ; if ( _logger . isLoggable ( Level . FINE ) ) { Level logLevel = Level . FINEST ; if ( Group . REQUEST_GROUP . name ( ) . equals ( _name ) || Group . RESPONSE_GROUP . name ( ) . equals ( _name ) ) { logLevel = Level . FINE ; } else if ( Group . IDLE_GROUP . name ( ) . equals ( _name ) ) { logLevel = Level . FINEST ; } _logger . log ( logLevel , _name + " - " + ( t - time ) * _waitInterval + " Timeout occurred, max allowed = " + _timeout ) ; } add ( watchedObjects , watched ) ; } if ( ! watchedObjects . isEmpty ( ) ) fireTimeoutOccured ( watchedObjects ) ; }

Tiempo de espera Todo el hilo que excedió su tiempo para vivir.


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

Construye nueva instancia de <tt> cm_show_dialog </ tt> paquete


public List < Tuple2 < Integer , Integer > > overlaps  ( ) { List < Tuple2 < Integer , Integer > > result = new ArrayList < Tuple2 < Integer , Integer > > ( ) ; if ( n >= 4 ) { int i = n - 1 ; while ( i >= 3 ) { if ( edges . get ( i ) . contains ( i - 1 ) && edges . get ( i ) . contains ( i - 2 ) && edges . get ( i - 1 ) . contains ( i - 3 ) && edges . get ( i - 2 ) . contains ( i - 3 ) ) { result . add ( new Tuple2 < Integer , Integer > ( i - 3 , i ) ) ; i = i - 4 ; } else { i = i - 1 ; } } } return result ; }

Encuentra todos los grupos de superposición de sílabas de esta gráfica.Un grupo de sílaba se superponera si define múltiples caminos más cortos, por ejemplo.4 nodos y dos caminos: [0, 1, 3] o [0, 2, 3].


private static boolean isLocalLoader  ( ClassLoader loader ) { return ( loader == null || localLoaders . containsKey ( loader ) ) ; }

Devuelve verdadero si el cargador dado es el cargador de clase del sistema o su padre (es decir, el cargador para extensiones instaladas) o el cargador de clase nulo


@ SuppressLint ( "SetTextI18n" ) private void initView  ( boolean init ) { if ( init && browsablePresenter . isBrowsable ( ) ) { browsablePresenter . requestBrowsableData ( ) ; } else { Collection c = ( Collection ) editResultPresenter . getEditKey ( ) ; SwipeBackLayout swipeBackLayout = ( SwipeBackLayout ) findViewById ( R . id . activity_collection_swipeBackLayout ) ; swipeBackLayout . setOnSwipeListener ( this ) ; StatusBarView statusBar = ( StatusBarView ) findViewById ( R . id . activity_collection_statusBar ) ; if ( DisplayUtils . isNeedSetStatusBarMask ( ) ) { statusBar . setBackgroundResource ( R . color . colorPrimary_light ) ; statusBar . setMask ( true ) ; } this . container = ( CoordinatorLayout ) findViewById ( R . id . activity_collection_container ) ; this . appBar = ( AppBarLayout ) findViewById ( R . id . activity_collection_appBar ) ; TextView title = ( TextView ) findViewById ( R . id . activity_collection_title ) ; title . setText ( c . title ) ; TextView description = ( TextView ) findViewById ( R . id . activity_collection_description ) ; if ( TextUtils . isEmpty ( c . description ) ) { description . setVisibility ( View . GONE ) ; } else { DisplayUtils . setTypeface ( this , description ) ; description . setText ( c . description ) ; } Toolbar toolbar = ( Toolbar ) findViewById ( R . id . activity_collection_toolbar ) ; if ( Mysplash . getInstance ( ) . isLightTheme ( ) ) { if ( browsablePresenter . isBrowsable ( ) ) { toolbar . setNavigationIcon ( R . drawable . ic_toolbar_home_light ) ; } else { toolbar . setNavigationIcon ( R . drawable . ic_toolbar_back_light ) ; } toolbar . inflateMenu ( R . menu . activity_collection_toolbar_light ) ; toolbar . setOnMenuItemClickListener ( this ) ; } else { if ( browsablePresenter . isBrowsable ( ) ) { toolbar . setNavigationIcon ( R . drawable . ic_toolbar_home_dark ) ; } else { toolbar . setNavigationIcon ( R . drawable . ic_toolbar_back_dark ) ; } toolbar . inflateMenu ( R . menu . activity_collection_toolbar_dark ) ; toolbar . setOnMenuItemClickListener ( this ) ; } toolbar . setNavigationOnClickListener ( this ) ; if ( AuthManager . getInstance ( ) . getUsername ( ) != null && AuthManager . getInstance ( ) . getUsername ( ) . equals ( c . user . username ) ) { toolbar . getMenu ( ) . getItem ( 0 ) . setVisible ( true ) ; } else { toolbar . getMenu ( ) . getItem ( 0 ) . setVisible ( false ) ; } if ( c . curated ) { toolbar . getMenu ( ) . getItem ( 2 ) . setVisible ( true ) ; } else { toolbar . getMenu ( ) . getItem ( 2 ) . setVisible ( false ) ; } this . creatorBar = ( RelativeLayout ) findViewById ( R . id . activity_collection_creatorBar ) ; creatorBar . setOnClickListener ( this ) ; findViewById ( R . id . activity_collection_touchBar ) . setOnClickListener ( this ) ; this . avatarImage = ( CircleImageView ) findViewById ( R . id . activity_collection_avatar ) ; Glide . with ( this ) . load ( c . user . profile_image . large ) . priority ( Priority . HIGH ) . override ( 128 , 128 ) . diskCacheStrategy ( DiskCacheStrategy . SOURCE ) . into ( avatarImage ) ; TextView subtitle = ( TextView ) findViewById ( R . id . activity_collection_subtitle ) ; DisplayUtils . setTypeface ( this , subtitle ) ; subtitle . setText ( getString ( R . string . by ) + " " + c . user . name ) ; this . photosView = ( CollectionPhotosView ) findViewById ( R . id . activity_collection_photosView ) ; photosView . initMP ( this , ( Collection ) editResultPresenter . getEditKey ( ) ) ; photosView . initRefresh ( ) ; AnimUtils . animInitShow ( photosView , 400 ) ; } }


public FileSystemInput ( ToolSelectionInterface toolMgr ) { List < String > fileHandlerClassList = new ArrayList < String > ( ) ; fileHandlerClassList . add ( SLDFileHandler . class . getName ( ) ) ; fileHandlerClassList . add ( SLDEditorFileHandler . class . getName ( ) ) ; fileHandlerClassList . add ( RasterFileHandler . class . getName ( ) ) ; fileHandlerClassList . add ( VectorFileHandler . class . getName ( ) ) ; fileHandlerClassList . add ( YSLDFileHandler . class . getName ( ) ) ; for ( String fileHandlerClass : fileHandlerClassList ) { try { FileHandlerInterface fileHandler = ( FileHandlerInterface ) Class . forName ( fileHandlerClass ) . newInstance ( ) ; for ( String fileExtension : fileHandler . getFileExtensionList ( ) ) { fileHandlerMap . put ( fileExtension , fileHandler ) ; } logger . debug ( "Added FileSystemInput extension : " + fileHandlerClass ) ; } catch ( InstantiationException | IllegalAccessException | ClassNotFoundException e ) { ConsoleManager . getInstance ( ) . exception ( FileSystemInput . class , e ) ; } } FileTreeNode . setFileHandlerMap ( fileHandlerMap ) ; if ( toolMgr != null ) { ToolManager . getInstance ( ) . registerTool ( FileTreeNode . class , new LegendTool ( ) ) ; ToolManager . getInstance ( ) . registerTool ( FileTreeNode . class , new ScaleTool ( toolMgr . getApplication ( ) ) ) ; ToolManager . getInstance ( ) . registerTool ( FileTreeNode . class , new RasterTool ( toolMgr . getApplication ( ) ) ) ; ToolManager . getInstance ( ) . registerTool ( FileTreeNode . class , new VectorTool ( toolMgr . getApplication ( ) ) ) ; ToolManager . getInstance ( ) . registerTool ( FileTreeNode . class , new YSLDTool ( ) ) ; } }

Instantánea una nueva entrada de sistema de archivos.


void addPath  ( ViterbiPoint point , ViterbiPath newPath ) { ViterbiCandidate candidate = newPath . candidate ; assert candidate != null ; ViterbiPath bestPathSoFar = candidate . bestPath ; List < ViterbiPath > paths = point . getPaths ( ) ; if ( bestPathSoFar == null ) { paths . add ( newPath ) ; candidate . setBestPath ( newPath ) ; } else if ( newPath . score < bestPathSoFar . score ) { paths . remove ( bestPathSoFar ) ; paths . add ( newPath ) ; candidate . setBestPath ( newPath ) ; } }

Agregue la nueva ruta a la ruta del estado si es mejor que la ruta actual.En esto, el estado significa la posición del candidato asociado con este camino en la cola candidata para el elemento del segmento correspondiente.En otras palabras, este método utiliza a NewPath como un camino que conduce al candidato newpath.candidate, si tiene una mejor puntaje que el mejor camino anterior que conduce a ese candidato.


protected NotesCreateCommentQuery message  ( String value ) { return unsafeParam ( "message" , value ) ; }


public ForwardFlowAnalysis ( DirectedGraph < N > graph ) { super ( graph ) ; }

Construye el análisis de una representación indicada de un cuerpo.


public @ Nullable ImageCursor fetch  ( ) { return fetch ( SortOrder . UNSPECIFIED ) ; }


public GSSimpleMessageImpl ( GSSessionImpl session ) throws JMSException { super ( session , GSMessageImpl . SIMPLE ) ; }

Instantánea una nueva instancia de <code> gssimplemessageimpl </ code>.


private static int lengthOfPath  ( Path2D . Float path ) { FlatteningPathIterator f = new FlatteningPathIterator ( path . getPathIterator ( null ) , 1 ) ; double sum = 0 ; float x1 , x2 , y1 , y2 ; float [ ] coords = new float [ 6 ] ; f . currentSegment ( coords ) ; x1 = coords [ 0 ] ; y1 = coords [ 1 ] ; f . next ( ) ; do { f . currentSegment ( coords ) ; f . next ( ) ; x2 = coords [ 0 ] ; y2 = coords [ 1 ] ; sum += Math . hypot ( x2 - x1 , y2 - y1 ) ; x1 = x2 ; y1 = y2 ; } while ( ! f . isDone ( ) ) ; return ( int ) sum ; }


private static Map < String , SimplifiedIntervalList > toSimplifiedIntervalMap  ( Map < String , Set < Interval > > unsortedIntervals ) { return unsortedIntervals . entrySet ( ) . stream ( ) . collect ( Collectors . toMap ( null , null ) ) ; }

Convierta el mapa de intervalos no adaptados en un mapa de SimplifiedIntervallistas.


public static boolean isInitialized  ( Context ctx ) { vitamioPackage = ctx . getPackageName ( ) ; vitamioLibraryPath = ContextUtils . getDataDir ( ctx ) + "lib/" ; return true ; }

Compruebe si Vitamio se inicializa en este dispositivo.


public Bundler putShortArray  ( String key , short [ ] value ) { bundle . putShortArray ( key , value ) ; return this ; }

Inserta un valor de matriz corto en el mapeo de este paquete, reemplazando cualquier valor existente para la clave dada.Cualquier clave o valor puede ser nulo.


public AemSidekick clickOperation  ( PageOperation optionName ) { getOperation ( optionName ) . click ( ) ; return this ; }

Encuentra el botón asociado con la operación de la página seleccionada y lo hace clic.


public ImageSize scale  ( float scale ) { return new ImageSize ( ( int ) ( width * scale ) , ( int ) ( height * scale ) ) ; }

Escalas de las dimensiones según la escala entrante.Devuelve nuevo objeto.


public EventDescriptor ( Class eventClass , long eventID ) { this ( eventClass , new Long ( eventID ) ) ; }

Construya un eventoDescriptor con una clase de clase y larga.El EventID se convertirá en un largo


protected static String resolveApplicationName  ( Application application , ApplicationType type ) { String persistedName = resolveName ( application , null ) ; if ( persistedName != null ) return persistedName ; String customName = resolveCustomName ( application ) ; if ( customName != null ) return customName ; return createGenericName ( application , type . getName ( ) ) ; }

Devuelve el nombre de la aplicación si está disponible en el almacenamiento de instantáneas como propietario_name o nombre de visualización provistos por el usuario definido por JVM ARGUMENTO <CÓDIGO> -dvisualvm.display.name </ code> (desde VisualVM 1.3.4) o genera nuevo nombre usando el AplicationType proporcionado.


public void init$Children  ( ) { children = new ASTNode [ 3 ] ; setChild ( new List ( ) , 1 ) ; setChild ( new Opt ( ) , 2 ) ; }

Inicializa la matriz de niños al tamaño correcto.Inicializa la lista y opta a los niños NTA.


@ Override public boolean containsGrammar  ( XMLGrammarDescription desc ) { return super . containsGrammar ( desc ) ; }

Devuelve VERDADERO si la piscina de gramática contiene una gramática asociada a la descripción especificada.


public static void clearCache  ( ) { fontMap . clear ( ) ; }


public static void apply  ( Document doc , boolean show ) { System . err . println ( "Computing differences..." ) ; PhyloTree tree = doc . getDir ( ) . getMainViewer ( ) . getTree ( ) ; if ( show ) { for ( Node v = tree . getFirstNode ( ) ; v != null ; v = v . getNext ( ) ) { NodeData vd = ( NodeData ) v . getData ( ) ; if ( v . getInDegree ( ) == 1 ) { Node w = v . getFirstInEdge ( ) . getSource ( ) ; int value1 = vd . getSummarized ( ) [ 0 ] ; int value2 = vd . getSummarized ( ) [ 1 ] ; NodeData wd = ( NodeData ) w . getData ( ) ; int up1 = wd . getSummarized ( ) [ 0 ] ; int up2 = wd . getSummarized ( ) [ 1 ] ; double [ ] result = SignificanceTestForTwoDatasets . runProportionTest ( value1 , up1 , value2 , up2 ) ; double pvalue = result [ 1 ] ; vd . setUpPValue ( pvalue > 1 || pvalue < 0 ? - 1 : pvalue ) ; } else vd . setUpPValue ( - 1 ) ; if ( v . getOutDegree ( ) > 1 ) { { boolean addAssigned = ( vd . getAssigned ( ) [ 0 ] > 0 || vd . getAssigned ( ) [ 1 ] > 0 ) ; int size = v . getOutDegree ( ) ; if ( addAssigned ) size += 1 ; double [ ] down1 = new double [ size ] ; double [ ] down2 = new double [ size ] ; int count = 0 ; for ( Edge e = v . getFirstOutEdge ( ) ; e != null ; e = v . getNextOutEdge ( e ) , count ++ ) { Node w = e . getTarget ( ) ; NodeData wd = ( NodeData ) w . getData ( ) ; down1 [ count ] = wd . getSummarized ( ) [ 0 ] ; down2 [ count ] = wd . getSummarized ( ) [ 1 ] ; } if ( addAssigned ) { down1 [ count ] = vd . getAssigned ( ) [ 0 ] ; down2 [ count ] = vd . getAssigned ( ) [ 1 ] ; } double [ ] result = SignificanceTestForTwoDatasets . runLowerBranchesTest ( down1 , down2 ) ; double pvalue = result [ 1 ] ; vd . setDownPValue ( pvalue > 1 || pvalue < 0 ? - 1 : pvalue ) ; } } else vd . setDownPValue ( - 1 ) ; Integer taxId = ( Integer ) v . getInfo ( ) ; System . out . println ( TaxonomyData . getName2IdMap ( ) . get ( taxId ) + ": UPv= " + vd . getUpPValue ( ) + " DPv= " + vd . getDownPValue ( ) ) ; } switch ( doc . getSignificanceTestCorrection ( ) ) { case BONFERRONI_ID : System . err . println ( "Applying Bonferroni correction" ) ; applyBonferroniCorrection ( tree ) ; break ; case HOLM_BONFERRONI_ID : System . err . println ( "Applying Holm-Bonferroni correction" ) ; applyHolmBonferroniCorrection ( tree ) ; break ; case NO_CORRECTION_ID : default : break ; } } else { for ( Node v = tree . getFirstNode ( ) ; v != null ; v = v . getNext ( ) ) { NodeData vd = ( NodeData ) v . getData ( ) ; vd . setUpPValue ( - 1 ) ; vd . setDownPValue ( - 1 ) ; } } }

Aplicar o sin aparecer la prueba de significado para dos resultados comparados


private static < T > T  makeImmutable ( T nonCollection )  { return nonCollection ; }

Un terminador a la fabricación recursiva de árboles de recolección inmutables.


public void replaceAggregationPeriodsWithDataPeriods  ( ListMap < DimensionalItemObject , DimensionalItemObject > dataPeriodAggregationPeriodMap ) { if ( isDisaggregation ( ) && dataPeriodType != null ) { this . periodType = this . dataPeriodType . getName ( ) ; if ( ! getPeriods ( ) . isEmpty ( ) ) { setDimensionOptions ( PERIOD_DIM_ID , DimensionType . PERIOD , dataPeriodType . getName ( ) . toLowerCase ( ) , new ArrayList < > ( dataPeriodAggregationPeriodMap . keySet ( ) ) ) ; } else { setFilterOptions ( PERIOD_DIM_ID , DimensionType . PERIOD , dataPeriodType . getName ( ) . toLowerCase ( ) , new ArrayList < > ( dataPeriodAggregationPeriodMap . keySet ( ) ) ) ; } } }

Reemplaza los períodos de esta consulta con los períodos de datos correspondientes.Establece el tipo de período al tipo de período de datos.Este método es relevante solo cuando el tipo de período de datos tiene una frecuencia más baja que el tipo de período de agregación.Esto es válido porque se permite la desagregación para los datos con el operador de agregación promedio.


@ Override public void destroy  ( ) { this . posTagger = null ; }


@ Override public void createUI  ( ) { int xPos = getXPos ( ) ; FieldPanel fieldPanel = createFieldPanel ( xPos , getLabel ( ) ) ; comboBox = new MenuComboBox ( this ) ; comboBox . setBounds ( xPos + BasePanel . WIDGET_X_START , 0 , BasePanel . WIDGET_STANDARD_WIDTH , BasePanel . WIDGET_HEIGHT ) ; PrefManager . getInstance ( ) . addVendorOptionListener ( comboBox ) ; fieldPanel . add ( comboBox ) ; if ( ! isValueOnly ( ) ) { setAttributeSelectionPanel ( fieldPanel . internalCreateAttrButton ( String . class , this , isRasterSymbol ( ) ) ) ; } containingPanel = new JPanel ( ) ; containingPanel . setLayout ( new CardLayout ( ) ) ; containingPanel . setBounds ( 0 , 0 , BasePanel . WIDGET_STANDARD_WIDTH , BasePanel . WIDGET_HEIGHT * 3 ) ; addCustomPanel ( containingPanel ) ; }


public static boolean booleanValueIndicator  ( Object value , boolean defaultValue ) { Boolean res = booleanValueIndicator ( value ) ; return res != null ? res : defaultValue ; }

Scipio: devuelve VERDADERO si el valor es Boolean.True o "Y", o falso si el valor es Boolean.False o "N", o de cadena predeterminado, si es algo más.<p> Nota: distingue entre mayúsculas y minúsculas.


public RioActivatableServiceDescriptor ( String name , String codebase , String policy , String classpath , String implClassName , String sharedGroupLog , String [ ] serverConfigArgs , boolean restart , String host , int port ) { super ( name , codebase , policy , classpath , implClassName , serverConfigArgs ) ; if ( sharedGroupLog == null ) throw new NullPointerException ( "Shared VM log cannot be null" ) ; this . sharedGroupLog = sharedGroupLog ; this . restart = restart ; this . host = ( host == null ) ? "" : host ; this . port = ( port <= 0 ) ? getDefaultActivationSystemPort ( ) : port ; }

Cree un RioActivatablesRedeScriptor, asignando parámetros dados a sus campos internos asociados.


public int truncate_file  ( String group_name , String appender_filename , long truncated_file_size ) throws IOException , MyException { byte [ ] header ; boolean bNewConnection ; Socket storageSocket ; byte [ ] hexLenBytes ; byte [ ] appenderFilenameBytes ; int offset ; int body_len ; if ( ( group_name == null || group_name . length ( ) == 0 ) || ( appender_filename == null || appender_filename . length ( ) == 0 ) ) { this . errno = ProtoCommon . ERR_NO_EINVAL ; return this . errno ; } bNewConnection = this . newUpdatableStorageConnection ( group_name , appender_filename ) ; try { storageSocket = this . storageServer . getSocket ( ) ; appenderFilenameBytes = appender_filename . getBytes ( ClientGlobal . g_charset ) ; body_len = 2 * ProtoCommon . FDFS_PROTO_PKG_LEN_SIZE + appenderFilenameBytes . length ; header = ProtoCommon . packHeader ( ProtoCommon . STORAGE_PROTO_CMD_TRUNCATE_FILE , body_len , ( byte ) 0 ) ; byte [ ] wholePkg = new byte [ header . length + body_len ] ; System . arraycopy ( header , 0 , wholePkg , 0 , header . length ) ; offset = header . length ; hexLenBytes = ProtoCommon . long2buff ( appender_filename . length ( ) ) ; System . arraycopy ( hexLenBytes , 0 , wholePkg , offset , hexLenBytes . length ) ; offset += hexLenBytes . length ; hexLenBytes = ProtoCommon . long2buff ( truncated_file_size ) ; System . arraycopy ( hexLenBytes , 0 , wholePkg , offset , hexLenBytes . length ) ; offset += hexLenBytes . length ; OutputStream out = storageSocket . getOutputStream ( ) ; System . arraycopy ( appenderFilenameBytes , 0 , wholePkg , offset , appenderFilenameBytes . length ) ; offset += appenderFilenameBytes . length ; out . write ( wholePkg ) ; ProtoCommon . RecvPackageInfo pkgInfo = ProtoCommon . recvPackage ( storageSocket . getInputStream ( ) , ProtoCommon . STORAGE_PROTO_CMD_RESP , 0 ) ; this . errno = pkgInfo . errno ; return pkgInfo . errno ; } catch ( IOException ex ) { if ( ! bNewConnection ) { try { this . storageServer . close ( ) ; } catch ( IOException ex1 ) { ex1 . printStackTrace ( ) ; } finally { this . storageServer = null ; } } throw ex ; } finally { if ( bNewConnection ) { try { this . storageServer . close ( ) ; } catch ( IOException ex1 ) { ex1 . printStackTrace ( ) ; } finally { this . storageServer = null ; } } } }

Archivo de apagado truncado del servidor de almacenamiento


private boolean isTestMode  ( ) { return ( ( System . getProperty ( "c2mon.server.testMode" ) ) != null && ( System . getProperty ( "c2mon.server.testMode" ) . equals ( "true" ) ) ) ; }

Comprueba si el modo de prueba está encendido


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

[% Skillcaster] recibió% de daño NUM0 y se puso en el estado de tracción porque usó [% de habilidad].


protected Object cloneObject  ( Object obj ) { if ( obj == null ) { return null ; } if ( obj instanceof String || obj instanceof Boolean || obj instanceof Byte || obj instanceof Short || obj instanceof Character || obj instanceof Integer || obj instanceof Long || obj instanceof Float || obj instanceof Double ) { return obj ; } if ( obj instanceof byte [ ] ) { byte [ ] body = ( byte [ ] ) obj ; byte [ ] data = new byte [ body . length ] ; System . arraycopy ( body , 0 , data , 0 , body . length ) ; return data ; } return SerializationHelper . deepClone ( obj ) ; }


@ Override public void onCreate  ( Bundle savedInstanceState ) { super . onCreate ( savedInstanceState ) ; }

Se llama cuando se crea por primera vez la actividad.


public List < String > updateDeletionStatus  ( String loadDate , String tableFolderPath , Long loadStartTime ) throws Exception { CarbonTableIdentifier carbonTableIdentifier = absoluteTableIdentifier . getCarbonTableIdentifier ( ) ; ICarbonLock carbonDeleteSegmentLock = CarbonLockFactory . getCarbonLockObj ( carbonTableIdentifier , LockUsage . DELETE_SEGMENT_LOCK ) ; ICarbonLock carbonTableStatusLock = CarbonLockFactory . getCarbonLockObj ( carbonTableIdentifier , LockUsage . TABLE_STATUS_LOCK ) ; String tableDetails = carbonTableIdentifier . getDatabaseName ( ) + "." + carbonTableIdentifier . getTableName ( ) ; List < String > invalidLoadTimestamps = new ArrayList < String > ( 0 ) ; try { if ( carbonDeleteSegmentLock . lockWithRetries ( ) ) { LOG . info ( "Delete segment lock has been successfully acquired" ) ; CarbonTablePath carbonTablePath = CarbonStorePath . getCarbonTablePath ( absoluteTableIdentifier . getStorePath ( ) , absoluteTableIdentifier . getCarbonTableIdentifier ( ) ) ; String dataLoadLocation = carbonTablePath . getTableStatusFilePath ( ) ; LoadMetadataDetails [ ] listOfLoadFolderDetailsArray = null ; if ( ! FileFactory . isFileExist ( dataLoadLocation , FileFactory . getFileType ( dataLoadLocation ) ) ) { LOG . error ( "Error message: " + "Load metadata file is not present." ) ; invalidLoadTimestamps . add ( loadDate ) ; return invalidLoadTimestamps ; } listOfLoadFolderDetailsArray = readLoadMetadata ( tableFolderPath ) ; if ( listOfLoadFolderDetailsArray != null && listOfLoadFolderDetailsArray . length != 0 ) { updateDeletionStatus ( loadDate , listOfLoadFolderDetailsArray , invalidLoadTimestamps , loadStartTime ) ; if ( invalidLoadTimestamps . isEmpty ( ) ) { if ( carbonTableStatusLock . lockWithRetries ( ) ) { LOG . info ( "Table status lock has been successfully acquired." ) ; writeLoadDetailsIntoFile ( dataLoadLocation , listOfLoadFolderDetailsArray ) ; } else { String errorMsg = "Delete segment by date is failed for " + tableDetails + ". Not able to acquire the table status lock due to other operation running " + "in the background." ; LOG . audit ( errorMsg ) ; LOG . error ( errorMsg ) ; throw new Exception ( errorMsg + " Please try after some time." ) ; } } else { return invalidLoadTimestamps ; } } else { LOG . audit ( "Delete segment by date is failed. No matching segment found." ) ; invalidLoadTimestamps . add ( loadDate ) ; return invalidLoadTimestamps ; } } else { String errorMsg = "Delete segment by date is failed for " + tableDetails + ". Not able to acquire the delete segment lock due to another delete " + "operation is running in the background." ; LOG . audit ( errorMsg ) ; LOG . error ( errorMsg ) ; throw new Exception ( errorMsg + " Please try after some time." ) ; } } catch ( IOException e ) { LOG . error ( "Error message: " + "IOException" + e . getMessage ( ) ) ; } finally { CarbonLockUtil . fileUnlock ( carbonTableStatusLock , LockUsage . TABLE_STATUS_LOCK ) ; CarbonLockUtil . fileUnlock ( carbonDeleteSegmentLock , LockUsage . DELETE_SEGMENT_LOCK ) ; } return invalidLoadTimestamps ; }


PhoneNumberMatch ( int start , String rawString , PhoneNumber number )  { if ( start < 0 ) { throw new IllegalArgumentException ( "Start index must be >= 0." ) ; } if ( rawString == null || number == null ) { throw new NullPointerException ( ) ; } this . start = start ; this . rawString = rawString ; this . number = number ; }


@ Override public void treeSelection  ( TreeSelectionEvent e ) { if ( ! tree . isDragging ( ) ) { if ( parentObj != null ) { parentObj . preLoad ( ) ; } List < SLDDataInterface > sldDataList = new ArrayList < SLDDataInterface > ( ) ; List < NodeInterface > nodeList = new ArrayList < NodeInterface > ( ) ; boolean isDataSource = false ; boolean isFolder = false ; TreePath [ ] selectedPaths = tree . getSelectionPaths ( ) ; if ( selectedPaths != null ) { for ( TreePath selectedPath : selectedPaths ) { Object o = selectedPath . getLastPathComponent ( ) ; if ( o instanceof NodeInterface ) { NodeInterface handler = ( NodeInterface ) o ; FileSystemInterface input = handler . getHandler ( ) ; SelectedFiles selectedFiles = input . getSLDContents ( handler ) ; if ( selectedFiles != null ) { isDataSource = selectedFiles . isDataSource ( ) ; isFolder |= selectedFiles . isFolder ( ) ; List < SLDDataInterface > handlerDataList = selectedFiles . getSldData ( ) ; if ( handlerDataList != null ) { sldDataList . addAll ( handlerDataList ) ; } } nodeList . add ( handler ) ; } } toolMgr . setSelectedItems ( nodeList , sldDataList ) ; if ( ! parentObj . loadSLDString ( isFolder , isDataSource , sldDataList ) ) { tree . revertSelection ( e . getOldLeadSelectionPath ( ) ) ; } } else { toolMgr . setSelectedItems ( nodeList , sldDataList ) ; } } }

Llamado cuando la selección del árbol del sistema de archivos ha cambiado.


private boolean processEvents  ( Subscriber < ? super Result > s ) { int event ; do { event = parser . nextEvent ( ) ; if ( event == JsonEvent . VALUE_STRING ) { s . onNext ( new Result ( event , parser . getCurrentString ( ) ) ) ; } else if ( event == JsonEvent . EOF ) { s . onNext ( new Result ( event ) ) ; s . onCompleted ( ) ; return false ; } else if ( event == JsonEvent . ERROR ) { s . onError ( new IllegalStateException ( "Syntax error" ) ) ; return false ; } else if ( event != JsonEvent . NEED_MORE_INPUT ) { s . onNext ( new Result ( event ) ) ; } } while ( event != JsonEvent . NEED_MORE_INPUT ) ; return true ; }

Procesar eventos del analizador hasta que necesite más entrada.Notificar al suscriptor en consecuencia.


private static boolean matchExtendedProperty  ( Object entryValue , Object templateValue , short matchCode , boolean includeRange , Object rangeValue , RegexCache regexCache ) { if ( templateValue == null ) return true ; if ( entryValue == null ) return false ; if ( matchCode == TemplateMatchCodes . REGEX ) { Pattern p = regexCache . getPattern ( ( String ) templateValue ) ; Matcher m = p . matcher ( ( String ) entryValue ) ; return m . matches ( ) ; } int compareResult = 0 ; if ( matchCode != TemplateMatchCodes . NE && matchCode != TemplateMatchCodes . EQ ) { Comparable eobj = castToComparable ( entryValue ) ; Comparable tobj = castToComparable ( templateValue ) ; try { compareResult = eobj . compareTo ( tobj ) ; } catch ( ClassCastException cce ) { if ( ! eobj . getClass ( ) . isInstance ( tobj ) ) return false ; throw cce ; } } switch ( matchCode ) { case TemplateMatchCodes . NE : return ( ! templateValue . equals ( entryValue ) ) ; case TemplateMatchCodes . EQ : if ( quickRejectField ( entryValue , templateValue ) ) return false ; return ( templateValue . equals ( entryValue ) ) ; case TemplateMatchCodes . LT : if ( rangeValue == null ) return compareResult < 0 ; if ( ! ( compareResult < 0 ) ) return false ; return fieldExtendedMatchLimitValue ( entryValue , rangeValue , matchCode , includeRange ) ; case TemplateMatchCodes . LE : if ( rangeValue == null ) return compareResult <= 0 ; if ( ! ( compareResult <= 0 ) ) return false ; return fieldExtendedMatchLimitValue ( entryValue , rangeValue , matchCode , includeRange ) ; case TemplateMatchCodes . GE : if ( rangeValue == null ) return compareResult >= 0 ; if ( ! ( compareResult >= 0 ) ) return false ; return fieldExtendedMatchLimitValue ( entryValue , rangeValue , matchCode , includeRange ) ; case TemplateMatchCodes . GT : if ( rangeValue == null ) return compareResult > 0 ; if ( ! ( compareResult > 0 ) ) return false ; return fieldExtendedMatchLimitValue ( entryValue , rangeValue , matchCode , includeRange ) ; } return false ; }


protected boolean isAlwaysNonNull  ( Value v ) { return false ; }

Esto se puede sobrescribir por sublases para marcar un cierto valor tan constantemente nulo.


public void writeLongLittleEndian  ( long a ) throws IOException  { ensureSize ( size + 8 ) ; bytes [ size ++ ] = ( ( byte ) ( a ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 8 ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 16 ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 24 ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 32 ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 40 ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 48 ) ) ; bytes [ size ++ ] = ( ( byte ) ( a >> 56 ) ) ; }


private void validateFields  ( ) { if ( resourceNameText . getText ( ) . length ( ) == 0 ) { setErrorMessage ( null ) ; setPageComplete ( false ) ; return ; } try { new SVNUrl ( Util . appendPath ( urlParentText . getText ( ) , resourceNameText . getText ( ) ) ) ; } catch ( MalformedURLException e ) { setErrorMessage ( Policy . bind ( "MoveRemoteResourceWizardMainPage.invalidUrl" ) ) ; setPageComplete ( false ) ; return ; } setErrorMessage ( null ) ; setPageComplete ( true ) ; }

Valida el contenido de los campos editables y configure de manera adecuada la finalización de la página y los mensajes de error.Llame a cada vez que se modifique el nombre de la carpeta o la URL de los padres


public static int adjustByPercentIdentity  ( int taxId , BitSet activeMatches , IReadBlock readBlock , ClassificationFullTree tree , Name2IdMap name2IdMap ) { float bestPercentIdentity = 0 ; for ( int i = activeMatches . nextSetBit ( 0 ) ; i != - 1 ; i = activeMatches . nextSetBit ( i + 1 ) ) { final IMatchBlock matchBlock = readBlock . getMatchBlock ( i ) ; if ( matchBlock . getPercentIdentity ( ) > bestPercentIdentity ) bestPercentIdentity = matchBlock . getPercentIdentity ( ) ; } if ( bestPercentIdentity >= 99 || bestPercentIdentity == 0 ) return taxId ; boolean changed ; do { changed = false ; boolean ok = true ; int rank = name2IdMap . getRank ( taxId ) ; switch ( rank ) { case 100 : case 101 : if ( bestPercentIdentity < 99 ) ok = false ; break ; case 99 : case 98 : if ( bestPercentIdentity < 97 ) ok = false ; break ; case 5 : if ( bestPercentIdentity < 95 ) ok = false ; break ; case 4 : if ( bestPercentIdentity < 90 ) ok = false ; break ; case 3 : if ( bestPercentIdentity < 85 ) ok = false ; break ; case 2 : if ( bestPercentIdentity < 80 ) ok = false ; break ; default : case 0 : ok = false ; } if ( ! ok ) { Node v = tree . getANode ( taxId ) ; if ( v != null && v . getInDegree ( ) > 0 ) { Node w = v . getFirstInEdge ( ) . getSource ( ) ; taxId = ( Integer ) w . getInfo ( ) ; changed = true ; } } } while ( changed ) ; return taxId ; }

los movimientos se lee a los taxones más altos si la identidad del porcentaje que tienen no es lo suficientemente alta para el rango taxonómico dado


public static int dehexchar  ( char hex ) { if ( hex >= '0' && hex <= '9' ) { return hex - '0' ; } else if ( hex >= 'A' && hex <= 'F' ) { return hex - 'A' + 10 ; } else if ( hex >= 'a' && hex <= 'f' ) { return hex - 'a' + 10 ; } else { return - 1 ; } }

Devuelve el valor entero [0..15] para el carácter hexagonal dado, o -1 para la entrada no hexagonal.


public SerialMessage clearAssociationMessage  ( int group ) { logger . debug ( "NODE {}: Creating new message for command MULTI_ASSOCIATIONCMD_REMOVE node all, endpoint all, group {}" , getNode ( ) . getNodeId ( ) , group ) ; SerialMessage result = new SerialMessage ( getNode ( ) . getNodeId ( ) , SerialMessageClass . SendData , SerialMessageType . Request , SerialMessageClass . SendData , SerialMessagePriority . Set ) ; ByteArrayOutputStream outputData = new ByteArrayOutputStream ( ) ; outputData . write ( this . getNode ( ) . getNodeId ( ) ) ; outputData . write ( 3 ) ; outputData . write ( getCommandClass ( ) . getKey ( ) ) ; outputData . write ( MULTI_ASSOCIATIONCMD_REMOVE ) ; outputData . write ( group ) ; result . setMessagePayload ( outputData . toByteArray ( ) ) ; return result ; }

Obtiene un Message Serial con el comando multi_associatincmd_remove para eliminar todos los nodos


public static int verifyOrder  ( String input , String [ ] subStrings ) { int prev = - 1 ; for ( int i = 0 ; i < subStrings . length ; i ++ ) { int current = input . indexOf ( subStrings [ i ] ) ; if ( current < prev ) { return i ; } else { prev = current ; } } return - 1 ; }

Verifique que la lista de subcadenas aparezca en el orden proporcionado en una cadena


public static void write  ( byte [ ] data , OutputStream output ) throws IOException { if ( data != null ) { output . write ( data ) ; } }

Escribe bytes de un byte de <código> [] </ código> a un <codigo> SURODSTREAM </ CODE>.


public static VersionNumber parseOperatingSystemVersion  ( @ Nonnull final OperatingSystemFamily family , @ Nonnull final String userAgent ) { Check . notNull ( family , "family" ) ; Check . notNull ( userAgent , "userAgent" ) ; return VersionParser . parseOperatingSystemVersion ( family , userAgent ) ; }

Intente determinar el número de versión del sistema operativo al analizar la cadena del agente de usuario.


public boolean performOk  ( ) { IPreferenceStore store = getPreferenceStore ( ) ; if ( useDefault . getSelection ( ) ) { store . setValue ( ISVNUIConstants . PREF_MENU_ICON_SET , ISVNUIConstants . MENU_ICON_SET_DEFAULT ) ; } else if ( useTortoiseSVN . getSelection ( ) ) { store . setValue ( ISVNUIConstants . PREF_MENU_ICON_SET , ISVNUIConstants . MENU_ICON_SET_TORTOISESVN ) ; } else if ( useSubversive . getSelection ( ) ) { store . setValue ( ISVNUIConstants . PREF_MENU_ICON_SET , ISVNUIConstants . MENU_ICON_SET_SUBVERSIVE ) ; } SVNUIPlugin . getPlugin ( ) . savePluginPreferences ( ) ; return true ; }

Ok se hizo clic.Almacenar las preferencias de SVN.


public static Bitmap scaleImageTo  ( Bitmap org , int newWidth , int newHeight ) { return scaleImage ( org , ( float ) newWidth / org . getWidth ( ) , ( float ) newHeight / org . getHeight ( ) ) ; }


public XPathFactoryConfigurationException ( Throwable cause ) { super ( cause ) ; }

 Construye un nuevo <código> xpathfactoryconfigurationExceptionception  con la causa <codigo> especificada .

 Si <codigo> causa  es null , luego se lanza un <código> nullpointerException .


public WorldUpdate ( World world ) { this . world = world ; }

Construye un nuevo evento que se desplaza cuando el mundo tiene una marca de actualización.


public static String encodeLines  ( byte [ ] in ) { return encodeLines ( in , 0 , in . length , 76 , systemLineSeparator ) ; }

Codifica una matriz de bytes en formato base 64 y rompe la salida en líneas de 76 caracteres.Este método es compatible con <código> sol.misc.base64encoder.encodebuffer (byte []) </ code>.


@ SuppressWarnings ( { "unchecked" , "cast" } ) public MethodDeclSubstituted fullCopy  ( ) { MethodDeclSubstituted tree = ( MethodDeclSubstituted ) 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.


public static void main  ( String [ ] args ) { Hashtable hOptions = gr . demokritos . iit . jinsect . utils . parseCommandLineSwitches ( args ) ; String sCorpusDir = gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "corpusDir" , "./corpus/" ) ; String sPeerDir = gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "peerDir" , "./peers/" ) ; String sModelDir = gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "modelDir" , "./models/" ) ; String sModelFile = gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "modelFile" , "" ) ; boolean bFlatCorpusDir = Boolean . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "flatCorpusDir" , String . valueOf ( false ) ) ) . booleanValue ( ) ; boolean bPerCategoryModel = Boolean . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "perCategoryModel" , String . valueOf ( false ) ) ) . booleanValue ( ) ; int iMinChar = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "minChar" , "1" ) ) ; int iMaxChar = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "maxChar" , "5" ) ) ; int iCharDist = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "charDist" , "5" ) ) ; int iMinWord = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "minWord" , "1" ) ) ; int iMaxWord = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "maxWord" , "5" ) ) ; int iWordDist = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "wordDist" , "5" ) ) ; int iCategoryLimit = Integer . valueOf ( gr . demokritos . iit . jinsect . utils . getSwitch ( hOptions , "categoryLimit" , "-1" ) ) ; iCategoryLimit = ( iCategoryLimit <= 0 ) ? Integer . MAX_VALUE : iCategoryLimit ; DocumentSet dsModel = new DocumentSet ( sCorpusDir , 1.0 ) ; dsModel . createSets ( bFlatCorpusDir ) ; Iterator iCatIter = dsModel . getCategories ( ) . iterator ( ) ; TreeMap < String , Distribution > tmResultsPerPeer = new TreeMap < String , Distribution > ( ) ; TreeMap < String , Distribution > tmResultsPerModel = new TreeMap < String , Distribution > ( ) ; System . out . println ( "SystemID\tSystemType\tTopicID\tNormality\tCharNormality\tWordNormality" ) ; int iIterCnt = 0 ; grammaticalityEstimator g = null ; while ( iCatIter . hasNext ( ) && ( iIterCnt ++ < iCategoryLimit ) ) { String sCurrentCategory = ( String ) iCatIter . next ( ) ; Iterator iIter = dsModel . getFilesFromCategory ( sCurrentCategory , dsModel . FROM_TRAINING_SET ) . iterator ( ) ; HashSet alDocFileNames = new HashSet ( ) ; while ( iIter . hasNext ( ) ) { alDocFileNames . add ( ( ( CategorizedFileEntry ) iIter . next ( ) ) . getFileName ( ) ) ; } String sIterModelFile = sModelFile ; if ( bPerCategoryModel ) sIterModelFile += String . valueOf ( iIterCnt ) ; if ( ( g == null ) || bPerCategoryModel ) { System . err . println ( "Loading corpus... (Iteration " + ( iIterCnt ) + ")" ) ; boolean bLoaded = false ; if ( sModelFile . length ( ) > 0 ) { if ( new File ( sIterModelFile ) . exists ( ) ) try { System . err . println ( "Loading from model file (" + sIterModelFile + ")" ) ; g = grammaticalityEstimator . loadFromStream ( new GZIPInputStream ( new FileInputStream ( sIterModelFile ) ) ) ; bLoaded = g != null ; } catch ( FileNotFoundException ex ) { System . err . println ( "Failed to load model." ) ; ex . printStackTrace ( System . err ) ; g = null ; } catch ( IOException ioe ) { System . err . println ( "Failed to load model, due to decompression problem." ) ; ioe . printStackTrace ( System . err ) ; g = null ; } catch ( Exception e ) { System . err . println ( "Failed to load model, due to problem." ) ; e . printStackTrace ( System . err ) ; g = null ; } else System . err . println ( "Model file not found. Using file name for model output." ) ; } if ( g == null ) { g = new grammaticalityEstimator ( alDocFileNames , iMinChar , iMaxChar , iMinWord , iMaxWord , Math . max ( iMaxChar , iMaxWord ) ) ; System . err . println ( "Training on corpus..." ) ; System . gc ( ) ; g . train ( ) ; } if ( ( ! bLoaded ) && ( g != null ) ) { System . err . println ( "Saving to model file (" + sIterModelFile + ")" ) ; FileOutputStream fsModelOut ; try { fsModelOut = new FileOutputStream ( sIterModelFile ) ; GZIPOutputStream gosTmp = new GZIPOutputStream ( fsModelOut , 16384 ) ; g . saveToStream ( gosTmp ) ; gosTmp . finish ( ) ; fsModelOut . close ( ) ; } catch ( FileNotFoundException ex ) { System . err . println ( "Could not save to file " + sIterModelFile ) ; ex . printStackTrace ( System . err ) ; } catch ( IOException ex ) { System . err . println ( "Could not save to file " + sIterModelFile ) ; ex . printStackTrace ( System . err ) ; } } } System . err . println ( "\nAnalysing peers..." ) ; DocumentSet dsPeers = null ; if ( bPerCategoryModel ) { dsPeers = new DocumentSet ( sPeerDir + sCurrentCategory . substring ( 0 , sCurrentCategory . length ( ) - 1 ) , 1.0 ) ; dsPeers . createSets ( true ) ; } else { dsPeers = new DocumentSet ( sPeerDir , 1.0 ) ; dsPeers . createSets ( false ) ; } System . err . println ( "Found " + String . valueOf ( dsPeers . getTrainingSet ( ) . size ( ) ) + " peer documents..." ) ; Iterator iDocs = dsPeers . getTrainingSet ( ) . iterator ( ) ; while ( iDocs . hasNext ( ) ) { StringBuffer sbCurLine = new StringBuffer ( ) ; CategorizedFileEntry cfeCur = ( CategorizedFileEntry ) iDocs . next ( ) ; String sFilename = cfeCur . getFileName ( ) ; String sText = gr . demokritos . iit . jinsect . utils . loadFileToString ( sFilename ) ; double dNorm = g . getNormality ( sText ) ; double dCharNorm = g . getCharNormality ( sText ) ; double dWordNorm = g . getWordNormality ( sText ) ; DUCDocumentInfo ddiCur = new DUCDocumentInfo ( sFilename ) ; sbCurLine . append ( ddiCur . Summarizer + "\t" ) ; sbCurLine . append ( "Peer\t" ) ; sbCurLine . append ( ddiCur . Topic + "\t" ) ; sbCurLine . append ( dNorm + "\t" ) ; sbCurLine . append ( dCharNorm + "\t" ) ; sbCurLine . append ( dWordNorm ) ; Distribution dCur = null ; if ( tmResultsPerPeer . containsKey ( ddiCur . Summarizer ) ) dCur = tmResultsPerPeer . get ( ddiCur . Summarizer ) ; else { dCur = new Distribution ( ) ; tmResultsPerPeer . put ( ddiCur . Summarizer , dCur ) ; } dCur . setValue ( dCur . asTreeMap ( ) . size ( ) , dNorm ) ; System . out . println ( sbCurLine . toString ( ) ) ; } System . err . println ( "\nAnalysing models..." ) ; DocumentSet dsModels = new DocumentSet ( sModelDir + sCurrentCategory . substring ( 0 , sCurrentCategory . length ( ) - 1 ) , 1.0 ) ; dsModels . createSets ( true ) ; System . err . println ( "Found " + String . valueOf ( dsModels . getTrainingSet ( ) . size ( ) ) + " model documents..." ) ; iDocs = dsModels . getTrainingSet ( ) . iterator ( ) ; while ( iDocs . hasNext ( ) ) { StringBuffer sbCurLine = new StringBuffer ( ) ; CategorizedFileEntry cfeCur = ( CategorizedFileEntry ) iDocs . next ( ) ; String sFilename = cfeCur . getFileName ( ) ; String sText = gr . demokritos . iit . jinsect . utils . loadFileToString ( sFilename ) ; double dNorm = g . getNormality ( sText ) ; double dCharNorm = g . getCharNormality ( sText ) ; double dWordNorm = g . getWordNormality ( sText ) ; DUCDocumentInfo ddiCur = new DUCDocumentInfo ( sFilename ) ; sbCurLine . append ( ddiCur . Summarizer + "\t" ) ; sbCurLine . append ( "Model\t" ) ; sbCurLine . append ( ddiCur . Topic + "\t" ) ; sbCurLine . append ( dNorm + "\t" ) ; sbCurLine . append ( dCharNorm + "\t" ) ; sbCurLine . append ( dWordNorm + "\t" ) ; Distribution dCur = null ; if ( tmResultsPerModel . containsKey ( ddiCur . Summarizer ) ) dCur = tmResultsPerModel . get ( ddiCur . Summarizer ) ; else { dCur = new Distribution ( ) ; tmResultsPerModel . put ( ddiCur . Summarizer , dCur ) ; } dCur . setValue ( dCur . asTreeMap ( ) . size ( ) , dNorm ) ; System . out . println ( sbCurLine . toString ( ) ) ; } } System . err . println ( "OVERALL RESULTS:\n" ) ; for ( Iterator < String > it = tmResultsPerPeer . keySet ( ) . iterator ( ) ; it . hasNext ( ) ; ) { String sPeer = it . next ( ) ; System . err . println ( sPeer + ": " + tmResultsPerPeer . get ( sPeer ) . average ( true ) + " (" + tmResultsPerPeer . get ( sPeer ) . standardDeviation ( true ) + ")" ) ; } }

Un método principal de servicios públicos que realiza la estimación de la gramaticalidad, dado un corpus, un conjunto de documentos de pares y un conjunto de documentos modelo.


@ Override public synchronized void remove  ( String key ) { boolean deleted = getFileForKey ( key ) . delete ( ) ; removeEntry ( key ) ; if ( ! deleted ) { VolleyLog . d ( "Could not delete cache entry for key=%s, filename=%s" , key , getFilenameForKey ( key ) ) ; } }

Elimina la tecla especificada de la memoria caché si existe.


public ReadModifiers add  ( ReadModifiers modifiers ) { return createIfNeeded ( super . add ( modifiers ) ) ; }

Crea una nueva instancia de modificadores que es una unión de los modificadores especificados y esta instancia.


private void submitInitialSeeds  ( ) { for ( Entry < N , Set < D > > seed : tabulationProblem . initialSeeds ( ) . entrySet ( ) ) { N startPoint = seed . getKey ( ) ; MethodAnalyzer < FieldRef , D , N , M > analyzer = methodAnalyzers . getOrCreate ( tabulationProblem . interproceduralCFG ( ) . getMethodOf ( startPoint ) ) ; for ( D val : seed . getValue ( ) ) { analyzer . addInitialSeed ( startPoint , val ) ; debugger . initialSeed ( startPoint ) ; } } }

Hace públicos el procesamiento de semillas iniciales, iniciando el análisis.


public MarketGetCommentsQuery needLikes  ( Boolean value ) { return unsafeParam ( "need_likes" , value ) ; }

"1" - devolver información de los gustos


public void load  ( String fileName ) throws IOException , MaryConfigurationException  { DataInputStream dis = new DataInputStream ( new BufferedInputStream ( new FileInputStream ( fileName ) ) ) ; hdr = new MaryHeader ( dis ) ; if ( hdr . getType ( ) != MaryHeader . UNITS ) { throw new MaryConfigurationException ( "File [" + fileName + "] is not a valid Mary Units file." ) ; } numberOfUnits = dis . readInt ( ) ; if ( numberOfUnits < 0 ) { throw new MaryConfigurationException ( "File [" + fileName + "] has a negative number of units. Aborting." ) ; } sampleRate = dis . readInt ( ) ; if ( sampleRate < 0 ) { throw new MaryConfigurationException ( "File [" + fileName + "] has a negative number sample rate. Aborting." ) ; } units = new Unit [ numberOfUnits ] ; for ( int i = 0 ; i < numberOfUnits ; i ++ ) { long startTime = dis . readLong ( ) ; int duration = dis . readInt ( ) ; units [ i ] = new Unit ( startTime , duration , i ) ; } }


public boolean haveSelfRezEffect  ( ) { if ( getAccessLevel ( ) >= AdminConfig . ADMIN_AUTO_RES ) { return true ; } List < Effect > effects = getEffectController ( ) . getAbnormalEffects ( ) ; for ( Effect effect : effects ) { for ( EffectTemplate template : effect . getEffectTemplates ( ) ) { if ( template . getEffectid ( ) == 160 && template instanceof RebirthEffect ) { RebirthEffect rebirthEffect = ( RebirthEffect ) template ; setRebirthResurrectPercent ( rebirthEffect . getResurrectPercent ( ) ) ; setRebirthSkill ( rebirthEffect . getSkillId ( ) ) ; return true ; } } } return false ; }


protected void removeExecutionLink  ( TimerJobEntity jobEntity ) { if ( jobEntity . getExecutionId ( ) != null ) { ExecutionEntity execution = getExecutionEntityManager ( ) . findById ( jobEntity . getExecutionId ( ) ) ; if ( execution != null ) { execution . getTimerJobs ( ) . remove ( jobEntity ) ; } } }

Elimina la referencia de la ejecución del trabajo a este trabajo, si el trabajo tiene una ejecución asociada.Las subclases pueden anular para proporcionar implementaciones personalizadas.


protected Criteria createCriteriaInternal  ( ) { Criteria criteria = new Criteria ( ) ; return criteria ; }

Este método fue generado por MyBatis Generator.Este método corresponde a la tabla de la base de datos Public.Users


public ShapelessRecipe addIngredient  ( MaterialData ingredient ) { return addIngredient ( 1 , ingredient ) ; }


public Tree ( TreeSpecies species , BlockFace dir ) { this ( DEFAULT_TYPE , species , dir ) ; }

Construye un bloque de árbol de las especies de árboles dadas, y frente a la dirección dada.


public MarketEditQuery ( VkApiClient client , UserActor actor , int ownerId , int itemId , String name , String description , int categoryId , float price , int mainPhotoId ) { super ( client , "market.edit" , OkResponse . class ) ; accessToken ( actor . getAccessToken ( ) ) ; ownerId ( ownerId ) ; itemId ( itemId ) ; name ( name ) ; description ( description ) ; categoryId ( categoryId ) ; price ( price ) ; mainPhotoId ( mainPhotoId ) ; }

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


private void removeTask  ( Runnable r ) { tCur = null ; }


@ Override public void onCreate  ( Bundle savedInstanceState ) { super . onCreate ( savedInstanceState ) ; setContentView ( R . layout . lib_main ) ; Lib . handleTextView ( this ) ; }

Se llama cuando se crea por primera vez la actividad.


@ SuppressWarnings ( { "unchecked" , "cast" } ) public URShiftExpr fullCopy  ( ) { URShiftExpr tree = ( URShiftExpr ) 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 ; }


protected WallReportPostQuery ownerId  ( int value ) { return unsafeParam ( "owner_id" , value ) ; }

ID del usuario o comunidad que posee la pared.


public Object put  ( Object key , Object value ) { processQueue ( ) ; return map . put ( Key . create ( key , queue ) , value ) ; }

Los asociados valoran con la clave dada, el valor de devolución previamente asociado con la clave, o nulo si ninguno.


public final boolean isEmpty  ( ) { return s . isEmpty ( ) ; }

Devuelve VERDADERO si este conjunto no contiene objetos de tiempo de ejecución.


public FileOutputStream createOutputFile  ( String file_name ) throws FileNotFoundException  { return new FileOutputStream ( new File ( dump_dir , file_name ) ) ; }

Cree todos los archivos de salida bajo la ubicación uniforme.


static PhoneMetadataCollection loadMetadataAndCloseInput  ( InputStream source ) { ObjectInputStream ois = null ; try { try { ois = new ObjectInputStream ( source ) ; } catch ( IOException e ) { throw new RuntimeException ( "cannot load/parse metadata" , e ) ; } PhoneMetadataCollection metadataCollection = new PhoneMetadataCollection ( ) ; try { metadataCollection . readExternal ( ois ) ; } catch ( IOException e ) { throw new RuntimeException ( "cannot load/parse metadata" , e ) ; } return metadataCollection ; } finally { try { if ( ois != null ) { ois . close ( ) ; } else { source . close ( ) ; } } catch ( IOException e ) { LOGGER . log ( Level . WARNING , "error closing input stream (ignored)" , e ) ; } } }

Carga y devuelve el objeto de metadatos del flujo dado y cierra la secuencia.


public UsersSearchQuery universityFaculty  ( Integer value ) { return unsafeParam ( "university_faculty" , value ) ; }


public int readLine  ( byte b [ ] , int off , int len ) throws IOException { int total = 0 ; if ( len == 0 ) { return 0 ; } int avail = count - pos ; if ( avail <= 0 ) { fill ( ) ; avail = count - pos ; if ( avail <= 0 ) { return - 1 ; } } int copy = Math . min ( len , avail ) ; int eol = findeol ( buf , pos , copy ) ; if ( eol != - 1 ) { copy = eol ; } System . arraycopy ( buf , pos , b , off , copy ) ; pos += copy ; total += copy ; while ( total < len && eol == - 1 ) { fill ( ) ; avail = count - pos ; if ( avail <= 0 ) { return total ; } copy = Math . min ( len - total , avail ) ; eol = findeol ( buf , pos , copy ) ; if ( eol != - 1 ) { copy = eol ; } System . arraycopy ( buf , pos , b , off + total , copy ) ; pos += copy ; total += copy ; } return total ; }

Implementar búfer en la parte superior del método <código> readline </ code> del envoltorio <code> servletutputstream </ code>.


private CART loadFromByteBuffer  ( String fileName ) throws IOException , MaryConfigurationException  { FileInputStream fis = new FileInputStream ( fileName ) ; FileChannel fc = fis . getChannel ( ) ; ByteBuffer bb = fc . map ( FileChannel . MapMode . READ_ONLY , 0 , fc . size ( ) ) ; fis . close ( ) ; MaryHeader maryHeader = new MaryHeader ( bb ) ; if ( ! maryHeader . hasCurrentVersion ( ) ) { throw new IOException ( "Wrong version of database file" ) ; } if ( maryHeader . getType ( ) != MaryHeader . CARTS ) { throw new IOException ( "No CARTs file" ) ; } short propDataLength = bb . getShort ( ) ; Properties props ; if ( propDataLength == 0 ) { props = null ; } else { byte [ ] propsData = new byte [ propDataLength ] ; bb . get ( propsData ) ; ByteArrayInputStream bais = new ByteArrayInputStream ( propsData ) ; props = new Properties ( ) ; props . load ( bais ) ; bais . close ( ) ; } FeatureDefinition featureDefinition = new FeatureDefinition ( bb ) ; int numDecNodes = bb . getInt ( ) ; DecisionNode [ ] dns = new DecisionNode [ numDecNodes ] ; int [ ] [ ] childIndexes = new int [ numDecNodes ] [ ] ; for ( int i = 0 ; i < numDecNodes ; i ++ ) { int featureNameIndex = bb . getInt ( ) ; int nodeTypeNr = bb . getInt ( ) ; DecisionNode . Type nodeType = DecisionNode . Type . values ( ) [ nodeTypeNr ] ; int numChildren = 2 ; switch ( nodeType ) { case BinaryByteDecisionNode : int criterion = bb . getInt ( ) ; dns [ i ] = new DecisionNode . BinaryByteDecisionNode ( featureNameIndex , ( byte ) criterion , featureDefinition ) ; break ; case BinaryShortDecisionNode : criterion = bb . getInt ( ) ; dns [ i ] = new DecisionNode . BinaryShortDecisionNode ( featureNameIndex , ( short ) criterion , featureDefinition ) ; break ; case BinaryFloatDecisionNode : float floatCriterion = bb . getFloat ( ) ; dns [ i ] = new DecisionNode . BinaryFloatDecisionNode ( featureNameIndex , floatCriterion , featureDefinition ) ; break ; case ByteDecisionNode : numChildren = bb . getInt ( ) ; if ( featureDefinition . getNumberOfValues ( featureNameIndex ) != numChildren ) { throw new IOException ( "Inconsistent cart file: feature " + featureDefinition . getFeatureName ( featureNameIndex ) + " should have " + featureDefinition . getNumberOfValues ( featureNameIndex ) + " values, but decision node " + i + " has only " + numChildren + " child nodes" ) ; } dns [ i ] = new DecisionNode . ByteDecisionNode ( featureNameIndex , numChildren , featureDefinition ) ; break ; case ShortDecisionNode : numChildren = bb . getInt ( ) ; if ( featureDefinition . getNumberOfValues ( featureNameIndex ) != numChildren ) { throw new IOException ( "Inconsistent cart file: feature " + featureDefinition . getFeatureName ( featureNameIndex ) + " should have " + featureDefinition . getNumberOfValues ( featureNameIndex ) + " values, but decision node " + i + " has only " + numChildren + " child nodes" ) ; } dns [ i ] = new DecisionNode . ShortDecisionNode ( featureNameIndex , numChildren , featureDefinition ) ; } childIndexes [ i ] = new int [ numChildren ] ; for ( int k = 0 ; k < numChildren ; k ++ ) { childIndexes [ i ] [ k ] = bb . getInt ( ) ; } } int numLeafNodes = bb . getInt ( ) ; LeafNode [ ] lns = new LeafNode [ numLeafNodes ] ; for ( int j = 0 ; j < numLeafNodes ; j ++ ) { int leafTypeNr = bb . getInt ( ) ; LeafNode . LeafType leafNodeType = LeafNode . LeafType . values ( ) [ leafTypeNr ] ; switch ( leafNodeType ) { case IntArrayLeafNode : int numData = bb . getInt ( ) ; int [ ] data = new int [ numData ] ; for ( int d = 0 ; d < numData ; d ++ ) { data [ d ] = bb . getInt ( ) ; } lns [ j ] = new LeafNode . IntArrayLeafNode ( data ) ; break ; case FloatLeafNode : float stddev = bb . getFloat ( ) ; float mean = bb . getFloat ( ) ; lns [ j ] = new LeafNode . FloatLeafNode ( new float [ ] { stddev , mean } ) ; break ; case IntAndFloatArrayLeafNode : case StringAndFloatLeafNode : int numPairs = bb . getInt ( ) ; int [ ] ints = new int [ numPairs ] ; float [ ] floats = new float [ numPairs ] ; for ( int d = 0 ; d < numPairs ; d ++ ) { ints [ d ] = bb . getInt ( ) ; floats [ d ] = bb . getFloat ( ) ; } if ( leafNodeType == LeafNode . LeafType . IntAndFloatArrayLeafNode ) lns [ j ] = new LeafNode . IntAndFloatArrayLeafNode ( ints , floats ) ; else lns [ j ] = new LeafNode . StringAndFloatLeafNode ( ints , floats ) ; break ; case FeatureVectorLeafNode : throw new IllegalArgumentException ( "Reading feature vector leaf nodes is not yet implemented" ) ; case PdfLeafNode : throw new IllegalArgumentException ( "Reading pdf leaf nodes is not yet implemented" ) ; } } for ( int i = 0 ; i < numDecNodes ; i ++ ) { for ( int k = 0 ; k < childIndexes [ i ] . length ; k ++ ) { int childIndex = childIndexes [ i ] [ k ] ; if ( childIndex < 0 ) { assert - childIndex - 1 < numDecNodes ; dns [ i ] . addDaughter ( dns [ - childIndex - 1 ] ) ; } else if ( childIndex > 0 ) { dns [ i ] . addDaughter ( lns [ childIndex - 1 ] ) ; } else { dns [ i ] . addDaughter ( null ) ; } } } Node rootNode ; if ( dns . length > 0 ) { rootNode = dns [ 0 ] ; ( ( DecisionNode ) rootNode ) . countData ( ) ; } else if ( lns . length > 0 ) { rootNode = lns [ 0 ] ; } else { rootNode = null ; } return new CART ( rootNode , featureDefinition , props ) ; }


@ Override public Grammar retrieveGrammar  ( XMLGrammarDescription gDesc ) { Grammar g = super . retrieveGrammar ( gDesc ) ; if ( g != null ) return g ; return fGrammarPool . retrieveGrammar ( gDesc ) ; }

Recuperar una gramática particular.Revisit: ¿Es necesario sincronizar esto ya que está leyendo?


public boolean canManage  ( UserGroup userGroup ) { return userGroup != null && CollectionUtils . containsAny ( groups , userGroup . getManagedByGroups ( ) ) ; }

Indica si este usuario puede administrar el grupo de usuarios dado.


public static boolean activeTest  ( Socket sock ) throws IOException { byte [ ] header ; header = packHeader ( FDFS_PROTO_CMD_ACTIVE_TEST , 0 , ( byte ) 0 ) ; sock . getOutputStream ( ) . write ( header ) ; RecvHeaderInfo headerInfo = recvHeader ( sock . getInputStream ( ) , TRACKER_PROTO_CMD_RESP , 0 ) ; return headerInfo . errno == 0 ? true : false ; }

Envíe el comando Active_Test al servidor, pruebe si la red está bien y el servidor está vivo


public void testApp  ( ) { assertTrue ( true ) ; }


public QueryTemplatePacket and  ( QueryTemplatePacket template ) { QueryTemplatePacket result = new QueryTemplatePacket ( this ) ; result . intersectRanges ( template ) ; result . intersectUids ( template ) ; result . uniteContainsItems ( template ) ; return result ; }

Fusionar plantillas dadas en una plantilla.


private void createUserLayerDataSources  ( ) { if ( inlineDataSource == null ) { ConsoleManager . getInstance ( ) . error ( this , "No inline data source creation object set" ) ; } else { userLayerDataSourceInfo = inlineDataSource . connect ( this . editorFileInterface ) ; if ( userLayerDataSourceInfo != null ) { for ( DataSourceInfo dsInfo : userLayerDataSourceInfo ) { if ( dsInfo . hasData ( ) ) { dsInfo . populateFieldMap ( ) ; } } } } }


@ Override public void undo  ( Transaction tx ) { }

No hace nada, porque el registro de registro de compensación es solo rehacer


public static void debug  ( Object message , Throwable exception ) { Gdx . app . debug ( TAG , String . valueOf ( message ) , exception ) ; }

Registra un mensaje de depuración a la consola o logcat


@ ManagedOperation ( description = "Start this JMS container." ) public void startContainer  ( String processName ) { LOGGER . info ( "Starting JMS container for Process " + processName ) ; jmsContainers . get ( processCache . getProcessId ( processName ) ) . start ( ) ; }

Para fines de gestión.Detiene el contenedor JMS.


public static < E , R > Stream < R > validate  ( Stream < E > stream , Predicate < ? super E > validator , Function < ? super E , ? extends R > transformingIfValid , Function < ? super E , ? extends R > transformingIfNotValid ) { Objects . requireNonNull ( stream ) ; Objects . requireNonNull ( validator ) ; Objects . requireNonNull ( transformingIfValid ) ; Objects . requireNonNull ( transformingIfNotValid ) ; ValidatingSpliterator . Builder < E , R > builder = new ValidatingSpliterator . Builder < > ( ) ; ValidatingSpliterator < E , R > spliterator = builder . with ( stream . spliterator ( ) ) . validatedBy ( validator ) . withValidFunction ( transformingIfValid ) . withNotValidFunction ( transformingIfNotValid ) . build ( ) ; return StreamSupport . stream ( spliterator , stream . isParallel ( ) ) . onClose ( null ) ; }

 Genera una corriente validando los elementos de un flujo de entrada uno por uno utilizando el predicado provisto.

 Se dice que un elemento del flujo de entrada es válido si el predicado provisto devuelve verdadero para este elemento.

 Se reemplaza un elemento válido en la corriente devuelta mediante la aplicación de los proporcionados.Función para elementos válidos.Un elemento no válido se reemplaza por la otra función.

 A <CÓDIGO> NULLPOINESEXCETCHE  será arrojado si uno de los elementos proporcionados es nulo.


public synchronized void post  ( Utterance utterance ) { if ( closed ) { throw new IllegalStateException ( "output queue closed" ) ; } while ( list . size ( ) >= size ) { try { wait ( ) ; } catch ( InterruptedException ie ) { } } list . add ( utterance ) ; notify ( ) ; }

Publica la expresión dada a la cola.Esta llamada bloqueará si la cola está llena.


public Sort ( ) { this  ( new String [ 0 ] , new boolean [ 0 ] ) ; }

Crea una nueva especificación de tipo vacío.


private String identifyClass  ( String string , RegExp regExp , Description descr ) { if ( null != regExp ) { Map < RegExp , String > regExpMap = descr . getRegExpMap ( ) ; String oneClass = regExpMap . get ( regExp ) ; if ( null != oneClass ) { return oneClass ; } } Map < String , RegExp > definitionsMap = descr . getDefinitionsMap ( ) ; for ( Map . Entry < String , RegExp > oneEntry : definitionsMap . entrySet ( ) ) { String oneClass = oneEntry . getKey ( ) ; RegExp oneRe = oneEntry . getValue ( ) ; if ( oneRe . matches ( string ) ) { return oneClass ; } } throw new ProcessingException ( String . format ( "could not find class for %s" , string ) ) ; }

Identifica la clase de la cadena dada y devuelve el nombre de la clase correspondiente para la anotación.


public boolean canHaveMultipleShapes  ( ) { return canHaveMultipleShapes ; }

Cheques Si el tipo de forma puede tener formas múltiples.


public static void override  ( List < FileSystemInterface > overrideExtensionList ) { if ( overrideExtensionList != null ) { extensionList = overrideExtensionList ; } else { extensionList . clear ( ) ; } }

Permite anular la lista de extensiones de archivo.


static boolean isWeekend  ( int dayOfWeek , @ Constants . Weekend int weekendValue ) { switch ( weekendValue ) { case Constants . Weekend . SATURDAY_SUNDAY : return Calendar . SATURDAY == dayOfWeek || Calendar . SUNDAY == dayOfWeek ; case Constants . Weekend . FRIDAY_SATURDAY : return Calendar . FRIDAY == dayOfWeek || Calendar . SATURDAY == dayOfWeek ; case Constants . Weekend . THURSDAY_FRIDAY : return Calendar . THURSDAY == dayOfWeek || Calendar . FRIDAY == dayOfWeek ; case Constants . Weekend . FRIDAY_ONLY : return Calendar . FRIDAY == dayOfWeek ; case Constants . Weekend . SATURDAY_ONLY : return Calendar . SATURDAY == dayOfWeek ; case Constants . Weekend . SUNDAY_ONLY : return Calendar . SUNDAY == dayOfWeek ; default : return false ; } }

Determina si el día de la semana pasado es el fin de semana.


public String optString  ( String key ) { return this . optString ( key , "" ) ; }

Obtenga una cadena opcional asociada con una tecla.Devuelve una cadena vacía si no hay tal clave.Si el valor no es una cadena y no es nulo, entonces se convierte en una cadena.


private static boolean typeEquals  ( ParameterizedType from , ParameterizedType to , Map < String , Type > typeVarMap ) { if ( from . getRawType ( ) . equals ( to . getRawType ( ) ) ) { Type [ ] fromArgs = from . getActualTypeArguments ( ) ; Type [ ] toArgs = to . getActualTypeArguments ( ) ; for ( int i = 0 ; i < fromArgs . length ; i ++ ) { if ( ! matches ( fromArgs [ i ] , toArgs [ i ] , typeVarMap ) ) { return false ; } } return true ; } return false ; }

Compruebe si dos tipos parametrizados son exactamente iguales, bajo el reemplazo de la variable descrito en TypeVarMap.


public static void show  ( Context context , CharSequence msg , int duration ) { show ( context , msg , duration , DEFAULT_GRAVITY ) ; }

Mostrar solicitud o tostadas a nivel de actividad.


public static WebXml parseWebXmlFile  ( String webXmlFileLocation , boolean validate ) throws IOException , SAXException { Assert . notEmpty ( "webXmlFileLocation" , webXmlFileLocation ) ; WebXml result = webXmlCache . get ( webXmlFileLocation ) ; if ( result == null ) { File file = new File ( webXmlFileLocation ) ; if ( ! file . exists ( ) ) { throw new IllegalArgumentException ( webXmlFileLocation + " does not exist." ) ; } boolean namespaceAware = true ; InputStream is = new FileInputStream ( file ) ; result = new WebXml ( ) ; LocalResolver lr = new LocalResolver ( new DefaultHandler ( ) ) ; ErrorHandler handler = new LocalErrorHandler ( webXmlFileLocation , lr ) ; Digester digester = DigesterFactory . newDigester ( validate , namespaceAware , new WebRuleSet ( ) , false ) ; digester . getParser ( ) ; digester . push ( result ) ; digester . setErrorHandler ( handler ) ; try { digester . parse ( new InputSource ( is ) ) ; } finally { digester . reset ( ) ; if ( is != null ) { try { is . close ( ) ; } catch ( Throwable t ) { Debug . logError ( t , "Exception thrown while parsing " + webXmlFileLocation + ": " , module ) ; } } } result = webXmlCache . putIfAbsentAndGet ( webXmlFileLocation , result ) ; } return result ; }

Analiza el archivo <codigo> web.xml </ código> en una instancia <código> webxml </ código>.


public AccountSetOnlineQuery ( VkApiClient client , UserActor actor ) { super ( client , "account.setOnline" , OkResponse . class ) ; accessToken ( actor . getAccessToken ( ) ) ; }

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


public static boolean canLearnMoreExpertCraftingSkill  ( Player player ) { return getTotalExpertCraftingSkills ( player ) + getTotalMasterCraftingSkills ( player ) < CraftConfig . MAX_EXPERT_CRAFTING_SKILLS ; }

Compruebe si el jugador puede aprender más habilidad de elaboración de expertos o no (max es 2)


private void writeUncompressedImage  ( Uri src , Uri dest ) throws FileNotFoundException , IOException  { FileInputStream fis = null ; OutputStream os = null ; try { fis = new FileInputStream ( FileHelper . stripFileProtocol ( src . toString ( ) ) ) ; os = this . cordova . getActivity ( ) . getContentResolver ( ) . openOutputStream ( dest ) ; byte [ ] buffer = new byte [ 4096 ] ; int len ; while ( ( len = fis . read ( buffer ) ) != - 1 ) { os . write ( buffer , 0 , len ) ; } os . flush ( ) ; } finally { if ( os != null ) { try { os . close ( ) ; } catch ( IOException e ) { LOG . d ( LOG_TAG , "Exception while closing output stream." ) ; } } if ( fis != null ) { try { fis . close ( ) ; } catch ( IOException e ) { LOG . d ( LOG_TAG , "Exception while closing file input stream." ) ; } } } }

En el caso especial donde se mantienen sin cambios la anchura, la altura y la calidad predeterminadas, simplemente escribimos el archivo al disco guardando la función costosa de bitmap.compress.


public static final double newtonMetersToFootPounds  ( double newtonMeters ) { return newtonMeters * NEWTON_METER_TO_FOOT_POUND ; }

Convierte a Newton-metros a libras de pie.


@ Override protected void sample  ( boolean forced ) throws InterruptedException  { Client client = myClient ; IDevice device = client != null ? client . getDevice ( ) : null ; if ( device == null ) { return ; } if ( myUid < 0 ) { int pid = client . getClientData ( ) . getPid ( ) ; myUid = getUidFromPid ( pid , device ) ; if ( myUid < 0 ) { return ; } } NetworkStatsReceiver receiver = new NetworkStatsReceiver ( myUid ) ; String command = "cat " + NETWORK_STATS_FILE + " | grep " + receiver . getUid ( ) ; int myDataType = TYPE_DATA ; try { device . executeShellCommand ( command , receiver , MAX_TIMEOUT_SECOND , TimeUnit . SECONDS ) ; } catch ( TimeoutException timeoutException ) { myDataType = TYPE_TIMEOUT ; } catch ( AdbCommandRejectedException commandRejectedException ) { myDataType = TYPE_UNREACHABLE ; } catch ( ShellCommandUnresponsiveException commandUnresponsiveException ) { myDataType = TYPE_UNREACHABLE ; } catch ( IOException ioException ) { myDataType = TYPE_UNREACHABLE ; } if ( receiver . isFileMissing ( ) || myDataType != TYPE_DATA ) { return ; } if ( myStartingRxBytes < 0 ) { myStartingRxBytes = receiver . getRxBytes ( ) ; myStartingTxBytes = receiver . getTxBytes ( ) ; } else { myTimelineData . add ( System . currentTimeMillis ( ) , myDataType , ( receiver . getRxBytes ( ) - myStartingRxBytes ) / 1024.f , ( receiver . getTxBytes ( ) - myStartingTxBytes ) / 1024.f ) ; } }

Muestra el uso de la red que pertenece al dispositivo y la aplicación conectados.


public AemContextMenu open  ( final WebElement webElement ) { bobcatWait . withTimeout ( Timeouts . BIG ) . until ( null , 2 ) ; return this ; }

Abre el menú contextual en el webelement deseado


public static boolean isIntermediateTable  ( String tableName , SQLiteDatabase db ) { if ( ! TextUtils . isEmpty ( tableName ) ) { if ( tableName . matches ( "[0-9a-zA-Z]+_[0-9a-zA-Z]+" ) ) { Cursor cursor = null ; try { cursor = db . query ( Const . TableSchema . TABLE_NAME , null , null , null , null , null , null ) ; if ( cursor . moveToFirst ( ) ) { do { String tableNameDB = cursor . getString ( cursor . getColumnIndexOrThrow ( Const . TableSchema . COLUMN_NAME ) ) ; if ( tableName . equalsIgnoreCase ( tableNameDB ) ) { int tableType = cursor . getInt ( cursor . getColumnIndexOrThrow ( Const . TableSchema . COLUMN_TYPE ) ) ; if ( tableType == Const . TableSchema . INTERMEDIATE_JOIN_TABLE ) { return true ; } break ; } } while ( cursor . moveToNext ( ) ) ; } } catch ( Exception e ) { e . printStackTrace ( ) ; } finally { if ( cursor != null ) { cursor . close ( ) ; } } } } return false ; }

Juzgar el nombre de la tabla es una tabla intermedia o no.


public static Director newProject  ( boolean visible ) { return newProject ( visible , false ) ; }


public BigReal ( int val ) { d = new BigDecimal ( val ) ; }


public String toString  ( ) { return getName ( ) ; }

Devuelve una representación de cadena de este objeto.


public void simulateMethod  ( SootMethod method , ReferenceVariable thisVar , ReferenceVariable returnVar , ReferenceVariable params [ ] ) { String subSignature = method . getSubSignature ( ) ; if ( subSignature . equals ( "java.lang.Object doPrivileged(java.security.PrivilegedAction)" ) ) { java_security_AccessController_doPrivileged ( method , thisVar , returnVar , params ) ; return ; } else if ( subSignature . equals ( "java.lang.Object doPrivileged(java.security.PrivilegedExceptionAction)" ) ) { java_security_AccessController_doPrivileged ( method , thisVar , returnVar , params ) ; return ; } else if ( subSignature . equals ( "java.lang.Object doPrivileged(java.security.PrivilegedAction,java.security.AccessControlContext)" ) ) { java_security_AccessController_doPrivileged ( method , thisVar , returnVar , params ) ; return ; } else if ( subSignature . equals ( "java.lang.Object doPrivileged(java.security.PrivilegedExceptionAction,java.security.AccessControlContext)" ) ) { java_security_AccessController_doPrivileged ( method , thisVar , returnVar , params ) ; return ; } else if ( subSignature . equals ( "java.security.AccessControlContext getStackAccessControlContext()" ) ) { java_security_AccessController_getStackAccessControlContext ( method , thisVar , returnVar , params ) ; return ; } else if ( subSignature . equals ( "java.security.AccessControlContext getInheritedAccessControlContext()" ) ) { java_security_AccessController_getInheritedAccessControlContext ( method , thisVar , returnVar , params ) ; return ; } else { defaultMethod ( method , thisVar , returnVar , params ) ; return ; } }

Implementa el método abstracto simulatemethod.Distribuye la solicitud a los métodos correspondientes por las firmas.


public static int tryParseInt  ( String toParse , String defaultValue ) { int result ; try { result = Integer . parseInt ( toParse ) ; } catch ( NumberFormatException ex ) { result = Integer . parseInt ( defaultValue ) ; } return result ; }

Similar a la C # int.tryParse donde pasa en una cadena y si no es bueno, usará el valor predeterminado, que también está analizado ... lo que parece extraño ahora, pienso en ello, para investigar si el segundo argumento podría ser un INT


public String [ ] match  ( String value ) { if ( value == null ) { return new String [ 0 ] ; } for ( int i = 0 ; i < patterns . length ; i ++ ) { Matcher matcher = patterns [ i ] . matcher ( value ) ; if ( matcher . matches ( ) ) { int count = matcher . groupCount ( ) ; String [ ] groups = new String [ count ] ; for ( int j = 0 ; j < count ; j ++ ) { groups [ j ] = matcher . group ( j + 1 ) ; } return groups ; } } return new String [ 0 ] ; }

Valide un valor contra el conjunto de expresiones regulares que devuelven la matriz de grupos emparejados.


public static BtHelperClient from  ( Context context ) { if ( sBtHelperClient == null ) { synchronized ( BtHelperClient . class ) { if ( sBtHelperClient == null ) sBtHelperClient = new BtHelperClient ( context ) ; } } return sBtHelperClient ; }

Obtiene el bthelperclient del contexto dado.


private static String buildMessage  ( String format , Object ... args ) { String msg = ( args == null ) ? format : String . format ( Locale . US , format , args ) ; StackTraceElement [ ] trace = new Throwable ( ) . fillInStackTrace ( ) . getStackTrace ( ) ; String caller = "<unknown>" ; for ( int i = 2 ; i < trace . length ; i ++ ) { Class < ? > clazz = trace [ i ] . getClass ( ) ; if ( ! clazz . equals ( VolleyLog . class ) ) { String callingClass = trace [ i ] . getClassName ( ) ; callingClass = callingClass . substring ( callingClass . lastIndexOf ( '.' ) + 1 ) ; callingClass = callingClass . substring ( callingClass . lastIndexOf ( '$' ) + 1 ) ; caller = callingClass + "." + trace [ i ] . getMethodName ( ) ; break ; } } return String . format ( Locale . US , "[%d] %s: %s" , Thread . currentThread ( ) . getId ( ) , caller , msg ) ; }

Formatos El mensaje proporcionado por la persona que llama y prepara información útil como la identificación del hilo de llamada y el nombre del método.


public InputStreamInputSplit ( InputStream is , String path ) { this . is = is ; this . location = new URI [ ] { URI . create ( path ) } ; }

Instantiate con el archivo dado como uri.


@ Override public void actionPerformed  ( ActionEvent ev ) { executeImmediately ( getSyntax ( ) ) ; }


public synchronized int status  ( ) { return this . status ; }


public void useDarkTheme  ( boolean flag ) { MaterialPrefUtil . useDarkTheme ( flag ) ; }

Establecer tema de la pantalla de configuración


protected MarketEditQuery ownerId  ( int value ) { return unsafeParam ( "owner_id" , value ) ; }

Identificador de una comunidad de propietario de un artículo Tenga en cuenta que la identificación de la comunidad en el parámetro 'propietario_id' debe ser un número negativo.Por ejemplo, 'propietario_id' = - 1 coincide con la comunidad [vk.com/apiclub|vk api]