Scenario I'm going to be as succinct as possible. Basically with reference to this classdiag, I have a facade which manages a list of SocketManager ( which manages one Socket connection). Each SocketManager logs in to a remote server using a unique SocketUserId. Furthermore, each SocketManager will accept messages from clients destined ...
Suppose I have this struct (which incidentally contain bit-fields, but you shouldn't care): struct Element { unsigned int a1 : 1; unsigned int a2 : 1; ... unsigned int an : 1; }; and I want to access the i'th member in a convenient way. Let's examine a retrieval solution. I came up with this function: int getval(str...
I see two main "schools of thoughts" when it comes to creating larger-scale enterprise-wide apps on .NET (Winforms, WPF, ASP.NET). Some folks use the "repository pattern" which uses a repository that knows how to fetch, insert, update and delete objects. Those objects are rather "dumb" in that they don't necessarily contain a whole lot ...
I want to cache data on the client. What is the best algorithm/data structure that can be employed? Case 1. The data to be stored requires extremely fast string searching capability. Case 2. The cached data set can be large. I don't want to explode the client's memory usage and also I don't want to make a network and disk access calls w...
I'm looking for a data structure (or structures) that would allow me keep me an ordered list of integers, no duplicates, with indexes and values in the same range. I need four main operations to be efficient, in rough order of importance: taking the value from a given index finding the index of a given value inserting a value at a giv...
i need a datastructure in dotnet where i can search an item in constant time.it means that datastructure should implement indexing internally.is dictionary usefull for this purpose or some other one? ...
i want to know how buddy heap algo works or what datastructure is being used in it . ...
I'm wondering what Data Structure people would recommend to do the following. I have a Class which has three main properties eg. public class Example { public Object One { get; } public Object Two { get; } public Object Three { get; } } Another class contains a collection of these Objects and frequently needs to enumerate over...
I have written a PHP application which requires storage of millions of integers between 0 and 10,000,000 inclusive. Each number is incremented by one very frequently (on average 100 values are updated every second) and read very frequently (20,000 reads per second). The numbers are reset to 0 either nightly, weekly, monthly or annually. ...
This question is related with one of my earlier questions.. Previous Post In there the blocking nature is mentioned as an advantage. I tried to develop some simple code to demonstrate the blocking nature but I got stuck. I just tried to make a BlockingQueue of size 4 and tried to add 5 elements and ended up with a java.lang.IllegalSta...
In our code, we have a 16-byte packed struct that we call "ISOTIME": typedef struct isotime { struct { uint16_t iso_zone : 12; // corresponding time zone uint16_t iso_type : 4; // type of iso date } iso_fmt; int16_t iso_year; // year uint8_t iso_month; // month uint8_t iso_day; // day uint8_t iso...
Hi, My application is storing contact information. User can edit them through DataGridView and so on. I'm saving those contact info through serializable class which looks like that: [Serializable] public class Contact : INotifyPropertyChanged { private string _fName; private string _lName; private string _pNumber; ...
Hello everyone! I've been contemplating writing a simple "event log" that takes a paramater list and stores event messages in a log file, trouble is, I forsee this file growing to be rather large (assume 1M entries or more) the question is, how can I implement this system without pulling teeth, I know that SQL would be a possible way t...
I'm developing a game which features a sizeable square 2d playing area. The gaming area is tileless with bounded sides (no wrapping around). I am trying to figure out how I can best divide up this world to increase the performance of collision detection. Rather than checking each entity for collision with all other entities I want to onl...
Hi, I am trying to get the worst run-time complexity order on a couple of algorithms created. However I have run into a problem that I keep tending to select the wrong or wrong amount of fundamental operations for an algorithm. To me it appears to be that the selection of the fundamental operation is more of an art than a science. Afte...
I need a data structure which will support the following operations in a performant manner: Adding an item to the end of the list Iterating through the list in the order the items were added to it (random access is not important) Removing an item from the list What type of data structure should I use? (I will post what I am currentl...
/** The following function checks the red black tree black height * @param n the root node is inputed then a traversal is done to calculate the black-height * @return Return an error message / mesages informing the user whether or not the black height was maintained * @author Ferron Smith */ public static void getCount (SkaRedBlackTreeN...
I have Tiles which represent the tiles in a game's 2-dimensional world. The tiles can have walls on any number of their 4 sides. I have something like this at the moment: interface Tile { boolean isWallAtTop(); boolean isWallAtRight(); boolean isWallAtLeft(); boolean isWallAtBottom(); } Somewhere else I also have 16 ...
I need to transfer packets through the internet whose length should be dynamic. struct packet { int id; int filename_len; char filename[]; }; The problem is that zero-length arrays are not ISO-compliant. Should I use char filename[1]; instead? But then sizeof(struct packet) will not return the correct value anymore. ...
I'm writing some code (just for fun so far) in Python that will store some data on every point in a 3d space. I'm basically after a 3d matrix object that stores arbitary objects that will allow me to do some advanced selections, like: Get the point where x=1,y=2,z=3. Getting all points where y=2. Getting all points within 3 units of po...