1990-10-13 19:23:40 +00:00
|
|
|
# module 'string' -- A collection of string operations
|
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
# Warning: most of the code you see here isn't normally used nowadays. With
|
|
|
|
# Python 1.6, many of these functions are implemented as methods on the
|
|
|
|
# standard string object. They used to be implemented by a built-in module
|
|
|
|
# called strop, but strop is now obsolete itself.
|
1990-10-13 19:23:40 +00:00
|
|
|
|
1997-12-29 19:26:28 +00:00
|
|
|
"""Common string manipulations.
|
|
|
|
|
|
|
|
Public module variables:
|
|
|
|
|
|
|
|
whitespace -- a string containing all characters considered whitespace
|
|
|
|
lowercase -- a string containing all characters considered lowercase letters
|
|
|
|
uppercase -- a string containing all characters considered uppercase letters
|
|
|
|
letters -- a string containing all characters considered letters
|
|
|
|
digits -- a string containing all characters considered decimal digits
|
|
|
|
hexdigits -- a string containing all characters considered hexadecimal digits
|
|
|
|
octdigits -- a string containing all characters considered octal digits
|
|
|
|
|
|
|
|
"""
|
|
|
|
|
1990-10-13 19:23:40 +00:00
|
|
|
# Some strings for ctype-style character classification
|
1993-07-29 09:37:38 +00:00
|
|
|
whitespace = ' \t\n\r\v\f'
|
1990-10-13 19:23:40 +00:00
|
|
|
lowercase = 'abcdefghijklmnopqrstuvwxyz'
|
|
|
|
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
|
|
|
|
letters = lowercase + uppercase
|
|
|
|
digits = '0123456789'
|
|
|
|
hexdigits = digits + 'abcdef' + 'ABCDEF'
|
|
|
|
octdigits = '01234567'
|
|
|
|
|
|
|
|
# Case conversion helpers
|
1992-01-14 18:31:29 +00:00
|
|
|
_idmap = ''
|
|
|
|
for i in range(256): _idmap = _idmap + chr(i)
|
1990-10-13 19:23:40 +00:00
|
|
|
del i
|
|
|
|
|
1994-08-17 13:16:11 +00:00
|
|
|
# Backward compatible names for exceptions
|
|
|
|
index_error = ValueError
|
|
|
|
atoi_error = ValueError
|
|
|
|
atof_error = ValueError
|
|
|
|
atol_error = ValueError
|
|
|
|
|
1990-10-13 19:23:40 +00:00
|
|
|
# convert UPPER CASE letters to lower case
|
|
|
|
def lower(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""lower(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s converted to lowercase.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.lower()
|
1990-10-13 19:23:40 +00:00
|
|
|
|
|
|
|
# Convert lower case letters to UPPER CASE
|
|
|
|
def upper(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""upper(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s converted to uppercase.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.upper()
|
1990-10-13 19:23:40 +00:00
|
|
|
|
|
|
|
# Swap lower case letters and UPPER CASE
|
|
|
|
def swapcase(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""swapcase(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s with upper case characters
|
|
|
|
converted to lowercase and vice versa.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.swapcase()
|
1990-10-13 19:23:40 +00:00
|
|
|
|
|
|
|
# Strip leading and trailing tabs and spaces
|
|
|
|
def strip(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""strip(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s with leading and trailing
|
|
|
|
whitespace removed.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.strip()
|
1990-10-13 19:23:40 +00:00
|
|
|
|
Add optional third parameter to split() and splitfields(), giving the
maximum number of delimiters to parse; e.g.
splitfields("a,b,c,d", ",", 2) -> ["a", "b", "c,d"].
1996-08-08 18:40:59 +00:00
|
|
|
# Strip leading tabs and spaces
|
|
|
|
def lstrip(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""lstrip(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s with leading whitespace removed.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.lstrip()
|
Add optional third parameter to split() and splitfields(), giving the
maximum number of delimiters to parse; e.g.
splitfields("a,b,c,d", ",", 2) -> ["a", "b", "c,d"].
1996-08-08 18:40:59 +00:00
|
|
|
|
|
|
|
# Strip trailing tabs and spaces
|
|
|
|
def rstrip(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""rstrip(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s with trailing whitespace
|
|
|
|
removed.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.rstrip()
|
Add optional third parameter to split() and splitfields(), giving the
maximum number of delimiters to parse; e.g.
splitfields("a,b,c,d", ",", 2) -> ["a", "b", "c,d"].
1996-08-08 18:40:59 +00:00
|
|
|
|
|
|
|
|
1990-10-13 19:23:40 +00:00
|
|
|
# Split a string into a list of space/tab-separated words
|
|
|
|
# NB: split(s) is NOT the same as splitfields(s, ' ')!
|
Add optional third parameter to split() and splitfields(), giving the
maximum number of delimiters to parse; e.g.
splitfields("a,b,c,d", ",", 2) -> ["a", "b", "c,d"].
1996-08-08 18:40:59 +00:00
|
|
|
def split(s, sep=None, maxsplit=0):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""split(str [,sep [,maxsplit]]) -> list of strings
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a list of the words in the string s, using sep as the
|
|
|
|
delimiter string. If maxsplit is nonzero, splits into at most
|
|
|
|
maxsplit words If sep is not specified, any whitespace string
|
|
|
|
is a separator. Maxsplit defaults to 0.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
(split and splitfields are synonymous)
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.split(sep, maxsplit)
|
|
|
|
splitfields = split
|
1991-04-07 13:42:19 +00:00
|
|
|
|
1995-06-22 18:58:00 +00:00
|
|
|
# Join fields with optional separator
|
1999-10-12 19:54:53 +00:00
|
|
|
def join(words, sep = ' '):
|
|
|
|
"""join(list [,sep]) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a string composed of the words in list, with
|
|
|
|
intervening occurences of sep. The default separator is a
|
|
|
|
single space.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
(joinfields and join are synonymous)
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return sep.join(words)
|
|
|
|
joinfields = join
|
1991-04-07 13:42:19 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
# for a little bit of speed
|
|
|
|
_apply = apply
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
# Find substring, raise exception if not found
|
|
|
|
def index(s, *args):
|
|
|
|
"""index(s, sub [,start [,end]]) -> int
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Like find but raises ValueError when the substring is not found.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return _apply(s.index, args)
|
1993-05-24 14:16:22 +00:00
|
|
|
|
* string.py: added rindex(), rfind(); changed index() to interpret
negative start indices starting from the right.
* ftplib.py: debug() -> set_debuglevel(); change demo to use __init__().
* os.py: added execl, execlp, and execvp.
* lambda.py: removed (now that we have built-in map, reduce, bagof, lambda)
* test_b{1,2}.py, testall.out: added tests for bagof, lambda, map, reduce
* commands.py: use os, not posix
* test_grammar.py: make it easy to disable non-portable int overflow tests
* dis.py: don't abuse range()
1993-11-08 15:05:21 +00:00
|
|
|
# Find last substring, raise exception if not found
|
1999-10-12 19:54:53 +00:00
|
|
|
def rindex(s, *args):
|
|
|
|
"""rindex(s, sub [,start [,end]]) -> int
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Like rfind but raises ValueError when the substring is not found.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return _apply(s.rindex, args)
|
1994-08-01 11:34:53 +00:00
|
|
|
|
|
|
|
# Count non-overlapping occurrences of substring
|
1999-10-12 19:54:53 +00:00
|
|
|
def count(s, *args):
|
|
|
|
"""count(s, sub[, start[,end]]) -> int
|
|
|
|
|
|
|
|
Return the number of occurrences of substring sub in string
|
|
|
|
s[start:end]. Optional arguments start and end are
|
|
|
|
interpreted as in slice notation.
|
|
|
|
|
|
|
|
"""
|
|
|
|
return _apply(s.count, args)
|
* string.py: added rindex(), rfind(); changed index() to interpret
negative start indices starting from the right.
* ftplib.py: debug() -> set_debuglevel(); change demo to use __init__().
* os.py: added execl, execlp, and execvp.
* lambda.py: removed (now that we have built-in map, reduce, bagof, lambda)
* test_b{1,2}.py, testall.out: added tests for bagof, lambda, map, reduce
* commands.py: use os, not posix
* test_grammar.py: make it easy to disable non-portable int overflow tests
* dis.py: don't abuse range()
1993-11-08 15:05:21 +00:00
|
|
|
|
1993-05-24 14:16:22 +00:00
|
|
|
# Find substring, return -1 if not found
|
1999-10-12 19:54:53 +00:00
|
|
|
def find(s, *args):
|
|
|
|
"""find(s, sub [,start [,end]]) -> in
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
"""
|
|
|
|
return _apply(s.find, args)
|
1990-10-13 19:23:40 +00:00
|
|
|
|
* string.py: added rindex(), rfind(); changed index() to interpret
negative start indices starting from the right.
* ftplib.py: debug() -> set_debuglevel(); change demo to use __init__().
* os.py: added execl, execlp, and execvp.
* lambda.py: removed (now that we have built-in map, reduce, bagof, lambda)
* test_b{1,2}.py, testall.out: added tests for bagof, lambda, map, reduce
* commands.py: use os, not posix
* test_grammar.py: make it easy to disable non-portable int overflow tests
* dis.py: don't abuse range()
1993-11-08 15:05:21 +00:00
|
|
|
# Find last substring, return -1 if not found
|
1999-10-12 19:54:53 +00:00
|
|
|
def rfind(s, *args):
|
|
|
|
"""rfind(s, 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.
|
|
|
|
|
|
|
|
"""
|
|
|
|
return _apply(s.rfind, args)
|
|
|
|
|
|
|
|
# for a bit of speed
|
|
|
|
_float = float
|
|
|
|
_int = int
|
|
|
|
_long = long
|
|
|
|
_StringType = type('')
|
1997-12-10 22:59:55 +00:00
|
|
|
|
1993-10-22 13:56:35 +00:00
|
|
|
# Convert string to float
|
1999-10-12 19:54:53 +00:00
|
|
|
def atof(s):
|
|
|
|
"""atof(s) -> float
|
|
|
|
|
|
|
|
Return the floating point number represented by the string s.
|
|
|
|
|
|
|
|
"""
|
|
|
|
if type(s) == _StringType:
|
2000-02-10 17:17:14 +00:00
|
|
|
return _float(s)
|
1999-10-12 19:54:53 +00:00
|
|
|
else:
|
2000-02-10 17:17:14 +00:00
|
|
|
raise TypeError('argument 1: expected string, %s found' %
|
|
|
|
type(s).__name__)
|
1993-10-22 13:56:35 +00:00
|
|
|
|
1990-10-13 19:23:40 +00:00
|
|
|
# Convert string to integer
|
1999-10-12 19:54:53 +00:00
|
|
|
def atoi(*args):
|
|
|
|
"""atoi(s [,base]) -> int
|
|
|
|
|
|
|
|
Return the integer represented by the string s in the given
|
|
|
|
base, which defaults to 10. The string s must consist of one
|
|
|
|
or more digits, possibly preceded by a sign. If base is 0, it
|
|
|
|
is chosen from the leading characters of s, 0 for octal, 0x or
|
|
|
|
0X for hexadecimal. If base is 16, a preceding 0x or 0X is
|
|
|
|
accepted.
|
|
|
|
|
|
|
|
"""
|
|
|
|
try:
|
2000-02-10 17:17:14 +00:00
|
|
|
s = args[0]
|
1999-10-12 19:54:53 +00:00
|
|
|
except IndexError:
|
2000-02-10 17:17:14 +00:00
|
|
|
raise TypeError('function requires at least 1 argument: %d given' %
|
|
|
|
len(args))
|
1999-10-12 19:54:53 +00:00
|
|
|
# Don't catch type error resulting from too many arguments to int(). The
|
|
|
|
# error message isn't compatible but the error type is, and this function
|
|
|
|
# is complicated enough already.
|
|
|
|
if type(s) == _StringType:
|
2000-02-10 17:17:14 +00:00
|
|
|
return _apply(_int, args)
|
1999-10-12 19:54:53 +00:00
|
|
|
else:
|
2000-02-10 17:17:14 +00:00
|
|
|
raise TypeError('argument 1: expected string, %s found' %
|
|
|
|
type(s).__name__)
|
1999-10-12 19:54:53 +00:00
|
|
|
|
1990-10-13 19:23:40 +00:00
|
|
|
|
1993-10-22 13:56:35 +00:00
|
|
|
# Convert string to long integer
|
1999-10-12 19:54:53 +00:00
|
|
|
def atol(*args):
|
|
|
|
"""atol(s [,base]) -> long
|
|
|
|
|
|
|
|
Return the long integer represented by the string s in the
|
|
|
|
given base, which defaults to 10. The string s must consist
|
|
|
|
of one or more digits, possibly preceded by a sign. If base
|
|
|
|
is 0, it is chosen from the leading characters of s, 0 for
|
|
|
|
octal, 0x or 0X for hexadecimal. If base is 16, a preceding
|
|
|
|
0x or 0X is accepted. A trailing L or l is not accepted,
|
|
|
|
unless base is 0.
|
|
|
|
|
|
|
|
"""
|
|
|
|
try:
|
2000-02-10 17:17:14 +00:00
|
|
|
s = args[0]
|
1999-10-12 19:54:53 +00:00
|
|
|
except IndexError:
|
2000-02-10 17:17:14 +00:00
|
|
|
raise TypeError('function requires at least 1 argument: %d given' %
|
|
|
|
len(args))
|
1999-10-12 19:54:53 +00:00
|
|
|
# Don't catch type error resulting from too many arguments to long(). The
|
|
|
|
# error message isn't compatible but the error type is, and this function
|
|
|
|
# is complicated enough already.
|
|
|
|
if type(s) == _StringType:
|
2000-02-10 17:17:14 +00:00
|
|
|
return _apply(_long, args)
|
1999-10-12 19:54:53 +00:00
|
|
|
else:
|
2000-02-10 17:17:14 +00:00
|
|
|
raise TypeError('argument 1: expected string, %s found' %
|
|
|
|
type(s).__name__)
|
1999-10-12 19:54:53 +00:00
|
|
|
|
1993-10-22 13:56:35 +00:00
|
|
|
|
1990-10-13 19:23:40 +00:00
|
|
|
# Left-justify a string
|
|
|
|
def ljust(s, width):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""ljust(s, width) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a left-justified version of s, in a field of the
|
|
|
|
specified width, padded with spaces as needed. The string is
|
|
|
|
never truncated.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
n = width - len(s)
|
|
|
|
if n <= 0: return s
|
|
|
|
return s + ' '*n
|
1990-10-13 19:23:40 +00:00
|
|
|
|
|
|
|
# Right-justify a string
|
|
|
|
def rjust(s, width):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""rjust(s, width) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a right-justified version of s, in a field of the
|
|
|
|
specified width, padded with spaces as needed. The string is
|
|
|
|
never truncated.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
n = width - len(s)
|
|
|
|
if n <= 0: return s
|
|
|
|
return ' '*n + s
|
1990-10-13 19:23:40 +00:00
|
|
|
|
|
|
|
# Center a string
|
|
|
|
def center(s, width):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""center(s, width) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a center version of s, in a field of the specified
|
|
|
|
width. padded with spaces as needed. The string is never
|
|
|
|
truncated.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
n = width - len(s)
|
|
|
|
if n <= 0: return s
|
|
|
|
half = n/2
|
|
|
|
if n%2 and width%2:
|
2000-02-10 17:17:14 +00:00
|
|
|
# This ensures that center(center(s, i), j) = center(s, j)
|
|
|
|
half = half+1
|
1999-10-12 19:54:53 +00:00
|
|
|
return ' '*half + s + ' '*(n-half)
|
1990-10-13 19:23:40 +00:00
|
|
|
|
|
|
|
# Zero-fill a number, e.g., (12, 3) --> '012' and (-3, 3) --> '-03'
|
|
|
|
# Decadent feature: the argument may be a string or a number
|
|
|
|
# (Use of this is deprecated; it should be a string as with ljust c.s.)
|
|
|
|
def zfill(x, width):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""zfill(x, width) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Pad a numeric string x with zeros on the left, to fill a field
|
|
|
|
of the specified width. The string x is never truncated.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
if type(x) == type(''): s = x
|
|
|
|
else: s = `x`
|
|
|
|
n = len(s)
|
|
|
|
if n >= width: return s
|
|
|
|
sign = ''
|
|
|
|
if s[0] in ('-', '+'):
|
2000-02-10 17:17:14 +00:00
|
|
|
sign, s = s[0], s[1:]
|
1999-10-12 19:54:53 +00:00
|
|
|
return sign + '0'*(width-n) + s
|
1992-03-27 15:13:31 +00:00
|
|
|
|
|
|
|
# Expand tabs in a string.
|
|
|
|
# Doesn't take non-printing chars into account, but does understand \n.
|
1995-08-10 19:42:05 +00:00
|
|
|
def expandtabs(s, tabsize=8):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""expandtabs(s [,tabsize]) -> string
|
|
|
|
|
|
|
|
Return a copy of the string s with all tab characters replaced
|
|
|
|
by the appropriate number of spaces, depending on the current
|
|
|
|
column, and the tabsize (default 8).
|
|
|
|
|
|
|
|
"""
|
|
|
|
res = line = ''
|
|
|
|
for c in s:
|
2000-02-10 17:17:14 +00:00
|
|
|
if c == '\t':
|
|
|
|
c = ' '*(tabsize - len(line) % tabsize)
|
|
|
|
line = line + c
|
|
|
|
if c == '\n':
|
|
|
|
res = res + line
|
|
|
|
line = ''
|
1999-10-12 19:54:53 +00:00
|
|
|
return res + line
|
1992-10-18 17:09:59 +00:00
|
|
|
|
1996-05-28 23:08:45 +00:00
|
|
|
# Character translation through look-up table.
|
1996-07-23 18:12:39 +00:00
|
|
|
def translate(s, table, deletions=""):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""translate(s,table [,deletechars]) -> string
|
|
|
|
|
|
|
|
Return a copy of the string s, where all characters occurring
|
|
|
|
in the optional argument deletechars are removed, and the
|
|
|
|
remaining characters have been mapped through the given
|
|
|
|
translation table, which must be a string of length 256.
|
|
|
|
|
|
|
|
"""
|
|
|
|
return s.translate(table, deletions)
|
1992-10-18 17:09:59 +00:00
|
|
|
|
1996-06-11 18:43:00 +00:00
|
|
|
# Capitalize a string, e.g. "aBc dEf" -> "Abc def".
|
|
|
|
def capitalize(s):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""capitalize(s) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of the string s with only its first character
|
|
|
|
capitalized.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.capitalize()
|
1996-06-11 18:43:00 +00:00
|
|
|
|
|
|
|
# Capitalize the words in a string, e.g. " aBc dEf " -> "Abc Def".
|
|
|
|
# See also regsub.capwords().
|
1996-08-20 20:25:41 +00:00
|
|
|
def capwords(s, sep=None):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""capwords(s, [sep]) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Split the argument into words using split, capitalize each
|
|
|
|
word using capitalize, and join the capitalized words using
|
|
|
|
join. Note that this replaces runs of whitespace characters by
|
|
|
|
a single space.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return join(map(capitalize, s.split(sep)), sep or ' ')
|
1996-06-11 18:43:00 +00:00
|
|
|
|
1996-07-23 18:12:39 +00:00
|
|
|
# Construct a translation string
|
|
|
|
_idmapL = None
|
|
|
|
def maketrans(fromstr, tostr):
|
1999-10-12 19:54:53 +00:00
|
|
|
"""maketrans(frm, to) -> string
|
|
|
|
|
|
|
|
Return a translation table (a string of 256 bytes long)
|
|
|
|
suitable for use in string.translate. The strings frm and to
|
|
|
|
must be of the same length.
|
|
|
|
|
|
|
|
"""
|
|
|
|
if len(fromstr) != len(tostr):
|
2000-02-10 17:17:14 +00:00
|
|
|
raise ValueError, "maketrans arguments must have same length"
|
1999-10-12 19:54:53 +00:00
|
|
|
global _idmapL
|
|
|
|
if not _idmapL:
|
2000-02-10 17:17:14 +00:00
|
|
|
_idmapL = map(None, _idmap)
|
1999-10-12 19:54:53 +00:00
|
|
|
L = _idmapL[:]
|
|
|
|
fromstr = map(ord, fromstr)
|
|
|
|
for i in range(len(fromstr)):
|
2000-02-10 17:17:14 +00:00
|
|
|
L[fromstr[i]] = tostr[i]
|
1999-10-12 19:54:53 +00:00
|
|
|
return joinfields(L, "")
|
1996-06-11 18:43:00 +00:00
|
|
|
|
1997-03-25 16:50:31 +00:00
|
|
|
# Substring replacement (global)
|
1999-10-12 19:54:53 +00:00
|
|
|
def replace(s, old, new, maxsplit=0):
|
|
|
|
"""replace (str, old, new[, maxsplit]) -> string
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
Return a copy of string str with all occurrences of substring
|
|
|
|
old replaced by new. If the optional argument maxsplit is
|
|
|
|
given, only the first maxsplit occurrences are replaced.
|
1997-12-29 19:26:28 +00:00
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
"""
|
|
|
|
return s.replace(old, new, maxsplit)
|
1997-03-25 16:50:31 +00:00
|
|
|
|
|
|
|
|
1999-10-12 19:54:53 +00:00
|
|
|
# XXX: transitional
|
|
|
|
#
|
|
|
|
# If string objects do not have methods, then we need to use the old string.py
|
|
|
|
# library, which uses strop for many more things than just the few outlined
|
|
|
|
# below.
|
|
|
|
try:
|
|
|
|
''.upper
|
|
|
|
except AttributeError:
|
|
|
|
from stringold import *
|
|
|
|
|
1992-10-18 17:09:59 +00:00
|
|
|
# Try importing optional built-in module "strop" -- if it exists,
|
|
|
|
# it redefines some string operations that are 100-1000 times faster.
|
1993-07-29 09:37:38 +00:00
|
|
|
# It also defines values for whitespace, lowercase and uppercase
|
|
|
|
# that match <ctype.h>'s definitions.
|
1992-10-18 17:09:59 +00:00
|
|
|
|
|
|
|
try:
|
1999-10-12 19:54:53 +00:00
|
|
|
from strop import maketrans, lowercase, uppercase, whitespace
|
|
|
|
letters = lowercase + uppercase
|
1994-08-01 11:34:53 +00:00
|
|
|
except ImportError:
|
2000-02-10 17:17:14 +00:00
|
|
|
pass # Use the original versions
|