Commit18e5867

committed

Fix typos.

1 parentbff84a5 commit18e5867Copy full SHA for 18e5867

File tree

-9

lines changed

-9

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1428,7 +1428,7 @@ gen_prune_steps_from_opexps(PartitionScheme part_scheme,`
`1428`	`1428`	`/*`
`1429`	`1429`	`* For each clause for the "last" column, after appending`
`1430`	`1430`	`* the clause's own expression to the 'prefix', we'll`
`1431`		`- * generate one step using the so generated vector and and`
	`1431`	`+ * generate one step using the so generated vector and`
`1432`	`1432`	`* assign = as its strategy. Actually, 'prefix' might`
`1433`	`1433`	`* contain multiple clauses for the same key, in which`
`1434`	`1434`	`* case, we must generate steps for various combinations`
`@@ -2828,9 +2828,9 @@ get_matching_range_bounds(PartitionPruneContext *context,`
`2828`	`2828`	`}`
`2829`	`2829`
`2830`	`2830`	`/*`
`2831`		`- * Skip a gap. See the above comment about how we decide whether oror`
`2832`		`- *notto scan the default partition based whether the datum that will`
`2833`		`- *becomethe maximum datum is finite or not.`
	`2831`	`+ * Skip a gap. See the above comment about how we decide whether ornot`
	`2832`	`+ * to scan the default partition based whether the datum that will become`
	`2833`	`+ * the maximum datum is finite or not.`
`2834`	`2834`	`*/`
`2835`	`2835`	`if (maxoff >=1&&partindices[maxoff]<0)`
`2836`	`2836`	`{`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -395,7 +395,7 @@ statext_dependencies_build(int numrows, HeapTuple rows, Bitmapset attrs,`
`395`	`395`	`degree=dependency_degree(numrows,rows,k,dependency,stats,attrs);`
`396`	`396`
`397`	`397`	`/*`
`398`		`- * if the dependency seems entirely invalid, don't store it it`
	`398`	`+ * if the dependency seems entirely invalid, don't store it`
`399`	`399`	`*/`
`400`	`400`	`if (degree==0.0)`
`401`	`401`	`continue;`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -35,10 +35,10 @@`
`35`	`35`	`*`
`36`	`36`	`* We are using traversal values provided by SP-GiST to calculate and`
`37`	`37`	`* to store the bounds of the quadrants, while traversing into the tree.`
`38`		`- * Traversal value has all the boundaries in the 4D space, and isis`
`39`		`- *capableof transferring the required boundaries to the following`
`40`		`- *traversalvalues. In conclusion, three things are necessary`
`41`		`- *to calculate thenext traversal value:`
	`38`	`+ * Traversal value has all the boundaries in the 4D space, and iscapable`
	`39`	`+ * of transferring the required boundaries to the following traversal`
	`40`	`+ * values. In conclusion, three things are necessary to calculate the`
	`41`	`+ * next traversal value:`
`42`	`42`	`*`
`43`	`43`	`*(1) the traversal value of the parent`
`44`	`44`	`*(2) the quadrant of the current node`

Comments

(0)