| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788 |
- // -*- mode: cpp; mode: fold -*-
- // Description /*{{{*/
- // $Id: hashsum_template.h,v 1.3 2001/05/07 05:05:47 jgg Exp $
- /* ######################################################################
- HashSumValueTemplate - Generic Storage for a hash value
-
- ##################################################################### */
- /*}}}*/
- #ifndef APTPKG_HASHSUM_TEMPLATE_H
- #define APTPKG_HASHSUM_TEMPLATE_H
- #include <string>
- #include <cstring>
- #include <algorithm>
- #include <stdint.h>
- using std::string;
- using std::min;
- template<int N>
- class HashSumValue
- {
- unsigned char Sum[N/8];
-
- public:
- // Accessors
- bool operator ==(const HashSumValue &rhs) const
- {
- return memcmp(Sum,rhs.Sum,sizeof(Sum)) == 0;
- };
- string Value() const
- {
- char Conv[16] =
- { '0','1','2','3','4','5','6','7','8','9','a','b',
- 'c','d','e','f'
- };
- char Result[((N/8)*2)+1];
- Result[(N/8)*2] = 0;
-
- // Convert each char into two letters
- int J = 0;
- int I = 0;
- for (; I != (N/8)*2; J++,I += 2)
- {
- Result[I] = Conv[Sum[J] >> 4];
- Result[I + 1] = Conv[Sum[J] & 0xF];
- }
- return string(Result);
- };
-
- inline void Value(unsigned char S[N/8])
- {
- for (int I = 0; I != sizeof(Sum); I++)
- S[I] = Sum[I];
- };
- inline operator string() const
- {
- return Value();
- };
- bool Set(string Str)
- {
- return Hex2Num(Str,Sum,sizeof(Sum));
- };
- inline void Set(unsigned char S[N/8])
- {
- for (int I = 0; I != sizeof(Sum); I++)
- Sum[I] = S[I];
- };
- HashSumValue(string Str)
- {
- memset(Sum,0,sizeof(Sum));
- Set(Str);
- }
- HashSumValue()
- {
- memset(Sum,0,sizeof(Sum));
- }
- };
- #endif
|