CollationElementIterator.java 14.6 KB
Newer Older
Tom Tromey committed
1 2 3 4 5 6 7 8 9
/* CollationElementIterator.java -- Walks through collation elements
   Copyright (C) 1998, 1999, 2001, 2002, 2003, 2004  Free Software Foundation

This file is part of GNU Classpath.

GNU Classpath 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 2, or (at your option)
any later version.
10

Tom Tromey committed
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
GNU Classpath 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 for more details.

You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING.  If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.

Linking this library statically or dynamically with other modules is
making a combined work based on this library.  Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.

As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module.  An independent module is a module which is not derived from
or based on this library.  If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so.  If you do not wish to do so, delete this
exception statement from your version. */


package java.text;

41 42
import gnu.java.lang.CPStringBuilder;

Tom Tromey committed
43 44 45 46 47 48 49 50
import java.util.ArrayList;

/* Written using "Java Class Libraries", 2nd edition, plus online
 * API docs for JDK 1.2 from http://www.javasoft.com.
 * Status: Believed complete and correct to JDK 1.1.
 */

/**
51 52
 * This class walks through the character collation elements of a
 * <code>String</code> as defined by the collation rules in an instance of
Tom Tromey committed
53 54
 * <code>RuleBasedCollator</code>.  There is no public constructor for
 * this class.  An instance is created by calling the
55
 * <code>getCollationElementIterator</code> method on
Tom Tromey committed
56 57 58 59 60 61 62 63 64
 * <code>RuleBasedCollator</code>.
 *
 * @author Aaron M. Renn (arenn@urbanophile.com)
 * @author Tom Tromey (tromey@cygnus.com)
 * @author Guilhem Lavaux (guilhem.lavaux@free.fr)
 */
public final class CollationElementIterator
{
  /**
65
   * This is a constant value that is returned to indicate that the end of
Tom Tromey committed
66 67 68 69 70 71 72 73 74 75 76 77
   * the string was encountered.
   */
  public static final int NULLORDER = -1;

  /**
   * This is the RuleBasedCollator this object was created from.
   */
  RuleBasedCollator collator;

  /**
   * This is the String that is being iterated over.
   */
78
  CharacterIterator text;
Tom Tromey committed
79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111

  /**
   * This is the index into the collation decomposition where we are currently scanning.
   */
  int index;

  /**
   * This is the index into the String where we are currently scanning.
   */
  int textIndex;

  /**
   * Array containing the collation decomposition of the
   * text given to the constructor.
   */
  private RuleBasedCollator.CollationElement[] text_decomposition;

  /**
   * Array containing the index of the specified block.
   */
  private int[] text_indexes;

  /**
   * This method initializes a new instance of <code>CollationElementIterator</code>
   * to iterate over the specified <code>String</code> using the rules in the
   * specified <code>RuleBasedCollator</code>.
   *
   * @param collator The <code>RuleBasedCollation</code> used for calculating collation values
   * @param text The <code>String</code> to iterate over.
   */
  CollationElementIterator(RuleBasedCollator collator, String text)
  {
    this.collator = collator;
112 113

    setText (text);
Tom Tromey committed
114 115
  }

116 117 118 119 120 121 122 123 124 125 126
  /**
   * This method initializes a new instance of <code>CollationElementIterator</code>
   * to iterate over the specified <code>String</code> using the rules in the
   * specified <code>RuleBasedCollator</code>.
   *
   * @param collator The <code>RuleBasedCollation</code> used for calculating collation values
   * @param text The character iterator to iterate over.
   */
  CollationElementIterator(RuleBasedCollator collator, CharacterIterator text)
  {
    this.collator = collator;
127 128

    setText (text);
129 130
  }

Tom Tromey committed
131 132 133 134
  RuleBasedCollator.CollationElement nextBlock()
  {
    if (index >= text_decomposition.length)
      return null;
135

Tom Tromey committed
136
    RuleBasedCollator.CollationElement e = text_decomposition[index];
137

Tom Tromey committed
138 139 140 141 142 143 144 145 146 147 148
    textIndex = text_indexes[index+1];

    index++;

    return e;
  }

  RuleBasedCollator.CollationElement previousBlock()
  {
    if (index == 0)
      return null;
149

Tom Tromey committed
150 151 152 153
    index--;
    RuleBasedCollator.CollationElement e = text_decomposition[index];

    textIndex = text_indexes[index+1];
154

Tom Tromey committed
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
    return e;
  }

  /**
   * This method returns the collation ordering value of the next character sequence
   * in the string (it may be an extended character following collation rules).
   * This method will return <code>NULLORDER</code> if the
   * end of the string was reached.
   *
   * @return The collation ordering value.
   */
  public int next()
  {
    RuleBasedCollator.CollationElement e = nextBlock();

    if (e == null)
      return NULLORDER;
172

Tom Tromey committed
173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188
    return e.getValue();
  }

