Search Options

Results per page
Sort
Preferred Languages
Advance

Results 121 - 130 of 344 for noop (0.03 sec)

  1. android/guava/src/com/google/common/graph/DirectedGraphConnections.java

        int successorCount = 0;
    
        for (EndpointPair<N> incidentEdge : incidentEdges) {
          if (incidentEdge.nodeU().equals(thisNode) && incidentEdge.nodeV().equals(thisNode)) {
            // incidentEdge is a self-loop
    
            adjacentNodeValues.put(thisNode, new PredAndSucc(successorNodeToValueFn.apply(thisNode)));
    
            orderedNodeConnectionsBuilder.add(new NodeConnection.Pred<>(thisNode));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 20 17:00:05 UTC 2024
    - 18K bytes
    - Viewed (0)
  2. callbacks/associations.go

    	}
    
    	return
    }
    
    func saveAssociations(db *gorm.DB, rel *schema.Relationship, rValues reflect.Value, selectColumns map[string]bool, restricted bool, defaultUpdatingColumns []string) error {
    	// stop save association loop
    	if checkAssociationsSaved(db, rValues) {
    		return nil
    	}
    
    	var (
    		selects, omits []string
    		onConflict     = onConflictOption(db.Statement, rel.FieldSchema, defaultUpdatingColumns)
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Tue Apr 11 03:06:13 UTC 2023
    - 14.3K bytes
    - Viewed (0)
  3. fess-crawler/src/main/java/org/codelibs/fess/crawler/transformer/impl/HtmlTransformer.java

            try {
                final EncodingHelper encodingHelper = crawlerContainer.getComponent("encodingHelper");
                return encodingHelper.normalize(encoding);
            } catch (final Exception e) {
                // NOP
            }
            return encoding;
        }
    
        protected String parseCharset(final String content) {
            final Pattern pattern = Pattern.compile("; *charset *= *([a-zA-Z0-9\\-_]+)", Pattern.CASE_INSENSITIVE);
    Registered: Sun Nov 10 03:50:12 UTC 2024
    - Last Modified: Thu Oct 24 12:16:00 UTC 2024
    - 19.4K bytes
    - Viewed (0)
  4. gradlew

            # Roll the args list around exactly as many times as the number of
            # args, so each arg winds up back in the position where it started, but
            # possibly modified.
            #
            # NB: a `for` loop captures its iteration list before it begins, so
            # changing the positional parameters here affects neither the number of
            # iterations, nor the values presented in `arg`.
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Dec 24 09:00:26 UTC 2023
    - 8.5K bytes
    - Viewed (0)
  5. cmd/site-replication-utils.go

    	go s.init(ctx)
    	return &s
    }
    
    // init site resync metrics
    func (sm *siteResyncMetrics) init(ctx context.Context) {
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	// Run the site resync metrics load in a loop
    	for {
    		if err := sm.load(ctx, newObjectLayerFn()); err == nil {
    			<-ctx.Done()
    			return
    		}
    		duration := time.Duration(r.Float64() * float64(time.Second*10))
    		if duration < time.Second {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  6. helm-releases/minio-3.6.4.tgz

    event of a failed command. {{- if .Values.configPathmc }} MC_CONFIG_DIR="{{ .Values.configPathmc }}" MC="/usr/bin/mc --insecure --config-dir ${MC_CONFIG_DIR}" {{- else }} MC="/usr/bin/mc --insecure" {{- end }} # connectToMinio # Use a check-sleep-check loop to wait for MinIO service to be available connectToMinio() { SCHEME=$1 ATTEMPTS=0 ; LIMIT=29 ; # Allow 30 attempts set -e ; # fail if we can't read the keys. ACCESS=$(cat /config/rootUser) ; SECRET=$(cat /config/rootPassword) ; set +e ; # The connections...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Apr 12 01:30:28 UTC 2022
    - 17.9K bytes
    - Viewed (0)
  7. src/main/java/org/codelibs/fess/thumbnail/impl/BaseThumbnailGenerator.java

                    }
                }
                throw new ThumbnailGenerationException("Failed to process a thumbnail content: " + url + " (Redirect Loop)");
            });
        }
    
        public void setGeneratorList(final List<String> generatorList) {
            this.generatorList = generatorList;
        }
    
        @Override
        public String getName() {
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/sso/spnego/SpnegoAuthenticator.java

                        logger.debug(msg);
                    }
                    throw new SsoLoginException(e.getMessage() + " " + msg, e);
                }
    
                // context/auth loop not yet complete
                final boolean status = spnegoResponse.isStatusSet();
                if (logger.isDebugEnabled()) {
                    logger.debug("isStatusSet: {}", status);
                }
                if (status) {
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 12 01:54:46 UTC 2024
    - 11.2K bytes
    - Viewed (0)
  9. okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt

       * simultaneously adopted and removed.
       */
      private val connections = ConcurrentLinkedQueue<RealConnection>()
    
      init {
        // Put a floor on the keep alive duration, otherwise cleanup will spin loop.
        require(keepAliveDuration > 0L) { "keepAliveDuration <= 0: $keepAliveDuration" }
      }
    
      fun idleConnectionCount(): Int {
        return connections.count {
          it.withLock { it.calls.isEmpty() }
        }
      }
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Apr 20 17:03:43 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  10. internal/dsync/drwmutex.go

    	isReadLock := true
    	return dm.lockBlocking(ctx, cancel, id, source, isReadLock, opts)
    }
    
    // lockBlocking will try to acquire either a read or a write lock
    //
    // The function will loop using a built-in timing randomized back-off
    // algorithm until either the lock is acquired successfully or more
    // time has elapsed than the timeout value.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 09 15:49:49 UTC 2024
    - 20.4K bytes
    - Viewed (0)
Back to top