D2Learn Forums

• General Discussion | 综合讨论

  A place to talk about whatever you want

  14 主题

  121 帖子

  S

  @semmyenator 是的, 需要 [私钥 -map-> 公钥] 是一个不可逆或有限条件下不可逆, 这样才能保证安全性

• Open Courses | 公开课

  d2learn及其他网络公开课/教程内容讨论

  d2ds | 动手学数据结构

  mcpp-standard | 现代C++核心特性练习

  CS144 | 计算机网络导论

  d2python | 动手学Python

  cmu 15-445 | Database Systems
  8 主题

  12 帖子

  S

  视频评论同步 - 类型类别和值类别探讨

  image.png

• Open source | 开源

  开源软件 | 开源社区 | 开源理念 | 开源与商业 | 开源可持续发展 等相关话的交流讨论
  注: 这里的"开源"是泛化的共建共享概念, 范围包含 OSI的范围、自由软件、CC等相关内容

  xlings

  project-graph
  37 主题

  161 帖子

  S

  开发了一个可以把包索引仓库生成一个支持模糊搜索的包索引站点, 并提供一些基本功能:

  包预览 随机推荐 模糊搜索 包详情页面 语言切换(中/En) 等功能....

  下面为初期版本页面展示...

  XIM包索引站点-示例Demo: https://d2learn.github.io/xim-pkgindex

  1.主页 包随机推荐: 每5秒切换一个包卡片, 提供基本信息和一个可复制的安装命令 包预览: 提供一个4行的交叉循环轮播, 并可通过点击包卡片进入详情页

  6070307c-5902-4844-8b60-9d0f0ac05555-image.png

  2.模糊搜索

  搜索列表中能预览包名、关键字、简介等信息...

  ebbb8ca6-52f9-4791-83f3-0111d7b5d1b1-image.png

  3.包详情页 (待完善) 包基础信息 依赖信息 相关链接

  22bfd916-f51f-4f3f-99e6-d38c6c1f9fd5-image.png

  4.Github静态网页部署

  workflows参考: https://github.com/d2learn/xim-pkgindex/blob/main/.github/workflows/pkgindex-deloy.yml

  5.相关链接 XIM 包索引站点 - xlings的包索引站点 xpkgindex - 包索引网页生成工具 xlings - 包安装工具 xim-pkgindex - xpkg包描述文件仓库 论坛交流 - d2learn中的xlings交流讨论版块
• d2learn开源

  d2learn开源组

  4 主题

  6 帖子

  S

  如果使用xlings安装gcc15.1呢, 可以试一试会报同样的错误吗?

  xlings install gcc@15.1.0

  https://d2learn.github.io/xim-pkgindex/packages/gcc.html

