I'm currently using the following code to achieve this, but is seems there should be something better... suggestions? It just seems to me there should be a way to skip the foreach... Dictionary<string,string> getValidIds(Dictionary<string,string> SalesPersons,List<string> ids) { Dictionary<string,string> o = new Dictionary<string,...
I'm busy creating a very simplistic ruby on rails app that won't need a lot things that are loaded in the ruby on rails environment by default. I won't be using mysql, just one model that fetches data from a Yaml file. So I'm thinking I won't be needing ActiveRecord, or at least a large part of it. ( Correct me if I'm wrong here ); How...
When performing many disk operations, does multithreading help, hinder, or make no difference? For example, when copying many files from one folder to another. Clarification: I understand that when other operations are performed, concurrency will obviously make a difference. If the task was to open an image file, convert to another for...
I need to log all post and get requests on web site in the database. There will be two tables: requests with time stamp, user id and requested URI request parameters with name, value and request id I will use it only for analytical reports once per month. No regular usage of this data. I have about one million requests a day and th...
My drive has DMG-blocks. The sum of their sizes is strictly below 47GB. I have 11 DVDs, each of the size 4.7GB. I want to use as small amount of DVDs as possible, without using compressing (the problem may be superflous, since it considers the most optimal combinations in terms of DMG-files. You can think it in terms of compressed files,...
Hi, I have been working on a project and trying to find the source of a large slowdown in execution time and have narrowed it down to a single method which I have managed to optimise out of the logic. The problem is that my solution involves using a reference which makes another section of the code run quite slowly... The question I'd li...
I have a MySQL 5.1 InnoDB table (customers) with the following structure: int record_id (PRIMARY KEY) int user_id (ALLOW NULL) varchar[11] postcode (ALLOW NULL) varchar[30] region (ALLOW NULL) .. .. .. There are roughly 7 million rows in the table. Currently, the table is being queried like this: SELECT * FROM custom...
The things I'm trying to get my website to do are getting fairly complex, some of the things that need to be done take long enough that it gives visible delays. Mainly, adding content to the document slows things down as well as jquery animations that I'm using. I create elements using document.createElement("div") rather than just doi...
I have been developing on the iPhone with Objective-C for a few months now and I have been applying the best-practices learnt and refined while developing applications with Java. These include: designing classes that have a single responsibility, application of design patterns where appropriate, and writing short methods that do one thin...
I'm doing a bit of coding, where I have to write this sort of code: if( array[i]==false ) array[i]=true; I wonder if it should be re-written as array[i]=true; This raises the question: are comparisions faster than assignments? What about differences from language to language? (contrast between java & cpp, eg.) NOTE: I've hear...
Hi folks, I'm trying to get better performance out of this Oracle query (which is terribly slow). I'm an Oracle beginner so maybe someone can point out a better way to approach this query. I have a table with information on different families. I want to extract the different relationships based on a relationship type. The solution I cam...
Variable x is int with possible values: -1, 0, 1, 2, 3. Which expression will be faster (in CPU ticks): 1. (x < 0) 2. (x == -1) Language: C/C++, but I suppose all other languages will have the same. P.S. I personally think that answer is (x < 0). More widely for gurus: what if x from -1 to 2^30? ...
I've always wondered, if it's good or bad practice to define trivial method twice, depending if the project's on debug / release -state. This is for inlining them. For instance, Foo.h: class Foo { public: ... const bool private: bool _boolean; }; #ifndef _DEBUG /** We'...
I have a situation where it looks like the easiest solution would be to convert from using relative to absolute paths for included files such as CSS & Javascript. There are around 10 included files in total per page - pretty much the same 10 on most pages. I'm wondering if there would be any significant overhead (or indeed downside, oth...
Is sqrt still slow in Delphi 2009? Are the old tricks (lookup table, approx functions) still useful? ...
Greetings! I feel like this problem is related to the bin packing problem, as well as potentially to the set partitioning problem... I just want to bounce this off of someone before I head down the path too deeply. I have input data (in a datafile) as follows: entry_one 55 entry_two 56 entry_three 61 entry_four 62 entry_five 62 entry_...
I was looking at an answer to an SO question today where the variable names are ua, rv, etc. And I thought, "Man, when will people learn to use full-size variable names, memory is not a problem any more" but then, it is Javascript so it has to come across the wire and perhaps long variable names even slow down interpretation. Is using ...
I'm working on a large delphi 6 project with quite a lot of dependancies. It takes several minutes to compile the whole project. The recompilation after a few changes is sometimes much more longer so that it is quicker to terminate Delphi, erase all dcu files and recompile everything. Does anyone know a way to identify, what makes the c...
Given: (Code reduced to a sensible minimum) // MemberTypes template < typename SPEEDTYPE = float, typename SIZETYPE = float, typename ACCELERATIONTYPE = float > struct ParticleMemberTypes { typedef typename SPEEDTYPE SpeedType; typedef typename SIZETYPE SizeType; typedef typename ACCELERATIONTYPE AccelerationType; }; // ...
Wikipedia: Directed Acyclic Graph Not sure if leaf node is still proper terminology since it's not really a tree (each node can have multiple children and also multiple parents) and also I'm actually trying to find all the root nodes (which is really just a matter of semantics, if you reverse the direction of all the edges it'd they'd b...