The sort command creates a sort key for choosen node or element attributes. Sort can be in ascending or decending order and will not alter current mesh object values. One can perform a sort on a single attribute or in the case of index or rank sorting, one can perform a multi-key sort. The sort key that is created can be used in the reorder command to change the node or element ordering of a mesh object.
The command parameters include the cmo_name, followed by the sort_type. The ordering is indicated by ascending or decending. A new attribute is created with the sort_key_name. Sorting is performed on the sort_attributes which can be a single attribute name or a list of attribute names. This list is formed with attribute names in_att1, in_att2, through in_attn.
cmo_name: The choices for first parameter are the name of a valid mesh object or -def- which select the currently active mesh object.
sort_type: The sorting methods include bins, index or rank.
bins A single-key sort which assigns each in_att1 value a bin number. If in_att1 is an integer then bins each have a unique integer value associated with them. If in_att1 is a real number, bins are created with values which are within +-epsilon of each other, where epsilon=1.e-10 *abs( in_att1(1)). If all array values are unique, then the maximum value of the index array will equal the number of entries in the sorted list. Otherwise, the maximum value of the index array will be less than the number of entries in the sorted list but will equal the number of unique entries in the list.
index Constructs a single or multi-key index table such that in_att1(ikey(1)) is the first entry in the sorted array, in_att1(ikey(2)) is the second, etc.
rank Constructs a single or multi-key rank table such that the tables ith entry give the rank of the ith entry of the sorted arrays. The rank table is derived from the index table by:
foreach j = 1,N
rank(index(j)) = j
sort_order: Choose between ascending or decending
ascending Sort sort_attributes in ascending order
decending Sort sort_attributes in decending order
sort_key_name: The name for an integer vector (VINT) which will hold the output sort key values. If the name exists it will be used, if it does not exist it will be created. If no name is given for sort_key_name A name will be created which will be the concatination of ‘ikey_’ and the first attribute name in sort_attributes. (i.e. /-def-/imt will produce a sort key named ikey_imt)
sort_attributes: The name of one or more existing attribute names. Each attribute will be used as a node of element based array upon which the sorting routine will sort. Multi-key sorts can have an arbitrary number of input attributes. Attribute in_att1(n) has priority over in_att2(n) in breaking ties. Note: all attributes are put into a real *8 work array before being sent to the sort routine.
SINGLE KEY FORMAT:
sort / cmo_name / bins / [ ascending decending ] / sort_key_name / sort_attribute
sort/ cmo_name / index rank / [ ascending decending ] / sort_key_name / in_att1, in_att2, in_att3 …
sort / cmo / index / ascending / ikey / imt zic yic xic
Multi-key sort first by imt then to break ties consider z coordinate, then if there are further ties, use y coordinate. Use x coordinate as final tie breaker.
sort / cmo / rank / decending / ikey / yic
Produce ranking of nodes based on y coordinate in decending order.
sort / cmo / index /-def-/-def-/ xic yic zic
Produce index of noded coordinates. This would be like a line sweep sort where the sweep is first along x coordinate then y then z.
sort / cmo / bins / ascending / i_index / xic
sort/ cmo / bins / ascending / j_index / yic
sort / cmo / bins / ascending / k_index / zic
If the cmo were a finite difference grid of points, the above three commands would produce the finite difference indexing. All points with the same x value would be in the same i_index bin, all points with the same y value would be in the same j_index bin, etc.
sort / xyz / bins
Old version no longer supported but syntax will work. Result is the same as previous three commands.
BEGIN OLD FORMAT - No longer supported but syntax will still work.
Old Format - sort / xyz / [ index bins rank ]
sort/xyz/index - sorts the x,y,z coordinate integer arrays i_index, j_index, k_index such that xic(i_index(i)) i=1,..nnodes lists the coordinate in ascending order.
sort/xyz/bins - sorts the x,y,z coordinates and assigns each i_index, j_index, k_index values in ascending order of the bin number of the sorted list.
sort/xyz/rank - sorts the x,y,z coordinates and assigns each i_index, j_index, k_index values the ranking of the node in the sorted list.
If all array values are unique, then the maximum value of the index array will equal the number of entries in the sorted list. Otherwise, the maximum value of the index array will be less than the number of entries in the sorted list but will equal the number of unique entries in the list.
For example given x = 0, 1, 2, 1, 0
sort/xyz/index returns i_index = 5, 1, 4, 2, 3
sort/xyz/bins returns i_index = 1, 2, 3, 2, 1
sort/xyz/rank returns i_index = 2, 4, 5, 3, 1
END OLD FORMAT - No longer supported but syntax will still work.