| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/colvars/ |
| H A D | colvarcomp.h | 357 class colvar::distance_vec
361 distance_vec (std::string const &conf);
362 distance_vec();
363 virtual inline ~distance_vec() {} in ~distance_vec()
1361 inline cvm::real colvar::distance_vec::dist2 (colvarvalue const &x1, in dist2()
1367 inline colvarvalue colvar::distance_vec::dist2_lgrad (colvarvalue const &x1, in dist2_lgrad()
1373 inline colvarvalue colvar::distance_vec::dist2_rgrad (colvarvalue const &x1, in dist2_rgrad()
1379 inline cvm::real colvar::distance_vec::compare (colvarvalue const &x1, in compare()
|
| H A D | colvarcomp_distances.cpp | 91 colvar::distance_vec::distance_vec (std::string const &conf) in distance_vec() function in colvar::distance_vec
98 colvar::distance_vec::distance_vec() in distance_vec() function in colvar::distance_vec
105 void colvar::distance_vec::calc_value() in calc_value()
115 void colvar::distance_vec::calc_gradients() in calc_gradients()
121 void colvar::distance_vec::apply_force (colvarvalue const &force) in apply_force()
|
| /dports/science/lammps/lammps-stable_29Sep2021/lib/colvars/ |
| H A D | colvarcomp_distances.cpp | 101 colvar::distance_vec::distance_vec(std::string const &conf) in simple_scalar_dist_functions()
111 colvar::distance_vec::distance_vec() in distance_vec() function in colvar::distance_vec
121 void colvar::distance_vec::calc_value() in calc_value()
132 void colvar::distance_vec::calc_gradients() in calc_gradients()
139 void colvar::distance_vec::apply_force(colvarvalue const &force) in apply_force()
149 cvm::real colvar::distance_vec::dist2(colvarvalue const &x1, in dist2()
156 colvarvalue colvar::distance_vec::dist2_lgrad(colvarvalue const &x1, in dist2_lgrad()
163 colvarvalue colvar::distance_vec::dist2_rgrad(colvarvalue const &x1, in dist2_rgrad()
|
| /dports/graphics/krita/krita-4.4.8/libs/image/lazybrush/ |
| H A D | kis_lazy_fill_tools.cpp | 111 …std::vector<typename graph_traits<KisLazyFillGraph>::vertices_size_type> distance_vec(num_vertices… in cutOneWay() local
128 make_iterator_property_map(&distance_vec[0], vertexIndexMap), in cutOneWay()
|
| H A D | patched_boykov_kolmogorov_max_flow.hpp | 800 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
806 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
833 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
839 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/program_utils/ |
| H A D | vecmath.h | 62 inline double distance_vec(const Array1 <double> & a, in distance_vec() function
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 784 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
790 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
817 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
823 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 997 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1001 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
1022 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1025 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 997 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1001 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
1022 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1025 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 997 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1001 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
1022 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1025 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 791 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
797 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
824 std::vector<typename graph_traits<Graph>::vertices_size_type> distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
830 make_iterator_property_map(distance_vec.begin(), idx), in boykov_kolmogorov_max_flow()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | boykov_kolmogorov_max_flow.hpp | 997 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1001 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
1022 distance_vec(n_verts); in boykov_kolmogorov_max_flow() local
1025 make_iterator_property_map(distance_vec.begin(), idx), idx, src, sink); in boykov_kolmogorov_max_flow()
|
| /dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/ |
| H A D | prediction.py | 577 distance_vec = dist_membership_vector(
589 result[i] = distance_vec ** 0.5 * outlier_vec ** 2.0
|
| /dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/attic/ |
| H A D | vecmath.h | 65 inline double distance_vec(std::vector <double> & a, std::vector <double> & b) { in distance_vec() function
|