Implementing a circular data structure using lists 1.0

Operating systemsOS : Windows / Linux / Mac OS / BSD / Solaris
Program licensingScript Licensing : Other Free / Open Source License - Python License
CreatedCreated : Feb 16, 2007
Size downloadDownloads : 3
Program licensing
Thank you for voting...

In some applications, it's advantageous to be able to ...

In some applications, it's advantageous to be able to define a circular_data_structure (a structure in which the last element is a pointer to the first). python lists make it easy to make such a beast. A list is an ordered sequence of element, so implementing a "ring" as a Python list is easy. "Turning" the ring consists of removing the last element from the list and placing it in the list's beginning slot. This behavior is encapsulated in a class, which is shown in this script as the "Ring" class.

Implementing a circular data structure using lists 1.0 scripting tags: structure, circular data structure, class, python, list management, list manipulation, element, easy. What is new in Implementing a circular data structure using lists 1.0 software script? - Unable to find Implementing a circular data structure using lists 1.0 news. What is improvements are expecting? Newly-made Implementing a circular data structure using lists 1.1 will be downloaded from here. You may download directly. Please write the reviews of the Implementing a circular data structure using lists. License limitations are unspecified.