Hi!
I'm trying to figure out how to find words with X number of doubles, only. I'm searching a dictionary, (one word per line). For instance, if you want to find words containing only one pair of double letters, you could do something like this:
That'll get rid of words with two, or more, doubles. But when you want to search for two or three sets of doubles, it gets a bit unwieldy.
And so on...
It seems to me that there must be a way to specify the max number of doubles in a single regex, but I cannot figure out how. I've found a number of pages online that talk about finding doubles, but none of them mention how to limit them to only the desired amount. I thought maybe a negative backreference could do it but, either I'm writing it wrong, or it just doesn't work. I still get words with more than X doubles.
And I tried a bunch of other stuff, but can't figure it out, so I'm turning to you all.
hey there,
i've been trrying to calculate the first 10000 fibonacci numbers using a long double. weird thing is that from a certain value it returns Inf.
i'm declaring the vars as
long double var;
and printing them to a file using:
fprintf(filepointer, "%.0Ld\n", var);
am i doing... (1 Reply)
I have a .txt file which contains several lines of text. I need to write a script program using grep or any other unix tool so as to detect part of the text (words) between / / that begin with the symbol ~.
For example if somewhere in the text appears a webpage address like... (8 Replies)
I have been trying to find files containing the words AAA, BBB and CCC.
I tried:
grep AAA `grep BBB files*` grep CCC files*
but is does not work
I tried several ways
this is an easy one but I am a dummy, Does anyone can help me?
Thanks
:( (12 Replies)
Hi frnds
i want to desplay file names that should be word1 and word2
ex :
i have 10 *.log files
5 files having word1 and word2
5 files having only word1,
i have used below command
egrep -l 'word1|word2' *.log
its giving all 10 files, but i want to display only 5... (20 Replies)
to determine if two two doubles are equal, we check to see if
their absolute difference is very close to zero. . .if two numbers
are less than .00001 apart, theyre equal.
keep a count field in each record (as you did in p5).
once the list is complete, ask the user to see if an element
is on... (2 Replies)
Queue on node in domain
description :
type : local
max message len : 104857600
max queue depth : 5000
queue depth max event : enabled
persistent msgs : yes
backout threshold : 0
msg delivery seq :... (4 Replies)
Hi!
I have concatenated two files which are wordlists, i.e., one word per line. The new file contains some doubles, but I cannot use sort and uniq as I need to keep the sort order that it is already in, which is not alphabetical, and uniq only compares adjacent lines, and the doubles are not on... (15 Replies)
Hello,
I have two files. All urls are space seperated.
source
http://xx.yy.zz http://df.ss.sd.xz http://09.09.090.01
http://11.22.33 http://canada.xx.yy http://01.02.03.04
http://33.44.55 http://98.87.76.65 http://russia.xx.zz
http://aa.tt.xx.zz http://1w.2e.3r.4t http://china.rr.tt
... (4 Replies)
Discussion started by: baris35
4 Replies
LEARN ABOUT DEBIAN
an
AN(6) Games Manual AN(6)NAME
an - Anagram generator
SYNOPSIS
an [-w] [-c string] [-d dictionary] [-l number_words] [-m word_length] [-u string] [-n number_anagrams] [-h] [-v] [--words] [--contain
string] [--dict dictionary] [--length number_words] [--minimum word_length] [--used string] [--number number_anagrams] [--help] [--ver-
sion] PHRASE
DESCRIPTION
an finds all anagrams which can be made from the letters in PHRASE, using words in the specified dictionary. The default is to use
/usr/share/dict/words.
OPTIONS -w, --words
Print words that the letters in PHRASE can make, then exit.
-c, --contain string
Only print anagrams which contain string.
-d, --dict dictionary
Use dictionary file to find words which the letters in PHRASE can make.
-m, --minimum word_length
Only include word which are at least word_length long.
-u, --used string
Considers that letters in string have already used when analyzing letters in PHRASE. Like --contain but doesn't print out string.
-l, --length number_words
Finds anagrams which have a maximum of number_words words in them. This is very useful when number of anagrams which are output is
large.
-n, --number number_anagrams
Stops after finding number_anagrams anagrams.
-h, --help
Print a usage message on standard output, then exit.
-v, --version
Print version information on standard output, then exit.
EXAMPLE
an -c imp 'Paul Martin'
Finds anagrams for Paul Martin which contain the word imp.
AUTHOR
Paul Martin <pm@debian.org>
THANKS
Richard Jones (richard@deep-thought.org)
- Coding and algorithm design of original version.
Julian Assange (proff@suburbia.net)
- Algorithm design of original version.
Please note that the email addresses for Richard and Julian are from over ten years ago and probably no longer work.
COPYRIGHT
Copyright (c) Paul Martin 2012. All rights reserved.
AN(6)