Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 31 - 40 of 218 for Idx (0.01 seconds)

  1. docs/site-replication/run-replication-with-checksum-header.sh

    PARTS=""
    for idx in {1..10}; do
    	F_SUFFIX=$(num_to_alpha "$idx")
    	PART_CHKSUM=$(openssl dgst -sha256 -binary <"xa${F_SUFFIX}" | base64)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Jan 20 14:49:07 GMT 2025
    - 11.5K bytes
    - Click Count (0)
  2. internal/s3select/csv/recordtransform.go

    	if len(rr.recordDelimiter) == 1 {
    		for idx := 0; idx < len(p); {
    			i := bytes.Index(p[idx:], rr.recordDelimiter)
    			if i < 0 {
    				break
    			}
    			idx += i
    			p[idx] = '\n'
    		}
    		return n, nil
    	}
    
    	// 2 characters...
    	for idx := 0; idx < len(p); {
    		i := bytes.Index(p[idx:], rr.recordDelimiter)
    		if i < 0 {
    			break
    		}
    		idx += i
    
    		p[idx] = '\n'
    		p = append(p[:idx+1], p[idx+2:]...)
    		n--
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Jun 01 21:59:40 GMT 2021
    - 2.1K bytes
    - Click Count (0)
  3. callbacks/helper.go

    					columns = append(columns, k)
    				} else {
    					continue
    				}
    			}
    
    			result[k][idx] = v
    		}
    	}
    
    	sort.Strings(columns)
    	values.Values = make([][]interface{}, len(mapValues))
    	values.Columns = make([]clause.Column, len(columns))
    	for idx, column := range columns {
    		values.Columns[idx] = clause.Column{Name: column}
    
    		for i, v := range result[column] {
    			if len(values.Values[i]) == 0 {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Thu Apr 14 12:32:57 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  4. src/main/java/jcifs/internal/smb2/nego/Smb2RdmaTransformCapabilitiesContext.java

            int idx = 0;
            SMBUtil.writeInt2(transformCount, data, idx);
            idx += 2;
            SMBUtil.writeInt2(reserved1, data, idx);
            idx += 2;
            SMBUtil.writeInt4(reserved2, data, idx);
            idx += 4;
    
            // SMB_DIRECT_RDMA_TRANSFORM array (only one element)
            SMBUtil.writeInt2(rdmaTransformId, data, idx);
            idx += 2;
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 24 00:12:28 GMT 2025
    - 4.4K bytes
    - Click Count (0)
  5. schema/index.go

    			for _, index := range fieldIndexes {
    				idx := indexesByName[index.Name]
    				if idx == nil {
    					idx = &Index{Name: index.Name}
    					indexesByName[index.Name] = idx
    					indexes = append(indexes, idx)
    				}
    				idx.Name = index.Name
    				if idx.Class == "" {
    					idx.Class = index.Class
    				}
    				if idx.Type == "" {
    					idx.Type = index.Type
    				}
    				if idx.Where == "" {
    					idx.Where = index.Where
    				}
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Wed May 21 02:35:56 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  6. migrator/index.go

    // Table return the table name of the index.
    func (idx Index) Table() string {
    	return idx.TableName
    }
    
    // Name return the name of the index.
    func (idx Index) Name() string {
    	return idx.NameValue
    }
    
    // Columns return the columns of the index
    func (idx Index) Columns() []string {
    	return idx.ColumnList
    }
    
    // PrimaryKey returns the index is primary key or not.
    func (idx Index) PrimaryKey() (isPrimaryKey bool, ok bool) {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Tue Apr 11 02:32:46 GMT 2023
    - 1023 bytes
    - Click Count (0)
  7. src/main/java/org/codelibs/fess/crawler/transformer/FessTransformer.java

            }
    
            int idx = 0;
            String u = url;
            if (u.startsWith("https:") || u.startsWith("http:")) {
                idx = u.lastIndexOf('?');
                if (idx >= 0) {
                    u = u.substring(0, idx);
                }
    
                idx = u.lastIndexOf('#');
                if (idx >= 0) {
                    u = u.substring(0, idx);
                }
            }
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Dec 11 09:47:03 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  8. 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)
  9. 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)
  10. clause/where.go

    			where.Exprs = andCondition.Exprs
    		}
    	}
    
    	// Switch position if the first query expression is a single Or condition
    	for idx, expr := range where.Exprs {
    		if v, ok := expr.(OrConditions); !ok || len(v.Exprs) > 1 {
    			if idx != 0 {
    				where.Exprs[0], where.Exprs[idx] = where.Exprs[idx], where.Exprs[0]
    			}
    			break
    		}
    	}
    
    	buildExprs(where.Exprs, builder, AndWithSpace)
    }
    
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Thu Apr 25 12:22:53 GMT 2024
    - 5.1K bytes
    - Click Count (0)
Back to Top