Subject: IO and Process Scheduler - msg#00027

Previous Message by Date: click to view message preview

Re: [rfc] regex rewrite

CRegexRegisters >> #matchBeg and String >> #searchRegex: look like a failed match would return nil, but in practice, you get: | mr | mr := 'abc' searchRegex: '[0-9]+'. mr isNil printNl. "false" mr from printNl. "0". ! Is that intended? It is not. It looks like sometimes the behavior I implemented works, sometimes one needs to also check that the value is greater than -1 (or 0 after adjusting for Smalltalk's 1-based strings). I also think it would be more useful if =~ returned MatchResult/nil instead of true/false. There's #searchRegex: for that. The "=~" name seemed more like a boolean query to me. Here is a new version of the patch (only the regex.st parts) that supports cute things like st> ^'abc' copyFrom: 1 to: 3 replacingRegex: 'a(.)c' with: 'X%1Z'! 'XbZ' Note how implementing #at: in RegexResults made this new feature extremely easy to implement! And, %0 works automagically: st> ^'abc' copyFrom: 1 to: 3 replacingRegex: 'a(.)c' with: 'A%0C'! 'AabcC' It also fixes the bug you mentioned: st> ^'abc' =~ '[0-9]+'! false Thank you, this is exactly the feedback I wanted! Paolo --- orig/examples/regex.st +++ mod/examples/regex.st @@ -9,7 +9,7 @@ "====================================================================== | | Copyright 2001, 2003, 2005 Free Software Foundation, Inc. -| Written by Dragomir Milivojevic. +| Written by Dragomir Milevojevic, Paolo Bonzini, Mike Anderson. | | This file is part of the GNU Smalltalk class library. | @@ -50,6 +50,91 @@ object is used whenever possible (when converting Strings to Regex, the cache is sought for an equivalent, already constructed Regex).'. +CStruct subclass: #CRegexRegisters + declaration: #( (#allocated #int) + (#numRegs #int) + (#beg (#ptr #int)) + (#end (#ptr #int)) ) + classVariableNames: '' + poolDictionaries: '' + category: 'Regex' +! + +Object subclass: #RegexResults + instanceVariableNames: 'subject from to registers match cache' + classVariableNames: '' + poolDictionaries: '' + category: 'Regex' +! + +!RegexResults methodsFor: 'accessing'! + +subject + ^subject! + +size + ^registers size! + +from + ^from! + +fromAt: anIndex + | reg | + anIndex = 0 ifTrue: [ ^from ]. + reg := registers at: anIndex. + ^reg isNil ifTrue: [ nil ] ifFalse: [ reg first ]! + +to + ^to! + +toAt: anIndex + | reg | + anIndex = 0 ifTrue: [ ^from ]. + reg := registers at: anIndex. + ^reg isNil ifTrue: [ nil ] ifFalse: [ reg last ]! + +match + match isNil + ifTrue: [ match := self subject copyFrom: from to: to ]. + ^match! + +matchInterval + ^from to: to! + +at: anIndex + | reg text | + anIndex = 0 ifTrue: [ ^self match ]. + (cache at: anIndex) isNil + ifTrue: [ + reg := registers at: anIndex. + text := reg isNil + ifTrue: [ nil ] + ifFalse: [ self subject copyFrom: reg first to: reg last ]. + cache at: anIndex put: text ]. + ^cache at: anIndex! + +intervalAt: anIndex + ^anIndex = 0 + ifTrue: [ from to: to ] + ifFalse: [ registers at: anIndex ]! + +size + ^registers size! ! + +!RegexResults methodsFor: 'private'! + +initialize: regs subject: aString + from := regs matchBeg. + to := regs matchEnd. + registers := (1 to: regs numRegs value - 1) collect: [ :i | + | beg end | + beg := (regs begAt: i). + end := (regs endAt: i). + end < 0 ifTrue: [ nil ] ifFalse: [ beg to: end ] ]. + cache := Array new: registers size. + subject := aString! + + " --- external function definitions --- " !Regex class methodsFor: 'C call-outs'! @@ -59,14 +144,42 @@ !String methodsFor: 'C call-outs'! -searchRegex: pattern from: from to: to - <cCall: 'reh_search' returning: #int - args: #(#selfSmalltalk #smalltalk #int #int)>! - lengthOfRegexMatch: pattern from: from to: to <cCall: 'reh_match' returning: #int + args: #(#selfSmalltalk #smalltalk #int #int)>! + +searchRegexInternal: pattern from: from to: to + <cCall: 'reh_search' returning: CRegexRegisters type args: #(#selfSmalltalk #smalltalk #int #int)>! ! +!CRegexRegisters methodsFor: 'C call-outs'! + +begAt: i + ^(self beg value + i) value + 1! + +matchBeg + | begValue matchBeg | + begValue := self beg value. + begValue isNil ifTrue: [ ^-1 ]. + matchBeg := begValue value. + matchBeg = -1 ifTrue: [ ^-1 ]. + ^begValue value + 1! + +endAt: i + ^(self end value + i) value! + +matchEnd + | endValue matchEnd | + endValue := self end value. + endValue isNil ifTrue: [ ^-1 ]. + matchEnd := endValue value. + matchEnd = -1 ifTrue: [ ^-1 ]. + ^endValue value! + +free + <cCall: 'reh_free_registers' returning: #void + args: #(#self)>! ! + "--------------------------------------------------------------------------" !Regex class methodsFor: 'instance creation'! @@ -138,7 +251,11 @@ =~ regexString "Answer whether an occurrence of the regex is present in the receiver" - ^(self searchRegex: regexString from: 1 to: self size) > 0 + | regs gotIt | + regs := self searchRegexInternal: regexString from: 1 to: self size. + gotIt := regs matchBeg > 0. + regs free. + ^gotIt ! asRegex @@ -146,60 +263,92 @@ ^Regex fromString: self ! +searchRegex: pattern + | regs | + regs := self searchRegexInternal: pattern from: 1 to: self size. + regs matchBeg = -1 ifTrue: [ regs free. ^nil ]. + ^[ RegexResults new initialize: regs subject: self ] + ensure: [ regs free ]! + +searchRegex: pattern startingAt: anIndex + | regs | + regs := self searchRegexInternal: pattern from: anIndex to: self size. + regs matchBeg = -1 ifTrue: [ regs free. ^nil ]. + ^[ RegexResults new initialize: regs subject: self ] + ensure: [ regs free ]! + +searchRegex: pattern from: from to: to + | regs | + regs := self searchRegexInternal: pattern from: from to: to. + regs matchBeg = -1 ifTrue: [ regs free. ^nil ]. + ^[ RegexResults new initialize: regs subject: self ] + ensure: [ regs free ]! + indexOfRegex: regexString ifAbsent: excBlock "Answer whether an occurrence of the regex is present in the receiver" - | start len | - start := self searchRegex: regexString from: 1 to: self size. - start > 0 ifFalse: [ ^excBlock value ]. - - len := self lengthOfRegexMatch: regexString from: start to: self size. - ^start to: start + len - 1 + | regs beg end | + regs := self searchRegexInternal: regexString from: 1 to: self size. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + ^beg >= 1 + ifTrue: [ beg to: end ] + ifFalse: [ excBlock value ] ! indexOfRegex: regexString startingAt: index ifAbsent: excBlock - | start len | - start := self searchRegex: regexString from: index to: self size. - start > 0 ifFalse: [ ^excBlock value ]. - - len := self lengthOfRegexMatch: regexString from: start to: self size. - ^start to: start + len - 1 -! - -indexOfRegex: regexString from: start to: end ifAbsent: excBlock - | idx len | - idx := self searchRegex: regexString from: idx to: end. - idx > 0 ifFalse: [ ^excBlock value ]. - - len := self lengthOfRegexMatch: regexString from: idx to: self size. - ^start to: start + len - 1 + | regs beg end | + regs := self searchRegexInternal: regexString from: index to: self size. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + ^beg >= 1 + ifTrue: [ beg to: end ] + ifFalse: [ excBlock value ] +! + +indexOfRegex: regexString from: from to: to ifAbsent: excBlock + | regs beg end | + regs := self searchRegexInternal: regexString from: from to: to. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + ^beg >= 1 + ifTrue: [ beg to: end ] + ifFalse: [ excBlock value ] ! indexOfRegex: regexString - "Answer whether an occurrence of the regex is present in the receiver" - | start len | - start := self searchRegex: regexString from: 1 to: self size. - start > 0 ifFalse: [ ^nil ]. - - len := self lengthOfRegexMatch: regexString from: start to: self size. - ^start to: start + len - 1 + | regs beg end | + regs := self searchRegexInternal: regexString from: 1 to: self size. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + ^beg >= 1 + ifTrue: [ beg to: end ] + ifFalse: [ nil ] ! indexOfRegex: regexString startingAt: index - | start len | - start := self searchRegex: regexString from: index to: self size. - start > 0 ifFalse: [ ^nil ]. - - len := self lengthOfRegexMatch: regexString from: start to: self size. - ^start to: start + len - 1 -! - -indexOfRegex: regexString from: start to: end - | idx len | - idx := self searchRegex: regexString from: idx to: end. - idx > 0 ifFalse: [ ^nil ]. - - len := self lengthOfRegexMatch: regexString from: start to: self size. - ^start to: start + len - 1 + | regs beg end | + regs := self searchRegexInternal: regexString from: index to: self size. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + ^beg >= 1 + ifTrue: [ beg to: end ] + ifFalse: [ nil ] +! + +indexOfRegex: regexString from: from to: to + | regs beg end | + regs := self searchRegexInternal: regexString from: from to: to. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + ^beg >= 1 + ifTrue: [ beg to: end ] + ifFalse: [ nil ] ! matchRegex: pattern @@ -217,20 +366,18 @@ occurrencesOfRegex: pattern from: from to: to "Returns count of how many times pattern repeats in string" - | res idx len regex | + | res idx regex beg end regs | regex := pattern asRegex. res := 0. idx := from. [ - idx <= to and: [ - idx := self searchRegex: regex from: idx to: to. - idx > 0 ] + regs := self searchRegexInternal: regex from: idx to: to. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + beg >= 1 ] whileTrue: [ - - len := self lengthOfRegexMatch: regex from: idx to: to. - len = 0 ifTrue: [ len := 1 ]. - - idx := idx + len. + idx := end max: beg + 1. res := res + 1. ]. @@ -252,23 +399,21 @@ copyFrom: from to: to replacingRegex: pattern with: str "Replaces first occurance of pattern with provided string" - | res idx len | + | regs beg end repl res | + regs := self searchRegex: pattern from: from to: to. - idx := self searchRegex: pattern from: from to: to. + regs notNil + ifTrue: [ + beg := regs from. + end := regs to. + repl := str bindWithArguments: regs. + res := self species new: (to - from) - (end - beg) + repl size. + res replaceFrom: 1 to: beg - from with: self startingAt: from. + res replaceFrom: beg - from + 1 to: beg - from + repl size with: repl. + res replaceFrom: beg - from + repl size + 1 to: res size with: self startingAt: end - from + 2 ] + ifFalse: [ res := self copyFrom: from to: to ]. - idx > 0 ifTrue: [ - res := self copyFrom: from to: idx - 1. - res := res, str. - - idx := idx + (self lengthOfRegexMatch: pattern from: idx to: to). - - idx <= to ifTrue: - [ res := res, (self copyFrom: idx to: to) ]. - - ^ res - ]. - - ^self copyFrom: from to: to + ^res ! copyReplacingRegex: pattern with: str @@ -280,29 +425,24 @@ copyFrom: from to: to replacingAllRegex: pattern with: str "Replaces all occurances of pattern between boundaries with specified string" - | res oldIdx idx len regex | - idx := from. - res := WriteStream on: self copyEmpty. + | res idx regex beg end regs | regex := pattern asRegex. - + res := WriteStream on: (String new: to - from + 1). + idx := from. [ - oldIdx := idx. - idx <= to and: [ - idx := self searchRegex: regex from: idx to: to. - idx > 0 ] + regs := self searchRegex: regex from: idx to: to. + beg >= 1 + regs notNil ] whileTrue: [ - oldIdx to: idx - 1 do: [ :each | - res nextPut: (self at: each) ]. - - len := self lengthOfRegexMatch: regex from: idx to: to. - len = 0 ifTrue: [ len := 1 ]. - - res nextPutAll: str. - idx := idx + len. + beg := regs from. + end := regs to. + res next: beg - idx putAll: self startingAt: idx. + res nextPutAll: (str bindWithArguments: regs). + idx := end + 1. + beg > end ifTrue: [ res nextPut: (self at: idx). idx := idx + 1 ]. + idx > self size ifTrue: [ ^res contents ]. ]. - - oldIdx to: to do: [ :each | - res nextPut: (self at: each) ]. + res next: to - idx + 1 putAll: self startingAt: idx. ^res contents ! @@ -316,20 +456,18 @@ onOccurrencesOfRegex: pattern from: from to: to do: body "Searches for pattern and executed passed instruction-body (as a trigger)" - | idx len res regex | - idx := from. + | idx regex beg end regs | regex := pattern asRegex. - + idx := from. [ - idx <= to and: [ - idx := self searchRegex: regex from: idx to: to. - idx > 0 ] + regs := self searchRegexInternal: regex from: idx to: to. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + beg >= 1 ] whileTrue: [ - len := self lengthOfRegexMatch: regex from: idx to: to. - - body value: idx value: len. - len = 0 ifTrue: [ len := 1 ]. - idx := idx + len. + body value: beg value: end - beg + 1. + idx := end + 1 max: beg + 1. ]. ! @@ -340,28 +478,24 @@ ! tokenize: pattern from: from to: to - - | res oldIdx idx len regex | - idx := from. - res := WriteStream on: (Array new: 10). + | res idx regex beg end regs tokStart | regex := pattern asRegex. - + res := WriteStream on: (Array new: 10). + idx := from. + tokStart := 1. [ - oldIdx := idx. - idx <= to and: [ - idx := self searchRegex: regex from: idx to: to. - idx > 0 ] + regs := self searchRegexInternal: regex from: idx to: to. + beg := regs matchBeg. + end := regs matchEnd. + regs free. + beg >= 1 ] whileTrue: [ - len := self lengthOfRegexMatch: regex from: idx to: to. - res nextPut: (self copyFrom: oldIdx to: idx - 1). - - len = 0 ifTrue: [ len := 1 ]. - idx := idx + len. + res nextPut: (self copyFrom: tokStart to: beg - 1). + tokStart := end + 1. + idx := beg + 1 max: end + 1. ]. - oldIdx <= to ifTrue: [ - res nextPut: (self copyFrom: oldIdx to: to) - ]. + res nextPut: (self copyFrom: tokStart to: to). ^res contents ! @@ -374,7 +508,6 @@ ! tokenize - ^self tokenize: '[\n\t ]+' from: 1 to: self size ! ! "====================================================================== | | String manipulation and regular expression resolver | | ======================================================================" "====================================================================== | | Copyright 2001, 2003, 2005 Free Software Foundation, Inc. | Written by Dragomir Milevojevic, Paolo Bonzini, Mike Anderson. | | This file is part of the GNU Smalltalk class library. | | The GNU Smalltalk class library is free software; you can redistribute it | and/or modify it under the terms of the GNU Lesser General Public License | as published by the Free Software Foundation; either version 2.1, or (at | your option) any later version. | | The GNU Smalltalk class library is distributed in the hope that it will be | useful, but WITHOUT ANY WARRANTY; without even the implied warranty of | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser | General Public License for more details. | | You should have received a copy of the GNU Lesser General Public License | along with the GNU Smalltalk class library; see the file COPYING.LESSER. | If not, write to the Free Software Foundation, 59 Temple Place - Suite | 330, Boston, MA 02111-1307, USA. | ======================================================================" String variableByteSubclass: #Regex instanceVariableNames: '' classVariableNames: '' poolDictionaries: '' category: 'Examples-Modules' ! Regex comment: ' A Regex is equivalent to a String, except that it is read-only and that the regular expression matcher caches a compiled representation of the most recently used Regexes, thus speeding up matching. Regex objects are constructed automatically by methods that expect to match many times the same regular expression, but can be constructed explicitly sending #asRegex to a String or Symbol. Creation of Regex objects inside a loop is of course slower than creating them outside the loop, but special care is taken so that the same Regex object is used whenever possible (when converting Strings to Regex, the cache is sought for an equivalent, already constructed Regex).'. CStruct subclass: #CRegexRegisters declaration: #( (#allocated #int) (#numRegs #int) (#beg (#ptr #int)) (#end (#ptr #int)) ) classVariableNames: '' poolDictionaries: '' category: 'Regex' ! Object subclass: #RegexResults instanceVariableNames: 'subject from to registers match cache' classVariableNames: '' poolDictionaries: '' category: 'Regex' ! !RegexResults methodsFor: 'accessing'! subject ^subject! size ^registers size! from ^from! fromAt: anIndex | reg | anIndex = 0 ifTrue: [ ^from ]. reg := registers at: anIndex. ^reg isNil ifTrue: [ nil ] ifFalse: [ reg first ]! to ^to! toAt: anIndex | reg | anIndex = 0 ifTrue: [ ^from ]. reg := registers at: anIndex. ^reg isNil ifTrue: [ nil ] ifFalse: [ reg last ]! match match isNil ifTrue: [ match := self subject copyFrom: from to: to ]. ^match! matchInterval ^from to: to! at: anIndex | reg text | anIndex = 0 ifTrue: [ ^self match ]. (cache at: anIndex) isNil ifTrue: [ reg := registers at: anIndex. text := reg isNil ifTrue: [ nil ] ifFalse: [ self subject copyFrom: reg first to: reg last ]. cache at: anIndex put: text ]. ^cache at: anIndex! intervalAt: anIndex ^anIndex = 0 ifTrue: [ from to: to ] ifFalse: [ registers at: anIndex ]! size ^registers size! ! !RegexResults methodsFor: 'private'! initialize: regs subject: aString from := regs matchBeg. to := regs matchEnd. registers := (1 to: regs numRegs value - 1) collect: [ :i | | beg end | beg := (regs begAt: i). end := (regs endAt: i). end < 0 ifTrue: [ nil ] ifFalse: [ beg to: end ] ]. cache := Array new: registers size. subject := aString! " --- external function definitions --- " !Regex class methodsFor: 'C call-outs'! fromString: aString <cCall: 'reh_make_cacheable' returning: #smalltalk args: #(#smalltalk)>! !String methodsFor: 'C call-outs'! lengthOfRegexMatch: pattern from: from to: to <cCall: 'reh_match' returning: #int args: #(#selfSmalltalk #smalltalk #int #int)>! searchRegexInternal: pattern from: from to: to <cCall: 'reh_search' returning: CRegexRegisters type args: #(#selfSmalltalk #smalltalk #int #int)>! ! !CRegexRegisters methodsFor: 'C call-outs'! begAt: i ^(self beg value + i) value + 1! matchBeg | begValue matchBeg | begValue := self beg value. begValue isNil ifTrue: [ ^-1 ]. matchBeg := begValue value. matchBeg = -1 ifTrue: [ ^-1 ]. ^begValue value + 1! endAt: i ^(self end value + i) value! matchEnd | endValue matchEnd | endValue := self end value. endValue isNil ifTrue: [ ^-1 ]. matchEnd := endValue value. matchEnd = -1 ifTrue: [ ^-1 ]. ^endValue value! free <cCall: 'reh_free_registers' returning: #void args: #(#self)>! ! "--------------------------------------------------------------------------" !Regex class methodsFor: 'instance creation'! new self error: 'please use #fromString: to create instances'! ! !Regex methodsFor: 'basic'! at: anIndex put: anObject self shouldNotImplement ! copy "Answer the receiver; instances of Regex are identity objects because their only purpose is to ease caching, and we obtain better caching if we avoid copying Regex objects" ^self ! ! !Regex methodsFor: 'conversion'! asRegex "Answer the receiver, which *is* a Regex!" ^self ! asString "Answer the receiver, converted back to a String" ^self collect: [ :each | each ] ! species ^String ! ! !Regex methodsFor: 'printing'! displayString "Answer a String representing the receiver. For most objects this is simply its #printString, but for strings and characters, superfluous dollars or extra pair of quotes are stripped." | stream | stream := WriteStream on: (String new: 0). self displayOn: stream. ^stream contents ! displayOn: aStream "Print a represention of the receiver on aStream. For most objects this is simply its #printOn: representation, but for strings and characters, superfluous dollars or extra pairs of quotes are stripped." self printOn: aStream ! printOn: aStream "Print a represention of the receiver on aStream." aStream nextPut: $/. self do: [ :each | each = $/ ifTrue: [ aStream nextPut: $\ ]. aStream nextPut: each. ]. aStream nextPut: $/. ! ! "--------------------------------------------------------------------------" !String methodsFor: 'regex'! =~ regexString "Answer whether an occurrence of the regex is present in the receiver" | regs gotIt | regs := self searchRegexInternal: regexString from: 1 to: self size. gotIt := regs matchBeg > 0. regs free. ^gotIt ! asRegex "Answer the receiver, converted to a Regex object." ^Regex fromString: self ! searchRegex: pattern | regs | regs := self searchRegexInternal: pattern from: 1 to: self size. regs matchBeg = -1 ifTrue: [ regs free. ^nil ]. ^[ RegexResults new initialize: regs subject: self ] ensure: [ regs free ]! searchRegex: pattern startingAt: anIndex | regs | regs := self searchRegexInternal: pattern from: anIndex to: self size. regs matchBeg = -1 ifTrue: [ regs free. ^nil ]. ^[ RegexResults new initialize: regs subject: self ] ensure: [ regs free ]! searchRegex: pattern from: from to: to | regs | regs := self searchRegexInternal: pattern from: from to: to. regs matchBeg = -1 ifTrue: [ regs free. ^nil ]. ^[ RegexResults new initialize: regs subject: self ] ensure: [ regs free ]! indexOfRegex: regexString ifAbsent: excBlock "Answer whether an occurrence of the regex is present in the receiver" | regs beg end | regs := self searchRegexInternal: regexString from: 1 to: self size. beg := regs matchBeg. end := regs matchEnd. regs free. ^beg >= 1 ifTrue: [ beg to: end ] ifFalse: [ excBlock value ] ! indexOfRegex: regexString startingAt: index ifAbsent: excBlock | regs beg end | regs := self searchRegexInternal: regexString from: index to: self size. beg := regs matchBeg. end := regs matchEnd. regs free. ^beg >= 1 ifTrue: [ beg to: end ] ifFalse: [ excBlock value ] ! indexOfRegex: regexString from: from to: to ifAbsent: excBlock | regs beg end | regs := self searchRegexInternal: regexString from: from to: to. beg := regs matchBeg. end := regs matchEnd. regs free. ^beg >= 1 ifTrue: [ beg to: end ] ifFalse: [ excBlock value ] ! indexOfRegex: regexString | regs beg end | regs := self searchRegexInternal: regexString from: 1 to: self size. beg := regs matchBeg. end := regs matchEnd. regs free. ^beg >= 1 ifTrue: [ beg to: end ] ifFalse: [ nil ] ! indexOfRegex: regexString startingAt: index | regs beg end | regs := self searchRegexInternal: regexString from: index to: self size. beg := regs matchBeg. end := regs matchEnd. regs free. ^beg >= 1 ifTrue: [ beg to: end ] ifFalse: [ nil ] ! indexOfRegex: regexString from: from to: to | regs beg end | regs := self searchRegexInternal: regexString from: from to: to. beg := regs matchBeg. end := regs matchEnd. regs free. ^beg >= 1 ifTrue: [ beg to: end ] ifFalse: [ nil ] ! matchRegex: pattern ^(self lengthOfRegexMatch: pattern from: 1 to: self size) = self size ! matchRegex: pattern startingAt: idx ^(self lengthOfRegexMatch: pattern from: idx to: self size) > 0 ! matchRegex: pattern from: from to: to ^(self lengthOfRegexMatch: pattern from: from to: to) = (to - from + 1) ! occurrencesOfRegex: pattern from: from to: to "Returns count of how many times pattern repeats in string" | res idx regex beg end regs | regex := pattern asRegex. res := 0. idx := from. [ regs := self searchRegexInternal: regex from: idx to: to. beg := regs matchBeg. end := regs matchEnd. regs free. beg >= 1 ] whileTrue: [ idx := end max: beg + 1. res := res + 1. ]. ^res ! occurrencesOfRegex: pattern startingAt: index "Returns count of how many times pattern repeats in string" ^self occurrencesOfRegex: pattern from: index to: self size. ! occurrencesOfRegex: pattern "Returns count of how many times pattern repeats in string" ^self occurrencesOfRegex: pattern from: 1 to: self size. ! copyFrom: from to: to replacingRegex: pattern with: str "Replaces first occurance of pattern with provided string" | regs beg end repl res | regs := self searchRegex: pattern from: from to: to. regs notNil ifTrue: [ beg := regs from. end := regs to. repl := str bindWithArguments: regs. res := self species new: (to - from) - (end - beg) + repl size. res replaceFrom: 1 to: beg - from with: self startingAt: from. res replaceFrom: beg - from + 1 to: beg - from + repl size with: repl. res replaceFrom: beg - from + repl size + 1 to: res size with: self startingAt: end - from + 2 ] ifFalse: [ res := self copyFrom: from to: to ]. ^res ! copyReplacingRegex: pattern with: str "Searches for pattern and replaces it with another string value" ^self copyFrom: 1 to: self size replacingRegex: pattern with: str ! copyFrom: from to: to replacingAllRegex: pattern with: str "Replaces all occurances of pattern between boundaries with specified string" | res idx regex beg end regs | regex := pattern asRegex. res := WriteStream on: (String new: to - from + 1). idx := from. [ regs := self searchRegex: regex from: idx to: to. beg >= 1 regs notNil ] whileTrue: [ beg := regs from. end := regs to. res next: beg - idx putAll: self startingAt: idx. res nextPutAll: (str bindWithArguments: regs). idx := end + 1. beg > end ifTrue: [ res nextPut: (self at: idx). idx := idx + 1 ]. idx > self size ifTrue: [ ^res contents ]. ]. res next: to - idx + 1 putAll: self startingAt: idx. ^res contents ! copyReplacingAllRegex: pattern with: str "Searches for pattern and replaces it with another string value" ^self copyFrom: 1 to: self size replacingAllRegex: pattern with: str ! onOccurrencesOfRegex: pattern from: from to: to do: body "Searches for pattern and executed passed instruction-body (as a trigger)" | idx regex beg end regs | regex := pattern asRegex. idx := from. [ regs := self searchRegexInternal: regex from: idx to: to. beg := regs matchBeg. end := regs matchEnd. regs free. beg >= 1 ] whileTrue: [ body value: beg value: end - beg + 1. idx := end + 1 max: beg + 1. ]. ! onOccurrencesOfRegex: pattern do: body "Searches for pattern and executed passed instruction-body (as a trigger)" ^self onOccurrencesOfRegex: pattern from: 1 to: self size do: body ! tokenize: pattern from: from to: to | res idx regex beg end regs tokStart | regex := pattern asRegex. res := WriteStream on: (Array new: 10). idx := from. tokStart := 1. [ regs := self searchRegexInternal: regex from: idx to: to. beg := regs matchBeg. end := regs matchEnd. regs free. beg >= 1 ] whileTrue: [ res nextPut: (self copyFrom: tokStart to: beg - 1). tokStart := end + 1. idx := beg + 1 max: end + 1. ]. res nextPut: (self copyFrom: tokStart to: to). ^res contents ! tokenizeFrom: from to: to ^self tokenize: '[\n\t ]+' from: from to: to ! tokenize: pattern ^self tokenize: pattern from: 1 to: self size ! tokenize ^self tokenize: '[\n\t ]+' from: 1 to: self size ! ! _______________________________________________ help-smalltalk mailing list help-smalltalk@xxxxxxx http://lists.gnu.org/mailman/listinfo/help-smalltalk

