Screenshot instructions:
Windows
Mac
Red Hat Linux
Ubuntu
Click URL instructions:
Rightclick on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)
You can subscribe to this list here.
2014 
_{Jan}

_{Feb}
(232) 
_{Mar}
(323) 
_{Apr}
(383) 
_{May}
(359) 
_{Jun}
(435) 
_{Jul}
(252) 
_{Aug}
(172) 
_{Sep}
(265) 
_{Oct}
(263) 
_{Nov}
(350) 
_{Dec}
(359) 

2015 
_{Jan}
(267) 
_{Feb}
(220) 
_{Mar}
(311) 
_{Apr}
(269) 
_{May}
(388) 
_{Jun}
(403) 
_{Jul}
(172) 
_{Aug}
(399) 
_{Sep}
(364) 
_{Oct}
(269) 
_{Nov}
(357) 
_{Dec}
(468) 
2016 
_{Jan}
(618) 
_{Feb}
(592) 
_{Mar}
(625) 
_{Apr}
(516) 
_{May}
(375) 
_{Jun}
(155) 
_{Jul}
(346) 
_{Aug}
(262) 
_{Sep}
(346) 
_{Oct}
(291) 
_{Nov}
(333) 
_{Dec}
(335) 
2017 
_{Jan}
(436) 
_{Feb}
(460) 
_{Mar}
(370) 
_{Apr}
(189) 
_{May}
(252) 
_{Jun}
(272) 
_{Jul}
(286) 
_{Aug}
(293) 
_{Sep}
(303) 
_{Oct}
(331) 
_{Nov}
(346) 
_{Dec}
(273) 
2018 
_{Jan}
(295) 
_{Feb}
(343) 
_{Mar}
(265) 
_{Apr}
(290) 
_{May}
(194) 
_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 







1
(7) 
2
(14) 
3
(22) 
4
(14) 
5
(9) 
6
(8) 
7
(18) 
8
(8) 
9
(1) 
10
(4) 
11
(4) 
12
(22) 
13
(10) 
14
(8) 
15
(6) 
16
(6) 
17
(15) 
18
(1) 
19
(13) 
20
(15) 
21
(7) 
22
(12) 
23
(17) 
24
(13) 
25
(10) 
26
(12) 
27
(8) 
28
(9) 
29
(14) 
30
(10) 
31
(6) 





From: Leo Butler <l_butler@us...>  20140320 19:13:35

> > Here is an example, similar to the function you want, but slightly simpler: > > Leo's and Pankaj's code have different specifications: > > (%i16) take([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); > (%o16) [[5,4],[6,5],[7,7],[8,4],[10,4],[11,5],[14,7],[15,8]] > > (%i17) takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); > (%o17) [[4,5],[5,6],[7,7],[4,8]] > > Leo's code continues to gather members after a failuremaybe that's not what Pankaj wanted? > Let me guess that a simple modification of Leo's code would allow it to stop after the end of a > run. That's correct, and I (obliquely) suggested it is an exercise to modify 'take' to make 'takewhile'. I believe that Pankaj wants to learn Maxima, so I would like to provide such an opportunity. Leo 
From: Robert Dodier <robert.dodier@gm...>  20140320 18:30:13

On 20140320, Dimiter Prodanov <dimiterpp@...> wrote: > [image: Inline image 2] > [image: Inline image 3] > [image: Inline image 4] Please bear in mind that some people follow the discussion list using textonly interfaces. Probably it's better in any case to paste in the text which is presumably shown in the images. best, Robert Dodier 
From: Robert Dodier <robert.dodier@gm...>  20140320 18:25:38

