| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/rt.equinox.bundles/bundles/org.eclipse.equinox.ds.tests/bundles_src/tb7/org/eclipse/equinox/ds/tests/tb7/ |
| H A D | StaticCircuit1.java | 18 private StaticCircuit2 mate = null; field in StaticCircuit1
19 public void bind(StaticCircuit2 mate) { in bind()
23 public void unbind(StaticCircuit2 mate) { in unbind()
|
| H A D | StaticCircuit2.java | 24 private StaticCircuit1 mate; field in StaticCircuit2
41 public void bind(StaticCircuit1 mate) { in bind()
45 public void unbind(StaticCircuit1 mate) { in unbind()
|
| /dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Metis/metis-4.0/Lib/ |
| H A D | mincover.c | 45 idxtype *mate, *queue, *flag, *level, *lst; in MinCover() local
126 int MinCover_Augment(idxtype *xadj, idxtype *adjncy, int col, idxtype *mate, idxtype *flag, idxtype… in MinCover_Augment()
163 void MinCover_Decompose(idxtype *xadj, idxtype *adjncy, int asize, int bsize, idxtype *mate, idxtyp… in MinCover_Decompose()
212 void MinCover_ColDFS(idxtype *xadj, idxtype *adjncy, int root, idxtype *mate, idxtype *where, int f… in MinCover_ColDFS()
237 void MinCover_RowDFS(idxtype *xadj, idxtype *adjncy, int root, idxtype *mate, idxtype *where, int f… in MinCover_RowDFS()
|
| /dports/graphics/colmap/colmap-3.6/lib/Graclus/metisLib/ |
| H A D | mincover.c | 45 idxtype *mate, *queue, *flag, *level, *lst; in MinCover() local
126 int MinCover_Augment(idxtype *xadj, idxtype *adjncy, int col, idxtype *mate, idxtype *flag, idxtype… in MinCover_Augment()
163 void MinCover_Decompose(idxtype *xadj, idxtype *adjncy, int asize, int bsize, idxtype *mate, idxtyp… in MinCover_Decompose()
212 void MinCover_ColDFS(idxtype *xadj, idxtype *adjncy, int root, idxtype *mate, idxtype *where, int f… in MinCover_ColDFS()
237 void MinCover_RowDFS(idxtype *xadj, idxtype *adjncy, int root, idxtype *mate, idxtype *where, int f… in MinCover_RowDFS()
|
| /dports/math/parmetis/parmetis-4.0.3/metis/libmetis/ |
| H A D | mincover.c | 45 idx_t *mate, *queue, *flag, *level, *lst; in MinCover() local
126 idx_t MinCover_Augment(idx_t *xadj, idx_t *adjncy, idx_t col, idx_t *mate, idx_t *flag, idx_t *leve… in MinCover_Augment()
163 void MinCover_Decompose(idx_t *xadj, idx_t *adjncy, idx_t asize, idx_t bsize, idx_t *mate, idx_t *c… in MinCover_Decompose()
212 void MinCover_ColDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_ColDFS()
237 void MinCover_RowDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_RowDFS()
|
| /dports/math/py-PyMetis/PyMetis-2020.1/src/metis/libmetis/ |
| H A D | mincover.c | 45 idx_t *mate, *queue, *flag, *level, *lst; in MinCover() local
126 idx_t MinCover_Augment(idx_t *xadj, idx_t *adjncy, idx_t col, idx_t *mate, idx_t *flag, idx_t *leve… in MinCover_Augment()
163 void MinCover_Decompose(idx_t *xadj, idx_t *adjncy, idx_t asize, idx_t bsize, idx_t *mate, idx_t *c… in MinCover_Decompose()
212 void MinCover_ColDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_ColDFS()
237 void MinCover_RowDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_RowDFS()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/ |
| H A D | mincover.c | 45 idx_t *mate, *queue, *flag, *level, *lst; in MinCover() local
126 idx_t MinCover_Augment(idx_t *xadj, idx_t *adjncy, idx_t col, idx_t *mate, idx_t *flag, idx_t *leve… in MinCover_Augment()
163 void MinCover_Decompose(idx_t *xadj, idx_t *adjncy, idx_t asize, idx_t bsize, idx_t *mate, idx_t *c… in MinCover_Decompose()
212 void MinCover_ColDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_ColDFS()
237 void MinCover_RowDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_RowDFS()
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/ |
| H A D | mincover.c | 45 idx_t *mate, *queue, *flag, *level, *lst; in MinCover() local
126 idx_t MinCover_Augment(idx_t *xadj, idx_t *adjncy, idx_t col, idx_t *mate, idx_t *flag, idx_t *leve… in MinCover_Augment()
163 void MinCover_Decompose(idx_t *xadj, idx_t *adjncy, idx_t asize, idx_t bsize, idx_t *mate, idx_t *c… in MinCover_Decompose()
212 void MinCover_ColDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_ColDFS()
237 void MinCover_RowDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_RowDFS()
|
| /dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/ |
| H A D | mincover.c | 44 idx_t *mate, *queue, *flag, *level, *lst; in MinCover() local
125 idx_t MinCover_Augment(idx_t *xadj, idx_t *adjncy, idx_t col, idx_t *mate, idx_t *flag, idx_t *leve… in MinCover_Augment()
162 void MinCover_Decompose(idx_t *xadj, idx_t *adjncy, idx_t asize, idx_t bsize, idx_t *mate, idx_t *c… in MinCover_Decompose()
211 void MinCover_ColDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_ColDFS()
236 void MinCover_RowDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_RowDFS()
|
| /dports/math/metis/metis-5.1.0/libmetis/ |
| H A D | mincover.c | 45 idx_t *mate, *queue, *flag, *level, *lst; in MinCover() local
126 idx_t MinCover_Augment(idx_t *xadj, idx_t *adjncy, idx_t col, idx_t *mate, idx_t *flag, idx_t *leve… in MinCover_Augment()
163 void MinCover_Decompose(idx_t *xadj, idx_t *adjncy, idx_t asize, idx_t bsize, idx_t *mate, idx_t *c… in MinCover_Decompose()
212 void MinCover_ColDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_ColDFS()
237 void MinCover_RowDFS(idx_t *xadj, idx_t *adjncy, idx_t root, idx_t *mate, idx_t *where, idx_t flag) in MinCover_RowDFS()
|
| /dports/science/siconos/siconos-4.4.0/externals/lbl/metis4/ |
| H A D | mincover.c | 45 idxtype *mate, *queue, *flag, *level, *lst; in MinCover() local
126 int MinCover_Augment(idxtype *xadj, idxtype *adjncy, int col, idxtype *mate, idxtype *flag, idxtype… in MinCover_Augment()
163 void MinCover_Decompose(idxtype *xadj, idxtype *adjncy, int asize, int bsize, idxtype *mate, idxtyp… in MinCover_Decompose()
212 void MinCover_ColDFS(idxtype *xadj, idxtype *adjncy, int root, idxtype *mate, idxtype *where, int f… in MinCover_ColDFS()
237 void MinCover_RowDFS(idxtype *xadj, idxtype *adjncy, int root, idxtype *mate, idxtype *where, int f… in MinCover_RowDFS()
|
| /dports/games/iortcw/iortcw-1.51c/MP/code/game/ |
| H A D | g_alarm.c | 72 gentity_t *t, *mate; in alarmbox_updateparts() local
188 gentity_t *mate; in alarmbox_finishspawning() local
|
| /dports/games/iortcw/iortcw-1.51c/SP/code/game/ |
| H A D | g_alarm.c | 83 gentity_t *t, *mate; in alarmbox_updateparts() local
217 gentity_t *mate; in alarmbox_finishspawning() local
|
| /dports/biology/sra-tools/sra-tools-2.11.0/tools/cg-load/ |
| H A D | writer-algn.c | 190 uint32_t const mate, in CGWriterAlgn_Save()
313 unsigned const mate = data->map[i].mate; in FindBestPair() local
335 unsigned const mate = data->map[i].mate; in FindBestPair() local
353 unsigned const mate = data->map[i].mate; in FindBestPair() local
366 unsigned const mate = data->map[i].mate; in FindBestPair() local
380 unsigned const mate = data->map[best].mate; in FindBestPair() local
611 unsigned const mate = data->map[i].mate; in CGWriterAlgn_Write_int() local
784 uint32_t mate = data->map[i].mate; in CGWriterAlgn_Write() local
804 uint32_t mate = data->map[i].mate; in CGWriterAlgn_Write() local
|
| /dports/x11/xapp/xapp-2.2.6/status-applets/ |
| H A D | meson.build | 1 subdir('mate') subdir
|
| /dports/math/combblas/CombBLAS_beta_16_2/BipartiteMatchings/ |
| H A D | BPMaximumMatching.cpp | 298 int64_t cardDMD = mateRow2Col.Count([](int64_t mate){return mate!=-1;}); in experiment_maximal()
303 int64_t mmcardDMD = mateRow2Col.Count([](int64_t mate){return mate!=-1;}); in experiment_maximal()
312 int64_t cardKS = mateRow2Col.Count([](int64_t mate){return mate!=-1;}); in experiment_maximal()
317 int64_t mmcardKS = mateRow2Col.Count([](int64_t mate){return mate!=-1;}); in experiment_maximal()
327 int64_t cardGreedy = mateRow2Col.Count([](int64_t mate){return mate!=-1;}); in experiment_maximal()
332 int64_t mmcardGreedy = mateRow2Col.Count([](int64_t mate){return mate!=-1;}); in experiment_maximal()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 43 const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
65 const Graph& g, MateMap mate) in matching_size()
71 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
89 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
476 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
793 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
813 const Graph& g, MateMap mate, VertexIndexMap vm) in checked_edmonds_maximum_cardinality_matching()
822 const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
830 const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
837 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 36 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
61 matching_size(const Graph& g, MateMap mate) in matching_size()
70 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
91 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
487 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
823 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
844 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
856 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
865 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
876 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 43 const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
65 const Graph& g, MateMap mate) in matching_size()
71 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
89 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
476 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
793 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
813 const Graph& g, MateMap mate, VertexIndexMap vm) in checked_edmonds_maximum_cardinality_matching()
822 const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
830 const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
837 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 43 const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
65 const Graph& g, MateMap mate) in matching_size()
71 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
89 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
476 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
793 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
813 const Graph& g, MateMap mate, VertexIndexMap vm) in checked_edmonds_maximum_cardinality_matching()
822 const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
830 const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
837 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 35 matching_size(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size()
60 matching_size(const Graph& g, MateMap mate) in matching_size()
69 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching()
90 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching()
502 vertex_to_vertex_map_t mate; member in boost::edmonds_augmenting_path_finder
839 bool matching(const Graph& g, MateMap mate, VertexIndexMap vm) in matching()
860 …inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndex… in checked_edmonds_maximum_cardinality_matching()
872 inline bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in checked_edmonds_maximum_cardinality_matching()
881 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm) in edmonds_maximum_cardinality_matching()
892 inline void edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate) in edmonds_maximum_cardinality_matching()
|