Squeak-dev February 2008

squeak-dev@lists.squeakfoundation.org

159 participants
219 discussions

Replacing a StandardToolSet
by Igor Stasenko 06 Feb '08

06 Feb '08

Hello again, i'm stuck with a code to handle errors in squeak image. I want to replace the default behavior, when unhandled error occurs is to same as user pressing 'Abort' button. This is a code snippet, how i doing this: ---- HydraDebugToolSet>>debugError: anError recursed == true ifTrue: [ ^ Processor terminateActive ]. recursed := true. Transcript show: 'Error in interpreter (', HydraVM myInterpreterInstance asString , ')', String cr, anError description, String cr, anError signalerContext shortStack. Smalltalk logError: anError description inContext: anError signalerContext to: 'HydraDebug.log'. recursed := false. Processor terminateActive. ^ nil ---------- The problem in doing Processor terminateActive - i'm not sure if this works exactly as abandoning process. And i'm stuck, because if i don't put Processor terminateActive, then it starts an infinite loop barfing on sending unknown message to nil (i suspect that it's because i returning nil at exit). But if i leave process termination , then interpreter exits very early blaming me, that there is no scheduled processes left. Does it means, that all processes in image stepped on error and i killed them, or it just means, that there is no processes which can be scheduled at current point of time (some can wait on semaphore for external event occur). Can anyone, please, advice, how to make this stinky code to work without causing troubles? -- Best regards, Igor Stasenko AKA sig.

2 2

[help] How can I get from an array of byte sized integers to a bitmap.
by Jerome Peace 06 Feb '08

06 Feb '08

[help] How can I get from an array of byte sized integers to a bitmap. Hi Yoshiki, *** >Yoshiki Ohshima yoshiki at vpri.org >Tue Jan 29 22:20:23 UTC 2008 > > >> I have an array of integers (all less than 255 ). >> I have a color form and a pallette for 255 colors. >> I have the number of columns and rows that the array >> represents. >> I want to create a bitmap to map the array onto its >> pallette. I'm not quite sure what the intervening >> steps are. > > This description is very vague, I have to say. Ah, and here I was thinking I was being precise without going into unnecessary detail. :-/ > > - Is the array of integers actually an Array object? >Yes > - The "palette" is Bitmap, yes? The pallette is an array of colors which one can give to the color form. The colorform will generate the bitmap for the colors. What I wished to do was set the bitmap for the pixels that indexed the colors. > - What are the number of columns and rows? What are inside? The columns and rows are settable by the user. Once set they are knowable. As for the inside on one end it is data about time and on the other just a colorful way of displaying the contrast amoung the data. The form is used to dramatize the results. > >> Has anyone solved this problem before? > > For example, in the OLPC image, >SugarLibrary>>imageFor:color:grayOutColor: has some obscure logic to >recolor a form. This may be different but I have a hunch that this >may be somewhat similar. Especially #hackBits: will be your weapon. >(Also, see Bitmap>>asByteArray, etc.) > >> The application I have will essentially update the >> array over time and I wish to display it visually. I >> would like to do it in a time efficient way rather >> than pixel by pixel. >> >> I've looked at the options in the image and I am not >> sure which ones are right. >> >> Ideally once the color form is set up I should be able >> to update it just by updating the bitmap from the >> array periodically. > > BitBlt can do a lot of stuff. I'm almost sure that you can find the >right operations on right data array type. I eventually realized I did not have to set the bits all once and what worked was building a pixel poker to my form. By holding on to the poker I can update the form fast enough. The appllication is scanning the display for slow spots and will generate one datum per several cycles. I collect the data as integers into an array and it was ok to store a pixel each time the data came in. This was simple and it worked (after I found a bug or two in my typing.) And this lets BitBlt continue to hide the difficulties with endianness and so forth. Still a fast way to go from array to bitmap would be useful. Its not to hard to insist the columns be a multiple of 4 so the data keeps word boundrys intact. preliminary samples at: http://bugs.squeak.org/view.php?id=6876 0006876: Why is my UI slow? Yours in curiosity and service, --Jerome Peace *** ____________________________________________________________________________________ Never miss a thing. Make Yahoo your home page. http://www.yahoo.com/r/hs

4 6

Smalltalk Developer needed (Full-time position - $130K)
by Tom .... 06 Feb '08

06 Feb '08

All, Salary: Depends on Experience ($100,000 - $130,000 per year) Bonus: 20% of first year salary Restricted Stock Option: 100% vested after first 3 years 401(k): 100% matching of the first 5% (100% vested after 5 years) Relocation Assistance: Up to $10,000 Location: Southeastern part of the U.S. My company is currently conducting a confidential search for a Smalltalk Developer (Visual Works is a plus). Our company is a proven leader in our industry and our technology team has received numerous awards over the past 5 years as "The leader" in technology in our industry. With excellent benefits, nice work environment (free lunch every Wednesday), and a consistent 20% Annual Bonus every year, it is a job worth checking out. Contact me at my hotmail account for more details. acoustictom2(a)hotmail.com Start Date: February 25, 2008 (Flexible on this date) _________________________________________________________________ Helping your favorite cause is as easy as instant messaging. You IM, we give. http://im.live.com/Messenger/IM/Home/?source=text_hotmail_join

2 1

Method invocation in Slang
by Robert Krahn 06 Feb '08

06 Feb '08

Hello! Is there a way to invoke a "normal" method from an arbitrary object in Slang? If I have an oop: oop := interpreterProxy instantiateClass: MyClass indexableSize: 0. Now I would like to send message #m1 to the object behind oop. Can the InterpreterProxy do that? Robert

2 1

Re: Squeak on Nokia 800
by Derek O'Connell 06 Feb '08

06 Feb '08

> Is there any interest in this list in Nokia 800/810? Is Derek O'Connell still > working on the port? Yes but because my N810 came after xmas I don't have much time at the moment. I am also still getting familiar with vm/maemo code so going is slow. Check my swiki entry later today and I will log what I have done so far and link archives for bora and chinook builds. Short version: compiles ok (no surprise), ALSA sound not working, ESD abandoned (recording not supported), looking into gstreamer for sound (and more). OSS (dev/dsp) not supported I think in OS2008. At least I have Squeak in a gtk window with taskbar icon so it coexists nicely with other apps/windows. DOC

1 0

How can I get from an array of byte sized integers to a bitmap.
by Jerome Peace 06 Feb '08

06 Feb '08

[help] How can I get from an array of byte sized integers to a bitmap. Hi Yoshiki, Here is a some what delayed reply to your older post on this thread. Cheers -Jer *** > > >Yoshiki Ohshima yoshiki at vpri.org >Thu Jan 31 10:59:27 UTC 2008 > > Hi Jerome, > > Oh, that picture looks interesting. If the values you're getting is >valid, that is a fun tool. > >> > This description is very vague, I have to say. >> >> Ah, and here I was thinking I was being precise >> without going into unnecessary detail. :-/ > > Now, why don't you have to post the code there? ^^; Lol, the picture was from the first application that worked. I intend to put the code up after a few more iterations of development. I conceived of the idea in the middle of a letter to Matthew Fulmer. http://lists.squeakfoundation.org/pipermail/squeak-dev/2008-January/124461.… Code needs cleaning and sorting. >> > - What are the number of columns and rows? What >> are inside? >> The columns and rows are settable by the user. Once >> set they are knowable. >> As for the inside on one end it is data about time and >> on the other just a colorful way of displaying the >> contrast amoung the data. > > These values are somehow [0..255], right? If you use Bitmap or >ByteArray instead of Array, that would be easier. Raw data may exceed that but a power compression using #highBitOfMagnitude will get any time period of interest into a byte. Contrast is achieved by subtracting out the minimun raw value and scaling between the min and max power values. >> >> The application I have will essentially update the >> >> array over time and I wish to display it visually. >> I >> >> would like to do it in a time efficient way rather >> >> than pixel by pixel. >> >> >> >> I've looked at the options in the image and I am >> not >> >> sure which ones are right. >> >> >> >> Ideally once the color form is set up I should be >> able >> >> to update it just by updating the bitmap from the >> >> array periodically. > > As I understand, the values in an Array (now it would be in a Bitmap >or a ByteArray) change over time, and you want to map the values to >colors. Isn't the mapping static? I.e., it doesn't change over time >so that the same value in data is always mapped to the same color? So far yes. I don't need to change the color mapping. Of course any particular color scheme is choosable. To the taste of the user. It is independent of the data. >So, I could build a color map (a Bitmap object) once, store it >somewhere like in a class variable and use it? The pallette is no problem just generate 256 colors and give them to a color form. > >> I eventually realized I did not have to set the bits >> all once and what worked was building a pixel poker to >> my form. > > Hmm. In this approach, is it possible to bypass the step of storing >data into the Array and read from it? I.e., just (effectively) write >into the bits of the ColorForm by using the pixel poker? That's essentially what I decided to do with the power compressed data. Though I do it one pass behind to keep the min and max value data valid. This is the part of the design that is influx right now as I learn what works and reprogram to suit. Gossamer Condor style. note from a little programming later: I have now found it easier to just process each pass of data as it comes of the scanner. I am also experimenting with different compression and scaling schemes to see which one highlights the differences of interest best. > >> By holding on to the poker I can update the form fast >> enough. The appllication is scanning the display for >> slow spots and will generate one datum per several >> cycles. >> I collect the data as integers into an array and it >> was ok to store a pixel each time the data came in. >> >> This was simple and it worked (after I found a bug or >> two in my typing.) And this lets BitBlt continue to >> hide the difficulties with endianness and so forth. >> >> Still a fast way to go from array to bitmap would be >> useful. >> Its not to hard to insist the columns be a multiple of >> 4 so the data keeps word boundrys intact. > > I don't know how you scan and acquire data, but I'd imagine that you >get a value for a rectangle that is the bounding box of a morph. If >so, you can "fill" the bitmap with an expression like: > >aForm fill: (30 at 30 corner: 50 at 50) fillColor: (Bitmap with: 128). > >(i.e., a Bitmap of length 1 can be used in place of a Color.) > > By the way, using ColorForm with translucency fails when the >destination (or Display) is 16-bit depth. In that case we could use a solid color pallete, color code the data and display it over the test area with an alpha blend. (And, I found out that >there are particular combinations of depth and translucency and kind >of morph you use that don't work either in Etoys image or 3.9. Hmm.) Karl worked out some solutions for some of the color translucency problems. There are some mantis reports detailing it. I think you are right about 16 bit colors. I remember seeing a lot of strange results when working on some of the bugs. I've put those problems on my awaiting enlightenment list. Enlightenment often comes while working on other problems. What I am building is a probe to show where to speed optimize. And to test that speed optimization actually works. What I feared was that invalidating some parts of the screen would cascade to larger areas causing slowdowns. The picture shows this seems to be true when the invalid point overlaps the system window label. So probably caching the label bits will save a lot of grief. It also points to looking for speed optimizations in true font character display and maybe character display in general. > > Given that, it is safe to go with a 32-bit form: > > t := Form extent: 128 at 128 depth: 32. > 0 to: 127 do: [:y | > 0 to: 127 do: [:x | > t pixelValueAt: (x at y) put: (x bitShift: 24)]]. >"Gradient Fill with some trick can do above better, but to illustrate the >idea..." pallette := (0 to: 255 ) collect: [ :each | Color black alpha: (each asFloat / 255 asFloat) . pallette := pallette reversed . ColorForm extent: (cols at rows) depth: 8 ; colors: pallette . >And, > > (SketchMorph new form: t) openInWorld. > "which doesn't work in the 3.9 image in 16-bit Display depth." > >or better write the following in your morph's #drawOn: method: > > t displayOn: Display at: 100 at 100 rule: 34. > "this works in 16-bit display or 32-bit display (and 8-bit^^;)" > cool > Well, I learned a lot about the differences between 3.9 and Etoys >image in this exercise. > > To do the #bitShift: above efficiently for a rectangle of data, you >could do the trick with #hackBit and WarpBlt together (like the way in >SugarLibrary). But this would be another round... > I don't think I will need this. I just put the form into a BitmapFillStyle and let the existing drawing tools do the work. I have augmented the Oriented fill tools a bit and relyed on some of those metods here. I can stick the fill in a rectangle morph or a polygon morph and display it from there. >-- Yoshiki *** ____________________________________________________________________________________ Looking for last minute shopping deals? Find them fast with Yahoo! Search. http://tools.search.yahoo.com/newsearch/category.php?category=shopping

2 1

(no subject)
by Tom .... 06 Feb '08

06 Feb '08

My company is currently conducting a confidential search for a Smalltalk Developer. Our company is a proven leader in our industry and our technology team has received numerous awards over the past 5 years as "The leader" in technology in our industry. With excellent benefits, nice work environment (free lunch every Wednesday), and a consistant 20% Annual Bonus every year, it is a job worth checking out. The position is located in the Southeastern part of the United States. Salary: Depends on Experience ($100,000 - $130,000 per year) Bonus: 20% of first year salary Restricted Stock Option: 100% vested after first 3 years 401(k): 100% matching of the first 5% Contact me at my hotmail account for more details. acoustictom2(a)hotmail.com Start Date: February 25, 2008 (Flexible on this date) _________________________________________________________________ Shed those extra pounds with MSN and The Biggest Loser! http://biggestloser.msn.com/

1 0

Non-interactive package installation
by Igor Stasenko 06 Feb '08

06 Feb '08

Can someone, please enlighten me, is there any tools/packages for making a subject possible? I need something, which is fully automatic and don't makes any calls to morphic (such as MC showing progress bar during install). What options are available? -- Best regards, Igor Stasenko AKA sig.

4 6

Problem with OrderedCollection
by Miguel Enrique Cobá Martínez 06 Feb '08

06 Feb '08

Maybe is a stupid question, but my tests are failing because this. This is the code. Paste it in a Workspace: | t | "Printing or inspecting this gives OrderedCollection" t := OrderedCollection new. t add: ('text', 1 printString). t class. "But printing or inspecting this gives a ByteArray" t := OrderedCollection new add: ('text', 1 printString). t class. Can someone explain what it is happening? Thanks, Miguel Cobá

2 2

Re: Complexity and starting over on the JVM (was Re: Traits or not...)
by Michael Haupt 05 Feb '08

05 Feb '08

Hi Dan, On Feb 5, 2008 7:37 PM, Dan Ingalls <Dan(a)squeakland.org> wrote: > I'm actually nearly done with this process. I'm in a ridiculous discussion about the name. I had proposed JSqueak and got "push-back", as they say, from the trademark folks. It appears that, if I'm willing to call it 'Idaho' or 'Potato' or something, then we're good to go. It's clear Sun is happy to let it go and I am too. that is extremely good news, thanks for sharing it! :-) > Actually, it was neither: I felt I needed to learn Java and the Java tools, so I picked the most fun thing I could think of to do. I tried to make it really small and yet reasonably performant. The simplicity should make it relatively easy to morph into something that integrates more closely with Java objects but that was not my focus. It was more important to me to retain enumeration and mutation than to hook up to Java. Some students of ours have been working on devising a kind of JIT compiler (generating actual Java methods from Squeak CompiledMethod instances, and calling the generated methods instead of interpreting Squeak bytecodes) last summer semester. There was trouble with the Squeak/Java interface, and also with the fact that debugging the image from the outside is not the easiest thing to do... anyway, they made quite a step, and I'm definitely intending to pursue this further. Best, Michael

1 0

Jump to page: