- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for Sequence (0.67 sec)
-
doc/go1.17_spec.html
</p> <ol> <li> <i>Line comments</i> start with the character sequence <code>//</code> and stop at the end of the line. </li> <li> <i>General comments</i> start with the character sequence <code>/*</code> and stop with the first subsequent character sequence <code>*/</code>. </li> </ol> <p> A comment cannot start inside a <a href="#Rune_literals">rune</a> or
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 11 20:22:45 UTC 2024 - 211.6K bytes - Viewed (0) -
src/cmd/go/alldocs.go
// To run all benchmarks, use '-bench .' or '-bench=.'. // The regular expression is split by unbracketed slash (/) // characters into a sequence of regular expressions, and each // part of a benchmark's identifier must match the corresponding // element in the sequence, if any. Possible parents of matches // are run with b.N=1 to identify sub-benchmarks. For example,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 16:54:28 UTC 2024 - 142.4K bytes - Viewed (0) -
src/cmd/go/internal/load/pkg.go
func (s *ImportStack) Top() string { if len(*s) == 0 { return "" } return (*s)[len(*s)-1] } // shorterThan reports whether sp is shorter than t. // We use this to record the shortest import sequence // that leads to a particular package. func (sp *ImportStack) shorterThan(t []string) bool { s := *sp if len(s) != len(t) { return len(s) < len(t) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 28 17:00:51 UTC 2024 - 120K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
// Single node on list if (next == null) { newTable.set(headIndex, head); } else { // Reuse the consecutive sequence of nodes with the same target // index from the end of the list. tail points to the first // entry in the reusable list. ReferenceEntry<K, V> tail = head;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 143.6K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
// Single node on list if (next == null) { newTable.set(headIndex, head); } else { // Reuse the consecutive sequence of nodes with the same target // index from the end of the list. tail points to the first // entry in the reusable list. ReferenceEntry<K, V> tail = head;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 149.2K bytes - Viewed (0)