1  /*
     2   * Copyright the original author or authors.
     3   * 
     4   * Licensed under the MOZILLA PUBLIC LICENSE, Version 1.1 (the "License");
     5   * you may not use this file except in compliance with the License.
     6   * You may obtain a copy of the License at
     7   * 
     8   *      http://www.mozilla.org/MPL/MPL-1.1.html
     9   * 
    10   * Unless required by applicable law or agreed to in writing, software
    11   * distributed under the License is distributed on an "AS IS" BASIS,
    12   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    13   * See the License for the specific language governing permissions and
    14   * limitations under the License.
    15   */
    16  
    17  import org.as2lib.regexp.AsciiUtil;
    18  import org.as2lib.regexp.node.Node;
    19  import org.as2lib.regexp.node.SingleU;
    20  import org.as2lib.regexp.node.TreeInfo;
    21   
    22  /**
    23   * {@code NotSingleA} is a node class to match any character except a single 
    24   * case independent unicode value.
    25   * 
    26   * @author Igor Sadovskiy
    27   */
    28   
    29  class org.as2lib.regexp.node.NotSingleU extends Node {
    30  	
    31      private var ch:Number;
    32      
    33      public function NotSingleU(c:Number) {
    34          ch = AsciiUtil.toLower(AsciiUtil.toUpper(c));
    35      }
    36      
    37      public function dup(flag:Boolean):Node {
    38          return (flag) ? new SingleU(ch) : new NotSingleU(ch);
    39      }
    40      
    41      public function match(matcher:Object, i:Number, seq:String):Boolean {
    42          if (i < matcher.to) {
    43              var c:Number = seq.charCodeAt(i);
    44              if (c == ch) return false;
    45              c = AsciiUtil.toUpper(c);
    46              c = AsciiUtil.toLower(c);
    47              if (c != ch) return next.match(matcher, i+1, seq);
    48          }
    49          return false;
    50      }
    51      
    52      public function study(info:TreeInfo):Boolean {
    53          info.minLength++;
    54          info.maxLength++;
    55          return next.study(info);
    56      }
    57  }
    58  
    59
as2api