B-Trees
B-tree implementation in C++ to index documents based on numerical id's and title strings.
Entry.hpp
Go to the documentation of this file.
1 #ifndef _ENTRY_HPP_INCLUDED_
2 #define _ENTRY_HPP_INCLUDED_
3 
5 #define TITLE_CHAR_MAX 300
6 
8 #define AUTHORS_CHAR_MAX 1024
9 
11 #define TIMESTAMP_CHAR_MAX 20
12 
14 #define SNIPPET_CHAR_MAX 1024
15 
17 
20 struct Entry {
21  bool valid;
22  int id;
24  int year;
26  int citations;
29 };
30 
31 #endif // _ENTRY_HPP_INCLUDED_
int year
Publication year of the article.
Definition: Entry.hpp:24
char authors[AUTHORS_CHAR_MAX]
Article authors.
Definition: Entry.hpp:25
#define TIMESTAMP_CHAR_MAX
Max timestamp size in characters.
Definition: Entry.hpp:11
int citations
Times the article has been cited.
Definition: Entry.hpp:26
char updateTimestamp[TIMESTAMP_CHAR_MAX]
Last update timestamp.
Definition: Entry.hpp:27
#define TITLE_CHAR_MAX
Max title size in characters.
Definition: Entry.hpp:5
#define SNIPPET_CHAR_MAX
Max snippet size in characters.
Definition: Entry.hpp:14
Article entry.
Definition: Entry.hpp:20
int id
Article identifier.
Definition: Entry.hpp:22
bool valid
True if the data is legit, false if the entry is being used only for padding within the file...
Definition: Entry.hpp:21
char title[TITLE_CHAR_MAX]
Article title.
Definition: Entry.hpp:23
#define AUTHORS_CHAR_MAX
Max author name list size in total characters.
Definition: Entry.hpp:8
char snippet[SNIPPET_CHAR_MAX]
Article snippet.
Definition: Entry.hpp:28