├── README.md ├── clojure ├── .gitignore ├── LICENSE ├── README.md ├── doc │ └── intro.md ├── project.clj ├── resources │ └── zsh_history ├── src │ └── noodle │ │ └── core.clj └── test │ └── noodle │ └── core_test.clj ├── files ├── expected.txt └── history.txt ├── go ├── README.md └── noodle.go ├── haskell ├── .gitignore ├── README.md └── main.hs ├── ruby └── noodle.rb └── shell └── noodle.sh /README.md: -------------------------------------------------------------------------------- 1 | noodle 2 | ====== 3 | 4 | On 12/13/13, thoughtbotters took a break from client work and paused for 5 | play. 6 | 7 | What started as a rudimentary zsh history analysis tool quickly became a 8 | kata, to be implemented in many languages so as to compare them. 9 | 10 | As a history analyzer, it's fairly useless. But as an excuse to play 11 | with new languages, it's just right. 12 | 13 | Feel free to noodle around. 14 | 15 | ## The Task 16 | 17 | * Accept lines of shell history on `stdin`. 18 | 19 | * Output the top *N* most costly lines where *N* is passed on the 20 | command-line and defaults to 10. 21 | 22 | * Cost is determined as command name length times number of occurrences. 23 | 24 | For example, you may call `ls` three times and `rake` twice. In this 25 | case, `rake` is more costly (4 * 2 = 8) even though it's called fewer 26 | times than `ls` (2 * 3 = 6). 27 | 28 | ## To Test an Implementation 29 | 30 | ``` 31 | $ diff ./files/expected.txt <(run-your-program < ./files/history.txt) 32 | ``` 33 | -------------------------------------------------------------------------------- /clojure/.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | /classes 3 | /checkouts 4 | pom.xml 5 | pom.xml.asc 6 | *.jar 7 | *.class 8 | /.lein-* 9 | /.nrepl-port 10 | -------------------------------------------------------------------------------- /clojure/LICENSE: -------------------------------------------------------------------------------- 1 | THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC 2 | LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM 3 | CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 4 | 5 | 1. DEFINITIONS 6 | 7 | "Contribution" means: 8 | 9 | a) in the case of the initial Contributor, the initial code and 10 | documentation distributed under this Agreement, and 11 | 12 | b) in the case of each subsequent Contributor: 13 | 14 | i) changes to the Program, and 15 | 16 | ii) additions to the Program; 17 | 18 | where such changes and/or additions to the Program originate from and are 19 | distributed by that particular Contributor. A Contribution 'originates' from 20 | a Contributor if it was added to the Program by such Contributor itself or 21 | anyone acting on such Contributor's behalf. Contributions do not include 22 | additions to the Program which: (i) are separate modules of software 23 | distributed in conjunction with the Program under their own license 24 | agreement, and (ii) are not derivative works of the Program. 25 | 26 | "Contributor" means any person or entity that distributes the Program. 27 | 28 | "Licensed Patents" mean patent claims licensable by a Contributor which are 29 | necessarily infringed by the use or sale of its Contribution alone or when 30 | combined with the Program. 31 | 32 | "Program" means the Contributions distributed in accordance with this 33 | Agreement. 34 | 35 | "Recipient" means anyone who receives the Program under this Agreement, 36 | including all Contributors. 37 | 38 | 2. GRANT OF RIGHTS 39 | 40 | a) Subject to the terms of this Agreement, each Contributor hereby grants 41 | Recipient a non-exclusive, worldwide, royalty-free copyright license to 42 | reproduce, prepare derivative works of, publicly display, publicly perform, 43 | distribute and sublicense the Contribution of such Contributor, if any, and 44 | such derivative works, in source code and object code form. 45 | 46 | b) Subject to the terms of this Agreement, each Contributor hereby grants 47 | Recipient a non-exclusive, worldwide, royalty-free patent license under 48 | Licensed Patents to make, use, sell, offer to sell, import and otherwise 49 | transfer the Contribution of such Contributor, if any, in source code and 50 | object code form. This patent license shall apply to the combination of the 51 | Contribution and the Program if, at the time the Contribution is added by the 52 | Contributor, such addition of the Contribution causes such combination to be 53 | covered by the Licensed Patents. The patent license shall not apply to any 54 | other combinations which include the Contribution. No hardware per se is 55 | licensed hereunder. 56 | 57 | c) Recipient understands that although each Contributor grants the licenses 58 | to its Contributions set forth herein, no assurances are provided by any 59 | Contributor that the Program does not infringe the patent or other 60 | intellectual property rights of any other entity. Each Contributor disclaims 61 | any liability to Recipient for claims brought by any other entity based on 62 | infringement of intellectual property rights or otherwise. As a condition to 63 | exercising the rights and licenses granted hereunder, each Recipient hereby 64 | assumes sole responsibility to secure any other intellectual property rights 65 | needed, if any. For example, if a third party patent license is required to 66 | allow Recipient to distribute the Program, it is Recipient's responsibility 67 | to acquire that license before distributing the Program. 68 | 69 | d) Each Contributor represents that to its knowledge it has sufficient 70 | copyright rights in its Contribution, if any, to grant the copyright license 71 | set forth in this Agreement. 72 | 73 | 3. REQUIREMENTS 74 | 75 | A Contributor may choose to distribute the Program in object code form under 76 | its own license agreement, provided that: 77 | 78 | a) it complies with the terms and conditions of this Agreement; and 79 | 80 | b) its license agreement: 81 | 82 | i) effectively disclaims on behalf of all Contributors all warranties and 83 | conditions, express and implied, including warranties or conditions of title 84 | and non-infringement, and implied warranties or conditions of merchantability 85 | and fitness for a particular purpose; 86 | 87 | ii) effectively excludes on behalf of all Contributors all liability for 88 | damages, including direct, indirect, special, incidental and consequential 89 | damages, such as lost profits; 90 | 91 | iii) states that any provisions which differ from this Agreement are offered 92 | by that Contributor alone and not by any other party; and 93 | 94 | iv) states that source code for the Program is available from such 95 | Contributor, and informs licensees how to obtain it in a reasonable manner on 96 | or through a medium customarily used for software exchange. 97 | 98 | When the Program is made available in source code form: 99 | 100 | a) it must be made available under this Agreement; and 101 | 102 | b) a copy of this Agreement must be included with each copy of the Program. 103 | 104 | Contributors may not remove or alter any copyright notices contained within 105 | the Program. 106 | 107 | Each Contributor must identify itself as the originator of its Contribution, 108 | if any, in a manner that reasonably allows subsequent Recipients to identify 109 | the originator of the Contribution. 110 | 111 | 4. COMMERCIAL DISTRIBUTION 112 | 113 | Commercial distributors of software may accept certain responsibilities with 114 | respect to end users, business partners and the like. While this license is 115 | intended to facilitate the commercial use of the Program, the Contributor who 116 | includes the Program in a commercial product offering should do so in a 117 | manner which does not create potential liability for other Contributors. 118 | Therefore, if a Contributor includes the Program in a commercial product 119 | offering, such Contributor ("Commercial Contributor") hereby agrees to defend 120 | and indemnify every other Contributor ("Indemnified Contributor") against any 121 | losses, damages and costs (collectively "Losses") arising from claims, 122 | lawsuits and other legal actions brought by a third party against the 123 | Indemnified Contributor to the extent caused by the acts or omissions of such 124 | Commercial Contributor in connection with its distribution of the Program in 125 | a commercial product offering. The obligations in this section do not apply 126 | to any claims or Losses relating to any actual or alleged intellectual 127 | property infringement. In order to qualify, an Indemnified Contributor must: 128 | a) promptly notify the Commercial Contributor in writing of such claim, and 129 | b) allow the Commercial Contributor tocontrol, and cooperate with the 130 | Commercial Contributor in, the defense and any related settlement 131 | negotiations. The Indemnified Contributor may participate in any such claim 132 | at its own expense. 133 | 134 | For example, a Contributor might include the Program in a commercial product 135 | offering, Product X. That Contributor is then a Commercial Contributor. If 136 | that Commercial Contributor then makes performance claims, or offers 137 | warranties related to Product X, those performance claims and warranties are 138 | such Commercial Contributor's responsibility alone. Under this section, the 139 | Commercial Contributor would have to defend claims against the other 140 | Contributors related to those performance claims and warranties, and if a 141 | court requires any other Contributor to pay any damages as a result, the 142 | Commercial Contributor must pay those damages. 143 | 144 | 5. NO WARRANTY 145 | 146 | EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON 147 | AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER 148 | EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR 149 | CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A 150 | PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the 151 | appropriateness of using and distributing the Program and assumes all risks 152 | associated with its exercise of rights under this Agreement , including but 153 | not limited to the risks and costs of program errors, compliance with 154 | applicable laws, damage to or loss of data, programs or equipment, and 155 | unavailability or interruption of operations. 156 | 157 | 6. DISCLAIMER OF LIABILITY 158 | 159 | EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY 160 | CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, 161 | SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION 162 | LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 163 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 164 | ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE 165 | EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY 166 | OF SUCH DAMAGES. 167 | 168 | 7. GENERAL 169 | 170 | If any provision of this Agreement is invalid or unenforceable under 171 | applicable law, it shall not affect the validity or enforceability of the 172 | remainder of the terms of this Agreement, and without further action by the 173 | parties hereto, such provision shall be reformed to the minimum extent 174 | necessary to make such provision valid and enforceable. 175 | 176 | If Recipient institutes patent litigation against any entity (including a 177 | cross-claim or counterclaim in a lawsuit) alleging that the Program itself 178 | (excluding combinations of the Program with other software or hardware) 179 | infringes such Recipient's patent(s), then such Recipient's rights granted 180 | under Section 2(b) shall terminate as of the date such litigation is filed. 181 | 182 | All Recipient's rights under this Agreement shall terminate if it fails to 183 | comply with any of the material terms or conditions of this Agreement and 184 | does not cure such failure in a reasonable period of time after becoming 185 | aware of such noncompliance. If all Recipient's rights under this Agreement 186 | terminate, Recipient agrees to cease use and distribution of the Program as 187 | soon as reasonably practicable. However, Recipient's obligations under this 188 | Agreement and any licenses granted by Recipient relating to the Program shall 189 | continue and survive. 190 | 191 | Everyone is permitted to copy and distribute copies of this Agreement, but in 192 | order to avoid inconsistency the Agreement is copyrighted and may only be 193 | modified in the following manner. The Agreement Steward reserves the right to 194 | publish new versions (including revisions) of this Agreement from time to 195 | time. No one other than the Agreement Steward has the right to modify this 196 | Agreement. The Eclipse Foundation is the initial Agreement Steward. The 197 | Eclipse Foundation may assign the responsibility to serve as the Agreement 198 | Steward to a suitable separate entity. Each new version of the Agreement will 199 | be given a distinguishing version number. The Program (including 200 | Contributions) may always be distributed subject to the version of the 201 | Agreement under which it was received. In addition, after a new version of 202 | the Agreement is published, Contributor may elect to distribute the Program 203 | (including its Contributions) under the new version. Except as expressly 204 | stated in Sections 2(a) and 2(b) above, Recipient receives no rights or 205 | licenses to the intellectual property of any Contributor under this 206 | Agreement, whether expressly, by implication, estoppel or otherwise. All 207 | rights in the Program not expressly granted under this Agreement are 208 | reserved. 209 | 210 | This Agreement is governed by the laws of the State of Washington and the 211 | intellectual property laws of the United States of America. No party to this 212 | Agreement will bring a legal action under this Agreement more than one year 213 | after the cause of action arose. Each party waives its rights to a jury trial 214 | in any resulting litigation. 215 | -------------------------------------------------------------------------------- /clojure/README.md: -------------------------------------------------------------------------------- 1 | To run: 2 | 3 | history 0 | lein run 4 | 5 | (output's legit.) 6 | -------------------------------------------------------------------------------- /clojure/doc/intro.md: -------------------------------------------------------------------------------- 1 | # Introduction to noodle 2 | 3 | TODO: write [great documentation](http://jacobian.org/writing/great-documentation/what-to-write/) 4 | -------------------------------------------------------------------------------- /clojure/project.clj: -------------------------------------------------------------------------------- 1 | (defproject noodle "0.1.0-SNAPSHOT" 2 | :description "FIXME: write description" 3 | :url "http://example.com/FIXME" 4 | :license {:name "Eclipse Public License" 5 | :url "http://www.eclipse.org/legal/epl-v10.html"} 6 | :dependencies [[org.clojure/clojure "1.5.1"]] 7 | :aot [noodle.core] 8 | :main noodle.core) 9 | -------------------------------------------------------------------------------- /clojure/resources/zsh_history: -------------------------------------------------------------------------------- 1 | 2577 gad 2 | 2578 gcm "Tests passing" 3 | 2579 gp 4 | 2580 g 5 | 2581 gad 6 | 2582 g 7 | 2583 gdc 8 | 2584 gad 9 | 2585 g 10 | 2586 gdc 11 | 2587 gcm "Add pretty printing and sorting" 12 | 2588 gp 13 | 2589 a 14 | 2590 repush 15 | 2591 aa 16 | 2592 a 17 | -------------------------------------------------------------------------------- /clojure/src/noodle/core.clj: -------------------------------------------------------------------------------- 1 | (ns noodle.core 2 | (:gen-class :main true)) 3 | 4 | (defn history-line->command 5 | "Returns the command from a zsh_history-style line" 6 | [line] 7 | (nth (clojure.string/split line #"\s+") 2)) 8 | 9 | (defn weight 10 | "Returns a number representing how much time you've spent typing a command" 11 | [command invocation-count] 12 | (* invocation-count (count command))) 13 | 14 | (defn sort-by-weight 15 | [m] 16 | (reverse (sort-by (partial apply weight) (vec m)))) 17 | 18 | (defn format-history-map 19 | [history-map] 20 | (letfn [(format-one [[command weight]] 21 | (format "%s: %d times\n" command weight))] 22 | (clojure.string/join (map format-one history-map)))) 23 | 24 | (defn format-history-lines 25 | [history-lines] 26 | (->> (map history-line->command history-lines) 27 | (frequencies) 28 | (sort-by-weight) 29 | (take 10) 30 | (format-history-map))) 31 | 32 | (defn -main 33 | "Prints the top 10 most-costly commands and their frequencies" 34 | [] 35 | (-> 36 | *in* 37 | java.io.BufferedReader. 38 | line-seq 39 | format-history-lines 40 | print) 41 | (flush)) 42 | -------------------------------------------------------------------------------- /clojure/test/noodle/core_test.clj: -------------------------------------------------------------------------------- 1 | (ns noodle.core-test 2 | (:require [clojure.test :refer :all] 3 | [noodle.core :refer :all])) 4 | 5 | (deftest parser 6 | (testing "Parsing a line from zsh_history into a command" 7 | (is (= "cd" (history-line->command " 10 cd foo\n"))))) 8 | 9 | (deftest printer 10 | (testing "Pretty-printing the commands with their weights" 11 | (is (= "cd: 4 times\nrake: 3 times\nzsh: 1 times\n" (format-history-map { "zsh" 1 "rake" 3 "cd" 4 }))))) 12 | 13 | (deftest sorter 14 | (testing "Sorting the results by weight" 15 | (is (= (vector ["ls" 8] ["rake" 2] ["zsh" 2]) 16 | (sort-by-weight { "rake" 2 "ls" 8 "zsh" 2 }))))) 17 | 18 | (def history 19 | [" 130 ls", 20 | " 131 ls foo/", 21 | " 131 ls", 22 | " 131 ls", 23 | " 131 ls src/", 24 | " 131 ls", 25 | " 131 ls", 26 | " 131 ls", 27 | " 173 rake", 28 | " 183 rake", 29 | " 190 zsh", 30 | " 191 zsh"]) 31 | 32 | (deftest format-history-lines-test 33 | (testing "Formatting the seq of history lines" 34 | (is (= "ls: 8 times\nrake: 2 times\nzsh: 2 times\n" 35 | (format-history-lines history))))) 36 | -------------------------------------------------------------------------------- /files/expected.txt: -------------------------------------------------------------------------------- 1 | git: 9 times 2 | vim: 4 times 3 | nano: 2 times 4 | killall: 1 times 5 | screen: 1 times 6 | pgrep: 1 times 7 | rm: 1 times 8 | be: 1 times 9 | -------------------------------------------------------------------------------- /files/history.txt: -------------------------------------------------------------------------------- 1 | 1 screen -S chi 2 | 2 git checkout -b pb-pry-rails 3 | 3 git commit -am 'Add pry-rails' 4 | 4 git push -u origin pb-pry-rails 5 | 5 git checkout -b pb-add-date-sent 6 | 6 nano vimrc 7 | 7 nano ~/.vimrc 8 | 8 pgrep vim 9 | 9 killall -9 vim 10 | 10 git grep date_received 11 | 11 git commit -m 'Add date_sent' 12 | 12 git push -u origin pb-add-date-sent 13 | 13 git checkout -b pb-coverage-fixups 14 | 14 rm -r app/validators/email_validator.rb 15 | 15 vim app/helpers/search_helper.rb 16 | 16 vim spec/models/risk_ 17 | 17 vim spec/models/risk_trigger_spec.rb 18 | 18 vim spec/models/notice_search_result_spec.rb 19 | 19 be rake SPEC_OPTS=--no-drb 20 | 20 git push -u origin pb-coverage-fixups 21 | -------------------------------------------------------------------------------- /go/README.md: -------------------------------------------------------------------------------- 1 | # Noodle in Go 2 | 3 | From the `noodle` repo's root directory: 4 | 5 | ```bash 6 | $ cd go/ 7 | $ history 0 | go run noodle.go 8 | $ diff ../files/expected.txt <(go run noodle.go < ../files/history.txt) 9 | ``` 10 | -------------------------------------------------------------------------------- /go/noodle.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import ( 4 | "fmt" 5 | "bufio" 6 | "io" 7 | "os" 8 | "strings" 9 | "sort" 10 | "math" 11 | "strconv" 12 | ) 13 | 14 | type sortedCommands struct { 15 | counts map[string]int 16 | order []string 17 | } 18 | 19 | func (commands *sortedCommands) Len() int { 20 | return len(commands.counts) 21 | } 22 | 23 | func (commands *sortedCommands) Less(i, j int) bool { 24 | return weight(commands.order[i], commands.counts[commands.order[i]]) > weight(commands.order[j], commands.counts[commands.order[j]]) 25 | } 26 | 27 | func (commands *sortedCommands) Swap(i, j int) { 28 | commands.order[i], commands.order[j] = commands.order[j], commands.order[i] 29 | } 30 | 31 | func sortCommands(counts map[string]int) sortedCommands { 32 | commands := new(sortedCommands) 33 | commands.counts = counts 34 | commands.order = make([]string, len(counts)) 35 | i := 0 36 | for key, _ := range counts { 37 | commands.order[i] = key 38 | i++ 39 | } 40 | sort.Sort(commands) 41 | 42 | return *commands 43 | } 44 | 45 | func weight(name string, count int) int { 46 | return len(name) * count 47 | } 48 | 49 | func readCounts(reader io.Reader) map[string]int { 50 | counts := make(map[string]int) 51 | scanner := bufio.NewScanner(reader) 52 | 53 | for scanner.Scan() { 54 | words := strings.Fields(scanner.Text()) 55 | 56 | if len(words) >= 2 { 57 | command := words[1] 58 | counts[command]++ 59 | } 60 | } 61 | 62 | return counts 63 | } 64 | 65 | func printSorted(commands sortedCommands) { 66 | for _, command := range commands.order { 67 | count := commands.counts[command] 68 | fmt.Printf("%s: %d times\n", command, count) 69 | } 70 | } 71 | 72 | func main() { 73 | counts := readCounts(os.Stdin) 74 | commands := sortCommands(counts) 75 | 76 | lim := 10 77 | args := os.Args 78 | 79 | if len(args) >= 2 { 80 | lim, _ = strconv.Atoi(args[1]) 81 | } 82 | 83 | lim = int(math.Min(float64(lim), float64(len(commands.order)))) 84 | 85 | commands.order = commands.order[0:lim] 86 | 87 | printSorted(commands) 88 | } 89 | -------------------------------------------------------------------------------- /haskell/.gitignore: -------------------------------------------------------------------------------- 1 | main 2 | main.o 3 | main.hi 4 | -------------------------------------------------------------------------------- /haskell/README.md: -------------------------------------------------------------------------------- 1 | # Noodle in Haskell 2 | 3 | ``` 4 | $ history 0 | ./main.hs 5 | ``` 6 | -------------------------------------------------------------------------------- /haskell/main.hs: -------------------------------------------------------------------------------- 1 | module Main where 2 | 3 | import Data.Function (on) 4 | import Data.List (sort) 5 | import Data.Either (rights) 6 | import System.Environment (getArgs) 7 | import Text.Parsec 8 | import Text.Parsec.String 9 | 10 | import qualified Data.Map as M 11 | 12 | data CommandCount = CommandCount String Int deriving Eq 13 | 14 | instance Show CommandCount where 15 | show (CommandCount command count) = 16 | command ++ ": " ++ show count ++ " times" 17 | 18 | instance Ord CommandCount where 19 | compare = compare `on` weight 20 | 21 | main :: IO () 22 | main = do 23 | lim <- fmap (readFirstOr 10) getArgs 24 | 25 | mapM_ print . top lim . counts . parseInput =<< getContents 26 | 27 | where 28 | readFirstOr v [] = v 29 | readFirstOr _ (x:_) = read x 30 | 31 | parseInput :: String -> [String] 32 | parseInput = rights . map parseLine . lines 33 | 34 | parseLine :: String -> Either ParseError String 35 | parseLine = parse lineParser "(stdin)" 36 | 37 | lineParser :: Parser String 38 | lineParser = do 39 | many1 $ char ' ' 40 | many1 digit 41 | many1 $ char ' ' 42 | commandName <- many1 $ noneOf " " 43 | many anyChar 44 | return commandName 45 | 46 | counts :: [String] -> [CommandCount] 47 | counts = map (uncurry CommandCount) . M.toList . countsMap 48 | 49 | weight :: CommandCount -> Int 50 | weight (CommandCount command count) = count * (length command) 51 | 52 | top :: Ord a => Int -> [a] -> [a] 53 | top n = take n . reverse . sort 54 | 55 | countsMap :: (Num a, Ord k) => [k] -> M.Map k a 56 | countsMap = foldr increment M.empty 57 | 58 | increment :: (Num a, Ord k) => k -> M.Map k a -> M.Map k a 59 | increment c = M.insertWith (+) c 1 60 | -------------------------------------------------------------------------------- /ruby/noodle.rb: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env ruby 2 | 3 | invocation_counts = STDIN.inject(Hash.new(0)) do |counts, invocation| 4 | if inv = invocation.strip.split(/\s+/)[1] 5 | counts[inv] += 1 6 | end 7 | counts 8 | end 9 | 10 | invocation_counts 11 | .sort_by { |invocation, count| -1 * invocation.length * count } 12 | .take((ARGV[0] || 10).to_i) 13 | .each { |invocation, count| puts "#{invocation}: #{count} times" } 14 | -------------------------------------------------------------------------------- /shell/noodle.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | awk '{ print $2 }' \ 3 | | sort \ 4 | | uniq -c \ 5 | | awk '{ printf "%d|%s: %d times\n", ($1 * length($2)), $2, $1 }' \ 6 | | sort -rn \ 7 | | cut -d '|' -f 2- \ 8 | | head -n "${1-10}" 9 | --------------------------------------------------------------------------------