<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en" xmlns="http://www.w3.org/2005/Atom"><title>Recent changes to support-requests</title><link href="https://sourceforge.net/p/x11-basic/support-requests/" rel="alternate"/><link href="https://sourceforge.net/p/x11-basic/support-requests/feed.atom" rel="self"/><id>https://sourceforge.net/p/x11-basic/support-requests/</id><updated>2025-11-22T13:00:01.068000Z</updated><subtitle>Recent changes to support-requests</subtitle><entry><title>x11-basic</title><link href="https://sourceforge.net/p/x11-basic/support-requests/5/" rel="alternate"/><published>2025-11-22T13:00:01.068000Z</published><updated>2025-11-22T13:00:01.068000Z</updated><author><name>Gregory grant Hallock</name><uri>https://sourceforge.net/u/gregoryhallock/</uri></author><id>https://sourceforge.nete82863589f5924baf541a68fd3eab182604023be</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;I have Windows 11 on an ACER laptop. BASIC only user. Need bignum program. Have written a moderate size program (c1000 lines) . Downloaded the latest Winn version. My program ( after alot of corrections - did seem to run once - got through xbc with no errors - to the b.b stage - output file was produced but empty -  must be another step - above was done using the xbc IDE.  Enough of this runs but I can't seem to cross the finish line.  I know nothing of UNIX  etc and I assume the developers are all C,C++,etc programmers - out of my league - the terminology used in the manual is not familiar. &lt;br/&gt;
I am trying to steal the large number feature - other BASICS - don't have that unless you want to go into the realm of C programming etc&lt;br/&gt;
Thanks for the help. I may be missing something simple in the manual.&lt;br/&gt;
Greg Hallock&lt;/p&gt;
&lt;p&gt;I have screen shots of my efforts but maybe later&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#3 X11-Basic GUI</title><link href="https://sourceforge.net/p/x11-basic/support-requests/3/?limit=25#64c3" rel="alternate"/><published>2019-07-09T05:54:14.905000Z</published><updated>2019-07-09T05:54:14.905000Z</updated><author><name>Markus Hoffmann</name><uri>https://sourceforge.net/u/kollo/</uri></author><id>https://sourceforge.net57946e133927def999f2ca88dabc2a7837d2c88f</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;status&lt;/strong&gt;: pending --&amp;gt; closed&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#58f4" rel="alternate"/><published>2014-03-20T11:40:16.324000Z</published><updated>2014-03-20T11:40:16.324000Z</updated><author><name>Markus Hoffmann</name><uri>https://sourceforge.net/u/kollo/</uri></author><id>https://sourceforge.netc6732b912a9fd673bed3c11322b5784cfb067a4d</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;status&lt;/strong&gt;: open --&amp;gt; closed&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#7c52" rel="alternate"/><published>2014-03-19T17:59:24.898000Z</published><updated>2014-03-19T17:59:24.898000Z</updated><author><name>Nick Warne</name><uri>https://sourceforge.net/u/userid-1257129/</uri></author><id>https://sourceforge.net9ad4bbfeed156b4201a0437194311c1b673379a1</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;OK, here is another little program for producing primes if you wish to use it in /calculation/&lt;/p&gt;
&lt;p&gt;I used the alternative val?(n$)&amp;lt;&amp;gt;len(n$) here.&lt;/p&gt;
&lt;p&gt;Nick&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#58a3" rel="alternate"/><published>2014-03-19T17:09:16.615000Z</published><updated>2014-03-19T17:09:16.615000Z</updated><author><name>Markus Hoffmann</name><uri>https://sourceforge.net/u/kollo/</uri></author><id>https://sourceforge.netd1e43caa112eb007e54d399071e4ec9296ee94a5</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Thank you! I included the program in the examples package under /calculation/.&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#54f6" rel="alternate"/><published>2014-03-19T16:44:17.856000Z</published><updated>2014-03-19T16:44:17.856000Z</updated><author><name>Nick Warne</name><uri>https://sourceforge.net/u/userid-1257129/</uri></author><id>https://sourceforge.net18a8dfa0add2fa5a092c6b423d8977f0fdf15213</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Yep, all works great!&lt;/p&gt;
&lt;p&gt;Many thanks for creating X11Basic - I used GFA basic many years ago and love it's ability to do almost anything.&lt;/p&gt;
&lt;p&gt;Great stuff.&lt;/p&gt;
&lt;p&gt;BTW, I have attached a small file if you wish to include it in 'examples' - it includes the inline DEFFN to test if input is a number or not - also it demonstrates how bloody fast the produced binaries are!&lt;/p&gt;
&lt;p&gt;Again, many thanks for this great bit of kit!&lt;/p&gt;
&lt;p&gt;Nick&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#69d8" rel="alternate"/><published>2014-03-19T15:51:21.712000Z</published><updated>2014-03-19T15:51:21.712000Z</updated><author><name>Markus Hoffmann</name><uri>https://sourceforge.net/u/kollo/</uri></author><id>https://sourceforge.net2397281b3c19966079ac5e2c44b4af26605ec252</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;I fixed it and uploaded new source ta-ball. can you confirm that it works now?&lt;/p&gt;
&lt;p&gt;Thanks for mentioning this issue!&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#b8f5" rel="alternate"/><published>2014-03-19T15:48:15.491000Z</published><updated>2014-03-19T15:48:15.491000Z</updated><author><name>Nick Warne</name><uri>https://sourceforge.net/u/userid-1257129/</uri></author><id>https://sourceforge.net1275963afdf5bd973b0e432b92f8f1c80604a12b</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Yes, sorry I though it was working... due to calling the DEFFN function the same name as the full function... so the code was still calling the old function (and ignored the DEFFN) so it worked...&lt;/p&gt;
&lt;p&gt;Nick&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#124d" rel="alternate"/><published>2014-03-19T15:16:22.439000Z</published><updated>2014-03-19T15:16:22.439000Z</updated><author><name>Markus Hoffmann</name><uri>https://sourceforge.net/u/kollo/</uri></author><id>https://sourceforge.net87e715786a5fda961167f3167f1e19700873debe</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;you are right, something is wrong. looks like we have found a bug.&lt;/p&gt;&lt;/div&gt;</summary></entry><entry><title>#4 input n vs input n$</title><link href="https://sourceforge.net/p/x11-basic/support-requests/4/?limit=25#e620" rel="alternate"/><published>2014-03-19T13:26:57.883000Z</published><updated>2014-03-19T13:26:57.883000Z</updated><author><name>Nick Warne</name><uri>https://sourceforge.net/u/userid-1257129/</uri></author><id>https://sourceforge.net70f4964144b0e448363495a08b004b04e72c757a</id><summary type="html">&lt;div class="markdown_content"&gt;&lt;p&gt;Ahh... thank you.  I looked at val?() but couldn't get it to work:&lt;/p&gt;
&lt;p&gt;if val?(s$) &amp;lt;&amp;gt; len(s$)&lt;/p&gt;
&lt;p&gt;produces:&lt;/p&gt;
&lt;p&gt;ERROR at line 5: Array not dimensioned: VAL?()&lt;/p&gt;
&lt;p&gt;I see now I have to assign it to a var$&lt;/p&gt;
&lt;p&gt;Thanks for help,&lt;/p&gt;
&lt;p&gt;Nick&lt;/p&gt;&lt;/div&gt;</summary></entry></feed>