summaryrefslogtreecommitdiff
path: root/sql/uniques.h
diff options
context:
space:
mode:
authorOleksandr Byelkin <sanja@mariadb.com>2020-01-20 16:15:05 +0100
committerOleksandr Byelkin <sanja@mariadb.com>2020-01-20 16:15:05 +0100
commit3a1716a7e79e6fe05a166211002321f73465ec79 (patch)
tree8b9eeab4e037c893ea4cd994b5a7d9e1b1825f5b /sql/uniques.h
parentd07664498be9c71c01c7df9f2fb1d18c7060b2e3 (diff)
parent7993f893b844d71183956ee30a6fb37fc10ae90c (diff)
downloadmariadb-git-3a1716a7e79e6fe05a166211002321f73465ec79.tar.gz
Merge branch '10.1' into 10.2
Diffstat (limited to 'sql/uniques.h')
-rw-r--r--sql/uniques.h12
1 files changed, 9 insertions, 3 deletions
diff --git a/sql/uniques.h b/sql/uniques.h
index 654b3692aaa..7cdf6607dd0 100644
--- a/sql/uniques.h
+++ b/sql/uniques.h
@@ -29,14 +29,20 @@
class Unique :public Sql_alloc
{
DYNAMIC_ARRAY file_ptrs;
- ulong max_elements;
+ ulong max_elements; /* Total number of elements that will be stored in-memory */
size_t max_in_memory_size;
IO_CACHE file;
TREE tree;
+ /* Number of elements filtered out due to min_dupl_count when storing results
+ to table. See Unique::get */
ulong filtered_out_elems;
uint size;
- uint full_size;
- uint min_dupl_count; /* always 0 for unions, > 0 for intersections */
+
+ uint full_size; /* Size of element + space needed to store the number of
+ duplicates found for the element. */
+ uint min_dupl_count; /* Minimum number of occurences of element required for
+ it to be written to record_pointers.
+ always 0 for unions, > 0 for intersections */
bool with_counters;
bool merge(TABLE *table, uchar *buff, bool without_last_merge);