| /* |
| * 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. Oracle designates this |
| * particular file as subject to the "Classpath" exception as provided |
| * by Oracle 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| * or visit www.oracle.com if you need additional information or have any |
| * questions. |
| * |
| */ |
| |
| /* |
| ********************************************************************** |
| * Copyright (C) 1998-2008, International Business Machines |
| * Corporation and others. All Rights Reserved. |
| ********************************************************************** |
| */ |
| |
| #include "LETypes.h" |
| #include "LEInsertionList.h" |
| |
| U_NAMESPACE_BEGIN |
| |
| #define ANY_NUMBER 1 |
| |
| struct InsertionRecord |
| { |
| InsertionRecord *next; |
| le_int32 position; |
| le_int32 count; |
| LEGlyphID glyphs[ANY_NUMBER]; |
| }; |
| |
| UOBJECT_DEFINE_RTTI_IMPLEMENTATION(LEInsertionList) |
| |
| 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, LEErrorCode &success) |
| { |
| if (LE_FAILURE(success)) { |
| return 0; |
| } |
| |
| InsertionRecord *insertion = (InsertionRecord *) LE_NEW_ARRAY(char, sizeof(InsertionRecord) + (count - ANY_NUMBER) * sizeof (LEGlyphID)); |
| if (insertion == NULL) { |
| success = LE_MEMORY_ALLOCATION_ERROR; |
| return 0; |
| } |
| |
| 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; |
| } |
| |
| U_NAMESPACE_END |