Packages October 2010

packages@lists.squeakfoundation.org

2 participants
204 discussions

The Trunk: Sound-dtl.25.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

David T. Lewis uploaded a new version of Sound to project The Trunk: http://source.squeak.org/trunk/Sound-dtl.25.mcz ==================== Summary ==================== Name: Sound-dtl.25 Author: dtl Time: 24 October 2010, 1:01:43.002 pm UUID: 5c164c71-a94e-452d-a78a-96e936f3a920 Ancestors: Sound-nice.24 Use pragma declarations in methods that are translated to C in MiscPrimitivePlugin. Supports removal of Object>>inline: and Object>>var:declareC: from trunk. =============== Diff against Sound-nice.24 =============== Item was changed: ----- Method: SampledSound class>>convert8bitSignedFrom:to16Bit: (in category 'utilities') ----- convert8bitSignedFrom: aByteArray to16Bit: aSoundBuffer "Copy the contents of the given array of signed 8-bit samples into the given array of 16-bit signed samples." | n s | <primitive: 'primitiveConvert8BitSigned' module: 'MiscPrimitivePlugin'> + <var: #aByteArray declareC: 'unsigned char *aByteArray'> + <var: #aSoundBuffer declareC: 'unsigned short *aSoundBuffer'> - self var: #aByteArray declareC: 'unsigned char *aByteArray'. - self var: #aSoundBuffer declareC: 'unsigned short *aSoundBuffer'. n := aByteArray size. 1 to: n do: [:i | s := aByteArray at: i. s > 127 ifTrue: [aSoundBuffer at: i put: ((s - 256) bitShift: 8)] ifFalse: [aSoundBuffer at: i put: (s bitShift: 8)]]. !

1 0

The Trunk: Sound-dtl.25.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

1 0

The Trunk: Sound-dtl.25.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

1 0

The Trunk: Collections-dtl.395.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

