bitsharesbase.objects module

class bitsharesbase.objects.AccountCreateExtensions(*args, **kwargs)[source]

Bases: bitsharesbase.objects.Extension

class Buyback_options(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class Null_ext(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
sorted_options = [('null_ext', <class 'bitsharesbase.objects.AccountCreateExtensions.Null_ext'>), ('owner_special_authority', <class 'bitsharesbase.objects.SpecialAuthority'>), ('active_special_authority', <class 'bitsharesbase.objects.SpecialAuthority'>), ('buyback_options', <class 'bitsharesbase.objects.AccountCreateExtensions.Buyback_options'>)]
bitsharesbase.objects.AccountId(asset)[source]
class bitsharesbase.objects.AccountOptions(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
bitsharesbase.objects.AssetId(asset)[source]
class bitsharesbase.objects.AssetOptions(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class bitsharesbase.objects.BitAssetOptions(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class bitsharesbase.objects.CallOrderExtension(*args, **kwargs)[source]

Bases: bitsharesbase.objects.Extension

sorted_options = [('target_collateral_ratio', <function CallOrderExtension.targetCollateralRatio>)]
targetCollateralRatio()[source]
class bitsharesbase.objects.Extension(*args, **kwargs)[source]

Bases: graphenebase.types.Array

class bitsharesbase.objects.Memo(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class bitsharesbase.objects.ObjectId(object_str, type_verify=None)[source]

Bases: graphenebase.types.ObjectId

Need to overwrite a few attributes to load proper object_types from bitshares

object_types = {'OBJECT_TYPE_COUNT': 16, 'account': 2, 'asset': 3, 'balance': 15, 'base': 1, 'call_order': 8, 'committee_member': 5, 'custom': 9, 'force_settlement': 4, 'htlc': 16, 'limit_order': 7, 'null': 0, 'operation_history': 11, 'proposal': 10, 'vesting_balance': 13, 'withdraw_permission': 12, 'witness': 6, 'worker': 14}
class bitsharesbase.objects.Operation(op, **kwargs)[source]

Bases: graphenebase.objects.Operation

Need to overwrite a few attributes to load proper operations from bitshares

append()

Append object to the end of the list.

clear()

Remove all items from list.

copy()

Return a shallow copy of the list.

count()

Return number of occurrences of value.

extend()

Extend list by appending elements from the iterable.

fromlist = ['operations']
getOperationIdForName(name)[source]
getOperationNameForId(i)[source]

Convert an operation id into the corresponding string

id
index()

Return first index of value.

Raises ValueError if the value is not present.

insert()

Insert object before index.

json()
klass()[source]
klass_name
module = 'bitsharesbase.operations'
op
opId
operation
operations = {'account_create': 5, 'account_transfer': 9, 'account_update': 6, 'account_upgrade': 8, 'account_whitelist': 7, 'assert': 36, 'asset_claim_fees': 43, 'asset_claim_pool': 47, 'asset_create': 10, 'asset_fund_fee_pool': 16, 'asset_global_settle': 18, 'asset_issue': 14, 'asset_publish_feed': 19, 'asset_reserve': 15, 'asset_settle': 17, 'asset_settle_cancel': 42, 'asset_update': 11, 'asset_update_bitasset': 12, 'asset_update_feed_producers': 13, 'asset_update_issuer': 48, 'balance_claim': 37, 'bid_collateral': 45, 'blind_transfer': 40, 'call_order_update': 3, 'committee_member_create': 29, 'committee_member_update': 30, 'committee_member_update_global_parameters': 31, 'custom': 35, 'execute_bid': 46, 'fba_distribute': 44, 'fill_order': 4, 'htlc_create': 49, 'htlc_extend': 52, 'htlc_redeem': 50, 'htlc_redeemed': 51, 'htlc_refund': 53, 'limit_order_cancel': 2, 'limit_order_create': 1, 'override_transfer': 38, 'proposal_create': 22, 'proposal_delete': 24, 'proposal_update': 23, 'transfer': 0, 'transfer_from_blind': 41, 'transfer_to_blind': 39, 'vesting_balance_create': 32, 'vesting_balance_withdraw': 33, 'withdraw_permission_claim': 27, 'withdraw_permission_create': 25, 'withdraw_permission_delete': 28, 'withdraw_permission_update': 26, 'witness_create': 20, 'witness_update': 21, 'worker_create': 34}
ops
pop()

Remove and return item at index (default last).

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

remove()

Remove first occurrence of value.

Raises ValueError if the value is not present.

reverse()

Reverse IN PLACE.

set(**data)[source]
sort()

Stable sort IN PLACE.

toJson()
class bitsharesbase.objects.Permission(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class bitsharesbase.objects.Price(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class bitsharesbase.objects.PriceFeed(*args, **kwargs)[source]

Bases: graphenebase.objects.GrapheneObject

clear() → None. Remove all items from od.
copy() → a shallow copy of od
data

Read data explicitly (backwards compatibility)

fromkeys()

Create a new ordered dictionary with keys from iterable and values set to value.

get()

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items
json()
keys() → a set-like object providing a view on D's keys
move_to_end()

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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.

popitem()

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault()

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

toJson()
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]

values() → an object providing a view on D's values
class bitsharesbase.objects.SpecialAuthority(o)[source]

Bases: graphenebase.types.Static_variant

class bitsharesbase.objects.Worker_initializer(o)[source]

Bases: graphenebase.types.Static_variant