函数逻辑报告 |
Source Code:lib\xz\xz_lzma2.h |
Create Date:2022-07-27 07:14:33 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：Indicate that the latest state was a long repeated match.
函数原型：static inline void lzma_state_long_rep(enum lzma_state *state)
返回类型：void
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| enum lzma_state * | state |
| 83 | state等于如果state小于The lowest 7 states indicate that the previous state was a literal. 则STATE_LIT_LONGREP否则STATE_NONLIT_REP |
| 名称 | 描述 |
|---|---|
| lzma_rep_match | Decode a repeated match. The distance is one of the four most recently* seen matches. The distance will be stored in s->lzma.rep0. |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |