/
comic.ts
62 lines (60 loc) · 1.9 KB
/
comic.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/*
* ComiXed - A digital comic book library management application.
* Copyright (C) 2020, The ComiXed Project
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses>
*/
import { FileDetails } from '@app/comic-books/models/file-details';
import { ComicCredit } from '@app/comic-books/models/comic-credit';
import { Page } from '@app/comic-books/models/page';
import { ComicBookState } from '@app/comic-books/models/comic-book-state';
import { ArchiveType } from '@app/comic-books/models/archive-type.enum';
export interface Comic {
id: number;
archiveType: ArchiveType;
filename: string;
baseFilename: string;
comicState: ComicBookState;
missing: boolean;
fileDetails: FileDetails;
addedDate: number;
deletedDate: number;
lastModifiedOn: number;
publisher: string;
series: string;
volume: string;
issueNumber: string;
coverDate: number;
storeDate: number;
yearPublished: number;
title: string;
sortableIssueNumber: string;
sortName: string;
imprint: string;
comicVineId: number;
pageCount: number;
characters: string[];
teams: string[];
locations: string[];
stories: string[];
credits: ComicCredit[];
nextIssueId: number;
previousIssueId: number;
blockedPageCount: number;
deletedPageCount: number;
description?: string;
notes: string;
pages?: Page[];
duplicateCount?: number;
}