accumulo-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From ctubb...@apache.org
Subject [2/4] accumulo git commit: Favor markdown over html
Date Fri, 29 Apr 2016 03:56:41 GMT
Favor markdown over html

Use markdown tables whenever possible
Fix broken html tables with markdown in wikisearch example
Use markdown for glossary
Fix sections with markdown instead of html in bylaws
Other minor fixes using markdown over html


Project: http://git-wip-us.apache.org/repos/asf/accumulo/repo
Commit: http://git-wip-us.apache.org/repos/asf/accumulo/commit/964cf811
Tree: http://git-wip-us.apache.org/repos/asf/accumulo/tree/964cf811
Diff: http://git-wip-us.apache.org/repos/asf/accumulo/diff/964cf811

Branch: refs/heads/gh-pages
Commit: 964cf811c421e215804e8c72f575902acf9daa91
Parents: d558c0d
Author: Christopher Tubbs <ctubbsii@apache.org>
Authored: Thu Apr 28 23:54:38 2016 -0400
Committer: Christopher Tubbs <ctubbsii@apache.org>
Committed: Thu Apr 28 23:54:38 2016 -0400

----------------------------------------------------------------------
 bylaws.md              | 141 +++---------
 css/accumulo.css       |   4 +-
 downloads/index.md     |  72 +++---
 example/wikisearch.md  | 528 +++++++++++++++-----------------------------
 glossary.md            | 170 +++++++++-----
 index.md               |  23 +-
 mailing_list.md        |  83 ++++---
 notable_features.md    |  47 ++--
 old_documentation.md   |  30 ++-
 papers/index.md        | 250 +++++----------------
 release_notes/1.5.1.md |  59 +----
 release_notes/1.5.2.md |  32 +--
 release_notes/1.5.3.md |  31 +--
 release_notes/1.5.4.md |  31 +--
 release_notes/1.6.0.md | 116 ++--------
 release_notes/1.6.1.md |  31 +--
 release_notes/1.6.2.md |  49 +---
 release_notes/1.6.3.md |  49 +---
 release_notes/1.6.4.md |  23 +-
 release_notes/1.6.5.md |  49 +---
 release_notes/1.7.0.md |  49 +---
 release_notes/1.7.1.md |  53 +----
 22 files changed, 619 insertions(+), 1301 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/bylaws.md
----------------------------------------------------------------------
diff --git a/bylaws.md b/bylaws.md
index 53458bd..291ed70 100644
--- a/bylaws.md
+++ b/bylaws.md
@@ -97,34 +97,18 @@ Within the Accumulo project, different types of decisions require different form
 
 Decisions regarding the project are made by votes on the primary project development mailing list: dev@accumulo.apache.org. Where necessary, PMC voting may take place on the private Accumulo PMC mailing list: private@accumulo.apache.org. Votes are clearly indicated by a subject line starting with [VOTE]. A vote message may only pertain to a single item’s approval; multiple items should be separated into multiple messages. Voting is carried out by replying to the vote mail. A vote may take on one of four forms, defined below.
 
-<table class="table">
-  <tr>
-    <th>Vote</th>
-    <th>Meaning</th>
-  </tr>
-  <tr>
-    <td>+1</td>
-    <td>'Yes,' 'Agree,' or 'The action should be performed.' In general, this vote also indicates a willingness on the behalf of the voter to 'make it happen'.</td>
-  </tr>
-  <tr>
-    <td>+0</td>
-    <td>This vote indicates a willingness for the action under consideration to go ahead. The voter, however, will not be able to help.</td>
-  </tr>
-  <tr>
-    <td>-0</td>
-    <td>This vote indicates that the voter does not, in general, agree with the proposed action but is not concerned enough to prevent the action going ahead.</td>
-  </tr>
-  <tr>
-    <td>-1</td>
-    <td>'No', 'Disagree', or 'The action should not be performed.' On issues where consensus is required, this vote counts as a veto. All vetoes must contain an explanation of why the veto is appropriate. Vetoes with no explanation are void. It may also be appropriate for a -1 vote to include an alternative course of action.</td>
-  </tr>
-</table>
+{: .table }
+| Vote | Meaning |
+|------|---------|
+| +1   | *Yes*, *Agree*, or *The action should be performed*. In general, this vote also indicates a willingness on the behalf of the voter to *make it happen*. |
+| +0   | This vote indicates a willingness for the action under consideration to go ahead. The voter, however, will not be able to help.                         |
+| -0   | This vote indicates that the voter does not, in general, agree with the proposed action but is not concerned enough to prevent the action going ahead.  |
+| -1   | *No*, *Disagree*, or *The action should not be performed*. On issues where consensus is required, this vote counts as a veto. All vetoes must contain an explanation of why the veto is appropriate. Vetoes with no explanation are void. It may also be appropriate for a -1 vote to include an alternative course of action. |
 
 All participants in the Accumulo project are encouraged to vote. For technical decisions, only the votes of active committers are binding. Non-binding votes are still useful for those with binding votes to understand the perception of an action across the wider Accumulo community. For PMC decisions, only the votes of active PMC members are binding.
 
 See the [voting page][voting] for more details on the mechanics of voting.
 
-<a id="CTR"></a>
 ## Commit Then Review (CTR)
 
 Voting can also be applied to changes to the Accumulo codebase. Under the Commit Then Review policy, committers can make changes to the codebase without seeking approval beforehand, and the changes are assumed to be approved unless an objection is raised. Only if an objection is raised must a vote take place on the code change.
@@ -135,24 +119,12 @@ For some code changes, committers may wish to get feedback from the community be
 
 These are the types of approvals that can be sought. Different actions require different types of approvals.
 
-<table class="table">
-  <tr>
-    <th>Approval Type</th>
-    <th>Definition</th>
-  </tr>
-  <tr>
-    <td>Consensus Approval</td>
-    <td>A consensus approval vote passes with 3 binding +1 votes and no binding vetoes.</td>
-  </tr>
-  <tr>
-    <td>Majority Approval</td>
-    <td>A majority approval vote passes with 3 binding +1 votes and more binding +1 votes than -1 votes.</td>
-  </tr>
-  <tr>
-    <td>Lazy Approval (or Lazy Consensus)</td>
-    <td>An action with lazy approval is implicitly allowed unless a -1 vote is received, at which time, depending on the type of action, either majority approval or consensus approval must be obtained.  Lazy Approval can be either <em>stated</em> or <em>assumed</em>, as detailed on the <a href="governance/lazyConsensus">lazy consensus page</a>.</td>
-  </tr>
-</table>
+{: .table }
+| Approval&nbsp;Type                | Definition                                                                                       |
+|-----------------------------------|--------------------------------------------------------------------------------------------------|
+| Consensus Approval                | A consensus approval vote passes with 3 binding +1 votes and no binding vetoes.                  |
+| Majority Approval                 | A majority approval vote passes with 3 binding +1 votes and more binding +1 votes than -1 votes. |
+| Lazy Approval (or Lazy Consensus) | An action with lazy approval is implicitly allowed unless a -1 vote is received, at which time, depending on the type of action, either majority approval or consensus approval must be obtained.  Lazy Approval can be either *stated* or *assumed*, as detailed on the [lazy consensus page][lazy]. |
 
 ## Vetoes
 
@@ -166,78 +138,18 @@ This section describes the various actions which are undertaken within the proje
 
 For Code Change actions, a committer may choose to employ assumed or stated Lazy Approval under the [CTR][ctr] policy. Assumed Lazy Approval has no minimum length of time before the change can be made.
 
