Changes between Version 10 and Version 11 of ResumedC

Timestamp:

Apr 29, 2009, 3:22:26 AM (16 years ago)

Author:

Thanatermesis

Comment:

--

ResumedC

@@ -208 +208 @@
 Image an application that stupidly takes a lot of storage but very few 'cpu' usage and you will need to optimize it for data, imagine that it has 3 variables, ''seen'' is used to know if the element is seen, and ''list'' is used to know if the element is on the list, and ''number'' is the number of the element (the ''data''). Between ''number'' needs to be a full ''int'' that requires 16 bits (or a little less than it), you can set ''seen'' and ''list'' to use only 1 bit each one, and ''number'' to use 14 instead of 16, on that way, you will have the full size of the structure 3 times smaller than originally
 
-Normal structure:
+Normal structure, total: '''48''' bits
 || ||0 ||1 ||2 ||3 ||4 ||5 ||6 ||7 ||8 ||9 ||10 ||11 ||12 ||13 ||14 ||15 ||
 ||seen ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||
@@ -214 +214 @@
 ||number ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||
 
-Packaged structure:
+Packaged structure, total '''16''' bits
 ||0 ||1 ||2 ||3 ||4 ||5 ||6 ||7 ||8 ||9 ||10 ||11 ||12 ||13 ||14 ||15 ||
 ||[seen] ||[list] ||[number ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||. ||number] ||
@@ -321 +321 @@
 #!C
 struct mailing {
+   char name[60];
+   char address[120];
    ...
 } list[MAX_ENTRIES];
 
-struct mailing *list_p[MAX_ENTRIES];
-
-for (current...
-   list_p[current] = &list[current];
+struct mailing *list_ptrs[MAX_ENTRIES];
+int current;
+
+for (current = 0; current = number_of_entries; ++current)
+   list_ptrs[current] = &list[current];
+/* Now we have in every list_prts[element], a pointer to the equivalent list[element] array of structures */
 }}}