Home
last modified time | relevance | path

Searched refs:spatial (Results 1 – 25 of 106) sorted by relevance

12345

/third_party/ffmpeg/libavfilter/x86/
Dvf_hqdn3d_init.c29 uint16_t *frame_ant, ptrdiff_t w, int16_t *spatial,
32 uint16_t *frame_ant, ptrdiff_t w, int16_t *spatial,
35 uint16_t *frame_ant, ptrdiff_t w, int16_t *spatial,
38 uint16_t *frame_ant, ptrdiff_t w, int16_t *spatial,
Dvf_hqdn3d.asm48 cglobal hqdn3d_row_%1_x86, 7,10,0, src, dst, lineant, frameant, width, spatial, temporal, pixelant,…
50 cglobal hqdn3d_row_%1_x86, 7,7,0, src, dst, lineant, frameant, width, spatial, temporal
81 LOWPASS t1, pixelant, spatial
83 LOWPASS pixelant, t0, spatial
/third_party/ffmpeg/libavfilter/
Dvf_hqdn3d.c84 int16_t *spatial, int16_t *temporal, int depth) in denoise_spatial() argument
90 spatial += 256 << LUT_BITS; in denoise_spatial()
97 line_ant[x] = tmp = pixel_ant = lowpass(pixel_ant, LOAD(x), spatial, depth); in denoise_spatial()
107 s->denoise_row[depth](src, dst, line_ant, frame_ant, w, spatial, temporal); in denoise_spatial()
112 line_ant[x] = tmp = lowpass(line_ant[x], pixel_ant, spatial, depth); in denoise_spatial()
113 pixel_ant = lowpass(pixel_ant, LOAD(x+1), spatial, depth); in denoise_spatial()
117 line_ant[x] = tmp = lowpass(line_ant[x], pixel_ant, spatial, depth); in denoise_spatial()
128 int16_t *spatial, int16_t *temporal, int depth) in denoise_depth() argument
146 if (spatial[0]) in denoise_depth()
148 w, h, sstride, dstride, spatial, temporal, depth); in denoise_depth()
Dvf_hqdn3d.h39 …8_t *dst, uint16_t *line_ant, uint16_t *frame_ant, ptrdiff_t w, int16_t *spatial, int16_t *tempora…
/third_party/boost/libs/geometry/doc/index/
Dintroduction.qbk13 The __boost_geometry_index__ is intended to gather data structures called spatial
15 spatial indexes stores geometric objects' representations and allows searching for
18 Currently, only one spatial index is implemented - __rtree__.
22 __rtree__ is a tree data structure used for spatial searching. It was proposed by
25 perform a spatial query. This query may for example return objects that are inside some area or are…
36 [footnote Greene, D. (1989). /An implementation and performance analysis of spatial data access met…
55 [[*100k spatial queries*] [2.21s] [0.51s] [0.12s] [0.07s]]
97 * 'reversed' spatial predicates or additional spatial predicates like contains(),
119 The spatial index was originally started by Federico J. Fernandez during the Google Summer of Code …
/third_party/boost/libs/geometry/doc/index/src/examples/rtree/
Dquick_start_results.qbk11 spatial query box:
13 spatial query result:
Dpolygons_vector_results.qbk22 spatial query box:
24 spatial query result:
Dvariants_map_results.qbk22 spatial query box:
24 spatial query result:
Dvalue_index_results.qbk22 spatial query box:
24 spatial query result:
Dvalue_shared_ptr_results.qbk22 spatial query box:
24 spatial query result:
Dpolygons_shared_ptr_results.qbk22 spatial query box:
24 spatial query result:
/third_party/boost/libs/geometry/doc/index/rtree/
Dintroduction.qbk13 __rtree__ is a tree data structure used for spatial searching. It was proposed by
16 perform a spatial query later. This query may return objects that are inside some area or are close…
26 [footnote Greene, D. (1989). /An implementation and performance analysis of spatial data access met…
39 [[*100k spatial queries*] [0.87s] [0.25s] [0.09s]]
60 The spatial index was originally started by Federico J. Fernandez during the Google Summer of Code …
Dquickstart.qbk14 spatial query.
40 There are various types of spatial queries that may be performed, they can be even combined together
/third_party/boost/libs/geometry/doc/index/generated/
Dinserters.qbk16 Returns insert iterator capable to insert values to the container (spatial index) which has member …
25 [[`Container &`][ `c` ][The reference to the container (spatial index) to which values will be inse…
Drtree_functions.qbk44 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
71 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
97 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
123 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
154 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
184 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
197 This query function performs spatial and k-nearest neighbor searches. It allows to pass a set of pr…
212 It is possible to negate spatial predicates:
454 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &`][ `tree` ][The spatial index.…
477 [[`rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &`][ `tree` ][The spatial
[all …]
/third_party/openh264/codec/build/windowsphone/all/CodecApp/
Dwelsenc.cfg57 # It shall always be on in SVC contexts (i.e. when there are CGS/MGS/spatial enhancement layers)
58 # Can be disabled when no inter spatial layer prediction in case of its value as 0
/third_party/boost/libs/geometry/doc/generated/
Dbuffer.qbk22 The free function buffer calculates the buffer (a polygon being the spatial point set collection wi…
61 The free function buffer calculates the buffer (a polygon being the spatial point set collection wi…
105 The free function return\u005fbuffer calculates the buffer (a polygon being the spatial point set c…
Dsym_difference.qbk22 The free function symmetric difference calculates the spatial set theoretic symmetric difference (X…
61 The free function symmetric difference calculates the spatial set theoretic symmetric difference (X…
Ddifference.qbk24 The free function difference calculates the spatial set theoretic difference of two geometries.
65 The free function difference calculates the spatial set theoretic difference of two geometries.
Dunion.qbk22 The free function union calculates the spatial set theoretic union of two geometries.
61 The free function union calculates the spatial set theoretic union of two geometries.
/third_party/openh264/testbin/
Dwelsenc_vd_1d.cfg65 … # It shall always be on in SVC contexts (i.e. when there are CGS/MGS/spatial enhancement layers)
66 … # Can be disabled when no inter spatial layer prediction in case of its value as 0
Dwelsenc_arbitrary_res.cfg65 … # It shall always be on in SVC contexts (i.e. when there are CGS/MGS/spatial enhancement layers)
66 … # Can be disabled when no inter spatial layer prediction in case of its value as 0
Dwelsenc_vd_rc.cfg64 … # It shall always be on in SVC contexts (i.e. when there are CGS/MGS/spatial enhancement layers)
65 … # Can be disabled when no inter spatial layer prediction in case of its value as 0
Dwelsenc_ios.cfg66 … # It shall always be on in SVC contexts (i.e. when there are CGS/MGS/spatial enhancement layers)
67 … # Can be disabled when no inter spatial layer prediction in case of its value as 0
/third_party/mindspore/mindspore/lite/src/runtime/kernel/arm/fp16_grad/
Dbn_fp16_grad.cc100 int32_t spatial = input_x->Height() * input_x->Width(); in DoExecute() local
112 int total = spatial * batch; in DoExecute()

12345