Fixed some C issues.

DESCRIPTION

@@ -1,6 +1,6 @@
 Package: arules
-Version: 1.7-0
-Date: 2021-11-12
+Version: 1.7-1
+Date: 2021-11-18
 Title: Mining Association Rules and Frequent Itemsets
 Authors@R: c(person("Michael", "Hahsler", role = c("aut", "cre", "cph"),
 		email = "[email protected]"),

NEWS.md

@@ -1,3 +1,9 @@
+# arules 1.7-1 (11/18/2021)
+
+## Bugfixes
+
+* Fixed some C issues: unsigned int in bitmat.c (function static int _exists) to ensure bit shifting works. The bitmap support buffer is now initialized with zeros. 
+
 # arules 1.7-0 (11/12/2021)
 
 ## New Feature

src/bitmat.c

@@ -326,7 +326,8 @@ int bm_count (BITMAT *bm, int row)
 static int _exists (BITMAT *bm, int *ids, int n, int supp)
 {                               /* -- check maximal/closed item sets */
   int i, k, x, m = n;           /* loop variables */
-  int b, bb;                    /* support bit mask */
+  // MFH: int b, bb;                    /* support bit mask */
+  unsigned int b, bb;                    /* support bit mask */
   int *d, *s;                   /* to traverse the bit vectors */
   int r = 0;                    /* result of intersection */
 
@@ -477,7 +478,9 @@ static int _buffers (BITMAT *bm, int mode)
   bm->buf = (int*)malloc((BLKSIZE+1) *sizeof(int)) +1;
   if (!bm->buf)   { bm_delete(bm); return -1; }
   if (mode != BM_CLOSED) return 0;
-  bm->supps = (int*)malloc((BLKSIZE << BM_SHIFT) *sizeof(int));
+  // MFH: Initialize with 0
+  //bm->supps = (int*)malloc((BLKSIZE << BM_SHIFT) *sizeof(int));
+  bm->supps = (int*)calloc((BLKSIZE << BM_SHIFT), sizeof(int));
   if (!bm->supps) { bm_delete(bm); return -1; }
   return 0;                     /* allocate additional buffers */
 }  /* _buffers() */