HTML Tidy  5.7.28
The HTACG Tidy HTML Project
access.h
Go to the documentation of this file.
1 #ifndef __ACCESS_H__
2 #define __ACCESS_H__
3 
4 /*********************************************************************
5  * carry out accessibility checks
6  *
7  * This module carries out processes for all accessibility checks. It
8  * traverses through all the content within the tree and evaluates the
9  * tags for accessibility.
10  *
11  * To perform the following checks, 'AccessibilityChecks' must be
12  * called AFTER the tree structure has been formed.
13  *
14  * If, in the command prompt or configuration file, there is no
15  * specification of which accessibility priorities to check, then no
16  * accessibility checks will be performed.
17  *
18  * The accessibility checks to perform depending on user's desire:
19  * 1. priority 1
20  * 2. priority 1 & 2
21  * 3. priority 1, 2, & 3
22  *
23  * Reference document: http://www.w3.org/TR/WAI-WEBCONTENT/
24  *
25  * Copyright University of Toronto
26  * Portions (c) 1998-2006 (W3C) MIT, ERCIM, Keio University
27  * See `tidy.h` for the copyright notice.
28  * Programmed by: Mike Lam and Chris Ridpath
29  * Modifications by: Terry Teague (TRT)
30  * Further modifications: consult git log.
31  *********************************************************************/
32 
33 #include "forward.h"
34 
35 
36 enum {
37  TEXTBUF_SIZE=128u
38 };
39 
40 struct _TidyAccessImpl;
41 typedef struct _TidyAccessImpl TidyAccessImpl;
42 
44 {
45  /* gets set from Tidy variable AccessibilityCheckLevel */
46  int PRIORITYCHK; /**< */
47 
48  /* Number of characters that are found within the concatenated text */
49  int counter;
50 
51  /* list of characters in the text nodes found within a container element */
53 
54  /* The list of characters found within one text node */
56 
57  /* Number of frame elements found within a frameset */
58  int numFrames;
59 
60  /* Number of 'longdesc' attributes found within a frameset */
62 
66 
67  /* For 'USEMAP' identifier */
71 
72  /* For tracking nodes that are deleted from the original parse tree - TRT */
73  /* Node *access_tree; */
74 
82  int ForID;
83 
84 };
85 
86 
87 void TY_(AccessibilityChecks)( TidyDocImpl* doc );
88 
89 
90 #endif /* __ACCESS_H__ */
_TidyAccessImpl::HasMap
Bool HasMap
Definition: access.h:70
forward.h
tmbchar
char tmbchar
Definition: tidyplatform.h:606
_TidyAccessImpl::textNode
tmbchar textNode[TEXTBUF_SIZE]
Definition: access.h:52
_TidyAccessImpl::PRIORITYCHK
int PRIORITYCHK
Definition: access.h:46
_TidyAccessImpl::HasValidFor
Bool HasValidFor
Definition: access.h:76
_TidyAccessImpl::counter
int counter
Definition: access.h:49
_TidyAccessImpl::HasTH
Bool HasTH
Definition: access.h:75
_TidyAccessImpl::CheckedHeaders
int CheckedHeaders
Definition: access.h:63
_TidyAccessImpl::HasInvalidColumnHeader
Bool HasInvalidColumnHeader
Definition: access.h:81
_TidyAccessImpl::HasName
Bool HasName
Definition: access.h:69
_TidyAccessImpl::ForID
int ForID
Definition: access.h:82
TEXTBUF_SIZE
@ TEXTBUF_SIZE
Definition: access.h:64
_TidyAccessImpl
Definition: access.h:44
_TidyAccessImpl::OtherListElements
int OtherListElements
Definition: access.h:65
_TidyAccessImpl::HasUseMap
Bool HasUseMap
Definition: access.h:68
_TidyAccessImpl::text
tmbchar text[TEXTBUF_SIZE]
Definition: access.h:55
_TidyAccessImpl::ListElements
int ListElements
Definition: access.h:64
_TidyAccessImpl::HasValidId
Bool HasValidId
Definition: access.h:77
_TidyAccessImpl::HasValidColumnHeaders
Bool HasValidColumnHeaders
Definition: access.h:79
Bool
Bool
Definition: tidyplatform.h:647
_TidyAccessImpl::HasCheckedLongDesc
int HasCheckedLongDesc
Definition: access.h:61
_TidyAccessImpl::HasInvalidRowHeader
Bool HasInvalidRowHeader
Definition: access.h:80
TY_
#define TY_(str)
Definition: forward.h:23
_TidyAccessImpl::numFrames
int numFrames
Definition: access.h:58
_TidyAccessImpl::HasValidRowHeaders
Bool HasValidRowHeaders
Definition: access.h:78