Dear Wiki user, You have subscribed to a wiki page or wiki category on "Devicemap Wiki" for change notification.
The "Patterns2" page has been changed by rezan: https://wiki.apache.org/devicemap/Patterns2?action=diff&rev1=22&rev2=23 = Pattern Matching = - This step processes the token stream and returns the highest ranking candidate pattern. + This step processes the token stream and returns the highest ranking candidate. The pattern file defines a pattern set. Each pattern has 2 main attributes, its pattern type and its pattern rank. The pattern type defines how the pattern is supposed to be matched against the token stream. The pattern rank defines how the pattern ranks against other patterns. - All patterns in the pattern set are evaluated to find the pattern candidates. + All patterns in the pattern set are evaluated to find the candidates. All the pattern types in 2.0 are prefixed with 'Simple'. This means that each pattern token is matched using a plain byte string comparison. No regex or other syntax is allowed in Simple patterns. @@ -200, +200 @@ the pattern with the longest concatenated matched pattern length is used. If that results in another tie, the pattern with the first matched token found is returned. - If 2 or more patterns share the same Pattern``Id, then only 1 of their Pattern``Types + If 2 or more patterns share the same Pattern``Id, then only one Pattern``Type - need to match. There is an implied OR between multiple Pattern``Types with equal Pattern``Id. + needs to match for this pattern to be a candidate. If no pattern is successfully matched, the Default``Id is returned. If no Default``Id is defined, a null pattern is returned. @@ -209, +209 @@ === Notes === - 2 or more patterns cannot have identical Rank``Type, Rank``Value, and matched tokens. This is undefined behavior since they will be + 2 or more patterns cannot have identical Rank``Type, Rank``Value, and matched tokens. This is undefined behavior since the patterns are identical. The pattern the classifier chooses can be random. - found at the same time. The pattern the classifier chooses can be random. New pattern types and ranks can be introduced in the future. If a classifier encounters a definition it cannot support, it must immediately return an initialization error.