On 20140320, Thomas D. Dean <tomdean@...> wrote: > declare(w1, real), declare(w2, real), declare(w3, real); > W:matrix( > [ 0, w3, w2, w1], > [w3, 0, w1, w2], > [ w2, w1, 0, w3], > [w1, w2, w3, 0]); > > expW:matrixexp(W); > eq:ratsubst(zzz, w3^2+w2^2+w1^2, expW); > limit(eq,zzz,0); Looks like the problem is in limit. Here's a simpler version of it: (%i1) foo : sqrt(z)*%e^sqrt(z)/zsqrt(z)*%e^sqrt(z)/z $ (%i2) limit (foo, z, 0); <waits indefinitely> Tracing the internal function LIMIT, I see that LIMIT is called on enormous expressions which contain large integers. I'm not sure where those come from. Factoring something? Rationalizing bigfloat coefficients? Incidentally gruntz(foo, z, 0, plus) => 2. At this point all I can suggest is that someone file a bug report. best, Robert Dodier 
From: Richard Fateman <fateman@be...>  20140320 17:56:42

On 3/20/2014 9:16 AM, Richard Fateman wrote: > > If we assume that as zzz > 0, so does sqt(zzz), then perhaps you could > just do ratsubst(yyy, sqrt(zzz),eq). > > then limit(%,yyy,0) returns the 4x4 identity matrix in a fraction of a > second. oops, I see that the ratsubst(yyy, sqrt(zzz) , eq) left some instances of zzz around, so the limits may not be right. you can play around some more with something like *for i:1 thru 4 do for j:1 thru 4 do print([i,j,limit(m[i,j],yyy,0)]);* 
From: Pankaj Sejwal <pankajsejwal@gm...>  20140320 17:49:52

