Python: module ranger.ext.openstruct

From ef0157ff37404cf757f57711c62bb352a2971fa6 Mon Sep 17 00:00:00 2001 From: hut Date: Sun, 16 May 2010 16:28:42 +0200 Subject: updated pydoc --- doc/pydoc/ranger.ext.openstruct.html | 38 +++++++++++++----------------------- 1 file changed, 14 insertions(+), 24 deletions(-) (limited to 'doc/pydoc/ranger.ext.openstruct.html') diff --git a/doc/pydoc/ranger.ext.openstruct.html b/doc/pydoc/ranger.ext.openstruct.html index d4340807..17a6525f 100644 --- a/doc/pydoc/ranger.ext.openstruct.html +++ b/doc/pydoc/ranger.ext.openstruct.html @@ -1,6 +1,6 @@ - Python: module ranger.ext.openstruct + @@ -8,7 +8,7 @@

ranger.ext.openstruct

index
/home/hut/ranger/ranger/ext/openstruct.py

+>index
/home/hut/code/ranger/ranger/ext/openstruct.py

__builtin__.dict(__builtin__.object) +
builtins.dict(builtins.object): OpenStruct @@ -42,15 +42,15 @@ +class OpenStruct(builtins.dict) - +

-class OpenStruct(__builtin__.dict)

    The fusion of dict and struct
The fusion of dict and struct

Method resolution order:

OpenStruct
-
__builtin__.dict
-
__builtin__.object
+
builtins.dict
+
builtins.object

Methods defined here:
@@ -65,9 +65,7 @@ Data descriptors defined here:

list of weak references to the object (if defined)

-Methods inherited from __builtin__.dict:
-
__cmp__(...)
x.__cmp__(y) <==> cmp(x,y)
- +Methods inherited from builtins.dict:

__contains__(...)
D.__contains__(k) -> True if D has a key k, else False

__delitem__(...)
x.__delitem__(y) <==> del x[y]
@@ -104,17 +102,9 @@ Methods inherited from __builtin__.dict:

get(...)
D.get(k[,d]) -> D[k] if k in D, else d.  d defaults to None.
-
has_key(...)
D.has_key(k) -> True if D has a key k, else False
- -
items(...)
D.items() -> list of D's (key, value) pairs, as 2-tuples
- -
iteritems(...)
D.iteritems() -> an iterator over the (key, value) items of D
- -
iterkeys(...)
D.iterkeys() -> an iterator over the keys of D
- -
itervalues(...)
D.itervalues() -> an iterator over the values of D
+
items(...)
D.items() -> a set-like object providing a view on D's items
-
keys(...)
D.keys() -> list of D's keys
+
keys(...)
D.keys() -> a set-like object providing a view on D's keys

pop(...)
D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised
@@ -124,20 +114,20 @@ If key is not found, d is returned if&nb
setdefault(...)
D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D
-
update(...)
D.update(E, **F) -> None.  Update D from dict/iterable E and F. +update(...) D.update(E, **F) -> None.  Update D from dict/iterable E and F. If E has a .keys() method, does:     for k in E: D[k] = E[k] If E lacks .keys() method, does:     for (k, v) in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k] -values(...) D.values() -> list of D's values +values(...) D.values() -> an object providing a view on D's values -Data and other attributes inherited from __builtin__.dict: +Data and other attributes inherited from builtins.dict: __hash__ = None __new__ = <built-in method __new__ of type object> T.__new__(S, ...) -> a new object with type S, a subtype of T -fromkeys = <built-in method fromkeys of type object> dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v. +fromkeys = <built-in method fromkeys of type object> dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v. v defaults to None.
-- cgit 1.4.1-2-gfad0

-class OpenStruct(__builtin__.dict)
	`The fusion of dict and struct`
	`The fusion of dict and struct`
	Method resolution order: OpenStruct - __builtin__.dict - __builtin__.object + builtins.dict + builtins.object Methods defined here: @@ -65,9 +65,7 @@ Data descriptors defined here: `list of weak references to the object (if defined)` -Methods inherited from __builtin__.dict: - __cmp__(...) `x.__cmp__(y) <==> cmp(x,y)` - +Methods inherited from builtins.dict: __contains__(...) `D.__contains__(k) -> True if D has a key k, else False` __delitem__(...) `x.__delitem__(y) <==> del x[y]` @@ -104,17 +102,9 @@ Methods inherited from __builtin__.dict: get(...) `D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.` - has_key(...) `D.has_key(k) -> True if D has a key k, else False` - - items(...) `D.items() -> list of D's (key, value) pairs, as 2-tuples` - - iteritems(...) `D.iteritems() -> an iterator over the (key, value) items of D` - - iterkeys(...) `D.iterkeys() -> an iterator over the keys of D` - - itervalues(...) `D.itervalues() -> an iterator over the values of D` + items(...) `D.items() -> a set-like object providing a view on D's items` - keys(...) `D.keys() -> list of D's keys` + keys(...) `D.keys() -> a set-like object providing a view on D's keys` pop(...) `D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised` @@ -124,20 +114,20 @@ If key is not found, d is returned if&nb setdefault(...) `D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D` - update(...) D.update(E, F) -> None. Update D from dict/iterable E and F. +update(...) D.update(E, F) -> None. Update D from dict/iterable E and F. If E has a .keys() method, does: for k in E: D[k] = E[k] If E lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k] -values(...) D.values() -> list of D's values +values(...) D.values() -> an object providing a view on D's values -Data and other attributes inherited from __builtin__.dict: +Data and other attributes inherited from builtins.dict: __hash__ = None __new__ = <built-in method __new__ of type object> T.__new__(S, ...) -> a new object with type S, a subtype of T -fromkeys = <built-in method fromkeys of type object> dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v. +fromkeys = <built-in method fromkeys of type object> dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v. v defaults to None.