wikipedia-client 1.0.0

data/lib/wikipedia/url.rb

@@ -0,0 +1,14 @@
+module Wikipedia
+  class Url
+    def initialize(wiki_url)
+      @wiki_url = wiki_url
+    end
+    
+    def title
+      return @title if @title
+      
+      uri     = URI.parse( @wiki_url )
+      @title  = URI.decode( uri.path.split('/').last )
+    end
+  end
+end

data/script/add_sanitization_test

@@ -0,0 +1,22 @@
+#!/usr/bin/env ruby
+
+$LOAD_PATH.unshift File.join(File.dirname(__FILE__), "..", "lib")
+require "wikipedia"
+
+SANITIZATION_SAMPLE_PATH = File.join(File.dirname(__FILE__), "..", "spec", "fixtures", "sanitization_samples")
+
+def add_sanitization_test(url)
+  title = Wikipedia::Url.new(url).title
+  page = Wikipedia.find(title, :rvsection => 0)
+  File.open(File.join(SANITIZATION_SAMPLE_PATH, "#{title}-raw.txt"), 'w') {|f| f << page.content }
+  File.open(File.join(SANITIZATION_SAMPLE_PATH, "#{title}-sanitized.txt"), 'w') {|f| f << page.sanitized_content }
+end
+
+if __FILE__ == $0
+  unless ARGV.size == 1
+    puts "Usage: #{$0} http://en.wikipedia.org/wiki/Social_Democratic_Party_of_Kyrgyzstan"
+    exit 0
+  end
+  url = ARGV[0]
+  add_sanitization_test(url)
+end

data/spec/fixtures/Edsger_Dijkstra.json