  /**
   * This method returns the collation ordering value of the previous character
   * in the string.  This method will return <code>NULLORDER</code> if the
   * beginning of the string was reached.
   *
   * @return The collation ordering value.
   */
  public int previous()
  {
    RuleBasedCollator.CollationElement e = previousBlock();

    if (e == null)
      return NULLORDER;
189

Tom Tromey committed
190 191 192 193 194 195 196
    return e.getValue();
  }

  /**
   * This method returns the primary order value for the given collation
   * value.
   *
197
   * @param order The collation value returned from <code>next()</code> or
Tom Tromey committed
198
   *              <code>previous()</code>.
Tom Tromey committed
199
   *
Tom Tromey committed
200 201
   * @return The primary order value of the specified collation value.  This is
   *         the high 16 bits.
Tom Tromey committed
202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222
   */
  public static int primaryOrder(int order)
  {
    // From the JDK 1.2 spec.
    return order >>> 16;
  }

  /**
   * This method resets the internal position pointer to read from the
   * beginning of the <code>String</code> again.
   */
  public void reset()
  {
    index = 0;
    textIndex = 0;
  }

  /**
   * This method returns the secondary order value for the given collation
   * value.
   *
223
   * @param order The collation value returned from <code>next()</code> or
Tom Tromey committed
224
   *              <code>previous()</code>.
Tom Tromey committed
225
   *
226
   * @return The secondary order value of the specified collation value.  This
Tom Tromey committed
227
   *         is the bits 8-15.
Tom Tromey committed
228 229 230 231 232 233 234 235 236 237 238
   */
  public static short secondaryOrder(int order)
  {
    // From the JDK 1.2 spec.
    return (short) ((order >>> 8) & 255);
  }

  /**
   * This method returns the tertiary order value for the given collation
   * value.
   *
239
   * @param order The collation value returned from <code>next()</code> or
Tom Tromey committed
240
   *              <code>previous()</code>.
Tom Tromey committed
241
   *
242
   * @return The tertiary order value of the specified collation value.  This
Tom Tromey committed
243
   *         is the low eight bits.
Tom Tromey committed
244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265
   */
  public static short tertiaryOrder(int order)
  {
    // From the JDK 1.2 spec.
    return (short) (order & 255);
  }

