Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 501 - 510 of 802 for nprend (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/archive/tar/writer_test.go

    	for len(sa) > 0 && len(sb) > 0 {
    		if sa[0] == sb[0] {
    			ss = append(ss, identity+sa[0])
    		} else {
    			ss = append(ss, uniqueA+sa[0])
    			ss = append(ss, uniqueB+sb[0])
    		}
    		sa, sb = sa[1:], sb[1:]
    	}
    	for len(sa) > 0 {
    		ss = append(ss, uniqueA+sa[0])
    		sa = sa[1:]
    	}
    	for len(sb) > 0 {
    		ss = append(ss, uniqueB+sb[0])
    		sb = sb[1:]
    	}
    	return strings.Join(ss, "\n")
    }
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Dec 15 16:34:13 GMT 2025
    - 40.2K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/primitives/UnsignedLongs.java

        }
    
        // For pre-sizing a builder, just get the right order of magnitude
        StringBuilder builder = new StringBuilder(array.length * 5);
        builder.append(toString(array[0]));
        for (int i = 1; i < array.length; i++) {
          builder.append(separator).append(toString(array[i]));
        }
        return builder.toString();
      }
    
      /**
       * Returns a comparator that compares two arrays of unsigned {@code long} values <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 17.8K bytes
    - Click Count (0)
  3. tests/joins_test.go

    		*GetUser("slice-joins-3", Config{Company: true, Manager: true, Account: true}),
    	}
    
    	DB.Create(&users)
    
    	var userIDs []uint
    	for _, user := range users {
    		userIDs = append(userIDs, user.ID)
    	}
    
    	var users2 []User
    	if err := DB.Joins("Company").Joins("Manager").Joins("Account").Find(&users2, "users.id IN ?", userIDs).Error; err != nil {
    		t.Fatalf("Failed to load with joins, got error: %v", err)
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Sun May 25 07:40:40 GMT 2025
    - 15K bytes
    - Click Count (0)
  4. internal/s3select/sql/jsonpath_test.go

    )
    
    func getJSONStructs(b []byte) ([]any, error) {
    	dec := jstream.NewDecoder(bytes.NewBuffer(b), 0).ObjectAsKVS().MaxDepth(100)
    	var result []any
    	for parsedVal := range dec.Stream() {
    		result = append(result, parsedVal.Value)
    	}
    	if err := dec.Err(); err != nil {
    		return nil, err
    	}
    	return result, nil
    }
    
    func TestJsonpathEval(t *testing.T) {
    	f, err := os.Open(filepath.Join("jsondata", "books.json"))
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 2.7K bytes
    - Click Count (0)
  5. cmd/erasure-multipart.go

    		startTime := time.Now()
    		if split := strings.Split(uploadID, "x"); len(split) == 2 {
    			t, err := strconv.ParseInt(split[1], 10, 64)
    			if err == nil {
    				startTime = time.Unix(0, t)
    			}
    		}
    		uploads = append(uploads, MultipartInfo{
    			Bucket:    bucket,
    			Object:    object,
    			UploadID:  base64.RawURLEncoding.EncodeToString(fmt.Appendf(nil, "%s.%s", globalDeploymentID(), uploadID)),
    			Initiated: startTime,
    		})
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 24 04:05:31 GMT 2025
    - 47.1K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/TreeMultiset.java

        /** Constructor for the header node. */
        AvlNode() {
          this.elem = null;
          this.elemCount = 1;
        }
    
        // For discussion of pred() and succ(), see the comment on the pred and succ fields.
    
        private AvlNode<E> pred() {
          return requireNonNull(pred);
        }
    
        private AvlNode<E> succ() {
          return requireNonNull(succ);
        }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Dec 09 15:58:48 GMT 2025
    - 33.9K bytes
    - Click Count (0)
  7. cmd/bucket-handlers.go

    		if deleteResult.errInfo.Code != "" {
    			deleteErrors = append(deleteErrors, deleteResult.errInfo)
    		} else {
    			// All deletes on directory objects was with `nullVersionID`.
    			// Remove it from response.
    			if isDirObject(deleteResult.delInfo.ObjectName) && deleteResult.delInfo.VersionID == nullVersionID {
    				deleteResult.delInfo.VersionID = ""
    			}
    			deletedObjects = append(deletedObjects, deleteResult.delInfo)
    		}
    	}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 63.9K bytes
    - Click Count (0)
  8. compat/maven-model-builder/src/test/resources/poms/inheritance/plugin-configuration-expected.xml

                <parent>child</parent>
                <child>child</child>
                <parent-only>parent</parent-only>
              </defaults>
              <appends combine.children="append">
                <parent-only>parent</parent-only>
                <parent>parent</parent>
                <parent>child</parent>
                <child>child</child>
              </appends>
              <overrides combine.self="override">
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 2.9K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/CompactLinkedHashSet.java

      }
    
      private void setPredecessor(int entry, int pred) {
        requirePredecessors()[entry] = pred + 1;
      }
    
      private void setSucceeds(int pred, int succ) {
        if (pred == ENDPOINT) {
          firstEntry = succ;
        } else {
          setSuccessor(pred, succ);
        }
    
        if (succ == ENDPOINT) {
          lastEntry = pred;
        } else {
          setPredecessor(succ, pred);
        }
      }
    
      @Override
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Aug 06 14:59:07 GMT 2025
    - 9.4K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/CompactLinkedHashSet.java

      }
    
      private void setPredecessor(int entry, int pred) {
        requirePredecessors()[entry] = pred + 1;
      }
    
      private void setSucceeds(int pred, int succ) {
        if (pred == ENDPOINT) {
          firstEntry = succ;
        } else {
          setSuccessor(pred, succ);
        }
    
        if (succ == ENDPOINT) {
          lastEntry = pred;
        } else {
          setPredecessor(succ, pred);
        }
      }
    
      @Override
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Aug 06 14:59:07 GMT 2025
    - 9.6K bytes
    - Click Count (0)
Back to Top