- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 215 for slide (0.05 sec)
-
src/bytes/buffer.go
// Bytes returns a slice of length b.Len() holding the unread portion of the buffer. // The slice is valid for use only until the next buffer modification (that is, // only until the next call to a method like [Buffer.Read], [Buffer.Write], [Buffer.Reset], or [Buffer.Truncate]). // The slice aliases the buffer content at least until the next buffer modification, // so immediate changes to the slice will affect the result of future reads.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon May 19 17:38:56 UTC 2025 - 16K bytes - Viewed (0) -
fess-crawler-lasta/src/main/resources/crawler/extractor.xml
"application/vnd.ms-powerpoint", "application/vnd.ms-powerpoint.addin.macroenabled.12", "application/vnd.ms-powerpoint.presentation.macroenabled.12", "application/vnd.ms-powerpoint.slide.macroenabled.12", "application/vnd.ms-powerpoint.slideshow.macroenabled.12", "application/vnd.ms-powerpoint.template.macroenabled.12", "application/vnd.ms-project", "application/x-project",
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Sat Aug 01 21:40:30 UTC 2020 - 49K bytes - Viewed (0) -
src/bufio/bufio.go
lastByte: -1, lastRuneSize: -1, } } var errNegativeRead = errors.New("bufio: reader returned negative count from Read") // fill reads a new chunk into the buffer. func (b *Reader) fill() { // Slide existing data to beginning. if b.r > 0 { copy(b.buf, b.buf[b.r:b.w]) b.w -= b.r b.r = 0 } if b.w >= len(b.buf) { panic("bufio: tried to fill full buffer") }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 22K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/riscv64.s
VMVXS V2, X10 // 57252042 VMVSX X10, V2 // 57610542 // 31.16.2: Floating-Point Scalar Move Instructions VFMVFS V2, F10 // 57152042 VFMVSF F10, V2 // 57510542 // 31.16.3: Vector Slide Instructions VSLIDEUPVX X10, V2, V3 // d741253a VSLIDEUPVX X10, V2, V0, V3 // d7412538 VSLIDEUPVI $16, V2, V3 // d731283a VSLIDEUPVI $16, V2, V0, V3 // d7312838 VSLIDEDOWNVX X10, V2, V3 // d741253e
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed May 21 14:19:19 UTC 2025 - 49.1K bytes - Viewed (0) -
src/cmd/asm/internal/lex/slice.go
"cmd/internal/src" ) // A Slice reads from a slice of Tokens. type Slice struct { tokens []Token base *src.PosBase line int pos int } func NewSlice(base *src.PosBase, line int, tokens []Token) *Slice { return &Slice{ tokens: tokens, base: base, line: line, pos: -1, // Next will advance to zero. } } func (s *Slice) Next() ScanToken { s.pos++Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Thu Jun 29 22:49:50 UTC 2023 - 1.6K bytes - Viewed (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
<_comment>Office Open XML Presentation (macro-enabled)</_comment> <glob pattern="*.pptm"/> <sub-class-of type="application/x-tika-ooxml"/> </mime-type> <mime-type type="application/vnd.ms-powerpoint.slide.macroenabled.12"> <glob pattern="*.sldm"/> <sub-class-of type="application/x-tika-ooxml"/> </mime-type> <mime-type type="application/vnd.ms-powerpoint.slideshow.macroenabled.12">
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Thu Mar 13 08:18:01 UTC 2025 - 320.1K bytes - Viewed (1) -
cmd/admin-handlers-idp-openid.go
} // Convert map to slice and sort resp := make([]madmin.ListAccessKeysOpenIDResp, 0, len(cfgToUsersMap)) for cfgName, usersMap := range cfgToUsersMap { users := make([]madmin.OpenIDUserAccessKeys, 0, len(usersMap)) for _, user := range usersMap { users = append(users, user) } sort.Slice(users, func(i, j int) bool {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sat Sep 06 17:38:46 UTC 2025 - 7.6K bytes - Viewed (0) -
doc/go_spec.html
The <i>capacity</i> is a measure of that extent: it is the sum of the length of the slice and the length of the array beyond the slice; a slice of length up to that capacity can be created by <a href="#Slice_expressions"><i>slicing</i></a> a new one from the original slice. The capacity of a slice <code>a</code> can be discovered using the built-in function <a href="#Length_and_capacity"><code>cap(a)</code></a>. </p>
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (1) -
tests/associations_has_many_test.go
&Pet{Name: "pet-slice-append-1"}, []*Pet{{Name: "pet-slice-append-2-1"}, {Name: "pet-slice-append-2-2"}}, &Pet{Name: "pet-slice-append-3"}, ) AssertAssociationCount(t, users, "Pets", 10, "After Append") // Replace -> same as append DB.Model(&users).Association("Pets").Replace( []*Pet{{Name: "pet-slice-replace-1-1"}, {Name: "pet-slice-replace-1-2"}},Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Wed Jun 12 10:49:45 UTC 2024 - 16K bytes - Viewed (0) -
src/bytes/bytes.go
// Fields interprets s as a sequence of UTF-8-encoded code points. // It splits the slice s around each instance of one or more consecutive white space // characters, as defined by [unicode.IsSpace], returning a slice of subslices of s or an // empty slice if s contains only white space. Every element of the returned slice is // non-empty. Unlike [Split], leading and trailing runs of white space characters // are discarded.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 35.5K bytes - Viewed (0)