/ray/src/lib/lex/strtreedump.cc

Go to the documentation of this file.

/*
 * ani-parser/strtreedump.cc
 * 
 * Expandable, indent-capable, alloc-ahead string buffer for tree 
 * node dump. 
 * This is part of the AniVision project. 
 * 
 * Copyright (c) 2003 by Wolfgang Wieser (wwieser@gmx.de) 
 * 
 * This file may be distributed and/or modified under the terms of the 
 * GNU General Public License version 2 as published by the Free Software 
 * Foundation. 
 * 
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 * 
 */

#include "strtreedump.h"


void StringTreeDump::Entry::RemoveEnd(char c)
{
    size_t len=str.length();
    if(len>0 && str[len-1]==c)
    {  str.trunc(len-1);  }
    else
    {
        //fprintf(stderr,"Warning: Attempt to remove `%c' from tree dump but "
        //  "`%c' is last char.\n",c,len ? str[len-1] : '\0');
    }
}

//------------------------------------------------------------------------------

void StringTreeDump::append(const TLString &s)
{
    Entry *ent=ents.last();
    if(!ent || ent->indent!=curr_indent)
    {
        // Need new entry. 
        // First, tighten previous entry. 
        if(ents.last())  ents.last()->str.TightenSize();
        // Alloc and queue new entry: 
        ent=new Entry(curr_indent);
        ents.append(ent);
    }
    ent->append(s);
    indent_just_added=0;
}

void StringTreeDump::RemoveEnd(char c)
{
    Entry *ent=ents.last();
    Assert(ent);  // Otherwise we may not call this function...
    ent->RemoveEnd(c);
}


size_t StringTreeDump::write(FILE *fp,int indent_size,char indent_char)
{
    size_t totbytes=0;
    int cpos=0;  // current position
    
    // One string to hold a line in the dump (temp): 
    TLString tmp;
    
    Entry *ent=ents.first();
    if(ent) for(const char *ent_str=ent->str.str();;)
    {
        // One loop per line. 
        // First, find the text: 
        const char *add_start=ent_str;
        for(; *ent_str; ent_str++)
        {
            if(*ent_str=='\n')  break;
        }
        const char *add_end=ent_str;
        bool was_nl=0;
        if(*ent_str=='\n')
        {  was_nl=1;  ++ent_str;  }
        
        if(add_end<=add_start)
        {
            if(was_nl)
            {
                //fprintf(stderr,"<->\n");
                Assert(tmp.length()==0);
                fprintf(fp,"\n");
                ++totbytes;
            }
            else
            {
                Assert(*ent_str=='\0');
                ent=ent->next;
                if(!ent)  goto done;
                ent_str=ent->str.str();
            }
            continue;
        }
        
        // Add indention: 
        int add_indent=ent->indent-cpos;
        if(add_indent)
        {
            int tot_indent=add_indent*indent_size;
            char itmp[tot_indent+1];
            for(int i=0; i<tot_indent; i++)
            {  itmp[i]=indent_char;  }
            itmp[tot_indent]='\0';
            tmp.append(itmp);
        }
        
        // Then, add text: 
        tmp.append(add_start,add_end-add_start);
        
        // Write it: 
        fprintf(fp,"%s\n",tmp.str());
        totbytes+=tmp.length()+1;  // +1 for the newline
        tmp.trunc(0,/*do_not_shrink=*/1);
    }
    
    done:;
    return(totbytes);
}


StringTreeDump::StringTreeDump() : 
    ents()
{
    curr_indent=0;
    indent_just_added=0;
}

StringTreeDump::~StringTreeDump()
{
    while(!ents.IsEmpty())
    {  delete ents.PopLast();  }
}

---