<small id='zOpJi'></small><noframes id='zOpJi'>

    <legend id='zOpJi'><style id='zOpJi'><dir id='zOpJi'><q id='zOpJi'></q></dir></style></legend>

      <bdo id='zOpJi'></bdo><ul id='zOpJi'></ul>
    1. <tfoot id='zOpJi'></tfoot>

      <i id='zOpJi'><tr id='zOpJi'><dt id='zOpJi'><q id='zOpJi'><span id='zOpJi'><b id='zOpJi'><form id='zOpJi'><ins id='zOpJi'></ins><ul id='zOpJi'></ul><sub id='zOpJi'></sub></form><legend id='zOpJi'></legend><bdo id='zOpJi'><pre id='zOpJi'><center id='zOpJi'></center></pre></bdo></b><th id='zOpJi'></th></span></q></dt></tr></i><div id='zOpJi'><tfoot id='zOpJi'></tfoot><dl id='zOpJi'><fieldset id='zOpJi'></fieldset></dl></div>
    2. 有没有“套路"?.Net 中的数据结构?

      时间:2023-10-25

            1. <small id='dIMFd'></small><noframes id='dIMFd'>

              <i id='dIMFd'><tr id='dIMFd'><dt id='dIMFd'><q id='dIMFd'><span id='dIMFd'><b id='dIMFd'><form id='dIMFd'><ins id='dIMFd'></ins><ul id='dIMFd'></ul><sub id='dIMFd'></sub></form><legend id='dIMFd'></legend><bdo id='dIMFd'><pre id='dIMFd'><center id='dIMFd'></center></pre></bdo></b><th id='dIMFd'></th></span></q></dt></tr></i><div id='dIMFd'><tfoot id='dIMFd'></tfoot><dl id='dIMFd'><fieldset id='dIMFd'></fieldset></dl></div>
              <tfoot id='dIMFd'></tfoot>

                <tbody id='dIMFd'></tbody>
                <bdo id='dIMFd'></bdo><ul id='dIMFd'></ul>
              • <legend id='dIMFd'><style id='dIMFd'><dir id='dIMFd'><q id='dIMFd'></q></dir></style></legend>
                本文介绍了有没有“套路"?.Net 中的数据结构?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着跟版网的小编来一起学习吧!

                问题描述

                理想情况下,我正在寻找一个模板化的逻辑 Set 类.它将具有所有标准集合操作,例如 Union、Intersection 等,以及折叠重复项.

                Ideally, I'm looking for a templated logical Set class. It would have all of the standard set operations such as Union, Intersection, Etc., and collapse duplicated items.

                我最终基于 C# 字典创建了我自己的集合类<>- 仅使用键.

                I ended up creating my own set class based on the C# Dictionary<>- just using the Keys.

                推荐答案

                HashSet<T> 我想你会得到最接近的.

                HashSet<T> is about the closest you'll get, I think.

                这篇关于有没有“套路"?.Net 中的数据结构?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!

                上一篇:在 C# 中定义 set 访问器时如何避免堆栈溢出错误 下一篇:速记访问器和突变器

                相关文章

                  <bdo id='1ENxK'></bdo><ul id='1ENxK'></ul>
                <i id='1ENxK'><tr id='1ENxK'><dt id='1ENxK'><q id='1ENxK'><span id='1ENxK'><b id='1ENxK'><form id='1ENxK'><ins id='1ENxK'></ins><ul id='1ENxK'></ul><sub id='1ENxK'></sub></form><legend id='1ENxK'></legend><bdo id='1ENxK'><pre id='1ENxK'><center id='1ENxK'></center></pre></bdo></b><th id='1ENxK'></th></span></q></dt></tr></i><div id='1ENxK'><tfoot id='1ENxK'></tfoot><dl id='1ENxK'><fieldset id='1ENxK'></fieldset></dl></div>

                1. <legend id='1ENxK'><style id='1ENxK'><dir id='1ENxK'><q id='1ENxK'></q></dir></style></legend>
                2. <tfoot id='1ENxK'></tfoot>

                  <small id='1ENxK'></small><noframes id='1ENxK'>