David T. Lewis uploaded a new version of Collections to project The Trunk: http://source.squeak.org/trunk/Collections-dtl.395.mcz ==================== Summary ==================== Name: Collections-dtl.395 Author: dtl Time: 24 October 2010, 1:00:08.124 pm UUID: 89a62a10-7b7b-4963-b90b-83adb9a0c2f1 Ancestors: Collections-eem.394 Use pragma declarations in methods that are translated to C in MiscPrimitivePlugin. Supports removal of Object>>inline: and Object>>var:declareC: from trunk. =============== Diff against Collections-eem.394 =============== Item was changed: ----- Method: ByteArray class>>hashBytes:startingWith: (in category 'byte based hash') ----- hashBytes: aByteArray startingWith: speciesHash "Answer the hash of a byte-indexed collection, using speciesHash as the initial value. See SmallInteger>>hashMultiply. The primitive should be renamed at a suitable point in the future" | byteArraySize hash low | <primitive: 'primitiveStringHash' module: 'MiscPrimitivePlugin'> + <var: #aHash declareC: 'int speciesHash'> + <var: #aByteArray declareC: 'unsigned char *aByteArray'> - self var: #aHash declareC: 'int speciesHash'. - self var: #aByteArray declareC: 'unsigned char *aByteArray'. - byteArraySize := aByteArray size. hash := speciesHash bitAnd: 16rFFFFFFF. 1 to: byteArraySize do: [:pos | hash := hash + (aByteArray basicAt: pos). "Begin hashMultiply" low := hash bitAnd: 16383. hash := (16r260D * low + ((16r260D * (hash bitShift: -14) + (16r0065 * low) bitAnd: 16383) * 16384)) bitAnd: 16r0FFFFFFF. ]. ^ hash! Item was changed: ----- Method: ByteString class>>compare:with:collated: (in category 'primitives') ----- compare: string1 with: string2 collated: order "Return 1, 2 or 3, if string1 is <, =, or > string2, with the collating order of characters given by the order array." | len1 len2 c1 c2 | <primitive: 'primitiveCompareString' module: 'MiscPrimitivePlugin'> + <var: #string1 declareC: 'unsigned char *string1'> + <var: #string2 declareC: 'unsigned char *string2'> + <var: #order declareC: 'unsigned char *order'> - self var: #string1 declareC: 'unsigned char *string1'. - self var: #string2 declareC: 'unsigned char *string2'. - self var: #order declareC: 'unsigned char *order'. len1 := string1 size. len2 := string2 size. 1 to: (len1 min: len2) do: [:i | c1 := order at: (string1 basicAt: i) + 1. c2 := order at: (string2 basicAt: i) + 1. c1 = c2 ifFalse: [c1 < c2 ifTrue: [^ 1] ifFalse: [^ 3]]]. len1 = len2 ifTrue: [^ 2]. len1 < len2 ifTrue: [^ 1] ifFalse: [^ 3]. ! Item was changed: ----- Method: ByteString class>>findFirstInString:inSet:startingAt: (in category 'primitives') ----- findFirstInString: aString inSet: inclusionMap startingAt: start | i stringSize | <primitive: 'primitiveFindFirstInString' module: 'MiscPrimitivePlugin'> + <var: #aString declareC: 'unsigned char *aString'> + <var: #inclusionMap declareC: 'char *inclusionMap'> - self var: #aString declareC: 'unsigned char *aString'. - self var: #inclusionMap declareC: 'char *inclusionMap'. inclusionMap size ~= 256 ifTrue: [ ^0 ]. i := start. stringSize := aString size. [ i <= stringSize and: [ (inclusionMap at: (aString at: i) asciiValue+1) = 0 ] ] whileTrue: [ i := i + 1 ]. i > stringSize ifTrue: [ ^0 ]. ^i! Item was changed: ----- Method: ByteString class>>indexOfAscii:inString:startingAt: (in category 'primitives') ----- indexOfAscii: anInteger inString: aString startingAt: start | stringSize | <primitive: 'primitiveIndexOfAsciiInString' module: 'MiscPrimitivePlugin'> + <var: #aCharacter declareC: 'int anInteger'> + <var: #aString declareC: 'unsigned char *aString'> - self var: #aCharacter declareC: 'int anInteger'. - self var: #aString declareC: 'unsigned char *aString'. - stringSize := aString size. start to: stringSize do: [:pos | (aString at: pos) asciiValue = anInteger ifTrue: [^ pos]]. ^ 0 ! Item was changed: ----- Method: ByteString class>>translate:from:to:table: (in category 'primitives') ----- translate: aString from: start to: stop table: table "translate the characters in the string by the given table, in place" <primitive: 'primitiveTranslateStringWithTable' module: 'MiscPrimitivePlugin'> + <var: #table declareC: 'unsigned char *table'> + <var: #aString declareC: 'unsigned char *aString'> - self var: #table declareC: 'unsigned char *table'. - self var: #aString declareC: 'unsigned char *aString'. start to: stop do: [ :i | aString at: i put: (table at: (aString at: i) asciiValue+1) ]! Item was changed: ----- Method: ByteString>>findSubstring:in:startingAt:matchTable: (in category 'comparing') ----- findSubstring: key in: body startingAt: start matchTable: matchTable "Answer the index in the string body at which the substring key first occurs, at or beyond start. The match is determined using matchTable, which can be used to effect, eg, case-insensitive matches. If no match is found, zero will be returned. The algorithm below is not optimum -- it is intended to be translated to C which will go so fast that it wont matter." | index | <primitive: 'primitiveFindSubstring' module: 'MiscPrimitivePlugin'> + <var: #key declareC: 'unsigned char *key'> + <var: #body declareC: 'unsigned char *body'> + <var: #matchTable declareC: 'unsigned char *matchTable'> - self var: #key declareC: 'unsigned char *key'. - self var: #body declareC: 'unsigned char *body'. - self var: #matchTable declareC: 'unsigned char *matchTable'. key size = 0 ifTrue: [^ 0]. start to: body size - key size + 1 do: [:startIndex | index := 1. [(matchTable at: (body at: startIndex+index-1) asciiValue + 1) = (matchTable at: (key at: index) asciiValue + 1)] whileTrue: [index = key size ifTrue: [^ startIndex]. index := index+1]]. ^ 0 " ' ' findSubstring: 'abc' in: 'abcdefabcd' startingAt: 1 matchTable: CaseSensitiveOrder 1 ' ' findSubstring: 'abc' in: 'abcdefabcd' startingAt: 2 matchTable: CaseSensitiveOrder 7 ' ' findSubstring: 'abc' in: 'abcdefabcd' startingAt: 8 matchTable: CaseSensitiveOrder 0 ' ' findSubstring: 'abc' in: 'abcdefABcd' startingAt: 2 matchTable: CaseSensitiveOrder 0 ' ' findSubstring: 'abc' in: 'abcdefABcd' startingAt: 2 matchTable: CaseInsensitiveOrder 7 "! Item was added: + ----- Method: WeakRegistry class>>migrateOldRegistries (in category 'migrating registry') ----- + migrateOldRegistries + Smalltalk at: #WeakFinalizationRegistry ifAbsent: [ ^ self "already done" ]. + + Smalltalk recreateSpecialObjectsArray. + WeakArray restartFinalizationProcess. + + Smalltalk garbageCollect; garbageCollect. + + "leave no chance to interrupt migration" + Compiler evaluate: ' + [ | old new oldClass newClass | + old := OrderedCollection new. + new := OrderedCollection new. + WeakRegistry allInstancesDo: [:registry | | newr | + old add: registry. + newr := WeakFinalizationRegistry basicNew initialize. + registry migrateTo: newr. + new add: newr ]. + old asArray elementsForwardIdentityTo: new asArray. + + oldClass := WeakRegistry. + newClass := WeakFinalizationRegistry. + + Smalltalk forgetClass: newClass logged: false. + newClass superclass removeSubclass: newClass. + newClass setName: #WeakRegistry. + oldClass becomeForward: newClass. + ] forkAt: Processor highestPriority. + '. + !

