color_node         87 libavfilter/vf_paletteuse.c     struct color_node map[AVPALETTE_COUNT]; /* 3D-Tree (KD-Tree with K=3) for reverse colormap */
color_node        215 libavfilter/vf_paletteuse.c static void colormap_nearest_node(const struct color_node *map,
color_node        221 libavfilter/vf_paletteuse.c     const struct color_node *kd = map + node_pos;
color_node        246 libavfilter/vf_paletteuse.c static av_always_inline uint8_t colormap_nearest_recursive(const struct color_node *node, const uint8_t *rgb, const int trans_thresh)
color_node        258 libavfilter/vf_paletteuse.c static av_always_inline uint8_t colormap_nearest_iterative(const struct color_node *root, const uint8_t *target, const int trans_thresh)
color_node        266 libavfilter/vf_paletteuse.c         const struct color_node *kd = &root[cur_color_id];
color_node        504 libavfilter/vf_paletteuse.c                       const struct color_node *map,
color_node        508 libavfilter/vf_paletteuse.c     const struct color_node *node = &map[node_id];
color_node        532 libavfilter/vf_paletteuse.c static int disp_tree(const struct color_node *node, const char *fname)
color_node        557 libavfilter/vf_paletteuse.c static int debug_accuracy(const struct color_node *node, const uint32_t *palette, const int trans_thresh,
color_node        679 libavfilter/vf_paletteuse.c static int colormap_insert(struct color_node *map,
color_node        689 libavfilter/vf_paletteuse.c     struct color_node *node;