Welcome to Linux Knowledge Base and Tutorial
"The place where you learn linux"
Child Fund

 Create an AccountHome | Submit News | Your Account  

Tutorial Menu
Linux Tutorial Home
Table of Contents

· Introduction to Operating Systems
· Linux Basics
· Working with the System
· Shells and Utilities
· Editing Files
· Basic Administration
· The Operating System
· The X Windowing System
· The Computer Itself
· Networking
· System Monitoring
· Solving Problems
· Security
· Installing and Upgrading
· Linux and Windows

Man Pages
Linux Topics
Test Your Knowledge

Site Menu
Site Map
Copyright Info
Terms of Use
Privacy Info
Masthead / Impressum
Your Account

Private Messages

News Archive
Submit News
User Articles
Web Links


The Web

Who's Online
There are currently, 147 guest(s) and 0 member(s) that are online.

You are an Anonymous user. You can register for free by clicking here




       [*] w^x condition


       In  addition  to  the traditional true or false conditions
       you can specify on a recipe, you can use a weighted  scor­
       ing  technique  to  decide  if a certain recipe matches or
       not.  When weighted scoring is used in a recipe, then  the
       final  score  for  that  recipe must be positive for it to

       A certain condition can contribute to  the  score  if  you
       allocate  it a `weight' (w) and an `exponent' (x).  You do
       this by preceding the condition (on the same line) with:
       Whereas  both  w  and   x   are   real   numbers   between
       -2147483647.0 and 2147483647.0 inclusive.

