unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What are the utilization rates for each of the major languages and platforms?
===
I'm interested in knowing how many developers use each of the major languages/platforms, but I haven't been able to find any good recent surveys. If you know of any good data, please provide a link along with a brief synopsis of the survey's methodology (who they surveyed and how etc.) and its conclusions (16% of developers use Java, 12% use RoR etc.). | 0 | [
2,
98,
50,
14,
28071,
5332,
26,
206,
16,
14,
394,
2556,
17,
6843,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
2506,
184,
151,
10168,
275,
206,
16,
14,
394,
2556,
118,
27035,
18,
15,
47,
31,
2933,
22,
38,
74,
777,
20,
477,
186... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 2005 vs 2008 - What are the benefits?
===
What are the benefits of upgrading from Visual Studio 2005 to 2008?
Any thoughts on whether it's worth the jump, or is it better to wait for whatever's coming next? | 0 | [
2,
3458,
1120,
812,
4611,
570,
13,
8,
98,
50,
14,
5800,
60,
800,
3726,
3726,
98,
50,
14,
5800,
16,
26939,
37,
3458,
1120,
812,
20,
570,
60,
186,
3064,
27,
1472,
32,
22,
18,
2715,
14,
3936,
15,
54,
25,
32,
574,
20,
1760,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the cost of using autorelease on obj-c objects?
===
Most of Apples documentation seems to avoid using autoreleased objects especially when creating gui views, but I want to know what the cost of using autoreleased objects is?
UIScrollView *timeline = [[UIScrollView alloc] initWithFrame:CGRectMake(0, 20, 320, 34)];
[self addSubview:timeline];
[timeline release];
Ultimately should I use a strategy where everything is autoreleased and using retain/release should be the exception to the rule for specific cases? Or should I generally be using retain/release with autorelease being the exception for returned objects from convenience methods like [NSString stringWithEtc...] ? | 0 | [
2,
98,
25,
14,
1516,
16,
568,
3108,
15202,
27,
5122,
728,
8,
150,
3916,
60,
800,
3726,
3726,
127,
16,
4037,
18,
13945,
2206,
20,
2658,
568,
3108,
7906,
3916,
1118,
76,
2936,
9457,
4146,
15,
47,
31,
259,
20,
143,
98,
14,
1516,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Coming to Ocaml from Ruby, Lisp, Haskell, and Erlang
===
I've been reading about Ocaml's consistent speed, rapid prototyping ability, and excellent memory management, and decided to take it up.
As I've already got Ruby, *lisp, Haskell, and Erlang under my belt, I'm interested specifically in what KISS-violating features I should look out for in Ocaml.
If you've started Ocaml with a background in the above languages, what was the most frustrating thing to grok? How did you get around this difficulty? What analogies helped you get into the flow of the language?
I'd also be interested in knowing whether you have done more than simply learn Ocaml, and have actually converted to it for a large percentage of your coding problems.
| 0 | [
2,
880,
20,
13,
14977,
8184,
37,
10811,
15,
2093,
3401,
15,
63,
16507,
15,
17,
13,
106,
9949,
800,
3726,
3726,
31,
22,
195,
74,
1876,
88,
13,
14977,
8184,
22,
18,
8224,
1362,
15,
4470,
9347,
1084,
3181,
2165,
15,
17,
5977,
1912,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Getting image metadata in .NET without regards to metadata format
===
Given a filename, I need to be able to access certain metadata in an image for a project I'm currently developing, without regard to how the metadata is stored (that is, Exif, IPTC, or XMP). In particular, I want to access geotagging data.
Is there a way of doing this without requiring any third party assemblies (i.e. is it doable with stock Microsoft .NET) and how would it be done? | 0 | [
2,
1017,
1961,
28057,
19,
13,
9,
2328,
366,
14179,
20,
28057,
2595,
800,
3726,
3726,
504,
21,
3893,
7259,
15,
31,
376,
20,
44,
777,
20,
1381,
1200,
28057,
19,
40,
1961,
26,
21,
669,
31,
22,
79,
871,
3561,
15,
366,
6731,
20,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best practices in Latex
===
What are some good practices when typesetting Latex documents?
I use Latex mostly to typeset papers.
Here is a short list of what I consider Latex good practices, most of them would be common sense in any programming language:
- When writing a large document (book), keep the chapters in separate files
- Use a versioning system
- Repeated code (i.e. piece of formula occurring many times) is evil. Use macros
- Use macros to represent concepts, not to type less
- Use long, descriptive names for macros, labels, and bibliographic entries
- Use block comments <pre>%===================================</pre> to emphasize the beginning of sections and subsections
- Comment out suppressed paragraphs, don't delete them yet
- Don't format formulas (i.e. break them into many lines) until the final font size and page format are decided
- Learn to use BibTex
Further question:
What package/macro/whatever do you use to enter source code? | 2 | [
2,
246,
5242,
19,
456,
396,
800,
3726,
3726,
98,
50,
109,
254,
5242,
76,
1001,
19831,
456,
396,
4374,
60,
31,
275,
456,
396,
1555,
20,
2551,
1198,
3747,
9,
235,
25,
21,
502,
968,
16,
98,
31,
3563,
456,
396,
254,
5242,
15,
127,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Nondeterministic functions in sql partitioning functions
===
How are non-deterministic functions used in SQL partitioning functions and are they useful? | 0 | [
2,
538,
546,
3964,
108,
3771,
3719,
19,
4444,
255,
10711,
68,
3719,
800,
3726,
3726,
184,
50,
538,
8,
546,
3964,
108,
3771,
3719,
147,
19,
4444,
255,
10711,
68,
3719,
17,
50,
59,
4811,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Third-party windows command-line program?
===
Looking for a better Windows XP command-line interface. The Visual Studio Command Prompt isn't near as nice as the Linux/OSX terminals.
Thoughts? | 0 | [
2,
422,
8,
9635,
1936,
1202,
8,
1143,
625,
60,
800,
3726,
3726,
699,
26,
21,
574,
1936,
23045,
1202,
8,
1143,
6573,
9,
14,
3458,
1120,
1202,
11443,
4417,
2532,
22,
38,
424,
28,
2210,
28,
14,
13024,
118,
759,
396,
3855,
18,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Simple 3D graphics project?
===
I'm looking for some good ideas for a simple 3d graphics program as my final project for an intro to computer graphics class. As for some background information, we'll be using opengl and will have a little over a month to work on it, so nothing too far-fetched. The simpler and "prettier" looking, the better. It does, however, require some sort of interface that the user can interact with (so a very simple game or similar is a good idea) and must be 3D.
My only idea so far is maybe a 3D version of Tetris (google for some examples).
Thanks! | 0 | [
2,
1935,
203,
43,
8351,
669,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
109,
254,
3478,
26,
21,
1935,
203,
43,
8351,
625,
28,
51,
426,
669,
26,
40,
17386,
20,
1428,
8351,
718,
9,
28,
26,
109,
2395,
676,
15,
95,
22,
211,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 best take advantage of Trac?
===
I have a Trac project installed on top of a Subversion implementation (easy to do thanks to Webfaction's control panel), but now I have configuration work to do. With that in mind, are there _easy_ ways to do the following in Trac:
1) Ensure that customers can only see a high level progress indicator.
2) Give daily summary reports on tickets, testing, and tasks.
Also, I am interested in knowing if there are any **highly** recommended plugins that I would be sorry I forgot to install. | 0 | [
2,
184,
92,
31,
246,
247,
3314,
16,
13,
38,
5797,
60,
800,
3726,
3726,
31,
57,
21,
13,
38,
5797,
669,
4066,
27,
371,
16,
21,
972,
10898,
6123,
13,
5,
18385,
20,
107,
3669,
20,
2741,
410,
8645,
22,
18,
569,
4113,
6,
15,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Starting CompSci Uni next week, what's the best advice you can muster?
===
What's the one thing you would you tell someone just starting at Uni, or wish someone had told you before you started?
| 0 | [
2,
1422,
6479,
18,
1892,
9911,
328,
877,
15,
98,
22,
18,
14,
246,
4978,
42,
92,
21935,
60,
800,
3726,
3726,
98,
22,
18,
14,
53,
584,
42,
83,
42,
494,
737,
114,
1422,
35,
9911,
15,
54,
2536,
737,
41,
470,
42,
115,
42,
373,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Debugging: break at runtime when file is modified ? (windows)
===
Is it possible to break at runtime when a particular file has been modified?
ie. monitor the file and break into a debugger once a change has been made to it.
This is for a windows app...is this possible in visual studio or windbg?
edit: i should have mentioned that this is for a Win32 app.. | 0 | [
2,
121,
16254,
2762,
45,
1442,
35,
485,
891,
76,
3893,
25,
5372,
13,
60,
13,
5,
27508,
18,
6,
800,
3726,
3726,
25,
32,
938,
20,
1442,
35,
485,
891,
76,
21,
1498,
3893,
63,
74,
5372,
60,
13,
660,
9,
7626,
14,
3893,
17,
1442,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Naming your projects: does it matter?
===
I work on a variety of projects using different languages and platforms. Parts of them I abstract out into their own separate projects, and I want to open some of these up to the public.
What gets me stuck is the christening.
So, does it matter? Should I just choose something and stick with it?
And if it does matter, what's better: a cool-sounding name that's memorable, or a descriptive name that's easier to find? | 0 | [
2,
10929,
154,
2314,
45,
630,
32,
1161,
60,
800,
3726,
3726,
31,
170,
27,
21,
1747,
16,
2314,
568,
421,
2556,
17,
6843,
9,
1341,
16,
105,
31,
8502,
70,
77,
66,
258,
1725,
2314,
15,
17,
31,
259,
20,
368,
109,
16,
158,
71,
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... |
Multiplication of very long integers.
===
Is there an algorithm for accurately multiplying two arbitrarily long integers together? The language I am working with is limited to 64-bit unsigned integer length (maximum integer size of 18446744073709551615). Realistically, I would like to be able to do this by breaking up each number, processing them somehow using the unsigned 64-bit integers, and then being able to put them back together in to a string (which would solve the issue of multiplied result storage).
Any ideas? | 0 | [
2,
25432,
16,
253,
175,
13820,
18,
9,
800,
3726,
3726,
25,
80,
40,
9083,
26,
16353,
26314,
68,
81,
13,
25267,
18966,
175,
13820,
18,
429,
60,
14,
816,
31,
589,
638,
29,
25,
1317,
20,
4384,
8,
3326,
28839,
13820,
1476,
13,
5,
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... |
SQLite and Caching Application Block
===
Has anyone used the Caching Application Block with SQLite to persist data?
I'd like to get some details.
Thanks | 0 | [
2,
4444,
10601,
17,
1658,
7192,
3010,
1921,
800,
3726,
3726,
63,
1276,
147,
14,
1658,
7192,
3010,
1921,
29,
4444,
10601,
20,
22084,
1054,
60,
31,
22,
43,
101,
20,
164,
109,
3289,
9,
3669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Building a Decoupled N-Tier App With Entity Framework and VB.NET
===
So we are building an application with a
- UI Layer (web, mobile, Ajax client, etc)
- Service/API Layer
- Business Logic Layer
- Data Access Layer
Our goal is to have an Entity Framework dependency from the Service Layer on down to the DAL. That means the Sevice layer will only accept and return POCOs (plain old CLR objects).
What we're currently doing is manually coding a mapping layer between the service layer and business logic layer that will convert POCOs to EF Entities and vice versa.
So in short, page has form, form has codebehind that takes form contents, stuffs them into a POCO, sends it to service layer. Service layer converts to EF Entity, sends it to Business Logic Layer which performs certain transformations to the entity, and then interacts with the DAL to get it persisted.
**Yes, its a bit tedious**, but we were wondering if theres a better way?
**Yes**, I know someone published an EF Poco Adapter but it's all in C# and we would prefer a VB.NET solution.
**Yes**, Switching to NHibernate is an option of last resort, as we are already deep into our development cycle.
| 0 | [
2,
353,
21,
121,
17856,
1294,
13,
103,
8,
5259,
4865,
29,
9252,
6596,
17,
13,
20468,
9,
2328,
800,
3726,
3726,
86,
95,
50,
353,
40,
3010,
29,
21,
13,
8,
13,
5661,
5385,
13,
5,
14113,
15,
3241,
15,
20624,
6819,
15,
2722,
6,
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... |
Have you made interesting use of Mechanical Turk?
===
I would like to hear about interesting projects which made use of Amazon's Mechanical Turk. | 4 | [
2,
57,
42,
117,
4883,
275,
16,
4953,
11233,
60,
800,
3726,
3726,
31,
83,
101,
20,
990,
88,
4883,
2314,
56,
117,
275,
16,
8059,
22,
18,
4953,
11233,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Tool to compare sql server tables
===
Looking for a free tool to compare two sql server tables (both data and schema). Sorry, cannot afford any solutions from Red Gate.
No Sql queries please. It would be great if the tool can script the differences found.
I also went through some older [posts][1]. The closest I have seen is SQLDBDiff but I would love to try more options.
[1]: http://stackoverflow.com/questions/176316/compare-tools-to-generate-update-script-for-sql-server | 0 | [
2,
5607,
20,
11590,
4444,
255,
8128,
7484,
800,
3726,
3726,
699,
26,
21,
551,
5607,
20,
11590,
81,
4444,
255,
8128,
7484,
13,
5,
8110,
1054,
17,
23874,
6,
9,
1875,
15,
1967,
7829,
186,
6776,
37,
402,
3315,
9,
90,
4444,
255,
9386... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 the limitations on using SSRS with SQL Server 2005 Express edition?
===
I found [this][1] extremely old document which appears to say that many of the web client features are not availiable when running on express edition--scheduling, subscription, etc--as well as no access to the report builder. Is that information still current, and are there any other features which are unavailable?
[1]: http://www.microsoft.com/sql/technologies/reporting/rsfeatures.mspx | 0 | [
2,
98,
50,
14,
14070,
27,
568,
22118,
18,
29,
4444,
255,
8128,
812,
2999,
1322,
60,
800,
3726,
3726,
31,
216,
636,
1565,
500,
2558,
165,
500,
3898,
315,
4492,
56,
1780,
20,
395,
30,
151,
16,
14,
2741,
6819,
967,
50,
52,
24240,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 will be pNext int he following case using c/c++?
===
func()
{
Object* pNext;
func1(pNext);
}
func1(Object* pNext)
{
pNext = Segement->GetFirstPara(0);
}
I was expecting it to be pointer to firstpara returned from func1() but I'm seeing NULL can some explain and how to fix it to actually return the firstpara() pointer? | 0 | [
2,
98,
129,
44,
351,
20021,
19,
38,
24,
249,
610,
568,
272,
118,
150,
20512,
60,
800,
3726,
3726,
2414,
150,
5,
6,
13,
1,
3095,
2483,
351,
20021,
73,
2414,
150,
165,
5,
306,
20021,
6,
73,
13,
1,
2414,
150,
165,
5,
23793,
248... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you make php's json_decode compatible with firefox's javascript?
===
it appears if you have something like
var my_var = {"foo" : "bar"};
in javascript (with firefox at least) and post it to a php server you will receive a string like
{foo:"bar",}
on the server side. But json_decode in php doesn't like the trailing ',' or the lack or quotes around 'foo'. Is there a nice way to clean up the received json string? | 0 | [
2,
184,
107,
42,
233,
13,
26120,
22,
18,
487,
528,
1,
546,
9375,
14961,
29,
535,
18219,
22,
18,
8247,
8741,
60,
800,
3726,
3726,
32,
1780,
100,
42,
57,
301,
101,
4033,
51,
1,
3311,
800,
13,
1,
7,
4120,
111,
7,
13,
45,
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... |
Getting drawable area of an AWT frame in Mac OS X?
===
I have subclassed java.awt.Frame and have overridden the paint() method as I wish to draw the entire contents of the window manually.
However, on the graphics object, (0,0) corresponds to the upper left hand corner of the window **inside** the title bar decoration, not the first drawable pixel.
Can I determine the co-ordinate of the first drawable pixel (ie, the height of the decoration) in a cross-platform manner, avoiding using a Mac OS X-specific fudge factor? Will I be forced to nest a Panel component in order to find the actual drawable area of the window?
Here my code fails to centre the blue square inside the paintable area of the window:
@Override
public void paint (Graphics g) {
g.setColor(Color.BLUE);
g.setPaintMode();
g.fillRect(30, 30, getWidth()-60, getHeight()-60);
}
![alt text][1]
[1]: http://x13n.com/paintable-area.png | 0 | [
2,
1017,
2003,
579,
217,
16,
40,
13,
3885,
38,
3523,
19,
1572,
13,
759,
993,
60,
800,
3726,
3726,
31,
57,
972,
1898,
69,
8247,
9,
3885,
38,
9,
8361,
17,
57,
84,
15267,
14,
5107,
5,
6,
2109,
28,
31,
2536,
20,
2003,
14,
1078,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which is better BOOST_MPL_ASSERT or BOOST_STATIC_ASSERT?
===
As I recall `BOOST_MPL_ASSERT` was once preferred. Is this still true? Anyone know why? | 0 | [
2,
56,
25,
574,
10419,
1,
79,
5727,
1,
22220,
38,
54,
10419,
1,
18077,
1,
22220,
38,
60,
800,
3726,
3726,
28,
31,
7111,
13,
1,
10858,
384,
1,
79,
5727,
1,
22220,
38,
1,
23,
382,
5981,
9,
25,
48,
174,
1151,
60,
1276,
143,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there an easy way to find small open source projects?
===
It was suggested to me by the SO community to get into an open source project to get myself out there. Id like to find one that is preferably a small project (file size/project size). I figure getting into something that is small will help me get into something that wont take long to understand and start contributing.
I tried the big open source communities and they dont have a way to search based on size of project. So I come to SO to ask is there any easy way to find them? If not can someone recommend windows OS based project that uses C++ or C# and is small? Thanks in advance. | 2 | [
2,
25,
80,
40,
2010,
161,
20,
477,
284,
368,
1267,
2314,
60,
800,
3726,
3726,
32,
23,
2347,
20,
55,
34,
14,
86,
514,
20,
164,
77,
40,
368,
1267,
669,
20,
164,
992,
70,
80,
9,
4924,
101,
20,
477,
53,
30,
25,
6369,
4801,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create an ini file to store some settings in Java?
===
I want to create an ini file to store some settings for my application. Is it a good idea to find where the jar file is located and create an ini file there? If yes, then how can I find the location of the jar file?
But if you know a better solution for something like this, I would like to hear some of them. | 0 | [
2,
184,
20,
1600,
40,
19,
49,
3893,
20,
1718,
109,
12410,
19,
8247,
60,
800,
3726,
3726,
31,
259,
20,
1600,
40,
19,
49,
3893,
20,
1718,
109,
12410,
26,
51,
3010,
9,
25,
32,
21,
254,
882,
20,
477,
113,
14,
5112,
3893,
25,
335... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 specify JVM argument for Maven built executable JAR
===
When using Maven to build an executable JAR, how do I specify the JVM arguments that are used when the JAR is executed?
I can specify the main class using `<mainClass>`. I suspect there's a similar attribute for JVM arguments. Specially I need to specify the maximum memory (example -Xmx500m).
Here's my assembly plugin:
<plugin>
<artifactId>maven-assembly-plugin</artifactId>
<configuration>
<descriptorRefs>
<descriptorRef>jar-with-dependencies</descriptorRef>
</descriptorRefs>
<archive>
<manifest>
<addClasspath>true</addClasspath>
<mainClass>com.me.myApplication</mainClass>
</manifest>
</archive>
</configuration>
</plugin>
| 0 | [
2,
184,
20,
19077,
487,
20147,
5476,
26,
1216,
3124,
392,
1396,
17194,
5924,
5112,
800,
3726,
3726,
76,
568,
1216,
3124,
20,
1895,
40,
1396,
17194,
5924,
5112,
15,
184,
107,
31,
19077,
14,
487,
20147,
10553,
30,
50,
147,
76,
14,
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... |
UTC Offset in PHP
===
What's the easiest way to get the UTC offset in PHP, relative to the current (system) timezone? | 0 | [
2,
13,
11440,
17493,
19,
13,
26120,
800,
3726,
3726,
98,
22,
18,
14,
27237,
161,
20,
164,
14,
13,
11440,
17493,
19,
13,
26120,
15,
4543,
20,
14,
866,
13,
5,
10724,
6,
85,
11661,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What programming languages do you consider indispensable in your experience?
===
Each programming language comes with its concepts, best practices, libraries, tools, community, in one word: culture.
Learning more than one programming language will make you a better programmer, for the more concepts you learn, the faster you will feel comfortable when the next language or technology will come.
Mine, so far, are C, some C++, and Python, and many times I read that it would be worth learning LISP, for "the profound enlightenment experience you will have when you finally get it" (quoting Eric Raymond).
My question is: Which is the next one you would consider a good investment to learn? Of the many programming languages you have learnt and worked with, which one(s) do you consider essential to build one's CS culture, and why? | 0 | [
2,
98,
3143,
2556,
107,
42,
3563,
19,
2906,
12606,
579,
19,
154,
1496,
60,
800,
3726,
3726,
206,
3143,
816,
1624,
29,
82,
8700,
15,
246,
5242,
15,
8649,
15,
4672,
15,
514,
15,
19,
53,
833,
45,
1365,
9,
2477,
91,
119,
53,
3143,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
A Project Euler Puzzler (specifically in PHP)
===
There is another recent Project Euler question but I think this is a bit more specific (I'm only really interested in PHP based solutions) so I'm asking anyway.
[Question #5][1] tasks you with: "What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?"
Now, I have solved it twice. Once very inefficiently and once much more efficiently but I am still far away from an especially sophisticated answer (and I am not especially solid in math hence my brute force solution). I can see a couple of areas where I could improve this but I am wondering if any of you could demonstrate a more efficient solution to this problem.
*spoiler: Here is my less than optimal (7 seconds to run) but still tolerable solution (not sure what to do about the double $... just pretend you only see 1...
function euler5(){
$x = 20;
for ($y = 1; $y < 20; $y++) {
if (!($x%$y)) {
} else {
$x+=20;
$y = 1;
}
}echo $x;
};
[1]: http://projecteuler.net/index.php?section=problems&id=5 | 0 | [
2,
21,
669,
28027,
9164,
139,
13,
5,
9219,
1326,
19,
13,
26120,
6,
800,
3726,
3726,
80,
25,
226,
1764,
669,
28027,
1301,
47,
31,
277,
48,
25,
21,
1142,
91,
1903,
13,
5,
49,
22,
79,
104,
510,
3158,
19,
13,
26120,
432,
6776,
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... |
Book recommendations for SIP
===
I'm looking for a intermediate/advanced book(s) on the explanation of VoIP protocols and related technologies. I'm focusing on SIP in particular but if there are titles that include H.323 also then that would be a bonus.
Thanks. | 0 | [
2,
360,
12121,
26,
8616,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
6889,
118,
1283,
2686,
11014,
360,
5,
18,
6,
27,
14,
5764,
16,
18742,
306,
19957,
17,
1597,
5740,
9,
31,
22,
79,
7796,
27,
8616,
19,
1498,
47,
100,
80,
50,
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,
0... |
macro support in javascript
===
I know that javascript doesn't support macros (lisp-style ones) but I was wondering if anyone had a solution to maybe simulate macros? I googled it, and one of the solutions suggested using eval(), but as he said, should be quite costly. They don't really have to be very fancy. I just want to do simple stuff with them. And it shouldn't make debugging significantly harder :) | 0 | [
2,
9069,
555,
19,
8247,
8741,
800,
3726,
3726,
31,
143,
30,
8247,
8741,
1437,
22,
38,
555,
9069,
18,
13,
5,
3159,
306,
8,
4381,
53,
18,
6,
47,
31,
23,
5712,
100,
1276,
41,
21,
4295,
20,
913,
24969,
9069,
18,
60,
31,
8144,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
fisheye table columns
===
Has anyone ever given table columns the "fisheye" effect? Im talking about an expanding effect of the table columns when hovering the mouse over them. I'd love to see some code if anyone has tried this.
| 0 | [
2,
1968,
9374,
859,
7498,
800,
3726,
3726,
63,
1276,
462,
504,
859,
7498,
14,
13,
7,
4934,
9374,
7,
1590,
60,
797,
1582,
88,
40,
9393,
1590,
16,
14,
859,
7498,
76,
18503,
14,
7567,
84,
105,
9,
31,
22,
43,
339,
20,
196,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
The best way to do loops in javascript
===
What is the best way to write loops in javascript?
I have stumpled into several solutions, what I like the most is:
for(var i = 0; i < a.length; i++){
var element = a[i];
}
But as tested here (http://www.robertnyman.com/2008/04/11/javascript-loop-performance/), it should probably be written so that the length is only calculated once.
In jquery there is a .each that you can stick a function. I like this a little better, because I don't have to type the array twice, like in the above solution.
If javascript supported macros it would be a piece of cake to roll your own, but sadly it does not.
So what do you guys use? | 0 | [
2,
14,
246,
161,
20,
107,
19661,
19,
8247,
8741,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
2757,
19661,
19,
8247,
8741,
60,
31,
57,
15781,
1294,
77,
238,
6776,
15,
98,
31,
101,
14,
127,
25,
45,
26,
5,
3311,
31,
800,
713,
73... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
implementing a compiler in "itself"
===
Intuitively, it would seems that a compiler for language Foo, cannot itself be written in Foo. More specifically, the *first* compiler for language Foo cannot be written in Foo, but any subsequent compiler could be written for Foo.
But is this actually true. I have some very vague recollection of reading about a language whose first compiler was written in "itslef". Is this possible, and if so how?
Cheers,
Don | 0 | [
2,
17333,
21,
21486,
19,
13,
7,
242,
8411,
7,
800,
3726,
3726,
13,
24392,
102,
15,
32,
83,
2206,
30,
21,
21486,
26,
816,
4310,
111,
15,
1967,
1145,
44,
642,
19,
4310,
111,
9,
91,
3524,
15,
14,
1637,
3552,
2483,
21486,
26,
816,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you clear a tree in ExtJs?
===
I have managed to create an Ext.tree.TreePanel that loads child nodes dynamically, but I'm having a very difficult time clearing the tree and loading it with new data. Can someone help me with the code to do this? | 0 | [
2,
184,
107,
42,
1207,
21,
1541,
19,
1396,
38,
728,
18,
60,
800,
3726,
3726,
31,
57,
1471,
20,
1600,
40,
1396,
38,
9,
8101,
9,
8101,
3206,
532,
30,
19069,
850,
16272,
7782,
1326,
15,
47,
31,
22,
79,
452,
21,
253,
1956,
85,
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... |
PHP money string conversion to integer error
===
I have a small financial application with PHP as the front end and MySQL as the back end. I have ancient prejudices, and I store money values in MySQL as an integer of cents. My HTML forms allow input of dollar values, like "156.64" and I use PHP to convert that to cents and then I store the cents in the database.
I have a function that both cleans the dollar value from the form, and converts it to cents. I strip leading text, I strip trailing text, I multiply by 100 and convert to an integer. That final step is
`$cents = (integer) ($dollars * 100);`
This works fine for almost everything, except for a very few values like '156.64' which consistently converts to 15663 cents. Why does it do this?
If I do this:
`$cents = (integer) ($dollars * 100 + 0.5);`
then it consistently works. Why do I need to add that rounding value?
Also, my prejudices about storing money amounts as integers and not floating point values, is that no longer needed? Will modern float calculations produce nicely rounded and accurate money values adequate for keeping 100% accurate accounting?
| 0 | [
2,
13,
26120,
875,
3724,
6263,
20,
13820,
7019,
800,
3726,
3726,
31,
57,
21,
284,
1553,
3010,
29,
13,
26120,
28,
14,
431,
241,
17,
51,
18,
22402,
28,
14,
97,
241,
9,
31,
57,
1593,
17287,
18,
15,
17,
31,
1718,
875,
4070,
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... |
Simple Java web services
===
Does anyone know of a really simple way of publishing Java methods as web services? I don't really want the overhead of using Tomcat or Jetty or any of the other container frameworks.
Scenario: I've got a set of Java methods in a service type application that I want to access from other machines on the local LAN. | 0 | [
2,
1935,
8247,
2741,
687,
800,
3726,
3726,
630,
1276,
143,
16,
21,
510,
1935,
161,
16,
3107,
8247,
3195,
28,
2741,
687,
60,
31,
221,
22,
38,
510,
259,
14,
8860,
16,
568,
2067,
5782,
54,
17341,
93,
54,
186,
16,
14,
89,
12147,
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... |
Simple wireframe format?
===
I'm looking for a simple file format to use for wireframe models. I am aware of VRML, u3D, etc, but these seem heavyweight for my needs. My criterea are:
* Must have a clear spec. Either open or very well established/documented.
* I only need (want) simple models - vertices and edges. I don't want to handle faces or objects. If the format supports more, that's fine so long as I can ignore them.
* End-user tools are not a requirement, but would be great. If not, it must be human readable (and editable for simple models).
* It would be nice (but not necessary) to be able to annotate or at least label nodes.
* It shouldn't matter what language I'm using, but probable options are Java/C++ & OpenGL
Or am I just better writing vertices/edge lists to a text file and be done with it? | 0 | [
2,
1935,
6511,
8361,
2595,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
1935,
3893,
2595,
20,
275,
26,
6511,
8361,
2761,
9,
31,
589,
3854,
16,
13,
6938,
8184,
15,
287,
240,
43,
15,
2722,
15,
47,
158,
2260,
8139,
26,
51,
2274,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Lucene.Net manage concurrent indexing and searching the same index for me?
===
When using Lucene.Net with ASP.NET, I can imagine that one web request can trigger an update to the index while another web request is performing a search. Does Lucene.Net have built in it the ability to manage concurrent access, or do I have to manage it, to avoid "being used by another process" errors? | 0 | [
2,
630,
18515,
556,
9,
2328,
4705,
19513,
4348,
68,
17,
5792,
14,
205,
4348,
26,
55,
60,
800,
3726,
3726,
76,
568,
18515,
556,
9,
2328,
29,
28,
306,
9,
2328,
15,
31,
92,
4382,
30,
53,
2741,
3772,
92,
7286,
40,
11100,
20,
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... |
Stop JAVA and C from truncating my floats and doubles!
===
When I give HAVA and C BIG floats and doubles (in the billion range), they convert it to scientific notation, loosing precision in the process. How can I stop this behavior? | 0 | [
2,
747,
8247,
17,
272,
37,
22328,
68,
51,
11510,
18,
17,
7784,
187,
800,
3726,
3726,
76,
31,
590,
13,
20648,
17,
272,
580,
11510,
18,
17,
7784,
13,
5,
108,
14,
2786,
978,
6,
15,
59,
8406,
32,
20,
2272,
15591,
15,
13,
10165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Best approach for using AJAX loaders?
===
I've implemented a few poor solutions for bringing up an AJAX loader before dynamically updating a content DIV, but none seem to be "universal", and I find each time I do it I'm reworking it. If I have a DIV with content that updates depending on what a user clicks on the page, and I want to display the loader over this content DIV, what is the best approach? I've seen some developers have the loader always on the page, and they just display it block or none, and I've seen others append it to the DIV. What about when you also have multiple areas that can update? I'm thinking something repeatable that I can call with a function, maybe passing a few parameters. | 0 | [
2,
246,
2141,
26,
568,
20624,
6305,
445,
60,
800,
3726,
3726,
31,
22,
195,
6807,
21,
310,
1696,
6776,
26,
3657,
71,
40,
20624,
6305,
106,
115,
7782,
1326,
71,
43,
1880,
21,
2331,
13,
12916,
15,
47,
2369,
2260,
20,
44,
13,
7,
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... |
What's a good rails example application?
===
I would like to get source for a small, well written rails app to modify and "play with" as I learn how to program. I have found hundreds of open-source apps, but I don't know which are any good. Suggestions? | 0 | [
2,
98,
22,
18,
21,
254,
2240,
18,
823,
3010,
60,
800,
3726,
3726,
31,
83,
101,
20,
164,
1267,
26,
21,
284,
15,
134,
642,
2240,
18,
4865,
20,
17579,
17,
13,
7,
5438,
29,
7,
28,
31,
2484,
184,
20,
625,
9,
31,
57,
216,
4541,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Testing Delphi DLL crashes VB6 IDE
===
I've had my first go at writing a DLL in Delphi. So far so good. By using a typelib I've been able to pass Widestrings to and from the DLL without difficulty.
What's curious at the moment is that I'm using VB6 as the testbed, and every time I run a test within the IDE, the program runs and then the IDE process suddenly disappears from memory - no error messages, nothing. If I step through the code, everything works fine until I execute the last line, then the IDE disappears.
By contrast, when I compile the test to an EXE the program runs to its end, without error messages etc.
Has anyone had this problem before and is there an obvious solution that's staring me in the face?
Source code below, in case it matters:
-- project
library BOSLAD;
uses
ShareMem,
SysUtils,
Classes,
BOSLADCode in 'BOSLADCode.pas';
exports
version,
DMesg,
foo;
{$R *.res}
begin
end.
-- unit
unit BOSLADCode;
interface
function version() : Double; stdcall;
procedure DMesg(sText : WideString; sHead : WideString ); stdcall;
function foo() : PWideString; stdcall;
implementation
uses Windows;
function version() : Double;
var
s : String;
begin
result := 0.001;
end;
procedure DMesg( sText : WideString; sHead : WideString);
begin
Windows.MessageBoxW(0, PWideChar(sText), PWideChar(sHead), 0);
end;
function foo() : PWideString;
var s : WideString;
begin
s := 'My dog''s got fleas';
result := PWideString(s);
end;
end.
-- typelib
// This is the type library for BOSLAD.dll
[
// Use GUIDGEN.EXE to create the UUID that uniquely identifies
// this library on the user's system. NOTE: This must be done!!
uuid(0C55D7DA-0840-40c0-B77C-DC72BE9D109E),
// This helpstring defines how the library will appear in the
// References dialog of VB.
helpstring("BOSLAD TypeLib"),
// Assume standard English locale.
lcid(0x0409),
// Assign a version number to keep track of changes.
version(1.0)
]
library BOSLAD
{
// Now define the module that will "declare" your C functions.
[
helpstring("Functions in BOSLAD.DLL"),
version(1.0),
// Give the name of your DLL here.
dllname("BOSLAD.dll")
]
module BOSLADFunctions
{
[helpstring("version"), entry("version")] void __stdcall version( [out,retval] double* res );
[helpstring("DMesg"), entry("DMesg")] void __stdcall DMesg( [in] BSTR msg, [in] BSTR head );
[helpstring("foo"), entry("foo")] void __stdcall foo( [out,retval] BSTR* msg );
} // End of Module
}; // End of Library
| 0 | [
2,
4431,
23030,
13,
43,
211,
21563,
13,
20468,
379,
13,
3448,
800,
3726,
3726,
31,
22,
195,
41,
51,
64,
162,
35,
1174,
21,
13,
43,
211,
19,
23030,
9,
86,
463,
86,
254,
9,
34,
568,
21,
1001,
8326,
31,
22,
195,
74,
777,
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... |
Is it necessary for Qt::paintEvent to be reentrant?
===
Can I put the painter into the class variables? :
protected:
QPainter *myPainter;
...
void MyWidget::paintEvent(QPaintEvent *event)
{
myPainter = new QPainter(this);
| 0 | [
2,
25,
32,
2378,
26,
2593,
38,
45,
45,
20578,
4943,
38,
20,
44,
302,
2291,
7874,
60,
800,
3726,
3726,
92,
31,
442,
14,
3810,
77,
14,
718,
12157,
60,
13,
45,
3803,
45,
2593,
20578,
106,
1637,
915,
20578,
106,
73,
13,
9,
9,
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... |
Any alternative to ASP.Net 'Page Templates' ?
===
Classic ASP had 'server side includes' so that one could easily design a generic layout for the header, footer, left or right side bar.
In ASP.Net, I think we must use 'Page Templates'. Although most people say that it is easy to use, I find it rather complicated, as we must copy the whole HTML code inside the 'Render' function. Is there a simpler method? Can I load the code from a HTML file instead pasting the whole code in the 'Render' function?
Or is there any better alternative to 'Page Templates'? | 0 | [
2,
186,
2676,
20,
28,
306,
9,
2328,
13,
22,
6486,
22894,
18,
22,
13,
60,
800,
3726,
3726,
2732,
28,
306,
41,
13,
22,
10321,
106,
270,
1103,
22,
86,
30,
53,
110,
2351,
704,
21,
12733,
9106,
26,
14,
157,
106,
15,
1749,
106,
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... |
What ideas do you think can it be applied to this GUI to make it more effective for real people usage?
===
I am talking about Google Text Translation User Interface, in [Google Language Tools][1].
I like the fact that you can get translations of text for a lot of languages. However, I think is not so good always to show all options of translation. I believe is preferably to show, in first instance, only the most frequent options for text translation.
Really, it has become very annoying trying to translate from English to spanish, for example. Using the keyboard (E, Tab, then S Key repeatedly), the first three options presented are Serbian, Slovak, Slovenian, and finally Spanish...
Another example: from English to French. Using the keyboard again (F key repeatedly) shows Filipino and Finish before French!!!
What sort of ideas do you think can it be applied to this GUI to make it more effective for real people usage?
[1]: http://www.google.com/language_tools | 0 | [
2,
98,
3478,
107,
42,
277,
92,
32,
44,
2435,
20,
48,
9457,
20,
233,
32,
91,
3140,
26,
683,
148,
7514,
60,
800,
3726,
3726,
31,
589,
1582,
88,
8144,
1854,
4064,
4155,
6573,
15,
19,
636,
16111,
4875,
816,
4672,
500,
2558,
165,
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... |
phpBB equivalent for Ruby on Rails
===
I'm looking for Forum software similar to phpBB, but intended to run within a RoR application. I'm looking for a list of sites, along with one recommendation for which one is currently the ideal choice (ease of setup, simplicity, aesthetics). | 0 | [
2,
13,
26120,
3490,
4602,
26,
10811,
27,
2240,
18,
800,
3726,
3726,
31,
22,
79,
699,
26,
5691,
2306,
835,
20,
13,
26120,
3490,
15,
47,
2081,
20,
485,
363,
21,
761,
248,
3010,
9,
31,
22,
79,
699,
26,
21,
968,
16,
3259,
15,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are best practices for developing consistant libraries?
===
I am working on developing a pair of libraries to work with a REST API. Because I need to be able to use the API in very different settings I'm currently planning to have a version in PHP (for web applications) and a second version in Python (for desktop applications, and long running processes). Are there any best practices to follow in the development of the libraries to help maintain my own sanity? | 0 | [
2,
98,
50,
246,
5242,
26,
3561,
7929,
1830,
8649,
60,
800,
3726,
3726,
31,
589,
638,
27,
3561,
21,
2146,
16,
8649,
20,
170,
29,
21,
760,
21,
2159,
9,
185,
31,
376,
20,
44,
777,
20,
275,
14,
21,
2159,
19,
253,
421,
12410,
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... |
How is tr1::reference_wrapper useful?
===
recently I've been reading through Scott Meyers's excellent [Effective C++][1] book. In one of the last tips he covered some of the features from TR1 - I knew many of them via Boost.
However, there was one that I definitely did NOT recognize: tr1::reference_wrapper.
How and when would I use tr1::reference_wrapper?
[1]: http://www.amazon.com/gp/product/0321334876?ie=UTF8&tag=aristeia.com-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=0321334876 | 0 | [
2,
184,
25,
9235,
165,
45,
45,
28018,
1,
499,
525,
8763,
4811,
60,
800,
3726,
3726,
1989,
31,
22,
195,
74,
1876,
120,
1824,
10078,
18,
22,
18,
5977,
636,
14659,
272,
20512,
500,
2558,
165,
500,
360,
9,
19,
53,
16,
14,
236,
110... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Recommend language for learning GUI
===
<a href="http://stackoverflow.com/questions/142695/high-level-languages-for-out-of-the-box-gui-desktop-application-programming">This question</a> is slightly similar, but I'd like some different emphases. I'd like to build a small Windows Firewall log viewer application, while in the process teaching myself both GUI programming and another programming language. My goals?
1. Write efficient code on an efficient framework. This is all relative, maybe a good benchmark is that I want parsing a 4MB logfile to be snappy. I don't mind low level too much; as I said, this is a learning exercise.
2. Have a reasonable amount of native-ity on Windows; if the UI library doesn't feel like Windows I really don't want to use it. Cross platform is not a consideration.
3. I want the language to not be stupid, and be one that is used frequently enough to be worth learning. | 4 | [
2,
12360,
816,
26,
2477,
9457,
800,
3726,
3726,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
1419,
24764,
10551,
4542,
8,
3906,
8,
7020,
18,
8,
1106,
8,
1320,
8,
1041,
8,
124,
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 to store a recurring time window
===
What is a preferred way to store recurring time windows? <br />
For example. If I have a calendar type system where I need to be able to accommodate daily, weekly or monthly recurring events, what sort of time management system is best? <br /><br />
How is this best represented in a database? | 0 | [
2,
184,
20,
1718,
21,
11344,
85,
1463,
800,
3726,
3726,
98,
25,
21,
5981,
161,
20,
1718,
11344,
85,
1936,
60,
13,
1,
5145,
13,
118,
1,
26,
823,
9,
100,
31,
57,
21,
7036,
1001,
329,
113,
31,
376,
20,
44,
777,
20,
7162,
1954,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 use case for tr1::result_of?
===
I hear that tr1::result_of gets used frequently inside of Boost... I'm wondering if there are any good (simple) use cases for tr1::result_of I can use at home. | 0 | [
2,
98,
25,
21,
254,
275,
610,
26,
9235,
165,
45,
45,
29955,
1,
1041,
60,
800,
3726,
3726,
31,
990,
30,
9235,
165,
45,
45,
29955,
1,
1041,
3049,
147,
3086,
572,
16,
10419,
9,
9,
9,
31,
22,
79,
5712,
100,
80,
50,
186,
254,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you organize unit tests into packages?
===
As a matter of fact you have smth like `/java/src` and `/java/test`. But then, how do you name packages/classes the unittests go to? The same as classes they are written against? And when refactoring comes, do you manually rename in /test? Please share your experience. | 0 | [
2,
184,
107,
42,
9213,
1237,
4894,
77,
16875,
60,
800,
3726,
3726,
28,
21,
1161,
16,
837,
42,
57,
7613,
96,
101,
13,
1,
118,
1004,
1385,
118,
18,
5453,
1,
17,
13,
1,
118,
1004,
1385,
118,
10543,
1,
9,
47,
94,
15,
184,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
IIS 6 Tuning Guide?
===
I have been a developer for 10+ years and so far my IIS knowledge is just enough for deploying stuff on it and get it running. Recently I have been playing with IIS 6 and realize the huge difference on the worker process model. I think I would need some good guide to update my knowledge in this area. Any good article/book recommendation? | 0 | [
2,
595,
18,
400,
19253,
3378,
60,
800,
3726,
3726,
31,
57,
74,
21,
10058,
26,
332,
2430,
122,
17,
86,
463,
51,
595,
18,
1918,
25,
114,
511,
26,
17617,
68,
3217,
27,
32,
17,
164,
32,
946,
9,
1989,
31,
57,
74,
791,
29,
595,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Free XML Formatting tool
===
Is there a free XML formatting tool available where I can past an XML string and have it formatted so I can read the XML document correctly?
Thanks | 4 | [
2,
551,
23504,
2595,
1203,
5607,
800,
3726,
3726,
25,
80,
21,
551,
23504,
2595,
1203,
5607,
904,
113,
31,
92,
640,
40,
23504,
3724,
17,
57,
32,
13,
29850,
86,
31,
92,
1302,
14,
23504,
4492,
12044,
60,
3669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to convert UTC time to Time in any other time zone in C#
===
I am working in C#.net - .Net fx is 2.0 which doesnot support converting between different time zones. I have wrote a scheduler based on UTC but it is giving errors of 1 hour in the DTS periods for London. I need some solution so that I can gat the correct time in any timezone relative to UTC with correct DST adjustments. | 0 | [
2,
184,
20,
8406,
13,
11440,
85,
20,
85,
19,
186,
89,
85,
2464,
19,
272,
5910,
800,
3726,
3726,
31,
589,
638,
19,
272,
5910,
9,
2328,
13,
8,
13,
9,
2328,
13,
16488,
25,
172,
9,
387,
56,
630,
1270,
555,
19583,
128,
421,
85,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Suggestions for requirements development tools that support CMMI objectives
===
We are currently evolving our development processes in an effort to become CMMI compliant (we will start with level 2, and move up from there). We are trying to locate a tool that is inexpensive (or free) that will allow us to develop requirements in the spirit of CMMI. In other words, we need to be able to enter our requirements, track changes to them, provide alerts to individuals when requirements change, perform traceability, etc. Our projects are typically small (typically 3 - 7 developers and a tester or two).
We have looked at many of the commercial tools, but they cost more than we are able to afford. We looked at a few on SourceForge (OSRM and others) but could not find anything that was sufficiently mature that also had the features that we needed.
We are looking for suggestions for a tool that meets the above requirements. | 0 | [
2,
18389,
26,
4786,
522,
4672,
30,
555,
2390,
1435,
12471,
800,
3726,
3726,
95,
50,
871,
22363,
318,
522,
5102,
19,
40,
2150,
20,
533,
2390,
1435,
13,
25509,
13,
5,
458,
129,
799,
29,
662,
172,
15,
17,
780,
71,
37,
80,
6,
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... |
Page breaks in Dynamic Ax Reports
===
How do you insert page breaks in Dynamic AX reports? | 0 | [
2,
2478,
7947,
19,
7782,
21,
396,
2813,
800,
3726,
3726,
184,
107,
42,
14692,
2478,
7947,
19,
7782,
21,
396,
2813,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How best to use jQuery: with HTML or CSS for formatting.
===
As part of learning jQuery, I decided to do a simple tic-tac-toe game in JavaScript and, at the moment, I'm using a HTML table for spacing and using graphic images within the table.
The images are either a small circle or a big X or O. When the user clicks on a circle, it changes to an X or O then checks whether the game has been won.
Lame, I know, but it's a good educational experience.
The images are all the same size (circle has a lot of white space) to ensure table size doesn't change.
My question is two-fold.
1/ Should I be using CSS rather than tables to do the formatting and how would that best be done (HTML tables are very easy)?
2/ Is there a better way than using images so that I don't have to create the JPGs before hand? I tried with text labels (<a>) but the changing colors and underlines annoyed me?
As you can probably tell, I'm comfortable with HTML but not so with CSS. | 0 | [
2,
184,
246,
20,
275,
487,
8190,
93,
45,
29,
13,
15895,
54,
272,
18,
18,
26,
2595,
1203,
9,
800,
3726,
3726,
28,
141,
16,
2477,
487,
8190,
93,
15,
31,
868,
20,
107,
21,
1935,
13,
1786,
8,
6981,
8,
262,
62,
250,
19,
8247,
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 to find all the tables in MySQL with a specific column name in it
===
I have 2-3 different column names that I want to look up in the entire DB and list out all tables which has those columns. Any easy script? | 0 | [
2,
184,
20,
477,
65,
14,
7484,
19,
51,
18,
22402,
29,
21,
1903,
4698,
204,
19,
32,
800,
3726,
3726,
31,
57,
172,
8,
240,
421,
4698,
1817,
30,
31,
259,
20,
361,
71,
19,
14,
1078,
13,
9007,
17,
968,
70,
65,
7484,
56,
63,
273... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
OR Mapper?
===
Is Linq a kind of OR Mapper? | 0 | [
2,
54,
2942,
1432,
60,
800,
3726,
3726,
25,
6294,
1251,
21,
825,
16,
54,
2942,
1432,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
C# and .NET FOLDERID
===
How do I use Windows Vista's FOLDERID API in order to retrieve filepaths for "known folders" such as System or Windows? I've seen some APIs but I don't know how to import them properly. And yes, I know this is a very newbie question, but I spent a half hour googling and couldn't find the answer; I'd also appreciate a way to find an answer to questions like this in the future. :-) | 0 | [
2,
272,
5910,
17,
13,
9,
2328,
19294,
1340,
800,
3726,
3726,
184,
107,
31,
275,
1936,
13520,
22,
18,
19294,
1340,
21,
2159,
19,
389,
20,
11917,
3893,
8353,
18,
26,
13,
7,
2929,
19294,
18,
7,
145,
28,
329,
54,
1936,
60,
31,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
BGGA closures as a bolt-on solution to java?
===
Yesterday @headius / Charles Nutter came up with a very interesting idea on twitter:
@danny_l Gafter made the same mistake; I don't mean a forked Java any more than Groovy is a fork. I want a "mostly Java" with closures.
or the reply by @danny_l / Danny Lagrouw:
@headius or could the BGGA prototype be "bolted on" any future version of Java? That might be useful
That really is what I would like to see as well. Can't we have some sort of bytecode preprocessor to make the BGGA prototype work on any modern Java version? I mean scala, Groovy and JRuby have closures and produce valid bytecode!
I would even like to help and put effort in it. Although I don't really know where to start.
(the above is an excerpt of the [blogpost][1] I wrote about this topic)
What do others think of this idea?
[1]: http://maas-frensch.com/peter/2008/10/11/i-want-closures-bolted-on-to-java/ | 0 | [
2,
13,
19924,
1136,
7790,
18,
28,
21,
7611,
8,
218,
4295,
20,
8247,
60,
800,
3726,
3726,
7124,
13,
1,
1743,
2366,
13,
118,
922,
8619,
815,
281,
71,
29,
21,
253,
4883,
882,
27,
10623,
45,
13,
1,
2793,
1536,
1,
255,
489,
5162,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 use upload a file without using form
===
in a web application I am building, I need to upload photos without using form otherwise it will come up with form embedded in an outer from which is not permitted in XHTML, I think uploading files is what jQuery.post should be able to do, but I currently can't figure out how to do this using jQuery. | 0 | [
2,
184,
20,
275,
71,
8294,
21,
3893,
366,
568,
505,
800,
3726,
3726,
19,
21,
2741,
3010,
31,
589,
353,
15,
31,
376,
20,
71,
8294,
7064,
366,
568,
505,
3190,
32,
129,
340,
71,
29,
505,
12138,
19,
40,
4896,
37,
56,
25,
52,
738... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 can I find a large AJAX loader .gif?
===
I searched the Web, but the most I was able to find was 180x180 pixels. I'm looking for a ajax loader .gif animation that is at least 400x400 pixels. Thanks. | 0 | [
2,
113,
92,
31,
477,
21,
370,
20624,
6305,
106,
13,
9,
263,
821,
60,
800,
3726,
3726,
31,
9036,
14,
2741,
15,
47,
14,
127,
31,
23,
777,
20,
477,
23,
9094,
396,
8888,
18146,
18,
9,
31,
22,
79,
699,
26,
21,
20624,
6305,
106,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Defining operators in Boo
===
I'm looking to move some of my lighter weight metaprogramming from Nemerle to Boo and I'm trying to figure out how to define custom operators. For example, I can do the following in Nemerle:
macro @<-(func, v) {
<[ $func($v) ]>
}
foo <- 5 == foo(5)
I can't find a way of doing this in Boo -- any ideas? | 0 | [
2,
14684,
9475,
19,
9827,
800,
3726,
3726,
31,
22,
79,
699,
20,
780,
109,
16,
51,
9359,
1763,
7618,
19746,
3863,
37,
16714,
106,
413,
20,
9827,
17,
31,
22,
79,
749,
20,
1465,
70,
184,
20,
9267,
5816,
9475,
9,
26,
823,
15,
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... |
Rails check if yield :area is defined in content_for
===
I want to do a conditional rendering at the layout level based on the actual template has defined content_for(:an__area), any idea how to get this done? | 0 | [
2,
2240,
18,
2631,
100,
11537,
13,
45,
17760,
25,
2811,
19,
2331,
1,
1106,
800,
3726,
3726,
31,
259,
20,
107,
21,
21206,
15307,
35,
14,
9106,
662,
432,
27,
14,
3463,
22894,
63,
2811,
2331,
1,
1106,
5,
45,
210,
1,
17760,
6,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Problem with NotifyIcon.ShowBalloonTip - balloon not showing up
===
I'm having trouble with something that I thought would be easy...
I can't get my NotifyIcon to show a balloon tip. The basic code is:
public void ShowSystrayBubble(string msg, int ms)
{
sysTrayIcon.Visible = true;
sysTrayIcon.ShowBalloonTip(20, "Title", "Text", ToolTipIcon.None);
}
Nothing happens when I execute this code. I read that the timeout arg may be in seconds or ms, can't tell, so I tried both and neither works.
I'm using WinXP, .NET 3.5.
Thanks,
-Greg
| 0 | [
2,
1448,
29,
52,
8612,
49,
1126,
9,
9303,
3610,
5709,
10169,
13,
8,
10876,
52,
3187,
71,
800,
3726,
3726,
31,
22,
79,
452,
2572,
29,
301,
30,
31,
289,
83,
44,
2010,
9,
9,
9,
31,
92,
22,
38,
164,
51,
52,
8612,
49,
1126,
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... |
Boo vs. IronPython
===
After having looked at each of these two projects, it seems that both are VERY similar. Both run on top of the CLI, both have python style syntax, both use .NET instead of the standard python libraries.
So, what are the differences between them and advantages of each? | 0 | [
2,
9827,
4611,
9,
1751,
6448,
11570,
800,
3726,
3726,
75,
452,
292,
35,
206,
16,
158,
81,
2314,
15,
32,
2206,
30,
156,
50,
253,
835,
9,
156,
485,
27,
371,
16,
14,
19391,
15,
156,
57,
20059,
1034,
22649,
15,
156,
275,
13,
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... |
Pros & Cons of putting all code in Header files in C++ ?
===
You can structure a C++ program so that (almost) all the code resides in Header files. It essentially looks like a C# or Java program. However, you do need atleast one .cpp file to pull in all the Header files when compiling. Now I know some people would absolutely detest this idea. But I haven't found any convincing downsides of doing this. I can list some advantages:
[1] Faster compile times. All header files only get parsed once, because there is only one .cpp file. Also, one header file cannot be included more than once, otherwise you will get a build break. There are other ways of achieving faster compiles when using the alternate approach, but this is so simple.
[2] It avoids circular dependencies, by making them absolutely clear. If ClassA in ClassA.h has a circular dependency on ClassB in ClassB.h, I have to put a forward reference & it sticks out. (Note that this is unlike C# & Java where the compiler automatically resolves circular dependencies. This encourages bad coding practices IMO). Again, you can avoid circular dependencies if your code was in .cpp files, but in a real-world project, cpp files tend to include random headers until you can't figure out who depends on whom.
Your thoughts? | 0 | [
2,
895,
18,
279,
11608,
16,
3873,
65,
1797,
19,
157,
106,
6488,
19,
272,
20512,
13,
60,
800,
3726,
3726,
42,
92,
1411,
21,
272,
20512,
625,
86,
30,
13,
5,
18135,
6,
65,
14,
1797,
12631,
19,
157,
106,
6488,
9,
32,
7398,
1879,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 sorts of things should I do to make a performant and robust reflection cache?
===
In .NET 3.5, I'm going to be working with System.Reflection to use AOP (probably in the context of Castle's Windsor Interceptors) to do things like define which security actions need to be performed at the method level, etc. I have heard that some parts of Reflection are slow (I've read the MSDN article around it), and would like to cache these parts (when I get closer to production code, at any rate). I would like to validate my approach:
* cache key is {type} + {case sensitive method name} + {list of parameter types}
* cache key objects can be compared via an Equals operation
* cache payload is a {MethodInfo} + {list of custom-attributes defined on the method}
* cache is injected to my interceptors via constructor injection
* cache can be maintained for a long time (based on the assumption that I'm not going to be writing self-modifying code ;-) ) | 0 | [
2,
98,
14357,
16,
564,
378,
31,
107,
20,
233,
21,
2985,
1830,
17,
15313,
9138,
16522,
60,
800,
3726,
3726,
19,
13,
9,
2328,
203,
9,
264,
15,
31,
22,
79,
228,
20,
44,
638,
29,
329,
9,
27977,
872,
20,
275,
21,
2594,
13,
5,
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... |
Assembly not saving correctly
===
I have some very simple code to generate an assembly and invoke a method on a contained type. The method gets called and runs correctly, however when I view the generated assembly using Reflector, I don't see the type.
Below is the sample code:
namespace ConsoleApplication2
{
class Proggy
{
public static void Main(string[] args)
{
var ab = AppDomain.CurrentDomain.DefineDynamicAssembly(
new AssemblyName() { Name = "MyAssembly" },
AssemblyBuilderAccess.RunAndSave);
var module = ab.DefineDynamicModule(ab.GetName().Name);
var typeBuilder = module.DefineType("MyType");
var ctr = typeBuilder.DefineConstructor(MethodAttributes.Public,
CallingConventions.Standard, Type.EmptyTypes);
var ilgc = ctr.GetILGenerator();
ilgc.Emit(OpCodes.Ldarg_0);
ilgc.Emit(OpCodes.Call, typeof(object).GetConstructor(Type.EmptyTypes));
ilgc.Emit(OpCodes.Ret);
var method = typeBuilder.DefineMethod("MyMethod", MethodAttributes.Public,
typeof(int), new[] { typeof(string) });
var ilg = method.GetILGenerator();
ilg.Emit(OpCodes.Ldarg_1);
ilg.EmitCall(OpCodes.Callvirt, typeof(string).GetProperty("Length").GetGetMethod(),
null);
ilg.Emit(OpCodes.Ret);
var type = typeBuilder.CreateType();
ab.Save("mytestasm.dll");
var inst = Activator.CreateInstance(type);
Console.WriteLine(type.InvokeMember("MyMethod", BindingFlags.InvokeMethod, null, inst,
new[] { "MyTestString" }));
Console.ReadLine();
}
}
}
and here is the corresponding disassembly from Reflector:
.assembly MyAssembly
{
.ver 0:0:0:0
.hash algorithm 0x00008004
}
.module RefEmit_OnDiskManifestModule
// MVID: {0B944140-58D9-430E-A867-DE0AD0A8701F}
// Target Runtime Version: v2.0.50727
... and ...
{
.class private auto ansi <Module>
{
}
}
Can anyone help me with getting the assembly properly saved?
| 0 | [
2,
1475,
52,
7599,
12044,
800,
3726,
3726,
31,
57,
109,
253,
1935,
1797,
20,
7920,
40,
1475,
17,
28371,
21,
2109,
27,
21,
3437,
1001,
9,
14,
2109,
3049,
227,
17,
1461,
12044,
15,
207,
76,
31,
1418,
14,
6756,
1475,
568,
6907,
248... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 decompiler
===
I am searching for a decompiler for a C program. The binary is a 32bit linux executable. Objdump works fine, so basically I am searching for something which attempts to reconstruct the C source from the asm source. | 0 | [
2,
272,
121,
11103,
49,
1252,
800,
3726,
3726,
31,
589,
5792,
26,
21,
121,
11103,
49,
1252,
26,
21,
272,
625,
9,
14,
14171,
25,
21,
2512,
3326,
13024,
1396,
17194,
5924,
9,
5122,
728,
43,
11134,
693,
1123,
15,
86,
11374,
31,
589... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... |
How do I programmatically calculate Poker Odds?
===
I'm trying to write a simple game/utility to calculate poker odds. I know there's plenty of [resources][1] that talk about the formulas to do so, but I guess I'm having trouble translating that to code. Particularly, I'm interested in Texas Hold-em ...
I understand that there are several different approaches, one being that you can calculate the odds that you will draw some hand based on the cards you can see. The other approach is calculating the odds that you will win a certain hand. The second approach seems much more complex as you'd have to enter more data (how many players, etc.)
I'm not asking that you write it for me, but some nudges in the right direction would help :-)
[1]: http://wikipedia.org/wiki/Poker_probability_(Texas_hold_'em) | 0 | [
2,
184,
107,
31,
625,
6732,
1326,
18469,
12453,
10941,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
1935,
250,
118,
14255,
856,
20,
18469,
12453,
10941,
9,
31,
143,
80,
22,
18,
7062,
16,
636,
99,
12097,
18,
500,
2558,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 easiest way to align the Z axis with a point?
===
Given a point such as (0, 0, 0) and a vector like (x, y, z). What is the easiest way to align the negative Z-axis centered at (0, 0, 0) to point in the direction of this vector? | 0 | [
2,
98,
25,
14,
27237,
161,
20,
23389,
14,
2052,
8577,
29,
21,
454,
60,
800,
3726,
3726,
504,
21,
454,
145,
28,
13,
5,
387,
15,
713,
15,
713,
6,
17,
21,
7497,
101,
13,
5,
396,
15,
13,
93,
15,
2052,
6,
9,
98,
25,
14,
27237... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 good rules of thumb for python imports?
===
I am a little confused by the multitude of ways in which you can import modules in python.
import X
import X as Y
from A import B
I have been reading up about scoping and namespaces but I would like some practical advice on what is the best strategy, under which circumstances and why. Should imports happen at a module level or a method/function level? In the `__init__.py` or in the module code itself?
My question is not really answered by [this post][1] although it is obviously related.
[1]: http://stackoverflow.com/questions/45122/python-packages-import-by-class-not-file | 0 | [
2,
98,
50,
254,
1761,
16,
5078,
26,
20059,
20617,
60,
800,
3726,
3726,
31,
589,
21,
265,
4230,
34,
14,
22980,
16,
2847,
19,
56,
42,
92,
9010,
17113,
19,
20059,
9,
9010,
993,
9010,
993,
28,
13,
93,
37,
21,
9010,
334,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Call and Callvirt
===
What is the difference between the CIL instructions "Call" and "Callvirt"? | 0 | [
2,
645,
17,
645,
8145,
38,
800,
3726,
3726,
98,
25,
14,
2841,
128,
14,
13,
12837,
7650,
13,
7,
9200,
7,
17,
13,
7,
9200,
8145,
38,
7,
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... |
Flexibility in the project scope?
===
How flexible should a programmer be if a client requests requirements that is not in the project scope? | 0 | [
2,
19401,
19,
14,
669,
9914,
60,
800,
3726,
3726,
184,
13568,
378,
21,
17968,
44,
100,
21,
6819,
12279,
4786,
30,
25,
52,
19,
14,
669,
9914,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
When is a new language the right tool for the job?
===
For a long time I've been trying different languages to find the feature-set I want and I've not been able to find it. I have languages that fit decently for various projects of mine, but I've come up with an intersection of these languages that will allow me to do 99.9% of my projects in a single language. I want the following:
- Built on top of .NET or has a .NET implementation
- Has few dependencies on the .NET runtime both at compile-time and runtime (this is important since one of the major use cases is in embedded development where the .NET runtime is completely custom)
- Has a compiler that is 100% .NET code with no unmanaged dependencies
- Supports arbitrary expression nesting (see below)
- Supports custom operator definitions
- Supports type inference
- Optimizes tail calls
- Has explicit immutable/mutable definitions (nicety -- I've come to love this but can live without it)
- Supports real macros for strong metaprogramming (absolute must-have)
The primary two languages I've been working with are Boo and Nemerle, but I've also played around with F#.
Main complaints against Nemerle: The compiler has horrid error reporting, the implementation is buggy as hell (compiler and libraries), the macros can only be applied inside a function or as attributes, and it's fairly heavy dependency-wise (although not enough that it's a dealbreaker).<br />
Main complaints against Boo: No arbitrary expression nesting (dealbreaker), macros are difficult to write, no custom operator definition (potential dealbreaker).<br />
Main complaints against F#: Ugly syntax, hard to understand metaprogramming, non-free license (epic dealbreaker).
So the more I think about it, the more I think about developing my own language.
Pros:
- Get the exact syntax I want
- Get a turnaround time that will be a good deal faster; difficult to quantify, but I wouldn't be surprised to see 1.5x developer productivity, especially due to the test infrastructures this can enable for certain projects
- I can easily add custom functionality to the compiler to play nicely with my runtime
- I get something that is designed and works <i>exactly</i> the way I want -- as much as this sounds like NIH, this will make my life easier
Cons:
- Unless it can get popularity, I will be stuck with the burden of maintenance. I know I can at least get the Nemerle people over, since I think everyone wants something more professional, but it takes a village.
- Due to the first con, I'm wary of using it in a professional setting. That said, I'm already using Nemerle and using my own custom modified compiler since they're not maintaining it well at all.
- If it doesn't gain popularity, finding developers will be much more difficult, to an extent that <a href="http://www.paulgraham.com/pypar.html">Paul Graham</a> might not even condone.
So based on all of this, what's the general consensus -- is this a good idea or a bad idea? And perhaps more helpfully, have I missed any big pros or cons? | 0 | [
2,
76,
25,
21,
78,
816,
14,
193,
5607,
26,
14,
1205,
60,
800,
3726,
3726,
26,
21,
175,
85,
31,
22,
195,
74,
749,
421,
2556,
20,
477,
14,
1580,
8,
3554,
31,
259,
17,
31,
22,
195,
52,
74,
777,
20,
477,
32,
9,
31,
57,
2556,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 good open source BDD tools for C/C++?
===
I love the Ruby RSpec BDD development style. Are there any good tools for doing this with C/C++? | 0 | [
2,
50,
80,
186,
254,
368,
1267,
334,
8096,
4672,
26,
272,
118,
150,
20512,
60,
800,
3726,
3726,
31,
339,
14,
10811,
13,
1224,
12610,
334,
8096,
522,
1034,
9,
50,
80,
186,
254,
4672,
26,
845,
48,
29,
272,
118,
150,
20512,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to correctly name a variable which represents a value of 1 - n?
===
It obviously depends on the context you are using them in but, I was wondering if there is a universally accepted way to name such variables, or at least in a mathematical context.
I've often seen:
float k = someValue;
float oneMinusK = 1 - k;
...which seems as descriptive as much as meaningless to me.
Thanks.
| 0 | [
2,
184,
20,
12044,
204,
21,
7612,
56,
4719,
21,
1923,
16,
137,
13,
8,
13,
103,
60,
800,
3726,
3726,
32,
4409,
9597,
27,
14,
4141,
42,
50,
568,
105,
19,
47,
15,
31,
23,
5712,
100,
80,
25,
21,
24365,
2217,
161,
20,
204,
145,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 your best/funniest/annoying performance tuning experience?
===
Often we find changing a few lines of code makes n-fold performance increases in applications.
One such experience for me was fixing an issue in the configuration library. The library was based on XML configuration file and XPath was used to access the configuration. During profiling, I found an enormous number of XPath objects and calls to XPath which came from the configuration library.
The application constantly looked up the configuration to perform tasks including logging - which referenced configuration multiple times even during a single client request.
By introducing a cache of the configuration values, applications using the library saw a 100% performance increase.
What is your best / funniest / annoying performance tuning experience?
(Also, can you please share what tools you use to find such issues?) | 4 | [
2,
98,
25,
154,
246,
118,
16638,
17065,
38,
118,
28328,
68,
956,
19253,
1496,
60,
800,
3726,
3726,
478,
95,
477,
4226,
21,
310,
1560,
16,
1797,
1364,
13,
103,
8,
8814,
956,
7104,
19,
3767,
9,
53,
145,
1496,
26,
55,
23,
20047,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 function prototypes dynamically in PHP
===
I'm writing a construct in PHP where a parser determins which function to call dynamically, kind of like this:
// The definition of what to call
$function_call_spec = array( "prototype" => "myFunction",
"parameters" => array( "first_par" => "Hello",
"second_par" => "World"));
// Dispatch
$funcPrototype = $function_call_spec["prototype"];
$funcPrototype(); // Here we call function 'myFunction'.
This is all fine and dandy. But now comes the next step, passing the parameters, which I don't really know if it's possible the way I want to do it. It never stops amazing me however what script languages can do these days, so here goes:
One could pass the parameters to the function like this:
// Here we call function 'myFunction' with the array of parameters.
$funcPrototype( $function_call_spec["parameters"] );
However, I want to declare 'myFunction' properly with clear arguments etc:
function myFunction( $first_par, $second_par )
{
}
The question then follows - Is there any way to pass parameters to a function dynamically simply by looping through the parameter array?
To clarify, I **don't** want to do it like this:
$funcPrototype( $function_call_spec["parameters"]["first_par"],
$function_call_spec["parameters"]["second_par"] );
Because this requires my code to statically know details about myFunction, which goes against the whole idea.
Instead I would want to do it in some way like this maybe:
// Special magic PHP function which can be used for invoking functions dynamically
InvokeFunction( $funcPrototype, $function_call_spec["parameters"] );
Which then results in myFunction being called and all parameters in the array gets passed to each individual parameter variable in the prototype.
Any comments are welcome.
Regards.
/R
PS: None of the code in this post has been tested for typos etc.
| 0 | [
2,
568,
1990,
7063,
18,
7782,
1326,
19,
13,
26120,
800,
3726,
3726,
31,
22,
79,
1174,
21,
6960,
19,
13,
26120,
113,
21,
2017,
4104,
15190,
2160,
18,
56,
1990,
20,
645,
7782,
1326,
15,
825,
16,
101,
48,
45,
12894,
14,
5465,
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... |
Anti virus integration with .net application
===
I would like to use anti virus integration with my .net application when uploading files using the application. Has any anti virus API available for .Net? | 0 | [
2,
1082,
6231,
8078,
29,
13,
9,
2328,
3010,
800,
3726,
3726,
31,
83,
101,
20,
275,
1082,
6231,
8078,
29,
51,
13,
9,
2328,
3010,
76,
71,
16866,
6488,
568,
14,
3010,
9,
63,
186,
1082,
6231,
21,
2159,
904,
26,
13,
9,
2328,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Users Authentication in ASP.NET
===
I was wondering, what's the best approach in creating users authentication for my asp.net-mvc web application.
Should I use the Forms authentication using a custom MembershipProvider ?
Or should I implement my own login and registration mechanism for my users? | 0 | [
2,
3878,
27963,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
23,
5712,
15,
98,
22,
18,
14,
246,
2141,
19,
2936,
3878,
27963,
26,
51,
28,
306,
9,
2328,
8,
79,
8990,
2741,
3010,
9,
378,
31,
275,
14,
1997,
27963,
568,
21,
5816,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to implement a petition? (email send after signing the petition)
===
I need to build a little webapp but I'm not sure what is the best thing to do.
A person that subscribe the petition is signing an email sent to *X*. This will be also saved to a db in order to show online who subscribed.
The idea is to have a standard text message, the user submit his name and that name goes into the message as signature.
I could make php send the email with the address of the real sender, or let the user copy and paste the text and let him send the email on his own.
I'm not sure of what is the best way to implement it. What will be more "effective", I mean as number of subscribers the solution where the app send the email is easier, but what about the authenticity of the emails? They could be considered not valid if sent all from the same place? | 0 | [
2,
98,
25,
14,
246,
161,
20,
8713,
21,
7453,
60,
13,
5,
62,
8079,
2660,
75,
5479,
14,
7453,
6,
800,
3726,
3726,
31,
376,
20,
1895,
21,
265,
2741,
7753,
47,
31,
22,
79,
52,
562,
98,
25,
14,
246,
584,
20,
107,
9,
21,
840,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 download the VS2008 "Test Project" template?
===
For some reason, my visual studio 2008 installation doesn't have the "Create Test Project" template installed. I'm assuming I should be able to download it from somewhere on MSDN, but I cannot find it anywhere (Guess my Google-Fu is weak)
Does anyone know where I can get the template to install it?
Thanks
| 0 | [
2,
25,
32,
938,
20,
7121,
14,
4611,
2753,
13,
7,
10543,
669,
7,
22894,
60,
800,
3726,
3726,
26,
109,
1215,
15,
51,
3458,
1120,
570,
7758,
1437,
22,
38,
57,
14,
13,
7,
6037,
1373,
1289,
669,
7,
22894,
4066,
9,
31,
22,
79,
117... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Unicode issues with acts_as_taggable_on_steroids
===
I'm implementing a blog with tags with some French characters. My question has to do with how to deal with spaces and unicode (utf-8) characters in the url.
let's say I have a tag called: ohlàlà! and I have the following code in my tag cloud:
<%= link_to h(tag.name.capitalize), { :controller => :blog, :action => :tag, :id => h(tag.name) }, :class => css_class %>
How do I deal with this issue?
| 0 | [
2,
28010,
1549,
29,
3167,
1,
472,
1,
536,
4572,
579,
1,
218,
1,
20641,
18,
800,
3726,
3726,
31,
22,
79,
17333,
21,
8146,
29,
3383,
18,
29,
109,
484,
1766,
9,
51,
1301,
63,
20,
107,
29,
184,
20,
1183,
29,
7644,
17,
28010,
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... |
How do you remove obsolete publications in the Replication Monitor?
===
Through some bungling in creating and removing publications, I was left with a lot of obsolete publications which for some reason still remains in the Replication Monitor.
How do you remove these publications? It doesn't seem to have a clear way to remove them.
| 0 | [
2,
184,
107,
42,
4681,
18562,
4411,
19,
14,
23841,
7626,
60,
800,
3726,
3726,
120,
109,
13,
26172,
802,
19,
2936,
17,
9096,
4411,
15,
31,
23,
225,
29,
21,
865,
16,
18562,
4411,
56,
26,
109,
1215,
174,
1678,
19,
14,
23841,
7626,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Records not replicated when inserted by custom replication stored procedure.
===
I've just recently setup a custom replication for my subscriber database, as described in [another post here][1]. Basically, when the publisher pushes a new record to the subscribers, the stored procedure will also insert a replicated time into an extra column in the table, and insert a new record to a log table.
My problem occurs when trying to replicate the log table back to the main publication database. This is what I did:
1. In the database where the log table is located, I setup a new transactional replication, and set it to create a snapshot.
2. Once the publication is created, I create a new push subscription, and set it to initialize immediately.
3. Once the subscription is created, I checked the synchronization status and confirm that the snapshot is applied successfully.
Now here's the weird part: if I manually add a record to the log table using the SQL Server Management Studio, the record will be replicated fine. If the record is added by the custom replication stored procedure, it will not. The status will always display "No replicated transactions are available".
I have no clue why the publication is behaving this way: I really don't see how it is treating the data inserted by the custom replication stored procedure differently.
Can someone explain what may I've done wrong?
[1]: http://stackoverflow.com/questions/161890/how-do-you-track-the-time-of-replicated-rows-for-subscribers-in-sql-server-2005 | 0 | [
2,
742,
52,
22156,
43,
76,
14215,
34,
5816,
23841,
8214,
7004,
9,
800,
3726,
3726,
31,
22,
195,
114,
1989,
18161,
21,
5816,
23841,
26,
51,
13,
20330,
139,
6018,
15,
28,
745,
19,
636,
14945,
678,
235,
500,
2558,
165,
500,
9,
1137... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
ArrayIndexOutOfBoundsException in XMLEntityScanner.peekChar reading XML from HttpRequest
===
I'm reading XML data from the HttpServletRequest in my servlets doPost() and passing the Reader from req.getReader() to a JAXB unmarshaller. I've tried a couple of different input XMLs but I always get this exception.
SEVERE: Servlet.service() for servlet RESTPhotoAdmin threw exception
java.lang.ArrayIndexOutOfBoundsException: 8192
at com.sun.org.apache.xerces.internal.impl.XMLEntityScanner.peekChar(XMLEntityScanner.java:491)
at com.sun.org.apache.xerces.internal.impl.XMLDocumentFragmentScannerImpl$FragmentContentDriver.next(XMLDocumentFragmentScannerImpl.java:2672)
at com.sun.org.apache.xerces.internal.impl.XMLDocumentScannerImpl.next(XMLDocumentScannerImpl.java:647)
at com.sun.org.apache.xerces.internal.impl.XMLNSDocumentScannerImpl.next(XMLNSDocumentScannerImpl.java:140)
at com.sun.org.apache.xerces.internal.impl.XMLDocumentFragmentScannerImpl.scanDocument(XMLDocumentFragmentScannerImpl.java:508)
at com.sun.org.apache.xerces.internal.parsers.XML11Configuration.parse(XML11Configuration.java:807)
at com.sun.org.apache.xerces.internal.parsers.XML11Configuration.parse(XML11Configuration.java:737)
at com.sun.org.apache.xerces.internal.parsers.XMLParser.parse(XMLParser.java:107)
at com.sun.org.apache.xerces.internal.parsers.AbstractSAXParser.parse(AbstractSAXParser.java:1205)
at com.sun.org.apache.xerces.internal.jaxp.SAXParserImpl$JAXPSAXParser.parse(SAXParserImpl.java:522)
at com.sun.xml.internal.bind.v2.runtime.unmarshaller.UnmarshallerImpl.unmarshal0(UnmarshallerImpl.java:195)
at com.sun.xml.internal.bind.v2.runtime.unmarshaller.UnmarshallerImpl.unmarshal(UnmarshallerImpl.java:168)
at javax.xml.bind.helpers.AbstractUnmarshallerImpl.unmarshal(AbstractUnmarshallerImpl.java:137)
at javax.xml.bind.helpers.AbstractUnmarshallerImpl.unmarshal(AbstractUnmarshallerImpl.java:194)
at com.cantorva.gigcalendar.servlets.rest.RESTPhotoAdmin.doPost(RESTPhotoAdmin.java:41)
This only happens on by Live web server not on the local development machine. Whatever the input is (though I only tried approx 90k inputs) the message portion of the stack trace always reads "8192". I looked up XMLEntityScanner.java line 491 and get see a buffer being read, and the buffer is indeed an array. I makes sense to me that an 8k buffer can't be read using a zero based index of 8192 so this must be a bug - but what's the cause and what can I do?
----------
I'm asking this having already found the answer through lots of detective work. I wanted to save the next poor guy the hassle since Apache have already refused to fix it. | 0 | [
2,
7718,
25671,
1320,
1041,
7410,
18,
10066,
872,
19,
23504,
2291,
856,
18,
1245,
1031,
9,
1664,
2354,
5433,
1876,
23504,
37,
7775,
99,
10351,
800,
3726,
3726,
31,
22,
79,
1876,
23504,
1054,
37,
14,
7775,
10321,
1336,
99,
10351,
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... |
Model - View - Presenter with Virtual Grid
===
What is the best breakdown of responsibility when using a virtual grid and the MVP pattern in a winforms application.
including:
1. Getting callbacks from the grid on user changed cell updates
2. Callback from the grid to set the style and value of a cell given a row and column
| 0 | [
2,
1061,
13,
8,
1418,
13,
8,
9391,
29,
6599,
7354,
800,
3726,
3726,
98,
25,
14,
246,
13369,
16,
4024,
76,
568,
21,
6599,
7354,
17,
14,
13552,
3732,
19,
21,
628,
4190,
18,
3010,
9,
215,
45,
137,
9,
1017,
645,
1958,
18,
37,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to track changes in a form via javascript?
===
I'd like to track changes in inputs in a form via javascript. My intent is (but not limited) to
- enable "save" button only when something has changed
- alert if the user wants to close the page and something is not saved
Ideas?
| 0 | [
2,
98,
25,
14,
246,
161,
20,
792,
1693,
19,
21,
505,
1197,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
792,
1693,
19,
6367,
18,
19,
21,
505,
1197,
8247,
8741,
9,
51,
6936,
25,
13,
5,
811,
52,
1317,
6,
20,
13,
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... |
Retrieve calling url in Java Webservice
===
We have a web service that is deployed on 2 separate machines in different locations. Is it possible to monitor the url that a person used to call our webservice using java code? We have a 3DNS url set up and we want all clients to use this url as oppossed hitting the boxes directly with the correct port numbers in the url.
Thanks
Damien | 0 | [
2,
11917,
2555,
287,
6362,
19,
8247,
2741,
11449,
800,
3726,
3726,
95,
57,
21,
2741,
365,
30,
25,
6698,
27,
172,
1725,
6035,
19,
421,
4095,
9,
25,
32,
938,
20,
7626,
14,
287,
6362,
30,
21,
840,
147,
20,
645,
318,
2741,
11449,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 If a system has powered on
===
I am writing a script that powers on a system via network . And then i need to run a few commands on the other host. How do I know whether the system has powered on ...
My prog language is perl and the target host is RHEL5.
Is there any kernel interrupt or network boot information that indicates the system has powered on and the os has loaded.
[In a different scenario] I was also wondering just in case if i just switch on my Machine manually. when is it exactly said to have powered on. and when is the OS is supposed to have booted completely for a network related operation such as executing a network command there. What if the system is on DHCP how would a remote system then search for this machine [i guess it is possible via mac address. but if i am wrong ].
If I have missed out any info please feel free to ask me .. If you have any suggestions to make the task easier please surface them :)
thanx
imkin | 0 | [
2,
184,
20,
100,
21,
329,
63,
7462,
27,
800,
3726,
3726,
31,
589,
1174,
21,
3884,
30,
2737,
27,
21,
329,
1197,
982,
13,
9,
17,
94,
31,
376,
20,
485,
21,
310,
14294,
27,
14,
89,
2015,
9,
184,
107,
31,
143,
1472,
14,
329,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to deprecate a function in PHP?
===
At the team with which I work, we have an old codebase using PHP's ibase_* functions all over the code to communicate with database. We created a wrapper to it that would do something else beside just calling the original function and I did a mass search-replace in the entire code to make sure that wrapper is used instead.
Now, how do we prevent usage of ibase_* functions in the future?
Preferably, I'd like to still have them available, but make it throw a NOTICE or WARNING when it is used.
A solution in pure PHP (not needing to compile a custom version of PHP) is preferred. | 0 | [
2,
184,
20,
121,
3515,
9530,
21,
1990,
19,
13,
26120,
60,
800,
3726,
3726,
35,
14,
173,
29,
56,
31,
170,
15,
95,
57,
40,
315,
1797,
8436,
568,
13,
26120,
22,
18,
31,
8436,
1,
2483,
3719,
65,
84,
14,
1797,
20,
8709,
29,
6018,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Ant still the best choice for a Java build tool?
===
From my small amount of experience, I've only used Ant as a build tool. Are there any other projects which are better, and why? | 0 | [
2,
25,
40,
38,
174,
14,
246,
1837,
26,
21,
8247,
1895,
5607,
60,
800,
3726,
3726,
37,
51,
284,
2006,
16,
1496,
15,
31,
22,
195,
104,
147,
40,
38,
28,
21,
1895,
5607,
9,
50,
80,
186,
89,
2314,
56,
50,
574,
15,
17,
483,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
C# how can you get output of an other batch file?
===
I have to use an other application (console) to pass some parameter to this program and inside my C# program get the output of that program. I would like not to see the console (all invisible to the user). How can I do that? | 0 | [
2,
272,
5910,
184,
92,
42,
164,
5196,
16,
40,
89,
13064,
3893,
60,
800,
3726,
3726,
31,
57,
20,
275,
40,
89,
3010,
13,
5,
12124,
6069,
6,
20,
1477,
109,
18906,
20,
48,
625,
17,
572,
51,
272,
5910,
625,
164,
14,
5196,
16,
30,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Alternative Reverse Proxy Architecture Directions
===
Currently, I've got an expensive license for a reverse proxy server in an environment that is mostly Tomcat.
I'm thinking of one or both of the following upgrades.
1. Using [Squid][1] instead of the expensive licensed product.
2. Using some Apache2 settings for caching. Right now, I'm vague on the details, but perhaps mod_proxy will work here?
Where should I invest my time? What's a good, low-risk reverse proxy approach?
[1]: http://www.squid-cache.org/ | 0 | [
2,
2676,
7006,
27188,
2607,
7876,
800,
3726,
3726,
871,
15,
31,
22,
195,
330,
40,
5381,
3962,
26,
21,
7006,
27188,
8128,
19,
40,
2307,
30,
25,
1555,
2067,
5782,
9,
31,
22,
79,
1440,
16,
53,
54,
156,
16,
14,
249,
9483,
18,
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... |
Are there good reasons not to use an ORM?
===
During my apprenticeship, I have used [NHibernate][1] for some smaller projects which I mostly coded and designed on my own. Now, before starting some bigger project, the discussion arose how to design data access and whether or not to use an ORM layer. As I am still in my apprenticeship and still consider myself a beginner in enterprise programming, I did not really try to push in my opinion, which is that using an object relational mapper to the database can ease development quite a lot. The other coders in the development team are much more experienced than me, so I think I will just do what they say. :-)
However, I do not completely understand two of the main reasons for not using NHibernate or a similar project:
1. One can just build one’s own data access objects with SQL queries and copy those queries out of Microsoft SQL Server Management Studio.
2. Debugging an ORM can be hard.
So, of course I could just build my data access layer with a lot of `SELECT`s etc, but here I miss the advantage of automatic joins, lazy-loading proxy classes and a lower maintenance effort if a table gets a new column or a column gets renamed. (Updating numerous `SELECT`, `INSERT` and `UPDATE` queries vs. updating the mapping config and possibly refactoring the business classes and DTOs.)
Also, using NHibernate you can run into unforeseen problems if you do not know the framework very well. That could be, for example, trusting the Table.hbm.xml where you set a string’s length to be automatically validated. However, I can also imagine similar bugs in a “simple” SqlConnection query based data access layer.
Finally, are those arguments mentioned above really a good reason not to utilise an ORM for a non-trivial database based enterprise application? Are there probably other arguments they/I might have missed?
(I should probably add that I think this is like the first “big” .NET/C# based application which will require teamwork. Good practices, which are seen as pretty normal on Stack Overflow, such as unit testing or continuous integration, are non-existing here up to now.)
[1]: http://nhibernate.org/ "NHibernate for .NET" | 0 | [
2,
50,
80,
254,
2932,
52,
20,
275,
40,
54,
79,
60,
800,
3726,
3726,
112,
51,
21669,
15,
31,
57,
147,
636,
13880,
15191,
8820,
500,
2558,
165,
500,
26,
109,
2012,
2314,
56,
31,
1555,
13,
22254,
17,
1006,
27,
51,
258,
9,
130,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.