bricks: add missing override
* bricks/brick-assert.h, bricks/brick-hashset.h, bricks/brick-shmem.h: here.
This commit is contained in:
parent
50d888adf8
commit
c515ee92e2
3 changed files with 5 additions and 5 deletions
|
|
@ -132,7 +132,7 @@ struct AssertFailed : std::exception {
|
||||||
(*this) << ": assertion `" << l.stmt << "' failed;";
|
(*this) << ": assertion `" << l.stmt << "' failed;";
|
||||||
}
|
}
|
||||||
|
|
||||||
const char *what() const noexcept { return str.c_str(); }
|
const char *what() const noexcept override { return str.c_str(); }
|
||||||
};
|
};
|
||||||
|
|
||||||
template< typename Location, typename X >
|
template< typename Location, typename X >
|
||||||
|
|
|
||||||
|
|
@ -995,7 +995,7 @@ struct Parallel
|
||||||
int from, to;
|
int from, to;
|
||||||
bool overlap;
|
bool overlap;
|
||||||
|
|
||||||
void main() {
|
void main() override {
|
||||||
auto set = _set->withTD( td );
|
auto set = _set->withTD( td );
|
||||||
for ( int i = from; i < to; ++i ) {
|
for ( int i = from; i < to; ++i ) {
|
||||||
set.insert( i );
|
set.insert( i );
|
||||||
|
|
|
||||||
|
|
@ -551,7 +551,7 @@ struct FifoTest {
|
||||||
int terminate;
|
int terminate;
|
||||||
int n;
|
int n;
|
||||||
|
|
||||||
void main()
|
void main() override
|
||||||
{
|
{
|
||||||
std::vector< int > x;
|
std::vector< int > x;
|
||||||
x.resize( n );
|
x.resize( n );
|
||||||
|
|
@ -603,7 +603,7 @@ struct Utils {
|
||||||
rep( repeat )
|
rep( repeat )
|
||||||
{}
|
{}
|
||||||
|
|
||||||
void main() {
|
void main() override {
|
||||||
for ( int i = 0; i < rep; ++i )
|
for ( int i = 0; i < rep; ++i )
|
||||||
detector.waitForAll( peers );
|
detector.waitForAll( peers );
|
||||||
}
|
}
|
||||||
|
|
@ -648,7 +648,7 @@ struct Utils {
|
||||||
consume( 0 )
|
consume( 0 )
|
||||||
{}
|
{}
|
||||||
|
|
||||||
void main() {
|
void main() override {
|
||||||
detector.waitForAll( peers );
|
detector.waitForAll( peers );
|
||||||
|
|
||||||
while ( produce-- )
|
while ( produce-- )
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue