Buyers:
Sign Up -
Create Project -
Manage Account -
Sign Out
Freelancers:
Sign Up -
Manage Account -
Sign Out
General:
View Open Projects -
Find A Project -
Send Message -
About
| Status: | Open |
| Budget: | N/A |
| Created: | 9/15/2005at 10:19 (EST) |
| Bidding Ends: | 10/15/2005at 10:19 (EST) (expired) |
| Project Creator: | seetec
Rating: (No Feedback Yet) |
| Description: |
A subroutine is required to detect the presence of chess and game phrases within a website. This is a PERL, WGet, FreeBSD project. However, minimal experience of WGet is required and Linux is sufficiently similar for testing and development. The envisioned operating system is FreeBSD for no other reason than it being free, relatively secure and hardware portable. The envisioned programming language is PERL because it is part of the FreeBSD base install and therefore always present on this platform. WGet is also part of the FreeBSD base install. Your code will analyse a WGet mirror of an affiliate website. Mirroring will be limited to 10MB. This generates a directory structure partially mirroring the website. The mirroring is performed by the main code. Then your subroutine will be called with the path to the directory and an array of arrays of regexes to search. Return variables should be one array of totals for each set of regexes and a total page count excluding multimedia. An example of input would be &find("/tmp/www.site.dom",[["chess","knight","pawns?"],["checkers"],["monopoly","pass go","community chest"]],\$$count,\$total) and upon return $$count may contain [20,0,0] and $total may contain 22. Recursion may be required. Use the enclosed subroutine or your own recursion to perform the task. Use of global variables is acceptable. |
| Job Type: |
PERL |
| Years of Experience: | Less Than 1 Year |
| Geographic Location: | United States |
| Language: | English |
| Programmers | Bid ![]() |
Delivery Within | Time of Bid | |