Squeak-dev September 2014

squeak-dev@lists.squeakfoundation.org

49 participants
162 discussions

Re: [squeak-dev] The Trunk: Collections-nice.582.mcz
by Chris Muller 25 Sep '14

25 Sep '14

What a *gorgeous* solution to multi-level sorting! I love this!! Now I need to update some of my images to latest trunk just so I can get this.. On Fri, Sep 19, 2014 at 3:24 PM, <commits(a)source.squeak.org> wrote: > Nicolas Cellier uploaded a new version of Collections to project The Trunk: > http://source.squeak.org/trunk/Collections-nice.582.mcz > > ==================== Summary ==================== > > Name: Collections-nice.582 > Author: nice > Time: 19 September 2014, 10:22:13.338 pm > UUID: 52a598f1-224e-4649-a95f-4e78547b5ed5 > Ancestors: Collections-nice.581 > > Port TAG-SortFunctions of Travis Griggs from Cincom public store - version (11,tgriggs) > > Note that no collation policy were used for String. > The spaceship operator <=> is also required in Kernel-Numbers. > > See also the blog http://objology.blogspot.fr/2010/11/tag-sortfunctions.html > and http://objology.blogspot.fr/2010/11/tag-sortfunctions-redux.html > > Note about the cost of these sort functions: > as shown by this mini-bench on cog, using a Symbol costs a bit more (perform:) than a block activation, and monadic block a bit more than dyadic one because activated twice more, but it seems acceptable to me with regard to the great simplification and expressiveness of code : > > | collec1 collec2 collec3 | > collec1 := (1 to: 200000) collect: [:i | 1000000 atRandom-500000]. > collec2 := collec1 copy. > collec3 := collec1 copy. > { > [collec1 sort: [:a :b | a abs < b abs]] timeToRun. > [collec2 sort: [:e | e abs] ascending] timeToRun. > [collec3 sort: #abs ascending] timeToRun. > } > #(345 532 912) > > =============== Diff against Collections-nice.581 =============== > > Item was added: > + SortFunction subclass: #ChainedSortFunction > + instanceVariableNames: 'next' > + classVariableNames: '' > + poolDictionaries: '' > + category: 'Collections-Support'! > + > + !ChainedSortFunction commentStamp: 'nice 3/13/2014 22:25' prior: 0! > + I add to my parent the idea of a "next" function to use when two objects are equal by my particular collator. > + > + Usage > + > + SortFunctions can be chained together in primary, secondary, tertiary, etc order using the comma method. Consider a sequence of customer objects, where each customer object responds to the messages firstName, lastName, and age. If we want to sort them lastName first, then firstName, and finally oldest first, we would use an expression like: > + > + customers sort: #lastName ascending, #firstName ascending, #age descending > + > + As noted in my super's comment, unary symbols or single arg blocks can be used. One can omit the the ascending methods on arguments (not the receiver), it will default blocks or symbols to be ascending if none is specified. In other words, the above expression could be simplified slightly as > + > + customers sort: #lastName ascending, #firstName, #age descending > + > + (note the missing ascending on the #firstName argument) > + > + Instance Variables > + next <SortFunction> the next SortFunction to evaluate in the event my evaluator results in equal values. > + > + ! > > Item was added: > + ----- Method: ChainedSortFunction>>, (in category 'converting') ----- > + , aSortFunction > + > + self next: next , aSortFunction! > > Item was added: > + ----- Method: ChainedSortFunction>>next: (in category 'initialize-release') ----- > + next: anObject > + > + next := anObject! > > Item was added: > + ----- Method: ChainedSortFunction>>value:value: (in category 'evaluating') ----- > + value: anObject value: bObject > + "Refinement of the parent behavior. If the result of my collator is 0, then pass on to the next variable to work it out." > + > + | result | > + result := (collator value: anObject value: bObject) * direction. > + ^result isZero > + ifTrue: [next value: anObject value: bObject] > + ifFalse: [result < 0]! > > Item was added: > + Object subclass: #SortFunction > + instanceVariableNames: 'direction collator' > + classVariableNames: '' > + poolDictionaries: '' > + category: 'Collections-Support'! > + > + !SortFunction commentStamp: 'nice 3/13/2014 22:24' prior: 0! > + I am intended to be used in place of two arg sort blocks. > + > + Usage > + > + In the following example, an ascending SortFunction is created based on the result of the #first message send to each object. > + #(#(1 2) #(2 3) #(0 0)) sorted: #first ascending. > + > + To sort by the #last element, but descending, the following would be used: > + #(#(1 2) #(2 3) #(0 0)) sorted: #last descending. > + > + One can use blocks as well. The following sorts in descending order, the sub elements based on the sum of their values. > + | sumBlock | > + sumBlock := [:sequence | sequence inject: 0 into: [:sum :each | sum + each]]. > + #(#(1 2) #(2 3) #(0 0)) sorted: sumBlock descending. > + > + One can even use 2 arg blocks, for those cases where the function isn't expressible with objects that respond to < and =. The only catch, is that such a function has to return not true and false, but instead a collation order, values of -1 (for before), 0 (the same) or 1 (to follow). For example: > + > + | oddBlock | > + oddBlock := > + [:a :b | > + a odd = b odd ifTrue: [0] ifFalse: [a odd ifTrue: [-1] ifFalse: [1]]]. > + #(1 5 1 3 2 7 9 4 6) asSortedCollection: oddBlock descending > + > + Instance Variables > + collator <BlockClosure> This is the collation function that must return a -1, 0, or 1. It is usually composed by an initialization method such as sendMessage: or monadicBlock:, but may be set directly. > + direction <SmallInteger> 1 for ascending, -1 for descending > + > + ! > > Item was added: > + ----- Method: SortFunction class>>ascend (in category 'instance creation') ----- > + ascend > + > + ^self new ascend! > > Item was added: > + ----- Method: SortFunction class>>descend (in category 'instance creation') ----- > + descend > + > + ^self new descend! > > Item was added: > + ----- Method: SortFunction>>, (in category 'converting') ----- > + , aSortFunction > + "Return a new SortFunction which is the concatenation of aSortFunction to me, I will be the primary sort, but if I compare equal, I will defer to the argument." > + > + ^(ChainedSortFunction new) > + collator: collator; > + direction: direction; > + next: aSortFunction asSortFunction! > > Item was added: > + ----- Method: SortFunction>>asSortFunction (in category 'converting') ----- > + asSortFunction > + > + ^self! > > Item was added: > + ----- Method: SortFunction>>ascend (in category 'initailize-release') ----- > + ascend > + > + direction := 1! > > Item was added: > + ----- Method: SortFunction>>collator: (in category 'initailize-release') ----- > + collator: a2ArgBlock > + "a2ArgBlock MUST return the collation order, -1, 0, or 1" > + > + collator := a2ArgBlock! > > Item was added: > + ----- Method: SortFunction>>descend (in category 'initailize-release') ----- > + descend > + > + direction := -1! > > Item was added: > + ----- Method: SortFunction>>direction: (in category 'initailize-release') ----- > + direction: anInteger > + > + direction := anInteger! > > Item was added: > + ----- Method: SortFunction>>isAscending (in category 'testing') ----- > + isAscending > + > + ^direction = 1! > > Item was added: > + ----- Method: SortFunction>>isDescending (in category 'testing') ----- > + isDescending > + > + ^direction = -1! > > Item was added: > + ----- Method: SortFunction>>monadicBlock: (in category 'initailize-release') ----- > + monadicBlock: aSingleArgBlock > + "Initialze the receiver's collation block to compare the results of evaluating aSingleArgBlock with each argument, and then collate the return values with the <=> method." > + > + collator := [:a :b | (aSingleArgBlock value: a) <=> (aSingleArgBlock value: b)]! > > Item was added: > + ----- Method: SortFunction>>sendMessage: (in category 'initailize-release') ----- > + sendMessage: aUnarySymbol > + "Initialze the receiver's collation block to compare the results of sending aUnarySymbol to each argument, and then collate them with the <=> method." > + > + collator := [:a :b | (a perform: aUnarySymbol) <=> (b perform: aUnarySymbol)]! > > Item was added: > + ----- Method: SortFunction>>toggleDirection (in category 'converting') ----- > + toggleDirection > + "Invert my current direction, if I'm currently ascending, this will cause me to be descending now, and vice-versa." > + > + direction := direction * -1! > > Item was added: > + ----- Method: SortFunction>>value:value: (in category 'evaluating') ----- > + value: anObject value: bObject > + "Masquerade as a two argument block, used by many of the sorting APIs, by returning whether anObject should be placed before bObject or not." > + > + | result | > + result := (collator value: anObject value: bObject) * direction. > + ^result <= 0! > > Item was added: > + ----- Method: String>><=> (in category 'sorting') ----- > + <=> aCharacterArray > + "Return a collation order of -1, 0, or 1, indicating whether I should be collated before the receiver, am equal, or after. > + See also: http://en.wikipedia.org/wiki/Spaceship_operator" > + > + ^self = aCharacterArray > + ifTrue: [ 0 ] > + ifFalse: [self < aCharacterArray > + ifTrue: [ -1 ] > + ifFalse: [ 1 ]]! > > Item was added: > + ----- Method: Symbol>>asSortFunction (in category 'sorting') ----- > + asSortFunction > + > + ^self ascending! > > Item was added: > + ----- Method: Symbol>>ascending (in category 'sorting') ----- > + ascending > + "Return a SortFunction around the receiver, where the receiver will be used as a unary message to send to both a and b during sorting, and then the result of said send will be collated in ascending order using the <=> method." > + "Example: #('abc' 'de' 'fghi') sorted: #size asscending" > + > + ^SortFunction ascend sendMessage: self! > > Item was added: > + ----- Method: Symbol>>descending (in category 'sorting') ----- > + descending > + "Return a SortFunction around the receiver, where the receiver will be used as a unary message to send to both a and b during sorting, and then the result of said send will be collated in descending order using the <=> method." > + "Example: #('abc' 'de' 'fghi') sorted: #size descending" > + > + ^SortFunction descend sendMessage: self! > > Item was added: > + ----- Method: Text>><=> (in category 'sorting') ----- > + <=> aCharacterArray > + "Return a collation order of -1, 0, or 1, indicating whether I should be collated before the receiver, am equal, or after. > + See also: http://en.wikipedia.org/wiki/Spaceship_operator" > + > + ^string = aCharacterArray > + ifTrue: [ 0 ] > + ifFalse: [string < aCharacterArray asString > + ifTrue: [ -1 ] > + ifFalse: [ 1 ]]! > >

