COMPGROUPS.NET | Search | Post Question | Groups | Stream | About | Register

### vxdisk list

• Email
• Follow

Hello,

i used the command vxdisk list in order to list disk information and i
got a flag "reserved", but i don't know what it means.

Has anyone an idea?!

Thanks for explanation.

Friendly regards
Florian

 0

See related articles to this posting

cyber-flo@gmx.de wrote in message news:<ba537148.0310170041.7a08c20c@posting.google.com>...
> Hello,
>
> i used the command vxdisk list in order to list disk information and i
> got a flag "reserved", but i don't know what it means.
>
> Has anyone an idea?!
>
> Thanks for explanation.
>
> Friendly regards
> Florian

What it says, the disk is reserved. You can do this with the vxassist-
command.

CU
Klaus Grote

 0

1 Replies
781 Views

Similar Articles

12/7/2013 6:06:52 AM
page loaded in 64505 ms. (0)

Similar Artilces:

List of a list
Hi, I'm very new to latex. I'm trying to make a list of a list, with: \begin{list}{} \item \begin{list}{} \item \end{list} \end{list} However, I'm getting the error: Runaway argument? ! Paragraph ended before \list was complete. <to be read again> \par l.2273 However, I can do a list of enumerates, but that's not what I want. Is this a clash in syntax? Is there a way to prevent this? Please help. Michael On 1 Nov 2004 00:19:43 -0800, Michael <dayzman@hotmail.com> wrote: > Hi, > I'm very new to latex. I'm trying to make a list of a list, with: > > \begin{list}{} \begin{list} expects two arguments. The first is for the labelling command used by \item, the second is for declarations like setting margins etc. -- Morten H�gholm I haven't got a smelly address. UK-TUG FAQ: <URL:http://www.tex.ac.uk/cgi-bin/texfaq2html> Michael wrote: > Hi, > I'm very new to latex. I'm trying to make a list of a list, with: > > \begin{list}{} > \item > \begin{list}{} > \item > \end{list} > \end{list} If you are really new, perhaps you do not know the `itemize' environment

BCD List to HEX List
Hi, I'm looking for an algo that would convert a list such as: I'm using python to prototype the algo: this will move to C in an embedded system where an int has 16 bits - I do not wish to use any python library. l1 = [1,2,3,4,6,7,8] #represents the decimal number 12345678 l2 = func (l1) # l2 = [0x1, 0x2, 0xD, 0x6, 0x8, 0x7] #represents 0x12D687 Regards, Philippe In <5S8zg.1553$W93.658@dukeread05>, Philippe Martin wrote: > I'm looking for an algo that would convert a list such as: > > I'm using python to prototype the algo: this will move to C in an embedded > system where an int has 16 bits - I do not wish to use any python library. > > l1 = [1,2,3,4,6,7,8] #represents the decimal number 12345678 > l2 = func (l1) > # l2 = [0x1, 0x2, 0xD, 0x6, 0x8, 0x7] #represents 0x12D687 def func(x): result = list(x) result[2:4] = [0xd] result[-1], result[-2] = result[-2], result[-1] return result l1 = [1, 2, 3, 4, 6, 7, 8] l2 = func(l1) print l2 And now please describe you problem a little better. ;-) Ciao, Marc 'BlackJack' Rintsch Marc 'BlackJack' Rintsch wrote: > In <5S8zg.1553$W93.658