-<table class="table">
-  <tr>
-    <th>Action</th>
-    <th>Description</th>
-    <th>Approval</th>
-    <th>Binding Votes</th>
-    <th>Min. Length (days)</th>
-  </tr>
-  <tr>
-    <td>Code Change</td>
-    <td>A change made to a codebase of the project. This includes source code, documentation, website content, etc.</td>
-    <td>Lazy approval, moving to consensus approval upon veto</td>
-    <td>Active committers</td>
-    <td>1</td>
-  </tr>
-  <tr>
-    <td>Release Plan</td>
-    <td>Defines the timetable and actions for an upcoming release. The plan also nominates a Release Manager.</td>
-    <td>Lazy approval, moving to majority approval upon veto</td>
-    <td>Active committers</td>
-    <td>3</td>
-  </tr>
-  <tr>
-    <td>Release Plan Cancellation</td>
-    <td>Cancels an active release plan, due to a need to re-plan (e.g., discovery of a major issue).</td>
-    <td>Majority approval</td>
-    <td>Active committers</td>
-    <td>3</td>
-  </tr>
-  <tr>
-    <td>Product Release</td>
-    <td>Accepts or rejects a release candidate as an official release of the project.</td>
-    <td>Majority approval</td>
-    <td>Active PMC members</td>
-    <td>3</td>
-  </tr>
-  <tr>
-    <td>Adoption of New Codebase</td>
-    <td>When the codebase for an existing, released product is to be replaced with an alternative codebase. If such a vote fails to gain approval, the existing code base will continue. This also covers the creation of new sub-projects within the project.</td>
-    <td>Consensus approval</td>
-    <td>Active PMC members</td>
-    <td>7</td>
-  </tr>
-  <tr>
-    <td>New Committer</td>
-    <td>When a new committer is proposed for the project.</td>
-    <td>Consensus approval</td>
-    <td>Active PMC members</td>
-    <td>3</td>
-  </tr>
-  <tr>
-    <td>New PMC Member</td>
-    <td>When a committer is proposed for the PMC.</td>
-    <td>Consensus approval</td>
-    <td>Active PMC members</td>
-    <td>3</td>
-  </tr>
-  <tr>
-    <td>New PMC Chair</td>
-    <td>When a new PMC chair is chosen to succeed an outgoing chair.</td>
-    <td>Consensus approval</td>
-    <td>Active PMC members</td>
-    <td>3</td>
-  </tr>
-  <tr>
-    <td>Modifying Bylaws</td>
-    <td>Modifying this document.</td>
-    <td>Consensus approval</td>
-    <td>Active PMC members</td>
-    <td>7</td>
-  </tr>
-</table>
+{: .table }
+| Action                    | Description                                                                                                 | Approval                                              | Binding Votes      | Min. Length (days) |
+|---------------------------|-------------------------------------------------------------------------------------------------------------|-------------------------------------------------------|--------------------|--------------------|
+| Code Change               | A change made to a codebase of the project. This includes source code, documentation, website content, etc. | Lazy approval, moving to consensus approval upon veto | Active committers  | 1                  |
+| Release Plan              | Defines the timetable and actions for an upcoming release. The plan also nominates a Release Manager.       | Lazy approval, moving to majority approval upon veto  | Active committers  | 3                  |
+| Release Plan Cancellation | Cancels an active release plan, due to a need to re-plan (e.g., discovery of a major issue).                | Majority approval                                     | Active committers  | 3                  |
+| Product Release           | Accepts or rejects a release candidate as an official release of the project.                               | Majority approval                                     | Active PMC members | 3                  |
+| Adoption of New Codebase  | When the codebase for an existing, released product is to be replaced with an alternative codebase. If such a vote fails to gain approval, the existing code base will continue. This also covers the creation of new sub-projects within the project. | Consensus approval | Active PMC members | 7 |
+| New Committer             | When a new committer is proposed for the project.                                                           | Consensus approval                                    | Active PMC members | 3                  |
+| New PMC Member            | When a committer is proposed for the PMC.                                                                   | Consensus approval                                    | Active PMC members | 3                  |
+| New PMC Chair             | When a new PMC chair is chosen to succeed an outgoing chair.                                                | Consensus approval                                    | Active PMC members | 3                  |
+| Modifying Bylaws          | Modifying this document.                                                                                    | Consensus approval                                    | Active PMC members | 7                  |
 
 No other voting actions are defined; all other actions should presume Lazy Approval (defaulting to Consensus Approval upon veto). If an action is voted on multiple times, or if a different approval type is desired, these bylaws should be amended to include the action.
 
@@ -275,6 +187,7 @@ All dates in a plan are estimates, as unforeseen issues may require delays. The
 [release-guidelines]: governance/releasing
 [release-mechanics]: releasing
 [voting]: governance/voting
-[ctr]: #CTR
+[ctr]: #commit-then-review-ctr
 [committer-terms]: https://www.apache.org/dev/committers#committer-set-term
 [pmc-removal]: https://www.apache.org/dev/pmc#pmc-removal
+[lazy]: governance/lazyConsensus

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/css/accumulo.css
----------------------------------------------------------------------
diff --git a/css/accumulo.css b/css/accumulo.css
index 5f1969c..a87a2c0 100644
--- a/css/accumulo.css
+++ b/css/accumulo.css
@@ -74,11 +74,11 @@ footer > p {
     border-collapse:collapse;
 }
 
-#release_notes_testing, #release_notes_testing tbody tr, #release_notes_testing tbody tr th, #release_notes_testing tbody tr td {
+#release_notes_testing, #release_notes_testing tr, #release_notes_testing th, #release_notes_testing td {
     border: 2px solid black;
 }
 
-#release_notes_testing tbody tr th, #release_notes_testing tbody tr td {
+#release_notes_testing th, #release_notes_testing td {
     padding: 5px;
 }
 

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/downloads/index.md
----------------------------------------------------------------------
diff --git a/downloads/index.md b/downloads/index.md
index 068db12..380ade0 100644
--- a/downloads/index.md
+++ b/downloads/index.md
@@ -79,7 +79,7 @@ var mirrorsCallback = function(json) {
 };
 
 // get mirrors when page is ready
-var mirrorURL = "/mirrors.cgi"; // http[s]://accumulo.apache.org/mirrors.cgi
+var mirrorURL = "http://accumulo.apache.org/mirrors.cgi"; // http[s]://accumulo.apache.org/mirrors.cgi
 $(function() { $.getJSON(mirrorURL + "?as_json", mirrorsCallback); });
 
 </script>
@@ -91,30 +91,21 @@ Be sure to verify your downloads by these [procedures][VERIFY_PROCEDURES] using
 
 ## Current Releases
 
-### 1.7.1 <span class="label label-primary">latest</span>
+### 1.7.1 **latest**{: .label .label-primary }
 
 The most recent Apache Accumulo&trade; release is version 1.7.1. See the [release notes][REL_NOTES_17] and [CHANGES][CHANGES_17].
 
 For convenience, [MD5][MD5SUM_17] and [SHA1][SHA1SUM_17] hashes are also available.
 
-<table class="table">
-<tr>
-<th>Generic Binaries</th>
-<td><a href="https://www.apache.org/dyn/closer.lua/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz" link-suffix="/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz" class="download_external" id="/downloads/accumulo-1.7.1-bin.tar.gz">accumulo-1.7.1-bin.tar.gz</a></td>
-<td><a href="https://www.apache.org/dist/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz.asc">ASC</a></td>
-</tr>
-<tr>
-<th>Source</th>
-<td><a href="https://www.apache.org/dyn/closer.lua/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz" link-suffix="/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz" class="download_external" id="/downloads/accumulo-1.7.1-src.tar.gz">accumulo-1.7.1-src.tar.gz</a></td>
-<td><a href="https://www.apache.org/dist/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz.asc">ASC</a></td>
-</tr>
-</table>
+{: .table }
+| **Generic Binaries** | [accumulo-1.7.1-bin.tar.gz][BIN_17] | [ASC][ASC_BIN_17] |
+| **Source**           | [accumulo-1.7.1-src.tar.gz][SRC_17] | [ASC][ASC_SRC_17] |
 
 #### 1.7 Documentation
-* <a href="https://github.com/apache/accumulo/blob/rel/1.7.1/README.md" class="download_external" id="/1.7/README">README</a>
+* [README][README_17]
 * [HTML User Manual][MANUAL_HTML_17]
 * [Examples][EXAMPLES_17]
-* <a href="{{ site.baseurl }}/1.7/apidocs" class="download_external" id="/1.7/apidocs">Javadoc</a>
+* [Javadoc][JAVADOC_17]
 
 ### 1.6.5
 
@@ -122,25 +113,16 @@ The most recent 1.6.x release of Apache Accumulo&trade; is version 1.6.5. See th
 
 For convenience, [MD5][MD5SUM_16] and [SHA1][SHA1SUM_16] hashes are also available.
 
-<table class="table">
-<tr>
-<th>Generic Binaries</th>
-<td><a href="https://www.apache.org/dyn/closer.lua/accumulo/1.6.5/accumulo-1.6.5-bin.tar.gz" link-suffix="/accumulo/1.6.5/accumulo-1.6.5-bin.tar.gz" class="download_external" id="/downloads/accumulo-1.6.5-bin.tar.gz">accumulo-1.6.5-bin.tar.gz</a></td>
-<td><a href="https://www.apache.org/dist/accumulo/1.6.5/accumulo-1.6.5-bin.tar.gz.asc">ASC</a></td>
-</tr>
-<tr>
-<th>Source</th>
-<td><a href="https://www.apache.org/dyn/closer.lua/accumulo/1.6.5/accumulo-1.6.5-src.tar.gz" link-suffix="/accumulo/1.6.5/accumulo-1.6.5-src.tar.gz" class="download_external" id="/downloads/accumulo-1.6.5-src.tar.gz">accumulo-1.6.5-src.tar.gz</a></td>
-<td><a href="https://www.apache.org/dist/accumulo/1.6.5/accumulo-1.6.5-src.tar.gz.asc">ASC</a></td>
-</tr>
-</table>
+{: .table }
+| **Generic Binaries** | [accumulo-1.6.5-bin.tar.gz][BIN_16] | [ASC][ASC_BIN_16] |
+| **Source**           | [accumulo-1.6.5-src.tar.gz][SRC_16] | [ASC][ASC_SRC_16] |
 
 #### 1.6 Documentation
-* <a href="https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;hb=rel/1.6.5" class="download_external" id="/1.6/README">README</a>
-* <a href="https://search.maven.org/remotecontent?filepath=org/apache/accumulo/accumulo-docs/1.6.5/accumulo-docs-1.6.5-user-manual.pdf" class="download_external" id="/1.6/accumulo_user_manual.pdf">PDF manual</a>
+* [README][README_16]
+* [PDF manual][MANUAL_PDF_16]
 * [html manual][MANUAL_HTML_16]
 * [examples][EXAMPLES_16]