Next Message by Date: click to view message preview

Microsoft Special Deals

Opt-in Email Special Offer     unsubscribe me SEARCH Software TOP 10 NEW TITLES  ON SALE NOW! 1 Office Pro 2003 2 Windows XP Pro 3 Adobe Creative Suite Premium 4 Norton Antivirus 2005 5 Flash MX 2004 6 Corel Draw 12 7 Adobe Acrobat 7.0 8 Windows 2003 Server 9 Alias Maya 6 Wavefrt 10 Adobe Premiere  See more by this manufacturer   Microsoft   Apple Software  Customers also bought   these other items...Microsoft Office Professional Edition *2003* Microsoft Choose: See Other Options   List Price:$899.00 Price:$69.99 You Save:$830.01 (92%) Availability: Available for INSTANT download! Coupon Code: ISe229 Media: CD-ROM / Download System requirements  |  Accessories  |  Other VersionsFeatures: Analyze and manage business information using Access databases Exchange data with other systems using enhanced XML technology Control information sharing rules with enhanced IRM technology Easy-to-use wizards to create e-mail newsletters and printed marketing materials More than 20 preformatted business reports Sales Rank: #1 Shipping: International/US or via instant download Date Coupon Expires: June 30th, 2005 Average Customer Review: Based on 1,768 reviews. Write a review. Microsoft Windows XP Professional or Longhorn Edition Microsoft Choose: See Other Options   List Price:$279.00 Price:$49.99 You Save:$229.01 (85%) Availability: Available for INSTANT download! Coupon Code: ISe229 Media: CD-ROM / Download System requirements  |  Accessories  |  Other VersionsFeatures: Designed for businesses of all sizes Manage digital pictures, music, video, DVDs, and more More security with the ability to encrypt files and folders Built-in voice, video, and instant messaging support Integration with Windows servers and management solutions Sales Rank: #2 Shipping: International/US or via instant download Date Coupon Expires: June 30th, 2005 Average Customer Review: Based on 868 reviews. Write a review. Adobe Photoshop CS2 V 9.0 Adobe Choose: See Other Options   List Price: $599.00 Price:$69.99 You Save:$529.01 (90%) Availability: Available for INSTANT download! Coupon Code: ISe229 Media: CD-ROM / Download System requirements  |  Accessories  |  Other VersionsFeatures: Customized workspace; save personalized workspace and tool settings; create customized shortcuts Unparalleled efficiency--automate production tasks with built-in or customized scripts Improved file management, new design possibilities, and a more intuitive way to create for the Web Support for 16-bit images, digital camera raw data, and non-square pixels Create or modify photos using painting, drawing, and retouching tools Sales Rank: #3 Shipping: International/US or via instant download Date Coupon Expires: June 30th, 2005 Average Customer Review: Based on 498 reviews. Write a review. _______________________________________________ help-smalltalk mailing list help-smalltalk@xxxxxxx http://lists.gnu.org/mailman/listinfo/help-smalltalk

