Merge branch 'master' of git://factorcode.org/git/factor

basis/alarms/summary.txt

@@ -0,0 +1 @@
+One-time and recurring events

basis/alias/summary.txt

@@ -0,0 +1 @@
+Defining multiple words with the same name

basis/binary-search/summary.txt

@@ -0,0 +1 @@
+Fast searching of sorted arrays

basis/boxes/summary.txt

@@ -0,0 +1 @@
+An abstraction for enforcing a mutual-exclusion invariant

basis/circular/circular-docs.factor

@@ -43,7 +43,7 @@ HELP: push-growing-circular
      { "elt" object } { "circular" circular } }
 { $description "Pushes an element onto a " { $link growing-circular } " object." } ;
 
-ARTICLE: "circular" "circular"
+ARTICLE: "circular" "Circular sequences"
 "The " { $vocab-link "circular" } " vocabulary implements the " { $link "sequence-protocol" } " to allow an arbitrary start index and wrap-around indexing." $nl
 "Creating a new circular object:"
 { $subsection <circular> }

basis/colors/summary.txt

@@ -0,0 +1 @@
+Colors as a first-class data type

basis/combinators/short-circuit/short-circuit-docs.factor

@@ -64,7 +64,7 @@ HELP: n||-rewrite
      { "quot" quotation } }
 { $description "A macro that reqrites the code to pass " { $snippet "N" } " parameters from the stack to each OR quotation." } ;
 
-ARTICLE: "combinators.short-circuit" "combinators.short-circuit"
+ARTICLE: "combinators.short-circuit" "Short-circuit combinators"
 "The " { $vocab-link "combinators.short-circuit" } " vocabulary stops a computation early once a condition is met." $nl
 "AND combinators:"
 { $subsection 0&& }

basis/combinators/short-circuit/smart/smart-docs.factor

@@ -27,8 +27,9 @@ HELP: ||
     }
 } ;
 
-ARTICLE: "combinators.short-circuit.smart" "combinators.short-circuit.smart"
-"The " { $vocab-link "combinators.short-circuit.smart" } " vocabulary infers the number of inputs that the sequence of quotations takes." $nl
+ARTICLE: "combinators.short-circuit.smart" "Smart short-circuit combinators"
+"The " { $vocab-link "combinators.short-circuit.smart" } " vocabulary is similar to " { $vocab-link "combinators.short-circuit" } " except the combinators here infer the number of inputs that the sequence of quotations takes."
+$nl
 "Generalized AND:"
 { $subsection && }
 "Generalized OR:"

basis/eval/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/eval/summary.txt

@@ -0,0 +1 @@
+Ad-hoc evaluation of strings of code

basis/generalizations/authors.txt

@@ -0,0 +1,4 @@
+Chris Double
+Doug Coleman
+Eduardo Cavazos
+Slava Pestov

basis/generalizations/summary.txt

@@ -0,0 +1 @@
+Generalized stack shufflers and combinators to arbitrary numbers of inputs

basis/html/components/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/html/components/summary.txt

@@ -0,0 +1 @@
+HTML components for form rendering and validation

basis/html/components/tags.txt

@@ -0,0 +1 @@
+web

basis/html/elements/summary.txt

@@ -0,0 +1 @@
+Rendering HTML with a familiar look and feel

basis/html/elements/tags.txt

@@ -0,0 +1 @@
+web

basis/html/forms/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/html/forms/summary.txt

@@ -0,0 +1 @@
+HTML form rendering and validation

basis/html/forms/tags.txt

@@ -0,0 +1 @@
+web

basis/html/streams/summary.txt

@@ -1 +1 @@
-HTML reader, writer and utilities
+HTML implementation of formatted output stream protocol

basis/html/templates/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/html/templates/chloe/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/html/templates/chloe/chloe.factor

@@ -37,7 +37,11 @@ CHLOE: style
     ] ?if ;
 
 CHLOE: write-style
-    drop [ <style> write-style </style> ] [code] ;
+    drop [
+        <style "text/css" =type style>
+            write-style
+        </style>
+    ] [code] ;
 
 CHLOE: even
     [ "index" value even? swap when ] process-children ;

basis/html/templates/chloe/compiler/compiler.factor

@@ -123,8 +123,8 @@ DEFER: compile-element
 
 : compile-prologue ( xml -- )
     [
-        [ before>> compile-chunk ]
         [ prolog>> [ write-prolog ] [code-with] ]
+        [ before>> compile-chunk ]
         bi
     ] compile-quot
     [ if-not-nested ] [code] ;

basis/html/templates/chloe/summary.txt

@@ -0,0 +1 @@
+XHTML templating engine with extensible compiler and separation of concerns

basis/html/templates/chloe/tags.txt

@@ -0,0 +1 @@
+web

basis/html/templates/fhtml/authors.txt

@@ -1,2 +1,2 @@
 Slava Pestov
-Matthew Willis
+Alex Chapman

basis/html/templates/fhtml/summary.txt

@@ -0,0 +1 @@
+Simple templating engine mixing Factor code with content

