GBFPlain Class Reference

#include <gbfplain.h>

Inheritance diagram for GBFPlain:

Collaboration diagram for GBFPlain:

Public Member Functions
	GBFPlain ()
virtual const char *	getHeader () const
virtual char	processText (SWBuf &text, const SWKey *key=0, const SWModule *module=0)

Detailed Description

This filter converts GBF text to plain text

Definition at line 32 of file gbfplain.h.

Constructor & Destructor Documentation

SWORD_NAMESPACE_START GBFPlain::GBFPlain

(

)

Definition at line 32 of file gbfplain.cpp.

                   {
}

Member Function Documentation

virtual const char* SWFilter::getHeader ( ) const

inlinevirtualinherited

This method can supply a header associated with the processing done with this filter. A typical example is a suggested CSS style block for classed containers.

Reimplemented in OSISLaTeX, OSISXHTML, ThMLLaTeX, ThMLXHTML, TEIXHTML, GBFLaTeX, and GBFXHTML.

Definition at line 62 of file swfilter.h.

{ return ""; }

char GBFPlain::processText ( SWBuf &  text, const SWKey *  key = 0, const SWModule *  module = 0  )

virtual

This method processes and appropriately modifies the text given it for a particular filter task

Parameters

text	The text to be filtered/converted
key	Current key That was used.
module	Current module.

Returns

0

Implements SWFilter.

Definition at line 36 of file gbfplain.cpp.

{
    char token[2048];
    int tokpos = 0;
    bool intoken = false;
    SWBuf orig = text;
    const char* from = orig.c_str();
    
    for (text = ""; *from; ++from) {
        if (*from == '<') {
            intoken = true;
            tokpos = 0;
            token[0] = 0;
            token[1] = 0;
            token[2] = 0;
            continue;
        }
        if (*from == '>') {
            intoken = false;
                        // process desired tokens
            switch (*token) {
            case 'W':   // Strongs
                switch(token[1]) {
                case 'G':               // Greek
                case 'H':               // Hebrew
                case 'T':               // Tense
                    text.append(" <");
                    //for (char *tok = token + 2; *tok; tok++)
                    //  text += *tok;
                    text.append(token+2);
                    text.append("> ");
                    continue;
                }
                break;
            case 'R':
                switch(token[1]) {
                case 'F':               // footnote begin
                    text.append(" [");
                    continue;
                case 'f':               // footnote end
                    text.append("] ");
                    continue;
                }
                break;
            case 'C':
                switch(token[1]) {
                case 'A':               // ASCII value
                    text.append((char)atoi(&token[2]));
                    continue;
                case 'G':
                    text.append('>');
                    continue;
/*                              Bug in WEB
                case 'L':
                    *to++ = '<';
                    continue;
*/
                case 'L':   //        Bug in WEB.  Use above entry when fixed
                case 'N':               // new line
                    text.append('\n');
                    continue;
                case 'M':               // new paragraph
                    text.append("\n\n");
                    continue;
                }
                break;
            }
            continue;
        }
        if (intoken) {
            if (tokpos < 2045) {
                token[tokpos++] = *from;
                // TODO: why is this + 2 ?
                token[tokpos+2] = 0;
            }
        }
        else    text.append(*from);
    }
    return 0;
}

---

The documentation for this class was generated from the following files:

• include/gbfplain.h
• src/modules/filters/gbfplain.cpp