@@ -0,0 +1 @@
+{"query":{"pages":{"10018":{"pageid":10018,"ns":0,"title":"Edsger W. Dijkstra","revisions":[{"*":"{{Infobox_Scientist\n| name                    = Edsger Wybe Dijkstra\n| image                   = Edsger Wybe Dijkstra.jpg\n| image_width             = 150px\n| caption                 = \n| birth_date              = {{Birth date|1930|05|11}}\n| birth_place             = [[Rotterdam]], [[Netherlands]]\n| death_date              = {{death date and age|2002|8|6|1930|05|11}}\n| death_place             = [[Nuenen]], [[Netherlands]]\n| residence               = \n| citizenship             =\n| nationality             = \n| ethnicity               =\n| field                   = [[Computer science]]\n| work_institutions       = [[Centrum Wiskunde & Informatica|Mathematisch Centrum]]<br>[[Eindhoven University of Technology]]\n<br>[[University of Texas at Austin|The University of Texas at Austin]]\n| alma_mater              = \n| doctoral_advisor        = [[Adriaan van Wijngaarden]]\n| doctoral_students       =  [[Nico Habermann]]<\/br>[[Martin Rem]]<\/br>[[David Naumann]]<\/br>[[Cornelis Hemerik]]<\/br>[[Jan Tijmen Udding]]<\/br>[[Jan L. A. van de Snepscheut|Johannes van de Snepscheut]]<\/br>[[Antonetta van Gasteren]]\n| known_for               = [[Dijkstra's algorithm]]<br>[[Structured programming]]<br>[[THE multiprogramming system]]<br>[[Semaphore (programming)|Semaphore]]\n| prizes                  = [[Turing Award]]<br>[[Association for Computing Machinery]]\n| footnotes               = \n}}\n'''Edsger Wybe Dijkstra''' (May 11, 1930 \u2013 August 6, 2002; {{IPA-nl|\u02c8\u025btsx\u0259r \u02c8wib\u0259 \u02c8d\u025b\u026akstra|-|Dijkstra.ogg}}) was a [[Netherlands|Dutch]] [[computer science|computer scientist]]. He received the 1972  [[Turing Award]]  for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The [[University of Texas at Austin]] from 1984 until 2000.\n\nShortly before his death in 2002, he received the [[Association for Computing Machinery|ACM]] PODC Influential Paper Award in distributed computing for his work on [[self-stabilization]] of program computation. This annual award was renamed the [[Dijkstra Prize]] the following year, in his honour.\n\n==Life and work==\nBorn in [[Rotterdam, Netherlands]], Dijkstra studied [[theoretical physics]] at [[Leiden University]], but quickly realized he was more interested in computer science.\nOriginally employed by the [[Centrum Wiskunde & Informatica|Mathematisch Centrum]] in Amsterdam, he held a professorship at the [[Eindhoven University of Technology]], worked as a research fellow for [[Burroughs Corporation]] in the early 1970s, and later held the Schlumberger Centennial Chair in Computer Sciences at the [[University of Texas at Austin]], in the United States. He retired in 2000.\n\nAmong his contributions to computer science are the ''[[shortest path problem|shortest path]]-[[algorithm]]'', also known as ''[[Dijkstra's algorithm]]''; ''[[Reverse Polish Notation]]'' and related ''[[Shunting yard algorithm]]''; the [[THE multiprogramming system]], an important early example of structuring a system as a set of layers; ''[[Banker's algorithm]]''; and the [[Semaphore (programming)|semaphore]] construct for coordinating multiple processors and programs. Another concept due to Dijkstra in the field of distributed computing is that of [[self-stabilization]] &ndash; an alternative way to ensure the reliability of the system. Dijkstra's algorithm is used in SPF, [[Shortest Path First]], which is used in the routing protocol OSPF, [[Open Shortest Path First]].\n\nWhile he had programmed extensively in machine code in the 1950s, he was known for his low opinion of the [[GOTO]] statement in [[computer programming]], writing a paper in 1965, and culminating in the 1968 article \"[http:\/\/www.cs.utexas.edu\/users\/EWD\/transcriptions\/EWD02xx\/EWD215.html A Case against the GO TO Statement]\" (EWD215), regarded as a major step towards the widespread deprecation of the [[GOTO]] statement and its effective replacement by [[control structures|structured control constructs]], such as the [[while loop]]. This methodology was also called [[structured programming]], the title of his 1972 book, coauthored with [[C.A.R. Hoare]] and [[Ole-Johan Dahl]]. The March 1968 ACM letter's famous title, \"Go To Statement [[considered harmful|Considered Harmful]]\",<small><ref name=\"goto\">\n   \"Go To Statement [[considered harmful|Considered Harmful]]\",\n   ''Communications of the ACM'', Vol. 11, No. 3,\n   March 1968, pp. 147-148.\n<\/ref><\/small> was not the work of Dijkstra, but of [[Niklaus Wirth]], then editor of ''[[Communications of the ACM]]''. Dijskra also strongly opposed the teaching of [[BASIC]],<ref>{{citation|title=How do we tell truths that might hurt?|date=18 June 1975|url=http:\/\/www.cs.virginia.edu\/~evans\/cs655-S00\/readings\/ewd498.html}}<\/ref> a language whose programs are typically GOTO-laden.\n\nDijkstra was known to be a fan of [[ALGOL|ALGOL 60]], and worked on the team that implemented the first [[compiler]] for that language. Dijkstra and [[Jaap Zonneveld]], who collaborated on the compiler, agreed not to shave until the project was completed.\n\nDijkstra wrote two important papers in 1968, devoted to the structure of a multiprogramming operating system called [[THE multiprogramming system|THE]], and to [[Co-operating Sequential Processes]].\n\nFrom the 1970s, Dijkstra's chief interest was [[formal verification]]. The prevailing opinion at the time was that one should first write a program and then provide a [[mathematical proof]] of [[correctness]]. Dijkstra objected noting that the resulting proofs are long and cumbersome, and that the proof gives no insight on how the program was developed. An alternative method is ''[[program derivation]]'', to \"develop proof and program hand in hand\". One starts with a mathematical ''specification'' of what a program is supposed to do and applies mathematical transformations to the specification until it is turned into a program that can be executed. The resulting program is then known to be ''correct by construction''. Much of Dijkstra's later work concerns ways to streamline mathematical argument. In a 2001 interview,<ref>http:\/\/video.google.com\/videoplay?docid=-6873628658308030363<\/ref> he stated a desire for \"elegance\", whereby the correct approach would be to process thoughts mentally, rather than attempt to render them until they are complete. The analogy he made was to contrast the compositional approaches of [[Wolfgang Amadeus Mozart|Mozart]] and [[Ludwig van Beethoven|Beethoven]].\n\nDijkstra was one of the early pioneers in the field of distributed computing. In particular, his paper \"Self-stabilizing Systems in Spite of Distributed Control\" started the sub-field of [[self-stabilization]].\n\nMany of his opinions on computer science and programming have become widespread. For example, he is famed for coining the popular programming phrase \"two or more, use a for,\" alluding to the rule of thumb that when you find yourself processing more than one instance of a data structure, it is time to consider encapsulating that logic inside a loop. He was the first to make the claim that programming is so inherently complex that, in order to manage it successfully, programmers need to harness every trick and abstraction possible. When expressing the abstract nature of computer science, he once said, \"computer science is no more about computers than astronomy is about telescopes.\" \n\nHe died in [[Nuenen]], [[Netherlands]] on August 6, 2002 after a long struggle with [[cancer]]. The following year, the ACM ([[Association for Computing Machinery]]) PODC Influential Paper Award in distributed computing was renamed the [[Dijkstra Prize]] in his honour.\n\n== EWDs and writing by hand ==\n{{Close paraphrase|section|date=April 2009}}\nDijkstra was known for his habit of carefully composing manuscripts with his fountain pen. The manuscripts are called EWDs, since Dijkstra numbered them with ''EWD'', his initials, as a prefix. According to Dijkstra himself, the EWDs started when he moved from the Mathematical Centre in Amsterdam to the Technological University (then TH) Eindhoven. After going to the TUE Dijkstra experienced a writer's block for more than a year. Looking closely at himself he realized that if he wrote about things they would appreciate at the MC in Amsterdam his colleagues in Eindhoven would not understand; if he wrote about things they would like in Eindhoven, his former colleagues in Amsterdam would look down on him. He then decided to write only for himself, and in this way the EWD's were born. Dijkstra would distribute photocopies of a new EWD among his colleagues; as many recipients photocopied and forwarded their copy, the EWDs spread throughout the international computer science community. The topics were computer science and mathematics, and included trip reports, letters, and speeches.  More than 1300 EWDs have since been scanned, with a growing number transcribed to facilitate search, and are available online at the Dijkstra archive of the University of Texas.<ref>University of Texas [http:\/\/www.cs.utexas.edu\/users\/EWD\/  online EWD archive].<\/ref>\n\nOne of Dijkstra's sidelines was serving as [[Board of directors|Chairman of the Board]] of the fictional Mathematics Inc., a company that he imagined having [[commercialized]] the production of mathematical [[theorems]] in the same way that software companies had commercialized the production of computer programs. He invented a number of activities and challenges of Mathematics Inc. and documented them in several papers in the EWD series. The imaginary company had produced a proof of the [[Riemann Hypothesis]] but then had great difficulties collecting [[royalties]] from mathematicians who had proved results assuming the Riemann Hypothesis. The proof itself was a [[trade secret]] (EWD 475). Many of the company's proofs were rushed out the door and then much of the company's effort had to be spent on [[Software maintenance|maintenance]] (EWD 539). A more successful effort was the Standard Proof for [[Pythagoras' Theorem]], that replaced the more than 100 incompatible existing proofs (EWD427). Dijkstra described Mathematics Inc. as \"the most exciting and most miserable business ever conceived\" (EWD475). He claimed that by 1974 his fictional company was the world's leading mathematical industry with more than 75 percent of the world market (EWD443).<ref>\n{{cite book | last = Dijkstra | first = Edsger W. | title = Selected Writings on Computing: A Personal Perspective | publisher = Springer-Verlag | location = Berlin | year = 1982 | isbn = 9780387906522 }}\n<\/ref>\n\nHaving invented much of the technology of software, Dijkstra eschewed the use of computers in his own work for many decades.  Almost all EWDs appearing after 1972 were hand-written. When lecturing, he would write proofs in chalk on a blackboard rather than using overhead foils, let alone Powerpoint slides. Even after he succumbed to his UT colleagues\u2019 encouragement and acquired a [[Macintosh]] computer, he used it only for e-mail and for browsing the World Wide Web.<ref name = \"UTx\">University of Texas, [http:\/\/www.utexas.edu\/faculty\/council\/2002-2003\/memorials\/Dijkstra\/dijkstra.html \"In Memoriam Edsger Wybe Dijkstra.\"]<\/ref>\n\n==Awards and honors==\nAmong Dijkstra's awards and honours are:<ref name = \"UTx\"\/>\n* Member of the [[Royal Netherlands Academy of Arts and Sciences]] (1971)\n* Distinguished Fellow of the [[British Computer Society]] (1971)\n* The [[Association for Computing Machinery]]'s A.M. [[ACM Turing Award|Turing Award]] (1972)\n* Foreign Honorary Member of the [[American Academy of Arts and Sciences]] (1975)\n* Doctor of Science [[Honoris Causa]] from the [[Queen's University Belfast]] (1976)\n* Computer Pioneer Charter Recipient from the [[IEEE Computer Society]] (1982)\n* Honorary doctorate from the [[Athens University of Economics & Business]], Greece (2001).\n\n==See also==\n* [[Dijkstra's algorithm]]\n* [[Smoothsort]]\n* [[Dining philosophers problem]]\n* \"[[The Cruelty of Really Teaching Computer Science]]\"\n* [[Semaphore (programming)|Semaphore]]\n\n==Footnotes==\n{{reflist}}\n==References==\n===Writings by E.W. Dijkstra===\n* {{cite journal |last=Dijkstra |first=E. W. |title=Letters to the editor: go to statement considered harmful |journal=[[Communications of the ACM]] |volume=11 |issue=3 |month=March |year=1968 |pages=147&ndash;148 |issn=0001-0782 |doi=10.1145\/362929.362947 }} (EWD215)\n\n* {{cite journal|url=http:\/\/www.cs.utexas.edu\/~EWD\/transcriptions\/EWD03xx\/EWD340.html\n|title=The Humble Programmer\n|last=Dijkstra |first=E. W.\n|journal=[[Communications of the ACM]]\n|volume=15\n|issue=10\n|year=1972\n|month=Aug\n|pages=859\u2013866|doi=10.1145\/355604.361591\n}} (EWD340) [http:\/\/www.cs.utexas.edu\/~EWD\/ewd03xx\/EWD340.PDF PDF], 1972 [[ACM Turing Award]] lecture\n\n* {{cite journal |last=Dijkstra |first=E. W. |title=How do we tell truths that might hurt? |url=http:\/\/www.cs.virginia.edu\/~evans\/cs655\/readings\/ewd498.html |journal=[[SIGPLAN|SIGPLAN Notice]] |volume=17 |issue=5 |month=May |year=1982 |pages=13&ndash;15 |issn=0362-1340 |doi=10.1145\/947923.947924 }} (EWD498)\n\n<!-- I found this copy of the above paper with a copyright notice in it at\nhttp:\/\/www.cs.utexas.edu\/users\/EWD\/ewd04xx\/EWD498.PDF, so I don't think that the set of quotes should be lifted from it. Bubba73 -->\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/transcriptions\/EWD11xx\/EWD1166.html ''From My Life'' (EWD1166)]\n* Dijkstra, E.W. (August 1975), ''Guarded commands, nondeterminacy and formal derivation of program''. ''[[Communications of the ACM]]'', 18(8):453\u2013457. [http:\/\/doi.acm.org\/10.1145\/360933.360975]\n* Dijkstra, E.W. (1976), ''A Discipline of Programming'', Prentice-Hall Series in Automatic Computation, ISBN 0-13-215871-X \u2014 A systematic introduction to a version of the guarded command language with many worked examples\n* ''Selected Writings on Computing: A Personal Perspective'', Texts and Monographs in Computer Science, Springer-Verlag, 1982, ISBN 0-387-90652-5\n* ''A Method of Programming'', E.W. Dijkstra, W.H.J. Feijen, J. Sterringa, Addison Wesley 1988, ISBN 0-201-17536-3\n* E. W. Dijkstra and [[Carel S. Scholten]] (1990). ''Predicate Calculus and Program Semantics''. Springer-Verlag ISBN 0-387-96957-8 \u2014 An abstract, formal treatment of [[Predicate transformer semantics]]\n*[[Ole-Johan Dahl|O.-J. Dahl]], [[Edsger W. Dijkstra]], [[C. A. R. Hoare]] ''Structured Programming'', Academic Press, London, 1972 ISBN 0-12-200550-3\n**this volume includes an expanded version of the ''Notes on Structured Programming'', including an extended example of using the structured approach to develop a backtracking algorithm to solve the [[Eight queens puzzle|8 Queens problem]].\n**[http:\/\/portal.acm.org\/citation.cfm?id=1243380&jmp=cit&coll=portal&dl=GUIDE&CFID=:\/\/www.acm.org\/publications\/&CFTOKEN=www.acm.org\/publications\/#CIT a pdf version of this book is available in the ACM Classic Books Series]\n**[http:\/\/s1.webstarts.com\/ACaseForAgentsEDUpaper\/uploads\/scimakelatex_2400_Dr__Douglas_C__Engelbart__Edsger_W__Dijkstra_Stephen_A__Dymarcik_II_Peter_Naur_.pdf]\n\n===Others about Dijkstra, eulogies===\n* [http:\/\/web.archive.org\/web\/20041206193322\/www.digidome.nl\/edsger_wybe_dijkstra.htm Biography] Digidome\n* [http:\/\/homepages.cwi.nl\/~apt\/ps\/dijkstra.pdf ''Edsger Wybe Dijkstra (1930\u20132002): A Portrait of a Genius''] ([[Portable Document Format|PDF]]) Obituary in ''[[Formal Aspects of Computing]]'' with a short biography\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/memorial\/gries.html ''How can we explain Edsger W. Dijkstra to those who didn't know him?''] by David Gries\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/memorial\/moore.html Dijkstra Eulogy] by J Strother Moore\n* [http:\/\/www.cs.rutgers.edu\/~szegedy\/dijkstra.html In Memoriam Edsger Wybe Dijkstra] by Mario Szegedy\n* [http:\/\/www.adeptis.ru\/vinci\/m_part7.html Photos of Edsger Dijkstra]\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/misc\/vanVlissingenInterview.html 1985 Interview with Edsger Dijkstra, which he considered the best of his life]\n\n==External links==\n{{wikiquote}}\n* [http:\/\/www.cbi.umn.edu\/oh\/display.phtml?id=320 Oral history interview with Edsger W. Dijkstra],  [[Charles Babbage Institute]] University of Minnesota, Minneapolis. Dijkstra recounts his early education and training as a theoretical physicist and as a 'programmer'. Dijkstra describes his work developing software, and his activities at several early information processing conferences. Dijkstra discusses the development of [[ALGOL 60]], [[Dijkstra's algorithm]], [[THE multiprogramming system]].  Comments on such figures as [[Adriaan_van_Wijngaarden|Aad van Wijngaarden]], [[Gerrit Blaauw]], [[F.L. Bauer]], [[Peter Naur]], [[Tony Hoare]], [[Niklaus Wirth]], [[Alan Perlis]].  Compares the origins of computing science in Europe and America.  Oral history interview 2001.\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/ E. W. Dijkstra Archive]\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/video-audio\/NoorderlichtVideo.html Noorderlicht: Discipline in Thought] Video interview, 2001-04-10\n**[http:\/\/noorderlicht.vpro.nl\/afleveringen\/3502225\/ original here], only in Dutch, bandwidth options\n<!-- * [[Luca Cardelli]]'s [http:\/\/www.luca.demon.co.uk\/Fonts\/Pc\/Dijkstra.zip Font of Dijkstra's Handwriting] -->\n* [http:\/\/www.speechpedia.org\/EdsgerDijkstra\/1996\/12\/08\/Edsger-Dijkstras-Convocation-Speech\/ Edsger Dijkstra's Convocation Speech]\n\n{{Turing award}}\n{{Software Engineering}}\n\n{{Persondata\n|NAME=Dijkstra, Edsger\n|ALTERNATIVE NAMES=\n|SHORT DESCRIPTION=Dutch mathematician\n|DATE OF BIRTH={{birth date|1930|5|11|mf=y}}\n|PLACE OF BIRTH=[[Rotterdam]]\n|DATE OF DEATH={{death date|2002|8|6|mf=y}}\n|PLACE OF DEATH=[[Nuenen]], [[Netherlands]]\n}}\n{{DEFAULTSORT:Dijkstra, Edsger}}\n[[Category:1930 births]]\n[[Category:2002 deaths]]\n[[Category:Computer pioneers]]\n[[Category:Dutch computer scientists]]\n[[Category:Dutch physicists]]\n[[Category:Eindhoven University of Technology faculty]]\n[[Category:Fellows of the Association for Computing Machinery]]\n[[Category:Fellows of the British Computer Society]]\n[[Category:Formal methods people]]\n[[Category:Leiden University alumni]]\n[[Category:Members of IFIP Working Group 2.1]]\n[[Category:People from Rotterdam]]\n[[Category:Programming language designers]]\n[[Category:Programming language researchers]]\n[[Category:Researchers in distributed computing]]\n[[Category:Software engineers]]\n[[Category:Software engineering researchers]]\n[[Category:Turing Award laureates]]\n[[Category:University of Texas at Austin faculty]]\n\n[[ast:Edsger Dijkstra]]\n[[bn:\u098f\u099f\u09cd\u200c\u09b8\u0996\u09be\u09b0 \u09a1\u09c7\u0987\u0995\u09cd\u200c\u09b8\u09cd\u099f\u09cd\u09b0\u09be]]\n[[bs:Edsger Dijkstra]]\n[[bg:\u0415\u0434\u0441\u0445\u0435\u0440 \u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0430]]\n[[ca:Edsger Dijkstra]]\n[[cs:Edsger Dijkstra]]\n[[da:Edsger Dijkstra]]\n[[de:Edsger Wybe Dijkstra]]\n[[et:Edsger Wybe Dijkstra]]\n[[el:\u0388\u03bd\u03c4\u03c3\u03b3\u03ba\u03b5\u03c1 \u039d\u03c4\u03ac\u03b9\u03ba\u03c3\u03c4\u03c1\u03b1]]\n[[es:Edsger Dijkstra]]\n[[eo:Edsger Dijkstra]]\n[[fa:\u0627\u062f\u0633\u062e\u0631 \u062f\u06cc\u06a9\u0633\u062a\u0631\u0627]]\n[[fr:Edsger Dijkstra]]\n[[ga:Edsger Dijkstra]]\n[[ko:\uc5d0\uce20\ud5c8\ub974 \ub370\uc774\ud06c\uc2a4\ud2b8\ub77c]]\n[[hr:Edsger Dijkstra]]\n[[id:Edsger Dijkstra]]\n[[it:Edsger Dijkstra]]\n[[he:\u05d0\u05d3\u05e1\u05d7\u05e8 \u05d3\u05d9\u05d9\u05e7\u05e1\u05d8\u05e8\u05d4]]\n[[lb:Edsger W. Dijkstra]]\n[[hu:Edsger Wybe Dijkstra]]\n[[ml:\u0d0e\u0d21\u0d4d\u0d17\u0d7c \u0d21\u0d48\u0d15\u0d4d\u0d38\u0d4d\u0d1f\u0d4d\u0d30\u0d3e]]\n[[mr:\u090f\u0921\u094d\u0938\u0917\u0930 \u0921\u093f\u0915\u094d\u0938\u094d\u091f\u094d\u0930\u093e]]\n[[nl:Edsger Dijkstra]]\n[[ja:\u30a8\u30c9\u30ac\u30fc\u30fb\u30c0\u30a4\u30af\u30b9\u30c8\u30e9]]\n[[no:Edsger Dijkstra]]\n[[pl:Edsger Dijkstra]]\n[[pt:Edsger Dijkstra]]\n[[ro:Edsger Dijkstra]]\n[[ru:\u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0430, \u042d\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0431\u0435]]\n[[sk:Edsger Wybe Dijkstra]]\n[[sr:\u0415\u0434\u0441\u0445\u0435\u0440 \u0414\u0430\u0458\u043a\u0441\u0442\u0440\u0430]]\n[[fi:Edsger Dijkstra]]\n[[sv:Edsger Dijkstra]]\n[[tr:Edsger Dijkstra]]\n[[uk:\u0415\u0434\u0441\u0433\u0435\u0440 \u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0430]]\n[[vi:Edsger Dijkstra]]\n[[zh:\u827e\u5179\u683c\u00b7\u8fea\u6770\u65af\u7279\u62c9]]"}],"links":[{"ns":0,"title":"ACM Turing Award"},{"ns":0,"title":"ALGOL"},{"ns":0,"title":"ALGOL 60"},{"ns":0,"title":"Adi Shamir"},{"ns":0,"title":"Adriaan van Wijngaarden"},{"ns":0,"title":"Agile software development"},{"ns":0,"title":"Alan Kay"},{"ns":0,"title":"Alan Perlis"},{"ns":0,"title":"Algorithm"},{"ns":0,"title":"Allen Newell"}],"images":[{"ns":6,"title":"File:Copyright-problem.svg"},{"ns":6,"title":"File:Dijkstra.ogg"},{"ns":6,"title":"File:Edsger Wybe Dijkstra.jpg"},{"ns":6,"title":"File:Speaker Icon.svg"},{"ns":6,"title":"File:Wikiquote-logo-en.svg"}],"categories":[{"ns":14,"title":"Category:1930 births"},{"ns":14,"title":"Category:2002 deaths"},{"ns":14,"title":"Category:All pages needing cleanup"},{"ns":14,"title":"Category:Articles needing cleanup from April 2009"},{"ns":14,"title":"Category:Articles with close paraphrasing from April 2009"},{"ns":14,"title":"Category:Computer pioneers"},{"ns":14,"title":"Category:Dutch computer scientists"},{"ns":14,"title":"Category:Dutch physicists"},{"ns":14,"title":"Category:Eindhoven University of Technology faculty"},{"ns":14,"title":"Category:Fellows of the Association for Computing Machinery"}]}}},"query-continue":{"links":{"plcontinue":"10018|0|American Academy of Arts and Sciences"},"categories":{"clcontinue":"10018|Fellows of the British Computer Society"}}}

