If you are using jhs the package manager is what an old name for what is now at link -> jal
Once you are there, you would select a category (Upgradeable, Removable, Installed, Not Installed, or even Descriptions -- though descriptions does not tell you the installed status of packages and does not let you install or upgrade them). So, anyways, you would search through the categories -- if it's Not Installed, you would find the graphics/bmp checkbox and install it. If it's Upgradeable, you might want to find the graphics/bmp checkbox and upgrade it. If it's in neither of those categories it's going to be in Installed and you should not have to do anything. Note also that if you are using jhs and you have not been using jal there is probably a new version of jhs to install (and you can use jal to do that). FYI, -- Raul On Tue, Nov 8, 2011 at 9:41 AM, David Vaughan <[email protected]> wrote: > How do I actually update my addons, and what is the package manager? > > On 8 Nov 2011, at 14:18, Raul Miller wrote: > >> If you are using j7 and, I think that require'viewmat' will also >> require 'graphics/bmp' >> >> That said, if you do not have it installed, you can install the >> graphics/bmp package using the package manager. >> >> FYI, >> >> -- >> Raul >> >> >> On Tue, Nov 8, 2011 at 7:21 AM, David Vaughan >> <[email protected]> wrote: >>> load'bmp' >>> not found: /Applications/j64-701/addons/graphics/bmp/bmp.ijs >>> |file name error: script >>> | 0!:0-.&(128}.a.) 1!:1 y[4!:55<'y' >>> >>> Where can I get the script? >>> >>> On 8 Nov 2011, at 11:17, Björn Helgason wrote: >>> >>>> load'bmp' >>>> writebmp >>>> >>>> >>>> 2011/11/8 David Vaughan <[email protected]> >>>> >>>>> Is there something that creates bitmaps? So say I wanted to make a bitmap >>>>> of the Mandelbrot set (and I had a 2d array representing each pixel) is >>>>> there a verb that will make that into a bitmap? >>>>> >>>>> ___________________________ >>>>> >>>>> David Vaughan >>>>> >>>>> On 7 Nov 2011, at 19:25, Raul Miller <[email protected]> wrote: >>>>> >>>>>> Sometimes your description seems accurate. >>>>>> >>>>>> However, consider: >>>>>> viewmat i.10 >>>>>> or >>>>>> viewmat 2 >>>>>> >>>>>> -- >>>>>> Raul >>>>>> >>>>>> On Mon, Nov 7, 2011 at 1:36 PM, David Vaughan >>>>>> <[email protected]> wrote: >>>>>>> Am I right in thinking that viewmat takes a 2d array and treats it as >>>>> if each number is a pixel and its value is its colour? >>>>>>> Thanks. >>>>>>> >>>>>>> ___________________________ >>>>>>> >>>>>>> David Vaughan >>>>>>> >>>>>>> On 6 Nov 2011, at 20:12, "Linda Alvord" <[email protected]> >>>>> wrote: >>>>>>> >>>>>>>> Here's another option: >>>>>>>> >>>>>>>> S=: 13 :'''+.''{~([:+./*.)"1/~#:i.y' >>>>>>>> S >>>>>>>> '+.' {~ [: ([: +./ *.)"1/~ [: #: i. >>>>>>>> >>>>>>>> S 8 >>>>>>>> ++++++++ >>>>>>>> +.+.+.+. >>>>>>>> ++..++.. >>>>>>>> +...+... >>>>>>>> ++++.... >>>>>>>> +.+..... >>>>>>>> ++...... >>>>>>>> +....... >>>>>>>> >>>>>>>> Linda >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> -----Original Message----- >>>>>>>> From: [email protected] >>>>>>>> [mailto:[email protected]] On Behalf Of Roger Hui >>>>>>>> Sent: Saturday, November 05, 2011 2:10 PM >>>>>>>> To: Programming forum >>>>>>>> Subject: Re: [Jprogramming] Binary Addresses Method >>>>>>>> >>>>>>>> I believe the "and" in your pseudocode maps to 17 b. (bitwise and). >>>>> Thus: >>>>>>>> 0 = 17 b./~ i.256 >>>>>>>> >>>>>>>> For example, using the boolean matrix result to index into '.*', >>>>>>>> >>>>>>>> '.*' {~ 0 = 17 b./~ i.16 >>>>>>>> **************** >>>>>>>> *.*.*.*.*.*.*.*. >>>>>>>> **..**..**..**.. >>>>>>>> *...*...*...*... >>>>>>>> ****....****.... >>>>>>>> *.*.....*.*..... >>>>>>>> **......**...... >>>>>>>> *.......*....... >>>>>>>> ********........ >>>>>>>> *.*.*.*......... >>>>>>>> **..**.......... >>>>>>>> *...*........... >>>>>>>> ****............ >>>>>>>> *.*............. >>>>>>>> **.............. >>>>>>>> *............... >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> On Sat, Nov 5, 2011 at 10:50 AM, mikel paternain >>>>>>>> <[email protected]>wrote: >>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> In the amazing book Chaos and Fractals New frontiers of Science, the >>>>>>>>> authors described a simple algorithm for making the Sierpinski Gasket. >>>>>>>> This >>>>>>>>> is perhaps the most short and efficient algorithm (in non tacit >>>>>>>> programming >>>>>>>>> languages) for computing this fractal. >>>>>>>>> The basic algorithm is(in pseudocode): >>>>>>>>> >>>>>>>>> Define x,y >>>>>>>>> For y=0 to 255 >>>>>>>>> For x=0 to 255 >>>>>>>>> If /x And y)=0 Then Pset(x,y) //Pset is a function for >>>>> drawing >>>>>>>>> the point x,y >>>>>>>>> Next x >>>>>>>>> Next y >>>>>>>>> End >>>>>>>>> >>>>>>>>> With my little experience inJ the question is how translate this code >>>>> to J >>>>>>>>> . Help me please! >>>>>>>>> Thanks in advance!! >>>>>>>>> >>>>>>>>> Mikel >>>>>>>>> ---------------------------------------------------------------------- >>>>>>>>> For information about J forums see >>>>> http://www.jsoftware.com/forums.htm >>>>>>>>> >>>>>>>> ---------------------------------------------------------------------- >>>>>>>> For information about J forums see http://www.jsoftware.com/forums.htm >>>>>>>> >>>>>>>> ---------------------------------------------------------------------- >>>>>>>> For information about J forums see http://www.jsoftware.com/forums.htm >>>>>>> ---------------------------------------------------------------------- >>>>>>> For information about J forums see http://www.jsoftware.com/forums.htm >>>>>>> >>>>>> ---------------------------------------------------------------------- >>>>>> For information about J forums see http://www.jsoftware.com/forums.htm >>>>> ---------------------------------------------------------------------- >>>>> For information about J forums see http://www.jsoftware.com/forums.htm >>>>> >>>> >>>> >>>> >>>> -- >>>> Björn Helgason, Verkfræðingur >>>> Fornustekkum II >>>> 781 Hornafirði, >>>> t-póst: [email protected] >>>> gsm: +3546985532 >>>> twitter: @flugfiskur >>>> http://groups.google.com/group/J-Programming >>>> >>>> >>>> Tæknikunnátta höndlar hið flókna, sköpunargáfa er meistari einfaldleikans >>>> >>>> góður kennari getur stigið á tær án þess að glansinn fari af skónum >>>> /|_ .-----------------------------------. >>>> ,' .\ / | Með léttri lund verður | >>>> ,--' _,' | Dagurinn í dag | >>>> / / | Enn betri en gærdagurinn | >>>> ( -. | `-----------------------------------' >>>> | ) | (\_ _/) >>>> (`-. '--.) (='.'=) ♖♘♗♕♔♙ >>>> `. )----' (")_(") ☃☠ >>>> ---------------------------------------------------------------------- >>>> For information about J forums see http://www.jsoftware.com/forums.htm >>> >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
