IntenseFinance/gnucash
3
0
Fork 0
mirror of https://github.com/Gnucash/gnucash.git synced 2025-02-25 18:55:30 -06:00
Code Issues Packages Projects Releases Wiki Activity

move to this directory from earlier homes

Browse Source 
git-svn-id: svn+ssh://svn.gnucash.org/repo/gnucash/trunk@501 57a11ea4-9604-0410-9ed3-97b8803252fd
This commit is contained in:
Linas Vepstas 1998-02-04 20:52:55 +00:00
parent 35d1da6d8a
commit 06df1fcdc7
2 changed files with 209 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

143
src/register/QuickFill.c Normal file
View File

@ -0,0 +1,143 @@
/********************************************************************\
* QuickFill.h -- the quickfill tree data structure *
* Copyright (C) 1997 Robin D. Clark *
* Copyright (C) 1998 Linas Vepstas *
* *
* This program is free software; you can 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. *
* *
* This program 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 this program; if not, write to the Free Software *
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. *
* *
* Author: Rob Clark *
* Internet: rclark@cs.hmc.edu *
* Address: 609 8th Street *
* Huntington Beach, CA 92648-4632 *
\********************************************************************/
#include <ctype.h>
#include <string.h>
#include "config.h"
#include "QuickFill.h"
#include "util.h"
/** PROTOTYPES ******************************************************/
static void qfInsertTextRec( QuickFill *qf, const char * text, int depth );
/********************************************************************\
* Because I can't use C++ for this project, doesn't mean that I *
* can't pretend too! These functions perform actions on the *
* QuickFill tree structure, in order to encapsulate the knowledge *
* of the internals of QuickFill into one file. *
\********************************************************************/
int
CHAR_TO_INDEX( char c )
{
c = toupper(c)-0x40;
if( (c < 0) || (c >= QFNUM) )
return 0;
else
return c;
}
/********************************************************************\
\********************************************************************/
QuickFill *
xaccMallocQuickFill( void )
{
int i;
QuickFill *qf = (QuickFill *)malloc(sizeof(QuickFill));
for( i=0; i<QFNUM; i++ )
{
qf->qf[i] = NULL;
}
qf->text = NULL;
return qf;
}
/********************************************************************\
\********************************************************************/
void
xaccFreeQuickFill( QuickFill *qf )
{
if( qf != NULL )
{
int i;
for( i=0; i<QFNUM; i++ )
{
xaccFreeQuickFill( qf->qf[i] );
}
free(qf->text);
free(qf);
}
}
/********************************************************************\
\********************************************************************/
QuickFill *
xaccGetQuickFill( QuickFill *qf, char c )
{
if( qf != NULL )
{
DEBUGCMD(printf(" index = %d\n",CHAR_TO_INDEX(c)));
return qf->qf[CHAR_TO_INDEX(c)];
}
else
return NULL;
}
/********************************************************************\
\********************************************************************/
void
xaccQFInsertText( QuickFill *qf, const char * text )
{
qfInsertTextRec( qf, text, 0 );
}
/********************************************************************\
\********************************************************************/
static void
qfInsertTextRec( QuickFill *qf, const char *text, int depth )
{
if (NULL == qf) return;
if( text )
{
if( text[depth] != '\0' )
{
int index = CHAR_TO_INDEX( text[depth] );
if( qf->qf[index] == NULL )
{
qf->qf[index] = xaccMallocQuickFill();
}
/* store text in LIFO order, so that recent
* stuff shows up before old stuff */
if (qf->qf[index]->text) free (qf->qf[index]->text);
qf->qf[index]->text = strdup (text);
qfInsertTextRec( qf->qf[index], text, ++depth );
}
}
}
/********************** END OF FILE *********************************\
\********************************************************************/

66
src/register/QuickFill.h Normal file
View File

@ -0,0 +1,66 @@
/********************************************************************\
* QuickFill.h -- the quickfill tree data structure *
* Copyright (C) 1997 Robin D. Clark *
* Copyright (C) 1998 Linas Vepstas *
* *
* This program is free software; you can 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. *
* *
* This program 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 this program; if not, write to the Free Software *
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. *
* *
* Author: Rob Clark *
* Internet: rclark@cs.hmc.edu *
* Address: 609 8th Street *
* Huntington Beach, CA 92648-4632 *
\********************************************************************/
#ifndef __XACC_QUICKFILL_H__
#define __XACC_QUICKFILL_H__
#include "config.h"
/** STRUCTS *********************************************************/
/* The way quickfill works is this: the decscription field of a transaction
* is used to insert a pointer to itself into the quickfill tree. The
* QuickFill struct is a node in the tree, and the qf array is an array
* of pointers to children of the node. (NULL, if no corresponding child.)
* The index of the array is determined by the next letter in the string
* that is the description field. The trans field is a pointer to the last
* inserted child that made it to this node. At the root of the tree is
* a QuickFill struct, with trans == NULL, and the array of pointers to
* children. When a transaction is inserted, the first letter of the
* description field determines which child the transaction goes into.
* If the child is NULL, a new QuickFill node is created. Otherwise,
* the trans field of the child is changed to point to the new transaction.
* Then, recursively, the process is repeated, with the next character in
* the description field as the index to the array. The recursion stops
* when the end of the descriptions string is reached.
*/
#define QFNUM 27 /* 26+1 letters in the alphabet */
typedef struct _quickfill {
char * text; /* the first matching text string */
struct _quickfill *qf[QFNUM]; /* array of children in the tree */
} QuickFill;
/** PROTOTYPES ******************************************************/
QuickFill *xaccMallocQuickFill( void );
void xaccFreeQuickFill( QuickFill *qf );
QuickFill *xaccGetQuickFill( QuickFill *qf, char c );
void xaccQFInsertText( QuickFill *qf, const char *text );
/** GLOBALS *********************************************************/
#endif /* __XACC_QUICKFILL_H__ */