ftm-svn Mailing List for FTM (Page 79)

SourceForge Headquarters 225 Broadway Suite 1600 San Diego, CA 92101 +1 (858) 422-6466

Revision: 1832
          http://ftm.svn.sourceforge.net/ftm/?rev=1832&view=rev
Author:   diemo
Date:     2008-07-22 14:55:53 +0000 (Tue, 22 Jul 2008)

Log Message:
-----------
renamed tree to more precise kdtree

Modified Paths:
--------------
    trunk/ftm/ftmlib/classes/kdtree.c
    trunk/ftm/ftmlib/classes/kdtree.h
    trunk/ftm/ftmlib/classes/kdtreebuild.c
    trunk/ftm/ftmlib/classes/kdtreesearch.c

Modified: trunk/ftm/ftmlib/classes/kdtree.c
===================================================================

--- trunk/ftm/ftmlib/classes/kdtree.c	2008-07-22 14:51:27 UTC (rev 1831)
+++ trunk/ftm/ftmlib/classes/kdtree.c	2008-07-22 14:55:53 UTC (rev 1832)
@@ -32,8 +32,8 @@
 #define HEIGHT 3
 #define MAX_FLOAT 0x7FFFFFFF
 
-fts_symbol_t tree_symbol = 0;
-fts_class_t *tree_class  = 0;
+fts_symbol_t kdtree_symbol = 0;
+fts_class_t *kdtree_class  = 0;
 
 fts_symbol_t s_mean;
 fts_symbol_t s_hyper;
@@ -83,7 +83,7 @@
 
 
 #if PROFILE