Yes, the functionality is different, I guess Leo missed it. I have corrected my mistake, and it was just running for one extra count, __________________________________ takewhile(x,p):=block([s:1,temp:[],temp1:[],count:1,xx:create_list([x[i],i],i,makelist(i,i,length(x)))], print(xx), for i in xx do if apply(p,[first(i)]) then temp:cons(i,temp) ,temp:reverse(temp), if(length(temp)>=2 and flatten(temp)#[]) then (while(count<length(temp) and last(temp[s])+1=last(temp[s+1]) ) do (temp1:cons(temp[s],temp1),count:count+1,s:s+1), if(s<=length(temp)) then (temp1:cons(temp[s],temp1))) else temp1:temp,reverse(temp1))$ _____________________________________ Usage:: a) takewhile([9,18],lambda([x],x>3)) => [[9,1],[18,2]] b) takewhile([3,8,4,4,6,9,7,0,9,7,9,6,0,6,3,0,6,0,8,9],lambda([x],x^4>14)); => [[3,1],[8,2],[4,3],[4,4],[6,5],[9,6],[7,7]] Leo's way is helpful in terms of explaining interface(which I didn't know yet) and also promotes to employ more of haskell style coding which I find absolutely powerful. Regards, Pankaj Sejwal On Thu, Mar 20, 2014 at 10:36 PM, Barton Willis <willisb@...> wrote: > > Here is an example, similar to the function you want, but slightly > simpler: > > Leo's and Pankaj's code have different specifications: > > (%i16) take([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); > (%o16) [[5,4],[6,5],[7,7],[8,4],[10,4],[11,5],[14,7],[15,8]] > > (%i17) takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); > (%o17) [[4,5],[5,6],[7,7],[4,8]] > > Leo's code continues to gather members after a failuremaybe that's not > what Pankaj wanted? > Let me guess that a simple modification of Leo's code would allow it to > stop after the end of a > run. > > Barton > >  never take anyone's word for it.... 
From: Barton Willis <willisb@un...>  20140320 17:06:39

> Here is an example, similar to the function you want, but slightly simpler: Leo's and Pankaj's code have different specifications: (%i16) take([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); (%o16) [[5,4],[6,5],[7,7],[8,4],[10,4],[11,5],[14,7],[15,8]] (%i17) takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); (%o17) [[4,5],[5,6],[7,7],[4,8]] Leo's code continues to gather members after a failuremaybe that's not what Pankaj wanted? Let me guess that a simple modification of Leo's code would allow it to stop after the end of a run. Barton 
From: Leo Butler <l_butler@us...>  20140320 16:29:25

> I could not find any documentation for takewhile in Maxima.So, I tried writ= > ing my own which gives both elements and their position.It starts taking fr= > om anywhere in list as soon as the criteria is satisfied. I ended up with t= > wo functions with subtle difference, > > takewhile(x,p):=3Dblock([s:1,temp:[],temp1:[],count:1,xx:create_list([x= > [i],i],i,makelist(i,i,length(x)))], > for i in xx do if apply(p,[first(i)]) then temp:cons(i= > ,temp) ,temp:reverse(temp), > if(length(temp)>=3D2 and flatten(temp)#[]) then > (while(last(temp[s])+1=3Dlast(temp[s+1]) and count<=3Dl= > ength(temp)) do > (temp1:cons(temp[s],temp1),count:count+1,s:s+1), > if(s<length(temp)) then temp1:cons(temp[s],temp1)) else= > temp1:temp,reverse(temp1))$ > > Usage :: takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); > > OUTPUT :: [[4,5],[5,6],[7,7],[4,8]] > > and second as, > > takewhile1(x,p):=3Dblock([s:1,temp:[],temp1:[],count:1,xx:create_list([= > x[i],i],i,makelist(i,i,length(x)))], > for i in xx do (if parse_string(concat(first(i),p)) th= > en temp:cons(i,temp)) ,temp:reverse(temp), > if(length(temp)>=3D2 and flatten(temp)#[]) then > (while(last(temp[s])+1=3Dlast(temp[s+1]) and count<=3Dl= > ength(temp)) do > (temp1:cons(temp[s],temp1),count:count+1,s:s+1), > if(s<length(temp)) then temp1:cons(temp[s],temp1)) else= > temp1:temp,reverse(temp1))$ > > Usage :: takewhile1([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],\<5); > > OUTPUT :: [[2,1],[1,2],[2,3],[3,4],[4,5]] > > The subtle difference is in terms of using `parse_string` to create lambda = > function instead of applying the lambda taken as parameter from function. > > `Problem` :I can do, > takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x^2+3*x>6)); > > OUTPUT :: [[2,1]] > > But i am not getting how I shall achieve it if I am using `takewhile1` as i= > t returns, > >concat: argument must be an atom; found ^2>5. > > I have put this question on http://stackoverflow.com<http://stackoverflow.c= > om/questions/22526472/maximacustomizedtakewhile>, in case someone wants t= > o answer there as well. Many newcomers to Maxima use a style necessitated by lowlevel languages (e.g. manually iterating through lists, creating lots of temporary variables, etc.). Maxima allows a more highlevel method of programming. Here is an example, similar to the function you want, but slightly simpler: (%i1) %take(l,p,r,n) := if l=[] then reverse(r) else %take(rest(l),p,if p(first(l)) then cons([n,first(l)],r) else r,n+1)$ (%i2) take(l,p) := %take(l,p,[],1)$ (%i3) take([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); (%o3) [[5,4],[6,5],[7,7],[8,4],[10,4],[11,5],[14,7],[15,8]] %take iterates down the list l and saves the indices and items in l that satisfy the predicate p into the list r. take is a public interface to %take. You can modify take/%take into a trio of cooperating functions to implement takewhile. Leo 
From: Richard Fateman <fateman@be...>  20140320 16:16:35

On 3/20/2014 8:37 AM, Thomas D. Dean wrote: > I think I have a problem, somewhere. GCL? > > Maxima version: "5.32.1" > Maxima build date: "20140302 18:35:41" > Host type: "x86_64unknownlinuxgnu" > Lisp implementation type: "GNU Common Lisp (GCL)" > Lisp implementation version: "GCL 2.6.10" > > kill(all); > declare(w1, real), declare(w2, real), declare(w3, real); > W:matrix( > [ 0, w3, w2, w1], > [w3, 0, w1, w2], > [ w2, w1, 0, w3], > [w1, w2, w3, 0]); > > expW:matrixexp(W); > eq:ratsubst(zzz, w3^2+w2^2+w1^2, expW); > limit(eq,zzz,0); > > and, 12 hours later no result. > > Core i73930k OC 4.2GHz, 16g RAM. > > When I did ^C, the process was using 1.3g RAM. > > Tom Dean > > If we assume that as zzz > 0, so does sqt(zzz), then perhaps you could just do ratsubst(yyy, sqrt(zzz),eq). then limit(%,yyy,0) returns the 4x4 identity matrix in a fraction of a second. 
From: Richard Fateman <fateman@be...>  20140320 15:54:23

One of us is missing something here. I installed maxima and wxmaxima on a Mac OS computer from http://sourceforge.net/projects/maxima/files/MaximaMacOS/ by clicking on 5.30.0MacOSX I then followed the instructions in "How to Install", to install . Now I found that the previous version of maxima and wxmaxima were already there, and so I did not really have to install some parts, but I followed the instructions and reinstalled some pieces. (I didn't reinstall X11, but I don't know that it is even needed). Anyway, it all installed and ran. Could I have previously installed fink and xcode and macports, and that's why it was so easy? Or, as I suspect, are all these things unnecessary? Perhaps I'm naive in this but WHY ARE PEOPLE TELLING YOU TO BUILD SBCL, MAXIMA etc when all you need to do is _download the maxima, wxmaxima, fonts, gnuplot all together in one binary (dmg file) _?? RJF On 3/19/2014 11:02 PM, Jan Hendrik Mueller wrote: > I tried to install it in the way Norman described it and had a lot of problems to get wxMaxima working together with a new gnuplot version. > What I want to say is: wxMaxima is becoming popular at schools. But I can't motivate/force/ask pupils to install it via xcode and macports (BTW: I found a lot of pages where teachers/parents/pupils are complaining about that in the net...) > Jan > >> Am 19.03.2014 um 22:04 schrieb Norman Beam <ephemeris@...>: >> >> You can build Maxima, xMaxima, and wxMaxima from scratch with no >> knowledge of programming using MacPorts. You must be willing to install >> the OSX development tools (X11 and Xcode) which I think are both free >> currently. >> >> Start here >> >> https://www.macports.org/guide/#introduction >> >> for what you must install. It is a lot to download but once you do, >> keeping Maxima uptodate is pretty easy. >> >> If you want to go this route, tell MacPorts to build wxMaxima and it >> will create everything you need, SBCL, GnuPlot, Maxima, xMaxima, >> wxMaxima, etc. >> >> Regards, >> >> Norman >> >> >> >>> On 3/19/14 4:23 PM, Robert Dodier wrote: >>>> On 20140319, Erich Neuwirth <erich.neuwirth@...> wrote: >>>> >>>> Is there any information if OSX and Windows binaries will be available for 5.32.1 in the near future? >>> I make the releases and source code bundle and binaries for Linux. >>> Unfortunately, I don't have a Windows or OSX development environment. >>> Binaries for those systems are contributed by others, and I don't >>> have a schedule for that. >>> >>> The good news is that for OSX, at least, I believe it is enough like a >>> conventional Un*xish system for Maxima's build machinery to work so >>> that you can build Maxima from source code. I don't know the details, >>> maybe someone can tell us. >>> >>> I have built Maxima from source code on Windows, and did get a working >>> executable, although maybe stuff around the edges (XMaxima / help / >>> plotting) might or might not have worked as expected. I can say more >>> about that if you're interested. >>> >>> Sorry I can't be more helpful, >>> >>> Robert Dodier >>> >>> >>> >>>  >>> Learn Graph Databases  Download FREE O'Reilly Book >>> "Graph Databases" is the definitive new guide to graph databases and their >>> applications. Written by three acclaimed leaders in the field, >>> this first edition is now available. Download your free book today! >>> http://p.sf.net/sfu/13534_NeoTech >>> _______________________________________________ >>> Maximadiscuss mailing list >>> Maximadiscuss@... >>> https://lists.sourceforge.net/lists/listinfo/maximadiscuss >> >>  >> Learn Graph Databases  Download FREE O'Reilly Book >> "Graph Databases" is the definitive new guide to graph databases and their >> applications. Written by three acclaimed leaders in the field, >> this first edition is now available. Download your free book today! >> http://p.sf.net/sfu/13534_NeoTech >> _______________________________________________ >> Maximadiscuss mailing list >> Maximadiscuss@... >> https://lists.sourceforge.net/lists/listinfo/maximadiscuss >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss 
From: Thomas D. Dean <tomdean@wa...>  20140320 15:37:05

I think I have a problem, somewhere. GCL? Maxima version: "5.32.1" Maxima build date: "20140302 18:35:41" Host type: "x86_64unknownlinuxgnu" Lisp implementation type: "GNU Common Lisp (GCL)" Lisp implementation version: "GCL 2.6.10" kill(all); declare(w1, real), declare(w2, real), declare(w3, real); W:matrix( [ 0, w3, w2, w1], [w3, 0, w1, w2], [ w2, w1, 0, w3], [w1, w2, w3, 0]); expW:matrixexp(W); eq:ratsubst(zzz, w3^2+w2^2+w1^2, expW); limit(eq,zzz,0); and, 12 hours later no result. Core i73930k OC 4.2GHz, 16g RAM. When I did ^C, the process was using 1.3g RAM. Tom Dean 
From: Barton Willis <willisb@un...>  20140320 13:09:18

Bug: (%i34) takewhile([9,81],lambda([x],x>3)); part: invalid index of list or matrix. To make something like takewhile1([2,1],\<5) work, I suggest using buildq to construct a lambda form. This might be more work than it's worthalso it might involve evaluation rules that are difficult to explain. Barton ________________________________ From: Pankaj Sejwal <pankajsejwal@...> Sent: Thursday, March 20, 2014 02:49 To: maximadiscuss@... Subject: [Maximadiscuss] customized takewhile I could not find any documentation for takewhile in Maxima.So, I tried writing my own which gives both elements and their position.It starts taking from anywhere in list as soon as the criteria is satisfied. I ended up with two functions with subtle difference, takewhile(x,p):=block([s:1,temp:[],temp1:[],count:1,xx:create_list([x[i],i],i,makelist(i,i,length(x)))], for i in xx do if apply(p,[first(i)]) then temp:cons(i,temp) ,temp:reverse(temp), if(length(temp)>=2 and flatten(temp)#[]) then (while(last(temp[s])+1=last(temp[s+1]) and count<=length(temp)) do (temp1:cons(temp[s],temp1),count:count+1,s:s+1), if(s<length(temp)) then temp1:cons(temp[s],temp1)) else temp1:temp,reverse(temp1))$ Usage :: takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); OUTPUT :: [[4,5],[5,6],[7,7],[4,8]] and second as, takewhile1(x,p):=block([s:1,temp:[],temp1:[],count:1,xx:create_list([x[i],i],i,makelist(i,i,length(x)))], for i in xx do (if parse_string(concat(first(i),p)) then temp:cons(i,temp)) ,temp:reverse(temp), if(length(temp)>=2 and flatten(temp)#[]) then (while(last(temp[s])+1=last(temp[s+1]) and count<=length(temp)) do (temp1:cons(temp[s],temp1),count:count+1,s:s+1), if(s<length(temp)) then temp1:cons(temp[s],temp1)) else temp1:temp,reverse(temp1))$ Usage :: takewhile1([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],\<5); OUTPUT :: [[2,1],[1,2],[2,3],[3,4],[4,5]] The subtle difference is in terms of using `parse_string` to create lambda function instead of applying the lambda taken as parameter from function. `Problem` :I can do, takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x^2+3*x>6)); OUTPUT :: [[2,1]] But i am not getting how I shall achieve it if I am using `takewhile1` as it returns, >concat: argument must be an atom; found ^2>5. I have put this question on http://stackoverflow.com<http://stackoverflow.com/questions/22526472/maximacustomizedtakewhile>;, in case someone wants to answer there as well. 
From: Dimiter Prodanov <dimiterpp@gm...>  20140320 11:15:49

From: Volker van Nek <volkervannek@gm...>  20140320 08:53:12

You can also try FINK. http://pdb.finkproject.org/pdb/browse.php?summary=maxima The packages by maintainer Alexander Hansen (I remember him posting to this list > list archive) are from 2014, so fully up to date. If you are willing to try the FINK packages please let us know how it turns out. In case of success perhaps someone can put a note 'How to install Maxima on Mac' to the download page. Volker van Nek Am 20.03.2014 07:02, schrieb Jan Hendrik Mueller: > I tried to install it in the way Norman described it and had a lot of problems to get wxMaxima working together with a new gnuplot version. > What I want to say is: wxMaxima is becoming popular at schools. But I can't motivate/force/ask pupils to install it via xcode and macports (BTW: I found a lot of pages where teachers/parents/pupils are complaining about that in the net...) > Jan > >> Am 19.03.2014 um 22:04 schrieb Norman Beam <ephemeris@...>: >> >> You can build Maxima, xMaxima, and wxMaxima from scratch with no >> knowledge of programming using MacPorts. You must be willing to install >> the OSX development tools (X11 and Xcode) which I think are both free >> currently. >> >> Start here >> >> https://www.macports.org/guide/#introduction >> >> for what you must install. It is a lot to download but once you do, >> keeping Maxima uptodate is pretty easy. >> >> If you want to go this route, tell MacPorts to build wxMaxima and it >> will create everything you need, SBCL, GnuPlot, Maxima, xMaxima, >> wxMaxima, etc. >> >> Regards, >> >> Norman >> >> >> >>> On 3/19/14 4:23 PM, Robert Dodier wrote: >>>> On 20140319, Erich Neuwirth <erich.neuwirth@...> wrote: >>>> >>>> Is there any information if OSX and Windows binaries will be available for 5.32.1 in the near future? >>> I make the releases and source code bundle and binaries for Linux. >>> Unfortunately, I don't have a Windows or OSX development environment. >>> Binaries for those systems are contributed by others, and I don't >>> have a schedule for that. >>> >>> The good news is that for OSX, at least, I believe it is enough like a >>> conventional Un*xish system for Maxima's build machinery to work so >>> that you can build Maxima from source code. I don't know the details, >>> maybe someone can tell us. >>> >>> I have built Maxima from source code on Windows, and did get a working >>> executable, although maybe stuff around the edges (XMaxima / help / >>> plotting) might or might not have worked as expected. I can say more >>> about that if you're interested. >>> >>> Sorry I can't be more helpful, >>> >>> Robert Dodier >>> >>> >>> >>>  >>> Learn Graph Databases  Download FREE O'Reilly Book >>> "Graph Databases" is the definitive new guide to graph databases and their >>> applications. Written by three acclaimed leaders in the field, >>> this first edition is now available. Download your free book today! >>> http://p.sf.net/sfu/13534_NeoTech >>> _______________________________________________ >>> Maximadiscuss mailing list >>> Maximadiscuss@... >>> https://lists.sourceforge.net/lists/listinfo/maximadiscuss >> >> >>  >> Learn Graph Databases  Download FREE O'Reilly Book >> "Graph Databases" is the definitive new guide to graph databases and their >> applications. Written by three acclaimed leaders in the field, >> this first edition is now available. Download your free book today! >> http://p.sf.net/sfu/13534_NeoTech >> _______________________________________________ >> Maximadiscuss mailing list >> Maximadiscuss@... >> https://lists.sourceforge.net/lists/listinfo/maximadiscuss > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss > 
From: Pankaj Sejwal <pankajsejwal@gm...>  20140320 07:50:12

I could not find any documentation for takewhile in Maxima.So, I tried writing my own which gives both elements and their position.It starts taking from anywhere in list as soon as the criteria is satisfied. I ended up with two functions with subtle difference, takewhile(x,p):=block([s:1,temp:[],temp1:[],count:1,xx:create_list([x[i],i],i,makelist(i,i,length(x)))], for i in xx do if apply(p,[first(i)]) then temp:cons(i,temp) ,temp:reverse(temp), if(length(temp)>=2 and flatten(temp)#[]) then (while(last(temp[s])+1=last(temp[s+1]) and count<=length(temp)) do (temp1:cons(temp[s],temp1),count:count+1,s:s+1), if(s<length(temp)) then temp1:cons(temp[s],temp1)) else temp1:temp,reverse(temp1))$ Usage :: takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x>3)); OUTPUT :: [[4,5],[5,6],[7,7],[4,8]] and second as, takewhile1(x,p):=block([s:1,temp:[],temp1:[],count:1,xx:create_list([x[i],i],i,makelist(i,i,length(x)))], for i in xx do (if parse_string(concat(first(i),p)) then temp:cons(i,temp)) ,temp:reverse(temp), if(length(temp)>=2 and flatten(temp)#[]) then (while(last(temp[s])+1=last(temp[s+1]) and count<=length(temp)) do (temp1:cons(temp[s],temp1),count:count+1,s:s+1), if(s<length(temp)) then temp1:cons(temp[s],temp1)) else temp1:temp,reverse(temp1))$ Usage :: takewhile1([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],\<5); OUTPUT :: [[2,1],[1,2],[2,3],[3,4],[4,5]] The subtle difference is in terms of using `parse_string` to create lambda function instead of applying the lambda taken as parameter from function. `Problem` :I can do, takewhile([2,1,2,3,4,5,7,4,1,4,5,2,1,7,8],lambda([x],x^2+3*x>6)); OUTPUT :: [[2,1]] But i am not getting how I shall achieve it if I am using `takewhile1` as it returns, >concat: argument must be an atom; found ^2>5. I have put this question on http://stackoverflow.com<http://stackoverflow.com/questions/22526472/maximacustomizedtakewhile>;, in case someone wants to answer there as well. 
From: Jan Hendrik Mueller <jan.mueller@ma...>  20140320 06:02:41

I tried to install it in the way Norman described it and had a lot of problems to get wxMaxima working together with a new gnuplot version. What I want to say is: wxMaxima is becoming popular at schools. But I can't motivate/force/ask pupils to install it via xcode and macports (BTW: I found a lot of pages where teachers/parents/pupils are complaining about that in the net...) Jan > Am 19.03.2014 um 22:04 schrieb Norman Beam <ephemeris@...>: > > You can build Maxima, xMaxima, and wxMaxima from scratch with no > knowledge of programming using MacPorts. You must be willing to install > the OSX development tools (X11 and Xcode) which I think are both free > currently. > > Start here > > https://www.macports.org/guide/#introduction > > for what you must install. It is a lot to download but once you do, > keeping Maxima uptodate is pretty easy. > > If you want to go this route, tell MacPorts to build wxMaxima and it > will create everything you need, SBCL, GnuPlot, Maxima, xMaxima, > wxMaxima, etc. > > Regards, > > Norman > > > >> On 3/19/14 4:23 PM, Robert Dodier wrote: >>> On 20140319, Erich Neuwirth <erich.neuwirth@...> wrote: >>> >>> Is there any information if OSX and Windows binaries will be available for 5.32.1 in the near future? >> I make the releases and source code bundle and binaries for Linux. >> Unfortunately, I don't have a Windows or OSX development environment. >> Binaries for those systems are contributed by others, and I don't >> have a schedule for that. >> >> The good news is that for OSX, at least, I believe it is enough like a >> conventional Un*xish system for Maxima's build machinery to work so >> that you can build Maxima from source code. I don't know the details, >> maybe someone can tell us. >> >> I have built Maxima from source code on Windows, and did get a working >> executable, although maybe stuff around the edges (XMaxima / help / >> plotting) might or might not have worked as expected. I can say more >> about that if you're interested. >> >> Sorry I can't be more helpful, >> >> Robert Dodier >> >> >> >>  >> Learn Graph Databases  Download FREE O'Reilly Book >> "Graph Databases" is the definitive new guide to graph databases and their >> applications. Written by three acclaimed leaders in the field, >> this first edition is now available. Download your free book today! >> http://p.sf.net/sfu/13534_NeoTech >> _______________________________________________ >> Maximadiscuss mailing list >> Maximadiscuss@... >> https://lists.sourceforge.net/lists/listinfo/maximadiscuss > > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss 