Go to the source code of this file.
|
| #define | flg_BadForm 0x00000001 |
| |
| #define | flg_BadMain 0x00000002 |
| |
| #define | MAX(a, b) (((a) > (b))?(a):(b)) |
| |
| #define | MIN(a, b) (((a) < (b))?(a):(b)) |
| |
| #define | tidyAttrToImpl(tattr) ((AttVal*)(tattr)) |
| |
| #define | TidyDocAlloc(doc, size) TidyAlloc((doc)->allocator, size) |
| | Wrappers for easy memory allocation using the document's allocator. More...
|
| |
| #define | TidyDocFree(doc, block) TidyFree((doc)->allocator, block) |
| |
| #define | TidyDocPanic(doc, msg) TidyPanic((doc)->allocator, msg) |
| |
| #define | TidyDocRealloc(doc, block, size) TidyRealloc((doc)->allocator, block, size) |
| |
| #define | tidyDocToImpl(tdoc) ((TidyDocImpl*)(tdoc)) |
| |
| #define | tidyImplToAttr(attval) ((TidyAttr)(attval)) |
| |
| #define | tidyImplToDoc(doc) ((TidyDoc)(doc)) |
| |
| #define | tidyImplToNode(node) ((TidyNode)(node)) |
| |
| #define | tidyImplToOption(option) ((TidyOption)(option)) |
| |
| #define | tidyNodeToImpl(tnod) ((Node*)(tnod)) |
| |
| #define | tidyOptionToImpl(topt) ((const TidyOptionImpl*)(topt)) |
| |
◆ _TidyDocImpl
◆ flg_BadForm
| #define flg_BadForm 0x00000001 |
◆ flg_BadMain
| #define flg_BadMain 0x00000002 |
◆ MAX
| #define MAX |
( |
|
a, |
|
|
|
b |
|
) |
| (((a) > (b))?(a):(b)) |
◆ MIN
| #define MIN |
( |
|
a, |
|
|
|
b |
|
) |
| (((a) < (b))?(a):(b)) |
◆ tidyAttrToImpl
| #define tidyAttrToImpl |
( |
|
tattr | ) |
((AttVal*)(tattr)) |
◆ TidyDocAlloc
| #define TidyDocAlloc |
( |
|
doc, |
|
|
|
size |
|
) |
| TidyAlloc((doc)->allocator, size) |
Wrappers for easy memory allocation using the document's allocator.
◆ TidyDocFree
| #define TidyDocFree |
( |
|
doc, |
|
|
|
block |
|
) |
| TidyFree((doc)->allocator, block) |
◆ TidyDocPanic
| #define TidyDocPanic |
( |
|
doc, |
|
|
|
msg |
|
) |
| TidyPanic((doc)->allocator, msg) |
◆ TidyDocRealloc
| #define TidyDocRealloc |
( |
|
doc, |
|
|
|
block, |
|
|
|
size |
|
) |
| TidyRealloc((doc)->allocator, block, size) |
◆ tidyDocToImpl
| #define tidyDocToImpl |
( |
|
tdoc | ) |
((TidyDocImpl*)(tdoc)) |
◆ tidyImplToAttr
| #define tidyImplToAttr |
( |
|
attval | ) |
((TidyAttr)(attval)) |
◆ tidyImplToDoc
| #define tidyImplToDoc |
( |
|
doc | ) |
((TidyDoc)(doc)) |
◆ tidyImplToNode
| #define tidyImplToNode |
( |
|
node | ) |
((TidyNode)(node)) |
◆ tidyImplToOption
| #define tidyImplToOption |
( |
|
option | ) |
((TidyOption)(option)) |
◆ tidyNodeToImpl
| #define tidyNodeToImpl |
( |
|
tnod | ) |
((Node*)(tnod)) |
◆ tidyOptionToImpl
| #define tidyOptionToImpl |
( |
|
topt | ) |
((const TidyOptionImpl*)(topt)) |
◆ NodeTraversalCallBack
| typedef NodeTraversalSignal NodeTraversalCallBack(TidyDocImpl *doc, Node *node, void *propagate) |
◆ NodeTraversalSignal
| Enumerator |
|---|
| ContinueTraversal | |
| SkipChildren | |
| SkipSiblings | |
| SkipChildrenAndSiblings | |
| VisitParent | |
| ExitTraversal | |
◆ TY_❪DocParseStream❫()
| int TY_❪DocParseStream❫ |
( |
TidyDocImpl * |
impl, |
|
|
StreamIn * |
in |
|
) |
| |
◆ TY_❪TraverseNodeTree❫()