Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 367 for holes (0.06 seconds)

  1. internal/kms/context.go

    			case '\t':
    				dst.WriteByte('t')
    			default:
    				// This encodes bytes < 0x20 except for \t, \n and \r.
    				// If escapeHTML is set, it also escapes <, >, and &
    				// because they can lead to security holes when
    				// user-controlled strings are rendered into JSON
    				// and served to some browsers.
    				dst.WriteString(`u00`)
    				dst.WriteByte(hexTable[b>>4])
    				dst.WriteByte(hexTable[b&0xF])
    			}
    			i++
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Jan 02 17:15:06 GMT 2022
    - 6K bytes
    - Click Count (0)
  2. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2.kt

            FLAGS[prefixFlag or frameFlag or FLAG_PADDED] =
              FLAGS[prefixFlag] + '|'.toString() + FLAGS[frameFlag] + "|PADDED"
          }
        }
    
        for (i in FLAGS.indices) { // Fill in holes with binary representation.
          if (FLAGS[i] == null) FLAGS[i] = BINARY[i]
        }
      }
    
      /**
       * Returns a human-readable representation of HTTP/2 frame headers.
       *
       * The format is:
       *
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 5.7K bytes
    - Click Count (0)
  3. android/guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java

        static final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) {
          List<Integer> elements = new ArrayList<>(elementsSet);
          /*
           * A ContiguousSet can't have holes. If a test demands a hole, it should be changed so that it
           * doesn't need one, or it should be suppressed for ContiguousSet.
           */
          for (int i = 0; i < elements.size() - 1; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 08 18:35:13 GMT 2025
    - 15.9K bytes
    - Click Count (0)
  4. guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java

        static final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) {
          List<Integer> elements = new ArrayList<>(elementsSet);
          /*
           * A ContiguousSet can't have holes. If a test demands a hole, it should be changed so that it
           * doesn't need one, or it should be suppressed for ContiguousSet.
           */
          for (int i = 0; i < elements.size() - 1; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 08 18:35:13 GMT 2025
    - 15.9K bytes
    - Click Count (0)
  5. src/archive/tar/common.go

    //		{Offset: 18, Length: 3},  // Data fragment for 18..20
    //	}
    //	var sph sparseHoles = []sparseEntry{
    //		{Offset: 0,  Length: 2},  // Hole fragment for 0..1
    //		{Offset: 7,  Length: 11}, // Hole fragment for 7..17
    //		{Offset: 21, Length: 4},  // Hole fragment for 21..24
    //	}
    //
    // Then the content of the resulting sparse file with a Header.Size of 25 is:
    //
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 24.5K bytes
    - Click Count (0)
  6. src/archive/tar/reader.go

    		} else { // In a hole fragment
    			nf = holeEnd - sr.pos
    			if sr.physicalRemaining() == 0 {
    				writeLastByte = true
    				nf--
    			}
    			_, err = ws.Seek(nf, io.SeekCurrent)
    		}
    		sr.pos += nf
    		if sr.pos >= holeEnd && len(sr.sp) > 1 {
    			sr.sp = sr.sp[1:] // Ensure last fragment always remains
    		}
    	}
    
    	// If the last fragment is a hole, then seek to 1-byte before EOF, and
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 26.9K bytes
    - Click Count (0)
  7. src/archive/tar/writer.go

    // The bytes read must match the number of remaining bytes in the current file.
    //
    // If the current file is sparse and r is an io.ReadSeeker,
    // then readFrom uses Seek to skip past holes defined in Header.SparseHoles,
    // assuming that skipped regions are all NULs.
    // This always reads the last byte to ensure r is the right size.
    //
    // TODO(dsnet): Re-export this when adding sparse file support.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Feb 03 16:38:43 GMT 2025
    - 19.7K bytes
    - Click Count (0)
  8. CHANGELOG/CHANGELOG-1.9.md

    #### **RBAC**
    
    *   New permissions have been added to default RBAC roles ([#52654](https://github.com/kubernetes/kubernetes/pull/52654),[ @liggitt](https://github.com/liggitt)):
        *   The default admin and edit roles now include read/write permissions
        *   The view role includes read permissions on poddisruptionbudget.policy resources.
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Tue Nov 16 10:46:27 GMT 2021
    - 313.7K bytes
    - Click Count (0)
  9. CHANGELOG/CHANGELOG-1.7.md

    * Fix credentials providers for docker sandbox image. ([#51870](https://github.com/kubernetes/kubernetes/pull/51870), [@feiskyer](https://github.com/feiskyer))
    * Fix security holes in GCE metadata proxy. ([#51302](https://github.com/kubernetes/kubernetes/pull/51302), [@ihmccreery](https://github.com/ihmccreery))
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu May 05 13:44:43 GMT 2022
    - 308.7K bytes
    - Click Count (1)
  10. src/main/java/org/codelibs/fess/helper/SearchLogHelper.java

            final String virtualHostKey;
    
            SearchLogContext(final FessConfig fessConfig, final String[] roles, final String userCode, final String userId,
                    final HttpServletRequest request, final String clientIp, final String virtualHostKey) {
                this.fessConfig = fessConfig;
                this.roles = roles;
                this.userCode = userCode;
                this.userId = userId;
                this.request = request;
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Mar 26 02:24:08 GMT 2026
    - 29.3K bytes
    - Click Count (0)
Back to Top