8 19

The Trunk: KernelTests-dtl.277.mcz
by commits＠source.squeak.org 25 Sep '14

25 Sep '14

David T. Lewis uploaded a new version of KernelTests to project The Trunk: http://source.squeak.org/trunk/KernelTests-dtl.277.mcz ==================== Summary ==================== Name: KernelTests-dtl.277 Author: dtl Time: 24 September 2014, 10:11:59.751 pm UUID: 3b86f08e-5ce4-45c3-ad43-c0b73d5d3b85 Ancestors: KernelTests-dtl.276 CompiledMethodTest>>testPerformCanExecutelongMethodWithTemps passes on all Cog and interpreter VMs, so remove it from expectedFailures =============== Diff against KernelTests-dtl.276 =============== Item was changed: ----- Method: CompiledMethodTest>>expectedFailures (in category 'testing') ----- expectedFailures Smalltalk isRunningCog ifTrue: [ ^super expectedFailures ]. ^#( + "Not supported by the interpreter VM. See method comments for details" - "The following two are not supported by the interpreter VM. See their comments for details" - testPerformCanExecutelongMethodWithTemps testPerformInSuperclassCanExecutelongMethodWithTemps )!

1 0

The Trunk: Tools-cmm.528.mcz
by commits＠source.squeak.org 25 Sep '14

