File: bit_twiddling_functors.h

package info (click to toggle)
seqan2 2.4.0%2Bdfsg-11
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 223,504 kB
  • sloc: cpp: 256,886; ansic: 91,672; python: 8,339; sh: 995; xml: 570; makefile: 251; awk: 51
file content (140 lines) | stat: -rw-r--r-- 5,344 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
// ==========================================================================
//                 SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2018, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of Knut Reinert or the FU Berlin nor the names of
//       its contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL KNUT REINERT OR THE FU BERLIN BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// ==========================================================================
// Author: Rene Rahn <rene.rahn@fu-berlin.de>
// ==========================================================================
// Implements basic functors.
// ==========================================================================

#ifndef INCLUDE_SEQAN_MISC_BIT_TWIDDLING_FUNCTORS_H_
#define INCLUDE_SEQAN_MISC_BIT_TWIDDLING_FUNCTORS_H_

namespace seqan
{

// ============================================================================
// Forwards
// ============================================================================

// ============================================================================
// Tags, Classes, Enums
// ============================================================================

// ----------------------------------------------------------------------------
// Functor FunctorIdentity
// ----------------------------------------------------------------------------

struct FunctorIdentity
{
    template <typename TValue>
    inline TValue const & operator()(TValue const & val) const
    {
        return val;
    }
};

// ----------------------------------------------------------------------------
// Functor FunctorBitwiseAnd
// ----------------------------------------------------------------------------

struct FunctorBitwiseAnd
{
    template<typename TValue>
    inline TValue operator()(TValue const & valLhs, TValue const & valRhs) const
    {
        return valLhs & valRhs;
    }
};

// ----------------------------------------------------------------------------
// Functor FunctorBitwiseOr
// ----------------------------------------------------------------------------

struct FunctorBitwiseOr
{
    template <typename TValue>
    inline TValue operator()(TValue const & valLhs, TValue const & valRhs) const
    {
        return valLhs | valRhs;
    }
};

// ----------------------------------------------------------------------------
// Functor FunctorBitwiseXor
// ----------------------------------------------------------------------------

struct FunctorBitwiseXor
{
    template <typename TValue>
    inline TValue operator()(TValue const & valLhs, TValue const & valRhs) const
    {
        return valLhs ^ valRhs;
    }
};

// ----------------------------------------------------------------------------
// Functor FunctorBitwiseNot
// ----------------------------------------------------------------------------

struct FunctorBitwiseNot
{
    template <typename TValue>
    inline TValue operator()(TValue const & val) const
    {
        return ~val;
    }
};

// ----------------------------------------------------------------------------
// Functor FunctorNested
// ----------------------------------------------------------------------------

template <typename TBinaryFunctor, typename TUnaryFunctor1, typename TUnaryFunctor2>
struct FunctorNested
{
    template <typename TValue>
    inline TValue operator()(TValue const & lhs, TValue const & rhs) const
    {
        return TBinaryFunctor()(TUnaryFunctor1()(lhs), TUnaryFunctor2()(rhs));
    }
};

// ============================================================================
// Metafunctions
// ============================================================================

// ============================================================================
// Functions
// ============================================================================

}

#endif // INCLUDE_SEQAN_MISC_BIT_TWIDDLING_FUNCTORS_H_