10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I have a file hello.txt which i wish to send as a email body (not attachment).
cat -ev hello.txt
1$
2$
3$
I use the following command to send the hello.txt as the email body.
mailx -s "Alert" myteam@mycomp.com<hello.txt
However, the email received has this in the email body
123... (2 Replies)
Discussion started by: mohtashims
2 Replies
2. UNIX for Dummies Questions & Answers
Hello
I am using a grep command with two patterns in my KSH script. File has line breaks in it and both the patterns are in different lines. Here is the command grep -l 'RITE AID.*ST.820' natriter820u.20140914
Pattern1 - RITE AID
Pattern2 - ST*820
I am not getting any results from... (24 Replies)
Discussion started by: Raghav Garg
24 Replies
3. How to Post in the The UNIX and Linux Forums
I am using a grep command with two patterns in my KSH script. File has line breaks in it and both the patterns are in different lines. Here is the command - grep -l 'RITE AID.*ST.820' natriter820u.20140914
Pattern1 - RITE AID
Pattern2 - ST*820
I am not getting any results from this,... (3 Replies)
Discussion started by: Raghav Garg
3 Replies
4. Shell Programming and Scripting
I need to read temp.$i file content line by line through while loop but somehow the '\' do not appear in output.. Can someone guide how to read this exact content line by line in unix :
if
then
cat temp.$i | head -1 # the file content appears fine
while... (13 Replies)
Discussion started by: Prev
13 Replies
5. Shell Programming and Scripting
Moderator, please, delete this topic (1 Reply)
Discussion started by: optik77
1 Replies
6. Shell Programming and Scripting
Hi,
Does any one know how to avoid the scenario where awk ignores the fields having only spaces or empty fields?
for instance,
Data: "a","b","c","d",""," "
code:
awk -F, '{ print NF }' File
the output I get is 4 instead of 6 do you know how to avoid this? (6 Replies)
Discussion started by: ahmedwaseem2000
6 Replies
7. Programming
Hello! :b:
It's the third time I download source code using git (only method available), to find out later that the most essential files to compile are missing and listed in .gitignore.
Examples:
phonon-backend-vlc which misses Makefile
git.videolan.org Git - vlc/bindings/phonon.git/summary... (2 Replies)
Discussion started by: teresaejunior
2 Replies
8. Shell Programming and Scripting
Dear all,
I have a file as below
100||kjhkjhkjhkjhk
200|TR|jvsjfhskfhskfhsdh
300|BH|kjlkjljlkj
600||dadsadasdada
||ffsdfsf
|YU|popopop
900||mlml
when I apply the below sort command, results obtained displayed below-
cut -f1,2 -d"|" test.txt|sort -u
100|
200|TR
300|BH
600|
900|... (9 Replies)
Discussion started by: sureshg_sampat
9 Replies
9. Shell Programming and Scripting
I'm new to procmailrc. And I've updated my ~/.procmailrc, but it's not working all all for the new changes. Please show me how can I active it with effective with the new changes? (0 Replies)
Discussion started by: angloi
0 Replies
10. Email Antispam Techniques and Email Filtering
Scott Wiersdorf (www.perlcode.org) wrote a Perl module to interface with procmailrc files. The name of the module is Mail::Procmailrc (available from CPAN). It comes with a simple CGI (unpolished, insecure, but useful as a proof-of-concept) to allow you to edit procmailrc files from a web... (0 Replies)
Discussion started by: Neo
0 Replies
PROCMAILSC(5) File Formats Manual PROCMAILSC(5)
NAME
procmailsc - procmail weighted scoring technique
SYNOPSIS
[*] w^x condition
DESCRIPTION
In addition to the traditional true or false conditions you can specify on a recipe, you can use a weighted scoring 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 match.
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 con-
dition (on the same line) with:
w^x
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 forth.
This can be described by the following concise formula:
n
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 below).
1<x Every match will contribute more to the score than the previous one. The score will grow exponentially.
x<0 Can be utilised to favour odd or even number of matches.
If the regular expression is negated (i.e., matches if it isn't found), then n obviously can either be zero or one.
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 (indicat-
ing failure), the total added score will be x.
If the exitcode of the program is negated, then, the exitcode 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=`exitcode' matches.
Weighted length conditions
If the length of the actual mail is M then:
* w^x > L
will generate an additional score of:
x
/ M
w * | --- |
L /
And:
* w^x < L
will generate an additional score of:
x
/ 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 function, typical usage sets x=1.
MISCELLANEOUS
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 conditions on a recipe (even if the recipe is not being executed).
EXAMPLES
The following recipe will ditch all mails having more than 150 lines in the body. The first condition contains an empty regular expression
which, because it always matches, is used to give our score a negative offset. The second condition then matches every line in the mail,
and consumes up the previous negative offset we gave (one point per line). In the end, the score will only be positive if the mail con-
tained more than 150 lines.
:0 Bh
* -150^0
* 1^1 ^.*$
/dev/null
Suppose you have a priority folder which you always read first. The next recipe picks out the priority mail and 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 condi-
tions describe things like: john and claire usually have something 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 mentioned, the more the mail is favoured, but the maxi-
mum extra score due to Elvis will be 4000, no matter how often he is mentioned), lots of quoted lines are disliked, smileys 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 uninteresting 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
priority_folder
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 orig-
inal lines is at most 1:2. If it exceeds that, ditch the mail. Everything that survived the previous test, is filed.
:0
^From mailinglist-request@some.where
{
:0:
* ^(From:.*(paula|bill)|Subject:.*skiing)
mailinglist
:0 Bh
* 20^1 ^>
* -10^1 ^[^>]
/dev/null
:0:
mailinglist
}
For further examples you should look in the procmailex(5) man page.
CAVEATS
Because this speeds up the search by an order of magnitude, the procmail internal egrep will always search for the leftmost shortest match,
unless it is determining what to assign to MATCH, in which case it searches the leftmost longest match. E.g. for the leftmost shortest
match, by itself, the regular expression:
.* will always match a zero length string at the same spot.
.+ will always match one character (except newlines of course).
SEE ALSO
procmail(1), procmailrc(5), procmailex(5), sh(1), csh(1), egrep(1), grep(1),
BUGS
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.
MISCELLANEOUS
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.
NOTES
If in a regular expression weighted formula 0<x<1, the total added score for this condition will asymptotically approach:
w
-------
1 - x
In order to reach half the maximum value you need
- ln 2
n = --------
ln x
matches.
AUTHORS
Stephen R. van den Berg
<srb@cuci.nl>
Philip A. Guenther
<guenther@sendmail.com>
BuGless 2001/08/04 PROCMAILSC(5)