• Blogs | 博客

  Blog posts from individual members | 创建个人博客版块

  Sunrisepeak's Blog

  invoker__qq's Blog

  pinkie_ctfer's Blog

  Maxwell1905's Blog

  FrozenLemonTee's Blog
  11 主题

  31 帖子

  妈

  本系列博客作为我学习的一个笔记,注重于代码实现,本人非数学专业,证明能力非常弱,本文掺杂着大量我自己的理解,如有数学大佬光顾,请尽情指正,谢谢
  本系列默认大家都学会了C/C++基本语法

  集合 书上的定义 集合是指具有某种特定性质的不同对象无序聚集成的一个整体。 集合中的每一个对象称为集合的元素； 通常用大写字母表示集合； 用小写字母表示集合中的元素。

  也就是说把一些东西放到一起叫做集合(个人理解)

  代码实现 #include <string> #include <vector> #include <stdint.h> #include <iostream> // 抽象基类，定义集合元素的基本接口 class elmBase { public: // 将元素转换为字节数组的纯虚函数（序列化基础） virtual std::vector<uint8_t> getUint8Array() const = 0; // 默认比较运算符，通过字节数组逐字节比较 virtual int operator==(const elmBase &other) { std::vector<uint8_t> thisDate = getUint8Array(); std::vector<uint8_t> otherDate = other.getUint8Array(); if (thisDate.size() != otherDate.size()) return 0; for (int i = 0; i < thisDate.size(); i++) { if (thisDate[i] != otherDate[i]) return 0; } return 1; } // 转换为字符串表示的纯虚函数 virtual std::string toString() = 0; // 虚析构函数确保正确释放派生类对象 virtual ~elmBase() { } }; // 特殊元素类型，始终返回比较不成立 class alwaysFalse : public elmBase { public: std::vector<uint8_t> getUint8Array() const override { return std::vector<uint8_t>(); // 返回空数组 } std::string toString() override { return {}; // 返回空字符串 } // 重载运算符始终返回false，用于占位符场景 virtual int operator==(const elmBase &other) override { return 0; } ~alwaysFalse() { } }; // 哈希表节点结构，使用链表法解决冲突 using elmNode = struct elmNode { elmBase *elm; // 元素指针 elmNode *next; // 下一个节点指针 }; // 节点工厂函数，创建新节点并初始化元素 elmNode *elmNodeFactory(elmBase *elm) { elmNode *newNode = new elmNode(); newNode->elm = elm; newNode->next = nullptr; return newNode; } // 自定义集合类，基于哈希表实现 class set { private: uint32_t prime; // 哈希表大小（通常选择质数） elmNode **setMap; // 哈希桶数组 // 初始化哈希表结构 void inline _init_(uint32_t prime) { this->prime = prime; this->setMap = new elmNode *[prime]; // 初始化每个桶为alwaysFalse哨兵节点 for (uint32_t i = 0; i < prime; ++i) { this->setMap[i] = elmNodeFactory(new alwaysFalse()); } } protected: // 查找元素对应的哈希桶 elmNode **__find__(elmBase *elm) { uint32_t hash = rotatingHash(elm->getUint8Array(), this->prime); return &(this->setMap[hash]); // 返回桶的指针 } /** * 通用链表操作函数 * @param link 链表头指针的指针 * @param elm 目标元素 * @param cmp 自定义比较函数，返回true时停止遍历 * @param finally 遍历结束后的处理函数（插入等操作） * @return 找到的节点或操作结果节点 */ elmNode *__link__(elmNode **link, elmBase *elm, bool (*cmp)(elmNode *, elmBase *), elmNode *(*finally)(elmNode **, elmNode *, elmBase *) = nullptr) { elmNode *linkPriv = *link; elmNode *linkCurrent = linkPriv; // 遍历链表查找元素 while (linkCurrent != nullptr) { if (cmp(linkCurrent, elm)) { return linkCurrent; } linkPriv = linkCurrent; linkCurrent = linkCurrent->next; } // 执行最终处理函数（如插入新节点） if (finally != nullptr) { return finally(link, linkPriv, elm); } return nullptr; } public: // 构造函数初始化哈希表 set(uint32_t prime) { _init_(prime); } ~set() { for (uint32_t i = 0; i < this->prime; ++i) { elmNode *link = this->setMap[i]; while (link != nullptr) { elmNode *tmp = link; link = link->next; if (tmp != nullptr) { if (tmp->elm != nullptr) { std::cout << "delete " << tmp->elm->toString() << std::endl; delete tmp->elm; } delete tmp; } } } } // 旋转哈希算法实现 static uint32_t rotatingHash(std::vector<uint8_t> key, uint32_t prime) { uint32_t hash = key.size(); for (uint32_t i = 0; i < key.size(); ++i) hash = (hash << 4) ^ (hash >> 28) ^ (uint32_t)(key[i]); return (hash % prime); } // 添加元素到集合 bool add(elmBase *elm, bool force = false) { elmNode **node = __find__(elm); auto finally = [](elmNode **node, elmNode *linkPriv, elmBase *elm) -> elmNode * { // 插入新节点到链表末尾 if (linkPriv->next == nullptr) { linkPriv->next = elmNodeFactory(elm); } return nullptr; }; // 使用lambda作为比较函数 elmNode *targetNode = this->__link__(node, elm, [](elmNode *node, elmBase *tag) -> bool { return *(node->elm) == *tag; }, finally); return targetNode == nullptr; // 返回是否插入成功 } // 检查元素是否存在 bool get(elmBase *elm) { elmNode **node = __find__(elm); elmNode *targetNode = this->__link__(node, elm, [](elmNode *node, elmBase *tag) -> bool { return *(node->elm) == *tag; }); return targetNode != nullptr; } // 移除集合中的元素 bool remove(elmBase *elm) { elmNode **node = __find__(elm); elmNode *ret = this->__link__(node, elm, [](elmNode *current, elmBase *tag) -> bool { // 查找前驱节点执行删除 if (current->next != nullptr && *(current->next->elm) == *tag) { elmNode *tmp = current->next; current->next = current->next->next; delete tmp->elm; // 释放元素内存 delete tmp; // 释放节点内存 return true; } return false; }); return ret != nullptr; } // 调试用打印函数，显示哈希表结构 void print() { std::cout << "[HashTable Structure]" << std::endl; for (int i = 0; i < this->prime; i++) { std::cout << "Bucket " << i << ": "; elmNode *node = this->setMap[i]; while (node != nullptr) { std::cout << node->elm->toString() << " -> "; node = node->next; } std::cout << "NULL" << std::endl; } } }; // 数值类型元素实现 class number : public elmBase { int data; public: number(int data) : data(data) {} std::vector<uint8_t> getUint8Array() const override { // 将整型转换为字节数组 return std::vector<uint8_t>( reinterpret_cast<const uint8_t *>(&data), reinterpret_cast<const uint8_t *>(&data) + sizeof(data)); } std::string toString() override { return std::to_string(data); } ~number() { } }; // 字符串类型元素实现 class string : public elmBase { std::string data; public: string(std::string data) : data(data) {} std::vector<uint8_t> getUint8Array() const override { // 将字符串内容转换为字节数组 return std::vector<uint8_t>(data.begin(), data.end()); } std::string toString() override { return data; } ~string() { } }; 集合与元素的关系 若A表示一个集合，a是集合A中的元素，记作aA，读作a属于A； 若a不是集合A中的元素，则记作aA，读作a不属于A。

  未完待续

