foundational_lib 1.0 → 1.0.1

data/Articles_MD/4.html.md

@@ -27,7 +27,7 @@ Preface
 \
 \
 
-And I mean this an unequivocally and thoroughgoingly as possible -- you
+And I mean this as unequivocally and thoroughgoingly as possible -- you
 can let bridges collapse even. I\'m serious.
 
 This is all in line with having the best reasoning ability. If it is

data/Articles_MD/index.html.md

@@ -23,3 +23,4 @@ Articles -- Read In Order
 -   [The Power of Non-Collaboration](14.html)
 -   [AI Is Good, And Bad.](15.html)
 -   [Epistemology](16.html)
+-   [On AI](17.html)

data/Audio/other/BITLY_LINKS

@@ -0,0 +1 @@
+Cycle of Ethical Behavior Audio Download - bit.ly/3uwaOOH

data/Audio/other/CYCLE_TRANSCRIPT

@@ -0,0 +1,38 @@
+The Cycle of Ethical Behavior Audio Transcript
+By Gregory Cohen
+
+
+There is a Cycle of Operation. This is the “Cycle of Ethical Behavior”.
+
+1. Fixate.
+2. Worsen social relations.
+3. Find and take environmental data, research could be done, no “moral” or “ethical” limitations.
+4. Fix existential limitations problem for group.
+5. Become somewhat “sane” again.
+6. Go to 1. Repeat literally ad infinitum.
+
+Now, this is a modus operandi that all human beings and robots should follow.
+
+It is somewhat dangerous but it leads to actual results.
+
+There is a TREMENDOUS amount of potential with this method of operation.
+
+But it is important that it be understood. It could be applied in a top down fashion from above (the billionaires, etc.), but it would be ideal if the common people understood this too – and if this didn't have to be applied by true pure Fascism – but rather agreement.
+
+From this – an Axiology can be found – a philosophy or study of Value – comprised of the two branches of the field of Axiology - Ethics and Aesthetics. I came up with this in 2018.
+
+In terms of Ethics, it works like this -
+
+To be a Good Being, one must be able to be considered to be in the cycle by other(s), by self, and agree with the Cycle of Ethical Behavior.
+
+There are 3 kinds of observers (people, human beings, “men,” etc.)
+
+1. A Good Observer; all others are 2 or 3
+2. A Tool Observer, acts as a tool for Good Observer(s) and follows normal mores and “agree”s to most things; all others are 3
+3. An Abominable Observer; the “catch-all” for all other observers
+
+"Observer" here is a specific term from a book that I wrote in 2018 about this stuff. It was only a draft.
+
+It is very important – extremely important – that people evaluate ethics for themselves and others in this way.
+
+And that people follow the Cycle of Ethical Behavior.

data/Audio/other/RIGHT_PROBLEM_TRANSCRIPT

@@ -0,0 +1,41 @@
+The Right Problem
+By Gregory Cohen
+
+All action must be based on heuristics of the proper solution to the Right Problem at hand. Knowing the Right Problem is more important that any solutions.
+
+The Right Problem is probably not what the individual is being told – family, race, gender, economic circumstances, lack of education or experience or being in the right place at the right time – these are all not the Right Problem.
+
+The Right Problem is categorical and isn't based on the individual.
+
+It depends on philosophical circumstances.
+
+We are talking about human action, human techne, in order to resolve problems.
+
+A sub-problem is likely to be a lack of power in operation, in techne.
+
+Therefore, people strive after connection, money, influence, high status, in order to resolve a given problem, or problems collectively.
+
+The Right Problem likely relates to survival and knowing as much as possible.
+
+But in order to not alienate the reader, I need not wax philosophical about the topmost “right problem.”
+
+In human techne, in operation, there are also "Right Sub Problems".
+
+A “Right Sub Problem” might be
+
+Postulate 1 — We exist and we think
+Postulate 2 — Our existence and thought is observed to be imperilled – by us
+Sub Goal 1 — Survival and persistence and existing – to the highest level
+Sub Problem 1 — Now we have the problem of how to bring this about
+Postulate 2 — We can operate, but our operation is limited (by whatever factors)
+Postulate 3 — We have made machines.
+Sub Goal 2 — We should increase our level of potential operation to its highest level, resulting in the highest level of general Ability.
+Sub Problem 2 — Now, we need to figure out how to execute this.
+Postulate 4 — Machines can increase our level of operation, our level of techne.
+Postulate 5 — Machines have limits themselves
+Postulate 6 — We should maximize machines to increase our level of operation, within ethical limits perhaps, aligning with our main real goals and subgoals (which are not necessarily all stated here)
+Postulate 7 — Machines are limited by as fast as they can move.
+Sub Goal 3 — Therefore, we need to figure out how to maximize machines to their highest potential
+Sub Problem 3 — Our problem, then, is to remove from existence all things that get in the way of having machines operate well, which, in turn, aligns with our goals of being able to operate, which in turn aligns with our goal of surviving well.
+
+Now, this Sub Problem 3 of Existence is interesting.

