blocks|key|1193728|text|像这样的东西应该工作得很好(不需要太多测试)：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1193729|http://pastebin.com/eYeE33F5|offset|length|1193730|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|S|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|N|8|@]|9|@$D|O|E|P|1|Q]]|A|$]]|$1|F|3|-4|5|6|7|R|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|C]]]]

Something like this should work fine (not tested very much): 

<a href="http://pastebin.com/eYeE33F5" rel="nofollow">http://pastebin.com/eYeE33F5</a>

blocks|key|4967784|text|它看起来优先级队列就是你要找的。使用二进制堆可以很好地实现这个类。示例：http://www.codeproject.com/Articles/126751/Priority-queue-in-Csharp-with-help-of-heap-data-st.aspx|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|4967785|entityMap|0|LINK|mutability|MUTABLE|url|http://www.codeproject.com/Articles/126751/Priority-queue-in-Csharp-with-help-of-heap-data-st.aspx^0|10|2Q|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

It seams that priority queue is what you are looking for. There are good implementations of this class using binary heap. Example : <a href="http://www.codeproject.com/Articles/126751/Priority-queue-in-Csharp-with-help-of-heap-data-st.aspx" rel="nofollow">http://www.codeproject.com/Articles/126751/Priority-queue-in-Csharp-with-help-of-heap-data-st.aspx</a>

blocks|key|4967818|text|你为什么不留着普通的字典。现在，每当您需要进行缓存替换时，就是选择具有“最小值”的元素并替换它的时刻。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4967819|编辑-以下是如何获得具有最小值的KeyPair。在此之后只需使用Key和Value属性：|4967820|var+minValuePair+=+myDictionary.OrderBy(p+=>+p+.Value).First();|code-block|syntax|javascript|4967821|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

Why don't you just keep the regular Dictionary. Now, whenever you need to do that cache replacement, that's the moment you select the element with the "minimum" value and replace it.

Edit - here is how you get the KeyPair with the minimum value. Just use the Key and Value properties after that:

<pre><code>var minValuePair = myDictionary.OrderBy(p =&gt; p .Value).First();
</code></pre>

blocks|key|3498820|text|您可以将任何类型的快速优先级队列(查看此处：Priority+queue+in+.Net)与标准字典组合到一个新集合中。插入新元素时，将对该元素的引用插入到两个容器中。当通过"key“查找元素时，请使用字典。当您要删除具有最低“指标”的元素时，使用优先级队列找到它，从元素本身获取键，然后很容易从两个容器中删除元素引用。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3498821|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/102398/priority-queue-in-net^0|M|M|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

You can combine any kind of fast priority queue (look here: <a href="https://stackoverflow.com/questions/102398/priority-queue-in-net">Priority queue in .Net</a>) with a standard Dictionary to a new collection. When inserting a new element, insert a reference to the element into both containers. When looking for an element by "key", use the dictionary. When you are going to delete the element with the lowest "metric", use the priority queue to find it, get the key from the element itself, then it is easy to delete the element references from both containers.

blocks|key|1182551|text|您需要一个按值排序但也有按键索引的字典。您不能同时以两种方式排列数据，因此必须有两个集合，一个是基本键值字典，另一个是反向查找字典。第一个是标准字典，第二个是具有相同数据并交换了键和值的SortedDictionary。您必须使两者保持同步。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1182552|您还可以编写自己的Dictionary实现，将这两个集合封装为一个集合。|1182553|entityMap^0|2L|G|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|M|8|@]|D|@]|E|$]]|$1|H|3|-4|5|6|7|N|8|@]|D|@]|E|$]]]|I|$]]

You want a dictionary that is sorted by Value but also has indexing by Key. You can't have your data arranged in two ways at once, so you will have to have two collections, your base key-value dictionary, and a reverse lookup dictionary. Your first one is a standard dictionary, your second one is a <code>SortedDictionary</code> with the same data and the keys and values swapped. You will have to keep the two in sync.

You could also write your own Dictionary implementation to encapsulate these two collections into one.

I need a dictionary (or any other collection) that stays always sorted by value and can be indexed by key. My purpose is to implement a cache where objects have a unique key and a metric associated to them. When a cache replacement has to be done objects with the least metric are removed. It needs to be as fast as possible, so to make a full ordering each time a replacement is done is not a good option. Any ideas? Thx

Dictionary<> always sorted on value, lookup index from key

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我需要一个字典(或任何其他集合)，它总是按值排序，并可以按键索引。我的目的是实现一个缓存，其中对象具有唯一的键和与其关联的度量。当必须进行缓存替换时，具有最少度量的对象将被删除。它需要尽可能快，所以每次更换时都要进行完整的排序不是一个好的选择。有什么想法吗？Thx

问Dictionary<>始终按值排序，从键查找索引
EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Dictionary<>始终按值排序，从键查找索引EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Dictionary<>始终按值排序，从键查找索引
EN