• Announcements | 公告

  一个技术知识分享、学习、交流的社区

  14 主题

  43 帖子

  S

  中文版

  Introduction and Background

  A community forum oriented towards [knowledge/technology, projects, open courses, creative ideas, etc. + open-source philosophy].

  Why build such a forum?

  Many platforms are moving towards being comprehensive and entertainment-focused, leading to a massive increase in content volume but a decrease in the density of specific thematic content. There are relatively few forums related to open source in Chinese platforms, with content scattered across various platforms, lacking a common platform for exchange and sharing. Provide a platform for discussing topics related to open-source philosophy | open-source licenses | open-source projects | open-source communities | open-source and business | sustainable development of open-source, etc. Main Sections and Topics

  General Discussion Section

  Posts without a specific topic section are generally posted here.

  04473257-cc22-456b-b3e9-cfeed513a14a-image.png

  Open Courses Section

  Post content and discussions related to various open courses. Developers of courses/tutorial projects can create corresponding discussion sections.

  6ae992b8-d831-4a8d-8bbd-e00b4cb4b067-image.png

  Open Source Section

  Discussions on topics related to open-source software | open-source communities | open-source philosophy | open-source and business | sustainable development of open-source. Developers of open-source projects can create discussion sections for their projects.

  cf3aa71e-2fda-44cf-b016-6cea0876bb51-image.png

  d2learn Open Source

  Explorations of open-source content by the d2learn community/open-source group.

  04970ff0-56fb-4f7b-8f2f-a2ce42747315-image.png

  Forum Feedback & Community Building

  Feedback on forum-related issues and suggestions. Discussions on topics related to the sustainable development of the forum.

  ca1f43d9-162a-4a5d-9e3a-1dc7878f926a-image.png

  Functional Perspective A platform for open-source enthusiasts to exchange and discuss. Developers of open-source projects/open courses and tutorials can create discussion/exchange sections for their projects. A platform for discussing topics related to open-source itself (e.g., sustainable development of open-source projects). Others. Forum Philosophy and Restrictions

  Philosophy and Orientation

  Focus on technology, knowledge, creativity, and open-source fields, avoiding entertainment. Professional content and rational discussions, avoiding deliberately emotional content.

  Forum Code of Conduct

  Encouraged behaviors

  Use inclusive language. Respect different viewpoints and experiences. Gracefully accept constructive criticism.

  Prohibited/Restricted

  Provocative, insulting/derogatory comments, and personal attacks. Registration and Section Creation

  Registration Methods

  GitHub: Directly use GitHub for SSO single sign-on. Email invitation registration: Users who have already registered and completed email verification can invite others to register via the user interface.

  Personal Blogs and Subsection Creation

  Application Template Others https://d2learn.org https://github.com/d2learn Instant communication group (Q): 167535744

  Note: translate by ai-llm - original

• Comments & Feedback

  Got a question? Ask away!

  2 主题

  9 帖子

  S

  推荐一个开源浏览器插件, 效果不错。后面研究研究看能不能直接集成到论坛上
  image.png

  https://github.com/darkreader/darkreader

在线用户