  /**
   * This method sets the <code>String</code> that it is iterating over
   * to the specified <code>String</code>.
   *
   * @param text The new <code>String</code> to iterate over.
   *
   * @since 1.2
   */
  public void setText(String text)
  {
    int idx = 0;
    int idx_idx = 0;
    int alreadyExpanded = 0;
    int idxToMove = 0;

266
    this.text = new StringCharacterIterator(text);
Tom Tromey committed
267 268 269 270 271 272 273 274 275 276
    this.index = 0;

    String work_text = text.intern();

    ArrayList a_element = new ArrayList();
    ArrayList a_idx = new ArrayList();

    // Build element collection ordered as they come in "text".
    while (idx < work_text.length())
      {
277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398
        String key, key_old;

        Object object = null;
        int p = 1;

        // IMPROVE: use a TreeMap with a prefix-ordering rule.
        key_old = key = null;
        do
          {
            if (object != null)
              key_old = key;
            key = work_text.substring (idx, idx+p);
            object = collator.prefix_tree.get (key);
            if (object != null && idx < alreadyExpanded)
              {
                RuleBasedCollator.CollationElement prefix = (RuleBasedCollator.CollationElement)object;
                if (prefix.expansion != null &&
                    prefix.expansion.startsWith(work_text.substring(0, idx)))
                {
                  object = null;
                  key = key_old;
                }
              }
            p++;
          }
        while (idx+p <= work_text.length());

        if (object == null)
          key = key_old;

        RuleBasedCollator.CollationElement prefix =
          (RuleBasedCollator.CollationElement) collator.prefix_tree.get (key);

        /*
         * First case: There is no such sequence in the database.
         * We will have to build one from the context.
         */
        if (prefix == null)
          {
            /*
             * We are dealing with sequences in an expansion. They
             * are treated as accented characters (tertiary order).
             */
            if (alreadyExpanded > 0)
              {
                RuleBasedCollator.CollationElement e =
                  collator.getDefaultAccentedElement (work_text.charAt (idx));

                a_element.add (e);
                a_idx.add (new Integer(idx_idx));
                idx++;
                alreadyExpanded--;
                if (alreadyExpanded == 0)
                  {
                    /* There is not any characters left in the expansion set.
                     * We can increase the pointer in the source string.
                     */
                    idx_idx += idxToMove;
                    idxToMove = 0;
                  }
                else
                  idx_idx++;
              }
            else
              {
                /* This is a normal character. */
                RuleBasedCollator.CollationElement e =
                  collator.getDefaultElement (work_text.charAt (idx));
                Integer i_ref = new Integer(idx_idx);

                /* Don't forget to mark it as a special sequence so the
                 * string can be ordered.
                 */
                a_element.add (RuleBasedCollator.SPECIAL_UNKNOWN_SEQ);
                a_idx.add (i_ref);
                a_element.add (e);
                a_idx.add (i_ref);
                idx_idx++;
                idx++;
              }
            continue;
          }

        /*
         * Second case: Here we have found a matching sequence.
         * Here we have an expansion string prepend it to the "work text" and
         * add the corresponding sorting element. We must also mark
         */
        if (prefix.expansion != null)
          {
            work_text = prefix.expansion
              + work_text.substring (idx+prefix.key.length());
            idx = 0;
            a_element.add (prefix);
            a_idx.add (new Integer(idx_idx));
            if (alreadyExpanded == 0)
              idxToMove = prefix.key.length();
            alreadyExpanded += prefix.expansion.length()-prefix.key.length();
          }
        else
          {
            /* Third case: the simplest. We have got the prefix and it
             * has not to be expanded.
             */
            a_element.add (prefix);
            a_idx.add (new Integer(idx_idx));
            idx += prefix.key.length();
            /* If the sequence is in an expansion, we must decrease the
             * counter.
             */
            if (alreadyExpanded > 0)
              {
                alreadyExpanded -= prefix.key.length();
                if (alreadyExpanded == 0)
                  {
                    idx_idx += idxToMove;
                    idxToMove = 0;
                  }
              }
            else
              idx_idx += prefix.key.length();
          }
Tom Tromey committed
399
      }
400

Tom Tromey committed
401
    text_decomposition = (RuleBasedCollator.CollationElement[])
402
           a_element.toArray(new RuleBasedCollator.CollationElement[a_element.size()]);
Tom Tromey committed
403
    text_indexes = new int[a_idx.size()+1];
404
    for (int i = 0; i < a_idx.size(); i++)
Tom Tromey committed
405
      {
406
        text_indexes[i] = ((Integer)a_idx.get(i)).intValue();
Tom Tromey committed
407 408 409 410 411 412 413 414 415 416 417 418 419 420
      }
    text_indexes[a_idx.size()] = text.length();
  }

  /**
   * This method sets the <code>String</code> that it is iterating over
   * to the <code>String</code> represented by the specified
   * <code>CharacterIterator</code>.
   *
   * @param source The <code>CharacterIterator</code> containing the new
   * <code>String</code> to iterate over.
   */
  public void setText(CharacterIterator source)
  {
421
    CPStringBuilder expand = new CPStringBuilder();
Tom Tromey committed
422 423 424

    // For now assume we read from the beginning of the string.
    for (char c = source.first();
425 426
         c != CharacterIterator.DONE;
         c = source.next())
Tom Tromey committed
427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
      expand.append(c);

    setText(expand.toString());
  }

  /**
   * This method returns the current offset into the <code>String</code>
   * that is being iterated over.
   *
   * @return The iteration index position.
   *
   * @since 1.2
   */
  public int getOffset()
  {
    return textIndex;
  }

  /**
   * This method sets the iteration index position into the current
   * <code>String</code> to the specified value.  This value must not
   * be negative and must not be greater than the last index position
   * in the <code>String</code>.
   *
   * @param offset The new iteration index position.
   *
   * @exception IllegalArgumentException If the new offset is not valid.
   */
  public void setOffset(int offset)
  {
    if (offset < 0)
      throw new IllegalArgumentException("Negative offset: " + offset);

460
    if (offset > (text.getEndIndex() - 1))
Tom Tromey committed
461
      throw new IllegalArgumentException("Offset too large: " + offset);
462

Tom Tromey committed
463
    for (index = 0; index < text_decomposition.length; index++)
464 465 466
      {
        if (offset <= text_indexes[index])
          break;
Tom Tromey committed
467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483
      }
    /*
     * As text_indexes[0] == 0, we should not have to take care whether index is
     * greater than 0. It is always.
     */
    if (text_indexes[index] == offset)
      textIndex = offset;
    else
      textIndex = text_indexes[index-1];
  }

  /**
   * This method returns the maximum length of any expansion sequence that
   * ends with the specified collation order value.  (Whatever that means).
   *
   * @param value The collation order value
   *
Tom Tromey committed
484
   * @return The maximum length of an expansion sequence.
Tom Tromey committed
485 486 487 488 489 490
   */
  public int getMaxExpansion(int value)
  {
    return 1;
  }
}