11-30-2015
Hi LMHmedchem...
You do realise that this 23 bit word would give 8388607 combinations if all bits were set to 1?!
Is this a possibility along with just any single random bit which would not have a subset at all...
Or am I missing something?
This User Gave Thanks to wisecracker For This Post:
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Having problem in using the grep command to select all possible combinations a number in a file. Example: 123, I would like to grep the numbers 123,132,213,231,312 and 321. (2 Replies)
Discussion started by: wperry
2 Replies
2. UNIX for Advanced & Expert Users
Hello All,
i have two files, one of the format
A 123
B 124
C 234
D 345
And the other
A 678
B 789
C 689
D 567
I would like to combine them into one file with three columns:
A 123 678
B 124 789
C 234 689 (4 Replies)
Discussion started by: Khoomfire
4 Replies
3. UNIX for Advanced & Expert Users
Hi,
I am using the Korn-Shell (ksh) and would like to know all the shortcut keys. For example: Shift + Insert etc.
Thank you very much.
Take care (0 Replies)
Discussion started by: --crimson--
0 Replies
4. Shell Programming and Scripting
Hi,
I need to generate all combinations upto n-1 level,
if the input file looks like say,
A
B
C
D
.
.
....
I need to generate all combinations such that first value remains constant and the remaning are combined with all possible ways.
Output
A
AB
AC
AD
ABC (1 Reply)
Discussion started by: zorg4u
1 Replies
5. Programming
HI I have a series(sorted), which i require to create combinations. I am not getting the good code for doing this. My series should generate the following combinations... Please help me in getting this in C++. Thanks for your help.
A:
A
A B:
A
B
A B
A B C:
A
... (1 Reply)
Discussion started by: rameshmelam
1 Replies
6. Linux
Hi Team
when i do, echo on my host box it returns (see below)
# echo $PS1
\$
I need to set a color comination of my own
for \u means for user : red
for \h means for hostname: blue
for \W means present working directory: pink
for $ means for wht prompt : yellow
Do i need to... (1 Reply)
Discussion started by: whizkidash
1 Replies
7. Shell Programming and Scripting
Hello Scrutinizer / Group ,
The shell script of awk that Scrutinizer made calculate all possible permutations in this case 3125 (5 numbers) but i want to have only the 126 possible combination. For now it does not matter the specific order of the combination numbers.
I would appreciate it you... (1 Reply)
Discussion started by: csierra
1 Replies
8. Programming
How can I get all combinations of 5 words from 10 words.
For example I have 3 words and I want to get all combinations of 2 words.
"A", "B", "C" it would like AB, BC, AC.
Maybe you know some usefull code or example.
Thanx a lot.
P.S. Sorry if I'm not right enough cause I don't know English... (2 Replies)
Discussion started by: romeo5577
2 Replies
9. Shell Programming and Scripting
Hi,
I have an input file like this
a
b
c
d
I want to print all possible combinations between these records in the following way
aVSb
aVSc
aVSd
bVSc
bVSd
cVSd
VS indicates versus. All thoughts are appreciated. (5 Replies)
Discussion started by: jacobs.smith
5 Replies
10. Shell Programming and Scripting
hello,
I'm reading this thread, in which there is this code :awk '
function comb(v,i) {
for(i in A) {
delete A;
if(length(A))
comb((v?v"+":x)i)
else print v"+"i
A;
}
}
{ A }
END {
comb();
} ' infilebut I can't understand where does v come... (5 Replies)
Discussion started by: daPeach
5 Replies
LEARN ABOUT CENTOS
bitmap_remap
BITMAP_REMAP(9) Basic Kernel Library Functions BITMAP_REMAP(9)
NAME
bitmap_remap - Apply map defined by a pair of bitmaps to another bitmap
SYNOPSIS
void bitmap_remap(unsigned long * dst, const unsigned long * src, const unsigned long * old, const unsigned long * new, int bits);
ARGUMENTS
dst
remapped result
src
subset to be remapped
old
defines domain of map
new
defines range of map
bits
number of bits in each of these bitmaps
DESCRIPTION
Let old and new define a mapping of bit positions, such that whatever position is held by the n-th set bit in old is mapped to the n-th set
bit in new. In the more general case, allowing for the possibility that the weight 'w' of new is less than the weight of old, map the
position of the n-th set bit in old to the position of the m-th set bit in new, where m == n % w.
If either of the old and new bitmaps are empty, or if src and dst point to the same location, then this routine copies src to dst.
The positions of unset bits in old are mapped to themselves (the identify map).
Apply the above specified mapping to src, placing the result in dst, clearing any bits previously set in dst.
For example, lets say that old has bits 4 through 7 set, and new has bits 12 through 15 set. This defines the mapping of bit position 4 to
12, 5 to 13, 6 to 14 and 7 to 15, and of all other bit positions unchanged. So if say src comes into this routine with bits 1, 5 and 7 set,
then dst should leave with bits 1, 13 and 15 set.
COPYRIGHT
Kernel Hackers Manual 3.10 June 2014 BITMAP_REMAP(9)