- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 3,585 for room (0.09 sec)
-
guava/src/com/google/common/hash/HashCode.java
* @param offset the start offset in the data * @param maxLength the maximum number of bytes to write * @return the number of bytes written to {@code dest} * @throws IndexOutOfBoundsException if there is not enough room in {@code dest} */ @CanIgnoreReturnValue public int writeBytesTo(byte[] dest, int offset, int maxLength) { maxLength = Ints.min(maxLength, bits() / 8);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 12.6K bytes - Viewed (0) -
src/internal/syscall/windows/registry/value.go
func (k Key) ReadValueNames() ([]string, error) { ki, err := k.Stat() if err != nil { return nil, err } names := make([]string, 0, ki.ValueCount) buf := make([]uint16, ki.MaxValueNameLen+1) // extra room for terminating null character loopItems: for i := uint32(0); ; i++ { l := uint32(len(buf)) for { err := regEnumValue(syscall.Handle(k), i, &buf[0], &l, nil, nil, nil, nil) if err == nil { break
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 18 20:01:34 UTC 2023 - 11K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/defaultpreemption/default_preemption.go
for _, c := range candidates { m[c.Name()] = c.Victims() } return m } // SelectVictimsOnNode finds minimum set of pods on the given node that should be preempted in order to make enough room // for "pod" to be scheduled. func (pl *DefaultPreemption) SelectVictimsOnNode( ctx context.Context, state *framework.CycleState, pod *v1.Pod, nodeInfo *framework.NodeInfo,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Nov 25 19:36:04 UTC 2023 - 12.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
`only, as it's asleep, I suppose it doesn't mind.' The table was a large one, but the three were all crowded together at one corner of it: `No room! No room!' they cried out when they saw Alice coming. `There's PLENTY of room!' said Alice indignantly, and she sat down in a large arm-chair at one end of the table. `Have some wine,' the March Hare said in an encouraging tone.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 29 21:35:03 UTC 2012 - 145.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/composition.go
func (rb *reorderBuffer) insertOrdered(info Properties) { n := rb.nrune b := rb.rune[:] cc := info.ccc if cc > 0 { // Find insertion position + move elements to make room. for ; n > 0; n-- { if b[n-1].ccc <= cc { break } b[n] = b[n-1] } } rb.nrune += 1 pos := uint8(rb.nbyte) rb.nbyte += utf8.UTFMax info.pos = pos b[n] = info }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/main/resources/fess_label_en.properties
labels.homePhone=Home Phone labels.user_homePostalAddress=Home Postal Address labels.homePostalAddress=Home Postal Address labels.user_labeledURI=labeledURI labels.labeledURI=labeledURI labels.user_roomNumber=Room Number labels.roomNumber=Room Number labels.user_description=Description labels.description=Description labels.user_title=Title labels.title=Title labels.user_pager=Pager labels.pager=Pager labels.user_street=Street
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 40.7K bytes - Viewed (0) -
src/runtime/signal_windows.go
g0 := getg() if panicking.Load() != 0 { // traceback already printed exit(2) } panicking.Store(1) // In case we're handling a g0 stack overflow, blow away the // g0 stack bounds so we have room to print the traceback. If // this somehow overflows the stack, the OS will trap it. g0.stack.lo = 0 g0.stackguard0 = g0.stack.lo + stackGuard g0.stackguard1 = g0.stackguard0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 17 20:32:29 UTC 2023 - 14.5K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/norm/iter.go
i.rb.src.copySlice(i.buf[outCopyStart:], inCopyStart, i.p) } return i.buf[:outp] doNorm: // Insert what we have decomposed so far in the reorderBuffer. // As we will only reorder, there will always be enough room. i.rb.src.copySlice(i.buf[outCopyStart:], inCopyStart, i.p) i.rb.insertDecomposed(i.buf[0:outp]) return doNormDecomposed(i) } func doNormDecomposed(i *Iter) []byte { for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 19:27:51 UTC 2019 - 11K bytes - Viewed (0) -
src/runtime/pprof/pprof.go
// and also try again if we're very unlucky. // The loop should only execute one iteration in the common case. var p []profilerecord.MemProfileRecord n, ok := pprof_memProfileInternal(nil, true) for { // Allocate room for a slightly bigger profile, // in case a few more entries have been added // since the call to MemProfile. p = make([]profilerecord.MemProfileRecord, n+50) n, ok = pprof_memProfileInternal(p, true) if ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 30.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/iter.go
i.rb.src.copySlice(i.buf[outCopyStart:], inCopyStart, i.p) } return i.buf[:outp] doNorm: // Insert what we have decomposed so far in the reorderBuffer. // As we will only reorder, there will always be enough room. i.rb.src.copySlice(i.buf[outCopyStart:], inCopyStart, i.p) i.rb.insertDecomposed(i.buf[0:outp]) return doNormDecomposed(i) } func doNormDecomposed(i *Iter) []byte { for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 11K bytes - Viewed (0)