📄 bintree.h
字号:
/* * bintree.h * * Written by: Ullrich Hafner * * This file is part of FIASCO (獸籸actal 獻籱age 獳籲d 玈籩quence 獵O籨ec) * Copyright (C) 1994-2000 Ullrich Hafner <hafner@bigfoot.de> *//* * $Date: 2000/06/14 20:50:51 $ * $Author: hafner $ * $Revision: 5.1 $ * $State: Exp $ */#ifndef _BINTREE_H#define _BINTREE_H#include "wfa.h"#include "types.h"typedef struct tree/* * Used for estimating the number of bits needed for storing the * tree array. For each level a different context is used. * The binary alphabet consists of the two symbols NO_RANGE and RANGE, * which indicate whether there exists a tree edge or not. */{ unsigned counts [MAXLEVEL]; /* # NO_RANGE symbols at given level */ unsigned total [MAXLEVEL]; /* total number of symbols at '' */} tree_t;real_ttree_bits (bool_t child, unsigned level, const tree_t *model);voidinit_tree_model (tree_t *tree_model);voidtree_update (bool_t child, unsigned level, tree_t *model);#endif /* not _BINTREE_H */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -