[apple/icu.git] / icuSources / layout / IndicRearrangementProcessor.cpp

/*
 *
 * (C) Copyright IBM Corp. 1998-2015 - All Rights Reserved
 *
 */

#include "LETypes.h"
#include "MorphTables.h"
#include "StateTables.h"
#include "MorphStateTables.h"
#include "SubtableProcessor.h"
#include "StateTableProcessor.h"
#include "IndicRearrangementProcessor.h"
#include "LEGlyphStorage.h"
#include "LESwaps.h"

U_NAMESPACE_BEGIN

UOBJECT_DEFINE_RTTI_IMPLEMENTATION(IndicRearrangementProcessor)

  IndicRearrangementProcessor::IndicRearrangementProcessor(const LEReferenceTo<MorphSubtableHeader> &morphSubtableHeader, LEErrorCode &success)
  : StateTableProcessor(morphSubtableHeader, success), 
  indicRearrangementSubtableHeader(morphSubtableHeader, success),
  entryTable(stateTableHeader, success, (const IndicRearrangementStateEntry*)(&stateTableHeader->stHeader),
             entryTableOffset, LE_UNBOUNDED_ARRAY),
  int16Table(stateTableHeader, success, (const le_int16*)entryTable.getAlias(), 0, LE_UNBOUNDED_ARRAY)
  
{
}

IndicRearrangementProcessor::~IndicRearrangementProcessor()
{
}

void IndicRearrangementProcessor::beginStateTable()
{
    firstGlyph = 0;
    lastGlyph = 0;
}

ByteOffset IndicRearrangementProcessor::processStateEntry(LEGlyphStorage &glyphStorage, le_int32 &currGlyph, EntryTableIndex index)
{
  LEErrorCode success = LE_NO_ERROR; // todo- make a param?
  const IndicRearrangementStateEntry *entry = entryTable.getAlias(index,success);
    ByteOffset newState = SWAPW(entry->newStateOffset);
    IndicRearrangementFlags flags = (IndicRearrangementFlags) SWAPW(entry->flags);

    if (flags & irfMarkFirst) {
        firstGlyph = (le_uint32)currGlyph;
    }

    if (flags & irfMarkLast) {
        lastGlyph = (le_uint32)currGlyph;
    }

    doRearrangementAction(glyphStorage, (IndicRearrangementVerb) (flags & irfVerbMask), success);

    if (!(flags & irfDontAdvance)) {
        // XXX: Should handle reverse too...
        currGlyph += 1;
    }

    return newState;
}

void IndicRearrangementProcessor::endStateTable()
{
}

