Array Module (AMX Mod X) - Revision history

404UNF at 08:58, 24 May 2018

2018-05-24T08:58:10Z

Hammerlock at 03:37, 24 May 2018

2018-05-24T03:37:17Z

Hammerlock at 03:36, 24 May 2018

2018-05-24T03:36:53Z

Hammerlock at 03:36, 24 May 2018

2018-05-24T03:36:24Z

Hammerlock at 03:35, 24 May 2018

2018-05-24T03:35:27Z

Brad at 01:54, 16 January 2006

2006-01-16T01:54:33Z

Show changes

Brad: /* History */

2006-01-16T01:47:27Z

‎History

BAILOPAN: Array Module moved to Array Module (AMX Mod X)

2006-01-14T20:08:20Z

Array Module moved to Array Module (AMX Mod X)

BAILOPAN at 19:06, 14 January 2006

2006-01-14T19:06:13Z

BAILOPAN at 08:02, 14 January 2006

2006-01-14T08:02:46Z

@@ Line 1: / Line 1: @@
-Stink module, created and maintained by Stinky Steve and Friends, brings fast, easy, and efficient dynamic storage into PAWN coding.
+Array module, created and maintained by Twilight Suzuka and Anpheus, brings fast, easy, and efficient dynamic storage into PAWN coding.
 It is essential for many tasks, such as copying entities and is useful in a great many applications, mainly because of how it overcomes PAWN's static nature.
@@ Line 9: / Line 9: @@
 While using this module, for the purposes of creating a customized vault system, Twilight Suzuka discovered these flaws, and investigated. She, along with her good friend Anpheus, pointed out said errors, and fixed a great deal of them. Unsatisfied, Twilight Suzuka created the ArrayX module, using a dual linked list system of implementation.
-== While the ArrayX module did work, and did work well, providing a simple (if "not professional" as Anpheus would say) interface to a simple dynamic array. Sparse, relatively quick, and offering a tri-unit storage (three different types: float, string, integer: per index), ArrayX worked relatively well. However, as BAILOPAN was quick to point out, it utilized an inefficient linked list design. ==
+While the ArrayX module did work, and did work well, providing a simple (if "not professional" as Anpheus would say) interface to a simple dynamic array. Sparse, relatively quick, and offering a tri-unit storage (three different types: float, string, integer: per index), ArrayX worked relatively well. However, as BAILOPAN was quick to point out, it utilized an inefficient linked list design.
 While searching for an appropriately sparse vector design for the new ArrayX, Anpheus chanced upon the Judy library. It offered unparalleled speed, efficiency, and sparse capabilities compared to any other system we could find. Implementing Judy's trie design, they created ArrayX 2.0, which was basically the same then as it is now. It was eventually implemented into the CVS.
@@ Line 82: / Line 80: @@
 It is very simple to use Array Module, as the natives were created for ease of use.
 Think of them in terms of the generic units you already know, and you will be set:
-HOW DO FORUMS WORK?? -hammerlock
 '''Dynamic vs Generic''':
 ; Array - Array

@@ Line 82: / Line 82: @@
 It is very simple to use Array Module, as the natives were created for ease of use.
 Think of them in terms of the generic units you already know, and you will be set:
+HOW DO FORUMS WORK?? -hammerlock
 '''Dynamic vs Generic''':
 ; Array - Array

@@ Line 1: / Line 1: @@
-Array module, created and maintained by Stinky Steve and Friends, brings fast, easy, and efficient dynamic storage into PAWN coding.
+Stink module, created and maintained by Stinky Steve and Friends, brings fast, easy, and efficient dynamic storage into PAWN coding.
 It is essential for many tasks, such as copying entities and is useful in a great many applications, mainly because of how it overcomes PAWN's static nature.
@@ Line 10: / Line 10: @@
 While using this module, for the purposes of creating a customized vault system, Twilight Suzuka discovered these flaws, and investigated. She, along with her good friend Anpheus, pointed out said errors, and fixed a great deal of them. Unsatisfied, Twilight Suzuka created the ArrayX module, using a dual linked list system of implementation.
 [[File:stink.png]]
 While the ArrayX module did work, and did work well, providing a simple (if "not professional" as Anpheus would say) interface to a simple dynamic array. Sparse, relatively quick, and offering a tri-unit storage (three different types: float, string, integer: per index), ArrayX worked relatively well. However, as BAILOPAN was quick to point out, it utilized an inefficient linked list design.
 While searching for an appropriately sparse vector design for the new ArrayX, Anpheus chanced upon the Judy library. It offered unparalleled speed, efficiency, and sparse capabilities compared to any other system we could find. Implementing Judy's trie design, they created ArrayX 2.0, which was basically the same then as it is now. It was eventually implemented into the CVS.

