Home
last modified time | relevance | path

Searched refs:numChunks (Results 1 – 25 of 492) sorted by relevance

12345678910>>...20

/dports/net-mgmt/promscale/promscale-0.6.2/vendor/github.com/thanos-io/thanos/pkg/ui/react-app/src/thanos/pages/blocks/__testdata__/
H A Dtestdata.ts52 numChunks: 10093065,
76 numChunks: 592146,
138 numChunks: 43700,
162 numChunks: 103328,
186 numChunks: 559588,
210 numChunks: 478008,
234 numChunks: 592116,
258 numChunks: 478008,
282 numChunks: 103328,
318 numChunks: 866038,
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/cortexproject/cortex/pkg/querier/batch/
H A Dbatch_test.go17 numChunks int
22 {numChunks: 1000, numSamplesPerChunk: 100, duplicationFactor: 1, enc: promchunk.Bigchunk},
23 {numChunks: 1000, numSamplesPerChunk: 100, duplicationFactor: 3, enc: promchunk.Bigchunk},
24 {numChunks: 1000, numSamplesPerChunk: 100, duplicationFactor: 1, enc: promchunk.Varbit},
25 {numChunks: 1000, numSamplesPerChunk: 100, duplicationFactor: 3, enc: promchunk.Varbit},
26 {numChunks: 1000, numSamplesPerChunk: 100, duplicationFactor: 1, enc: promchunk.DoubleDelta},
27 {numChunks: 1000, numSamplesPerChunk: 100, duplicationFactor: 3, enc: promchunk.DoubleDelta},
32 {numChunks: 1, numSamplesPerChunk: 100, duplicationFactor: 1, enc: promchunk.PrometheusXorChunk},
38 scenario.numChunks,
80 result := make([]chunk.Chunk, 0, numChunks)
[all …]
/dports/devel/spark/spark-2.1.1/common/network-shuffle/src/main/java/org/apache/spark/network/shuffle/protocol/
H A DStreamHandle.java32 public final int numChunks; field in StreamHandle
34 public StreamHandle(long streamId, int numChunks) { in StreamHandle() argument
36 this.numChunks = numChunks; in StreamHandle()
44 return Objects.hashCode(streamId, numChunks); in hashCode()
51 .add("numChunks", numChunks) in toString()
60 && Objects.equal(numChunks, o.numChunks); in equals()
73 buf.writeInt(numChunks); in encode()
78 int numChunks = buf.readInt(); in decode() local
79 return new StreamHandle(streamId, numChunks); in decode()
/dports/games/ecwolf/ecwolf-1.3.3-src/src/resourcefiles/
H A Dfile_vswap.cpp58 unsigned short numChunks; member
78 chunks[numChunks].offset = offset; in AddChunk()
79 chunks[numChunks].length = length; in AddChunk()
80 numChunks++; in AddChunk()
93 for(unsigned int i = 0;i < numChunks;i++) in CalculateLumpSize()
127 for(i = 0;i < numChunks;i++) in FillCache()
189 WORD numChunks = ReadLittleShort(&header[0]); in Open() local
197 BYTE* data = new BYTE[6*numChunks]; in Open()
198 Reader->Read(data, 6*numChunks); in Open()
216 int soundMapSize = ReadLittleShort(&data[(numChunks-1)*2 + 4*numChunks]); in Open()
[all …]
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/cont/openmp/internal/
H A DDeviceAdapterAlgorithmOpenMP.cxx50 const vtkm::Id numChunks = (size + chunkSize - 1) / chunkSize; in ScheduleTask() local
54 for (vtkm::Id i = 0; i < numChunks; ++i) in ScheduleTask()
109 const vtkm::Id3 numChunks{ openmp::CeilDivide(size[0], chunkDims[0]), in ScheduleTask() local
112 const vtkm::Id chunkCount = numChunks[0] * numChunks[1] * numChunks[2]; in ScheduleTask()
116 start[0] = chunkIdx % numChunks[0]; in ScheduleTask()
117 start[1] = (chunkIdx / numChunks[0]) % numChunks[1]; in ScheduleTask()
118 start[2] = (chunkIdx / (numChunks[0] * numChunks[1])); in ScheduleTask()
/dports/science/py-rmf/rmf-1.3.1/src/avrocpp/test/
H A Dbuffertest.cc69 BOOST_CHECK_EQUAL(ob.numChunks(), 0); in TestReserve()
79 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestReserve()
88 BOOST_CHECK_EQUAL(ob.numChunks(), 2); in TestReserve()
98 BOOST_CHECK_EQUAL(ob.numChunks(), 4); in TestReserve()
118 BOOST_CHECK_EQUAL(ob.numChunks(), 0); in TestGrow()
126 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestGrow()
135 BOOST_CHECK_EQUAL(ob.numChunks(), 2); in TestGrow()
143 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestGrow()
157 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestDiscard()
164 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestDiscard()
[all …]
/dports/devel/avro-cpp/avro-cpp-1.11.0/test/
H A Dbuffertest.cc63 BOOST_CHECK_EQUAL(ob.numChunks(), 0); in TestReserve()
73 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestReserve()
82 BOOST_CHECK_EQUAL(ob.numChunks(), 2); in TestReserve()
92 BOOST_CHECK_EQUAL(ob.numChunks(), 4); in TestReserve()
112 BOOST_CHECK_EQUAL(ob.numChunks(), 0); in TestGrow()
120 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestGrow()
129 BOOST_CHECK_EQUAL(ob.numChunks(), 2); in TestGrow()
136 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestGrow()
150 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestDiscard()
157 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestDiscard()
[all …]
/dports/science/rmf/rmf-1.3.1/src/avrocpp/test/
H A Dbuffertest.cc69 BOOST_CHECK_EQUAL(ob.numChunks(), 0); in TestReserve()
79 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestReserve()
88 BOOST_CHECK_EQUAL(ob.numChunks(), 2); in TestReserve()
98 BOOST_CHECK_EQUAL(ob.numChunks(), 4); in TestReserve()
118 BOOST_CHECK_EQUAL(ob.numChunks(), 0); in TestGrow()
126 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestGrow()
135 BOOST_CHECK_EQUAL(ob.numChunks(), 2); in TestGrow()
143 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestGrow()
157 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestDiscard()
164 BOOST_CHECK_EQUAL(ob.numChunks(), 1); in TestDiscard()
[all …]
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/cont/openmp/internal/
H A DDeviceAdapterAlgorithmOpenMP.cxx99 const vtkm::Id3 numChunks{ openmp::CeilDivide(size[0], chunkDims[0]), in ScheduleTask() local
102 const vtkm::Id chunkCount = numChunks[0] * numChunks[1] * numChunks[2]; in ScheduleTask()
106 start[0] = chunkIdx % numChunks[0]; in ScheduleTask()
107 start[1] = (chunkIdx / numChunks[0]) % numChunks[1]; in ScheduleTask()
108 start[2] = (chunkIdx / (numChunks[0] * numChunks[1])); in ScheduleTask()
/dports/misc/glow/glow-f24d960e3cc80db95ac0bc17b1900dbf60ca044a/tests/unittests/
H A DNodeSplittingTest.cpp165 for (auto numChunk : numChunks) { in splitConv2DBasic()
259 for (auto numChunk : numChunks) { in splitConv2DNonZeroPad()
386 dim_t totNumChunks = numChunks[0] * numChunks[1]; in TEST_F()
522 for (auto numChunk : numChunks) { in splitMaxPoolBasic()
585 for (auto numChunk : numChunks) { in splitMaxPoolNonZeroPad()
641 dim_t totNumChunks = numChunks[0] * numChunks[1]; in TEST_F()
808 for (auto numChunk : numChunks) { in splitAvgPoolBasic()
871 for (auto numChunk : numChunks) { in splitAvgPoolNonZeroPad()
927 dim_t totNumChunks = numChunks[0] * numChunks[1]; in TEST_F()
1042 for (auto numChunk : numChunks) { in splitFullyConnected()
[all …]
/dports/devel/goredo/goredo-1.21.0/src/vendor/lukechampine.com/blake3/
H A Dcompress_amd64.go30 numChunks := uint64(buflen / chunkSize)
34 cvs[numChunks] = chainingValue(compressChunk(partialChunk, key, counter+numChunks, flags))
35 numChunks++
37 return mergeSubtrees(&cvs, numChunks, key, flags)
45 numChunks := uint64(buflen / chunkSize)
46 if numChunks > 8 {
52 cvs[numChunks] = chainingValue(compressChunk(partialChunk, key, counter+numChunks, flags))
53 numChunks++
55 return mergeSubtrees(&cvs, numChunks, key, flags)
/dports/net/nncp/nncp-8.0.2/src/vendor/lukechampine.com/blake3/
H A Dcompress_amd64.go30 numChunks := uint64(buflen / chunkSize)
34 cvs[numChunks] = chainingValue(compressChunk(partialChunk, key, counter+numChunks, flags))
35 numChunks++
37 return mergeSubtrees(&cvs, numChunks, key, flags)
45 numChunks := uint64(buflen / chunkSize)
46 if numChunks > 8 {
52 cvs[numChunks] = chainingValue(compressChunk(partialChunk, key, counter+numChunks, flags))
53 numChunks++
55 return mergeSubtrees(&cvs, numChunks, key, flags)
/dports/databases/hbase/hbase-1.2.1/hbase-server/src/main/java/org/apache/hadoop/hbase/io/hfile/
H A DChecksumUtil.java146 return numChunks(datasize, bytesPerChecksum) * in numBytes()
157 static long numChunks(long datasize, int bytesPerChecksum) { in numChunks() method in ChecksumUtil
158 long numChunks = datasize/bytesPerChecksum; in numChunks() local
160 numChunks++; in numChunks()
162 return numChunks; in numChunks()
175 long numChunks = numChunks(numBytes, bytesPerChecksum); in reserveSpaceForChecksums() local
176 long bytesLeft = numChunks * HFileBlock.CHECKSUM_SIZE; in reserveSpaceForChecksums()
/dports/www/moodle310/moodle/cache/stores/mongodb/MongoDB/GridFS/
H A DReadableStream.php67 private $numChunks = 0; variable in MongoDB\\GridFS\\ReadableStream
97 $this->numChunks = (integer) ceil($this->length / $this->chunkSize);
98 … $this->expectedLastChunkSize = ($this->length - (($this->numChunks - 1) * $this->chunkSize));
149 if ($this->chunkOffset === $this->numChunks - 1) {
153 return $this->chunkOffset >= $this->numChunks;
239 $numChunks = $this->chunkOffset - $lastChunkOffset;
240 for ($i = 0; $i < $numChunks; $i++) {
265 if ($this->chunkOffset === 0 && $this->numChunks === 0) {
283 $expectedChunkSize = $this->chunkOffset === $this->numChunks - 1
302 if ($this->chunkOffset === $this->numChunks - 1) {
/dports/www/moodle311/moodle/cache/stores/mongodb/MongoDB/GridFS/
H A DReadableStream.php67 private $numChunks = 0; variable in MongoDB\\GridFS\\ReadableStream
97 $this->numChunks = (integer) ceil($this->length / $this->chunkSize);
98 … $this->expectedLastChunkSize = ($this->length - (($this->numChunks - 1) * $this->chunkSize));
149 if ($this->chunkOffset === $this->numChunks - 1) {
153 return $this->chunkOffset >= $this->numChunks;
239 $numChunks = $this->chunkOffset - $lastChunkOffset;
240 for ($i = 0; $i < $numChunks; $i++) {
265 if ($this->chunkOffset === 0 && $this->numChunks === 0) {
283 $expectedChunkSize = $this->chunkOffset === $this->numChunks - 1
302 if ($this->chunkOffset === $this->numChunks - 1) {
/dports/www/moodle39/moodle/cache/stores/mongodb/MongoDB/GridFS/
H A DReadableStream.php67 private $numChunks = 0; variable in MongoDB\\GridFS\\ReadableStream
97 $this->numChunks = (integer) ceil($this->length / $this->chunkSize);
98 … $this->expectedLastChunkSize = ($this->length - (($this->numChunks - 1) * $this->chunkSize));
149 if ($this->chunkOffset === $this->numChunks - 1) {
153 return $this->chunkOffset >= $this->numChunks;
239 $numChunks = $this->chunkOffset - $lastChunkOffset;
240 for ($i = 0; $i < $numChunks; $i++) {
265 if ($this->chunkOffset === 0 && $this->numChunks === 0) {
283 $expectedChunkSize = $this->chunkOffset === $this->numChunks - 1
302 if ($this->chunkOffset === $this->numChunks - 1) {
/dports/games/libretro-scummvm/scummvm-7b1e929/common/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/libretro-scummvm/scummvm-7b1e929/devtools/create_titanic/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/libretro-scummvm/scummvm-7b1e929/devtools/create_xeen/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/scummvm/scummvm-2.5.1/common/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/scummvm/scummvm-2.5.1/devtools/create_titanic/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/scummvm/scummvm-2.5.1/devtools/create_xeen/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/scummvm-tools/scummvm-tools-2.5.0/common/
H A Dmemorypool.cpp70 page.numChunks = _chunksPerPage; in allocPage()
71 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
73 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
89 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
121 return (ptr >= page.start) && (ptr < (char*)page.start + page.numChunks * _chunkSize); in isPointerInPage()
148 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
179 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
180 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/games/residualvm/residualvm-0.3.1/common/
H A Dmemorypool.cpp66 page.numChunks = _chunksPerPage; in allocPage()
67 assert(page.numChunks * _chunkSize < 16*1024*1024); // Refuse to allocate pages bigger than 16 MB in allocPage()
69 page.start = ::malloc(page.numChunks * _chunkSize); in allocPage()
84 for (size_t i = 1; i < page.numChunks; ++i) { in addPageToPool()
117 return (ptr >= page.start) && (ptr < (char *)page.start + page.numChunks * _chunkSize); in isPointerInPage()
145 if (numberOfFreeChunksPerPage[i] == _pages[i].numChunks) { in freeUnusedPages()
177 if (_chunksPerPage < _pages[i].numChunks) in freeUnusedPages()
178 _chunksPerPage = _pages[i].numChunks; in freeUnusedPages()
/dports/www/gitea/gitea-1.16.5/vendor/github.com/blevesearch/zapx/v13/
H A DintDecoder.go33 var n, numChunks uint64
36 numChunks = 0
38 numChunks, read = binary.Uvarint(buf[offset+n : offset+n+binary.MaxVarintLen64])
42 if cap(rv.chunkOffsets) >= int(numChunks) {
43 rv.chunkOffsets = rv.chunkOffsets[:int(numChunks)]
45 rv.chunkOffsets = make([]uint64, int(numChunks))
47 for i := 0; i < int(numChunks); i++ {

12345678910>>...20