void IndicRearrangementProcessor::doRearrangementAction(LEGlyphStorage &glyphStorage, IndicRearrangementVerb verb, LEErrorCode &success) const
{
    LEGlyphID a, b, c, d;
    le_int32 ia, ib, ic, id, ix, x;

    if (LE_FAILURE(success)) return;

    if (verb == irvNoAction) {
        return;
    }
    if (firstGlyph > lastGlyph) {
        success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
        return;
    }

    switch(verb)
    {
    case irvxA:
        if (firstGlyph == lastGlyph) break;
        if (firstGlyph + 1 < firstGlyph) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
        break;
        }
        a = glyphStorage[firstGlyph];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        x = firstGlyph + 1;

        while (x <= lastGlyph) {
            glyphStorage[x - 1] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x - 1, ix, success);
            x += 1;
        }

        glyphStorage[lastGlyph] = a;
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break;

    case irvDx:
        if (firstGlyph == lastGlyph) break;
        if (lastGlyph - 1 > lastGlyph) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        d = glyphStorage[lastGlyph];
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = lastGlyph - 1;

        while (x >= firstGlyph) {
            glyphStorage[x + 1] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x + 1, ix, success);
            x -= 1;
        }

        glyphStorage[firstGlyph] = d;
        glyphStorage.setCharIndex(firstGlyph, id, success);
        break;

    case irvDxA:
        a = glyphStorage[firstGlyph];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        id = glyphStorage.getCharIndex(lastGlyph,  success);

        glyphStorage[firstGlyph] = glyphStorage[lastGlyph];
        glyphStorage[lastGlyph] = a;

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(lastGlyph,  ia, success);
        break;
        
    case irvxAB:
        if ((firstGlyph + 2 < firstGlyph) ||
            (lastGlyph - firstGlyph < 1)) { // difference == 1 is a no-op, < 1 is an error.
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        x = firstGlyph + 2;

        while (x <= lastGlyph) {
            glyphStorage[x - 2] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x - 2, ix, success);
            x += 1;
        }

        glyphStorage[lastGlyph - 1] = a;
        glyphStorage[lastGlyph] = b;

        glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
        glyphStorage.setCharIndex(lastGlyph, ib, success);
        break;

    case irvxBA:
        if ((firstGlyph + 2 < firstGlyph) ||
            (lastGlyph - firstGlyph < 1)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        x = firstGlyph + 2;

        while (x <= lastGlyph) {
            glyphStorage[x - 2] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x - 2, ix, success);
            x += 1;
        }

        glyphStorage[lastGlyph - 1] = b;
        glyphStorage[lastGlyph] = a;

        glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break;

    case irvCDx:
        if ((lastGlyph - 2 > lastGlyph) ||
            (lastGlyph - firstGlyph < 1)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        c = glyphStorage[lastGlyph - 1];
        d = glyphStorage[lastGlyph];
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = lastGlyph - 2;

        while (x >= firstGlyph) {
            glyphStorage[x + 2] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x + 2, ix, success);
            x -= 1;
        }
        
        glyphStorage[firstGlyph] = c;
        glyphStorage[firstGlyph + 1] = d;

        glyphStorage.setCharIndex(firstGlyph, ic, success);
        glyphStorage.setCharIndex(firstGlyph + 1, id, success);
        break; 

    case irvDCx:
        if ((lastGlyph - 2 > lastGlyph) ||
            (lastGlyph - firstGlyph < 1)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        c = glyphStorage[lastGlyph - 1];
        d = glyphStorage[lastGlyph];
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = lastGlyph - 2;

        while (x >= firstGlyph) {
            glyphStorage[x + 2] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x + 2, ix, success);
            x -= 1;
        }
        
        glyphStorage[firstGlyph] = d;
        glyphStorage[firstGlyph + 1] = c;

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
        break; 

    case irvCDxA:
        if ((lastGlyph - 2 > lastGlyph) ||
            (lastGlyph - firstGlyph < 2)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        c = glyphStorage[lastGlyph - 1];
        d = glyphStorage[lastGlyph];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = lastGlyph - 2;

        while (x > firstGlyph) {
            glyphStorage[x + 1] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x + 1, ix, success);
            x -= 1;
        }
        
        glyphStorage[firstGlyph] = c;
        glyphStorage[firstGlyph + 1] = d;
        glyphStorage[lastGlyph] = a;

        glyphStorage.setCharIndex(firstGlyph, ic, success);
        glyphStorage.setCharIndex(firstGlyph + 1, id, success);
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break; 

    case irvDCxA:
        if ((lastGlyph - 2 > lastGlyph) ||
            (lastGlyph - firstGlyph < 2)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        c = glyphStorage[lastGlyph - 1];
        d = glyphStorage[lastGlyph];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = lastGlyph - 2;

        while (x > firstGlyph) {
            glyphStorage[x + 1] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x + 1, ix, success);
            x -= 1;
        }
        
        glyphStorage[firstGlyph] = d;
        glyphStorage[firstGlyph + 1] = c;
        glyphStorage[lastGlyph] = a;

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break; 

    case irvDxAB:
        if ((firstGlyph + 2 < firstGlyph) ||
            (lastGlyph - firstGlyph < 2)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];
        d = glyphStorage[lastGlyph];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = firstGlyph + 2;

        while (x < lastGlyph) {
            glyphStorage[x - 2] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x - 2, ix, success);
            x += 1;
        }

        glyphStorage[firstGlyph] = d;
        glyphStorage[lastGlyph - 1] = a;
        glyphStorage[lastGlyph] = b;

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
        glyphStorage.setCharIndex(lastGlyph, ib, success);
        break;

    case irvDxBA:
        if ((firstGlyph + 2 < firstGlyph) ||
            (lastGlyph - firstGlyph < 2)) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];
        d = glyphStorage[lastGlyph];
        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);
        x = firstGlyph + 2;

        while (x < lastGlyph) {
            glyphStorage[x - 2] = glyphStorage[x];
            ix = glyphStorage.getCharIndex(x, success);
            glyphStorage.setCharIndex(x - 2, ix, success);
            x += 1;
        }

        glyphStorage[firstGlyph] = d;
        glyphStorage[lastGlyph - 1] = b;
        glyphStorage[lastGlyph] = a;

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break;

    case irvCDxAB:
        if (lastGlyph - firstGlyph < 3) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];

        glyphStorage[firstGlyph] = glyphStorage[lastGlyph - 1];
        glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph];

        glyphStorage[lastGlyph - 1] = a;
        glyphStorage[lastGlyph] = b;

        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);

        glyphStorage.setCharIndex(firstGlyph, ic, success);
        glyphStorage.setCharIndex(firstGlyph + 1, id, success);

        glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
        glyphStorage.setCharIndex(lastGlyph, ib, success);
        break;

    case irvCDxBA:
        if (lastGlyph - firstGlyph < 3) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];

        glyphStorage[firstGlyph] = glyphStorage[lastGlyph - 1];
        glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph];

        glyphStorage[lastGlyph - 1] = b;
        glyphStorage[lastGlyph] = a;

        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);

        glyphStorage.setCharIndex(firstGlyph, ic, success);
        glyphStorage.setCharIndex(firstGlyph + 1, id, success);

        glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break;

    case irvDCxAB:
        if (lastGlyph - firstGlyph < 3) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];

        glyphStorage[firstGlyph] = glyphStorage[lastGlyph];
        glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph - 1];

        glyphStorage[lastGlyph - 1] = a;
        glyphStorage[lastGlyph] = b;

        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(firstGlyph + 1, ic, success);

        glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
        glyphStorage.setCharIndex(lastGlyph, ib, success);
        break;

    case irvDCxBA:
        if (lastGlyph - firstGlyph < 3) {
            success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
            break;
        }
        a = glyphStorage[firstGlyph];
        b = glyphStorage[firstGlyph + 1];

        glyphStorage[firstGlyph] = glyphStorage[lastGlyph];
        glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph - 1];

        glyphStorage[lastGlyph - 1] = b;
        glyphStorage[lastGlyph] = a;

        ia = glyphStorage.getCharIndex(firstGlyph, success);
        ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
        ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
        id = glyphStorage.getCharIndex(lastGlyph, success);

        glyphStorage.setCharIndex(firstGlyph, id, success);
        glyphStorage.setCharIndex(firstGlyph + 1, ic, success);

        glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
        glyphStorage.setCharIndex(lastGlyph, ia, success);
        break;
    
    default:
        break;
    }
}

