Lines Matching defs:digests
43 * This class transparently deals with cloneable and non-cloneable digests.
48 * that there is no messy MD5+SHA1 digests.
152 * Reset the remaining digests. Note this does *not* reset the number of
219 // cannot occur for digests generated via CloneableDigest
318 * digests. It uses the standard MessageDigest API and therefore can be used
327 * construction time. This is achieved by internally maintaining n digests
352 private final MessageDigest[] digests;
357 digests = new MessageDigest[n];
358 digests[0] = digest;
360 digests[i] = JsseJce.getMessageDigest(algorithm);
384 * maximum number of times, there are no digests left and this object can no
389 // if (digests[0] == null) {
390 // throw new IllegalStateException("no digests left");
396 return digests[0].getDigestLength();
401 for (int i = 0; (i < digests.length) && (digests[i] != null); i++) {
402 digests[i].update(b);
408 for (int i = 0; (i < digests.length) && (digests[i] != null); i++) {
409 digests[i].update(b, offset, len);
415 byte[] digest = digests[0].digest();
423 int n = digests[0].digest(buf, offset, len);
429 * Reset all digests after a digest() call. digests[0] has already been
434 for (int i = 1; (i < digests.length) && (digests[i] != null); i++) {
435 digests[i].reset();
441 for (int i = 0; (i < digests.length) && (digests[i] != null); i++) {
442 digests[i].reset();
448 for (int i = digests.length - 1; i >= 0; i--) {
449 if (digests[i] != null) {
450 MessageDigest digest = digests[i];
451 digests[i] = null;