BitSetIndex.h

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <ext/iostream>
 
#include <alib/map>
#include <alib/set>
#include <alib/string>
#include <alib/bitset>
 
#include <common/DefaultSymbolType.h>
 
#include <core/components.hpp>
#include <exception/CommonException.h>
 
#include <alphabet/common/SymbolNormalize.h>
 
#include <string/LinearString.h>
 
namespace indexes {
 
namespace stringology {
 
class GeneralAlphabet;
 
template < class SymbolType = DefaultSymbolType, size_t BitmaskBitCount = 64 >
class BitSetIndex final : public core::Components < BitSetIndex < SymbolType >, ext::set < SymbolType >, component::Set, GeneralAlphabet > {
    ext::map < SymbolType, ext::bitset < BitmaskBitCount > > m_vectors;
 
    string::LinearString < SymbolType > m_string;
 
public:
    explicit BitSetIndex ( ext::map < SymbolType, ext::bitset < BitmaskBitCount > > vectors, string::LinearString < SymbolType > string );
 
    const ext::map < SymbolType, ext::bitset < BitmaskBitCount > > & getData ( ) const &;
 
    ext::map < SymbolType, ext::bitset < BitmaskBitCount > > && getData ( ) &&;
 
    const string::LinearString < SymbolType > & getString ( ) const &;
 
    string::LinearString < SymbolType > && getString ( ) &&;
 
    const ext::set < SymbolType > & getAlphabet ( ) const & {
        return m_string.getAlphabet ( );
    }
 
    ext::set < SymbolType > && getAlphabet ( ) && {
        return m_string.getAlphabet ( );
    }
 
    void setBitVectorForSymbol ( SymbolType symbol, ext::bitset < BitmaskBitCount > data );
 
    bool removeSymbolFromAlphabet ( const SymbolType & symbol ) {
        return m_string.removeSymbol ( symbol );
    }
 
    auto operator <=> ( const BitSetIndex & other ) const {
        return std::tie ( getData ( ), getAlphabet ( ) ) <=> std::tie ( other.getData ( ), other.getAlphabet ( ) );
    }
 
    bool operator == ( const BitSetIndex & other ) const {
        return std::tie ( getData ( ), getAlphabet ( ) ) == std::tie ( other.getData ( ), other.getAlphabet ( ) );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const BitSetIndex & instance ) {
        return out << "(BitSetIndex " << instance.m_vectors << ")";
    }
};
 
} /* namespace stringology */
 
} /* namespace indexes */
 
namespace indexes {
 
namespace stringology {
 
template < class SymbolType, size_t BitmaskBitCount >
BitSetIndex < SymbolType, BitmaskBitCount >::BitSetIndex ( ext::map < SymbolType, ext::bitset < BitmaskBitCount > > vectors, string::LinearString < SymbolType > string ) : m_vectors ( std::move ( vectors ) ), m_string ( std::move ( string ) ) {
}
 
template < class SymbolType, size_t BitmaskBitCount >
const ext::map < SymbolType, ext::bitset < BitmaskBitCount > > & BitSetIndex < SymbolType, BitmaskBitCount >::getData ( ) const & {
    return m_vectors;
}
 
template < class SymbolType, size_t BitmaskBitCount >
ext::map < SymbolType, ext::bitset < BitmaskBitCount > > && BitSetIndex < SymbolType, BitmaskBitCount >::getData ( ) && {
    return std::move ( m_vectors );
}
 
template < class SymbolType, size_t BitmaskBitCount >
const string::LinearString < SymbolType > & BitSetIndex < SymbolType, BitmaskBitCount >::getString ( ) const & {
    return m_string;
}
 
template < class SymbolType, size_t BitmaskBitCount >
string::LinearString < SymbolType > && BitSetIndex < SymbolType, BitmaskBitCount >::getString ( ) && {
    return std::move ( m_string );
}
 
template < class SymbolType, size_t BitmaskBitCount >
void BitSetIndex < SymbolType, BitmaskBitCount >::setBitVectorForSymbol ( SymbolType symbol, ext::bitset < BitmaskBitCount > data ) {
    this->m_vectors [ symbol ] = std::move ( data );
}
 
} /* namespace stringology */
 
} /* namespace indexes */
 
namespace core {
 
template < class SymbolType, size_t BitmaskBitCount >
struct normalize < indexes::stringology::BitSetIndex < SymbolType, BitmaskBitCount > > {
    static indexes::stringology::BitSetIndex < DefaultSymbolType, BitmaskBitCount > eval ( indexes::stringology::BitSetIndex < SymbolType, BitmaskBitCount > && value ) {
        ext::map < DefaultSymbolType, ext::bitset < BitmaskBitCount > > vectors;
        for ( std::pair < SymbolType, ext::bitset < BitmaskBitCount > > && vector : ext::make_mover ( std::move ( value ).getData ( ) ) )
            vectors.insert ( std::make_pair ( alphabet::SymbolNormalize::normalizeSymbol ( std::move ( vector.first ) ), std::move ( vector.second ) ) );
 
        string::LinearString < DefaultSymbolType > string = normalize < string::LinearString < SymbolType > >::eval ( std::move ( value ).getString ( ) );
 
        return indexes::stringology::BitSetIndex < DefaultSymbolType, BitmaskBitCount > ( std::move ( vectors ), std::move ( string ) );
    }
};
 
} /* namespace core */