tcl list to python list?
Hi, I have a file that contains a "tcl" list stored as a string. The list members are sql commands ex: { begin { select * from foo where baz='whatever'} {select * from gooble } end { insert into bar values('Tom', 25) } } I would like to parse the tcl list into a python list... Any suggestions ( I am running Tkinter...) Jerry jerry.levan@gmail.com wrote: > Hi, > > I have a file that contains a "tcl" list stored as a string. The list > members are > sql commands ex: > { begin { select * from foo > where baz='whatever'} > {select * from gooble } end > { insert into bar values('Tom', 25) } } > > I would like to parse the tcl list into a python list... > > Any suggestions ( I am running Tkinter...) > > Jerry Well, if you know TCL then read the bit about how to write a python list: (http://docs.python.org/tut/node5.html#SECTION005140000000000000000) Then write a TCL function to traverse your TCL list and write it out in the python format. Another suggestion might be to use CSV as an intermediary: http://tcllib.sourceforge.net/doc

LIST extensions
Hello, Sorry to keep flogging this particular topic, but I'm currently up to my eyes in adapting some code from using pointers to using lists (partly for curiosity, partly to avoid nested pointer dereferencing), and I've found the very simple methods below to be useful in dealing with the "is it empty?", "are there nulls in the list?" etc type of questions I've been asking here. Comments? cheers, paulv ;+ ; NAME: ; List::Empty ; ; PURPOSE: ; The List::Empty function method return TRUE if a list contains ; no elements, FALSE otherwise. ; ; CALLING SEQUENCE: ; result = Obj->[List::]Empty() ;- FUNCTION List::Empty RETURN, N_ELEMENTS(self) EQ 0 END ;+ ; NAME: ; List::Length ; ; PURPOSE: ; The List::Length function method returns the number of ; elements in a list. ; ; CALLING SEQUENCE: ; result = Obj->[List::]Length() ;- FUNCTION List::Length RETURN, N_ELEMENTS(self) END ;+ ; NAME: ; List::n_Items ; ; PURPOSE: ; The List::n_Items function method returns the number of ; non-null elements in a list. ; ; CALLING

List or Iterator
Folks Are there any advantages in speed in passing a List or an Iterator as a method parameter, or as a method return value? Any runtime reasons why one should be preferred over the other? Thanks - Adam Adam Lipscombe wrote: > Are there any advantages in speed in passing a List or an Iterator as a > method parameter, or as a method return value? No. > Any runtime reasons why one should be preferred over the other? Yes. Also design reasons. Iterators don't like to share. Using one as a method parameter risks ConcurrentModificationException. It makes perfect sense..., local things. Passing them around willy-nilly will lead to bugs. -- Lew Adam Lipscombe wrote: > Folks > > > Are there any advantages in speed in passing a List or an Iterator as a > method parameter, or as a method return value? Nothing known to me, and if there's any difference at all I'd expect it to be so small that it would be difficult to measure with confidence. > Any runtime reasons why one should be preferred over the other? Yes, of course: There are things that can be done with a List that cannot be done with an Iterator. If you need

list to function
I wanted to know if given a list which has three elements, that are the coefficients of a polynomial, would it be possible to turn that into a function? I tried this: function z=polinomio(a,b,c) z=@(x)a*x^2+b*x+c; end But when I put polinomio(1,2,3), for example, it returns z=@(x)a*x^2+b*x+c. Thanks! "Isabel" <isabels29@hotmail.com> wrote in message <gg4qd1$rbc$1@fred.mathworks.com>... > I wanted to know if given a list which has three elements, that are the coefficients of a polynomial, would it be possible to turn that into a function? > I tried this: >... a list which has three elements, that are the coefficients of a polynomial, would it be possible to turn that into a function? > > I tried this: > > function z=polinomio(a,b,c) > > z=@(x)a*x^2+b*x+c; > > end > > > > But when I put polinomio(1,2,3), for example, it returns z=@(x)a*x^2+b*x+c. > > Thanks! > > I don't see what the problem is. Using your function: > > z = polinomio(1,2,3) > >> z(5) % Evaluate the polynomial for x = 5 > > ans = > The thing is I don't want the value of a number evaluated in the function

list behavior
Hello everybody, I needed to add a list to a dictionary, something very simple: >>> d = {} >>> l = [] >>> l.append(1) >>> d["one"] = l >>> d {'one': [1]} Buen, when I just move the 'append' statement to the dictionary assigment then: >>> l = [] >>> d = {} >>> d["one"] = l.append(1) >>> d {'one': None} Not what I expected, then I came to the conclusion that [].append(value) returns 'None', why? Rene A. Rene Aguirre wrote: > Hello everybody, > > I needed to add a list to a dictionary, something very simple: > >>>>d = {} >>>>l = [] >>>>l.append(1) >>>>d["one"] = l >>>>d > > {'one': [1]} > > Buen, when I just move the 'append' statement to the dictionary > assigment then: > >>>>l = [] >>>>d = {} >>>>d["one"] = l.append(1) >>>>d > > {'one': None} > > Not what I expected, then I came to the conclusion that > [].append(value) returns 'None'

collection list
Pine 4.44 MAIN MENU offers a selection of three from its FOLDER LIST: Incoming-Folders (Incoming Message Folders), Mail (Local folders in mail/), and News.... The first and last seem to work all right. The Mail screen, however, names only one folder and concludes "[ALL of folder list]" when there are actually dozens more folders in the mail directory. What's wrong? -- Dale Wharton ve2ndw@rac.ca M O N T R E A L (Te souviens-tu?) *** Dale Wharton (antve2ndw@rac.camon) wrote in comp.mail.pine today: :) The first and last seem to work all right. The Mail screen, however, :) names only one folder and concludes "[ALL of folder list]" when there :) are actually dozens more folders in the mail directory. What's wrong? Dale, Press M S L to see the definition of the Mail Collection. That says where the folders are located. For example it could say "Mail/". In this case your folders are probably at $HOME/Mail/. If all folders at$HOME/Mail are not being listed, then it could be by several reasons: * The "View" field of the definition of the collection is not empty. * There are hidden folders (folders that begin with a dot

list optimization
Hi all i have implemented a list type as an array of pointer like this typedef struct { int nb_elements; void **elements; } list; to avoid having a pointer for each element as it is done with a recursive definition. the major drawback is that when i want to add an element at the end of the list, i have to allocate an array of nb_elements+1 elements then copy all the elements of the previous array to the new array like this void append (list *l, void *new_element) { int i; void **elements = (void **) malloc(sizeof(void *) * (l->nb_elements+1)); for(i=0; i<l->nb_elements; i++) elements[i] = l->elements[i]; elements[i] = new_element; l->nb_elements++; free(l->elements); l->elements = elements; } which is very time expensive. can anyone tell me of a hint to avoid doing that or to optimize it. note that my first aim is to save as much memory as possible and i didn't find any solution which is cheaper in term of memory. Thanks for any help Sami Evangelista Evangelista Sami wrote: > > Hi all > > i have implemented a list type as an array of pointer like this > > typedef struct { > int nb

list comprehensions
List comprehensions don't work the way you intuitively expect them to work. I realize many people have no intuitions about how list comprehensions 'should' work, so if you recognize yourself in this description, feel free to go back to whatever you were doing before. If you're still here, though, I invite you to consider the following definition: partitions = lambda n: [[n]]+[[k]+x for x in partitions(n-k) for k in range(1,n)] As defined above, the function raises an exception when you call it ('k' referenced before assignment). For the sake of clarity, here is workable code expressing the same intention: def partitions(n): reVal=[[n]] for k in range(1,n): for x in partitions(n-k): reVal.append([k]+x) return reVal So I guess what I want to ask is: Can somebody explain the semantics of list comprehensions to me? Or even better: Can somebody tell me where to look in the documentation to find out about list comprehensions? All donations gratefully received. Peace Elaine Jackson wrote: > List comprehensions don't work the way you intuitively expect them to work. I How can you say such a thing. 100 Haskell