/* * This file Copyright (C) Mnemosyne LLC * * This file is licensed by the GPL version 2. Works owned by the * Transmission project are granted a special exemption to clause 2(b) * so that the bulk of its code can remain under the MIT license. * This exemption does not extend to derived works not owned by * the Transmission project. * * $Id$ */ #include "transmission.h" #include "bitset.h" void tr_bitsetConstructor( tr_bitset * b, size_t size ) { tr_bitfieldConstruct( &b->bitfield, size ); } void tr_bitsetDestructor( tr_bitset * b ) { tr_bitfieldDestruct( &b->bitfield ); } void tr_bitsetReserve( tr_bitset * b, size_t size ) { if( b->bitfield.bitCount < size ) { tr_bitfield * tmp = tr_bitfieldDup( &b->bitfield ); tr_bitfieldDestruct( &b->bitfield ); tr_bitfieldConstruct( &b->bitfield, size ); if( ( tmp->bits != NULL ) && ( tmp->byteCount > 0 ) ) memcpy( b->bitfield.bits, tmp->bits, tmp->byteCount ); tr_bitfieldFree( tmp ); } } tr_bool tr_bitsetHas( const tr_bitset * b, const size_t nth ) { if( b->haveAll ) return TRUE; if( b->haveNone ) return FALSE; if( nth >= b->bitfield.bitCount ) return FALSE; return tr_bitfieldHas( &b->bitfield, nth ); } void tr_bitsetOr( tr_bitfield * a, const tr_bitset * b ) { if( b->haveAll ) tr_bitfieldAddRange( a, 0, a->bitCount ); else if( !b->haveNone ) tr_bitfieldOr( a, &b->bitfield ); } double tr_bitsetPercent( const tr_bitset * b ) { if( b->haveAll ) return 1.0; if( b->haveNone ) return 0.0; if( b->bitfield.bitCount == 0 ) return 0.0; return tr_bitfieldCountTrueBits( &b->bitfield ) / (double)b->bitfield.bitCount; } void tr_bitsetSetHaveAll( tr_bitset * b ) { b->haveAll = 1; b->haveNone = 0; } void tr_bitsetSetHaveNone( tr_bitset * b ) { b->haveAll = 0; b->haveNone = 1; } int tr_bitsetAdd( tr_bitset * b, size_t i ) { int ret = 0; if( !b->haveAll ) { b->haveNone = 0; tr_bitsetReserve( b, i+1 ); ret = tr_bitfieldAdd( &b->bitfield, i ); } return ret; }