data/{DOCS.md → DOCS_MOBILE.md}

@@ -2,7 +2,6 @@
 
 <h2>Finally, a cross-platform, portable, well-designed, secure, robust, maximally-efficient C foundational library &mdash; Making Engineering And Computing Fast, Secure, Responsive And Easy.</h2>
 <br>
-<h2><i>Library Uses - What It Does, What It Is, And What It Is A Solution For</i></h2>
 <ul class="features-list">
 <li><strong>Enables better Engineering Solutions and Security broadly and foundationally where Software Creation or Development or Script Creation is concerned - whether this be on a local, business, governmental or international basis, and makes things easier - and Computing in General.</strong> Don't Reinvent the Wheel - Use Good Wheels - Be Safe And Secure.</li>
 <br>
@@ -11,7 +10,7 @@
 </ul>
 <br>
 <ul>
-<h2><i>About Foundationallib</i></h2>
+<h2>About Foundationallib</h2>
 <li>→<strong>Cross platform</strong> - works perfectly in embedded, server, desktop, and all platforms - tested for Windows and UNIX - 64-bit and 32-bit, includes a 3-aspect test suite, with more to come.</li>
 <li>→<strong>Bug free. Reliable. Dependable. Secure. Tested well.</strong></li>
 <li>→<strong>Zero Overhead</strong> - Only 1 byte due to the power of the error handling, can be configured will full power.</li>
@@ -40,7 +39,7 @@ See the example script in this repository. This makes optimizing your Python / P
 </p>
 </div>
 <div class=pane style='border: 0;border-right: 1px dotted rgb(200, 200, 200); background-color: rgb(255, 255, 190);'>
-<div class="library-details"><h2 style=color:green;><i>Foundationallib Features</i></h2>
+<div class="library-details"><h2 style=color:green;>Foundationallib Features</h2>
 <p class=feature>
 <strong>Functional Programming Features</strong> - <code>map, reduce, filter,</code> List Comprehensions in C and much more!</p>
 <p class=feature><strong>Expands C's Primitives for easy manipulation of data types</strong> such as Arrays, Strings, <code>Dict</code>, <code>Set</code>, <code>FrozenDict</code>, <code>FrozenSet</code> - <strong>and enables easy manipulation, modification,
@@ -96,6 +95,27 @@ I desire to make this library the best theoretically possible,
 so please, let us connect.
 
 
+<pre><code>
+Mirror Links
+
+Blog - https://foundationallib.wordpress.com/
+
+Github - https://github.com/gregoryc/foundationallib
+
+Ruby Gem Mirror - https://rubygems.org/gems/foundational_lib
+
+Ruby Gem Mirror - https://rubygems.org/gems/foundational_lib2
+
+Library Instagram - https://www.instagram.com/foundationallib
+
+Google Drive Mirrors
+
+ZIP - https://drive.google.com/file/d/1bK2njCRsH4waTm4LP16sloPQawk7JIR5/view?usp=sharing
+TAR.GZ - https://drive.google.com/file/d/1RCA1yy9R3cEqI_X9Lv0fxqh-zgNCK005/view?usp=sharing
+TAR.BZ2 - https://drive.google.com/file/d/1ljdlI_fEnMS_X5WmuhI1qavhgseWlD5j/view?usp=sharing
+</code></pre>
+
+
 <h1>This code is in the public domain, fully.
 
 You can do whatever you want with it.
@@ -2166,7 +2186,7 @@ See docs.html for API reference.
    int(*condition)(void *))
    Filters elements of an array (void* version) based on a specified
    condition.
