RobotsMatcher.Match

Instead of just maintaining a Boolean indicating whether a given line has matched, we maintain a count of the maximum number of characters matched by that pattern.

This structure stores the information associated with a match (e.g. when a Disallow is matched) as priority of the match and line matching.

The priority is initialized with a negative value to make sure that a match of priority 0 is higher priority than no match at all.

class RobotsMatcher

package

struct Match {

void Set(int priority, int line);

void Clear();

int line();

int priority();

static const(Match)* HigherPriorityMatch(const(Match)* a, const(Match)* b);

}

Members

Functions

Clear void Clear(): Undocumented in source. Be warned that the author may not have intended to support it.
Set void Set(int priority, int line): Undocumented in source. Be warned that the author may not have intended to support it.
line int line(): Undocumented in source. Be warned that the author may not have intended to support it.
priority int priority(): Undocumented in source. Be warned that the author may not have intended to support it.

Static functions

HigherPriorityMatch const(Match)* HigherPriorityMatch(const(Match)* a, const(Match)* b): Undocumented in source. Be warned that the author may not have intended to support it.

RobotsMatcher.Match

Members

Functions

Static functions

Meta

Source