Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 26 for mapped (0.19 sec)

  1. src/bytes/bytes.go

    	return Map(unicode.ToLower, s)
    }
    
    // ToTitle treats s as UTF-8-encoded bytes and returns a copy with all the Unicode letters mapped to their title case.
    func ToTitle(s []byte) []byte { return Map(unicode.ToTitle, s) }
    
    // ToUpperSpecial treats s as UTF-8-encoded bytes and returns a copy with all the Unicode letters mapped to their
    // upper case, giving priority to the special casing rules.
    func ToUpperSpecial(c unicode.SpecialCase, s []byte) []byte {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Feb 19 19:51:15 GMT 2024
    - 33.8K bytes
    - Viewed (0)
  2. src/cmd/cgo/doc.go

    found in the _cgo_export.h generated header, after any preambles
    copied from the cgo input files. Functions with multiple
    return values are mapped to functions returning a struct.
    
    Not all Go types can be mapped to C types in a useful way.
    Go struct types are not supported; use a C struct type.
    Go array types are not supported; use a C pointer.
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Sun Mar 31 09:02:45 GMT 2024
    - 42.1K bytes
    - Viewed (0)
  3. .github/ISSUE_TEMPLATE/01-pkgsite.yml

        validations:
          required: true
      - type: textarea
        id: actual-behavior
        attributes:
          label: "What did you see happen?"
        validations:
          required: true
      - type: textarea
        id: expected-behavior
        attributes:
          label: "What did you expect to see?"
        validations:
    Others
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Thu Jan 04 23:31:17 GMT 2024
    - 1.4K bytes
    - Viewed (0)
  4. doc/go1.17_spec.html

    s3 := append(s2, s0...)            // append a slice              s3 == []int{0, 0, 2, 3, 5, 7, 0, 0}
    s4 := append(s3[3:6], s3[2:]...)   // append overlapping slice    s4 == []int{3, 5, 7, 2, 3, 5, 7, 0, 0}
    
    var t []interface{}
    t = append(t, 42, 3.1415, "foo")   //                             t == []interface{}{42, 3.1415, "foo"}
    
    var b []byte
    b = append(b, "bar"...)            // append string contents      b == []byte{'b', 'a', 'r' }
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Thu Apr 11 20:22:45 GMT 2024
    - 211.6K bytes
    - Viewed (0)
  5. src/archive/zip/reader_test.go

    				if err != nil {
    					if !test.wantErr {
    						t.Errorf("%s: %v", path, err)
    					}
    					sawErr = true
    					return nil
    				}
    				files = append(files, path)
    				return nil
    			})
    			if err != nil {
    				t.Errorf("fs.WalkDir error: %v", err)
    			}
    			if test.wantErr && !sawErr {
    				t.Error("succeeded but want error")
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Mar 27 18:23:49 GMT 2024
    - 55.3K bytes
    - Viewed (0)
  6. src/bytes/buffer_test.go

    	bb.Grow(16 << 20)
    	b.SetBytes(int64(bb.Available()))
    	b.ReportAllocs()
    	for i := 0; i < b.N; i++ {
    		bb.Reset()
    		b := bb.AvailableBuffer()
    		b = b[:cap(b)] // use max capacity to simulate a large append operation
    		bb.Write(b)    // should be nearly infinitely fast
    	}
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Apr 26 13:31:36 GMT 2024
    - 18.6K bytes
    - Viewed (0)
  7. src/archive/tar/common.go

    			continue // Skip empty fragments
    		}
    		pre.Length = cur.Offset - pre.Offset
    		if pre.Length > 0 {
    			dst = append(dst, pre) // Only add non-empty fragments
    		}
    		pre.Offset = cur.endOffset()
    	}
    	pre.Length = size - pre.Offset // Possibly the only empty fragment
    	return append(dst, pre)
    }
    
    // fileState tracks the number of logical (includes sparse holes) and physical
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Mar 15 16:01:50 GMT 2024
    - 24.7K bytes
    - Viewed (2)
  8. doc/asm.html

    </p>
    
    <p>
    A data symbol marked with the <code>NOPTR</code> flag (see above)
    is treated as containing no pointers to runtime-allocated data.
    A data symbol with the <code>RODATA</code> flag
    is allocated in read-only memory and is therefore treated
    as implicitly marked <code>NOPTR</code>.
    A data symbol with a total size smaller than a pointer
    is also treated as implicitly marked <code>NOPTR</code>.
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Tue Nov 28 19:15:27 GMT 2023
    - 36.3K bytes
    - Viewed (0)
  9. src/bytes/bytes_test.go

    				b.Fatal("bad equal")
    			}
    		}
    		buf1[n-1] = '\x00'
    		buf2[n-1] = '\x00'
    	}
    }
    
    func BenchmarkEqualBothUnaligned(b *testing.B) {
    	sizes := []int{64, 4 << 10}
    	if !isRaceBuilder {
    		sizes = append(sizes, []int{4 << 20, 64 << 20}...)
    	}
    	maxSize := 2 * (sizes[len(sizes)-1] + 8)
    	if len(bmbuf) < maxSize {
    		bmbuf = make([]byte, maxSize)
    	}
    
    	for _, n := range sizes {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Jan 24 16:07:25 GMT 2024
    - 56.2K bytes
    - Viewed (0)
  10. src/bytes/example_test.go

    	// Output: hello world
    }
    
    func ExampleBuffer_AvailableBuffer() {
    	var buf bytes.Buffer
    	for i := 0; i < 4; i++ {
    		b := buf.AvailableBuffer()
    		b = strconv.AppendInt(b, int64(i), 10)
    		b = append(b, ' ')
    		buf.Write(b)
    	}
    	os.Stdout.Write(buf.Bytes())
    	// Output: 0 1 2 3
    }
    
    func ExampleBuffer_Cap() {
    	buf1 := bytes.NewBuffer(make([]byte, 10))
    	buf2 := bytes.NewBuffer(make([]byte, 0, 10))
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Mar 04 15:54:40 GMT 2024
    - 15K bytes
    - Viewed (1)
Back to top