From: Tj Superfly on
Theoretically yes, but that wouldn't be efficient because ultimately the
goal is to find ones that are not yet posted on the site.

--
Posted via http://www.ruby-forum.com/.

From: Robert Klemme on
2008/6/29 Tj Superfly <nonstickglue(a)verizon.net>:
> Okay, why not! Here's what I'm trying to do.
>
> The website has urls for all their pet images, each having one of the
> random combination's inside of it. As such:
>
> http://pets.neopets.com/cp/rbm2vqzv/1/2.png
>
> So, basically I want to create some sort of list / program that searches
> though them and tells me if they exist or not, so I can see new pets
> when they are eventually uploaded.
>
> P.S. That's where I got random generation, because each url is random,
> but I guess ultimately my list is 'complete' so, sorry about that.

IMHO a far better approach is to crawl the site and record all image
URL's (they must linked somewhere) and note the difference to last
visit. This will put less load on the target server and be generally
faster than trying all possible combinations.

Kind regards

robert

--
use.inject do |as, often| as.you_can - without end