Home
last modified time | relevance | path

Searched refs:alpha_status (Results 1 – 25 of 31) sorted by relevance

12

/dports/science/R-cran-kernlab/kernlab/src/
H A Dsvm.cpp543 swap(alpha_status[i],alpha_status[j]); in swap_index()
862 delete[] alpha_status; in Solve()
1398 swap(alpha_status[i*nr_class+m], alpha_status[j*nr_class+m]); in swap_index()
1559 if (alpha_status[i]) in Solve()
1579 delete[] alpha_status; in Solve()
1597 if (alpha_status[j]) in select_working_set()
1763 swap(alpha_status[i],alpha_status[j]); in swap_index()
1987 delete[] alpha_status; in Solve()
2197 swap(alpha_status[i],alpha_status[j]); in swap_index()
2409 delete[] alpha_status; in Solve()
[all …]
/dports/multimedia/vmaf/vmaf-2.3.0/third_party/libsvm/java/libsvm/
H A Dsvm.java309 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE field in Solver
330 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
332 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
333 else alpha_status[i] = FREE; in update_alpha_status()
335 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
336 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
337 boolean is_free(int i) { return alpha_status[i] == FREE; } in is_free()
354 do {byte _=alpha_status[i]; alpha_status[i]=alpha_status[j]; alpha_status[j]=_;} while(false); in swap_index()
419 alpha_status = new byte[l]; in Solve()
H A Dsvm.m4309 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE
330 alpha_status[i] = UPPER_BOUND;
332 alpha_status[i] = LOWER_BOUND;
333 else alpha_status[i] = FREE;
335 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; }
336 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; }
337 boolean is_free(int i) { return alpha_status[i] == FREE; }
354 swap(byte, alpha_status[i],alpha_status[j]);
417 // initialize alpha_status
419 alpha_status = new byte[l];
[all …]
/dports/graphics/opencv/opencv-4.5.3/modules/ml/src/
H A Dsvm.cpp636 #define is_upper_bound(i) (alpha_status[i] > 0)
639 #define is_lower_bound(i) (alpha_status[i] < 0)
642 #define is_free(i) (alpha_status[i] == 0)
649 alpha_status[i] = (schar)(alpha[i] >= get_C(i) ? 1 : alpha[i] <= 0 ? -1 : 0)
658 schar* alpha_status = &alpha_status_vec[0]; in solve_generic() local
820 const schar* alpha_status = &alpha_status_vec[0]; in select_working_set() local
866 const schar* alpha_status = &alpha_status_vec[0]; in calc_rho() local
916 const schar* alpha_status = &alpha_status_vec[0]; in select_working_set_nu_svm() local
975 const schar* alpha_status = &alpha_status_vec[0]; in calc_rho_nu_svm() local
/dports/science/libsvm-python/libsvm-3.23/java/libsvm/
H A Dsvm.java310 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE field in Solver
331 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
333 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
334 else alpha_status[i] = FREE; in update_alpha_status()
336 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
337 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
338 boolean is_free(int i) { return alpha_status[i] == FREE; } in is_free()
355 do {byte tmp=alpha_status[i]; alpha_status[i]=alpha_status[j]; alpha_status[j]=tmp;} while(false); in swap_index()
420 alpha_status = new byte[l]; in Solve()
H A Dsvm.m4310 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE
331 alpha_status[i] = UPPER_BOUND;
333 alpha_status[i] = LOWER_BOUND;
334 else alpha_status[i] = FREE;
336 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; }
337 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; }
338 boolean is_free(int i) { return alpha_status[i] == FREE; }
355 swap(byte, alpha_status[i],alpha_status[j]);
418 // initialize alpha_status
420 alpha_status = new byte[l];
[all …]
/dports/science/libsvm/libsvm-3.23/java/libsvm/
H A Dsvm.java310 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE field in Solver
331 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
333 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
334 else alpha_status[i] = FREE; in update_alpha_status()
336 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
337 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
338 boolean is_free(int i) { return alpha_status[i] == FREE; } in is_free()
355 do {byte tmp=alpha_status[i]; alpha_status[i]=alpha_status[j]; alpha_status[j]=tmp;} while(false); in swap_index()
420 alpha_status = new byte[l]; in Solve()
H A Dsvm.m4310 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE
331 alpha_status[i] = UPPER_BOUND;
333 alpha_status[i] = LOWER_BOUND;
334 else alpha_status[i] = FREE;
336 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; }
337 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; }
338 boolean is_free(int i) { return alpha_status[i] == FREE; }
355 swap(byte, alpha_status[i],alpha_status[j]);
418 // initialize alpha_status
420 alpha_status = new byte[l];
[all …]
/dports/biology/viennarna/ViennaRNA-2.4.18/src/libsvm-3.24/java/libsvm/
H A Dsvm.java311 byte[] alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE field in Solver
332 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
334 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
335 else alpha_status[i] = FREE; in update_alpha_status()
337 boolean is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
338 boolean is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
339 boolean is_free(int i) { return alpha_status[i] == FREE; } in is_free()
356 do {byte tmp=alpha_status[i]; alpha_status[i]=alpha_status[j]; alpha_status[j]=tmp;} while(false); in swap_index()
421 alpha_status = new byte[l]; in Solve()
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/svm/src/libsvm/
H A Dsvm.cpp566 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in svm::Solver
586 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
588 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
589 else alpha_status[i] = FREE; in update_alpha_status()
591 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
592 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
593 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
608 swap(alpha_status[i],alpha_status[j]); in swap_index()
675 alpha_status = new char[l]; in Solve()
927 delete[] alpha_status; in Solve()
/dports/multimedia/vmaf/vmaf-2.3.0/libvmaf/src/
H A Dsvm.cpp418 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
437 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
439 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
440 else alpha_status[i] = FREE; in update_alpha_status()
442 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
443 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
444 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
459 swap(alpha_status[i],alpha_status[j]); in swap_index()
525 alpha_status = new char[l]; in Solve()
783 delete[] alpha_status; in Solve()
/dports/science/libsvm/libsvm-3.23/
H A Dsvm.cpp414 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
433 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
435 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
436 else alpha_status[i] = FREE; in update_alpha_status()
438 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
439 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
440 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
455 swap(alpha_status[i],alpha_status[j]); in swap_index()
521 alpha_status = new char[l]; in Solve()
779 delete[] alpha_status; in Solve()
/dports/science/libsvm-python/libsvm-3.23/
H A Dsvm.cpp414 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
433 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
435 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
436 else alpha_status[i] = FREE; in update_alpha_status()
438 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
439 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
440 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
455 swap(alpha_status[i],alpha_status[j]); in swap_index()
521 alpha_status = new char[l]; in Solve()
779 delete[] alpha_status; in Solve()
/dports/science/R-cran-e1071/e1071/src/
H A Dsvm.cpp420 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
439 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
441 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
442 else alpha_status[i] = FREE; in update_alpha_status()
444 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
445 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
446 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
461 swap(alpha_status[i],alpha_status[j]); in swap_index()
527 alpha_status = new char[l]; in Solve()
785 delete[] alpha_status; in Solve()
/dports/graphics/hugin/hugin-2020.0.0/src/celeste/
H A Dsvm.cpp461 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in celeste::Solver
480 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
482 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
483 else alpha_status[i] = FREE; in update_alpha_status()
485 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
486 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
487 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
502 swap(alpha_status[i],alpha_status[j]); in swap_index()
568 alpha_status = new char[l]; in Solve()
826 delete[] alpha_status; in Solve()
/dports/math/saga/saga-8.1.3/saga-gis/src/tools/imagery/imagery_svm/svm/
H A Dsvm.cpp413 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
432 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
434 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
435 else alpha_status[i] = FREE; in update_alpha_status()
437 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
438 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
439 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
454 swap(alpha_status[i],alpha_status[j]); in swap_index()
520 alpha_status = new char[l]; in Solve()
778 delete[] alpha_status; in Solve()
/dports/math/octave-forge-nan/nan-3.6.1/src/
H A Dsvm.cpp452 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
471 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
473 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
474 else alpha_status[i] = FREE; in update_alpha_status()
476 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
477 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
478 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
493 swap(alpha_status[i],alpha_status[j]); in swap_index()
559 alpha_status = new char[l]; in Solve()
817 delete[] alpha_status; in Solve()
/dports/multimedia/vmaf/vmaf-2.3.0/third_party/libsvm/
H A Dsvm.cpp414 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
433 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
435 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
436 else alpha_status[i] = FREE; in update_alpha_status()
438 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
439 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
440 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
455 swap(alpha_status[i],alpha_status[j]); in swap_index()
521 alpha_status = new char[l]; in Solve()
779 delete[] alpha_status; in Solve()
/dports/biology/viennarna/ViennaRNA-2.4.18/src/libsvm-3.24/
H A Dsvm.cpp414 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
433 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
435 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
436 else alpha_status[i] = FREE; in update_alpha_status()
438 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
439 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
440 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
455 swap(alpha_status[i],alpha_status[j]); in swap_index()
521 alpha_status = new char[l]; in Solve()
779 delete[] alpha_status; in Solve()
/dports/biology/vt/vt-0.57721/lib/libsvm/
H A Dsvm.cpp414 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
433 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
435 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
436 else alpha_status[i] = FREE; in update_alpha_status()
438 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
439 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
440 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
455 swap(alpha_status[i],alpha_status[j]); in swap_index()
521 alpha_status = new char[l]; in Solve()
779 delete[] alpha_status; in Solve()
/dports/devel/p5-Algorithm-SVM/Algorithm-SVM-0.13/
H A Dlibsvm.cpp407 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
426 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
428 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
429 else alpha_status[i] = FREE; in update_alpha_status()
431 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
432 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
433 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
448 swap(alpha_status[i],alpha_status[j]); in swap_index()
492 alpha_status = new char[l]; in Solve()
737 delete[] alpha_status; in Solve()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/ml/src/
H A Dsvm.cpp552 char* alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
574 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
576 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
578 alpha_status[i] = FREE; in update_alpha_status()
584 return alpha_status[i] == UPPER_BOUND; in is_upper_bound()
590 return alpha_status[i] == LOWER_BOUND; in is_lower_bound()
596 return alpha_status[i] == FREE; in is_free()
621 swap(alpha_status[i], alpha_status[j]); in swap_index()
694 alpha_status = new char[l]; in Solve()
953 delete[] alpha_status; in Solve()
/dports/math/fcl05/fcl-0.5.0/test/libsvm/
H A Dsvm.cpp421 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
441 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
443 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
444 else alpha_status[i] = FREE; in update_alpha_status()
446 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
447 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
448 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
463 swap(alpha_status[i],alpha_status[j]); in swap_index()
529 alpha_status = new char[l]; in Solve()
788 delete[] alpha_status; in Solve()
/dports/math/fcl/fcl-0.7.0/test/libsvm/
H A Dsvm.cpp454 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
474 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
476 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
477 else alpha_status[i] = FREE; in update_alpha_status()
479 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
480 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
481 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
496 swap(alpha_status[i],alpha_status[j]); in swap_index()
562 alpha_status = new char[l]; in Solve()
821 delete[] alpha_status; in Solve()
/dports/math/gretl/gretl-2021d/plugin/libsvm/
H A Dsvmlib.cpp487 char *alpha_status; // LOWER_BOUND, UPPER_BOUND, FREE member in Solver
504 alpha_status[i] = UPPER_BOUND; in update_alpha_status()
506 alpha_status[i] = LOWER_BOUND; in update_alpha_status()
507 else alpha_status[i] = FREE; in update_alpha_status()
509 bool is_upper_bound(int i) { return alpha_status[i] == UPPER_BOUND; } in is_upper_bound()
510 bool is_lower_bound(int i) { return alpha_status[i] == LOWER_BOUND; } in is_lower_bound()
511 bool is_free(int i) { return alpha_status[i] == FREE; } in is_free()
526 swap(alpha_status[i], alpha_status[j]); in swap_index()
587 alpha_status = new char[l]; in Solve()
812 delete[] alpha_status; in Solve()

12