pax_global_header00006660000000000000000000000064122043405060014506gustar00rootroot0000000000000052 comment=a4668c3961f7f54fdb02e4ba7d83081218d9bb35 scout-0.1.1/000077500000000000000000000000001220434050600126425ustar00rootroot00000000000000scout-0.1.1/.gitignore000066400000000000000000000001621220434050600146310ustar00rootroot00000000000000/target /lib /classes /checkouts /doc pom.xml *.jar *.class .lein-deps-sum .lein-failures .lein-plugins .DS_Store scout-0.1.1/LICENSE000066400000000000000000000257641220434050600136650ustar00rootroot00000000000000Eclipse Public License - v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents" mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor tocontrol, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of Washington and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. scout-0.1.1/README.md000066400000000000000000000062221220434050600141230ustar00rootroot00000000000000# Scout Scout is a library for scanning through strings in a functional way. There are many great parser libraries in Clojure, but I wrote Scout to process text without having to fully parse it, either because the text format made that difficult, or it would have been overkill for that particular task. For example, it is used for parsing the mustache templates in the [Stencil](http://github.com/davidsantiago/stencil) library. The key object in Scout is a Scanner object, which is an immutable object associated with the string it is scanning and a position within that string. There are two ways to make a Scanner: either create a new one using the `scanner` function, or use a Scout function to create a new Scanner as the result of a search from a previous Scanner. If a Scanner is created as the result of a successful search, it will contain a third piece of data, an object with information about the parts of the string it matched and any regular expression groups that were assigned as part of the match. Since Scanners are immutable, you can easily start any number of searches from a given Scanner and refer back to Scanner objects from earlier in the parsing process. ## Usage [API Reference](http://davidsantiago.github.com/scout) Suppose we wish to search a string for an emoticon. One way to do this would be ```clojure user=> (require '[scout.core :as scout]) nil user=> (-> (scout/scanner "Hi there. :)") (scout/scan-until #":-?([()PD])")) #scout.core.Scanner{:src "Hi there. :)", :curr-loc 12, :match #scout.core.MatchInfo{:start 10, :end 12, :groups [":)" ")"]}} ``` Here we used the `scan-until` function to search the string for the next occurence of the regular expression we gave it. It found a match at the end of the string, and returns a new scanner at position 12, which is just past the end of the string (So `scout.core/end?` will return true on the returned Scanner). Since there was a successful match, there is an associated MatchInfo object telling us that the match started at character 10, and ended at character 12, with the groups the regular expression matched. The first group is always the entire matching string, so that is ":)", and any following match groups will be the ordered matches of the groups in the regular expression (from left to right). In this case, the group we specified to catch the mouth of the emoticon matched ")". Now we can grab that information and figure out if the emoticon is happy: ```clojure user=> (-> (scout/scanner "Hi there. :-)") (scout/scan-until #":-?([()PD])") (scout/groups) (nth 1) {")" :happy, "(" :sad, "P" :sad, "D" :happy}) :happy ``` There are many more functions in Scout to help you parse, including functions to scan for a match only at a given position, look ahead, find pieces of the string before and after a match, skip to the beginning of a match, and more. Check the [API Reference](http://davidsantiago.github.com/scout) for the details. ## Obtaining Add [scout "0.1.1"] to the `:dependencies` key of your Leiningen project map. ## License Copyright © 2012 David Santiago Distributed under the Eclipse Public License, the same as Clojure. scout-0.1.1/project.clj000066400000000000000000000006611220434050600150050ustar00rootroot00000000000000(defproject scout "0.1.1" :description "Functional string searching and matching for parsing." :url "http://example.com/FIXME" :license {:name "Eclipse Public License" :url "http://www.eclipse.org/legal/epl-v10.html"} :dependencies [[org.clojure/clojure "1.3.0"]] :plugins [[codox "0.6.1"]] :codox {:src-dir-uri "http://github.com/davidsantiago/scout/blob/master/" :src-linenum-anchor-prefix "L"}) scout-0.1.1/src/000077500000000000000000000000001220434050600134315ustar00rootroot00000000000000scout-0.1.1/src/scout/000077500000000000000000000000001220434050600145665ustar00rootroot00000000000000scout-0.1.1/src/scout/core.clj000066400000000000000000000145621220434050600162200ustar00rootroot00000000000000(ns scout.core (:refer-clojure :exclude [peek]) (:import java.util.regex.Matcher)) (defrecord MatchInfo [start ;; Start index of a match. end ;; End index of a match. groups]) ;; Vector of groups. (defrecord Scanner [src ;; String to be matched. curr-loc ;; Current location in string. ^MatchInfo match]) ;; Information about the last match. (defn scanner "Create a Scanner from a string. If the optional integer second argument is provided, it sets the scanner's current position to that index. If the optional third argument is provided, it must be a MatchInfo data structure which will be used as the scanner's latest match info." ([source-string] (scanner source-string 0 nil)) ([source-string pos] (scanner source-string pos nil)) ([source-string pos match] (Scanner. source-string pos match))) (defn ^{:private true} re-groups-vec "Clojure's re-groups will return a plain string if there is only one match in the group. Really inconvenient for what we're doing, so here's a similar function that always returns a vector of strings." [^Matcher m] (let [groupCount (.groupCount m)] (loop [result (transient []) i 0] (if (<= i groupCount) (recur (conj! result (.group m i)) (inc i)) (persistent! result))))) (defn match-info ([^Matcher matcher] (match-info (.start matcher) (.end matcher) (re-groups-vec matcher))) ([start end] (match-info start end nil)) ([start end groups] (MatchInfo. start end groups))) ;; ;; Positional information. These functions act on a Scanner and return ;; the requested values. ;; (defn position "Returns the current position in the string (an integer index)." [^Scanner scanner] (:curr-loc scanner)) (defn beginning-of-line? "Return true if the current position is the beginning of a line." [^Scanner scanner] (let [curr-loc (:curr-loc scanner)] (or (= 0 curr-loc) (= \newline (get (:src scanner) (dec curr-loc)))))) (defn end? "Return true if the current position is the end of the input string." [^Scanner scanner] (>= (:curr-loc scanner) (count (:src scanner)))) (defn remainder "Return what remains of the string after the scan pointer." [^Scanner scanner] (let [src (:src scanner)] (subs src (min (:curr-loc scanner) (count src))))) (defn groups "Return the groups from the last match. Remember that the first group will be the complete match." [^Scanner scanner] (get-in scanner [:match :groups])) (defn matched "Return the last matched string." [^Scanner scanner] (first (groups scanner))) (defn pre-match "Return the 'pre-match' of the last scan. This is the part of the input before the beginning of the match." [^Scanner scanner] (let [match (:match scanner)] (if match (subs (:src scanner) 0 (:start match))))) (defn post-match "Return the 'post-match' of the last scan. This is the part of the input after the end of the last match." [^Scanner scanner] (let [match (:match scanner)] (if match (subs (:src scanner) (:end match))))) ;; ;; Scanning/Advancing. These functions advance the scan pointer, returning a ;; Scanner object with the new configuration. ;; (defn scan "Match pattern starting at current location. On match, advances the current location and puts the matched string in result. Otherwise, just returns the same scanner, minus any previous match data." [^Scanner s pattern] (let [src (:src s) ;; Need to set the region to restrict the window the matcher ;; looks at to start at the current position. matcher (.region (re-matcher pattern src) (position s) (count src)) match-result (if (.lookingAt matcher) matcher)] (if match-result (let [mi (match-info matcher) matched-string (first (:groups mi))] (scanner src (+ (position s) (count matched-string)) mi)) (assoc s :match nil)))) (defn scan-until "Match pattern at any point after the current location. On match, advances the current location to the end of the match, and puts just the matching part in the match info. Otherwise, just returns the same scanner, minus any previous match data." [^Scanner s pattern] (let [src (:src s) matcher (.region (re-matcher pattern src) (position s) (count src)) match-result (if (.find matcher) matcher)] (if match-result (let [mi (match-info matcher)] (scanner src (:end mi) mi)) ;; Remove the match data from the input scanner, since we failed to match. (assoc s :match nil)))) (defn skip-to-match-start "Match pattern at any point after the current location. On match, advances the current location to the beginning of the match, so that a subsequent scan with the same pattern will succeed. Matched pattern is stored in the result. Otherwise, just returns the same scanner, minus any previous match data." [^Scanner s pattern] (let [src (:src s) scan-result (scan-until s pattern) matched-string (matched scan-result)] ;; Note: scan-until may have failed, but the calculation below should work. (scanner src (- (position scan-result) (count matched-string)) (:match scan-result)))) ;; ;; Looking ahead. These functions tell you about what is further ahead in ;; the string. Return the answers instead of a new Scanner. ;; (defn check "Returns what scan would return as its result." [^Scanner s pattern] (matched (scan s pattern))) (defn check-until "Returns what scan-until would return as its match." [^Scanner s pattern] (matched (scan-until s pattern))) (defn check-until-inclusive "Returns the string between the scanner's starting position and the end of what scan-until would match." [^Scanner s pattern] (let [start-pos (position s)] (subs (:src s) start-pos (position (scan-until s pattern))))) (defn peek "Returns the string containing the next n characters after current location." [^Scanner s n] (let [remainder (remainder s)] (subs remainder 0 (min n (count remainder))))) scout-0.1.1/test/000077500000000000000000000000001220434050600136215ustar00rootroot00000000000000scout-0.1.1/test/scout/000077500000000000000000000000001220434050600147565ustar00rootroot00000000000000scout-0.1.1/test/scout/test/000077500000000000000000000000001220434050600157355ustar00rootroot00000000000000scout-0.1.1/test/scout/test/core.clj000066400000000000000000000160251220434050600173630ustar00rootroot00000000000000(ns scout.test.core (:use clojure.test) (:require [scout.core :as scout])) ;; ;; Information access tests. ;; (deftest test-position (is (= 0 (scout/position (scout/scanner "")))) (is (= 0 (scout/position (scout/scanner "test")))) (is (= 1 (scout/position (scout.core.Scanner. "test" 1 nil))))) (deftest test-beginning-of-line? (is (= true (scout/beginning-of-line? (scout/scanner "")))) (is (= true (scout/beginning-of-line? (scout/scanner "test")))) (is (= false (scout/beginning-of-line? (scout.core.Scanner. "test\r\ntest" 5 nil)))) (is (= true (scout/beginning-of-line? (scout.core.Scanner. "test\r\ntest" 6 nil))))) (deftest test-end? (is (= true (scout/end? (scout/scanner "")))) (is (= false (scout/end? (scout/scanner "test"))))) (deftest test-remainder (is (= "test" (scout/remainder (scout/scanner "test")))) (is (= "" (scout/remainder (scout/scanner "")))) (is (= "" (scout/remainder (scout.core.Scanner. "test" 4 nil)))) (is (= "" (scout/remainder (scout.core.Scanner. "test" 5 nil))))) (deftest test-groups (is (= ["m"] (scout/groups (scout/scanner "test" 0 (scout/match-info 0 1 ["m"])))))) (deftest test-matched (is (= "m" (scout/matched (scout/scanner "test" 0 (scout/match-info 0 1 ["m"])))))) (deftest test-pre-match (is (= "beginn" (scout/pre-match (scout/scanner "beginning" 9 (scout/match-info 6 8 ["in"]))))) (is (= "test" (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan #"\s+") scout/pre-match)))) (deftest test-post-match (is (= "ning" (scout/post-match (scout/scanner "beginning" 5 (scout/match-info 3 5 ["in"]))))) (is (= "string" (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan #"\s+") scout/post-match)))) ;; ;; Scanning/Advancing tests. ;; (deftest test-scan (is (= "t" (-> (scout/scanner "test") (scout/scan #"t") scout/matched))) (is (= 1 (-> (scout/scanner "test") (scout/scan #"t") scout/position))) (is (= "test" (-> (scout/scanner "test") (scout/scan #"test") scout/matched))) (is (scout/end? (scout/scan (scout/scanner "test") #"test"))) (is (= ["t"] (-> (scout/scanner "test-string") (scout/scan #"t") scout/groups))) ;; Compounded scans should work. (is (= 5 (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan #"\s+") scout/position))) (is (= 4 (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan #"\s+") (get-in [:match :start])))) (is (= 5 (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan #"\s+") (get-in [:match :end])))) ;; Failing to match shoud leave us in the same position (is (= 0 (scout/position (scout/scan (scout/scanner "testgoal") #"notinthestring")))) ;; Failing to match should remove pre-existing match data. (is (= nil (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan #"notinthestring") (get :match))))) (deftest test-scan-until (is (= "goal" (-> (scout/scanner "testgoal") (scout/scan-until #"goal") scout/matched))) (is (= 8 (-> (scout/scanner "testgoal") (scout/scan-until #"goal") scout/position))) (is (= "goal" (-> (scout/scanner "goal") (scout/scan-until #"goal") scout/matched))) (is (scout/end? (scout/scan-until (scout/scanner "goal") #"goal"))) (is (scout/end? (scout/scan-until (scout/scanner "testgoal") #"goal"))) (is (= ["s"] (-> (scout/scanner "test string") (scout/scan-until #"s") scout/groups))) ;; Compounded scan-untils should work. (is (= 8 (-> (scout/scanner "test string") (scout/scan-until #"s") (scout/scan-until #"r") scout/position))) (is (= 7 (-> (scout/scanner "test string") (scout/scan-until #"s") (scout/scan-until #"r") (get-in [:match :start])))) (is (= 8 (-> (scout/scanner "test-string") (scout/scan-until #"s") (scout/scan-until #"r") (get-in [:match :end])))) ;; Failing to match should leave us in the same position. (is (= 0 (-> (scout/scanner "testgoal") (scout/scan-until #"notinthestring") scout/position))) ;; Failing to match should remove pre-existing match data. (is (= nil (-> (scout/scanner "test string") (scout/scan #"test") (scout/scan-until #"notinthestring") (get :match))))) (deftest test-skip-to-match-start (is (= "goal" (-> (scout/scanner "testgoal") (scout/skip-to-match-start #"goal") scout/matched))) (is (= 4 (-> (scout/scanner "testgoal") (scout/skip-to-match-start #"goal") scout/position))) (is (= "goal" (-> (scout/scanner "goal") (scout/skip-to-match-start #"goal") scout/matched))) ;; Calling scan on result of skip-to-match-start should work. (is (= "goal" (-> (scout/scanner "testgoal") (scout/skip-to-match-start #"goal") (scout/scan #"goal") scout/matched))) (is (-> (scout/scanner "testgoal") (scout/skip-to-match-start #"goal") (scout/scan #"goal") scout/end?)) ;; Failing to match should leave us in the same position. (is (= 0 (-> (scout/scanner "testgoal") (scout/skip-to-match-start #"yes") scout/position))) ;; Failing to match should remove pre-existing match data. (is (= nil (-> (scout/scanner "test string") (scout/scan #"test") (scout/skip-to-match-start #"notinthestring") (get :match))))) ;; ;; Look-ahead tests. ;; (deftest test-check (is (= "t" (scout/check (scout/scanner "test") #"t"))) (is (= "test" (scout/check (scout/scanner "test") #"test")))) (deftest test-check-until (is (= "goal" (scout/check-until (scout/scanner "testgoal") #"goal"))) (is (= "goal" (scout/check-until (scout/scanner "goal") #"goal")))) (deftest test-check-until-inclusive (is (= "testgoal" (scout/check-until-inclusive (scout/scanner "testgoal") #"goal"))) (is (= "goal" (scout/check-until-inclusive (scout/scanner "goal") #"goal")))) (deftest test-peek (is (= "t" (scout/peek (scout/scanner "test") 1))) (is (= "test" (scout/peek (scout/scanner "test") 4))) (is (= "test" (scout/peek (scout/scanner "test") 500))))