/Users/dbr/ma/src/bas/lml/cmd/cmdReverseAndSort.c

Go to the documentation of this file.

#include "../base.h"

#define mLinesGetLinesStored( object ) ( (object)->offsets->seqStored )
#define mLinesGet( object, n ) ( (object)->lines->seq + ((object)->offsets->seq[(n)]*(object)->lines->elementSize) )
#define mLinesGetLength( object, n ) ( (object)->lengths->seq[(n)] )
#define mLinesGetSymbol( object, n, pos ) ( mLinesGet( object, n ) + ((pos)*(object)->lines->elementSize) )

typedef struct tLines{
    VoidSequence * lines;
    UINTSequence * offsets;
    UINTSequence * lengths;
} Lines;

static Lines * LinesInit( UINT symbolSize ){
    Lines * lines;

    lines = Malloc( 1, sizeof(Lines) );
    lines->lines = VoidSequenceInit( symbolSize );
    lines->offsets = UINTSequenceInit();
    lines->lengths = UINTSequenceInit();
    return lines;
}

static void LinesFree( Lines * lines ){
    VoidSequenceFree( lines->lines );
    UINTSequenceFree( lines->offsets );
    UINTSequenceFree( lines->lengths );
    Free( lines );
}

static void LinesAdd( Lines * lines, const VoidSequence * line ){
    UINTSequenceAdd( lines->offsets, lines->lines->seqStored );
    UINTSequenceAdd( lines->lengths, line->seqStored );
    VoidSequenceAppend( lines->lines, line );
}

static void LinesReverseAll( Lines * lines ){
    UINT i, n, symbolSize;

    symbolSize = lines->lines->elementSize;
    for( n = 0; n < mLinesGetLinesStored(lines); n++ ){
        for( i = 0; i < mLinesGetLength(lines, n)/2; i++ ){
            SwapSymbols( mLinesGetSymbol(lines, n, i), mLinesGetSymbol(lines, n, mLinesGetLength(lines, n) - 1 - i), symbolSize );
        }
    }
}

static SINT Cmp( void * ptr, UINT l1, UINT l2 ){
    UINT symbolSize, m, i;
    Lines * lines;
    SINT r;

    lines = (Lines *)(ptr);
    symbolSize = lines->lines->elementSize;
    m = mMIN( mLinesGetLength(lines, l1), mLinesGetLength(lines, l2) );
    for( i = 0; i < m; i++ ){
        r = CmpSymbols( mLinesGetSymbol(lines, l1, i), mLinesGetSymbol(lines, l2, i), symbolSize );
        if( r != 0 ){
            return r;
        }
    }
    if( mLinesGetLength(lines, l1) == mLinesGetLength(lines, l2) ){
        return 0;
    }
    if( mLinesGetLength(lines, l1) < mLinesGetLength(lines, l2) ){
        return -1;
    }
    return 1;
}

static void Swap( void * ptr, UINT l1, UINT l2 ){
    Lines * lines;
    UINT tmp;

    lines = (Lines *)(ptr);
    mSwapVariables( lines->offsets->seq[l1], lines->offsets->seq[l2], tmp );
    mSwapVariables( lines->lengths->seq[l1], lines->lengths->seq[l2], tmp );
}

static void LinesSort( Lines * lines ){
    Sort( lines, mLinesGetLinesStored(lines), Cmp, Swap );
}

static void Print( Lines * lines, UINT n, FILE * fp, UINT encoding ){
    UINT i;
    UINT symbolSize;

    symbolSize = lines->lines->elementSize;
    for( i = 0; i < mLinesGetLength(lines, n); i++ ){
        PrintSymbol( mLinesGetSymbol(lines, n, i), fp, symbolSize, encoding );
    }
    PrintLine( fp, symbolSize, encoding );
}

void CmdReverseAndSort( const S8 * fileNameInput, const S8 * fileNameOutput, UINT bitsPerSymbol, UINT encoding ){
    FILE * fpInput;
    FILE * fpOutput;
    Lines * lines;
    VoidSequence * line = NULL;
    UINT i, symbolSize;

    mValidateBitsPerSymbol( bitsPerSymbol )
    symbolSize = bitsPerSymbol/8;
    lines = LinesInit( symbolSize );
    fpInput = Fopen( fileNameInput, "rb" );
    while( bTRUE ){
        if( line != NULL ){
            VoidSequenceFree( line );
        }
        line = VoidSequenceReadLine( fpInput, symbolSize, encoding );
        if( line == NULL ){
            break;
        }
        LinesAdd( lines, line );
    }
    Fclose( fpInput );
    LinesReverseAll( lines );
    LinesSort( lines );
    fpOutput = Fopen( fileNameOutput, "wb" );
    if( mLinesGetLinesStored(lines) > 0 ){
        Print( lines, 0, fpOutput, encoding );
        for( i = 1; i < mLinesGetLinesStored(lines); i++ ){
            if( Cmp( lines, i, i-1 ) != 0 ){
                Print( lines, i, fpOutput, encoding );
            }
        }
    }
    Fclose( fpOutput );
    LinesFree( lines );
}