tt = vertcat (tt1, tt2, …) stacks the rows of its inputs, which must all have the same variable names. It is the operation [tt1; tt2] performs.

The row times are stacked in the order the inputs are given and are never sorted, so a later block that starts before an earlier one ends simply makes the result irregular, as duplicate times do. The time step is read afresh from the stacked times, so two blocks that meet exactly keep the step they share and any other pair loses it.

A table may be stacked onto a timetable, but only after it: its rows carry no times and are labelled with missing ones. The row dimension is named after the first input that does not use the default name.

Where an operand is an eventtable, or carries one on its Events property, the result is an event table too and the operands’ event tables are merged: an outer join keyed on the event times and every variable the two share, ordered by those keys. The three properties saying which variables describe the events must agree, and the operation is refused where they do not.

See also: horzcat, cat

Source Code: timetable