- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for checkindex (0.15 sec)
-
src/cmd/internal/obj/arm64/asm7.go
case ARNG_B: c.checkindex(p, index1, 15) c.checkindex(p, index2, 15) imm5 |= 1 imm5 |= index1 << 1 imm4 |= index2 case ARNG_H: c.checkindex(p, index1, 7) c.checkindex(p, index2, 7) imm5 |= 2 imm5 |= index1 << 2 imm4 |= index2 << 1 case ARNG_S: c.checkindex(p, index1, 3) c.checkindex(p, index2, 3) imm5 |= 4
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 201.1K bytes - Viewed (0) -
tests/migrate_test.go
checkColumnType(t, "name", false) checkIndex(t, nil) } checkUnique = func(t *testing.T) { checkColumnType(t, "name", true) checkIndex(t, []gorm.Index{uniqueConstraintIndex}) } checkUniqueIndex = func(t *testing.T) { checkColumnType(t, "name", true) checkIndex(t, []gorm.Index{uniqueIndex}) } checkMyIndex = func(t *testing.T) { checkColumnType(t, "name", true)
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Mon Mar 18 11:24:16 UTC 2024 - 56.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* * @since 20.0 */ public static final class ScaleAndIndex { private final int scale; private final int index; private ScaleAndIndex(int scale, int index) { checkIndex(index, scale); this.scale = scale; this.index = index; } /** * Computes the quantile value of the given dataset. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/math/Quantiles.java
* * @since 20.0 */ public static final class ScaleAndIndex { private final int scale; private final int index; private ScaleAndIndex(int scale, int index) { checkIndex(index, scale); this.scale = scale; this.index = index; } /** * Computes the quantile value of the given dataset. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
// Using a function literal like this lets us evaluate the // function arguments only once while doing pointer checks. // This is particularly useful when passing additional arguments // to _cgoCheckPointer, as done in checkIndex and checkAddr. // // When the function argument is a conversion to unsafe.Pointer, // we unwrap the conversion before checking the pointer, // and then wrap again when calling C.f. This lets us check
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0) -
src/runtime/mpagecache.go
assertLockHeld(p.mheapLock) // If the searchAddr refers to a region which has a higher address than // any known chunk, then we know we're out of memory. if chunkIndex(p.searchAddr.addr()) >= p.end { return pageCache{} } c := pageCache{} ci := chunkIndex(p.searchAddr.addr()) // chunk index var chunk *pallocData if p.summary[len(p.summary)-1][ci] != 0 { // Fast path: there's free pages at or near the searchAddr address.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 19 14:30:00 UTC 2023 - 5.6K bytes - Viewed (0) -
src/runtime/mpagealloc.go
// Fast path: we're clearing a single bit, and we know exactly // where it is, so mark it directly. i := chunkIndex(base) pi := chunkPageIndex(base) p.chunkOf(i).free1(pi) p.scav.index.free(i, pi, 1) } else { // Slow path: we're clearing more bits so we may need to iterate. sc, ec := chunkIndex(base), chunkIndex(limit) si, ei := chunkPageIndex(base), chunkPageIndex(limit) if sc == ec {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
// because it comes from the OS, so it's sufficient to align the // index. haveMin := s.min.Load() haveMax := s.max.Load() needMin := alignDown(uintptr(chunkIndex(base)), physPageSize/scSize) needMax := alignUp(uintptr(chunkIndex(limit)), physPageSize/scSize) // We need a contiguous range, so extend the range if there's no overlap. if needMax < haveMin { needMax = haveMin }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
src/runtime/export_test.go
} func (s *ScavengeIndex) Find(force bool) (ChunkIdx, uint) { ci, off := s.i.find(force) return ChunkIdx(ci), off } func (s *ScavengeIndex) AllocRange(base, limit uintptr) { sc, ec := chunkIndex(base), chunkIndex(limit-1) si, ei := chunkPageIndex(base), chunkPageIndex(limit-1) if sc == ec { // The range doesn't cross any chunk boundaries. s.i.alloc(sc, ei+1-si) } else {
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/runtime/mgcscavenge.go
// Update minHeapIdx. Note that even if there's no mapping work to do, // we may still have a new, lower minimum heap address. minHeapIdx := s.minHeapIdx.Load() if baseIdx := uintptr(chunkIndex(base)); minHeapIdx == 0 || baseIdx < minHeapIdx { s.minHeapIdx.Store(baseIdx) } return s.sysGrow(base, limit, sysStat) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0)