Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
oneDAL
114
issues
35
pull requests
3,337
files
1
active branch
×
CodeFactor Rating A-
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
cpp\daal\src\algorithms\objective_function\cross_entropy_loss\cross_entropy_loss_dense_default_batch_fpt_dispatcher.cpp
3
3
-
A
cpp\daal\src\algorithms\objective_function\logistic_loss\logistic_loss_dense_default_batch_fpt_dispatcher.cpp
3
3
-
A
cpp\daal\src\algorithms\distributions\bernoulli\bernoulli_batch_container.h
3
1
-
A
cpp\oneapi\dal\backend\primitives\distance\squared_l2_distance_dpc.cpp
3
1
-
A
cpp\daal\include\algorithms\sorting\sorting_types.h
3
2
-
A
cpp\oneapi\dal\algo\linear_regression\backend\cpu\infer_kernel_norm_eq.cpp
3
1
-
A
cpp\daal\include\algorithms\gradient_boosted_trees\gbt_regression_predict_types.h
3
3
-
A
cpp\daal\src\algorithms\optimization_solver\adagrad\adagrad_batch_container.h
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\adagrad\adagrad_dense_default_batch_fpt_dispatcher.cpp
3
3
-
A
cpp\daal\src\algorithms\distributions\normal\normal_batch_container.h
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\coordinate_descent\coordinate_descent_batch_container.h
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\coordinate_descent\coordinate_descent_dense_default_batch_fpt_dispatcher.cpp
3
2
-
A
cpp\oneapi\dal\algo\linear_kernel\compute_types.hpp
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\coordinate_descent\coordinate_descent_types_fpt.cpp
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\iterative_solver_types_fpt.cpp
3
2
-
A
cpp\daal\src\algorithms\distributions\uniform\uniform_batch_container.h
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\lbfgs\lbfgs_batch_container.h
3
1
-
A
cpp\daal\src\algorithms\optimization_solver\lbfgs\lbfgs_dense_default_batch_fpt_dispatcher.cpp
3
3
-
A
cpp\oneapi\dal\table\common.hpp
3
2
-
A
cpp\oneapi\dal\backend\primitives\distance\cosine_distance_dpc.cpp
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!