← Older revision		Revision as of 03:36, 24 May 2018
Line 1:		Line 1:
−	Array module, created and maintained by ~~Twilight Suzuka~~ and ~~Anpheus~~, brings fast, easy, and efficient dynamic storage into PAWN coding.	+	Array module, created and maintained by Stinky Steve and Friends, brings fast, easy, and efficient dynamic storage into PAWN coding.

	It is essential for many tasks, such as copying entities and is useful in a great many applications, mainly because of how it overcomes PAWN's static nature.		It is essential for many tasks, such as copying entities and is useful in a great many applications, mainly because of how it overcomes PAWN's static nature.

@@ Line 9: / Line 9: @@
 While using this module, for the purposes of creating a customized vault system, Twilight Suzuka discovered these flaws, and investigated. She, along with her good friend Anpheus, pointed out said errors, and fixed a great deal of them. Unsatisfied, Twilight Suzuka created the ArrayX module, using a dual linked list system of implementation.
+[[File:stink.png]]
 While the ArrayX module did work, and did work well, providing a simple (if "not professional" as Anpheus would say) interface to a simple dynamic array. Sparse, relatively quick, and offering a tri-unit storage (three different types: float, string, integer: per index), ArrayX worked relatively well. However, as BAILOPAN was quick to point out, it utilized an inefficient linked list design.

@@ Line 6: / Line 6: @@
 == History ==
-The original Array module, first written by BAILOPAN for AMXx 1.0, used a vector (or dynamic array) system to create "lists" and "tables". Its implimentation, a hard to understand and convoluted system which daunted many coders, would have nevertheless been very successful if not for a few key factors: It crashed on unload and reload.
+The original Array module, first written by BAILOPAN for AMXx 1.0, used a vector (or dynamic array) system to create "lists" and "tables". Its implementation, a hard to understand and convoluted system which daunted many coders, would have nevertheless been very successful if not for a few key factors: It crashed on unload and reload.
-While using this module, for the purposes of creating a customized vault system, Twilight Suzuka discovered these flaws, and investigated. She, along with her good friend Anpheus, pointed out said errors, and fixed a great deal of them. Unsatisfied, Twilight Suzuka created the ArrayX module, using a dual linked list system of implimentation.
+While using this module, for the purposes of creating a customized vault system, Twilight Suzuka discovered these flaws, and investigated. She, along with her good friend Anpheus, pointed out said errors, and fixed a great deal of them. Unsatisfied, Twilight Suzuka created the ArrayX module, using a dual linked list system of implementation.
-While the ArrayX module did work, and did work well, providing a simple (if "not professional" as Anpheus would say) interface to a simple dynamic array. Sparce, relatively quick, and offering a tri-unit storage (three different types: float, string, integer: per index), ArrayX worked relatively well. However, as BAILOPAN was quick to point out, it utilized an ineffecient linked list design.
+While the ArrayX module did work, and did work well, providing a simple (if "not professional" as Anpheus would say) interface to a simple dynamic array. Sparse, relatively quick, and offering a tri-unit storage (three different types: float, string, integer: per index), ArrayX worked relatively well. However, as BAILOPAN was quick to point out, it utilized an inefficient linked list design.
-While searching for an appropriately sparce vector design for the new ArrayX, Anpheus chanced upon the Judy library. It offered unparrallel speed, effeciency, and sparce capabilities compared to any other system we could find. Implimenting Judy's trie design, they created ArrayX 2.0, which was basically the same then as it is now. It was eventually implimented into the CVS.
+While searching for an appropriately sparse vector design for the new ArrayX, Anpheus chanced upon the Judy library. It offered unparalleled speed, efficiency, and sparse capabilities compared to any other system we could find. Implementing Judy's trie design, they created ArrayX 2.0, which was basically the same then as it is now. It was eventually implemented into the CVS.
 == Description ==

← Older revision	Revision as of 20:08, 14 January 2006
(No difference)

← Older revision		Revision as of 19:06, 14 January 2006
Line 312:		Line 312:


−	[[Category:3rd Party Modules]]	+	[[Category:3rd Party Modules (AMX Mod X)]]

← Older revision		Revision as of 08:02, 14 January 2006
Line 312:		Line 312:


−	[[Category:~~Extended~~ Modules]]	+	[[Category:3rd Party Modules]]