25 Sep '14

Chris Muller uploaded a new version of Tools to project The Trunk: http://source.squeak.org/trunk/Tools-cmm.528.mcz ==================== Summary ==================== Name: Tools-cmm.528 Author: cmm Time: 24 September 2014, 7:58:54.026 pm UUID: ebf29995-8cb8-47d5-bb07-0f86d2f530ba Ancestors: Tools-eem.527 - Guard from empty possibilities when inverting the level selection of a MessageTrace. =============== Diff against Tools-eem.527 =============== Item was changed: ----- Method: MessageTrace>>invertLevelSelection (in category 'actions') ----- invertLevelSelection "The user wants to be able to quickly and easily assemble message-traces. When browsing senders or implementors of a heavily overloaded selector, typically just one or two messages are relevant out of several. In that situation, the user need merely select the range of relevant methods to arrive within two gestures of trimming the irrelevant methods: Command+I (capital eye) to invert the selection within the local group followed by Command+d to remove that selection from the browser." | index currentLevel start | currentLevel := self currentIndentionLevel ifNil: [ | possibilities | possibilities := ((1 to: messageSelections size) select: [ : idx | messageSelections at: idx ]) collect: [ : eachSelectedIndex | self indentionLevelAt: eachSelectedIndex ]. possibilities asSet size > 1 ifTrue: [ ^ self ] ifFalse: + [ possibilities ifEmpty: [ ^ self ]. + start := messageSelections indexOf: true. - [ start := messageSelections indexOf: true. possibilities anyOne ] ]. "First invert at messageListIndex then crawl up and down from there until a different level is reached, inverting as we go." messageListIndex > 0 ifTrue: [ start := messageListIndex ]. self toggleMessageSelectionAt: start. index := start. [ index := index - 1. index > 0 and: [ (self indentionLevelAt: index) = currentLevel ] ] whileTrue: [ self toggleMessageSelectionAt: index ]. index := start. [ index := index + 1. index <= messageList size and: [ (self indentionLevelAt: index) = currentLevel ] ] whileTrue: [ self toggleMessageSelectionAt: index ]. self messageListIndex: 0 ; changed: #messageList!

