void addCaselessMatches(int codePoint,String uppercaseMapping,String lowercaseMapping,String titlecaseMapping){
  if ((null != uppercaseMapping && uppercaseMapping.length() > 0) || (null != lowercaseMapping && lowercaseMapping.length() > 0) || (null != titlecaseMapping && titlecaseMapping.length() > 0)) {
    Integer upper=null;
    if (null != uppercaseMapping && uppercaseMapping.length() > 0)     upper=Integer.valueOf(uppercaseMapping,16);
 else     uppercaseMapping=null;
    Integer lower=null;
    if (null != lowercaseMapping && lowercaseMapping.length() > 0)     lower=Integer.valueOf(lowercaseMapping,16);
 else     lowercaseMapping=null;
    Integer title=null;
    if (null != titlecaseMapping && titlecaseMapping.length() > 0)     title=Integer.valueOf(titlecaseMapping,16);
 else     titlecaseMapping=null;
    SortedSet<Integer> partition=caselessMatchPartitions.get(codePoint);
    if (null == partition) {
      if (null != uppercaseMapping)       partition=caselessMatchPartitions.get(upper);
      if (null == partition && null != lowercaseMapping)       partition=caselessMatchPartitions.get(lower);
      if (null == partition && null != titlecaseMapping)       partition=caselessMatchPartitions.get(title);
      if (null == partition) {
        partition=new TreeSet<Integer>();
      }
    }
    partition.add(codePoint);
    caselessMatchPartitions.put(codePoint,partition);
    if (null != uppercaseMapping) {
      partition.add(upper);
      caselessMatchPartitions.put(upper,partition);
    }
    if (null != lowercaseMapping) {
      partition.add(lower);
      caselessMatchPartitions.put(lower,partition);
    }
    if (null != titlecaseMapping) {
      partition.add(title);
      caselessMatchPartitions.put(title,partition);
    }
    if (partition.size() > caselessMatchPartitionSize) {
      caselessMatchPartitionSize=partition.size();
    }
  }
}

void addCaselessMatches ( int codePoint , String uppercaseMapping , String lowercaseMapping , String titlecaseMapping ) { if ( ( null != uppercaseMapping && uppercaseMapping . length ( ) > 0 ) || ( null != lowercaseMapping && lowercaseMapping . length ( ) > 0 ) || ( null != titlecaseMapping && titlecaseMapping . length ( ) > 0 ) ) { Integer upper = null ; if ( null != uppercaseMapping && uppercaseMapping . length ( ) > 0 ) upper = Integer . valueOf ( uppercaseMapping , 16 ) ; else uppercaseMapping = null ; Integer lower = null ; if ( null != lowercaseMapping && lowercaseMapping . length ( ) > 0 ) lower = Integer . valueOf ( lowercaseMapping , 16 ) ; else lowercaseMapping = null ; Integer title = null ; if ( null != titlecaseMapping && titlecaseMapping . length ( ) > 0 ) title = Integer . valueOf ( titlecaseMapping , 16 ) ; else titlecaseMapping = null ; SortedSet < Integer > partition = caselessMatchPartitions . get ( codePoint ) ; if ( null == partition ) { if ( null != uppercaseMapping ) partition = caselessMatchPartitions . get ( upper ) ; if ( null == partition && null != lowercaseMapping ) partition = caselessMatchPartitions . get ( lower ) ; if ( null == partition && null != titlecaseMapping ) partition = caselessMatchPartitions . get ( title ) ; if ( null == partition ) { partition = new TreeSet < Integer > ( ) ; } } partition . add ( codePoint ) ; caselessMatchPartitions . put ( codePoint , partition ) ; if ( null != uppercaseMapping ) { partition . add ( upper ) ; caselessMatchPartitions . put ( upper , partition ) ; } if ( null != lowercaseMapping ) { partition . add ( lower ) ; caselessMatchPartitions . put ( lower , partition ) ; } if ( null != titlecaseMapping ) { partition . add ( title ) ; caselessMatchPartitions . put ( title , partition ) ; } if ( partition . size ( ) > caselessMatchPartitionSize ) { caselessMatchPartitionSize = partition . size ( ) ; } } }
grows the partition containing the given codepoint and its caseless equivalents , if any , to include all of them .