-* <a href="{{ site.baseurl }}/1.6/apidocs" class="download_external" id="/1.6/apidocs">Javadoc</a>
+* [Javadoc][JAVADOC_16]
 
 ## Older releases
 
@@ -151,6 +133,34 @@ Older releases can be found in the [archives][ARCHIVES].
 [GPG_KEYS]: https://www.apache.org/dist/accumulo/KEYS "KEYS"
 [ARCHIVES]: https://archive.apache.org/dist/accumulo
 
+[ASC_BIN_16]: https://www.apache.org/dist/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz.asc
+[ASC_SRC_16]: https://www.apache.org/dist/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz.asc
+
+[ASC_BIN_17]: https://www.apache.org/dist/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz.asc
+[ASC_SRC_17]: https://www.apache.org/dist/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz.asc
+
+[BIN_16]: https://www.apache.org/dyn/closer.lua/accumulo/1.6.5/accumulo-1.6.5-bin.tar.gz
+{: .download_external link-suffix="/accumulo/1.6.5/accumulo-1.6.5-bin.tar.gz" id="/downloads/accumulo-1.6.5-bin.tar.gz" }
+[SRC_16]: https://www.apache.org/dyn/closer.lua/accumulo/1.6.5/accumulo-1.6.5-src.tar.gz
+{: .download_external link-suffix="/accumulo/1.6.5/accumulo-1.6.5-src.tar.gz" id="/downloads/accumulo-1.6.5-src.tar.gz" }
+
+[BIN_17]: https://www.apache.org/dyn/closer.lua/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz
+{: .download_external link-suffix="/accumulo/1.7.1/accumulo-1.7.1-bin.tar.gz" id="/downloads/accumulo-1.7.1-bin.tar.gz" }
+[SRC_17]: https://www.apache.org/dyn/closer.lua/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz
+{: .download_external link-suffix="/accumulo/1.7.1/accumulo-1.7.1-src.tar.gz" id="/downloads/accumulo-1.7.1-src.tar.gz" }
+
+[README_16]: https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;hb=rel/1.6.5
+{: .download_external id="/1.6/README" }
+[README_17]: https://github.com/apache/accumulo/blob/rel/1.7.1/README.md
+{: .download_external id="/1.7/README" }
+
+[JAVADOC_16]: {{ site.baseurl }}/1.6/apidocs
+{: .download_external id="/1.6/apidocs" }
+[JAVADOC_17]: {{ site.baseurl }}/1.7/apidocs
+{: .download_external id="/1.7/apidocs" }
+
+[MANUAL_PDF_16]: https://search.maven.org/remotecontent?filepath=org/apache/accumulo/accumulo-docs/1.6.5/accumulo-docs-1.6.5-user-manual.pdf
+{: .download_external id="/1.6/accumulo_user_manual.pdf" }
 [MANUAL_HTML_16]: {{ site.baseurl }}/1.6/accumulo_user_manual "1.6 user manual"
 [MANUAL_HTML_17]: {{ site.baseurl }}/1.7/accumulo_user_manual "1.7 user manual"
 

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/example/wikisearch.md
----------------------------------------------------------------------
diff --git a/example/wikisearch.md b/example/wikisearch.md
index c084ec1..51631f0 100644
--- a/example/wikisearch.md
+++ b/example/wikisearch.md
@@ -2,133 +2,110 @@
 title: The wikipedia search example explained, with performance numbers.
 ---
 
-Apache Accumulo Query Performance
---------------------------
+## Apache Accumulo Query Performance
 
-Sample Application
-------------------
+## Sample Application
 
-Starting with release 1.4, Accumulo includes an example web application that provides a flexible,  scalable search over the articles of Wikipedia, a widely available medium-sized corpus.
+Starting with release 1.4, Accumulo includes an example web application that
+provides a flexible, scalable search over the articles of Wikipedia, a widely
+available medium-sized corpus.
 
-The example uses an indexing technique helpful for doing multiple logical tests against content.  In this case, we can perform a word search on Wikipedia articles.   The sample application takes advantage of 3 unique capabilities of Accumulo:
+The example uses an indexing technique helpful for doing multiple logical tests
+against content. In this case, we can perform a word search on Wikipedia
+articles. The sample application takes advantage of 3 unique capabilities of
+Accumulo:
 
- 1. Extensible iterators that operate within the distributed tablet servers of the key-value store
- 2. Custom aggregators which can efficiently condense information during the various life-cycles of the log-structured merge tree 
- 3. Custom load balancing, which ensures that a table is evenly distributed on all tablet servers
+1. Extensible iterators that operate within the distributed tablet servers of
+   the key-value store
+1. Custom aggregators which can efficiently condense information during the
+   various life-cycles of the log-structured merge tree 
+1. Custom load balancing, which ensures that a table is evenly distributed on
+   all tablet servers
 
-In the example, Accumulo tracks the cardinality of all terms as elements are ingested.  If the cardinality is small enough, it will track the set of documents by term directly.  For example:
+In the example, Accumulo tracks the cardinality of all terms as elements are
+ingested. If the cardinality is small enough, it will track the set of
+documents by term directly. For example:
 
 <style type="text/css">
