Compare commits
1 Commits
| Author | SHA1 | Date |
|---|---|---|
Dmitry
|
dafeb00741 | 9 months ago |
@ -1,135 +0,0 @@
|
||||
class Node {
|
||||
constructor(data) {
|
||||
this.data = data;
|
||||
this.prev = null;
|
||||
this.next = null;
|
||||
}
|
||||
}
|
||||
|
||||
class DoublyLinkedList {
|
||||
constructor() {
|
||||
this.head = null;
|
||||
this.tail = null;
|
||||
this.length = 0;
|
||||
}
|
||||
|
||||
append(data) {
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (!this.head) {
|
||||
this.head = newNode;
|
||||
this.tail = newNode;
|
||||
} else {
|
||||
newNode.prev = this.tail;
|
||||
this.tail.next = newNode;
|
||||
this.tail = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
insertAt(index, data) {
|
||||
if (index < 0 || index > this.length) {
|
||||
console.error("Wrong index");
|
||||
return;
|
||||
}
|
||||
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (index === 0) {
|
||||
newNode.next = this.head;
|
||||
this.head.prev = newNode;
|
||||
this.head = newNode;
|
||||
} else if (index === this.length) {
|
||||
newNode.prev = this.tail;
|
||||
this.tail.next = newNode;
|
||||
this.tail = newNode;
|
||||
} else {
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index - 1; i++) {
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
newNode.next = current.next;
|
||||
newNode.prev = current;
|
||||
current.next.prev = newNode;
|
||||
current.next = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
removeAt(index) {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Wrong index");
|
||||
return;
|
||||
}
|
||||
|
||||
let current = this.head;
|
||||
|
||||
if (index === 0) {
|
||||
this.head = current.next;
|
||||
if (this.head) {
|
||||
this.head.prev = null;
|
||||
} else {
|
||||
this.tail = null;
|
||||
}
|
||||
} else if (index === this.length - 1) {
|
||||
current = this.tail;
|
||||
this.tail = current.prev;
|
||||
this.tail.next = null;
|
||||
} else {
|
||||
for (let i = 0; i < index; i++) {
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
current.prev.next = current.next;
|
||||
current.next.prev = current.prev;
|
||||
}
|
||||
|
||||
this.length--;
|
||||
}
|
||||
|
||||
// Изменение элемента по индексу
|
||||
updateAt(index, newData) {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Wrong index");
|
||||
return;
|
||||
}
|
||||
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index; i++) {
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
current.data = newData;
|
||||
}
|
||||
|
||||
// Поиск элемента по индексу
|
||||
search(data) {
|
||||
let current = this.head;
|
||||
while (current) {
|
||||
if (current.data === data) {
|
||||
return current;
|
||||
}
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
// Получение длины списка
|
||||
getLength() {
|
||||
return this.length;
|
||||
}
|
||||
|
||||
// Элементы списка
|
||||
display() {
|
||||
let current = this.head;
|
||||
while (current) {
|
||||
console.log(current.data);
|
||||
current = current.next;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@ -1,109 +0,0 @@
|
||||
class Node {
|
||||
constructor(data) {
|
||||
this.data = data;
|
||||
this.next = null;
|
||||
}
|
||||
}
|
||||
|
||||
class LinkedList {
|
||||
constructor() {
|
||||
this.head = null;
|
||||
this.length = 0;
|
||||
}
|
||||
|
||||
// Добавление элемента
|
||||
append(data) {
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (!this.head) {
|
||||
this.head = newNode;
|
||||
} else {
|
||||
let current = this.head;
|
||||
while (current.next) {
|
||||
current = current.next;
|
||||
}
|
||||
current.next = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
// Вставка элемента
|
||||
insertAt(index, data) {
|
||||
if (index < 0 || index > this.length) {
|
||||
console.error("Неверный индекс");
|
||||
return;
|
||||
}
|
||||
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (index === 0) {
|
||||
newNode.next = this.head;
|
||||
this.head = newNode;
|
||||
} else {
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index - 1; i++) {
|
||||
current = current.next;
|
||||
}
|
||||
newNode.next = current.next;
|
||||
current.next = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
// Удаление элемента
|
||||
removeAt(index) {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Неверный индекс");
|
||||
return;
|
||||
}
|
||||
|
||||
if (index === 0) {
|
||||
this.head = this.head.next;
|
||||
} else {
|
||||
let current = this.head;
|
||||
let prev = null;
|
||||
for (let i = 0; i < index; i++) {
|
||||
prev = current;
|
||||
current = current.next;
|
||||
}
|
||||
prev.next = current.next;
|
||||
}
|
||||
|
||||
this.length--;
|
||||
}
|
||||
|
||||
// Изменение элемента
|
||||
updateAt(index, newData) {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Неверный индекс");
|
||||
return;
|
||||
}
|
||||
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index; i++) {
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
current.data = newData;
|
||||
}
|
||||
|
||||
// Поиск элемента
|
||||
search(data) {
|
||||
let current = this.head;
|
||||
while (current) {
|
||||
if (current.data === data) {
|
||||
return current;
|
||||
}
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
// Получение длины списка
|
||||
getLength() {
|
||||
return this.length;
|
||||
}
|
||||
}
|
||||
@ -1,75 +0,0 @@
|
||||
class RedBlackNode {
|
||||
constructor(key, value, color = 'red') {
|
||||
this.key = key;
|
||||
this.value = value;
|
||||
this.color = color;
|
||||
this.left = null;
|
||||
this.right = null;
|
||||
}
|
||||
}
|
||||
|
||||
class RedBlackTree {
|
||||
constructor() {
|
||||
this.root = null;
|
||||
}
|
||||
|
||||
// Поиск элемента по ключу
|
||||
search(key) {
|
||||
return this._search(this.root, key);
|
||||
}
|
||||
|
||||
_search(node, key) {
|
||||
if (node === null || key === node.key) {
|
||||
return node;
|
||||
}
|
||||
|
||||
if (key < node.key) {
|
||||
return this._search(node.left, key);
|
||||
} else {
|
||||
return this._search(node.right, key);
|
||||
}
|
||||
}
|
||||
|
||||
// Вставка элемента
|
||||
insert(key, value) {
|
||||
this.root = this._insert(this.root, key, value);
|
||||
this.root.color = 'black'; // Корень всегда черный
|
||||
}
|
||||
|
||||
_insert(node, key, value) {
|
||||
if (node === null) {
|
||||
return new RedBlackNode(key, value);
|
||||
}
|
||||
|
||||
if (key < node.key) {
|
||||
node.left = this._insert(node.left, key, value);
|
||||
} else if (key > node.key) {
|
||||
node.right = this._insert(node.right, key, value);
|
||||
} else {
|
||||
node.value = value; // Если ключ уже существует, обновляем значение
|
||||
}
|
||||
|
||||
return node;
|
||||
}
|
||||
|
||||
// Удаление элемента
|
||||
remove(key) {
|
||||
this.root = this._remove(this.root, key);
|
||||
}
|
||||
|
||||
_remove(node, key) {
|
||||
if (node === null) {
|
||||
return null;
|
||||
}
|
||||
|
||||
return node;
|
||||
}
|
||||
|
||||
// Изменение элемента
|
||||
update(key, value) {
|
||||
const node = this.search(key);
|
||||
if (node) {
|
||||
node.value = value;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1,34 +0,0 @@
|
||||
-- Курсы
|
||||
CREATE TABLE courses (
|
||||
course_id SERIAL PRIMARY KEY,
|
||||
course_name VARCHAR(255) NOT NULL,
|
||||
description TEXT,
|
||||
start_date DATE,
|
||||
end_date DATE
|
||||
);
|
||||
|
||||
-- Студенты
|
||||
CREATE TABLE students (
|
||||
student_id SERIAL PRIMARY KEY,
|
||||
first_name VARCHAR(255) NOT NULL,
|
||||
last_name VARCHAR(255) NOT NULL,
|
||||
email VARCHAR(255) UNIQUE NOT NULL,
|
||||
date_of_birth DATE
|
||||
);
|
||||
|
||||
-- Уроки
|
||||
CREATE TABLE lessons (
|
||||
lesson_id SERIAL PRIMARY KEY,
|
||||
lesson_name VARCHAR(255) NOT NULL,
|
||||
content TEXT,
|
||||
video_url VARCHAR(255),
|
||||
lesson_order INT
|
||||
);
|
||||
|
||||
-- m2m students to courses
|
||||
CREATE TABLE student_courses (
|
||||
student_id INT REFERENCES students(student_id),
|
||||
course_id INT REFERENCES courses(course_id),
|
||||
enrollment_date TIMESTAMP DEFAULT CURRENT_TIMESTAMP,
|
||||
PRIMARY KEY (student_id, course_id)
|
||||
);
|
||||
@ -1,43 +0,0 @@
|
||||
-- Пользователи
|
||||
CREATE TABLE users (
|
||||
user_id SERIAL PRIMARY KEY,
|
||||
username VARCHAR(255) UNIQUE NOT NULL,
|
||||
email VARCHAR(255) UNIQUE NOT NULL,
|
||||
password VARCHAR(255) NOT NULL,
|
||||
full_name VARCHAR(255),
|
||||
date_joined TIMESTAMP DEFAULT CURRENT_TIMESTAMP
|
||||
);
|
||||
|
||||
-- Посты
|
||||
CREATE TABLE posts (
|
||||
post_id SERIAL PRIMARY KEY,
|
||||
user_id INT REFERENCES users(user_id),
|
||||
content TEXT NOT NULL,
|
||||
post_date TIMESTAMP DEFAULT CURRENT_TIMESTAMP
|
||||
);
|
||||
|
||||
-- Комментарии
|
||||
CREATE TABLE comments (
|
||||
comment_id SERIAL PRIMARY KEY,
|
||||
user_id INT REFERENCES users(user_id),
|
||||
post_id INT REFERENCES posts(post_id),
|
||||
content TEXT NOT NULL,
|
||||
comment_date TIMESTAMP DEFAULT CURRENT_TIMESTAMP
|
||||
);
|
||||
|
||||
-- Лайки
|
||||
CREATE TABLE likes (
|
||||
like_id SERIAL PRIMARY KEY,
|
||||
user_id INT REFERENCES users(user_id),
|
||||
post_id INT REFERENCES posts(post_id),
|
||||
comment_id INT REFERENCES comments(comment_id),
|
||||
like_date TIMESTAMP DEFAULT CURRENT_TIMESTAMP
|
||||
);
|
||||
|
||||
-- Друзья
|
||||
CREATE TABLE friends (
|
||||
friendship_id SERIAL PRIMARY KEY,
|
||||
user1_id INT REFERENCES users(user_id),
|
||||
user2_id INT REFERENCES users(user_id),
|
||||
friendship_date TIMESTAMP DEFAULT CURRENT_TIMESTAMP
|
||||
);
|
||||
@ -1,16 +0,0 @@
|
||||
CREATE TABLE categories (
|
||||
category_id INT PRIMARY KEY AUTO_INCREMENT,
|
||||
category_name VARCHAR(255) NOT NULL
|
||||
);
|
||||
|
||||
CREATE TABLE tasks (
|
||||
task_id INT PRIMARY KEY AUTO_INCREMENT,
|
||||
task_name VARCHAR(255) NOT NULL,
|
||||
description TEXT,
|
||||
due_date DATE,
|
||||
category_id INT,
|
||||
completed BOOLEAN DEFAULT FALSE,
|
||||
FOREIGN KEY (category_id) REFERENCES categories(category_id)
|
||||
);
|
||||
|
||||
INSERT INTO categories (category_name) VALUES ('Работа'), ('Дом'), ('Личное');
|
||||
@ -1,146 +0,0 @@
|
||||
class Node<T> {
|
||||
data: T;
|
||||
prev: Node<T> | null;
|
||||
next: Node<T> | null;
|
||||
|
||||
constructor(data: T) {
|
||||
this.data = data;
|
||||
this.prev = null;
|
||||
this.next = null;
|
||||
}
|
||||
}
|
||||
|
||||
class DoublyLinkedList<T> {
|
||||
head: Node<T> | null;
|
||||
tail: Node<T> | null;
|
||||
length: number;
|
||||
|
||||
constructor() {
|
||||
this.head = null;
|
||||
this.tail = null;
|
||||
this.length = 0;
|
||||
}
|
||||
|
||||
append(data: T): void {
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (!this.head) {
|
||||
this.head = newNode;
|
||||
this.tail = newNode;
|
||||
} else {
|
||||
newNode.prev = this.tail;
|
||||
if (this.tail) this.tail.next = newNode;
|
||||
this.tail = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
insertAt(index: number, data: T): void {
|
||||
if (index < 0 || index > this.length) {
|
||||
console.error("Wrong index");
|
||||
return;
|
||||
}
|
||||
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (index === 0) {
|
||||
newNode.next = this.head;
|
||||
if (this.head) this.head.prev = newNode;
|
||||
this.head = newNode;
|
||||
} else if (index === this.length) {
|
||||
newNode.prev = this.tail;
|
||||
if (this.tail) this.tail.next = newNode;
|
||||
this.tail = newNode;
|
||||
} else {
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index - 1; i++) {
|
||||
if (current) current = current.next;
|
||||
}
|
||||
|
||||
if (current) {
|
||||
newNode.next = current.next;
|
||||
newNode.prev = current;
|
||||
if (current.next) current.next.prev = newNode;
|
||||
current.next = newNode;
|
||||
}
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
removeAt(index: number): void {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Wrong index");
|
||||
return;
|
||||
}
|
||||
|
||||
let current = this.head;
|
||||
|
||||
if (index === 0) {
|
||||
this.head = current ? current.next : null;
|
||||
if (this.head) {
|
||||
this.head.prev = null;
|
||||
} else {
|
||||
this.tail = null;
|
||||
}
|
||||
} else if (index === this.length - 1) {
|
||||
current = this.tail;
|
||||
this.tail = current ? current.prev : null;
|
||||
if (this.tail) this.tail.next = null;
|
||||
} else {
|
||||
for (let i = 0; i < index; i++) {
|
||||
if (current) current = current.next;
|
||||
}
|
||||
|
||||
if (current && current.prev && current.next) {
|
||||
current.prev.next = current.next;
|
||||
current.next.prev = current.prev;
|
||||
}
|
||||
}
|
||||
|
||||
this.length--;
|
||||
}
|
||||
|
||||
// Изменение элемента по индексу
|
||||
updateAt(index: number, newData: T): void {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Wrong index");
|
||||
return;
|
||||
}
|
||||
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index; i++) {
|
||||
if (current) current = current.next;
|
||||
}
|
||||
|
||||
if (current) current.data = newData;
|
||||
}
|
||||
|
||||
// Поиск элемента по индексу
|
||||
search(data: T): Node<T> | null {
|
||||
let current = this.head;
|
||||
while (current) {
|
||||
if (current.data === data) {
|
||||
return current;
|
||||
}
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
// Получение длины списка
|
||||
getLength(): number {
|
||||
return this.length;
|
||||
}
|
||||
|
||||
// Элементы списка
|
||||
display(): void {
|
||||
let current = this.head;
|
||||
while (current) {
|
||||
console.log(current.data);
|
||||
current = current.next;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1,115 +0,0 @@
|
||||
class Node<T> {
|
||||
data: T;
|
||||
next: Node<T> | null;
|
||||
|
||||
constructor(data: T) {
|
||||
this.data = data;
|
||||
this.next = null;
|
||||
}
|
||||
}
|
||||
|
||||
class LinkedList<T> {
|
||||
head: Node<T> | null;
|
||||
length: number;
|
||||
|
||||
constructor() {
|
||||
this.head = null;
|
||||
this.length = 0;
|
||||
}
|
||||
|
||||
// Добавление элемента
|
||||
append(data: T): void {
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (!this.head) {
|
||||
this.head = newNode;
|
||||
} else {
|
||||
let current = this.head;
|
||||
while (current.next) {
|
||||
current = current.next;
|
||||
}
|
||||
current.next = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
// Вставка элемента
|
||||
insertAt(index: number, data: T): void {
|
||||
if (index < 0 || index > this.length) {
|
||||
console.error("Неверный индекс");
|
||||
return;
|
||||
}
|
||||
|
||||
const newNode = new Node(data);
|
||||
|
||||
if (index === 0) {
|
||||
newNode.next = this.head;
|
||||
this.head = newNode;
|
||||
} else {
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index - 1; i++) {
|
||||
if (current) current = current.next;
|
||||
}
|
||||
newNode.next = current ? current.next : null;
|
||||
if (current) current.next = newNode;
|
||||
}
|
||||
|
||||
this.length++;
|
||||
}
|
||||
|
||||
// Удаление элемента
|
||||
removeAt(index: number): void {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Неверный индекс");
|
||||
return;
|
||||
}
|
||||
|
||||
if (index === 0) {
|
||||
this.head = this.head ? this.head.next : null;
|
||||
} else {
|
||||
let current = this.head;
|
||||
let prev: Node<T> | null = null;
|
||||
for (let i = 0; i < index; i++) {
|
||||
prev = current;
|
||||
if (current) current = current.next;
|
||||
}
|
||||
if (prev && current) prev.next = current.next;
|
||||
}
|
||||
|
||||
this.length--;
|
||||
}
|
||||
|
||||
// Изменение элемента
|
||||
updateAt(index: number, newData: T): void {
|
||||
if (index < 0 || index >= this.length) {
|
||||
console.error("Неверный индекс");
|
||||
return;
|
||||
}
|
||||
|
||||
let current = this.head;
|
||||
for (let i = 0; i < index; i++) {
|
||||
if (current) current = current.next;
|
||||
}
|
||||
|
||||
if (current) current.data = newData;
|
||||
}
|
||||
|
||||
// Поиск элемента
|
||||
search(data: T): Node<T> | null {
|
||||
let current = this.head;
|
||||
while (current) {
|
||||
if (current.data === data) {
|
||||
return current;
|
||||
}
|
||||
current = current.next;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
// Получение длины списка
|
||||
getLength(): number {
|
||||
return this.length;
|
||||
}
|
||||
}
|
||||
@ -1,83 +0,0 @@
|
||||
class RedBlackNode<K, V> {
|
||||
key: K;
|
||||
value: V;
|
||||
color: 'red' | 'black';
|
||||
left: RedBlackNode<K, V> | null;
|
||||
right: RedBlackNode<K, V> | null;
|
||||
|
||||
constructor(key: K, value: V, color: 'red' | 'black' = 'red') {
|
||||
this.key = key;
|
||||
this.value = value;
|
||||
this.color = color;
|
||||
this.left = null;
|
||||
this.right = null;
|
||||
}
|
||||
}
|
||||
|
||||
class RedBlackTree<K, V> {
|
||||
root: RedBlackNode<K, V> | null;
|
||||
|
||||
constructor() {
|
||||
this.root = null;
|
||||
}
|
||||
|
||||
// Поиск элемента по ключу
|
||||
search(key: K): RedBlackNode<K, V> | null {
|
||||
return this._search(this.root, key);
|
||||
}
|
||||
|
||||
private _search(node: RedBlackNode<K, V> | null, key: K): RedBlackNode<K, V> | null {
|
||||
if (node === null || key === node.key) {
|
||||
return node;
|
||||
}
|
||||
|
||||
if (key < node.key) {
|
||||
return this._search(node.left, key);
|
||||
} else {
|
||||
return this._search(node.right, key);
|
||||
}
|
||||
}
|
||||
|
||||
// Вставка элемента
|
||||
insert(key: K, value: V): void {
|
||||
this.root = this._insert(this.root, key, value);
|
||||
if (this.root) this.root.color = 'black'; // Корень всегда черный
|
||||
}
|
||||
|
||||
private _insert(node: RedBlackNode<K, V> | null, key: K, value: V): RedBlackNode<K, V> {
|
||||
if (node === null) {
|
||||
return new RedBlackNode(key, value);
|
||||
}
|
||||
|
||||
if (key < node.key) {
|
||||
node.left = this._insert(node.left, key, value);
|
||||
} else if (key > node.key) {
|
||||
node.right = this._insert(node.right, key, value);
|
||||
} else {
|
||||
node.value = value; // Если ключ уже существует, обновляем значение
|
||||
}
|
||||
|
||||
return node;
|
||||
}
|
||||
|
||||
// Удаление элемента
|
||||
remove(key: K): void {
|
||||
this.root = this._remove(this.root, key);
|
||||
}
|
||||
|
||||
private _remove(node: RedBlackNode<K, V> | null, key: K): RedBlackNode<K, V> | null {
|
||||
if (node === null) {
|
||||
return null;
|
||||
}
|
||||
|
||||
return node;
|
||||
}
|
||||
|
||||
// Изменение элемента
|
||||
update(key: K, value: V): void {
|
||||
const node = this.search(key);
|
||||
if (node) {
|
||||
node.value = value;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1,7 +0,0 @@
|
||||
// Собственный тип данных - Пользователь
|
||||
type CustomUserType = {
|
||||
name: string;
|
||||
email: string;
|
||||
};
|
||||
|
||||
type UserList = Record<string, CustomUserType>;
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 72 KiB |
|
Before Width: | Height: | Size: 154 KiB |
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 72 KiB |
|
Before Width: | Height: | Size: 154 KiB |
|
Before Width: | Height: | Size: 235 KiB |
|
Before Width: | Height: | Size: 97 KiB |
|
Before Width: | Height: | Size: 120 KiB |
|
Before Width: | Height: | Size: 112 KiB |
Loading…
Reference in new issue