| /dports/math/nauty/nauty27r3/ |
| H A D | numleaves.c | 18 numleaves(graph *g, boolean digraph, long Qlo, long Qhi, int m, int n) in numleaves() function
|
| /dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/ |
| H A D | numleaves.c | 18 numleaves(graph *g, boolean digraph, long Qlo, long Qhi, int m, int n) in numleaves() function
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/tokudb/PerconaFT/src/tests/ |
| H A D | seqinsert.cc | 54 const size_t numleaves = max_degree * 3; // want height 2, this should be good enough variable
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | treesort.c | 254 int numleaves) /* in: number of leaves */ in copyOTU()
292 int numleaves) /* in: number of leaves */ in copytree()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3818 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4305 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4396 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3818 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4305 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4396 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3818 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4305 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4396 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3765 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4252 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4343 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3765 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4252 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4343 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3818 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4305 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4396 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3819 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4306 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4397 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/adlc/ |
| H A D | adlparse.cpp | 3819 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4306 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4397 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/adlc/ |
| H A D | adlparse.cpp | 3816 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4303 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4394 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/adlc/ |
| H A D | adlparse.cpp | 3816 int numleaves = 0; // Counter for number of leaves in rule in match_parse() local
4303 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { in matchNode_parse()
4394 MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot… in matchChild_parse()
|