Weighted regular expression conditions

       The  first  time  the regular expression is found, it will
       add w to the score.  The second time it is found, w*x will
       be  added.   The  third  time  it  is found, w*x*x will be
       added.  The fourth time w*x*x*x will  be  added.   And  so

       This can be described by the following concise formula:

                   n   k-1        x - 1
              w * Sum x    = w * -------
                  k=1             x - 1

       It  represents the total added score for this condition if
       n matches are found.

       Note that the following case distinctions can be made:

       x=0     Only the first match  will  contribute  w  to  the
               score.  Any subsequent matches are ignored.

       x=1     Every  match  will  contribute  the  same w to the
               score.  The score grows linearly with  the  number
               of matches found.

       0<x<1   Every match will contribute less to the score than
               the previous one.  The score  will  asymptotically
               approach  a  certain  value (see the NOTES section

       1<x     Every match will contribute more to the score than
               the  previous  one.   The score will grow exponen­

Weighted program conditions

       If  the  program returns an exitcode of EXIT_SUCCESS (=0),
       then the total added score will be w.  If it  returns  any
       other exitcode (indicating failure), the total added score
       will be x.

       If the exitcode of the program is negated, then, the exit­
       code  will be considered as if it were a virtual number of
       matches.  Calculation of the added score then proceeds  as
       if  it  had been a normal regular expression with n=`exit­
       code' matches.

Weighted length conditions

       If the length of the actual mail is M then:

              * w^x  > L

       will generate an additional score of:

                  /  M  \
              w * | --- |
                  \  L  /


              * w^x  < L

       will generate an additional score of:

                  /  L  \
              w * | --- |
                  \  M  /

       In both cases, if L=M, this will add w to the  score.   In
       the former case however, larger mails will be favoured, in
       the latter case, smaller mails will be favoured.  Although
       x  can  be  varied to fine-tune the steepness of the func­
       tion, typical usage sets x=1.


       You can query the final score of all the conditions  on  a
       recipe from the environment variable $=.  This variable is
       set every time just after procmail has parsed  all  condi­
       tions  on  a  recipe (even if the recipe is not being exe­


       The following recipe will ditch all mails having more than
       150  lines  in  the body.  The first condition contains an
       files them in this special folder.  The first condition is
       a regular one, i.e. it doesn't contribute  to  the  score,
       but  simply  has  to  be  satisfied.  The other conditions
       describe things like: john and claire usually  have  some­
       thing  important  to  say, meetings are usually important,
       replies are favoured a bit, mails  about  Elvis  (this  is
       merely  an  example  :-) are favoured (the more he is men­
       tioned, the more the mail is  favoured,  but  the  maximum
       extra score due to Elvis will be 4000, no matter how often
       he is mentioned), lots of quoted lines are disliked,  smi­
       leys  are  appreciated  (the  score for those will reach a
       maximum of 3500), those three people  usually  don't  send
       interesting  mails,  the  mails should preferably be small
       (e.g. 2000 bytes long mails will score  -100,  4000  bytes
       long  mails do -800).  As you see, if some of the uninter­
       esting people send mail, then the mail still has a  chance
       of  landing  in the priority folder, e.g. if it is about a
       meeting, or if it contains at least two smileys.

              :0 HB
              *         !^Precedence:.*(junk|bulk)
              * 2000^0   ^From:.*(john@home|claire@work)
              * 2000^0   ^Subject:.*meeting
              *  300^0   ^Subject:.*Re:
              * 1000^.75 elvis|presley
              * -100^1   ^>
              *  350^.9  :-\)
              * -500^0   ^From:.*(boss|jane|henry)@work
              * -100^3   > 2000

       If you are subscribed to a  mailinglist,  and  just  would
       like to read the quality mails, then the following recipes
       could do the trick.  First we make sure that the  mail  is
       coming  from the mailinglist.  Then we check if it is from
       certain persons of whom we value the opinion, or  about  a
       subject  we  absolutely want to know everything about.  If
       it is, file it.  Otherwise, check if the ratio  of  quoted
       lines  to  original  lines  is at most 1:2.  If it exceeds
       that, ditch the mail.  Everything that survived the previ­
       ous test, is filed.

              ^From mailinglist-request@some.where
                * ^(From:.*(paula|bill)|Subject:.*skiing)

                :0 Bh
                *  20^1 ^>
                * -10^1 ^[^>]

       longest match.  E.g. for the leftmost shortest  match,  by
       itself, the regular expression:

       .*     will  always match a zero length string at the same

       .+     will always match one character (except newlines of


       procmail(1), procmailrc(5), procmailex(5), sh(1), csh(1),
       egrep(1), grep(1),


       If, in a length condition, you specify an x that causes an
       overflow,  procmail is at the mercy of the pow(3) function
       in your mathematical library.

       Floating point numbers in `engineering' format (e.g. 12e5)
       are not accepted.


       As  soon  as  `plus infinity' (2147483647) is reached, any
       subsequent weighted conditions will simply be skipped.

       As soon as `minus infinity' (-2147483647) is reached,  the
       condition  will be considered as `no match' and the recipe
       will terminate early.


       If in a regular expression weighted formula 0<x<1, the to­
       tal added score for this condition will asymptotically ap­

               1 - x

       In order to reach half the maximum value you need

                   - ln 2
              n = --------
                     ln x



       Stephen R. van den Berg
       Philip A. Guenther

Show your Support for the Linux Tutorial

Purchase one of the products from our new online shop. For each product you purchase, the Linux Tutorial gets a portion of the proceeds to help keep us going.



Security Code
Security Code
Type Security Code

Don't have an account yet? You can create one. As a registered user you have some advantages like theme manager, comments configuration and post comments with your name.

Help if you can!

Amazon Wish List

Did You Know?
The Linux Tutorial can use your help.


Tell a Friend About Us

Bookmark and Share

Web site powered by PHP-Nuke

Is this information useful? At the very least you can help by spreading the word to your favorite newsgroups, mailing lists and forums.
All logos and trademarks in this site are property of their respective owner. The comments are property of their posters. Articles are the property of their respective owners. Unless otherwise stated in the body of the article, article content (C) 1994-2013 by James Mohr. All rights reserved. The stylized page/paper, as well as the terms "The Linux Tutorial", "The Linux Server Tutorial", "The Linux Knowledge Base and Tutorial" and "The place where you learn Linux" are service marks of James Mohr. All rights reserved.
The Linux Knowledge Base and Tutorial may contain links to sites on the Internet, which are owned and operated by third parties. The Linux Tutorial is not responsible for the content of any such third-party site. By viewing/utilizing this web site, you have agreed to our disclaimer, terms of use and privacy policy. Use of automated download software ("harvesters") such as wget, httrack, etc. causes the site to quickly exceed its bandwidth limitation and are therefore expressly prohibited. For more details on this, take a look here

PHP-Nuke Copyright © 2004 by Francisco Burzi. This is free software, and you may redistribute it under the GPL. PHP-Nuke comes with absolutely no warranty, for details, see the license.
Page Generation: 0.13 Seconds