函数逻辑报告 |
Source Code:lib\zstd\fse_compress.c |
Create Date:2022-07-27 07:59:30 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称: : count of most numerous element
函数原型:size_t FSE_count_simple(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize)
返回类型:size_t
参数:
类型 | 参数 | 名称 |
---|---|---|
unsigned * | count | |
unsigned * | maxSymbolValuePtr | |
const void * | src | |
size_t | srcSize |
329 | max等于0 |
331 | memset(count, 0, (maxSymbolValue + 1) * count的长度) |
332 | 如果srcSize恒等于0则 |
333 | maxSymbolValuePtr等于0 |
334 | 返回:0 |
340 | 当非count[maxSymbolValue]循环 |
341 | maxSymbolValue自减 |
351 | 返回:max |
名称 | 描述 |
---|---|
FSE_countFast_wksp | FSE_countFast_wksp() :* Same as FSE_countFast(), but using an externally provided scratch buffer.* `workSpace` size must be table of >= `1024` unsigned |
HUF_compressWeights_wksp |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |
摘要:! FSE_count_simpleThis function counts byte values within `src`, and store the histogram into table `count`.It doesn't use any additional memory.But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.For this reason, prefer using a table `count` with 256 elements.