Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I'm looking for a well tested simple in-memory binary tree implementation for c#. I would appreciate any pointers...
The .NET framework already contains them, they are just not advertised as such. Probably because of the inherent ambiguity in the three different ways to iterate a tree. SortedDictionary uses a self-balancing red-black tree under the hood and has the same time and space complexity as a binary tree. You'll need SortedList if your tree contains duplicates.
How about this article on MSDN? (An Extensive Examination of Data Structures Using C# 2.0 ).
Here is a very well tested one: SortedList
You could try this implementation found at CodeProject. Has worked for me.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
The community reviewed whether to reopen this question 9 months ago and left it closed:
Original close reason(s) were not resolved
Improve this question
I need to write my own version of the Except method, or at least somehow modify how the LINQ one works. I'm comparing to large lists of custom objects, and need connect matches from list A to list B. I think Excepts hash table building is the fastest way to do the comparison, but the method will only return the non matches. I'm thinking if I can take a peek at how the method actually works, I can add the functionality I need.
Does anyone know where this resource is located?
.NET source code is open source now. You can check it on GitHub. The LINQ source is here: https://github.com/dotnet/runtime/tree/master/src/libraries/System.Linq
Also of note: How does LINQ Except work?
You can find most of the BCL source on the Reference Source site.
It sounds from your description that you should take a look at Enumerable.Intersect, however.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
We have a big trie in our server-side service which has something like tens of millions of nodes. Whole trie takes about 4 gigs of RAM. Until now we used only the basic binary .NET serialization for storing the trie in a file and reconstructing it back in memory. But it's way too slow... What are the better serialization algorithms in our case, some kind of direct mmap-like trick would be great but .NET doesn't permit custom memory allocators. The aim is to minimize saving and especially loading the trie from the file (filesize is not our concern).
Notice: We absolutely can't use relational databases for that because of the latencies.
Update: Well, we've found this similar question Persisting a trie to a file - C. C community seems better suited for this kind of questions ;) => Accepting protobuf.net solution.
The accepted "fastest serializer" for .net is ProtoBuf.net by a long way the fastest and smallest serializer. http://damienbod.wordpress.com/2014/01/09/comparing-protobuf-json-bson-xml-with-net-for-file-streams/
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I am looking for a spatial index library in C# that has to be able to index geometries (circles, polygons, polylines) as well as answer intersection questions. I found NetTopologySuite (NTS) and some other one-file solution project but I wonder if I missed anything significant?
NTS is pretty good but somewhat heavy. The second one is a one man art and apparently I have to pick it up and maintain myself. I wonder if I can find something that is supported and tested.
I am looking for C# one but if I can get hands on Java one, I can adapt that.
libspatialindex seems to have all the features you want, but it's in C++
JSI is a Java project, but it only works with rectangles.
I am not 100% sure but i guess Solr and Elastic search supports spatial index. They are in Java and they support REST.
I found some good examples here http://www.rtreeportal.org/
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I am on my way of linq learning and would like to see how linq is applied in the real world projects. So is there anyone who can suggest some open source C# and VB projects that employs Linq technology within?
I have found MOQ a very interesting project. It takes full advantage of .NET 3.5 (i.e. Linq expression trees) and C# 3.0 features (i.e. lambda expressions).
Though I have not checked it yet, I think SubSonic is one in my TODO List to study. I assume it will have lot of Linq techniques.
I think NHibernate.Linq will be a good lesson.
you can download the code here
Whereas authors of open source application often want to develop crossplatform application they tend to use .Net/Mono compatible features. The number of "LINQ-equipped" open source application will increasing after normal implementation of LINQ in Mono.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
Is there any Tree-Grid component that is freely available for a C# project? A Tree-grid is a combination of a tree view and a datagrid.
Every tree item represents a row in a table. Like this:
ObjectListView is great:
(source: sourceforge.net)
This one isn't bad :
http://www.codeproject.com/KB/tree/TreeWithColumns.aspx
The best one I used is DevExpress's XtraTreeList, but it's not free...
This one seems to work as well: http://www.codeproject.com/KB/list/treelistview.aspx
I'v e heard that many developers praise TreeViewAdv for .NET.
This one isn't free, but cheap enough. Easy to work with if you can create a data column in your binding source that has the hierarchy in the form of a string - i.e. /root/parent/branch
www.DigitalTools.com/gvt.aspx
(source: digitaltools.com)