- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 83 for worst (0.05 sec)
-
src/strings/strings.go
// according to the mapping function. If mapping returns a negative value, the character is // dropped from the string with no replacement. func Map(mapping func(rune) rune, s string) string { // In the worst case, the string can grow when mapped, making // things unpleasant. But it's so rare we barge in assuming it's // fine. It could also shrink but that falls out naturally.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:48:16 UTC 2024 - 31.2K bytes - Viewed (0) -
src/runtime/mgcsweep.go
// also sweep pages (e.g., for a large allocation), it can pass a // non-zero callerSweepPages to leave that many pages unswept. // // deductSweepCredit makes a worst-case assumption that all spanBytes // bytes of the ultimately allocated span will be available for object // allocation. // // deductSweepCredit is the core of the "proportional sweep" system.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0) -
src/math/big/natdiv.go
That's the entirety of long division: scale the inputs, and then loop over each output position, guessing, checking, and correcting the next output digit. For a 2n-digit number divided by an n-digit number (the worst size-n case for division complexity), this algorithm uses n+1 iterations, each of which must do at least the 1-by-n-digit multiplication q̂·v. That's O(n) iterations of O(n) time each, so O(n²) time overall.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/poset.go
// Complexity depends on the type of operations that were performed // since the last checkpoint; each Set* operation creates an undo // pass which Undo has to revert with a worst-case complexity of O(n). func (po *poset) Undo() { if len(po.undo) == 0 { panic("empty undo stack") } if debugPoset { defer po.CheckIntegrity() } for len(po.undo) > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
src/runtime/arena.go
userArenaChunkPages = userArenaChunkBytes / pageSize // userArenaChunkMaxAllocBytes is the maximum size of an object that can // be allocated from an arena. This number is chosen to cap worst-case // fragmentation of user arenas to 25%. Larger allocations are redirected // to the heap. userArenaChunkMaxAllocBytes = userArenaChunkBytes / 4 ) func init() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:44:56 UTC 2024 - 37.9K bytes - Viewed (0) -
src/runtime/export_test.go
i scavengeIndex } func NewScavengeIndex(min, max ChunkIdx) *ScavengeIndex { s := new(ScavengeIndex) // This is a bit lazy but we easily guarantee we'll be able // to reference all the relevant chunks. The worst-case // memory usage here is 512 MiB, but tests generally use // small offsets from BaseChunkIdx, which results in ~100s // of KiB in memory use. // // This may still be worth making better, at least by sharing
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
// We're assuming here that all the keys in the map literal are distinct. // If any are equal, this will be an overcount. Probably not worth accounting // for that, as equal keys in map literals are rare, and at worst we waste // a bit of space. n.Len += int64(len(dynamics)) return m } // No return - type-assertions above. Each case must return for itself. }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0) -
src/main/resources/fess_label_de.properties
labels.suggest_word_configuration=Wort vorschlagen labels.suggest_word_title_details=Wort vorschlagen labels.suggest_word_type=Worttyp labels.suggest_word_number=Wortanzahl labels.suggest_word_type_all=Alle labels.suggest_word_type_document=Dokument labels.suggest_word_type_query=Query labels.elevate_word_configuration=Zusätzliches Wort labels.elevate_word_title_details=Zusätzliches Wort labels.elevate_word_link_list=Liste
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 42.8K bytes - Viewed (0) -
docs/de/docs/deployment/concepts.md
## Programm und Prozess Wir werden viel über den laufenden „**Prozess**“ sprechen, daher ist es nützlich, Klarheit darüber zu haben, was das bedeutet und was der Unterschied zum Wort „**Programm**“ ist. ### Was ist ein Programm? Das Wort **Programm** wird häufig zur Beschreibung vieler Dinge verwendet: * Der **Code**, den Sie schreiben, die **Python-Dateien**.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Mar 30 20:16:25 UTC 2024 - 20.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/FeatureSpecificTestSuiteBuilder.java
for (@SuppressWarnings("rawtypes") // class literals Class<? extends AbstractTester> testerClass : testers) { @SuppressWarnings("unchecked") // getting rid of the raw type, for better or for worse TestSuite testerSuite = makeSuiteForTesterClass((Class<? extends AbstractTester<?>>) testerClass); if (testerSuite.countTestCases() > 0) { suite.addTest(testerSuite); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 10.2K bytes - Viewed (0)