python float字节数_Python基础——数据类型

本文讲解Python常用7种数据类型:int, float, str, list, set, dict. 通过剖析源码弄清楚每一种数据类型所有的内置函数,理解每一个函数的参数、返回值、使用场景是什么。

一、整型 int

Python3.6源码解析

class int(object):

"""

int(x=0) -> integer

int(x, base=10) -> integer

Convert a number or string to an integer, or return 0 if no arguments

are given. If x is a number, return x.__int__(). For floating point

numbers, this truncates towards zero.

If x is not a number or if base is given, then x must be a string,

bytes, or bytearray instance representing an integer literal in the

given base. The literal can be preceded by '+' or '-' and be surrounded

by whitespace. The base defaults to 10. Valid bases are 0 and 2-36.

Base 0 means to interpret the base from the string as an integer literal.

>>> int('0b100', base=0)

4

"""

def bit_length(self): # real signature unknown; restored from __doc__

"""

int.bit_length() -> int

Number of bits necessary to represent self in binary.

>>> bin(37)

'0b100101'

>>> (37).bit_length()

6

"""

return 0

def conjugate(self, *args, **kwargs): # real signature unknown

""" Returns self, the complex conjugate of any int. """

pass

@classmethod # known case

def from_bytes(cls, bytes, byteorder, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__

"""

int.from_bytes(bytes, byteorder, *, signed=False) -> int

Return the integer represented by the given array of bytes.

The bytes argument must be a bytes-like object (e.g. bytes or bytearray).

The byteorder argument determines the byte order used to represent the

integer. If byteorder is 'big', the most significant byte is at the

beginning of the byte array. If byteorder is 'little', the most

significant byte is at the end of the byte array. To request the native

byte order of the host system, use `sys.byteorder' as the byte order value.

The signed keyword-only argument indicates whether two's complement is

used to represent the integer.

"""

pass

def to_bytes(self, length, byteorder, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__

"""

int.to_bytes(length, byteorder, *, signed=False) -> bytes

Return an array of bytes representing an integer.

The integer is represented using length bytes. An OverflowError is

raised if the integer is not representable with the given number of

bytes.

The byteorder argument determines the byte order used to represent the

integer. If byteorder is 'big', the most significant byte is at the

beginning of the byte array. If byteorder is 'little', the most

significant byte is at the end of the byte array. To request the native

byte order of the host system, use `sys.byteorder' as the byte order value.

The signed keyword-only argument determines whether two's complement is

used to represent the integer. If signed is False and a negative integer

is given, an OverflowError is raised.

"""

pass

bit_length: 返回二进制数据所占的bit位数

conjugate: 获取复数的共轭复数

denominator:

from_bytes: 将bytes解析为整数

imag:获取复数的虚部

numerator:

real: 获取复数的实部

to_bytes: 将一个大整数转换为一个字节字符串

二、浮点型 float

Python3.6源码解析

class float(object):

"""

float(x) -> floating point number

Convert a string or number to a floating point number, if possible.

"""

def as_integer_ratio(self): # real signature unknown; restored from __doc__

"""

float.as_integer_ratio() -> (int, int)

Return a pair of integers, whose ratio is exactly equal to the original

float and with a positive denominator.

Raise OverflowError on infinities and a ValueError on NaNs.

>>> (10.0).as_integer_ratio()

(10, 1)

>>> (0.0).as_integer_ratio()

(0, 1)

>>> (-.25).as_integer_ratio()

(-1, 4)

"""

pass

def conjugate(self, *args, **kwargs): # real signature unknown

""" Return self, the complex conjugate of any float. """

pass

@staticmethod # known case

def fromhex(string): # real signature unknown; restored from __doc__

"""

float.fromhex(string) -> float

Create a floating-point number from a hexadecimal string.

>>> float.fromhex('0x1.ffffp10')

2047.984375

>>> float.fromhex('-0x1p-1074')

-5e-324

"""

return 0.0

def hex(self): # real signature unknown; restored from __doc__

"""

float.hex() -> string

Return a hexadecimal representation of a floating-point number.

>>> (-0.1).hex()

'-0x1.999999999999ap-4'

>>> 3.14159.hex()

'0x1.921f9f01b866ep+1'

"""

return ""

def is_integer(self, *args, **kwargs): # real signature unknown

""" Return True if the float is an integer. """

pass

as_integer_ratio:

conjugate:

fromhex:

hex:

imag:

is_integer:

real:

三、字符串 str

Python3.6源码解析

class str(object):

"""

str(object='') -> str

str(bytes_or_buffer[, encoding[, errors]]) -> str

Create a new string object from the given object. If encoding or

errors is specified, then the object must expose a data buffer

that will be decoded using the given encoding and error handler.

Otherwise, returns the result of object.__str__() (if defined)

or repr(object).

encoding defaults to sys.getdefaultencoding().

errors defaults to 'strict'.

"""

def capitalize(self): # real signature unknown; restored from __doc__

"""

S.capitalize() -> str

Return a capitalized version of S, i.e. make the first character

have upper case and the rest lower case.

"""

return ""

def casefold(self): # real signature unknown; restored from __doc__

"""

S.casefold() -> str

Return a version of S suitable for caseless comparisons.

"""

return ""

def center(self, width, fillchar=None): # real signature unknown; restored from __doc__

"""

S.center(width[, fillchar]) -> str

Return S centered in a string of length width. Padding is

done using the specified fill character (default is a space)

"""

return ""

def count(self, sub, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.count(sub[, start[, end]]) -> int

Return the number of non-overlapping occurrences of substring sub in

string S[start:end]. Optional arguments start and end are

interpreted as in slice notation.

"""

return 0

def encode(self, encoding='utf-8', errors='strict'): # real signature unknown; restored from __doc__

"""

S.encode(encoding='utf-8', errors='strict') -> bytes

Encode S using the codec registered for encoding. Default encoding

is 'utf-8'. errors may be given to set a different error

handling scheme. Default is 'strict' meaning that encoding errors raise

a UnicodeEncodeError. Other possible values are 'ignore', 'replace' and

'xmlcharrefreplace' as well as any other name registered with

codecs.register_error that can handle UnicodeEncodeErrors.

"""

return b""

def endswith(self, suffix, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.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.

"""

return False

def expandtabs(self, tabsize=8): # real signature unknown; restored from __doc__

"""

S.expandtabs(tabsize=8) -> str

Return a copy of S where all tab characters are expanded using spaces.

If tabsize is not given, a tab size of 8 characters is assumed.

"""

return ""

def find(self, sub, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.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.

"""

return 0

def format(self, *args, **kwargs): # known special case of str.format

"""

S.format(*args, **kwargs) -> str

Return a formatted version of S, using substitutions from args and kwargs.

The substitutions are identified by braces ('{' and '}').

"""

pass

def format_map(self, mapping): # real signature unknown; restored from __doc__

"""

S.format_map(mapping) -> str

Return a formatted version of S, using substitutions from mapping.

The substitutions are identified by braces ('{' and '}').

"""

return ""

def index(self, sub, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.index(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.

Raises ValueError when the substring is not found.

"""

return 0

def isalnum(self): # real signature unknown; restored from __doc__

"""

S.isalnum() -> bool

Return True if all characters in S are alphanumeric

and there is at least one character in S, False otherwise.

"""

return False

def isalpha(self): # real signature unknown; restored from __doc__

"""

S.isalpha() -> bool

Return True if all characters in S are alphabetic

and there is at least one character in S, False otherwise.

"""

return False

def isdecimal(self): # real signature unknown; restored from __doc__

"""

S.isdecimal() -> bool

Return True if there are only decimal characters in S,

False otherwise.

"""

return False

def isdigit(self): # real signature unknown; restored from __doc__

"""

S.isdigit() -> bool

Return True if all characters in S are digits

and there is at least one character in S, False otherwise.

"""

return False

def isidentifier(self): # real signature unknown; restored from __doc__

"""

S.isidentifier() -> bool

Return True if S is a valid identifier according

to the language definition.

Use keyword.iskeyword() to test for reserved identifiers

such as "def" and "class".

"""

return False

def islower(self): # real signature unknown; restored from __doc__

"""

S.islower() -> bool

Return True if all cased characters in S are lowercase and there is

at least one cased character in S, False otherwise.

"""

return False

def isnumeric(self): # real signature unknown; restored from __doc__

"""

S.isnumeric() -> bool

Return True if there are only numeric characters in S,

False otherwise.

"""

return False

def isprintable(self): # real signature unknown; restored from __doc__

"""

S.isprintable() -> bool

Return True if all characters in S are considered

printable in repr() or S is empty, False otherwise.

"""

return False

def isspace(self): # real signature unknown; restored from __doc__

"""

S.isspace() -> bool

Return True if all characters in S are whitespace

and there is at least one character in S, False otherwise.

"""

return False

def istitle(self): # real signature unknown; restored from __doc__

"""

S.istitle() -> bool

Return True if S is a titlecased string and there is at least one

character in S, i.e. upper- and titlecase characters may only

follow uncased characters and lowercase characters only cased ones.

Return False otherwise.

"""

return False

def isupper(self): # real signature unknown; restored from __doc__

"""

S.isupper() -> bool

Return True if all cased characters in S are uppercase and there is

at least one cased character in S, False otherwise.

"""

return False

def join(self, iterable): # real signature unknown; restored from __doc__

"""

S.join(iterable) -> str

Return a string which is the concatenation of the strings in the

iterable. The separator between elements is S.

"""

return ""

def ljust(self, width, fillchar=None): # real signature unknown; restored from __doc__

"""

S.ljust(width[, fillchar]) -> str

Return S left-justified in a Unicode string of length width. Padding is

done using the specified fill character (default is a space).

"""

return ""

def lower(self): # real signature unknown; restored from __doc__

"""

S.lower() -> str

Return a copy of the string S converted to lowercase.

"""

return ""

def lstrip(self, chars=None): # real signature unknown; restored from __doc__

"""

S.lstrip([chars]) -> str

Return a copy of the string S with leading whitespace removed.

If chars is given and not None, remove characters in chars instead.

"""

return ""

def maketrans(self, *args, **kwargs): # real signature unknown

"""

Return a translation table usable for str.translate().

If there is only one argument, it must be a dictionary mapping Unicode

ordinals (integers) or characters to Unicode ordinals, strings or None.

Character keys will be then converted to ordinals.

If there are two arguments, they must be strings of equal length, and

in the resulting dictionary, each character in x will be mapped to the

character at the same position in y. If there is a third argument, it

must be a string, whose characters will be mapped to None in the result.

"""

pass

def partition(self, sep): # real signature unknown; restored from __doc__

"""

S.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.

"""

pass

def replace(self, old, new, count=None): # real signature unknown; restored from __doc__

"""

S.replace(old, new[, count]) -> str

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.

"""

return ""

def rfind(self, sub, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.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.

"""

return 0

def rindex(self, sub, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.rindex(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.

Raises ValueError when the substring is not found.

"""

return 0

def rjust(self, width, fillchar=None): # real signature unknown; restored from __doc__

"""

S.rjust(width[, fillchar]) -> str

Return S right-justified in a string of length width. Padding is

done using the specified fill character (default is a space).

"""

return ""

def rpartition(self, sep): # real signature unknown; restored from __doc__

"""

S.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.

"""

pass

def rsplit(self, sep=None, maxsplit=-1): # real signature unknown; restored from __doc__

"""

S.rsplit(sep=None, maxsplit=-1) -> 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.

"""

return []

def rstrip(self, chars=None): # real signature unknown; restored from __doc__

"""

S.rstrip([chars]) -> str

Return a copy of the string S with trailing whitespace removed.

If chars is given and not None, remove characters in chars instead.

"""

return ""

def split(self, sep=None, maxsplit=-1): # real signature unknown; restored from __doc__

"""

S.split(sep=None, maxsplit=-1) -> 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.

"""

return []

def splitlines(self, keepends=None): # real signature unknown; restored from __doc__

"""

S.splitlines([keepends]) -> list of strings

Return a list of the lines in S, breaking at line boundaries.

Line breaks are not included in the resulting list unless keepends

is given and true.

"""

return []

def startswith(self, prefix, start=None, end=None): # real signature unknown; restored from __doc__

"""

S.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.

"""

return False

def strip(self, chars=None): # real signature unknown; restored from __doc__

"""

S.strip([chars]) -> str

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.

"""

return ""

def swapcase(self): # real signature unknown; restored from __doc__

"""

S.swapcase() -> str

Return a copy of S with uppercase characters converted to lowercase

and vice versa.

"""

return ""

def title(self): # real signature unknown; restored from __doc__

"""

S.title() -> str

Return a titlecased version of S, i.e. words start with title case

characters, all remaining cased characters have lower case.

"""

return ""

def translate(self, table): # real signature unknown; restored from __doc__

"""

S.translate(table) -> str

Return a copy of the string S in which each character has been mapped

through the given translation table. The table must implement

lookup/indexing via __getitem__, for instance a dictionary or list,

mapping Unicode ordinals to Unicode ordinals, strings, or None. If

this operation raises LookupError, the character is left untouched.

Characters mapped to None are deleted.

"""

return ""

def upper(self): # real signature unknown; restored from __doc__

"""

S.upper() -> str

Return a copy of S converted to uppercase.

"""

return ""

def zfill(self, width): # real signature unknown; restored from __doc__

"""

S.zfill(width) -> str

Pad a numeric string S with zeros on the left, to fill a field

of the specified width. The string S is never truncated.

"""

return ""

capitalize:

casefold:

center:

count:

encode:

endswith:

expandtabs:

find:

format:

format_map:

index:

isalnum:

isalpha:

isdecimal:

isdigit:

isidentifier:

islower:

isnumeric:

isprintable:

isspace:

istitle:

isupper:

join:

ljust:

lower:

lstrip:

maketrans:

partition:

replace:

rfind:

rindex:

rjust:

rpartition:

rsplit:

rstrip:

split:

splitlines:

startswith:

strip:

swapcase:

title:

translate:

upper:

zfill:

四、列表 list

Python3.6源码解析:

class list(object):

"""

list() -> new empty list

list(iterable) -> new list initialized from iterable's items

"""

def append(self, p_object): # real signature unknown; restored from __doc__

""" L.append(object) -> None -- append object to end """

pass

def clear(self): # real signature unknown; restored from __doc__

""" L.clear() -> None -- remove all items from L """

pass

def copy(self): # real signature unknown; restored from __doc__

""" L.copy() -> list -- a shallow copy of L """

return []

def count(self, value): # real signature unknown; restored from __doc__

""" L.count(value) -> integer -- return number of occurrences of value """

return 0

def extend(self, iterable): # real signature unknown; restored from __doc__

""" L.extend(iterable) -> None -- extend list by appending elements from the iterable """

pass

def index(self, value, start=None, stop=None): # real signature unknown; restored from __doc__

"""

L.index(value, [start, [stop]]) -> integer -- return first index of value.

Raises ValueError if the value is not present.

"""

return 0

def insert(self, index, p_object): # real signature unknown; restored from __doc__

""" L.insert(index, object) -- insert object before index """

pass

def pop(self, index=None): # real signature unknown; restored from __doc__

"""

L.pop([index]) -> item -- remove and return item at index (default last).

Raises IndexError if list is empty or index is out of range.

"""

pass

def remove(self, value): # real signature unknown; restored from __doc__

"""

L.remove(value) -> None -- remove first occurrence of value.

Raises ValueError if the value is not present.

"""

pass

def reverse(self): # real signature unknown; restored from __doc__

""" L.reverse() -- reverse *IN PLACE* """

pass

def sort(self, key=None, reverse=False): # real signature unknown; restored from __doc__

""" L.sort(key=None, reverse=False) -> None -- stable sort *IN PLACE* """

pass

列表的内置函数包括

append:

clear:

copy:

count:

extend:

index:

insert:

pop:

remove:

reverse:

sort:

五、元组 tuple

class tuple(object):

"""

tuple() -> empty tuple

tuple(iterable) -> tuple initialized from iterable's items

If the argument is a tuple, the return value is the same object.

"""

def count(self, value): # real signature unknown; restored from __doc__

""" T.count(value) -> integer -- return number of occurrences of value """

return 0

def index(self, value, start=None, stop=None): # real signature unknown; restored from __doc__

"""

T.index(value, [start, [stop]]) -> integer -- return first index of value.

Raises ValueError if the value is not present.

"""

return 0

count:

index:

六、字典 dict

Python3.6源码解析

class dict(object):

"""

dict() -> new empty dictionary

dict(mapping) -> new dictionary initialized from a mapping object's

(key, value) pairs

dict(iterable) -> new dictionary initialized as if via:

d = {}

for k, v in iterable:

d[k] = v

dict(**kwargs) -> new dictionary initialized with the name=value pairs

in the keyword argument list. For example: dict(one=1, two=2)

"""

def clear(self): # real signature unknown; restored from __doc__

""" D.clear() -> None. Remove all items from D. """

pass

def copy(self): # real signature unknown; restored from __doc__

""" D.copy() -> a shallow copy of D """

pass

@staticmethod # known case

def fromkeys(*args, **kwargs): # real signature unknown

""" Returns a new dict with keys from iterable and values equal to value. """

pass

def get(self, k, d=None): # real signature unknown; restored from __doc__

""" D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None. """

pass

def items(self): # real signature unknown; restored from __doc__

""" D.items() -> a set-like object providing a view on D's items """

pass

def keys(self): # real signature unknown; restored from __doc__

""" D.keys() -> a set-like object providing a view on D's keys """

pass

def pop(self, k, d=None): # real signature unknown; restored from __doc__

"""

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

"""

pass

def popitem(self): # real signature unknown; restored from __doc__

"""

D.popitem() -> (k, v), remove and return some (key, value) pair as a

2-tuple; but raise KeyError if D is empty.

"""

pass

def setdefault(self, k, d=None): # real signature unknown; restored from __doc__

""" D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D """

pass

def update(self, E=None, **F): # known special case of dict.update

"""

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k]

If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v

In either case, this is followed by: for k in F: D[k] = F[k]

"""

pass

def values(self): # real signature unknown; restored from __doc__

""" D.values() -> an object providing a view on D's values """

pass

clear:

copy:

fromkeys:

get:

items:

keys:

pop:

popitem:

setdefault:

update:

values:

七、集合 set

Python3.6源码解析

class set(object):

"""

set() -> new empty set object

set(iterable) -> new set object

Build an unordered collection of unique elements.

"""

def add(self, *args, **kwargs): # real signature unknown

"""

Add an element to a set.

This has no effect if the element is already present.

"""

pass

def clear(self, *args, **kwargs): # real signature unknown

""" Remove all elements from this set. """

pass

def copy(self, *args, **kwargs): # real signature unknown

""" Return a shallow copy of a set. """

pass

def difference(self, *args, **kwargs): # real signature unknown

"""

Return the difference of two or more sets as a new set.

(i.e. all elements that are in this set but not the others.)

"""

pass

def difference_update(self, *args, **kwargs): # real signature unknown

""" Remove all elements of another set from this set. """

pass

def discard(self, *args, **kwargs): # real signature unknown

"""

Remove an element from a set if it is a member.

If the element is not a member, do nothing.

"""

pass

def intersection(self, *args, **kwargs): # real signature unknown

"""

Return the intersection of two sets as a new set.

(i.e. all elements that are in both sets.)

"""

pass

def intersection_update(self, *args, **kwargs): # real signature unknown

""" Update a set with the intersection of itself and another. """

pass

def isdisjoint(self, *args, **kwargs): # real signature unknown

""" Return True if two sets have a null intersection. """

pass

def issubset(self, *args, **kwargs): # real signature unknown

""" Report whether another set contains this set. """

pass

def issuperset(self, *args, **kwargs): # real signature unknown

""" Report whether this set contains another set. """

pass

def pop(self, *args, **kwargs): # real signature unknown

"""

Remove and return an arbitrary set element.

Raises KeyError if the set is empty.

"""

pass

def remove(self, *args, **kwargs): # real signature unknown

"""

Remove an element from a set; it must be a member.

If the element is not a member, raise a KeyError.

"""

pass

def symmetric_difference(self, *args, **kwargs): # real signature unknown

"""

Return the symmetric difference of two sets as a new set.

(i.e. all elements that are in exactly one of the sets.)

"""

pass

def symmetric_difference_update(self, *args, **kwargs): # real signature unknown

""" Update a set with the symmetric difference of itself and another. """

pass

def union(self, *args, **kwargs): # real signature unknown

"""

Return the union of sets as a new set.

(i.e. all elements that are in either set.)

"""

pass

def update(self, *args, **kwargs): # real signature unknown

""" Update a set with the union of itself and others. """

pass

add:

clear:

copy:

difference:

difference_update:

discard:

intersection:

intersection_update:

isdisjoint:

issubset:

issuperset:

pop:

remove:

symmetric_difference:

symmetric_difference_update:

union:

update:

搜索关注微信公众号:寸土币争 ID: bbcoins

bVbzFiJ?w=258&h=258

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值