libsim
Versione 7.2.6
|
abstract class to use lists in fortran 2003. Continua...
Tipi di dato | |
type | list |
Abstract implementation of doubly-linked list. Continua... | |
interface | displayValues |
Print the list. Continua... | |
Funzioni/Subroutine | |
subroutine | display (this) |
Print the list. Continua... | |
integer function | countelements (this) |
count values in list Continua... | |
subroutine | append (this, value) |
add class(*) to end of list Continua... | |
subroutine | prepend (this, value) |
add class(*) to beginning of list Continua... | |
logical function | insert (this, value, index) |
add class(*) to position in list Continua... | |
integer function | currentindex (this) |
get index of currLink Continua... | |
subroutine | rewind (this) |
reset list iterator to start Continua... | |
subroutine | forward (this) |
reset list iterator to end Continua... | |
subroutine | next (this) |
increment list iterator Continua... | |
subroutine | prev (this) |
increment list iterator Continua... | |
class(*) function, pointer | currentpoli (this) |
get value from currLink Continua... | |
logical function | element (this) |
return .true. Continua... | |
logical function | seek (this, index) |
set list iterator to index return .false. Continua... | |
logical function | delete (this, index) |
delete values from list return .true. Continua... | |
abstract class to use lists in fortran 2003.
Linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references .
A doubly-linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes' previous and next links, respectively, point to some kind of terminator.
The program example is the better starting point: