- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 133 for slice (0.13 sec)
-
tests/helper_test.go
if len(user.Pets) != len(expect.Pets) { t.Fatalf("pets should equal, expect: %v, got %v", len(expect.Pets), len(user.Pets)) } sort.Slice(user.Pets, func(i, j int) bool { return user.Pets[i].ID > user.Pets[j].ID }) sort.Slice(expect.Pets, func(i, j int) bool { return expect.Pets[i].ID > expect.Pets[j].ID }) for idx, pet := range user.Pets {
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Tue Mar 19 03:50:28 GMT 2024 - 8K bytes - Viewed (0) -
tests/associations_has_one_test.go
t.Errorf("account's number should not be saved") } } func TestHasOneAssociationForSlice(t *testing.T) { users := []User{ *GetUser("slice-hasone-1", Config{Account: true}), *GetUser("slice-hasone-2", Config{Account: false}), *GetUser("slice-hasone-3", Config{Account: true}), } DB.Create(&users) // Count AssertAssociationCount(t, users, "Account", 2, "") // Find
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Thu Jan 06 07:02:53 GMT 2022 - 6.8K bytes - Viewed (0) -
common-protos/k8s.io/api/discovery/v1beta1/generated.proto
optional string addressType = 4; // endpoints is a list of unique endpoints in this slice. Each slice may // include a maximum of 1000 endpoints. // +listType=atomic repeated Endpoint endpoints = 2; // ports specifies the list of network ports exposed by each endpoint in // this slice. Each port must have a unique name. When ports is empty, it
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 8K bytes - Viewed (0) -
cni/pkg/nodeagent/podcgroupns_test.go
expectContainerID: "", }, { name: "no container ID in cgroups", cgroupPaths: []string{ "/user.slice", }, expectPodUID: "", expectContainerID: "", }, { name: "one container ID in cgroups", cgroupPaths: []string{ "/user.slice", "/kubepods/pod2c48913c-b29f-11e7-9350-020968147796/9bca8d63d5fa610783847915bcff0ecac1273e5b4bed3f6fa1b07350e0135961", },
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Fri Apr 12 21:47:31 GMT 2024 - 4.6K bytes - Viewed (0) -
src/main/webapp/js/admin/plugins/form-validator/sepa.js
="Z".charCodeAt(0)?b-"A".charCodeAt(0)+10:a}).join("");for(var b,c=a;c.length>2;)b=c.slice(0,9),c=(parseInt(b,10)%97).toString()+c.slice(b.length);return parseInt(c,10)%97===1},d=function(a){a=a.toUpperCase(),a=a.replace(/\s+/g,"");var c=a.slice(0,2),d=0,e="";for(d=0;d<b.length;++d)if(b[d][0]===c){e=b[d][2];break}if(""===e)return!1;var f=e.match(/(.{3})/g).map(function(a){var b,c=a.slice(0,1),d=parseInt(a.slice(1),10);switch(c){case"A":b="0-9A-Za-z";break;case"B":b="0-9A-Z";break;case"C":b="A-Za...
JavaScript - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Mon Jan 01 05:12:47 GMT 2018 - 3.4K bytes - Viewed (0) -
docs/debugging/hash-set/main.go
} // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned. func hashOrder(key string, cardinality int) []int { if cardinality <= 0 { // Returns an empty int slice for cardinality < 0. return nil } nums := make([]int, cardinality)
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Sep 19 18:05:16 GMT 2022 - 3.7K bytes - Viewed (0) -
src/arena/arena.go
//go:linkname runtime_arena_arena_New func runtime_arena_arena_New(arena unsafe.Pointer, typ any) any // Mark as noescape to avoid escaping the slice header. // //go:noescape //go:linkname runtime_arena_arena_Slice func runtime_arena_arena_Slice(arena unsafe.Pointer, slice any, cap int) //go:linkname runtime_arena_arena_Free func runtime_arena_arena_Free(arena unsafe.Pointer) //go:linkname runtime_arena_heapify
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Oct 12 20:23:36 GMT 2022 - 4.3K bytes - Viewed (0) -
tensorflow/c/checkpoint_reader.cc
<< entry.InitializationErrorString(); for (int i = 0; i < entry.slices_size(); ++i) { const auto& slice_proto = entry.slices(i); CHECK(filtered_keys .insert(EncodeTensorNameSlice( string(v2_reader_->key()) /* full var's name */, TensorSlice(slice_proto))) .second); } }
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Aug 25 21:29:12 GMT 2023 - 5.5K bytes - Viewed (0) -
istioctl/pkg/util/configdump/route.go
return nil, err } drc := routeDump.GetDynamicRouteConfigs() // Support v2 or v3 in config dump. See ads.go:RequestedTypes for more info. for i := range drc { drc[i].RouteConfig.TypeUrl = v3.RouteType } sort.Slice(drc, func(i, j int) bool { r := &route.RouteConfiguration{} err = drc[i].RouteConfig.UnmarshalTo(r) if err != nil { return false } name := r.Name err = drc[j].RouteConfig.UnmarshalTo(r)
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Thu Nov 03 08:41:32 GMT 2022 - 3.2K bytes - Viewed (0) -
tests/associations_belongs_to_test.go
&Company{Name: "company-slice-append-1"}, &Company{Name: "company-slice-append-2"}, &Company{Name: "company-slice-append-3"}, ) AssertAssociationCount(t, users, "Company", 3, "After Append") DB.Model(&users).Association("Manager").Append( GetUser("manager-slice-belongs-to-1", Config{}), GetUser("manager-slice-belongs-to-2", Config{}), GetUser("manager-slice-belongs-to-3", Config{}), )
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Mon Oct 30 09:15:49 GMT 2023 - 9.3K bytes - Viewed (0)