Mailing-List: contact commits-help@devicemap.apache.org; run by ezmlm
Precedence: bulk
Reply-To: dev@devicemap.apache.org
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: quoted-printable
From: Apache Wiki <wikidiffs@apache.org>
To: Apache Wiki <wikidiffs@apache.org>
Date: Mon, 12 Jan 2015 04:19:33 -0000
Message-ID: <20150112041933.51625.71238@eos.apache.org>
Subject: =?utf-8?q?=5BDevicemap_Wiki=5D_Update_of_=22Patterns2=22_by_rezan?=
Auto-Submitted: auto-generated

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=3Ddiff&rev1=3D23&rev2=3D=
24

  =

  This step parses the input string and creates the token stream.
  =

- Each pattern file defines the input parsing rules:
+ Each pattern file defines these input parsing rules:
  =

   InputTransformers::
   :: Type: list of transformation steps
@@ -123, +123 @@

  =

  =3D Pattern Matching =3D
  =

- This step processes the token stream and returns the highest ranking cand=
idate.
+ This step processes the token stream and returns the highest ranking cand=
idate pattern.
  =

- The pattern file defines a pattern set. Each pattern has 2 main attribute=
s,
+ The pattern file defines a pattern set. All patterns in the pattern set a=
re evaluated to find the candidates.
+ =

+ 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 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.
+ using a plain byte or string comparison. No regex or other syntax is allo=
wed in Simple patterns.
  This allows the algorithm to use simple byte or string hashing for matchi=
ng. This gives maximum performance and scaling complexity equal to a hashta=
ble implementation. A Simple``Hash``Count attribute can be optionally defin=
ed which hints the classifier as to how many unique hashes it would need to=
 generate to support the pattern set.
  =

  Pattern attributes:
@@ -147, +147 @@

   :: Required.
  =

   RankValue::
-  :: Type: integer, 0 to 1000
+  :: Type: integer, -1000 to 1000
   :: Optional. Default: 0.
  =

   PatternType::
@@ -203, +203 @@

  If 2 or more patterns share the same Pattern``Id, then only one Pattern``=
Type
  needs to match for this pattern to be a candidate.
  =

- If no pattern is successfully matched, the Default``Id is returned. If no
+ If no candidate patterns are found, the Default``Id is returned. If no
  Default``Id is defined, a null pattern is returned.
  =

 =20