1 0

The Trunk: Collections-dtl.395.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

1 0

The Trunk: Collections-dtl.395.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

1 0

The Trunk: Graphics-dtl.151.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

David T. Lewis uploaded a new version of Graphics to project The Trunk: http://source.squeak.org/trunk/Graphics-dtl.151.mcz ==================== Summary ==================== Name: Graphics-dtl.151 Author: dtl Time: 24 October 2010, 12:57:55.652 pm UUID: dc7bd744-10b2-457e-9213-692344a446aa Ancestors: Graphics-nice.150 Use pragma declarations in methods that are translated to C in MiscPrimitivePlugin. Supports removal of Object>>inline: and Object>>var:declareC: from trunk. =============== Diff against Graphics-nice.150 =============== Item was changed: ----- Method: Bitmap>>compress:toByteArray: (in category 'filing') ----- compress: bm toByteArray: ba "Store a run-coded compression of the receiver into the byteArray ba, and return the last index stored into. ba is assumed to be large enough. The encoding is as follows... S {N D}*. S is the size of the original bitmap, followed by run-coded pairs. N is a run-length * 4 + data code. D, the data, depends on the data code... 0 skip N words, D is absent 1 N words with all 4 bytes = D (1 byte) 2 N words all = D (4 bytes) 3 N words follow in D (4N bytes) S and N are encoded as follows... 0-223 0-223 224-254 (0-30)*256 + next byte (0-7935) 255 next 4 bytes" | size k word j lowByte eqBytes i | <primitive: 'primitiveCompressToByteArray' module: 'MiscPrimitivePlugin'> + <var: #bm declareC: 'int *bm'> + <var: #ba declareC: 'unsigned char *ba'> - self var: #bm declareC: 'int *bm'. - self var: #ba declareC: 'unsigned char *ba'. size := bm size. i := self encodeInt: size in: ba at: 1. k := 1. [k <= size] whileTrue: [word := bm at: k. lowByte := word bitAnd: 16rFF. eqBytes := ((word >> 8) bitAnd: 16rFF) = lowByte and: [((word >> 16) bitAnd: 16rFF) = lowByte and: [((word >> 24) bitAnd: 16rFF) = lowByte]]. j := k. [j < size and: [word = (bm at: j+1)]] "scan for = words..." whileTrue: [j := j+1]. j > k ifTrue: ["We have two or more = words, ending at j" eqBytes ifTrue: ["Actually words of = bytes" i := self encodeInt: j-k+1*4+1 in: ba at: i. ba at: i put: lowByte. i := i+1] ifFalse: [i := self encodeInt: j-k+1*4+2 in: ba at: i. i := self encodeBytesOf: word in: ba at: i]. k := j+1] ifFalse: ["Check for word of 4 = bytes" eqBytes ifTrue: ["Note 1 word of 4 = bytes" i := self encodeInt: 1*4+1 in: ba at: i. ba at: i put: lowByte. i := i+1. k := k + 1] ifFalse: ["Finally, check for junk" [j < size and: [(bm at: j) ~= (bm at: j+1)]] "scan for ~= words..." whileTrue: [j := j+1]. j = size ifTrue: [j := j + 1]. "We have one or more unmatching words, ending at j-1" i := self encodeInt: j-k*4+3 in: ba at: i. k to: j-1 do: [:m | i := self encodeBytesOf: (bm at: m) in: ba at: i]. k := j]]]. ^ i - 1 "number of bytes actually stored" " Space check: | n rawBytes myBytes b | n := rawBytes := myBytes := 0. Form allInstancesDo: [:f | f unhibernate. b := f bits. n := n + 1. rawBytes := rawBytes + (b size*4). myBytes := myBytes + (b compressToByteArray size). f hibernate]. Array with: n with: rawBytes with: myBytes ColorForms: (116 230324 160318 ) Forms: (113 1887808 1325055 ) Integerity check: Form allInstances do: [:f | f unhibernate. f bits = (Bitmap decompressFromByteArray: f bits compressToByteArray) ifFalse: [self halt]. f hibernate] Speed test: MessageTally spyOn: [Form allInstances do: [:f | Bitmap decompressFromByteArray: f bits compressToByteArray]] "! Item was changed: ----- Method: Bitmap>>decompress:fromByteArray:at: (in category 'filing') ----- decompress: bm fromByteArray: ba at: index "Decompress the body of a byteArray encoded by compressToByteArray (qv)... The format is simply a sequence of run-coded pairs, {N D}*. N is a run-length * 4 + data code. D, the data, depends on the data code... 0 skip N words, D is absent (could be used to skip from one raster line to the next) 1 N words with all 4 bytes = D (1 byte) 2 N words all = D (4 bytes) 3 N words follow in D (4N bytes) S and N are encoded as follows (see decodeIntFrom:)... 0-223 0-223 224-254 (0-30)*256 + next byte (0-7935) 255 next 4 bytes" "NOTE: If fed with garbage, this routine could read past the end of ba, but it should fail before writing past the ned of bm." | i code n anInt data end k pastEnd | <primitive: 'primitiveDecompressFromByteArray' module: 'MiscPrimitivePlugin'> + <var: #bm declareC: 'int *bm'> + <var: #ba declareC: 'unsigned char *ba'> - self var: #bm declareC: 'int *bm'. - self var: #ba declareC: 'unsigned char *ba'. i := index. "byteArray read index" end := ba size. k := 1. "bitmap write index" pastEnd := bm size + 1. [i <= end] whileTrue: ["Decode next run start N" anInt := ba at: i. i := i+1. anInt <= 223 ifFalse: [anInt <= 254 ifTrue: [anInt := (anInt-224)*256 + (ba at: i). i := i+1] ifFalse: [anInt := 0. 1 to: 4 do: [:j | anInt := (anInt bitShift: 8) + (ba at: i). i := i+1]]]. n := anInt >> 2. (k + n) > pastEnd ifTrue: [^ self primitiveFail]. code := anInt bitAnd: 3. code = 0 ifTrue: ["skip"]. code = 1 ifTrue: ["n consecutive words of 4 bytes = the following byte" data := ba at: i. i := i+1. data := data bitOr: (data bitShift: 8). data := data bitOr: (data bitShift: 16). 1 to: n do: [:j | bm at: k put: data. k := k+1]]. code = 2 ifTrue: ["n consecutive words = 4 following bytes" data := 0. 1 to: 4 do: [:j | data := (data bitShift: 8) bitOr: (ba at: i). i := i+1]. 1 to: n do: [:j | bm at: k put: data. k := k+1]]. code = 3 ifTrue: ["n consecutive words from the data..." 1 to: n do: [:m | data := 0. 1 to: 4 do: [:j | data := (data bitShift: 8) bitOr: (ba at: i). i := i+1]. bm at: k put: data. k := k+1]]]! Item was changed: ----- Method: Bitmap>>encodeBytesOf:in:at: (in category 'filing') ----- encodeBytesOf: anInt in: ba at: i "Copy the integer anInt into byteArray ba at index i, and return the next index" + <inline: true> + <var: #ba declareC: 'unsigned char *ba'> - self inline: true. - self var: #ba declareC: 'unsigned char *ba'. 0 to: 3 do: [:j | ba at: i+j put: (anInt >> (3-j*8) bitAnd: 16rFF)]. ^ i+4! Item was changed: ----- Method: Bitmap>>encodeInt:in:at: (in category 'filing') ----- encodeInt: anInt in: ba at: i "Encode the integer anInt in byteArray ba at index i, and return the next index. The encoding is as follows... 0-223 0-223 224-254 (0-30)*256 + next byte (0-7935) 255 next 4 bytes" + <inline: true> + <var: #ba declareC: 'unsigned char *ba'> - self inline: true. - self var: #ba declareC: 'unsigned char *ba'. anInt <= 223 ifTrue: [ba at: i put: anInt. ^ i+1]. anInt <= 7935 ifTrue: [ba at: i put: anInt//256+224. ba at: i+1 put: anInt\\256. ^ i+2]. ba at: i put: 255. ^ self encodeBytesOf: anInt in: ba at: i+1!

