Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1711 - 1720 of 1,720 for GET (0.15 seconds)

  1. RELEASE.md

    * `tf.tpu.experimental.embedding.TPUEmbeddingV2`
        * Add `compute_sparse_core_stats` for sparse core users to profile the  data with this API to get the `max_ids` and `max_unique_ids`. These numbers will be needed to configure the sparse core embedding mid level api.
        * Remove the `preprocess_features` method since that's no longer needed.
    
    ## Thanks to our Contributors
    
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. src/bufio/bufio_test.go

    			n:            27,
    			want:         26,
    			wantErr:      io.EOF,
    			wantBuffered: 0,
    		},
    		// Any error from filling shouldn't show up until we
    		// get past the valid bytes. Here we return 5 valid bytes at the same time
    		// as an error, but test that we don't see the error from Discard.
    		{
    			name: "fill error, discard less",
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 07 01:08:54 GMT 2025
    - 51.6K bytes
    - Click Count (0)
  3. src/cmd/asm/internal/asm/testdata/arm64.s

    	VREV32	V5.B16, V5.B16                  // a508206e
    	VREV64	V2.S2, V3.S2                    // 4308a00e
    	VREV64	V2.S4, V3.S4                    // 4308a04e
    
    // logical ops
    //
    // make sure constants get encoded into an instruction when it could
    	AND	R1@>33, R2
    	AND	$(1<<63), R1                        // AND	$-9223372036854775808, R1       // 21004192
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Nov 10 17:34:13 GMT 2025
    - 96.1K bytes
    - Click Count (0)
  4. CREDITS

    get its source.  For example, if your program is a web application, its
    interface could display a "Source" link that leads users to an archive
    of the code.  There are many ways you could offer source, and different
    solutions will be better for different programs; see section 13 for the
    specific requirements.
    
      You should also get your employer (if you work as a programmer) or school,
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Thu Mar 13 05:29:51 GMT 2025
    - 1.8M bytes
    - Click Count (0)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    NewNat().ExpandFor(m) n := uint(len(rr.limbs)) mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now)....
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  6. cmd/object-api-listobjects_test.go

    		err := obj.MakeBucket(context.Background(), upload.bucket, MakeBucketOptions{})
    		if err != nil {
    			t.Fatalf("%s : %s", instanceType, err.Error())
    		}
    
    		metadata, err := globalBucketMetadataSys.Get(upload.bucket)
    		if err != nil {
    			t.Fatal(err)
    		}
    		metadata.lifecycleConfig = lifecycleConfig
    		globalBucketMetadataSys.Set(upload.bucket, metadata)
    		defer globalBucketMetadataSys.Remove(upload.bucket)
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 10 18:57:03 GMT 2025
    - 76.1K bytes
    - Click Count (0)
  7. lib/fips140/v1.1.0-rc1.zip

    NewNat().ExpandFor(m) n := uint(len(rr.limbs)) mLen := uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now)....
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  8. doc/go_spec.html

    <!--
    We should be able to simplify the rules for comparable or delegate some of them
    elsewhere since we have a section that clearly defines how interfaces implement
    other interfaces based on their type sets. But this should get us going for now.
    -->
    
    <p>
    The <a href="#Predeclared_identifiers">predeclared</a>
    <a href="#Interface_types">interface type</a> <code>comparable</code>
    denotes the set of all non-interface types that are
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 02 23:07:19 GMT 2025
    - 286.5K bytes
    - Click Count (1)
  9. api/go1.txt

    pkg encoding/xml, var HTMLAutoClose []string
    pkg encoding/xml, var HTMLEntity map[string]string
    pkg errors, func New(string) error
    pkg expvar, func Do(func(KeyValue))
    pkg expvar, func Get(string) Var
    pkg expvar, func NewFloat(string) *Float
    pkg expvar, func NewInt(string) *Int
    pkg expvar, func NewMap(string) *Map
    pkg expvar, func NewString(string) *String
    pkg expvar, func Publish(string, Var)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Aug 14 18:58:28 GMT 2013
    - 1.7M bytes
    - Click Count (0)
  10. api/go1.2.txt

    pkg encoding/xml, type UnmarshalerAttr interface { UnmarshalXMLAttr }
    pkg encoding/xml, type UnmarshalerAttr interface, UnmarshalXMLAttr(Attr) error
    pkg flag, type Getter interface { Get, Set, String }
    pkg flag, type Getter interface, Get() interface{}
    pkg flag, type Getter interface, Set(string) error
    pkg flag, type Getter interface, String() string
    pkg flag, var CommandLine *FlagSet
    pkg go/ast, type SliceExpr struct, Max Expr
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Oct 18 04:36:59 GMT 2013
    - 1.9M bytes
    - Click Count (1)
Back to Top