Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 36 for dash (8.69 sec)

  1. api/go1.20.txt

    pkg crypto/ed25519, method (*Options) HashFunc() crypto.Hash #31804
    pkg crypto/ed25519, type Options struct #31804
    pkg crypto/ed25519, type Options struct, Context string #31804
    pkg crypto/ed25519, type Options struct, Hash crypto.Hash #31804
    pkg crypto/rsa, type OAEPOptions struct, MGFHash crypto.Hash #19974
    pkg crypto/subtle, func XORBytes([]uint8, []uint8, []uint8) int #53021
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Fri Feb 17 21:23:32 GMT 2023
    - 602.6K bytes
    - Viewed (0)
  2. lib/time/README

    For more information, see
    https://www.iana.org/time-zones
    ftp://ftp.iana.org/tz/code/tz-link.html
    https://datatracker.ietf.org/doc/html/rfc6557
    
    Plain Text
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Sun Aug 15 02:18:46 GMT 2021
    - 390 bytes
    - Viewed (0)
  3. doc/next/6-stdlib/2-unique.md

    ### New unique package
    
    The new [unique](/pkg/unique) package provides facilities for
    canonicalizing values (like "interning" or "hash-consing").
    
    Any value of comparable type may be canonicalized with the new
    `Make[T]` function, which produces a reference to a canonical copy of
    the value in the form of a `Handle[T]`.
    Two `Handle[T]` are equal if and only if the values used to produce the
    handles are equal, allowing programs to deduplicate values and reduce
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Wed Apr 24 13:37:36 GMT 2024
    - 579 bytes
    - Viewed (0)
  4. src/cmd/asm/internal/lex/input.go

    				return tok
    			}
    		}
    	}
    	in.Error("recursive macro invocation")
    	return 0
    }
    
    func (in *Input) Text() string {
    	return in.text
    }
    
    // hash processes a # preprocessor directive. It reports whether it completes.
    func (in *Input) hash() bool {
    	// We have a '#'; it must be followed by a known word (define, include, etc.).
    	tok := in.Stack.Next()
    	if tok != scanner.Ident {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Aug 29 07:48:38 GMT 2023
    - 12.6K bytes
    - Viewed (0)
  5. src/archive/zip/zip_test.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Tests that involve both reading and writing.
    
    package zip
    
    import (
    	"bytes"
    	"errors"
    	"fmt"
    	"hash"
    	"internal/testenv"
    	"io"
    	"runtime"
    	"sort"
    	"strings"
    	"testing"
    	"time"
    )
    
    func TestOver65kFiles(t *testing.T) {
    	if testing.Short() && testenv.Builder() == "" {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Mar 27 18:23:49 GMT 2024
    - 19.5K bytes
    - Viewed (0)
  6. doc/go_spec.html

    Others are introduced with <a href="#Type_declarations">type declarations</a>
    or <a href="#Type_parameter_declarations">type parameter lists</a>.
    <i>Composite types</i>&mdash;array, struct, pointer, function,
    interface, slice, map, and channel types&mdash;may be constructed using
    type literals.
    </p>
    
    <p>
    Predeclared types, defined types, and type parameters are called <i>named types</i>.
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Thu May 02 22:43:51 GMT 2024
    - 279.6K bytes
    - Viewed (0)
  7. api/go1.1.txt

    pkg go/token, const XOR = 19
    pkg go/token, const XOR_ASSIGN = 30
    pkg hash/adler32, const Size = 4
    pkg hash/crc32, const Castagnoli = 2197175160
    pkg hash/crc32, const IEEE = 3988292384
    pkg hash/crc32, const Koopman = 3945912366
    pkg hash/crc32, const Size = 4
    pkg hash/crc64, const ECMA = 14514072000185962306
    pkg hash/crc64, const ISO = 15564440312192434176
    pkg hash/crc64, const Size = 8
    pkg html/template, const ErrAmbigContext = 1
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Thu Mar 31 20:37:15 GMT 2022
    - 2.6M bytes
    - Viewed (0)
  8. src/buildall.bash

    #!/usr/bin/env bash
    # Copyright 2015 The Go Authors. All rights reserved.
    # Use of this source code is governed by a BSD-style
    # license that can be found in the LICENSE file.
    
    # Usage: buildall.bash [-e] [pattern]
    #
    # buildall.bash builds the standard library for all Go-supported
    # architectures.
    #
    # Originally the Go build system used it as a smoke test to quickly
    # flag portability issues in builders named "misc-compile" or "all-compile".
    Shell Script
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Apr 23 17:45:23 GMT 2024
    - 2.1K bytes
    - Viewed (0)
  9. src/clean.bash

    #!/usr/bin/env bash
    # Copyright 2009 The Go Authors. All rights reserved.
    # Use of this source code is governed by a BSD-style
    # license that can be found in the LICENSE file.
    
    set -e
    
    if [ ! -f run.bash ]; then
    	echo 'clean.bash must be run from $GOROOT/src' 1>&2
    	exit 1
    fi
    export GOROOT="$(cd .. && pwd)"
    
    gobin="${GOROOT}"/bin
    if ! "$gobin"/go help >/dev/null 2>&1; then
    	echo 'cannot find go command; nothing to clean' >&2
    	exit 1
    Shell Script
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Feb 26 21:54:09 GMT 2020
    - 518 bytes
    - Viewed (0)
  10. misc/go_android_exec/README

    	GOOS=android \
    	GOARCH=arm64 \
    	CC_FOR_TARGET=$NDK/toolchains/llvm/prebuilt/linux-x86_64/bin/aarch64-linux-android21-clang \
    	./all.bash
    
    To run tests on the Android device, add the bin directory to PATH so the
    go tool can find the go_android_$GOARCH_exec wrapper generated by
    make.bash. For example, to run the go1 benchmarks
    
    	export PATH=$GOROOT/bin:$PATH
    	cd $GOROOT/test/bench/go1/
    Plain Text
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon May 01 14:45:55 GMT 2023
    - 732 bytes
    - Viewed (0)
Back to top