- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 36 for ni (0.03 sec)
-
docs/yo/docs/index.md
* **Irọrun**: A kọ kí ó le rọrun láti lo àti láti kọ ẹkọ nínú rè. Ó máa fún ọ ní àkókò díẹ̀ látı ka àkọsílẹ. * **Ó kúkurú ní kikọ**: Ó dín àtúnkọ àti àtúntò kóòdù kù. Ìkéde àṣàyàn kọ̀ọ̀kan nínú rẹ̀ ní ọ̀pọ̀lọpọ̀ àwọn ìlò. O ṣe iranlọwọ láti má ṣe ní ọ̀pọ̀lọpọ̀ àṣìṣe.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Mon Apr 29 05:18:04 UTC 2024 - 24.1K bytes - Viewed (0) -
pkg/scheduler/framework/types_test.go
}, }, }, }, } ni := fakeNodeInfo() gen := ni.Generation for _, pod := range pods { ni.AddPod(pod) if ni.Generation <= gen { t.Errorf("Generation is not incremented. Prev: %v, current: %v", gen, ni.Generation) } gen = ni.Generation } expected.Generation = ni.Generation if !reflect.DeepEqual(expected, ni) { t.Errorf("expected: %#v, got: %#v", expected, ni) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 45.9K bytes - Viewed (0) -
pkg/scheduler/internal/cache/cache.go
return } if ni.prev != nil { ni.prev.next = ni.next } if ni.next != nil { ni.next.prev = ni.prev } // if the removed item was at the head, we must update the head. if ni == cache.headNode { cache.headNode = ni.next } delete(cache.nodes, name) } // Dump produces a dump of the current scheduler cache. This is used for
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 24 09:56:48 UTC 2023 - 24.9K bytes - Viewed (0) -
src/internal/profile/graph.go
i := 1 if last := len(sample.Location) - 1; last < i { i = last } for ; i >= 0; i-- { l := sample.Location[i] locNodes := locationMap.get(l.ID) for ni := len(locNodes) - 1; ni >= 0; ni-- { n := locNodes[ni] if n == nil { residual = true continue } // Add cum weight to all nodes in stack, avoiding double counting. _, sawNode := seenNode[n] if !sawNode {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 05 20:59:15 UTC 2024 - 13.1K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/bidi/bracket.go
// to that type. 2 Otherwise, set the type for both brackets in the pair to // the embedding direction. // // o [ o ] e -> o o o o e // // o [ o NI ] o -> o o o NI o o // // e [ o ] o -> e e o e o // // e [ o ] e -> e e o e e // // e ( o [ o ] NI ) e -> e e o o o o NI e e // // d Otherwise, do not set the type for the current bracket pair. Note that // if the enclosed text contains no strong types the paired brackets will
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 19:27:51 UTC 2019 - 11.2K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
Name: line.Function.Name, } if fname := line.Function.Filename; fname != "" { ni.File = filepath.Clean(fname) } if o.OrigFnNames { ni.OrigName = line.Function.SystemName } if o.ObjNames || (ni.Name == "" && ni.OrigName == "") { ni.Objfile = objfile ni.StartLine = int(line.Function.StartLine) } return ni } type tags struct { t []*Tag flat bool }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/FunctionsTest.java
} public void testComposition() { Map<String, Integer> mJapaneseToInteger = Maps.newHashMap(); mJapaneseToInteger.put("Ichi", 1); mJapaneseToInteger.put("Ni", 2); mJapaneseToInteger.put("San", 3); Function<String, Integer> japaneseToInteger = Functions.forMap(mJapaneseToInteger); Map<Integer, String> mIntegerToSpanish = Maps.newHashMap();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 16K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/report.go
func (fm functionMap) findOrAdd(ni graph.NodeInfo) (*profile.Function, bool) { fName := fmt.Sprintf("%q%q%q%d", ni.Name, ni.OrigName, ni.File, ni.StartLine) if f := fm[fName]; f != nil { return f, false } f := &profile.Function{ ID: uint64(len(fm) + 1), Name: ni.Name, SystemName: ni.OrigName, Filename: ni.File, StartLine: int64(ni.StartLine), } fm[fName] = f
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 37.5K bytes - Viewed (0) -
src/internal/concurrent/hashtriemap.go
} hashShift -= nChildrenLog2 // hashShift is for the level parent is at. We need to go deeper. oi := (oldHash >> hashShift) & nChildrenMask ni := (newHash >> hashShift) & nChildrenMask if oi != ni { newIndirect.children[oi].Store(&oldEntry.node) newIndirect.children[ni].Store(&newEntry.node) break } nextIndirect := newIndirectNode(newIndirect) newIndirect.children[oi].Store(&nextIndirect.node)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 16:01:55 UTC 2024 - 11.8K bytes - Viewed (0) -
pkg/scheduler/framework/preemption/preemption_test.go
} for _, tt := range tests { t.Run(tt.name, func(t *testing.T) { var nodeInfos []*framework.NodeInfo for _, name := range nodeNames { ni := framework.NewNodeInfo() ni.SetNode(st.MakeNode().Name(name).Obj()) nodeInfos = append(nodeInfos, ni) } nodes, _ := nodesWherePreemptionMightHelp(nodeInfos, tt.nodesStatuses) if len(tt.expected) != len(nodes) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 18.7K bytes - Viewed (0)