Anybody using J executables that can be called from Java? How about using the Eclipse Integrated Development Environment to write code for the Android OS and then hook in some J code. By the way, from my very minimal reading about the Android OS, all code written for it seems to be written in Java. Eclipse allows one to compile/debug/run the Java code. The compiler creates code that is specific to Android devices.
Eclipse is pretty good. It also supports development for the BlackBerry and iPhone. [email protected] wrote: >Send Programming mailing list submissions to > [email protected] > >To subscribe or unsubscribe via the World Wide Web, visit > http://jsoftware.com/cgi-bin/mailman/listinfo/programming >or, via email, send a message with subject or body 'help' to > [email protected] > >You can reach the person managing the list at > [email protected] > >When replying, please edit your Subject line so it is more specific >than "Re: Contents of Programming digest..." > > >Today's Topics: > > 1. Re: Splitting an integer into its digits (Don Guinn) > 2. Re: Mask from list of indices with multiplicity (Roger Hui) > 3. Re: Splitting an integer into its digits (Roger Hui) > 4. Re: Splitting an integer into its digits (Roger Hui) > 5. NYC J User Group - September 2010 meeting (September 7th, > 7:00pm EST) (Lettow, Kenneth) > 6. Re: Mask from list of indices with multiplicity (Raul Miller) > 7. Re: Splitting an integer into its digits (Raul Miller) > > >---------------------------------------------------------------------- > >Message: 1 >Date: Tue, 7 Sep 2010 08:04:24 -0500 >From: Don Guinn <[email protected]> >Subject: Re: [Jprogramming] Splitting an integer into its digits >To: Programming forum <[email protected]> >Message-ID: > <[email protected]> >Content-Type: text/plain; charset=UTF-8 > >Sounds like +/b should not be much of a problem. What about the other >primitives? It seems that the primary consideration is that the speed can >not be much, if any, slower than byte booleans to be practical. > >Self-Classify (=) - A shoe in. > >Conversion from bit to other numeric types - Probably about the same speed >as now. > >Creating booleans from comparisons - The packing might require additional >code, but should be about the same speed as now. How could this relate to >Copy? (see next) > >Copy (#) - Probably about the same speed as now; however, it is used a lot >so it can't be slower. > >Append (,) - A bit slower for small arrays but should be considerably faster >for large arrays. > >Grades and sorts (/:) (\:) - Monadic may be difficult as the indices have to >be built. Dyadic? > >Prefix and Infix (\) - Not pretty. +\/b would probably have to be converted >to numeric first. > > >Any others? > > >On Tue, Sep 7, 2010 at 1:47 AM, Robert P. Rumble <[email protected]>wrote: > >> At 08:29 PM 9/6/2010, you wrote: >> >Bytes are directly addressable in the most popular CPUs; >> >bits are not. >> > >> >However, with an additional 20 years of C programming under >> >my belt, I am now confident enough to tackle bit booleans, >> >if I should become interested enough. Bit booleans offer >> >lots of room for lots of juicy tricky clever code. For example, >> >how do you compute +/b where b is a bit-boolean vector? >> >> This may have already been done for you in hardware. >> >> See opcode called popcount or popcnt, aka "the NSA instruction" for >> x86 architectures. >> >> >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm >> > > >------------------------------ > >Message: 2 >Date: Tue, 07 Sep 2010 08:16:05 -0700 >From: Roger Hui <[email protected]> >Subject: Re: [Jprogramming] Mask from list of indices with > multiplicity >To: Programming forum <[email protected]> >Message-ID: <[email protected]> >Content-Type: text/plain; charset=iso-8859-1 > >I am not in favor of implementing either one. > > > >----- Original Message ----- >From: Zsb?n Ambrus <[email protected]> >Date: Tuesday, September 7, 2010 4:32 >Subject: Re: [Jprogramming] Mask from list of indices with multiplicity >To: Programming forum <[email protected]> > >> On Mon, Sep 6, 2010 at 1:41 AM, Raul Miller >> <[email protected]> wrote: >> > And perhaps !. could be used to specify the maximum >> > index if <./ gets that wrong? >> >> I can't see why introducing something ugly like (I.^._1!.m y) >> would be >> better than the simple (m{. I.^._1 y) . > > >------------------------------ > >Message: 3 >Date: Tue, 07 Sep 2010 08:27:50 -0700 >From: Roger Hui <[email protected]> >Subject: Re: [Jprogramming] Splitting an integer into its digits >To: Programming forum <[email protected]> >Message-ID: <[email protected]> >Content-Type: text/plain; charset=iso-8859-1 > >> Any others? > >To repeat myself: LOTS of juicy tricky clever code. > >None of the functions should be any slower for bit booleans >than for byte booleans, but to achieve it ... > >> Sounds like +/b should not be much of a problem > >How about +/"1 b where b=:(m,8*n) ?...@$ 2 is a bit boolean? >b=: (m, 5+8*n) ?...@$ 2 >b=: (m, 2+8*n) ?...@$ 2 > >Just the tip of the iceberg. > > > > >----- Original Message ----- >From: Don Guinn <[email protected]> >Date: Tuesday, September 7, 2010 6:05 >Subject: Re: [Jprogramming] Splitting an integer into its digits >To: Programming forum <[email protected]> > >> Sounds like +/b should not be much of a problem. What about the other >> primitives? It seems that the primary consideration is that the >> speed can >> not be much, if any, slower than byte booleans to be practical. >> >> Self-Classify (=) - A shoe in. >> >> Conversion from bit to other numeric types - Probably about the >> same speed >> as now. >> >> Creating booleans from comparisons - The packing might require >> additionalcode, but should be about the same speed as now. How >> could this relate to >> Copy? (see next) >> >> Copy (#) - Probably about the same speed as now; however, it is >> used a lot >> so it can't be slower. >> >> Append (,) - A bit slower for small arrays but should be >> considerably faster >> for large arrays. >> >> Grades and sorts (/:) (\:) - Monadic may be difficult as the >> indices have to >> be built. Dyadic? >> >> Prefix and Infix (\) - Not pretty. +\/b would probably have to >> be converted >> to numeric first. >> >> >> Any others? >> >> >> On Tue, Sep 7, 2010 at 1:47 AM, Robert P. Rumble >> <[email protected]>wrote: >> > At 08:29 PM 9/6/2010, you wrote: >> > >Bytes are directly addressable in the most popular CPUs; >> > >bits are not. >> > > >> > >However, with an additional 20 years of C programming under >> > >my belt, I am now confident enough to tackle bit booleans, >> > >if I should become interested enough.? Bit booleans offer >> > >lots of room for lots of juicy tricky clever code.? For >> example,> >how do you compute +/b where b is a bit-boolean vector? >> > >> > This may have already been done for you in hardware. >> > >> > See opcode called popcount or popcnt,? aka "the NSA >> instruction"? for >> > x86 architectures. > > >------------------------------ > >Message: 4 >Date: Tue, 07 Sep 2010 08:41:45 -0700 >From: Roger Hui <[email protected]> >Subject: Re: [Jprogramming] Splitting an integer into its digits >To: Programming forum <[email protected]> >Message-ID: <[email protected]> >Content-Type: text/plain; charset=iso-8859-1 > >The same arguments but +/b instead of +/"1 b is even more amusing. > > > >----- Original Message ----- >From: Roger Hui <[email protected]> >Date: Tuesday, September 7, 2010 8:29 >Subject: Re: [Jprogramming] Splitting an integer into its digits >To: Programming forum <[email protected]> > >> > Any others? >> >> To repeat myself:?? LOTS of juicy tricky clever code. >> >> None of the functions should be any slower for bit booleans >> than for byte booleans, but to achieve it ... >> >> > Sounds like +/b should not be much of a problem >> >> How about +/"1 b where b=:(m,8*n) ?...@$ 2 is a bit boolean? >> b=: (m, 5+8*n) ?...@$ 2 >> b=: (m, 2+8*n) ?...@$ 2 >> >> Just the tip of the iceberg. >> >> >> >> >> ----- Original Message ----- >> From: Don Guinn <[email protected]> >> Date: Tuesday, September 7, 2010 6:05 >> Subject: Re: [Jprogramming] Splitting an integer into its digits >> To: Programming forum <[email protected]> >> >> > Sounds like +/b should not be much of a problem. What about >> the other >> > primitives? It seems that the primary consideration is that >> the >> > speed can >> > not be much, if any, slower than byte booleans to be practical. >> > >> > Self-Classify (=) - A shoe in. >> > >> > Conversion from bit to other numeric types - Probably about >> the >> > same speed >> > as now. >> > >> > Creating booleans from comparisons - The packing might require >> > additionalcode, but should be about the same speed as now. How >> > could this relate to >> > Copy? (see next) >> > >> > Copy (#) - Probably about the same speed as now; however, it >> is >> > used a lot >> > so it can't be slower. >> > >> > Append (,) - A bit slower for small arrays but should be >> > considerably faster >> > for large arrays. >> > >> > Grades and sorts (/:) (\:) - Monadic may be difficult as the >> > indices have to >> > be built. Dyadic? >> > >> > Prefix and Infix (\) - Not pretty. +\/b would probably have to >> > be converted >> > to numeric first. >> > >> > >> > Any others? >> > >> > >> > On Tue, Sep 7, 2010 at 1:47 AM, Robert P. Rumble >> > <[email protected]>wrote: >> > > At 08:29 PM 9/6/2010, you wrote: >> > > >Bytes are directly addressable in the most popular CPUs; >> > > >bits are not. >> > > > >> > > >However, with an additional 20 years of C programming under >> > > >my belt, I am now confident enough to tackle bit booleans, >> > > >if I should become interested enough.? Bit booleans offer >> > > >lots of room for lots of juicy tricky clever code.? For >> > example,> >how do you compute +/b where b is a bit-boolean vector? >> > > >> > > This may have already been done for you in hardware. >> > > >> > > See opcode called popcount or popcnt,? aka "the NSA >> > instruction"? for >> > > x86 architectures. > > >------------------------------ > >Message: 5 >Date: Tue, 7 Sep 2010 13:30:04 -0400 >From: "Lettow, Kenneth" <[email protected]> >Subject: [Jprogramming] NYC J User Group - September 2010 meeting > (September 7th, 7:00pm EST) >To: <[email protected]> >Message-ID: > <[email protected]> >Content-Type: text/plain; charset="US-ASCII" > >Hi Everyone, > >The New York City J user group is meeting tonight at 7:00pm (EST). This >will be an online meeting and all are welcome. The URL and directions >for meeting access are listed below. > >Meeting Name: NYC J User Group - September 2010 meeting >Summary: >When: 09/07/2010 7:00 PM - 9:00 PM >Time Zone: (GMT-05:00) Eastern Time (US and Canada) > >to join the meeting: >http://thomaspublishing.adobeconnect.com/nycjugsep2010/ > >---------------- >If you have never attended a Connect Pro meeting before: > >Test your connection: >http://thomaspublishing.adobeconnect.com/common/help/en/support/meeting_ >test.htm > >Get a quick overview: http://www.adobe.com/go/connectpro_overview > >Adobe, the Adobe logo, Acrobat and Acrobat Connect are either registered >trademarks or trademarks of Adobe Systems Incorporated in the United >States and/or other countries. > > > >------------------------------ > >Message: 6 >Date: Tue, 7 Sep 2010 14:05:31 -0400 >From: Raul Miller <[email protected]> >Subject: Re: [Jprogramming] Mask from list of indices with > multiplicity >To: Programming forum <[email protected]> >Message-ID: > <[email protected]> >Content-Type: text/plain; charset=ISO-8859-1 > >On Mon, Sep 6, 2010 at 2:25 AM, Roger Hui <[email protected]> wrote: >> I.^:_1 seems too far from what <:#/.~universe,x does. >> Another way to say that is that I. I.^:_1 x can bear >> scant resemblance to x . > > p: p:inv i.10 >2 2 2 3 5 5 7 7 11 11 > >Nevertheless, both p: and p:inv are useful. > >-- >Raul > > >------------------------------ > >Message: 7 >Date: Tue, 7 Sep 2010 14:10:52 -0400 >From: Raul Miller <[email protected]> >Subject: Re: [Jprogramming] Splitting an integer into its digits >To: Programming forum <[email protected]> >Message-ID: > <[email protected]> >Content-Type: text/plain; charset=ISO-8859-1 > >On Tue, Sep 7, 2010 at 11:41 AM, Roger Hui <[email protected]> wrote: >> The same arguments but +/b instead of +/"1 b is even more amusing. > >Bit booleans are great for arrays with fat rows. You can handle the >"end pieces" the simple and not so efficient way and still get enough >of a speedup from the rest of the row that they are fast. > >But I shudder when I think about skinny arrays. > >-- >Raul > > >------------------------------ > >---------------------------------------------------------------------- >For information about J forums see http://www.jsoftware.com/forums.htm > >End of Programming Digest, Vol 60, Issue 15 >*******************************************
---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