-table, td, th {
+table.wiki, table.wiki td, table.wiki th {
   padding-right: 5px;
   padding-left: 5px;
   border: 1px solid black;
   border-collapse: collapse;
 }
-td {
+table.wiki td {
   text-align: right;
 }
-.lt {
-  text-align: left;
-}
 </style>
 
-<table>
-<tr>
-<th>Row (word)</th>
-<th colspan="2">Value (count, document list)</th>
-</tr><tr>
-<td>Octopus
-<td>2
-<td class='lt'>[Document 57, Document 220]
-</tr><tr>
-<td>Other
-<td>172,849
-<td class='lt'>[]
-</tr><tr>
-<td>Ostrich
-<td>1
-<td class='lt'>[Document 901]
-</tr>
-</table>
-
-Searches can be optimized to focus on low-cardinality terms.  To create these counts, the example installs “aggregators” which are used to combine inserted values.  The ingester just writes simple  “(Octopus, 1, Document 57)” tuples.  The tablet servers then used the installed aggregators to merge the cells as the data is re-written, or queried.  This reduces the in-memory locking required to update high-cardinality terms, and defers aggregation to a later time, where it can be done more efficiently.
-
-The example also creates a reverse word index to map each word to the document in which it appears. But it does this by choosing an arbitrary partition for the document.  The article, and the word index for the article are grouped together into the same partition.  For example:
-
-<table>
-<tr>
-<th>Row (partition)
-<th>Column Family
-<th>Column Qualifier
-<th>Value
-<tr>
-<td>1
-<td>D
-<td>Document 57
-<td>“smart Octopus”
-<tr>
-<td>1
-<td>Word, Octopus
-<td>Document 57
-<td>
-<tr>
-<td>1
-<td>Word, smart
-<td>Document 57
-<td>
-<tr>
-<td>...
-<td>
-<td>
-<td>
-<tr>
-<td>2
-<td>D
-<td>Document 220
-<td>“big Octopus”
-<tr>
-<td>2
-<td>Word, big
-<td>Document 220
-<td>
-<tr>
-<td>2
-<td>Word, Octopus
-<td>Document 220
-<td>
-</table>
-
-Of course, there would be large numbers of documents in each partition, and the elements of those documents would be interlaced according to their sort order.
-
-By dividing the index space into partitions, the multi-word searches can be performed in parallel across all the nodes.  Also, by grouping the document together with its index, a document can be retrieved without a second request from the client.  The query “octopus” and “big” will be performed on all the servers, but only those partitions for which the low-cardinality term “octopus” can be found by using the aggregated reverse index information.  The query for a document is performed by extensions provided in the example.  These extensions become part of the tablet server's iterator stack.  By cloning the underlying iterators, the query extensions can seek to specific words within the index, and when it finds a matching document, it can then seek to the document location and retrieve the contents.
-
-We loaded the example on a  cluster of 10 servers, each with 12 cores, and 32G RAM, 6 500G drives.  Accumulo tablet servers were allowed a maximum of 3G of working memory, of which 2G was dedicated to caching file data.
-
-Following the instructions in the example, the Wikipedia XML data for articles was loaded for English, Spanish and German languages into 10 partitions.  The data is not partitioned by language: multiple languages were used to get a larger set of test data.  The data load took around 8 hours, and has not been optimized for scale.  Once the data was loaded, the content was compacted which took about 35 minutes.
-
-The example uses the language-specific tokenizers available from the Apache Lucene project for Wikipedia data.
+{: .wiki }
+| Row (word) | Value (count) | Value (document list)       |
+|------------|--------------:|:----------------------------|
+| Octopus    | 2             | [Document 57, Document 220] |
+| Other      | 172,849       | []                          |
+| Ostrich    | 1             | [Document 901]              |
+
+Searches can be optimized to focus on low-cardinality terms. To create these
+counts, the example installs "aggregators" which are used to combine inserted
+values. The ingester just writes simple "(Octopus, 1, Document 57)" tuples.
+The tablet servers then used the installed aggregators to merge the cells as
+the data is re-written, or queried. This reduces the in-memory locking
+required to update high-cardinality terms, and defers aggregation to a later
+time, where it can be done more efficiently.
+
+The example also creates a reverse word index to map each word to the document
+in which it appears. But it does this by choosing an arbitrary partition for
+the document. The article, and the word index for the article are grouped
+together into the same partition. For example:
+
+{: .wiki }
+| Row (partition) | Column Family | Column Qualifier | Value           |
+|-----------------|---------------|------------------|-----------------|
+| 1               | D             | Document 57      | "smart Octopus" |
+| 1               | Word, Octopus | Document 57      |                 |
+| 1               | Word, smart   | Document 57      |                 |
+| ...             |               |                  |                 |
+| 2               | D             | Document 220     | "big Octopus"   |
+| 2               | Word, big     | Document 220     |                 |
+| 2               | Word, Octopus | Document 220     |                 |
+
+Of course, there would be large numbers of documents in each partition, and the
+elements of those documents would be interlaced according to their sort order.
+
+By dividing the index space into partitions, the multi-word searches can be
+performed in parallel across all the nodes. Also, by grouping the document
+together with its index, a document can be retrieved without a second request
+from the client. The query "octopus" and "big" will be performed on all the
+servers, but only those partitions for which the low-cardinality term "octopus"
+can be found by using the aggregated reverse index information. The query for a
+document is performed by extensions provided in the example. These extensions
+become part of the tablet server's iterator stack. By cloning the underlying
+iterators, the query extensions can seek to specific words within the index,
+and when it finds a matching document, it can then seek to the document
+location and retrieve the contents.
+
+We loaded the example on a cluster of 10 servers, each with 12 cores, and 32G
+RAM, 6 500G drives. Accumulo tablet servers were allowed a maximum of 3G of
+working memory, of which 2G was dedicated to caching file data.
+
+Following the instructions in the example, the Wikipedia XML data for articles
+was loaded for English, Spanish and German languages into 10 partitions. The
+data is not partitioned by language: multiple languages were used to get a
+larger set of test data. The data load took around 8 hours, and has not been
+optimized for scale. Once the data was loaded, the content was compacted which
+took about 35 minutes.
+
+The example uses the language-specific tokenizers available from the Apache
+Lucene project for Wikipedia data.
 
 Original files:
 
-<table>
-<tr>
-<th>Articles
-<th>Compressed size
-<th>Filename
-<tr>
-<td>1.3M
-<td>2.5G
-<td>dewiki-20111120-pages-articles.xml.bz2
-<tr>
-<td>3.8M
-<td>7.9G
-<td>enwiki-20111115-pages-articles.xml.bz2
-<tr>
-<td>0.8M
-<td>1.4G
-<td>eswiki-20111112-pages-articles.xml.bz2
-</table>
+{: .wiki }
+| Articles | Compressed size | Filename                               |
+|----------|-----------------|----------------------------------------|
+| 1.3M     | 2.5G            | dewiki-20111120-pages-articles.xml.bz2 |
+| 3.8M     | 7.9G            | enwiki-20111115-pages-articles.xml.bz2 |
+| 0.8M     | 1.4G            | eswiki-20111112-pages-articles.xml.bz2 |
 
 The resulting tables:
 
@@ -140,246 +117,107 @@ The resulting tables:
 
 Roughly a 6:1 increase in size.
 
-We performed the following queries, and repeated the set 5 times.  The query language is much more expressive than what is shown below.  The actual query specified that these words were to be found in the body of the article.  Regular expressions, searches within titles, negative tests, etc are available.
-
-<table>
-<tr>
-<th>Query
-<th colspan="5">Samples (seconds)
-<th>Matches
-<th>Result Size
-<tr>
-<td>“old” and “man” and “sea”
-<td>4.07
-<td>3.79
-<td>3.65
-<td>3.85
-<td>3.67
-<td>22,956
-<td>3,830,102
-<tr>
-<td>“paris” and “in” and “the” and “spring”
-<td>3.06
-<td>3.06
-<td>2.78
-<td>3.02
-<td>2.92
-<td>10,755
-<td>1,757,293
-<tr>
-<td>“rubber” and “ducky” and “ernie”
-<td>0.08
-<td>0.08
-<td>0.1
-<td>0.11
-<td>0.1
-<td>6
-<td>808
-<tr>
-<td>“fast”  and ( “furious” or “furriest”) 
-<td>1.34
-<td>1.33
-<td>1.3
-<td>1.31
-<td>1.31
-<td>2,973
-<td>493,800
-<tr>
-<td>“slashdot” and “grok”
-<td>0.06
-<td>0.06
-<td>0.06
-<td>0.06
-<td>0.06
-<td>14
-<td>2,371
-<tr>
-<td>“three” and “little” and “pigs”
-<td>0.92
-<td>0.91
-<td>0.9
-<td>1.08
-<td>0.88
-<td>2,742
-<td>481,531
-</table>
-
-Because the terms are tested together within the tablet server, even fairly high-cardinality terms such as “old,” “man,” and “sea” can be tested efficiently, without needing to return to the client, or make distributed calls between servers to perform the intersection between terms.
-
-For reference, here are the cardinalities for all the terms in the query (remember, this is across all languages loaded):
-
-<table>
-<tr> <th>Term <th> Cardinality
-<tr> <td> ducky <td> 795
-<tr> <td> ernie <td> 13,433
-<tr> <td> fast <td> 166,813
-<tr> <td> furious <td> 10,535
-<tr> <td> furriest <td> 45
-<tr> <td> grok <td> 1,168
-<tr> <td> in <td> 1,884,638
-<tr> <td> little <td> 320,748
-<tr> <td> man <td> 548,238
-<tr> <td> old <td> 720,795
-<tr> <td> paris <td> 232,464
-<tr> <td> pigs <td> 8,356
-<tr> <td> rubber <td> 17,235
-<tr> <td> sea <td> 247,231
-<tr> <td> slashdot <td> 2,343
-<tr> <td> spring <td> 125,605
-<tr> <td> the <td> 3,509,498
-<tr> <td> three <td> 718,810
-</table>
-
-
-Accumulo supports caching index information, which is turned on by default, and for the non-index blocks of a file, which is not. After turning on data block caching for the wiki table:
-
-<table>
-<tr>
-<th>Query
-<th colspan="5">Samples (seconds)
-<tr>
-<td>“old” and “man” and “sea”
-<td>2.47
-<td>2.48
-<td>2.51
-<td>2.48
-<td>2.49
-</tr><tr>
-<td>“paris” and “in” and “the” and “spring”
-<td>1.33
-<td>1.42
-<td>1.6
-<td>1.61
-<td>1.47
-</tr><tr>
-<td>“rubber” and “ducky” and “ernie”
-<td>0.07
-<td>0.08
-<td>0.07
-<td>0.07
-<td>0.07
-</tr><tr>
-<td>“fast” and ( “furious” or “furriest”) 
-<td>1.28
-<td>0.78
-<td>0.77
-<td>0.79
-<td>0.78
-</tr><tr>
-<td>“slashdot” and “grok”
-<td>0.04
-<td>0.04
-<td>0.04
-<td>0.04
-<td>0.04
-</tr><tr>
-<td>“three” and “little” and “pigs”
-<td>0.55
-<td>0.32
-<td>0.32
-<td>0.31
-<td>0.27
-</tr>
-<table>
-<p>
-For comparison, these are the cold start lookup times (restart Accumulo, and drop the operating system disk cache):
-
-<table>
-<tr>
-<th>Query
-<th>Sample
-<tr>
-<td>“old” and “man” and “sea”
-<td>13.92
-<tr>
-<td>“paris” and “in” and “the” and “spring”
-<td>8.46
-<tr>
-<td>“rubber” and “ducky” and “ernie”
-<td>2.96
-<tr>
-<td>“fast” and ( “furious” or “furriest”) 
-<td>6.77
-<tr>
-<td>“slashdot” and “grok”
-<td>4.06
-<tr>
-<td>“three” and “little” and “pigs”
-<td>8.13
-</table>
+We performed the following queries, and repeated the set 5 times. The query
+language is much more expressive than what is shown below. The actual query
+specified that these words were to be found in the body of the article. Regular
+expressions, searches within titles, negative tests, etc are available.
+
+{: .wiki }
+| Query                                   | Sample 1 (seconds) | Sample 2 (seconds) | Sample 3 (seconds) | Sample 4 (seconds) | Sample 5 (seconds) | Matches | Result Size |
+|-----------------------------------------|------|------|------|------|------|--------|-----------|
+| "old" and "man" and "sea"               | 4.07 | 3.79 | 3.65 | 3.85 | 3.67 | 22,956 | 3,830,102 |
+| "paris" and "in" and "the" and "spring" | 3.06 | 3.06 | 2.78 | 3.02 | 2.92 | 10,755 | 1,757,293 |
+| "rubber" and "ducky" and "ernie"        | 0.08 | 0.08 | 0.1  | 0.11 | 0.1  | 6      | 808       |
+| "fast" and ( "furious" or "furriest")   | 1.34 | 1.33 | 1.3  | 1.31 | 1.31 | 2,973  | 493,800   |
+| "slashdot" and "grok"                   | 0.06 | 0.06 | 0.06 | 0.06 | 0.06 | 14     | 2,371     |
+| "three" and "little" and "pigs"         | 0.92 | 0.91 | 0.9  | 1.08 | 0.88 | 2,742  | 481,531   |
+
+Because the terms are tested together within the tablet server, even fairly
+high-cardinality terms such as "old," "man," and "sea" can be tested
+efficiently, without needing to return to the client, or make distributed calls
+between servers to perform the intersection between terms.
+
+For reference, here are the cardinalities for all the terms in the query
+(remember, this is across all languages loaded):
+
+{: .wiki }
+| Term     | Cardinality |
+|----------|-------------|
+| ducky    | 795         |
+| ernie    | 13,433      |
+| fast     | 166,813     |
+| furious  | 10,535      |
+| furriest | 45          |
+| grok     | 1,168       |
+| in       | 1,884,638   |
+| little   | 320,748     |
+| man      | 548,238     |
+| old      | 720,795     |
+| paris    | 232,464     |
+| pigs     | 8,356       |
+| rubber   | 17,235      |
+| sea      | 247,231     |
+| slashdot | 2,343       |
+| spring   | 125,605     |
+| the      | 3,509,498   |
+| three    | 718,810     |
+
+Accumulo supports caching index information, which is turned on by default, and
+for the non-index blocks of a file, which is not. After turning on data block
+  caching for the wiki table:
+
+{: .wiki }
+| Query                                   | Sample 1 (seconds) | Sample 2 (seconds) | Sample 3 (seconds) | Sample 4 (seconds) | Sample 5 (seconds) |
+|-----------------------------------------|------|------|------|------|------|
+| "old" and "man" and "sea"               | 2.47 | 2.48 | 2.51 | 2.48 | 2.49 |
+| "paris" and "in" and "the" and "spring" | 1.33 | 1.42 | 1.6  | 1.61 | 1.47 |
+| "rubber" and "ducky" and "ernie"        | 0.07 | 0.08 | 0.07 | 0.07 | 0.07 |
+| "fast" and ( "furious" or "furriest")   | 1.28 | 0.78 | 0.77 | 0.79 | 0.78 |
+| "slashdot" and "grok"                   | 0.04 | 0.04 | 0.04 | 0.04 | 0.04 |
+| "three" and "little" and "pigs"         | 0.55 | 0.32 | 0.32 | 0.31 | 0.27 |
+
+For comparison, these are the cold start lookup times (restart Accumulo, and
+drop the operating system disk cache):
+
+{: .wiki }
+| Query                                   | Sample |
+|-----------------------------------------|--------|
+| "old" and "man" and "sea"               | 13.92  |
+| "paris" and "in" and "the" and "spring" | 8.46   |
+| "rubber" and "ducky" and "ernie"        | 2.96   |
+| "fast" and ( "furious" or "furriest")   | 6.77   |
+| "slashdot" and "grok"                   | 4.06   |
+| "three" and "little" and "pigs"         | 8.13   |
 
 ### Random Query Load
 
-Random queries were generated using common english words.  A uniform random sample of 3 to 5 words taken from the 10000 most common words in the Project Gutenberg's online text collection were joined with “and”.  Words containing anything other than letters (such as contractions) were not used.  A client was started simultaneously on each of the 10 servers and each ran 100 random queries (1000 queries total).
-
-
-<table>
-<tr>
-<th>Time
-<th>Count
-<tr>
-<td>41.97
-<td>440,743
-<tr>
-<td>41.61
-<td>320,522
-<tr>
-<td>42.11
-<td>347,969
-<tr>
-<td>38.32
-<td>275,655
-</table>
+Random queries were generated using common english words. A uniform random
+sample of 3 to 5 words taken from the 10000 most common words in the Project
+Gutenberg's online text collection were joined with "and". Words containing
+anything other than letters (such as contractions) were not used. A client was
+started simultaneously on each of the 10 servers and each ran 100 random
+queries (1000 queries total).
+
+{: .wiki }
+| Time  | Count   |
+|-------|---------|
+| 41.97 | 440,743 |
+| 41.61 | 320,522 |
+| 42.11 | 347,969 |
+| 38.32 | 275,655 |
 
 ### Query Load During Ingest
 
-The English wikipedia data was re-ingested on top of the existing, compacted data. The following  query samples were taken in 5 minute intervals while ingesting 132 articles/second:
-
-
-<table>
-<tr>
-<th>Query
-<th colspan="5">Samples (seconds)
-<tr>
-<td>“old” and “man” and “sea”
-<td>4.91
-<td>3.92
-<td>11.58
-<td>9.86
-<td>10.21
-<tr>
-<td>“paris” and “in” and “the” and “spring”
-<td>5.03
-<td>3.37
-<td>12.22
-<td>3.29
-<td>9.46
-<tr>
-<td>“rubber” and “ducky” and “ernie”
-<td>4.21
-<td>2.04
-<td>8.57
-<td>1.54
-<td>1.68
-<tr>
-<td>“fast”  and ( “furious” or “furriest”) 
-<td>5.84
-<td>2.83
-<td>2.56
-<td>3.12
-<td>3.09
-<tr>
-<td>“slashdot” and “grok”
-<td>5.68
-<td>2.62
-<td>2.2
-<td>2.78
-<td>2.8
-<tr>
-<td>“three” and “little” and “pigs”
-<td>7.82
-<td>3.42
-<td>2.79
-<td>3.29
-<td>3.3
-</table>
+The English wikipedia data was re-ingested on top of the existing, compacted
+data. The following query samples were taken in 5 minute intervals while
+ingesting 132 articles/second:
+
+{: .wiki }
+| Query                                   | Sample 1 (seconds)  | Sample 2 (seconds) | Sample 3 (seconds) | Sample 4 (seconds) | Sample 5 (seconds) |
+|-----------------------------------------|------|------|-------|------|-------|
+| "old" and "man" and "sea"               | 4.91 | 3.92 | 11.58 | 9.86 | 10.21 |
+| "paris" and "in" and "the" and "spring" | 5.03 | 3.37 | 12.22 | 3.29 | 9.46  |
+| "rubber" and "ducky" and "ernie"        | 4.21 | 2.04 | 8.57  | 1.54 | 1.68  |
+| "fast" and ( "furious" or "furriest")   | 5.84 | 2.83 | 2.56  | 3.12 | 3.09  |
+| "slashdot" and "grok"                   | 5.68 | 2.62 | 2.2   | 2.78 | 2.8   |
+| "three" and "little" and "pigs"         | 7.82 | 3.42 | 2.79  | 3.29 | 3.3   |

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/glossary.md
----------------------------------------------------------------------
diff --git a/glossary.md b/glossary.md
index 67330eb..4b8761e 100644
--- a/glossary.md
+++ b/glossary.md
@@ -3,56 +3,122 @@ title: Glossary
 nav: nav_glossary
 ---
 
-<dl>
-<dt>authorizations</dt>
-<dd>a set of strings associated with a user or with a particular scan that will be used to determine which key/value pairs are visible to the user.</dd>
-<dt>cell</dt>
-<dd>a set of key/value pairs whose keys differ only in timestamp.</dd>
-<dt>column</dt>
-<dd>the portion of the key that sorts after the row and is divided into family, qualifier, and visibility.</dd>
-<dt>column family</dt>
-<dd>the portion of the key that sorts second and controls locality groups, the row/column hybrid nature of accumulo.</dd>
-<dt>column qualifier</dt>
-<dd>the portion of the key that sorts third and provides additional key uniqueness.</dd>
-<dt>column visibility</dt>
-<dd>the portion of the key that sorts fourth and controls user access to individual key/value pairs. Visibilities are boolean AND (&) and OR (|) combinations of authorization strings with parentheses required to determine ordering, e.g. (AB&C)|DEF.</dd>
-<dt>iterator</dt>
-<dd>a mechanism for modifying tablet-local portions of the key/value space. Iterators are used for standard administrative tasks as well as for custom processing.</dd>
-<dt>iterator priority</dt>
-<dd>an iterator must be configured with a particular scope and priority.  When a tablet server enters that scope, it will instantiate iterators in priority order starting from the smallest priority and ending with the largest, and apply each to the data read before rewriting the data or sending the data to the user.</dd>
-<dt>iterator scopes</dt>
-<dd>the possible scopes for iterators are where the tablet server is already reading and/or writing data: minor compaction / flush time (<em>minc</em> scope), major compaction / file merging time (<em>majc</em> scope), and query time (<em>scan</em> scope).</dd>
-<dt>gc</dt>
-<dd>process that identifies temporary files in HDFS that are no longer needed by any process, and deletes them.</dd>
-<dt>key</dt>
-<dd>the key into the distributed sorted map which is accumulo.  The key is subdivided into row, column, and timestamp.  The column is further divided into  family, qualifier, and visibility.</dd>
-<dt>locality group</dt>
-<dd>a set of column families that will be grouped together on disk.  With no locality groups configured, data is stored on disk in row order.  If each column family were configured to be its own locality group, the data for each column would be stored separately, in row order.  Configuring sets of columns into locality groups is a compromise between the two approaches and will improve performance when multiple columns are accessed in the same scan.</dd>
-<dt>log-structured merge-tree</dt>
-<dd>the sorting / flushing / merging scheme on which BigTable's design is based.</dd>
-<dt>logger</dt>
-<dd>in 1.4 and older, process that accepts updates to tablet servers and writes them to local on-disk storage for redundancy. in 1.5 the functionality was subsumed by the tablet server and datanode with HDFS writes.</dd>
-<dt>major compaction</dt>
-<dd>merging multiple files into a single file.  If all of a tablet's files are merged into a single file, it is called a <em>full major compaction</em>.</dd>
-<dt>master</dt>
-<dd>process that detects and responds to tablet failures, balances load across tablet servers by assigning and migrating tablets when required, coordinates table operations, and handles tablet server logistics (startup, shutdown, recovery).</dd>
-<dt>minor compaction</dt>
-<dd>flushing data from memory to disk.  Usually this creates a new file for a tablet, but if the memory flushed is merge-sorted in with data from an existing file (replacing that file), it is called a <em>merging minor compaction</em>.</dd>
-<dt>monitor</dt>
-<dd>process that displays status and usage information for all Accumulo components.</dd>
-<dt>permissions</dt>
-<dd>administrative abilities that must be given to a user such as creating tables or users and changing permissions or configuration parameters.</dd>
-<dt>row</dt>
-<dd>the portion of the key that controls atomicity.  Keys with the same row are guaranteed to remain on a single tablet hosted by a single tablet server, therefore multiple key/value pairs can be added to or removed from a row at the same time. The row is used for the primary sorting of the key.</dd>
-<dt>scan</dt>
-<dd>reading a range of key/value pairs.</dd>
-<dt>tablet</dt>
-<dd>a contiguous key range; the unit of work for a tablet server.</dd>
-<dt>tablet servers</dt>
-<dd>a set of servers that hosts reads and writes for tablets.  Each server hosts a distinct set of tablets at any given time, but the tablets may be hosted by different servers over time.</dd>
-<dt>timestamp</dt>
-<dd>the portion of the key that controls versioning.  Otherwise identical keys with differing timestamps are considered to be versions of a single <em>cell</em>.  Accumulo can be configured to keep the <em>N</em> newest versions of each <em>cell</em>.  When a deletion entry is inserted, it deletes all earlier versions for its cell.</dd>
-<dt>value</dt>
-<dd>immutable bytes associated with a particular key.</dd>
-</dl>
+
+authorizations
+: a set of strings associated with a user or with a particular scan that will
+be used to determine which key/value pairs are visible to the user.
+
+cell
+: a set of key/value pairs whose keys differ only in timestamp.
+
+column
+: the portion of the key that sorts after the row and is divided into family,
+qualifier, and visibility.
+
+column family
+: the portion of the key that sorts second and controls locality groups, the
+row/column hybrid nature of accumulo.
+
+column qualifier
+: the portion of the key that sorts third and provides additional key
+uniqueness.
+
+column visibility
+: the portion of the key that sorts fourth and controls user access to
+individual key/value pairs. Visibilities are boolean AND (&amp;) and OR (|)
+combinations of authorization strings with parentheses required to determine
+ordering, e.g. (AB&amp;C)|DEF.
+
+iterator
+: a mechanism for modifying tablet-local portions of the key/value space.
+Iterators are used for standard administrative tasks as well as for custom
+processing.
+
+iterator priority
+: an iterator must be configured with a particular scope and priority. When a
+tablet server enters that scope, it will instantiate iterators in priority
+order starting from the smallest priority and ending with the largest, and
+apply each to the data read before rewriting the data or sending the data to
+the user.
+
+iterator scopes
+: the possible scopes for iterators are where the tablet server is already
+reading and/or writing data: minor compaction / flush time (*minc*
+scope), major compaction / file merging time (*majc* scope), and query
+time (*scan* scope).
+
+gc
+: process that identifies temporary files in HDFS that are no longer needed by
+any process, and deletes them.
+
+key
+: the key into the distributed sorted map which is accumulo. The key is
+subdivided into row, column, and timestamp. The column is further divided into
+family, qualifier, and visibility.
+
+locality group
+: a set of column families that will be grouped together on disk. With no
+locality groups configured, data is stored on disk in row order. If each
+column family were configured to be its own locality group, the data for each
+column would be stored separately, in row order. Configuring sets of columns
+into locality groups is a compromise between the two approaches and will
+improve performance when multiple columns are accessed in the same scan.
+
+log-structured merge-tree
+: the sorting / flushing / merging scheme on which BigTable's design is based.
+
+logger
+: in 1.4 and older, process that accepts updates to tablet servers and writes
+them to local on-disk storage for redundancy. in 1.5 the functionality was
+subsumed by the tablet server and datanode with HDFS writes.
+
+major compaction
+: merging multiple files into a single file. If all of a tablet's files are
+merged into a single file, it is called a *full major compaction*.
+
+master
+: process that detects and responds to tablet failures, balances load across
+tablet servers by assigning and migrating tablets when required, coordinates
+table operations, and handles tablet server logistics (startup, shutdown,
+recovery).
+
+minor compaction
+: flushing data from memory to disk. Usually this creates a new file for a
+tablet, but if the memory flushed is merge-sorted in with data from an existing
+file (replacing that file), it is called a *merging minor compaction*.
+
+monitor
+: process that displays status and usage information for all Accumulo
+components.
+
+permissions
+: administrative abilities that must be given to a user such as creating tables
+or users and changing permissions or configuration parameters.
+
+row
+: the portion of the key that controls atomicity. Keys with the same row are
+guaranteed to remain on a single tablet hosted by a single tablet server,
+therefore multiple key/value pairs can be added to or removed from a row at the
+same time. The row is used for the primary sorting of the key.
+
+scan
+: reading a range of key/value pairs.
+
+tablet
+: a contiguous key range; the unit of work for a tablet server.
+
+tablet servers
+: a set of servers that hosts reads and writes for tablets. Each server hosts
+a distinct set of tablets at any given time, but the tablets may be hosted by
+different servers over time.
+
+timestamp
+: the portion of the key that controls versioning. Otherwise identical keys
+with differing timestamps are considered to be versions of a single
+*cell*. Accumulo can be configured to keep the *N* newest
+versions of each *cell*. When a deletion entry is inserted, it deletes
+all earlier versions for its cell.
+
+value
+: immutable bytes associated with a particular key.
 

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/index.md
----------------------------------------------------------------------
diff --git a/index.md b/index.md
index b18caf1..d9146d7 100644
--- a/index.md
+++ b/index.md
@@ -6,22 +6,21 @@ nav: nav_index
 
 <br>
 <div class="jumbotron" style="text-align: center">
-<p>
-The Apache Accumulo&trade; sorted, distributed key/value store is a robust, scalable, high performance data storage and retrieval system.  
-</p>
+<p>The Apache Accumulo&trade; sorted, distributed key/value store is a robust, scalable, high performance data storage and retrieval system.</p>
 <a class="btn btn-success btn-lg" href="downloads/" role="button"><span class="glyphicon glyphicon-download"></span> Download</a>
 </div>
 
-Apache Accumulo is based on Google's [BigTable][1] design and is built on
-top of [Apache Hadoop][2], [Apache Zookeeper][3], and [Apache Thrift][4].  Apache Accumulo features a few novel 
-improvements on the BigTable design in the form of cell-based access control and a server-side
-programming mechanism that can modify key/value pairs at various points in the
-data management process.  Other notable improvements and feature are outlined
-[here](notable_features).
+Apache Accumulo is based on Google's [BigTable][1] design and is built on top
+of [Apache Hadoop][2], [Apache Zookeeper][3], and [Apache Thrift][4]. Apache
+Accumulo features a few novel improvements on the BigTable design in the form
+of cell-based access control and a server-side programming mechanism that can
+modify key/value pairs at various points in the data management process. Other
+notable improvements and feature are outlined [here](notable_features).
 
-Google published the design of BigTable in 2006.  Several other open source
-projects have implemented aspects of this design including [Apache HBase][5], [Hypertable][6],
-and [Apache Cassandra][7].  Accumulo began its development in 2008 and joined the [Apache community][8] in 2011.
+Google published the design of BigTable in 2006. Several other open source
+projects have implemented aspects of this design including [Apache HBase][5],
+[Hypertable][6], and [Apache Cassandra][7]. Accumulo began its development in
+2008 and joined the [Apache community][8] in 2011.
 
 [1]: https://research.google.com/archive/bigtable.html "BigTable"
 [2]: https://hadoop.apache.org                   "Apache Hadoop"

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/mailing_list.md
----------------------------------------------------------------------
diff --git a/mailing_list.md b/mailing_list.md
index 6b939cc..09fbb42 100644
--- a/mailing_list.md
+++ b/mailing_list.md
@@ -7,42 +7,13 @@ All Accumulo mailing lists are in the accumulo.apache.org domain. Please note
 that search providers linked on this page are not part of the [official Apache
 mailing list archives][5].
 
-<table class="table">
-
-<tr>
-<th>user</th>
-<td>For general user questions, help, and announcements.</td>
-<td><a href="https://mail-archives.apache.org/mod_mbox/accumulo-user" class="btn btn-primary btn-xs"><span class="glyphicon glyphicon-book"></span> Archive</a> <a href="https://www.mail-archive.com/user@accumulo.apache.org/" class="btn btn-info btn-xs"><span class="glyphicon glyphicon-search"></span> Search</a></td>
-<td><a href="mailto:user-subscribe@accumulo.apache.org" class="btn btn-success btn-xs"><span class="glyphicon glyphicon-plus"></span> Subscribe</a> <a href="mailto:user-unsubscribe@accumulo.apache.org" class="btn btn-danger btn-xs"><span class="glyphicon glyphicon-remove"></span> Unsubscribe</a></td>
-<td><a href="mailto:user@accumulo.apache.org" class="btn btn-warning btn-xs"><span class="glyphicon glyphicon-envelope"></span> Post</a></td>
-</tr>
-
-<tr>
-<th>dev</th>
-<td>For anyone interested in contributing or following development activities.
-It is recommended that you also subscribe to <b>notifications</b>.</td>
-<td><a href="https://mail-archives.apache.org/mod_mbox/accumulo-dev" class="btn btn-primary btn-xs"><span class="glyphicon glyphicon-book"></span> Archive</a> <a href="https://www.mail-archive.com/dev@accumulo.apache.org/" class="btn btn-info btn-xs"><span class="glyphicon glyphicon-search"></span> Search</a></td>
-<td><a href="mailto:dev-subscribe@accumulo.apache.org" class="btn btn-success btn-xs"><span class="glyphicon glyphicon-plus"></span> Subscribe</a> <a href="mailto:dev-unsubscribe@accumulo.apache.org" class="btn btn-danger btn-xs"><span class="glyphicon glyphicon-remove"></span> Unsubscribe</a></td>
-<td><a href="mailto:dev@accumulo.apache.org" class="btn btn-warning btn-xs"><span class="glyphicon glyphicon-envelope"></span> Post</a></td>
-</tr>
-
-<tr>
-<th>commits</th>
-<td>For following commits.</td>
-<td><a href="https://mail-archives.apache.org/mod_mbox/accumulo-commits" class="btn btn-primary btn-xs"><span class="glyphicon glyphicon-book"></span> Archive</a> <a href="https://www.mail-archive.com/commits@accumulo.apache.org/" class="btn btn-info btn-xs"><span class="glyphicon glyphicon-search"></span> Search</a></td>
-<td><a href="mailto:commits-subscribe@accumulo.apache.org" class="btn btn-success btn-xs"><span class="glyphicon glyphicon-plus"></span> Subscribe</a> <a href="mailto:commits-unsubscribe@accumulo.apache.org" class="btn btn-danger btn-xs"><span class="glyphicon glyphicon-remove"></span> Unsubscribe</a></td>
-<td></td>
-</tr>
-
-<tr>
-<th>notifications</th>
-<td>For following JIRA notifications.</td>
-<td><a href="https://mail-archives.apache.org/mod_mbox/accumulo-notifications" class="btn btn-primary btn-xs"><span class="glyphicon glyphicon-book"></span> Archive</a> <a href="https://www.mail-archive.com/notifications@accumulo.apache.org/" class="btn btn-info btn-xs"><span class="glyphicon glyphicon-search"></span> Search</a></td>
-<td><a href="mailto:notifications-subscribe@accumulo.apache.org" class="btn btn-success btn-xs"><span class="glyphicon glyphicon-plus"></span> Subscribe</a> <a href="mailto:notifications-unsubscribe@accumulo.apache.org" class="btn btn-danger btn-xs"><span class="glyphicon glyphicon-remove"></span> Unsubscribe</a></td>
-<td></td>
-</tr>
-
-</table>
+{: .table }
+| Name              | Description                                      | Read | Follow | Post |
+|-------------------|--------------------------------------------------|------|--------|------|
+| **user**          | General user questions, help, and announcements  | [<span class="glyphicon glyphicon-book"/> Archive][U_A] [<span class="glyphicon glyphicon-search"/> Search][U_S] | [<span class="glyphicon glyphicon-plus"/> Subscribe][U_SU] [<span class="glyphicon glyphicon-remove"/> Unsubscribe][U_UN] | [<span class="glyphicon glyphicon-envelope"/> Post][U_P] |
+| **dev**           | Contributor discussions and development activity | [<span class="glyphicon glyphicon-book"/> Archive][D_A] [<span class="glyphicon glyphicon-search"/> Search][D_S] | [<span class="glyphicon glyphicon-plus"/> Subscribe][D_SU] [<span class="glyphicon glyphicon-remove"/> Unsubscribe][D_UN] | [<span class="glyphicon glyphicon-envelope"/> Post][D_P] |
+| **commits**       | Code changes                                     | [<span class="glyphicon glyphicon-book"/> Archive][C_A] [<span class="glyphicon glyphicon-search"/> Search][C_S] | [<span class="glyphicon glyphicon-plus"/> Subscribe][C_SU] [<span class="glyphicon glyphicon-remove"/> Unsubscribe][C_UN] | |
+| **notifications** | Automated notifications (JIRA, etc.)             | [<span class="glyphicon glyphicon-book"/> Archive][N_A] [<span class="glyphicon glyphicon-search"/> Search][N_S] | [<span class="glyphicon glyphicon-plus"/> Subscribe][N_SU] [<span class="glyphicon glyphicon-remove"/> Unsubscribe][N_UN] | |
 
 ## Mailing List Search Providers
 
@@ -51,6 +22,46 @@ It is recommended that you also subscribe to <b>notifications</b>.</td>
 * [Nabble][3]
 * [Search-Hadoop][4]
 
+[U_A]: https://mail-archives.apache.org/mod_mbox/accumulo-user
+{: .btn .btn-primary .btn-xs }
+[U_S]: https://www.mail-archive.com/user@accumulo.apache.org
+{: .btn .btn-info .btn-xs }
+[U_SU]: mailto:user-subscribe@accumulo.apache.org
+{: .btn .btn-success .btn-xs }
+[U_UN]: mailto:user-unsubscribe@accumulo.apache.org
+{: .btn .btn-danger .btn-xs }
+[U_P]: mailto:user@accumulo.apache.org
+{: .btn .btn-warning .btn-xs }
+
+[D_A]: https://mail-archives.apache.org/mod_mbox/accumulo-dev
+{: .btn .btn-primary .btn-xs }
+[D_S]: https://www.mail-archive.com/dev@accumulo.apache.org
+{: .btn .btn-info .btn-xs }
+[D_SU]: mailto:dev-subscribe@accumulo.apache.org
+{: .btn .btn-success .btn-xs }
+[D_UN]: mailto:dev-unsubscribe@accumulo.apache.org
+{: .btn .btn-danger .btn-xs }
+[D_P]: mailto:dev@accumulo.apache.org
+{: .btn .btn-warning .btn-xs }
+
+[C_A]: https://mail-archives.apache.org/mod_mbox/accumulo-commits
+{: .btn .btn-primary .btn-xs }
+[C_S]: https://www.mail-archive.com/commits@accumulo.apache.org
+{: .btn .btn-info .btn-xs }
+[C_SU]: mailto:commits-subscribe@accumulo.apache.org
+{: .btn .btn-success .btn-xs }
+[C_UN]: mailto:commits-unsubscribe@accumulo.apache.org
+{: .btn .btn-danger .btn-xs }
+
+[N_A]: https://mail-archives.apache.org/mod_mbox/accumulo-notifications
+{: .btn .btn-primary .btn-xs }
+[N_S]: https://www.mail-archive.com/notifications@accumulo.apache.org
+{: .btn .btn-info .btn-xs }
+[N_SU]: mailto:notifications-subscribe@accumulo.apache.org
+{: .btn .btn-success .btn-xs }
+[N_UN]: mailto:notifications-unsubscribe@accumulo.apache.org
+{: .btn .btn-danger .btn-xs }
+
 [1]: https://www.mail-archive.com/search?l=all&q=accumulo
 [2]: http://accumulo.markmail.org
 [3]: http://apache-accumulo.1065345.n5.nabble.com

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/notable_features.md
----------------------------------------------------------------------
diff --git a/notable_features.md b/notable_features.md
index e9c4e27..e826001 100644
--- a/notable_features.md
+++ b/notable_features.md
@@ -3,21 +3,12 @@ title: Notable Features
 nav: nav_features
 ---
 
-## Categories
+{::options toc_levels="2" /}
 
-* [Table Design and Configuration](#design)
-* [Integrity/Availability](#integrity)
-* [Performance](#performance)
-* [Testing](#testing)
-* [Client API](#client)
-* [Extensible Behaviors](#behaviors)
-* [General Administration](#admin)
-* [Internal Data Management](#internal_dm)
-* [On-demand Data Management](#ondemand_dm)
+* Will be replaced with the ToC, excluding the "Contents" header
+{:toc}
 
-***
-
-## Table Design and Configuration <a id="design"></a>
+## Table Design and Configuration
 
 ### Iterators
 
@@ -31,7 +22,7 @@ An additional portion of the Key that sorts after the column qualifier and
 before the timestamp. It is called column visibility and enables expressive
 cell-level access control. Authorizations are passed with each query to control
 what data is returned to the user. The column visibilities are boolean AND and
-OR combinations of arbitrary strings (such as "(A&B)|C") and authorizations
+OR combinations of arbitrary strings (such as "(A&amp;B)|C") and authorizations
 are sets of strings (such as {C,D}).
 
 ### Constraints
@@ -66,14 +57,14 @@ over multiple disjoint HDFS instances.  This allows Accumulo to scale beyond the
 of a single namenode.  When used in conjunction with HDFS federation, multiple namenodes
 can share a pool of datanodes.
 
-## Integrity/Availability <a id="integrity"></a>
+## Integrity/Availability
 
 ### Master fail over
 
 Multiple masters can be configured.  Zookeeper locks are used to determine
 which master is active.  The remaining masters simply wait for the current
 master to lose its lock.  Current master state is held in the metadata table
-and Zookeeper (see [FATE](#fate)).
+and Zookeeper (see [FATE][FATE]).
 
 ### Logical time
 
@@ -124,7 +115,7 @@ Stores its metadata in an Accumulo table and Zookeeper.
 
 Scans will not see data inserted into a row after the scan of that row begins.
 
-## Performance <a id="performance"></a>
+## Performance
 
 ### Relative encoding
 
@@ -176,7 +167,7 @@ is generated.  As a block is read more, larger indexes are generated making
 future seeks faster. This strategy allows Accumulo to dynamically respond to
 read patterns without precomputing block indexes when RFiles are written.
 
-## Testing <a id="testing"></a>
+## Testing
 
 ### Mock
 
@@ -195,7 +186,7 @@ instance more closely.
 Using the Mini Accumulo Cluster in unit and integration tests is a great way for
 developers to test their applications against Accumulo in an environment that is
 much closer to physical deployments than Mock Accumulo provided. Accumulo 1.6.0 also
-introduced a [maven-accumulo-plugin]({{ site.baseurl }}/release_notes/1.6.0#maven-plugin) which
+introduced a [maven-accumulo-plugin][M-A-P] which
 can be used to start a Mini Accumulo Cluster instance as a part of the Maven
 lifecycle that your application tests can use.
 
@@ -231,7 +222,7 @@ Other tests have no concept of data correctness and have the simple goal of
 crashing Accumulo. Many obscure bugs have been uncovered by this testing
 framework and subsequently corrected.
 
-## Client API <a id="client"></a>
+## Client API
 
 ### [Batch Scanner][4]
 
@@ -271,8 +262,8 @@ available to other languages like Python, Ruby, C++, etc.
 In version 1.6.0, Accumulo introduced [ConditionalMutations][7]
 which allow users to perform efficient, atomic read-modify-write operations on rows. Conditions can
 be defined using on equality checks of the values in a column or the absence of a column. For more
-information on using this feature, users can reference the Javadoc for [ConditionalMutation]({{ site.baseurl }}/1.6/apidocs/org/apache/accumulo/core/data/ConditionalMutation) and
-[ConditionalWriter]({{ site.baseurl }}/1.6/apidocs/org/apache/accumulo/core/client/ConditionalWriter)
+information on using this feature, users can reference the Javadoc for [ConditionalMutation][CMUT] and
+[ConditionalWriter][CWRI].
 
 ### Lexicoders
 
@@ -283,7 +274,7 @@ Lexicoders which have numerous implementations that support for efficient transl
 Java primitives to byte arrays and vice versa. These classes can greatly reduce the burden in
 re-implementing common programming mistakes in encoding.
 
-## Extensible Behaviors <a id="behaviors"></a>
+## Extensible Behaviors
 
 ### Pluggable balancer
 
@@ -318,7 +309,7 @@ it is very unlikely that more data will be written to it, and thus paying the pe
 to re-write a large file can be avoided. Implementations of this compaction strategy
 can be used to optimize the data that compactions will write.
 
-## General Administration <a id="admin"></a>
+## General Administration
 
 ### Monitor page
 
@@ -349,7 +340,7 @@ effect until server processes are restarted.
 Tables can be renamed easily because Accumulo uses internal table IDs and
 stores mappings between names and IDs in Zookeeper.
 
-## Internal Data Management <a id="internal_dm"></a>
+## Internal Data Management
 
 ### Locality groups
 
@@ -395,7 +386,7 @@ level of security that Accumulo provides. It is still a work in progress because
 the intermediate files created by Accumulo when recovering from a TabletServer
 failure are not encrypted.
 
-## On-demand Data Management <a id="ondemand_dm"></a>
+## On-demand Data Management
 
 ### Compactions
 
@@ -441,6 +432,10 @@ Added an operation to efficiently delete a range of rows from a table. Tablets
 that fall completely within a range are simply dropped. Tablets overlapping the
 beginning and end of the range are split, compacted, and then merged.  
 
+[FATE]: #fate
+[M-A-P]: {{ site.baseurl }}/release_notes/1.6.0#maven-plugin
+[CMUT]: {{ site.baseurl }}/1.6/apidocs/org/apache/accumulo/core/data/ConditionalMutation
+[CWRI]: {{ site.baseurl }}/1.6/apidocs/org/apache/accumulo/core/client/ConditionalWriter
 [4]: {{ site.baseurl }}/1.5/accumulo_user_manual#_writing_accumulo_clients
 [6]: {{ site.baseurl }}/1.5/accumulo_user_manual#_bulk_ingest
 [7]: {{ site.baseurl }}/1.6/accumulo_user_manual#_conditionalwriter

http://git-wip-us.apache.org/repos/asf/accumulo/blob/964cf811/old_documentation.md
----------------------------------------------------------------------
diff --git a/old_documentation.md b/old_documentation.md
index 4cfaad0..080e441 100644
--- a/old_documentation.md
+++ b/old_documentation.md
@@ -7,28 +7,44 @@ This page contains pointers to the documentation for major versions of Accumulo
 
 #### 1.5 Documentation
 
-* <a href="https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;hb=1.5.4" id="/1.5/README">README</a>
-* <a href="{{ site.baseurl }}/1.5/accumulo_user_manual.pdf" id="/1.5/accumulo_user_manual.pdf">PDF manual</a>
+* [README][README_15]
+* [PDF manual][MANUAL_PDF_15]
 * [html manual][MANUAL_HTML_15]
 * [examples][EXAMPLES_15]
-* <a href="{{ site.baseurl }}/1.5/apidocs" id="/1.5/apidocs">Javadoc</a>
+* [Javadoc][JAVADOC_15]
 
 #### 1.4 Documentation
 
-* <a href="https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;hb=f7d87b6e407de6597b6c0ca60ca1b6a321faf237" onClick="javascript: _gaq.push(['_trackPageview', '/1.4/README']);">README</a>
-* <a href="{{ site.baseurl }}/1.4/accumulo_user_manual.pdf" onClick="javascript: _gaq.push(['_trackPageview', '/1.4/accumulo_user_manual.pdf']);">pdf manual</a>
+* [README][README_14]
+* [PDF manual][MANUAL_PDF_14]
 * [html manual][MANUAL_HTML_14]
 * [examples][EXAMPLES_14]
-* <a href="{{ site.baseurl }}/1.4/apidocs" onClick="javascript: _gaq.push(['_trackPageview', '/1.4/apidocs']);">Javadoc</a>
+* [Javadoc][JAVADOC_14]
 
 #### 1.3 Documentation
-* <a href="https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;h=86713d9b6add9038d5130b4a23ba4a79b72d0f15;hb=3b4ffc158945c1f834fc6f257f21484c61691d0f" onClick="javascript: _gaq.push(['_trackPageview', '/1.3/README']);">README</a>
+* [README][README_13]
 * [html manual][MANUAL_HTML_13]
 * [examples][EXAMPLES_13]
 
+[README_15]: https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;hb=1.5.4
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.5/README']);" }
+[MANUAL_PDF_15]: {{ site.baseurl }}/1.5/accumulo_user_manual.pdf
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.5/accumulo_user_manual.pdf']);" }
 [MANUAL_HTML_15]: {{ site.baseurl }}/1.5/accumulo_user_manual "1.5 user manual"
 [EXAMPLES_15]: {{ site.baseurl }}/1.5/examples "1.5 examples"
+[JAVADOC_15]: {{ site.baseurl }}/1.5/apidocs
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.5/apidocs']);" }
+
+[README_14]: https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;hb=f7d87b6e407de6597b6c0ca60ca1b6a321faf237
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.4/README']);" }
+[MANUAL_PDF_14]: {{ site.baseurl }}/1.4/accumulo_user_manual.pdf
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.4/accumulo_user_manual.pdf']);" }
 [MANUAL_HTML_14]: {{ site.baseurl }}/1.4/user_manual "1.4 user manual"
 [EXAMPLES_14]: {{ site.baseurl }}/1.4/examples "1.4 examples"
+[JAVADOC_14]: {{ site.baseurl }}/1.4/apidocs
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.4/apidocs']);" }
+
+[README_13]: https://git-wip-us.apache.org/repos/asf?p=accumulo.git;a=blob_plain;f=README;h=86713d9b6add9038d5130b4a23ba4a79b72d0f15;hb=3b4ffc158945c1f834fc6f257f21484c61691d0f
+{: onClick="javascript: _gaq.push(['_trackPageview', '/1.3/README']);" }
 [MANUAL_HTML_13]: {{ site.baseurl }}/user_manual_1.3-incubating/ "1.3 user manual"
 [EXAMPLES_13]: {{ site.baseurl }}/user_manual_1.3-incubating/examples/ "1.3 examples"


Mime
View raw message