Search Options

Results per page
Sort
Preferred Languages
Advance

Results 81 - 90 of 785 for Binary1 (0.45 sec)

  1. src/runtime/time_test.go

    		}
    		const magic = "\x00\x00PB"
    		if string(x[:len(magic)]) != magic {
    			return nil, errors.New("bad magic")
    		}
    		x = x[len(magic):]
    		time := binary.BigEndian.Uint64(x)
    		x = x[8:]
    		dlen := binary.BigEndian.Uint32(x)
    		x = x[4:]
    		data := string(x[:dlen])
    		x = x[dlen:]
    		frames = append(frames, fakeTimeFrame{time, data})
    	}
    	return frames, nil
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Mar 09 03:40:04 UTC 2024
    - 3.1K bytes
    - Viewed (0)
  2. platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/store/DefaultBinaryStore.java

                }
            }
            if (offset == -1) {
                offset = encoder.getWritePosition();
                if (offset == Integer.MAX_VALUE) {
                    throw new IllegalStateException("Unable to write to binary store. "
                            + "The bytes offset has reached a point where using it is unsafe. Please report this error.");
                }
            }
            try {
                write.write(encoder);
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Tue Apr 16 15:49:51 UTC 2024
    - 4.9K bytes
    - Viewed (0)
  3. apache-maven/src/main/appended-resources/licenses/BSD-3-Clause.txt

    Copyright <YEAR> <COPYRIGHT HOLDER>
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
    are met:
    
    1. Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
    
    2. Redistributions in binary form must reproduce the above copyright
    notice, this list of conditions and the following disclaimer in the
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Fri May 17 19:14:22 UTC 2024
    - 1.4K bytes
    - Viewed (0)
  4. platforms/software/build-init/src/main/java/org/gradle/buildinit/plugins/internal/GitAttributesGenerator.java

                    writer.println("*.bat           text eol=crlf");
                    writer.println();
                    writer.println("# Binary files should be left untouched");
                    writer.println("*.jar           binary");
                    writer.println();
                }
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Apr 15 12:54:54 UTC 2024
    - 1.9K bytes
    - Viewed (0)
  5. Dockerfile.hotfix

    # Download minio binary and signature file
    RUN curl -s -q https://dl.min.io/server/minio/hotfixes/linux-${TARGETARCH}/archive/minio.${RELEASE} -o /go/bin/minio && \
        curl -s -q https://dl.min.io/server/minio/hotfixes/linux-${TARGETARCH}/archive/minio.${RELEASE}.minisig -o /go/bin/minio.minisig && \
        chmod +x /go/bin/minio
    
    # Download mc binary and signature file
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Sat Mar 30 09:41:56 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  6. hack/verify-flags-underscore.py

    # Cargo culted from http://stackoverflow.com/questions/898669/how-can-i-detect-if-a-file-is-binary-non-text-in-python
    def is_binary(pathname):
        """Return true if the given filename is binary.
        @raise EnvironmentError: if the file does not exist or cannot be accessed.
        @attention: found @ http://bytes.com/topic/python/answers/21222-determine-file-type-binary-text on 6/08/2010
        @author: Trent Mick <******@****.***>
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Mar 01 06:06:51 UTC 2024
    - 4.3K bytes
    - Viewed (0)
  7. src/cmd/vendor/golang.org/x/build/LICENSE

    Copyright (c) 2009 The Go Authors. All rights reserved.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions are
    met:
    
       * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
       * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jan 24 13:01:26 UTC 2024
    - 1.4K bytes
    - Viewed (0)
  8. analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/scopes/DeclarationsInPackageProvider.kt

     *
     * [DeclarationsInPackageProvider] first tries the [FirSymbolNamesProvider] of the analysis session's underlying FIR session, because it
     * provides symbol names from binary libraries in Standalone mode, which the Standalone declaration provider does not contain (to avoid
     * stub-indexing binary libraries). And in general, querying the symbol names provider might be faster since its sets are cached, which is
    Registered: Wed Jun 12 09:53:16 UTC 2024
    - Last Modified: Thu Jun 06 17:44:50 UTC 2024
    - 5.3K bytes
    - Viewed (0)
  9. LICENSES/vendor/github.com/antlr4-go/antlr/v4/LICENSE

    Copyright (c) 2012-2023 The ANTLR Project. All rights reserved.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
    are met:
    
    1. Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
    
    2. Redistributions in binary form must reproduce the above copyright
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Apr 22 17:54:32 UTC 2024
    - 1.6K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/SortedLists.java

              @ParametricNullness E key,
              List<? extends E> list,
              int foundIndex) {
            // Of course, we have to use binary search to find the precise
            // breakpoint...
            int lower = 0;
            int upper = foundIndex;
            // Of course, we have to use binary search to find the precise breakpoint...
            // Everything between lower and upper inclusive compares at <= 0.
            while (lower < upper) {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 10.9K bytes
    - Viewed (0)
Back to top