U_NAMESPACE_END
Commit	Line	Data
b75a7d8f	1	/*
b75a7d8f	2	*
2ca993e8	3	* (C) Copyright IBM Corp. 1998-2015 - All Rights Reserved
b75a7d8f A	4	*
	5	*/
	6
	7	#include "LETypes.h"
	8	#include "MorphTables.h"
	9	#include "StateTables.h"
	10	#include "MorphStateTables.h"
	11	#include "SubtableProcessor.h"
	12	#include "StateTableProcessor.h"
	13	#include "IndicRearrangementProcessor.h"
374ca955	14	#include "LEGlyphStorage.h"
b75a7d8f A	15	#include "LESwaps.h"
	16
	17	U_NAMESPACE_BEGIN
	18
374ca955	19	UOBJECT_DEFINE_RTTI_IMPLEMENTATION(IndicRearrangementProcessor)
b75a7d8f	20
57a6839d A	21	IndicRearrangementProcessor::IndicRearrangementProcessor(const LEReferenceTo<MorphSubtableHeader> &morphSubtableHeader, LEErrorCode &success)
	22	: StateTableProcessor(morphSubtableHeader, success),
	23	indicRearrangementSubtableHeader(morphSubtableHeader, success),
	24	entryTable(stateTableHeader, success, (const IndicRearrangementStateEntry*)(&stateTableHeader->stHeader),
	25	entryTableOffset, LE_UNBOUNDED_ARRAY),
	26	int16Table(stateTableHeader, success, (const le_int16*)entryTable.getAlias(), 0, LE_UNBOUNDED_ARRAY)
	27