1 0

The Trunk: Graphics-dtl.151.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

1 0

The Trunk: Graphics-dtl.151.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

1 0

The Trunk: Tests-ul.97.mcz
by commits＠source.squeak.org 24 Oct '10

24 Oct '10

Levente Uzonyi uploaded a new version of Tests to project The Trunk: http://source.squeak.org/trunk/Tests-ul.97.mcz ==================== Summary ==================== Name: Tests-ul.97 Author: ul Time: 24 October 2010, 6:06:56.495 am UUID: f5f99e31-06dd-3048-b380-77cc97804a79 Ancestors: Tests-eem.96 Bitmap >> #writeOn: raises an error, because it evaluates code which sends #inline: and #var:declareC:, etc. Since these methods were moved to VMMaker these sends result in a DNU. =============== Diff against Tests-eem.96 =============== Item was changed: + ----- Method: BitmapBugz>>testBitmapByteAt (in category 'tests') ----- - ----- Method: BitmapBugz>>testBitmapByteAt (in category 'as yet unclassified') ----- testBitmapByteAt | bm | bm := Bitmap new: 1. 1 to: 4 do:[:i| self should:[bm byteAt: i put: 1000] raise: Error. ].! Item was added: + ----- Method: BitmapBugz>>testWriteOn (in category 'tests') ----- + testWriteOn + + | original binary copy | + original := Bitmap new: 1. + original byteAt: 1 put: 42. + binary := ByteArray streamContents: [ :stream | + original writeOn: stream ]. + copy := Bitmap newFromStream: binary readStream. + self assert: original = copy!

1 0

← Newer
1
...
4
5
6
7
8
9
10
...
21
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Packages October 2010