Repository navigation
Expand file tree
/
Copy pathrandom_words.cpp
More file actions
138 lines (106 loc) · 3.95 KB
/
Copy pathrandom_words.cpp
File metadata and controls
138 lines (106 loc) · 3.95 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
// ramdom_words.cpp
/*===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
* Author: Vyacheslav Brover
*
* File Description:
* Generate distinct random words
*
*/
#undef NDEBUG
#include "common.hpp"
using namespace Common_sp;
#include "version.inc"
#include "common.inc"
namespace
{
struct ThisApplication : Application
{
ThisApplication ()
: Application ("Generate distinct ASCII-printable random words")
{
version = VERSION;
addPositional ("num", "Number of random words");
addPositional ("len_max", "Max. word length");
addKey ("exclude", "Characters to exclude");
addKey ("exclude_first", "Characters in the beginning of a word to exclude");
addKey ("exclude_last", "Characters at the end of a word to exclude");
addKey ("exclude_double", "Double characters to exclude");
}
void body () const final
{
const size_t num = str2<size_t> (getArg ("num"));
const size_t len_max = str2<size_t> (getArg ("len_max"));
const string exclude = getArg ("exclude");
const string exclude_first = getArg ("exclude_first");
const string exclude_last = getArg ("exclude_last");
const string exclude_double = getArg ("exclude_double");
QC_ASSERT (len_max);
Rand rand (seed_global);
string alphabet;
for (char c = ' ' + 1; c < 127; c++)
if (! contains (exclude, c))
alphabet += c;
string alphabet1;
for (const char c : alphabet)
if (! contains (exclude_first, c))
alphabet1 += c;
Set<string> words;
while (words. size () < num)
{
string s;
FFOR (size_t, i, rand. get (len_max) + 1)
s += i ? alphabet [rand. get (alphabet. size ())]
: alphabet1 [rand. get (alphabet1. size ())];
if (contains (exclude_last, s. back ()))
continue;
bool bad = false;
string dup (" ");
ASSERT (dup. size () == 2);
for (const char c : exclude_double)
{
dup [0] = c;
dup [1] = c;
if (contains (s, dup))
{
bad = true;
break;
}
}
if (bad)
continue;
words << s;
}
for (const string& s : words)
cout << s << endl;
}
};
} // namespace
int main (int argc,
const char* argv[])
{
ThisApplication app;
return app. run (argc, argv);
}