b75a7d8f	28	{
b75a7d8f A	29	}
	30
	31	IndicRearrangementProcessor::~IndicRearrangementProcessor()
	32	{
	33	}
	34
	35	void IndicRearrangementProcessor::beginStateTable()
	36	{
	37	firstGlyph = 0;
	38	lastGlyph = 0;
	39	}
	40
374ca955	41	ByteOffset IndicRearrangementProcessor::processStateEntry(LEGlyphStorage &glyphStorage, le_int32 &currGlyph, EntryTableIndex index)
b75a7d8f	42	{
57a6839d A	43	LEErrorCode success = LE_NO_ERROR; // todo- make a param?
57a6839d A	44	const IndicRearrangementStateEntry *entry = entryTable.getAlias(index,success);
b75a7d8f A	45	ByteOffset newState = SWAPW(entry->newStateOffset);
	46	IndicRearrangementFlags flags = (IndicRearrangementFlags) SWAPW(entry->flags);
	47
	48	if (flags & irfMarkFirst) {
2ca993e8	49	firstGlyph = (le_uint32)currGlyph;
b75a7d8f A	50	}
	51
	52	if (flags & irfMarkLast) {
2ca993e8	53	lastGlyph = (le_uint32)currGlyph;
b75a7d8f A	54	}
b75a7d8f A	55
2ca993e8	56	doRearrangementAction(glyphStorage, (IndicRearrangementVerb) (flags & irfVerbMask), success);
b75a7d8f A	57
	58	if (!(flags & irfDontAdvance)) {
	59	// XXX: Should handle reverse too...
	60	currGlyph += 1;
	61	}
	62
	63	return newState;
	64	}
	65
	66	void IndicRearrangementProcessor::endStateTable()
	67	{
	68	}
	69
