1 ! Copyright (C) 2008 Doug Coleman.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors fry html.parser html.parser.analyzer
4 http.client kernel tools.time sets assocs sequences
5 concurrency.combinators io threads namespaces math multiline
6 math.parser inspector urls logging combinators.short-circuit
7 continuations calendar prettyprint dlists deques locals ;
10 TUPLE: spider base count max-count sleep max-depth initial-links
11 filters spidered todo nonmatching quiet currently-spidering
12 #threads follow-robots ;
14 TUPLE: spider-result url depth headers
15 fetched-in parsed-html links processed-in fetched-at ;
17 TUPLE: todo-url url depth ;
19 : <todo-url> ( url depth -- todo-url )
24 TUPLE: unique-deque assoc deque ;
26 : <unique-deque> ( -- unique-deque )
27 H{ } clone <dlist> unique-deque boa ;
29 : url-exists? ( url unique-deque -- ? )
30 [ url>> ] [ assoc>> ] bi* key? ;
32 : push-url ( url depth unique-deque -- )
33 [ <todo-url> ] dip 2dup url-exists? [
36 [ [ [ t ] dip url>> ] [ assoc>> ] bi* set-at ]
37 [ deque>> push-back ] 2bi
40 : pop-url ( unique-deque -- todo-url ) deque>> pop-front ;
42 : peek-url ( unique-deque -- todo-url ) deque>> peek-front ;
44 : <spider> ( base -- spider )
48 over >>currently-spidering
49 swap 0 <unique-deque> [ push-url ] keep >>todo
50 <unique-deque> >>nonmatching
59 : apply-filters ( links spider -- links' )
60 filters>> [ '[ [ _ 1&& ] filter ] call( seq -- seq' ) ] when* ;
62 : push-links ( links level unique-deque -- )
63 '[ _ _ push-url ] each ;
65 : add-todo ( links level spider -- )
68 : add-nonmatching ( links level spider -- )
69 nonmatching>> push-links ;
71 : filter-base-links ( spider spider-result -- base-links nonmatching-links )
72 [ base>> host>> ] [ links>> prune ] bi*
73 [ host>> = ] with partition ;
75 : add-spidered ( spider spider-result -- )
76 [ [ 1+ ] change-count ] dip
77 2dup [ spidered>> ] [ dup url>> ] bi* rot set-at
78 [ filter-base-links ] 2keep
81 [ tuck [ apply-filters ] 2dip add-todo ] 2bi ;
83 : normalize-hrefs ( base links -- links' )
84 [ derive-url ] with map ;
86 : print-spidering ( url depth -- )
87 "depth: " write number>string write
88 ", spidering: " write . yield ;
90 :: new-spidered-result ( spider url depth -- spider-result )
91 f url spider spidered>> set-at
92 [ url http-get ] benchmark :> fetch-time :> html :> headers
95 spider currently-spidering>>
96 over find-all-links normalize-hrefs
97 ] benchmark :> processing-time :> links :> parsed-html
98 url depth headers fetch-time parsed-html links processing-time
99 now spider-result boa ;
101 :: spider-page ( spider url depth -- )
102 spider quiet>> [ url depth print-spidering ] unless
103 spider url depth new-spidered-result :> spidered-result
104 spider quiet>> [ spidered-result describe ] unless
105 spider spidered-result add-spidered ;
107 \ spider-page ERROR add-error-logging
109 : spider-sleep ( spider -- ) sleep>> [ sleep ] when* ;
111 : queue-initial-links ( spider -- )
113 [ currently-spidering>> ] [ initial-links>> ] bi normalize-hrefs 0
116 : spider-page? ( spider -- ? )
118 [ todo>> deque>> deque-empty? not ]
119 [ [ todo>> peek-url depth>> ] [ max-depth>> ] bi < ]
120 [ [ count>> ] [ max-count>> ] bi < ]
123 : setup-next-url ( spider -- spider url depth )
124 dup todo>> peek-url url>> >>currently-spidering
125 dup todo>> pop-url [ url>> ] [ depth>> ] bi ;
127 : spider-next-page ( spider -- )
128 setup-next-url spider-page ;
132 : run-spider-loop ( spider -- )
134 [ spider-next-page ] [ spider-sleep ] [ run-spider-loop ] tri
139 : run-spider ( spider -- spider )
141 dup queue-initial-links [ run-spider-loop ] keep