-static void profile_clear (tree_t *t)
+static void profile_clear (kdtree_t *t)
 {
     t->profile.v2v   = 0;
     t->profile.v2n   = 0;
@@ -138,7 +138,7 @@
 	  list of n indices in result
 */
 #if 0
-static int tree_search (tree_t *tree, fmat_t *x, int k, int *result)
+static int kdtree_search (kdtree_t *tree, fmat_t *x, int k, int *result)
 {
     fts_stack_t stack;
 
@@ -167,7 +167,7 @@
     fts_post("]%s", suffix);
 }
 
-static void tree_info_display (tree_t* t) 
+static void kdtree_info_display (kdtree_t* t) 
 {
     int i, j;
     fts_post("\nTree Info:\n");
@@ -186,7 +186,7 @@
 }
 
 
-static void tree_data_display(tree_t* t) 
+static void kdtree_data_display(kdtree_t* t) 
 {
     int l, n, i, j;
 
@@ -204,7 +204,7 @@
 	    for (i = t->nodes[n].startind; i <= t->nodes[n].endind; i++) 
 	    {
 		fts_post("vec %d = ", t->dataindex[i]);
-		vec_post(tree_get_vector(t, i), t->ndim,
+		vec_post(kdtree_get_vector(t, i), t->ndim,
 			  i < t->nodes[n].endind ? ", " : "");
 	    }
 	    fts_post(")\n");
@@ -214,7 +214,7 @@
 
 
 static void
-tree_getelem_function(fts_object_t *o, int ac, const fts_atom_t *at, fts_atom_t *ret)
+kdtree_getelem_function(fts_object_t *o, int ac, const fts_atom_t *at, fts_atom_t *ret)
 {  
   if(ac > 0 && fts_is_number(at))
   {
@@ -231,11 +231,11 @@
  *
  */
 
-static fts_method_status_t _tree_set (fts_object_t *o, fts_symbol_t s, 
+static fts_method_status_t _kdtree_set (fts_object_t *o, fts_symbol_t s, 
 				      int ac, const fts_atom_t *at, 
 				      fts_atom_t *ret)
 {
-  tree_t *self = (tree_t *) o;
+  kdtree_t *self = (kdtree_t *) o;
   fmat_t *data = (fmat_t *) fts_get_object(at);
 
   if (self->data)
@@ -245,25 +245,25 @@
   self->data = data;
   fts_object_refer((fts_object_t *) self->data);
 
-  tree_init(self, floor(log2(fmat_get_m(data))), 
+  kdtree_init(self, floor(log2(fmat_get_m(data))), 
 	          fmat_get_m(data), fmat_get_n(data));
 
-  /* tree_clear and rebuild: */
-  /* tree_clear(self);*/
-  tree_build(self); 
+  /* kdtree_clear and rebuild: */
+  /* kdtree_clear(self);*/
+  kdtree_build(self); 
 
   fts_set_object(ret, o);
   return fts_ok;
 }
 
 
-static fts_method_status_t _tree_add (fts_object_t *o, fts_symbol_t s, int ac, const fts_atom_t *at, fts_atom_t *ret)
+static fts_method_status_t _kdtree_add (fts_object_t *o, fts_symbol_t s, int ac, const fts_atom_t *at, fts_atom_t *ret)
 {
-  tree_t *self = (tree_t *) o;
+  kdtree_t *self = (kdtree_t *) o;
 
   /* rebuild */
-  /* tree_set(self, ac, at); 
-     tree_build(self);
+  /* kdtree_set(self, ac, at); 
+     kdtree_build(self);
   */
 
   fts_set_object(ret, self);
@@ -274,11 +274,11 @@
 
 
 
-static fts_method_status_t _tree_getknn (fts_object_t *o, fts_symbol_t s, 
+static fts_method_status_t _kdtree_getknn (fts_object_t *o, fts_symbol_t s, 
 					 int ac, const fts_atom_t *at, 
 					 fts_atom_t *ret)
 {
-  tree_t *self = (tree_t *) o;
+  kdtree_t *self = (kdtree_t *) o;
   fmat_t *x = NULL;	/* search vector */
   int     k = 1, n;
   int     *result;
@@ -291,7 +291,7 @@
 
   result = alloca(sizeof(int) * k);
 
-  n = tree_search_knn(self, fmat_get_ptr(x), k, result);
+  n = kdtree_search_knn(self, fmat_get_ptr(x), k, result);
 
   if (s == fts_s_get) /* geti: nearest index? */
   {   /* return one fvec */
@@ -329,11 +329,11 @@
 }
 
 
-static fts_method_status_t _tree_get_node (fts_object_t *o, fts_symbol_t s, 
+static fts_method_status_t _kdtree_get_node (fts_object_t *o, fts_symbol_t s, 
 					   int ac, const fts_atom_t *at, 
 					   fts_atom_t *ret)
 {
-  tree_t *t = (tree_t *) o;
+  kdtree_t *t = (kdtree_t *) o;
   int     n = 0;	/* node to inspect */
 
   if (ac > 1  &&  fts_is_number(at + 1))
@@ -388,14 +388,14 @@
 }
 
 
-static fts_method_status_t _tree_print (fts_object_t *o, fts_symbol_t s, 
+static fts_method_status_t _kdtree_print (fts_object_t *o, fts_symbol_t s, 
 					int ac, const fts_atom_t *at, 
 					fts_atom_t *ret)
 {
-  tree_t *self = (tree_t *) o;
+  kdtree_t *self = (kdtree_t *) o;
 
-  tree_info_display(self);
-  tree_data_display(self);
+  kdtree_info_display(self);
+  kdtree_data_display(self);
 
   return fts_ok;
 }
@@ -409,9 +409,9 @@
 */
 
 static fts_method_status_t
-_tree_init(fts_object_t *o, fts_symbol_t s, int ac, const fts_atom_t *at, fts_atom_t *ret)
+_kdtree_init(fts_object_t *o, fts_symbol_t s, int ac, const fts_atom_t *at, fts_atom_t *ret)
 {
-  tree_t *self = (tree_t *) o;
+  kdtree_t *self = (kdtree_t *) o;
       
   /* Init */
   self->ndata  	  = 0;
@@ -429,7 +429,7 @@
 
   if (ac > 0  &&  fts_is_a(at, fmat_class))
   {   /* set data arg and build tree */
-      _tree_set(o, s, ac, at, ret);
+      _kdtree_set(o, s, ac, at, ret);
   }
 
   return fts_ok;
@@ -437,12 +437,12 @@
 
 
 static fts_method_status_t
-_tree_delete(fts_object_t *o, fts_symbol_t s, int ac, const fts_atom_t *at, fts_atom_t *ret)
+_kdtree_delete(fts_object_t *o, fts_symbol_t s, int ac, const fts_atom_t *at, fts_atom_t *ret)
 {
-  tree_t *self = (tree_t *) o;
+  kdtree_t *self = (kdtree_t *) o;
   int i;
   
-/* todo: move to tree_clear */
+/* todo: move to kdtree_clear */
   /* free nodes */
   for (i = 0; i < self->nnodes; i++)
   {
@@ -462,50 +462,50 @@
 
 
 static void
-_tree_instantiate(fts_class_t *cl)
+_kdtree_instantiate(fts_class_t *cl)
 {
-  fts_class_init(cl, sizeof(tree_t), _tree_init, _tree_delete, "[<fmat: data>>] - vector space index tree");
+  fts_class_init(cl, sizeof(kdtree_t), _kdtree_init, _kdtree_delete, "[<fmat: data>>] - vector space index tree");
   
 /*  
-  fts_class_set_copy_function(cl, tree_copy_function);
-  fts_class_set_array_function(cl, tree_array_function);
-  fts_class_set_dump_function(cl, tree_dump_function);
+  fts_class_set_copy_function(cl, kdtree_copy_function);
+  fts_class_set_array_function(cl, kdtree_array_function);
+  fts_class_set_dump_function(cl, kdtree_dump_function);
 */
-  fts_class_set_getelem_function(cl, tree_getelem_function);
+  fts_class_set_getelem_function(cl, kdtree_getelem_function);
 
-  fts_class_message_varargs(cl, fts_s_print, _tree_print, "print list of entries");
+  fts_class_message_varargs(cl, fts_s_print, _kdtree_print, "print list of entries");
 
 /*
-  fts_class_message_void(cl, fts_s_clear, _tree_clear, "- erase all entries");
-  fts_class_message_varargs(cl, fts_new_symbol("rebuild"), _tree_rebuild);  
-  fts_class_message_varargs(cl, fts_s_remove, _tree_remove, "<any: key> ... - remove given entries");
+  fts_class_message_void(cl, fts_s_clear, _kdtree_clear, "- erase all entries");
+  fts_class_message_varargs(cl, fts_new_symbol("rebuild"), _kdtree_rebuild);  
+  fts_class_message_varargs(cl, fts_s_remove, _kdtree_remove, "<any: key> ... - remove given entries");
 */
 
-  fts_class_message(cl, fts_s_set,	       fmat_class, _tree_set, "<fmat: data> - set data matrix(ndata, ndim)");
-/* no:  fts_class_message(cl, fts_new_symbol("add"), fmat_class, _tree_add, "<fmat: vector> - add one vector"); */
+  fts_class_message(cl, fts_s_set,	       fmat_class, _kdtree_set, "<fmat: data> - set data matrix(ndata, ndim)");
+/* no:  fts_class_message(cl, fts_new_symbol("add"), fmat_class, _kdtree_add, "<fmat: vector> - add one vector"); */
 
-  fts_class_message_varargs(cl, fts_s_get,                _tree_getknn, 
+  fts_class_message_varargs(cl, fts_s_get,                _kdtree_getknn, 
     "<fmat: x> - get frow vector of data matrix nearest to vector x");
-  fts_class_message_varargs(cl, fts_new_symbol("getknn"), _tree_getknn, 
+  fts_class_message_varargs(cl, fts_new_symbol("getknn"), _kdtree_getknn, 
     "<fmat: x> [<int: k>] - get k nearest neighbour vectors to vector x (default k=1)");
-  fts_class_message_varargs(cl, s_getknni,                _tree_getknn, 
+  fts_class_message_varargs(cl, s_getknni,                _kdtree_getknn, 
     "<fmat: x> [<int: k>] - get row indices in data matrix of k nearest neighbours to vector x (default k=1) ");
 
   /* inspection */ 
- fts_class_message_varargs(cl, fts_new_symbol("node"),  _tree_get_node,  
+ fts_class_message_varargs(cl, fts_new_symbol("node"),  _kdtree_get_node,  
    "<num|mean|hyper|size|start|end|profile> <int: index> - get information about a node");
 
 }
 
 
-FTS_MODULE_INIT(tree)
+FTS_MODULE_INIT(kdtree)
 {
-  tree_symbol = fts_new_symbol("tree");
+  kdtree_symbol = fts_new_symbol("kdtree");
   s_mean  = fts_new_symbol("mean");
   s_hyper = fts_new_symbol("hyper");
   s_vec   = fts_new_symbol("vec");
   s_profile = fts_new_symbol("profile");
   s_getknni = fts_new_symbol("getknni");
 
-  tree_class = fts_class_install(tree_symbol, _tree_instantiate);
+  kdtree_class = fts_class_install(kdtree_symbol, _kdtree_instantiate);
 }

Modified: trunk/ftm/ftmlib/classes/kdtree.h
===================================================================
--- trunk/ftm/ftmlib/classes/kdtree.h	2008-07-22 14:51:27 UTC (rev 1831)
+++ trunk/ftm/ftmlib/classes/kdtree.h	2008-07-22 14:55:53 UTC (rev 1832)
@@ -20,8 +20,8 @@
  * 
  */
 
-#ifndef _DATA_TREE_H_
-#define _DATA_TREE_H_
+#ifndef _DATA_KDTREE_H_
+#define _DATA_KDTREE_H_
 
 #include "fts.h"
 
@@ -59,16 +59,16 @@
 } node_t;
 
 
-enum tree_dmode { dmode_orthogonal, dmode_hyperplane, dmode_pca };
+enum kdtree_dmode { dmode_orthogonal, dmode_hyperplane, dmode_pca };
 
-typedef struct _tree
+typedef struct _kdtree
 {
     fts_object_t o;
 
-    enum tree_dmode dmode;
+    enum kdtree_dmode dmode;
     int     ndim;	/* Dimension of vectors */
     int     ndata;	/* Number of vectors */
-    int     height;	/* Height of the tree */
+    int     height;	/* Height of the kdtree */
     int     nnodes; 	/* Number of nodes (must be a power of 2) */
 
     fmat_t *data;	/* data matrix (ndata, ndim) */
@@ -83,17 +83,17 @@
 	int mean;
 	int hyper;
     } profile;
-} tree_t;
+} kdtree_t;
 
 
-FTS_API fts_symbol_t tree_symbol;
-FTS_API fts_class_t *tree_class;
+FTS_API fts_symbol_t kdtree_symbol;
+FTS_API fts_class_t *kdtree_class;
 
 /* get data element via indirection order array */
-#define tree_get_element(t, i, j)  fmat_get_element(t->data, t->dataindex[i], j)
+#define kdtree_get_element(t, i, j)  fmat_get_element(t->data, t->dataindex[i], j)
 
 /* get data vector via indirection order array */
-#define tree_get_vector(t, i)     (fmat_get_ptr(t->data) + t->dataindex[i] * t->ndim)
+#define kdtree_get_vector(t, i)     (fmat_get_ptr(t->data) + t->dataindex[i] * t->ndim)
 
 #define fmat_get_row_ptr(f, i)    (fmat_get_ptr(f) + (i) * fmat_get_n(f))
 
@@ -102,12 +102,12 @@
 void vec_post (float *v, int n, const char *suffix);
 
 /* vector to node distance */
-float distV2N (tree_t* t, const float *x, const int node);
+float distV2N (kdtree_t* t, const float *x, const int node);
 
-void tree_build (tree_t* t);
-void tree_init (tree_t* t, int h, int vect_num, int dim);
+void kdtree_build (kdtree_t* t);
+void kdtree_init (kdtree_t* t, int h, int vect_num, int dim);
 
-int  tree_search_knn (tree_t *t, float* x, int k, int *y);
+int  kdtree_search_knn (kdtree_t *t, float* x, int k, int *y);
 
 
 #endif

Modified: trunk/ftm/ftmlib/classes/kdtreebuild.c
===================================================================
--- trunk/ftm/ftmlib/classes/kdtreebuild.c	2008-07-22 14:51:27 UTC (rev 1831)
+++ trunk/ftm/ftmlib/classes/kdtreebuild.c	2008-07-22 14:55:53 UTC (rev 1832)
@@ -1,14 +1,14 @@
 
-#include "tree.h"
+#include "kdtree.h"
 #include <stdlib.h>
 #include <math.h>
 
 
-#define DEBUG_TREEBUILD 0
+#define DEBUG_KDTREEBUILD 0
 
 
 static void 
-compute_mean (tree_t *t, int node) 
+compute_mean (kdtree_t *t, int node) 
 {
     float  sum;
     float *mean_ptr = fmat_get_ptr(t->nodes[node].mean);
@@ -28,12 +28,12 @@
 	
 	for (i = t->nodes[node].startind; i <= t->nodes[node].endind; i++) 
 	{
-	    sum += tree_get_element(t, i, j);
+	    sum += kdtree_get_element(t, i, j);
 	}
 	mean_ptr[j] = sum / nvector;
     }
 
-#if DEBUG_TREEBUILD
+#if DEBUG_KDTREEBUILD
     fts_post("mean vect for node %d = ", node);
     vec_post(mean_ptr, t->ndim, "\n");
 #endif
@@ -48,7 +48,7 @@
 
 
 /* swap positions of vectors i and j: only in indirection array */
-static void swap (tree_t* t, int i, int j) 
+static void swap (kdtree_t* t, int i, int j) 
 {
     int tmp;
 
@@ -89,7 +89,7 @@
 
 
 /* vector to node distance */
-float distV2N (tree_t* t, const float *x, const int node)
+float distV2N (kdtree_t* t, const float *x, const int node)
 {
 #if PROFILE_BUILD
     t->profile.v2n++;
@@ -113,7 +113,7 @@
 }
 
 
-static void compute_splitplane (tree_t* t, int node, int level) 
+static void compute_splitplane (kdtree_t* t, int node, int level) 
 {
     int   b;
     float h;
@@ -135,7 +135,7 @@
 
     t->nodes[node].splitnorm = 1;
 
-#if DEBUG_TREEBUILD
+#if DEBUG_KDTREEBUILD
     fts_post("Splitplane of node %i: ", node);
     vec_post(t->nodes[node].split, t->ndim + 1, "\n");
 #endif
@@ -144,13 +144,13 @@
 
 
 
-static void freeVect (tree_t* t, int vect_number) 
+static void freeVect (kdtree_t* t, int vect_number) 
 {
     fmat_set_const(t->data, MAX_FLOAT);
 }
 
 #if 0
-void reBalance(tree_t* t) 
+void reBalance(kdtree_t* t) 
 {
     int i = 0;
     int j = t->ndata - 1;
@@ -174,12 +174,12 @@
     t->ndata = i; 
     t->nodes[0].endind = t->ndata - 1;
 
-    tree_build(t);
+    kdtree_build(t);
 }
 #endif
 
 
-void tree_build (tree_t* t) 
+void kdtree_build (kdtree_t* t) 
 {			
     int l;		// current level number
     int n;		// current node number
@@ -200,7 +200,7 @@
     {		
 	int nstart = pow2(l)   - 1;
 	int nend   = pow2(l+1) - 1;
-#if DEBUG_TREEBUILD
+#if DEBUG_KDTREEBUILD
 	fts_post("\nLevel #%i  nodes %d..%d\n", l, nstart, nend);
 #endif
 	for (n = nstart; n < nend; n++) 
@@ -208,7 +208,7 @@
 	    compute_mean(t, n);
 	    compute_splitplane(t, n, l);
 
-#if DEBUG_TREEBUILD
+#if DEBUG_KDTREEBUILD
 	    fts_post("Node #%i (%i..%i): mean = ", 
 		     n, t->nodes[n].startind, t->nodes[n].endind); 
 	    vec_post(fmat_get_ptr(t->nodes[n].mean), t->ndim, "\n");
@@ -218,11 +218,11 @@
 		
 	    while (j > i) 
 	    {   /* sort node vectors by distance to splitplane */
-		while (distV2N(t, tree_get_vector(t, i), n) <= 0) 
+		while (distV2N(t, kdtree_get_vector(t, i), n) <= 0) 
 		{
 		    i++;	      // fts_post("i=%i\n", i);
 		}
-		while (distV2N(t, tree_get_vector(t, j), n) > 0) 
+		while (distV2N(t, kdtree_get_vector(t, j), n) > 0) 
 		{
 		    j--;	      // fts_post("j=%i\n", j);
 		}
@@ -241,7 +241,7 @@
 }
 
 
-void tree_init (tree_t* t, int h, int vect_num, int dim) 
+void kdtree_init (kdtree_t* t, int h, int vect_num, int dim) 
 {
     int i;
 

Modified: trunk/ftm/ftmlib/classes/kdtreesearch.c
===================================================================
--- trunk/ftm/ftmlib/classes/kdtreesearch.c	2008-07-22 14:51:27 UTC (rev 1831)
+++ trunk/ftm/ftmlib/classes/kdtreesearch.c	2008-07-22 14:55:53 UTC (rev 1832)
@@ -1,10 +1,10 @@
 
-#include "tree.h"
+#include "kdtree.h"
 #include <stdlib.h>
 #include <math.h>
 
 
-#define DEBUG_TREESEARCH 0
+#define DEBUG_KDTREESEARCH 0
 
 
 static void initStack(stack* s) 
@@ -100,7 +100,7 @@
 
 /* out:    y[K] = index of the Kth neirest neighbour
    return: actual number of found neighbours */
-int tree_search_knn (tree_t *t, float* x, int k, int *y) 
+int kdtree_search_knn (kdtree_t *t, float* x, int k, int *y) 
 {
     float *d;	  // vector to vector distance from vector y[k] to vector x
     int i;	  // current processed vector
@@ -137,16 +137,16 @@
 		int istart = t->nodes[cur.node].startind;
 		int iend   = t->nodes[cur.node].endind;
 		int i;
-#ifdef DEBUG_TREESEARCH
+#ifdef DEBUG_KDTREESEARCH
 		fts_post("Leaf node p = %d\n", cur.node);
 #endif
 		for (i = istart; i <= iend; i++)
 		{
-		    dxx = euclidianDistance(x, tree_get_vector(t, i), t->ndim);
+		    dxx = euclidianDistance(x, kdtree_get_vector(t, i), t->ndim);
 
-#ifdef DEBUG_TREESEARCH
+#ifdef DEBUG_KDTREESEARCH
 		    fts_post("distance = %f between vector %d ", dxx, i);
-		    vec_post(tree_get_vector(t, i), t->ndim, " and x ");
+		    vec_post(kdtree_get_vector(t, i), t->ndim, " and x ");
 		    vec_post(x,                     t->ndim, "\n");
 #endif
 #if PROFILE_SEARCH
@@ -163,7 +163,7 @@
 	    else 
 	    {	// branched node
 		float d = distV2N(t, x, cur.node);
-#ifdef DEBUG_TREESEARCH
+#ifdef DEBUG_KDTREESEARCH
 		fts_post("Inner node %d, d = %f\n", cur.node, d);
 #endif
 		if (d < 0) 


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.




2008	Jan	Feb	Mar	Apr	May	Jun (5)	Jul (42)	Aug (91)	Sep (97)	Oct (69)	Nov (16)	Dec (32)
2009	Jan (74)	Feb (109)	Mar (117)	Apr (86)	May (84)	Jun (47)	Jul (30)	Aug (25)	Sep (39)	Oct (59)	Nov (42)	Dec (38)
2010	Jan (30)	Feb (43)	Mar (59)	Apr (67)	May (29)	Jun (47)	Jul (48)	Aug (22)	Sep (22)	Oct (36)	Nov (40)	Dec (3)
2011	Jan (39)	Feb (21)	Mar (36)	Apr (35)	May (8)	Jun	Jul (14)	Aug (4)	Sep (10)	Oct (27)	Nov (1)	Dec
2012	Jan (2)	Feb (2)	Mar	Apr (9)	May (1)	Jun (1)	Jul (7)	Aug	Sep (15)	Oct (1)	Nov (3)	Dec (6)
2013	Jan	Feb	Mar	Apr (5)	May	Jun (2)	Jul	Aug (5)	Sep (15)	Oct	Nov	Dec (1)
2014	Jan (5)	Feb	Mar	Apr	May (3)	Jun	Jul (1)	Aug	Sep	Oct (2)	Nov	Dec
2015	Jan	Feb (5)	Mar	Apr (4)	May (1)	Jun	Jul	Aug (1)	Sep (19)	Oct	Nov	Dec (1)
2016	Jan	Feb (1)	Mar	Apr	May (3)	Jun	Jul	Aug	Sep (6)	Oct	Nov	Dec (2)
2017	Jan (16)	Feb (8)	Mar	Apr	May	Jun	Jul	Aug	Sep	Oct	Nov	Dec
2018	Jan	Feb	Mar (7)	Apr	May (3)	Jun	Jul	Aug	Sep	Oct	Nov (1)	Dec (5)
2019	Jan	Feb	Mar	Apr	May (3)	Jun	Jul	Aug	Sep	Oct	Nov	Dec
2020	Jan	Feb	Mar	Apr	May	Jun	Jul (14)	Aug (2)	Sep	Oct	Nov	Dec
2021	Jan	Feb	Mar (7)	Apr (14)	May	Jun	Jul	Aug	Sep	Oct	Nov	Dec
2022	Jan	Feb	Mar	Apr	May	Jun	Jul	Aug	Sep	Oct (8)	Nov (3)	Dec
2023	Jan (1)	Feb	Mar (12)	Apr	May	Jun	Jul	Aug	Sep	Oct	Nov	Dec
2025	Jan	Feb	Mar	Apr	May	Jun (4)	Jul	Aug	Sep	Oct	Nov	Dec

ftm-svn Mailing List for FTM (Page 79)

ftm-svn — FTM SVN logs