evgeny
38c9f229bc
- u_async.c: process immediate_queue BEFORE epoll_wait in uasync_poll - stcp_link.c: defensive NULL etcp_conn/etcp_link in stcp_link_close - utun_instance.c: move stcp_server_list_destroy_all to Phase J (before ETCP), add deferred drain in both Phase J and L - stcp.h/c: STCP_HS_ENC_CLIENT 6→38, STCP_HS_ENC_SERVER 7→39, exchange ed25519_pubkey in both handshake directions - etcp_connections.c: copy peer_ed25519 from STCP to ETCP_CONN in etcp_link_enter_ready_tcp; guard link->etcp in tcp_link_close_cb - chat_sync.c: fix lk->conn NULL dereference for TCP links - test_stcp.c: update stcp_server_create/stcp_client_connect callsites - tools/chat_tcp_test: change transport udp→tcp
126 lines
2.3 KiB
C++
126 lines
2.3 KiB
C++
/*
|
|
* Copyright 2016 Huy Cuong Nguyen
|
|
* Copyright 2016 ZXing authors
|
|
*/
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
#pragma once
|
|
|
|
#include "Point.h"
|
|
|
|
#include <stdexcept>
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
#include <vector>
|
|
|
|
namespace ZXing {
|
|
|
|
template <class T>
|
|
class Matrix
|
|
{
|
|
public:
|
|
using value_t = T;
|
|
|
|
private:
|
|
int _width = 0;
|
|
int _height = 0;
|
|
std::vector<value_t> _data;
|
|
|
|
// Nothing wrong to support it, just to make it explicit, instead of by mistake.
|
|
// Use copy() below.
|
|
Matrix(const Matrix &) = default;
|
|
|
|
public:
|
|
Matrix() = default;
|
|
|
|
#if defined(__llvm__) || (defined(__GNUC__) && (__GNUC__ > 7))
|
|
__attribute__((no_sanitize("signed-integer-overflow")))
|
|
#endif
|
|
Matrix(int width, int height, value_t val = {}) : _width(width), _height(height), _data(_width * _height, val) {
|
|
if (width != 0 && int(_data.size()) / width != height)
|
|
throw std::invalid_argument("Invalid size: width * height is too big");
|
|
}
|
|
|
|
Matrix(Matrix&&) noexcept = default;
|
|
Matrix& operator=(Matrix&&) noexcept = default;
|
|
Matrix& operator=(const Matrix &) = delete;
|
|
|
|
Matrix copy() const {
|
|
return *this;
|
|
}
|
|
|
|
int height() const {
|
|
return _height;
|
|
}
|
|
|
|
int width() const {
|
|
return _width;
|
|
}
|
|
|
|
int size() const {
|
|
return int(_data.size());
|
|
}
|
|
|
|
value_t& operator()(int x, int y)
|
|
{
|
|
assert(x >= 0 && x < _width && y >= 0 && y < _height);
|
|
return _data[y * _width + x];
|
|
}
|
|
|
|
const T& operator()(int x, int y) const
|
|
{
|
|
assert(x >= 0 && x < _width && y >= 0 && y < _height);
|
|
return _data[y * _width + x];
|
|
}
|
|
|
|
value_t& operator()(PointI p) {
|
|
return operator()(p.x, p.y);
|
|
}
|
|
|
|
const T& operator()(PointI p) const {
|
|
return operator()(p.x, p.y);
|
|
}
|
|
|
|
const value_t& get(int x, int y) const {
|
|
return operator()(x, y);
|
|
}
|
|
|
|
value_t& set(int x, int y, value_t value) {
|
|
return operator()(x, y) = value;
|
|
}
|
|
|
|
const value_t& get(PointI p) const {
|
|
return operator()(p.x, p.y);
|
|
}
|
|
|
|
value_t& set(PointI p, value_t value) {
|
|
return operator()(p.x, p.y) = value;
|
|
}
|
|
|
|
const value_t* data() const {
|
|
return _data.data();
|
|
}
|
|
|
|
const value_t* begin() const {
|
|
return _data.data();
|
|
}
|
|
|
|
const value_t* end() const {
|
|
return _data.data() + _width * _height;
|
|
}
|
|
|
|
value_t* begin() {
|
|
return _data.data();
|
|
}
|
|
|
|
value_t* end() {
|
|
return _data.data() + _width * _height;
|
|
}
|
|
|
|
void clear(value_t value = {}) {
|
|
std::fill(_data.begin(), _data.end(), value);
|
|
}
|
|
};
|
|
|
|
} // ZXing
|