unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Help improve this INI parsing code
===
This is something simple I came up with for [this question][1]. I'm not entirely happy with it and I saw it as a chance to help improve my use of STL and streams based programming.
std::wifstream file(L"\\Windows\\myini.ini");
if (file)
{
bool section=false;
while (!file.eof())
{
// how to get a line into a string in one go?
WCHAR _line[256];
file.getline(_line, ELEMENTS(_line));
std::wstringstream lineStm(_line);
std::wstring &line=lineStm.str();
if (line.empty()) continue;
switch (line[0])
{
// new header
case L'[':
{
// how to extract the section name?
std::wstring header;
for (size_t i=1; i<line.length(); i++)
{
if (line[i]!=L']')
header.push_back(line[i]);
else
break;
}
if (header==L"Section")
section=true;
else
section=false;
}
break;
// comments
case ';':
case ' ':
case '#':
break;
// var=value
default:
{
if (!section) continue;
// what if the name = value does not have white space?
// what if the value is enclosed in quotes?
std::wstring name, dummy, value;
lineStm >> name >> dummy;
ws(lineStm);
WCHAR _value[256];
lineStm.getline(_value, ELEMENTS(_value));
value=_value;
}
}
}
}
How would you improve this? Please do not recommend alternative libraries - I just want a simple method for parsing out some config strings from an INI file.
[1]: http://stackoverflow.com/questions/146795/how-to-read-config-file-entries-from-an-ini-file | 0 | [
2,
448,
3545,
48,
19,
49,
2017,
18,
68,
1797,
800,
3726,
3726,
48,
25,
301,
1935,
31,
281,
71,
29,
26,
636,
1565,
1301,
500,
2558,
165,
500,
9,
31,
22,
79,
52,
2894,
1700,
29,
32,
17,
31,
441,
32,
28,
21,
1504,
20,
448,
35... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Should I be extending this class? (PHP)
===
I'm creating an ORM in PHP, and I've got a class 'ORM' which basically creates an object corresponding to a database table (I'm aiming for similar to/same functionality as an ActiveRecord pattern.) ORM itself extends 'Database', which sets up the database connection.
So, I can call: <code><pre>$c = new Customer();
$c->name = 'John Smith';
$c->save();</pre></code>
The ORM class provides this functionality (sets up the class properties, provides save(), find(), findAll() etc. methods), and Customer extends ORM. However, in the future I may be wanting to add extra public methods to Customer (or any other model I create), so should this be extending ORM or not?
I know I haven't provided much information here, but hopefully this is understandable on a vague explanation, as opposed to posting up 300+ lines of code. | 0 | [
2,
378,
31,
44,
8176,
48,
718,
60,
13,
5,
26120,
6,
800,
3726,
3726,
31,
22,
79,
2936,
40,
54,
79,
19,
13,
26120,
15,
17,
31,
22,
195,
330,
21,
718,
13,
22,
248,
79,
22,
56,
11374,
9695,
40,
3095,
7265,
20,
21,
6018,
859,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 SQLExpress 2005 and 2008 be installed on same machine without issue?
===
I would like to install SQLExpress2005 as an instance "SQLExpress"
and install SQLExpresss2008 as "SQLExpress2008" instance.
Is there any problem with doing this on the same machine?
| 0 | [
2,
92,
4444,
255,
21230,
812,
17,
570,
44,
4066,
27,
205,
1940,
366,
1513,
60,
800,
3726,
3726,
31,
83,
101,
20,
16146,
4444,
255,
21230,
2835,
28,
40,
4851,
13,
7,
18,
22402,
21230,
7,
17,
16146,
4444,
255,
21230,
18,
2753,
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... |
Search Engines Inexact Counting (about xxx results)
===
When you search in Google (i'm almost sure that Altavista did the same thing) it says "Results 1-10 of about xxxx"...
This has always amazed me... What does it mean "about"?
How can they count roughly?
I do understand why they can't come up with a precise figure in a reasonable time, but how do they even reach this "approximate" one?
I'm sure there's a lot of theory behind this one that I missed... | 0 | [
2,
2122,
4016,
19,
1706,
5183,
11195,
13,
5,
6901,
13,
13290,
1736,
6,
800,
3726,
3726,
76,
42,
2122,
19,
8144,
13,
5,
49,
22,
79,
557,
562,
30,
14701,
22034,
144,
14,
205,
584,
6,
32,
898,
13,
7,
29955,
18,
137,
8,
1036,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 #defines are setup by xCode when compiling for iPhone
===
I'm writing some semi-portable code and want to be able to detect when I'm compiling for iPhone. So I want something like #ifdef IPHONE_SDK....
Presumably xCode defines something, but I can't see anything under project properties, and google isn't much help. | 0 | [
2,
98,
6926,
13862,
10652,
50,
18161,
34,
993,
9375,
76,
24378,
26,
21024,
800,
3726,
3726,
31,
22,
79,
1174,
109,
1922,
8,
1993,
579,
1797,
17,
259,
20,
44,
777,
20,
9092,
76,
31,
22,
79,
24378,
26,
21024,
9,
86,
31,
259,
301... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Style question: Writing "this." before instance variable and methods: good or bad idea?
===
One of my nasty(?) programming habits in C++ and Java is to always precede calls or accesses to members with a "this". For example: this.process(this.event)...
A few of my students commented on this, and I'm wondering if I am teaching bad habits.
My rationale is:
1) Makes code more readable - Easier to distinguish fields from local variables.
2) Makes it easier to distinguish standard calls from static calls (especially in Java)
3) Makes me remember that this call (unless the target is final) could end up on a different target, for example in an overriding version in a subclass.
Obviously, this has zero impact on the compiled program, it's just readability. So am I making it more or less readable? | 0 | [
2,
1034,
1301,
45,
1174,
13,
7,
1565,
9,
7,
115,
4851,
7612,
17,
3195,
45,
254,
54,
896,
882,
60,
800,
3726,
3726,
53,
16,
51,
13077,
5,
60,
6,
3143,
16760,
19,
272,
20512,
17,
8247,
25,
20,
550,
27466,
3029,
54,
1381,
160,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Image processing server
===
I'm looking for a free, preferably open source, http [image processing server][1]. I.e. I would send it a request like this:
http://myimageserver/rotate?url=http%3A%2F%2Fstackoverflow.com%2FContent%2FImg%2Fstackoverflow-logo-250.png&angle=90
and it would return that image rotated. Features wanted:
* Server-side caching
* Several operations/effects (like scaling, watermarking, etc). The more the merrier.
* POST support to supply the image (instead of the server GETting it).
* Different output formats (PNG, JPEG, etc).
* Batch operations
It would be something like [this][2], but free and less SOAPy. Is there anything like this or am I asking too much?
[1]: http://en.wikipedia.org/wiki/Image_server
[2]: http://leadtools.com/SDK/web-services/Image-Service/default.htm | 0 | [
2,
1961,
5511,
8128,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
551,
15,
6369,
4801,
368,
1267,
15,
7775,
636,
22039,
5511,
8128,
500,
2558,
165,
500,
9,
31,
9,
62,
9,
31,
83,
2660,
32,
21,
3772,
101,
48,
45,
7775,
6903,
915,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Where to put common writable application files?
===
I thought that `CSIDL_COMMON_APPDATA\company\product` should be the place to put files that are common for all users of the application and that the application can modify, however, on Vista this is a read-only location, unless modified by the installer (as per MSDN - http://msdn.microsoft.com/en-us/library/ms995853.aspx), so... what's best? Modify the location's security settings to allow writing or use `CSIDL_COMMON_DOCUMENTS\company\product` instead? Maybe there's a third option?
Also, is there an "official" Microsoft recommendation on this somewhere?
Thanks in advance. | 0 | [
2,
113,
20,
442,
757,
20127,
579,
3010,
6488,
60,
800,
3726,
3726,
31,
289,
30,
13,
1,
16166,
8643,
1,
17130,
1,
7753,
18768,
1,
28359,
1,
14086,
1,
378,
44,
14,
209,
20,
442,
6488,
30,
50,
757,
26,
65,
3878,
16,
14,
3010,
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... |
When creating a web control should you override OnLoad or implement Page_Load
===
When you create a new web user control in visual studio it by default adds the Page_Load event. What is the advantage to using this rather than overriding the base `OnLoad` event on the control? Is it just that the `Page_Load` event fires before `OnLoad`? | 0 | [
2,
76,
2936,
21,
2741,
569,
378,
42,
84,
11891,
27,
8294,
54,
8713,
2478,
1,
8294,
800,
3726,
3726,
76,
42,
1600,
21,
78,
2741,
4155,
569,
19,
3458,
1120,
32,
34,
12838,
10621,
14,
2478,
1,
8294,
807,
9,
98,
25,
14,
3314,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Automatically adding specified text at beginning of files in VS 2008
===
Is there a way to have Visual Studio 2008 automatically add heading information to files? For example, "Copyright 2008" or something along those lines. I've been digging through the options, but nothing seems to be jumping out at me. | 0 | [
2,
7499,
4721,
9931,
1854,
35,
997,
16,
6488,
19,
4611,
570,
800,
3726,
3726,
25,
80,
21,
161,
20,
57,
3458,
1120,
570,
7499,
3547,
4582,
676,
20,
6488,
60,
26,
823,
15,
13,
7,
19625,
4183,
570,
7,
54,
301,
303,
273,
1560,
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... |
Is it correct to use inheritance instead of name aliasing in c#?
===
In other words, is it correct to use:
public class CustomerList : System.Collections.Generic.List<Customer>
{
}
instead of:
using CustomerList = System.Collections.Generic.List<Customer>
I'd rather use the first approach because I'd just define CustomerList once, and every time I needed a customer list I'd always use the same type. On the other hand, using the name aliasing approach not only forces me to have to redefine it everywhere, but also a different alias could be given every time someone wanted to use it (think of a big team), and thus cause the code to be less readable. | 0 | [
2,
25,
32,
4456,
20,
275,
13852,
700,
16,
204,
15794,
68,
19,
272,
5910,
60,
800,
3726,
3726,
19,
89,
715,
15,
25,
32,
4456,
20,
275,
45,
317,
718,
7705,
5739,
13,
45,
329,
9,
15015,
5757,
9,
17083,
596,
9,
5739,
1,
4636,
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,
1,
1... |
REGEX: Grabbing everything untill a specific word
===
ex: `<a><strike>example data in here</strike></a>`
I want everything in side the a tag, to the end </a>
regex: `/<a>([^<]*)<\/a>/`
It works when their is no additional tags within the `<a>` tag, but what if their are, i want to know if you can tell it to grab everything up to `[^</a>]` instead of `[^<]` only.
Doing it with `/<a>(.*)<\/a>/` doesnt work well sometimes i get everything in the `<a>` tag other times i get tons of lines included in that call. | 0 | [
2,
7953,
1706,
45,
9910,
796,
163,
255,
21,
1903,
833,
800,
3726,
3726,
1396,
45,
13,
1,
58,
1,
18827,
1,
29041,
1054,
19,
235,
1,
118,
18827,
1,
118,
58,
1,
31,
259,
796,
19,
270,
14,
21,
3383,
15,
20,
14,
241,
13,
1,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Outlook attachements.Add() is not showing in mail body
===
I'm creating a new mail item, in C# VS-2008 outlook 2007, and attaching a file. The first issue is that I don't see an attachment area under the subject line showing the attachment. If I send the e-mail its properties show that there is an attachment and the e-mail size has grown by the attachment amount. I just cannot see it or extract the attachment.
Here is the code I'm using:
Outlook.MailItem mailItem = (Outlook.MailItem)this.Application.CreateItem(Outlook.OlItemType.olMailItem);
attachments.Add(ReleaseForm.ZipFile, Outlook.OlAttachmentType.olByValue, 0, "DisplayName");
I am expecting the part "DisplayName" would show as the attachment name and I should be using the filename.
| 0 | [
2,
19837,
23453,
6601,
9,
14854,
5,
6,
25,
52,
3187,
19,
4216,
358,
800,
3726,
3726,
31,
22,
79,
2936,
21,
78,
4216,
9101,
15,
19,
272,
5910,
4611,
8,
2753,
19837,
624,
15,
17,
19514,
68,
21,
3893,
9,
14,
64,
1513,
25,
30,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is iPhone support XML-RPC?
===
Is iPhone support XML-RPC, Is their any open source framework which I can use?
Thanks in advance. | 0 | [
2,
25,
21024,
555,
23504,
8,
139,
5779,
60,
800,
3726,
3726,
25,
21024,
555,
23504,
8,
139,
5779,
15,
25,
66,
186,
368,
1267,
6596,
56,
31,
92,
275,
60,
3669,
19,
3612,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can a service control its own state?
===
I have a standard windows server that inherits from the ServiceBase class.
On the OnStart method I want to check for certain conditions before I get to the main purpose of what my service does.
For example:
protected override void OnStart(string[] args)
{
if (condition == false)
{
EventLog.WriteEntry("Pre-condition not met, service was unable to start");
// TODO: Convert service state to "Stopped" because my precondition wasn't met
return;
}
InnitializeService();
}
Anybody have a good example for how a service can control its own state? | 0 | [
2,
184,
92,
21,
365,
569,
82,
258,
146,
60,
800,
3726,
3726,
31,
57,
21,
1236,
1936,
8128,
30,
17569,
18,
37,
14,
365,
8436,
718,
9,
27,
14,
27,
13680,
2109,
31,
259,
20,
2631,
26,
1200,
2039,
115,
31,
164,
20,
14,
407,
2131... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 are permissions inherited on an Ubuntu Server?
===
Sorry for the second newbie question, I'm a developer not a sysadmin so this is all quite new to me. I hope I can explain myself clearly! Here goes.
Here's what I did:
- **Logged into the root account**
- Created the accounts 'richard' and 'austin'
- Created the group 'developers', and added 'richard' and 'austin' to it
- Created the directory /server, and used "chown richard:developers /server" to change the owner
- Changed the permissions of /server to drwxrwxr-x (so the group can write to it)
- **Logged out of the root account, and into the 'richard' account**
- Created the directories /server/production and /server/staging
- Used "ls -l" inside /server to list the contents, and found permissions of drwxr-xr-x and ownership of "richard:richard" for both /server/production and /server/staging. Consequently, 'austin' can edit inside the /server directory, but not inside the directories 'richard' created.
What am I doing wrong? I want to ensure that any files or folders created inside the /server directory have group write permissions and belong to the developers group. How do I go about that?
Thanks for any help! | 0 | [
2,
184,
50,
5572,
18,
7179,
27,
40,
287,
12968,
2473,
8128,
60,
800,
3726,
3726,
1875,
26,
14,
153,
78,
5893,
1301,
15,
31,
22,
79,
21,
10058,
52,
21,
10315,
18,
1283,
2160,
86,
48,
25,
65,
1450,
78,
20,
55,
9,
31,
1376,
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... |
Are there any .net free ways to turn html into an image
===
I want to take html, including the text and images and turn it into one image containing everything. Is there a free way to do it?
This is using .net 3.5. | 0 | [
2,
50,
80,
186,
13,
9,
2328,
551,
2847,
20,
805,
13,
15895,
77,
40,
1961,
800,
3726,
3726,
31,
259,
20,
247,
13,
15895,
15,
215,
14,
1854,
17,
3502,
17,
805,
32,
77,
53,
1961,
3503,
796,
9,
25,
80,
21,
551,
161,
20,
107,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0... |
What's a solid, full-featured open rich text representation usable on the Web?
===
I'm looking for an internal representation format for **text**, which would support basic formatting (font face, size, weight, indentation, basic tables, **also supporting** the following features:
- Bidirectional input (Hebrew, Arabic, etc.)
- Multi-language input (i.e. UTF-8) in same text field
- Anchored footnotes (i.e. a superscript number that's a link to that numbered footnote)
I guess [TEI](http://www.tei-c.org/index.xml) or [DocBook](http://www.docbook.org/) are rich enough, but here's the snag -- I want these text buffers to be **Web-editable**, so I need either an edit control that eats TEI or DocBook, or **reliable** and **two-way** conversion between one of them and whatever the edit control can eat.
The edit control I'm thinking of is something like [TinyMCE](http://tinymce.moxiecode.com/), but AFAICT, TinyMCE lacks footnotes and tables.
Any pointers much appreciated!
| 0 | [
2,
98,
22,
18,
21,
2941,
15,
503,
8,
26956,
43,
368,
2042,
1854,
5442,
182,
579,
27,
14,
2741,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
3117,
5442,
2595,
26,
13,
1409,
11969,
1409,
15,
56,
83,
555,
2125,
2595,
1203,
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... |
Why do discussions of "swappiness" act like information can only be in one place at a time?
===
I've been reading up on Linux's "swappiness" tuneable, which controls how aggressive the kernel is about swapping applications' memory to disk when they're not being used. If you Google the term, you get a lot of pages like [this](http://www.debian.co.nz/Tweak+your+swappiness.html) discussing the pros and cons. In a nutshell, the argument goes like this:
> If your swappiness is too low, inactive applications will hog all the system memory that other programs might want to use.
> If your swappiness is too high, when you wake up those inactive applications, there's going to be a big delay as their state is read back off the disk.
This argument doesn't make sense to me. If I have an inactive application that's using a ton of memory, why doesn't the kernel page its memory to disk AND leave another copy of that data in-memory? This seems to give the best of both worlds: if another application needs that memory, it can immediately claim the physical RAM and start writing to it, since another copy of it is on disk and can be swapped back in when the inactive application is woken up. And when the original app wakes up, any of its pages that are still in RAM can be used as-is, without having to pull them off the disk.
Or am I missing something? | 0 | [
2,
483,
107,
11139,
16,
13,
7,
18,
1608,
20212,
720,
7,
601,
101,
676,
92,
104,
44,
19,
53,
209,
35,
21,
85,
60,
800,
3726,
3726,
31,
22,
195,
74,
1876,
71,
27,
13024,
22,
18,
13,
7,
18,
1608,
20212,
720,
7,
6768,
579,
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... |
How to diagnosis OSX app crash from error log?
===
How can I use this error log info (and appended thread particulars) to diagnosis my app crash? (NB: I have no expertise with crash logs or OS kernels.)
In this case, my email client (Eudora) crashes immediately on launch, every time, after no apparent system changes.
Host Name: [name of Mac]
Date/Time: 2008-09-28 14:46:54.177 -0400
OS Version: 10.4.11 (Build 8S165)
Report Version: 4
Command: Eudora
Path: /Applications/[...]/Eudora Application Folder/Eudora.app/Contents/MacOS/Eudora
Parent: WindowServer [59]
Version: 6.2.4 (6.2.4)
PID: 231
Thread: 0
Exception: EXC_BAD_ACCESS (0x0001)
Codes: KERN_PROTECTION_FAILURE (0x0002) at 0x00000001
| 0 | [
2,
184,
20,
12814,
13,
759,
396,
4865,
4597,
37,
7019,
6738,
60,
800,
3726,
3726,
184,
92,
31,
275,
48,
7019,
6738,
15404,
13,
5,
290,
4865,
10726,
9322,
1498,
18,
6,
20,
12814,
51,
4865,
4597,
60,
13,
5,
13502,
45,
31,
57,
90... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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# downcasting when binding to and interface
===
**Is there a better way of binding a list of base class to a UI other than downcasting e.g:**
static void Main(string[] args) {
List<Animal> list = new List<Animal>();
Pig p = new Pig(5);
Dog d = new Dog("/images/dog1.jpg");
list.Add(p);
list.Add(d);
foreach (Animal a in list)
{
DoPigStuff(a as Pig);
DoDogStuff(a as Dog);
}
}
static void DoPigStuff(Pig p)
{
if (p != null)
{
label1.Text = String.Format("The pigs tail is {0}", p.TailLength);
}
}
static void DoDogStuff(Dog d) {
if (d != null)
{
Image1.src = d.Image;
}
}
class Animal {
public String Name { get; set; }
}
class Pig : Animal{
public int TailLength { get; set; }
public Pig(int tailLength)
{
Name = "Mr Pig";
TailLength = tailLength;
}
}
class Dog : Animal {
public String Image { get; set; }
public Dog(String image)
{
Name = "Mr Dog";
Image = image;
}
} | 0 | [
2,
272,
5910,
125,
6146,
68,
76,
8728,
20,
17,
6573,
800,
3726,
3726,
13,
1409,
403,
80,
21,
574,
161,
16,
8728,
21,
968,
16,
1000,
718,
20,
21,
13,
5661,
89,
119,
125,
6146,
68,
13,
62,
9,
263,
45,
1409,
12038,
11364,
407,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Why doesn't C++ have a garbage collector?
===
I'm not asking this question because of the merits of garbage collection first of all. My main reason for asking this is that I do know that Bjarne Stroustrup has said that C++ will have a garbage collector at some point in time.
With that said, why hasn't it been added? There are already some garbage collectors for C++. Is this just one of those "easier said than done" type things? Or are there other reasons it hasn't been added (and won't be added in C++0x)?
Cross links:
- [Garbage collectors for C++][1]
[1]: http://stackoverflow.com/questions/81062/garbage-collectors-for-c | 0 | [
2,
483,
1437,
22,
38,
272,
20512,
57,
21,
15024,
10836,
60,
800,
3726,
3726,
31,
22,
79,
52,
3379,
48,
1301,
185,
16,
14,
5848,
18,
16,
15024,
1206,
64,
16,
65,
9,
51,
407,
1215,
26,
3379,
48,
25,
30,
31,
107,
143,
30,
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... |
Easy way to scroll overflow text on a button?
===
Does anyone have any examples or resources where i might find information on scrolling text which is too long to display in a button control? I'm thinking something along these lines.
- Display as much text will fit within the current rect with a '...' at the end to signify overflow.
- Pause for say 1 second then slowly scroll the text to the right edge displaying the right part of the string.
- Display as much text will fit within the current rect with a '...' at the beginning to signify overflow.
- Start the whole thing over in reverse.
Is there an easy way to do this using the "core" or built in "animation" frameworks on a certain mobile device?
| 0 | [
2,
2010,
161,
20,
12159,
20285,
1854,
27,
21,
5167,
60,
800,
3726,
3726,
630,
1276,
57,
186,
3770,
54,
2566,
113,
31,
530,
477,
676,
27,
13,
28166,
1854,
56,
25,
266,
175,
20,
3042,
19,
21,
5167,
569,
60,
31,
22,
79,
1440,
301... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
SMS + Web app: Providers of SMS "Long codes" for use by U.S. carrier subscribers within U.S.?
===
Q.: How to get a cellular phone SMS "Long code" for use by U.S. carrier subscribers within U.S.?
Background: I'm building a web app that receives queries from/sends answers to cell phones. The app design (and business model) expects to communicate with cell devices via SMS, addressing the web app via an SMS "Long code" (VMN or MSISDN). The mobile phone subscribers will be sending/receiving within the U.S. and using U.S. carriers. Long codes are not available within the U.S. cellular services. | 0 | [
2,
7613,
18,
2754,
2741,
4865,
45,
13488,
16,
7613,
18,
13,
7,
2701,
11358,
7,
26,
275,
34,
287,
9,
18,
9,
5812,
19549,
363,
287,
9,
18,
9,
60,
800,
3726,
3726,
2593,
9,
45,
184,
20,
164,
21,
14844,
1132,
7613,
18,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 benefit of global resource URIs?
===
What is the benefit of referencing resources using globally-unique URIs (as REST does) versus using a proprietary id format?
For example:
1. http://host.com/student/5
2. http://host.com/student?id=5
What is the practical benefit of the first approach over the second? In the first, the resource has a unique URI. In the second, the resource id is simply "5". | 0 | [
2,
98,
25,
14,
4234,
16,
2062,
6577,
13,
3594,
18,
60,
800,
3726,
3726,
98,
25,
14,
4234,
16,
13,
29254,
2566,
568,
18861,
8,
1020,
5312,
13,
3594,
18,
13,
5,
472,
760,
630,
6,
5706,
568,
21,
18856,
4924,
2595,
60,
26,
823,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
x86 Assembly - 'testl' eax against eax?
===
I am trying to understand some assembly.
Assembly as follows, I am interested in the testl line:
000319df 8b4508 movl 0x08(%ebp),%eax
000319e2 8b4004 movl 0x04(%eax),%eax
000319e5 85c0 testl %eax,%eax
000319e7 7407 je 0x000319f0
I am trying to understand that point of 'testl' between %eax and %eax? I think the specifics of what this code isn't important, I am just trying to understand the test with itself - wouldn't the value always be true?
Thanks! | 0 | [
2,
993,
3274,
1475,
13,
8,
13,
22,
10543,
255,
22,
13,
62,
7522,
149,
13,
62,
7522,
60,
800,
3726,
3726,
31,
589,
749,
20,
1369,
109,
1475,
9,
1475,
28,
2415,
15,
31,
589,
3158,
19,
14,
1289,
255,
293,
45,
13,
3993,
24178,
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... |
What is a good, simple way to compute ISO 8601 week number?
===
Suppose I have a date, i.e. year, month and day, as integers. What's a good (correct), concise and fairly readable algorithm for computing the ISO 8601 week number of the week the given date falls into? I have come across some truly horrendous code that makes me think surely there must be a better way.
I'm looking to do this in Java but psuedocode for any kind of object-oriented language is fine. | 0 | [
2,
98,
25,
21,
254,
15,
1935,
161,
20,
23909,
11899,
469,
24955,
877,
234,
60,
800,
3726,
3726,
5787,
31,
57,
21,
1231,
15,
31,
9,
62,
9,
159,
15,
1617,
17,
208,
15,
28,
13820,
18,
9,
98,
22,
18,
21,
254,
13,
5,
25345,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 i convert my java program to an exe file ?
===
if i have java file or class file (*.class) , how can i convert it to an exe file ?
and i need also an installer for my program .
are there is an open source program can do that ? | 0 | [
2,
184,
92,
31,
8406,
51,
8247,
625,
20,
40,
1396,
62,
3893,
13,
60,
800,
3726,
3726,
100,
31,
57,
8247,
3893,
54,
718,
3893,
13,
5,
2483,
9,
1898,
6,
13,
15,
184,
92,
31,
8406,
32,
20,
40,
1396,
62,
3893,
13,
60,
17,
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... |
Low Friction Minimal Requirements Gathering
===
How can our team gather requirements from our "Product Owner" in as low friction yet useable of a way as possible?
Now here's the guidelines- No posts that it can't be done or that the business needs to make a decision that it cares about quality, yada yada. The product I work for is a small group that has been successful for years. I just want to help them step it up a notch.
Basically, I'm on a 6 or 7 person team with one Product Owner. She does a great job but is juggling a few different roles (as I believe is common on extremely small teams). Usually requirements are given at sporadic times (email convos, face to face discussions, meetings, etc). They are never entered into a system and sometimes this results in features missing a release or the release getting pushed back since everyone forgot about the necessary feature.
If you're in a similar situation but you found a way to overcome this, I'd love to hear it. I'm happy to write code to help ease this situation but it can't be a web site that the Product Owner has to go to in order to get anything done. She is extremely busy and we need some way of working together as a team in order to gather these requirements.
I'm currently thinking of something like this: Developers and team members gather requirements discussed in face to face meetings and write some quick notes on the features discussed on a wiki page. Product owner is notified whenever these pages are updated and it then becomes her responsibility to ensure accuracy.
Pros: We'll have some record of the features. Cons: The developers are taking responsibility for something that they ordinarily wouldn't. I'm okay with that here. I think in this situation it's teamwork.
Of course once we do this, then we're going to see that the product owner probably doesn't have enough time to ensure feature accuracy. Ultimately she is overburdened and I think this will help showcase that fact, but I just need to be able to draw attention to that first.
So any suggestions?
P.S. her time is extremely limited so it is considered unreasonable to expect her to need to type in the requirements after discussion. She only has time to discuss them once and move on. | 0 | [
2,
708,
16156,
8663,
4786,
5822,
800,
3726,
3726,
184,
92,
318,
173,
7442,
4786,
37,
318,
13,
7,
14086,
2410,
7,
19,
28,
708,
16156,
768,
275,
579,
16,
21,
161,
28,
938,
60,
130,
235,
22,
18,
14,
12629,
8,
90,
9868,
30,
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... |
RoR + SMS: Rails web app architecture to send/receive SMS?
===
Q.: What web app architecture works well receiving/sending SMS text messages? By "architecture, I mean specific architecture, not generally, such as MVC.
Background: I'm building a web app that receives queries from/sends answers to cell phones. The app design (and business model) expects to communicate with cell devices via SMS text messages. IOW: There is no MVC web page "view". The cell phone screen is effectively the "view".
| 0 | [
2,
761,
248,
2754,
7613,
18,
45,
2240,
18,
2741,
4865,
2607,
20,
2660,
118,
99,
1105,
1284,
7613,
18,
60,
800,
3726,
3726,
2593,
9,
45,
98,
2741,
4865,
2607,
693,
134,
3396,
118,
18,
7601,
7613,
18,
1854,
7561,
60,
34,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Why do we need anything more than HTTP GET, POST, HEAD?
===
What is the practical benefit of using HTTP GET, PUT, DELETE, POST, HEAD? Why not focus on their behavioral benefits (safety and idempotency), forgetting their names, and use GET or POST depending on which behavior we want? | 0 | [
2,
483,
107,
95,
376,
602,
91,
119,
7775,
164,
15,
678,
15,
157,
60,
800,
3726,
3726,
98,
25,
14,
5713,
4234,
16,
568,
7775,
164,
15,
442,
15,
27448,
15,
678,
15,
157,
60,
483,
52,
1776,
27,
66,
16276,
5800,
13,
5,
18166,
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... |
Transactions in REST?
===
I'm wondering how you'd implement the following use-case in REST. Is it even possible to do without compromising the conceptual model?
Read or update multiple resources within the scope of a single transaction. For example, transfer $100 from Bob's bank account into John's account.
As far as I can tell, the only way to implement this is by cheating. You could POST to the resource associated with either John or Bob and carry out the entire operation using a single transaction. As far as I'm concerned this breaks the REST architecture because you're essentially tunneling an RPC call through POST instead of really operating on individual resources. | 0 | [
2,
13147,
19,
760,
60,
800,
3726,
3726,
31,
22,
79,
5712,
184,
42,
22,
43,
8713,
14,
249,
275,
8,
10325,
19,
760,
9,
25,
32,
166,
938,
20,
107,
366,
6479,
8541,
7552,
14,
14425,
1061,
60,
1302,
54,
11100,
1886,
2566,
363,
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... |
Hiding table rows without resizing overall width...
===
Is there a way to hide table rows without affecting the overall table width? I've got some javascript that shows/hides some table rows, but when the rows are set to "display: none;" the table with shringk to fit the contents of the visible rows. | 0 | [
2,
5314,
859,
11295,
366,
10719,
3335,
1677,
9456,
9,
9,
9,
800,
3726,
3726,
25,
80,
21,
161,
20,
3077,
859,
11295,
366,
13808,
14,
1677,
859,
9456,
60,
31,
22,
195,
330,
109,
8247,
8741,
30,
1285,
118,
19522,
18,
109,
859,
1129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Reseed Identity Column TSql table variable
===
I have a TSql table variable which has an auto increment identity column. I want to clear all data from this variable and reset the identity column value to 1. How can this be done? | 0 | [
2,
302,
870,
69,
3270,
4698,
13,
38,
18,
22402,
859,
7612,
800,
3726,
3726,
31,
57,
21,
13,
38,
18,
22402,
859,
7612,
56,
63,
40,
3108,
13,
28461,
3270,
4698,
9,
31,
259,
20,
1207,
65,
1054,
37,
48,
7612,
17,
23422,
14,
3270,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
How can I remotely (via web services) determine date format of SharePoint 2003 site, for use in Versions.asmx returned XML?
===
The GetVersions() call to the Versions.asmx web service in SharePoint 2003 returns a localised date format, with no way of determining what the format is. I'm assuming it's the site regional setting of date format, but I can't find a way to get even that out of SharePoint 2003. Locally, it looks like SPRegionalSettings can be used (http://msdn.microsoft.com/en-us/library/microsoft.sharepoint.spregionalsettings.aspx) but what about a web service version of this? | 0 | [
2,
184,
92,
31,
23288,
13,
5,
5034,
2741,
687,
6,
3746,
1231,
2595,
16,
1891,
3132,
973,
689,
15,
26,
275,
19,
3281,
9,
472,
79,
396,
587,
23504,
60,
800,
3726,
3726,
14,
164,
10898,
18,
5,
6,
645,
20,
14,
3281,
9,
472,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 I have non-measure codes mixed with measures in my fact table?
===
We're doing a complex bit of data accumulation. Our customer sends us some stuff that includes two dimensions (time and a business unit). Time is mostly year-month. The business unit dimension has just a few attributes: a name, and a few categories to which BU's can belong for reporting and analysis purposes.
The stuff they send us includes some current state information (dates and codes). These seem fact-like. They also send some information that characterizes the relationship with the business unit (mostly additional codes). Again, these are unique to the business unit and time period.
Finally, they send us stuff that is clearly additive facts. It includes currency and counts that have proper units.
Should I commingle this qualitative information along with the additive facts? Or should I separate the qualitative stuff (which can only be used with counts) from the quantitative stuff (which can be used with sum)? | 0 | [
2,
92,
31,
57,
538,
8,
24493,
11358,
2198,
29,
4699,
19,
51,
837,
859,
60,
800,
3726,
3726,
95,
22,
99,
845,
21,
1502,
1142,
16,
1054,
21488,
9,
318,
7705,
11350,
182,
109,
3217,
30,
1103,
81,
9913,
13,
5,
891,
17,
21,
508,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
jQuery - Triggering Events from Clicking on a Link Issue
===
I'd like to trigger an event when a link is clicked both by clicking on it normally or by opening it in a new tab (e.g., middle click, ctrl + click, etc)
I've tried the following so far:
$('a').click(myfunc) Doesn't capture middle clicks.
$('a').mousedown(myfunc) works, but it seems to be preventing the link from being followed even though my function doesn't call event.preventDefault.
Any ideas how to do this then? | 0 | [
2,
487,
8190,
93,
13,
8,
7286,
68,
963,
37,
25590,
27,
21,
3508,
1513,
800,
3726,
3726,
31,
22,
43,
101,
20,
7286,
40,
807,
76,
21,
3508,
25,
15802,
156,
34,
25590,
27,
32,
4147,
54,
34,
1214,
32,
19,
21,
78,
6523,
13,
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... |
Easy way to use variables of enum types as string in C?
===
Here's what I am trying to do:
typedef enum { ONE, TWO, THREE } Numbers;
I am trying to write a function that would do a switch case similar to the following:
char num_str[10];
int process_numbers_str(Numbers num) {
switch(num) {
case ONE:
case TWO:
case THREE:
{
strcpy(num_str, num); //some way to get the symbolic constant name in here?
} break;
default:
return 0; //no match
return 1;
}
Instead of defining at every case, is there a way to set it using the enum variable like I am trying to do above?
| 0 | [
2,
2010,
161,
20,
275,
12157,
16,
1957,
723,
2551,
28,
3724,
19,
272,
60,
800,
3726,
3726,
235,
22,
18,
98,
31,
589,
749,
20,
107,
45,
1001,
13862,
1957,
723,
13,
1,
53,
15,
81,
15,
132,
13,
1,
2116,
73,
31,
589,
749,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Multithreaded Memory Allocators for C/C++
===
Hi I currently have heavily multithreaded server application, and I'm shopping around for a good multithreaded memory allocator.
So far I'm torn between:
-Sun's umem
-Google's tcmalloc
-Intel's threading building blocks allocator
-Emery Berger's hoard
From what I've found hoard might be the fastest, but I hadn't heard of it before today, so I'm skeptical if its really as good as it seems. Anyone have personal experience trying out these allocators?
| 0 | [
2,
1889,
96,
10647,
69,
1912,
65,
2499,
9922,
26,
272,
118,
150,
20512,
800,
3726,
3726,
4148,
31,
871,
57,
2991,
1889,
96,
10647,
69,
8128,
3010,
15,
17,
31,
22,
79,
4884,
140,
26,
21,
254,
1889,
96,
10647,
69,
1912,
65,
2499,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
.NET : How to set user information in an EventLog Entry?
===
The System.Diagnostics.EventLog class provides a way to interact with a windows event log. I use it all the time for simple logging...
System.Diagnostics.EventLog.WriteEntry("MyEventSource", "My Special Message")
Is there a way to set the user information in the resulting event log entry using .NET? | 0 | [
2,
13,
9,
2328,
13,
45,
184,
20,
309,
4155,
676,
19,
40,
807,
5567,
2792,
60,
800,
3726,
3726,
14,
329,
9,
4286,
21944,
18,
9,
4943,
38,
5567,
718,
1927,
21,
161,
20,
10001,
29,
21,
1936,
807,
6738,
9,
31,
275,
32,
65,
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... |
MySQL Row Format: Difference between fixed and dynamic?
===
MySQL specifies the row format of a table as either fixed or dynamic, depending on the column data types. If a table has a variable-length column data type, such as TEXT or VARCHAR, the row format is dynamic; otherwise, it's fixed.
My question is, what's the difference between the two row formats? Is one more efficient than the other? | 0 | [
2,
51,
18,
22402,
3131,
2595,
45,
2841,
128,
3535,
17,
7782,
60,
800,
3726,
3726,
51,
18,
22402,
27669,
14,
3131,
2595,
16,
21,
859,
28,
694,
3535,
54,
7782,
15,
4758,
27,
14,
4698,
1054,
2551,
9,
100,
21,
859,
63,
21,
7612,
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... |
ZF2: Zend Framework 2 - how to render output without layout
===
I know that I can use this
public function providerAction()
{
$result = new ViewModel();
$result->setTerminal(true);
return $result;
}
But how do I pass variables to view? Before I did this
return array('items' => $items);
But now I have only one option either return array and then layout is there or return `$result` then variables are not in the view. | 0 | [
2,
2052,
410,
135,
45,
10526,
43,
6596,
172,
13,
8,
184,
20,
16535,
5196,
366,
9106,
800,
3726,
3726,
31,
143,
30,
31,
92,
275,
48,
317,
1990,
11747,
8645,
5,
6,
13,
1,
5579,
29955,
800,
78,
1418,
13998,
5,
6,
73,
5579,
29955,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
right usage of __repr__() in python?
===
I have a container class which I would like to use to print all the elements in it.
I'd like to print them to file or console.
I've laid out the element(patch) and container class as below and __repr__(self).
I'm not sure I understood the purpose of __repr__() and usage here is ok.
class Patch:
def __init__(self, folder_name, file_name):
self.folder_name = folder_name
self.file_name = file_name
self.full_path = os.path.join(self.folder_name, self.file_name)
self.file_hash = md5_for_file(open(self.full_path, 'r'))
self.file_size = os.path.getsize(self.full_path)
def __repr__(self):
return "%s %s %s" % (self.file_name, self.file_hash, self.file_size)
class PatchContainer:
def __init__(self):
self.patch_folder_dict = collections.OrderedDict()
self.patch_file_set = set()
def addPatch(self, patch):
if patch.file_name in self.patch_file_set:
print '*** Delete the file ', patch.full_path, ' ***'
return
self.patch_file_set.add(patch.file_name)
if not patch.folder_name in self.patch_folder_dict:
self.patch_folder_dict[patch.folder_name] = [patch]
else:
self.patch_folder_dict[patch.folder_name].append(patch)
def prettyPrint(self, writeable_object=PATCH_META_FILE):
sys.stdout = writeable_object
for patch_folder in self.patch_folder_dict.keys():
print patch_folder
patch_list = self.patch_folder_dict[patch_folder]
for patch in patch_list:
print patch
sys.stdout = sys.__stdout__
It works as intended but please comment on the style/usuage are fine. | 0 | [
2,
193,
7514,
16,
13,
1,
99,
4899,
1,
5,
6,
19,
20059,
60,
800,
3726,
3726,
31,
57,
21,
12147,
718,
56,
31,
83,
101,
20,
275,
20,
4793,
65,
14,
2065,
19,
32,
9,
31,
22,
43,
101,
20,
4793,
105,
20,
3893,
54,
8650,
9,
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... |
Android Orentation Changes
===
I have a simple activity to make since of screen touches. What is strange is that the activity starts in whatever orientation i'm in but rotating the device does nothing at all.
I am on an Acer A100 running Android 4.0.3
[AndroidManifest.xml][1]
[SingleTouchTest.java][2]
The main activity is a listview that loads my separate system tests. I can run the SingleTouchTest activity without problems except rotation. I have tried every combination of:
`android:configChanges="keyboard|keyboardHidden|orientation" android:screenOrientation="unspecified"`
and it does not auto rotate. I even removed the:
`public void onConfigurationChanged` function and nothing happens.
[1]: http://pastebin.com/A4KDH2e7
[2]: http://pastebin.com/cFx4rqQa | 0 | [
2,
13005,
54,
2291,
857,
1693,
800,
3726,
3726,
31,
57,
21,
1935,
2358,
20,
233,
179,
16,
2324,
13935,
9,
98,
25,
2578,
25,
30,
14,
2358,
3244,
19,
2099,
10245,
31,
22,
79,
19,
47,
16164,
14,
3646,
630,
626,
35,
65,
9,
31,
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... |
Accepting form fields via HTTP Post in WCF
===
I need to accept form data to a WCF-based service. Here's the interface:
[OperationContract]
[WebInvoke(UriTemplate = "lead/inff",
BodyStyle = WebMessageBodyStyle.WrappedRequest)]
int Inff(Stream input);
Here's the implementation (sample - no error handling and other safeguards):
public int Inff(Stream input)
{
StreamReader sr = new StreamReader(input);
string s = sr.ReadToEnd();
sr.Dispose();
NameValueCollection qs = HttpUtility.ParseQueryString(s);
Debug.WriteLine(qs["field1"]);
Debug.WriteLine(qs["field2"]);
return 0;
}
Assuming WCF, is there a better way to accomplish this besides parsing the incoming stream?
| 0 | [
2,
10894,
505,
2861,
1197,
7775,
678,
19,
11801,
410,
800,
3726,
3726,
31,
376,
20,
3440,
505,
1054,
20,
21,
11801,
410,
8,
1281,
365,
9,
235,
22,
18,
14,
6573,
45,
636,
11377,
23311,
500,
636,
14113,
108,
2625,
1048,
5,
3594,
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... |
Visual Studio 6 tips and tricks
===
Some of us would invariably have to support 'legacy' code using Microsoft's Visual Studio 6.0 IDEs which - although opinions would differ - are generally regarded to be less user friendly compared to the later incarnations of the Visual Studio series of IDEs.
So I'd like to hear about some of your favourite hidden/poorly documented IDE features (could be for either C++ or VB). As is the usual practice one feature per post, please. | 4 | [
2,
3458,
1120,
400,
11034,
17,
13747,
800,
3726,
3726,
109,
16,
182,
83,
27913,
57,
20,
555,
13,
22,
6727,
12852,
22,
1797,
568,
7099,
22,
18,
3458,
1120,
400,
9,
387,
13,
8153,
56,
13,
8,
419,
11900,
83,
11394,
13,
8,
50,
146... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Converting Win16 code to Win32
===
In general, what needs to be done to convert a 16 bit Windows program to Win32? I'm sure I'm not the only person to inherit a codebase and be stunned to find 16-bit code lurking in the corners.
The code in question is C. | 0 | [
2,
19583,
628,
1091,
1797,
20,
628,
3125,
800,
3726,
3726,
19,
297,
15,
98,
2274,
20,
44,
677,
20,
8406,
21,
347,
1142,
1936,
625,
20,
628,
3125,
60,
31,
22,
79,
562,
31,
22,
79,
52,
14,
104,
840,
20,
17569,
21,
1797,
8436,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 save an encrypted string to the database?
===
I have this function in VB.net "ENCRYPT" (see below)
Private key() As Byte = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}
Private iv() As Byte = {65, 110, 68, 26, 69, 178, 200, 219}
Public Function Encrypt(ByVal plainText As String) As Byte()
' Declare a UTF8Encoding object so we may use the GetByte
' method to transform the plainText into a Byte array.
Dim utf8encoder As UTF8Encoding = New UTF8Encoding()
Dim inputInBytes() As Byte = utf8encoder.GetBytes(plainText)
' Create a new TripleDES service provider
Dim tdesProvider As TripleDESCryptoServiceProvider = New TripleDESCryptoServiceProvider()
' The ICryptTransform interface uses the TripleDES
' crypt provider along with encryption key and init vector
' information
Dim cryptoTransform As ICryptoTransform = tdesProvider.CreateEncryptor(Me.key, Me.iv)
' All cryptographic functions need a stream to output the
' encrypted information. Here we declare a memory stream
' for this purpose.
Dim encryptedStream As MemoryStream = New MemoryStream()
Dim cryptStream As CryptoStream = New CryptoStream(encryptedStream, cryptoTransform, CryptoStreamMode.Write)
' Write the encrypted information to the stream. Flush the information
' when done to ensure everything is out of the buffer.
cryptStream.Write(inputInBytes, 0, inputInBytes.Length)
cryptStream.FlushFinalBlock()
encryptedStream.Position = 0
' Read the stream back into a Byte array and return it to the calling
' method.
Dim result(encryptedStream.Length - 1) As Byte
encryptedStream.Read(result, 0, encryptedStream.Length)
cryptStream.Close()
Return result
End Function
I want to save the encrypted string in the SQL database. How do I do it? | 0 | [
2,
184,
20,
2079,
40,
29403,
3724,
20,
14,
6018,
60,
800,
3726,
3726,
31,
57,
48,
1990,
19,
13,
20468,
9,
2328,
13,
7,
219,
11435,
7,
13,
5,
1798,
1021,
6,
932,
1246,
5,
6,
28,
34,
591,
800,
13,
1,
165,
15,
172,
15,
203,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 best way to test a stored procedure?
===
Like many companies that require all access be through stored procedureswe seem to have a lot of business logic locked away in sprocs. These things are just plain hard to test, and some of them have become silly long. Does anyone out there have a set of best practices that can make it a little easier to confidently test these things?
At present we maintain 30 or so "Problem" databases that we run against. This isn't always particularly well documented and it sure isn't automated. | 0 | [
2,
98,
25,
14,
246,
161,
20,
1289,
21,
8214,
7004,
60,
800,
3726,
3726,
101,
151,
1532,
30,
4077,
65,
1381,
44,
120,
8214,
8876,
458,
2260,
20,
57,
21,
865,
16,
508,
7085,
4011,
229,
19,
13,
18,
15617,
18,
9,
158,
564,
50,
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... |
Totaling a GridView in ASP.NET
===
In one of my ASP.NET Web Applications, I am using a [BulkEditGridView][1] (a GridView which allows all rows to be edited at the same time) to implement an order form. In my grid, I have a column which calculates the total for each item (cost x quantity) and a grand total field at the bottom of the page. Currently, however, these fields are only refreshed on every post-back. I need to have these fields updated dynamically so that as users change quantities, the totals and grand total update to reflect the new values. I have attempted to use AJAX solutions to accomplish this, but the asynchronous post-backs interfere with the focus on the page. I imagine that a purely client-side solution exists, and I'm hopeful that someone in the community can share.
[1]: http://blogs.msdn.com/mattdotson/articles/490868.aspx | 0 | [
2,
600,
68,
21,
7354,
4725,
19,
28,
306,
9,
2328,
800,
3726,
3726,
19,
53,
16,
51,
28,
306,
9,
2328,
2741,
3767,
15,
31,
589,
568,
21,
636,
9077,
4616,
242,
16375,
4725,
500,
2558,
165,
500,
13,
5,
58,
7354,
4725,
56,
2965,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 does this C++ function use memoization?
===
#include <vector>
std::vector<long int> as;
long int a(size_t n){
if(n==1) return 1;
if(n==2) return -2;
if(as.size()<n+1)
as.resize(n+1);
if(as[n]<=0)
{
as[n]=-4*a(n-1)-4*a(n-2);
}
return mod(as[n], 65535);
}
The above code sample using memoization to calculate a recursive formula based on some input n. I know that this uses memoization, because I have written a purely recursive function that uses the same formula, but this one much, much faster for much larger values of n. I've never used vectors before, but I've done some research and I understand the concept of them. I understand that memoization is supposed to store each calculated value, so that instead of performing the same calculations over again, it can simply retrieve ones that have already been calculated.
My question is: how is this memoization, and how does it work? I can't seem to see in the code at which point it checks to see if a value for n already exists. Also, I don't understand the purpose of the if(as[n]<=0). This formula can yield positive and negative values, so I'm not sure what this check is looking for. | 0 | [
2,
184,
630,
48,
272,
20512,
1990,
275,
22236,
1829,
60,
800,
3726,
3726,
6926,
22640,
13,
1,
28033,
1,
354,
43,
45,
45,
28033,
1,
2701,
19,
38,
1,
28,
73,
175,
19,
38,
21,
5,
10454,
1,
38,
13,
103,
6,
1,
100,
5,
103,
3726... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Database under source control again!
===
We use MS SQL Server and C#. Our database is under sourse control and I will tell you some details of our implementation. We had implemented two operations:
1. Export database to plain-text files. Database schema files:
tables.sql
relationships.sql
views.sql
...
and table contents files:
Data/table1.txt
Data/table2.txt
...
It is easy to review database changes using source control logs because all these files has plain-text format.
Imlementation is based on classes from namespace Microsoft.SqlServer.Management.Smo.
2. Import database from this plain-text files. Implementation is strightforward - just execute sql statements from *.sql files, and then execute a bunch of inserts.
So we have two bat-files: create-test-databse.bat and export-test-database.bat. When a developer needs a new test database he just executes the bat-file and waits for a minute.
Every functional test, which needs a database creates a new database, uses it, and then kills it. But I should say that it is not very fast operation. :(
So what instruments do YOU use to put your database under source control?
I mean how do you implement operations "create test database" and "export test database" for example? | 0 | [
2,
6018,
131,
1267,
569,
188,
187,
800,
3726,
3726,
95,
275,
4235,
4444,
255,
8128,
17,
272,
5910,
9,
318,
6018,
25,
131,
12642,
870,
569,
17,
31,
129,
494,
42,
109,
3289,
16,
318,
6123,
9,
95,
41,
6807,
81,
1311,
45,
137,
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... |
Options for refactoring bits of code away from native C++?
===
So, one commonly heard comment when talking about performance is that you write your code with whatever language gets the job done fastest. If performance in specific areas is a problem, then rewrite those bits in C/C++.
But, what if you're starting with a native C++ app? What options do you have if you want to write the easy bits, or refactor the old bits, in a language like Python, Ruby, C#, or whatever? Keep in mind that transferring data between the native and other sides is a must. Being able to simply call a function written in an "easier" language, while passing C++ classes as data, would be beautiful.
We've got a crusty Win32 app that would benefit greatly if we could crank out new code, or refactor old code, in C# or something. Very little of it requires the complexity of C++, and dealing with the little fiddly bits is dragging down the programming process. | 0 | [
2,
6368,
26,
302,
17455,
68,
10181,
16,
1797,
229,
37,
1275,
272,
20512,
60,
800,
3726,
3726,
86,
15,
53,
2524,
752,
6484,
76,
1582,
88,
956,
25,
30,
42,
2757,
154,
1797,
29,
2099,
816,
3049,
14,
1205,
677,
7518,
9,
100,
956,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Using boost::random as the RNG for std::random_shuffle
===
I have a program that uses the mt19937 random number generator from boost::random. I need to do a random_shuffle and want the random numbers generated for this to be from this shared state so that they can be deterministic with respect to the mersenne twister's previously generated numbers.
I tried something like this:
<pre><code>
void foo(std::vector<unsigned> &vec, boost::mt19937 &state)
{
struct bar {
boost::mt19937 &_state;
unsigned operator()(unsigned i) {
boost::uniform_int<> rng(0, i - 1);
return rng(_state);
}
bar(boost::mt19937 &state) : _state(state) {}
} rand(state);
std::random_shuffle(vec.begin(), vec.end(), rand);
}
</code></pre>
But i get a template error calling random_shuffle with rand. However this works:
<pre><code>
unsigned bar(unsigned i)
{
boost::mt19937 no_state;
boost::uniform_int<> rng(0, i - 1);
return rng(no_state);
}
void foo(std::vector<unsigned> &vec, boost::mt19937 &state)
{
std::random_shuffle(vec.begin(), vec.end(), bar);
}
</code></pre>
Probably because it is an actual function call. But obviously this doesn't keep the state from the original mersenne twister. What gives? Is there any way to do what I'm trying to do without global variables? | 0 | [
2,
568,
10419,
45,
45,
2195,
5555,
28,
14,
761,
2723,
26,
354,
43,
45,
45,
2195,
5555,
1,
1635,
5386,
413,
800,
3726,
3726,
31,
57,
21,
625,
30,
2027,
14,
8651,
4990,
465,
5477,
234,
15286,
37,
10419,
45,
45,
2195,
5555,
9,
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... |
Performance challenge: NAL Unit Wrapping
===
From what I've seen in the past, StackOverflow seems to like programming challenges, such as the [fast char to string exercise problem][1] which got dozens of responses. This is an optimization challenge: take a very simple function and see if you can come up with a smarter way of doing it.
I've had a function that I've wanted to further optimize for quite some time but I always find that my optimizations have some hole that result in incorrect output--some rare special case in which they fail. But, given the function, I've always figured one should be able to do better than this.
The function takes an input datastream (effectively random bits, from an entropy perspective) and wraps it into a NAL unit. This involves placing escape codes: any byte sequence of 00 00 00, 00 00 01, 00 00 02, or 00 00 03 gets replaced with 00 00 03 XX, where XX is that last byte of the original sequence. As one can guess, these only get placed about 1 in every 4 million bytes of input, given the odds against such a sequence--so this is a challenge where one is **searching an enormous amount of data and doing almost nothing to it** except in very rare cases. However, because "doing something" involves *inserting bytes*, it makes things a bit trickier. The current unoptimized code is the following C:
src and dst are pointers to arrays of bytes, and end is the pointer to the end of the input data.
int i_count = 0;
while( src < end )
{
if( i_count == 2 && *src <= 0x03 )
{
*dst++ = 0x03;
i_count = 0;
}
if( *src == 0 )
i_count++;
else
i_count = 0;
*dst++ = *src++;
}
Common input sizes to this function range from roughly between 1000 and 1000000 bytes of data.
Initial ideas of mine include a function which (somehow) quickly searches the input for situations where an escape code is needed, to avoid more complex logic in the vast majority of inputs where escape codes don't need to be placed.
[1]: http://stackoverflow.com/questions/69115/char-to-hex-string-exercise
----------
| 0 | [
2,
956,
2404,
45,
13,
5025,
1237,
13437,
800,
3726,
3726,
37,
98,
31,
22,
195,
541,
19,
14,
640,
15,
7566,
2549,
9990,
2206,
20,
101,
3143,
7595,
15,
145,
28,
14,
636,
13088,
4892,
20,
3724,
5935,
1448,
500,
2558,
165,
500,
56,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Copy collection items to another collection in .NET
===
In .NET (VB), how can I take all of the items in one collection, and add them to a second collection? I'm looking for something a little more efficient than this:
For Each item As Host In hostCollection1
hostCollection2.Add(item)
Next | 0 | [
2,
4344,
1206,
3755,
20,
226,
1206,
19,
13,
9,
2328,
800,
3726,
3726,
19,
13,
9,
2328,
13,
5,
20468,
6,
15,
184,
92,
31,
247,
65,
16,
14,
3755,
19,
53,
1206,
15,
17,
3547,
105,
20,
21,
153,
1206,
60,
31,
22,
79,
699,
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,
1,
1... |
What is the best way to set-up authentication in a tomcat webapp?
===
I have a self built JSP webapp and at the moment I'm using tomcats built in admin pannel to manage user accounts (that are stored in tomcats config xml files) but this is limited because i can not create new accounts from within the web-app (eg. I can not have a sign up website) and need to manually create the accounts.
What is the most straight forward way of implementing accounts in a tomcat environment?
dennis | 0 | [
2,
98,
25,
14,
246,
161,
20,
309,
8,
576,
27963,
19,
21,
2067,
5782,
2741,
7753,
60,
800,
3726,
3726,
31,
57,
21,
1119,
392,
487,
3401,
2741,
7753,
17,
35,
14,
688,
31,
22,
79,
568,
2067,
14626,
392,
19,
21,
43,
2160,
1809,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Difflib.SequenceMatcher isjunk optional parameter query: how to ignore whitespaces, tabs, empty lines?
===
I am trying to use Difflib.SequenceMatcher to compute the similarities between two files. These two files are almost identical except that one contains some extra whitespaces, empty lines and other doesn't. I am trying to use
s=difflib.SequenceMatcher(isjunk,text1,text2)
ratio =s.ratio()
for this purpose.
So, the question is how to write the lambda expression for this isjunk method so the SequenceMatcher method will discount all the whitespaces, empty lines etc. I tried to use the parameter lambda x: x==" ", but the result isn't as great. For two closely similar text, the ratio is very low. This is highly counter intuitive.
For testing purpose, here are the two strings that you can use on testing:
> What Motivates jwovu to do your Job
> Well? OK, this is an entry trying to
> win $100 worth of software development
> books despite the fact that I don‘t
> read
>
> programming books. In order to win the
> prize you have to write an entry and
> what motivatesfggmum to do your job
> well. Hence this post. First
> motivation
>
> money. I know, this doesn‘t sound like
> a great inspiration to many, and
> saying that money is one of the
> motivation factors might just blow my
> chances away.
>
> As if money is a taboo in programming
> world. I know there are people who
> can‘t be motivated by money. Mme, on
> the other hand, am living in a real
> world,
>
> with house mortgage to pay, myself to
> feed and bills to cover. So I can‘t
> really exclude money from my
> consideration. If I can get a large
> sum of money for
>
> doing a good job, then definitely
> boost my morale. I won‘t care whether
> I am using an old workstation, or
> forced to share rooms or cubicle with
> other
>
> people, or have to put up with an
> annoying boss, or whatever. The fact
> that at the end of the day I will walk
> off with a large pile of money itself
> is enough
>
> for me to overcome all the obstacles,
> put up with all the hard feelings and
> hurt egos, tolerate a slow computer
> and even endure
And here's another string
> What Motivates You to do your Job
> Well? OK, this is an entry trying to
> win $100 worth of software development
> books, despite the fact that I don't
> read programming books. In order to
> win the prize you have to write an
> entry and describes what motivates you
> to do your job well. Hence this post.
>
> First motivation, money. I know, this
> doesn't sound like a great inspiration
> to many, and saying that money is one
> of the motivation factors might just
> blow my chances away. As if money is a
> taboo in programming world. I know
> there are people who can't be
> motivated by money. Kudos to them. Me,
> on the other hand, am living in a real
> world, with house mortgage to pay,
> myself to feed and bills to cover. So
> I can't really exclude money from my
> consideration.
>
> If I can get a large sum of money for
> doing a good job, then thatwill
> definitely boost my morale. I won't
> care whether I am using an old
> workstation, or forced to share rooms
> or cubicle with other people, or have
> to put up with an annoying boss, or
> whatever. The fact that at the end of
> the day I will walk off with a large
> pile of money itself is enough for me
> to overcome all the obstacles, put up
> with all the hard feelings and hurt
> egos, tolerate a slow computer and
> even endure
I ran the above command, and set the isjunk to lambda x:x==" ", the ratio is only 0.36.
| 0 | [
2,
20811,
8326,
9,
29413,
12280,
106,
25,
8753,
197,
12832,
18906,
25597,
45,
184,
20,
7174,
359,
5582,
18,
15,
6523,
18,
15,
2424,
1560,
60,
800,
3726,
3726,
31,
589,
749,
20,
275,
20811,
8326,
9,
29413,
12280,
106,
20,
23909,
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... |
Minimum developer computer requierments?
===
What is the minimum development system you would (depending on who you are):
- expect your employer to provide you with
- provide your employees
- buy for your self
I'm not talking dream systems. Just what is needed to stay off [TDWTF][1]?
[1]: http://thedailywtf.com/ | 0 | [
2,
5187,
10058,
1428,
302,
23749,
6601,
60,
800,
3726,
3726,
98,
25,
14,
5187,
522,
329,
42,
83,
13,
5,
19038,
68,
27,
72,
42,
50,
6,
45,
13,
8,
4186,
154,
11726,
20,
1181,
42,
29,
13,
8,
1181,
154,
3716,
13,
8,
3034,
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,
1,
1... |
Writing Color Calibration Data to a TIFF or PNG file
===
My custom homebrew photography processing software, running on 64 bit Linux/GNU, writes out PNG and TIFF files. These are to be sent to a quality printing shop to be made into fine art. Working with interior designers - it's important to get the colors just right!
The print shops usually have no trouble with TIFF and PNGs made from commercial software such as Photoshop. Even though i have the TIFF 6.0 specs, PNG specs, and other info in hand, it is not clear how to include color calibration data or implement color management system on linux. My files are often rejected as faulty, without sufficient error reports to make fixes.
This has been a nasty problem for a while for many. Even my contacts at the Hollywood postproduction studios are struggling with this issue. One studio even wanted to hire me to take care of their color calibration, thinking i was the expert - but no, i am just as blind and lost as everyone!
Does anyone know of good code examples, detailed technical information, or have any other enlightenment? Or time to switch to pure Apple?
| 0 | [
2,
1174,
1665,
10352,
220,
5946,
1054,
20,
21,
13,
38,
6021,
54,
351,
2723,
3893,
800,
3726,
3726,
51,
5816,
213,
13712,
4691,
5511,
2306,
15,
946,
27,
4384,
1142,
13024,
118,
263,
4215,
15,
6215,
70,
351,
2723,
17,
13,
38,
6021,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 are valid characters for creating a multipart form boundary?
===
In an HTML form post what are valid characters for creating a multipart boundary?
| 0 | [
2,
98,
50,
7394,
1766,
26,
2936,
21,
1889,
3091,
505,
5067,
60,
800,
3726,
3726,
19,
40,
13,
15895,
505,
678,
98,
50,
7394,
1766,
26,
2936,
21,
1889,
3091,
5067,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why is using a wild card with a java import statement bad?
===
It is much more convenient and cleaner to use a single statement like
import java.awt.*;
then to import a bunch of individual classes
import java.awt.Panel;
import java.awt.Graphics;
import java.awt.Canvas;
...
What is wrong with using a wild card in the import statement? | 0 | [
2,
483,
25,
568,
21,
1808,
2056,
29,
21,
8247,
9010,
3331,
896,
60,
800,
3726,
3726,
32,
25,
212,
91,
12845,
17,
19585,
20,
275,
21,
345,
3331,
101,
9010,
8247,
9,
3885,
38,
9,
2483,
73,
94,
20,
9010,
21,
7653,
16,
1359,
2684,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
ASP.NET 3.5: GetCallbackEventReference doesn't work synchronously
===
I have an ASP.NET 3.5 WebForm that leverages the frameworks Page.ClientScript.GetCallbackEventReference() method and I'd like some of the calls to be synchronous.
Now, the documentation says that the 5th parameter (see below) controls this. Specifically, when you pass 'false' it's supposed to be a non-asynchronous call. However, regardless if it's true or false, it still processes the call asynchronously.
Page.ClientScript.GetCallbackEventReference(this, "arg", "ReceiveServerData", "context",false);
Is there a work-around for this or perhaps I'm doing something wrong? Thanks in advance for the assistance!
| 0 | [
2,
28,
306,
9,
2328,
203,
9,
264,
45,
164,
9200,
1958,
4943,
38,
28018,
1437,
22,
38,
170,
13,
16023,
13985,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
203,
9,
264,
2741,
4190,
30,
19414,
18,
14,
6596,
18,
2478,
9,
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... |
Proper build reports in TFS with multiple products under a project
===
Underneath one "Project" in TFS we have multiple products. This is because for us, a project is a business unit and they each can have many applications that we develop for them. Each one has its own folder in source control(under the TFS project) and each one has its own TeamBuild set up. The issue I have is that whenever a build runs, the report generated for it contains a listing of all the changesets that were associated to the TFS Project; even though many of them were for a different product and the code referenced actually wasn't compiled or built during that build.
Does anyone know how to get TFS to only include changesets in its report that are associated to the actual VisualStudio projects that are being built in TeamBuild? | 0 | [
2,
4119,
1895,
2813,
19,
13,
11720,
18,
29,
1886,
1985,
131,
21,
669,
800,
3726,
3726,
7170,
53,
13,
7,
21011,
7,
19,
13,
11720,
18,
95,
57,
1886,
1985,
9,
48,
25,
185,
26,
182,
15,
21,
669,
25,
21,
508,
1237,
17,
59,
206,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 .cvsignore file for a Visual C#.NET solution?
===
I've developed a Visual C#.NET 2008 Express Edition solution containing three projects. I am cleaning it up to commit it into a CVS repository.
There are several files that are created during the build process that are not necessary to be placed in the repository since they will be regenerated automatically.
The question: Can anyone suggest a list of patterns to be placed into a .cvsignore file so that these generated files and folders are ignored?
Thanks in advance! | 0 | [
2,
92,
42,
12360,
21,
13,
9,
12732,
11255,
5377,
3893,
26,
21,
3458,
272,
5910,
9,
2328,
4295,
60,
800,
3726,
3726,
31,
22,
195,
885,
21,
3458,
272,
5910,
9,
2328,
570,
2999,
1322,
4295,
3503,
132,
2314,
9,
31,
589,
9724,
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... |
When memory is allocated for a program?
===
I need to know when the memory will be allocated for a particular program. How can i view where the memory is allocated. | 0 | [
2,
76,
1912,
25,
11685,
26,
21,
625,
60,
800,
3726,
3726,
31,
376,
20,
143,
76,
14,
1912,
129,
44,
11685,
26,
21,
1498,
625,
9,
184,
92,
31,
1418,
113,
14,
1912,
25,
11685,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why should the inteface for a java class be perferred?
===
PMD would report a violation for
ArrayList<Object> list = new ArrayList<Object>();
The violation was "Avoid using implementation types like 'ArrayList'; use the interface instead".
The following line would correct the violation
List<Object> list = new ArrayList<Object>();
Why should the latter with List be used instead of ArrayList? | 0 | [
2,
483,
378,
14,
19,
591,
6413,
26,
21,
8247,
718,
44,
416,
2407,
2095,
60,
800,
3726,
3726,
6736,
43,
83,
1330,
21,
12120,
26,
7718,
5739,
1,
23793,
1,
968,
800,
78,
7718,
5739,
1,
23793,
1,
5,
6,
73,
14,
12120,
23,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
xpath query searching text
===
Give the following XML structure
<html>
<body>
<div>
<span>Test: Text2</span>
</div>
<div>
<span>Test: Text3</span>
</div>
<div>
<span>Test: Text5</span>
</div>
</body>
</html>
What is the best xpath query to locate any span with text that starts with Test? | 0 | [
2,
993,
8353,
25597,
5792,
1854,
800,
3726,
3726,
590,
14,
249,
23504,
1411,
13,
1,
15895,
1,
13,
1,
9760,
1,
13,
1,
12916,
1,
13,
1,
18,
3206,
1,
10543,
45,
1854,
135,
1,
118,
18,
3206,
1,
13,
1,
118,
12916,
1,
13,
1,
129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 a byte into a string in vb.net?
===
I have the function below ENCRYPT.
Public Function Encrypt(ByVal plainText As String) As Byte()
Dim key() As Byte = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24}
Dim iv() As Byte = {65, 110, 68, 26, 69, 178, 200, 219}
' Declare a UTF8Encoding object so we may use the GetByte
' method to transform the plainText into a Byte array.
Dim utf8encoder As UTF8Encoding = New UTF8Encoding()
Dim inputInBytes() As Byte = utf8encoder.GetBytes(plainText)
' Create a new TripleDES service provider
Dim tdesProvider As TripleDESCryptoServiceProvider = New TripleDESCryptoServiceProvider()
' The ICryptTransform interface uses the TripleDES
' crypt provider along with encryption key and init vector
' information
Dim cryptoTransform As ICryptoTransform = tdesProvider.CreateEncryptor(Me.key, Me.iv)
' All cryptographic functions need a stream to output the
' encrypted information. Here we declare a memory stream
' for this purpose.
Dim encryptedStream As MemoryStream = New MemoryStream()
Dim cryptStream As CryptoStream = New CryptoStream(encryptedStream, cryptoTransform, CryptoStreamMode.Write)
' Write the encrypted information to the stream. Flush the information
' when done to ensure everything is out of the buffer.
cryptStream.Write(inputInBytes, 0, inputInBytes.Length)
cryptStream.FlushFinalBlock()
encryptedStream.Position = 0
' Read the stream back into a Byte array and return it to the calling
' method.
Dim result(encryptedStream.Length - 1) As Byte
encryptedStream.Read(result, 0, encryptedStream.Length)
cryptStream.Close()
Return result
End Function
How do i see the byte value of the text? | 0 | [
2,
184,
20,
8406,
21,
34,
591,
77,
21,
3724,
19,
13,
20468,
9,
2328,
60,
800,
3726,
3726,
31,
57,
14,
1990,
1021,
1957,
11435,
9,
317,
1990,
1957,
11435,
5,
779,
3377,
3748,
11969,
28,
3724,
6,
28,
34,
591,
5,
6,
5937,
1246,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 it possible to include one css file into another?
===
Is it possible to include one css file into another? | 0 | [
2,
25,
32,
938,
20,
468,
53,
272,
18,
18,
3893,
77,
226,
60,
800,
3726,
3726,
25,
32,
938,
20,
468,
53,
272,
18,
18,
3893,
77,
226,
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... | [
1,
1,
1,
1,
1,
1,
1,
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... |
Flex HTTPService does not include Content-Length header ?
===
I am trying to get a Flex application to communicate with a custom python webserver I have developed.
I am noticing that I cannot read the postdata received because Flex does not seem to include the Content-Length in the HTTP headers. (My webserver work when posted to from plain HTML)
Is this a known problem? any ideas how to set the content-length header?
Here is the current headers being sent:
<pre>
Host: localhost:7070
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.9.0.3) Gecko/2008092417 Firefox/3.0
.3
Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8
Accept-Language: en-us,en;q=0.5
Accept-Encoding: gzip,deflate
Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.7
Keep-Alive: 300
Connection: keep-alive
</pre> | 0 | [
2,
14409,
7775,
11449,
630,
52,
468,
2331,
8,
6325,
157,
106,
13,
60,
800,
3726,
3726,
31,
589,
749,
20,
164,
21,
14409,
3010,
20,
8709,
29,
21,
5816,
20059,
2741,
10321,
106,
31,
57,
885,
9,
31,
589,
18130,
30,
31,
1967,
1302,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 does one do the equivalent of "import * from module" with Python's __import__ function?
===
Given a string with a module name, how do you import everything in the module as if you had called:
from module import *
i.e. given string S="module", how does one get the equivalent of the following:
__import__(S, fromlist="*")
This doesn't seem to perform as expected (as it doesn't import anything).
Thanks! | 0 | [
2,
184,
630,
53,
107,
14,
4602,
16,
13,
7,
1660,
1993,
1637,
37,
12613,
7,
29,
20059,
22,
18,
13,
1,
1660,
1993,
1,
1990,
60,
800,
3726,
3726,
504,
21,
3724,
29,
21,
12613,
204,
15,
184,
107,
42,
9010,
796,
19,
14,
12613,
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... |
Least common multiple for multiple number
===
How do you calculate the least common multiple of multiple numbers?
So far I've only been able to calculate it between two numbers. But have no idea how to expand it to calculate 3 or more numbers.
So far this is how I did it
LCM = num1 * num2 / gcd ( num1 , num2 )
With gcd is the function to calculate the greatest common divisor for the numbers. Using euclidean algorithm
But I can't figure out how to calculate it for 2 or more numbers. | 0 | [
2,
639,
757,
1886,
26,
1886,
234,
800,
3726,
3726,
184,
107,
42,
18469,
14,
639,
757,
1886,
16,
1886,
2116,
60,
86,
463,
31,
22,
195,
104,
74,
777,
20,
18469,
32,
128,
81,
2116,
9,
47,
57,
90,
882,
184,
20,
6073,
32,
20,
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... |
HTML & CSS question
===
I'm trying to get the content div to stretch all the way to the bottom of the page but so far, its only stretching if theres actual content to display. The reason I want to do this is so if there isn't much content to display, the vertical border still goes all the way down.
Here is my code
<body>
<form id="form1">
<div id="header">
<a title="Home" href="index.html" />
</div>
<div id="menuwrapper">
<div id="menu">
</div>
</div>
<div id="content">
</div>
and my CSS
body {
font-family: Trebuchet MS, Verdana, MS Sans Serif;
font-size:0.9em;
margin:0;
padding:0;
}
div#header
{
width: 100%;
height: 100px;
}
#header a
{
background-position: 100px 30px;
background: transparent url(site-style-images/sitelogo.jpg) no-repeat fixed 100px 30px;
height: 80px;
display: block;
}
#header, #menuwrapper {
background-repeat: repeat;
background-image: url(site-style-images/darkblue_background_color.jpg);
}
#menu #menuwrapper {
height:25px;
}
div#menuwrapper {
width:100%
}
#menu, #content {
width:1024px;
margin: 0 auto;
}
div#menu {
height: 25px;
background-color:#50657a;
}
Thanks for taking a looksi
| 0 | [
2,
13,
15895,
279,
272,
18,
18,
1301,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
14,
2331,
13,
12916,
20,
6363,
65,
14,
161,
20,
14,
2129,
16,
14,
2478,
47,
86,
463,
15,
82,
104,
11566,
100,
80,
18,
3463,
2331,
20,
3042,
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... |
Best place to save user information xp and vista
===
I need to save a users login information in encrypted form for this application im building but im not sure of the best place to save the file. I dont want to save it into the program apps folder as i want it per user.
So what is the best folder (or way) to save it into? | 0 | [
2,
246,
209,
20,
2079,
4155,
676,
23045,
17,
13520,
800,
3726,
3726,
31,
376,
20,
2079,
21,
3878,
6738,
108,
676,
19,
29403,
505,
26,
48,
3010,
797,
353,
47,
797,
52,
562,
16,
14,
246,
209,
20,
2079,
14,
3893,
9,
31,
1049,
259... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Silverlight the 'same' as jQuery?
===
Could Silverlight be used for the same things as jQuery, or are they intended for different things?
For example, vb.net could be used for the same stuff as C# while C# is intended for different things than what JavaScript is. Is Silverlight and jQuery like vb.net and C#, or more like C# and JavaScript? | 0 | [
2,
25,
1172,
3130,
14,
13,
22,
18,
8357,
22,
28,
487,
8190,
93,
60,
800,
3726,
3726,
110,
1172,
3130,
44,
147,
26,
14,
205,
564,
28,
487,
8190,
93,
15,
54,
50,
59,
2081,
26,
421,
564,
60,
26,
823,
15,
13,
20468,
9,
2328,
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... |
Error logging in C#
===
I am making my switch from coding in C++ to C#. I need to replace my C++ error logging/reporting macro system with something similar in C#.
In my C++ source I can write
LOGERR("Some error");
or
LOGERR("Error with inputs %s and %d", stringvar, intvar);
The macro & supporting library code then passes the (possibly varargs) formatted message into a database along with the source file, source line, user name, and time. The same data is also stuffed into a data structure for later reporting to the user.
Does anybody have C# code snippets or pointers to examples that do this basic error reporting/logging?
| 0 | [
2,
7019,
13,
13919,
19,
272,
5910,
800,
3726,
3726,
31,
589,
544,
51,
5521,
37,
13,
15458,
19,
272,
20512,
20,
272,
5910,
9,
31,
376,
20,
3934,
51,
272,
20512,
7019,
13,
13919,
118,
17437,
68,
9069,
329,
29,
301,
835,
19,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Proxy for command line utilities in Win XP
===
How do I get command line utilities like ping to use the default proxy in Windows XP.
proxycfg -u sets the proxy to the default (IE) proxy alright, but it doesn't seem to be working. | 0 | [
2,
27188,
26,
1202,
293,
19817,
19,
628,
23045,
800,
3726,
3726,
184,
107,
31,
164,
1202,
293,
19817,
101,
13,
3181,
20,
275,
14,
12838,
27188,
19,
1936,
23045,
9,
27188,
8940,
263,
13,
8,
291,
3415,
14,
27188,
20,
14,
12838,
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,
0,
0,
0... |
Will the below code cause memory leak in c++
===
class base{
int a;
int *pint;
someclass objsomeclass;
someclass* psomeclass;
base(){
objsomeclass = someclass();
psomeclass = new someclass();
pint = new int();
throw "constructor failed";
a = 43;
}}
main(){
base temp = base();
}
in the above code constructor fails.Which objects will be leaked and how to avoid memory leak | 0 | [
2,
129,
14,
1021,
1797,
1679,
1912,
11724,
19,
272,
20512,
800,
3726,
3726,
718,
1000,
1,
19,
38,
21,
73,
19,
38,
1637,
3489,
38,
73,
109,
1898,
5122,
728,
3220,
1898,
73,
109,
1898,
2483,
351,
3220,
1898,
73,
1000,
5,
6,
1,
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... |
Determining if the window is in help mode
===
Developing a .NET WinForms application: how can I check if the window is in Help mode (i.e. after clicking the "?" button in the title bar)?
The problem I have is that my System.Windows.Forms.ToolStripItem objects do not have a HelpRequested event (because they do not inherit from Control) so in the Click event handler, I am trying to determine if the window is currently in help mode so I can popup a ToolTip programmatically.
Any help is always appreciated! Thanks | 0 | [
2,
13521,
100,
14,
1463,
25,
19,
448,
3740,
800,
3726,
3726,
3561,
21,
13,
9,
2328,
628,
4190,
18,
3010,
45,
184,
92,
31,
2631,
100,
14,
1463,
25,
19,
448,
3740,
13,
5,
49,
9,
62,
9,
75,
25590,
14,
13,
7,
60,
7,
5167,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Looking for a book on writing game emulators.
===
For a long time I've been curious about game emulation and how it works. I've heard that Gameboy emulation is often a first choice for a first project. I would like to assume that many others would also be interested in such a project, but haven't found any published books on the subject.
I know of Marat Fayzullin's article at http://fms.komkon.org/EMUL8/HOWTO.html, but I was looking for something with more depth. Anyone know of a published book even remotely relating to this subject? Maybe there aren't any specifically on game emulation, but emulation in general that can easily be applied to games? Any suggestions would be appreciated! | 0 | [
2,
699,
26,
21,
360,
27,
1174,
250,
3579,
14868,
18,
9,
800,
3726,
3726,
26,
21,
175,
85,
31,
22,
195,
74,
7686,
88,
250,
3579,
11123,
17,
184,
32,
693,
9,
31,
22,
195,
752,
30,
250,
5352,
3579,
11123,
25,
478,
21,
64,
1837,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Regexp matching of list of quotes strings - unquoted
===
in Javascript, the following:
var test = '"the quick" "brown fox" "jumps over" "the lazy dog"';
var result = test.match(/".*?"/g);
alert(result);
yields "the quick","brown fox","jumps over","the lazy dog"
I want each matched element to be unquoted: the quick,brown fox,jumps over,the lazy dog
what regexp will do this?
| 0 | [
2,
7953,
6899,
10120,
16,
968,
16,
18901,
7887,
13,
8,
367,
8970,
1427,
800,
3726,
3726,
19,
8247,
8741,
15,
14,
249,
45,
4033,
1289,
800,
13,
22,
7,
124,
2231,
7,
13,
7,
9446,
2385,
7,
13,
7,
21925,
18,
84,
7,
13,
7,
124,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Django VMware appliance
===
Does anyone know of a Django 1.0 + postgresql + apache + mod_python VMware appliance? A "vanilla" Django 1.0 appliance where postgresql an be installed manually would also do. | 0 | [
2,
3857,
14541,
13,
20147,
5011,
18964,
800,
3726,
3726,
630,
1276,
143,
16,
21,
3857,
14541,
137,
9,
387,
2754,
678,
6879,
18,
22402,
2754,
17140,
2754,
7226,
1,
6448,
11570,
13,
20147,
5011,
18964,
60,
21,
13,
7,
2686,
3247,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0... |
Best way to detect when user leaves a web page
===
What is the best way to detect if a user leaves a web page?
The onUnload javascript method doesn't work every time (the HTTP request takes longer than the time required to terminate the browser).
Creating will probably be blocked by current browsers.
I'm also using Silverlight, so Silverlight solutions are welcome. | 0 | [
2,
246,
161,
20,
9092,
76,
4155,
2084,
21,
2741,
2478,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
9092,
100,
21,
4155,
2084,
21,
2741,
2478,
60,
14,
27,
1020,
8294,
8247,
8741,
2109,
1437,
22,
38,
170,
352,
85,
13,
5,
124,
777... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Window short cuts for XFCE4
===
This is not a programming question per se, but this is certainly about something which would help increasing my programming productivity.
In KDE, one can assign short-cuts to particular windows. This eliminates alt-tabbing completely and, is very very convenient when multiple apps(browser, console, emacs etc) are open.
My question is - can window short cuts be assigned in XFCE4 ? And if yes, how ? I very recently switched to XFCE from KDE4 and would appreciate any help regarding this.
TIA. | 0 | [
2,
1463,
502,
7960,
26,
993,
7061,
62,
300,
800,
3726,
3726,
48,
25,
52,
21,
3143,
1301,
416,
1353,
15,
47,
48,
25,
3850,
88,
301,
56,
83,
448,
3425,
51,
3143,
18211,
9,
19,
680,
546,
15,
53,
92,
13952,
502,
8,
4118,
18,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Solution for overloaded operator constraint in .NET generics
===
What would I do if I want to have a generic method that only accepts types that have overloaded an operator, for instance the subtraction operator. I tried using an interface as a constraint but interfaces can't have operator overloading.
What is the best way to achieve this? | 0 | [
2,
4295,
26,
84,
22546,
6022,
28804,
19,
13,
9,
2328,
12733,
18,
800,
3726,
3726,
98,
83,
31,
107,
100,
31,
259,
20,
57,
21,
12733,
2109,
30,
104,
16548,
2551,
30,
57,
84,
22546,
40,
6022,
15,
26,
4851,
14,
27031,
872,
6022,
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... |
CakePHP hasAndBelogsToMany using save() vs. saveAll()
===
I am using a very intrinsic database with a CakePHP application and so far my multi-models views and controllers are working fine. I have a singular table (`Entity`) that have it's `id` on several other tables as the Foreign Key `entity_id`
Some tables are one to one relations (Like a `Company` is one `Entity`) and some are one to many (`Entity` can have several `Addresses`) and so on.
*I won't/can't change the database model*, so this is the structure.
I have been using `saveAll()` to save data on those tables with input names like:
Entity.type='x' (hidden inside the view)
Company.name
Address.0.street
Address.0.city
Address.1.street
Address.1.city
... and so on ...
and my save all is doing all the hard job, `BEGIN TRANSACTION`, all `INSERT`s and a final `COMMIT` ...
But now I've created a `EntityCategory` that is a n to n relation and created the full `HABTM` relation inside the model.
It works when I `save()` it but just the `HABTM` relation, and it saves everthing when I use `saveAll()` (just as before) except for the `HABTM` relation.
Am I missing something ? How I make this work correctly ? I am using the following code today:
if (!empty($this->data)) {
$this->Entity->saveAll($this->data);
$this->Entity->save($this->data);
}
The `saveAll()` saves all data in several tables, saves the id in `Entity->id` and the `save()` saves the `HABTM` relations, but I am not sure if it is correct or if it can bring me problems if I change some structure/model.
Is this the best way to use it? Is there a *correct* way to save that relations inside CakePHP ? What your experience/knowledge can tell me ? | 0 | [
2,
8390,
26120,
63,
290,
863,
5567,
18,
262,
14842,
568,
2079,
5,
6,
4611,
9,
2079,
1233,
5,
6,
800,
3726,
3726,
31,
589,
568,
21,
253,
22892,
6018,
29,
21,
8390,
26120,
3010,
17,
86,
463,
51,
1889,
8,
13998,
18,
4146,
17,
991... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Debug Pylons application through Eclipse
===
I have Eclipse setup with PyDev and love being able to debug my scripts/apps. I've just started playing around with Pylons and was wondering if there is a way to start up the paster server through Eclipse so I can debug my webapp? | 0 | [
2,
121,
16254,
29262,
18,
3010,
120,
11652,
800,
3726,
3726,
31,
57,
11652,
18161,
29,
7103,
14438,
17,
339,
142,
777,
20,
121,
16254,
51,
17505,
118,
7753,
18,
9,
31,
22,
195,
114,
373,
791,
140,
29,
29262,
18,
17,
23,
5712,
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 make RightToLeftLayout work for controls inside GroupBoxes and Panels?
===
According to MSDN
form.RightToLeftLayout = True;
form.RightToLeft = ifWeWantRTL() ? RightToLeft.True : RightToLeft.False;
is enough to mirrow the form content for RTL languages.
But control placement gets mirrowed only for controls immediately on the form,
those inside a GroupBox or a Panel are not mirrowed, unless I put them on a TableLayoutPanel or a FlowLayoutPanel fisrt.
This is a lot of manual work to place a TableLayoutPanel inside each GroupBox,
and especially **to rearrange** the controls (one control per table cell)
Is there an easier way to make mirrowing work for all controls in all containers in the form when we need it?
Or at least, how can I bypass the rearranging step, for it is quite a task with our number of forms - nobody expected that GroupBox gotcha when forms were being designed.
| 0 | [
2,
184,
20,
233,
193,
262,
9742,
4414,
1320,
170,
26,
8671,
572,
214,
5309,
160,
17,
9449,
60,
800,
3726,
3726,
496,
20,
4235,
43,
103,
505,
9,
4183,
262,
9742,
4414,
1320,
800,
1151,
73,
505,
9,
4183,
262,
9742,
800,
100,
458,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 database list from sql server
===
**how can i get the list of available databases in a SQL server? im planning to make a list of that in combobox in vb.net. tnx.** | 0 | [
2,
164,
6018,
968,
37,
4444,
255,
8128,
800,
3726,
3726,
13,
1409,
1544,
92,
31,
164,
14,
968,
16,
904,
6018,
18,
19,
21,
4444,
255,
8128,
60,
797,
2334,
20,
233,
21,
968,
16,
30,
19,
22621,
5309,
19,
13,
20468,
9,
2328,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a decent open-source gaming console
===
I've got a young nephew who aspires to grow up to be a game programmer and i'd like to introduce him to the world of open-source as well as get him a sweet gift.
Anything like that out there? | 0 | [
2,
25,
80,
21,
12238,
368,
8,
12097,
10968,
8650,
800,
3726,
3726,
31,
22,
195,
330,
21,
461,
6786,
72,
21,
11421,
18,
20,
3213,
71,
20,
44,
21,
250,
17968,
17,
31,
22,
43,
101,
20,
8500,
61,
20,
14,
126,
16,
368,
8,
12097,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0... |
Why does regasm.exe register my c# assembly with the wrong GUID?
===
I've got a c# assembly which I'm invoking via COM from a Delphi (win32 native) application.
This works on all the machines I've tested it on, except one.
The problem is that the Delphi application gets "Class not registered" when trying to create the COM object.
Now, when I look in the registry under `HKEY_CLASSES_ROOT\DelphiToCSharp\CLSID`, the GUID listed there is not the same as the assembly Guid in AssemblyInfo.cs. It should be the same - it IS the same on all the other computers where it's installed.
I have tried `regasm /unregister delphitocsharp.dll`, and that removes the registry key. Then if I do `regasm delphitocsharp.dll`, the registry key returns, but the GUID is the same as before (ie. wrong), and Delphi still gets "Class not registered".
DelphiToCSharp.dll on the working machine is identical (verified with md5) to the version on the non-working machine.
All I can think of is that an old version of the dll was registered before, and there still exists some remnant of that file which is making regasm confused.
How can I fix or at least further diagnose this issue? | 0 | [
2,
483,
630,
302,
6927,
79,
9,
1706,
62,
2243,
51,
272,
5910,
1475,
29,
14,
1389,
9457,
43,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
272,
5910,
1475,
56,
31,
22,
79,
19,
2625,
1581,
1197,
13,
960,
37,
21,
23030,
13,
5,
418... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 list of available servers in SQL server group
===
**How can i extract the list of available SQL servers in an SQL server group? Im planning to put that list in a combobox in vb.net. Thank you.** | 0 | [
2,
164,
968,
16,
904,
17595,
19,
4444,
255,
8128,
214,
800,
3726,
3726,
13,
1409,
1544,
92,
31,
10962,
14,
968,
16,
904,
4444,
255,
17595,
19,
40,
4444,
255,
8128,
214,
60,
797,
2334,
20,
442,
30,
968,
19,
21,
22621,
5309,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
What's the best way to deploy a JRuby on Rails application to Tomcat?
===
I'm looking at ways to deploy a Ruby on Rails app (running on JRuby) to a Tomcat instance for testing.
The tomcat instance is running on a Solaris server that I can SSH to. I've looked at using Capistrano, but there doesn't seem to be a lot out there about using it to deploy to Tomcat, or even about running it under JRuby, and I keep hitting bugs in Capistrano due to the Windows/JRuby environment my PC is running (yeah, it's corporate - not my choice, but I've got to live with it).
I'm using warble to build the .war file, and the app deploys and runs fine once I manually copy it up and deploy it. I'm wanting something easier and more automated to actually get it there.
Anyone done this before? Documentation on the web seems pretty thin. | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
17617,
21,
2000,
291,
779,
27,
2240,
18,
3010,
20,
2067,
5782,
60,
800,
3726,
3726,
31,
22,
79,
699,
35,
2847,
20,
17617,
21,
10811,
27,
2240,
18,
4865,
13,
5,
11325,
27,
2000,
291,
779,
6,
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... |
Page working in FF, not in IE, where to start
===
I have a page which is largely created by DOM script, which generates a table of images (normal img elements) from several webcams (helping out a friend with a pet boarding and my HTML/DOM is a bit rusty).
It works fine in FF3 or Chrome, but not in IE7, In fact, the whole table is not visible in IE (but the body background-color is applied).
Looking at the page in IE, there are no script errors, the CSS appears to be applied OK, and the DOM appears to show all the cells and rows in the table, which are all generated.
Using the IE Developer Toolbar, running the Image report even shows the images (even though they don't appear in the table and there is no evidence of the table in the page as rendered - even the text in the cells isn't rendered)
In looking at the img elements and using the trace style feature, at one time, I saw that the img elements all had display : none, and it said inline style, but there's nothing in my code or stylesheet which does this. That problem appears to have gone away as I started to add explicit entries for every table element in my stylesheet.
Where to start?
body { background-color : gray ; color : white ; margin : 0 ; font-family : Verdana, "lucida console", arial, sans-serif ; }
#CameraPreviewParent { text-align : center ; width : 100% ; }
#CameraTable { text-align : center ; width : 100% ; }
#CameraLiveParent { text-align : center ; margin : 50px ; }
#CameraLiveHeading { color : white ; }
td.CameraCell { text-align : center ; }
img.CameraImage { border : none ; }
a:link, a:visited, a:active, a:hover { text-decoration : none ; color : inherit ; }
table#CameraTable { color : white ; background-color : gray ; }
td.CameraCell { color : white ; background-color : gray ; }
Removing the stylesheet completely has no effect.
| 0 | [
2,
2478,
638,
19,
13,
2460,
15,
52,
19,
13,
660,
15,
113,
20,
799,
800,
3726,
3726,
31,
57,
21,
2478,
56,
25,
2679,
679,
34,
11859,
3884,
15,
56,
7920,
18,
21,
859,
16,
3502,
13,
5,
17462,
797,
263,
2065,
6,
37,
238,
2741,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Calculating the size of Array::pack format string
===
How do you calculate the length of the string that would be returned by Array::pack? Is there something like Python's calcsize? | 0 | [
2,
22937,
14,
1072,
16,
7718,
45,
45,
8573,
2595,
3724,
800,
3726,
3726,
184,
107,
42,
18469,
14,
1476,
16,
14,
3724,
30,
83,
44,
587,
34,
7718,
45,
45,
8573,
60,
25,
80,
301,
101,
20059,
22,
18,
13,
16304,
10454,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Change the resolution of image in iPhone?
===
I wanted to change the resolution of a image,this image I am getting from remote location.The image I am getting is too large to fit in iPhone screen is their any way to change that resolution?
Thanks in advance | 0 | [
2,
753,
14,
4302,
16,
1961,
19,
21024,
60,
800,
3726,
3726,
31,
417,
20,
753,
14,
4302,
16,
21,
1961,
15,
1565,
1961,
31,
589,
1017,
37,
5388,
1474,
9,
124,
1961,
31,
589,
1017,
25,
266,
370,
20,
2742,
19,
21024,
2324,
25,
66,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Connection timed out when doing deployment of jrules-teamserver ear file
===
I getting the following error:
Deploying application in domain failed; Error loading deployment descriptors for jrules-teamserver-SUNAS82 -- Connection timed out ; requested operation cannot be completed Error loading deployment descriptors for jrules-teamserver-SUNAS82 -- Connection timed out
When deploying a ear file.
What could be the possible cause and how to resolve the issue? | 0 | [
2,
2760,
85,
43,
70,
76,
845,
10475,
16,
2000,
18065,
8,
6575,
10321,
106,
2330,
3893,
800,
3726,
3726,
31,
1017,
14,
249,
7019,
45,
17617,
68,
3010,
19,
4603,
1702,
73,
7019,
12797,
10475,
121,
8741,
248,
18,
26,
2000,
18065,
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 manipulate bits in Python ?
===
In C I could, for example, zero out bit #10 in a 32 bit unsigned value like so:
unsigned long value = 0xdeadbeef;
value &= ~(1<<10);
How do I do that in Python ?
| 0 | [
2,
184,
107,
31,
18468,
10181,
19,
20059,
13,
60,
800,
3726,
3726,
19,
272,
31,
110,
15,
26,
823,
15,
4606,
70,
1142,
27122,
19,
21,
2512,
1142,
28839,
1923,
101,
86,
45,
28839,
175,
1923,
800,
713,
396,
14260,
8506,
410,
73,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Good HTML Templates for form based Web Applications
===
I would like to refer HTML templates designed/developed especially for form based Web Applications.
I have been searching them but am not able to find out which I find better.
Regards,
Jatan | 0 | [
2,
254,
13,
15895,
22894,
18,
26,
505,
432,
2741,
3767,
800,
3726,
3726,
31,
83,
101,
20,
5017,
13,
15895,
22894,
18,
1006,
118,
20102,
1118,
26,
505,
432,
2741,
3767,
9,
31,
57,
74,
5792,
105,
47,
589,
52,
777,
20,
477,
70,
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,
0,
0,
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.