Home
last modified time | relevance | path

Searched refs:bounds0 (Results 1 – 25 of 74) sorted by relevance

123

/dports/graphics/embree/embree-3.13.2/common/math/
H A Dlbbox.h28 : bounds0(other.bounds0), bounds1(other.bounds1) {} in LBBox()
31 bounds0 = other.bounds0; bounds1 = other.bounds1; return *this;
41 : bounds0(bounds0), bounds1(bounds1) { } in LBBox()
56 bounds0 = b0; in LBBox()
96 bounds0 = b0; in LBBox()
146 bounds0 = b0; in LBBox()
162 bounds0 = b0; in LBBox()
178 bounds0 = b0; in LBBox()
201 bounds0.extend(other.bounds0); in extend()
275 return LBBox<T>(merge(a.bounds0, b.bounds0), merge(a.bounds1, b.bounds1)); in merge()
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/go.opentelemetry.io/collector/receiver/prometheusreceiver/internal/
H A Dmetrics_adjuster_test.go180 …mtu.GaugeDist(gd1, k1k2, mtu.Timeseries(t1Ms, v1v2, mtu.DistPt(t1Ms, bounds0, []int64{4, 2, 3, 7})…
187 …mtu.GaugeDist(gd1, k1k2, mtu.Timeseries(t1Ms, v1v2, mtu.DistPt(t1Ms, bounds0, []int64{4, 2, 3, 7})…
308 …ries(t1Ms, v1v2, mtu.DistPt(t1Ms, bounds0, []int64{4, 2, 3, 7})), mtu.Timeseries(t1Ms, v10v20, mtu…
312 …ries(t1Ms, v1v2, mtu.DistPt(t1Ms, bounds0, []int64{4, 2, 3, 7})), mtu.Timeseries(t1Ms, v10v20, mtu…
334 …ies(t3Ms, v1v2, mtu.DistPt(t3Ms, bounds0, []int64{9, 8, 10, 15})), mtu.Timeseries(t3Ms, v10v20, mt…
338 …ies(t1Ms, v1v2, mtu.DistPt(t3Ms, bounds0, []int64{9, 8, 10, 15})), mtu.Timeseries(t3Ms, v10v20, mt…
362 …ries(t1Ms, v1v2, mtu.DistPt(t1Ms, bounds0, []int64{4, 2, 3, 7})), mtu.Timeseries(t1Ms, v10v20, mtu…
366 …ries(t1Ms, v1v2, mtu.DistPt(t1Ms, bounds0, []int64{4, 2, 3, 7})), mtu.Timeseries(t1Ms, v10v20, mtu…
382 …ies(t4Ms, v1v2, mtu.DistPt(t4Ms, bounds0, []int64{9, 8, 10, 15})), mtu.Timeseries(t4Ms, v10v20, mt…
386 …ies(t4Ms, v1v2, mtu.DistPt(t4Ms, bounds0, []int64{9, 8, 10, 15})), mtu.Timeseries(t4Ms, v10v20, mt…
[all …]
/dports/graphics/embree/embree-3.13.2/kernels/common/
H A Dprimref_mb.h25 lbounds.bounds0.lower.a = geomID; in PrimRefMB()
26 lbounds.bounds0.upper.a = primID; in PrimRefMB()
36 lbounds.bounds0.lower.a = id & 0xFFFFFFFF; in PrimRefMB()
39 lbounds.bounds0.lower.a = id; in PrimRefMB()
40 lbounds.bounds0.upper.a = 0; in PrimRefMB()
54 lbounds.bounds0.lower.u = id; in PrimRefMB()
55 lbounds.bounds0.upper.u = 0; in PrimRefMB()
108 return lbounds.bounds0.lower.a; in geomID()
113 return lbounds.bounds0.upper.a; in primID()
119 return size_t(lbounds.bounds0.lower.u) + (size_t(lbounds.bounds0.upper.u) << 32); in ID()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
H A Drequired-invariant-loop-bounds.ll7 ; CHECK-NEXT: Execution Context: [bounds0, bounds1] -> { : }
10 ; CHECK-NEXT: Execution Context: [bounds0, bounds1] -> { : }
34 …%bounds0 = load i64, i64* getelementptr inbounds ([2 x i64], [2 x i64]* @bounds, i64 0, i64 0), al…
35 %cmp = icmp sgt i64 %i.0, %bounds0
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
H A Drequired-invariant-loop-bounds.ll7 ; CHECK-NEXT: Execution Context: [bounds0, bounds1] -> { : }
10 ; CHECK-NEXT: Execution Context: [bounds0, bounds1] -> { : }
34 …%bounds0 = load i64, i64* getelementptr inbounds ([2 x i64], [2 x i64]* @bounds, i64 0, i64 0), al…
35 %cmp = icmp sgt i64 %i.0, %bounds0
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
H A Drequired-invariant-loop-bounds.ll7 ; CHECK-NEXT: Execution Context: [bounds0, bounds1] -> { : }
10 ; CHECK-NEXT: Execution Context: [bounds0, bounds1] -> { : }
34 …%bounds0 = load i64, i64* getelementptr inbounds ([2 x i64], [2 x i64]* @bounds, i64 0, i64 0), al…
35 %cmp = icmp sgt i64 %i.0, %bounds0
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/polly/test/ScopInfo/
H A Dinvariant_loop_bounds.ll5 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond[i0] -> MemRef_bounds[2] };
6 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
8 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_1[i0, i1] -> MemRef_bounds…
9 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
11 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bo…
12 ; CHECK-NEXT: Execution Context: [bounds2, bounds1, bounds0] -> { : }
17 ; CHECK-NEXT: p2: %bounds0
22 … [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] : 0 <= i0 < bounds2 and 0 <= i1 …
24 ; CHECK-NEXT: [bounds2, bounds1, bounds0] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, …
73 …%bounds0 = load i32, i32* getelementptr inbounds ([3 x i32], [3 x i32]* @bounds, i64 0, i64 0), al…
[all …]
/dports/graphics/embree/embree-3.13.2/kernels/bvh/
H A Dbvh_node_aabb_mb.h87 bounds0 = bounds0.enlarge_by(4.0f*float(ulp)); in setBounds()
89 Vec3fa dlower = bounds1.lower-bounds0.lower; in setBounds()
90 Vec3fa dupper = bounds1.upper-bounds0.upper; in setBounds()
92 lower_x[i] = bounds0.lower.x; lower_y[i] = bounds0.lower.y; lower_z[i] = bounds0.lower.z; in setBounds()
93 upper_x[i] = bounds0.upper.x; upper_y[i] = bounds0.upper.y; upper_z[i] = bounds0.upper.z; in setBounds()
101 setBounds(i, bounds.bounds0, bounds.bounds1); in setBounds()
124 __forceinline BBox3fa bounds0(size_t i) const { in bounds0() function
147 return merge(bounds0(i),bounds1(i)); in bounds()
152 return LBBox3fa(bounds0(i),bounds1(i)); in lbounds()
157 return lerp(bounds0(i),bounds1(i),time); in bounds()
[all …]
H A Dbvh_collider.h25 CollideJob (NodeRef ref0, const BBox3fa& bounds0, size_t depth0, in CollideJob()
27 … : ref0(ref0), bounds0(bounds0), depth0(depth0), ref1(ref1), bounds1(bounds1), depth1(depth1) {} in CollideJob()
30 BBox3fa bounds0; member
47 …void collide_recurse(NodeRef node0, const BBox3fa& bounds0, NodeRef node1, const BBox3fa& bounds1,…
48 …void collide_recurse_entry(NodeRef node0, const BBox3fa& bounds0, NodeRef node1, const BBox3fa& bo…
H A Dbvh_collider.cpp151 if (area(bounds0) > area(bounds1)) { in collide_recurse()
190 size_t mask = overlap<N>(bounds0,*node1); in collide_recurse()
199 collide_recurse(ref0,bounds0,node1->child(i),node1->bounds(i),depth0,depth1+1); in collide_recurse()
208 collide_recurse(ref0,bounds0,node1->child(i),node1->bounds(i),depth0,depth1+1); in collide_recurse()
227 if (area(job.bounds0) > area(job.bounds1)) { in split()
249 size_t mask = overlap<N>(job.bounds0,*node1); in split()
251 …jobs.push_back(CollideJob(job.ref0,job.bounds0,job.depth0,node1->child(i),node1->bounds(i),job.dep… in split()
258 …void BVHNCollider<N>::collide_recurse_entry(NodeRef ref0, const BBox3fa& bounds0, NodeRef ref1, co… in collide_recurse_entry() argument
270 collide_recurse(ref0,bounds0,ref1,bounds1,0,0); in collide_recurse_entry()
276 jobs[0].push_back(CollideJob(ref0,bounds0,0,ref1,bounds1,0)); in collide_recurse_entry()
[all …]
/dports/graphics/embree/embree-3.13.2/kernels/geometry/
H A DcurveNi_mb.h86 bounds_vx_lower0(N)[i] = (short) clamp(floor(bounds.bounds0.lower.x),-32767.0f,32767.0f); in fillMB()
87 bounds_vx_upper0(N)[i] = (short) clamp(ceil (bounds.bounds0.upper.x),-32767.0f,32767.0f); in fillMB()
90 … assert(-32767.0f <= floor(bounds.bounds0.lower.x) && floor(bounds.bounds0.lower.x) <= 32767.0f); in fillMB()
91 … assert(-32767.0f <= ceil (bounds.bounds0.upper.x) && ceil (bounds.bounds0.upper.x) <= 32767.0f); in fillMB()
98 bounds_vy_lower0(N)[i] = (short) clamp(floor(bounds.bounds0.lower.y),-32767.0f,32767.0f); in fillMB()
99 bounds_vy_upper0(N)[i] = (short) clamp(ceil (bounds.bounds0.upper.y),-32767.0f,32767.0f); in fillMB()
102 … assert(-32767.0f <= floor(bounds.bounds0.lower.y) && floor(bounds.bounds0.lower.y) <= 32767.0f); in fillMB()
103 … assert(-32767.0f <= ceil (bounds.bounds0.upper.y) && ceil (bounds.bounds0.upper.y) <= 32767.0f); in fillMB()
110 bounds_vz_lower0(N)[i] = (short) clamp(floor(bounds.bounds0.lower.z),-32767.0f,32767.0f); in fillMB()
114 … assert(-32767.0f <= floor(bounds.bounds0.lower.z) && floor(bounds.bounds0.lower.z) <= 32767.0f); in fillMB()
[all …]
/dports/graphics/blender/blender-2.91.0/intern/cycles/bvh/
H A Dbvh_binning.cpp119 BoundBox bounds0 = get_prim_bounds(prim0); in BVHObjectBinning() local
122 int4 bin0 = get_bin(bounds0); in BVHObjectBinning()
128 bin_bounds[b00][0].grow(bounds0); in BVHObjectBinning()
131 bin_bounds[b01][1].grow(bounds0); in BVHObjectBinning()
134 bin_bounds[b02][2].grow(bounds0); in BVHObjectBinning()
152 BoundBox bounds0 = get_prim_bounds(prim0); in BVHObjectBinning() local
153 int4 bin0 = get_bin(bounds0); in BVHObjectBinning()
158 bin_bounds[b00][0].grow(bounds0); in BVHObjectBinning()
161 bin_bounds[b01][1].grow(bounds0); in BVHObjectBinning()
164 bin_bounds[b02][2].grow(bounds0); in BVHObjectBinning()
/dports/lang/ghc/ghc-8.10.7/libraries/Cabal/cabal-install/Distribution/Solver/Modular/
H A DLabeledGraph.hs50 bounds0 = (0, max_v) :: (Vertex, Vertex) function
54 graph = array bounds0 [(v, (mapMaybe mk_edge ks))
56 key_map = array bounds0 [(v, k )
58 vertex_map = array bounds0 edges1
91 buildG bounds0 edges0 = accumArray (flip (:)) [] bounds0 (map reassoc edges0) function
/dports/devel/hs-cabal-install/cabal-cabal-install-3.4.0.0/cabal-install/Distribution/Solver/Modular/
H A DLabeledGraph.hs51 bounds0 = (0, max_v) :: (Vertex, Vertex) function
55 graph = array bounds0 [(v, (mapMaybe mk_edge ks))
57 key_map = array bounds0 [(v, k )
59 vertex_map = array bounds0 edges1
92 buildG bounds0 edges0 = accumArray (flip (:)) [] bounds0 (map reassoc edges0) function
/dports/net-mgmt/thanos/thanos-0.11.0/vendor/golang.org/x/exp/shiny/iconvg/
H A Ddecode_test.go81 bounds0 := m0.Bounds()
83 if bounds0 != bounds1 {
84 return fmt.Errorf("bounds differ: got %v, want %v", bounds0, bounds1)
86 for y := bounds0.Min.Y; y < bounds0.Max.Y; y++ {
87 for x := bounds0.Min.X; x < bounds0.Max.X; x++ {
/dports/graphics/embree/embree-3.13.2/kernels/builders/
H A Dheuristic_timesplit_array.h40 bounds0[i] = bounds1[i] = empty; in TemporalBinInfo()
63 bounds0[b].extend(bn0); in bin()
65 bounds0[b].extend(bn0.interpolate(0.5f)); in bin()
105 bounds0[i].extend(other.bounds0[i]); in merge()
131 float sah0 = expectedApproxHalfArea(bounds0[b])*float(lCount)*dt0.size(); in best()
147 BBox bounds0[BINS-1]; member
/dports/www/grafana8/grafana-8.3.6/vendor/golang.org/x/exp/shiny/iconvg/
H A Ddecode_test.go84 bounds0 := m0.Bounds()
86 if bounds0 != bounds1 {
87 return fmt.Errorf("bounds differ: got %v, want %v", bounds0, bounds1)
89 for y := bounds0.Min.Y; y < bounds0.Max.Y; y++ {
90 for x := bounds0.Min.X; x < bounds0.Max.X; x++ {

123