Previous Message by Thread: click to view message preview

Smalltalk MUD

Moin Guru's, i'm currently playing around with GNU Smalltalk, and the toy project is a Smalltalk MUD. A MUD is a multi user telnet server, where people can login, chat and interact on a ruleset in a given world. The people might be players, who can just use the world, builders who can extend the world but not change the rules and coders who can also change the rules. I've deceided for GST because of freedom and because GST does not require a GUI to run. My first try with inheriting from NetClients.NetServer failed badly, so I started with a striped down cut'n'paste of it. I'm currently stuck with the problem, that either input (FileStream>>next) or ServerSocket>>waitForConnection hangs. So I can telnet to the server type a line, perhaps two, but sequent lines are ignored because something hangs in process scheduling. I currently dont know, if I'm doing something completely wrong, or do I expect a feature that never been implemented: an accept/select loop to manage cooperative co-processing ? st> FileStream fileIn: 'SmallMUD.st'! st> MUD.MUDServer new port: 4321; start! 'register server socket' 'waiting for connection' telnet localhost 4321 - nothing happens on the gst screen, but st> 123! evaluting something, will yield the co-process 'accepting connection' 'waiting for connection' now typing something into telnet window does nothing, but st> 1! evaluting something, will yield the co-process '>$t' '>$e' '>$s' '>$t' '>$ ' '>$ ' st> Processor activeProcess suspend! now the console is gone, so i can no longer interact, but the behavoir does not improve much. I can login, type a line that is shown, perhaps also some more, but suddenly the console stops typing, till i login an other time to kick the waitForConnection co-process. Ok - here comes the code - its broken - but why ? " ------------------------------------------------------------------- MUD.MUDServer (c) 2005 Michael Koehne / GNU General Public License ------------------------------------------------------------------- " Object subclass: #MUDSocket instanceVariableNames: 'process socket' classVariableNames: 'priority' poolDictionaries:'TCP' category: 'MUD-Collection' ! MUDSocket subclass: #MUDServer instanceVariableNames: 'port' classVariableNames: 'servers' poolDictionaries:'TCP' category: 'MUD-Collection' ! MUDSocket subclass: #MUDClient instanceVariableNames: 'user' classVariableNames: 'clients' poolDictionaries:'TCP' category: 'MUD-Collection' ! !MUDSocket class methodsFor: 'initialization'! initialize priority := Processor highIOPriority. "userSchedulingPriority lowIOPriority" MUDServer initialize. MUDClient initialize ! ! !MUDServer class methodsFor: 'initialization'! initialize servers := Dictionary new ! ! !MUDClient class methodsFor: 'initialization'! initialize clients := Dictionary new ! ! !MUDSocket methodsFor: 'accessing'! priority ^ priority ! socket: s socket := s ! socket ^ socket ! process: p process := p ! process ^ process ! ! !MUDSocket methodsFor: 'logging'! log: s s printNl ! ! !MUDServer methodsFor: 'accessing'! servers ^ servers ! port: p port := p ! port ^ port ! name ^ 'listenTo:', port printString ! ! !MUDClient methodsFor: 'accessing'! clients ^ clients ! user: u user := u ! user ^ user ! name ^ 'client' ! ! !MUDSocket methodsFor: 'running'! start process := [ self run: self name ] forkAt: priority ! stop process notNil ifTrue: [ process terminate. process := nil. self finish ] ! run: aProcessName Processor activeProcess name: aProcessName. self run ! ! !MUDServer methodsFor: 'running'! run socket notNil ifTrue: [ ^ socket ]. self log: 'register server socket'. socket := ServerSocket port: port. servers at: port put: self. [ self log: 'waiting for connection'. socket waitForConnection. self log: 'accepting connection'. MUDClient new socket: socket accept; start. ] repeat. self finish ! finish servers removeKey: port. socket notNil ifTrue: [ self socket close ]. socket := nil. ! ! !MUDClient methodsFor: 'running'! run | s | clients at: socket put: self. [ s := socket next. s isNil ifTrue: [ ^ self finish ]. self log: '>', (s printString). ] repeat. self finish ! finish socket notNil ifTrue: [ clients removeKey: socket. socket close. ]. socket := nil. ! ! MUDSocket initialize! " ------------------------------------------------------------------- " bye Michael -- mailto:kraehe@xxxxxxxxxxx UNA:+.? 'CED+2+:::Linux:2.4.29'UNZ+1' http://www.xml-edifact.org/ CETERUM CENSEO WINDOWS ESSE DELENDAM

Next Message by Thread: click to view message preview

Re: IO and Process Scheduler

Moin Guru's, half way back - i've browsed the gst source again. I now think that Socket>>next and ServerSocket>>waitForConnection had been designed to work with process scheduler, by using the fileOp: 13 and 14 primitives before filling a buffer or waiting. Now fileOp: 14 is expected to install a signal handle (/me shivers about C signals - because C signals are evil) an gst is either losing a signal, or some other reason is blocking those methods. So I really run into a bug and will check older versions, if the bug disappears. > The alternate would be to provide a select() primitive. So > a MUD server is a single Smalltalk process implementing its > own scheduler. the alternate would still be usefull, because several designs wrap around the select loop, so I wonder why there is'nt any fileOp: like PRIM_MULTI_POLL using select and not signals to poll an array of FileStreams in addition to a FileStreams. ciao,Michael -- mailto:kraehe@xxxxxxxxxxx UNA:+.? 'CED+2+:::Linux:2.4.29'UNZ+1' http://www.xml-edifact.org/ CETERUM CENSEO WINDOWS ESSE DELENDAM