| /dports/devel/p5-Time-Progress/Time-Progress-2.12/lib/Time/ |
| H A D | Progress.pm | 84 my $last_e = $self->{ 'last_e' };
114 …if ( $self->{ 'smoothing' } && $last_e && $last_e < $e && ( ( $e - $last_e ) / $last_e ) < $sdelta…
116 $e = $last_e;
119 $self->{last_e} = $e if $self->{ 'smoothing' };
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 58 EdgeIterator last_e, edges_size_type m) in vertex_and_edge_range() argument
64 , last_edge(last_e) in vertex_and_edge_range()
70 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
75 , last_edge(last_e) in vertex_and_edge_range()
78 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
145 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
149 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 58 EdgeIterator last_e, edges_size_type m) in vertex_and_edge_range() argument
64 , last_edge(last_e) in vertex_and_edge_range()
70 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
75 , last_edge(last_e) in vertex_and_edge_range()
78 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
145 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
149 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 58 EdgeIterator last_e, edges_size_type m) in vertex_and_edge_range() argument
64 , last_edge(last_e) in vertex_and_edge_range()
70 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
75 , last_edge(last_e) in vertex_and_edge_range()
78 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
145 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
149 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 54 EdgeIterator first_e, EdgeIterator last_e, in vertex_and_edge_range() argument
58 first_edge(first_e), last_edge(last_e), m_num_edges(m) in vertex_and_edge_range()
64 EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
67 first_edge(first_e), last_edge(last_e) in vertex_and_edge_range()
70 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
128 EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
132 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | vertex_and_edge_range.hpp | 58 EdgeIterator last_e, edges_size_type m) in vertex_and_edge_range() argument
64 , last_edge(last_e) in vertex_and_edge_range()
70 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range() argument
75 , last_edge(last_e) in vertex_and_edge_range()
78 m_num_edges = std::distance(first_e, last_e); in vertex_and_edge_range()
145 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in make_vertex_and_edge_range() argument
149 return result_type(g, first_v, last_v, first_e, last_e); in make_vertex_and_edge_range()
|
| /dports/math/cgal/CGAL-5.3/examples/Polyhedron/ |
| H A D | polyhedron_prog_subdiv_with_boundary.cpp | 80 Edge_iterator last_e = P.edges_end(); in subdiv() local
81 -- last_e; // the last of the old edges in subdiv()
98 ++ last_e; // make it the past-the-end position again in subdiv()
99 while ( e != last_e) { in subdiv()
139 Edge_iterator last_e = P.edges_end(); in subdiv_border() local
140 -- last_e; // the last of the old edges in subdiv_border()
147 } while ( e++ != last_e); in subdiv_border()
155 } while ( e++ != last_e); in subdiv_border()
168 } while ( e++ != last_e); in subdiv_border()
|
| /dports/www/yt-dlp/yt-dlp-2021.12.27/yt_dlp/extractor/ |
| H A D | cbs.py | 35 last_e = None
42 last_e = e
51 last_e = e
55 if last_e and not formats:
56 self.raise_no_formats(last_e, True, content_id)
|
| /dports/www/youtube_dl/youtube-dl/youtube_dl/extractor/ |
| H A D | cbs.py | 72 last_e = None
91 last_e = e
95 if last_e and not formats:
96 raise last_e
|
| /dports/net-mgmt/lldpd/lldpd-1.0.8/libevent/test/ |
| H A D | regress_minheap.c | 59 struct event *e, *last_e; in test_heap_randomized() local
80 last_e = min_heap_pop_(&heap); in test_heap_randomized()
85 tt_want(evutil_timercmp(&last_e->ev_timeout, in test_heap_randomized()
|
| /dports/net/netatalk3/netatalk-3.1.12/libevent/test/ |
| H A D | regress_minheap.c | 58 struct event *e, *last_e; in test_heap_randomized() local
79 last_e = min_heap_pop(&heap); in test_heap_randomized()
84 tt_want(evutil_timercmp(&last_e->ev_timeout, in test_heap_randomized()
|
| /dports/www/firefox-esr/firefox-91.8.0/ipc/chromium/src/third_party/libevent/test/ |
| H A D | regress_minheap.c | 59 struct event *e, *last_e; in test_heap_randomized() local
80 last_e = min_heap_pop_(&heap); in test_heap_randomized()
85 tt_want(evutil_timercmp(&last_e->ev_timeout, in test_heap_randomized()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/ipc/chromium/src/third_party/libevent/test/ |
| H A D | regress_minheap.c | 59 struct event *e, *last_e; in test_heap_randomized() local
80 last_e = min_heap_pop_(&heap); in test_heap_randomized()
85 tt_want(evutil_timercmp(&last_e->ev_timeout, in test_heap_randomized()
|