src/sparse-vector.cpp

/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
 * frpuniverse
 * Copyright (C) Peter L. Berghold 2008 <Peter@Berghold.net>
 * 
 * frpuniverse is free software.
 * 
 * You may redistribute it and/or modify it under the terms of the
 * GNU General Public License, as published by the Free Software
 * Foundation; either version 2 of the License, or (at your option)
 * any later version.
 * 
 * frpuniverse is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with frpuniverse.  If not, write to:
 *      The Free Software Foundation, Inc.,
 *      51 Franklin Street, Fifth Floor
 *      Boston, MA  02110-1301, USA.
 */

#include <malloc.h>
#include <string.h>
#include <stdio.h>

#include "sparse-vector.hpp"


void sparseVector::addAt(int ix,sparseVectorNode* n){
        sparseVectorNode* p=root;
        
        n -> setIndex(ix); // Just to make sure for sanity's sake later. 
        

        if ( p->getNext() == (sparseVectorNode*) 0 ) { // Root node points to zero
                p->setNext(n);
                n->setNext((sparseVectorNode* ) 0 );
        } else { 
                while ( p->getNext() != (sparseVectorNode*)0){
                        p = p->getNext();
                        if ( (p->getNext() != (sparseVectorNode*)0) &&
                                 (p->getNext()->getIndex() > n->getIndex()) ){
                                n->setNext(p->getNext());
                                p->setNext(n);
                                return;
                        }
                }
                
                p->setNext(n);
                n->setNext((sparseVectorNode*)0);
                return;
        }
        
}

sparseVectorNode* sparseVector::findAt(int ix){
        sparseVectorNode* p = root;
        
        if ( root->getNext() == (sparseVectorNode*) 0 ) 
                return (sparseVectorNode* ) 0;
        while(p->getNext() != (sparseVectorNode*)0){
                p = p->getNext();
                if ( p->getIndex() == ix ) 
                        return p;
        }
        return (p->getIndex() == ix ? p : (sparseVectorNode*) 0 );
        
}

#define XMLSTART "<sparseVector"
#define XMLEND "</sparseVector>"

static char* addXML(char* s,sparseVectorNode* p){
        char *t = p->dumpAsXML();
        int  len_s = strlen(s);
        int  len_t = strlen(t);
        char *u = (char *) malloc(len_s+ len_t+ 2);
        u[0]='\0';
        strcpy(u,s);
        strcat(u,t);
        free(s);
        s=u;
        free(t);
        return u;
}

char* sparseVector::dumpAsXML() {
        // Get ready folks.. this will be ugly...
        char * s;
        sparseVectorNode* p;
        
        s=(char*) malloc(129);
        s[0]='\0';
        
        sprintf(s,"%s\n",XMLSTART);
        if ( root->getNext() == (sparseVectorNode*)0){
                strcat(s,XMLEND);
                return s;
        } else {
                p=root->getNext();
                s = addXML(s,p);
                while(p->getNext() != (sparseVectorNode*)0){
                        p=p->getNext();
                        s=addXML(s,p);
                }
        }
        strcat(s,XMLEND);
        
        return s;
}

                
                
                

---