Get all possible combinations of a word in lower/uppercase letters
Clash Royale CLAN TAG#URR8PPP
I want to write a bash script to print all possible lower and upper case permutations of a certain word, e.g. harley:
harley
harleY
harlEy
harLey
...
HARLey
HARLEy
HARLEY
My naive solution is to write a n-th (n is len(word)) nested for-loop for this specific word:
#!/bin/bash
for a in h,H; do
for b in a,A; do
...
done
done
However, I would have to code the script for a different word again.
Is there a better way to accomplish this?
bash string
add a comment |
I want to write a bash script to print all possible lower and upper case permutations of a certain word, e.g. harley:
harley
harleY
harlEy
harLey
...
HARLey
HARLEy
HARLEY
My naive solution is to write a n-th (n is len(word)) nested for-loop for this specific word:
#!/bin/bash
for a in h,H; do
for b in a,A; do
...
done
done
However, I would have to code the script for a different word again.
Is there a better way to accomplish this?
bash string
add a comment |
I want to write a bash script to print all possible lower and upper case permutations of a certain word, e.g. harley:
harley
harleY
harlEy
harLey
...
HARLey
HARLEy
HARLEY
My naive solution is to write a n-th (n is len(word)) nested for-loop for this specific word:
#!/bin/bash
for a in h,H; do
for b in a,A; do
...
done
done
However, I would have to code the script for a different word again.
Is there a better way to accomplish this?
bash string
I want to write a bash script to print all possible lower and upper case permutations of a certain word, e.g. harley:
harley
harleY
harlEy
harLey
...
HARLey
HARLEy
HARLEY
My naive solution is to write a n-th (n is len(word)) nested for-loop for this specific word:
#!/bin/bash
for a in h,H; do
for b in a,A; do
...
done
done
However, I would have to code the script for a different word again.
Is there a better way to accomplish this?
bash string
bash string
edited Nov 16 '14 at 23:10
Gilles
538k12810881606
538k12810881606
asked Nov 15 '14 at 23:10
polympolym
6,69643158
6,69643158
add a comment |
add a comment |
4 Answers
4
active
oldest
votes
A slightly better solution:
echo h,Ha,Ar,Rl,Le,Ey,Y
For full scalability:
echo harley
| perl -nle 'print "echo ",
join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c ""
If you absolutely must have one word per line, go with
for w in h,Ha,Ar,Rl,Le,Ey,Y;do echo $w;done
thanks to mattdm's comment
The corresponding scalable version would be:
echo harley
| perl -nle 'print join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c 'for w in ;do echo $w;done'
For fun, try replacing "harley" with "supercalifragilisticexpialidocious" It's been 5 minutes and my computer is still crunching on this one and will probably never finish :)
1
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
4
A still simpler one-per-line solution:printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
2
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash'sprintf
– steeldriver
Nov 16 '14 at 13:12
add a comment |
eval echo $(echo "word" | sed 's/./U&,L&/g')
sed 's/./&,&/g'
would turnFoo
intoF,Fo,oo,o
, which would be pretty useless.
But addU
andL
and you get the upper and lower case of each letter;
i.e.,F,fO,oO,o
.- Then it’s a simple matter of using
eval
to tell the shell
to expand the X,x brace sequences.
1
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
add a comment |
EDIT 2: This answer is wrong. It doesn't produce 2^n combinations as it should.
EDIT: I don't know why, but this solution is realy fast compared to the perl solution by @Joeseph R. It runs "Supercalifragilisticexpialidocious" in less than 0.3 seconds!
Here's my crack at it:
#!/bin/bash
str=$1^^ # convert to uppercase
len=$#str # get length of string
for ((perm=0; perm <= len; perm++)); do
for ((i=0; i <= len; i++)); do
lower=$str,, # convert to lowercase
# Uppercase n-th letter for permutation
if [ $perm -gt 0 ]; then
nth=$lower:perm-1
lower=$(echo $lower:0:perm-1$nth^)
fi
echo -n $str:0:i # print orig string from 0 to $i
echo $lower:i # print new string from $i to end
done
done | sort -u
Running it:
$ ./permutations.sh hi
hi
hI
Hi
HI
$ ./permutations.sh harley
harley
harleY
harlEy
harLey
haRley
hArley
Harley
HarleY
HarlEy
HarLey
HaRley
HArley
HArleY
HArlEy
HArLey
HARley
HARleY
HARlEy
HARLey
HARLeY
HARLEy
HARLEY
Feel free to fork and modify it, I'm sure it can be optimized. https://gist.github.com/ryanmjacobs/4c02ad80f833dee0c307
1
The code clearly does not print all results. Withharley
you should have 64 results, where'sharLEY
, for example?
– Denis
Nov 17 '14 at 7:25
1
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
add a comment |
If you prefer to use ready tools instead of coding, you can use TextMechanic (permutation/combination generator tool) and Unit-Conversion.info
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "106"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2funix.stackexchange.com%2fquestions%2f168181%2fget-all-possible-combinations-of-a-word-in-lower-uppercase-letters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
A slightly better solution:
echo h,Ha,Ar,Rl,Le,Ey,Y
For full scalability:
echo harley
| perl -nle 'print "echo ",
join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c ""
If you absolutely must have one word per line, go with
for w in h,Ha,Ar,Rl,Le,Ey,Y;do echo $w;done
thanks to mattdm's comment
The corresponding scalable version would be:
echo harley
| perl -nle 'print join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c 'for w in ;do echo $w;done'
For fun, try replacing "harley" with "supercalifragilisticexpialidocious" It's been 5 minutes and my computer is still crunching on this one and will probably never finish :)
1
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
4
A still simpler one-per-line solution:printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
2
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash'sprintf
– steeldriver
Nov 16 '14 at 13:12
add a comment |
A slightly better solution:
echo h,Ha,Ar,Rl,Le,Ey,Y
For full scalability:
echo harley
| perl -nle 'print "echo ",
join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c ""
If you absolutely must have one word per line, go with
for w in h,Ha,Ar,Rl,Le,Ey,Y;do echo $w;done
thanks to mattdm's comment
The corresponding scalable version would be:
echo harley
| perl -nle 'print join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c 'for w in ;do echo $w;done'
For fun, try replacing "harley" with "supercalifragilisticexpialidocious" It's been 5 minutes and my computer is still crunching on this one and will probably never finish :)
1
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
4
A still simpler one-per-line solution:printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
2
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash'sprintf
– steeldriver
Nov 16 '14 at 13:12
add a comment |
A slightly better solution:
echo h,Ha,Ar,Rl,Le,Ey,Y
For full scalability:
echo harley
| perl -nle 'print "echo ",
join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c ""
If you absolutely must have one word per line, go with
for w in h,Ha,Ar,Rl,Le,Ey,Y;do echo $w;done
thanks to mattdm's comment
The corresponding scalable version would be:
echo harley
| perl -nle 'print join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c 'for w in ;do echo $w;done'
For fun, try replacing "harley" with "supercalifragilisticexpialidocious" It's been 5 minutes and my computer is still crunching on this one and will probably never finish :)
A slightly better solution:
echo h,Ha,Ar,Rl,Le,Ey,Y
For full scalability:
echo harley
| perl -nle 'print "echo ",
join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c ""
If you absolutely must have one word per line, go with
for w in h,Ha,Ar,Rl,Le,Ey,Y;do echo $w;done
thanks to mattdm's comment
The corresponding scalable version would be:
echo harley
| perl -nle 'print join "",map "" . lc . "," .uc ."" split //'
| xargs -I bash -c 'for w in ;do echo $w;done'
For fun, try replacing "harley" with "supercalifragilisticexpialidocious" It's been 5 minutes and my computer is still crunching on this one and will probably never finish :)
edited Apr 13 '17 at 12:36
Community♦
1
1
answered Nov 16 '14 at 4:34
Joseph R.Joseph R.
28.4k375116
28.4k375116
1
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
4
A still simpler one-per-line solution:printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
2
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash'sprintf
– steeldriver
Nov 16 '14 at 13:12
add a comment |
1
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
4
A still simpler one-per-line solution:printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
2
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash'sprintf
– steeldriver
Nov 16 '14 at 13:12
1
1
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
for w in h,Ha,Ar,Rl,Le,Ey,Y; do echo $w;done
– mattdm
Nov 16 '14 at 4:58
4
4
A still simpler one-per-line solution:
printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
A still simpler one-per-line solution:
printf '%sn' h,Ha,Ar,Rl,Le,Ey,Y
– John1024
Nov 16 '14 at 7:42
2
2
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash's
printf
– steeldriver
Nov 16 '14 at 13:12
@John1024 I encourage you to post that as an answer, it is an under-appreciated feature of bash's
printf
– steeldriver
Nov 16 '14 at 13:12
add a comment |
eval echo $(echo "word" | sed 's/./U&,L&/g')
sed 's/./&,&/g'
would turnFoo
intoF,Fo,oo,o
, which would be pretty useless.
But addU
andL
and you get the upper and lower case of each letter;
i.e.,F,fO,oO,o
.- Then it’s a simple matter of using
eval
to tell the shell
to expand the X,x brace sequences.
1
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
add a comment |
eval echo $(echo "word" | sed 's/./U&,L&/g')
sed 's/./&,&/g'
would turnFoo
intoF,Fo,oo,o
, which would be pretty useless.
But addU
andL
and you get the upper and lower case of each letter;
i.e.,F,fO,oO,o
.- Then it’s a simple matter of using
eval
to tell the shell
to expand the X,x brace sequences.
1
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
add a comment |
eval echo $(echo "word" | sed 's/./U&,L&/g')
sed 's/./&,&/g'
would turnFoo
intoF,Fo,oo,o
, which would be pretty useless.
But addU
andL
and you get the upper and lower case of each letter;
i.e.,F,fO,oO,o
.- Then it’s a simple matter of using
eval
to tell the shell
to expand the X,x brace sequences.
eval echo $(echo "word" | sed 's/./U&,L&/g')
sed 's/./&,&/g'
would turnFoo
intoF,Fo,oo,o
, which would be pretty useless.
But addU
andL
and you get the upper and lower case of each letter;
i.e.,F,fO,oO,o
.- Then it’s a simple matter of using
eval
to tell the shell
to expand the X,x brace sequences.
answered Nov 18 '14 at 1:45
ScottScott
6,94152750
6,94152750
1
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
add a comment |
1
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
1
1
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
Nice trick :). If I could accept two answers, yours would be accepted, too! Upvote anyway
– polym
Nov 19 '14 at 10:25
add a comment |
EDIT 2: This answer is wrong. It doesn't produce 2^n combinations as it should.
EDIT: I don't know why, but this solution is realy fast compared to the perl solution by @Joeseph R. It runs "Supercalifragilisticexpialidocious" in less than 0.3 seconds!
Here's my crack at it:
#!/bin/bash
str=$1^^ # convert to uppercase
len=$#str # get length of string
for ((perm=0; perm <= len; perm++)); do
for ((i=0; i <= len; i++)); do
lower=$str,, # convert to lowercase
# Uppercase n-th letter for permutation
if [ $perm -gt 0 ]; then
nth=$lower:perm-1
lower=$(echo $lower:0:perm-1$nth^)
fi
echo -n $str:0:i # print orig string from 0 to $i
echo $lower:i # print new string from $i to end
done
done | sort -u
Running it:
$ ./permutations.sh hi
hi
hI
Hi
HI
$ ./permutations.sh harley
harley
harleY
harlEy
harLey
haRley
hArley
Harley
HarleY
HarlEy
HarLey
HaRley
HArley
HArleY
HArlEy
HArLey
HARley
HARleY
HARlEy
HARLey
HARLeY
HARLEy
HARLEY
Feel free to fork and modify it, I'm sure it can be optimized. https://gist.github.com/ryanmjacobs/4c02ad80f833dee0c307
1
The code clearly does not print all results. Withharley
you should have 64 results, where'sharLEY
, for example?
– Denis
Nov 17 '14 at 7:25
1
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
add a comment |
EDIT 2: This answer is wrong. It doesn't produce 2^n combinations as it should.
EDIT: I don't know why, but this solution is realy fast compared to the perl solution by @Joeseph R. It runs "Supercalifragilisticexpialidocious" in less than 0.3 seconds!
Here's my crack at it:
#!/bin/bash
str=$1^^ # convert to uppercase
len=$#str # get length of string
for ((perm=0; perm <= len; perm++)); do
for ((i=0; i <= len; i++)); do
lower=$str,, # convert to lowercase
# Uppercase n-th letter for permutation
if [ $perm -gt 0 ]; then
nth=$lower:perm-1
lower=$(echo $lower:0:perm-1$nth^)
fi
echo -n $str:0:i # print orig string from 0 to $i
echo $lower:i # print new string from $i to end
done
done | sort -u
Running it:
$ ./permutations.sh hi
hi
hI
Hi
HI
$ ./permutations.sh harley
harley
harleY
harlEy
harLey
haRley
hArley
Harley
HarleY
HarlEy
HarLey
HaRley
HArley
HArleY
HArlEy
HArLey
HARley
HARleY
HARlEy
HARLey
HARLeY
HARLEy
HARLEY
Feel free to fork and modify it, I'm sure it can be optimized. https://gist.github.com/ryanmjacobs/4c02ad80f833dee0c307
1
The code clearly does not print all results. Withharley
you should have 64 results, where'sharLEY
, for example?
– Denis
Nov 17 '14 at 7:25
1
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
add a comment |
EDIT 2: This answer is wrong. It doesn't produce 2^n combinations as it should.
EDIT: I don't know why, but this solution is realy fast compared to the perl solution by @Joeseph R. It runs "Supercalifragilisticexpialidocious" in less than 0.3 seconds!
Here's my crack at it:
#!/bin/bash
str=$1^^ # convert to uppercase
len=$#str # get length of string
for ((perm=0; perm <= len; perm++)); do
for ((i=0; i <= len; i++)); do
lower=$str,, # convert to lowercase
# Uppercase n-th letter for permutation
if [ $perm -gt 0 ]; then
nth=$lower:perm-1
lower=$(echo $lower:0:perm-1$nth^)
fi
echo -n $str:0:i # print orig string from 0 to $i
echo $lower:i # print new string from $i to end
done
done | sort -u
Running it:
$ ./permutations.sh hi
hi
hI
Hi
HI
$ ./permutations.sh harley
harley
harleY
harlEy
harLey
haRley
hArley
Harley
HarleY
HarlEy
HarLey
HaRley
HArley
HArleY
HArlEy
HArLey
HARley
HARleY
HARlEy
HARLey
HARLeY
HARLEy
HARLEY
Feel free to fork and modify it, I'm sure it can be optimized. https://gist.github.com/ryanmjacobs/4c02ad80f833dee0c307
EDIT 2: This answer is wrong. It doesn't produce 2^n combinations as it should.
EDIT: I don't know why, but this solution is realy fast compared to the perl solution by @Joeseph R. It runs "Supercalifragilisticexpialidocious" in less than 0.3 seconds!
Here's my crack at it:
#!/bin/bash
str=$1^^ # convert to uppercase
len=$#str # get length of string
for ((perm=0; perm <= len; perm++)); do
for ((i=0; i <= len; i++)); do
lower=$str,, # convert to lowercase
# Uppercase n-th letter for permutation
if [ $perm -gt 0 ]; then
nth=$lower:perm-1
lower=$(echo $lower:0:perm-1$nth^)
fi
echo -n $str:0:i # print orig string from 0 to $i
echo $lower:i # print new string from $i to end
done
done | sort -u
Running it:
$ ./permutations.sh hi
hi
hI
Hi
HI
$ ./permutations.sh harley
harley
harleY
harlEy
harLey
haRley
hArley
Harley
HarleY
HarlEy
HarLey
HaRley
HArley
HArleY
HArlEy
HArLey
HARley
HARleY
HARlEy
HARLey
HARLeY
HARLEy
HARLEY
Feel free to fork and modify it, I'm sure it can be optimized. https://gist.github.com/ryanmjacobs/4c02ad80f833dee0c307
edited Nov 18 '14 at 0:52
answered Nov 16 '14 at 3:28
ryanmjacobsryanmjacobs
29127
29127
1
The code clearly does not print all results. Withharley
you should have 64 results, where'sharLEY
, for example?
– Denis
Nov 17 '14 at 7:25
1
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
add a comment |
1
The code clearly does not print all results. Withharley
you should have 64 results, where'sharLEY
, for example?
– Denis
Nov 17 '14 at 7:25
1
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
1
1
The code clearly does not print all results. With
harley
you should have 64 results, where's harLEY
, for example?– Denis
Nov 17 '14 at 7:25
The code clearly does not print all results. With
harley
you should have 64 results, where's harLEY
, for example?– Denis
Nov 17 '14 at 7:25
1
1
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
@Denis Yup you're right. Every time there should be 2^n results, where n is the number of characters of the original string. This answer is wrong.
– ryanmjacobs
Nov 18 '14 at 0:50
add a comment |
If you prefer to use ready tools instead of coding, you can use TextMechanic (permutation/combination generator tool) and Unit-Conversion.info
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
add a comment |
If you prefer to use ready tools instead of coding, you can use TextMechanic (permutation/combination generator tool) and Unit-Conversion.info
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
add a comment |
If you prefer to use ready tools instead of coding, you can use TextMechanic (permutation/combination generator tool) and Unit-Conversion.info
If you prefer to use ready tools instead of coding, you can use TextMechanic (permutation/combination generator tool) and Unit-Conversion.info
answered Jan 30 at 16:41
Mixed upMixed up
11
11
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
add a comment |
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
How would they get and use those tools, exactly?
– Jeff Schaller
Jan 30 at 16:54
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
This answer could be greatly improved by adding a few details such as the home pages or GitHub repositories for these projects and/or if they can be installed from a package.
– Anthony Geoghegan
Jan 30 at 16:57
add a comment |
Thanks for contributing an answer to Unix & Linux Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2funix.stackexchange.com%2fquestions%2f168181%2fget-all-possible-combinations-of-a-word-in-lower-uppercase-letters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown