Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1581 - 1590 of 1,819 for else (0.04 sec)

  1. lib/fips140/v1.0.0.zip

    corresponding coefficient. if u.IsOdd() == no { rshift1(u, 0) if A.IsOdd() == yes || B.IsOdd() == yes { rshift1(A, A.add(m)) rshift1(B, B.add(a)) } else { rshift1(A, 0) rshift1(B, 0) } } else { // v.IsOdd() == no rshift1(v, 0) if C.IsOdd() == yes || D.IsOdd() == yes { rshift1(C, C.add(m)) rshift1(D, D.add(a)) } else { rshift1(C, 0) rshift1(D, 0) } } if v.IsZero() == yes { return u, A, nil } } } //go:norace func rshift1(a *Nat, carry uint) { size := len(a.limbs) aLimbs := a.limbs[:size] for i := range...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
  2. tests/sql_builder_test.go

    	for rows.Next() {
    		var name string
    		var total int64
    		rows.Scan(&name, &total)
    
    		if name == users[0].Name && total != 3 {
    			t.Errorf("Should have one user having name %v", users[0].Name)
    		} else if name == users[1].Name && total != 1 {
    			t.Errorf("Should have two users having name %v", users[1].Name)
    		}
    	}
    }
    
    func TestQueryRaw(t *testing.T) {
    	users := []*User{
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Jul 21 02:46:58 UTC 2025
    - 16.7K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/util/ComponentUtil.java

         * @param process The process to run after container init.
         */
        public static void processAfterContainerInit(final Runnable process) {
            if (available()) {
                process.run();
            } else {
                initProcesses.add(process);
            }
        }
    
        /**
         * Executes all initialization processes.
         * @param action The action to perform on each initialization process.
         */
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 28.9K bytes
    - Viewed (0)
  4. cmd/bucket-replication-utils.go

    			},
    		}, oi, ObjectOptions{
    			Versioned:        globalBucketVersioningSys.PrefixEnabled(oi.Bucket, oi.Name),
    			VersionSuspended: globalBucketVersioningSys.PrefixSuspended(oi.Bucket, oi.Name),
    		}, nil)
    	} else {
    		dsc = mustReplicate(GlobalContext, oi.Bucket, oi.Name, getMustReplicateOptions(userDefined, oi.UserTags, "", replication.HealReplicationType, ObjectOptions{}))
    	}
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 26K bytes
    - Viewed (0)
  5. src/main/webapp/css/admin/bootstrap.min.css.map

    border-radius: 0.5rem;\n  transition: background-color 0.15s ease-in-out, border-color 0.15s ease-in-out, box-shadow 0.15s ease-in-out, -webkit-transform 0.15s ease-in-out;\n  transition: transform 0.15s ease-in-out, background-color 0.15s ease-in-out, border-color 0.15s ease-in-out, box-shadow 0.15s ease-in-out;\n  transition: transform 0.15s ease-in-out, background-color 0.15s ease-in-out, border-color 0.15s ease-in-out, box-shadow 0.15s ease-in-out, -webkit-transform 0.15s ease-in-out;\n}\n\n@media...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 639.3K bytes
    - Viewed (1)
  6. android/guava/src/com/google/common/graph/Graphs.java

          for (N node : graph.nodes()) {
            for (N reachableNode : reachableNodes(graph, node)) {
              transitiveClosure.putEdge(node, reachableNode);
            }
          }
        } else {
          // An optimization for the undirected case: for every node B reachable from node A,
          // node A and node B have the same reachability set.
          Set<N> visitedNodes = new HashSet<>();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  7. guava/src/com/google/common/graph/Graphs.java

          for (N node : graph.nodes()) {
            for (N reachableNode : reachableNodes(graph, node)) {
              transitiveClosure.putEdge(node, reachableNode);
            }
          }
        } else {
          // An optimization for the undirected case: for every node B reachable from node A,
          // node A and node B have the same reachability set.
          Set<N> visitedNodes = new HashSet<>();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  8. cmd/erasure-healing-common_test.go

    	for diskIndex := range erasureDisks {
    		if _, ok := diskFailures[diskIndex]; ok {
    			if !partNeedsHealing(dataErrsPerDisk[diskIndex]) {
    				t.Errorf("Disk expected to be healed, driveIndex: %d", diskIndex)
    			}
    		} else {
    			if partNeedsHealing(dataErrsPerDisk[diskIndex]) {
    				t.Errorf("Disk not expected to be healed, driveIndex: %d", diskIndex)
    			}
    		}
    	}
    }
    
    func TestCommonParities(t *testing.T) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  9. cmd/admin-router.go

    				return
    			}
    		}
    
    		// Apply http tracing "middleware" based on presence of flag.
    		var f2 http.HandlerFunc
    		if handlerFlags.Has(traceAllFlag) {
    			f2 = httpTraceAll(f)
    		} else {
    			f2 = httpTraceHdrs(f)
    		}
    
    		// call the final handler
    		f2(w, r)
    	}
    
    	// Enable compression of responses based on presence of flag.
    	if !handlerFlags.Has(noGZFlag) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 16 07:34:24 UTC 2025
    - 26.7K bytes
    - Viewed (0)
  10. cmd/peer-rest-server.go

    	values := v.Values()
    	var types madmin.MetricType
    	if t, _ := strconv.ParseUint(values.Get(peerRESTMetricsTypes), 10, 64); t != 0 {
    		types = madmin.MetricType(t)
    	} else {
    		types = madmin.MetricsAll
    	}
    
    	diskMap := make(map[string]struct{})
    	for _, disk := range values[peerRESTDisk] {
    		diskMap[disk] = struct{}{}
    	}
    
    	hostMap := make(map[string]struct{})
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 53.4K bytes
    - Viewed (0)
Back to top