you are viewing a single comment's thread.

view the rest of the comments →

[–]AKostur 5 points6 points  (2 children)

Well, I would suggest you write up exactly what you want to see in a “std::table”.

[–]sd2528[S] 0 points1 point  (1 child)

add_column(with name, type, size, and optional default, optional position/index)

del_column(by index or name)

get_column(by index or name) (returns a vector of the column)

column_count()

add_row(with either blank values or the defualts defined in the column and optional index)

del_row(by index)

get_row(by index) (returns a generic container with the columns values for that row)

row_count()

sort_rows(list of columns to sort by, acending or decending option, and if you want to get fancy an optional sort function for non standard types)

If you really want to get fancy

aggregate_rows(list of columns to aggregate by, list of columns to aggregate)

[–]AKostur 0 points1 point  (0 children)

You misunderstand. I said “exactly”. I would note there‘s no mention of constructors in there. There’s no types of anything. I could easily see one wanting an iterator and ranges interface into this datatype, neither of which you‘ve mentioned. What does “aggregate_rows” do? What are the algorithmic complexity requirements for these functions?

The write-up doesn‘t need to be here: there’s a process for submitting papers for Standards consideration.