1 0

New Cog VMs available
by Eliot Miranda 24 Sep '14

24 Sep '14

...at http://www.mirandabanda.org/files/Cog/VM/VM.r3072. CogVM binaries as per VMMaker.oscog-eem.876/r3072 Fix bad regression in FilePlugin>>primitiveFileSetPosition introduces around r2797 that breaks > 1Gb file access. Change manifest files on Windows to make app HIGHDPIAWARE. Create a manifest for the consolevm and include it in the archive. Fix bug with become where duplicate entries in the input array would crash the system (thanks Igor). Make nameOfClass: more robust, in both the real and simulated VMs. Regenerate sources after refactoring Slang code to ask classes what methods they want to include based on their initializationOptions inst var instead of the centralized VMMaker. Generate Spur Newspeak VMs with the new CompiledMethod header format. This will break the Newspeak Spur bootstrap until NOF generation and/or loading is fixed. -- best, Eliot

3 4

The Inbox: Network-cmm.151.mcz
by commits＠source.squeak.org 24 Sep '14

24 Sep '14

A new version of Network was added to project The Inbox: http://source.squeak.org/inbox/Network-cmm.151.mcz ==================== Summary ==================== Name: Network-cmm.151 Author: cmm Time: 24 September 2014, 2:41:23.349 pm UUID: 74ec9de8-3417-462b-9a74-005dfc2e2130 Ancestors: Network-nice.150 After closing and destroying a SocketStream, reset its buffers back down to 4k in case they had grown to many megabytes. =============== Diff against Network-nice.150 =============== Item was changed: ----- Method: SocketStream>>close (in category 'control') ----- close "Flush any data still not sent and take care of the socket." self flush. + socket closeAndDestroy: 30. + "Reclaim memory consumed by possibly very large buffers." + self resetBuffers! - socket closeAndDestroy: 30!

1 0

Contributor agreement
by Frank Shearar 24 Sep '14

24 Sep '14

Actually, what process do we have in place to onboard new contributors? I know the old agreement is at http://netjam.org/squeak/SqueakDistributionAgreement.pdf - is that still the right document? To whom would the new contributor mail the signed agreement? It used to be Viewpoints, but now would it be someone in the SFC? frank

4 4

replaceFrom:to:with:startingAt:
by Bert Freudenberg 23 Sep '14

23 Sep '14

I just found out why PNG decoding was broken in SqueakJS [*]. Wouldn't have believed that any code actually relied on the following behavior: | a | a := (1 to: 20) asArray. a replaceFrom: 11 to: 20 with: a startingAt: 8. ==> #(1 2 3 4 5 6 7 8 9 10 8 9 10 8 9 10 8 9 10 8) In my (buggy) VM it answered ==> #(1 2 3 4 5 6 7 8 9 10 8 9 10 11 12 13 14 15 16 17) which apparently did not at all match what The Creators intended ;) - Bert - [*] specifically, #decompressBlock:with:

5 12

MethodMassage loading instructions?
by Frank Shearar 22 Sep '14

22 Sep '14

Hi Eliot, I thought I'd take a random stab at loading up MethodMassage, but the ss3 repository doesn't say much, installation-wise. So I just did the obvious, and fired up Installer. I get this when loading: This package depends on the following classes: EncoderForSistaV1 EncoderForNewsqueakV4 You must resolve these dependencies before you will be able to load these definitions: EncoderForNewsqueakV4 class>>literalIndexOfBytecodeAt:in: EncoderForSistaV1 class>>literalIndexOfBytecodeAt:in: In what package would I find these? VMMaker? frank

2 1

Re: [squeak-dev] replaceFrom:to:with:startingAt:
by Lawson English 22 Sep '14

