Merge pull request #101 from rikardn/ATN

add atn_FAC1

strings/07A9E0A0E22050B86810034CB4BF60

@@ -0,0 +1,3 @@
+$07 + LDA #$E0 + LDY #$E2 + JSR $B850 + PLA + BPL $03 + JMP $BFB4 + RTS
+
+Load address of known constant into YA + call well known floating point function + branch on top of stack and call other well known floating point function.

strings/0B76B383BDD3791EF4A6F57B83FCB0107C0C1F67CA7CDE53CBC17D1464704C7DB7EA517A7D6330887E7E9244993A7E4CCC91C77FAAAAAA138100000000

@@ -0,0 +1 @@
+12 floating point numbers making upp the approximation polynomial for the ATN function. This polynomial is described in "Computer Approximations" by John Fraser Hart et al. (ISBN 0-88275-642-7) according to https://www.c64-wiki.com/wiki/POLY1

strings/A0B9200FBB

@@ -0,0 +1,3 @@
+LDY #$B9 + JSR $BB0F
+
+Partially set input and call well known floating point function

strings/A0E22050B8

@@ -0,0 +1,3 @@
+LDY #$E2 + JSR $B850
+
+Partial load of input + call to known floating point function

strings/A9E0A0E220

@@ -0,0 +1,3 @@
+LDA #$E0 + LDY #$E2 + JSR fragment
+
+Load address of known constant and call some function

strings/B9200FBB

@@ -0,0 +1,3 @@
+$B9 + JSR $BB0F
+
+Fragment + call to well known floating point function

strings/BCA0B920

@@ -0,0 +1,3 @@
+$BC + LDY #$B9 + JMP
+
+Fragments

strings/DAA2A56648

@@ -0,0 +1,3 @@
+$DA + $A2 + LDA $66 + PHA
+
+Fragment + push FAC1 sign on stack