Lines Matching refs:Chunk
85 // E F chunk
94 // [ 0 0 0 0 | z1 0 0 0 0] non chunk blocks
95 // [ 0 0 0 0 | 0 0 z3 z4 z5] non chunk blocks
126 // parameter block yi are known as a chunk, and the algorithm operates
127 // on one chunk at a time. The mathematics remains the same since the
129 // linear systems for each chunk. This can be seen by observing two
134 // 2. When E'F is computed, only the terms within a single chunk
241 // Chunk objects store combinatorial information needed to
242 // efficiently eliminate a whole chunk out of the least squares
243 // problem. Consider the first chunk in the example matrix above.
253 // position in the buffer_ array. The size of the chunk is the
257 // For the example chunk shown above,
267 struct Chunk {
268 Chunk() : size(0) {}
275 const Chunk& chunk,
284 void UpdateRhs(const Chunk& chunk,
321 // see the documentation of the Chunk object above.
322 vector<Chunk> chunks_;
329 // buffer_size_. Each thread accesses the chunk
337 // buffer_size_. Each thread accesses the chunk