22 Sep '14

If you told the average person that it didn't copy first, I think they would have assumed it was the wrong behavior. If I told someone to do such a procedure using English words to numbers found 20 text-boxes, they would do it the "erroneous way," I am pretty sure. L On 9/22/14, 1:34 PM, Bert Freudenberg wrote: > On 22.09.2014, at 22:21, Ron Teitelbaum <ron(a)usmedrec.com> wrote: > >>> From: Bert Freudenberg >>> Sent: Monday, September 22, 2014 4:00 PM >>> >>> I just found out why PNG decoding was broken in SqueakJS [*]. Wouldn't >>> have believed that any code actually relied on the following behavior: >>> >>> | a | >>> a := (1 to: 20) asArray. >>> a replaceFrom: 11 to: 20 with: a startingAt: 8. >>> >>> ==> #(1 2 3 4 5 6 7 8 9 10 8 9 10 8 9 10 8 9 10 8) >>> >> That's funky! Hope it wasn't my code! Seems wrong to not copy the array >> before modifying it (Like your buggy VM did). > It's not a copy. It moved the numbers 8-17 to index 11. Which is what I erroneously had assumed to be the desired behavior. > > - Bert - > >> Ron >> >>> In my (buggy) VM it answered >>> >>> ==> #(1 2 3 4 5 6 7 8 9 10 8 9 10 11 12 13 14 15 16 17) >>> >>> which apparently did not at all match what The Creators intended ;) >>> >>> - Bert - >>> >>> [*] specifically, #decompressBlock:with: >> > > > -- Squeak from the very start (introduction to Squeak and Pharo Smalltalk for the (almost) complete and compleate beginner). https://www.youtube.com/playlist?list=PL6601A198DF14788D&feature=view_all "Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it." - Brian Kernighan

1 0

The Inbox: Kernel-cbc.872.mcz
by commits＠source.squeak.org 22 Sep '14

22 Sep '14

