02-08-2020
sort -k4n -k1,1M -k2,3n file worked perfectly. Thank you so much!
Last edited by Scrutinizer; 02-08-2020 at 08:24 AM..
Reason: icode tags
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I check the man page but I still cannot see what this command is supposed to do
sort +5 -6 <file>
It just seems to sort the file as normal??
Thanks
Calypso (3 Replies)
Discussion started by: Calypso
3 Replies
2. Shell Programming and Scripting
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)
Discussion started by: daniel.gbaena
7 Replies
3. UNIX for Advanced & Expert Users
Hello all -
I am to this forum and fairly new in learning unix and finding some difficulty in preparing a small shell script. I am trying to make script to sort all the files given by user as input (either the exact full name of the file or say the files matching the criteria like all files... (3 Replies)
Discussion started by: pankaj80
3 Replies
4. Shell Programming and Scripting
Hello Everybody :) !!!. i have question in mind, is it possible to sort a list of hexadecimal numbers using "sort" command? (9 Replies)
Discussion started by: Kesavan
9 Replies
5. Shell Programming and Scripting
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
6. Shell Programming and Scripting
sort --random-sort
The full command is
path=`find /testdir -maxdepth 1 -mindepth 1 -type d | ***Some sort of sort function*** | head -1`
I have a list I want to randomly sort. It works fine in ubuntu but on a 'osx lion' sort dosen't have the --random-sort option.
I don't want to... (5 Replies)
Discussion started by: digitalviking
5 Replies
7. Shell Programming and Scripting
Input file:
100%ABC2 3.44E-12 USA
A2M%H02579 0E0 UK
100%ABC2 5.34E-8 UK
100%ABC2 3.25E-12 USA
A2M%H02579 5E-45 UK
Output file:
100%ABC2 3.44E-12 USA
100%ABC2 3.25E-12 USA
100%ABC2 5.34E-8 UK
A2M%H02579 0E0 UK
A2M%H02579 5E-45 UK
Code try:
sort -k1,1 -g -k2 -r input.txt... (2 Replies)
Discussion started by: perl_beginner
2 Replies
8. Shell Programming and Scripting
Hi Experts,
I have a filelist collected from another server , now want to sort the output using date/time stamp filed.
- Filed 6, 7,8 are showing the date/time/stamp.
Here is the input:
#----------------------------------------------------------------------
-rw------- 1 root ... (3 Replies)
Discussion started by: rveri
3 Replies
9. UNIX for Beginners Questions & Answers
Hi,
Could anyone kindly show me a link or explain the difference between
sort -n -k2 -k3 & sort -n -k2,3
Also, if I like to remove the row with repetition at both $2 and $3, Can I safely use
sort -u -k2 -k3
Example;
100 20 30
100 20 30
So, both $2 and $3 are same and I... (2 Replies)
Discussion started by: Indra2011
2 Replies
10. Shell Programming and Scripting
How to sort the following output based on lowest to highest BE?
The following sort does not work.
$ sort -t. -k1,1n -k2,2n bfd.txt
BE31.116 0s 0s DOWN DAMP
BE31.116 0s 0s DOWN DAMP
BE31.117 0s 0s ... (7 Replies)
Discussion started by: sand1234
7 Replies
LEARN ABOUT DEBIAN
xml::filter::sort::buffer
XML::Filter::Sort::Buffer(3pm) User Contributed Perl Documentation XML::Filter::Sort::Buffer(3pm)
NAME
XML::Filter::Sort::Buffer - Implementation class used by XML::Filter::Sort
DESCRIPTION
The documentation is targetted at developers wishing to extend or replace this class. For user documentation, see XML::Filter::Sort.
For an overview of the classes and methods used for buffering, see XML::Filter::Sort::BufferMgr.
BUFFER LIFE CYCLE
A XML::Filter::Sort::Buffer object is created by a XML::Filter::Sort::BufferMgr object using the "new()" method.
The XML::Filter::Sort object will then propagate any SAX events it receives, to the buffer object until the end of the record is reached.
As each element is added to the buffer, its contents are compared to the sort key paths and the sort key values are extracted.
When the end of the record is reached, the "close()" method is called. The return value from this method is the list of sort keys.
The buffer manager will store the buffer until the end of the record sequence is reached. Then it will retrieve each buffer in order of
the sort key values and call the buffer's "to_sax()" method to send all buffered events to the downstream handler.
Following the call to "to_sax()", the buffer is discarded. No destructor method is used - everything is handled by Perl's garbage
collector.
DATA STRUCTURES
The buffer contains a 'tree' of SAX events. The tree is simply an array of 'nodes'. Text nodes are represented as scalars. Other nodes
are represented as arrayrefs. The first element of a node array is a single character identifying the node type:
e - element
c - comment
p - processing instruction
The second element is the node data (the hash from the original SAX event). The child nodes of an element node are represented by the
third element as an arrayref.
For example, this XML:
<person age="27">
<lastname>smith</lastname>
</person>
Would be buffered as this data structure:
[
[
'e',
{
'Name' => 'person'
'Prefix' => '',
'LocalName' => 'person',
'NamespaceURI' => '',
'Attributes' => {
'{}age' => {
'LocalName' => 'age',
'NamespaceURI' => '',
'Value' => '27',
'Prefix' => '',
'Name' => 'age'
}
},
},
[
"
",
[
'e',
{
'Name' => 'lastname'
'Prefix' => '',
'LocalName' => 'lastname',
'NamespaceURI' => '',
'Attributes' => {},
},
[
'smith'
]
],
"
",
]
]
]
COPYRIGHT
Copyright 2002 Grant McLean <grantm@cpan.org>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.12.4 2005-04-20 XML::Filter::Sort::Buffer(3pm)