pymel.util.arguments.ProxyUnicode¶

digraph inheritance9cb2d57c17 { rankdir=TB; ranksep=0.15; nodesep=0.15; size="8.0, 12.0"; "ProxyUnicode" [fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",URL="../pymel.util.utilitytypes/pymel.util.utilitytypes.ProxyUnicode.html#pymel.util.utilitytypes.ProxyUnicode",style="setlinewidth(0.5)",height=0.25,shape=box,fontsize=8]; }

class ProxyUnicode¶

__add__(*args, **kwargs)¶

x.__add__(y) <==> x+y

__delattr__(*args, **kwargs)¶

x.__delattr__(‘name’) <==> del x.name

__eq__(*args, **kwargs)¶

x.__eq__(y) <==> x==y

__format__(format_spec) → unicode¶

Return a formatted version of S as described by format_spec.

__ge__(*args, **kwargs)¶

x.__ge__(y) <==> x>=y

__getitem__(*args, **kwargs)¶

x.__getitem__(y) <==> x[y]

__gt__(*args, **kwargs)¶

x.__gt__(y) <==> x>y

__hash__() <==> hash(x)¶

__le__(*args, **kwargs)¶

x.__le__(y) <==> x<=y

__lt__(*args, **kwargs)¶

x.__lt__(y) <==> x<y

__ne__(*args, **kwargs)¶

x.__ne__(y) <==> x!=y

__repr__() <==> repr(x)¶

__str__() <==> str(x)¶

center(width[, fillchar]) → unicode¶

Return S centered in a Unicode string of length width. Padding is done using the specified fill character (default is a space)

count(sub[, start[, end]]) → int¶

Return the number of non-overlapping occurrences of substring sub in Unicode string S[start:end]. Optional arguments start and end are interpreted as in slice notation.

endswith(suffix[, start[, end]]) → bool¶

Return True if S ends with the specified suffix, False otherwise. With optional start, test S beginning at that position. With optional end, stop comparing S at that position. suffix can also be a tuple of strings to try.

find(sub[, start[, end]]) → int¶

Return the lowest index in S where substring sub is found, such that sub is contained within S[start:end]. Optional arguments start and end are interpreted as in slice notation.

Return -1 on failure.

format(*args, **kwargs) → unicode¶

Return a formatted version of S, using substitutions from args and kwargs. The substitutions are identified by braces (‘{‘ and ‘}’).

index(sub[, start[, end]]) → int¶

Like S.find() but raise ValueError when the substring is not found.

isdecimal() → bool¶

Return True if there are only decimal characters in S, False otherwise.

islower() → bool¶

Return True if all cased characters in S are lowercase and there is at least one cased character in S, False otherwise.

isnumeric() → bool¶

Return True if there are only numeric characters in S, False otherwise.

isupper() → bool¶

Return True if all cased characters in S are uppercase and there is at least one cased character in S, False otherwise.

join(iterable) → unicode¶

Return a string which is the concatenation of the strings in the iterable. The separator between elements is S.

ljust(width[, fillchar]) → int¶

Return S left-justified in a Unicode string of length width. Padding is done using the specified fill character (default is a space).

lower() → unicode¶

Return a copy of the string S converted to lowercase.

lstrip([chars]) → unicode¶

Return a copy of the string S with leading whitespace removed. If chars is given and not None, remove characters in chars instead. If chars is a str, it will be converted to unicode before stripping

partition(sep) -> (head, sep, tail)¶

Search for the separator sep in S, and return the part before it, the separator itself, and the part after it. If the separator is not found, return S and two empty strings.

replace(old, new[, count]) → unicode¶

Return a copy of S with all occurrences of substring old replaced by new. If the optional argument count is given, only the first count occurrences are replaced.

rfind(sub[, start[, end]]) → int¶

Return the highest index in S where substring sub is found, such that sub is contained within S[start:end]. Optional arguments start and end are interpreted as in slice notation.

Return -1 on failure.

rindex(sub[, start[, end]]) → int¶

Like S.rfind() but raise ValueError when the substring is not found.

rjust(width[, fillchar]) → unicode¶

Return S right-justified in a Unicode string of length width. Padding is done using the specified fill character (default is a space).

rpartition(sep) -> (head, sep, tail)¶

Search for the separator sep in S, starting at the end of S, and return the part before it, the separator itself, and the part after it. If the separator is not found, return two empty strings and S.

rsplit([sep[, maxsplit]]) → list of strings¶

Return a list of the words in S, using sep as the delimiter string, starting at the end of the string and working to the front. If maxsplit is given, at most maxsplit splits are done. If sep is not specified, any whitespace string is a separator.

rstrip([chars]) → unicode¶

Return a copy of the string S with trailing whitespace removed. If chars is given and not None, remove characters in chars instead. If chars is a str, it will be converted to unicode before stripping

split([sep[, maxsplit]]) → list of strings¶

Return a list of the words in S, using sep as the delimiter string. If maxsplit is given, at most maxsplit splits are done. If sep is not specified or is None, any whitespace string is a separator and empty strings are removed from the result.

startswith(prefix[, start[, end]]) → bool¶

Return True if S starts with the specified prefix, False otherwise. With optional start, test S beginning at that position. With optional end, stop comparing S at that position. prefix can also be a tuple of strings to try.

strip([chars]) → unicode¶

Return a copy of the string S with leading and trailing whitespace removed. If chars is given and not None, remove characters in chars instead. If chars is a str, it will be converted to unicode before stripping

upper() → unicode¶

Return a copy of S converted to uppercase.