basis/html/templates/fhtml/tags.txt

@@ -0,0 +1 @@
+web

basis/html/templates/summary.txt

@@ -0,0 +1 @@
+HTML templating engine interface

basis/html/templates/tags.txt

@@ -0,0 +1 @@
+web

basis/nmake/authors.txt

@@ -0,0 +1 @@
+Doug Coleman

basis/nmake/summary.txt

@@ -0,0 +1 @@
+Generalization of make for constructing several sequences simultaneously

basis/nmake/tags.txt

@@ -0,0 +1 @@
+collections

basis/present/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/present/summary.txt

@@ -0,0 +1 @@
+Generic word for converting objects to strings for human consumption

basis/random/authors.txt

@@ -0,0 +1,2 @@
+Doug Coleman
+Slava Pestov

basis/random/summary.txt

@@ -0,0 +1 @@
+Random number generator protocol and implementations

basis/smtp/smtp-docs.factor

@@ -41,7 +41,7 @@ HELP: send-email
     }
 } ;
 
-ARTICLE: "smtp" "SMTP Client Library"
+ARTICLE: "smtp" "SMTP client library"
 "Configuring SMTP:"
 { $subsection smtp-server }
 { $subsection smtp-read-timeout }

basis/summary/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/summary/summary.txt

@@ -0,0 +1 @@
+Generic word for converting an object into a brief one-line string

basis/symbols/summary.txt

@@ -0,0 +1 @@
+Utility for defining multiple symbols at a time

basis/urls/urls.factor

@@ -148,13 +148,6 @@ M: string >url
     ]
     [ url-decode >>anchor ] bi* ;
 
-<PRIVATE
-
-: unparse-username-password ( url -- )
-    dup username>> dup [
-        % password>> [ ":" % % ] when* "@" %
-    ] [ 2drop ] if ;
-
 : protocol-port ( protocol -- port )
     {
         { "http" [ 80 ] }
@@ -166,6 +159,11 @@ M: string >url
 
 <PRIVATE
 
+: unparse-username-password ( url -- )
+    dup username>> dup [
+        % password>> [ ":" % % ] when* "@" %
+    ] [ 2drop ] if ;
+
 : url-port ( url -- port/f )
     [ port>> ] [ port>> ] [ protocol>> protocol-port ] tri =
     [ drop f ] when ;

basis/validators/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

basis/validators/summary.txt

@@ -0,0 +1 @@
+Value validation for the web framework

core/checksums/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

core/checksums/summary.txt

@@ -0,0 +1 @@
+Checksum protocol and implementations

core/lexer/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

core/lexer/summary.txt

@@ -0,0 +1 @@
+Factor source code lexer

core/make/authors.txt

@@ -0,0 +1 @@
+Slava Pestov

core/make/summary.txt

@@ -0,0 +1 @@
+Sequence construction utility

core/make/tags.txt

@@ -0,0 +1 @@
+collections

core/sequences/sequences-docs.factor

@@ -1258,6 +1258,8 @@ ARTICLE: "sequence-protocol" "Sequence protocol"
 "At least one of the following two generic words must have a method for accessing elements; the " { $link sequence } " mixin has default definitions which are mutually recursive:"
 { $subsection nth }
 { $subsection nth-unsafe }
+"Note that sequences are always indexed starting from zero."
+$nl
 "At least one of the following two generic words must have a method for storing elements; the " { $link sequence } " mixin has default definitions which are mutually recursive:"
 { $subsection set-nth }
 { $subsection set-nth-unsafe }
@@ -1283,8 +1285,7 @@ ARTICLE: "virtual-sequences-protocol" "Virtual sequence protocol"
 
 ARTICLE: "virtual-sequences" "Virtual sequences"
 "Virtual sequences allow different ways of accessing a sequence without having to create a new sequence or a new data structure altogether. To do this, they translate the virtual index into a normal index into an underlying sequence using the " { $link "virtual-sequences-protocol" } "."
-$nl
-"One current limitation of the virtual sequence protocol is that sequences must be indexed starting at zero." ;
+{ $subsection "virtual-sequences-protocol" } ;
 
 ARTICLE: "sequences-integers" "Integer sequences and counted loops"
 "Integers support the sequence protocol in a trivial fashion; a non-negative integer presents its non-negative predecessors as elements. For example, the integer 3, when viewed as a sequence, contains the elements 0, 1, and 2. This is very useful for performing counted loops."

extra/webapps/wiki/wiki-common.xml

@@ -56,11 +56,9 @@
 
 		<t:if t:value="footer">
 			<tr>
-				<td colspan="2">
+				<td colspan="2" class="footer">
 					<t:bind t:name="footer">
-						<small>
-							<t:farkup t:name="parsed" t:parsed="true" />
-						</small>
+						<t:farkup t:name="parsed" t:parsed="true" />
 					</t:bind>
 				</td>
 			</tr>

extra/webapps/wiki/wiki.css

@@ -45,3 +45,7 @@
     background: #f5f1fd;
     width: 200px;
 }
+
+.footer {
+    font-size: 75%;
+}