2ca993e8	70	void IndicRearrangementProcessor::doRearrangementAction(LEGlyphStorage &glyphStorage, IndicRearrangementVerb verb, LEErrorCode &success) const
b75a7d8f A	71	{
b75a7d8f A	72	LEGlyphID a, b, c, d;
374ca955	73	le_int32 ia, ib, ic, id, ix, x;
2ca993e8 A	74
	75	if (LE_FAILURE(success)) return;
	76
	77	if (verb == irvNoAction) {
	78	return;
	79	}
	80	if (firstGlyph > lastGlyph) {
	81	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	82	return;
	83	}
b75a7d8f A	84
	85	switch(verb)
	86	{
b75a7d8f	87	case irvxA:
2ca993e8 A	88	if (firstGlyph == lastGlyph) break;
	89	if (firstGlyph + 1 < firstGlyph) {
	90	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	91	break;
	92	}
374ca955 A	93	a = glyphStorage[firstGlyph];
374ca955 A	94	ia = glyphStorage.getCharIndex(firstGlyph, success);
b75a7d8f A	95	x = firstGlyph + 1;
	96
	97	while (x <= lastGlyph) {
374ca955 A	98	glyphStorage[x - 1] = glyphStorage[x];
	99	ix = glyphStorage.getCharIndex(x, success);
	100	glyphStorage.setCharIndex(x - 1, ix, success);
b75a7d8f A	101	x += 1;
	102	}
	103
374ca955 A	104	glyphStorage[lastGlyph] = a;
374ca955 A	105	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	106	break;
	107
	108	case irvDx:
2ca993e8 A	109	if (firstGlyph == lastGlyph) break;
	110	if (lastGlyph - 1 > lastGlyph) {
	111	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	112	break;
	113	}
374ca955 A	114	d = glyphStorage[lastGlyph];
374ca955 A	115	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	116	x = lastGlyph - 1;
	117
	118	while (x >= firstGlyph) {
374ca955 A	119	glyphStorage[x + 1] = glyphStorage[x];
	120	ix = glyphStorage.getCharIndex(x, success);
	121	glyphStorage.setCharIndex(x + 1, ix, success);
b75a7d8f A	122	x -= 1;
	123	}
	124
374ca955 A	125	glyphStorage[firstGlyph] = d;
374ca955 A	126	glyphStorage.setCharIndex(firstGlyph, id, success);
b75a7d8f A	127	break;
	128
	129	case irvDxA:
374ca955 A	130	a = glyphStorage[firstGlyph];
	131	ia = glyphStorage.getCharIndex(firstGlyph, success);
	132	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f	133
374ca955 A	134	glyphStorage[firstGlyph] = glyphStorage[lastGlyph];
374ca955 A	135	glyphStorage[lastGlyph] = a;
b75a7d8f	136
374ca955 A	137	glyphStorage.setCharIndex(firstGlyph, id, success);
374ca955 A	138	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	139	break;
	140
	141	case irvxAB:
2ca993e8 A	142	if ((firstGlyph + 2 < firstGlyph) \|\|
	143	(lastGlyph - firstGlyph < 1)) { // difference == 1 is a no-op, < 1 is an error.
	144	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	145	break;
	146	}
374ca955 A	147	a = glyphStorage[firstGlyph];
	148	b = glyphStorage[firstGlyph + 1];
	149	ia = glyphStorage.getCharIndex(firstGlyph, success);
	150	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
b75a7d8f A	151	x = firstGlyph + 2;
	152
	153	while (x <= lastGlyph) {
374ca955 A	154	glyphStorage[x - 2] = glyphStorage[x];
	155	ix = glyphStorage.getCharIndex(x, success);
	156	glyphStorage.setCharIndex(x - 2, ix, success);
b75a7d8f A	157	x += 1;
	158	}
	159
374ca955 A	160	glyphStorage[lastGlyph - 1] = a;
374ca955 A	161	glyphStorage[lastGlyph] = b;
b75a7d8f	162
374ca955 A	163	glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
374ca955 A	164	glyphStorage.setCharIndex(lastGlyph, ib, success);
b75a7d8f A	165	break;
	166
	167	case irvxBA:
2ca993e8 A	168	if ((firstGlyph + 2 < firstGlyph) \|\|
	169	(lastGlyph - firstGlyph < 1)) {
	170	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	171	break;
	172	}
374ca955 A	173	a = glyphStorage[firstGlyph];
	174	b = glyphStorage[firstGlyph + 1];
	175	ia = glyphStorage.getCharIndex(firstGlyph, success);
	176	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
b75a7d8f A	177	x = firstGlyph + 2;
	178
	179	while (x <= lastGlyph) {
374ca955 A	180	glyphStorage[x - 2] = glyphStorage[x];
	181	ix = glyphStorage.getCharIndex(x, success);
	182	glyphStorage.setCharIndex(x - 2, ix, success);
b75a7d8f A	183	x += 1;
	184	}
	185
374ca955 A	186	glyphStorage[lastGlyph - 1] = b;
374ca955 A	187	glyphStorage[lastGlyph] = a;
b75a7d8f	188
374ca955 A	189	glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
374ca955 A	190	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	191	break;
	192
	193	case irvCDx:
2ca993e8 A	194	if ((lastGlyph - 2 > lastGlyph) \|\|
	195	(lastGlyph - firstGlyph < 1)) {
	196	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	197	break;
	198	}
374ca955 A	199	c = glyphStorage[lastGlyph - 1];
	200	d = glyphStorage[lastGlyph];
	201	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	202	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	203	x = lastGlyph - 2;
b75a7d8f A	204
374ca955 A	205	while (x >= firstGlyph) {
	206	glyphStorage[x + 2] = glyphStorage[x];
	207	ix = glyphStorage.getCharIndex(x, success);
	208	glyphStorage.setCharIndex(x + 2, ix, success);
b75a7d8f A	209	x -= 1;
	210	}
	211
374ca955 A	212	glyphStorage[firstGlyph] = c;
374ca955 A	213	glyphStorage[firstGlyph + 1] = d;
b75a7d8f	214
374ca955 A	215	glyphStorage.setCharIndex(firstGlyph, ic, success);
374ca955 A	216	glyphStorage.setCharIndex(firstGlyph + 1, id, success);
b75a7d8f A	217	break;
	218
	219	case irvDCx:
2ca993e8 A	220	if ((lastGlyph - 2 > lastGlyph) \|\|
	221	(lastGlyph - firstGlyph < 1)) {
	222	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	223	break;
	224	}
374ca955 A	225	c = glyphStorage[lastGlyph - 1];
	226	d = glyphStorage[lastGlyph];
	227	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	228	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	229	x = lastGlyph - 2;
b75a7d8f A	230
374ca955 A	231	while (x >= firstGlyph) {
	232	glyphStorage[x + 2] = glyphStorage[x];
	233	ix = glyphStorage.getCharIndex(x, success);
	234	glyphStorage.setCharIndex(x + 2, ix, success);
b75a7d8f A	235	x -= 1;
	236	}
	237
374ca955 A	238	glyphStorage[firstGlyph] = d;
374ca955 A	239	glyphStorage[firstGlyph + 1] = c;
b75a7d8f	240
374ca955 A	241	glyphStorage.setCharIndex(firstGlyph, id, success);
374ca955 A	242	glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
b75a7d8f A	243	break;
	244
	245	case irvCDxA:
2ca993e8 A	246	if ((lastGlyph - 2 > lastGlyph) \|\|
	247	(lastGlyph - firstGlyph < 2)) {
	248	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	249	break;
	250	}
374ca955 A	251	a = glyphStorage[firstGlyph];
	252	c = glyphStorage[lastGlyph - 1];
	253	d = glyphStorage[lastGlyph];
	254	ia = glyphStorage.getCharIndex(firstGlyph, success);
	255	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	256	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	257	x = lastGlyph - 2;
	258
	259	while (x > firstGlyph) {
374ca955 A	260	glyphStorage[x + 1] = glyphStorage[x];
	261	ix = glyphStorage.getCharIndex(x, success);
	262	glyphStorage.setCharIndex(x + 1, ix, success);
b75a7d8f A	263	x -= 1;
	264	}
	265
374ca955 A	266	glyphStorage[firstGlyph] = c;
	267	glyphStorage[firstGlyph + 1] = d;
	268	glyphStorage[lastGlyph] = a;
b75a7d8f	269
374ca955 A	270	glyphStorage.setCharIndex(firstGlyph, ic, success);
	271	glyphStorage.setCharIndex(firstGlyph + 1, id, success);
	272	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	273	break;
	274
	275	case irvDCxA:
2ca993e8 A	276	if ((lastGlyph - 2 > lastGlyph) \|\|
	277	(lastGlyph - firstGlyph < 2)) {
	278	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	279	break;
	280	}
374ca955 A	281	a = glyphStorage[firstGlyph];
	282	c = glyphStorage[lastGlyph - 1];
	283	d = glyphStorage[lastGlyph];
	284	ia = glyphStorage.getCharIndex(firstGlyph, success);
	285	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	286	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	287	x = lastGlyph - 2;
	288
	289	while (x > firstGlyph) {
374ca955 A	290	glyphStorage[x + 1] = glyphStorage[x];
	291	ix = glyphStorage.getCharIndex(x, success);
	292	glyphStorage.setCharIndex(x + 1, ix, success);
b75a7d8f A	293	x -= 1;
	294	}
	295
374ca955 A	296	glyphStorage[firstGlyph] = d;
	297	glyphStorage[firstGlyph + 1] = c;
	298	glyphStorage[lastGlyph] = a;
b75a7d8f	299
374ca955 A	300	glyphStorage.setCharIndex(firstGlyph, id, success);
	301	glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
	302	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	303	break;
	304
	305	case irvDxAB:
2ca993e8 A	306	if ((firstGlyph + 2 < firstGlyph) \|\|
	307	(lastGlyph - firstGlyph < 2)) {
	308	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	309	break;
	310	}
374ca955 A	311	a = glyphStorage[firstGlyph];
	312	b = glyphStorage[firstGlyph + 1];
	313	d = glyphStorage[lastGlyph];
	314	ia = glyphStorage.getCharIndex(firstGlyph, success);
	315	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
	316	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	317	x = firstGlyph + 2;
	318
	319	while (x < lastGlyph) {
374ca955 A	320	glyphStorage[x - 2] = glyphStorage[x];
	321	ix = glyphStorage.getCharIndex(x, success);
	322	glyphStorage.setCharIndex(x - 2, ix, success);
b75a7d8f A	323	x += 1;
	324	}
	325
374ca955 A	326	glyphStorage[firstGlyph] = d;
	327	glyphStorage[lastGlyph - 1] = a;
	328	glyphStorage[lastGlyph] = b;
b75a7d8f	329
374ca955 A	330	glyphStorage.setCharIndex(firstGlyph, id, success);
	331	glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
	332	glyphStorage.setCharIndex(lastGlyph, ib, success);
b75a7d8f A	333	break;
	334
	335	case irvDxBA:
2ca993e8 A	336	if ((firstGlyph + 2 < firstGlyph) \|\|
	337	(lastGlyph - firstGlyph < 2)) {
	338	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	339	break;
	340	}
374ca955 A	341	a = glyphStorage[firstGlyph];
	342	b = glyphStorage[firstGlyph + 1];
	343	d = glyphStorage[lastGlyph];
	344	ia = glyphStorage.getCharIndex(firstGlyph, success);
	345	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
	346	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f A	347	x = firstGlyph + 2;
	348
	349	while (x < lastGlyph) {
374ca955 A	350	glyphStorage[x - 2] = glyphStorage[x];
	351	ix = glyphStorage.getCharIndex(x, success);
	352	glyphStorage.setCharIndex(x - 2, ix, success);
b75a7d8f A	353	x += 1;
	354	}
	355
374ca955 A	356	glyphStorage[firstGlyph] = d;
	357	glyphStorage[lastGlyph - 1] = b;
	358	glyphStorage[lastGlyph] = a;
b75a7d8f	359
374ca955 A	360	glyphStorage.setCharIndex(firstGlyph, id, success);
	361	glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
	362	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	363	break;
	364
	365	case irvCDxAB:
2ca993e8 A	366	if (lastGlyph - firstGlyph < 3) {
	367	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	368	break;
	369	}
374ca955 A	370	a = glyphStorage[firstGlyph];
374ca955 A	371	b = glyphStorage[firstGlyph + 1];
b75a7d8f	372
374ca955 A	373	glyphStorage[firstGlyph] = glyphStorage[lastGlyph - 1];
374ca955 A	374	glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph];
b75a7d8f	375
374ca955 A	376	glyphStorage[lastGlyph - 1] = a;
374ca955 A	377	glyphStorage[lastGlyph] = b;
b75a7d8f	378
374ca955 A	379	ia = glyphStorage.getCharIndex(firstGlyph, success);
	380	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
	381	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	382	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f	383
374ca955 A	384	glyphStorage.setCharIndex(firstGlyph, ic, success);
374ca955 A	385	glyphStorage.setCharIndex(firstGlyph + 1, id, success);
b75a7d8f	386
374ca955 A	387	glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
374ca955 A	388	glyphStorage.setCharIndex(lastGlyph, ib, success);
b75a7d8f A	389	break;
	390
	391	case irvCDxBA:
2ca993e8 A	392	if (lastGlyph - firstGlyph < 3) {
	393	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	394	break;
	395	}
374ca955 A	396	a = glyphStorage[firstGlyph];
374ca955 A	397	b = glyphStorage[firstGlyph + 1];
b75a7d8f	398
374ca955 A	399	glyphStorage[firstGlyph] = glyphStorage[lastGlyph - 1];
374ca955 A	400	glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph];
b75a7d8f	401
374ca955 A	402	glyphStorage[lastGlyph - 1] = b;
374ca955 A	403	glyphStorage[lastGlyph] = a;
b75a7d8f	404
374ca955 A	405	ia = glyphStorage.getCharIndex(firstGlyph, success);
	406	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
	407	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	408	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f	409
