Home
last modified time | relevance | path

Searched refs:demand (Results 151 – 175 of 14020) sorted by relevance

12345678910>>...561

/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/java/net/httpclient/reactivestreams-tck/org/reactivestreams/example/unicast/
H A DAsyncIterablePublisher.java88 …private long demand = 0; // Here we track the current demand, i.e. what has been requested but not… field in AsyncIterablePublisher.SubscriptionImpl
108 else if (demand + n < 1) { in doRequest()
110 …demand = Long.MAX_VALUE; // Here we protect from the overflow and treat it as "effectively unboun… in doRequest()
113 demand += n; // Here we record the downstream demand in doRequest()
191 … && --demand > 0); // This makes sure that rule 1.1 is upheld (sending more than was demanded) in doSend()
193 …if (!cancelled && demand > 0) // If the `Subscription` is still alive and well, and we have demand… in doSend()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/net/httpclient/reactivestreams-tck-tests/
H A DS.java192 long demand;
197 demand = demand + n < 0 ? Long.MAX_VALUE : demand + n;
209 while (supply.hasNext() && demand > 0 && !cancelled) {
210 demand--;
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/net/httpclient/reactivestreams-tck/org/reactivestreams/example/unicast/
H A DAsyncIterablePublisher.java88 …private long demand = 0; // Here we track the current demand, i.e. what has been requested but not… field in AsyncIterablePublisher.SubscriptionImpl
108 else if (demand + n < 1) { in doRequest()
110 …demand = Long.MAX_VALUE; // Here we protect from the overflow and treat it as "effectively unboun… in doRequest()
113 demand += n; // Here we record the downstream demand in doRequest()
191 … && --demand > 0); // This makes sure that rule 1.1 is upheld (sending more than was demanded) in doSend()
193 …if (!cancelled && demand > 0) // If the `Subscription` is still alive and well, and we have demand… in doSend()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/net/httpclient/reactivestreams-tck/org/reactivestreams/example/unicast/
H A DAsyncIterablePublisher.java88 …private long demand = 0; // Here we track the current demand, i.e. what has been requested but not… field in AsyncIterablePublisher.SubscriptionImpl
108 else if (demand + n < 1) { in doRequest()
110 …demand = Long.MAX_VALUE; // Here we protect from the overflow and treat it as "effectively unboun… in doRequest()
113 demand += n; // Here we record the downstream demand in doRequest()
191 … && --demand > 0); // This makes sure that rule 1.1 is upheld (sending more than was demanded) in doSend()
193 …if (!cancelled && demand > 0) // If the `Subscription` is still alive and well, and we have demand… in doSend()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/net/httpclient/reactivestreams-tck-tests/
H A DS.java192 long demand;
197 demand = demand + n < 0 ? Long.MAX_VALUE : demand + n;
209 while (supply.hasNext() && demand > 0 && !cancelled) {
210 demand--;
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/net/httpclient/reactivestreams-tck/org/reactivestreams/example/unicast/
H A DAsyncIterablePublisher.java88 …private long demand = 0; // Here we track the current demand, i.e. what has been requested but not… field in AsyncIterablePublisher.SubscriptionImpl
108 else if (demand + n < 1) { in doRequest()
110 …demand = Long.MAX_VALUE; // Here we protect from the overflow and treat it as "effectively unboun… in doRequest()
113 demand += n; // Here we record the downstream demand in doRequest()
191 … && --demand > 0); // This makes sure that rule 1.1 is upheld (sending more than was demanded) in doSend()
193 …if (!cancelled && demand > 0) // If the `Subscription` is still alive and well, and we have demand… in doSend()
/dports/math/py-or-tools/or-tools-9.2/examples/cpp/
H A Dcvrptw.cc104 RandomDemand demand(manager.num_nodes(), kDepot, in main() local
106 demand.Initialize(); in main()
108 [&demand, &manager](int64_t i, int64_t j) { in main()
109 return demand.Demand(manager.IndexToNode(i), in main()
120 [&demand](RoutingNodeIndex i, RoutingNodeIndex j) { in main()
121 return demand.Demand(i, j); in main()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/net/httpclient/reactivestreams-tck-tests/
H A DS.java192 long demand;
197 demand = demand + n < 0 ? Long.MAX_VALUE : demand + n;
209 while (supply.hasNext() && demand > 0 && !cancelled) {
210 demand--;
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/net/httpclient/reactivestreams-tck/org/reactivestreams/example/unicast/
H A DAsyncIterablePublisher.java88 …private long demand = 0; // Here we track the current demand, i.e. what has been requested but not… field in AsyncIterablePublisher.SubscriptionImpl
108 else if (demand + n < 1) { in doRequest()
110 …demand = Long.MAX_VALUE; // Here we protect from the overflow and treat it as "effectively unboun… in doRequest()
113 demand += n; // Here we record the downstream demand in doRequest()
191 … && --demand > 0); // This makes sure that rule 1.1 is upheld (sending more than was demanded) in doSend()
193 …if (!cancelled && demand > 0) // If the `Subscription` is still alive and well, and we have demand… in doSend()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Heuristics/
H A Dsweep.c33 int *demand = p->demand; in make_tour() local
55 if (weight + demand[data[i].cust] <= capacity){ in make_tour()
56 weight += demand[data[i].cust]; in make_tour()
64 weight = demand[data[i].cust]; in make_tour()
69 demand[data[i].cust] <= capacity){ tour[data[i].cust].next = in make_tour()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/net/httpclient/reactivestreams-tck-tests/
H A DS.java192 long demand;
197 demand = demand + n < 0 ? Long.MAX_VALUE : demand + n;
209 while (supply.hasNext() && demand > 0 && !cancelled) {
210 demand--;
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/game/src/sandbox/dashboards/
H A Dtraffic_signals.rs136 if let Some(demand) = all_demand.get_mut(&t.parent) { in all_demand()
137 demand in all_demand()
168 for (i, demand) in all_demand { in draw_demand()
169 let cnt = demand.count(hour); in draw_demand()
173 for (m, demand) in cnt.consume() { in draw_demand()
174 let percent = (demand as f64) / total_demand; in draw_demand()
181 Text::from(Line(prettyprint_usize(demand)).fg(Color::RED)) in draw_demand()
/dports/devel/elixir-gen_stage/gen_stage-0.14.0/lib/gen_stage/
H A Ddispatcher.ex19 events to the consumer with the biggest demand in a FIFO
23 consumers. The demand is only sent upstream once all consumers
44 {:ok, demand :: non_neg_integer, new_state}
54 {:ok, demand :: non_neg_integer, new_state}
58 Called every time a consumer sends demand.
60 The demand will always be a positive integer (more than 0).
62 return tuple. The returned demand is then sent to producers.
67 @callback ask(demand :: pos_integer, from :: {pid, reference}, state :: term) ::
/dports/cad/sumo/sumo-1.2.0/tools/sumolib/scenario/scenarios/
H A Drilsa1_both_tls.py20 import sumolib.net.generator.demand as demandGenerator
70 self.demand = demandGenerator.Demand()
81 … self.demand.addStream(demandGenerator.Stream(f[0] + "__" + rel[0], 0, 3600, rel[1], f[0], rel[0],
87 self.demand.build(
H A Drilsa1_both_tls24.py21 import sumolib.net.generator.demand as demandGenerator
69 self.demand = demandGenerator.Demand()
80 … self.demand.addStream(demandGenerator.Stream(f[0] + "__" + rel[0], 0, 3600, rel[1], f[0], rel[0],
86 self.demand.build(
H A Drilsa1_out_tls.py22 import sumolib.net.generator.demand as demandGenerator
71 self.demand = demandGenerator.Demand()
82 … self.demand.addStream(demandGenerator.Stream(f[0] + "__" + rel[0], 0, 3600, rel[1], f[0], rel[0],
88 self.demand.build(
H A Drilsa1_out_tls24.py22 import sumolib.net.generator.demand as demandGenerator
71 self.demand = demandGenerator.Demand()
82 … self.demand.addStream(demandGenerator.Stream(f[0] + "__" + rel[0], 0, 3600, rel[1], f[0], rel[0],
88 self.demand.build(
H A Dbasic_corridor.py21 import sumolib.net.generator.demand as demandGenerator
55 self.demand = demandGenerator.Demand()
58 self.demand.addStream(demandGenerator.Stream(
61 self.demand.build(0, 3600, self.netName, self.demandName)
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/
H A Dshrink.c75 demand[v2] += demand[v1]; in reduce_graph()
76 demand[v1] = 0; in reduce_graph()
205 set_demand = demand[compmembers[i]]; in greedy_shrinking1()
345 set_demand += demand[compmembers[i]]; in greedy_shrinking6()
466 set_demand = demand[i]; in greedy_shrinking1_one()
557 set_demand += demand[max_vert]; in greedy_shrinking1_one()
630 set_demand += demand[i]; in greedy_shrinking6_one()
723 set_demand += demand[max_vert]; in greedy_shrinking6_one()
788 set_demand = demand[cur_edge1->other_end] + in greedy_shrinking2_one()
789 demand[cur_edge2->other_end]; in greedy_shrinking2_one()
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/HelpSource/Classes/
H A DDreset.schelp2 summary:: demand rate reset
6 The reset of a demand ugen can be controlled "from the outside" by the reset input of the link::Cla…
11 a demand UGen, producing values which are passed through
13 a demand or any other UGen. When crossing from nonpositive to positive, it resets the first argumen…
/dports/devel/radare2/radare2-5.1.1/libr/magic/d/default/
H A Dopenbsd14 # 0 belong&0377777777 041400413 OpenBSD/i386 demand paged
35 # 0 belong&0377777777 041600413 OpenBSD/m68k demand paged
56 # 0 belong&0377777777 042000413 OpenBSD/m68k4k demand paged
77 # 0 belong&0377777777 042200413 OpenBSD/ns32532 demand paged
98 # 0 belong&0377777777 042400413 OpenBSD/sparc demand paged
119 # 0 belong&0377777777 042600413 OpenBSD/pmax demand paged
140 # 0 belong&0377777777 043000413 OpenBSD/vax1k demand paged
161 # 0 belong&0377777777 045400413 OpenBSD/vax demand paged
195 # 0 belong&0377777777 047400413 OpenBSD/mips64 demand paged
216 # 0 belong&0377777777 043600413 OpenBSD/arm demand paged
/dports/games/nethack34/nethack-3.4.3/src/
H A Dminion.c145 long cash, demand, offer; local
172 demand = (cash * (rnd(80) + 20 * Athome)) /
175 if (!demand) { /* you have no gold */
184 demand = cash + (long)rn1(1000,40);
187 Amonnam(mtmp), demand, currency(demand));
189 if ((offer = bribe(mtmp)) >= demand) {
192 } else if (offer > 0L && (long)rnd(40) > (demand - offer)) {
/dports/games/nethack34-nox11/nethack-3.4.3/src/
H A Dminion.c145 long cash, demand, offer; local
172 demand = (cash * (rnd(80) + 20 * Athome)) /
175 if (!demand) { /* you have no gold */
184 demand = cash + (long)rn1(1000,40);
187 Amonnam(mtmp), demand, currency(demand));
189 if ((offer = bribe(mtmp)) >= demand) {
192 } else if (offer > 0L && (long)rnd(40) > (demand - offer)) {
/dports/games/unnethack/unnethack-5.1.0-20131208/src/
H A Dminion.c146 long cash, demand, offer; local
176 demand = (cash * (rnd(80) + 20 * Athome)) /
178 } while (demand < 3000);
195 demand =
204 Amonnam(mtmp), demand, currency(demand));
206 if ((offer = bribe(mtmp)) >= demand) {
209 } else if (offer > 0L && (long)rnd(40) > (demand - offer)) {
/dports/games/vultures-eye/vulture-2.3.67/unnethack/src/
H A Dminion.c145 long cash, demand, offer; local
175 demand = (cash * (rnd(80) + 20 * Athome)) /
177 } while (demand < 3000);
194 demand =
203 Amonnam(mtmp), demand, currency(demand));
205 if ((offer = bribe(mtmp)) >= demand) {
208 } else if (offer > 0L && (long)rnd(40) > (demand - offer)) {

12345678910>>...561