Coverage Report

Created: 2023-09-25 06:10

/src/alembic/lib/Alembic/Util/Digest.h
Line
Count
Source (jump to first uncovered line)
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
40
#include <Alembic/Util/Foundation.h>
41
#include <Alembic/Util/PlainOldDataType.h>
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
0
    Digest() { words[0] = words[1] = 0; }
59
    Digest( const Digest &copy )
60
0
    {
61
0
        words[0] = copy.words[0];
62
0
        words[1] = copy.words[1];
63
0
    }
64
65
    Digest &operator=( const Digest &copy )
66
0
    {
67
0
        words[0] = copy.words[0];
68
0
        words[1] = copy.words[1];
69
0
        return *this;
70
0
    }
71
72
0
    uint8_t& operator[]( size_t i ) { return d[i]; }
73
0
    uint8_t operator[]( size_t i ) const { return d[i]; }
74
75
    void print( std::ostream &ostr ) const
76
0
    {
77
0
        for ( int i = 0; i < 16; ++i )
78
0
        {
79
0
            ostr << std::setfill( '0' ) << std::setw( 2 ) <<
80
0
                std::hex << std::noshowbase << ( int ) d[i];
81
0
        }
82
0
    }
83
84
    std::string str() const
85
0
    {
86
0
        std::stringstream sstr;
87
0
        print( sstr );
88
0
        return sstr.str();
89
0
    }
90
91
    //-*************************************************************************
92
    // ORDERING AND COMPARISON OPERATORS
93
    //-*************************************************************************
94
    bool operator==( const Digest &iRhs ) const
95
0
    {
96
0
        return ( ( words[0] == iRhs.words[0] ) &&
97
0
                 ( words[1] == iRhs.words[1] ) );
98
0
    }
99
100
    bool operator<( const Digest &iRhs ) const
101
0
    {
102
0
        return ( words[0] < iRhs.words[0] ? true :
103
0
                 ( words[0] > iRhs.words[0] ? false :
104
0
                   ( words[1] < iRhs.words[1] ) ) );
105
0
    }
106
};
107
108
//-*****************************************************************************
109
inline std::ostream &operator<<( std::ostream &ostr, const Digest &a )
110
0
{
111
0
    a.print( ostr );
112
0
    return ostr;
113
0
}
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