Class org.as2lib.regexp.node.Loop

Description

Loop handles the repetition count for a greedy Curly. The matchInit is called from the Prolog to save the index of where the group beginning is stored. A zero length group check occurs in the normal match but is skipped in the matchInit.

Method Index

new Loop()
getBody(), getCmax(), getCmin(), match(), matchInit(), setBody(), setCmax(), setCmin(), study()

Inherited from Node

dup(), getNext(), setNext()

Inherited from BasicClass

toString()

Constructor Detail

Loop

public function Loop(countIndex:Number, beginIndex:Number)

Method Detail

match

public function match(matcher:Object, i:Number, seq:String):Boolean

Description copied from Node

This method implements the classic accept node.

Overrides

match() in org.as2lib.regexp.node.Node

matchInit

public function matchInit(matcher:Object, i:Number, seq:String):Boolean

study

public function study(info:TreeInfo):Boolean

Description copied from Node

This method is good for all zero length assertions.

Overrides

study() in org.as2lib.regexp.node.Node

getCmin

public function getCmin(Void):Number

setCmin

public function setCmin(cmin:Number):Void

getCmax

public function getCmax(Void):Number

setCmax

public function setCmax(cmax:Number):Void

getBody

public function getBody(Void):Node

setBody

public function setBody(body:Node):Void
as2api