| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| WeightedObservedPoint.java | 33 /** Weight of the measurement in the fitting process. */
34 private final double weight; field in class:WeightedObservedPoint
43 * @param weight weight of the measurement in the fitting process
47 public WeightedObservedPoint(final double weight, final double x, final double y) {
48 this.weight = weight;
53 /** Get the weight of the measurement in the fitting process.
54 * @return weight of the measurement in the fitting process
57 return weight;
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| WeightedMeasurement.java | 59 /** Measurement weight. */
60 private final double weight; field in class:WeightedMeasurement
72 * @param weight weight of the measurement in the least squares problem
79 public WeightedMeasurement(double weight, double measuredValue) {
80 this.weight = weight;
89 * @param weight weight of the measurement in the least squares problem
93 public WeightedMeasurement(double weight, double measuredValue
[all...] |
| /frameworks/minikin/include/minikin/ |
| AnalyzeStyle.h | 22 bool analyzeStyle(const uint8_t* os2_data, size_t os2_size, int* weight, bool* italic);
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/prefill/ |
| PreFillType.java | 15 private final int weight; field in class:PreFillType
26 * @param weight An integer indicating how to balance pre-filling this size and configuration of
29 PreFillType(int width, int height, Bitmap.Config config, int weight) {
37 this.weight = weight;
62 * Returns the weight of the {@link android.graphics.Bitmap Bitmaps} of this type.
65 return weight;
74 && weight == other.weight
85 result = 31 * result + weight;
107 private int weight = 1; field in class:PreFillType.Builder
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| stochastic.py | 12 def stochastic_graph(G, copy=True, weight='weight'):
26 weight : edge attribute key (optional, default='weight')
27 Edge data key used for weight. If no attribute is found for an edge
28 the edge weight is set to 1.
43 degree = W.out_degree(weight=weight)
45 d[weight] = float(d.get(weight,1.0))/degree[u
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/flow/tests/ |
| test_mincost.py | 11 G.add_edge('a', 'b', weight = 3, capacity = 4)
12 G.add_edge('a', 'c', weight = 6, capacity = 10)
13 G.add_edge('b', 'd', weight = 1, capacity = 9)
14 G.add_edge('c', 'd', weight = 2, capacity = 5)
30 G.add_edge('s', 'a', weight = 1, capacity = 3)
31 G.add_edge('a', 'b', weight = 3)
32 G.add_edge('c', 'a', weight = -6)
33 G.add_edge('b', 'd', weight = 1)
34 G.add_edge('d', 'c', weight = -2)
35 G.add_edge('d', 't', weight = 1, capacity = 3
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/linalg/ |
| spectrum.py | 18 def laplacian_spectrum(G, weight='weight'):
26 weight : string or None, optional (default='weight')
28 If None, then each edge has weight 1.
49 return np.linalg.eigvals(nx.laplacian_matrix(G,weight=weight))
51 def adjacency_spectrum(G, weight='weight'):
59 weight : string or None, optional (default='weight'
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| hierarchy.py | 15 def flow_hierarchy(G, weight=None):
26 weight : key,optional (default=None)
27 Attribute to use for node weights. If None the weight defaults to 1.
53 return 1.-sum(G.subgraph(c).size(weight) for c in scc)/float(G.size(weight))
|
| vitality.py | 15 def weiner_index(G, weight=None):
19 if weight is None:
26 n,weight=weight)
31 def closeness_vitality(G, weight=None):
41 weight : None or string (optional)
42 The name of the edge attribute used as weight. If None the edge
67 wig = weiner_index(G,weight)
81 closeness_vitality[n] = wig - weiner_index(G,weight)
|
| /external/marisa-trie/lib/marisa/ |
| range.h | 43 WRange(const Range &range, double weight)
44 : range_(range), weight_(weight) {}
45 WRange(UInt32 begin, UInt32 end, UInt32 pos, double weight)
46 : range_(begin, end, pos), weight_(weight) {}
57 void set_weight(double weight) {
58 weight_ = weight;
73 double weight() const { function in class:marisa::WRange
83 return lhs.weight() > rhs.weight();
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| range.h | 43 WRange(const Range &range, double weight)
44 : range_(range), weight_(weight) {}
45 WRange(UInt32 begin, UInt32 end, UInt32 pos, double weight)
46 : range_(begin, end, pos), weight_(weight) {}
57 void set_weight(double weight) {
58 weight_ = weight;
73 double weight() const { function in class:marisa_alpha::WRange
83 return lhs.weight() > rhs.weight();
|
| /external/clang/www/demo/ |
| syntax.css | 4 .llvm_keyword { font-weight: bold; color: blue }
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/assortativity/ |
| neighbor_degree.py | 13 def _average_nbr_deg(G, source_degree, target_degree, nodes=None, weight=None):
16 for n,deg in source_degree(nodes,weight=weight).items():
21 if weight is None:
24 avg[n] = sum((G[n][nbr].get(weight,1)*d
29 nodes=None, weight=None):
47 is the weight of the edge that links `i` and `j` and
68 weight : string or None, optional (default=None)
69 The edge attribute that holds the numerical value used as a weight.
70 If None, then each edge has weight 1
[all...] |
| connectivity.py | 15 nodes=None, weight=None):
21 if weight is None:
23 else: # weight nbr degree by weight of (n,nbr) edge
25 s = float(sum((G[n][nbr].get(weight,1)*d
28 s = float(sum((G[n][nbr].get(weight,1)*d
31 s = float(sum((G[nbr][n].get(weight,1)*d
33 dnorm[k] += source_degree(n, weight=weight)
46 nodes=None, weight=None)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/shortest_paths/ |
| generic.py | 44 def shortest_path(G, source=None, target=None, weight=None):
59 weight : None or string, optional (default = None)
60 If None, every edge has weight/distance/cost 1.
61 If a string, use this edge attribute as the edge weight.
117 if weight is None:
120 paths=nx.all_pairs_dijkstra_path(G,weight=weight)
127 if weight is None:
130 paths=nx.single_source_dijkstra_path(G,target,weight=weight)
[all...] |
| /external/jmdns/src/javax/jmdns/ |
| ServiceInfo.java | 111 * @param weight
112 * weight of the service
119 public static ServiceInfo create(final String type, final String name, final int port, final int weight, final int priority, final String text) {
120 return new ServiceInfoImpl(type, name, "", port, weight, priority, false, text);
134 * @param weight
135 * weight of the service
142 public static ServiceInfo create(final String type, final String name, final String subtype, final int port, final int weight, final int priority, final String text) {
143 return new ServiceInfoImpl(type, name, subtype, port, weight, priority, false, text);
155 * @param weight
156 * weight of the servic
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationWeights.java | 75 * @param lowerLimit A collation element weight; the ranges will be filled to cover
77 * @param upperLimit A collation element weight; the ranges will be filled to cover
90 // printf("error: unable to get Weight ranges\n");
134 * @return The next weight in the ranges, or 0xffffffff if there is none left.
140 /* get the next weight */
142 long weight = range.start; local
147 /* increment the weight for the next value */
148 range.start = incWeight(weight, range.length);
152 return weight;
177 public static int lengthOfWeight(long weight) {
330 long weight=lowerLimit; local
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_ssim.h | 21 int lumamask, double *weight);
|
| /dalvik/docs/ |
| prettify.css | 18 .kwd { color: #006; font-weight: bold; }
20 .typ { color: #404; font-weight: bold; }
24 .tag { color: #006; font-weight: bold; }
|
| /external/icu/icu4c/source/i18n/ |
| collationweights.h | 36 static inline int32_t lengthOfWeight(uint32_t weight) {
37 if((weight&0xffffff)==0) {
39 } else if((weight&0xffff)==0) {
41 } else if((weight&0xff)==0) {
57 * @param lowerLimit A collation element weight; the ranges will be filled to cover
59 * @param upperLimit A collation element weight; the ranges will be filled to cover
72 * @return The next weight in the ranges, or 0xffffffff if there is none left.
88 uint32_t incWeight(uint32_t weight, int32_t length) const;
89 uint32_t incWeightByOffset(uint32_t weight, int32_t length, int32_t offset) const;
|
| collationweights.cpp | 37 /* collation element weight allocation -------------------------------------- */
42 getWeightTrail(uint32_t weight, int32_t length) {
43 return (uint32_t)(weight>>(8*(4-length)))&0xff;
47 setWeightTrail(uint32_t weight, int32_t length, uint32_t trail) {
49 return (uint32_t)((weight&(0xffffff00<<length))|(trail<<length));
53 getWeightByte(uint32_t weight, int32_t idx) {
54 return getWeightTrail(weight, idx); /* same calculation */
58 setWeightByte(uint32_t weight, int32_t idx, uint32_t byte) {
78 return (uint32_t)((weight&mask)|(byte<<idx));
82 truncateWeight(uint32_t weight, int32_t length)
261 uint32_t weight=lowerLimit; local
527 uint32_t weight = range.start; local
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/approximation/tests/ |
| test_vertex_cover.py | 18 wg.add_node(0, weight=10)
19 wg.add_node(1, weight=1)
20 wg.add_node(2, weight=1)
21 wg.add_node(3, weight=1)
22 wg.add_node(4, weight=1)
34 cover = a.min_weighted_vertex_cover(wg, weight="weight")
35 csum = sum(wg.node[node]["weight"] for node in cover)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/tests/ |
| test_vitality.py | 15 G.add_cycle([0,1,2],weight=2)
16 v=nx.closeness_vitality(G,weight='weight')
27 G.add_cycle([0,1,2],weight=2)
28 v=nx.closeness_vitality(G,weight='weight')
33 G.add_cycle([0,1,2],weight=2)
34 v=nx.closeness_vitality(G,weight='weight')
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/assortativity/tests/ |
| test_connectivity.py | 29 G[1][2]['weight']=4
31 nd = nx.average_degree_connectivity(G,weight='weight')
39 nd = nx.average_degree_connectivity(D,weight='weight')
44 nd = nx.average_degree_connectivity(D,weight='weight', source='in',
50 weight='weight')
57 nd = nx.average_degree_connectivity(G,weight='other'
[all...] |
| /external/openfst/src/include/fst/ |
| fstlib.h | 22 // input label, an output label, and a weight. The more familiar
32 // (transition) definition, which allows changing the label, weight,
34 // integral types but the weight can be an arbitrary type whose
72 #include <fst/factor-weight.h>
101 #include <fst/weight.h>
102 #include <fst/expectation-weight.h>
103 #include <fst/float-weight.h>
104 #include <fst/lexicographic-weight.h>
105 #include <fst/pair-weight.h>
106 #include <fst/power-weight.h
[all...] |