374ca955 A	410	glyphStorage.setCharIndex(firstGlyph, ic, success);
374ca955 A	411	glyphStorage.setCharIndex(firstGlyph + 1, id, success);
b75a7d8f	412
374ca955 A	413	glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
374ca955 A	414	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	415	break;
	416
	417	case irvDCxAB:
2ca993e8 A	418	if (lastGlyph - firstGlyph < 3) {
	419	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	420	break;
	421	}
374ca955 A	422	a = glyphStorage[firstGlyph];
374ca955 A	423	b = glyphStorage[firstGlyph + 1];
b75a7d8f	424
374ca955 A	425	glyphStorage[firstGlyph] = glyphStorage[lastGlyph];
374ca955 A	426	glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph - 1];
b75a7d8f	427
374ca955 A	428	glyphStorage[lastGlyph - 1] = a;
374ca955 A	429	glyphStorage[lastGlyph] = b;
b75a7d8f	430
374ca955 A	431	ia = glyphStorage.getCharIndex(firstGlyph, success);
	432	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
	433	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	434	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f	435
374ca955 A	436	glyphStorage.setCharIndex(firstGlyph, id, success);
374ca955 A	437	glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
b75a7d8f	438
374ca955 A	439	glyphStorage.setCharIndex(lastGlyph - 1, ia, success);
374ca955 A	440	glyphStorage.setCharIndex(lastGlyph, ib, success);
b75a7d8f A	441	break;
	442
	443	case irvDCxBA:
