- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for downTo (0.17 sec)
-
src/archive/tar/common.go
} pre = cur } return true } // alignSparseEntries mutates src and returns dst where each fragment's // starting offset is aligned up to the nearest block edge, and each // ending offset is aligned down to the nearest block edge. // // Even though the Go tar Reader and the BSD tar utility can handle entries // with arbitrary offsets and lengths, the GNU tar utility can only handle
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24.7K bytes - Viewed (2) -
src/bytes/buffer.go
return i } if b.buf == nil && n <= smallBufferSize { b.buf = make([]byte, n, smallBufferSize) return 0 } c := cap(b.buf) if n <= c/2-m { // We can slide things down instead of allocating a new // slice. We only need m+n <= c to slide, but // we instead let capacity get twice as large so we // don't spend all our time copying. copy(b.buf, b.buf[b.off:])
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 15.7K bytes - Viewed (0) -
src/bufio/scan.go
} } return true } } // We cannot generate a token with what we are holding. // If we've already hit EOF or an I/O error, we are done. if s.err != nil { // Shut it down. s.start = 0 s.end = 0 return false } // Must read more data. // First, shift data to beginning of buffer if there's lots of empty space // or space is needed.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 14.2K bytes - Viewed (0) -
doc/asm.html
but only worthwhile if it's likely the instruction will be used again. Instead, for simple one-off cases, it's possible to use the <code>BYTE</code> and <code>WORD</code> directives to lay down explicit data into the instruction stream within a <code>TEXT</code>. Here's how the 386 runtime defines the 64-bit atomic load function. </p> <pre> // uint64 atomicload64(uint64 volatile* addr);
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0) -
doc/next/6-stdlib/2-unique.md
Two `Handle[T]` are equal if and only if the values used to produce the handles are equal, allowing programs to deduplicate values and reduce their memory footprint. Comparing two `Handle[T]` values is efficient, reducing down to a simple
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Wed Apr 24 13:37:36 GMT 2024 - 579 bytes - Viewed (0) -
src/builtin/builtin.go
// The close built-in function closes a channel, which must be either // bidirectional or send-only. It should be executed only by the sender, // never the receiver, and has the effect of shutting down the channel after // the last sent value is received. After the last value has been received // from a closed channel c, any receive from c will succeed without
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 12.7K bytes - Viewed (0) -
src/cmd/asm/internal/lex/stack.go
package lex import ( "text/scanner" "cmd/internal/src" ) // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF, // it resumes reading the next one down. type Stack struct { tr []TokenReader } // Push adds tr to the top (end) of the input stack. (Popping happens automatically.) func (s *Stack) Push(tr TokenReader) { s.tr = append(s.tr, tr) }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Jan 09 22:33:23 GMT 2017 - 1.2K bytes - Viewed (0)