| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/algo/ |
| H A D | matching.rs | 14 mate: Vec<Option<G::NodeId>>, field
38 pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> { in mate() function
136 mate: &'a [Option<G::NodeId>], field
162 mate: &'a [Option<G::NodeId>], field
220 let mut mate = vec![None; graph.node_bound()]; in greedy_matching_inner() localVariable
|
| /dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/src/algo/ |
| H A D | matching.rs | 14 mate: Vec<Option<G::NodeId>>, field
38 pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> { in mate() function
136 mate: &'a [Option<G::NodeId>], field
162 mate: &'a [Option<G::NodeId>], field
220 let mut mate = vec![None; graph.node_bound()]; in greedy_matching_inner() localVariable
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | minimum_degree_ordering.hpp | 36 template <class SignedInteger> in matching_size()
37 class Stacks { in matching_size()
61 current = v; in matching_size()
71 in matching_size()
72 // To return a stack object in matching_size()
92 template <class SignedInteger, class Vertex, class VertexIndexMap> in is_a_matching()
502 supernode_size[i_node] = 0;
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 22 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
42 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1024 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1042 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1069 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1117 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1152 void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1160 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 23 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
47 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1158 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1182 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1211 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1261 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1297 const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1306 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 23 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
47 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1158 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1182 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1211 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1261 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1297 const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1306 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 23 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
47 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1158 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1182 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1211 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1261 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1297 const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1306 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 22 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
42 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1024 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1042 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1069 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1117 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1152 void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1160 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 22 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
42 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1024 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1042 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1069 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1117 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1152 void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1160 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 23 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum()
47 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum()
1158 vertex_to_vertex_map_t mate; member in boost::weighted_augmenting_path_finder
1182 void maximum_weighted_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in maximum_weighted_matching()
1211 inline void maximum_weighted_matching(const Graph& g, MateMap mate) in maximum_weighted_matching()
1261 vertex_to_vertex_map_t mate, best_mate; member in boost::brute_force_matching
1297 const Graph& g, MateMap mate, VertexIndexMap vm) in brute_force_maximum_weighted_matching()
1306 inline void brute_force_maximum_weighted_matching(const Graph& g, MateMap mate) in brute_force_maximum_weighted_matching()
|
| /dports/biology/bamutil/bamUtil-1.0.15/src/ |
| H A D | MateMapByCoord.cpp | 36 SamRecord* mate = NULL; in getMate() local
|
| /dports/biology/sra-tools/sra-tools-2.11.0/tools/cg-load/ |
| H A D | factory-mappings.c | 270 unsigned const mate = data->map[i].mate; in CGMappings15_Read() local
339 unsigned const mate = data->map[i].mate; in CGMappings22_Read() local
435 unsigned const mate = data->map[i].mate; in CGMappings25_Read() local
|
| H A D | writer-algn.h | 45 uint32_t mate; member
|
| /dports/x11-themes/mate-icon-theme/mate-icon-theme-1.26.0/ |
| H A D | Makefile.am | 6 mate subdir
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/genetics/ |
| H A D | UniformCrossover.java | 103 private ChromosomePair mate(final AbstractListChromosome<T> first, in mate() method in UniformCrossover
|
| H A D | OrderedCrossover.java | 87 …protected ChromosomePair mate(final AbstractListChromosome<T> first, final AbstractListChromosome<… in mate() method in OrderedCrossover
|
| H A D | NPointCrossover.java | 125 private ChromosomePair mate(final AbstractListChromosome<T> first, in mate() method in NPointCrossover
|
| H A D | CycleCrossover.java | 119 …protected ChromosomePair mate(final AbstractListChromosome<T> first, final AbstractListChromosome<… in mate() method in CycleCrossover
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/yara/ |
| H A D | mapper_writer.h | 276 auto const & mate = me.primaryMatches[mateId]; in _writeUnmappedRead() local
363 TMatch const & mate = me.primaryMatches[mateId]; in _writeMappedRead() local
523 inline void _fillMatePosition(MatchesWriter<TSpec, Traits> & me, TMatch const & mate) in _fillMatePosition()
534 inline void _fillMateOrientation(MatchesWriter<TSpec, Traits> & me, TMatch const & mate) in _fillMateOrientation()
545 … void _fillMateInsert(MatchesWriter<TSpec, Traits> & me, TMatch const & match, TMatch const & mate) in _fillMateInsert()
|
| /dports/math/spooles/spooles.2.2/BPG/src/ |
| H A D | DM.c | 998 int *mate ; in unitDM() local
1041 int mate[], in unitFindMaxMatch()
1114 int mate[], in unitAugmentingPath()
1207 int mate[], in unitSetFlags()
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/BPG/src/ |
| H A D | DM.c | 998 int *mate ; in unitDM() local
1041 int mate[], in unitFindMaxMatch()
1114 int mate[], in unitAugmentingPath()
1207 int mate[], in unitSetFlags()
|
| /dports/math/spooles-mpich/spooles.2.2/BPG/src/ |
| H A D | DM.c | 998 int *mate ; in unitDM() local
1041 int mate[], in unitFindMaxMatch()
1114 int mate[], in unitAugmentingPath()
1207 int mate[], in unitSetFlags()
|
| /dports/math/spooles/spooles.2.2_SHARED/BPG/src/ |
| H A D | DM.c | 998 int *mate ; in unitDM() local
1041 int mate[], in unitFindMaxMatch()
1114 int mate[], in unitAugmentingPath()
1207 int mate[], in unitSetFlags()
|
| /dports/devel/open-beagle/beagle-3.0.3/beagle/GA/src/ |
| H A D | CrossoverIndicesIntVecOp.cpp | 92 bool Beagle::GA::CrossoverIndicesIntVecOp::mate(Beagle::Individual& ioIndiv1, in mate() function in Beagle::GA::CrossoverIndicesIntVecOp
|
| /dports/devel/ipython/ipython-7.29.0/IPython/lib/ |
| H A D | editorhooks.py | 103 def mate(exe=u'mate'): function
|