30 Dec
2010
30 Dec
'10
2:15 p.m.
http://rosettacode.org/wiki/Search_a_list#Smalltalk
<http://rosettacode.org/wiki/Search_a_list#Smalltalk>Smalltalk<http://rosettacode.org/wiki/Category:Smalltalk>
*Works with*: GNU Smalltalk <http://rosettacode.org/wiki/GNU_Smalltalk>
Smalltalk indexes start at 1.
| haystack |
haystack :=
'Zig,Zag,Wally,Ronald,Bush,Krusty,Charlie,Bush,Bozo' subStrings: $,.
{ 'Washington' . 'Bush' } do: [:i|
|t l|
t := (haystack indexOf: i).
(t = 0) ifTrue: [ ('%1 is not in the haystack' % { i }) displayNl ]
ifFalse: [ ('%1 is at index %2' % { i . t }) displayNl.
l := ( (haystack size) - (haystack reverse
indexOf: i) + 1 ).
( t = l ) ifFalse: [
('last occurence of %1 is at index %2' %
{ i . l }) displayNl ]
]
].
On Wed, Dec 29, 2010 at 1:39 PM, Zhe-Xi Lim <limzhexi(a)hotmail.com> wrote:
Hi,
I would like to know if there is a search engine or information retrieval
algorithms written in Smalltalk available. If there is such a routine in
Smalltalk, could you show it to me?
Thanks.
Zhe-Xi
--
View this message in context:
http://forum.world.st/Search-Engine-Algorithms-tp3167338p3167338.html
Sent from the Moose mailing list archive at Nabble.com.
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
Saludos cordiales,
Guillermo Schwarz
Sun Certified Enterprise Architect