Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 37 for fiets (0.05 sec)

  1. src/archive/tar/strconv.go

    	// Add leading zeros, but leave room for a NUL.
    	if n := len(b) - len(s) - 1; n > 0 {
    		s = strings.Repeat("0", n) + s
    	}
    	f.formatString(b, s)
    }
    
    // fitsInOctal reports whether the integer x fits in a field n-bytes long
    // using octal encoding with the appropriate NUL terminator.
    func fitsInOctal(n int, x int64) bool {
    	octBits := uint(n-1) * 3
    	return x >= 0 && (n >= 22 || x < 1<<octBits)
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Aug 01 14:28:42 UTC 2023
    - 9K bytes
    - Viewed (0)
  2. fess-crawler-lasta/src/main/resources/crawler/extractor.xml

    				"application/vnd.f-secure.mobile",
    				"application/vnd.fdf",
    				"application/vnd.fdsn.mseed",
    				"application/vnd.fdsn.seed",
    				"application/vnd.ffsns",
    				"application/vnd.fints",
    				"application/vnd.flographit",
    				"application/vnd.fluxtime.clip",
    				"application/vnd.font-fontforge-sfd",
    				"application/vnd.framemaker",
    				"application/vnd.frogans.fnc",
    Registered: Sun Nov 10 03:50:12 UTC 2024
    - Last Modified: Sat Aug 01 21:40:30 UTC 2020
    - 49K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/LongMath.java

      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/math/LongMath.java

      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  5. common-protos/k8s.io/api/resource/v1alpha2/generated.proto

      // ResourceClaimSpec.
      // +optional
      optional ResourceClassParametersReference parametersRef = 3;
    
      // Only nodes matching the selector will be considered by the scheduler
      // when trying to find a Node that fits a Pod when that Pod uses
      // a ResourceClaim that has not been allocated yet.
      //
      // Setting this field is optional. If null, all nodes are candidates.
      // +optional
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 14.4K bytes
    - Viewed (0)
  6. src/archive/zip/zip_test.go

    	if testing.Short() {
    		t.Skip("slow test; skipping")
    	}
    	t.Parallel()
    	// Test a zip file with uncompressed size 0xFFFFFFFF.
    	// That's the magic marker for a 64-bit file, so even though
    	// it fits in a 32-bit field we must use the 64-bit field.
    	// Go 1.5 and earlier got this wrong,
    	// writing an invalid zip file.
    	const size = 1<<32 - 1 - int64(len("END\n")) // before the "END\n" part
    	buf := testZip64(t, size)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 19.6K bytes
    - Viewed (0)
  7. src/bytes/buffer.go

    	i := copy(b2, b)
    	return b2[:i]
    }
    
    // WriteTo writes data to w until the buffer is drained or an error occurs.
    // The return value n is the number of bytes written; it always fits into an
    // int, but it is int64 to match the [io.WriterTo] interface. Any error
    // encountered during the write is also returned.
    func (b *Buffer) WriteTo(w io.Writer) (n int64, err error) {
    	b.lastRead = opInvalid
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Oct 29 16:47:05 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  8. LICENSE

    a shared library, the combination of the two is legally speaking a
    combined work, a derivative of the original library.  The ordinary
    General Public License therefore permits such linking only if the
    entire combination fits its criteria of freedom.  The Lesser General
    Public License permits more lax criteria for linking other code with
    the library.
    
      We call this license the "Lesser" General Public License because it
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Mon Jan 18 20:25:38 UTC 2016
    - 25.8K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb/SmbTransportImpl.java

                        // don't have enough credits/space for the first request, block until available
                        // for space there is nothing we can do, callers need to make sure that a single message fits
    
                        try {
                            long timeout = getResponseTimeout(chain);
                            if ( params.contains(RequestParam.NO_TIMEOUT) ) {
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Wed Jan 18 23:47:00 UTC 2023
    - 67K bytes
    - Viewed (0)
  10. fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml

      <mime-type type="application/eshop"/>
      <mime-type type="application/example"/>
      <mime-type type="application/fastinfoset"/>
      <mime-type type="application/fastsoap"/>
    
      <mime-type type="application/fits">
        <acronym>FITS</acronym>
        <_comment>Flexible Image Transport System</_comment>
        <tika:link>http://www.digitalpreservation.gov/formats/fdd/fdd000317.shtml</tika:link>
        <magic priority="50">
    Registered: Sun Nov 10 03:50:12 UTC 2024
    - Last Modified: Thu Sep 21 06:46:43 UTC 2023
    - 298.5K bytes
    - Viewed (0)
Back to top