OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:num_row_blocks
(Results
1 - 9
of
9
) sorted by null
/external/ceres-solver/internal/ceres/
compressed_col_sparse_matrix_utils.cc
49
const int
num_row_blocks
= row_blocks.size();
local
52
vector<int> row_block_starts(
num_row_blocks
);
53
for (int i = 0, cursor = 0; i <
num_row_blocks
; ++i) {
detect_structure.cc
43
const int
num_row_blocks
= bs.rows.size();
local
50
for (int r = 0; r <
num_row_blocks
; ++r) {
cxsparse.cc
109
const int
num_row_blocks
= row_blocks.size();
local
121
block_matrix.m =
num_row_blocks
;
130
vector<int> block_ordering(
num_row_blocks
, -1);
131
copy(ordering, ordering +
num_row_blocks
, &block_ordering[0]);
compressed_row_sparse_matrix_test.cc
412
int
num_row_blocks
;
member in struct:ceres::internal::RandomMatrixOptions
424
for (int i = 0; i < options.
num_row_blocks
; ++i) {
443
for (int r = 0; r < options.
num_row_blocks
; ++r) {
502
for (int
num_row_blocks
= 1;
503
num_row_blocks
< kMaxNumRowBlocks;
504
++
num_row_blocks
) {
512
options.
num_row_blocks
=
num_row_blocks
;
520
VLOG(2) << "num row blocks: " << options.
num_row_blocks
;
suitesparse.cc
210
const int
num_row_blocks
= row_blocks.size();
local
226
block_matrix.nrow =
num_row_blocks
;
239
vector<int> block_ordering(
num_row_blocks
);
schur_complement_solver.cc
186
const int
num_row_blocks
= bs->rows.size();
local
199
while (r <
num_row_blocks
) {
208
for (; r <
num_row_blocks
; ++r) {
233
for (; r <
num_row_blocks
; ++r) {
visibility_based_preconditioner.cc
253
const int
num_row_blocks
= bs.rows.size();
local
270
while (r <
num_row_blocks
) {
278
for (; r <
num_row_blocks
; ++r) {
309
for (; r <
num_row_blocks
; ++r) {
compressed_row_sparse_matrix.cc
222
int
num_row_blocks
= 0;
local
224
while (
num_row_blocks
< row_blocks_.size() && num_rows < num_rows_) {
225
num_rows += row_blocks_[
num_row_blocks
];
226
++
num_row_blocks
;
229
row_blocks_.resize(
num_row_blocks
);
schur_eliminator_impl.h
89
const int
num_row_blocks
= bs->rows.size();
local
111
while (r <
num_row_blocks
) {
126
while (r + chunk.size <
num_row_blocks
) {
Completed in 495 milliseconds