首页下载资源数据库cmu 15445 2023spring project0

ZIPcmu 15445 2023spring project0

weixin_477349498.74KB需要积分:1

资源文件列表:

project0.zip 大约有15个文件
  1. project0/
  2. project0/src/
  3. project0/src/include/
  4. project0/src/include/execution/
  5. project0/src/include/execution/expressions/
  6. project0/src/include/execution/expressions/string_expression.h 3.15KB
  7. project0/src/include/primer/
  8. project0/src/include/primer/trie.h 4.3KB
  9. project0/src/include/primer/trie_answer.h 185B
  10. project0/src/include/primer/trie_store.h 1.64KB
  11. project0/src/planner/
  12. project0/src/planner/plan_func_call.cpp 2.04KB
  13. project0/src/primer/
  14. project0/src/primer/trie.cpp 5.5KB
  15. project0/src/primer/trie_store.cpp 2.46KB

资源介绍:

2023的入门实验，cow Trie。
#include "primer/trie.h" #include #include "common/exception.h" namespace bustub { template auto Trie::Get(std::string_view key) const -> const T * { // You should walk through the trie to find the node corresponding to the key. If the node doesn't exist, return // nullptr. After you find the node, you should use `dynamic_cast` to cast it to `const TrieNodeWithValue *`. If // dynamic_cast returns `nullptr`, it means the type of the value is mismatched, and you should return nullptr. // Otherwise, return the value. std::shared_ptr cur_node = root_; std::size_t key_size = key.size(); decltype(key_size) idx = 0; while (idx < key_size && cur_node) { char ch = key[idx++]; cur_node = cur_node->children_.find(ch) != cur_node->children_.end() ? cur_node->children_.at(ch) : nullptr; } if (idx != key_size || !cur_node || !cur_node->is_value_node_) { return nullptr; } const auto *leaf = dynamic_cast *>(cur_node.get()); return leaf ? leaf->value_.get() : nullptr; } template auto Trie::Put(std::string_view key, T value) const -> Trie { // Note that `T` might be a non-copyable type. Always use `std::move` when creating `shared_ptr` on that value. // You should walk through the trie and create new nodes if necessary. If the node corresponding to the key already // exists, you should create a new `TrieNodeWithValue`. std::shared_ptr shared_value = std::make_shared(std::move(value)); std::vector> node_stack; // store the same node std::shared_ptr cur_node = root_; std::size_t key_size = key.size(); decltype(key_size) idx = 0; // 1.store the same node while (idx < key_size && cur_node) { char ch = key[idx++]; node_stack.push_back(cur_node); cur_node = cur_node->children_.find(ch) != cur_node->children_.end() ? cur_node->children_.at(ch) : nullptr; } // 2.create diff node // 2.1create leaf node std::shared_ptr> leaf_node = cur_node ? std::make_shared>(cur_node->children_, shared_value) : std::make_shared>(shared_value); // 2.2create diff inner node std::shared_ptr child_node = leaf_node; while (idx < key_size) { char ch = key[--key_size]; std::map> children{{ch, child_node}}; cur_node = std::make_shared(children); child_node = cur_node; } // 3.copy same node cur_node = child_node; for (size_t i = node_stack.size() - 1; i < node_stack.size(); --i) { cur_node = std::shared_ptr(node_stack[i]->Clone()); const_cast(cur_node.get())->children_[key[i]] = child_node; child_node = cur_node; } return Trie(cur_node); } auto Trie::Remove(std::string_view key) const -> Trie { // You should walk through the trie and remove nodes if necessary. If the node doesn't contain a value any more, // you should convert it to `TrieNode`. If a node doesn't have children any more, you should remove it. std::vector> node_stack; // store the same node std::shared_ptr cur_node = root_; std::size_t key_size = key.size(); decltype(key_size) idx = 0; // 1.store the same node while (idx < key_size && cur_node) { char ch = key[idx++]; node_stack.push_back(cur_node); cur_node = cur_node->children_.find(ch) != cur_node->children_.end() ? cur_node->children_.at(ch) : nullptr; } if (idx != key_size || !cur_node || !cur_node->is_value_node_) { return *this; } // 2.create end node std::shared_ptr end_node = cur_node->children_.empty() ? nullptr : std::make_shared(cur_node->children_); // 3.copy same node std::shared_ptr child_node = end_node; cur_node = end_node; for (size_t i = node_stack.size() - 1; i < node_stack.size(); --i) { cur_node = std::shared_ptr(node_stack[i]->Clone()); const_cast(cur_node.get())->children_[key[i]] = child_node; child_node = cur_node; } return Trie(cur_node); } // Below are explicit instantiation of template functions. // // Generally people would write the implementation of template classes and functions in the header file. However, we // separate the implementation into a .cpp file to make things clearer. In order to make the compiler know the // implementation of the template functions, we need to explicitly instantiate them here, so that they can be picked up // by the linker. template auto Trie::Put(std::string_view key, uint32_t value) const -> Trie; template auto Trie::Get(std::string_view key) const -> const uint32_t *; template auto Trie::Put(std::string_view key, uint64_t value) const -> Trie; template auto Trie::Get(std::string_view key) const -> const uint64_t *; template auto Trie::Put(std::string_view key, std::string value) const -> Trie; template auto Trie::Get(std::string_view key) const -> const std::string *; // If your solution cannot compile for non-copy tests, you can remove the below lines to get partial score. using Integer = std::unique_ptr; template auto Trie::Put(std::string_view key, Integer value) const -> Trie; template auto Trie::Get(std::string_view key) const -> const Integer *; template auto Trie::Put(std::string_view key, MoveBlocked value) const -> Trie; template auto Trie::Get(std::string_view key) const -> const MoveBlocked *; } // namespace bustub
100+评论
captcha

    相关资源

    1. Java Web 的jar包

      kai212#后端ZIP2.96MB3周前
      资源摘要:内含：jstl-1.2.jarmysql-connector-java-8.0.29.jarstandard.jar

    2. Java实现ocr图片识别（PaddleOCR）飞桨

      qq_36582257#后端ZIP1.64MB3周前
      资源摘要:Java实现ocr图片识别（PaddleOCR）飞桨

    3. springboot3+ vue3前后端分离项目搭建代码

      qq_51355375#后端ZIP34.85MB3周前
      资源摘要:springboot3+ vue3前后端分离项目搭建代码

    4. 图像处理常用的McMaster数据集

      zjh12312311#行业研究ZIP7.5MB3周前
      资源摘要:和kodak24一样，0积分大家拿去

    5. JDK1.8 API帮助文档（纯源，无广告）

      m0_67658126#后端ZIP49.24MB3周前
      资源摘要:JDK1.8 API帮助文档（纯源，无广告）

    6. HEX-Float转换工具 16进制转成float 或double类型数据的一个小工具

      syq8023#服务器应用ZIP616.29KB3周前
      资源摘要:16进制转成float 或double类型数据的一个小工具。

    7. N_m3u8DL-CLI_v2.6.3_with_ffmpeg_and_SimpleG.zip

      qq_44890458#行业ZIP5.87MB3周前
      资源摘要:m3u8下载神器，配合Fiddler可爬取网络直播视频

    8. Python数据分析初探项目 基于Python数据可视化的网易云音乐歌单分析系统 大学编程作业（TUST 天津科技大学 2022

      qq_40734758#后端ZIP20.47MB3周前
      资源摘要:本基于 Python 数据可视化的网易云音乐歌单分析系统，我使用了 Python 丰富的第三方开源模块，如 numpy, pandas, matplotlib, time, requests, squarify, jieba, wordcloud, bs4 等来制作，实现了对网易云音乐歌单数据的获取，对歌单数据进行可视化分析，得出歌单的评论、收藏、播放、贡献、分布的数量图以及词云，并提出歌单优化的建议。通过这次 Python 数据分析初探项目的实践，我巩固了 Python 的语法知识，熟练应用了各个第三方开源模块，为之后的 Python 数据分析学习打下基础。这个项目是我大三写的，现在回顾已经非常粗糙，分享出来一方面希望可以帮助初学者，另一方面希望能让同学们可以从目前大学中普遍毫无价值的形式主义作业中解脱出来，更加高效地学习优质计算机知识和主流编程技术，一起发扬开源精神，感受互联网技术的美好愿景。
    站长QQ:九六九五七三七