- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 194 for toves (0.05 sec)
-
src/main/resources/fess_indices/_cloud/fess.json
}, "catalan_keywords": {
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sat Feb 27 09:26:16 UTC 2021 - 117.3K bytes - Viewed (0) -
src/runtime/time.go
return } t.lock() updated := t.updateHeap() t.unlock() if !updated { // Head of timers does not need adjustment. return } } } // take moves any timers from src into ts // and then clears the timer state from src, // because src is being destroyed. // The caller must not have locked either timers. // For now this is only called when the world is stopped.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 14:36:24 UTC 2024 - 37.5K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/dep-man/04-modeling-features/artifact_transforms.adoc
The following example shows a more complicated transform. It moves some selected classes of a JAR to a different package, rewriting the byte code of the moved classes and all classes using the moved classes (class relocation).
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Dec 07 01:37:51 UTC 2023 - 20.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// it using a greedy register allocator. Then all merge edges // (those targeting a block with len(Preds)>1) are processed to // shuffle data into the place that the target of the edge expects. // // The greedy allocator moves values into registers just before they // are used, spills registers only when necessary, and spills the // value whose next use is farthest in the future. // // The register allocator requires that a block is not scheduled until
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
test/live_regabi.go
t := &ret printnl() // ERROR "live at call to printnl: ret$" // Note: ret is live at the printnl because the compiler moves &ret // from before the printnl to after. useT40(t) } func ddd1(x, y *int) { // ERROR "live at entry to ddd1: x y$" ddd2(x, y) // ERROR "stack object .autotmp_[0-9]+ \[2\]\*int$" printnl()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 18.4K bytes - Viewed (0) -
src/runtime/netpoll.go
} // be careful to not lose concurrent pdReady notification old := gpp.Swap(pdNil) if old > pdWait { throw("runtime: corrupted polldesc") } return old == pdReady } // netpollunblock moves either pd.rg (if mode == 'r') or // pd.wg (if mode == 'w') into the pdReady state. // This returns any goroutine blocked on pd.{rg,wg}. // It adds any adjustment to netpollWaiters to *delta;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 20.7K bytes - Viewed (0) -
src/debug/dwarf/line.go
if r.fileIndex < len(r.fileEntries) { r.state.File = r.fileEntries[r.fileIndex] } else { r.state.File = nil } } // Next sets *entry to the next row in this line table and moves to // the next row. If there are no more entries and the line table is // properly terminated, it returns [io.EOF]. // // Rows are always in order of increasing entry.Address, but // entry.Line may go forward or backward.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 23.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/LOONG64Ops.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 19:04:19 UTC 2023 - 25.2K bytes - Viewed (0) -
pkg/scheduler/framework/preemption/preemption.go
// Lower priority pods nominated to run on this node, may no longer fit on // this node. So, we should remove their nomination. Removing their // nomination updates these pods and moves them to the active queue. It // lets scheduler find another place for them. nominatedPods := getLowerPriorityNominatedPods(logger, fh, pod, c.Name()) if err := util.ClearNominatedNodeName(ctx, cs, nominatedPods...); err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 25.1K bytes - Viewed (0) -
pkg/scheduler/internal/cache/cache.go
} // newNodeInfoListItem initializes a new nodeInfoListItem. func newNodeInfoListItem(ni *framework.NodeInfo) *nodeInfoListItem { return &nodeInfoListItem{ info: ni, } } // moveNodeInfoToHead moves a NodeInfo to the head of "cache.nodes" doubly // linked list. The head is the most recently updated NodeInfo. // We assume cache lock is already acquired.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 24 09:56:48 UTC 2023 - 24.9K bytes - Viewed (0)