HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Digest.h
Go to the documentation of this file.
1 //-*****************************************************************************
2 //
3 // Copyright (c) 2009-2012,
4 // Sony Pictures Imageworks Inc. and
5 // Industrial Light & Magic, a division of Lucasfilm Entertainment Company Ltd.
6 //
7 // All rights reserved.
8 //
9 // Redistribution and use in source and binary forms, with or without
10 // modification, are permitted provided that the following conditions are
11 // met:
12 // * Redistributions of source code must retain the above copyright
13 // notice, this list of conditions and the following disclaimer.
14 // * Redistributions in binary form must reproduce the above
15 // copyright notice, this list of conditions and the following disclaimer
16 // in the documentation and/or other materials provided with the
17 // distribution.
18 // * Neither the name of Sony Pictures Imageworks, nor
19 // Industrial Light & Magic, nor the names of their contributors may be used
20 // to endorse or promote products derived from this software without specific
21 // prior written permission.
22 //
23 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
29 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
30 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
31 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
32 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
33 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 //
35 //-*****************************************************************************
36 
37 #ifndef Alembic_Util_Digest_h
38 #define Alembic_Util_Digest_h
39 
42 
43 namespace Alembic {
44 namespace Util {
45 namespace ALEMBIC_VERSION_NS {
46 
47 //-*************************************************************************
48 // Digest class. This is a 128 bit hash key produced by our hashing algorithm.
49 // It is totally ordered, by way of the totally_ordered operator template.
50 struct Digest : public Alembic::Util::totally_ordered<Digest>
51 {
52  union
53  {
54  uint8_t d[16];
55  uint64_t words[2];
56  };
57 
58  Digest() { words[0] = words[1] = 0; }
59  Digest( const Digest &copy )
60  {
61  words[0] = copy.words[0];
62  words[1] = copy.words[1];
63  }
64 
65  Digest &operator=( const Digest &copy )
66  {
67  words[0] = copy.words[0];
68  words[1] = copy.words[1];
69  return *this;
70  }
71 
72  uint8_t& operator[]( size_t i ) { return d[i]; }
73  uint8_t operator[]( size_t i ) const { return d[i]; }
74 
75  void print( std::ostream &ostr ) const
76  {
77  for ( int i = 0; i < 16; ++i )
78  {
79  ostr << std::setfill( '0' ) << std::setw( 2 ) <<
80  std::hex << std::noshowbase << ( int ) d[i];
81  }
82  }
83 
84  std::string str() const
85  {
86  std::stringstream sstr;
87  print( sstr );
88  return sstr.str();
89  }
90 
91  //-*************************************************************************
92  // ORDERING AND COMPARISON OPERATORS
93  //-*************************************************************************
94  bool operator==( const Digest &iRhs ) const
95  {
96  return ( ( words[0] == iRhs.words[0] ) &&
97  ( words[1] == iRhs.words[1] ) );
98  }
99 
100  bool operator<( const Digest &iRhs ) const
101  {
102  return ( words[0] < iRhs.words[0] ? true :
103  ( words[0] > iRhs.words[0] ? false :
104  ( words[1] < iRhs.words[1] ) ) );
105  }
106 };
107 
108 //-*****************************************************************************
109 inline std::ostream &operator<<( std::ostream &ostr, const Digest &a )
110 {
111  a.print( ostr );
112  return ostr;
113 }
114 
115 } // End namespace ALEMBIC_VERSION_NS
116 
117 using namespace ALEMBIC_VERSION_NS;
118 
119 } // End namespace Util
120 } // End namespace Alembic
121 
122 #endif
GLsizei const GLchar *const * string
Definition: glcorearb.h:813
GLboolean GLboolean GLboolean GLboolean a
Definition: glcorearb.h:1221
bool operator==(const Digest &iRhs) const
Definition: Digest.h:94
uint8_t operator[](size_t i) const
Definition: Digest.h:73
png_uint_32 i
Definition: png.h:2877
Digest & operator=(const Digest &copy)
Definition: Digest.h:65
void print(std::ostream &ostr) const
Definition: Digest.h:75
bool operator<(const Digest &iRhs) const
Definition: Digest.h:100
typedef int
Definition: png.h:1175
std::ostream & operator<<(std::ostream &ostr, const Digest &a)
Definition: Digest.h:109
#define ALEMBIC_VERSION_NS
Definition: Foundation.h:105