bitArray[arraySlot] |= targetBit;
}
+
/**
* Clears a bit from bitArray. Bit is cleared from the array
* only if the respective usage counter on the disk hits/is zero.
bitArray[slot] = bitArray[slot] & (~targetBit);
}
+
/**
* Checks if a bit is active in the bitArray
*
return GNUNET_NO;
}
+
/**
* Sets a bit active in the bitArray and increments
* bit-specific usage counter on disk (but only if
GNUNET_assert (1 == GNUNET_DISK_file_write (fh, &value, 1));
}
+
/**
* Clears a bit from bitArray if the respective usage
* counter on the disk hits/is zero.
GNUNET_assert (1 == GNUNET_DISK_file_write (fh, &value, 1));
}
+
#define BUFFSIZE 65536
/**
return GNUNET_OK;
}
+
/* ************** GNUNET_CONTAINER_BloomFilter iterator ********* */
/**
return GNUNET_YES;
}
+
/* *********************** INTERFACE **************** */
/**
return GNUNET_OK;
}
+
/**
* Or the entries of the given raw data array with the
* data of the given bloom filter. Assumes that
iterateBits (bf, &decrementBitCallback, bf, e);
}
+
/**
* Resize a bloom filter. Note that this operation
* is pretty costly. Essentially, the bloom filter
GNUNET_CONTAINER_bloomfilter_add (bf, &hc);
}
+
/* end of container_bloomfilter.c */