unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How to version a package containing multiple applications
===
I want to create an MSI installer containing three apps. I will be releasing frequent updates to each app as I work through the list of feature requests and do bug fixes. The three apps are currently at versions 1.6.3, 1.6.12 and 1.8.1 respectively.
I was wondering what you guys can recommend for the version of the package. Should I:
1. Make the package version independent of the versions of the individual apps ?
2. Change the apps so they always have the same version as each other ?
4. Some other suggestion ?
| 0 | [
2,
184,
20,
615,
21,
6030,
3503,
1886,
3767,
800,
3726,
3726,
31,
259,
20,
1600,
40,
4235,
49,
16146,
106,
3503,
132,
4865,
18,
9,
31,
129,
44,
8054,
5408,
16779,
20,
206,
4865,
28,
31,
170,
120,
14,
968,
16,
1580,
12279,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I view the HTTP response to an ActiveResource request?
===
I am trying to debug an ActiveResource call that is not working.
What's the best way to view the HTTP response to the request ActiveResource is making? | 0 | [
2,
184,
107,
31,
1418,
14,
7775,
1627,
20,
40,
1348,
99,
12097,
3772,
60,
800,
3726,
3726,
31,
589,
749,
20,
121,
16254,
40,
1348,
99,
12097,
645,
30,
25,
52,
638,
9,
98,
22,
18,
14,
246,
161,
20,
1418,
14,
7775,
1627,
20,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Memory Leaks in C# WPF
===
I could use some advice on tracking down the cause of memory leaks in C#. I understand what is a memory leak and I get why they occur in C# but I'm wondering what tools/strategies have you used in the past to resolve them?
I am using .NET Memory Profiler and I've found that one of my huge main objects is staying in memory after I close the window it manages but I'm not sure what to do to severe all links to it.
If I'm not being clear enough just post an answer with a question and I'll edit my question in response. Thanks! | 0 | [
2,
1912,
11724,
18,
19,
272,
5910,
619,
7721,
800,
3726,
3726,
31,
110,
275,
109,
4978,
27,
10353,
125,
14,
1679,
16,
1912,
11724,
18,
19,
272,
5910,
9,
31,
1369,
98,
25,
21,
1912,
11724,
17,
31,
164,
483,
59,
3744,
19,
272,
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... |
Using MVC, how should one handle communcation between Views? Between Models?
===
Question number three in my quest to properly understand MVC *before* I implement it:
I have two cases in mind:
1. The primary application
window needs to launch the
preferences window. (One View
invoking another View.)
2. The primary Model for an application
needs to access a property
in the preferences Model. (One Model
accessing another Model.)
These questions are related in that they both involve communication across Model-View-Controller triplets, a topic that I haven't found much discussion of in my Googling.
The obvious way to fix this is to wrap everything in a top-level "application" object that handles transactions between Models and allows Controllers to invoke one another's methods. I have seen this implemented, but I'm not convinced its a good idea. I can also see possibilities involving Controllers observing more than one Model and responding to more than one View, but this seems like its going to become very cluttered and difficult to follow.
Suggestions on how best to implement this sort of cross-talk? I feel like its a very obvious question, but I've been unable to find a well-documented solution.
On a broader note, if anyone has a link that shows typical approaches to these sorts of MVC issues, I would love to see it. I haven't had much luck finding solid, non-trivial references. Examples in Python would be lovely, but I'll gladly read anything. | 0 | [
2,
568,
307,
8990,
15,
184,
378,
53,
3053,
13,
14869,
16893,
128,
4146,
60,
128,
2761,
60,
800,
3726,
3726,
1301,
234,
132,
19,
51,
7769,
20,
7428,
1369,
307,
8990,
1637,
12750,
2483,
31,
8713,
32,
45,
31,
57,
81,
1871,
19,
594,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any NSIS Best Practices or Coding Standars around?
===
I'm creating several NSIS installers and as my expertise in this thing grows up I'm no longer happy with just making things work, I would like to see if there are some best practices or coding standards around this language, like how to write conditionals, variable names, unistallers, etc.. | 0 | [
2,
25,
80,
186,
13,
103,
4557,
246,
5242,
54,
13,
15458,
1261,
5446,
140,
60,
800,
3726,
3726,
31,
22,
79,
2936,
238,
13,
103,
4557,
16146,
445,
17,
28,
51,
12303,
19,
48,
584,
7120,
71,
31,
22,
79,
90,
1045,
1700,
29,
114,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subversion Auth: Can't access the "Collection of Repositories" page anymore
===
I can't see the 'Collection of Repositories" page after adding authentication and access rules to svn. 'guest' can navigate to mydomain.com/svn/public and admin can see both svn/public and svn/private, but none of the users can see /svn.
Is it possible to have 'guest' access mydomain.com/svn and only see a /public link?
Here's what I have setup...
subversion.conf:
<location /svn>
DAV svn
SVNParentPath /home/subversion
SVNListParentPath on
AuthzSVNAccessFile /etc/svn-access-file
AuthType Basic
AuthName "Subversion Repository"
AuthUserFile /etc/svn-auth-file
Require valid-user
</Location>
svn-access-file:
[public:/]
guest = r
@admin = rw
[private:/]
@admin = rw
[groups]
admin = karl.r
Thanks.
| 0 | [
2,
972,
10898,
10343,
96,
45,
92,
22,
38,
1381,
14,
13,
7,
15015,
872,
16,
302,
14882,
262,
2829,
7,
2478,
3375,
800,
3726,
3726,
31,
92,
22,
38,
196,
14,
13,
22,
15015,
872,
16,
302,
14882,
262,
2829,
7,
2478,
75,
4721,
27963... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Web site cross-browser testing in Practice
===
I'm looking for resources/suggestions on real world cross-browser web site testing. In this case the emphasis is on simple web content rather than javascript/AJAX or a server side applications. I've looked at the web stats & made a list of the highest-used browsers. Then what?
For example, I'd love to hear experiences with:
- Is there a rule of thumb of browser equivalents? For example, my feeling is FireFox Mac vs. PC renders very much the same and IE Mac vs. PC do not. Chome and Safari (PC and Mac) use WebKit, so they should render the same, correct?
- Do you need to test on an actual Mac or is PC FireFox/Safari/Chrome etc enough?
- Getting multiple browser versions to work on the same machine without too much registry hacking.
- Using VMWare/VirtualPC (do you have to buy a copy of Windows to activate each?) How time consuming is it to set up? (I'm on a PC, btw).
- Using http://browsershots.org in practice on a large number of web pages (1000+)
- Anyone know of a HTML/CSS scanning tool that will flush out common problems, such as box model width issues?
Thanks!
| 0 | [
2,
2741,
689,
919,
8,
25699,
4104,
4431,
19,
1345,
800,
3726,
3726,
31,
22,
79,
699,
26,
2566,
118,
18,
21606,
1430,
5757,
27,
683,
126,
919,
8,
25699,
4104,
2741,
689,
4431,
9,
19,
48,
610,
14,
6238,
25,
27,
1935,
2741,
2331,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 win32con module in python? Where can I find it?
===
I'm building an open source project that uses python and c++ in Windows.
I came to the following error message:
ImportError: No module named win32con
The same happened in a "prebuilt" code that it's working ( except in my computer :P )
I think this is kind of "popular" moduel in python because I've saw several messages in oher forums but none that could help me.
I have Python2.6, should I have that module already installed?
Is that something of VC++?
Thank you for the help.
I got this url http://sourceforge.net/projects/pywin32/ but I'm not sure what to do with the executable :S
| 0 | [
2,
98,
22,
18,
628,
3125,
1126,
12613,
19,
20059,
60,
113,
92,
31,
477,
32,
60,
800,
3726,
3726,
31,
22,
79,
353,
40,
368,
1267,
669,
30,
2027,
20059,
17,
272,
20512,
19,
1936,
9,
31,
281,
20,
14,
249,
7019,
2802,
45,
9010,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an equivalent technique in Cocoa for the synchronous TrackPopupMenu in Windows?
===
In response to a rightMouse event I want to call a function that displays a context menu, runs it, and responds to the selected menu item. In Windows I can use TrackPopupMenu with the TPM_RETURNCMD flag.
What is the easiest way to implement this in Cocoa? It seems NSMenu:popUpContextMenu wants to post an event to the specified NSView. Must I create a dummy view and wait for the event before returning? If so, how do I "wait" or flush events given I am not returning to my main ? | 0 | [
2,
25,
80,
40,
4602,
4873,
19,
24507,
26,
14,
13,
16023,
1291,
792,
6057,
576,
755,
291,
19,
1936,
60,
800,
3726,
3726,
19,
1627,
20,
21,
193,
14002,
62,
807,
31,
259,
20,
645,
21,
1990,
30,
9412,
21,
4141,
11379,
15,
1461,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Handling OPTIONS request in nginx
===
We're using HAProxy as a load balancer at the moment, and it regularly makes requests to the downstream boxes to make sure they're alive using an OPTIONS request:
> OPTIONS /index.html HTTP/1.0
I'm working with getting nginx set up as a reverse proxy with caching (using ncache). For some reason, nginx is returning a 405 when an OPTIONS request comes in:
> 192.168.1.10 - - [22/Oct/2008:16:36:21 -0700] "OPTIONS /index.html HTTP/1.0" 405 325 "-" "-" 192.168.1.10
When hitting the downstream webserver directly, I get a proper 200 response. My question is: how to you make nginx pass that response along to HAProxy, or, how can I set the response in the nginx.conf?
Thanks! | 0 | [
2,
7988,
6368,
3772,
19,
13,
2723,
108,
396,
800,
3726,
3726,
95,
22,
99,
568,
1458,
4899,
9229,
28,
21,
6305,
4468,
139,
35,
14,
688,
15,
17,
32,
4217,
1364,
12279,
20,
14,
14658,
8120,
20,
233,
562,
59,
22,
99,
2481,
568,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HttpListenerRequest where are the POST parameter?
===
I have search in [MSDN][1] and I can't figure where are the POST parameters from HttpListenerRequest?
Any idea?
*QueryString seem to have only Get parameter not post
[1]: http://msdn.microsoft.com/en-us/library/system.net.httplistenerrequest.aspx | 0 | [
2,
7775,
13891,
106,
99,
10351,
113,
50,
14,
678,
18906,
60,
800,
3726,
3726,
31,
57,
2122,
19,
636,
79,
18,
43,
103,
500,
2558,
165,
500,
17,
31,
92,
22,
38,
1465,
113,
50,
14,
678,
12905,
37,
7775,
13891,
106,
99,
10351,
60,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Programatic Accent Reduction in JavaScript (aka text normalization or unaccenting)
===
I need to compare 2 strings as equal such as these:
>Lubeck == Lübeck
In JavaScript.
Why? Well, I have an auto-completion field that's going out to a Java service using Lucene, where place names are stored naturally (as Lübeck), but also indexed as normalized text,
import sun.text.Normalizer;
oDoc.setNameLC = Normalizer.normalize(oLocName, Normalizer.DECOMP, 0)
.toLowerCase().replaceAll("[^\\p{ASCII}]","");
This way some-one who doesn't know to type "Mèxico" can type "mexico" and get a match which returns "Mèxico" (among a lot of other possible hits, like "Café Mèxico, Dubai, UAE").
Now the thing is I don't have the ability to change the service to do any highlighting on the server side, therefore I am highlighting on the client JavaScript side with something like:
return result.replace( input.replace(/[aeiou]/g,"."), "<b>$1</b>");
It's a little more fancy because I am escaping special regex characters in the input. This is fine for simple one word matches at the beginning of a hit, but it really breaks down if you suddenly wish to support multi-word matches like "london cafe":
input = input.strip().toLowerCase(); //fyi prototype's strip is like trim
re = new RegEx(input.replace(/[aeiou]/g,".").replace(/\s+/g,"|"),"gi");
return result.replace(re, "<b>$1</b>");
This doesn't work for say "london ca" (was typing london cafe), because it would mark "Jack London Cabin, Dawson City, Canada" as: `"Ja<b>ck</b> <b>London</b> <b>ca</b>bin, Dawson <b>Ci</b>ty, <b>Ca<b/>nada"` [note the "ck" and "Ci" particularly]
Therefore I'm sort of looking for something that's not as crazy as:
input = input.strip().toLowerCase();
input = input.replace(/a/g,"[ÀàÁáÂâÃãÄäÅåÆæĀāĂ㥹]");
input = input.replace(/e/g,"[ÈèÉéÊêËëĒēĔĕĖėĘęĚě]");
// ditto for i, o, u, y, c, n, maybe also d, g, h, j, k, l, r, s, t, w, z
re = new RegEx(input.replace(/\s+/g,"|"),"gi");
return result.replace(re, "<b>$1</b>");
Is there a compiled table I can refer to mapping a range of characters which are accented versions of an other character to that character, by which I don't mean the plain unicode chart. And if so, could I avoid using weird, possibly slow, RegEx statements?
Thanks.
| 0 | [
2,
625,
12479,
7980,
5895,
19,
8247,
8741,
13,
5,
4176,
1854,
1826,
1829,
54,
367,
1738,
5089,
68,
6,
800,
3726,
3726,
31,
376,
20,
11590,
172,
7887,
28,
2747,
145,
28,
158,
45,
13,
1,
2377,
9141,
800,
3726,
29756,
19,
8247,
874... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compressing Memory Cache
===
Does anyone have any experience in using compression on their cached data?
I understand that stackoverflow is internally using this method.
What are the pros and cons?
And are there any gotchyas? | 0 | [
2,
26060,
68,
1912,
16522,
800,
3726,
3726,
630,
1276,
57,
186,
1496,
19,
568,
14864,
27,
66,
16522,
43,
1054,
60,
31,
1369,
30,
7566,
2549,
9990,
25,
17739,
568,
48,
2109,
9,
98,
50,
14,
895,
18,
17,
11608,
60,
17,
50,
80,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Does JSON.js cause conflicts with Sys.Serialization.JavaScriptSerializer.serialize
===
I am using Telerik controls in my webforms and want to serialize object on the client. Since I am getting a stackoverflow error with Sys.Serialization.JavaScriptSerializer.serialize I wanted to try JSON. With both JSON and and the MS library I get "Sys.Application is undefined."
Has anyone encountered this what did you do as a work around. | 0 | [
2,
630,
487,
528,
9,
728,
18,
1679,
10344,
29,
10315,
18,
9,
4104,
2815,
1829,
9,
1004,
1385,
8741,
4104,
2815,
11907,
9,
4104,
2815,
2952,
800,
3726,
3726,
31,
589,
568,
4338,
6639,
8671,
19,
51,
2741,
4190,
18,
17,
259,
20,
59... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Testing: Fixtures, Factories, and Magic numbers
===
I've got an application that needs quite a bit of data (1000's of records) to do appropriate testing. The only way I've found to get a decent set of testable, sensible data is to use a **subset of my production DB**. I've converted this to YAML fixtures in the normal `test/fixtures' location.
This works, but now I have a bunch of seemingly brittle tests and assertions that depend on their being a particular number of records that meet condition X...
example
def test_children_association
p = Parent.find(1)
assert_equal 18, p.children.count, "Parent.children isn't providing the right records"
end
This doesn't seem like a good idea to me, but **I'm not sure if there is a better / accepted way** to test an application that needs a large hierarchy of data.
| 0 | [
2,
2240,
18,
4431,
45,
19914,
15,
11814,
15,
17,
2154,
2116,
800,
3726,
3726,
31,
22,
195,
330,
40,
3010,
30,
2274,
1450,
21,
1142,
16,
1054,
13,
5,
19484,
22,
18,
16,
742,
6,
20,
107,
4593,
4431,
9,
14,
104,
161,
31,
22,
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... |
Is it possible to have an html TEXTAREA-like element that wraps text rather than displays scrollbars?
===
Is there a css style that IE7 and Firefox will obey that changes the behavior of a TEXTAREA so that it behaves more like.... um..... more like the thing I'm typing into right now! | 0 | [
2,
25,
32,
938,
20,
57,
40,
13,
15895,
1854,
17760,
8,
1403,
4520,
30,
8118,
18,
1854,
864,
119,
9412,
12159,
1850,
18,
60,
800,
3726,
3726,
25,
80,
21,
272,
18,
18,
1034,
30,
13,
660,
465,
17,
535,
18219,
129,
15410,
30,
1693... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fields people capture when logging - log4net
===
I interested in knowing what fields people actual capture and use when logging within their applications when using loggers like log4net.
This can range from debugging to testing to production and can be for thick client apps but I am thinking more about semantics of web apps (i.e. asp.net).
Also, in the context of web (and for thick clients to a certain extent) I am interested in how people build up the hierarchy of log entires for a given request and how you identify the individual request, etc.
Cheers
Anthony
| 0 | [
2,
2861,
148,
3683,
76,
13,
13919,
13,
8,
6738,
300,
2328,
800,
3726,
3726,
31,
3158,
19,
2506,
98,
2861,
148,
3463,
3683,
17,
275,
76,
13,
13919,
363,
66,
3767,
76,
568,
13,
29480,
18,
101,
6738,
300,
2328,
9,
48,
92,
978,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Importing teh content of another web resource using JSTL
===
I have a JSP page that will display the exact content of another web page on a different server. My understanding was that <c:import /> from the JSTL should be able to include content from files that are not part of the current web application.
I added <c:import url="page on my server in a different"/> and it works fine, but when I try to include a page from another server it fails.
Any suggestions as to what might be wrong? | 0 | [
2,
9010,
68,
13,
22314,
2331,
16,
226,
2741,
6577,
568,
487,
18,
7786,
800,
3726,
3726,
31,
57,
21,
487,
3401,
2478,
30,
129,
3042,
14,
5340,
2331,
16,
226,
2741,
2478,
27,
21,
421,
8128,
9,
51,
3260,
23,
30,
13,
1,
150,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Merge Facts from Different Sources?
===
We've got data with two different origins: some comes from a customer, some comes from different vendors. Currently, we physically "merge" this data into a massive table with almost a hundred columns, tens of thousands of rows and a lot of nulls.
The customer data defines two dimensions (one of which is time), and provides a number of fact values. Each vendor may (or may not) provide additional facts with the same dimensions.
The data can be called "sparse" because we don't often get information from all vendors.
Is this one fact table -- with some nulls -- merged from different sources?
Or is this *n*+1 fact tables -- one for the customer, and one for each vendor? | 0 | [
2,
12666,
10459,
37,
421,
2662,
60,
800,
3726,
3726,
95,
22,
195,
330,
1054,
29,
81,
421,
7001,
45,
109,
1624,
37,
21,
7705,
15,
109,
1624,
37,
421,
19787,
9,
871,
15,
95,
7994,
13,
7,
1263,
834,
7,
48,
1054,
77,
21,
3787,
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... |
Using SQL Server DTS Package to Conditionally Insert / Update Rows in Destination Table
===
I want to create a DTS Package to pull data from an Oracle table into a SQL2K
table. How can I insert rows that are not already in the SQL2K table and
update rows that already exist in the SQL2K table?
I guess I could truncate and repopulate the entire table or create a
temporary table and then do updates/inserts from the temp table into the
destination table.
Is there any easier way using DTS?
Thanks,
Rokal
| 0 | [
2,
568,
4444,
255,
8128,
13,
43,
38,
18,
6030,
20,
2874,
1326,
14692,
13,
118,
11100,
11295,
19,
6970,
859,
800,
3726,
3726,
31,
259,
20,
1600,
21,
13,
43,
38,
18,
6030,
20,
2201,
1054,
37,
40,
15759,
859,
77,
21,
4444,
255,
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... |
SQL stored procedure temporary table memory problem
===
We have the following simple Stored Procedure that runs as an overnight SQL server agent job. Usually it runs in 20 minutes, but recently the MatchEvent and MatchResult tables have grown to over 9 million rows each. This has resulted in the store procedure taking over 2 hours to run, with all 8GB of memory on our SQL box being used up. This renders the database unavailable to the regular queries that are trying to access it.
I assume the problem is that temp table is too large and is causing the memory and database unavailablity issues.
How can I rewrite the stored procedure to make it more efficient and less memory intensive?
<pre><code>
CREATE TABLE #tempMatchResult
(
matchId VARCHAR(50)
)
INSERT INTO #tempMatchResult
SELECT MatchId FROM MatchResult
DELETE FROM MatchEvent WHERE
MatchId IN (SELECT MatchId FROM #tempMatchResult)
DELETE FROM MatchResult WHERE
MatchId In (SELECT MatchId FROM #tempMatchResult)
DROP TABLE #tempMatchResult
</pre></code>
| 0 | [
2,
4444,
255,
8214,
7004,
4700,
859,
1912,
1448,
800,
3726,
3726,
95,
57,
14,
249,
1935,
8214,
7004,
30,
1461,
28,
40,
12341,
4444,
255,
8128,
2267,
1205,
9,
951,
32,
1461,
19,
434,
902,
15,
47,
1989,
14,
730,
4943,
38,
17,
730,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 to itoa() for converting integer to string C++?
===
I was wonding if there was an alternative to itoa() for converting an integer to a string because when I run it in visual Studio I get warnings, and when I compile my program under Linux, it won't even compile.
Thanks,
tomek
| 0 | [
2,
2676,
20,
32,
6941,
5,
6,
26,
19583,
13820,
20,
3724,
272,
20512,
60,
800,
3726,
3726,
31,
23,
230,
3258,
100,
80,
23,
40,
2676,
20,
32,
6941,
5,
6,
26,
19583,
40,
13820,
20,
21,
3724,
185,
76,
31,
485,
32,
19,
3458,
1120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you build a commercial OpenSocial app with protected source?
===
I'm interested in any solutions for building a commercial OpenSocial app that has protected source. Links to detailed solutions or hacks is perfectly acceptable. Obviously being XML and JavaScript, there is a high likelihood this just isn't possible, but I'm curious if anyone has explored this angle. | 0 | [
2,
184,
107,
42,
1895,
21,
1439,
368,
11559,
4865,
29,
3803,
1267,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
186,
6776,
26,
353,
21,
1439,
368,
11559,
4865,
30,
63,
3803,
1267,
9,
6271,
20,
6036,
6776,
54,
11835,
18,
25,
5759,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fluffy Cloud Configurations For .NET
===
Very simple question, is there any cloud server enviroments avaliable these days for us .NET guys that rivals Amazons ec2? | 0 | [
2,
27971,
4005,
8091,
18,
26,
13,
9,
2328,
800,
3726,
3726,
253,
1935,
1301,
15,
25,
80,
186,
4005,
8128,
21314,
661,
6601,
21,
18506,
579,
158,
509,
26,
182,
13,
9,
2328,
2776,
30,
9418,
8059,
18,
6695,
135,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What major applications does Microsoft sell which use the .NET framework?
===
As a programmer, I feel much safer knowing that the frameworks being 'sold' to me are actually in use by their creators to produce real applications, as this gives me some reassurance that they will actually solve some set of problems, and are not just [architecture astronautics](http://www.joelonsoftware.com/articles/fog0000000018.html).
I remember years ago in the days of .NET 1.0 and 1.1, there was a lot of hype about how the next version of windows (which would have been Vista) was going to make heavy use of .NET, and there lots of hype about how great that would be.
I remember at the time thinking "well if Microsoft are basing their products off it, it must be pretty good." However, *that didn't actually happen*, and Vista ended up containing almost zero .NET parts. I also haven't heard of them using it in any apps that they sell at all (except IIS)
Although I've had many great experiences with .NET myself, the fact that Microsoft don't appear to use it themselves hardly fills me with confidence. In contrast, all of the frameworks Apple ships in OSX such as CoreData are all in heavy use by their major apps...
Off the top of my head I know of these 'purchaseable' MS apps which use .NET:
* IIS7
* Visual Studio (which I don't think really counts...)
Are there any others?
*Disclaimer*: I believe this is programming related, as it deeply affects the confidence that I as a programmer have in a technology, and counts a lot when evaluating what to use when building my next apps. | 2 | [
2,
98,
394,
3767,
630,
7099,
3344,
56,
275,
14,
13,
9,
2328,
6596,
60,
800,
3726,
3726,
28,
21,
17968,
15,
31,
583,
212,
15483,
2506,
30,
14,
6596,
18,
142,
13,
22,
18,
1218,
22,
20,
55,
50,
1121,
19,
275,
34,
66,
20638,
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... |
How do you skip default value columns on insert/update in Linq To SQL?
===
How do you insert/update a column through Linq To SQL and Linq To SQL use the default values? In particular I'm concerned with a timestamp field.
I've tried setting that column to readonly and autogenerated, so it stopped trying to put in DateTime.MinValue, but it doesn't seem to be updating on updates. | 0 | [
2,
184,
107,
42,
12532,
12838,
1923,
7498,
27,
14692,
118,
576,
8209,
19,
6294,
1251,
20,
4444,
255,
60,
800,
3726,
3726,
184,
107,
42,
14692,
118,
576,
8209,
21,
4698,
120,
6294,
1251,
20,
4444,
255,
17,
6294,
1251,
20,
4444,
255... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ template instantiation of function template parameters
===
I have the following problem using template instantiation [*].
file **foo.h**
class Foo
{
public:
template <typename F>
void func(F f)
private:
int member_;
};
file **foo.cc**
template <typename F>
Foo::func(F f)
{
f(member_);
}
file **caller.cc**
Foo::func(boost::bind(&Bar::bar_func, bar_instance, _1));
While this compiles fine, the linker complains about an undefined symbol:
`void Foo::func<boost::_bi::bind_t...>`
How can I instantiate the *function* `Foo::func`? Since it takes a function as argument, I am little bit confused. I tried to add an instantiation function in **foo.cc**, as I am used to with regular *non-function* types:
instantiate()
{
template<> void Foo::func<boost::function<void(int)> >(boost::function<void(int)>);
}
Obviously, this does not work. I would appreciate if someone can point me in the right direction.
Thanks!
[*] Yes, I read the parashift FAQ lite. | 0 | [
2,
272,
20512,
22894,
6322,
49,
857,
16,
1990,
22894,
12905,
800,
3726,
3726,
31,
57,
14,
249,
1448,
568,
22894,
6322,
49,
857,
636,
2483,
500,
9,
3893,
13,
1409,
4120,
111,
9,
252,
1409,
718,
4310,
111,
13,
1,
317,
45,
22894,
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... |
Best way to reverse a string in C# 2.0
===
I've just had to write a string reverse function in C# 2.0 (i.e. LINQ not available) and came up with this:
public string Reverse(string text)
{
char[] cArray = text.ToCharArray();
string reverse = String.Empty;
for (int i = cArray.Length - 1; i > -1; i--)
{
reverse += cArray[i];
}
return reverse;
}
Personally I'm not crazy about the function and am convinced that there's a better way to do it. Is there?
| 0 | [
2,
246,
161,
20,
7006,
21,
3724,
19,
272,
5910,
172,
9,
387,
800,
3726,
3726,
31,
22,
195,
114,
41,
20,
2757,
21,
3724,
7006,
1990,
19,
272,
5910,
172,
9,
387,
13,
5,
49,
9,
62,
9,
6294,
1251,
52,
904,
6,
17,
281,
71,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Natural Language/Text Mining and Reddit/social news site
===
I think there is a wealth of natural language data associated with sites like reddit or digg or news.google.com.
I have done a little bit of research with text mining, but can't find how I could use those tools to parse something like reddit.
What kind of applications can you come up with? | 0 | [
2,
1112,
816,
118,
11969,
4243,
17,
402,
43,
242,
118,
11559,
996,
689,
800,
3726,
3726,
31,
277,
80,
25,
21,
6141,
16,
1112,
816,
1054,
1598,
29,
3259,
101,
402,
43,
242,
54,
6131,
263,
54,
996,
9,
16111,
4875,
9,
960,
9,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Anyone using a third-party Windows registry editor that they would recommend to others?
===
I work with the Windows registry editor (regedit.exe) on a near-daily basis, and occasionally find myself wishing it had more features.
For example, it'd be nice if it had:
- a way to import and export favorites.
- an advanced search feature that lists all the keys it found, rather than a simple Find feature. It would be great if there was a way to narrow the results as you type, but yes, I realize I'm probably asking for a lot.
- a list of keys I recently accessed (history)
So essentially, I'm just looking for a reliable third-party tool that builds upon the existing regedit feature set. I'm interested in both free and commercial solutions.
Previous developer recommendations have led me to discover great tools like [Notepad++][1] and [RegexBuddy][2], so I'm really looking forward to your answers.
[1]: http://notepad-plus.sourceforge.net
[2]: http://www.regexbuddy.com/ | 0 | [
2,
1276,
568,
21,
422,
8,
9635,
1936,
18269,
1835,
30,
59,
83,
12360,
20,
654,
60,
800,
3726,
3726,
31,
170,
29,
14,
1936,
18269,
1835,
13,
5,
99,
6430,
242,
9,
1706,
62,
6,
27,
21,
424,
8,
9394,
102,
2239,
15,
17,
4533,
477... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Efficient heap-manager for heavy churn, tiny allocs?
===
I'm looking for ideas for a heap-manager to handle a very specific situation: Lots and lots of very small allocations, ranging from 12 to 64 bytes each. Anything bigger, I will pass on to the regular heap-manager, so only tiny blocks need be catered for. Only 4-byte alignment is needed.
My main concerns are
1. Overhead. The regular libc heap will typically round up an allocation to a multiple of 16 bytes, then add another 16 byte header - this means over 50% overhead on a 20-byte allocation, which sucks.
2. Performance
One helpful aspect is that Lua (which is the user of this heap) will tell you the size of the block it's freeing when it calls free() - this may enable certain optimisations.
I'll post my current approach, which works ok, but I'd like to improve on it if at all possible. Any ideas? | 0 | [
2,
8243,
15414,
8,
22256,
26,
1278,
4834,
5778,
15,
3228,
65,
2499,
18,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
3478,
26,
21,
15414,
8,
22256,
20,
3053,
21,
253,
1903,
1858,
45,
7503,
17,
7503,
16,
253,
284,
16840,
18,
15,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I deserialize a SAML assertion in Rampart/C (Axis2/C)?
===
I have SAML 1.1 and SAML 1.0 responses in utf-8 `char *` buffers, and I would like to transform them into Rampart/C `saml_response_t *` objects. My question is this:
What is the correct method for creating a saml_response_t from a string?
Ideally I'd like a code sample in C that does this and then disposes of the various parser tools in the correct order, since Axis2/C has some odd ideas about how to free memory.
My efforts to do this have met with failure, resulting mainly in memory faults, but here's what I have. Keep in mind that the deserialize_buffer method does just what it says -- converts a buffer into an `axiom_node_t *`, but I'm open to replacing it as well.
/* : get the raw XML from the SAML assertion */
xml_data = Tcl_GetStringFromObj (objv[2], &xml_length);
/* : parse the response XML for processing */
stream = gstream_mem_create (xml_data, xml_length);
node = Axis2_axiom_deserialize_buffer (env, stream);
/* : build a SAML response from the parsed XML */
saml_response = saml_response_create (env);
saml_response_build (saml_response, node, env);
arraylist = saml_response_get_assertions (saml_response, env);
/* : create our return value object */
obj = Tcl_NewListObj (0, NULL);
/* :- convert the SAML assertion into a string */
for (i = 0;
i < axutil_array_list_size (arraylist, env);
i++) {
saml_assertion = (saml_assertion_t *) axutil_array_list_get (arraylist, env, i);
if (saml_assertion != NULL) {
assertion_node = saml_assertion_to_om (saml_assertion, NULL, env);
element = Tcl_NewStringObj (axiom_node_to_string (node, env), -1);
Tcl_ListObjAppendElement (interp, obj, element);
axiom_node_free_tree (assertion_node, env);
}
}
| 0 | [
2,
184,
107,
31,
1746,
106,
2815,
2952,
21,
1113,
255,
20878,
19,
27086,
118,
150,
13,
5,
19676,
9298,
150,
6,
60,
800,
3726,
3726,
31,
57,
1113,
255,
137,
9,
165,
17,
1113,
255,
137,
9,
387,
13231,
19,
287,
11720,
8,
457,
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... |
Applications that use .NET
===
What are your favorite applications, products, or any applications that you know of that use ***.NET or Asp.NET*** as their underlying platform? What popular companies do you know of as a .NET shop?
*This question is related to a few others that I have seen. So I've just made this one as a community wiki to see what kind of a response there is.* | 0 | [
2,
3767,
30,
275,
13,
9,
2328,
800,
3726,
3726,
98,
50,
154,
3839,
3767,
15,
1985,
15,
54,
186,
3767,
30,
42,
143,
16,
30,
275,
8980,
9,
2328,
54,
28,
306,
9,
2328,
2483,
1409,
28,
66,
10974,
2452,
60,
98,
844,
1532,
107,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cannont get Textboxes in Dynamically added usercontrol to mainain state
===
I have tried what seems like everything - ive done similiar things many times before, but im obviously missing something.
I have a UserControl (ucA) - on ucA is a linkbutton that loads a different usercontrol (ucB) programatically into a panel on ucA. ucB has textboxes, etc.
Could someone please help me be sane again :-)
Here is the code for ucA (basically)
public int SlideCount
{
get { return Convert.ToInt32(ViewState["SlideCount"]); }
set { ViewState["SlideCount"] = value; }
}
protected void LinkButton1_Click(object sender, EventArgs e)
{
SlideCount += 1;
LoadSlideControls();
}
protected override void OnInit(EventArgs e)
{
base.OnInit(e);
LoadSlideControls();
}
private void LoadSlideControls()
{
this.pnlAnnouncementHolder.Controls.Clear();
for (int i = 0; i < SlideCount; i++)
{
this.pnlAnnouncementHolder.Controls.Add(
LoadControl("AnnouncementSlide.ascx"));
}
}
| 0 | [
2,
6689,
38,
164,
1854,
5309,
160,
19,
7782,
1326,
905,
4155,
12898,
20,
407,
6890,
146,
800,
3726,
3726,
31,
57,
794,
98,
2206,
101,
796,
13,
8,
5568,
677,
4861,
12765,
139,
564,
151,
436,
115,
15,
47,
797,
4409,
2863,
301,
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... |
Custom URI for HTTPListener?
===
Is there a way to add a custom prefix/URI that is not http or https? The HTTPListener.Prefixes.Add method only accepts http:// and https:// prefixes.
I just don't want to recreate the functionality of this class if I don't have to. | 2 | [
2,
5816,
13,
3594,
26,
7775,
13891,
106,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
3547,
21,
5816,
14315,
118,
3594,
30,
25,
52,
7775,
54,
7775,
18,
60,
14,
7775,
13891,
106,
9,
3515,
18594,
160,
9,
14854,
2109,
104,
16548,
7775... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 anyone know of good delphi docking components?
===
we'd like to add movable panels to an application. presently we've used DevExpress docking library but have found them to be disappointingly quirky & difficult to work with. it also has some limitations that aren't so great.
auto-hide, pinning, and moving of pages by drag-and-drop are all features we'd like to use.
the built-in delphi docking doesn't seem to be full-featured enough to do the things we need (also see sample below). perhaps i should dig deeper into delphi's docking abilities...my initial impression is that they seem very toolbar-oriented rather than something i can drop a frame into.
i'm not experienced at docking topics. my only experience has been with the DevExpress docking library where i needed to programmatically create & dock panels.
![sample][1]
[1]: http://xrw.bc.ca/download/so/docking.gif
is it my imagination or are DevExpress's products unduly difficult to use/learn? the DevExpress Ribbon Bar component compared to the d2009 Ribbon Bar was certainly a useful experience. i will migrate to the d2009 Ribbon Bar as soon as convenient to do so. it was refreshingly straight-forward to learn and use. a sharp contrast compared to the DevExpress equivalent. if it takes 4x as longer to make it using the DevExpress equivalent, it's time to change direction.
what would *you* suggest in regard to the docking library?
thank you for your suggestions/comments! | 0 | [
2,
630,
1276,
143,
16,
254,
23030,
6120,
68,
5090,
60,
800,
3726,
3726,
95,
22,
43,
101,
20,
3547,
29618,
9449,
20,
40,
3010,
9,
14431,
95,
22,
195,
147,
9664,
21230,
6120,
68,
1248,
47,
57,
216,
105,
20,
44,
17841,
102,
19321,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading multiple shared libraries with different versions
===
I have an executable on Linux that loads `libfoo.so.1` (that's a `SONAME`) as one of its dependencies (via another shared library). It also links to another system library, which, in turn, links to a **system** version, `libfoo.so.2`. As a result, **both** `libfoo.so.1` and `libfoo.so.2` are loaded during execution, and code that was supposed to call functions from library with version 1 ends up calling (binary-incompatible) functions from a newer system library with version 2, because some symbols stay the same. The result is usually stack smashing and a subsequent segfault.
Now, the library which links against the older version is a closed-source third-party library, and I can't control what version of `libfoo` compiles against. Assuming that, the only other option left is rebuilding a bunch of system libraries that currently link with `libfoo.so.2` to link with `libfoo.so.1`.
Is there any way to avoid replacing system libraries wiith local copies that link to older `libfoo`? Can I load both libraries and have the code calling correct version of symbols? So I need some special symbol-level versioning? | 0 | [
2,
12797,
1886,
2592,
8649,
29,
421,
3281,
800,
3726,
3726,
31,
57,
40,
1396,
17194,
5924,
27,
13024,
30,
19069,
13,
1,
8326,
4120,
111,
9,
656,
9,
165,
1,
13,
5,
887,
22,
18,
21,
13,
1,
528,
8357,
1,
6,
28,
53,
16,
82,
29... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascript percentage validation
===
I am after a regular expression that validates a percentage from 0 100 and allows two decimal places.
Does anyone know how to do this or know of good web site that has example of common regular expressions used for client side validation in javascript?
| 0 | [
2,
8247,
8741,
5780,
27999,
800,
3726,
3726,
31,
589,
75,
21,
1290,
1803,
30,
7394,
7759,
21,
5780,
37,
713,
808,
17,
2965,
81,
26380,
1489,
9,
630,
1276,
143,
184,
20,
107,
48,
54,
143,
16,
254,
2741,
689,
30,
63,
823,
16,
75... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0... |
How does Yegge's prototype pattern example handle instance variables?
===
I like Steve Yegge's [Prototype Pattern example][1] and decided to whip up a quick proof of concept example.
However, I didn't really think things through. While it is great for dynamically specifying the behaviour of objects and is an easy solution to Steve's [opinionated elf][2] example, I'm still trying to work out the best way to handle instance variables.
For instance, let's say I have an AwesomeDragon object. I then want to make an AwesomeDragonImmuneToFire object so I make a new child of the AwesomeDragon (AwesomeDragonImmuneToFire inherits properties from AwesomeDragon) and 'put' "ImmuneToFire" as a property with a value of 'true'. So far so good. Now let's say I want to send my AwesomeDragon object on a tour of nearby peasant villages. This will involve updating the 'position' property of AwesomeDragon. However, the moment I do this AwesomeDragonImmuneToFire will take off as well.
Is the best solution to override instance values upon object creation e.g. immediately 'put' the 'position' value on AwesomeDragonImmuneToFire to the current 'get' value of 'position'?
[1]: http://steve-yegge.blogspot.com/2008/10/universal-design-pattern.html
[2]: http://steve.yegge.googlepages.com/when-polymorphism-fails | 0 | [
2,
184,
630,
3617,
263,
834,
22,
18,
7063,
3732,
823,
3053,
4851,
12157,
60,
800,
3726,
3726,
31,
101,
2228,
3617,
263,
834,
22,
18,
636,
2740,
262,
4474,
3732,
823,
500,
2558,
165,
500,
17,
868,
20,
8853,
71,
21,
2231,
6070,
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... |
Is it possible for a XSS attack to obtain HttpOnly cookies?
===
Reading [this blog post about HttpOnly cookies][1] made me start thinking, is it possible for an HttpOnly cookie to be obtained through any form of XSS? Jeff mentions that it "raises the bar considerably" but makes it sound like it doesn't completely protect against XSS.
Aside from the fact that not all browser support this feature properly, how could a hacker obtain a user's cookies if they are HttpOnly?
I can't think of any way to make an HttpOnly cookie send itself to another site or be read by script, so it seems like this is a safe security feature, but I'm always amazed at how easily some people can work around many security layers.
In the environment I work in, we use IE exclusively so other browsers aren't a concern. I'm looking specifically for other ways that this could become an issue that don't rely on browser specific flaws.
[1]: http://www.codinghorror.com/blog/archives/001167.html | 0 | [
2,
25,
32,
938,
26,
21,
993,
18,
18,
991,
20,
5545,
7775,
4965,
19396,
60,
800,
3726,
3726,
1876,
636,
1565,
8146,
678,
88,
7775,
4965,
19396,
500,
2558,
165,
500,
117,
55,
799,
1440,
15,
25,
32,
938,
26,
40,
7775,
4965,
19980,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I programatically turn off show pages in navigation for sharepoint
===
I am progamatically creating a SharePoint site using
SPWeb spWeb = spSite.AllWebs.Add(...);
What code do I need run to set the spWeb to turn off the "Show pages in navigation" option?
| 0 | [
2,
184,
107,
31,
625,
721,
8438,
805,
168,
298,
4434,
19,
8368,
26,
1891,
3132,
800,
3726,
3726,
31,
589,
895,
15847,
38,
8438,
2936,
21,
1891,
3132,
689,
568,
3782,
14113,
3782,
14113,
800,
3782,
9097,
9,
1233,
14113,
18,
9,
1485... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
On Design Patterns: When to use the Singleton?
===
The glorified global variable - becomes a gloried global class. Some say breaking Object Oriented Design.
Give me scenarios, other than the good old logger where it makes sense to use the singleton.
| 4 | [
2,
27,
704,
6282,
45,
76,
20,
275,
14,
345,
444,
60,
800,
3726,
3726,
14,
489,
7386,
4462,
2062,
7612,
13,
8,
2633,
21,
13,
6725,
11942,
2062,
718,
9,
109,
395,
3892,
3095,
13,
6800,
704,
9,
590,
55,
19611,
15,
89,
119,
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,
0,
0,
0... |
Extracting a .hpi file into it's .jpg/.png components
===
i stumbled across my rather ancient photo objects disks, and sadly found out the company (hemera) doesn't provide support for it anymore. this has left me with a whole pile of .hpi files. luckily, i found [this information][1] on extracting the jpg and png components of the file.
unfortunately, i haven't been able to get it to work. can anyone figure out what's wrong with this code? i'd be happy with a php or python solution if perl isn't your thing :)
open(I, "$name") || die;
binmode(I);
$_ = <I>;
close(I);
my ($j, $p) = m|^.{32}(.*)(\211PNG.*)$|s;
open(J, ">$name.jpg") &&
do { binmode(J); print J $j; close J; };
open(P, ">$name.png") &&
do { binmode(P); print P $p; close P; };
the hexdump of the current test file i snagged off a CD is here, if it helps at all:
0000000 89 48 50 49 0d 0a 1a 0a 64 00 00 00 20 00 00 00
0000010 45 89 00 00 65 89 00 00 0a 21 00 00 00 d0 d0 00
[1]: http://www.halley.cc/ed/linux/interop/hemera.html | 0 | [
2,
10962,
68,
21,
13,
9,
252,
2159,
3893,
77,
32,
22,
18,
13,
9,
12851,
263,
118,
9,
306,
2723,
5090,
800,
3726,
3726,
31,
10282,
464,
51,
864,
1593,
3056,
3916,
8582,
18,
15,
17,
16382,
216,
70,
14,
237,
13,
5,
438,
20827,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
zen of python
===
There is the Zen of Python written by Tim Peters. It is considered like a summary manual of python's philosophy. Here it is:
>>> import this
The Zen of Python, by Tim Peters
Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren't special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-- and preferably only one --obvious way to do it.
Although that way may not be obvious at first unless you're Dutch.
Now is better than never.
Although never is often better than *right* now.
If the implementation is hard to explain, it's a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -- let's do more of those!
Can I have an example of each of those items, applied to real python programming?
I think one example per answer would be best, so we could vote on each example. | 4 | [
2,
10526,
16,
20059,
800,
3726,
3726,
80,
25,
14,
10526,
16,
20059,
642,
34,
2574,
14432,
9,
32,
25,
724,
101,
21,
14740,
5132,
16,
20059,
22,
18,
3177,
9,
235,
32,
25,
45,
13,
1,
9010,
48,
14,
10526,
16,
20059,
15,
34,
2574,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subversion asks for incorrect user
===
I just got a shiny, brand-new Debian server handed to me by our Systems group, and the /etc directory is kept under version control with Subversion. Unfortunately, I couldn't seem to save some configuration changes; Subversion kept asking me for the password of the gentlemen who set the box up and who is on vacation as of 6 pm this evening:
djessup@server1:/etc$ sudo svn commit -m "Made some changes."
jdoe@svn.example.root.ent's password:
I did not have this problem when checking out changes as myself, only when using sudo to commit changes as root.
My first thought was that somebody had checked out the working directory with a username embedded, but svn info revealed that the location of the Subversion repository was svn+ssh://svn.example.root.ent/svn/its-systems/server1, not svn+ssh://jdoe@svn.example.root.ent/svn/its-systems/server1.
I tried using the --username command documented on [the official Subversion user guide](http://svnbook.red-bean.com/nightly/en/svn.ref.svn.html). It was completely ineffective; John Doe's username (actual name changed to protect the innocent) kept coming up. I looked for some possible misconfiguration in /root/.subversion. There was zero configuration there. | 0 | [
2,
972,
10898,
3913,
26,
18867,
4155,
800,
3726,
3726,
31,
114,
330,
21,
13091,
15,
2209,
8,
2681,
121,
10035,
8128,
3988,
20,
55,
34,
318,
1242,
214,
15,
17,
14,
13,
118,
1198,
150,
16755,
25,
1025,
131,
615,
569,
29,
972,
1089... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASM Registers -- Why do they work how they do?
===
Why is %EAX = %AX and %AX = (%AH + %AC). Why isn't there a counterpart to %AX to equal %EAX?
| 0 | [
2,
28,
79,
2243,
18,
13,
8,
8,
483,
107,
59,
170,
184,
59,
107,
60,
800,
3726,
3726,
483,
25,
13,
11881,
62,
7522,
800,
13,
11881,
7522,
17,
13,
11881,
7522,
800,
13,
5,
11881,
1307,
2754,
13,
11881,
1738,
6,
9,
483,
2532,
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,
0... |
How do you handle update refresh rate ?
===
How do you handle update refresh rate from your worker function to your UI ?
Sending everything to the UI or maybe using a timer (from which side ? worker or UI ?)
| 0 | [
2,
184,
107,
42,
3053,
11100,
24905,
1684,
13,
60,
800,
3726,
3726,
184,
107,
42,
3053,
11100,
24905,
1684,
37,
154,
7444,
1990,
20,
154,
13,
5661,
13,
60,
4907,
796,
20,
14,
13,
5661,
54,
913,
568,
21,
85,
139,
13,
5,
2665,
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,
0,
0,
0,
0,
0,
0,
0... |
How to use a method
===
I am very new to Java. My assignment is to create my own method and then create a class to test it in.
My question, do I create the method separate of the class, or within the class? If it is separate of the class, how do I get the class to access my method?
(Are they saved as two separate files?) | 0 | [
2,
184,
20,
275,
21,
2109,
800,
3726,
3726,
31,
589,
253,
78,
20,
8247,
9,
51,
8427,
25,
20,
1600,
51,
258,
2109,
17,
94,
1600,
21,
718,
20,
1289,
32,
19,
9,
51,
1301,
15,
107,
31,
1600,
14,
2109,
1725,
16,
14,
718,
15,
54... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 insert multiple rows into oracle with a sequence value?
===
I know that I can insert multiple rows using a single statement, if I use the syntax in [this answer][1].
However, one of the values I am inserting is taken from a sequence, i.e.
insert into TABLE_NAME
(COL1,COL2)
select MY_SEQ.nextval,'some value' from dual
union all
select MY_SEQ.nextval,'another value' from dual
;
If I try to run it, I get an ORA-02287 error. Is there any way around this, or should I just use a lot of INSERT statements?
[1]: http://stackoverflow.com/questions/39576/best-way-to-do-multi-row-insert-in-oracle#39602
| 0 | [
2,
184,
92,
31,
14692,
1886,
11295,
77,
15759,
29,
21,
4030,
1923,
60,
800,
3726,
3726,
31,
143,
30,
31,
92,
14692,
1886,
11295,
568,
21,
345,
3331,
15,
100,
31,
275,
14,
22649,
19,
636,
1565,
1623,
500,
2558,
165,
500,
9,
207,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 2008 not loading MFC dll symbols
===
Visual Studio 2008 doesn't appear to be loading symbols for MFC dlls when I debug my application. This used to work fine in 2005 - ie. when it loaded the dll it said "Symbols loaded" and can then debug it. In 2008 (having upgraded to MFC 9, so they are different libraries) it doesn't say that it's loaded symbols for the MFC dlls, and later shows it hasn't by not being able to debug into them ("no symbols loaded" in call stack etc).
Is there some sort of setting that has affected this? I assume that it should still be possible with MFC 9.0... | 0 | [
2,
3458,
1120,
570,
52,
12797,
307,
7061,
13,
43,
211,
9794,
800,
3726,
3726,
3458,
1120,
570,
1437,
22,
38,
1893,
20,
44,
12797,
9794,
26,
307,
7061,
13,
43,
211,
18,
76,
31,
121,
16254,
51,
3010,
9,
48,
147,
20,
170,
1123,
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... |
Prevent redirection of Xmlhttprequest
===
Is it possible to prevent the browser from following redirects when sending XMLHttpRequest-s (i.e. to get the redirect status code back and handle it myself)?
| 0 | [
2,
2501,
302,
14706,
872,
16,
23504,
21127,
99,
10351,
800,
3726,
3726,
25,
32,
938,
20,
2501,
14,
16495,
37,
249,
302,
14706,
18,
76,
4907,
23504,
21127,
99,
10351,
8,
18,
13,
5,
49,
9,
62,
9,
20,
164,
14,
302,
14706,
1782,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are possible/good ways to prototype iPhone applications?
===
This is intentionally left broad. If you wanted to show users what iPhone/mobile applications could to for them. The more interactive the better, but it must be quick to build as you can't code up every idea. Let us assume real-time games are out of scope. Throw out ideas or state which approach would be best.
Here are some of my ideas, what are yours?
- Hack a app that loads mostly web or image content, but has hyperlinks to get around in. This would mean static data.
- Build screens which look great but can only be navigated in a story board type fashion.
- Load the web version or equivalent on the iPhone and say: now image the buttons and navigation is better.
- A paper based prototype.
- Flash or video walk through running on the phone.
- String existing iPhone apps and web pages together with minimal glue just to convey the idea.
Can anyone share prototyping methods for other mobile devices? Ex: The palm prototype was just a block of wood and note pad that was carried around. | 0 | [
2,
98,
50,
938,
118,
3264,
2847,
20,
7063,
21024,
3767,
60,
800,
3726,
3726,
48,
25,
18140,
225,
2748,
9,
100,
42,
417,
20,
298,
3878,
98,
21024,
118,
12571,
3767,
110,
20,
26,
105,
9,
14,
91,
9194,
14,
574,
15,
47,
32,
491,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Operating System from User-Agent HTTP Header
===
Is there a good, up-to-date listing anywhere that maps User-Agent HTTP Header strings --> operating systems? | 0 | [
2,
2455,
329,
37,
4155,
8,
58,
7685,
7775,
157,
106,
800,
3726,
3726,
25,
80,
21,
254,
15,
71,
8,
262,
8,
8209,
9554,
4922,
30,
6867,
4155,
8,
58,
7685,
7775,
157,
106,
7887,
13,
8,
8,
1,
2455,
1242,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Virtual PC high CPU usage problems
===
I run VPC 2007 on my Vista business laptop with 4 gig RAM. I use VPC to run windows XP and maintain a VS2003 web project. At first everything was great. I assigned the VPC 512MB and did my work as usual. I also run Resharper and Visual SVN. Lately, the act of scrolling in a page causes the CPU to spike above 50, sometimes near 100. This freezes my machine occasionally and is frustrating. Typing code sometimes does the same thing.
I have experimented with changing allocated memory, disk space, turning on/off the paging file, uninstalling ReSharper and Visual SVN. There should be no reason this thing is slow with all the memory I have on this laptop! I don't have anything running on it but VPC at any one time.
I'm wondering if I should just install VS2003 on my Vista machine and deal with any incompatibility problems.
Any suggestions? | 0 | [
2,
6599,
5168,
183,
17578,
7514,
1716,
800,
3726,
3726,
31,
485,
566,
5779,
624,
27,
51,
13520,
508,
12294,
29,
268,
7175,
2843,
9,
31,
275,
566,
5779,
20,
485,
1936,
23045,
17,
4027,
21,
4611,
3325,
2741,
669,
9,
35,
64,
796,
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... |
Netsuite woes: Is there decent reference anywhere?
===
I'm hoping this question isn't too obscure *cross fingers*
I'm looking for a decent reference for <a href="http://netsuite.com">netsuite</a> scripting and api (both of which are based on ASP)
does anybody know where too find this stuff? The netsuite help pages are mediocre at best, and the forums aren't very active. (I suppose these two things are already bad signs, but it's worth a try right?) | 0 | [
2,
4275,
12352,
62,
4808,
160,
45,
25,
80,
12238,
2801,
4922,
60,
800,
3726,
3726,
31,
22,
79,
3935,
48,
1301,
2532,
22,
38,
266,
15472,
1637,
7703,
1243,
2483,
31,
22,
79,
699,
26,
21,
12238,
2801,
26,
13,
1,
58,
746,
14057,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
wcf wsHttpBinding and disabling anonymous access
===
http://blogs.msdn.com/drnick/archive/2007/03/23/preventing-anonymous-access.aspx
Can someone clarify whether it is possible to use wsHttpBinding in WCF and disable anonymous access in IIS without transport (ssl) or message security being required? | 0 | [
2,
11801,
410,
619,
18,
21127,
22260,
17,
1460,
58,
8599,
10364,
1381,
800,
3726,
3726,
7775,
6903,
7091,
5447,
9,
79,
18,
43,
103,
9,
960,
118,
3807,
6113,
118,
23941,
118,
2727,
118,
3601,
15718,
9280,
3515,
6645,
68,
8,
210,
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... |
On Path Finding: a detailed description for a layman of the D* algorithm
===
The large network (of small world graph type) I wish to deal with is dynamic in nature, new nodes are added and subtracted frequently. Presumably using D* over A* would be a better way to detect paths in this dynamic environment?
How solid is D*? has it had any real world experience? like a cryptographic algorithm - is D* hardened by lots of pier review and testing? Would you use D* for this problem?
| 0 | [
2,
27,
2013,
3007,
45,
21,
6036,
5318,
26,
21,
1815,
177,
16,
14,
13,
43,
2483,
9083,
800,
3726,
3726,
14,
370,
982,
13,
5,
1041,
284,
126,
7210,
1001,
6,
31,
2536,
20,
1183,
29,
25,
7782,
19,
1444,
15,
78,
16272,
50,
905,
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... |
Why is OdbcCommand.ExecuteScalar() throwing an AccessViolationException?
===
I have a block of code intended to pull text descriptions from a database table and save them to a text file. It looks like this (C# .NET):
OdbcCommand getItemsCommand = new OdbcCommand("SELECT ID FROM ITEMS", databaseConnection);
OdbcDataReader getItemsReader = getItemsCommand.ExecuteReader();
OdbcCommand getDescriptionCommand = new OdbcCommand("SELECT ITEMDESCRIPTION FROM ITEMS WHERE ID = ?", databaseConnection);
getDescriptionCommand.Prepare();
while (getItemsReader.Read())
{
long id = getItemsReader.GetInt64(0);
String outputPath = "c:\\text\\" + id + ".txt";
if (!File.Exists(outputPath))
{
getDescriptionCommand.Parameters.Clear();
getDescriptionCommand.Parameters.AddWithValue("id", id);
String description = (String)getDescriptionCommand.ExecuteScalar();
StreamWriter outputWriter = new StreamWriter(outputPath);
outputWriter.Write(description);
outputWriter.Close();
}
}
getItemsReader.Close();
This code has successfully saved a portion of the data to .txt files, but for many rows, an AccessViolationException is thrown on the following line:
OdbcDataReader getItemsReader = getItemsCommand.ExecuteReader();
The Exception text is "Attempted to read or write protected memory. This is often an indication that other memory is corrupt".
The program will usually throw the exception on the same rows of the table, but it doesn't appear to be 100% consistent. Sometimes data that had thrown the exception in the past will suddenly work.
Some people are undoubtedly wondering why I didn't just SELECT ID, ITEMDESCRIPTION FROM ITEMS in the getItemsCommand and skip the second query. Actually, I did it that way initially, and I was encountering the same error with getItemsCommand.GetString(). I was afraid that perhaps the dataset was taking up too much memory and maybe that was causing the error. So I decided to try this method to see if it would help. It didn't. Does anyone know why this might be happening?
By the way, ID is an INT and ITEMDESCRIPTION is a VARCHAR(32000) column. If it makes any difference, the database is Borland Interbase 6.0 (Ick!)
| 0 | [
2,
483,
25,
12340,
7229,
16239,
9,
1706,
62,
4118,
13944,
3779,
5,
6,
6033,
40,
1381,
13327,
10832,
10066,
872,
60,
800,
3726,
3726,
31,
57,
21,
1921,
16,
1797,
2081,
20,
2201,
1854,
15740,
37,
21,
6018,
859,
17,
2079,
105,
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... |
At what point in a project should developers start to "eat their own dog food"?
===
We have a project coming up where the PM is insistent that the team should "eat their own dog food"?
At what point is it realistic to do this?
e.g. assume we have to write an editor. We can't use this editor at the beginning to actually code because it doesn't exist. We have to use another editor.
For a while during the project, using a buggy editor is going to slow the project down and will be counter productive.
So at what point do we switch?
| 0 | [
2,
35,
98,
454,
19,
21,
669,
378,
10168,
799,
20,
13,
7,
62,
721,
66,
258,
1952,
950,
7,
60,
800,
3726,
3726,
95,
57,
21,
669,
880,
71,
113,
14,
6736,
25,
26720,
30,
14,
173,
378,
13,
7,
62,
721,
66,
258,
1952,
950,
7,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I know when Windows is going into/out of sleep or Hibernate mode?
===
Is it possible to subscribe to a Windows event that fires when Windows is going into or coming out of Sleep or Hibernate state?
I need my application to be made aware when the computer is going to sleep to do some cleanup and avoid timing issues when it comes out of sleep. | 0 | [
2,
184,
92,
31,
143,
76,
1936,
25,
228,
77,
118,
1320,
16,
1742,
54,
4148,
2102,
8820,
3740,
60,
800,
3726,
3726,
25,
32,
938,
20,
13,
20330,
20,
21,
1936,
807,
30,
11327,
76,
1936,
25,
228,
77,
54,
880,
70,
16,
1742,
54,
41... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any C++ lib to read thumbnails from thumb.db in Windows Folder?
===
I want to read all thumbnails from a folder with images in Windows XP.
But if I read image file to get thumbnail, it seems a bit slow, so I wish I can first read the windows image thumbnail cache:thumb.db.
Is there any lib in c++ or c to read thumbnails from thumb.db. | 0 | [
2,
25,
80,
186,
272,
20512,
13,
8326,
20,
1302,
5078,
325,
947,
18,
37,
5078,
9,
9007,
19,
1936,
19294,
60,
800,
3726,
3726,
31,
259,
20,
1302,
65,
5078,
325,
947,
18,
37,
21,
19294,
29,
3502,
19,
1936,
23045,
9,
47,
100,
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... |
Navigation Controller Transparent Bar Style is not working
===
I am using a navigation controller, and I have the style set to :
navController.navigationBar.barStyle = UIBarStyleBlackTranslucent;
But when I run my program, the navigation controller looks like it is on top of a white background, not my background. When I push a controller, left or right, all my view, the current one, shifts to the top exactly the size of the navigation bar. And it is there where I can see my background through the navigation controller bar. Any ideas? When my barStyle is set to opaque, everything looks fine. I was thinking on setting my view frame a negative 'y' value, but I think there should a more elegant way. | 0 | [
2,
8368,
9919,
14862,
748,
1034,
25,
52,
638,
800,
3726,
3726,
31,
589,
568,
21,
8368,
9919,
15,
17,
31,
57,
14,
1034,
309,
20,
13,
45,
16048,
12898,
1252,
9,
325,
13227,
857,
1850,
9,
1850,
4381,
800,
13,
5661,
1850,
4381,
5485... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 correct way to declare a pointer to a __far pointer?
===
On an embedded target I use far pointers to access some parts of the memory map.
near pointer (without explicitely specifying __near):
<pre>unsigned int *VariableOnePtr;</pre>
Pointer to near pointer: <pre>unsigned int **VariableOnePtrPtr;</pre>
far pointer: <pre>unsigned int *__far VariableTwoPtr;</pre>
What is the correct way to declare a pointer to a far pointer? Does this pointer have to be a far pointer itself? | 0 | [
2,
98,
25,
14,
4456,
161,
20,
10123,
21,
454,
106,
20,
21,
13,
1,
3700,
454,
106,
60,
800,
3726,
3726,
27,
40,
12138,
2935,
31,
275,
463,
454,
445,
20,
1381,
109,
1341,
16,
14,
1912,
2942,
9,
424,
454,
106,
13,
5,
14506,
149... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 write this Lisp / Scheme code?
===
A lambda expression which takes a function (of one argument) and a number, and applies the function to twice the number. | 0 | [
2,
184,
20,
2757,
48,
2093,
3401,
13,
118,
4276,
1797,
60,
800,
3726,
3726,
21,
13,
24187,
1803,
56,
1384,
21,
1990,
13,
5,
1041,
53,
5476,
6,
17,
21,
234,
15,
17,
13169,
14,
1990,
20,
2088,
14,
234,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Get CSproj path in code
===
How to get the path of the current csproject?
Let's say I have a csproject name MyProj.csproj, inside there is a class that wants to know what is the file path of this csproj, any idea on how to do this? thanks. | 0 | [
2,
164,
272,
18,
2740,
728,
2013,
19,
1797,
800,
3726,
3726,
184,
20,
164,
14,
2013,
16,
14,
866,
272,
18,
21011,
60,
408,
22,
18,
395,
31,
57,
21,
272,
18,
21011,
204,
51,
2740,
728,
9,
6824,
2740,
728,
15,
572,
80,
25,
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... |
Could a website teach the browser to go into fullscreen mode?
===
I want to run a psychological study for which participants have to look at large images.
The experiment is done on the web and therefore in a browser window. Is it possible to tell the browser to go into fullscreen, for example on button press?
I know there is the possibility to open a fixed-size popup window. Do you think this would be a feasable alternative? And if, what would be the best way to do it? Are there elegant ways of detecting a popup-blocker, to fallback and run the study in the original browser window.
The main concern is that the participants of this study are not familiar with technical details and should not be bothered by them. | 0 | [
2,
110,
21,
2271,
5348,
14,
16495,
20,
162,
77,
503,
7187,
3740,
60,
800,
3726,
3726,
31,
259,
20,
485,
21,
7848,
949,
26,
56,
5889,
57,
20,
361,
35,
370,
3502,
9,
14,
5737,
25,
677,
27,
14,
2741,
17,
1793,
19,
21,
16495,
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... |
C# HTML Font Tag Parsing
===
I need to parse a large amount of text that uses HTML font tags for formatting,
i.e.
<font face="fontname" ...>Some text</font>
Specifically, I need to determine which characters would be rendered using each font used in the text. I need to be able to handle stuff like font tags inside another font tag.
I need to use C# for this. Is there some sort of C# parser class to make this easier? Or would I have to write it myself?
Thanks! | 0 | [
2,
272,
5910,
13,
15895,
9978,
3383,
2017,
18,
68,
800,
3726,
3726,
31,
376,
20,
2017,
870,
21,
370,
2006,
16,
1854,
30,
2027,
13,
15895,
9978,
3383,
18,
26,
2595,
1203,
15,
31,
9,
62,
9,
13,
1,
21931,
276,
3726,
7,
21931,
725... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fonts and Locales in Flex Builder
===
In my program, I have been receiving an error when I use a
command-line compile command for mxmlc. The error is related to an
embedded font name not being correctly identified by flex in the
system fonts list.
However, on a whim, I decided to copy the code to Flex Builder and
compile it there. To my surprise, it worked, and it found the proper
font using the same system name I had given (PMingLiU).
I suspected my problem may be a locale one, and that my system cannot
correctly identify the font name because of locale considerations.
I've tried setting the locale of the compile code to en_US, to no
avail. So I would like to ask if anyone here knows the exact command
string that Flex tells Mxmlc whenever it compiles a project. My answer
might lie there. | 0 | [
2,
9978,
18,
17,
375,
160,
19,
14409,
14960,
800,
3726,
3726,
19,
51,
625,
15,
31,
57,
74,
3396,
40,
7019,
76,
31,
275,
21,
1202,
8,
1143,
26561,
1202,
26,
307,
396,
79,
6109,
9,
14,
7019,
25,
1597,
20,
40,
12138,
9978,
204,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automating code reivew and refactoring
===
I'm trying to automated code review and refactoring with a tool. Something in the lines of FxCop or ReSharper.
Looking for tool suggestions that meet these requirements:
1. Low learning curve.
2. Targeted at C# (and maybe VB.NET).
3. Let's me easily add or customize rules (and understands entire CodeDOM).
4. Well documented.
5. FREE or dirt cheap. *Sorry, low exchange rate =)*
Manual code reviews will still be done. But the tool should be thorough enough to catch all the common boo boos before a senior developer does the manual review.
If you have stories to share about the tools that you have used/are using then that would be great, too.
Thanks. | 0 | [
2,
3108,
79,
1880,
1797,
302,
1284,
499,
17,
302,
17455,
68,
800,
3726,
3726,
31,
22,
79,
749,
20,
14904,
1797,
1487,
17,
302,
17455,
68,
29,
21,
5607,
9,
301,
19,
14,
1560,
16,
13,
16488,
9734,
54,
302,
23646,
106,
9,
699,
26... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Extending an existing class like a namespace (C++)?
===
I'm writing in second-person just because its easy, for you.
You are working with a game engine and really wish a particular engine class had a new method that does 'bla'. But you'd rather not spread your 'game' code into the 'engine' code.
So you could derive a new class from it with your one new method and put that code in your 'game' source directory, but maybe there's another option?
So this is probably completely illegal in the C++ language, but you thought at first, "perhaps I can add a new method to an existing class via my own header that includes the 'parent' header and some special syntax. This is possible when working with a namespace, for example..."
Assuming you can't declare methods of a class across multiple headers (and you are pretty darn sure you can't), what are the other options that support a clean divide between 'middleware/engine/library' and 'application', you wonder? | 0 | [
2,
8176,
40,
3149,
718,
101,
21,
204,
5582,
13,
5,
150,
20512,
6,
60,
800,
3726,
3726,
31,
22,
79,
1174,
19,
153,
8,
7276,
114,
185,
82,
2010,
15,
26,
42,
9,
42,
50,
638,
29,
21,
250,
1406,
17,
510,
2536,
21,
1498,
1406,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RGB for color composition rather than primary hues
===
Why do computers use RGB (red, *green*, and blue) values for color composition rather than the primary hues, red, *yellow*, and blue? | 0 | [
2,
761,
11400,
26,
1665,
4046,
864,
119,
1256,
11542,
18,
800,
3726,
3726,
483,
107,
7774,
275,
761,
11400,
13,
5,
2095,
15,
1637,
6852,
2483,
15,
17,
705,
6,
4070,
26,
1665,
4046,
864,
119,
14,
1256,
11542,
18,
15,
402,
15,
163... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Help with this tree-recursive / time complexity Scheme problem?
===
If you could help me with ANY part of this question, I would appreciate it. Thanks.
2^0 = 1
2^N = 2^(N-1) + 2^(N-1)
1. Convert this definition into an exactly equivalent tree-recursive function called two-to-the-power-of. Describe its asymptotic time complexity and explain why it has this time complexity.
2. Now write a function called tttpo_rec which computes the exact same thing, but which uses a linear recursive process which has an O(n) time complexity and also uses O(n) space for its pending operations.
3. Now write a function called tttpo_iter which computes the exact same thing, but which uses a linear iterative process which has an O(n) time complexity and also uses constant space.
4. Now let's say you want to generalize one of the preceding definitions so that it will handle arbitrary integer powers, so that you can compute 2^N, 3^N etc. Write a function called to-the-power-of that takes two arguments and raises one to the power of the other. Here's the template:
;; to-the-power-of: integer integer -> integer
;; This function raises m to the power of n, returning the result.
;; m must be > 0 and n >= 0.
(define (to-the-power-of m n)
...)
(check-expect (to-the-power-of 1 0) 1) ; base case
(check-expect (to-the-power-of 2 3) 8) ; recursive case
(check-expect (to-the-power-of 3 2) 9) ; recursive case
We'll add one more restriction: you can't use the * operator; you can only use the following recursive function to do multiplications:
;;; multiply: integer integer -> integer
;; This function multiplies two non-negative integers, returning the result.
;; Its time complexity is O(a).
(define (multiply a b)
...)
Write the function, and describe what its time complexity is and why.
| 0 | [
2,
448,
29,
48,
1541,
8,
99,
24244,
13,
118,
85,
12745,
4276,
1448,
60,
800,
3726,
3726,
100,
42,
110,
448,
55,
29,
186,
141,
16,
48,
1301,
15,
31,
83,
8831,
32,
9,
3669,
9,
172,
1,
387,
800,
137,
172,
1,
103,
800,
172,
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... |
In What Order are MySQL JOINs Evaluated
===
I have the following query:
SELECT c.* FROM companies AS c JOIN users AS u USING(companyid) JOIN jobs AS j USING(userid) JOIN useraccounts AS us USING(userid) WHERE j.jobid = 123;
I have the following questions:
1. Is the USING syntax synonymous with ON syntax?
2. Are these joins evaluated left to right? In other words, does this query say: x = companies JOIN users; y = x JOIN jobs; z = y JOIN useraccounts;
3. If the answer to question 2 is yes, is it safe to assume that the companies table has companyid, userid and jobid columns?
4. I don't understand how the WHERE clause can be used to pick rows on the companies table when it is referring to the alias "j"
Any help would be appreciated!
KN
| 0 | [
2,
19,
98,
389,
50,
51,
18,
22402,
10612,
19018,
800,
3726,
3726,
31,
57,
14,
249,
25597,
45,
5407,
272,
9,
2483,
37,
1532,
28,
272,
1865,
3878,
28,
287,
568,
5,
28359,
1340,
6,
1865,
4844,
28,
487,
568,
5,
3699,
5175,
6,
1865... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Flash Remoting Services dead?
===
I have a potential client that build something with Flash Remoting Services. It looks there was some sort of server product offered back in 2002-2003, but I've been unable to see if it did anything so complex that it could not be replaced with a simple webservice. Does any one know what happened to this product? | 0 | [
2,
25,
4433,
302,
7662,
68,
687,
828,
60,
800,
3726,
3726,
31,
57,
21,
2222,
6819,
30,
1895,
301,
29,
4433,
302,
7662,
68,
687,
9,
32,
1879,
80,
23,
109,
2058,
16,
8128,
2374,
1434,
97,
19,
1093,
8,
3325,
15,
47,
31,
22,
195... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 some great JavaScript sites?
===
I have often found it hard to find good JavaScript help on the net. What are some websites that you have found useful for JavaScript.
Here are a couple of mine:
- [irt.org][1] specifically the [JavaScript FAQ][2]
- now [Stack Overflow][3]
Let me know if there are other questions on SO similar to this, because I couldn't find them.
[1]: http://irt.org
[2]: http://irt.org/script/script.htm
[3]: http://stackoverflow.com | 0 | [
2,
98,
50,
109,
374,
8247,
8741,
3259,
60,
800,
3726,
3726,
31,
57,
478,
216,
32,
552,
20,
477,
254,
8247,
8741,
448,
27,
14,
4275,
9,
98,
50,
109,
13931,
30,
42,
57,
216,
4811,
26,
8247,
8741,
9,
235,
50,
21,
1335,
16,
1114... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Logging a ruby exceptions stack trace
===
I am working on rails project and I am trying to get exceptions to be logged to the rails log files. I know I can call `logger.error $!` to get the first line of the exception logged to the file. But, I want to get the entire trace stack logged as well. How do I log the entire trace back of an exception using the default rails logger? | 0 | [
2,
13,
13919,
21,
10811,
13392,
7566,
5565,
800,
3726,
3726,
31,
589,
638,
27,
2240,
18,
669,
17,
31,
589,
749,
20,
164,
13392,
20,
44,
13,
19287,
20,
14,
2240,
18,
6738,
6488,
9,
31,
143,
31,
92,
645,
13,
1,
29480,
9,
29992,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Error "MSB3176: Specified minimum required version is greater than the current publish version"
===
I've got build server running CruiseControl.NET and recently it started throwing this error on one of my projects (.NET 2.0, C#):
>MSB3176: Specified minimum required version is greater than the current publish version. Please specify a version less than or equal to the current publish version. in Microsoft.Common.targets(2238, 9)
I've search the net, but could not find a solution.
Any suggestions? | 0 | [
2,
7019,
13,
7,
79,
18,
220,
240,
11633,
45,
9931,
5187,
1390,
615,
25,
1894,
119,
14,
866,
10824,
615,
7,
800,
3726,
3726,
31,
22,
195,
330,
1895,
8128,
946,
6581,
12898,
9,
2328,
17,
1989,
32,
373,
6033,
48,
7019,
27,
53,
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... |
How do I combine multiple BIRT reports
===
We currently have a whole suite of report designs that cover various parts of our app, and these reports are generated on demand by our users.
I want to be able to bundle up several of these reports into a single report to return to the user.
I initially hacked up a custom report builder that generated report design files using segments inside a report library file, and then ran that generated design, but this was unwieldy and a pain to manage as I had to duplicate the individual reports (still required) inside the report library file. Any changes to the stand-alone reports had to be duplicated in the library for the combined reports.
What I am really looking for is a way to specify several design files, have them all run, and then return a single file to the user, containing all the reports they selected. | 0 | [
2,
184,
107,
31,
12287,
1886,
8719,
38,
2813,
800,
3726,
3726,
95,
871,
57,
21,
979,
6160,
16,
1330,
4748,
30,
1227,
617,
1341,
16,
318,
4865,
15,
17,
158,
2813,
50,
6756,
27,
3888,
34,
318,
3878,
9,
31,
259,
20,
44,
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... |
Avoiding SQL Injection in SQL query with Like Operator using parameters?
===
Taking over some code from my predecessor and I found a query that uses the Like operator:
SELECT * FROM suppliers
WHERE supplier_name like '%'+name+%';
Trying to avoid SQL Injection problem and parameterize this but I am not quite sure how this would be accomplished. Any suggestions ?
note, I need a solutino for classic ADO.NET - I don't really have the go-ahead to switch this code over to something like LINQ. | 0 | [
2,
10298,
4444,
255,
13646,
19,
4444,
255,
25597,
29,
101,
6022,
568,
12905,
60,
800,
3726,
3726,
741,
84,
109,
1797,
37,
51,
8687,
17,
31,
216,
21,
25597,
30,
2027,
14,
101,
6022,
45,
5407,
1637,
37,
13078,
18,
113,
13078,
1,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I programmatically determine operating system in Java?
===
I would like to determine the operating system of the host that my Java program is running programmatically (for example: I would like to be able to load different properties based on whether I am on a Windows or Unix platform). What is the safest way to do this with 100% reliability? | 0 | [
2,
184,
107,
31,
625,
6732,
1326,
3746,
2455,
329,
19,
8247,
60,
800,
3726,
3726,
31,
83,
101,
20,
3746,
14,
2455,
329,
16,
14,
2015,
30,
51,
8247,
625,
25,
946,
625,
6732,
1326,
13,
5,
1106,
823,
45,
31,
83,
101,
20,
44,
77... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Wild Card Subdomains With Mod Rewrite?
===
I have Wild Card Subdomains on, however I just do not know mod_rewrite to the extent that is required to write this. Can anyone tell me how to make it so anything other than www and nothing go to the main site but any subdomain other than that go to /script/index.php?username=$username? | 0 | [
2,
568,
1808,
2056,
972,
537,
6232,
18,
29,
7226,
27891,
60,
800,
3726,
3726,
31,
57,
1808,
2056,
972,
537,
6232,
18,
27,
15,
207,
31,
114,
107,
52,
143,
7226,
1,
99,
23716,
20,
14,
5674,
30,
25,
1390,
20,
2757,
48,
9,
92,
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... |
Sharing Visual Studio Code Snippets amongst a team of developers
===
Has anyone come up with a good way to share a set of Visual Studio Code Snippets (actual .snippet files that Visual studio uses) amongst a team of developers automatically? It would be great for other developers on my team to benefit from shortcuts I've created for myself, and vice versa. | 0 | [
2,
6126,
3458,
1120,
1797,
13,
29061,
18,
4667,
21,
173,
16,
10168,
800,
3726,
3726,
63,
1276,
340,
71,
29,
21,
254,
161,
20,
1891,
21,
309,
16,
3458,
1120,
1797,
13,
29061,
18,
13,
5,
5183,
6948,
13,
9,
29061,
6488,
30,
3458,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for alternatives or improvements to drop down lists/menus on websites
===
Drop-down lists, menus and combo boxes are all very common user interface elements. Users are accustomed to seeing these elements in native applications and sometimes web apps, but there are a few problems with them.
1. You have to aim the mouse. Some menus collapse when you mouse out, and some have submenus that you have to aim at to expand.
2. You can't see the options without aiming the mouse first.
These are the main things that trouble me, maybe other people notice other issues as well. I normally don't use drop-down menus at all if I can help it.
The problem is that I sometimes want to present a long list of options in limited space. Issue 2 is a sacrifice I'm willing to make, but I'm wanting to know if anyone has any tricks to make these drop menus easier to use. Maybe someone has invented a new style of list control.
I'm sure that if these types of controls annoy me, then they annoy users of my site more. | 0 | [
2,
699,
26,
2676,
18,
54,
7951,
20,
2804,
125,
7227,
118,
755,
267,
27,
13931,
800,
3726,
3726,
2804,
8,
2968,
7227,
15,
11379,
18,
17,
22621,
8120,
50,
65,
253,
757,
4155,
6573,
2065,
9,
3878,
50,
20946,
20,
2078,
158,
2065,
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... |
Palindrome Golf
===
The goal: Any language. The smallest function which will return whether a string is a palindrome. Here is mine in <b>Python</b>:
R=lambda s:all(a==b for a,b in zip(s,reversed(s)))
50 characters.
The accepted answer will be the current smallest one - this will change as smaller ones are found. Please specify the language your code is in. | 0 | [
2,
4370,
108,
22264,
4034,
800,
3726,
3726,
14,
1195,
45,
186,
816,
9,
14,
11056,
1990,
56,
129,
788,
1472,
21,
3724,
25,
21,
4370,
108,
22264,
9,
235,
25,
1114,
19,
13,
1,
220,
1,
6448,
11570,
1,
118,
220,
1,
45,
761,
3726,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Char.IsHex() in C#
===
Following on from [this question][1] what would be the best way to write a Char.IsHex() function in C#. So far I've got this but don't like it:
bool CharIsHex(char c) {
c = Char.ToLower(c);
return (Char.IsDigit(c) || c == 'a' || c == 'b' || c == 'c' || c == 'd' || c == 'e' || c == 'f')
}
[1]: http://stackoverflow.com/questions/223832/check-a-string-to-see-if-all-characters-are-hexadecimal-values | 0 | [
2,
4892,
9,
1595,
1706,
5,
6,
19,
272,
5910,
800,
3726,
3726,
249,
27,
37,
636,
1565,
1301,
500,
2558,
165,
500,
98,
83,
44,
14,
246,
161,
20,
2757,
21,
4892,
9,
1595,
1706,
5,
6,
1990,
19,
272,
5910,
9,
86,
463,
31,
22,
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... |
Difference between Char.IsDigit() and Char.IsNumber() in C#
===
What's the difference between Char.IsDigit() and Char.IsNumber() in C#? | 0 | [
2,
2841,
128,
4892,
9,
403,
23904,
5,
6,
17,
4892,
9,
403,
16299,
5,
6,
19,
272,
5910,
800,
3726,
3726,
98,
22,
18,
14,
2841,
128,
4892,
9,
403,
23904,
5,
6,
17,
4892,
9,
403,
16299,
5,
6,
19,
272,
5910,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Linux default file permission
===
Is there someway to set the default file permission in Linux? That is, the file permission for a newly created file (regardless of the context for which it was created
). I know about putting umask in the shell startup but that only works for shell sessions. When I transfer files to a Linux box using **pscp**, the file is always created with permissions of 664 (rw-rw-r--). The has occurred across every flavor of Linux that I've used. I'd like to have something other than 664. | 0 | [
2,
13024,
12838,
3893,
5572,
800,
3726,
3726,
25,
80,
109,
1443,
20,
309,
14,
12838,
3893,
5572,
19,
13024,
60,
30,
25,
15,
14,
3893,
5572,
26,
21,
2771,
679,
3893,
13,
5,
99,
7632,
923,
16,
14,
4141,
26,
56,
32,
23,
679,
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 to tell if a sting is not defined in a bash shell script?
===
If I want to check for the null string I would do
[ -z $mystr ]
but what if I want to check whether the variable has been defined at all? Or is there no distinction in bash scripting? | 0 | [
2,
184,
20,
494,
100,
21,
8210,
25,
52,
2811,
19,
21,
13158,
3593,
3884,
60,
800,
3726,
3726,
100,
31,
259,
20,
2631,
26,
14,
16203,
3724,
31,
83,
107,
636,
13,
8,
380,
5579,
915,
9729,
13,
500,
47,
98,
100,
31,
259,
20,
263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
On Ghostscript: Fastest way to create a blank .tif document
===
A legacy backend requires the email body with a .tif document, no tif and it fails. So i need to generate a blank .tif on the fly, is there a fast way to do this with ghostscript?
| 0 | [
2,
27,
3995,
8741,
45,
7518,
161,
20,
1600,
21,
6463,
13,
9,
38,
821,
4492,
800,
3726,
3726,
21,
7780,
97,
2451,
4781,
14,
8517,
358,
29,
21,
13,
9,
38,
821,
4492,
15,
90,
13,
38,
821,
17,
32,
13614,
9,
86,
31,
376,
20,
79... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Get GridView selected row DataKey in Javascript
===
I have GridView which I can select a row. I then have a button above the grid called Edit which the user can click to popup a window and edit the selected row. So the button will have Javascript code behind it along the lines of
function editRecord()
{
var gridView = document.getElementById("<%= GridView.ClientID %>");
var id = // somehow get the id here ???
window.open("edit.aspx?id=" + id);
}
The question is how do I retrieve the selected records ID in javascript? | 0 | [
2,
164,
7354,
4725,
1704,
3131,
1054,
4237,
19,
8247,
8741,
800,
3726,
3726,
31,
57,
7354,
4725,
56,
31,
92,
5407,
21,
3131,
9,
31,
94,
57,
21,
5167,
784,
14,
7354,
227,
9392,
56,
14,
4155,
92,
10840,
20,
1675,
576,
21,
1463,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
winforms instrumentation . .
===
What is the best pattern for instrumentation. I have an application and i want to be able to track metrics on everytime a users does a number of functions in the app (brings up a form, views a certain feature, etc) but i dont want to have code all over the application that is doing this instrumentation. what are my options here?
At the end of the day, i want to be able to aggregate data across multiple users listing out metrics. | 4 | [
2,
628,
4190,
18,
18235,
13,
9,
13,
9,
800,
3726,
3726,
98,
25,
14,
246,
3732,
26,
18235,
9,
31,
57,
40,
3010,
17,
31,
259,
20,
44,
777,
20,
792,
11544,
18,
27,
352,
891,
21,
3878,
630,
21,
234,
16,
3719,
19,
14,
4865,
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 to uppercase date and month first letter of ToLongDateString() result in es-mx Culture ?
===
currently i obtain the below result from the following C# line of code when in es-MX Culture
Thread.CurrentThread.CurrentCulture =
Thread.CurrentThread.CurrentUICulture = new
CultureInfo("es-mx");
<span><%=DateTime.Now.ToLongDateString()%></span>
#miércoles, 22 de octubre de 2008
i would like to obtain the following
#Miércoles, 22 de Octubre de 2008
do i need to Build my own culture? | 0 | [
2,
184,
20,
1508,
10325,
1231,
17,
1617,
64,
1748,
16,
20,
2701,
8209,
11130,
5,
6,
829,
19,
13,
160,
8,
79,
396,
1365,
13,
60,
800,
3726,
3726,
871,
31,
5545,
14,
1021,
829,
37,
14,
249,
272,
5910,
293,
16,
1797,
76,
19,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Makefile problem with conditional used in define used in commands part of a rule
===
I have a section of makefile that has this sort of structure:
<pre><code>
bob:
ifdef DEBUG
@echo running
endif
@echo chug chug chug
ifdef DEBUG
@echo done
endif
bobit:
@echo "before"
@make bob
@echo "after"
</code></pre>
I'm simplifying greatly here, all the echo's are actually non trivial blocks of commands and there is more conditional stuff, but this captures the essence of my problem.
For technical reasons I don't want to get into right now, I need to get rid of that submake, but because the echo's represent nontrivial amounts of code I don't want to just copy and past the body of bob in place of the submake.
Ideally what I'd like to do is something like this
<pre><code>
define BOB_BODY
ifdef DEBUG
@echo running
endif
@echo chug chug chug
ifdef DEBUG
@echo done
endif
endef
bob:
$(BOB_BODY)
bobit:
@echo "before"
$(BOB_BODY)
@echo "after"
</code></pre>
Unfortunately the conditionals seem to be shafting me, they produce "ifdef: Command not found" errors, I tried getting around this with various combinations of eval and call, but can't seem to figure out a way to get it to work.
How do I make this work? and is it even the right way to approach the problem? | 0 | [
2,
233,
16877,
1448,
29,
21206,
147,
19,
9267,
147,
19,
14294,
141,
16,
21,
1828,
800,
3726,
3726,
31,
57,
21,
1050,
16,
233,
16877,
30,
63,
48,
2058,
16,
1411,
45,
13,
1,
3515,
1,
9375,
1,
1909,
45,
100,
13862,
121,
16254,
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... |
NoClassDefFoundError without a class name
===
I'm not quite sure if this is specific to Sun Java Systems Application Server but there are occasions where I run into a NoClassDefFoundError where the class in question, the one not found, is not mentioned in the error.
Does anyone know what conditions would lead to a NoClassDefFoundError being raised without specifying which class was not found? | 0 | [
2,
90,
1898,
13862,
12235,
29992,
366,
21,
718,
204,
800,
3726,
3726,
31,
22,
79,
52,
1450,
562,
100,
48,
25,
1903,
20,
939,
8247,
1242,
3010,
8128,
47,
80,
50,
5795,
113,
31,
485,
77,
21,
90,
1898,
13862,
12235,
29992,
113,
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... |
HTML/CSS designs for mundane text-heavy content
===
I am tasked with updating a family of web sites that promote scientific conferences that cater to a niche scientific field. The sites are currently written with some modest CSS layout for the shared common page template structure, but the details of each page are a mishmash of <p>, <br>, and &nbsp; to position the content. This makes it tough to update the content, since the spacings are always changing, and the page ends up ugly at the slightest mod.
So, I'd like to change this stuff into a more CSS-happy state. There are lots of sites that offer tips for specific CSS design goals, but I'm a developer without a lot of web site artistry capabilities and don't have a structure already in mind. Are there any good sites that teach CSS in the context of some relatively mundane -- but effectively presented -- business content? Stuff like the CSS zen garden is way cool, but I'm looking more for something that will both give me some simple text-heavy business data positioning ideas *and* present those ideas as a CSS learning opportunity.
Does any such site exist?
| 0 | [
2,
13,
15895,
118,
6824,
18,
4748,
26,
25843,
1854,
8,
19870,
2331,
800,
3726,
3726,
31,
589,
14605,
29,
71,
43,
1880,
21,
190,
16,
2741,
3259,
30,
3947,
2272,
10462,
30,
13674,
20,
21,
16539,
2272,
575,
9,
14,
3259,
50,
871,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a helper method in a utility class to use its callers logger in log4net?
===
I have an executable that depending on the command line switch supplied looks something like:
**Program.cs -**
namespace DiskSpaceReporting
{
class Program
{
static void Main(string[] args)
{
if(args.Length == 1)
{
switch(args[0])
{
case "-summarytotals":
SummaryDiskSpaceReporter.Run();
break;
case "-detailed":
DetailedDiskSpaceReporter.Run();
break;
//...other reporting types
}
}
}
}
}
**SummaryDiskSpaceReporter.cs**
namespace DiskSpaceReporting
{
public class SummaryDiskSpaceReporter
{
private static IEventIDLog log = EventIDLogManager.GetLogger(System.Reflection.MethodBase.GetCurrentMethod().DeclaringType);
public static void Run()
{
log.Info(1234, "Starting");
//...do work
string message = CreateMessage(messageID);
//...do work
}
}
}
**DetailedDiskSpaceReporter.cs**
namespace DiskSpaceReporting
{
public class DetailedDiskSpaceReporter
{
private static IEventIDLog log = EventIDLogManager.GetLogger(System.Reflection.MethodBase.GetCurrentMethod().DeclaringType);
public static void Run()
{
log.Info(1234, "Starting");
//...do work
string message = CreateMessage(messageID);
//...do work
}
}
}
**Helpers.cs**
namespace DiskSpaceReporting
{
public class Helpers
{
private static IEventIDLog log = EventIDLogManager.GetLogger(System.Reflection.MethodBase.GetCurrentMethod().DeclaringType);
public static string CreateMessage(Guid messageID)
{
log.Info(9876, "Starting");
//...do work
}
}
}
In my log4net config I have two separate loggers, one for each of the SummaryDiskSpaceReporter and DetailedDiskSpaceReporter because their logging requirements are different:
<root>
<level value="ALL" />
<appender-ref ref="ConsoleLogAppender" />
<appender-ref ref="EventLogAppender" />
</root>
<logger name="DiskSpaceReporting.SummaryDiskSpaceReporter">
<appender-ref ref="SummaryDiskSpaceReporterRollingFileAppender"/>
</logger>
<logger name="DiskSpaceReporting.DetailedDiskSpaceReporter">
<appender-ref ref="DetailedDiskSpaceReporterRollingFileAppender"/>
</logger>
Both SummaryDiskSpaceReporter and DetailedDiskSpaceReporter call a helper method in a class called Helpers. I want to put some logging into the helper class methods.
So...the question is, how do I get the Helpers.CreateMessage() to use the same logger as its caller? i.e. if the caller was SummaryDiskSpaceReporter.Run() then it should use the DiskSpaceReporting.SummaryDiskSpaceReporter logger, if the caller was DetailedDiskSpaceReporter.Run() then it should use the DiskSpaceReporting.DetailedDiskSpaceReporter logger.
Cheers
Kev
| 0 | [
2,
184,
107,
31,
164,
21,
448,
106,
2109,
19,
21,
10082,
718,
20,
275,
82,
21326,
18,
13,
29480,
19,
6738,
300,
2328,
60,
800,
3726,
3726,
31,
57,
40,
1396,
17194,
5924,
30,
4758,
27,
14,
1202,
293,
5521,
7949,
1879,
301,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hooking into Windows File Copy
===
I want to write my own file copy program that will run when the user chooses'Paste' (Ctrl+V) in Windows Explorer. Some programs like CopyHandler and SuperCopier are doing this. But I don't know how.
Please help. | 0 | [
2,
5559,
68,
77,
1936,
3893,
4344,
800,
3726,
3726,
31,
259,
20,
2757,
51,
258,
3893,
4344,
625,
30,
129,
485,
76,
14,
4155,
3538,
18,
22,
19802,
62,
22,
13,
5,
4812,
6362,
2430,
710,
6,
19,
1936,
8520,
9,
109,
1726,
101,
4344... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 method for getting a database connection/object into a function in PHP?
===
A couple of the options are:
$connection = {my db connection/object};
function PassedIn($connection) { ... }
function PassedByReference(&$connection) { ... }
function UsingGlobal() {
global $connection;
...
}
So, passed in, passed by reference, or using global. I'm thinking in functions that are only used within 1 project that will only have 1 database connection. If there are multiple connections, the definitely passed in or passed by reference.
I'm thining passed by reference is not needed when you are in PHP5 using an object, so then passed in or using global are the 2 possibilities.
The reason I'm asking is because I'm getting tired of always putting in $connection into my function parameters. | 0 | [
2,
98,
25,
14,
246,
2109,
26,
1017,
21,
6018,
2760,
118,
23793,
77,
21,
1990,
19,
13,
26120,
60,
800,
3726,
3726,
21,
1335,
16,
14,
6368,
50,
45,
5579,
25996,
872,
800,
13,
1,
915,
13,
9007,
2760,
118,
23793,
1,
73,
1990,
1100... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In ADO.Net Data Services how do I check if an entity is already in the context?
===
I have an ADO.Net Data Service that I am using to do a data import. There are a number of entities that are linked to by most entities. To do that during import I create those entities first, save them and then use .SetLink(EntityImport, "NavigationProperty", CreatedEntity). Now the first issue that I ran into was that the context did not always know about CreatedEntity (this is due to each of the entities being imported independently and a creation of a context as each item is created - I'd like to retain this functionality - i.e. I'm trying to avoid "just use one context" as the answer).
So I have a .AddToCreatedEntityType(CreatedEntity) before attempting to call SetLink. This of course works for the first time, but on the second pass I get the error message "the context is already tracking the entity".
Is there a way to check if the context is already tracking the entity (context.Contains(CreatedEntity) isn't yet implemented)? I was thinking about attempting a try catch and just avoiding the error, but that seems to create a new CreatedEntity each pass. It is looking like I need to use a LINQ to Data Services to get that CreatedEntity each time, but that seems innefficient - any suggestions? | 0 | [
2,
19,
21,
537,
9,
2328,
1054,
687,
184,
107,
31,
2631,
100,
40,
9252,
25,
614,
19,
14,
4141,
60,
800,
3726,
3726,
31,
57,
40,
21,
537,
9,
2328,
1054,
365,
30,
31,
589,
568,
20,
107,
21,
1054,
9010,
9,
80,
50,
21,
234,
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... |
Can you propose a more elegant way to 'tokenize' c# code for html formatting?
===
*([This question][1] about refactoring F# code got me one down vote, but also some interesting and useful answers. And 62 F# questions out of the 32,000+ on SO seems pitiful, so I'm going to take the risk of more disapproval!)*
I was trying to post a bit of code on a blogger blog yesterday, and turned to [this site][2], which I had found useful in the past. However, the blogger editor ate all the style declarations, so that turned out to be a dead end.
So (like any hacker), I thought "how hard can it be?" and rolled my own in <100 lines of F#.
Here is the 'meat' of the code, which turns an input string into a list of 'tokens'. Note that these tokens aren't to be confused with the lexing/parsing-style tokens. I did look at those briefly, and though I hardly understood anything, I did understand that they would give me *only* tokens, whereas I want to keep my original string.
The question is: is there a more elegant way of doing this? I don't like the n re-definitions of s required to remove each token string from the input string, but it's difficult to split the string into potential tokens in advance, because of things like comments, strings and the #region directive (which contains a non-word character).
//Types of tokens we are going to detect
type Token =
| Whitespace of string
| Comment of string
| Strng of string
| Keyword of string
| Text of string
| EOF
//turn a string into a list of recognised tokens
let tokenize (s:String) =
//this is the 'parser' - should we look at compiling the regexs in advance?
let nexttoken (st:String) =
match st with
| st when Regex.IsMatch(st, "^\s+") -> Whitespace(Regex.Match(st, "^\s+").Value)
| st when Regex.IsMatch(st, "^//.*?\r?\n") -> Comment(Regex.Match(st, "^//.*?\r?\n").Value) //this is double slash-style comments
| st when Regex.IsMatch(st, "^/\*(.|[\r?\n])*?\*/") -> Comment(Regex.Match(st, "^/\*(.|[\r?\n])*?\*/").Value) // /* */ style comments http://ostermiller.org/findcomment.html
| st when Regex.IsMatch(st, @"^""([^""\\]|\\.|"""")*""") -> Strng(Regex.Match(st, @"^""([^""\\]|\\.|"""")*""").Value) // unescaped = "([^"\\]|\\.|"")*" http://wordaligned.org/articles/string-literals-and-regular-expressions
| st when Regex.IsMatch(st, "^#(end)?region") -> Keyword(Regex.Match(st, "^#(end)?region").Value)
| st when st <> "" ->
match Regex.Match(st, @"^[^""\s]*").Value with //all text until next whitespace or quote (this may be wrong)
| x when iskeyword x -> Keyword(x) //iskeyword uses Microsoft.CSharp.CSharpCodeProvider.IsValidIdentifier - a bit fragile...
| x -> Text(x)
| _ -> EOF
//tail-recursive use of next token to transform string into token list
let tokeneater s =
let rec loop s acc =
let t = nexttoken s
match t with
| EOF -> List.rev acc //return accumulator (have to reverse it because built backwards with tail recursion)
| Whitespace(x) | Comment(x)
| Keyword(x) | Text(x) | Strng(x) ->
loop (s.Remove(0, x.Length)) (t::acc) //tail recursive
loop s []
tokeneater s
(If anyone is really interested, I am happy to post the rest of the code)
[1]: http://stackoverflow.com/questions/174418/can-you-improve-this-lines-of-code-algorithm-in-f
[2]: http://manoli.net/csharpformat/ | 0 | [
2,
92,
42,
17873,
21,
91,
11614,
161,
20,
13,
22,
262,
2853,
2952,
22,
272,
5910,
1797,
26,
13,
15895,
2595,
1203,
60,
800,
3726,
3726,
1637,
5,
2558,
1565,
1301,
500,
2558,
165,
500,
88,
302,
17455,
68,
398,
5910,
1797,
330,
55... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.