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

Patch from Klee Dienes <klee@mit.edu> (bugzilla #420550) to

Browse Source 
re-implement gnc_lot_get_earliest_split and gnc_lot_get_latest_split
using xaccSplitDateOrder.  This greatly simplifies the functions.


git-svn-id: svn+ssh://svn.gnucash.org/repo/gnucash/trunk@15790 57a11ea4-9604-0410-9ed3-97b8803252fd
This commit is contained in:
David Hampton 2007-04-04 04:36:16 +00:00
parent d4a33b2311
commit 09f8e28a83
1 changed files with 11 additions and 45 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
src/engine/gnc-lot.c
View File

@ -370,59 +370,25 @@ gnc_lot_remove_split (GNCLot *lot, Split *split)
Split *
gnc_lot_get_earliest_split (GNCLot *lot)
{
SplitList *node;
Timespec ts;
Split *earliest = NULL;
ts.tv_sec = ((long long) ULONG_MAX);
ts.tv_nsec = 0;
if (!lot) return NULL;
for (node=lot->splits; node; node=node->next)
{
Split *s = node->data;
Transaction *trans = s->parent;
if (!trans) continue;
if ((ts.tv_sec > trans->date_posted.tv_sec) ||
((ts.tv_sec == trans->date_posted.tv_sec) &&
(ts.tv_nsec > trans->date_posted.tv_nsec)))
{
ts = trans->date_posted;
earliest = s;
}
}
return earliest;
if (! lot->splits)
return NULL;
lot->splits = g_list_sort (lot->splits, (GCompareFunc) xaccSplitDateOrder);
return lot->splits->data;
}
Split *
gnc_lot_get_latest_split (GNCLot *lot)
{
SplitList *node;
Timespec ts;
Split *latest = NULL;
SplitList *node;
ts.tv_sec = 0;
ts.tv_nsec = 0;
if (!lot) return NULL;
if (! lot->splits)
return NULL;
lot->splits = g_list_sort (lot->splits, (GCompareFunc) xaccSplitDateOrder);
for (node=lot->splits; node; node=node->next)
{
Split *s = node->data;
Transaction *trans = s->parent;
if (!trans) continue;
if ((ts.tv_sec < trans->date_posted.tv_sec) ||
((ts.tv_sec == trans->date_posted.tv_sec) &&
(ts.tv_nsec < trans->date_posted.tv_nsec)))
{
ts = trans->date_posted;
latest = s;
}
}
for (node = lot->splits; node->next; node = node->next)
;
return latest;
return node->data;
}
/* ============================================================= */