Fix a minor typo in a comment in where.c.

FossilOrigin-Name: 4a9d51e792d7c4297bd18af7b7c757c93a3a1cd1

manifest

@@ -1,5 +1,5 @@
-C Fix\sharmless\stypos\sin\scomments\sof\stwo\sextensions.
-D 2013-07-02T00:06:31.345
+C Fix\sa\sminor\stypo\sin\sa\scomment\sin\swhere.c.
+D 2013-07-02T10:06:15.227
 F Makefile.arm-wince-mingw32ce-gcc d6df77f1f48d690bd73162294bbba7f59507c72f
 F Makefile.in 5e41da95d92656a5004b03d3576e8b226858a28e
 F Makefile.linux-gcc 91d710bdc4998cb015f39edf3cb314ec4f4d7e23
@@ -290,7 +290,7 @@ F src/vtab.c b05e5f1f4902461ba9f5fc49bb7eb7c3a0741a83
 F src/wal.c 7dc3966ef98b74422267e7e6e46e07ff6c6eb1b4
 F src/wal.h df01efe09c5cb8c8e391ff1715cca294f89668a4
 F src/walker.c 4fa43583d0a84b48f93b1e88f11adf2065be4e73
-F src/where.c b546b95b7096f153666c63bb4f76c1a0299d83d6
+F src/where.c 8fc6dc55ae6fb9c265fbb18f2f63637b4b2a23d7
 F test/8_3_names.test ebbb5cd36741350040fd28b432ceadf495be25b2
 F test/aggerror.test a867e273ef9e3d7919f03ef4f0e8c0d2767944f2
 F test/aggnested.test 45c0201e28045ad38a530b5a144b73cd4aa2cfd6
@@ -1100,7 +1100,7 @@ F tool/warnings-clang.sh f6aa929dc20ef1f856af04a730772f59283631d4
 F tool/warnings.sh fbc018d67fd7395f440c28f33ef0f94420226381
 F tool/wherecosttest.c f407dc4c79786982a475261866a161cd007947ae
 F tool/win/sqlite.vsix 97894c2790eda7b5bce3cc79cb2a8ec2fde9b3ac
-P 3d49c593dc12d72323ca525372a15e58c591940b
-R 4eaba8c09aff13d774e48dbaa8d3b5df
-U drh
-Z 34d5604cd4dfbc299c0348ba76a1b0cf
+P 1c3ed47b71844d062c4e9a315f2f368b382684cc
+R 36a2bd5f84943e297e7677662197ea4b
+U dan
+Z 2db6f3342224bc1d0e9a21c19a181e39

manifest.uuid

@@ -1 +1 @@
-1c3ed47b71844d062c4e9a315f2f368b382684cc
+4a9d51e792d7c4297bd18af7b7c757c93a3a1cd1

src/where.c

@@ -159,7 +159,7 @@ static int whereLoopResize(sqlite3*, WhereLoop*, int);
 ** Each instance of this object holds a sequence of WhereLoop objects
 ** that implement some or all of a query plan.
 **
-** Think of each WhereLoop objects as a node in a graph, which arcs
+** Think of each WhereLoop object as a node in a graph with arcs
 ** showing dependences and costs for travelling between nodes.  (That is
 ** not a completely accurate description because WhereLoop costs are a
 ** vector, not a scalar, and because dependences are many-to-one, not
@@ -4429,7 +4429,7 @@ static Bitmask columnsInIndex(Index *pIdx){
 
 
 /*
-** Add all WhereLoop objects for a single table of the join were the table
+** Add all WhereLoop objects for a single table of the join where the table
 ** is idenfied by pBuilder->pNew->iTab.  That table is guaranteed to be
 ** a b-tree table, not a virtual table.
 */
@@ -5153,7 +5153,7 @@ static const char *wherePathName(WherePath *pPath, int nLoop, WhereLoop *pLast){
 
 
 /*
-** Given the list of WhereLoop objects on pWInfo->pLoops, this routine
+** Given the list of WhereLoop objects at pWInfo->pLoops, this routine
 ** attempts to find the lowest cost path that visits each WhereLoop
 ** once.  This path is then loaded into the pWInfo->a[].pWLoop fields.
 **