P2pool util forest - Revision history

Nibor: /* Skiplist, TrackerSkipList and DistanceSkipList classes */

2012-07-12T20:48:20Z

Skiplist, TrackerSkipList and DistanceSkipList classes

← Older revision		Revision as of 20:48, 12 July 2012
Line 19:		Line 19:

	===Skiplist, TrackerSkipList and DistanceSkipList classes===		===Skiplist, TrackerSkipList and DistanceSkipList classes===
			The __call__ function of DistanceSkipList implements the get_nth_parent_hash function of the trackers.
			So these are used to enable an efficient way of managing the share lists.

	The trackers self._subset_of is a DistanceSkipList instance.		The trackers self._subset_of is a DistanceSkipList instance.
	TrackerSkipList is also the base class for data.py/WeightsSkipList class (should TrackerSkipList be moved into skiplist.py?)		TrackerSkipList is also the base class for data.py/WeightsSkipList class (should TrackerSkipList be moved into skiplist.py?)

Nibor at 16:58, 9 July 2012

2012-07-09T16:58:07Z

← Older revision		Revision as of 16:58, 9 July 2012
Line 17:		Line 17:
	===Method add===		===Method add===
	Adds a share to the tracker		Adds a share to the tracker

			===Skiplist, TrackerSkipList and DistanceSkipList classes===
			The trackers self._subset_of is a DistanceSkipList instance.
			TrackerSkipList is also the base class for data.py/WeightsSkipList class (should TrackerSkipList be moved into skiplist.py?)

Nibor: /* Class Tracker */

2012-07-09T15:58:01Z

Class Tracker

← Older revision		Revision as of 15:58, 9 July 2012
Line 2:		Line 2:
	==Class Tracker==		==Class Tracker==
	Number of dictionaries that store the shares in various ways to allow fast access.		Number of dictionaries that store the shares in various ways to allow fast access.
	# ~~shares~~ (hash->~~share~~) Since share contains parent share allows you to link to previous shares all the way to the tail.
	# ~~reverse_shares~~ (delta.tail->set of ~~share_hashes~~) Allows you to link share to the next share that came after it all the way to the head.		This class is critical for performance. It stores and updates '''Deltas''' that are used for quickly answering queries by caching data between two points in the sharechain. Each share (item) has a delta that goes between it and its highest parent and contains information such as how much work was done and how many shares are in between. If the highest parent has its parent added, the delta will keep referring to the old highest parent until it is next needed, and then it will be updated.
	# deltas (~~share_hash~~ -> delta, ref)
	# reverse_deltas (ref -> set of ~~share_hashes~~)		Normally this class stores shares. These are called items in the code. I guess this is because the class is reused elsewhere?

			# items (hash->item) Since share(item) contains parent share allows you to link to previous shares all the way to the tail.
			# reverse (delta.tail->set of item_hashes) Allows you to link share to the next share that came after it all the way to the head.
			# deltas (item_hash -> delta, ref)
			# reverse_deltas (ref -> set of item_hashes)
	# delta_refs (ref -> delta)		# delta_refs (ref -> delta)
	# reverse_delta_refs ( delta.tail -> ref)		# reverse_delta_refs ( delta.tail -> ref)

	Deltas are used for quickly answering queries by caching data between two points in the sharechain. Each share has a delta that goes between it and its highest parent and contains information such as how much work was done and how many shares are in between. If the highest parent has its parent added, the delta will keep referring to the old highest parent until it is next needed, and then it will be updated.
	===Method add===		===Method add===
	Adds a share to the tracker		Adds a share to the tracker

Forrestv: described deltas

2012-06-24T21:37:08Z

described deltas

← Older revision		Revision as of 21:37, 24 June 2012
Line 9:		Line 9:
	# reverse_delta_refs ( delta.tail -> ref)		# reverse_delta_refs ( delta.tail -> ref)

	~~'''what~~ are ~~deltas???''' I have not got my head round this code at all!~~		Deltas are used for quickly answering queries by caching data between two points in the sharechain. Each share has a delta that goes between it and its highest parent and contains information such as how much work was done and how many shares are in between. If the highest parent has its parent added, the delta will keep referring to the old highest parent until it is next needed, and then it will be updated.
	===Method add===		===Method add===
	Adds a share to the tracker		Adds a share to the tracker

Nibor: /* p2pool/util/forest.py */

2012-06-24T18:58:00Z

p2pool/util/forest.py

← Older revision		Revision as of 18:58, 24 June 2012
Line 1:		Line 1:
	~~==p2pool/util/forest.py==~~
	This contains code for tracking shares.		This contains code for tracking shares.
			==Class Tracker==
			Number of dictionaries that store the shares in various ways to allow fast access.
			# shares (hash->share) Since share contains parent share allows you to link to previous shares all the way to the tail.
			# reverse_shares (delta.tail->set of share_hashes) Allows you to link share to the next share that came after it all the way to the head.
			# deltas (share_hash -> delta, ref)
			# reverse_deltas (ref -> set of share_hashes)
			# delta_refs (ref -> delta)
			# reverse_delta_refs ( delta.tail -> ref)

			'''what are deltas???''' I have not got my head round this code at all!
			===Method add===
			Adds a share to the tracker

Nibor: /* p2pool/util/forest.py */

2012-06-24T16:20:47Z

p2pool/util/forest.py

← Older revision		Revision as of 16:20, 24 June 2012
Line 1:		Line 1:
	=p2pool/util/forest.py=		==p2pool/util/forest.py==
	This contains code for tracking shares.		This contains code for tracking shares.

Nibor: Created page with "=p2pool/util/forest.py= This contains code for tracking shares."

2012-06-24T16:20:32Z

Created page with "=p2pool/util/forest.py= This contains code for tracking shares."

New page

=p2pool/util/forest.py=
This contains code for tracking shares.