Home
last modified time | relevance | path

Searched refs:prev_index2 (Results 1 – 8 of 8) sorted by relevance

/dports/archivers/lzip/lzip-1.22/
H A Dencoder.h96 int prev_index2; // -2 trial is single step member
105 prev_index2 = single_step_trial; } in update()
112 prev_index2 = dual_step_trial; } in update2()
120 prev_index2 = p_i2; } in update3()
233 if( trials[cur].prev_index2 != single_step_trial ) in backward()
237 prev_trial.prev_index2 = single_step_trial; in backward()
238 if( trials[cur].prev_index2 >= 0 ) in backward()
242 prev_trial2.prev_index = trials[cur].prev_index2; in backward()
243 prev_trial2.prev_index2 = single_step_trial; in backward()
278 trials[1].prev_index2 = single_step_trial; in LZ_encoder()
H A Dencoder.cc295 const int prev_index2 = cur_trial.prev_index2; in sequence_optimizer() local
297 if( prev_index2 == single_step_trial ) in sequence_optimizer()
310 if( prev_index2 == dual_step_trial ) // dis4 == 0 (rep0) in sequence_optimizer()
313 prev_index = prev_index2; in sequence_optimizer()
343 next_trial.prev_index2 == single_step_trial ) in sequence_optimizer()
/dports/misc/mc/mc-4.8.27/src/viewer/
H A Dnroff.c239 off_t prev_index, prev_index2; in mcview_nroff_seq_prev() local
272 prev_index2 = prev_index - 1; in mcview_nroff_seq_prev()
274 while (prev_index2 != 0) in mcview_nroff_seq_prev()
278 prev_index2--; in mcview_nroff_seq_prev()
281 nroff->index = (prev_index2 == 0) ? prev_index : prev_index2; in mcview_nroff_seq_prev()
/dports/misc/mc-nox11/mc-4.8.27/src/viewer/
H A Dnroff.c239 off_t prev_index, prev_index2; in mcview_nroff_seq_prev() local
272 prev_index2 = prev_index - 1; in mcview_nroff_seq_prev()
274 while (prev_index2 != 0) in mcview_nroff_seq_prev()
278 prev_index2--; in mcview_nroff_seq_prev()
281 nroff->index = (prev_index2 == 0) ? prev_index : prev_index2; in mcview_nroff_seq_prev()
/dports/archivers/lzlib/lzlib-1.12/
H A Dencoder.h106 int prev_index2; /* -2 trial is single step */ member
117 trial->prev_index2 = single_step_trial; } in Tr_update()
125 trial->prev_index2 = dual_step_trial; } in Tr_update2()
134 trial->prev_index2 = p_i2; } in Tr_update3()
264 if( e->trials[cur].prev_index2 != single_step_trial ) in LZe_backward()
268 prev_trial->prev_index2 = single_step_trial; in LZe_backward()
269 if( e->trials[cur].prev_index2 >= 0 ) in LZe_backward()
273 prev_trial2->prev_index = e->trials[cur].prev_index2; in LZe_backward()
274 prev_trial2->prev_index2 = single_step_trial; in LZe_backward()
308 e->trials[1].prev_index2 = single_step_trial; in LZe_init()
H A Dencoder.c295 const int prev_index2 = cur_trial->prev_index2; in LZe_sequence_optimizer() local
297 if( prev_index2 == single_step_trial ) in LZe_sequence_optimizer()
310 if( prev_index2 == dual_step_trial ) /* dis4 == 0 (rep0) */ in LZe_sequence_optimizer()
313 prev_index = prev_index2; in LZe_sequence_optimizer()
343 next_trial->prev_index2 == single_step_trial ) in LZe_sequence_optimizer()
/dports/science/py-dlib/dlib-19.22/dlib/graph_utils/
H A Dedge_list_graphs.h231 unsigned long prev_index2 = beg->index2(); in find_approximate_k_nearest_neighbors() local
236 if (beg->index2() != prev_index2) in find_approximate_k_nearest_neighbors()
241 prev_index2 = beg->index2(); in find_approximate_k_nearest_neighbors()
/dports/science/dlib-cpp/dlib-19.22/dlib/graph_utils/
H A Dedge_list_graphs.h231 unsigned long prev_index2 = beg->index2(); in find_approximate_k_nearest_neighbors() local
236 if (beg->index2() != prev_index2) in find_approximate_k_nearest_neighbors()
241 prev_index2 = beg->index2(); in find_approximate_k_nearest_neighbors()