unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What is the best way to store app specific configuration in rails?
===
I need to store app specific configuration in rails. But it has to be:
- reachable in any file (model, view, helpers and controllers
- environment specified (or not), that means each environment can overwrite the configs specified in environment.rb
I've tried to use environment.rb and put something like
USE_USER_APP = true
that worked to me but when trying to overwrite it in a specific environment it wont work because production.rb, for instance, seems to be inside the Rails:Initializer.run block.
So, anyone?
| 0 | [
2,
98,
25,
14,
246,
161,
20,
1718,
4865,
1903,
8091,
19,
2240,
18,
60,
800,
3726,
3726,
31,
376,
20,
1718,
4865,
1903,
8091,
19,
2240,
18,
9,
47,
32,
63,
20,
44,
45,
13,
8,
1470,
579,
19,
186,
3893,
13,
5,
13998,
15,
1418,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LinearGradientBrush Artifact Workaround?
===
The LinearGradientBrush in .net (or even in GDI+ as a whole?) seems to have a severe bug: Sometimes, it introduces artifacts. (See [here][1] or [here][2] - essentially, the first line of a linear gradient is drawn in the endcolor, i.e. a gradient from White to Black will start with a Black line and then with the proper White to Black gradient)
I wonder if anyone found a working workaround for this? This is a really annoying bug :-(
[1]: http://www.tech-archive.net/Archive/DotNet/microsoft.public.dotnet.languages.csharp/2007-01/msg01592.html
[2]: http://www.experts-exchange.com/Microsoft/Development/.NET/Visual_CSharp/Q_23329115.html | 0 | [
2,
6745,
7691,
49,
2291,
20632,
22929,
170,
10037,
60,
800,
3726,
3726,
14,
6745,
7691,
49,
2291,
20632,
19,
13,
9,
2328,
13,
5,
248,
166,
19,
489,
1115,
2430,
28,
21,
979,
60,
6,
2206,
20,
57,
21,
4538,
6256,
45,
1030,
15,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which of these loops is better code (in terms of performance, garbage collection)? And Why?
===
String s = "";
for(i=0;i<....){
s = some Assignment;
}
or
for(i=0,i<..){
String s = some Assignment;
}
I don't need to use 's' outside the loop ever again.
The first option is perhaps better since a new String is not initialized each time. The second however would result in the scope of the variable being limited to the loop itself.
| 0 | [
2,
56,
16,
158,
19661,
25,
574,
1797,
13,
5,
108,
1663,
16,
956,
15,
15024,
1206,
6,
60,
17,
483,
60,
800,
3726,
3726,
3724,
13,
18,
800,
13,
7,
7,
73,
26,
5,
49,
3726,
387,
73,
49,
1,
9,
9,
9,
9,
6,
1,
13,
18,
800,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there set division in SQL?
===
I'm fully aware that set division can be accomplished through a series of other operations, so my question is:
Is there a command for set division in SQL? | 0 | [
2,
25,
80,
309,
460,
19,
4444,
255,
60,
800,
3726,
3726,
31,
22,
79,
2337,
3854,
30,
309,
460,
92,
44,
8812,
120,
21,
231,
16,
89,
1311,
15,
86,
51,
1301,
25,
45,
25,
80,
21,
1202,
26,
309,
460,
19,
4444,
255,
60,
3,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Logic and it's application to Collections.Generic and inheritance
===
Everything inherits from object. It's the basis of inheritance. Everything can be implicitly cast up the inheritance tree, ie.
object me = new Person();
Therefore, following this through to it's logical conclusion, a group of People would also be a group of objects:
List<Person> people = new List<Person>();
people.Add(me);
people.Add(you);
List<object> things = people; // Ooops.
Except, that won't work, the people who designed .NET either overlooked this, or there's a reason, and I'm not sure which. Atleast once I have run into a situation where this would have been useful, but I had to end up using a nasty hack (subclassing List<T> just to implement a cast operator).
The question is this: is there a reason for this behaviour? Is there a simpler solution to get the desired behaviour?
For the record, I believe the situation that I wanted this sort of behaviour was a generic printing function that displayed lists of objects by calling ToString() and formatting the strings nicely. | 0 | [
2,
7085,
17,
32,
22,
18,
3010,
20,
5721,
9,
17083,
596,
17,
13852,
800,
3726,
3726,
796,
17569,
18,
37,
3095,
9,
32,
22,
18,
14,
2239,
16,
13852,
9,
796,
92,
44,
20290,
102,
1325,
71,
14,
13852,
1541,
15,
13,
660,
9,
3095,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you allow the usage of an <img> while preventing XSS?
===
I'm using ASP.NET Web Forms. | 0 | [
2,
184,
107,
42,
1655,
14,
7514,
16,
40,
13,
1,
1660,
263,
1,
133,
11520,
993,
18,
18,
60,
800,
3726,
3726,
31,
22,
79,
568,
28,
306,
9,
2328,
2741,
1997,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Tips for getting started with SQL?
===
I've never had much need for programming with databases. Since their use is so widespread it seems like a good thing for me to learn. SQL seems like the place to start, possibly [SQLite][1] and maybe the [Python bindings][2]. What would you recommend for someone new to this? Libraries, tools and project ideas are all welcome.
[1]: http://www.sqlite.org/
[2]: http://pysqlite.org/ | 0 | [
2,
11034,
26,
1017,
373,
29,
4444,
255,
60,
800,
3726,
3726,
31,
22,
195,
243,
41,
212,
376,
26,
3143,
29,
6018,
18,
9,
179,
66,
275,
25,
86,
6025,
32,
2206,
101,
21,
254,
584,
26,
55,
20,
2484,
9,
4444,
255,
2206,
101,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to retrieve all keys (or values) from a std::map?
===
This is one of the possible ways I come out:
struct RetrieveKey
{
template <typename T>
typename T::first_type operator()(T keyValuePair) const
{
return keyValuePair.first;
}
};
map<int, int> m;
vector<int> keys;
// Retrieve all keys
transform(m.begin(), m.end(), back_inserter(keys), RetrieveKey());
// Dump all keys
copy(keys.begin(), keys.end(), ostream_iterator<int>(cout, "\n"));
Of course, we can also retrieve all values from the map by defining another functor **RetrieveValues**.
Is there any other way to achieve this easily? (I'm always wondering why std::map does not include a member function for us to do so.) | 0 | [
2,
184,
20,
11917,
65,
5534,
13,
5,
248,
4070,
6,
37,
21,
354,
43,
45,
45,
15022,
60,
800,
3726,
3726,
48,
25,
53,
16,
14,
938,
2847,
31,
340,
70,
45,
13,
10346,
11917,
4237,
13,
1,
22894,
13,
1,
4474,
7259,
13,
38,
1,
100... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I save a model with this dynamically generated field?
===
I have a rails model that looks something like this:
class Recipe < ActiveRecord::Base
has_many :ingredients
attr_accessor :ingredients_string
attr_accessible :title, :directions, :ingredients, :ingredients_string
before_save :set_ingredients
def ingredients_string
ingredients.join("\n")
end
private
def set_ingredients
self.ingredients.each { |x| x.destroy }
self.ingredients_string ||= false
if self.ingredients_string
self.ingredients_string.split("\n").each do |x|
ingredient = Ingredient.create(:ingredient_string => x)
self.ingredients << ingredient
end
end
end
end
The idea is that when I create the ingredient from the webpage, I pass in the ingredients_string and let the model sort it all out. Of course, if I am editing an ingredient I need to re-create that string. The bug is basically this: how do I inform the view of the ingredient_string (elegantly) and still check to see if the ingredient_string is defined in the set_ingredients method? | 0 | [
2,
184,
107,
31,
2079,
21,
1061,
29,
48,
7782,
1326,
6756,
575,
60,
800,
3726,
3726,
31,
57,
21,
2240,
18,
1061,
30,
1879,
301,
101,
48,
45,
718,
20510,
13,
1,
1348,
14953,
45,
45,
8436,
63,
1,
14842,
13,
45,
68,
99,
3840,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to access the current Subversion build number?
===
How can you automatically import the latest build/revision number in subversion?
The goal would be to have that number visible on your webpage footer like SO does. | 0 | [
2,
184,
20,
1381,
14,
866,
972,
10898,
1895,
234,
60,
800,
3726,
3726,
184,
92,
42,
7499,
9010,
14,
5736,
1895,
118,
99,
10732,
234,
19,
972,
10898,
60,
14,
1195,
83,
44,
20,
57,
30,
234,
4560,
27,
154,
2741,
6486,
1749,
106,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Feedback on using Google App Engine?
===
Looking to do a very small, quick 'n dirty side project. I like the fact that the Google App Engine is running on Python with Django built right in - gives me an excuse to try that platform... but my question is this:
Has anyone made use of the app engine for anything other than a toy problem? I see some good example apps out there, so I would assume this is good enough for the real deal, but wanted to get some feedback.
Any other success/failure notes would be great. | 4 | [
2,
13111,
27,
568,
8144,
4865,
1406,
60,
800,
3726,
3726,
699,
20,
107,
21,
253,
284,
15,
2231,
13,
22,
103,
6121,
270,
669,
9,
31,
101,
14,
837,
30,
14,
8144,
4865,
1406,
25,
946,
27,
20059,
29,
3857,
14541,
392,
193,
19,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Want to download a Git repository, what do I need (windows machine)?
===
I want to download this open source application, and they are using Git. What do I need to download the code base? | 0 | [
2,
259,
20,
7121,
21,
13,
10404,
24869,
15,
98,
107,
31,
376,
13,
5,
27508,
18,
1940,
6,
60,
800,
3726,
3726,
31,
259,
20,
7121,
48,
368,
1267,
3010,
15,
17,
59,
50,
568,
13,
10404,
9,
98,
107,
31,
376,
20,
7121,
14,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to nullable types work in C#?
===
What is the behind-the-scenes difference between 'int?' and 'int'? Is 'int?' a somehow a reference type? | 0 | [
2,
184,
20,
16203,
579,
2551,
170,
19,
272,
5910,
60,
800,
3726,
3726,
98,
25,
14,
439,
8,
124,
8,
25831,
2841,
128,
13,
22,
6391,
5663,
17,
13,
22,
6391,
22,
60,
25,
13,
22,
6391,
5663,
21,
3625,
21,
2801,
1001,
60,
3,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
CakePHP multi-model view
===
I am creating a website in CakePHP and I am kind of new on it. I couldn't find good resources on this matter, so there you go:
I have a three table structure for registering users: `Users`, `Addresses` and `Contacts`. I have to build a view with info of all three tables like:
<pre>
Full Name: [ ] (from Users)
Shipping Address: [ ] (from Address)
Mobile Phone: [ ] (from Contact)
e-Mail Address: [ ] (from Contact)
</pre>
What is the best way to deal with this situation. Creating a new Model to represent this (Maybe a sql view in the database) Create a Controller to deal with this View.
I wonder still how I will handle both contacts as they will be 2 different `INSERT`'s
Any hint or resources I can dig of I will be glad. | 0 | [
2,
8390,
26120,
1889,
8,
13998,
1418,
800,
3726,
3726,
31,
589,
2936,
21,
2271,
19,
8390,
26120,
17,
31,
589,
825,
16,
78,
27,
32,
9,
31,
711,
22,
38,
477,
254,
2566,
27,
48,
1161,
15,
86,
80,
42,
162,
45,
31,
57,
21,
132,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Building and deploying dll on windows: SxS, manifests and all that jazz
===
Since VS 2005, I see that it is not possible to simply build a dll against MS runtime and deploy them together (http://www.ddj.com/windows/184406482). I am deeply confused by manifest, SxS and co: MSDN documentation is really poor, with circular references; specially since I am more a Unix guy, I find all those uninformative. My core problem is linking a dll against msvc9 or msvc8: since those runtime are not redistributable, what are the steps to link and deploy such a dll ? In particular, how are the manifest generated (I don't want mt.exe, I want something which is portable across compilers), how are they embedded, used ? What does Side by side assembly mean ?
Basically, where can I find any kind of specification instead of MS jargon ? | 0 | [
2,
353,
17,
17617,
68,
13,
43,
211,
27,
1936,
45,
13,
18,
396,
18,
15,
13160,
18,
17,
65,
30,
2444,
800,
3726,
3726,
179,
4611,
812,
15,
31,
196,
30,
32,
25,
52,
938,
20,
1659,
1895,
21,
13,
43,
211,
149,
4235,
485,
891,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python memory profiler
===
I want to know the memory usage of my python application and specifically want to know what code blocks/portions or objects are consuming most memory
Google search shows a commercial one is
http://www.softwareverify.com/python/memory/index.html
and open source are PySizer and Heapy
I haven't tried anyone, so i wanted to know which one is the best considering
1) gives most details
2) I have to do least or no changes to my code | 0 | [
2,
20059,
1912,
5296,
139,
800,
3726,
3726,
31,
259,
20,
143,
14,
1912,
7514,
16,
51,
20059,
3010,
17,
3524,
259,
20,
143,
98,
1797,
5198,
118,
1993,
5757,
54,
3916,
50,
13,
17601,
127,
1912,
8144,
2122,
1285,
21,
1439,
53,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how do i add project references to swcs in FlashDevelop
===
I am trying to add a project reference or swc to papervision in FlashDevelop but intellisense isn't picking it up. I've done it before but i forgot how.
Thanks. | 0 | [
2,
184,
107,
31,
3547,
669,
7231,
20,
13,
18,
12354,
18,
19,
4433,
26051,
800,
3726,
3726,
31,
589,
749,
20,
3547,
21,
669,
2801,
54,
13,
18,
12354,
20,
1397,
10732,
19,
4433,
26051,
47,
14635,
3159,
6498,
2532,
22,
38,
7833,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0... |
Is using Dexter's character sprite okay, or do I have to...
===
I am making a 2d game based in dexter's lab theme. I've got the sprite of dexter from GSA. basically I'm not an artist, so I have to depend on already available sprites, backgrounds, sfx on websites like GameSpriteArchive etc.
But is it okay/legal to use the dexter sprite I have got ?
I wish to release it publicly too, so shall I have to make lot of changes to do that?
Is it possible to get a permission to use the sprite?? My hopes are very less in getting permission.
![alt text][1]
[1]: http://i35.tinypic.com/9pn75s.jpg | 0 | [
2,
25,
568,
14749,
22,
18,
925,
27902,
1705,
15,
54,
107,
31,
57,
20,
9,
9,
9,
800,
3726,
3726,
31,
589,
544,
21,
172,
43,
250,
432,
19,
14749,
22,
18,
4343,
3184,
9,
31,
22,
195,
330,
14,
27902,
16,
14749,
37,
489,
1229,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VMware ESX vs. VMware Workstation
===
I'm using VMware Workstation 6.0 for simulation of tight clusters of "blades" in a "chassis". Both the host and target OSs are Linux. Each "chassis" uses a vmnet switch as a virtual backplane, to which the virtual blades connect. Other vmnet switches are used to mediate point-to-point connections between mutiple virtual ethernet adapters on each blade VM. The chassis, and thus the VMs, are brought up and shutdown rather frequently. My scripts (python) make heavy use of the VIX api, and also manipulate the .vmx config file.<br><br>
What do I gain and/or lose going from VMware Workstation to ESX? Do my scripts that use the VIX api still work? Do my rather complicated virtual network topologies, with lots of vmnet switches defined as "custom", still work the same way? Is the syntax and semantics of the .vmx config file the same between Workstation and ESX?<br><br>Thanks in advance for your help. | 0 | [
2,
13,
20147,
5011,
13,
160,
396,
4611,
9,
13,
20147,
5011,
170,
10839,
800,
3726,
3726,
31,
22,
79,
568,
13,
20147,
5011,
170,
10839,
400,
9,
387,
26,
10926,
16,
2618,
14497,
16,
13,
7,
15973,
18,
7,
19,
21,
13,
7,
1651,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you find media resources for game-dev?
===
I've been wondering, as a lone game developer,
or to say a part of team which has only got programmers and people who like to play games...
How do I manage the void created by lack of artists (sprites/tiles/animations) in such a situation???
What do you do in that case? and suppose I am a student, with no money to hire artists, is there a place where I can get these resources legally & free ? | 0 | [
2,
184,
107,
42,
477,
941,
2566,
26,
250,
8,
14438,
60,
800,
3726,
3726,
31,
22,
195,
74,
5712,
15,
28,
21,
10295,
250,
10058,
15,
54,
20,
395,
21,
141,
16,
173,
56,
63,
104,
330,
17968,
18,
17,
148,
72,
101,
20,
418,
466,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How is style inherited
===
If I want a style to have all of the properties of the style defined in ".a .b .c" except for background-color (or some other property), how is this done? This does not seem to work.
".a .b .c
{
background-color: #0000FF;
color: #ffffff;
border: 1px solid #c0c0c0;
margin-top: 4px;
padding: 3px;
text-align: center;
font-weight: bold;
}
.a .b .c .d
{
background-color: green;
}" | 0 | [
2,
184,
25,
1034,
7179,
800,
3726,
3726,
100,
31,
259,
21,
1034,
20,
57,
65,
16,
14,
3704,
16,
14,
1034,
2811,
19,
13,
7,
9,
58,
13,
9,
220,
13,
9,
150,
7,
1613,
26,
2395,
8,
11282,
13,
5,
248,
109,
89,
1354,
6,
15,
184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Internet Explorer ol numbers appear at bottom of li instead of top as expected
===
I'm working on a page has an ol with nested p's, div's, and li's. Markup looks something like this:
<ol>
<li>
Some text here
<div> <img/> <p>more text</p> </div>
<div> <ul> <li>a few more list items</li> </ul> </div>
<p>Some final text</p>
</li>
</ol>
Internet Explorer 6 and 7 both render the numbers for the ol tag after the p element at the end (at the very, very bottom of the li tag) rather than at the top of the outermost li as expected. I'm working on a PowerPC Mac and can't do any testing. Is there some simple CSS hack to make this render the same as it does in Firefox? | 0 | [
2,
2620,
8520,
6304,
2116,
1893,
35,
2129,
16,
2093,
700,
16,
371,
28,
1727,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
2478,
63,
40,
6304,
29,
5618,
69,
351,
22,
18,
15,
13,
12916,
22,
18,
15,
17,
2093,
22,
18,
9,
943,
576,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make sure my git repo code is safe?
===
If our organisation were to switch from a central-server VCS like subversion to a distributed VCS like git, how do I make sure that all my code is safe from hardware failure?
With a central-server VCS I just need to backup the repository every day. If we were using a DVCS then there'd be loads of code branches on all the developer machines, and if that hardware were to fail (or a dev were to lose his laptop or have it stolen) then we wouldn't have any backups.
Note that I don't consider it a good option to "make the developers push branches to a server" -- that's [tedious][1] and the developers will end up not doing it.
Is there a common way around this problem?
[1]: http://www.mattblodgett.com/2008/02/matt-blodgett-first-law-of-software.html | 0 | [
2,
184,
20,
233,
562,
51,
13,
10404,
302,
1638,
1797,
25,
1834,
60,
800,
3726,
3726,
100,
318,
4080,
46,
20,
5521,
37,
21,
521,
8,
10321,
106,
13,
8990,
18,
101,
972,
10898,
20,
21,
4387,
13,
8990,
18,
101,
13,
10404,
15,
184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LINQ to entities - Building where clauses to test within a many to many relationship.
===
So, I am using the Linq entity framework. I have to entities "Content" and "Tag" They are in a many-to-many relationship with one another. Content can have many tags and Tags can have many Contents. So I am trying to write a query to select all contents where any tags names are equal to "blah."
The entities both have a collection of the other entity as a property(but no IDs). This is where I am struggling. I do have a custom expression for "Contains" (so, whoever may help me, you can assume that I can do a "contains" for a collection). I got this expression from: [http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=2670710&SiteID=1][1]
Anyway, I have done linq for about 8 hours now, so I am a beginner, and I am really getting stuck on this. I came up with this, but it just returns all of my Content entities:
contentQuery.Where(
content => content.Tags.AsQueryable().Any(
Entities.Contains<Tag, string>(
innerTag => innerTag.Name,
tags.Select(testTag => testTag.Name)
)
)
);
[1]: http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=2670710&SiteID=1 | 0 | [
2,
6294,
1251,
20,
12549,
13,
8,
353,
113,
9040,
18,
20,
1289,
363,
21,
151,
20,
151,
1429,
9,
800,
3726,
3726,
86,
15,
31,
589,
568,
14,
6294,
1251,
9252,
6596,
9,
31,
57,
20,
12549,
13,
7,
25424,
7,
17,
13,
7,
8628,
7,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get millions of records from fixed-width flat file to SQL 2000
===
Obviously I can use BCP but here is the issue. If one of the records in a Batch have an invalid date I want to redirect that to a separate table/file/whatever, but keep the batch processing running. I don't think SSIS can be installed on the server which would have helped. | 0 | [
2,
164,
11999,
16,
742,
37,
3535,
8,
3976,
43,
96,
1844,
3893,
20,
4444,
255,
824,
800,
3726,
3726,
4409,
31,
92,
275,
2726,
306,
47,
235,
25,
14,
1513,
9,
100,
53,
16,
14,
742,
19,
21,
13064,
57,
40,
16671,
1231,
31,
259,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How much business logic should Value objects contain?
===
One mentor I respect suggests that a simple bean is a waste of time - that value objects 'MUST' contain some business logic to be useful.
Another says such code is difficult to maintain and that all business logic must be externalized.
I realize this question is subjective. Asking anyway - want to know answers from more perspectives. | 0 | [
2,
184,
212,
508,
7085,
378,
1923,
3916,
3717,
60,
800,
3726,
3726,
53,
7656,
31,
2873,
5049,
30,
21,
1935,
15322,
25,
21,
4600,
16,
85,
13,
8,
30,
1923,
3916,
13,
22,
3605,
38,
22,
3717,
109,
508,
7085,
20,
44,
4811,
9,
226,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
filtering NSArray into a new NSArray in objective-c
===
I have an NSArray and I'd like to create a new NSArray with objects from the original array that meet certain criteria. The criteria is decided by a function that returns a BOOL.
I can create an NSMutableArray, iterate through the source array and copy over the objects that the filter function accepts and then create an immutable version of it.
Is there a better way?
| 0 | [
2,
25272,
13,
103,
4964,
2787,
77,
21,
78,
13,
103,
4964,
2787,
19,
7038,
8,
150,
800,
3726,
3726,
31,
57,
40,
13,
103,
4964,
2787,
17,
31,
22,
43,
101,
20,
1600,
21,
78,
13,
103,
4964,
2787,
29,
3916,
37,
14,
501,
7718,
30,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Closing a minimized/iconized process from C#
===
Here's my issue: I need to close a process, already running, from a C# program.
The problem is that the process now runs as an icon (minimized to taskbar), and unless the user opens it at least once (which will never happen on unattended machines), it'll never
have a main window.
The other requirement that I have is that the application be **closed** not **killed**. I need it to write it's memory buffers to disk - and killing it causes data loss.
Here's what I tried so far:
foreach (Process proc in Process.GetProcesses())
{
if (proc.ProcessName.ToLower().StartsWith("myapp"))
{
if (proc.MainWindowHandle.ToInt32() != 0)
{
proc.CloseMainWindow();
proc.Close();
//proc.Kill(); <--- not good!
}
}
}
I've added the **if** clause, after discovering that **MainWindowHandle == 0** when the window was minimized. Removig the **if** doesn't help. Neither the **CloseMainWindow()** nor the **Close()** work. The **Kill()** does, but as mentioned above - it's not what I need.
Any idea would be accepted, including the use of arcane Win32 API functions :) | 0 | [
2,
4239,
21,
16713,
43,
118,
49,
1126,
1333,
953,
37,
272,
5910,
800,
3726,
3726,
235,
22,
18,
51,
1513,
45,
31,
376,
20,
543,
21,
953,
15,
614,
946,
15,
37,
21,
272,
5910,
625,
9,
14,
1448,
25,
30,
14,
953,
130,
1461,
28,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
TCP handshake with SOCK_RAW socket
===
Ok, I realize this situation is somewhat unusual, but I need to establish a TCP connection (the 3-way handshake) using only raw sockets (in C, in linux) -- i.e. I need to construct the IP headers and TCP headers myself. I'm writing a server (so I have to first respond to the incoming SYN packet), and for whatever reason I can't seem to get it right. Yes, I realize that a SOCK_STREAM will handle this for me, but for reasons I don't want to go into that isn't an option.
The tutorials I've found online on using raw sockets all describe how to build a SYN flooder, but this is somewhat easier than actually establishing a TCP connection, since you don't have to construct a response based on the original packet. I've gotten the SYN flooder examples working, and I can read the incoming SYN packet just fine from the raw socket, but I'm still having trouble creating a valid SYN/ACK response to an incoming SYN from the client.
So, does anyone know a good tutorial on using raw sockets that goes beyond creating a SYN flooder, or does anyone have some code that could do this (using SOCK_RAW, and not SOCK_STREAM)? I would be very grateful. | 0 | [
2,
13,
38,
7439,
224,
17248,
29,
86,
2601,
1,
12404,
18482,
800,
3726,
3726,
5854,
15,
31,
4007,
48,
1858,
25,
4131,
4706,
15,
47,
31,
376,
20,
4088,
21,
13,
38,
7439,
2760,
13,
5,
124,
203,
8,
1443,
224,
17248,
6,
568,
104,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm to calculate the number of divisors of a given number
===
What would be the most optimal algorithm (performance-wise) to calculate the number of divisors of a given number?
It'll be great if you could provide pseudocode or a link to some example. | 0 | [
2,
9083,
20,
18469,
14,
234,
16,
13,
11390,
18,
248,
18,
16,
21,
504,
234,
800,
3726,
3726,
98,
83,
44,
14,
127,
17586,
9083,
13,
5,
22528,
8,
10474,
6,
20,
18469,
14,
234,
16,
13,
11390,
18,
248,
18,
16,
21,
504,
234,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Polygot Programming is Coming? How?
===
I'd love to have the freedom to use various languages for the problems they work best for but I'm not sure how this can be accomplished today.
I have had a fair amount of success using web services as the language abstraction layer and that works great... but it's slower than molasses even using localhost.
Steve Yegge has talked about this very issue and how it is helping to drive further interest of VM's. On the .NET side, the last I heard there wasn't a not ugly way of communicating between the DLR and CLR. Has that changed? How are things on the JVM front? What about allowing VM's to interoperate?
BTW, I don't have any real reason to care except that I'm a nerd with nothing better to think about. :) | 0 | [
2,
3446,
7597,
3143,
25,
880,
60,
184,
60,
800,
3726,
3726,
31,
22,
43,
339,
20,
57,
14,
2326,
20,
275,
617,
2556,
26,
14,
1716,
59,
170,
246,
26,
47,
31,
22,
79,
52,
562,
184,
48,
92,
44,
8812,
786,
9,
31,
57,
41,
21,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can css be used to set style when using javascript?
===
I want to do this:
e.className = t;
Where t is the name of a style I have defined in a stylesheet. | 0 | [
2,
92,
272,
18,
18,
44,
147,
20,
309,
1034,
76,
568,
8247,
8741,
60,
800,
3726,
3726,
31,
259,
20,
107,
48,
45,
13,
62,
9,
1898,
7259,
800,
13,
38,
73,
113,
13,
38,
25,
14,
204,
16,
21,
1034,
31,
57,
2811,
19,
21,
1034,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What javascript tutorials on the web would you recommend?
===
Already know of one very good site. David Crockford's videos over at [Yahoo UI Theater][1]. Please suggest any others you are aware of.
[1]: http://developer.yahoo.com/yui/theater/ | 0 | [
2,
98,
8247,
8741,
29724,
18,
27,
14,
2741,
83,
42,
12360,
60,
800,
3726,
3726,
614,
143,
16,
53,
253,
254,
689,
9,
684,
272,
4651,
1426,
22,
18,
6610,
84,
35,
636,
1046,
8884,
13,
5661,
2547,
500,
2558,
165,
500,
9,
2247,
560... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Change the width of form elements created with ModelForm in Django
===
How can i change the width of a textarea form element if i used ModelForm to create it?
Here is my product class:
class ProductForm(ModelForm):
long_desc = forms.CharField(widget=forms.Textarea)
short_desc = forms.CharField(widget=forms.Textarea)
class Meta:
model = Product
And the template code...
{% for f in form %}
{{ f.name }}:{{ f }}
{% endfor %}
`f` is the actual form element... | 0 | [
2,
753,
14,
9456,
16,
505,
2065,
679,
29,
1061,
4190,
19,
3857,
14541,
800,
3726,
3726,
184,
92,
31,
753,
14,
9456,
16,
21,
1854,
17760,
505,
4520,
100,
31,
147,
1061,
4190,
20,
1600,
32,
60,
235,
25,
51,
2374,
718,
45,
718,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# - Good Books/Tutorials for the advanced .net developer?
===
I was just reading through the [Hidden Features of C#][1] thread, and there were a lot of really neat tricks that I had never even heard of. But there wasn't really a whole lot of depth to them all.
It got me to wondering what kind of books and tutorials are out there that teach more advanced topics (Delegates, Lambdas, Threading, etc) and advanced tricks.
What books and tutorials have you all read that have helped you learn some more advanced tricks and features?
[1]: http://stackoverflow.com/questions/9033/hidden-features-of-c | 4 | [
2,
272,
5910,
13,
8,
254,
964,
118,
2473,
9819,
192,
18,
26,
14,
2255,
13,
9,
2328,
10058,
60,
800,
3726,
3726,
31,
23,
114,
1876,
120,
14,
636,
1822,
43,
817,
967,
16,
272,
5910,
500,
2558,
165,
500,
9322,
15,
17,
80,
46,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting result for IAuthenticationFilter
===
I am looking to set the result action from a failed IAuthorizationFilter. However I am unsure how to create an ActionResult from inside the Filter. The controller doesn't seem to be accible from inside the filter so my usual View("SomeView") isn't working. Is there a way to get the controler or else another way of creating an actionresult as it doesn't appear to be instantiable?
Doesn't work:
[AttributeUsage(AttributeTargets.Method)]
public sealed class RequiresAuthenticationAttribute : ActionFilterAttribute, IAuthorizationFilter
{
public void OnAuthorization(AuthorizationContext context)
{
if (!context.HttpContext.User.Identity.IsAuthenticated)
{
context.Result = View("User/Login");
}
}
} | 0 | [
2,
2697,
829,
26,
31,
1346,
2504,
1786,
857,
11924,
815,
800,
3726,
3726,
31,
589,
699,
20,
309,
14,
829,
1028,
37,
21,
1702,
31,
10007,
1829,
11924,
815,
9,
207,
31,
589,
13815,
184,
20,
1600,
40,
1028,
29955,
37,
572,
14,
1194... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Limiting a group of checkboxes to a certain amount of checks
===
I have a group of checkboxes that I only want to allow a set amount to be checked at any one time. If the newly checked checkbox pushes the count over the limit, I'd like the oldest checkbox to be automatically unchecked. The group of checkboxes all use the same event handler shown below.
I have achieved the functionality with a Queue, but it's pretty messy when I have to remove an item from the middle of the queue and I think there's a more elegant way. I especially don't like converting the queue to a list just to call one method before I convert the list back to a queue.
- Is there a better way to do this?
- Is it a good idea to unhook are rehook the event handlers like I did.
Here's the code.
private Queue<CheckBox> favAttributesLimiter - new Queue<CheckBox>();
private const int MaxFavoredAttributes = 5;
private void favoredAttributes_CheckedChanged(object sender, EventArgs e)
{
CheckBox cb = (CheckBox)sender;
if (cb.Checked)
{
if (favAttributesLimiter.Count == MaxFavoredAttributes)
{
CheckBox oldest = favAttributesLimiter.Dequeue();
oldest.CheckedChanged -= favoredAttributes_CheckedChanged;
oldest.Checked = false;
oldest.CheckedChanged += new EventHandler(favoredAttributes_CheckedChanged);
}
favAttributesLimiter.Enqueue(cb);
}
else // cb.Checked == false
{
if (favAttributesLimiter.Contains(cb))
{
var list = favAttributesLimiter.ToList();
list.Remove(cb);
favAttributesLimiter=new Queue<CheckBox>(list);
}
}
}
| 0 | [
2,
17567,
21,
214,
16,
2631,
5309,
160,
20,
21,
1200,
2006,
16,
16602,
800,
3726,
3726,
31,
57,
21,
214,
16,
2631,
5309,
160,
30,
31,
104,
259,
20,
1655,
21,
309,
2006,
20,
44,
6505,
35,
186,
53,
85,
9,
100,
14,
2771,
6505,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's a good Common Lisp implementation for Windows?
===
What's your favourite? | 4 | [
2,
98,
22,
18,
21,
254,
757,
2093,
3401,
6123,
26,
1936,
60,
800,
3726,
3726,
98,
22,
18,
154,
7740,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
TinyXML: Save document to char * or string
===
I'm attempting to use TinyXML to read and save from memory, instead of only reading and saving files to disk.
It seems that the documnent parse function can load a char *, but I can't find any way to get a char * of what the document would write to a file on disk using the savefile function. Does anyone know about this? | 0 | [
2,
3228,
396,
8184,
45,
2079,
4492,
20,
4892,
1637,
54,
3724,
800,
3726,
3726,
31,
22,
79,
6314,
20,
275,
3228,
396,
8184,
20,
1302,
17,
2079,
37,
1912,
15,
700,
16,
104,
1876,
17,
7599,
6488,
20,
8582,
9,
32,
2206,
30,
14,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to serve files from IIS 6 on windows 2k3
===
I have files with extensions like ".dae" , ".gtc" , etc. When i try to hit these files over http, the server returns a 404, but they are in the directories. However i can serve readily known file extensions ; if i just rename them to say, xml, they are accessible.
Any suggestions for what the problem may be? | 0 | [
2,
184,
20,
1884,
6488,
37,
595,
18,
400,
27,
1936,
172,
197,
240,
800,
3726,
3726,
31,
57,
6488,
29,
17529,
101,
13,
7,
9,
14957,
7,
13,
15,
13,
7,
9,
263,
6668,
7,
13,
15,
2722,
9,
76,
31,
1131,
20,
770,
158,
6488,
84,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how do you organize unit tests?
===
Do you write one case per function/method, with multiple checks in the test case, or a test case for each check?
| 0 | [
2,
184,
107,
42,
9213,
1237,
4894,
60,
800,
3726,
3726,
107,
42,
2757,
53,
610,
416,
1990,
118,
5909,
1807,
43,
15,
29,
1886,
16602,
19,
14,
1289,
610,
15,
54,
21,
1289,
610,
26,
206,
2631,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Advice on mixing legacy ASP site with .NET 2.0
===
We've just been tasked with updating an e-commerce application to use PayPal's PayFlow product. The site was originally written in classic ASP except for the credit card processing portion which was a COM component.
Our plan is to replace the COM component with a .NET 2.0 component. I'm looking for tips, gotcha, etc. before we embark. | 0 | [
2,
4978,
27,
5826,
7780,
28,
306,
689,
29,
13,
9,
2328,
172,
9,
387,
800,
3726,
3726,
95,
22,
195,
114,
74,
14605,
29,
71,
43,
1880,
40,
13,
62,
8,
26470,
3010,
20,
275,
1372,
6720,
22,
18,
1372,
9990,
2374,
9,
14,
689,
23,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any Common Lisp implementations for .Net?
===
Related to [my other CL question][1].
[1]: http://stackoverflow.com/questions/110390/whats-a-good-common-lisp-implementation-for-windows | 0 | [
2,
50,
80,
186,
757,
2093,
3401,
6123,
18,
26,
13,
9,
2328,
60,
800,
3726,
3726,
1597,
20,
636,
915,
89,
10842,
1301,
500,
2558,
165,
500,
9,
636,
165,
500,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
11472,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you build a culture of collaboration in your team?
===
We've recently moved to using the wiki in our team. Earlier, we thought people couldn't contribute because it was difficult to. However, having a wiki (3 months now) hasn't helped as much as we'd hoped. Most folks still put it off as 'not my job'. How do I encourage my team to contribute to the wiki?
NOTE: One useful resource I found in this regard was [wikipatterns][1].
[1]: http://www.wikipatterns.com/display/wikipatterns/Wikipatterns | 0 | [
2,
184,
107,
42,
1895,
21,
1365,
16,
4004,
19,
154,
173,
60,
800,
3726,
3726,
95,
22,
195,
1989,
385,
20,
568,
14,
13,
17375,
19,
318,
173,
9,
1201,
15,
95,
289,
148,
711,
22,
38,
8606,
185,
32,
23,
1956,
20,
9,
207,
15,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to add WCF templates to Visual Studio Express?
===
I am working through the book Learning WCF by Michele Bustamante, and trying to do it using Visual Studio C# Express 2008. The instructions say to use WCF project and item templates, which are not included with VS C# Express. There *are* templates for these types included with Visual Studio Web Developer Express, and I've tried to copy them over into the right directories for VS C# Express to find, but the IDE doesn't find them. Is there some registration process? Or config file somewhere? | 0 | [
2,
184,
20,
3547,
11801,
410,
22894,
18,
20,
3458,
1120,
2999,
60,
800,
3726,
3726,
31,
589,
638,
120,
14,
360,
2477,
11801,
410,
34,
18012,
6943,
765,
4760,
15,
17,
749,
20,
107,
32,
568,
3458,
1120,
272,
5910,
2999,
570,
9,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What percentage of my time will be spent in user input verfication during web development?
===
I'm new to developing things on the web. So far, I'm spending a lot of time (50% or so) to try and prevent bad people from putting things like sql injection into my input forms and validating it server side. Is this normal? | 0 | [
2,
98,
5780,
16,
51,
85,
129,
44,
1111,
19,
4155,
6367,
2494,
15261,
857,
112,
2741,
522,
60,
800,
3726,
3726,
31,
22,
79,
78,
20,
3561,
564,
27,
14,
2741,
9,
86,
463,
15,
31,
22,
79,
4837,
21,
865,
16,
85,
13,
5,
21703,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anyone know of any (free / open source) VI integration for Visual Studio?
===
vi is for cool kids. | 0 | [
2,
1276,
143,
16,
186,
13,
5,
4639,
13,
118,
368,
1267,
6,
1790,
8078,
26,
3458,
1120,
60,
800,
3726,
3726,
1790,
25,
26,
2700,
2627,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the best way to collect/report unexpected errors in .NET Window Applications?
===
I am looking for a better solution than what we currently have to deal with **unexpected production errors**, without reinventing the wheel.
A larger number of our products are WinForm and WPF applications that are installed at remote sites. Inevitably unexpected errors occur, from NullReferenceExceptions to 'General network errors'. Thus ranging from programmer errors to environment problems.
Currently all these unhandled exceptions are logged using log4net and then emailed back to us for **analysis**. However we found that sometimes these error 'reports' contain too little information to identify the problem.
In these reports we need information such as:
1. Application name
2. Application Version
3. Workstation
4. Maybe a screen shot
5. Exception details
6. Operating system
7. Available RAM
8. Running processes
9. And so on...
I don't really want to re-invent the wheel by developing this from scratch. Components that are required:
1. Error collection (details as mentioned above)
2. Error 'sender' (Queuing required if DB or Internet is unavailable)
3. Error database
4. Analysis and reporting of these errors. E.g. 10 most frequent errors or timeouts occur between 4:00PM and 5:00PM. How do the errors compare between version x and y?
Note:
We looked at [{SmartAssembly}][1] as a possible solution but although close it didn't quite met our needs and I was hoping to hear what other developers do and if some alternatives exist.
[1]: http://www.smartassembly.com "{SmartAssembly} | 0 | [
2,
98,
25,
14,
246,
161,
20,
5543,
118,
17437,
9380,
11908,
19,
13,
9,
2328,
1463,
3767,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
574,
4295,
119,
98,
95,
871,
57,
20,
1183,
29,
13,
1409,
1020,
6899,
11557,
69,
637,
11908,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an easy way to request a URL in python and NOT follow redirects?
===
Looking at the source of urllib2 it looks like the easiest way to do it would be to subclass HTTPRedirectHandler and then use build_opener to override the default HTTPRedirectHandler, but this seems like a lot of (relatively complicated) work to do what seems like it should be pretty simple. | 0 | [
2,
25,
80,
40,
2010,
161,
20,
3772,
21,
287,
6362,
19,
20059,
17,
52,
1740,
302,
14706,
18,
60,
800,
3726,
3726,
699,
35,
14,
1267,
16,
13,
911,
211,
4598,
135,
32,
1879,
101,
14,
27237,
161,
20,
107,
32,
83,
44,
20,
972,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mod_rails and mongrel running on the same server?
===
I'm currently running mongrel clusters with monit watching over them for 8 Rails applications on one server.
I'd like to move 7 of these applications to mod_rails, with one remaining on mongrel. The 7 smaller applications are low-volume, while the one I'd like to remain on mongrel is a high volume, app.
As I understand it, this would be the best solution - as the setting PassengerPoolIdleTime only can be applied at a global level.
What configuration gotchas should I look out for with this type of setup? | 0 | [
2,
7226,
1,
7301,
18,
17,
21028,
7256,
946,
27,
14,
205,
8128,
60,
800,
3726,
3726,
31,
22,
79,
871,
946,
21028,
7256,
14497,
29,
3521,
242,
1953,
84,
105,
26,
469,
2240,
18,
3767,
27,
53,
8128,
9,
31,
22,
43,
101,
20,
780,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you measure your skills as a programmer?
===
At a previous interview I have been asked the question: 'From 0 to 10, how do you rate yourself as a programmer?'
I found it a very hard question to answer as I am not aware of a metric to measure how good my skills are. Moreover, knowing how well you perform would be useful to understand what you need to improve to be a better programmer.
So is there a way to know how well you do your work?
| 4 | [
2,
184,
92,
42,
4058,
154,
3207,
28,
21,
17968,
60,
800,
3726,
3726,
35,
21,
1158,
2421,
31,
57,
74,
411,
14,
1301,
45,
13,
22,
2665,
713,
20,
332,
15,
184,
107,
42,
1684,
2834,
28,
21,
17968,
5663,
31,
216,
32,
21,
253,
552... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Bugzilla Hosting recommendations?
===
Any recommendations for companies offering bugzilla hosting?
It's for maybe 5 people, but primarily for myself.
I also need graphviz support for dependency tracking. | 0 | [
2,
6256,
380,
3247,
10637,
12121,
60,
800,
3726,
3726,
186,
12121,
26,
1532,
4090,
6256,
380,
3247,
10637,
60,
32,
22,
18,
26,
913,
331,
148,
15,
47,
2257,
26,
992,
9,
31,
67,
376,
7210,
1755,
380,
555,
26,
26835,
10353,
9,
3,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is JQuery's limitations?
===
Joel always said to be careful when using 3rd party libraries. From my initial impressions, JQuery is great. What should I beware of when using it? What are it's limitations? What headaches will I run into later on as I use it more? | 0 | [
2,
98,
25,
487,
8190,
93,
22,
18,
14070,
60,
800,
3726,
3726,
8873,
550,
87,
20,
44,
5186,
76,
568,
203,
897,
346,
8649,
9,
37,
51,
2104,
6394,
18,
15,
487,
8190,
93,
25,
374,
9,
98,
378,
31,
44,
5011,
16,
76,
568,
32,
60,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prevent .NET from "lifting" local variables
===
I have the following code:
string prefix = "OLD:";
Func<string, string> prependAction = (x => prefix + x);
prefix = "NEW:";
Console.WriteLine(prependAction("brownie"));
Because the compiler replaces the prefix variable with a closure "NEW:brownie" is printed to the console.
Is there an easy way to prevent the compiler from lifting the prefix variable whilst still making use of a lambda expression? I would like a way of making my Func work identically to:
Func<string, string> prependAction = (x => "OLD:" + x);
The reason I need this is I would like to serialize the resulting delegate. If the prefix variable is in a non-serializable class the above function will not serialize.
The only way around this I can see at the moment is to create a new serializable class that stores the string as a member variable and has the string prepend method:
string prefix = "NEW:";
var prepender = new Prepender {Prefix = prefix};
Func<string, string> prependAction = prepender.Prepend;
prefix = "OLD:";
Console.WriteLine(prependAction("brownie"));
With helper class:
[Serializable]
public class Prepender
{
public string Prefix { get; set; }
public string Prepend(string str)
{
return Prefix + str;
}
}
This seems like a lot of extra work to get the compiler to be "dumb". | 0 | [
2,
2501,
13,
9,
2328,
37,
13,
7,
10805,
68,
7,
375,
12157,
800,
3726,
3726,
31,
57,
14,
249,
1797,
45,
3724,
14315,
800,
13,
7,
1218,
45,
7,
73,
2414,
150,
1,
11130,
15,
3724,
1,
15884,
2451,
8645,
800,
13,
5,
396,
800,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anyone familiar with a good "sticky windows" library for Winforms?
===
I want to recreate the stickiness and snapping of windows, like it is implemented in Winamp.
The basic premise is, when you drag a window and it comes close to another one, it will snap to it and will stick. When you move it the two will move together.
I need it for a MDI application. | 0 | [
2,
1276,
3694,
29,
21,
254,
13,
7,
10277,
93,
1936,
7,
1248,
26,
628,
4190,
18,
60,
800,
3726,
3726,
31,
259,
20,
21119,
14,
5258,
8776,
17,
17890,
16,
1936,
15,
101,
32,
25,
6807,
19,
628,
10158,
9,
14,
2125,
20236,
25,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you recommend a good FLEX online resource or book?
===
Are there any favorite online references or good introductory and intermediate/advanced books on this topic that you could recommend to me?
I'm a java developer, so I'm looking for something which would be familiar as possible as to me. | 0 | [
2,
92,
42,
12360,
21,
254,
14409,
2087,
6577,
54,
360,
60,
800,
3726,
3726,
50,
80,
186,
3839,
2087,
7231,
54,
254,
26958,
17,
6889,
118,
1283,
2686,
11014,
964,
27,
48,
8303,
30,
42,
110,
12360,
20,
55,
60,
31,
22,
79,
21,
82... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to pass a generic property as a parameter to a function?
===
I need to write a function that receives a property as a parameter and execute its getter.
If I needed to pass a function/delegate I would have used:
delegate RET FunctionDelegate<T, RET>(T t);
void func<T, RET>(FunctionDelegate function, T param, ...)
{
...
return function.Invoke(param);
}
Is there a similar way to define a property so that I could invoke it's getter and/or setter in the function code? | 0 | [
2,
184,
20,
1477,
21,
12733,
1354,
28,
21,
18906,
20,
21,
1990,
60,
800,
3726,
3726,
31,
376,
20,
2757,
21,
1990,
30,
8359,
21,
1354,
28,
21,
18906,
17,
15644,
82,
164,
815,
9,
100,
31,
851,
20,
1477,
21,
1990,
118,
24249,
332... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Any good book about Software Test Engineering specifically targeted to programmers?
===
There are a lot of questions related to Unit Testing on stack overflow, but I'm at the moment interested in understanding more about the testing role on a software development project.
I believe that to be competent software developers we should know a bit about the related disciplines to programming, like Architecture, Configuration Management, User Experience Design, and Testing, to name a few.
I suppose that many of us think that if we understand programming, we already understand most of what a tester does, and think that we could do it ourselves without much problem, but I wonder how many developers really try to learn about the Software Test Engineering discipline and practices from books and other formal resources.
So, my question:
Is there any good introductory book about Software Testing? Ideally, is there one that is written specifically for programmers that want to understand what a Software Test Engineer does and what techniques, processes, theory, tools and skills are needed?
| 0 | [
2,
186,
254,
360,
88,
2306,
1289,
1552,
3524,
9536,
20,
17968,
18,
60,
800,
3726,
3726,
80,
50,
21,
865,
16,
2346,
1597,
20,
1237,
4431,
27,
7566,
20285,
15,
47,
31,
22,
79,
35,
14,
688,
3158,
19,
3260,
91,
88,
14,
4431,
597,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does anybody know of a tabbed FTP client?
===
Am I the only person who has the need to view multiple directories at once (usually on the same remote server, but sometimes other ones too)? Disconnecting and reconnecting is driving me crazy.
Preferably a free tool, but I'm getting to the stage where I'll try anything!
Can you have multiple FireFTP tabs in Firefox? Alternatively, I've thought of using [WinTabber][1] - I used it about 12 months ago for multiple PuTTY sessions, but it just felt a little clunky.
Cheers.
[1]: http://www.wintabber.com/ | 0 | [
2,
630,
11181,
143,
16,
21,
6523,
4283,
1187,
306,
6819,
60,
800,
3726,
3726,
589,
31,
14,
104,
840,
72,
63,
14,
376,
20,
1418,
1886,
559,
1596,
35,
382,
13,
5,
13075,
27,
14,
205,
5388,
8128,
15,
47,
1030,
89,
53,
18,
266,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do htmlspecialchars and mysql_real_escape_string keep my PHP code safe from injection
===
Earlier today a question was asked regarding [input validation strategies in web apps][1].
The top answer, at time of writing, suggests in PHP just using htmlspecialchars and mysql_real_escape_string.
My question is: Is this always enough? Is there more we should know? Where do these functions break down?
[1]: http://stackoverflow.com/questions/110458/what-percentage-of-my-time-will-be-spent-in-user-input-verfication-during-web-d | 0 | [
2,
107,
13,
15895,
11118,
5433,
18,
17,
51,
18,
22402,
1,
7467,
1,
62,
13109,
1,
11130,
643,
51,
13,
26120,
1797,
1834,
37,
13646,
800,
3726,
3726,
1201,
786,
21,
1301,
23,
411,
3467,
636,
108,
4881,
27999,
10272,
19,
2741,
4865,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to allow different content types in different folders of the same document library in wss 3.0?
===
I have a document library with about 50 available content types. This document library is divided into several folders. When a user cliks the "New" button in a folder, all available content types are offered. I need to limit the content types according to the folder. For example, in the folder "Legal" a want to have only content types containing legal documents. I tried to use the UniqueContentTypeOrder property of SPFolder but it does not work. What is wrong?
private void CreateFolder(SPFolder parent, string name)
{
SPFolder z = parent.SubFolders.Add(name);
List<SPContentType> col = new List<SPContentType>();
foreach (SPContentType type in myDocumentLibrary.ContentTypes)
{
if (ContentTypeMatchesName(name, type))
{
col.Add(type);
}
}
z.UniqueContentTypeOrder = col;
z.Update();
}
| 0 | [
2,
184,
20,
1655,
421,
2331,
2551,
19,
421,
19294,
18,
16,
14,
205,
4492,
1248,
19,
619,
18,
18,
203,
9,
387,
60,
800,
3726,
3726,
31,
57,
21,
4492,
1248,
29,
88,
1222,
904,
2331,
2551,
9,
48,
4492,
1248,
25,
2350,
77,
238,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL - How do you compare a CLOB
===
in a DB2 trigger, I need to compare the value of a CLOB field.
Something like:
IF OLD_ROW.CLOB_FIELD != UPDATED_ROW.CLOB_FIELD
but "!=" does not work for comparing CLOBs.
What is the way to compare it? | 0 | [
2,
4444,
255,
13,
8,
184,
107,
42,
11590,
21,
7383,
220,
800,
3726,
3726,
19,
21,
13,
9007,
135,
7286,
15,
31,
376,
20,
11590,
14,
1923,
16,
21,
7383,
220,
575,
9,
301,
101,
45,
100,
315,
1,
5417,
9,
150,
10904,
1,
1109,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
User Defined Fields with NHibernate
===
I need to add a user defined fields feature to an asp.net c# application that uses NHibernate.
The user must be able to add and remove fields from several objects in the system "on the fly", preferably without any system downtime.
One important constraint is that the database schema can't be changed by the user - that is, I can add whatever fields/tables I need to support this feature but when the user adds or removes a field he can't change the database schema. | 0 | [
2,
4155,
2811,
2861,
29,
12109,
15191,
8820,
800,
3726,
3726,
31,
376,
20,
3547,
21,
4155,
2811,
2861,
1580,
20,
40,
28,
306,
9,
2328,
272,
5910,
3010,
30,
2027,
12109,
15191,
8820,
9,
14,
4155,
491,
44,
777,
20,
3547,
17,
4681,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to unit test a DAO that is extending SqlMapClientDaoSupport
===
Spring DA helps in writing DAOs. When using iBATIS as the persistence framework, and extending SqlMapClientDaoSupport, a SqlMapClient mock should be set for the DAO, but I can't do it. SqlMapClientTemplate is not an interface and EasyMock cannot creates a mock for it. | 0 | [
2,
184,
20,
1237,
1289,
21,
13,
17104,
30,
25,
8176,
4444,
19073,
5779,
18513,
38,
17104,
24168,
800,
3726,
3726,
1573,
1331,
7778,
19,
1174,
1331,
759,
9,
76,
568,
13,
9747,
3409,
28,
14,
28584,
6596,
15,
17,
8176,
4444,
19073,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CMS which is not a portal system
===
this is a repost of a [question not correctly answered][1] -- sorry about that.
We are looking for a reasonably priced [CMS][2], with source code, in which we can ditch the portal system. There are notorious examples of something similar which are way too expensive: [Methode][3], [Broadvision][4], [Microsoft CMS][5].
There are a lot of systems in which the portal part is too tightly coupled with the backend to do that. Basically [Joomla][6], [Drupal][7], [phpNuke][8], [dotNetNuke][9], [Umbraco][10] are all examples of what we don't want.
We want a back office system that can store heterogeneous information with versioning, workflow and so on. This information should be statically publishable (to files, xml, etc...). Also we would like to have a set of APIs for accessing the information in a custom front-end.
We would use this system in a large number of websites. Platform is not important as we develop sites on multiple stacks.
Thank you in advance
[1]: http://stackoverflow.com/questions/107494/cms-without-front-end
[2]: http://en.wikipedia.org/wiki/Content_management_system
[3]: http://www.eidosmedia.com/Feature_Update/MethodePortalServer.html
[4]: www.broadvision.com
[5]: www.microsoft.com/cmserver/
[6]: http://www.joomla.org
[7]: http://drupal.org
[8]: http://phpnuke.org
[9]: http://www.dotnetnuke.com
[10]: http://umbraco.org | 0 | [
2,
2390,
18,
56,
25,
52,
21,
8281,
329,
800,
3726,
3726,
48,
25,
21,
302,
6962,
16,
21,
636,
24652,
52,
12044,
3094,
500,
2558,
165,
500,
13,
8,
8,
1875,
88,
30,
9,
95,
50,
699,
26,
21,
19531,
13,
24152,
636,
9095,
18,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you change the http header information sent in IIS 6
===
Currently IIS sends an expires http header of yesterday minus 1 hour on ASP.NET pages. How do I change this to 60 seconds in the further instead? | 0 | [
2,
184,
107,
42,
753,
14,
7775,
157,
106,
676,
795,
19,
595,
18,
400,
800,
3726,
3726,
871,
595,
18,
11350,
40,
25910,
18,
7775,
157,
106,
16,
7124,
13,
15495,
137,
1671,
27,
28,
306,
9,
2328,
4434,
9,
184,
107,
31,
753,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Are there any an OS X equivalent to `hcitool`?
===
I'd like to write some quicks scripts to play with bluetooth devices (scan etc…), for the Mac. Under linux I'd probably use `hcitool`, or the python bluez library.
What tools are there for the Mac? | 0 | [
2,
50,
80,
186,
40,
13,
759,
993,
4602,
20,
13,
1,
9469,
49,
20799,
1,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
2757,
109,
2231,
18,
17505,
20,
418,
29,
705,
15808,
4690,
13,
5,
18,
1245,
2722,
9,
9,
9,
6,
15,
26,
14,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GCC optimization flags for Intel Atom
===
I'm developing a performance critical application for Intel Atom processor.
What are the best gcc optimization flags for this CPU? | 0 | [
2,
489,
3384,
21597,
9318,
26,
14635,
14571,
800,
3726,
3726,
31,
22,
79,
3561,
21,
956,
2507,
3010,
26,
14635,
14571,
14762,
9,
98,
50,
14,
246,
489,
3384,
21597,
9318,
26,
48,
17578,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Gnuradio Number of A/D Converters
===
Why are there two A/D converters on the USRP2 board if you can only use one RX
daughtercard?
| 0 | [
2,
26092,
11129,
234,
16,
21,
118,
43,
25893,
18,
800,
3726,
3726,
483,
50,
80,
81,
21,
118,
43,
25893,
18,
27,
14,
182,
6952,
135,
686,
100,
42,
92,
104,
275,
53,
13,
21141,
783,
6648,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What coding techniques do you use for optimising C programs?
===
Some years ago I was on a panel that was interviewing candidates for a relatively senior embedded C programmer position.
One of the standard questions that I asked was about optimisation techniques. I was quite surprised that some of the candidates didn't have answers.
So, in the interests of putting together a list for posterity - what techniques and constructs do you normally use when optimising C programs?
Answers to optimisation for speed and size both accepted. | 4 | [
2,
98,
13,
15458,
4212,
107,
42,
275,
26,
19259,
7552,
272,
1726,
60,
800,
3726,
3726,
109,
122,
1464,
31,
23,
27,
21,
4113,
30,
23,
2421,
68,
4074,
26,
21,
3109,
1101,
12138,
272,
17968,
649,
9,
53,
16,
14,
1236,
2346,
30,
31... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which Continous Integration library to use?
===
I've worked with **Cruise Control** as the CI framework in my last project.
Any recommendations on some other tools?
(Not that i found CruiseControl lacking, just wanted to know if someone did some comparisons)
| 0 | [
2,
56,
13,
13391,
1291,
8078,
1248,
20,
275,
60,
800,
3726,
3726,
31,
22,
195,
577,
29,
13,
1409,
13057,
2628,
569,
1409,
28,
14,
5486,
6596,
19,
51,
236,
669,
9,
186,
12121,
27,
109,
89,
4672,
60,
13,
5,
1270,
30,
31,
216,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
What are some good microcontroller development boards to learn the .Net micro framework?
===
Excluding the Micro Framework Emulator ;) | 0 | [
2,
98,
50,
109,
254,
2899,
12898,
1252,
522,
8755,
20,
2484,
14,
13,
9,
2328,
2899,
6596,
60,
800,
3726,
3726,
13,
14938,
14,
2899,
6596,
3579,
14868,
13,
73,
6,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Regular expression tp convert mark down to HTML
===
How would you write a regular expression to convert mark down into HTML? For example, you would type in the following:
This would be *italicized* text and this would be **bold** text
This would then need to be converted to:
This would be <em>italicized</em> text and this would be <strong>bold</strong> text
Very similar to the mark down edit control used by stackoverflow. | 0 | [
2,
1290,
1803,
13,
13726,
8406,
943,
125,
20,
13,
15895,
800,
3726,
3726,
184,
83,
42,
2757,
21,
1290,
1803,
20,
8406,
943,
125,
77,
13,
15895,
60,
26,
823,
15,
42,
83,
1001,
19,
14,
249,
45,
48,
83,
44,
1637,
3188,
4663,
1333... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Report generation
===
I am writing a web app using TurboGears, and in that app the users must be able to generate different reports.
The data the reports need is stored in a database (MySQL).
The reports must be returned either as a easily printable html document, or a pdf file.
I have previously used jasper and iReport for creating the documents, but if I can avoid having to fire up Java to create the report I would be happy.
Ideally I would like to specify reports in a easily readable markup language and then just feed the template data with some kind of library that produces the report.
I gladly accept any kind of hints on how I should go about generating these reports! | 0 | [
2,
1330,
2782,
800,
3726,
3726,
31,
589,
1174,
21,
2741,
4865,
568,
12036,
834,
5446,
15,
17,
19,
30,
4865,
14,
3878,
491,
44,
777,
20,
7920,
421,
2813,
9,
14,
1054,
14,
2813,
376,
25,
8214,
19,
21,
6018,
13,
5,
915,
18,
22402... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to convert from Decimal to T?
===
I've built a wrapper over NumbericUpDown control.
The wrapper is generic and can support int? and double?
I would like to write a method that will do the following.
private T? Getvalue()
{
T? value = numericUpDown.Value as T?;
return value;
}
of course there is no cast between decimal and double? or int? so I need to use a certain way of converting.
I would like to avoid switch or if expressions.
What would you do?
| 0 | [
2,
184,
20,
8406,
37,
26380,
20,
13,
38,
60,
800,
3726,
3726,
31,
22,
195,
392,
21,
28051,
84,
234,
596,
576,
2968,
569,
9,
14,
28051,
25,
12733,
17,
92,
555,
19,
38,
60,
17,
1494,
60,
31,
83,
101,
20,
2757,
21,
2109,
30,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to reduce the bandwith with very high sample frequency on USRP
===
I am using USRP with DBSRX daughter board.
I need a very high sample frequency. Currently, the USRP can give me
maximum sample frequency of 64M/8 in I and Q, and the data type is
short, which takes 2 bytes.
So can I decrease the length of the output data? for example save the
data as char which takes 1 bytes, and increase the sample frequency to
64M/4.
Can I do this? and how?
| 0 | [
2,
184,
20,
4136,
14,
323,
1410,
29,
253,
183,
5717,
5328,
27,
182,
6952,
800,
3726,
3726,
31,
589,
568,
182,
6952,
29,
13,
9007,
18,
21141,
783,
686,
9,
31,
376,
21,
253,
183,
5717,
5328,
9,
871,
15,
14,
182,
6952,
92,
590,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Re-ordering entries in a model using drag-and-drop
===
Say I have a blogging app in Django. How can i re-order the posts using a draggable table in the default admin?
It would be best if i didn't have to add any extra fields to the model, but if i really have to i can.
| 0 | [
2,
302,
8,
7861,
68,
11399,
19,
21,
1061,
568,
5501,
8,
290,
8,
12361,
800,
3726,
3726,
395,
31,
57,
21,
334,
13919,
4865,
19,
3857,
14541,
9,
184,
92,
31,
302,
8,
7861,
14,
9868,
568,
21,
5501,
263,
579,
859,
19,
14,
12838,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Channel measurements with ?
===
What is the best way to measure the channel for use in space-time
coding schemes using an RFX2400 board?
As far as I know you can only get the I and Q streams out of the USRP,
and I'm not sure how you would get a set of channel coefficients.
I am planning on using the conjugate of the measured channel to
'reverse' the damage done by transmission.
| 0 | [
2,
1318,
12776,
29,
13,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
4058,
14,
1318,
26,
275,
19,
726,
8,
891,
13,
15458,
13185,
568,
40,
761,
16488,
135,
7114,
686,
60,
28,
463,
28,
31,
143,
42,
92,
104,
164,
14,
31,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to install ExtUtils::PkgConfig in perl?
===
I've tried cpan shell and I keep getting:
*** ExtUtils::PkgConfig requires the pkg-config utility, but it doesn't
*** seem to be in your PATH. Is it correctly installed?
What is the pkg-config utility and how do I install it?
| 0 | [
2,
184,
20,
16146,
1396,
38,
14255,
18,
45,
45,
17244,
263,
14093,
2816,
19,
416,
255,
60,
800,
3726,
3726,
31,
22,
195,
794,
272,
3206,
3593,
17,
31,
643,
1017,
45,
8980,
1396,
38,
14255,
18,
45,
45,
17244,
263,
14093,
2816,
47... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dirty fields in django
===
In my app i need to save changed values (old and new) when model gets saved. Any examples or working code? | 0 | [
2,
6121,
2861,
19,
3857,
14541,
800,
3726,
3726,
19,
51,
4865,
31,
376,
20,
2079,
1015,
4070,
13,
5,
1218,
17,
78,
6,
76,
1061,
3049,
4377,
9,
186,
3770,
54,
638,
1797,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Integrating gyro and accelerometer readings
===
I have read a number of papers on Kalman filters, but there seem to be few good publically accessible worked examples of getting from mathematical paper to actual working code.
I have a system containing a three-axis accelerometer and a single gyro measuring rotation around one of the accelerometer axes. The system is designed to be held by a human, and much of the time the gyro will be measuring rotation about the gravity vector or close to it. (People working in the same industry will likely recognise what I am talking about from that ;)) I realise this is underconstrained.
The gyros appear to have a near-constant bias that is slightly different for each instance of the system. How would I go about coding a filter to use the accelerometer readings to calibrate the gyro at times when the system is tilted so the gyro axis is not collinear with gravity, and is being rotated about the gyro axis? It seems like there shoud be enough information to do that, but being told that there isn't and why would be an answer too :) | 0 | [
2,
24529,
28487,
17,
7602,
532,
106,
17325,
1876,
18,
800,
3726,
3726,
31,
57,
1302,
21,
234,
16,
3747,
27,
4573,
177,
21062,
15,
47,
80,
2260,
20,
44,
310,
254,
317,
1326,
7342,
577,
3770,
16,
1017,
37,
7046,
1397,
20,
3463,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best graphic library for .NET/Mono
===
I am looking for a high-performance graphic library for .NET and Mono. I have taken a look at [Tao framework][1] and, while it is very complete, it's quite lacking in terms of usability. It should be cross-platform compatible.
What other alternatives worked for you?
[1]: http://www.taoframework.com/ | 0 | [
2,
246,
8479,
1248,
26,
13,
9,
2328,
118,
20027,
800,
3726,
3726,
31,
589,
699,
26,
21,
183,
8,
22528,
8479,
1248,
26,
13,
9,
2328,
17,
4129,
9,
31,
57,
658,
21,
361,
35,
636,
536,
111,
6596,
500,
2558,
165,
500,
17,
15,
133... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Firefox status bar is 3/4" above the bottom border
===
Somehow my FireFox 2 got corrupted, and the status bar is about 3/4" above the bottom window border.
Anyone have an idea on how to get it back to being flush with the bottom window border? | 0 | [
2,
535,
18219,
1782,
748,
25,
203,
13722,
7,
784,
14,
2129,
1862,
800,
3726,
3726,
3625,
51,
535,
18219,
172,
330,
11305,
69,
15,
17,
14,
1782,
748,
25,
88,
203,
13722,
7,
784,
14,
2129,
1463,
1862,
9,
1276,
57,
40,
882,
27,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
Dynamically importing a C++ class from a DLL
===
What is the correct way to import a C++ class from a DLL? We're using Visual C++.
There's the dllexport/exports.def+LoadLibrary+GetProcAddress trifecta, but it doesn't work on C++ classes, only C functions. Is this due to C++ name-mangling? How do I make this work? | 0 | [
2,
7782,
1326,
9010,
68,
21,
272,
20512,
718,
37,
21,
13,
43,
211,
800,
3726,
3726,
98,
25,
14,
4456,
161,
20,
9010,
21,
272,
20512,
718,
37,
21,
13,
43,
211,
60,
95,
22,
99,
568,
3458,
272,
20512,
9,
80,
22,
18,
14,
13,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best graph and diagram toolset for PHP
===
What do you think is the best diagram and graphing toolset for PHP that also look good?
I know that there are some open source graphing tools for PHP out there, but they are not really visually appealing to me. | 4 | [
2,
246,
7210,
17,
14161,
4672,
1198,
26,
13,
26120,
800,
3726,
3726,
98,
107,
42,
277,
25,
14,
246,
14161,
17,
7210,
68,
4672,
1198,
26,
13,
26120,
30,
67,
361,
254,
60,
31,
143,
30,
80,
50,
109,
368,
1267,
7210,
68,
4672,
26,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
Never do anything until you ready to use it, in software to? [Toyota principle]
===
I was out running in the forest when it struck me like lightning. (okej, I was listening to a podcast where they talked about principles Toyota was using.)
It totally came to me, we should be thinking in the exactly same way.
" - Never do anything until you are ready to use it."
I think this is applies to software construction also.
Is this old news? | 0 | [
2,
243,
107,
602,
163,
42,
1451,
20,
275,
32,
15,
19,
2306,
20,
60,
636,
262,
93,
7060,
5897,
500,
800,
3726,
3726,
31,
23,
70,
946,
19,
14,
1334,
76,
32,
3395,
55,
101,
6735,
9,
13,
5,
8416,
728,
15,
31,
23,
4948,
20,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In need for a site, which explains how to use PHPUnit
===
I am searching for a tutorial (optimaly with Zend Framework) on how to use PHPUnit.
I have found a couple on google but have not quiet understood it yet. | 0 | [
2,
19,
376,
26,
21,
689,
15,
56,
7346,
184,
20,
275,
13,
26120,
15464,
800,
3726,
3726,
31,
589,
5792,
26,
21,
29724,
13,
5,
25458,
540,
102,
29,
10526,
43,
6596,
6,
27,
184,
20,
275,
13,
26120,
15464,
9,
31,
57,
216,
21,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
Debugging Designer processing in VS 2008
===
I have a public property set in my form of type `ListE<T>` where:
public class ListE<T> : IList<T>, ICollection<T>, IEnumerable<T>, IList, ICollection, IEnumerable
Yeah, it's a mouthful, but that's what the Designer requires for it to show up as an editable collection in the Properties window. Which it does! So, I click the little [..] button to edit the collection, and then click Add to add an item to the collection.
> Arithmetic operation resulted in an overflow.
Now, this is a very basic List, little more than an expanding array. The only part that comes close to arithmetic in the whole thing is in the expand function, and even that uses a left shift rather than a multiplication, so that won't overflow. This all makes me think that this exception is being raised inside the Designer, perhaps caused by some small inattention to implementation detail on my part, but I can't find a way to test or debug that scenario. Does anyone have any smart ideas?
EDIT: Yes, I can use the property successfully, well even manually, ie. in the `OnLoad` handler, and I suppose that's what I'll have to resort to if I can't get this working, but that wouldn't be ideal. :( | 0 | [
2,
121,
16254,
2762,
4742,
5511,
19,
4611,
570,
800,
3726,
3726,
31,
57,
21,
317,
1354,
309,
19,
51,
505,
16,
1001,
13,
1,
5739,
62,
1,
38,
1,
113,
45,
317,
718,
968,
62,
1,
38,
1,
13,
45,
31,
5739,
1,
38,
1,
15,
31,
150... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Never produce to an unknown pathway, in software to? [Toyota principle]
===
I was out running.. anyway.
In Toyota manufacturing lines they always know what path a part have traveled. Just so they can be sure they can fix it of something goes wrong. Is this applicable in software too?
All error messages should tell me exactly what path they traveled. Some do, the error messages with stack trace. It this a correct interpretation? Could it be used some where else?
If, then we know that it is a core principle. Taken from car manufacturing. | 0 | [
2,
243,
2213,
20,
40,
2562,
14010,
15,
19,
2306,
20,
60,
636,
262,
93,
7060,
5897,
500,
800,
3726,
3726,
31,
23,
70,
946,
9,
9,
2774,
9,
19,
13033,
4587,
1560,
59,
550,
143,
98,
2013,
21,
141,
57,
5082,
9,
114,
86,
59,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Always do it with the same method every time, is this usable in Software projects? [Toyota principle]
===
I was out running.. listening to a podcast about Toyota.. anyway.
This principle I think does not come to use in the software projects. (maybe project management). The art is still to young. We don't know what we are doing, at the moment. But eventually, we will.
Or, do some one see how to use this core principle? | 0 | [
2,
550,
107,
32,
29,
14,
205,
2109,
352,
85,
15,
25,
48,
182,
579,
19,
2306,
2314,
60,
636,
262,
93,
7060,
5897,
500,
800,
3726,
3726,
31,
23,
70,
946,
9,
9,
4948,
20,
21,
15124,
88,
13033,
9,
9,
2774,
9,
48,
5897,
31,
277... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSRS on CE 6?
===
I have a DSS service I created (For Microsoft Robotics Studio). I then followed the documentation to make it a compact framework service and created a deployment package. I then deploy it to a CE 6 device...
Does a MSRS service work on CE 6? The documentation talks about CE 5?
What should I see if I run it? I expect to see something simillar too running DSSHost on Windows... but I only see a blank screen so I do not know if the service is running? The documentation states that it does take time the first time (+/- 30 seconds on a EBOX-2300) . I left it for a while still a blank screen!
Should I see something? I also tried to access the service using web browser but no luck? How do I also setup the security settings to allow distributed nodes? | 0 | [
2,
4235,
1224,
27,
4000,
400,
60,
800,
3726,
3726,
31,
57,
21,
13,
43,
18,
18,
365,
31,
679,
13,
5,
1106,
7099,
15219,
18,
1120,
6,
9,
31,
94,
709,
14,
13945,
20,
233,
32,
21,
8285,
6596,
365,
17,
679,
21,
10475,
6030,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP parse configuration ini files
===
Is there a way to read a module's configuration ini file?
For example I installed php-eaccelerator (<http://eaccelerator.net>) and it put a eaccelerator.ini file in /etc/php.d My PHP installation wont read this INI file because the "--with-config-file-scan-dir" option wasn't used when compiling PHP **Is there a way to manually specify a path to the ini file** somewhere so PHP can read the module's settings?
| 0 | [
2,
13,
26120,
2017,
870,
8091,
19,
49,
6488,
800,
3726,
3726,
25,
80,
21,
161,
20,
1302,
21,
12613,
22,
18,
8091,
19,
49,
3893,
60,
26,
823,
31,
4066,
13,
26120,
8,
62,
1738,
1105,
1252,
3457,
13,
5,
1,
21127,
6903,
62,
1738,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL transaction with thousands of Inserts - how many "rountrips" does it take?
===
I've got C# code that accesses MySQL through ODBC.
It creates a transaction, does a few thousand insert commands, and then commits.
Now my question is how many "round trips", so to speak, happen against the DB server? I mean, does it simply transmit every insert command to the DB server, or does it cache/buffer them and send them in batches? And is this configurable in any way?
Thanks. | 0 | [
2,
51,
18,
22402,
12799,
29,
3805,
16,
14692,
18,
13,
8,
184,
151,
13,
7,
661,
1020,
17851,
18,
7,
630,
32,
247,
60,
800,
3726,
3726,
31,
22,
195,
330,
272,
5910,
1797,
30,
1381,
160,
51,
18,
22402,
120,
12340,
7229,
9,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the closest thing to Slime for Scheme?
===
I do most of my development in Common Lisp, but there are some moments when I want to switch to Scheme (while reading Lisp in Small Pieces, when I want to play with continuations, or when I want to do some scripting in Gauche, for example). In such situations, my main source of discomfort is that I don't have Slime (yes, you may call me an addict).
So, what is Scheme's closest counterpart to Slime? Specifically, I am most interested in:
* Emacs integration (this point is obvious ;))
* Decent tab completion (ideally, c-w-c-c TAB should expand to call-with-current-continuation). It may be even symbol-table based (ie. it doesn't have to notice a function I defined in a `let` at once).
* Function argument hints in the minibuffer (if I have typed `(map |)` (cursor position is indicated by `|`)), I'd like to see `(map predicate . lists)` in the minibuffer
* Sending forms to the interpreter
* Integration with a debugger.
I have ordered the features by descending importance.
Thanks in advance. | 0 | [
2,
98,
25,
14,
6993,
584,
20,
8824,
62,
26,
4276,
60,
800,
3726,
3726,
31,
107,
127,
16,
51,
522,
19,
757,
2093,
3401,
15,
47,
80,
50,
109,
4365,
76,
31,
259,
20,
5521,
20,
4276,
13,
5,
10144,
1876,
2093,
3401,
19,
284,
2491... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Changing Hostname / IP Address of Windows System Mounted as an Image
===
I'm looking for a way to change the hostname and IP address of a Windows XP system that is mounted via a loop-back image on a Linux system. So basically I have access to the Windows XP system on a file level, but I cannot execute any programs on it. A way similar to editing the /etc/hostname and whatever network configuration file under Linux.
The only ways I've found so far would include running a tool after boot, e.g. MS sysprep or use a solution like Acronis Snap Deploy.
ciao,
elm
| 0 | [
2,
4226,
2015,
7259,
13,
118,
15735,
3218,
16,
1936,
329,
4897,
28,
40,
1961,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
753,
14,
2015,
7259,
17,
15735,
3218,
16,
21,
1936,
23045,
329,
30,
25,
4897,
1197,
21,
5293,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I end a Python Tkinter program?
===
How do I end a Python Tkinter program? Let's say I have this code:
from Tkinter import *
def quit():
???
root = Tk()
Button(root, text="Quit", command=quit).pack()
root.mainloop()
How should I define the quit() routine?
| 0 | [
2,
184,
107,
31,
241,
21,
20059,
13,
38,
1767,
815,
625,
60,
800,
3726,
3726,
184,
107,
31,
241,
21,
20059,
13,
38,
1767,
815,
625,
60,
408,
22,
18,
395,
31,
57,
48,
1797,
45,
37,
13,
38,
1767,
815,
9010,
1637,
6312,
6489,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XNA Game Studio 3D model editor suggestions
===
I want to create basic low-poly 3D models to use in XNA Game Studio games. What cheap/free tools do people recommend?
And does anyone have any links or snippets of code that show how to load 3D models of some sort into XNA and then draw them on the screen? | 0 | [
2,
993,
325,
250,
1120,
203,
43,
1061,
1835,
18389,
800,
3726,
3726,
31,
259,
20,
1600,
2125,
708,
8,
17108,
203,
43,
2761,
20,
275,
19,
993,
325,
250,
1120,
466,
9,
98,
9148,
118,
4639,
4672,
107,
148,
12360,
60,
17,
630,
1276,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Read divert sockets in java?
===
If I was to create a ipfw divert rule to forward all FTP traffic to a specific socket, is it possible to use Java to connect to the socekt and read the packet information? If so, how would i go about reading/writing to the scoket? | 0 | [
2,
1302,
19610,
18482,
18,
19,
8247,
60,
800,
3726,
3726,
100,
31,
23,
20,
1600,
21,
15735,
18651,
19610,
1828,
20,
917,
65,
1187,
306,
2227,
20,
21,
1903,
18482,
15,
25,
32,
938,
20,
275,
8247,
20,
6379,
20,
14,
86,
21940,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you recommend PostGre over MySQL?
===
We are currently working with JavaEE and MySQL 5 in our company, but we have some queries, especially delete queries that take > 10 min to execute. We consider to switch to PostGre.
What are the advantages of PostGree over MySQL if there are any? Do you have experiences with both DBs and may give me a roundup whether this is a good idea or does this fully depend on the needs of our server?
Thank you for your opinion!
Greetz, GHad | 4 | [
2,
107,
42,
12360,
678,
6879,
84,
51,
18,
22402,
60,
800,
3726,
3726,
95,
50,
871,
638,
29,
8247,
2851,
17,
51,
18,
22402,
331,
19,
318,
237,
15,
47,
95,
57,
109,
9386,
2829,
15,
1118,
27448,
9386,
2829,
30,
247,
13,
1,
332,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a valid reason for enforcing a maximum width of 80 characters in a code file, this day and age?
===
Seriously. On a 22' monitor, it only covers maybe a quarter of the screen. I need some ammo to axe down this rule. | 0 | [
2,
25,
80,
21,
7394,
1215,
26,
29296,
21,
2979,
9456,
16,
2972,
1766,
19,
21,
1797,
3893,
15,
48,
208,
17,
348,
60,
800,
3726,
3726,
4818,
9,
27,
21,
1024,
22,
7626,
15,
32,
104,
2937,
913,
21,
2650,
16,
14,
2324,
9,
31,
376... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.