Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 91 - 100 of 303 for oidx (0.25 seconds)

  1. src/bytes/boundary_test.go

    		for i := range b {
    			idx := Index(b[i:], q[:j])
    			if idx != -1 {
    				t.Fatalf("Index(b[%d:], q[:%d])=%d, want -1\n", i, j, idx)
    			}
    		}
    		q[j-1] = 0
    	}
    
    	// Test differing alignments and sizes of q which always end on a page boundary.
    	q[len(q)-1] = 1 // difference is only found on the last byte
    	for j := 0; j < len(q); j++ {
    		for i := range b {
    			idx := Index(b[i:], q[j:])
    			if idx != -1 {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Nov 30 20:05:58 GMT 2023
    - 2.8K bytes
    - Click Count (0)
  2. docs/debugging/xl-meta/main.go

    						}
    
    						hasParity := 0
    						parityOK := make([]bool, m.shards)
    						for idx, sh := range v {
    							splitData[idx] = sh
    							if idx >= k && len(sh) > 0 {
    								parityOK[idx] = true
    								hasParity++
    								for i := range splitFilled[idx] {
    									splitFilled[idx][i] = 1
    								}
    							}
    						}
    
    						splitDataShards := make([]byte, len(splitFilled[0]))
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 40.4K bytes
    - Click Count (0)
  3. clause/expression.go

    func (expr Expr) Build(builder Builder) {
    	var (
    		afterParenthesis bool
    		idx              int
    	)
    
    	for _, v := range []byte(expr.SQL) {
    		if v == '?' && len(expr.Vars) > idx {
    			if afterParenthesis || expr.WithoutParentheses {
    				processValue(builder, expr.Vars[idx])
    			} else {
    				builder.AddVar(builder, expr.Vars[idx])
    			}
    
    			idx++
    		} else {
    			if v == '(' {
    				afterParenthesis = true
    			} else {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Tue Nov 04 07:04:52 GMT 2025
    - 8K bytes
    - Click Count (0)
  4. src/main/java/jcifs/spnego/NegTokenTarg.java

        }
    
        /**
         * Gets the selected authentication mechanism OID
         * @return the mechanism OID
         */
        public ASN1ObjectIdentifier getMechanism() {
            return this.mechanism;
        }
    
        /**
         * Sets the selected authentication mechanism OID
         * @param mechanism the mechanism OID to set
         */
        public void setMechanism(final ASN1ObjectIdentifier mechanism) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 6.9K bytes
    - Click Count (0)
  5. callbacks.go

    			return true
    		}
    		return false
    	})
    
    	for _, c := range cs {
    		// show warning message the callback name already exists
    		if idx := getRIndex(names, c.name); idx > -1 && !c.replace && !c.remove && !cs[idx].remove {
    			c.processor.db.Logger.Warn(context.Background(), "duplicated callback `%s` from %s\n", c.name, utils.FileWithLineNum())
    		}
    		names = append(names, c.name)
    	}
    
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:26:07 GMT 2026
    - 8.8K bytes
    - Click Count (0)
  6. tensorflow/c/eager/c_api_unified_experimental_test.cc

      float results[2];
      for (int idx = 0; idx < 2; ++idx) {
        TF_AbstractTensor* result = TF_OutputListGet(func_outputs, idx);
        TFE_TensorHandle* handle = TF_AbstractTensorGetEagerTensor(result, s);
        ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
        TF_Tensor* f_t = TFE_TensorHandleResolve(handle, s);
        ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
        results[idx] = *static_cast<float*>(TF_TensorData(f_t));
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 39.1K bytes
    - Click Count (0)
  7. src/test/java/jcifs/internal/smb1/com/SmbComSetInformationResponseTest.java

            @ParameterizedTest
            @ValueSource(ints = { 0, 7 })
            @DisplayName("Returns 0 with valid array and various indices")
            void nonNullArray(int idx) {
                byte[] arr = new byte[10];
                assertEquals(0, response.writeBytesWireFormat(arr, idx));
            }
        }
    
        @Nested
        @DisplayName("readParameterWordsWireFormat tests")
        class ReadParameterWords {
    
            @Test
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 4.1K bytes
    - Click Count (0)
  8. cmd/object-api-deleteobject_test.go

    			continue
    		}
    
    		for idx := range result.Objects {
    			if result.Objects[idx].Name != testCase.objectsAfterDelete[idx] {
    				t.Errorf("Test %d: %s: Unexpected object found after delete, found = `%v`", i+1, instanceType, result.Objects[idx].Name)
    			}
    		}
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Aug 29 01:40:52 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  9. .teamcity/scripts/CheckRemoteProjectRef.java

                    continue;
                }
                int idx = trimmed.indexOf('=');
                if (idx < 0) {
                    continue;
                }
                String key = trimmed.substring(0, idx).trim();
                String value = trimmed.substring(idx + 1).trim();
                if (!key.isEmpty()) {
                    out.put(key, value);
                }
            }
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Tue Jan 20 03:53:25 GMT 2026
    - 3.4K bytes
    - Click Count (0)
  10. clause/expression_test.go

    		Result: "create table `users` (`id` int, `name` text)",
    	}}
    
    	for idx, result := range results {
    		t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) {
    			user, _ := schema.Parse(&tests.User{}, &sync.Map{}, db.NamingStrategy)
    			stmt := &gorm.Statement{DB: db, Table: user.Table, Schema: user, Clauses: map[string]clause.Clause{}}
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Tue Nov 04 07:04:52 GMT 2025
    - 8.9K bytes
    - Click Count (0)
Back to Top