---

HxIndxArray.h

/*
 *  Copyright (c) 2000, University of Amsterdam, The Netherlands.
 *  All rights reserved.
 *
 *  Author(s):
 *  Jan-Mark Geusebroek (mark@wins.uva.nl)
 *
 */

#ifndef HxIndxArray_H
#define HxIndxArray_H

#include <stdio.h>
#include <list>
#include "HxMatrix.h"


template<class ArrayT, class HeaderT>
class indexedArray {
public:
    indexedArray();
    ~indexedArray();

    void open(HxString indexFile, int norm = 0);
    void append(HxString indexFile);
    void create(HxString indexFile);
    void setHeader(HeaderT& header)
        {_header = header;}
        // should be called after create, before the first add

    HeaderT     header() const {return _header;}

    int         size() const {return _key.size();}

    virtual int arraySize(const HeaderT& header) const = 0;
    virtual double compare(ArrayT *e1, ArrayT *e2,
        const HeaderT& header) const = 0;

    void        add(HxString& key, ArrayT *data);

    void        random(int n);
    void        search(ArrayT *target, int n, int refine = 0);
    HxString    nearest(int n) const;
    double      score(int n) const;
    ArrayT*     nearestData(int n) const;

    HxMatrix    similarity() const;
    STD_OSTREAM& put(STD_OSTREAM& os) const;

    void        import(STD_ISTREAM& is);

    friend STD_OSTREAM& operator<<(STD_OSTREAM& os,
            const indexedArray<ArrayT, HeaderT>& l)
                {return l.put(os);}


private:
    HeaderT     _header;
    HxString     _fileName;

    FILE        *_fp;
    char        *_mem;

    int         _arraySize;

    std::list<ArrayT*>   _arrays;
    std::list<char*>        _key;

    double      *_nearval;
    char        **_nearkey;
    ArrayT      **_neardata;

    int         _normalize;
    ArrayT      *_minVal;
    ArrayT      *_normVal;
};

#ifdef INC_TEMPLATE_SRC
#include "HxIndxArray.c"
#endif

#endif

---