data/spec/fixtures/Edsger_Dijkstra.yaml

@@ -0,0 +1,184 @@
+---
+query: 
+  pages: 
+    - 
+      pageid: 10018
+      ns: 0
+      title: Edsger W. Dijkstra
+      revisions: 
+        - 
+          *: |
+            {{Infobox_Scientist
+            | name                    = Edsger Wybe Dijkstra
+            | image                   =
+            | image_width             = 150px
+            | caption                 =
+            | birth_date              = {{Birth date|1930|05|11}}
+            | birth_place             = [[Rotterdam]], [[Netherlands]]
+            | death_date              = {{death date and age|2002|8|6|1930|05|11}}
+            | death_place             = [[Nuenen]], [[Netherlands]]
+            | residence               =
+            | citizenship             =
+            | nationality             =
+            | ethnicity               =
+            | field                   = [[Computer science]]
+            | work_institutions       = [[National Research Institute for Mathematics and Computer Science|Mathematisch Centrum]]<br>[[University of Texas at Austin|The University of Texas at Austin]]
+            | alma_mater              =
+            | doctoral_advisor        =
+            | doctoral_students       =
+            | known_for               = [[Dijkstra's algorithm]]<br>''[[Goto|Goto Considered Harmful]]''<ref name=goto/><br>[[THE multiprogramming system]]<br>[[Semaphore (programming)|Semaphore]]
+            | prizes                  = [[Turing Award]]<br>[[Association for Computing Machinery]]
+            | religion                =
+            | footnotes               =
+            }}
+            '''Edsger Wybe Dijkstra''' ([[May 11]], [[1930]] &ndash; [[August 6]], [[2002]]; {{pronounced|ˈɛtsxər ˈwibə ˈdɛɪkstra}}) was a [[Netherlands|Dutch]] [[computer science|computer scientist]]. He received the 1972 [[Turing Award|A. M. Turing Award]] for fundamental contributions in the area of programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at [[University of Texas at Austin|The University of Texas at Austin]] from 1984 until 2000.
+            
+            Shortly before his death in 2002, he received the [[Association for Computing Machinery|ACM]] PODC Influential Paper Award in distributed computing for his work in the subarea of [[self-stabilization]]. This annual award was renamed the [[Dijkstra Prize]] the following year, in his honour.
+            
+            ==Life and work==
+            Born in [[Rotterdam]], Dijkstra studied [[Physics|theoretical physics]] at [[Leiden University]], but he quickly realized he was more interested in computer science.
+            
+            Originally employed by the [[National Research Institute for Mathematics and Computer Science|Mathematisch Centrum]] in Amsterdam, he held a professorship at the [[Eindhoven University of Technology]] in the Netherlands, worked as a research fellow for [[Burroughs Corporation]] in the early 1970s, and later held the Schlumberger Centennial Chair in Computer Sciences at [[The University of Texas at Austin]], in the United States. He retired in 2000.
+            
+            Among his contributions to computer science is the ''[[shortest path problem|shortest path]]-[[algorithm]]'', also known as ''[[Dijkstra's algorithm]]'', ''[[Reverse Polish Notation]]'' and related ''[[Shunting yard algorithm]]'', the [[THE (operating system)|THE multiprogramming system]], ''[[Banker's algorithm]]'', the concept of [[Ring (computer security)|operating system rings]] and the [[Semaphore (programming)|semaphore]] construct, for coordinating multiple processors and programs. Another concept due to Dijkstra in the field of distributed computing is that of [[self-stabilization]] &ndash; an alternative way to ensure the reliability of the system. Dijkstra's algorithm is used in SPF, [[Shortest Path First]], which is used in the routing protocol OSPF, [[Open Shortest Path First]].
+            
+            He was also known for his low opinion of the [[GOTO]] statement in [[computer programming]], writing a paper in 1965, and culminating in the 1968 article "[http://www.cs.utexas.edu/users/EWD/transcriptions/EWD02xx/EWD215.html A Case against the GO TO Statement]" (EWD215), regarded as a major step towards the widespread deprecation of the [[GOTO]] statement and its effective replacement by [[control structures|structured control constructs]], such as the [[while loop]]. This methodology was also called [[structured programming]]. The March 1968 ACM letter's famous title, "Go To Statement [[considered harmful|Considered Harmful]]",
+            <small><ref name="goto">
+            "Go To Statement [[considered harmful|Considered Harmful]]",
+            ''Communications of the ACM'', Vol. 11, No. 3,
+            March 1968, pp. 147-148.
+            </ref></small>
+            was not the work of Dijkstra, but of [[Niklaus Wirth]], then editor of ''[[Communications of the ACM]]''. Dijkstra was known to be a fan of [[ALGOL|ALGOL 60]], and worked on the team that implemented the first [[compiler]] for that language. Dijkstra and [[Jaap Zonneveld]], who collaborated on the compiler, agreed not to shave until the project was completed. Zonneveld eventually shaved off his beard; Dijkstra kept his until his death.
+            
+            He also wrote two important papers in 1968, devoted to the structure of the multiprogramming systems and to cooperating sequential processes.
+            
+            He is famed for coining the popular programming phrase "2 or more, use a for", alluding to the fact that when you find yourself processing more than one instance of a data structure, it is time to encapsulate that logic inside a loop.
+            
+            From the 1970s, Dijkstra's chief interest was [[formal verification]]. The prevailing opinion at the time was that one should first write a program and then provide a [[mathematical proof]] of [[correctness]]. Dijkstra objected that the resulting proofs are long and cumbersome, and that the proof gives no insight as to how the program was developed. An alternative method is ''[[program derivation]]'', to "develop proof and program hand in hand". One starts with a mathematical ''specification'' of what a program is supposed to do and applies mathematical transformations to the specification until it is turned into a program that can be executed. The resulting program is then known to be ''correct by construction''. Much of Dijkstra's later work concerns ways to streamline mathematical argument. In a 2001 interview, he stated a desire for "elegance", whereby the correct approach would be to process thoughts mentally, rather than attempt to render them until they are complete. The analogy he made was to contrast the compositional approaches of [[Wolfgang Amadeus Mozart|Mozart]] and [[Ludwig van Beethoven|Beethoven]].
+            
+            Dijkstra was known for his essays on programming; he was the first to make the claim that programming is so inherently difficult and complex that programmers need to harness every trick and abstraction possible in hopes of managing the complexity of it successfully. He was also known for his habit of carefully composing manuscripts with his fountain pen. The manuscripts are called EWDs, since Dijkstra numbered them with ''EWD'' as prefix. Dijkstra would distribute photocopies of a new EWD among his colleagues; as many recipients photocopied and forwarded their copy, the EWDs spread throughout the international computer science community. The topics are mainly computer science and mathematics, but also include trip reports, letters, and speeches. More than 1300 EWDs have since been scanned, with a growing number also transcribed to facilitate search, and are available online at the Dijkstra archive of the University of Texas<ref>University of Texas [http://www.cs.utexas.edu/users/EWD/  online EWD archive].</ref>.
+            
+            Dijkstra was one of the very early pioneers of the research on distributed computing. Some people even consider some of his papers to be those that established the field. In particular, his paper "Self-stabilizing Systems in Spite of Distributed Control" started the sub-field of [[self-stabilization]].
+            
+            Dijkstra believed that computer science was more abstract than programming; he once said, "Computer Science is no more about computers than astronomy is about telescopes." Having invented much of the technology of software, Dijkstra eschewed the use of computers in his own work for many decades. Almost all EWDs appearing after 1972 were hand-written. Even after he succumbed to his UT colleagues’ encouragement and acquired a [[Macintosh]] computer, he used it only for e-mail and for browsing the World Wide Web.<ref name = "UTx">University of Texas, [http://www.utexas.edu/faculty/council/2002-2003/memorials/Dijkstra/dijkstra.html "In Memoriam Edsger Wybe Dijkstra."]</ref>
+            
+            He died in [[Nuenen]], [[The Netherlands]] on [[August 6]] [[2002]] after a long struggle with [[cancer]]. The following year, the ACM ([[Association for Computing Machinery]]) PODC Influential Paper Award in distributed computing was renamed the [[Dijkstra Prize]] in his honour.
+            
+            ==Awards and honours==
+            Among Dijkstra's awards and honours are:<ref name = "UTx"/>
+            * Member of the [[Royal Netherlands Academy of Arts and Sciences]] (1971)
+            * Distinguished Fellow of the [[British Computer Society]] (1971)
+            * The ACM's A.M. Turing Award (1972)
+            * Foreign Honorary Member of the [[American Academy of Arts and Sciences]] (1975)
+            * Doctor of Science Honoris Causa from the [[Queen's University Belfast]] (1976)
+            * Computer Pioneer Charter Recipient from the [[IEEE Computer Society]] (1982)
+            * Honorary doctorate from the [[Athens University]], Greece (2001).
+            
+            ==Legacy==
+            The title of his 1972 book, ''[[Structured programming|Structured Programming]]'', coauthored with [[C.A.R. Hoare]], became the term used to describe a major style of programming in computer software.
+            
+            As a college professor, Edsger Dijkstra's legacy is difficult to determine, considering his effect on numerous college students and technical publications.
+            
+            He is remembered by some as a troubling figure. Many of his writings offended people, although not by name but instead by description in such a way that other computer scientists saw themselves characterised, in various EWD communications, as anti-intellectual time-servers enslaved by major corporations, and these computer scientists naturally took umbrage at what seemed to be literary and essayistic hyperbole.
+            
+            Some of his work remains cutting edge to this day, notably on multiprocessing. At other times he seems to have pursued pure mathematics without being a member of the rather close-knit international mathematical fraternity and may as a result have been the first to discover fascinating and elegant new proofs of things already known. Here, the warnings of his family and university teachers may have had some validity; they felt that by wanting to be a computer programmer and not a professor of mathematics, Dijkstra was violating a family and social tradition for a tradesman's occupation, and indeed Dijkstra returned to academic life with apparent relief after encountering corporate thinking.
+            
+            The 2007 edition of Beautiful Code (a book of essays on programming projects thought to exhibit elegance, published by O'Reilly Press and edited by Andy Oram and Greg Wilson) fails to mention Dijkstra.
+            
+            [[Andrzej Sapkowski]], Polish fantasy writer, used Dijkstra's name for one of the main characters in the five book "Saga" about ''[[The Hexer]]''.
+            
+            ==See also==
+            * [[Dijkstra's algorithm]]
+            * [[Dining philosophers problem]]
+            * "[[The Cruelty of Really Teaching Computer Science]]"
+            * [[Shunting yard algorithm]]
+            
+            ==Footnotes==
+            {{reflist}}
+            ==References==
+            ===Writings by E.W. Dijkstra===
+            * {{cite journal |last=Dijkstra |first=E. W. |title=Letters to the editor: go to statement considered harmful |journal=[[Communications of the ACM]] |volume=11 |issue=3 |month=March |year=1968 |pages=147&ndash;148 |issn=0001-0782 |doi=10.1145/362929.362947 }} (EWD215)
+            
+            * {{cite journal |last=Dijkstra |first=E. W. |title=How do we tell truths that might hurt? |url=http://www.cs.virginia.edu/~evans/cs655/readings/ewd498.html |journal=[[SIGPLAN|SIGPLAN Notice]] |volume=17 |issue=5 |month=May |year=1982 |pages=13&ndash;15 |issn=0362-1340 |doi=10.1145/947923.947924 }} (EWD498)
+            
+            <!-- I found this copy of the above paper with a copyright notice in it at
+            http://www.cs.utexas.edu/users/EWD/ewd04xx/EWD498.PDF, so I don't think that the set of quotes should be lifted from it. Bubba73 -->
+            * [http://www.cs.utexas.edu/users/EWD/transcriptions/EWD11xx/EWD1166.html ''From My Life'' (EWD1166)]
+            * ''A Discipline of Programming'', Prentice-Hall Series in Automatic Computation, 1976, ISBN 0-13-215871-X
+            * ''Selected Writings on Computing: A Personal Perspective'', Texts and Monographs in Computer Science, Springer-Verlag, 1982, ISBN 0-387-90652-5
+            * ''A Method of Programming'', E.W. Dijkstra, W.H.J. Feijen, J. Sterringa, Addison Wesley 1988, ISBN 0-201-17536-3
+            
+            ===Others about Dijkstra, eulogies===
+            * [http://web.archive.org/web/20041206193322/www.digidome.nl/edsger_wybe_dijkstra.htm Biography] Digidome
+            * [http://homepages.cwi.nl/~apt/ps/dijkstra.pdf ''Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius''] ([[Portable Document Format|PDF]]) Obituary in ''[[Formal Aspects of Computing]]'' with a short biography
+            * [http://www.cs.utexas.edu/users/EWD/memorial/gries.html ''How can we explain Edsger W. Dijkstra to those who didn't know him?''] by David Gries
+            * [http://www.cs.utexas.edu/users/EWD/memorial/moore.html Dijkstra Eulogy] by J Strother Moore
+            * [http://www.cs.rutgers.edu/~szegedy/dijkstra.html In Memoriam Edsger Wybe Dijkstra] by Mario Szegedy
+            * [http://www.adeptis.ru/vinci/m_part7.html Photos of Edsger Dijkstra]
+            
+            ==External links==
+            {{wikiquote}}
+            * [http://www.cs.utexas.edu/users/EWD/ E. W. Dijkstra Archive]
+            * [http://noorderlicht.vpro.nl/afleveringen/3502225/ Noorderlicht Interview Video, bandwidth options]
+            <!-- * [[Luca Cardelli]]'s [http://www.luca.demon.co.uk/Fonts/Pc/Dijkstra.zip Font of Dijkstra's Handwriting] -->
+            
+            {{Turing award}}
+            
+            {{Persondata
+            |NAME=Dijkstra, Edsger
+            |ALTERNATIVE NAMES=
+            |SHORT DESCRIPTION=Dutch mathematician
+            |DATE OF BIRTH={{birth date|1930|5|11|mf=y}}
+            |PLACE OF BIRTH=[[Rotterdam]]
+            |DATE OF DEATH={{death date|2002|8|6|mf=y}}
+            |PLACE OF DEATH=[[Nuenen]], [[The Netherlands]]
+            }}
+            {{DEFAULTSORT:Dijkstra, Edsger}}
+            [[Category:1930 births]]
+            [[Category:2002 deaths]]
+            [[Category:Computer pioneers]]
+            [[Category:Dutch computer scientists]]
+            [[Category:Dutch physicists]]
+            [[Category:Fellows of the Association for Computing Machinery]]
+            [[Category:Formal methods people]]
+            [[Category:Turing Award laureates]]
+            [[Category:Leiden University alumni]]
+            [[Category:University of Texas at Austin faculty]]
+            [[Category:People from Rotterdam]]
+            [[Category:Programming language designers]]
+            [[Category:Programming language researchers]]
+            
+            [[ast:Edsger Dijkstra]]
+            [[bn:এট্‌সখার ডেইক্‌স্ট্রা]]
+            [[bs:Edsger Dijkstra]]
+            [[bg:Едсхер Дейкстра]]
+            [[ca:Edsger Dijkstra]]
+            [[cs:Edsger Dijkstra]]
+            [[da:Edsger Dijkstra]]
+            [[de:Edsger Wybe Dijkstra]]
+            [[el:Έντσγκερ Ντάικστρα]]
+            [[es:Edsger Dijkstra]]
+            [[eo:Edsger Dijkstra]]
+            [[fr:Edsger Dijkstra]]
+            [[ga:Edsger Dijkstra]]
+            [[ko:에츠허르 데이크스트라]]
+            [[hr:Edsger Dijkstra]]
+            [[id:Edsger Dijkstra]]
+            [[it:Edsger Dijkstra]]
+            [[he:אדסחר דייקסטרה]]
+            [[lb:Edsger W. Dijkstra]]
+            [[hu:Edsger Wybe Dijkstra]]
+            [[ml:എഡ്ഗര്‍ ഡൈക്സ്ട്രാ]]
+            [[nl:Edsger Dijkstra]]
+            [[ja:エドガー・ダイクストラ]]
+            [[pl:Edsger Dijkstra]]
+            [[pt:Edsger Dijkstra]]
+            [[ro:Edsger Dijkstra]]
+            [[ru:Дейкстра, Эдсгер Вибе]]
+            [[sk:Edsger Wybe Dijkstra]]
+            [[sr:Едсхер Дајкстра]]
+            [[fi:Edsger Dijkstra]]
+            [[sv:Edsger Dijkstra]]
+            [[vi:Edsger Dijkstra]]
+            [[tr:Edsger Dijkstra]]
+            [[zh:艾兹格·迪科斯彻]]

data/spec/fixtures/Edsger_Dijkstra_section_0.json

@@ -0,0 +1 @@
+{"query":{"pages":{"10018":{"pageid":10018,"ns":0,"title":"Edsger W. Dijkstra","revisions":[{"*":"{{Infobox_Scientist\n| name                    = Edsger Wybe Dijkstra\n| image                   = Edsger Wybe Dijkstra.jpg\n| image_width             = 150px\n| caption                 = \n| birth_date              = {{Birth date|1930|05|11}}\n| birth_place             = [[Rotterdam]], [[Netherlands]]\n| death_date              = {{death date and age|2002|8|6|1930|05|11}}\n| death_place             = [[Nuenen]], [[Netherlands]]\n| residence               = \n| citizenship             =\n| nationality             = \n| ethnicity               =\n| field                   = [[Computer science]]\n| work_institutions       = [[Centrum Wiskunde & Informatica|Mathematisch Centrum]]<br>[[Eindhoven University of Technology]]\n<br>[[University of Texas at Austin|The University of Texas at Austin]]\n| alma_mater              = \n| doctoral_advisor        = [[Adriaan van Wijngaarden]]\n| doctoral_students       =  [[Nico Habermann]]<\/br>[[Martin Rem]]<\/br>[[David Naumann]]<\/br>[[Cornelis Hemerik]]<\/br>[[Jan Tijmen Udding]]<\/br>[[Jan L. A. van de Snepscheut|Johannes van de Snepscheut]]<\/br>[[Antonetta van Gasteren]]\n| known_for               = [[Dijkstra's algorithm]]<br>[[Structured programming]]<br>[[THE multiprogramming system]]<br>[[Semaphore (programming)|Semaphore]]\n| prizes                  = [[Turing Award]]<br>[[Association for Computing Machinery]]\n| footnotes               = \n}}\n'''Edsger Wybe Dijkstra''' (May 11, 1930 \u2013 August 6, 2002; {{IPA-nl|\u02c8\u025btsx\u0259r \u02c8wib\u0259 \u02c8d\u025b\u026akstra|-|Dijkstra.ogg}}) was a [[Netherlands|Dutch]] [[computer science|computer scientist]]. He received the 1972  [[Turing Award]]  for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The [[University of Texas at Austin]] from 1984 until 2000.\n\nShortly before his death in 2002, he received the [[Association for Computing Machinery|ACM]] PODC Influential Paper Award in distributed computing for his work on [[self-stabilization]] of program computation. This annual award was renamed the [[Dijkstra Prize]] the following year, in his honour."}],"links":[{"ns":0,"title":"ACM Turing Award"},{"ns":0,"title":"ALGOL"},{"ns":0,"title":"ALGOL 60"},{"ns":0,"title":"Adi Shamir"},{"ns":0,"title":"Adriaan van Wijngaarden"},{"ns":0,"title":"Agile software development"},{"ns":0,"title":"Alan Kay"},{"ns":0,"title":"Alan Perlis"},{"ns":0,"title":"Algorithm"},{"ns":0,"title":"Allen Newell"}],"images":[{"ns":6,"title":"File:Copyright-problem.svg"},{"ns":6,"title":"File:Dijkstra.ogg"},{"ns":6,"title":"File:Edsger Wybe Dijkstra.jpg"},{"ns":6,"title":"File:Speaker Icon.svg"},{"ns":6,"title":"File:Wikiquote-logo-en.svg"}],"categories":[{"ns":14,"title":"Category:1930 births"},{"ns":14,"title":"Category:2002 deaths"},{"ns":14,"title":"Category:All pages needing cleanup"},{"ns":14,"title":"Category:Articles needing cleanup from April 2009"},{"ns":14,"title":"Category:Articles with close paraphrasing from April 2009"},{"ns":14,"title":"Category:Computer pioneers"},{"ns":14,"title":"Category:Dutch computer scientists"},{"ns":14,"title":"Category:Dutch physicists"},{"ns":14,"title":"Category:Eindhoven University of Technology faculty"},{"ns":14,"title":"Category:Fellows of the Association for Computing Machinery"}]}}},"query-continue":{"links":{"plcontinue":"10018|0|American Academy of Arts and Sciences"},"categories":{"clcontinue":"10018|Fellows of the British Computer Society"}}}

data/spec/fixtures/Edsger_content.txt

@@ -0,0 +1 @@
+{"content":"{{Infobox_Scientist\n| name                    = Edsger Wybe Dijkstra\n| image                   = Edsger Wybe Dijkstra.jpg\n| image_width             = 150px\n| caption                 = \n| birth_date              = {{Birth date|1930|05|11}}\n| birth_place             = [[Rotterdam]], [[Netherlands]]\n| death_date              = {{death date and age|2002|8|6|1930|05|11}}\n| death_place             = [[Nuenen]], [[Netherlands]]\n| residence               = \n| citizenship             =\n| nationality             = \n| ethnicity               =\n| field                   = [[Computer science]]\n| work_institutions       = [[Centrum Wiskunde & Informatica|Mathematisch Centrum]]<br>[[Eindhoven University of Technology]]\n<br>[[University of Texas at Austin|The University of Texas at Austin]]\n| alma_mater              = \n| doctoral_advisor        = [[Adriaan van Wijngaarden]]\n| doctoral_students       =  [[Nico Habermann]]<\/br>[[Martin Rem]]<\/br>[[David Naumann]]<\/br>[[Cornelis Hemerik]]<\/br>[[Jan Tijmen Udding]]<\/br>[[Jan L. A. van de Snepscheut|Johannes van de Snepscheut]]<\/br>[[Antonetta van Gasteren]]\n| known_for               = [[Dijkstra's algorithm]]<br>[[Structured programming]]<br>[[THE multiprogramming system]]<br>[[Semaphore (programming)|Semaphore]]\n| prizes                  = [[Turing Award]]<br>[[Association for Computing Machinery]]\n| footnotes               = \n}}\n'''Edsger Wybe Dijkstra''' (May 11, 1930 \u2013 August 6, 2002; {{IPA-nl|\u02c8\u025btsx\u0259r \u02c8wib\u0259 \u02c8d\u025b\u026akstra|-|Dijkstra.ogg}}) was a [[Netherlands|Dutch]] [[computer science|computer scientist]]. He received the 1972  [[Turing Award]]  for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The [[University of Texas at Austin]] from 1984 until 2000.\n\nShortly before his death in 2002, he received the [[Association for Computing Machinery|ACM]] PODC Influential Paper Award in distributed computing for his work on [[self-stabilization]] of program computation. This annual award was renamed the [[Dijkstra Prize]] the following year, in his honour.\n\n==Life and work==\nBorn in [[Rotterdam, Netherlands]], Dijkstra studied [[theoretical physics]] at [[Leiden University]], but quickly realized he was more interested in computer science.\nOriginally employed by the [[Centrum Wiskunde & Informatica|Mathematisch Centrum]] in Amsterdam, he held a professorship at the [[Eindhoven University of Technology]], worked as a research fellow for [[Burroughs Corporation]] in the early 1970s, and later held the Schlumberger Centennial Chair in Computer Sciences at the [[University of Texas at Austin]], in the United States. He retired in 2000.\n\nAmong his contributions to computer science are the ''[[shortest path problem|shortest path]]-[[algorithm]]'', also known as ''[[Dijkstra's algorithm]]''; ''[[Reverse Polish Notation]]'' and related ''[[Shunting yard algorithm]]''; the [[THE multiprogramming system]], an important early example of structuring a system as a set of layers; ''[[Banker's algorithm]]''; and the [[Semaphore (programming)|semaphore]] construct for coordinating multiple processors and programs. Another concept due to Dijkstra in the field of distributed computing is that of [[self-stabilization]] &ndash; an alternative way to ensure the reliability of the system. Dijkstra's algorithm is used in SPF, [[Shortest Path First]], which is used in the routing protocol OSPF, [[Open Shortest Path First]].\n\nWhile he had programmed extensively in machine code in the 1950s, he was known for his low opinion of the [[GOTO]] statement in [[computer programming]], writing a paper in 1965, and culminating in the 1968 article \"[http:\/\/www.cs.utexas.edu\/users\/EWD\/transcriptions\/EWD02xx\/EWD215.html A Case against the GO TO Statement]\" (EWD215), regarded as a major step towards the widespread deprecation of the [[GOTO]] statement and its effective replacement by [[control structures|structured control constructs]], such as the [[while loop]]. This methodology was also called [[structured programming]], the title of his 1972 book, coauthored with [[C.A.R. Hoare]] and [[Ole-Johan Dahl]]. The March 1968 ACM letter's famous title, \"Go To Statement [[considered harmful|Considered Harmful]]\",<small><ref name=\"goto\">\n   \"Go To Statement [[considered harmful|Considered Harmful]]\",\n   ''Communications of the ACM'', Vol. 11, No. 3,\n   March 1968, pp. 147-148.\n<\/ref><\/small> was not the work of Dijkstra, but of [[Niklaus Wirth]], then editor of ''[[Communications of the ACM]]''. Dijskra also strongly opposed the teaching of [[BASIC]],<ref>{{citation|title=How do we tell truths that might hurt?|date=18 June 1975|url=http:\/\/www.cs.virginia.edu\/~evans\/cs655-S00\/readings\/ewd498.html}}<\/ref> a language whose programs are typically GOTO-laden.\n\nDijkstra was known to be a fan of [[ALGOL|ALGOL 60]], and worked on the team that implemented the first [[compiler]] for that language. Dijkstra and [[Jaap Zonneveld]], who collaborated on the compiler, agreed not to shave until the project was completed.\n\nDijkstra wrote two important papers in 1968, devoted to the structure of a multiprogramming operating system called [[THE multiprogramming system|THE]], and to [[Co-operating Sequential Processes]].\n\nFrom the 1970s, Dijkstra's chief interest was [[formal verification]]. The prevailing opinion at the time was that one should first write a program and then provide a [[mathematical proof]] of [[correctness]]. Dijkstra objected noting that the resulting proofs are long and cumbersome, and that the proof gives no insight on how the program was developed. An alternative method is ''[[program derivation]]'', to \"develop proof and program hand in hand\". One starts with a mathematical ''specification'' of what a program is supposed to do and applies mathematical transformations to the specification until it is turned into a program that can be executed. The resulting program is then known to be ''correct by construction''. Much of Dijkstra's later work concerns ways to streamline mathematical argument. In a 2001 interview,<ref>http:\/\/video.google.com\/videoplay?docid=-6873628658308030363<\/ref> he stated a desire for \"elegance\", whereby the correct approach would be to process thoughts mentally, rather than attempt to render them until they are complete. The analogy he made was to contrast the compositional approaches of [[Wolfgang Amadeus Mozart|Mozart]] and [[Ludwig van Beethoven|Beethoven]].\n\nDijkstra was one of the early pioneers in the field of distributed computing. In particular, his paper \"Self-stabilizing Systems in Spite of Distributed Control\" started the sub-field of [[self-stabilization]].\n\nMany of his opinions on computer science and programming have become widespread. For example, he is famed for coining the popular programming phrase \"two or more, use a for,\" alluding to the rule of thumb that when you find yourself processing more than one instance of a data structure, it is time to consider encapsulating that logic inside a loop. He was the first to make the claim that programming is so inherently complex that, in order to manage it successfully, programmers need to harness every trick and abstraction possible. When expressing the abstract nature of computer science, he once said, \"computer science is no more about computers than astronomy is about telescopes.\" \n\nHe died in [[Nuenen]], [[Netherlands]] on August 6, 2002 after a long struggle with [[cancer]]. The following year, the ACM ([[Association for Computing Machinery]]) PODC Influential Paper Award in distributed computing was renamed the [[Dijkstra Prize]] in his honour.\n\n== EWDs and writing by hand ==\n{{Close paraphrase|section|date=April 2009}}\nDijkstra was known for his habit of carefully composing manuscripts with his fountain pen. The manuscripts are called EWDs, since Dijkstra numbered them with ''EWD'', his initials, as a prefix. According to Dijkstra himself, the EWDs started when he moved from the Mathematical Centre in Amsterdam to the Technological University (then TH) Eindhoven. After going to the TUE Dijkstra experienced a writer's block for more than a year. Looking closely at himself he realized that if he wrote about things they would appreciate at the MC in Amsterdam his colleagues in Eindhoven would not understand; if he wrote about things they would like in Eindhoven, his former colleagues in Amsterdam would look down on him. He then decided to write only for himself, and in this way the EWD's were born. Dijkstra would distribute photocopies of a new EWD among his colleagues; as many recipients photocopied and forwarded their copy, the EWDs spread throughout the international computer science community. The topics were computer science and mathematics, and included trip reports, letters, and speeches.  More than 1300 EWDs have since been scanned, with a growing number transcribed to facilitate search, and are available online at the Dijkstra archive of the University of Texas.<ref>University of Texas [http:\/\/www.cs.utexas.edu\/users\/EWD\/  online EWD archive].<\/ref>\n\nOne of Dijkstra's sidelines was serving as [[Board of directors|Chairman of the Board]] of the fictional Mathematics Inc., a company that he imagined having [[commercialized]] the production of mathematical [[theorems]] in the same way that software companies had commercialized the production of computer programs. He invented a number of activities and challenges of Mathematics Inc. and documented them in several papers in the EWD series. The imaginary company had produced a proof of the [[Riemann Hypothesis]] but then had great difficulties collecting [[royalties]] from mathematicians who had proved results assuming the Riemann Hypothesis. The proof itself was a [[trade secret]] (EWD 475). Many of the company's proofs were rushed out the door and then much of the company's effort had to be spent on [[Software maintenance|maintenance]] (EWD 539). A more successful effort was the Standard Proof for [[Pythagoras' Theorem]], that replaced the more than 100 incompatible existing proofs (EWD427). Dijkstra described Mathematics Inc. as \"the most exciting and most miserable business ever conceived\" (EWD475). He claimed that by 1974 his fictional company was the world's leading mathematical industry with more than 75 percent of the world market (EWD443).<ref>\n{{cite book | last = Dijkstra | first = Edsger W. | title = Selected Writings on Computing: A Personal Perspective | publisher = Springer-Verlag | location = Berlin | year = 1982 | isbn = 9780387906522 }}\n<\/ref>\n\nHaving invented much of the technology of software, Dijkstra eschewed the use of computers in his own work for many decades.  Almost all EWDs appearing after 1972 were hand-written. When lecturing, he would write proofs in chalk on a blackboard rather than using overhead foils, let alone Powerpoint slides. Even after he succumbed to his UT colleagues\u2019 encouragement and acquired a [[Macintosh]] computer, he used it only for e-mail and for browsing the World Wide Web.<ref name = \"UTx\">University of Texas, [http:\/\/www.utexas.edu\/faculty\/council\/2002-2003\/memorials\/Dijkstra\/dijkstra.html \"In Memoriam Edsger Wybe Dijkstra.\"]<\/ref>\n\n==Awards and honors==\nAmong Dijkstra's awards and honours are:<ref name = \"UTx\"\/>\n* Member of the [[Royal Netherlands Academy of Arts and Sciences]] (1971)\n* Distinguished Fellow of the [[British Computer Society]] (1971)\n* The [[Association for Computing Machinery]]'s A.M. [[ACM Turing Award|Turing Award]] (1972)\n* Foreign Honorary Member of the [[American Academy of Arts and Sciences]] (1975)\n* Doctor of Science [[Honoris Causa]] from the [[Queen's University Belfast]] (1976)\n* Computer Pioneer Charter Recipient from the [[IEEE Computer Society]] (1982)\n* Honorary doctorate from the [[Athens University of Economics & Business]], Greece (2001).\n\n==See also==\n* [[Dijkstra's algorithm]]\n* [[Smoothsort]]\n* [[Dining philosophers problem]]\n* \"[[The Cruelty of Really Teaching Computer Science]]\"\n* [[Semaphore (programming)|Semaphore]]\n\n==Footnotes==\n{{reflist}}\n==References==\n===Writings by E.W. Dijkstra===\n* {{cite journal |last=Dijkstra |first=E. W. |title=Letters to the editor: go to statement considered harmful |journal=[[Communications of the ACM]] |volume=11 |issue=3 |month=March |year=1968 |pages=147&ndash;148 |issn=0001-0782 |doi=10.1145\/362929.362947 }} (EWD215)\n\n* {{cite journal|url=http:\/\/www.cs.utexas.edu\/~EWD\/transcriptions\/EWD03xx\/EWD340.html\n|title=The Humble Programmer\n|last=Dijkstra |first=E. W.\n|journal=[[Communications of the ACM]]\n|volume=15\n|issue=10\n|year=1972\n|month=Aug\n|pages=859\u2013866|doi=10.1145\/355604.361591\n}} (EWD340) [http:\/\/www.cs.utexas.edu\/~EWD\/ewd03xx\/EWD340.PDF PDF], 1972 [[ACM Turing Award]] lecture\n\n* {{cite journal |last=Dijkstra |first=E. W. |title=How do we tell truths that might hurt? |url=http:\/\/www.cs.virginia.edu\/~evans\/cs655\/readings\/ewd498.html |journal=[[SIGPLAN|SIGPLAN Notice]] |volume=17 |issue=5 |month=May |year=1982 |pages=13&ndash;15 |issn=0362-1340 |doi=10.1145\/947923.947924 }} (EWD498)\n\n<!-- I found this copy of the above paper with a copyright notice in it at\nhttp:\/\/www.cs.utexas.edu\/users\/EWD\/ewd04xx\/EWD498.PDF, so I don't think that the set of quotes should be lifted from it. Bubba73 -->\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/transcriptions\/EWD11xx\/EWD1166.html ''From My Life'' (EWD1166)]\n* Dijkstra, E.W. (August 1975), ''Guarded commands, nondeterminacy and formal derivation of program''. ''[[Communications of the ACM]]'', 18(8):453\u2013457. [http:\/\/doi.acm.org\/10.1145\/360933.360975]\n* Dijkstra, E.W. (1976), ''A Discipline of Programming'', Prentice-Hall Series in Automatic Computation, ISBN 0-13-215871-X \u2014 A systematic introduction to a version of the guarded command language with many worked examples\n* ''Selected Writings on Computing: A Personal Perspective'', Texts and Monographs in Computer Science, Springer-Verlag, 1982, ISBN 0-387-90652-5\n* ''A Method of Programming'', E.W. Dijkstra, W.H.J. Feijen, J. Sterringa, Addison Wesley 1988, ISBN 0-201-17536-3\n* E. W. Dijkstra and [[Carel S. Scholten]] (1990). ''Predicate Calculus and Program Semantics''. Springer-Verlag ISBN 0-387-96957-8 \u2014 An abstract, formal treatment of [[Predicate transformer semantics]]\n*[[Ole-Johan Dahl|O.-J. Dahl]], [[Edsger W. Dijkstra]], [[C. A. R. Hoare]] ''Structured Programming'', Academic Press, London, 1972 ISBN 0-12-200550-3\n**this volume includes an expanded version of the ''Notes on Structured Programming'', including an extended example of using the structured approach to develop a backtracking algorithm to solve the [[Eight queens puzzle|8 Queens problem]].\n**[http:\/\/portal.acm.org\/citation.cfm?id=1243380&jmp=cit&coll=portal&dl=GUIDE&CFID=:\/\/www.acm.org\/publications\/&CFTOKEN=www.acm.org\/publications\/#CIT a pdf version of this book is available in the ACM Classic Books Series]\n**[http:\/\/s1.webstarts.com\/ACaseForAgentsEDUpaper\/uploads\/scimakelatex_2400_Dr__Douglas_C__Engelbart__Edsger_W__Dijkstra_Stephen_A__Dymarcik_II_Peter_Naur_.pdf]\n\n===Others about Dijkstra, eulogies===\n* [http:\/\/web.archive.org\/web\/20041206193322\/www.digidome.nl\/edsger_wybe_dijkstra.htm Biography] Digidome\n* [http:\/\/homepages.cwi.nl\/~apt\/ps\/dijkstra.pdf ''Edsger Wybe Dijkstra (1930\u20132002): A Portrait of a Genius''] ([[Portable Document Format|PDF]]) Obituary in ''[[Formal Aspects of Computing]]'' with a short biography\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/memorial\/gries.html ''How can we explain Edsger W. Dijkstra to those who didn't know him?''] by David Gries\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/memorial\/moore.html Dijkstra Eulogy] by J Strother Moore\n* [http:\/\/www.cs.rutgers.edu\/~szegedy\/dijkstra.html In Memoriam Edsger Wybe Dijkstra] by Mario Szegedy\n* [http:\/\/www.adeptis.ru\/vinci\/m_part7.html Photos of Edsger Dijkstra]\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/misc\/vanVlissingenInterview.html 1985 Interview with Edsger Dijkstra, which he considered the best of his life]\n\n==External links==\n{{wikiquote}}\n* [http:\/\/www.cbi.umn.edu\/oh\/display.phtml?id=320 Oral history interview with Edsger W. Dijkstra],  [[Charles Babbage Institute]] University of Minnesota, Minneapolis. Dijkstra recounts his early education and training as a theoretical physicist and as a 'programmer'. Dijkstra describes his work developing software, and his activities at several early information processing conferences. Dijkstra discusses the development of [[ALGOL 60]], [[Dijkstra's algorithm]], [[THE multiprogramming system]].  Comments on such figures as [[Adriaan_van_Wijngaarden|Aad van Wijngaarden]], [[Gerrit Blaauw]], [[F.L. Bauer]], [[Peter Naur]], [[Tony Hoare]], [[Niklaus Wirth]], [[Alan Perlis]].  Compares the origins of computing science in Europe and America.  Oral history interview 2001.\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/ E. W. Dijkstra Archive]\n* [http:\/\/www.cs.utexas.edu\/users\/EWD\/video-audio\/NoorderlichtVideo.html Noorderlicht: Discipline in Thought] Video interview, 2001-04-10\n**[http:\/\/noorderlicht.vpro.nl\/afleveringen\/3502225\/ original here], only in Dutch, bandwidth options\n<!-- * [[Luca Cardelli]]'s [http:\/\/www.luca.demon.co.uk\/Fonts\/Pc\/Dijkstra.zip Font of Dijkstra's Handwriting] -->\n* [http:\/\/www.speechpedia.org\/EdsgerDijkstra\/1996\/12\/08\/Edsger-Dijkstras-Convocation-Speech\/ Edsger Dijkstra's Convocation Speech]\n\n{{Turing award}}\n{{Software Engineering}}\n\n{{Persondata\n|NAME=Dijkstra, Edsger\n|ALTERNATIVE NAMES=\n|SHORT DESCRIPTION=Dutch mathematician\n|DATE OF BIRTH={{birth date|1930|5|11|mf=y}}\n|PLACE OF BIRTH=[[Rotterdam]]\n|DATE OF DEATH={{death date|2002|8|6|mf=y}}\n|PLACE OF DEATH=[[Nuenen]], [[Netherlands]]\n}}\n{{DEFAULTSORT:Dijkstra, Edsger}}\n[[Category:1930 births]]\n[[Category:2002 deaths]]\n[[Category:Computer pioneers]]\n[[Category:Dutch computer scientists]]\n[[Category:Dutch physicists]]\n[[Category:Eindhoven University of Technology faculty]]\n[[Category:Fellows of the Association for Computing Machinery]]\n[[Category:Fellows of the British Computer Society]]\n[[Category:Formal methods people]]\n[[Category:Leiden University alumni]]\n[[Category:Members of IFIP Working Group 2.1]]\n[[Category:People from Rotterdam]]\n[[Category:Programming language designers]]\n[[Category:Programming language researchers]]\n[[Category:Researchers in distributed computing]]\n[[Category:Software engineers]]\n[[Category:Software engineering researchers]]\n[[Category:Turing Award laureates]]\n[[Category:University of Texas at Austin faculty]]\n\n[[ast:Edsger Dijkstra]]\n[[bn:\u098f\u099f\u09cd\u200c\u09b8\u0996\u09be\u09b0 \u09a1\u09c7\u0987\u0995\u09cd\u200c\u09b8\u09cd\u099f\u09cd\u09b0\u09be]]\n[[bs:Edsger Dijkstra]]\n[[bg:\u0415\u0434\u0441\u0445\u0435\u0440 \u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0430]]\n[[ca:Edsger Dijkstra]]\n[[cs:Edsger Dijkstra]]\n[[da:Edsger Dijkstra]]\n[[de:Edsger Wybe Dijkstra]]\n[[et:Edsger Wybe Dijkstra]]\n[[el:\u0388\u03bd\u03c4\u03c3\u03b3\u03ba\u03b5\u03c1 \u039d\u03c4\u03ac\u03b9\u03ba\u03c3\u03c4\u03c1\u03b1]]\n[[es:Edsger Dijkstra]]\n[[eo:Edsger Dijkstra]]\n[[fa:\u0627\u062f\u0633\u062e\u0631 \u062f\u06cc\u06a9\u0633\u062a\u0631\u0627]]\n[[fr:Edsger Dijkstra]]\n[[ga:Edsger Dijkstra]]\n[[ko:\uc5d0\uce20\ud5c8\ub974 \ub370\uc774\ud06c\uc2a4\ud2b8\ub77c]]\n[[hr:Edsger Dijkstra]]\n[[id:Edsger Dijkstra]]\n[[it:Edsger Dijkstra]]\n[[he:\u05d0\u05d3\u05e1\u05d7\u05e8 \u05d3\u05d9\u05d9\u05e7\u05e1\u05d8\u05e8\u05d4]]\n[[lb:Edsger W. Dijkstra]]\n[[hu:Edsger Wybe Dijkstra]]\n[[ml:\u0d0e\u0d21\u0d4d\u0d17\u0d7c \u0d21\u0d48\u0d15\u0d4d\u0d38\u0d4d\u0d1f\u0d4d\u0d30\u0d3e]]\n[[mr:\u090f\u0921\u094d\u0938\u0917\u0930 \u0921\u093f\u0915\u094d\u0938\u094d\u091f\u094d\u0930\u093e]]\n[[nl:Edsger Dijkstra]]\n[[ja:\u30a8\u30c9\u30ac\u30fc\u30fb\u30c0\u30a4\u30af\u30b9\u30c8\u30e9]]\n[[no:Edsger Dijkstra]]\n[[pl:Edsger Dijkstra]]\n[[pt:Edsger Dijkstra]]\n[[ro:Edsger Dijkstra]]\n[[ru:\u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0430, \u042d\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0431\u0435]]\n[[sk:Edsger Wybe Dijkstra]]\n[[sr:\u0415\u0434\u0441\u0445\u0435\u0440 \u0414\u0430\u0458\u043a\u0441\u0442\u0440\u0430]]\n[[fi:Edsger Dijkstra]]\n[[sv:Edsger Dijkstra]]\n[[tr:Edsger Dijkstra]]\n[[uk:\u0415\u0434\u0441\u0433\u0435\u0440 \u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0430]]\n[[vi:Edsger Dijkstra]]\n[[zh:\u827e\u5179\u683c\u00b7\u8fea\u6770\u65af\u7279\u62c9]]"}

data/spec/fixtures/File_Edsger_Wybe_Dijkstra_jpg.json

@@ -0,0 +1 @@
+{"query":{"pages":{"-1":{"ns":6,"title":"File:Edsger Wybe Dijkstra.jpg","missing":"","imagerepository":"shared","imageinfo":[{"url":"http:\/\/upload.wikimedia.org\/wikipedia\/commons\/d\/d9\/Edsger_Wybe_Dijkstra.jpg","descriptionurl":"http:\/\/commons.wikimedia.org\/wiki\/Image:Edsger_Wybe_Dijkstra.jpg"}]}}}}

data/spec/fixtures/sanitization_samples/Ceawlin_of_Wessex-raw.txt

@@ -0,0 +1,19 @@
+{{featured article}}
+{{Infobox Monarch
+| image=[[Image:Ceawlin name.gif|alt=The word Ceaulin, handwritten in old lettering.]]
+| caption=Ceawlin's name as it appears in in the ''Anglo-Saxon Chronicle'', as Ceaulin
+| name=Ceawlin
+| title=King of Wessex<br/>Bretwalda of southern Britain
+| reign=560&ndash;592
+| predecessor=[[Cynric of Wessex|Cynric]]
+| successor=[[Ceol of Wessex|Ceol]]
+| date of death = {{death-date|0593|593}} 
+| father=[[Cynric of Wessex|Cynric]]
+| issue=[[Cuthwine]]
+}}
+
+'''Ceawlin''' (also spelled '''Ceaulin''' and '''Caelin''', died ''c.'' 593) was a King of [[Wessex]]. He may have been the son of [[Cynric of Wessex]] and the grandson of [[Cerdic of Wessex]], whom the ''[[Anglo-Saxon Chronicle]]'' represents as the leader of the first group of [[Saxons]] to come to the land which later became [[Wessex]]. Ceawlin was active during the last years of the [[Anglo-Saxons|Anglo-Saxon]] invasion, with little of southern England remaining in the control of the native [[Britons (historic)|Britons]] by the time of his death.
+
+The chronology of Ceawlin's life is highly uncertain. The historical accuracy and dating of many of the events in the later ''Anglo-Saxon Chronicle'' have been called into question, and his reign is variously listed as lasting seven, seventeen, or thirty-two years.<ref>Stenton, p. 29, accepts the date given for Ceawlin's accession in the Anglo-Saxon Chronicle of 560, but Barbara Yorke in her online DNB article on Ceawlin states that his reign seems to have been deliberately lengthened.</ref> The Chronicle records several battles of Ceawlin's between the years 556 and 592, including the first record of a battle between different groups of Anglo-Saxons, and indicates that under Ceawlin Wessex acquired significant territory, some of which was later to be lost to other [[Heptarchy|Anglo-Saxon kingdoms]].  Ceawlin is also named as one of the eight "''[[bretwalda]]s''", a title given in the Chronicle to eight rulers who had overlordship over southern Britain, although the extent of Ceawlin's control is not known.
+
+Ceawlin died in 593, having been deposed the year before, possibly by his successor, [[Ceol of Wessex|Ceol]].  He is recorded in various sources as having two sons, Cutha and [[Cuthwine]], but the genealogies in which this information is found are known to be unreliable.

data/spec/fixtures/sanitization_samples/Ceawlin_of_Wessex-sanitized.txt

@@ -0,0 +1,3 @@
+<p><b>Ceawlin</b> (also spelled <b>Ceaulin</b> and <b>Caelin</b>, died <i>c.</i> 593) was a King of Wessex. He may have been the son of Cynric of Wessex and the grandson of Cerdic of Wessex, whom the <i>Anglo-Saxon Chronicle</i> represents as the leader of the first group of Saxons to come to the land which later became Wessex. Ceawlin was active during the last years of the Anglo-Saxon invasion, with little of southern England remaining in the control of the native Britons by the time of his death.</p>
+<p>The chronology of Ceawlin's life is highly uncertain. The historical accuracy and dating of many of the events in the later <i>Anglo-Saxon Chronicle</i> have been called into question, and his reign is variously listed as lasting seven, seventeen, or thirty-two years. The Chronicle records several battles of Ceawlin's between the years 556 and 592, including the first record of a battle between different groups of Anglo-Saxons, and indicates that under Ceawlin Wessex acquired significant territory, some of which was later to be lost to other Anglo-Saxon kingdoms. Ceawlin is also named as one of the eight "<i>bretwaldas</i>", a title given in the Chronicle to eight rulers who had overlordship over southern Britain, although the extent of Ceawlin's control is not known.</p>
+<p>Ceawlin died in 593, having been deposed the year before, possibly by his successor, Ceol. He is recorded in various sources as having two sons, Cutha and Cuthwine, but the genealogies in which this information is found are known to be unreliable.</p>

data/spec/fixtures/sanitization_samples/Edsger_W_Dijkstra-raw.txt

@@ -0,0 +1,26 @@
+{{Infobox_Scientist
+| name                    = Edsger Wybe Dijkstra
+| image                   = Edsger Wybe Dijkstra.jpg
+| image_width             = 150px
+| caption                 = 
+| birth_date              = {{Birth date|1930|05|11}}
+| birth_place             = [[Rotterdam]], [[Netherlands]]
+| death_date              = {{death date and age|2002|8|6|1930|05|11}}
+| death_place             = [[Nuenen]], [[Netherlands]]
+| residence               = 
+| citizenship             =
+| nationality             = 
+| ethnicity               =
+| field                   = [[Computer science]]
+| work_institutions       = [[Centrum Wiskunde & Informatica|Mathematisch Centrum]]<br>[[Eindhoven University of Technology]]
+<br>[[University of Texas at Austin|The University of Texas at Austin]]
+| alma_mater              = 
+| doctoral_advisor        = [[Adriaan van Wijngaarden]]
+| doctoral_students       =  [[Nico Habermann]]</br>[[Martin Rem]]</br>[[David Naumann]]</br>[[Cornelis Hemerik]]</br>[[Jan Tijmen Udding]]</br>[[Jan L. A. van de Snepscheut|Johannes van de Snepscheut]]</br>[[Antonetta van Gasteren]]
+| known_for               = [[Dijkstra's algorithm]]<br>[[Structured programming]]<br>[[THE multiprogramming system]]<br>[[Semaphore (programming)|Semaphore]]
+| prizes                  = [[Turing Award]]<br>[[Association for Computing Machinery]]
+| footnotes               = 
+}}
+'''Edsger Wybe Dijkstra''' (May 11, 1930 – August 6, 2002; {{IPA-nl|ˈɛtsxər ˈwibə ˈdɛɪkstra|-|Dijkstra.ogg}}) was a [[Netherlands|Dutch]] [[computer science|computer scientist]]. He received the 1972  [[Turing Award]]  for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The [[University of Texas at Austin]] from 1984 until 2000.
+
+Shortly before his death in 2002, he received the [[Association for Computing Machinery|ACM]] PODC Influential Paper Award in distributed computing for his work on [[self-stabilization]] of program computation. This annual award was renamed the [[Dijkstra Prize]] the following year, in his honour.

data/spec/fixtures/sanitization_samples/Edsger_W_Dijkstra-sanitized.txt

@@ -0,0 +1,2 @@
+<p><b>Edsger Wybe Dijkstra</b> (May 11, 1930 – August 6, 2002; ) was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000.</p>
+<p>Shortly before his death in 2002, he received the ACM PODC Influential Paper Award in distributed computing for his work on self-stabilization of program computation. This annual award was renamed the Dijkstra Prize the following year, in his honour.</p>

data/spec/fixtures/sanitization_samples/Flower_video_game-raw.txt

@@ -0,0 +1,25 @@
+{{Infobox VG
+|title= Flower
+|image= [[File:Flower.png|alt=A trail of red, yellow and white petals arc over a brown-and-green grassy hill. The sun is in the upper left of the image, set in a clear blue sky, and the word "flower" is overlaid across the image, with the top of the "f" sprouting orange petals as if it were a flower itself.]]
+|caption=
+|developer= [[thatgamecompany]]
+|publisher= [[Sony Computer Entertainment]]
+|distributor= Sony Computer Entertainment
+|designer= [[Jenova Chen]]
+|composer= Vincent Diamante
+|series=
+|engine=
+|version= 1.01
+|released=February 12, 2009
+|genre= [[Poetry|Poetic]] [[Adventure game|Adventure]]<ref name="Genre"/>
+|modes= [[Single-player]]
+|ratings= {{vgratings|ESRB=E}} {{vgratings|PEGI=3+}}
+|platforms= [[PlayStation 3]]
+|media= [[Download]]
+|requirements=
+|input= [[Gamepad]]
+|resolution=[[1080p]]
+}}
+'''''Flower''''' is a [[PlayStation 3]] [[video game]]. It was developed by [[thatgamecompany]], designed by [[Jenova Chen]], and announced at the 2007 [[Tokyo Game Show]]. ''Flower'' was released on February 12, 2009, via the [[PlayStation Network]]. The game was intended as a "[[spiritual successor]]" to ''[[flOw|Flow]]'', a previous title by Chen and thatgamecompany. In it, the player controls the wind, blowing a flower [[petal]] through the air using the movement of the game controller. Flying close to flowers results in the player's petal being followed by other flower petals. Approaching flowers may also have side-effects on the game world, such as bringing vibrant color to previously dead fields or activating stationary windmills. The game features no text or dialogue, forming a narrative arc primarily through visual representation and emotional cues.
+
+''Flower'' was primarily intended to provoke positive emotions in the player, rather than to be a challenging and "fun" game. This focus was sparked by Chen, who felt that the primary purpose of entertainment products like video games was the feelings that they evoked in the audience, and that the emotional range of most games was very limited. The team viewed their efforts as creating a work of art, removing gameplay elements and mechanics that were not provoking the desired response in the players. The music, composed by Vincent Diamante, dynamically responds to the player's actions and corresponds with the emotional cues in the game. ''Flower'' was a critical success, to the surprise of the developers. Reviewers praised the game's music, visuals, and gameplay, calling it a unique and compelling emotional experience. It was named the "best independent game of 2009" at the [[Spike Video Game Awards]] and by ''[[Playboy]]'', and won the "Casual Game of the Year" award by the [[Academy of Interactive Arts and Sciences]].

data/spec/fixtures/sanitization_samples/Flower_video_game-sanitized.txt

@@ -0,0 +1,2 @@
+<p><b><i>Flower</i></b> is a PlayStation 3 video game. It was developed by thatgamecompany, designed by Jenova Chen, and announced at the 2007 Tokyo Game Show. <i>Flower</i> was released on February 12, 2009, via the PlayStation Network. The game was intended as a "spiritual successor" to <i>Flow</i>, a previous title by Chen and thatgamecompany. In it, the player controls the wind, blowing a flower petal through the air using the movement of the game controller. Flying close to flowers results in the player's petal being followed by other flower petals. Approaching flowers may also have side-effects on the game world, such as bringing vibrant color to previously dead fields or activating stationary windmills. The game features no text or dialogue, forming a narrative arc primarily through visual representation and emotional cues.</p>
+<p><i>Flower</i> was primarily intended to provoke positive emotions in the player, rather than to be a challenging and "fun" game. This focus was sparked by Chen, who felt that the primary purpose of entertainment products like video games was the feelings that they evoked in the audience, and that the emotional range of most games was very limited. The team viewed their efforts as creating a work of art, removing gameplay elements and mechanics that were not provoking the desired response in the players. The music, composed by Vincent Diamante, dynamically responds to the player's actions and corresponds with the emotional cues in the game. <i>Flower</i> was a critical success, to the surprise of the developers. Reviewers praised the game's music, visuals, and gameplay, calling it a unique and compelling emotional experience. It was named the "best independent game of 2009" at the Spike Video Game Awards and by <i>Playboy</i>, and won the "Casual Game of the Year" award by the Academy of Interactive Arts and Sciences.</p>

data/spec/fixtures/sanitization_samples/How_to_Lose_Friends__Alienate_People_film-raw.txt

@@ -0,0 +1,28 @@
+{{Infobox Film | 
+ name     = How to Lose Friends and Alienate People |
+ image          = Lose friends and alienate people.jpg |
+ caption        = |
+ director       = [[Robert B. Weide]]|
+ producer       = [[Stephen Woolley]]<br>Elizabeth Karlsen|
+ writer         = [[Peter Straughan]]<br>[[Toby Young]] (memoir)|
+ starring       = [[Simon Pegg]]<br>[[Kirsten Dunst]]<br>[[Megan Fox]]<br>[[Danny Huston]]<br>[[Gillian Anderson]]<br> and<br> [[Jeff Bridges]]|
+| music          = [[David Arnold]]
+| cinematography = [[Oliver Stapleton]]
+| editing        = [[David Freeman]]
+| distributor    = [[Channel Four Films]] <small>(UK)</small><br>[[Paramount Pictures]] <small>(UK/AUS)</small><br>[[Metro-Goldwyn-Mayer]] <small>(US)</small>
+| released       = October 3, 2008
+| runtime        = 110 minutes
+| country        = {{filmUK}}<br>{{filmUS}}
+| language       = [[English language|English]] 
+| budget         = $28 million<ref name="NY"/> 
+| gross          = $19,141,282 (worldwide)<ref name="mojo">{{mojo title|id=howtolosefriends|title=How to Lose Friends & Alienate People}}</ref>
+| preceded_by    = 
+| followed_by    = 
+| website        = http://www.how2losefriends.com/
+| amg_id         = 
+| imdb_id        = 0455538
+}}
+
+'''''How to Lose Friends & Alienate People''''' is a [[2008 in film|2008]] [[comedy film]] based upon [[United Kingdom|British]] writer [[Toby Young]]'s [[2001 in literature|2001]] [[How to Lose Friends and Alienate People (memoir)|memoir of the same name]]. The film follows a similar storyline, about his five year struggle to make it in the [[United States]] after employment at ''Sharps Magazine''.<ref>{{cite news | title = How to Lose Friends & Alienate People | url = http://entertainment.timesonline.co.uk/tol/arts_and_entertainment/film/film_reviews/article4867613.ece | first = Cosmo | last = Landesman | publisher = ''[[The Times]]'' | date = 2008-10-05 | accessdate = 2008-10-05 | location=London}}</ref> The names of the magazine and people Young came into contact with during the time were changed for the film adaptation. The film version (adapted by [[Peter Straughan]]) is a highly fictionalized account, and differs greatly from the work it was built upon. It was distributed in the [[United States]] by [[Metro-Goldwyn-Mayer]], and in the [[United Kingdom]] by [[Paramount Pictures]] and [[Channel Four Films]] (the former also distributed in [[Australia]]).
+
+The film was directed by [[Robert B. Weide]] and stars [[Simon Pegg]] as Sidney Young, [[Kirsten Dunst]] as Alison Olsen, [[Jeff Bridges]] as Clayton Harding, [[Danny Huston]] as Lawrence Maddox, [[Gillian Anderson]] as Eleanor Johnson, and [[Megan Fox]] as Sophie Maes. The cast also includes [[Max Minghella]] and [[Margo Stilley]].  ''How to Lose Friends And Alienate People'' was released in both the United States and United Kingdom on October 3, 2008.

data/spec/fixtures/sanitization_samples/How_to_Lose_Friends__Alienate_People_film-sanitized.txt

@@ -0,0 +1,2 @@
+<p><b><i>How to Lose Friends & Alienate People</i></b> is a 2008 comedy film based upon British writer Toby Young's 2001 memoir of the same name. The film follows a similar storyline, about his five year struggle to make it in the United States after employment at <i>Sharps Magazine</i>. The names of the magazine and people Young came into contact with during the time were changed for the film adaptation. The film version (adapted by Peter Straughan) is a highly fictionalized account, and differs greatly from the work it was built upon. It was distributed in the United States by Metro-Goldwyn-Mayer, and in the United Kingdom by Paramount Pictures and Channel Four Films (the former also distributed in Australia).</p>
+<p>The film was directed by Robert B. Weide and stars Simon Pegg as Sidney Young, Kirsten Dunst as Alison Olsen, Jeff Bridges as Clayton Harding, Danny Huston as Lawrence Maddox, Gillian Anderson as Eleanor Johnson, and Megan Fox as Sophie Maes. The cast also includes Max Minghella and Margo Stilley. <i>How to Lose Friends And Alienate People</i> was released in both the United States and United Kingdom on October 3, 2008.</p>

data/spec/fixtures/sanitization_samples/Kirsten_Dunst-raw.txt

@@ -0,0 +1,16 @@
+{{Infobox Actor
+| name = Kirsten Dunst
+| image = Kirsten Dunst by David Shankbone.jpg
+| imagesize= 200px
+| caption = Dunst at the ''[[Spider-Man 3]]'' premiere in [[New York City|NYC]], 2007
+| birthdate = {{birth date and age|1982|4|30}}
+| birthplace = {{city-state|Point Pleasant|New Jersey}}, United States
+| birthname = Kirsten Caroline Dunst
+| occupation = Actress
+| yearsactive= 1989–present
+}}
+'''Kirsten Caroline Dunst''' (born April 30, 1982) is an American actress, model, and singer. She made her film debut in ''[[New York Stories#Oedipus Wrecks|Oedipus Wrecks]]'', a [[short film]] directed by [[Woody Allen]] for the anthology ''[[New York Stories]]'' (1989). At the age of 12, Dunst gained widespread recognition playing the role of vampire [[Claudia (The Vampire Chronicles)|Claudia]] in ''[[Interview with the Vampire: The Vampire Chronicles|Interview with the Vampire]]'' (1994). She was nominated for a [[Golden Globe Award for Best Supporting Actress – Motion Picture|Golden Globe Award for Best Supporting Actress]] for this performance. That year she appeared in ''[[Little Women (1994)|Little Women]]'', to further acclaim.
+
+Dunst achieved international fame as a result of her portrayal of [[Mary Jane Watson]] in the [[Spider-Man (film series)|''Spider-Man'' trilogy]]. Since then her films have included the romantic comedy ''[[Wimbledon (film)|Wimbledon]]'' (2004), the science fiction drama ''[[Eternal Sunshine of the Spotless Mind]]'' (2004) and [[Cameron Crowe]]'s tragicomedy ''[[Elizabethtown (film)|Elizabethtown]]'' (2005). She played the title role in [[Sofia Coppola]]'s ''[[Marie Antoinette (2006 film)|Marie Antoinette]]'' (2006), and she starred in the comedy ''[[How to Lose Friends & Alienate People (film)|How to Lose Friends & Alienate People]]'' (2008).
+
+In 2001, Dunst made her singing debut in the film ''[[Get Over It (film)|Get Over It]]'', in which she performed two songs. She also sang the jazz song "[[After You've Gone (song)|After You've Gone]]" for the end credits of the film ''[[The Cat's Meow]]'' (2001). In early 2008, Dunst confirmed she was suffering from depression, checking into a treatment center before discharging herself in March and resuming her career.

data/spec/fixtures/sanitization_samples/Kirsten_Dunst-sanitized.txt

@@ -0,0 +1,3 @@
+<p><b>Kirsten Caroline Dunst</b> (born April 30, 1982) is an American actress, model, and singer. She made her film debut in <i>Oedipus Wrecks</i>, a short film directed by Woody Allen for the anthology <i>New York Stories</i> (1989). At the age of 12, Dunst gained widespread recognition playing the role of vampire Claudia in <i>Interview with the Vampire</i> (1994). She was nominated for a Golden Globe Award for Best Supporting Actress for this performance. That year she appeared in <i>Little Women</i>, to further acclaim.</p>
+<p>Dunst achieved international fame as a result of her portrayal of Mary Jane Watson in the <i>Spider-Man</i> trilogy. Since then her films have included the romantic comedy <i>Wimbledon</i> (2004), the science fiction drama <i>Eternal Sunshine of the Spotless Mind</i> (2004) and Cameron Crowe's tragicomedy <i>Elizabethtown</i> (2005). She played the title role in Sofia Coppola's <i>Marie Antoinette</i> (2006), and she starred in the comedy <i>How to Lose Friends & Alienate People</i> (2008).</p>
+<p>In 2001, Dunst made her singing debut in the film <i>Get Over It</i>, in which she performed two songs. She also sang the jazz song "After You've Gone" for the end credits of the film <i>The Cat's Meow</i> (2001). In early 2008, Dunst confirmed she was suffering from depression, checking into a treatment center before discharging herself in March and resuming her career.</p>

data/spec/fixtures/sanitization_samples/Large_Hadron_Collider-raw.txt

@@ -0,0 +1,104 @@
+{{currentevent}}
+{{Redirect|LHC}}
+{{Coord|46|14|N|06|03|E|type:landmark|display=title}}<!--to verify-->
+{{LHC}}
+{{Hadron colliders}}
+
+The '''Large Hadron Collider''' ('''LHC''') is the [[List of accelerators in particle physics#Hadron colliders|world's largest and highest-energy]] [[particle accelerator]], intended to [[collider|collide]] opposing [[Charged particle beam|particle beams]] of either [[proton]]s at an energy of 7&nbsp;[[TeV]] (1.12&nbsp;[[Micro-|micro]][[joules]]) per particle, or [[lead]] [[atomic nucleus|nuclei]] at an energy of 574&nbsp;TeV (92.0&nbsp;[[Micro-|micro]][[joules]]) per nucleus. The term ''[[hadron]]'' refers to particles composed of [[quarks]]. It is expected that it will address the [[Beyond the Standard Model|most fundamental questions]] of [[physics]], hopefully allowing progress in understanding the deepest laws of nature. The LHC lies in a tunnel {{convert|27|km|mi}} in [[circumference]], as much as {{convert|175|m|ft}} beneath the Franco-Swiss border near [[Geneva]], [[Switzerland]].
+
+The Large Hadron Collider was built by the [[CERN|European Organization for Nuclear Research]] (CERN) with the intention of testing various predictions of [[high-energy physics]], including the existence of the hypothesized [[Higgs boson]]<ref>
+{{cite web
+ |year=2008
+ |title=Missing Higgs
+ |url=http://public.web.cern.ch/public/en/Science/Higgs-en.html
+ |publisher=[[CERN]]
+ |accessdate=2008-10-10
+}}</ref> and of the large family of [[superpartner|new particles]] predicted by [[supersymmetry]].<ref>
+{{cite web
+ |year=2008
+ |title=Towards a superforce
+ |url=http://public.web.cern.ch/public/en/Science/Superforce-en.html
+ |publisher=[[CERN]]
+ |accessdate=2008-10-10
+}}</ref> It is funded by and built in collaboration with over 10,000 [[scientist]]s and [[engineer]]s from over 100 countries as well as hundreds of [[university|universities]] and [[laboratory|laboratories]].<ref>
+{{cite web
+ |author=Roger Highfield
+ |date=16 September 2008
+ |title=Large Hadron Collider: Thirteen ways to change the world
+ |url=http://www.telegraph.co.uk/earth/main.jhtml?xml=/earth/2008/09/16/sciwriters116.xml
+ |work=[[Telegraph]]
+ |accessdate=2008-10-10}}</ref>
+
+On 10 September 2008, the proton beams were successfully circulated in the main ring of the LHC for the first time,<ref>
+{{cite press
+ |publisher=CERN Press Office
+ |date=10 September 2008
+ |title=First beam in the LHC&nbsp;– Accelerating science
+ |url=http://press.web.cern.ch/press/PressReleases/Releases2008/PR08.08E.html
+ |accessdate=2008-10-09
+}}</ref> but nine days later, operations were halted due to a serious [[Large Hadron Collider#Construction accidents and delays|fault]] between two superconducting bending magnets.<ref>
+{{cite news
+ |author=Paul Rincon
+ |date=23 September 2008
+ |title=Collider halted until next year
+ |url=http://news.bbc.co.uk/2/hi/science/nature/7632408.stm
+ |publisher=BBC News
+ |accessdate=2008-10-09
+}}</ref> Repairing the resulting damage and installing additional safety features took over a year.<ref name="CERN September">
+{{cite press
+ |publisher=CERN Press Office
+ |date=9 February 2009
+ |title=CERN management confirms new LHC restart schedule
+ |url=http://press.web.cern.ch/press/PressReleases/Releases2009/PR02.09E.html
+ |accessdate=2009-02-10
+}}</ref><ref name="CERN October">
+{{cite press
+ |publisher=CERN Press Office
+ |date=19 June 2009
+ |title=CERN reports on progress towards LHC restart
+ |url=http://press.web.cern.ch/press/lhc-first-physics/
+ |accessdate=2009-07-21
+}}</ref> On 20 November 2009, the proton beams were successfully circulated again,<ref name=LHC-is-back>
+{{cite press
+ |publisher=CERN Press Office
+ |date=20 November 2009
+ |title=The LHC is back
+ |url=http://press.web.cern.ch/press/PressReleases/Releases2009/PR16.09E.html
+ |accessdate=2009-11-20
+}}</ref> with the first proton–proton collisions being recorded three days later at the injection energy of 450 GeV per beam.<ref name=CERN20091123>
+{{cite press
+ |publisher=CERN Press Office
+ |date=23 November 2009
+ |title=Two circulating beams bring first collisions in the LHC
+ |url=http://press.web.cern.ch/press/PressReleases/Releases2009/PR17.09E.html
+ |accessdate=2009-11-23
+}}</ref> The LHC became the world's highest energy particle accelerator on 30 November 2009, achieving a world record 1.18 TeV per beam and beating the record previously held by [[Fermilab]]'s [[Tevatron]].<ref name=CERN20091130>
+{{cite press
+ |publisher=CERN Press Office
+ |date=30 November 2009
+ |title=LHC sets new world record
+ |url=http://press.web.cern.ch/press/PressReleases/Releases2009/PR18.09E.html
+ |accessdate=2010-03-30
+}}</ref> After the 2009 winter shutdown, the LHC was restarted and the beam was ramped up to 3.5 TeV per beam,<ref name=CERN20091130>
+{{cite press
+ |publisher=CERN Press Office
+ |date=19 March 2010
+ |title=LHC sets new record&nbsp;– accelerates beams to 3.5 TeV
+ |url=http://press.web.cern.ch/press/PressReleases/Releases2010/PR05.10E.html
+ |accessdate=2010-03-30
+}}</ref> half its designed energy,<ref name=NYTArticle>
+{{cite press
+ |publisher=The New York Times
+ |date=4 February 2010
+ |title=Collider to Operate Again, Though at Half Power
+ |url=http://www.nytimes.com/2010/02/05/science/05collide.html
+ |accessdate=2010-02-05
+}}</ref> which is planned for after its 2012 shutdown.
+
+On 30 March 2010, the first planned collisions took place between two 3.5 TeV beams, which set a new world record for the highest energy man-made particle collisions.<ref name=bbc20100330>
+{{cite press
+ |publisher=BBC News
+ |date=30 March 2010
+ |title=CERN LHC sees high-energy success
+ |url=http://news.bbc.co.uk/2/hi/science/nature/8593780.stm
+ |accessdate=2010-03-30}}</ref>