SortWordString.cpp

Go to the documentation of this file.

/*
 * This program 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.
 *
 * Written (W) 1999-2009 Soeren Sonnenburg
 * Copyright (C) 1999-2009 Fraunhofer Institute FIRST and Max-Planck-Society
 */

#include <shogun/preprocessor/SortWordString.h>
#include <shogun/features/Features.h>
#include <shogun/features/StringFeatures.h>
#include <shogun/mathematics/Math.h>

using namespace shogun;

CSortWordString::CSortWordString()
: CStringPreprocessor<uint16_t>()
{
}

CSortWordString::~CSortWordString()
{
}

bool CSortWordString::init(CFeatures* f)
{
    ASSERT(f->get_feature_class()==C_STRING);
    ASSERT(f->get_feature_type()==F_WORD);

    return true;
}

void CSortWordString::cleanup()
{
}

bool CSortWordString::load(FILE* f)
{
    SG_SET_LOCALE_C;
    SG_RESET_LOCALE;
    return false;
}

bool CSortWordString::save(FILE* f)
{
    SG_SET_LOCALE_C;
    SG_RESET_LOCALE;
    return false;
}

bool CSortWordString::apply_to_string_features(CFeatures* f)
{
    int32_t i;
    int32_t num_vec=((CStringFeatures<uint16_t>*)f)->get_num_vectors() ;
    
    for (i=0; i<num_vec; i++)
    {
        int32_t len = 0 ;
        bool free_vec;
        uint16_t* vec = ((CStringFeatures<uint16_t>*)f)->get_feature_vector(i, len, free_vec);
        ASSERT(!free_vec); // won't work with non-in-memory string features
        
        //CMath::qsort(vec, len);
        CMath::radix_sort(vec, len);

    }
    return true ;
}

uint16_t* CSortWordString::apply_to_string(uint16_t* f, int32_t& len)
{
    uint16_t* vec=SG_MALLOC(uint16_t, len);
    int32_t i=0;

    for (i=0; i<len; i++)
        vec[i]=f[i];

    //CMath::qsort(vec, len);
    CMath::radix_sort(vec, len);

    return vec;
}