2ca993e8 A	444	if (lastGlyph - firstGlyph < 3) {
	445	success = LE_INDEX_OUT_OF_BOUNDS_ERROR;
	446	break;
	447	}
374ca955 A	448	a = glyphStorage[firstGlyph];
374ca955 A	449	b = glyphStorage[firstGlyph + 1];
b75a7d8f	450
374ca955 A	451	glyphStorage[firstGlyph] = glyphStorage[lastGlyph];
374ca955 A	452	glyphStorage[firstGlyph + 1] = glyphStorage[lastGlyph - 1];
b75a7d8f	453
374ca955 A	454	glyphStorage[lastGlyph - 1] = b;
374ca955 A	455	glyphStorage[lastGlyph] = a;
b75a7d8f	456
374ca955 A	457	ia = glyphStorage.getCharIndex(firstGlyph, success);
	458	ib = glyphStorage.getCharIndex(firstGlyph + 1, success);
	459	ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
	460	id = glyphStorage.getCharIndex(lastGlyph, success);
b75a7d8f	461
374ca955 A	462	glyphStorage.setCharIndex(firstGlyph, id, success);
374ca955 A	463	glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
b75a7d8f	464
374ca955 A	465	glyphStorage.setCharIndex(lastGlyph - 1, ib, success);
374ca955 A	466	glyphStorage.setCharIndex(lastGlyph, ia, success);
b75a7d8f A	467	break;
	468
	469	default:
	470	break;
	471	}
	472	}
	473
	474	U_NAMESPACE_END