/AliOS-Things-master/components/SDL2/src/image/external/libwebp-1.0.2/src/utils/ |
A D | huffman_encode_utils.c | 138 if (tree->pool_index_left_ >= 0) { in SetBitDepths() 142 bit_depths[tree->value_] = level; in SetBitDepths() 184 tree_pool = tree + tree_size_orig; in GenerateOptimalTree() 201 tree[idx].total_count_ = count; in GenerateOptimalTree() 202 tree[idx].value_ = j; in GenerateOptimalTree() 210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees); in GenerateOptimalTree() 229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree)); in GenerateOptimalTree() 231 tree[k].value_ = -1; in GenerateOptimalTree() 240 bit_depths[tree[0].value_] = 1; in GenerateOptimalTree() 381 assert(tree != NULL); in ConvertBitDepthsToSymbols() [all …]
|
A D | huffman_encode_utils.h | 46 int VP8LCreateCompressedHuffmanTree(const HuffmanTreeCode* const tree, 54 HuffmanTreeCode* const tree);
|
/AliOS-Things-master/components/SDL2/src/image/external/zlib-1.2.11/ |
A D | trees.c | 161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 167 send_bits(s, tree[c].Code, tree[c].Len); } 442 (tree[n].Freq < tree[m].Freq || \ 443 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) 512 bits = tree[tree[n].Dad].Len + 1; 522 f = tree[n].Freq; 556 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq; 637 tree[n].Len = 0; 672 tree[node].Freq = tree[n].Freq + tree[m].Freq; 675 tree[n].Dad = tree[m].Dad = (ush)node; [all …]
|
/AliOS-Things-master/components/py_engine/external/unzip/src/ |
A D | trees.c | 168 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 174 send_bits(s, tree[c].Code, tree[c].Len); } 450 (tree[n].Freq < tree[m].Freq || \ 451 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) 520 bits = tree[tree[n].Dad].Len + 1; 530 f = tree[n].Freq; 645 tree[n].Len = 0; 656 tree[node].Freq = 1; 680 tree[node].Freq = tree[n].Freq + tree[m].Freq; 683 tree[n].Dad = tree[m].Dad = (ush)node; [all …]
|
/AliOS-Things-master/components/SDL2/src/image/external/tiff-4.0.9/ |
A D | HOWTO-RELEASE | 60 8. In the source tree do 69 tree so that the source tree is kept in a pristine state. This 81 10. In the build tree do 86 in the source tree. 88 11. In the source tree, verify that the version info in RELEASE-DATE, 91 12. In the build tree do 102 13. In the source tree do 106 14. In the source tree do 112 15. Copy release packages from the build tree to the
|
/AliOS-Things-master/components/SDL2/src/image/external/libpng-1.6.37/scripts/ |
A D | options.awk | 550 for (opt in enabledby) tree[opt] = 1 # may not be explicit options 558 tree[opt] = "" # so unlisted options marked 560 for (opt in tree) if (opt != "") { 561 if (tree[opt] == 1) { 562 tree[opt] = "" 577 for (i in list) tree[opt] = tree[opt] " " i 581 if (deb > 2) for (i in tree) if (i != "") print i, "depends-on" tree[i] 639 nreqs = split(tree[i], r) 795 print " option", i, "depends on" tree[i], "needs:" 796 nreqs = split(tree[i], r)
|
/AliOS-Things-master/components/freetype/src/gzip/ |
A D | infcodes.c | 39 inflate_huft *tree; /* pointer into tree */ member 118 c->sub.code.tree = c->ltree; in inflate_codes() 123 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); in inflate_codes() 145 c->sub.code.tree = t + t->base; in inflate_codes() 164 c->sub.code.tree = c->dtree; in inflate_codes() 170 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); in inflate_codes() 183 c->sub.code.tree = t + t->base; in inflate_codes()
|
/AliOS-Things-master/components/SDL2/src/video/cocoa/ |
A D | SDL_cocoashape.m | 65 ConvertRects(SDL_ShapeTree* tree, void* closure) 68 if(tree->kind == OpaqueShape) { 69 …NSRect rect = NSMakeRect(tree->data.shape.x,data->window->h - tree->data.shape.y,tree->data.shape.…
|
/AliOS-Things-master/components/SDL2/src/video/ |
A D | SDL_shape.c | 232 SDL_TraverseShapeTree(SDL_ShapeTree *tree,SDL_TraversalFunction function,void* closure) in SDL_TraverseShapeTree() argument 234 SDL_assert(tree != NULL); in SDL_TraverseShapeTree() 235 if(tree->kind == QuadShape) { in SDL_TraverseShapeTree() 236 SDL_TraverseShapeTree((SDL_ShapeTree *)tree->data.children.upleft,function,closure); in SDL_TraverseShapeTree() 237 SDL_TraverseShapeTree((SDL_ShapeTree *)tree->data.children.upright,function,closure); in SDL_TraverseShapeTree() 238 SDL_TraverseShapeTree((SDL_ShapeTree *)tree->data.children.downleft,function,closure); in SDL_TraverseShapeTree() 239 SDL_TraverseShapeTree((SDL_ShapeTree *)tree->data.children.downright,function,closure); in SDL_TraverseShapeTree() 242 function(tree,closure); in SDL_TraverseShapeTree()
|
/AliOS-Things-master/components/SDL2/src/image/external/libpng-1.6.37/projects/visualc71/ |
A D | README_zlib.txt | 24 binaries set "zlib" as the startup project (Select "zlib" tree view item + 26 binaries set it to "example" (Select "example" tree view item + Project | 28 "minigzip" (Select "minigzip" tree view item + Project | Set as StartUp
|
/AliOS-Things-master/components/SDL2/build-scripts/ |
A D | windows-buildbot-zipper.bat | 4 rem must be run from root of SDL source tree. 7 echo Please run from root of source tree after doing a Release build.
|
/AliOS-Things-master/components/SDL2/docs/ |
A D | README-hg.md | 6 as a developer works on a source tree, you can use "hg" to mirror that 7 source tree instead of waiting for an official release. Please look
|
/AliOS-Things-master/components/littlefs/ |
A D | README.md | 17 ```tree 87 在littlefs组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/littlefs/tree/master/exampl…
|
/AliOS-Things-master/components/libc_stub/ |
A D | README.md | 19 ```tree 80 在libc_stub组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/libc_stub/tree/master/exam…
|
/AliOS-Things-master/components/SDL2/src/image/external/zlib-1.2.11/doc/ |
A D | algorithm.txt | 13 Literals or match lengths are compressed with one Huffman tree, and 14 match distances are compressed with another tree. The trees are stored 83 For inflate, which has 286 possible codes for the literal/length tree, the size 94 Ok, you want to know what this cleverly obfuscated inflate tree actually 95 looks like. You are correct that it's not a Huffman tree. It is simply a 124 that's essentially a Huffman tree. But then you spend too much time 125 traversing the tree while decoding, even for short symbols. 183 compared to 16 entries for a Huffman tree (six two entry tables and one four 187 Huffman tree.
|
/AliOS-Things-master/components/cplusplus/ |
A D | README.md | 31 ```tree 82 标准C++使用示例参考**[example/cpp_standard](https://gitee.com/alios-things/cplusplus/tree/master/example/cp… 114 > cplusplus组件的package.yaml中[example示例代码](https://gitee.com/alios-things/cplusplus/tree/master/examp…
|
/AliOS-Things-master/components/epoll/ |
A D | README.md | 17 ```tree 93 在epoll组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/epoll/tree/master/example):
|
/AliOS-Things-master/components/sntp/ |
A D | README.md | 15 ```tree 118 > sntp组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/sntp/tree/master/example):
|
/AliOS-Things-master/components/SDL2/src/image/external/zlib-1.2.11/contrib/testzlib/ |
A D | testzlib.txt | 4 - root of zLib tree
|
/AliOS-Things-master/components/jsoncpp/include/ |
A D | PreventInBuildInstalls.cmake | 5 "The current CMAKE_INSTALL_PREFIX points at the build tree:\n"
|
/AliOS-Things-master/components/SDL2/test/ |
A D | COPYING | 2 The test programs in this directory tree are for demonstrating and
|
/AliOS-Things-master/components/jsoncpp/ |
A D | README.md | 22 ```tree 112 在jsoncpp组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/jsoncpp/tree/master/example):
|
/AliOS-Things-master/components/drivers/peripheral/flash/ |
A D | README.md | 31 ```tree 99 在flash组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/flash/tree/master/example):
|
/AliOS-Things-master/components/ulog/ |
A D | README.md | 19 ```tree 105 > ulog组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/ulog/tree/master/example):
|
/AliOS-Things-master/components/mbmaster/ |
A D | README.md | 29 ```tree 123 在mbmaster组件的package.yaml中添加[example示例代码](https://gitee.com/alios-things/mbmaster/tree/master/exampl…
|