/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.  Sun designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Sun in the LICENSE file that accompanied this code.

 *

 * This code 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

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

 * CA 95054 USA or visit www.sun.com if you need additional information or

 * have any questions.

 *

 */

/*

 *

 **********************************************************************

 *   Copyright (C) 1998-2004, International Business Machines

 *   Corporation and others.  All Rights Reserved.

 **********************************************************************

 */

#include "LETypes.h"

#include "LEInsertionList.h"

#define ANY_NUMBER 1

struct InsertionRecord

{

    InsertionRecord *next;

    le_int32 position;

    le_int32 count;

    LEGlyphID glyphs[ANY_NUMBER];

};

LEInsertionList::LEInsertionList(le_bool rightToLeft)

: head(NULL), tail(NULL), growAmount(0), append(rightToLeft)

{

    tail = (InsertionRecord *) &head;

}

LEInsertionList::~LEInsertionList()

{

    reset();

}

void LEInsertionList::reset()

{

    while (head != NULL) {

        InsertionRecord *record = head;

        head = head->next;

        LE_DELETE_ARRAY(record);

    }

    tail = (InsertionRecord *) &head;

    growAmount = 0;

}

le_int32 LEInsertionList::getGrowAmount()

{

    return growAmount;

}

LEGlyphID *LEInsertionList::insert(le_int32 position, le_int32 count)

{

    InsertionRecord *insertion = (InsertionRecord *) LE_NEW_ARRAY(char, sizeof(InsertionRecord) + (count - ANY_NUMBER) * sizeof (LEGlyphID));

    insertion->position = position;

    insertion->count = count;

    growAmount += count - 1;

    if (append) {

        // insert on end of list...

        insertion->next = NULL;

        tail->next = insertion;

        tail = insertion;

    } else {

        // insert on front of list...

        insertion->next = head;

        head = insertion;

    }

    return insertion->glyphs;

}

le_bool LEInsertionList::applyInsertions(LEInsertionCallback *callback)

{

    for (InsertionRecord *rec = head; rec != NULL; rec = rec->next) {

        if (callback->applyInsertion(rec->position, rec->count, rec->glyphs)) {

            return TRUE;

        }

    }

    return FALSE;

}