EDIT : This is for perl
@data2 = grep(/$data/, @list_now);
This gives me @data2 as
Printing data2 11 testzone1 running /zones/testzone1 ***-*****-****-*****-***** native shared
But I really cant access data2 by its individual elements.
$data2 is the entire list, while $data,2,3...... (1 Reply)
Given an in-between(any node not at the start and end of the linked list) node within a singly linear linked list, how to delete that node, when head pointer of list is not given? (13 Replies)
Hello,
i would make a script that generate SWITCH commands to create zone in a SAN, i have this file:
## zone:z_CGBVMH1_FC0_to_EVA1_CTRL_A_1
p_CGBVMH1_FC0; p_EVA1_CTRL_A_1
## zone:z_CGBVMH1_FC0_to_EVA1_CTRL_B_1
p_CGBVMH1_FC0; p_EVA1_CTRL_B_1
## zone:z_CGBVMH1_FC2_to_EVA1_CTRL_A_1... (2 Replies)
Hello,
I have data which is basically a set of rows in which names having the same homophonic values are stored. I want to convert the data into lines such that the first word of the database is treated as the anchor and each subsequent word is appended to it with a column.
An example... (5 Replies)
Ok this might sound pretty weird but here is the request. Running on a linux system in bash or Perl (i really don't know perl but the end user has a few pearl script already)
Start File looks something like this (4000 entries)
TEST PLAN
T//TF
T-TF
TEST (T)
Hacker
...
I am thinking about... (3 Replies)
Hi
I have been racking my (limited) brains to get this to work without success
I have a file output which is a list of lists - ie a single column of data that is separated by space into sub lists below - I need to both split this so that each list is in a separate column (eg tab or semicolon... (8 Replies)
Hi experts,
I have a very large (1.5M lines), sorted but unstructured list that looks like this:
process_nameA valueA
process_nameA valueA
...
process_nameB valueB
process_nameB valueB
...
process_nameN valueN
I'd like to turn this into a csv.
The values are all... (4 Replies)
Hi,
I'd like to take a list of numbers (with a prefix) and convert to a range, for example:
cn001
cn004
cn016
cn017
cn018
cn019
cn020
cn021
cn031
cn032
cn038
cn042
cn043
cn044
cn045 (5 Replies)
Discussion started by: chrissycc
5 Replies
LEARN ABOUT OPENSOLARIS
ulist
UList(3U) InterViews Reference Manual UList(3U)NAME
UList - circular, doubly-linked list class
SYNOPSIS
#include <Unidraw/ulist.h>
DESCRIPTION
UList implements a circular, doubly-linked list. The sentinel and each entry in the list are instances of the UList class, each containing
a void pointer to the data they contain as well as pointers to the next and previous UList instance in the list. The sentinel UList
instance is considered to represent the list.
PUBLIC OPERATIONS
UList(void* = nil)
Create a new UList instance, optionally supplying the value for the void pointer it stores.
virtual ~UList()
Delete the entire list. Normally the sentinel, which represents the list, is the entry that is deleted explicitly. Note that the
data on the list, stored as void*'s, cannot be deleted in this manner.
void Append(UList*)
void Prepend(UList*)
When performed on the sentinel, Append appends an element to the end of the list and Prepend prepends it to the beginning of the
list. When performed on a UList instance other than the sentinel, Append has the effect of inserting its argument before the
instance, while Prepend has the effect of inserting it after the instance.
void Remove(UList*)
Unlink the specified UList instance from the list it is in. The object on which this operation is called is irrelevant.
void Delete(void*)
Find the UList instance in this list containing the given void pointer, remove it from the list it is in, and delete it.
UList* Find(void*)
Return the UList instance in this list containing the given void pointer.
UList* First()
UList* Last()
UList* End()
UList* Next()
UList* Prev()
Return various UList instance in the list relative to this, i.e., as if it were the sentinel. End returns the sentinel (this) and
is useful for detecting the end of an iteration through the list; the other operations are self-explanatory.
boolean IsEmpty()
Return whether or not the list has any elements.
void* operator()()
Return the void pointer that the UList stores.
UList* operator[](int i)
Return the ith UList in the list, where the next element is the first, etc.
Unidraw 3 October 1990 UList(3U)