10 More Discussions You Might Find Interesting
1. Red Hat
Hello All,
I have a Red Hat Linux 5.9 Server installed with one hard disk & 2 Partitions created on it as follows,
/boot - Linux Partition & another is
LVM - One VG & under that 5-6 Logical volumes(var,opt,home etc).
Here my requirement is to take out 1GB of space from LVM ( Any logical... (5 Replies)
Discussion started by: gr8_usk
5 Replies
2. Filesystems, Disks and Memory
Hi Experts
I would like to know different between soft partition concept and hard partition concept on solaris.
Here is little explanation between soft partition concept and hard partition concept on solaris.
Soft Partition:
1TB total space available in storage in all mapped to the OS to... (2 Replies)
Discussion started by: edydsuranta
2 Replies
3. Solaris
hi all
while formatting hard disk i am getting following error.
Partition 1 ends at 266338338
It must be between 34 and 143374704.
label error: EFI Labels do not support overlapping partitions
Partition 8 overlaps partition 1.
Warning: error writing EFI.
Label failed.
I have formatted the... (2 Replies)
Discussion started by: nikhil kasar
2 Replies
4. Shell Programming and Scripting
Hello Everyone! I have a file called “cells” with 3 set of #'s, roughly 400+ lines. My current tool "movrcs" grabs the “cells” file, and creates one huge “mov_rcs” script which is a problem. I want the tool to grab 20 lines of the "cells" file at a time, and create separate script files for... (3 Replies)
Discussion started by: birdboyee
3 Replies
5. Shell Programming and Scripting
Gentleman,
Please move if I have chose the incorrect forum section. I am trying to move data that is not backed up from partition 1 to partition 2 on a SAN that has a GFS2 filesystem. Since the data is not backed up I am rsyncing this data and once verified I will delete from the source... (6 Replies)
Discussion started by: jaysunn
6 Replies
6. UNIX for Dummies Questions & Answers
I've created a partition with GNU Parted, how do I mount the partition?
The manual information at http://www.gnu.org/software/parted/manual/parted.html is good, but I am sure about how I mount the partition afterwards.
Thanks,
--Todd (1 Reply)
Discussion started by: jtp51
1 Replies
7. UNIX for Dummies Questions & Answers
hi,
1) is logical partition the same as physical partition except that one is physical and the other is logical?
2) then it must a one to one ratio? (3 Replies)
Discussion started by: yls177
3 Replies
8. Filesystems, Disks and Memory
I'm using PartitionMagic's wizard to partition my drive for Linux, and after I get past the first step it asks if I want to screate a seperate Linux Swap Partition. What is a Linux Swap Partition and is something I need/should have? (10 Replies)
Discussion started by: Tradewynd
10 Replies
9. UNIX for Dummies Questions & Answers
i have a second HD installed on my computer, which came partioned in 3 fragments..how do i get rid of the partitions...
i dont know how to use F disk
thanks:D (5 Replies)
Discussion started by: pops
5 Replies
10. UNIX for Dummies Questions & Answers
How do I create a new Disk partition in HP-unix machine??? (1 Reply)
Discussion started by: chakradharm
1 Replies
struct::disjointset(3tcl) Tcl Data Structures struct::disjointset(3tcl)
__________________________________________________________________________________________________________________________________________________
NAME
struct::disjointset - Disjoint set data structure
SYNOPSIS
package require Tcl 8.4
package require struct::disjointset ?1.0?
::struct::disjointset disjointsetName
disjointsetName option ?arg arg ...?
disjointsetName add-partition elements
disjointsetName partitions
disjointsetName num-partitions
disjointsetName equal a b
disjointsetName merge a b
disjointsetName find e
disjointsetName destroy
_________________________________________________________________
DESCRIPTION
This package provides disjoint sets. An alternative name for this kind of structure is merge-find.
Normally when dealing with sets and their elements the question is "Is this element E contained in this set S?", with both E and S known.
Here the question is "Which of several sets contains the element E?". I.e. while the element is known, the set is not, and we wish to find
it quickly. It is not quite the inverse of the original question, but close. Another operation which is often wanted is that of quickly
merging two sets into one, with the result still fast for finding elements. Hence the alternative term merge-find for this.
Why now is this named a disjoint-set ? Because another way of describing the whole situation is that we have
o a finite set S, containing
o a number of elements E, split into
o a set of partitions P. The latter term applies, because the intersection of each pair P, P' of partitions is empty, with the union
of all partitions covering the whole set.
o An alternative name for the partitions would be equvalence classes, and all elements in the same class are considered as equal.
Here is a pictorial representation of the concepts listed above:
+-----------------+ The outer lines are the boundaries of the set S.
| / | The inner regions delineated by the skewed lines
| * / * | are the partitions P. The *'s denote the elements
| * / | E in the set, each in a single partition, their
|* / | equivalence class.
| / * |
| / * / |
| * / * / |
| / / |
| / / * |
| / * |
| / * |
+-----------------+
For more information see http://en.wikipedia.org/wiki/Disjoint_set_data_structure.
API
The package exports a single command, ::struct::disjointset. All functionality provided here can be reached through a subcommand of this
command.
::struct::disjointset disjointsetName
Creates a new disjoint set object with an associated global Tcl command whose name is disjointsetName. This command may be used to
invoke various operations on the disjointset. It has the following general form:
disjointsetName option ?arg arg ...?
The option and the args determine the exact behavior of the command. The following commands are possible for disjointset
objects:
disjointsetName add-partition elements
Creates a new partition in specified disjoint set, and fills it with the values found in the set of elements. The command maintains
the integrity of the disjoint set, i.e. it verifies that none of the elements are already part of the disjoint set and throws an
error otherwise.
The result of the command is the empty string.
disjointsetName partitions
Returns the set of partitions the named disjoint set currently consists of.
disjointsetName num-partitions
Returns the number of partitions the named disjoint set currently consists of.
disjointsetName equal a b
Determines if the two elements a and b of the disjoint set belong to the same partition. The result of the method is a boolean
value, True if the two elements are contained in the same partition, and False otherwise.
An error will be thrown if either a or b are not elements of the disjoint set.
disjointsetName merge a b
Determines the partitions the elements a and b are contained in and merges them into a single partition. If the two elements were
already contained in the same partition nothing will change.
The result of the method is the empty string.
disjointsetName find e
Returns the partition of the disjoint set which contains the element e.
disjointsetName destroy
Destroys the disjoint set object and all associated memory.
BUGS, IDEAS, FEEDBACK
This document, and the package it describes, will undoubtedly contain bugs and other problems. Please report such in the category struct
:: disjointset of the Tcllib SF Trackers [http://sourceforge.net/tracker/?group_id=12883]. Please also report any ideas for enhancements
you may have for either package and/or documentation.
KEYWORDS
disjoint set, equivalence class, find, merge find, partition, partitioned set, union
CATEGORY
Data structures
struct 1.0 struct::disjointset(3tcl)