-   Definition: foundationallib.h:8543
+   Definition: foundationallib.h:8550
  <h2>filter_filesystem_files_as_strings()</h2>
 
    FOUNDATIONAL_LIB_FUNC int filter_filesystem_files_as_strings (
@@ -2253,7 +2273,7 @@ See docs.html for API reference.
    FOUNDATIONAL_LIB_FUNC int filter_ints(int *source, size_t source_size,
    int *destination, int(*condition)(int))
    Filters elements of an integer array based on a specified condition.
-   Definition: foundationallib.h:8388
+   Definition: foundationallib.h:8395
  <h2>find_first_of()</h2>
 
    FOUNDATIONAL_LIB_FUNC ssize_t find_first_of ( const char *  str,
@@ -3123,10 +3143,9 @@ See docs.html for API reference.
    and stability issues. We never, NEVER want any of those things. Ever.
  <h2>FOUNDATIONAL_LIB_safe_mul()</h2>
 
-   static FOUNDATIONAL_LIB_CONST size_t FOUNDATIONAL_LIB_safe_mul (
-   size_t  a,
-   size_t  b
-   )
+   static size_t FOUNDATIONAL_LIB_safe_mul ( size_t  a,
+                                             size_t  b
+                                           )
    inlinestatic
 
    Safely multiply 2 numbers to avoid unsigned integer overflows and
@@ -3839,7 +3858,7 @@ See docs.html for API reference.
    FOUNDATIONAL_LIB_FUNC int is_array_digit(const char **array, size_t
    size)
    Check if a string array contains only digits.
-   Definition: foundationallib.h:9498
+   Definition: foundationallib.h:9506
  <h2>is_array_lower()</h2>
 
    FOUNDATIONAL_LIB_FUNC int is_array_lower ( const char **  array,
@@ -4314,7 +4333,7 @@ See docs.html for API reference.
 
    Perform a list comprehension operation.
 
-   Definition: foundationallib.h:8659
+   Definition: foundationallib.h:8667
 
    // Example Usage 2: Transform each string to uppercase and filter out
    those
@@ -4528,7 +4547,7 @@ See docs.html for API reference.
    FOUNDATIONAL_LIB_FUNC void map(void *array, size_t size, size_t
    elem_size, void(*transform)(void *))
    Applies a transformation to each element of an array (void* version).
-   Definition: foundationallib.h:8435
+   Definition: foundationallib.h:8442
  <h2>map_filesystem_files_as_strings()</h2>
 
    FOUNDATIONAL_LIB_FUNC int map_filesystem_files_as_strings ( const
@@ -4606,7 +4625,7 @@ See docs.html for API reference.
    FOUNDATIONAL_LIB_FUNC void map_ints(int *array, size_t size,
    int(*transform)(int))
    Applies a transformation to each element of an integer array.
-   Definition: foundationallib.h:8295
+   Definition: foundationallib.h:8302
  <h2>memmem()</h2>
 
    void* memmem ( const void *  haystack,
@@ -6369,7 +6388,7 @@ See docs.html for API reference.
    elem_size, void *result, void(*operation)(void *, void *))
    Performs a reduction on an array (void* version) using a binary
    operation.
-   Definition: foundationallib.h:8481
+   Definition: foundationallib.h:8488
  <h2>reduce_filesystem_files_as_strings()</h2>
 
    FOUNDATIONAL_LIB_FUNC char* reduce_filesystem_files_as_strings (
@@ -6456,7 +6475,7 @@ See docs.html for API reference.
    FOUNDATIONAL_LIB_FUNC int reduce_ints(int *array, size_t size,
    int(*operation)(int, int))
    Performs a reduction on an integer array using a binary operation.
-   Definition: foundationallib.h:8337
+   Definition: foundationallib.h:8344
  <h2>reject_array()</h2>
 
    FOUNDATIONAL_LIB_FUNC void* reject_array ( const void *  source,
@@ -6769,7 +6788,8 @@ See docs.html for API reference.
 <h3><pre>Parameters</pre></h3>
 
 
-   should_free_after_use A pointer to a int indicating whether
+   should_free_after_use A pointer to a int indicating whether one should
+   free the memory after using the function.
    num_matches A pointer to a variable to store the number of replacements
    made.
    matches_max A pointer to the maximum number of replacements to make. If
@@ -8623,7 +8643,7 @@ ed-wise depending on machine. On one of my machines, memmem() was MUCH faster
    FOUNDATIONAL_LIB_FUNC int string_array_uniq(const char **array, size_t
    size, char ***output, size_t *output_size)
    Remove duplicate strings from a string array.
-   Definition: foundationallib.h:9614
+   Definition: foundationallib.h:9622
  <h2>string_array_uniq_adjacent()</h2>
 
    FOUNDATIONAL_LIB_FUNC int string_array_uniq_adjacent ( const char
@@ -8684,7 +8704,7 @@ ed-wise depending on machine. On one of my machines, memmem() was MUCH faster
    FOUNDATIONAL_LIB_FUNC int string_array_uniq_adjacent(const char
    **first_array, size_t size, char ***new_array, size_t *new_size)
    Remove adjacent duplicate strings from a string array.
-   Definition: foundationallib.h:9714
+   Definition: foundationallib.h:9722
  <h2>string_has_substr()</h2>
 
    FOUNDATIONAL_LIB_FUNC int string_has_substr ( const char *
@@ -9102,7 +9122,7 @@ Macros
 
    #define  FOUNDATIONAL_LIB_PUTCHAR   putchar
 
-   #define  FOUNDATIONAL_LIB_FPUTC   putc
+   #define  FOUNDATIONAL_LIB_FPUTC   fputc
 
    #define  FOUNDATIONAL_LIB_STRPBRK   strpbrk
 
@@ -9143,7 +9163,7 @@ Macros
    FOUNDATIONAL_LIB_INITIAL_STRING_ARRAY_ALLOC_SIZE   (sizeof(char *)
    * 1)
 
-   #define  FOUNDATIONAL_LIB_likely(x)   (x)
+   #define  FOUNDATIONAL_LIB_LIKELY(x)   (x)
 
    #define  FOUNDATIONAL_LIB_UNLIKELY(x)   (x)
 
@@ -9247,8 +9267,7 @@ Functions
    >=21), "Increase SIZE_STRING_OF_NUMBER_SIZE_PLUS_ZERO_TERMINATOR to
    more than 21")
 
-   static FOUNDATIONAL_LIB_CONST size_t  FOUNDATIONAL_LIB_safe_mul
-   (size_t a, size_t b)
+   static size_t  FOUNDATIONAL_LIB_safe_mul (size_t a, size_t b)
      Safely multiply 2 numbers to avoid unsigned integer overflows and
    security and stability issues. We never, NEVER want any of those
    things. Ever. More...
@@ -10870,7 +10889,7 @@ Macro Definition Documentation
    FOUNDATIONAL_LIB_aggressive_die
    FOUNDATIONAL_LIB_AGGRESSIVE_DIE_TYPE FOUNDATIONAL_LIB_aggressive_die
    Global variable to control aggressive die behavior.
-   Definition: foundationallib.h:847
+   Definition: foundationallib.h:854
    FOUNDATIONAL_LIB_UNLIKELY
    #define FOUNDATIONAL_LIB_UNLIKELY(x)
    Definition: foundationallib.h:424
@@ -10897,7 +10916,7 @@ Macro Definition Documentation
    #define FOUNDATIONAL_LIB_FPRINTF   fprintf
  <h2>FOUNDATIONAL_LIB_FPUTC</h2>
 
-   #define FOUNDATIONAL_LIB_FPUTC   putc
+   #define FOUNDATIONAL_LIB_FPUTC   fputc
  <h2>FOUNDATIONAL_LIB_FPUTS</h2>
 
    #define FOUNDATIONAL_LIB_FPUTS   fputs
@@ -10981,9 +11000,9 @@ Macro Definition Documentation
  <h2>FOUNDATIONAL_LIB_ISUPPER</h2>
 
    #define FOUNDATIONAL_LIB_ISUPPER   isupper
- <h2>FOUNDATIONAL_LIB_likely</h2>
+ <h2>FOUNDATIONAL_LIB_LIKELY</h2>
 
-   #define FOUNDATIONAL_LIB_likely (   x )    (x)
+   #define FOUNDATIONAL_LIB_LIKELY (   x )    (x)
  <h2>FOUNDATIONAL_LIB_LOW_MEMORY_USAGE</h2>
 
    #define FOUNDATIONAL_LIB_LOW_MEMORY_USAGE   12
@@ -11049,7 +11068,7 @@ Macro Definition Documentation
    size_t *ptr)
    Safely add 2 numbers to avoid unsigned integer overflows and security
    and stability issues....
-   Definition: foundationallib.h:587
+   Definition: foundationallib.h:595
  <h2>FOUNDATIONAL_LIB_set_aggressive_die</h2>
 
    #define FOUNDATIONAL_LIB_set_aggressive_die (   mode )

data/NOTE.md

@@ -1,29 +1,26 @@
 * The main file is in tools/funcs.cpp, run_lib generates the files.
 
-
 * In case this gets taken down by the powers that be, there is also
 
 rubygems.org/gems/foundationallib. It is not really a ruby project, but the more mirrors, the more sites I can get for this, the better.
 
-
 I can see why this project might make some people mad or deranged.
 
-
 Mirror Links
 
-
 Blog - https://foundationallib.wordpress.com/
 
 Github - https://github.com/gregoryc/foundationallib
 
-Ruby Gem Mirror - https://rubygems.org/gems/foundationallib
-
-Ruby Gem Mirror - https://rubygems.org/gems/foundationallib2
-
+Ruby Gem Mirror - https://rubygems.org/gems/foundational_lib
 
+Ruby Gem Mirror - https://rubygems.org/gems/foundational_lib2
 
 Google Drive Mirrors
 
 ZIP - https://drive.google.com/file/d/1bK2njCRsH4waTm4LP16sloPQawk7JIR5/view?usp=sharing
 TAR.GZ - https://drive.google.com/file/d/1RCA1yy9R3cEqI_X9Lv0fxqh-zgNCK005/view?usp=sharing
-TAR.BZ2 - https://drive.google.com/file/d/1RCA1yy9R3cEqI_X9Lv0fxqh-zgNCK005/view?usp=sharing
+TAR.BZ2 - https://drive.google.com/file/d/1ljdlI_fEnMS_X5WmuhI1qavhgseWlD5j/view?usp=sharing
+
+
+Instagram - https://www.instagram.com/foundationallib/

data/ONLINE_DOCS

@@ -0,0 +1 @@
+https://www.embracematurity.com/docs/html/html/foundationallib_8h.html

data/README.md

@@ -2,7 +2,6 @@
 
 <h2>Finally, a cross-platform, portable, well-designed, secure, robust, maximally-efficient C foundational library &mdash; Making Engineering And Computing Fast, Secure, Responsive And Easy.</h2>
 <br>
-<h2><i>Library Uses - What It Does, What It Is, And What It Is A Solution For</i></h2>
 <ul class="features-list">
 <li><strong>Enables better Engineering Solutions and Security broadly and foundationally where Software Creation or Development or Script Creation is concerned - whether this be on a local, business, governmental or international basis, and makes things easier - and Computing in General.</strong> Don't Reinvent the Wheel - Use Good Wheels - Be Safe And Secure.</li>
 <br>
@@ -11,7 +10,7 @@
 </ul>
 <br>
 <ul>
-<h2><i>About Foundationallib</i></h2>
+<h2>About Foundationallib</h2>
 <li>→<strong>Cross platform</strong> - works perfectly in embedded, server, desktop, and all platforms - tested for Windows and UNIX - 64-bit and 32-bit, includes a 3-aspect test suite, with more to come.</li>
 <li>→<strong>Bug free. Reliable. Dependable. Secure. Tested well.</strong></li>
 <li>→<strong>Zero Overhead</strong> - Only 1 byte due to the power of the error handling, can be configured will full power.</li>
@@ -40,7 +39,7 @@ See the example script in this repository. This makes optimizing your Python / P
 </p>
 </div>
 <div class=pane style='border: 0;border-right: 1px dotted rgb(200, 200, 200); background-color: rgb(255, 255, 190);'>
-<div class="library-details"><h2 style=color:green;><i>Foundationallib Features</i></h2>
+<div class="library-details"><h2 style=color:green;>Foundationallib Features</h2>
 <p class=feature>
 <strong>Functional Programming Features</strong> - <code>map, reduce, filter,</code> List Comprehensions in C and much more!</p>
 <p class=feature><strong>Expands C's Primitives for easy manipulation of data types</strong> such as Arrays, Strings, <code>Dict</code>, <code>Set</code>, <code>FrozenDict</code>, <code>FrozenSet</code> - <strong>and enables easy manipulation, modification,
@@ -96,6 +95,27 @@ I desire to make this library the best theoretically possible,
 so please, let us connect.
 
 
+<pre><code>
+Mirror Links
+
+Blog - https://foundationallib.wordpress.com/
+
+Github - https://github.com/gregoryc/foundationallib
+
+Ruby Gem Mirror - https://rubygems.org/gems/foundational_lib
+
+Ruby Gem Mirror - https://rubygems.org/gems/foundational_lib2
+
+Library Instagram - https://www.instagram.com/foundationallib
+
+Google Drive Mirrors
+
+ZIP - https://drive.google.com/file/d/1bK2njCRsH4waTm4LP16sloPQawk7JIR5/view?usp=sharing
+TAR.GZ - https://drive.google.com/file/d/1RCA1yy9R3cEqI_X9Lv0fxqh-zgNCK005/view?usp=sharing
+TAR.BZ2 - https://drive.google.com/file/d/1ljdlI_fEnMS_X5WmuhI1qavhgseWlD5j/view?usp=sharing
+</code></pre>
+
+
 <h1>This code is in the public domain, fully.
 
 You can do whatever you want with it.