This repository has been archived by the owner on Dec 27, 2022. It is now read-only.
add I example #1
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
igchor
reviewed
Jul 9, 2020
examples/I/find_words.cpp
Outdated
| * Any contribution is more than welcome. | ||
| */ | ||
| template<typename T> | ||
| using matrix_type = typename pmem::obj::vector<persistent_ptr<pmem::obj::vector<T>>>; |
szyrom
force-pushed
the
add_example_I
branch
3 times, most recently
from
840ba71 to
68db569
Compare
szyrom
force-pushed
the
add_example_I
branch
3 times, most recently
from
bcdaba8 to
3f704a4
Compare
| @@ -0,0 +1,19 @@ | |||
| # | |||
| # Makefile for finding words examples | |||
| // Insert a new value in transaction in order to guarantee | ||
| // data consistency and atomicty. If we want to perform | ||
| // transaction in a specyfic persistent memory pool, we need a | ||
| // pool handle |
|
|
||
| C++ programmers will get the most out of this example. | ||
|
|
||
| This is example consists of these files: |
|
|
||
| In this example we are given a problem to solve: | ||
| In a 2-D matrix of characters (board.txt) we must find all the words from a | ||
| dictionary (dictionary.txt). Words can be formed from the adjecent cells (left, |
| #include "trie.hpp" | ||
| #include "hashset.hpp" | ||
|
|
||
| /* A unique layoout of the peristent memory pool that we are going to use */ |
| * std::pair for trivial types is implemented in all the C++ standard libraries | ||
| * in the same way and most of the well know compilers define this structure | ||
| * layout exactly the same. | ||
| * Using std::pair is theoreatically undefined behaviour, we could easly use |
| } | ||
|
|
||
| /* | ||
| * dfs -- deep-frist-search helper function, can be called only from solve() |
| curr_word += board[i][j]; | ||
| board[i][j] += 26; // mark as checked | ||
|
|
||
| if (trie_root.find_prefix(curr_word)) { // it is existing prefix, continue dfs |
| # shell commands to run find_words example | ||
| # | ||
|
|
||
| # show the contents of the imput data set |
| class trie { | ||
|
|
||
| struct trieNode { | ||
| // Note that we are declareing pmem::obj::array of children |
| * Insert a word to the trie. | ||
| */ | ||
| void insert(const std::string &word) { | ||
| // Insert a new value in transaction in order to guarantee |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The main intention in this example is to show how to use persistent memory containers from libpmemobj-cpp library.
The example also highlights structures/classes layout issues on persistent memory, describes peristent_ptr dereference overhead, and shows good practices when designing structures for persistent memory with data-oriented design in mind.