Data Structures, Containers, Collections/fr: what changed
Revision 2 to 3. Removed lines have a minus sign; added lines have a plus sign.
| Old | New | Line | |
|---|---|---|---|
| 1 | - | ||
| 2 | - | ||
| 3 | - | ||
| 4 | - | ||
| 5 | - | ||
| 6 | - | ||
| 7 | - | ||
| 8 | - | ||
| 9 | - | ||
| 10 | - | ||
| 11 | 1 | ## Introduction | |
| 12 | 2 | ||
| 13 | - | ||
| 3 | + | La plupart des programmes travaillent sur des données, soit en cherchant, en triant, en itérant ou simplement en insérant ou en récupérant. Par conséquent, des moyens de structurer les données, tels les conteneurs et les collections, sont nécessaires. | |
| 14 | 4 | ||
| 15 | - | ||
| 5 | + | Free Pascal est fourni avec de nombreuses structures de données opérant à différents niveaux (RTL, FCL). Il existe par ailleurs des solutions de parties tierces offrant de telles caractéristiques. | |
| 16 | 6 | ||
| 17 | 7 | ## [[RTL|Bibliothèque d'exécution (RTL)]] | |
| 18 | 8 | ||
| 19 | - | ||
| 20 | - | ||
| 21 | - | ||
| 22 | - | ||
| 23 | - | ||
| 24 | - | ||
| 25 | - | ||
| 26 | - | ||
| 27 | - | ||
| 28 | - | ||
| 29 | - | ||
| 30 | - | ||
| 31 | - | ||
| 9 | + | - Unité [[Classes/fr|Classes]] | |
| 10 | + | - [[TList/fr|TList]]: : gère une liste de pointeurs ; peut chercher et trier la liste ; possède une caractéristique de notification d'événement. | |
| 11 | + | - [[TFPList/fr|TFPList]] : gère une liste de pointeurs ; peut chercher et trier la liste ; n'a pas de notification d'événement ; plus rapide que **TList**. | |
| 12 | + | - [[TStrings/fr|TStrings]] : gère une liste de chaînes ; peut chercher, sectionner, sauver vers / charger depuis un fichier, stocker des objets, agir comme un tableau associatif, etc. ; est une classe abstraite. | |
| 13 | + | - [[TStringList/fr|TStringList]] : descendant de **TStrings** ; implémente les méthodes abstraites de **TStrings** ; peut chercher, trier, manipuler les doublons ; possède une caractéristique de notification ; c'est un classe concrète. | |
| 14 | + | - [[TBits/fr|TBits]] : gère une liste de bits (0 or 1) ; utile pour les mappage de bits (pas les pour les formats d'image). | |
| 15 | + | - [[TCollection/fr|TCollection]] et **TCollectionItem** : forment une gestion de base d'articles nommés. | |
| 16 | + | - [[Generics/fr|FGL (Free Generics Library)]] [[fgl unit/fr|unité]] | |
| 17 | + | - [[TFPGList/fr|TFPGList]] | |
| 18 | + | - [[TFPGObjectList/fr|TFPGObjectList]] | |
| 19 | + | - [[TFPGInterfacedObjectList/fr|TFPGInterfacedObjectList]] | |
| 20 | + | - [[TFPGMap/fr|TFPGMap]] | |
| 21 | + | - [[TFPGMapInterfacedObjectData/fr|TFPGMapInterfacedObjectData]] | |
| 32 | 22 | ||
| 33 | 23 | ## [[FCL/fr|Libraire de composants libre (FCL)]] | |
| 34 | 24 | ||
| 35 | 25 | ### FCL-Base | |
| 36 | 26 | ||
| 37 | - | ||
| 38 | - | ||
| 39 | - | ||
| 40 | - | ||
| 41 | - | ||
| 42 | - | ||
| 43 | - | ||
| 44 | - | ||
| 45 | - | ||
| 46 | - | ||
| 47 | - | ||
| 48 | - | ||
| 49 | - | ||
| 50 | - | ||
| 51 | - | ||
| 52 | - | ||
| 53 | - | ||
| 54 | - | ||
| 55 | - | ||
| 27 | + | - unité AVL_Tree | |
| 28 | + | - TAVLTree et TAVLTreeNode; voir [[AVL Tree/fr|AVL Tree]] | |
| 29 | + | - Unité Contnrs | |
| 30 | + | - TFPObjectList | |
| 31 | + | - TObjectList | |
| 32 | + | - TComponentList | |
| 33 | + | - TClassList | |
| 34 | + | - TOrderedList | |
| 35 | + | - TStack | |
| 36 | + | - TObjectStack | |
| 37 | + | - TQueue | |
| 38 | + | - TObjectQueue | |
| 39 | + | - TFPHashList | |
| 40 | + | - TFPHashObjectList | |
| 41 | + | - TFPDataHashTable | |
| 42 | + | - TFPStringHashTable | |
| 43 | + | - TFPObjectHashTable | |
| 44 | + | - TBucketList | |
| 45 | + | - TObjectBucketList | |
| 56 | 46 | ||
| 57 | 47 | ### FCL-STL | |
| 58 | 48 | ||
| 59 | - | ||
| 60 | - | ||
| 61 | - | ||
| 62 | - | ||
| 63 | - | ||
| 64 | - | ||
| 65 | - | ||
| 66 | - | ||
| 67 | - | ||
| 68 | - | ||
| 69 | - | ||
| 70 | - | ||
| 71 | - | ||
| 72 | - | ||
| 73 | - | ||
| 74 | - | ||
| 75 | - | ||
| 76 | - | ||
| 77 | - | ||
| 78 | - | ||
| 49 | + | - GVector unit | |
| 50 | + | - TVector: Implements dynamically self-resizing array, item order is based on insertion order | |
| 51 | + | - GSet unit | |
| 52 | + | - TSet: Implements red-black tree backed set, no order is guaranteed | |
| 53 | + | - GHashSet unit | |
| 54 | + | - THashSet: Implements hashtable backed set, no order is guaranteed | |
| 55 | + | - GStack unit | |
| 56 | + | - TStack: Implements stack, LIFO (last in first out) order | |
| 57 | + | - GQueue unit | |
| 58 | + | - TQueue: Implements stack, items are pushed from front, FIFO (first in first out) order | |
| 59 | + | - GPriorityQueue unit | |
| 60 | + | - TPriorityQueue: Implements heap backed priority queue, order is based on given compare function | |
| 61 | + | - GDeQue unit | |
| 62 | + | - TDeque: Implements double ended queue, items can be pushed and popped from either front or back | |
| 63 | + | - GMap unit | |
| 64 | + | - TMap: Implements TSet (and therefore, red-black tree) backed map | |
| 65 | + | - GHashMap unit | |
| 66 | + | - THashMap: Implements hashtable backed map | |
| 67 | + | - GTree unit | |
| 68 | + | - TTree: Implements k-ary tree, supports depth first and breadth first traversal | |
| 79 | 69 | ||
| 80 | 70 | ## Lazarus/LCL | |
| 81 | 71 | ||
| 82 | - | ||
| 72 | + | - AvgLvlTree: Versions étendues de FPC/FCL TAVLTree et TAVLTreeNode; voir [[AVL Tree]] | |
| 83 | 73 | ||
| 84 | 74 | ## 3rd party | |
| 85 | 75 | ||
| 86 | - | ||
| 87 | - | ||
| 88 | - | ||
| 89 | - | ||
| 90 | - | ||
| 91 | - | ||
| 92 | - | ||
| 93 | - | ||
| 94 | - | ||
| 95 | - | ||
| 96 | - | ||
| 97 | - | ||
| 98 | - | ||
| 99 | - | ||
| 100 | - | ||
| 101 | - | ||
| 102 | - | ||
| 103 | - | ||
| 104 | - | ||
| 105 | - | ||
| 106 | - | ||
| 107 | - | ||
| 108 | - | ||
| 109 | - | ||
| 110 | - | ||
| 111 | - | ||
| 112 | - | ||
| 76 | + | | project | license | generic | types | notes | | |
| 77 | + | |----|----|----|----|----| | |
| 78 | + | | [Containers library for Lazarus](https://github.com/CynicRus/CL4L) | ?? | Non | \| al,rb,hm,hs,ll,q,s,v | portage de Container, bibliothèque Delphi du domaine public | | |
| 79 | + | | [heContnrs](http://code.google.com/p/fprb/wiki/heContnrs) | BSD3 | Oui | \| ... | ... | | |
| 80 | + | | [Fundamentals](http://fundementals.sourceforge.net/) | BSD | Non | \| ... | dans Utils/cDataStructs.pas | | |
| 81 | + | | [RBS AntiDOT](http://sourceforge.net/projects/adot/) | GPLv2 | ?? | \| ... | ... | | |
| 82 | + | | [LightContainers](http://www.stack.nl/~marcov/lightcontainers.zip) | FPC | Non+Oui | \| ... | Variantes génériques et non-génériques. (Delphi n'optimise pas les génériques). Plutôt de bas-niveau | | |
| 83 | + | | [DeCAL](http://svn.freepascal.org/svn/fpcprojects/contrib/decal/) | MPL | Non | \| ... | [browse](http://svn.freepascal.org/cgi-bin/viewvc.cgi/contrib/decal/?root=fpcprojects) variantes + interfaces, relativement lent. | | |
| 84 | + | | [hovadur DeCAL](https://bitbucket.org/hovadur/decal) | MPL | Non | \| al, as, ll, rb, hm, hs, tm, ts, bs | [guide.pdf](https://bitbucket.org/hovadur/decal/src/b0649ae41d228c9b8878be9aab958ce779044d48/guide.pdf?at=default) DeCAL fonctionne dans Lazarus (windows 64 bit/32 bit, linux 64 bit/32 bit) and Delphi7, Delphi XE2. | | |
| 85 | + | | [[StringHashMap]] | MPL1.0 | ?? | \| ... | portage de code de la JCL | | |
| 86 | + | | [GContnrs](http://yann.merignac.free.fr/unit-gcontnrs.html) | LGPLv2 + linking exception | Oui | \| v, hm, hs, ll, q, dq, s, ts, tm, bs | ... | | |
| 87 | + | | [CL4fpc](https://sourceforge.net/projects/cl4fpc/) | GPLv2 | Oui | \| ... | ... | | |
| 113 | 88 | ||
| 89 | + | | code | data type | | |
| 90 | + | |------|----------------| | |
| 91 | + | | al | array list | | |
| 92 | + | | as | array set | | |
| 93 | + | | rb | red-black tree | | |
| 94 | + | | hm | hashmap | | |
| 95 | + | | hs | hashset | | |
| 96 | + | | ll | linked list | | |
| 97 | + | | q | queue | | |
| 98 | + | | dq | dequeue | | |
| 99 | + | | s | stack | | |
| 100 | + | | v | vector | | |
| 101 | + | | tm | treemap | | |
| 102 | + | | ts | treeset | | |
| 103 | + | | bs | bitset | | |
| 104 | + | | | | | |
| 105 | + | ||
| 114 | 106 | --- | |
| 115 | - | ||
| 107 | + | *From the Free Pascal wiki, page "Data Structures, Containers, Collections/fr", as it stood on 2017-10-16 after a change by E-ric, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's [[Licensing]] page. If you have concerns about this material, [message the admin](/wiki-contact).* | |
| 108 | + | Category: Collections/fr | |
| 109 | + | Category: Containers/fr | |
| 110 | + | Category: Data Structures/fr | |
| 111 | + | Category: FCL/fr | |
| 112 | + | Category: LCL/fr | |
| 113 | + | Category: RTL/fr |