| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/ |
| H A D | get_paths.R | 73 longest_path = FALSE, argument
227 longest_path == FALSE) {
250 longest_path == TRUE) {
330 longest_path == FALSE) {
335 longest_path == TRUE) {
345 longest_path == FALSE)) {
|
| /dports/biology/avida/avida-2.12.4-src/libs/apto/src/stat/ |
| H A D | FishersExact.cc | 329 double longest_path; member
383 m_table[t_idx].longest_path = old_table[i].longest_path; in Rehash()
731 … if (path_extremes[path_idx].longest_path > 0.0) path_extremes[path_idx].longest_path = 0.0; in Calculate()
821 m_path_extremes[k][path_idx].longest_path = path.longest_path; in ThreadedCalculate()
851 m_path_extremes[k][path_idx].longest_path = path.longest_path; in ThreadedCalculate()
942 m_path_extremes[k][path_idx].longest_path = path.longest_path; in handleNode()
1001 if (longest_path > 0.0) longest_path = 0.0; in Run()
1269 double longest_path = 0.0; in longestPath() local
1271 return longest_path; in longestPath()
1276 double longest_path = 0.0; in longestPath() local
[all …]
|
| /dports/graphics/graphviz/graphviz-2.44.1/lib/circogen/ |
| H A D | blockpath.c | 608 nodelist_t *longest_path; in layout_block() local
620 longest_path = find_longest_path(tree); in layout_block()
621 place_residual_nodes(subg, longest_path); in layout_block()
625 longest_path = reduce_edge_crossings(longest_path, subg); in layout_block()
627 N = sizeNodelist(longest_path); in layout_block()
628 largest_node = largest_nodesize(longest_path); in layout_block()
635 for (item = longest_path->first; item; item = item->next) { in layout_block()
639 realignNodelist(longest_path, item); in layout_block()
645 for (item = longest_path->first; item; item = item->next) { in layout_block()
667 return longest_path; in layout_block()
|
| H A D | circpos.c | 447 nodelist_t *longest_path; in doBlock() local
459 longest_path = layout_block(g, sn, min_dist); in doBlock()
460 sn->circle_list = longest_path; in doBlock()
461 length = sizeNodelist(longest_path); /* path contains everything in block */ in doBlock()
466 position(g, childCount, length, longest_path, sn, min_dist); in doBlock()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/tools/tryselect/util/ |
| H A D | estimates.py | 93 longest_path = find_longest_path(graph, tasklist, durations)
120 output["wall_duration_seconds"] = timedelta(seconds=int(longest_path))
121 output["eta_datetime"] = datetime.now()+timedelta(seconds=longest_path)
|
| /dports/mail/thunderbird/thunderbird-91.8.0/tools/tryselect/util/ |
| H A D | estimates.py | 91 longest_path = find_longest_path(graph, tasklist, durations)
119 output["wall_duration_seconds"] = timedelta(seconds=int(longest_path))
120 output["eta_datetime"] = datetime.now() + timedelta(seconds=longest_path)
|
| /dports/www/firefox/firefox-99.0/tools/tryselect/util/ |
| H A D | estimates.py | 91 longest_path = find_longest_path(graph, tasklist, durations)
119 output["wall_duration_seconds"] = timedelta(seconds=int(longest_path))
120 output["eta_datetime"] = datetime.now() + timedelta(seconds=longest_path)
|
| /dports/www/firefox-esr/firefox-91.8.0/tools/tryselect/util/ |
| H A D | estimates.py | 91 longest_path = find_longest_path(graph, tasklist, durations)
119 output["wall_duration_seconds"] = timedelta(seconds=int(longest_path))
120 output["eta_datetime"] = datetime.now() + timedelta(seconds=longest_path)
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/man/ |
| H A D | get_paths.Rd | 12 longest_path = FALSE,
26 \item{longest_path}{An option to return paths that are the longest in the set
87 longest_path = TRUE)
|
| /dports/devel/git-svn/git-2.34.1/perl/Git/SVN/ |
| H A D | Ra.pm | 388 my $longest_path = '';
391 $longest_path = $_;
395 $longest_path;
416 my $longest_path = longest_common_path($gsv, $globs);
431 $self->get_log([$longest_path], $min, $max, 0, 1, 1,
439 print STDERR "Path '$longest_path' ",
448 $self->get_log([$longest_path], $min, $hi,
|
| /dports/devel/git-gui/git-2.34.1/perl/Git/SVN/ |
| H A D | Ra.pm | 388 my $longest_path = '';
391 $longest_path = $_;
395 $longest_path;
416 my $longest_path = longest_common_path($gsv, $globs);
431 $self->get_log([$longest_path], $min, $max, 0, 1, 1,
439 print STDERR "Path '$longest_path' ",
448 $self->get_log([$longest_path], $min, $hi,
|
| /dports/devel/git-p4/git-2.34.1/perl/Git/SVN/ |
| H A D | Ra.pm | 388 my $longest_path = '';
391 $longest_path = $_;
395 $longest_path;
416 my $longest_path = longest_common_path($gsv, $globs);
431 $self->get_log([$longest_path], $min, $max, 0, 1, 1,
439 print STDERR "Path '$longest_path' ",
448 $self->get_log([$longest_path], $min, $hi,
|
| /dports/devel/git/git-2.34.1/perl/Git/SVN/ |
| H A D | Ra.pm | 388 my $longest_path = '';
391 $longest_path = $_;
395 $longest_path;
416 my $longest_path = longest_common_path($gsv, $globs);
431 $self->get_log([$longest_path], $min, $max, 0, 1, 1,
439 print STDERR "Path '$longest_path' ",
448 $self->get_log([$longest_path], $min, $hi,
|
| /dports/devel/git-cvs/git-2.34.1/perl/Git/SVN/ |
| H A D | Ra.pm | 388 my $longest_path = '';
391 $longest_path = $_;
395 $longest_path;
416 my $longest_path = longest_common_path($gsv, $globs);
431 $self->get_log([$longest_path], $min, $max, 0, 1, 1,
439 print STDERR "Path '$longest_path' ",
448 $self->get_log([$longest_path], $min, $hi,
|
| /dports/devel/cgit/cgit-1.2.3/git/perl/Git/SVN/ |
| H A D | Ra.pm | 388 my $longest_path = '';
391 $longest_path = $_;
395 $longest_path;
416 my $longest_path = longest_common_path($gsv, $globs);
431 $self->get_log([$longest_path], $min, $max, 0, 1, 1,
439 print STDERR "Path '$longest_path' ",
448 $self->get_log([$longest_path], $min, $hi,
|
| /dports/net/google-cloud-sdk/google-cloud-sdk/lib/googlecloudsdk/core/util/ |
| H A D | pkg_resources.py | 108 longest_path = ''
110 if path.startswith(p) and len(longest_path) < len(p):
111 longest_path = p
112 return longest_path
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/java/ |
| H A D | jcf-path.c | 94 static int longest_path = 0; variable
168 if (len > longest_path) in add_entry()
169 longest_path = len; in add_entry()
484 return longest_path; in jcf_path_max_len()
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/java/ |
| H A D | jcf-path.c | 94 static int longest_path = 0; variable
168 if (len > longest_path) in add_entry()
169 longest_path = len; in add_entry()
484 return longest_path; in jcf_path_max_len()
|
| /dports/math/p5-Graph/Graph-0.9725/t/ |
| H A D | 73_diameter.t | 48 is($g->longest_path, 4);
50 is($g->longest_path(qw(a h)), 3);
52 is($g->longest_path('a', undef), 3);
54 is($g->longest_path(undef, 'h'), 4);
117 is($h->longest_path, 4.0);
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/java/ |
| H A D | jcf-path.c | 91 static int longest_path = 0; variable
165 if (len > longest_path) in add_entry()
166 longest_path = len; in add_entry()
515 return longest_path; in jcf_path_max_len()
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/java/ |
| H A D | jcf-path.c | 91 static int longest_path = 0; variable
165 if (len > longest_path) in add_entry()
166 longest_path = len; in add_entry()
515 return longest_path; in jcf_path_max_len()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/java/ |
| H A D | jcf-path.c | 91 static int longest_path = 0; variable
165 if (len > longest_path) in add_entry()
166 longest_path = len; in add_entry()
515 return longest_path; in jcf_path_max_len()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/java/ |
| H A D | jcf-path.c | 91 static int longest_path = 0; variable
165 if (len > longest_path) in add_entry()
166 longest_path = len; in add_entry()
515 return longest_path; in jcf_path_max_len()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/java/ |
| H A D | jcf-path.c | 91 static int longest_path = 0; variable
165 if (len > longest_path) in add_entry()
166 longest_path = len; in add_entry()
515 return longest_path; in jcf_path_max_len()
|
| /dports/devel/cdash/CDash-2-2-3/tests/kwtest/simpletest/ |
| H A D | cookies.php | 327 $longest_path = '';
330 if (strlen($cookie->getPath()) > strlen($longest_path)) {
332 $longest_path = $cookie->getPath();
|