Can someone please tell me how to sort a file, based on a particular position within the file?
I have a line sequential file that is 152 bytes per record, in which i need to sort the file based on the numeric data in positions 142-152.
I have done the "man sort" command and see the -k option... (1 Reply)
Hi,
I am going to sort a huge flat file using sort command, this file is about 36 million lines, 179 fields delimitered by Ctrl B (002). eg.
1^B198709.....
17^B200301....
3^B196511....
.....
I want this file being sorted by the first field, the result is like :
1^B198709........ (2 Replies)
Hi
IŽd like to get a few explanations about how the sort command works when cascading the options.
cscyabl@comet:(develop)> more file
2:A2
2:A1
5:A2
5:A2
10:A1
cscyabl@comet:(develop)> sort -n -u file
2:A1
5:A2
10:A1
cscyabl@comet:(develop)> sort -u -n file
2:A1
5:A2
10:A1... (8 Replies)
Hi i have a file containing ip addresses and want to sort those IP addresses in the ascending order.
file (match.txt) contents are:
192.168.0.100
192.168.0.16
192.168.0.10
192.168.0.23
192.168.0.2
192.168.0.3
192.168.0.1
192.168.0.222
i tried:
sort -n match.txt
output is :... (3 Replies)
Hi to all.
I'm trying to sort this with the Unix command sort.
user1:12345678:3.5:2.5:8:1:2:3
user2:12345679:4.5:3.5:8:1:3:2
user3:12345687:5.5:2.5:6:1:3:2
user4:12345670:5.5:2.5:5:3:2:1
user5:12345671:2.5:5.5:7:2:3:1
I need to get this:
user3:12345687:5.5:2.5:6:1:3:2... (7 Replies)
I have file ipaddress.txt
192.168.1.25
127.3.9.12
192.168.12.1
127.21.2.3
127.92.80.6
192.168.4.5
I want to sort as
127.3.9.12
127.21.2.3
127.92.80.6
192.168.1.25
192.168.12.1
192.168.4.5
So what sort command do I have to use. (1 Reply)
I have a file with the following content:-
181268525,0640613864,B,113,22-dec-2011 14:12:08,
181268525,0640613864,C,113,25-dec-2011 14:18:50,
181268525,0640613864,L,113,26-dec-2011 14:07:46,
181268525,0640613864,X,113,01-jan-2012 16:57:45,
181268525,0640613864,X,113,04-jan-2012 14:13:27,... (3 Replies)
I have an input like
4.3.6.66
4.3.6.67
4.3.6.70
4.3.6.25
4.3.6.15
4.3.6.54
4.3.6.44
4.3.6.34
4.3.6.24
4.3.6.14
4.3.6.53
4.3.6.43
4.3.6.49
4.3.6.33
4.3.6.52
4.3.6.19
4.3.6.58
4.3.6.42 (5 Replies)
Discussion started by: dnam9917
5 Replies
LEARN ABOUT DEBIAN
cdb
cdb(5) File Formats Manual cdb(5)NAME
cdb - Constant DataBase file format
DESCRIPTION
A cdb database is a single file used to map `keys' to `values', having records of (key,value) pairs. File consists of 3 parts: toc (table
of contents), data and index (hash tables).
Toc has fixed length of 2048 bytes, containing 256 pointers to hash tables inside index sections. Every pointer consists of position of a
hash table in bytes from the beginning of a file, and a size of a hash table in entries, both are 4-bytes (32 bits) unsigned integers in
little-endian form. Hash table length may have zero length, meaning that corresponding hash table is empty.
Right after toc section, data section follows without any alingment. It consists of series of records, each is a key length, value (data)
length, key and value. Again, key and value length are 4-byte unsigned integers. Each next record follows previous without any special
alignment.
After data section, index (hash tables) section follows. It should be looked to in conjunction with toc section, where each of max 256
hash tables are defined. Index section consists of series of hash tables, with starting position and length defined in toc section. Every
hash table is a sequence of records each holds two numbers: key's hash value and record position inside data section (bytes from the begin-
ning of a file to first byte of key length starting data record). If record position is zero, then this is an empty hash table slot,
pointed to nowhere.
CDB hash function is
hv = ((hv << 5) + hv) ^ c
for every single c byte of a key, starting with hv = 5381.
Toc section indexed by (hv % 256), i.e. hash value modulo 256 (number of entries in toc section).
In order to find a record, one should: first, compute the hash value (hv) of a key. Second, look to hash table number hv modulo 256. If
it is empty, then there is no such key exists. If it is not empty, then third, loop by slots inside that hash table, starting from slot
with number hv divided by 256 modulo length of that table, or ((hv / 256) % htlen), searching for this hv in hash table. Stop search on
empty slot (if record position is zero) or when all slots was probed (note cyclic search, jumping from end to beginning of a table). When
hash value in question is found in hash table, look to key of corresponding record, comparing it with key in question. If them of the same
length and equals to each other, then record is found, overwise, repeat with next hash table slot. Note that there may be several records
with the same key.
SEE ALSO cdb(1), cdb(3).
AUTHOR
The tinycdb package written by Michael Tokarev <mjt@corpit.ru>, based on ideas and shares file format with original cdb library by Dan
Bernstein.
LICENSE
Public domain.
Apr, 2005 cdb(5)