A new version of Kernel was added to project The Inbox: http://source.squeak.org/inbox/Kernel-cbc.872.mcz ==================== Summary ==================== Name: Kernel-cbc.872 Author: cbc Time: 21 September 2014, 10:14:21.049 pm UUID: 6c144dc0-7a21-a644-af0d-3fca4985da78 Ancestors: Kernel-cbc.871 Added #hash to GenericMonth, GenericYear, and GenericDuration. Commented all 3 classes. Simplified how GenericDuration works. =============== Diff against Kernel-cbc.871 =============== Item was changed: Object subclass: #GenericDuration instanceVariableNames: 'sequence' classVariableNames: '' poolDictionaries: '' category: 'Kernel-Chronology'! + + !GenericDuration commentStamp: 'cbc 9/21/2014 22:07' prior: 0! + The GenericDuration class exists to support simple DateAndTime arithmetic (also including Timespan, such as Date). This class supports chains of different duration arthmetic with each other, such as: + 1 year + 2 months + 3 days + 4 hours + 5 minuts + 6 seconds + 7 nanoSeconds + Instances of GenericDuration should be created by adding (or subtracting)2 or more durations with each other, including other instances of GenericDuration. + + You cannot ask a GenericDuration how long it is. This is a nonsensical question if a year or month is involved, as those are only resolvable once it is place into relationship to an actual date. + + GenericDuration are associate, but not commutative. That is + 1 month + 31 days ~= 31 days + 1 month + but + ((1 month + 1 year) + 31 days) = (1 month + (1 year + 31 days)) + ! Item was changed: ----- Method: GenericDuration>>+ (in category 'ansii protocol') ----- + aDuration "aDuration is one of the families of Duration. Not that if it isn't, it will fail, but only when addng to a DateAndTime or Timespan, not before!!" aDuration class = self class + ifTrue: [sequence addAllLast: aDuration sequence] + ifFalse: [sequence addLast: aDuration copy] - ifTrue: [sequence addAll: aDuration sequence] - ifFalse: [sequence addLast: { #+. #-. aDuration. }] ! Item was changed: ----- Method: GenericDuration>>- (in category 'ansii protocol') ----- - aDuration "aDuration is one of the families of Duration. Not that if it isn't, it will fail, but only when addng to a DateAndTime or Timespan, not before!!" aDuration class = self class + ifTrue: [sequence addAllLast: (aDuration sequence collect: [:s| s copy negated])] + ifFalse: [sequence addLast: aDuration copy negated]! - ifTrue: [sequence addAll: (aDuration sequence collect: [:s| s copy swap: 1 with: 2])] - ifFalse: [sequence addLast: { #-. #+. aDuration. }]! Item was changed: ----- Method: GenericDuration>>addToDateTime: (in category 'ansii protocol') ----- addToDateTime: aDateAndTime + ^sequence inject: aDateAndTime into: [:result :duration | result + duration ]! - ^sequence inject: aDateAndTime into: [:result :message| - result perform: message first with: message last - ]! Item was changed: ----- Method: GenericDuration>>addToDuration: (in category 'ansii protocol') ----- addToDuration: aDuration + sequence addFirst: aDuration copy! - sequence addFirst: { #+. #-. aDuration. }! Item was added: + ----- Method: GenericDuration>>hash (in category 'ansii protocol') ----- + hash + ^(sequence collect: #hash) sum hash! Item was changed: ----- Method: GenericDuration>>printOn: (in category 'squeak protocol') ----- printOn: stream + sequence do: [:msg| msg printOn: stream] separatedBy: [stream nextPutAll: ' + ']! - sequence do: [:msg| msg printOn: stream] separatedBy: [stream space]! Item was changed: ----- Method: GenericDuration>>subtractFromDateTime: (in category 'ansii protocol') ----- subtractFromDateTime: aDateAndTime + ^sequence inject: aDateAndTime into: [:result :duration | result + duration copy negated ]! - ^sequence inject: aDateAndTime into: [:result :message| - result perform: message second with: message last - ]! Item was changed: ----- Method: GenericDuration>>subtractFromDuration: (in category 'ansii protocol') ----- subtractFromDuration: aDuration + sequence addFirst: aDuration copy negated! - sequence do: [:s| s swap: 1 with: 2]. - sequence addFirst: { #+. #-. aDuration. }! Item was changed: Object subclass: #GenericMonth instanceVariableNames: 'number' classVariableNames: '' poolDictionaries: '' category: 'Kernel-Chronology'! + + !GenericMonth commentStamp: 'cbc 9/21/2014 22:01' prior: 0! + The GenericMonth class exists to support simple DateAndTime arithmetic with months (also including Timespan, such as Date). This class is the mechanism behind: + DateAndTime now + 3 months + Instances of this class should be created by sending #month or #months to an integer (other types of number result in unspecified results). + (note that sending #month to any number will result in either exactly 1 month or -1 month, ignoring the actual number you send it too.) + + Thse are the rules about what a 'month' is: + 1: If you add a month, you want the result to be in the next calendar month, never the following one. + 2: If you add a month, you want the same day of the month if possible, and if not (becaue the next month has less days), then the closest that you can get to it. + 4: If you add more than 1 month, you want to end up in the right calendar month that you would expect, and as close to the starting day of the month as you can. + 3: If you subtract a month, you want it in the previous calendar month, and as close to the starting day of the month as you can get. + + So, adding 1 month to August 31 would give September 30th; adding 2 months to August 31 would give October 31st. And adding 1 month to September 30th would give October 30th. + + + ! Item was added: + ----- Method: GenericMonth>>hash (in category 'ansiProtocol') ----- + hash + ^number hash! Item was changed: Object subclass: #GenericYear instanceVariableNames: 'number' classVariableNames: '' poolDictionaries: '' category: 'Kernel-Chronology'! + + !GenericYear commentStamp: 'cbc 9/21/2014 22:00' prior: 0! + The GenericYear class exists to support simple DateAndTime arithmetic with years (also including Timespan, such as Date). This class is the mechanism behind: + DateAndTime now + 3 years + Instances of this class should be created by sending #year or #years to an integer (other types of number result in unspecified results). + (note that sending #year to any number will result in either exactly 1 year or -1 year, ignoring the actual number you send it too.) + + Thse are the rules about what a 'year' is: + 1: If you add a year, you want the result to be in the next year, never the following one; it needs to end up in the same month as the starting month; and it needs to be the same day of the month if possible as the starting date, and if not (becaue the next years month has less days such as leap year to non-leap year), then the closest that you can get to it. + 4: If you add more than 1 year, you want to end up in the right year, same calendar month that you would expect, and as close to the starting day of the month as you can. + 3: If you subtract a year, you want it in the previous year and same calendar month, and as close to the starting day of the month as you can get.! Item was added: + ----- Method: GenericYear>>hash (in category 'ansiProtocol') ----- + hash + ^number hash!

1 0

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

Jump to page: