Home
last modified time | relevance | path

Searched defs:weight (Results 51 – 75 of 13728) sorted by relevance

12345678910>>...550

/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/compiler/src/
H A Dcerl_inline.erl112 weight(var) -> 0; % We count no cost for variable accesses. function
115 weight(data) -> 1; % Base cost; add 1 per element. function
119 weight('let') -> 0; % Count no cost for let-bindings. function
120 weight(letrec) -> 0; % Like a let-binding. function
121 weight('case') -> 0; % Case switches have no base cost. function
123 weight('receive') -> 9; % Initialization/cleanup cost. function
124 weight('try') -> 1; % Assume efficient implementation. function
125 weight('catch') -> 1; % See `try'. function
126 weight(apply) -> 3; % Average base cost: call/return. function
129 weight(binary) -> 4; % Initialisation base cost. function
[all …]
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/compiler/src/
H A Dcerl_inline.erl112 weight(var) -> 0; % We count no cost for variable accesses. function
115 weight(data) -> 1; % Base cost; add 1 per element. function
119 weight('let') -> 0; % Count no cost for let-bindings. function
120 weight(letrec) -> 0; % Like a let-binding. function
121 weight('case') -> 0; % Case switches have no base cost. function
123 weight('receive') -> 9; % Initialization/cleanup cost. function
124 weight('try') -> 1; % Assume efficient implementation. function
125 weight('catch') -> 1; % See `try'. function
126 weight(apply) -> 3; % Average base cost: call/return. function
129 weight(binary) -> 4; % Initialisation base cost. function
[all …]
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/compiler/src/
H A Dcerl_inline.erl112 weight(var) -> 0; % We count no cost for variable accesses. function
115 weight(data) -> 1; % Base cost; add 1 per element. function
119 weight('let') -> 0; % Count no cost for let-bindings. function
120 weight(letrec) -> 0; % Like a let-binding. function
121 weight('case') -> 0; % Case switches have no base cost. function
123 weight('receive') -> 9; % Initialization/cleanup cost. function
124 weight('try') -> 1; % Assume efficient implementation. function
125 weight('catch') -> 1; % See `try'. function
126 weight(apply) -> 3; % Average base cost: call/return. function
129 weight(binary) -> 4; % Initialisation base cost. function
[all …]
/dports/lang/erlang/otp-OTP-24.1.7/lib/compiler/src/
H A Dcerl_inline.erl112 weight(var) -> 0; % We count no cost for variable accesses. function
115 weight(data) -> 1; % Base cost; add 1 per element. function
119 weight('let') -> 0; % Count no cost for let-bindings. function
120 weight(letrec) -> 0; % Like a let-binding. function
121 weight('case') -> 0; % Case switches have no base cost. function
123 weight('receive') -> 9; % Initialization/cleanup cost. function
124 weight('try') -> 1; % Assume efficient implementation. function
125 weight('catch') -> 1; % See `try'. function
126 weight(apply) -> 3; % Average base cost: call/return. function
129 weight(binary) -> 4; % Initialisation base cost. function
[all …]
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/compiler/src/
H A Dcerl_inline.erl112 weight(var) -> 0; % We count no cost for variable accesses. function
115 weight(data) -> 1; % Base cost; add 1 per element. function
119 weight('let') -> 0; % Count no cost for let-bindings. function
120 weight(letrec) -> 0; % Like a let-binding. function
121 weight('case') -> 0; % Case switches have no base cost. function
123 weight('receive') -> 9; % Initialization/cleanup cost. function
124 weight('try') -> 1; % Assume efficient implementation. function
125 weight('catch') -> 1; % See `try'. function
126 weight(apply) -> 3; % Average base cost: call/return. function
129 weight(binary) -> 4; % Initialisation base cost. function
[all …]
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/compiler/src/
H A Dcerl_inline.erl112 weight(var) -> 0; % We count no cost for variable accesses. function
115 weight(data) -> 1; % Base cost; add 1 per element. function
119 weight('let') -> 0; % Count no cost for let-bindings. function
120 weight(letrec) -> 0; % Like a let-binding. function
121 weight('case') -> 0; % Case switches have no base cost. function
123 weight('receive') -> 9; % Initialization/cleanup cost. function
124 weight('try') -> 1; % Assume efficient implementation. function
125 weight('catch') -> 1; % See `try'. function
126 weight(apply) -> 3; % Average base cost: call/return. function
129 weight(binary) -> 4; % Initialisation base cost. function
[all …]
/dports/science/colt/colt/src/cern/jet/stat/quantile/
H A DBuffer.java15 protected int weight; field in Buffer
76 public int weight() { in weight() method in Buffer
82 public void weight(int weight) { in weight() argument
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/hotspot/jtreg/vmTestbase/nsk/sysdict/share/
H A DBTreeGen.java68 int weight = WEIGHT; in main() local
82 private static void doit(int height, int weight) in doit()
116 private void generate(int height, int weight) { in generate()
126 private void gen(String name, int height, int weight) { in gen()
137 private void genClass(String baseName, String className, int weight) { in genClass()
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/
H A Dmincost.py10 def min_cost_flow_cost(G, demand="demand", capacity="capacity", weight="weight"): argument
99 def min_cost_flow(G, demand="demand", capacity="capacity", weight="weight"): argument
187 def cost_of_flow(G, flowDict, weight="weight"): argument
231 def max_flow_min_cost(G, s, t, capacity="capacity", weight="weight"): argument
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/approximation/
H A Dtraveling_salesman.py123 def christofides(G, weight="weight", tree=None): argument
195 def traveling_salesman_problem(G, weight="weight", nodes=None, cycle=True, method=None): argument
284 def threshold_tsp(G, weight): argument
324 def greedy_tsp(G, weight="weight", source=None): argument
419 weight="weight", argument
637 weight="weight", argument
/dports/games/cataclysm-dda-tiles/Cataclysm-DDA-0.F/data/json/artifact/
H A Dartifact_item_types.json9 "weight": "1 kg", string
20 "weight": "300 g", string
32 "weight": "50 g", string
42 "weight": "80 g", string
52 "weight": "300 g", string
64 "weight": "575 g", string
75 "weight": "125 g", string
85 "weight": "1 g", string
95 "weight": "800 g", string
106 "weight": "800 g", string
[all …]
/dports/games/cataclysm-dda/Cataclysm-DDA-0.F/data/json/artifact/
H A Dartifact_item_types.json9 "weight": "1 kg", string
20 "weight": "300 g", string
32 "weight": "50 g", string
42 "weight": "80 g", string
52 "weight": "300 g", string
64 "weight": "575 g", string
75 "weight": "125 g", string
85 "weight": "1 g", string
95 "weight": "800 g", string
106 "weight": "800 g", string
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/relay/op/nn/
H A Dconvolution.cc39 Expr MakeConvWinogradWeightTransform(Expr weight, int tile_size, std::string op_name) { in MakeConvWinogradWeightTransform()
61 String out_layout, DataType out_dtype) { in __anon9765ad300102()
95 String out_layout, DataType out_dtype) { in __anon9765ad300202()
129 String out_layout, DataType out_dtype) { in __anon9765ad300302()
294 String kernel_layout, String out_layout, DataType out_dtype) { in __anon9765ad300702()
326 .set_body_typed([](Expr weight, int tile_size) { in __anon9765ad300802()
352 String kernel_layout, String out_layout, DataType out_dtype) { in __anon9765ad300902()
382 .set_body_typed([](Expr weight, int tile_size) { in __anon9765ad300a02()
404 Expr MakeConv2DWinogradNNPACKWeightTransform(Expr weight, int convolution_algorithm, in MakeConv2DWinogradNNPACKWeightTransform()
490 String out_layout, DataType out_dtype) { in __anon9765ad300d02()
[all …]
/dports/misc/py-gluonnlp/gluon-nlp-0.10.0/src/gluonnlp/optimizer/
H A Dbert_adam.py71 def create_state_multi_precision(self, index, weight): argument
84 def create_state(self, _, weight): argument
89 def update(self, index, weight, grad, state): argument
93 def update_multi_precision(self, index, weight, grad, state): argument
99 def _update_impl(self, indices, weight, grad, state, multi_precision=False): argument
/dports/math/py-networkx/networkx-2.6.3/networkx/linalg/
H A Dlaplacianmatrix.py15 def laplacian_matrix(G, nodelist=None, weight="weight"): argument
62 def normalized_laplacian_matrix(G, nodelist=None, weight="weight"): argument
139 G, nodelist=None, weight="weight", walk_type=None, alpha=0.95 argument
223 G, nodelist=None, weight="weight", walk_type=None, alpha=0.95 argument
298 def _transition_matrix(G, nodelist=None, weight="weight", walk_type=None, alpha=0.95): argument
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/src/gpu/effects/generated/
H A DGrComposeLerpEffect.h23 float weight) { in Make()
31 float weight; variable
36 float weight) in GrComposeLerpEffect()
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/connectivity/
H A Dedge_augmentation.py133 def k_edge_augmentation(G, k, avail=None, weight=None, partial=False): argument
283 def partial_k_edge_augmentation(G, k, avail, weight=None): argument
385 def one_edge_augmentation(G, avail=None, weight=None, partial=False): argument
439 def bridge_augmentation(G, avail=None, weight=None): argument
496 def _unpack_available_edges(avail, weight=None, G=None): argument
616 def weighted_one_edge_augmentation(G, avail, weight=None, partial=False): argument
838 def weighted_bridge_augmentation(G, avail, weight=None): argument
1147 def greedy_k_edge_augmentation(G, k, avail=None, weight=None, seed=None): argument
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/codegen/
H A DSplitter.java107 long weight = WeighNodes.weigh(functionNode); in split() local
185 protected CompileUnit findUnit(final long weight) { in findUnit()
203 final long weight = WeighNodes.weigh(statement, weightCache); in splitBlock() local
236 …l Block parent, final FunctionNode function, final List<Statement> statements, final long weight) { in createBlockSplitNode()
252 final long weight = WeighNodes.weigh(block, weightCache); in enterBlock() local
270 long weight = WeighNodes.weigh(block, weightCache); in leaveBlock() local
284 long weight = WeighNodes.weigh(literal); in leaveLiteralNode() local
331 long weight = WeighNodes.weigh(objectNode); in leaveObjectNode() local
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/codegen/
H A DSplitter.java107 long weight = WeighNodes.weigh(functionNode); in split() local
185 protected CompileUnit findUnit(final long weight) { in findUnit()
203 final long weight = WeighNodes.weigh(statement, weightCache); in splitBlock() local
236 …l Block parent, final FunctionNode function, final List<Statement> statements, final long weight) { in createBlockSplitNode()
252 final long weight = WeighNodes.weigh(block, weightCache); in enterBlock() local
270 long weight = WeighNodes.weigh(block, weightCache); in leaveBlock() local
284 long weight = WeighNodes.weigh(literal); in leaveLiteralNode() local
331 long weight = WeighNodes.weigh(objectNode); in leaveObjectNode() local

12345678910>>...550