unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
fatal error C1083: Cannot open include file: 'Windows.h': and scons
===
today is officially my first day with C++ :P
I've downloaded Visual C++ 2005 express edition and
Microsoft Platform SDK for Windows Server 2003 SP1
because I want to put my hands on open source Enso.
So, after installing scons I went to the console and try to compile it using scons but I got this error:
C:\oreyes\apps\enso\enso-read-only\src\platform\win32\Include\WinSdk.h(64) : fatal error C1083: Cannot open include file: 'Windows.h': No such file or directory
scons: *** [src\platform\win32\InputManager\AsyncEventProcessorRegistry.obj] Error 2
scons: building terminated because of errors.
After checking these links:
<a href="http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=1135164&SiteID=1">VS ans PSDK</a>
<a href="http://stackoverflow.com/questions/160938/fatal-error-c1083-cannot-open-include-file-tiffioh-no-such-file-or-directory-vc#160957">Include tiffi.h</a>
<a href=""http://stackoverflow.com/questions/80788/fatal-error-c1083-cannot-open-include-file-windowsh-no-such-file-or-directory#81226">Wndows.h</a>
I've manage to configure my installation like this:
![alt text][1]
And even run this script
![alt text][2]
And I managed to compile the file below in the IDE.
// Test.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <Windows.h>
int _tmain(int argc, _TCHAR* argv[])
{
return 0;
}
Bus I still get that exception in the console. Anyone has scons experience?
[1]: http://img404.imageshack.us/img404/9210/vcdirsdq7.png
[2]: http://img404.imageshack.us/img404/5895/registrationcn0.png | 0 | [
2,
8773,
7019,
272,
1036,
4736,
45,
1967,
368,
468,
3893,
45,
13,
22,
27508,
18,
9,
252,
22,
45,
17,
13,
18,
12124,
800,
3726,
3726,
786,
25,
2320,
51,
64,
208,
29,
272,
20512,
13,
45,
306,
31,
22,
195,
23887,
3458,
272,
20512... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automated processing of an Email in C#
===
Similar question as [this one][1] but for a Microsoft Environment.
Email --> Exchange Server -->[something]
For the [something] I was using Outlook 2003 & C# but it *feels* messy (A program is trying to access outlook, this could be a virus etc)
Microsoft.Office.Interop.Outlook.Application objOutlook = new Microsoft.Office.Interop.Outlook.Application();
Microsoft.Office.Interop.Outlook.NameSpace objNS = objOutlook.GetNamespace("MAPI");
objNS.Logon("MAPIProfile", "MAPIPassword", false, true);
Is this the best way to do it? Is there a better way of retrieving and processing emails in a Microsoft environment???
[1]: http://stackoverflow.com/questions/56722/automated-processing-of-an-email-in-java | 0 | [
2,
14904,
5511,
16,
40,
8517,
19,
272,
5910,
800,
3726,
3726,
835,
1301,
28,
636,
1565,
53,
500,
2558,
165,
500,
47,
26,
21,
7099,
2307,
9,
8517,
13,
8,
8,
1,
1950,
8128,
13,
8,
8,
1,
2558,
9099,
500,
26,
14,
636,
9099,
500,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you use Javadoc for every method you write?
===
Should I be writing Doc Comments for all of my java methods? | 0 | [
2,
107,
42,
275,
8247,
13799,
26,
352,
2109,
42,
2757,
60,
800,
3726,
3726,
378,
31,
44,
1174,
9765,
7534,
26,
65,
16,
51,
8247,
3195,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
asp.net code to link to photo ordering site . .
===
i have photos on my website. Many people (okay just my mom) want to order these pictures as prints.. I could upload them to shutterfly or kodak site but i wanted to see if there was any code i could write so you click on my picture and it goes and sends it over to a photo website to order pics. I would want to support bulk as well. | 0 | [
2,
28,
306,
9,
2328,
1797,
20,
3508,
20,
3056,
15775,
689,
13,
9,
13,
9,
800,
3726,
3726,
31,
57,
7064,
27,
51,
2271,
9,
151,
148,
13,
5,
4779,
114,
51,
1641,
6,
259,
20,
389,
158,
3104,
28,
12202,
9,
9,
31,
110,
71,
8294,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create an icon in memory with win32 in python
===
What's a good way to generate an icon in-memory in python? Right now I'm forced to use pygame to draw the icon, then I save it to disk as an .ico file, and then I load it from disk as an ICO resource...
Something like this:
if os.path.isfile(self.icon):
icon_flags = win32con.LR_LOADFROMFILE | win32con.LR_DEFAULTSIZE
hicon = win32gui.LoadImage(hinst,
self.icon,
win32con.IMAGE_ICON,
0,
0,
icon_flags)
...where self.icon is the filename of the icon I created.
Is there any way to do this in memory? | 0 | [
2,
1600,
40,
9801,
19,
1912,
29,
628,
3125,
19,
20059,
800,
3726,
3726,
98,
22,
18,
21,
254,
161,
20,
7920,
40,
9801,
19,
8,
790,
5171,
93,
19,
20059,
60,
193,
130,
31,
22,
79,
1292,
20,
275,
7103,
5128,
20,
2003,
14,
9801,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Find "real" height/width of Swing object
===
Because Canvas3D doesn't have the ability to resize dynamically with the parent frame, I would like to be able to track when a user resizes a window and then resize it manually myself. (If this ends up crashing Canvas3D, as some docs suggest, I will simply destroy and recreate it when the user resizes their window). Part of this procedure involves being able to accurately tell how big the container panel is to begin with.
The two methods I've tried:
<pre>panel.getHeight();
panel.getPreferredSize().height;</pre>
Don't seem to accurately report things: ``getHeight()`` is invariably zero, and ``getPreferredSize()`` returns numbers that don't actually have anything to do with the actual size of the panel.
Any ideas? | 0 | [
2,
477,
13,
7,
7467,
7,
2947,
118,
3976,
43,
96,
16,
5587,
3095,
800,
3726,
3726,
185,
9696,
240,
43,
1437,
22,
38,
57,
14,
2165,
20,
302,
10454,
7782,
1326,
29,
14,
4766,
3523,
15,
31,
83,
101,
20,
44,
777,
20,
792,
76,
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... |
What compels you to attend your local user group(s)?
===
So I'm in Des Moines, Iowa and we have a good number of user groups in our area considering our size. Ruby, .Net, Java, Agile, *nix, etc... Well, tonight a good number of us "leaders" of said user groups got together for a couple drinks and to talk about how we can work together to help make the "DeMo" (I keep seeing this on Twitter) user group scene better.
We came up with a number of rather good ideas, but I'm curious. What compels you to attend your local user group(s)? Dig deep here guys. Maybe it is the free pizza, or the give aways. But I'm more interested to know about things out side of the freebie stuff. | 4 | [
2,
98,
6479,
6798,
42,
20,
3702,
154,
375,
4155,
214,
5,
18,
6,
60,
800,
3726,
3726,
86,
31,
22,
79,
19,
1746,
25951,
15,
4985,
17,
95,
57,
21,
254,
234,
16,
4155,
1170,
19,
318,
217,
5154,
318,
1072,
9,
10811,
15,
13,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Linux provide a monotonically increasing clock to applications
===
Does Linux/Unix/Posix provide an API to user-space applications to access a monotonically increasing clock, with centisecond to millisecond accuracy?
On Linux, /proc/uptime provides a string-based representation of a floating point number of the number of seconds the system has been up.
gettimeofday(2) does not provide a monotonically increasing clock.
I could use getitimer(2) in the ITIMER_REAL time domain, set the timer to start at the (platform dependent) maximum and ignore the signal generated, but according to the man page the longest the timer can run for is approximately 100 days, which is shorter than my expected run time. | 0 | [
2,
630,
13024,
1181,
21,
4129,
444,
8438,
3425,
4229,
20,
3767,
800,
3726,
3726,
630,
13024,
118,
1020,
4028,
118,
14882,
396,
1181,
40,
21,
2159,
20,
4155,
8,
5582,
3767,
20,
1381,
21,
4129,
444,
8438,
3425,
4229,
15,
29,
5802,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Excel: Copy every nth line from one sheet to another
===
I have an Excel spreadsheet with 1 column, 700 rows. I care about every seventh line. I don't want to have to go in and delete the 6 rows between each row I care about. So my solution was to create another sheet and specify a reference to each cell I want.
=sheet1!a1
=sheet1!a8
=sheet1!a15
But I don't want to type in each of these formulas ... `100 times.I thought if I selected the three and dragged the box around, it would understand what I was trying to do, but no luck.
Any ideas on how to do this elegantly/efficiently? | 0 | [
2,
20700,
45,
4344,
352,
13,
103,
96,
293,
37,
53,
6125,
20,
226,
800,
3726,
3726,
31,
57,
40,
20700,
1789,
17627,
29,
137,
4698,
15,
10954,
11295,
9,
31,
781,
88,
352,
3774,
293,
9,
31,
221,
22,
38,
259,
20,
57,
20,
162,
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... |
Using svn and .NET Winforms - Building Install Files Deletes _svn Folders
===
Does anyone know how to build an install project without it deleting/overwriting the _svn folders?
I have a VB .NET 2005 Winform Application and each time I do an Installer Build, it deletes/overwrites the _svn folder in the directories. How can I stop this from happening?
Any and all help is appreciated!
Thanks!
JFV | 0 | [
2,
568,
13,
18,
16578,
17,
13,
9,
2328,
628,
4190,
18,
13,
8,
353,
16146,
6488,
27448,
18,
13,
1,
18,
16578,
19294,
18,
800,
3726,
3726,
630,
1276,
143,
184,
20,
1895,
40,
16146,
669,
366,
32,
121,
1336,
68,
118,
2549,
12646,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 constrain the size of a tooltip/popup-style DIV so that it doesn't trigger scrollbars on the page
===
The mouse hovers over an element and a tip appears. The tip overflows the page, triggering a scrollbar, which changes the layout just enough so that the underlying element that triggered the tip is no longer under the mouse pointer, so the tip goes away.
The tip goes away, so the scrollbar goes away, and now the mouse is again over the element.
Wash, rinse, repeat.
If I could make sure that tip isn't too big so as to trigger scrollbars, that would solve my problem. | 0 | [
2,
184,
107,
31,
11608,
11809,
14,
1072,
16,
21,
5607,
10169,
118,
6057,
576,
8,
4381,
13,
12916,
86,
30,
32,
1437,
22,
38,
7286,
12159,
1850,
18,
27,
14,
2478,
800,
3726,
3726,
14,
7567,
21350,
18,
84,
40,
4520,
17,
21,
4265,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Free DayView Calendar for WPF?
===
Is there a free DayView Calendar for WPF like this one?
[http://www.codeproject.com/KB/selection/Calendardayview.aspx][1]
Thanks in advance! Cheers from Argentina!
[1]: http://www.codeproject.com/KB/selection/Calendardayview.aspx | 0 | [
2,
551,
208,
4725,
7036,
26,
619,
7721,
60,
800,
3726,
3726,
25,
80,
21,
551,
208,
4725,
7036,
26,
619,
7721,
101,
48,
53,
60,
636,
21127,
6903,
6483,
9,
9375,
21011,
9,
960,
118,
18167,
118,
18,
5033,
118,
3430,
219,
2542,
1185... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 permit my Java applet to use MySQL?
===
I've recently gotten my hobby java project embedded into a page <a href="http://stackoverflow.com/questions/138157/java-console-like-web-applet">thanks to this very site</a>, but now I'm having some security issues.
I have the include:
import java.sql.*;
and the line:
Class.forName("com.mysql.jdbc.Driver").newInstance();
as well as a mysql .jar file in my src directory, it works from the console, and in the applet works fine from the applet - up until that forName() line in my code, where it throws the exception:
<pre>
Exception: com.mysql.jdbc.Driverjava.lang.ClassNotFoundException: com.mysql.jdbc.Driver
java.security.AccessControlException: access denied (java.lang.RuntimePermission exitVM.-1)
at java.security.AccessControlContext.checkPermission(Unknown Source)
at java.security.AccessController.checkPermission(Unknown Source)
at java.lang.SecurityManager.checkPermission(Unknown Source)
at java.lang.SecurityManager.checkExit(Unknown Source)
at java.lang.Runtime.exit(Unknown Source)
at java.lang.System.exit(Unknown Source)
at applet.Database.connectDB(Database.java:80)
etc...
</pre>
I think I may be able to fix it with a client.policy file, otherwise I might need to write an abstraction layer which uses a server-client network connection to query from the server-side...
I'm sure the Java gurus here probably know the best way about it. | 0 | [
2,
184,
107,
31,
8992,
51,
8247,
4037,
38,
20,
275,
51,
18,
22402,
60,
800,
3726,
3726,
31,
22,
195,
1989,
4094,
51,
18229,
8247,
669,
12138,
77,
21,
2478,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
9990,
9,
960,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python's __import__ doesn't work as expected
===
When using `__import__` with a dotted name, something like: `somepackage.somemodule`, the module returned isn't `somemodule`, whatever is returned seems to be mostly empty! what's going on here? | 0 | [
2,
20059,
22,
18,
13,
1,
1660,
1993,
1,
1437,
22,
38,
170,
28,
1727,
800,
3726,
3726,
76,
568,
13,
1,
1660,
1993,
1,
29,
21,
23696,
204,
15,
301,
101,
45,
13,
1,
3220,
8573,
1303,
9,
3220,
19673,
62,
1,
15,
14,
12613,
587,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery.ScrollTo / jQuery.SerialScroll Horizontal Scrolling
===
I am looking to implement horizontal scrolling using [jQuery.SerialScroll][1] (based on [jQuery.ScrollTo][2]).
I currently have a continuous horizontal scrolling working with liScroll as I discuss in [this post][3].
However, now I need discrete scrolling and I have SerialScroll working perfectly for vertical scrolling.
For some reason, if the 'axis' property is specified as 'x' nothing happens.
I can't even get the [SerialScroll example for right to left scrolling][4] to work.
I have HTML like this:
<div id="pane">
<div>Item 1</div>
<div>Item 2</div>
<div>Item 3</div>
</div>
I have jQuery like this, that works when axis is 'y'
jQuery(function($) {
var $pane = $('#pane');
$pane .serialScroll({
items: 'div',
next: $pane, // the container itself will get bound
duration: 2100,
force: true,
axis: 'x',
step: 1, //scroll 1 news each time
event: 'showNext' //just a random event name
});
setInterval(function() {//scroll each 12 seconds
$pane.trigger('showNext');
}, 12000);
});
Any ideas?
[1]: http://flesler.blogspot.com/2008/02/jqueryserialscroll.html
[2]: http://demos.flesler.com/jquery/scrollTo/
[3]: http://stackoverflow.com/questions/41027/whats-a-good-bit-of-js-or-jquery-for-horizontally-scrolling-news-ticker
[4]: http://flesler-plugins.googlecode.com/files/SerialScroll_right-to-left.js | 0 | [
2,
487,
8190,
93,
9,
3862,
8694,
262,
13,
118,
487,
8190,
93,
9,
4104,
2815,
3862,
8694,
10095,
13,
28166,
800,
3726,
3726,
31,
589,
699,
20,
8713,
10095,
13,
28166,
568,
636,
728,
8190,
93,
9,
4104,
2815,
3862,
8694,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 build "Tagging" support using CouchDB?
===
I'm using the following view function to iterate over all items in the database (in order to find a tag), but I think the performance is very poor if the dataset is large.
Any other approach?
def by_tag(tag):
return '''
function(doc) {
if (doc.tags.length > 0) {
for (var tag in doc.tags) {
if (doc.tags[tag] == "%s") {
emit(doc.published, doc)
}
}
}
};
''' % tag | 0 | [
2,
184,
20,
1895,
13,
7,
8628,
2762,
7,
555,
568,
4914,
9007,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
249,
1418,
1990,
20,
32,
106,
1373,
84,
65,
3755,
19,
14,
6018,
13,
5,
108,
389,
20,
477,
21,
3383,
6,
15,
47,
31,
277... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Connection to Oracle without a username or password
===
Oracle has this concept of allowing database users to be identified by the operating system user who is running the program that is connecting to Oracle. See [here][1].
This allows you to do, as that user on a unix machine for example, a command such as:
sqlplus /
I am attempting to write a Java program for Oracle 10.2 which connects without a username or password. The obvious choice of url:
jdbc:oracle:thin:/@localhost:1521:MYDBSID
doesn't work, giving an error (Sorry I don't have the error available right now).
I have attempted many other forms of doing this as well, but with no luck.
Does anyone have any suggestions on how I can connect a Java program to Oracle using the OS identification method?
[1]: http://www.oracle-base.com/articles/misc/OsAuthentication.php
| 0 | [
2,
2760,
20,
15759,
366,
21,
4155,
7259,
54,
20884,
800,
3726,
3726,
15759,
63,
48,
2420,
16,
2719,
6018,
3878,
20,
44,
2889,
34,
14,
2455,
329,
4155,
72,
25,
946,
14,
625,
30,
25,
6440,
20,
15759,
9,
196,
636,
6836,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use jQuery to insert a <DIV> around child elements?
===
I have ASP.Net code similar to the following (this is inside a FIELDSET):
<ol>
<li>
<label>Some label</label>
<one or more form controls, ASP.Net controls, labels, etc.>
</li>
<li>
<label>Another label</label>
<... more of the same...>
</li>
...
</ol>
I'm trying to keep my markup as clean as I possibly can, but I've decided that for various reasons, I need to wrap a DIV around everything in the list item after the first label, like this:
<ol>
<li>
<label>Some label</label>
<div class="GroupThese">
<one or more form controls, ASP.Net controls, labels, etc.>
</div>
</li>
<li>
<label>Another label</label>
<div class="GroupThese">
<... more of the same...>
</div>
</li>
...
</ol>
I would rather do this with "unobtrusive Javascript" via jQuery instead of littering my page with extra markup so I can keep the form semantically "clean".
I know how to write a jQuery selector to get to the first label in each list item $("li+label") or use :first-child. I also know how to insert things after the selection.
What I can't figure out (at least this late at night) is how to find everything after the first label in the list item (or basically everything in the list item except for the first label would be another way to put it) and wrap a DIV around that in the document ready function. | 0 | [
2,
184,
107,
31,
275,
487,
8190,
93,
20,
14692,
21,
13,
1,
12916,
1,
140,
850,
2065,
60,
800,
3726,
3726,
31,
57,
28,
306,
9,
2328,
1797,
835,
20,
14,
249,
13,
5,
1565,
25,
572,
21,
575,
3554,
6,
45,
13,
1,
1823,
1,
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... |
sql2005 - best way to move data between 2 databases when pk's have changed
===
i know this should be db 101, but its just not as clear as it can be for me. I am using SQL2005 express and i want to copy data from databaseA to databaseB. DatabaseB already contains existing data - it may even contain data with pk's that have changed or dont exist - for example:
DataBase A
pk1 = peaches
pk2 = apples
DataBase B
pk1 = peaches
pk2 = oranges
pk3 = apples
now both A & B have related tables that are tied to the pk.
Historically i would write an app that selects the data from A and copies it to B via its Insert/Update procs (using .NET), but obv this is very cumbersome, tho some advantages are i could have a dropdown that allows you to select A to copy - and B to copy to if it exists, or say add new - for instance:
(dropdown - select source)
Peaches
Apples
(dropdown - select target)
-new-
peaches
oranges
apples
I was going to use SSIS, but the target db has only SQL express so this is not available nor do i have time to learn it (ive used dts much in the past, but not this newer tool). In SQL2000 i would just use DTS, but with the more complicated schema now im not even sure i would trust that.
Any suggestions or should i just continue to write my custom apps to migrate data from A to B?
Im looking forward to everyones suggestions - i would love to continue down a path that i feel is the best way to do this :-) | 0 | [
2,
4444,
255,
2835,
13,
8,
246,
161,
20,
780,
1054,
128,
172,
6018,
18,
76,
13,
17244,
22,
18,
57,
1015,
800,
3726,
3726,
31,
143,
48,
378,
44,
13,
9007,
7698,
15,
47,
82,
114,
52,
28,
1207,
28,
32,
92,
44,
26,
55,
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... |
java Enum definition
===
I thought I understood Java generics pretty well, but then I came across the following in java.lang
Class Enum<E extends Enum<E>>
Could someone explain how to interpret this type parameter? Bonus points for providing other examples of where a similar type parameter could be used.
Cheers,
Don. | 0 | [
2,
8247,
1957,
723,
5465,
800,
3726,
3726,
31,
289,
31,
4014,
8247,
12733,
18,
1772,
134,
15,
47,
94,
31,
281,
464,
14,
249,
19,
8247,
9,
9949,
718,
1957,
723,
1,
62,
9073,
1957,
723,
1,
62,
1,
110,
737,
3271,
184,
20,
11584,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Installing SqlServer 2005 Express using InstallShield and creating a unique named instance
===
I'm using Installshield 2008 express to create an installation package. My application relies on Sql Server 2005 express edition. I know I am able to check the "microsoft sql server 2005 express" prerequisite under the redistributables tab. However, this leaves the installation entirely in the hands of the end user, and if he/she chooses the defaults all the way through, we end up with a installation with the named instance SqlExpress. At the very least, I'd like to have the installation proceed with a MyCompany named instance as the default.
How do I accomplish this?
Do I have to upgrade to a more powerful version of installshield? | 0 | [
2,
25429,
4444,
255,
10321,
106,
812,
2999,
568,
16146,
29026,
17,
2936,
21,
2619,
377,
4851,
800,
3726,
3726,
31,
22,
79,
568,
16146,
29026,
570,
2999,
20,
1600,
40,
7758,
6030,
9,
51,
3010,
19272,
27,
4444,
255,
8128,
812,
2999,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 start extending MS SQL Reporting Services?
===
The reports I can churn out in SQL Server 2005 Reporting Services using the MS Business Intelligence Development Studio is rather limited for what I want to do. I have had a look at a <a href="http://stackoverflow.com/questions/80323/sql-server-2008-reporting-services-report-definition-customization-extensions">similiar stackoverflow question</a> and have had a browse through the MSDN website. I have managed to add some additional functionality from examples I've found but by and large I've found it hard to get a hold of examples or tutorials that explain what and how I can code for reporting services. Where would you recommend I start for coding additional reporting and layout functionality? | 0 | [
2,
184,
107,
31,
799,
8176,
4235,
4444,
255,
6670,
687,
60,
800,
3726,
3726,
14,
2813,
31,
92,
4834,
5778,
70,
19,
4444,
255,
8128,
812,
6670,
687,
568,
14,
4235,
508,
2872,
522,
1120,
25,
864,
1317,
26,
98,
31,
259,
20,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I use the standard C library in a Palm OS application?
===
The published code for Palm OS applications doesn't include standard headers, but instead uses Palm OS APIs for things like StrCopy and MemMove. Can I use standard headers and functions or do I need to convert my code to use the Palm OS versions? | 0 | [
2,
92,
31,
275,
14,
1236,
272,
1248,
19,
21,
3044,
13,
759,
3010,
60,
800,
3726,
3726,
14,
467,
1797,
26,
3044,
13,
759,
3767,
1437,
22,
38,
468,
1236,
157,
445,
15,
47,
700,
2027,
3044,
13,
759,
21,
8954,
26,
564,
101,
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... |
Python Inverse of a Matrix
===
How do I get the inverse of a matrix in python? I've implemented it myself, but it's pure python, and I suspect there are faster modules out there to do it. | 0 | [
2,
20059,
19,
9453,
16,
21,
8187,
800,
3726,
3726,
184,
107,
31,
164,
14,
19,
9453,
16,
21,
8187,
19,
20059,
60,
31,
22,
195,
6807,
32,
992,
15,
47,
32,
22,
18,
4267,
20059,
15,
17,
31,
7551,
80,
50,
4233,
17113,
70,
80,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
CNG, CryptoServiceProvider and Managed implementations of HashAlgorithm
===
So I was wondering if there are any major differences between the various implementations of the hash algorithms, take the SHA series of algorithms for example. All of them have 3 implementations each, 1 in managed code and 2 wrappers around different native crypto APIs, but are there any major differences between using any of them? I can imagine that the wrapper versions could have higher performance since its being executed in native code, but surley hey all need to perform the exact same calculations and thus provide the same output ie hey are interchangable. Is this correct?
For instance SHA512CNG cant be used on XP SP2 (docs are wrong) but SHA512MANAGED can. | 0 | [
2,
272,
2723,
15,
16277,
11449,
26735,
139,
17,
1471,
6123,
18,
16,
63,
4937,
6979,
242,
7015,
800,
3726,
3726,
86,
31,
23,
5712,
100,
80,
50,
186,
394,
4921,
128,
14,
617,
6123,
18,
16,
14,
19170,
15935,
15,
247,
14,
4116,
231,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Article on using Firebird.NET in a WinForms application?
===
Can anyone provide me with a link to good article about using Firebird.NET with a WinForms application? A simple google search did not yield good results - I am looking for a step-by-step guide which will help me to quickly a few things and am not sure the documentation is a good place to start.
Thanks in advance.
Anindya | 0 | [
2,
2002,
27,
568,
535,
8490,
9,
2328,
19,
21,
628,
4190,
18,
3010,
60,
800,
3726,
3726,
92,
1276,
1181,
55,
29,
21,
3508,
20,
254,
2002,
88,
568,
535,
8490,
9,
2328,
29,
21,
628,
4190,
18,
3010,
60,
21,
1935,
8144,
2122,
144,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Selenium: wait_for_* and friends in Selenium RC ruby driver
===
Are there any implementations of all the nifty [Selenium on Rails][1] methods like `wait_for_visible`, `assert_not_text_present`, ... for the **ruby driver of Selenium RC**?
If not, how would I go about implementing something like wait_for_visible?
[1]: http://selenium-on-rails.openqa.org | 0 | [
2,
23027,
14311,
45,
1760,
1,
1106,
1,
2483,
17,
954,
19,
23027,
14311,
16462,
10811,
2425,
800,
3726,
3726,
50,
80,
186,
6123,
18,
16,
65,
14,
1781,
3072,
93,
636,
18,
20110,
2187,
27,
2240,
18,
500,
2558,
165,
500,
3195,
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... |
Using AJAX callbacks with ASP.NET User controls
===
What's the best way to implement user controls that require AJAX callbacks?
I want to accomplish a few things:
* Have events done in the browser (eg, drag and drop) trigger an AJAX notification that can raise a control event, which causes code on the page using the control to do whatever it needs to do (eg, change a value in a database).
* Have partial updates (NOT using an updatepanel) that can do things like populate an auto-complete dropdown underneath a textbox.
* Implement a single user control that is generic enough to be reused on several pages
* Avoid having to implement logic on the page itself that passes events back to the control, because that is repetitive and hard to maintain
I'm using jQuery for most of the client side stuff, but for the actual AJAX calls I don't really care if it's jQuery or the ASP AJAX libraries.
Effectively what would be perfect is PageMethods on the user control, that would be easily callable from client-side script. Unfortunately, as far as I'm aware, pagemethods do not work on user controls.
---
I'll use an autocomplete control as an example:
I should be able to put the autocomplete control on the page, and then in the page code, have eg:
Public Sub HandleLookup(ByVal input As String, ByRef list As List(Of String) Handles MyControl.LookupEntries
list = New List(Of String)
' Query database for list of items..
For Each item as String in FullItemList
If item.StartsWith(input) then list.Add(item)
Next
Return list
End Sub
And do nothing else .. the rest of the code should be in the usercontrol.
----
Note, the controls I'm trying to make are much more specific than eg, autocomplete. They do not exist in any 3rd party libraries and I really need to be able to make them myself.
| 0 | [
2,
568,
20624,
645,
1958,
18,
29,
28,
306,
9,
2328,
4155,
8671,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
8713,
4155,
8671,
30,
4077,
20624,
645,
1958,
18,
60,
31,
259,
20,
14570,
21,
310,
564,
45,
1637,
57,
963,
677,
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... |
Design Time Attribute For CSS Class
===
Hopefully some Custom Control Designers/Builders can help
I'm attempting to build my first custom control that is essential a client detail collection form. There are to be a series of elements to this form that require carious styles applied to them. Ideally I'd like the VS 2005/2008 properties interface to be able to apply the CSSClass as it does at the control level, i.e. with a dropdown list of available CSS Clases.
Take for example the Class to be applied to the legend tag
/// <summary>Css Class for Legend</summary>
[Category("Appearance")]
[Browsable(true)]
[DefaultValue("")]
//I am at a loss as to what goes in [Editor]
[Editor(System.Web.UI.CssStyleCollection), typeof(System.Drawing.Design.UITypeEditor))]
public string LegendCSSClass
{
get { return _LegendCSSClass; }
set { _LegendCSSClass = value; }
}
I have tired a couple of options, as you can see from above, without much luck.
Hopefully there is something simple I am missing.
I'd also be happy for references pertaining to the <pre><code>[Editor]</code></pre> attribute
| 0 | [
2,
704,
85,
35,
14755,
26,
272,
18,
18,
718,
800,
3726,
3726,
13416,
109,
5816,
569,
12760,
118,
20904,
18,
92,
448,
31,
22,
79,
6314,
20,
1895,
51,
64,
5816,
569,
30,
25,
5832,
21,
6819,
6110,
1206,
505,
9,
80,
50,
20,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Placing a Sharepoint Site under version control
===
Working with Mircosoft Office Sharepoint Server 2007 (standard edition) what is the best way to place a site collection being developed under version control? We're using Subversion for all our other (non-sharepoint) projects but I'm just not sure how to approach MOSS.
What needs to be placed under version control to ensure we have everything we need to rebuild the Sharepoint Environment?
| 0 | [
2,
5861,
21,
1891,
3132,
689,
131,
615,
569,
800,
3726,
3726,
638,
29,
5877,
716,
12980,
488,
1891,
3132,
8128,
624,
13,
5,
15566,
1322,
6,
98,
25,
14,
246,
161,
20,
209,
21,
689,
1206,
142,
885,
131,
615,
569,
60,
95,
22,
99,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hidden features of Haskell
===
What are the lesser-known but useful features of the Haskell programming language. (I understand the language itself is lesser-known, but work with me. Even explanations of the simple things in Haskell, like defining the Fibonacci sequence with one line of code, will get upvoted by me).
- Try to limit answers to the Haskell core
- One feature per answer
- Give an example and short description of the feature, not just a link to documentation
- Label the feature using bold title as the first line
This follows after the following excellent questions:
See also:
- [Hidden features of C][1]
- [Hidden features of C#][2]
- [Hidden features of C++][3]
- [Hidden features of Python][10]
- [Hidden features of Java][4]
- [Hidden features of JavaScript][5]
- [Hidden features of Ruby][6]
- [Hidden features of PHP][7]
- [Hidden features of Perl][8]
- [Hidden features of VB.Net][9]
[1]: http://stackoverflow.com/questions/132241/hidden-features-of-c
[2]: http://stackoverflow.com/questions/9033/hidden-features-of-c
[3]: http://stackoverflow.com/questions/75538/hidden-features-of-c
[4]: http://stackoverflow.com/questions/15496/hidden-features-of-java
[5]: http://stackoverflow.com/questions/61088/hidden-features-of-javascript
[6]: http://stackoverflow.com/questions/63998/hidden-features-of-ruby
[7]: http://stackoverflow.com/questions/61401/hidden-features-of-php
[8]: http://stackoverflow.com/questions/161872/hidden-features-of-perl
[9]: http://stackoverflow.com/questions/102084/hidden-features-of-vbnet
[10]: http://stackoverflow.com/questions/101268/hidden-features-of-python
| 4 | [
2,
3689,
967,
16,
63,
16507,
800,
3726,
3726,
98,
50,
14,
8051,
8,
2929,
47,
4811,
967,
16,
14,
63,
16507,
3143,
816,
9,
13,
5,
49,
1369,
14,
816,
1145,
25,
8051,
8,
2929,
15,
47,
170,
29,
55,
9,
166,
5764,
18,
16,
14,
193... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Possible to use MovieClipLoader() to load a swf from a different server?
===
Having some issues loading files from media hosting into swf shell (a swf loading swfs as assets). Mp3s and images work fine but a swf never loads. Code is like:
swfpath = "http://555.55.555.555/vir_dir/swf/N000001.swf"
movie_loader.loadMovie(swfpath, "mc_swfimage");
if the swfpath is set to "swf/N00001.swf" it loads fine and if I point firefox towards the http link above (555s as placeholders here) it opens the file in firefox just fine.
Is it some security or does loadMovie not handle http paths?
Note it works fine if I do loadAudio with the same thing pointing to an MP3. | 0 | [
2,
938,
20,
275,
1308,
150,
6013,
8294,
106,
5,
6,
20,
6305,
21,
13,
18,
15263,
37,
21,
421,
8128,
60,
800,
3726,
3726,
452,
109,
1549,
12797,
6488,
37,
941,
10637,
77,
13,
18,
15263,
3593,
13,
5,
58,
13,
18,
15263,
12797,
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... |
Best Time of Day to Code
===
So far I've heard two answers to this question - <b>early in the morning</b>, after you shower and get to work, before you go to any mind-numbing meetings. You can actually get some work done now.
<b>Late at night</b>, when everything is taken care of, and you can just spend one to three hours working on something that interests you personally.
What have you found is the best time to get work done? | 4 | [
2,
246,
85,
16,
208,
20,
1797,
800,
3726,
3726,
86,
463,
31,
22,
195,
752,
81,
6709,
20,
48,
1301,
13,
8,
13,
1,
220,
1,
16310,
19,
14,
959,
1,
118,
220,
1,
15,
75,
42,
4555,
17,
164,
20,
170,
15,
115,
42,
162,
20,
186,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Running External Apps on save in Eclipse
===
Since we cannot setup Eclipse's RSE to use at the tool for remote editing, I have installed [Unison][1]. But how can I get Eclipse to automatically run unison on every file save? Is there an eclipse plugin available for this?
TIA
[1]: http://www.cis.upenn.edu/~bcpierce/unison/docs.html | 0 | [
2,
946,
4886,
4865,
18,
27,
2079,
19,
11652,
800,
3726,
3726,
179,
95,
1967,
18161,
11652,
22,
18,
13,
21245,
20,
275,
35,
14,
5607,
26,
5388,
9510,
15,
31,
57,
4066,
636,
8843,
528,
500,
2558,
165,
500,
9,
47,
184,
92,
31,
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... |
C++ - static variables initialisation order
===
C++ guarantees that variables in compilation unit (.cpp file) are initialised in order of declaration. For number of compilation units this rule works for each one separately (I mean static variables outside of classes) , but order between them is undefined.
Where I can see some explanations about this order for gcc and MSVC (I know that relying on that is a very bad idea - it is just to understand the problems that we may have with legacy code when moving to new GCC major and different OS) ?
Thanks | 0 | [
2,
272,
20512,
13,
8,
12038,
12157,
2104,
4330,
389,
800,
3726,
3726,
272,
20512,
9120,
18,
30,
12157,
19,
4868,
1237,
13,
5,
9,
150,
3421,
3893,
6,
50,
2104,
2541,
19,
389,
16,
7098,
9,
26,
234,
16,
4868,
1398,
48,
1828,
693,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 and CouchDB - Architectural Concerns
===
I am working on a project that is going to use CouchDB for flexible storage of documents. The requirements of my system are a neat match for CouchDB for storage.
BUT
My question really boils down to this:
Should I keeop using ActiveRecord and MySQL as well ... there are a raft of handy Plugins that are all readily available for use with ActiveRecord (such as authentication and access control). Just wondering if the advantages of leveraging existing plugins is worth the extra management overhead and possible integration issues (working across disparate datastores). | 0 | [
2,
2240,
18,
17,
4914,
9007,
13,
8,
5350,
4823,
800,
3726,
3726,
31,
589,
638,
27,
21,
669,
30,
25,
228,
20,
275,
4914,
9007,
26,
13568,
4326,
16,
4374,
9,
14,
4786,
16,
51,
329,
50,
21,
15956,
730,
26,
4914,
9007,
26,
4326,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 rename a Project Folder from within Visual Studio?
===
My current solution for renaming the project folder is:
- Remove the project from the solution.
- Rename the folder outside Visual Studio.
- Re-add the project to the solution.
Is there a better way?
| 0 | [
2,
184,
107,
31,
302,
7259,
21,
669,
19294,
37,
363,
3458,
1120,
60,
800,
3726,
3726,
51,
866,
4295,
26,
25934,
14,
669,
19294,
25,
45,
13,
8,
4681,
14,
669,
37,
14,
4295,
9,
13,
8,
302,
7259,
14,
19294,
719,
3458,
1120,
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... |
How to build large MySQL INSERT query in PHP without wasting memory
===
I have code looking something like this:
$data = file_get_contents($tempFile); // perhaps 30MB of file data, now in PHP's memory
$hash = md5($data);
$query = "INSERT INTO some_table
SET BlobData = '" . mysql_real_escape_string($data) . "',
BlobHash = '$hash'
";
mysql_query($query);
I know this isn't very efficient as each of the '.' operators will reallocate a bigger memory block and the 30MB string will be copied several times.
Is there anything more efficient than the following solution?
$data = file_get_contents($tempFile); // perhaps 30MB of file data, now in PHP's memory
$hash = md5($data);
$query = "INSERT INTO some_table SET BlobData = '%s', BlobHash = '$hash'";
mysql_query(sprintf($query, mysql_real_escape_string($data))); | 0 | [
2,
184,
20,
1895,
370,
51,
18,
22402,
14692,
25597,
19,
13,
26120,
366,
23,
1203,
1912,
800,
3726,
3726,
31,
57,
1797,
699,
301,
101,
48,
45,
5579,
18768,
800,
3893,
1,
3060,
1,
25424,
18,
5,
4403,
9577,
16877,
6,
73,
12894,
177... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Windows provide a monotonically increasing clock to applications
===
This question is inspired by [Does Linux provide a monotonically increasing clock to applications][1].
[1]: http://stackoverflow.com/questions/211055/does-linux-provide-a-monotonically-increasing-clock-to-applications | 0 | [
2,
630,
1936,
1181,
21,
4129,
444,
8438,
3425,
4229,
20,
3767,
800,
3726,
3726,
48,
1301,
25,
3054,
34,
636,
10739,
13024,
1181,
21,
4129,
444,
8438,
3425,
4229,
20,
3767,
500,
2558,
165,
500,
9,
636,
165,
500,
45,
7775,
6903,
253... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 MS Access to return on-demand reports in a web server?
===
I have built a MS Access 2007 application that can create reports files in various formats (PDF, XLS, CSV, XML).
I would like to allow the creation of these reports to be accessible from a web page where users would just click on a link and get a download of the report produced by my Access application.
I would like to keep it simple and I'm not interested at this stage in rewriting the data processing in .Net. I'd just like to find a way to automate the creation of the user report to return a file that can be downloaded.
In essence, my Access application would act as a web service of some kind.
The web server is IIS on Windows 2003.
Any pointers or ideas would be welcome. I'm not well versed in IIS administration or ASP pages.
Thanks to all who respond. | 0 | [
2,
568,
4235,
1381,
20,
788,
27,
8,
25358,
2813,
19,
21,
2741,
8128,
60,
800,
3726,
3726,
31,
57,
392,
21,
4235,
1381,
624,
3010,
30,
92,
1600,
2813,
6488,
19,
617,
13767,
13,
5,
11124,
15,
993,
7532,
15,
272,
18,
710,
15,
235... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 known uses of AI in web development?
===
What are known uses of AI/machine-learning in web development?
And what would be some fields that, currently don't use AI, but could possibly benefit from AI?
Note: I've worked on AI for academics, simulations and games before, and I'm currently doing some informal/personal research right now, so I'm looking for some new fields to draw ideas and models from.
Thanks! | 0 | [
2,
98,
50,
167,
2027,
16,
21,
49,
19,
2741,
522,
60,
800,
3726,
3726,
98,
50,
167,
2027,
16,
21,
49,
118,
20442,
8,
26001,
19,
2741,
522,
60,
17,
98,
83,
44,
109,
2861,
30,
15,
871,
221,
22,
38,
275,
21,
49,
15,
47,
110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
perl extract text then save
===
No extracted data output to data2.txt? What goes wrong to the code?
**MyFile.txt**<br>
ex1,fx2,xx1<br>
mm1,nn2,gg3<br>
EX1,hh2,ff7<br>
**wrong output i've got**?:<br>
=data2.txt=<br>
**desired output in data2.txt**:<br>
ex1,fx2,xx1<br>
EX1,hh2,ff7
<br>
#! /DATA/PLUG/pvelasco/Softwares/PERLINUX/bin/perl -w
my $infile='My1.txt';
my $outfile='data2.txt';
open IN, "$infile" or die "Cant open $infile:$!";
open OUT, ">$outfile" or die "Cant open $outfile:$!";
while (<IN>) {
if (m/EX$HF|ex$HF/) {
print OUT $_, "\n";
print $_;
}
}
close IN;
close OUT; | 0 | [
2,
416,
255,
10962,
1854,
94,
2079,
800,
3726,
3726,
90,
18607,
1054,
5196,
20,
1054,
135,
9,
38,
396,
38,
60,
98,
1852,
1389,
20,
14,
1797,
60,
13,
1409,
915,
16877,
9,
38,
396,
38,
1409,
1,
5145,
1,
1396,
165,
15,
16488,
135... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Halt storage access?
===
I am trying to construct a way to keep certain hard drive partitions/usb drives from being accessed for security reasons (protecting intellectual property). I was thinking that when windows attempts to access the "locked down drive/usb" the attempted is halted and returns something like "drive inaccessible" or something. It's just an idea, anyone thing it is plausible/possible? If so, any pointers?
C/C++
-Thanks | 0 | [
2,
7278,
4326,
1381,
60,
800,
3726,
3726,
31,
589,
749,
20,
6960,
21,
161,
20,
643,
1200,
552,
1493,
10711,
18,
118,
267,
220,
10396,
37,
142,
12904,
26,
1221,
2932,
13,
5,
16265,
68,
5751,
1354,
6,
9,
31,
23,
1440,
30,
76,
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... |
How does traceroute work?
===
It seems almost magical. What is the traceroute command doing in order to map out the entire path to some other node on the Internet? | 2 | [
2,
184,
630,
5565,
20179,
170,
60,
800,
3726,
3726,
32,
2206,
557,
8090,
9,
98,
25,
14,
5565,
20179,
1202,
845,
19,
389,
20,
2942,
70,
14,
1078,
2013,
20,
109,
89,
15421,
27,
14,
2620,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Maven archetype to generate simple project including site
===
Is there a Maven archetype that will generate the same scaffolding as maven-archetype-quickstart, but will in addition create the basic project site layout generated by maven-archetype-site? Or do I always have to run each in sequence? | 0 | [
2,
1216,
3124,
13,
21943,
4474,
20,
7920,
1935,
669,
215,
689,
800,
3726,
3726,
25,
80,
21,
1216,
3124,
13,
21943,
4474,
30,
129,
7920,
14,
205,
27322,
68,
28,
1216,
3124,
8,
21943,
4474,
8,
25865,
13680,
15,
47,
129,
19,
848,
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... |
Is there any performance hit involved in choosing gzip over deflate for http compression?
===
We recently switched some of our sites from deflate to gzip and noticed a significant increase in cpu load on our servers. | 0 | [
2,
25,
80,
186,
956,
770,
1013,
19,
10883,
489,
2553,
306,
84,
6312,
6554,
26,
7775,
14864,
60,
800,
3726,
3726,
95,
1989,
6667,
109,
16,
318,
3259,
37,
6312,
6554,
20,
489,
2553,
306,
17,
2711,
21,
1505,
1839,
19,
17578,
6305,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Wanted: good overview of .NET technologies
===
I'm looking for a good overview of all the .NET Framework assemblies and their namespaces and how they (are supposed to) work together.
The MSDN [.NET Framework Reference][1] has a seemingly complete list of all [.NET Framework Class Libraries][2]. Of course---being the MSDN after all---this list is best rated "sufficient", describing each namespace with a sentence or two.
Can you recommend a resource (book or website) to gain a broad understanding of the various bits that make up the .NET Framework?
[1]: http://msdn.microsoft.com/en-us/library/w0x726c2.aspx
[2]: http://msdn.microsoft.com/en-us/library/ms229335.aspx | 0 | [
2,
417,
45,
254,
21598,
16,
13,
9,
2328,
5740,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
21598,
16,
65,
14,
13,
9,
2328,
6596,
21066,
17,
66,
204,
5582,
18,
17,
184,
59,
13,
5,
1509,
2293,
20,
6,
170,
429,
9,
14,
4235... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can I find plug-ins for Resharper?
===
does anyone know of a good place to find plugins for Resharper? Preferably somewhere more structured than Google... Thanks! | 0 | [
2,
113,
92,
31,
477,
10922,
8,
108,
18,
26,
302,
23646,
106,
60,
800,
3726,
3726,
630,
1276,
143,
16,
21,
254,
209,
20,
477,
10922,
108,
18,
26,
302,
23646,
106,
60,
6369,
4801,
3493,
91,
17784,
119,
8144,
9,
9,
9,
3669,
187,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Unable to save Entity Framework Inherited types.
===
I have implemented some table-per-type inheritance in my data model (basically have a "BaseEntity" type with all the base information for my items and a "Employer" type that inherits from the "BaseEntity" item). Everything appears to be set up correctly and when using the Entities (either via ADO.net Data Services or via Linq to Entities) I can see the Employer type and things appear to be fine. The issue starts when I create a new Employer entity and attempt to save it.
On the context that doesn't appear to be an .AddToEmployer item (only and AddObject or AddToBaseEntity).
If I use AddObject("Employer", NewEmployer) I get and error message of:
"The EntitySet name 'DataEntities.Employer' could not be found."
If I use AddToBaseEntity(NewEmployer) I get an error message of:
"Unable to determine a valid ordering for dependent operations. Dependencies may exist due to foreign key constraints, model requirements orstore generated values."
Have I missed a step in setting up the inheritance? Is there some specific way to save objects that are inherited? What am I doing wrong? I assume that the basic issue is that I should have an AddToEmployer, what do I need to do to get that exposed. It seems odd that it is not an option since I can see the Employer type on the client side and can do things such as "var NewEmployer = new Employer()" - which seems to suggest that I can see the Employer type fine. | 0 | [
2,
2343,
20,
2079,
9252,
6596,
7179,
2551,
9,
800,
3726,
3726,
31,
57,
6807,
109,
859,
8,
1432,
8,
4474,
13852,
19,
51,
1054,
1061,
13,
5,
6093,
8438,
57,
21,
13,
7,
8436,
2291,
856,
7,
1001,
29,
65,
14,
1000,
676,
26,
51,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the data type for length property for Java arrays?
===
I want to find out if length property for Java arrays is an int/long or something else. | 0 | [
2,
98,
25,
14,
1054,
1001,
26,
1476,
1354,
26,
8247,
7718,
18,
60,
800,
3726,
3726,
31,
259,
20,
477,
70,
100,
1476,
1354,
26,
8247,
7718,
18,
25,
40,
19,
38,
118,
2701,
54,
301,
962,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
WPF Databinding and cascading Converters?
===
i wonder if it is possible to cascade converters when using wpf databinding.
e.g. something like
<SomeControl Visibility="{Binding Path=SomeProperty, Converter={StaticResource firstConverter}, Converter={StaticResource secondConverter}}"/>
is it possible at all or do i have to create a custom converter that combines the functionality of converter A and B? | 0 | [
2,
619,
7721,
1054,
22260,
17,
7167,
13489,
68,
25893,
18,
60,
800,
3726,
3726,
31,
2666,
100,
32,
25,
938,
20,
13542,
25893,
18,
76,
568,
619,
7721,
1054,
22260,
9,
13,
62,
9,
263,
9,
301,
101,
13,
1,
3220,
12898,
19476,
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... |
Calling As function from js problem
===
I have a swf file that is not controlled by me. The swf expects a javascript call to set some variables after initialization.
The swf is embedded using the swfobject and I'm trying to call the as function right after the embed. This appears to be too soon because I get an error. Everything else should be fine since calling the as function manually via firebug does not produce the error.
So the question is how do I call the function when the embed is complete? | 0 | [
2,
2555,
28,
1990,
37,
487,
18,
1448,
800,
3726,
3726,
31,
57,
21,
13,
18,
15263,
3893,
30,
25,
52,
3959,
34,
55,
9,
14,
13,
18,
15263,
4186,
18,
21,
8247,
8741,
645,
20,
309,
109,
12157,
75,
2104,
1829,
9,
14,
13,
18,
15263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 stay up-to-date with all the software (local and web-based)
===
How do you stay up-to-date when it comes to new software versions? Above all, I mean minor updates (new version for your Joomla-Installation, forum-software, FTP-Client, ...).
Versiontracker, RSS-Feeds, Newsletter... what else? Anyone wrote a script crawling websites for new versions or something similar? | 0 | [
2,
184,
20,
1179,
71,
8,
262,
8,
8209,
29,
65,
14,
2306,
13,
5,
15580,
17,
2741,
8,
1281,
6,
800,
3726,
3726,
184,
107,
42,
1179,
71,
8,
262,
8,
8209,
76,
32,
1624,
20,
78,
2306,
3281,
60,
784,
65,
15,
31,
884,
1689,
16779... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
access to SQL copy
===
We have an access DB which has a set of local tables and input forums etc. in which a user maintains there data
We also have a SQL DB with the same tables which is used to displays the data in a web search form
What is the best way to allow the user to push his changes to the SQL db?
| 0 | [
2,
1381,
20,
4444,
255,
4344,
800,
3726,
3726,
95,
57,
40,
1381,
13,
9007,
56,
63,
21,
309,
16,
375,
7484,
17,
6367,
5691,
18,
2722,
9,
19,
56,
21,
4155,
9767,
80,
1054,
95,
67,
57,
21,
4444,
255,
13,
9007,
29,
14,
205,
7484... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Working with large numbers in PHP.
===
To use [modular exponentiation](http://en.wikipedia.org/wiki/Modular_exponentiation) as you would require when using the [Fermat Primality Test](http://en.wikipedia.org/wiki/Fermat_primality_test) with large numbers (100,000+), it calls for some very large calculations.
When I multiply two large numbers (eg: 62574 and 62574) PHP seems to cast the result to a float. Getting the modulus value of that returns strange values.
$x = 62574 * 62574;
var_dump($x); // float(3915505476) ... correct
var_dump($x % 104659); // int(-72945) ... wtf.
Is there any way to make PHP perform these calculations properly? Alternatively, is there another method for finding modulus values that would work for large numbers?
| 0 | [
2,
638,
29,
370,
2116,
19,
13,
26120,
9,
800,
3726,
3726,
20,
275,
636,
19673,
512,
25220,
49,
857,
500,
5,
21127,
6903,
219,
9,
17375,
26132,
9,
5583,
118,
17375,
118,
19673,
512,
1,
6899,
218,
16001,
857,
6,
28,
42,
83,
4077,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do TDD in a non-trivial application?
===
I've read a number of books and websites on the subject of TDD, and they all make a lot of sense, especially Kent Beck's book. However, when I try to do TDD myself, i find myself staring at the keyboard wondering how to begin. Is there a process you use? What is your thought process? How do you identify your first tests?
The majority of the books on the subject do a great job of describing what TDD is, but not how to *practice* TDD in real world non-trivial applications. How do you do TDD? | 0 | [
2,
184,
107,
42,
107,
15596,
43,
19,
21,
538,
8,
19712,
3010,
60,
800,
3726,
3726,
31,
22,
195,
1302,
21,
234,
16,
964,
17,
13931,
27,
14,
1550,
16,
15596,
43,
15,
17,
59,
65,
233,
21,
865,
16,
1259,
15,
1118,
4422,
6846,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get the computer name of the client filling an web-based Infopath form?
===
I have an Infopath 2007 form hosted on MOSS 2007. The code behind the form is written in C#. In this context, `System.Environment.MachineName` return the server name.
How can I get the computer name of the client filling this form? | 0 | [
2,
184,
92,
31,
164,
14,
1428,
204,
16,
14,
6819,
7702,
40,
2741,
8,
1281,
15404,
8353,
505,
60,
800,
3726,
3726,
31,
57,
40,
15404,
8353,
624,
505,
2812,
27,
8188,
624,
9,
14,
1797,
439,
14,
505,
25,
642,
19,
272,
5910,
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... |
How to let an ASMX file output JSON
===
I created an ASMX file with a code behind file. It's working fine, but it is outputting XML, and I want JSON. For some reason it is outputting XML. My code behind is:
[System.Web.Script.Services.ScriptService]
public class _default : System.Web.Services.WebService {
[WebMethod]
[ScriptMethod(UseHttpGet = true,ResponseFormat = ResponseFormat.Json)]
public string[] UserDetails()
{
string login = HttpContext.Current.User.Identity.Name;
SourceHelper src = new SourceHelper();
return new string[] { login, src.LoginToName(login), "1233" };
}
}
| 0 | [
2,
184,
20,
408,
40,
28,
79,
396,
3893,
5196,
487,
528,
800,
3726,
3726,
31,
679,
40,
28,
79,
396,
3893,
29,
21,
1797,
439,
3893,
9,
32,
22,
18,
638,
1123,
15,
47,
32,
25,
5196,
1203,
23504,
15,
17,
31,
259,
487,
528,
9,
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... |
Stand-alone report preview through RDC/ActiveX Crystal Reports XI
===
I'm porting an application from Crystal Reports 8 to Crystal Reports XI in Delphi 5, using the RDC/ActiveX interface.
In Crystal Reports 8, I was able to bring up the crystal reports default report viewer window for a report like so:
RptInvoicing.Destination := 0; // To: window
RptInvoicing.Action := 1; // Execute
However, this does not fly with CR XI. Printing and exporting I've figured out to work like this:
crReport.PrintOut(True);
...
crReport.Export(True);
But I haven't been able to find anything relevant to show the default preview window. I've tried implementing my own using the Report Designer Component, but it has a lot of problems like locking up when resizing, freezing and crashes, so it's not a viable solution for a production app.
Even the official support forums weren't of help, I only got a nasty answer to go look at the manuals, which I've been through several times and can only refer to as bad. It's not every day you see such bad documentation for an enterprise product. I found nothing relevant to this in their manuals, so I'm led to think their own staff have no idea about this either.
So I'm hoping someone here could tell me if the default report viewer still exists in CR XI, and if it does, how to invoke it? If it doesn't, is using the report designer component really the only solution to create one? | 0 | [
2,
1261,
8,
17979,
1330,
16121,
120,
13,
897,
150,
118,
7889,
396,
4282,
2813,
5641,
800,
3726,
3726,
31,
22,
79,
1295,
68,
40,
3010,
37,
4282,
2813,
469,
20,
4282,
2813,
5641,
19,
23030,
331,
15,
568,
14,
13,
897,
150,
118,
788... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parameter Spoofing in SQL Server
===
A while ago I had a query that I ran quite a lot for one of my users. It was still being evolved and tweaked but eventually it stablised and ran quite quickly, so we created a stored procedure from it.
So far, so normal.
The stored procedure, though, was dog slow. No material difference between the query and the proc, but the speed change was massive.
[Background, we're running SQL Server 2005.]
A friendly local DBA (who no longer works here) took one look at the stored procedure and said "parameter spoofing!"
We abstracted some of the stored procedure to a second one, wrapped the call to this new inner proc into the pre-existing outer one, called the outer one and, hey presto, it was as quick as the original query.
So, what gives? Can someone explain parameter spoofing?
Bonus credit for
- highlighting how to avoid it
- suggesting how to recognise possible cause
- discuss alternative strategies, e.g. stats, indices, keys, for mitigating the situation
| 0 | [
2,
18906,
26960,
68,
19,
4444,
255,
8128,
800,
3726,
3726,
21,
133,
1464,
31,
41,
21,
25597,
30,
31,
717,
1450,
21,
865,
26,
53,
16,
51,
3878,
9,
32,
23,
174,
142,
7339,
17,
28769,
69,
47,
878,
32,
13179,
3159,
69,
17,
717,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Orders of Magnitude: What was the lowest-level code you have worked on? The highest level?
===
Dijkstra(PBUH) once noted that a programmer can reasonably expect to have to work within a range of at least thirty orders of magnitude- from dealing with individual bits all the way up to gigabyte-sized units.
Let's test this. In your career, what was the smallest level of data manipulation you have worked on, and the largest? In which direction has your career moved: toward the bare metal, or toward inhumanly large constructs?
Extra kudos to those brave punch-card veterans of the days of <a href="http://catb.org/jargon/html/story-of-mel.html">Mel</a> who have survived and even thrived in the transition from raw binary to massive software architecture. We salute you. | 0 | [
2,
3204,
16,
10323,
45,
98,
23,
14,
6543,
8,
3906,
1797,
42,
57,
577,
27,
60,
14,
1554,
662,
60,
800,
3726,
3726,
13,
28395,
5253,
5,
13390,
6496,
6,
382,
1525,
30,
21,
17968,
92,
19531,
4186,
20,
57,
20,
170,
363,
21,
978,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 assign a custom icon to a Pushpin in Mappoint
===
I'm writing a MFC app that uses the MS Mappoint OCX. I need to display the locations of people and vehicles on the map and the best of doing this appears to be with Pushpin objects. I have no problem displaying a stock pushpin icon with some text but want to change the icon to a custom designed one. From the limited amount of Mappoint programming info out there it appears the way to do this is to create a symbol object from a symbols object then assign this to a pushpin like this ..
CSymbols symbols;
CSymbol symbol;
symbol=symbols.Add("c:/temp/myicon.ico");
pushpin.put_Symbol(symbol.get_ID());
But the program crashes with a unhandled exception on the symbols.add instruction.
Can anyone tell me what I am doing wrong here ? or am I on totally the wrong track ?
Thanks for your time
Ian
| 0 | [
2,
184,
20,
13952,
21,
5816,
9801,
20,
21,
3250,
3489,
19,
2942,
3132,
800,
3726,
3726,
31,
22,
79,
1174,
21,
307,
7061,
4865,
30,
2027,
14,
4235,
2942,
3132,
13,
2499,
396,
9,
31,
376,
20,
3042,
14,
4095,
16,
148,
17,
3128,
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... |
jquery image selector not working in IE7
===
So I have some html like so:
<div id="avatar_choices">
<label for="id_choice_0">
<input id="id_choice_0" type="radio" name="choice" value="7" />
<img src="someimage.jpg" />
</label>
<label for="id_choice_1">
<input id="id_choice_1" type="radio" name="choice" value="8" />
<img src="someimage2.jpg" />
</label>
</div>
And some script:
$('#avatar_choices input').hide();
$('#avatar_choices img').click(function(){
$('#avatar_choices img').css('border', '2px solid #efefef');
$(this).css('border', '2px solid #39c');
$(this).siblings('input').attr('checked', 'checked');
});
The goal is to allow the user to click around on the image options, having the selected one highlight with a border colour.
This works fine in FF. For some reason in IE once I click on an image, click another image, then try to click the first one, the border won't change (though it does get selected). | 0 | [
2,
487,
8190,
93,
1961,
23946,
52,
638,
19,
13,
660,
465,
800,
3726,
3726,
86,
31,
57,
109,
13,
15895,
101,
86,
45,
13,
1,
12916,
4924,
3726,
7,
4961,
3958,
1,
23714,
18,
7,
1,
13,
1,
21018,
26,
3726,
7,
1340,
1,
23714,
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... |
function overloading fail: why did these operators clash?
===
I've got a big big code base that includes two main namespaces: the engine and the application.
The engine defines a vector3 class as a typedef of another vector3 class, with equality operators that sit in the engine namespace, not in the vector3 class. I added a class to the application that also had equality operators in the application namespace.
When I tried to compile, unrelated but near-by vector3 comparisons failed because it couldn't find an appropriate equality operator. I suspected I was causing a conflict so moved my equality operators into the class I added, and the compile succeeded.
// engine.h
namespace Engine
{
class Vector3Impl { ... };
typedef Vector3Impl Vector3;
bool operator==(Vector3 const &lhs, Vector3 const &rhs) { ... }
}
// myfile.cpp
#include "engine.h"
namespace application
{
class MyClass { ... };
bool operator==(MyClass const &lhs, MyClass const &rhs) { ... }
void myFunc(...)
{
if ( myClassA == myClassB ) { ... } // builds
}
void anotherFunc(...)
{
Engine::Vector3 a, b;
...
if ( a == b ) { ... } // fails
}
}
However after thinking about it I can't see why the compile failed. There are no implicit conversions from vector3s to my class or vice-versa, and argument-dependent look-up should be pulling in the equality operator from the engine namespace and matching it.
I've tried reproducing this bug in a sample C++ project but that refuses to break. There must be something in the big big code base that is causing this problem, but I'm not sure where to start looking. Something like the opposite of a rogue "using Engine"? Anyone got any ideas?
| 0 | [
2,
1990,
84,
16866,
7476,
45,
483,
144,
158,
9475,
13870,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
580,
580,
1797,
1000,
30,
1103,
81,
407,
204,
5582,
18,
45,
14,
1406,
17,
14,
3010,
9,
14,
1406,
13110,
21,
7497,
240,
718,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hidden features of Bash
===
Shell scripts are often used as glue, for automation and simple one-off tasks. What are some of your favorite "hidden" features of the Bash shell/scripting language?
- One feature per answer
- Give an example and short description of the feature, not just a link to documentation
- Label the feature using bold title as the first line
See also:
- [Hidden features of C][1]
- [Hidden features of C#][2]
- [Hidden features of C++][3]
- [Hidden features of Python][10]
- [Hidden features of Java][4]
- [Hidden features of JavaScript][5]
- [Hidden features of Ruby][6]
- [Hidden features of PHP][7]
- [Hidden features of Perl][8]
- [Hidden features of VB.Net][9]
[1]: http://stackoverflow.com/questions/132241/hidden-features-of-c
[2]: http://stackoverflow.com/questions/9033/hidden-features-of-c
[3]: http://stackoverflow.com/questions/75538/hidden-features-of-c
[4]: http://stackoverflow.com/questions/15496/hidden-features-of-java
[5]: http://stackoverflow.com/questions/61088/hidden-features-of-javascript
[6]: http://stackoverflow.com/questions/63998/hidden-features-of-ruby
[7]: http://stackoverflow.com/questions/61401/hidden-features-of-php
[8]: http://stackoverflow.com/questions/161872/hidden-features-of-perl
[9]: http://stackoverflow.com/questions/102084/hidden-features-of-vbnet
[10]: http://stackoverflow.com/questions/101268/hidden-features-of-python
| 0 | [
2,
3689,
967,
16,
13158,
800,
3726,
3726,
3593,
17505,
50,
478,
147,
28,
26627,
15,
26,
23217,
17,
1935,
53,
8,
1299,
8674,
9,
98,
50,
109,
16,
154,
3839,
13,
7,
1822,
43,
817,
7,
967,
16,
14,
13158,
3593,
118,
8741,
68,
816,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Updating Access 2003 to 2007, potential issues?
===
I've written an Access 2003 application to handle internal things at my company over the past couple years and we are talking about upgrading all of our computers to Office 2007 which means Access will be updated. Is this going to cause a problem for me? | 0 | [
2,
71,
43,
1880,
1381,
973,
20,
624,
15,
2222,
1549,
60,
800,
3726,
3726,
31,
22,
195,
642,
40,
1381,
973,
3010,
20,
3053,
3117,
564,
35,
51,
237,
84,
14,
640,
1335,
122,
17,
95,
50,
1582,
88,
26939,
65,
16,
318,
7774,
20,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which method of 'clearfix' is best?
===
I have the age old problem of a div wrapping a 2 column layout. My sidebar is floated so my container div fails to wrap the content & sidebar.
<div id="container">
<div id="content">
</div>
<div id="sidebar">
</div>
</div>
There seem to be numerous methods of fixing the clear bug in FF:
<br clear="all"/>
overflow:auto
overflow:hidden
etc.
But in my situation, the only one that seems to work correctly is the `<br clear="all"/>` solution, which is a little bit scruffy. `overflow:auto` gives me nasty scrollbars, and `overflow:hidden` must surely have side effects.
Also, apparently IE7 is supposed to not suffer from this problem due to its incorrect behaviour, but again, in my situation its suffering the same as FF.
Whats the most reliable/best practice method currently available to us? | 0 | [
2,
56,
2109,
16,
13,
22,
18600,
18594,
22,
25,
246,
60,
800,
3726,
3726,
31,
57,
14,
348,
315,
1448,
16,
21,
13,
12916,
13437,
21,
172,
4698,
9106,
9,
51,
270,
1850,
25,
15400,
86,
51,
12147,
13,
12916,
13614,
20,
8118,
14,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open Source C++ Data Visualization Library
===
We want to include data visualization in our desktop GUI (mostly timelines and graphs; clickable, draggable). We want to restrict to open-source, non-copyleft C++ libraries that allow commercial use and are portable across many platforms. Which library can I use?
| 0 | [
2,
368,
1267,
272,
20512,
1054,
28873,
1248,
800,
3726,
3726,
95,
259,
20,
468,
1054,
28873,
19,
318,
17404,
9457,
13,
5,
18397,
18398,
18,
17,
7210,
18,
73,
10840,
579,
15,
5501,
263,
579,
6,
9,
95,
259,
20,
15436,
20,
368,
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... |
WCF over MSMQ problem
===
I have been tasked to implement a WCF service that makes use of NetMsmqBinding. I wrote the service and it works fine. The problem is that in the last minute they told me that there will be no Active Directory integration. So I don't know how to configure the security of the service. There is a VPN tunnel between the service's and the client's machines but they do not use the same active directory. Please advice. Any kind of help or tutorials would be appreciated. | 0 | [
2,
11801,
410,
84,
4235,
79,
1251,
1448,
800,
3726,
3726,
31,
57,
74,
14605,
20,
8713,
21,
11801,
410,
365,
30,
1364,
275,
16,
4275,
79,
18,
79,
1251,
22260,
9,
31,
738,
14,
365,
17,
32,
693,
1123,
9,
14,
1448,
25,
30,
19,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When to use custom html tags?
===
What is the use case for using your own html tags? (In standard off the shelf browsers)
A colleague and myself were discussing it lately. I could not think of a use case. We discussed it could be used for styling with css but then decided to use the span tag with a class instead.
Thanks
Paul | 4 | [
2,
76,
20,
275,
5816,
13,
15895,
3383,
18,
60,
800,
3726,
3726,
98,
25,
14,
275,
610,
26,
568,
154,
258,
13,
15895,
3383,
18,
60,
13,
5,
108,
1236,
168,
14,
12424,
16495,
18,
6,
21,
12321,
17,
992,
46,
10988,
32,
10434,
9,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Update more than one row atomically
===
I need to execute a select and then update some of the rows in the ResultSet in an atomic way.
The code I am using looks like (simplified):
stmt = con.createStatement(ResultSet.TYPE_SCROLL_SENSITIVE, ResultSet.CONCUR_UPDATABLE);
rs = stmt.executeQuery("SELECT ...");
while (rs.next()) {
if (conditions_to_update) {
rs.updateString(...);
rs.updateRow();
}
}
Can I guarantee that the updates are going to be executed atomically ? If not, how could I assure that ? | 0 | [
2,
11100,
91,
119,
53,
3131,
9692,
1326,
800,
3726,
3726,
31,
376,
20,
15644,
21,
5407,
17,
94,
11100,
109,
16,
14,
11295,
19,
14,
1736,
1198,
19,
40,
9692,
161,
9,
14,
1797,
31,
589,
568,
1879,
101,
13,
5,
11268,
6,
45,
354,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP Array Help
===
I have an array which is a list of domains, I want to print all of the items in the array except the one which contains $x. $x is variable so basically it never prints the array item when it contains $x. Can anyone help me? :) | 0 | [
2,
13,
26120,
7718,
448,
800,
3726,
3726,
31,
57,
40,
7718,
56,
25,
21,
968,
16,
15544,
15,
31,
259,
20,
4793,
65,
16,
14,
3755,
19,
14,
7718,
1613,
14,
53,
56,
1588,
5579,
396,
9,
5579,
396,
25,
7612,
86,
11374,
32,
243,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 virtual servers for hosting SQL Servers
===
We develop websites using SQL Server and ASP.NET.
Development: web
1. on developer PC, database on DEV server
2. Testing: both on TEST server
3. Live: both on LIVE server
At the moment, DEV and TEST servers are separate physical servers. **I'm considering making them virtual servers on the same physical server**s.
It is important that is easy to deploy web and database changes from DEV to TEST to LIVE etc (we use Red Gate SQL Compare to sync the database changes to the next SQL Server).
Before I go ahead, I would like to know:
- Has anyone done this? Does it work well
- Any advice implementing it would be welcome. Are there any good resources out there.
- Also, what software would you recommend for this -- Virtual server or VMWare.
- Any best practices that I should know | 0 | [
2,
568,
6599,
17595,
26,
10637,
4444,
255,
17595,
800,
3726,
3726,
95,
2803,
13931,
568,
4444,
255,
8128,
17,
28,
306,
9,
2328,
9,
522,
45,
2741,
137,
9,
27,
10058,
5168,
15,
6018,
27,
9664,
8128,
172,
9,
4431,
45,
156,
27,
1289... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I use Nutch 0.9 and Solr 1.3?
===
I'm building a web search site and we're currently using Apache Nutch 0.9 with Lucene 2.1.
What version of Apache Solr am I able to use?
Is the Nutch-0.9dev stable enough to use and will it work with Apache Solr 1.3? | 0 | [
2,
92,
31,
275,
8619,
673,
713,
9,
518,
17,
7176,
139,
137,
9,
240,
60,
800,
3726,
3726,
31,
22,
79,
353,
21,
2741,
2122,
689,
17,
95,
22,
99,
871,
568,
17140,
8619,
673,
713,
9,
518,
29,
18515,
556,
172,
9,
165,
9,
98,
61... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Nullable GUID
===
In my database, in one of the table I have a GUID column with allow nulls. I have a method with a Guid? parameter that inserts a new data row in the table. However when I say myNewRow.myGuidColumn = myGuid I get the following error: "Cannot implicitly convert type 'System.Guid?' to 'System.Guid'."
| 0 | [
2,
16203,
579,
9457,
43,
800,
3726,
3726,
19,
51,
6018,
15,
19,
53,
16,
14,
859,
31,
57,
21,
9457,
43,
4698,
29,
1655,
16203,
18,
9,
31,
57,
21,
2109,
29,
21,
9457,
43,
60,
18906,
30,
14692,
18,
21,
78,
1054,
3131,
19,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does COM registration work in Windows
===
I'm an application packager trying to make sense of how the COM registry keys (SelfReg) interrelate to the given .dll in Windows.
ProgID's, AppID's, TypeLibs, Extensions & Verbs are all tied around the CLSID right?
Do CLSID's always use Prog/App IDs or could you just have a file extension class?
Which bits are optional?
Some of it seems to be 'like a router' where there's the two interfaces (internal - .dll) and external (the extension etc).
How does this all fit? (The SDK documentation doesn't make sense to me)
I ask as this is all pivotal to application 'healing' with Windows Installer (which packagers are all 'big' on, but there's no nitty-gritty breakdowns since its a coder-thing really) | 0 | [
2,
184,
630,
13,
960,
8587,
170,
19,
1936,
800,
3726,
3726,
31,
22,
79,
40,
3010,
6030,
139,
749,
20,
233,
1259,
16,
184,
14,
13,
960,
18269,
5534,
13,
5,
8411,
12463,
6,
1480,
99,
6554,
20,
14,
504,
13,
9,
43,
211,
19,
1936... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ICollection, readonly collections, and synchronisation. Is this right?
===
I have a custom class that implements `ICollection`, and this class is readonly, ie. `IsReadOnly` returns true (as opposed to using the `readonly` keyword), and all functions that would normally modify the data in the collection throw `InvalidOperationException`'s.
Now, given such a construct, and a quick skim over the thread-safety issues when implementing `ICollection` (specifically [`ICollection.IsSynchronized`](http://msdn.microsoft.com/en-us/library/system.collections.icollection.issynchronized.aspx) and friends), I came up with this quick and dirty solution.
bool ICollection.IsSynchronised { get{ return true; } }
object ICollection.SyncRoot { get{ return new Object(); } }
Now, given the examples in MSDN, this won't cause different threads to lock properly, because they are getting different objects from `SyncRoot`. Given that this is a readonly collection though, is this an issue? Are there memory/GC issues with returning `new Object()`? Any other issues you can see with this implementation? | 0 | [
2,
31,
15015,
872,
15,
1302,
4965,
5721,
15,
17,
13,
16023,
4330,
9,
25,
48,
193,
60,
800,
3726,
3726,
31,
57,
21,
5816,
718,
30,
8713,
18,
13,
1,
49,
15015,
872,
1,
15,
17,
48,
718,
25,
1302,
4965,
15,
13,
660,
9,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how do I add a test web service to my project in Visual Studio?
===
I have a test web service replicating a live web service that hasn't been made public yet (It will be public when the app is released).
I added a new ASP.NET Web Service Application to my solution. Now when I try and add a web reference from the main project and choose "Browse To Web services in this solution" it doesn't find the test web service.
Am I missing an important step here? | 0 | [
2,
184,
107,
31,
3547,
21,
1289,
2741,
365,
20,
51,
669,
19,
3458,
1120,
60,
800,
3726,
3726,
31,
57,
21,
1289,
2741,
365,
13426,
1203,
21,
515,
2741,
365,
30,
9979,
22,
38,
74,
117,
317,
768,
13,
5,
242,
129,
44,
317,
76,
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... |
Lightweight messaging (async invocations) in Java
===
I am looking for lightweight messaging framework in Java. My task is to process events in a SEDA’s manner: I know that some stages of the processing could be completed quickly, and others not, and would like to decouple these stages of processing.
Let’s say I have components A and B and processing engine (be this container or whatever else) invokes component A, which in turn invokes component B. I do not care if execution time of component B will be 2s, but I do care if execution time of component A is below 50ms, for example. Therefore, it seems most reasonable for component A to submit a message to B, which B will process at the desired time.
I am aware of different JMS implementations and Apache ActiveMQ: they are too heavyweight for this. I searched for some lightweight messaging (with really basic features like messages serialization and simplest routing) to no avail.
Do you have anything to recommend in this issue? | 0 | [
2,
13613,
26437,
13,
5,
58,
9507,
150,
19,
2625,
16893,
18,
6,
19,
8247,
800,
3726,
3726,
31,
589,
699,
26,
13613,
26437,
6596,
19,
8247,
9,
51,
3005,
25,
20,
953,
963,
19,
21,
13,
18,
11980,
1,
18,
3832,
45,
31,
143,
30,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
arguments to cryptographic functions
===
I'm a bit confused that the argument to crypto functions is a string. Should I simply wrap non-string arguments with str() e.g.
hashlib.sha256(str(user_id)+str(expiry_time))
hmac.new(str(random.randbits(256)))
(ignore for the moment that random.randbits() might not be cryptographically good). | 0 | [
2,
10553,
20,
16277,
12084,
3719,
800,
3726,
3726,
31,
22,
79,
21,
1142,
4230,
30,
14,
5476,
20,
16277,
3719,
25,
21,
3724,
9,
378,
31,
1659,
8118,
538,
8,
11130,
10553,
29,
13,
9729,
5,
6,
13,
62,
9,
263,
9,
19170,
8326,
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... |
How do I capture the audio that is being played?
===
Does anyone know how to programmatically capture the sound that is being played (that is, everything that is coming from the sound card, not the input devices such as a microphone). | 0 | [
2,
184,
107,
31,
3683,
14,
4023,
30,
25,
142,
257,
60,
800,
3726,
3726,
630,
1276,
143,
184,
20,
625,
6732,
1326,
3683,
14,
646,
30,
25,
142,
257,
13,
5,
887,
25,
15,
796,
30,
25,
880,
37,
14,
646,
2056,
15,
52,
14,
6367,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to add a JUnit 4 test that doesn't extend from TestCase to a TestSuite?
===
In JUnit 3 I simply called
suite.addTestSuite( MyTest.class )
However if MyTest is a JUnit 4 test which does not extend TestCase this doesn't work. What should I do instead to create a suite of tests? | 0 | [
2,
184,
20,
3547,
21,
7446,
242,
268,
1289,
30,
1437,
22,
38,
7206,
37,
1289,
10325,
20,
21,
1289,
12352,
62,
60,
800,
3726,
3726,
19,
7446,
242,
203,
31,
1659,
227,
6160,
9,
14854,
10543,
12352,
62,
5,
51,
10543,
9,
1898,
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... |
TFS Sprint Item Print Plug-in
===
Does anyone know if there is a plug-in for TFS that will print out our sprint backlog items in a format suitable for using on a Scrum Board, rather than us having to write them out by hand? | 0 | [
2,
13,
11720,
18,
6672,
9101,
4793,
10922,
8,
108,
800,
3726,
3726,
630,
1276,
143,
100,
80,
25,
21,
10922,
8,
108,
26,
13,
11720,
18,
30,
129,
4793,
70,
318,
6672,
97,
5567,
3755,
19,
21,
2595,
6445,
26,
568,
27,
21,
26562,
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,
0,
0,
0,
0,
0... |
ASP.NET MVC Beta 1 - where is Html.RenderPartial?
===
I'm just in the process of upgrading my Preview 5 application to Beta 1, and I'm nearly there save for this one error when trying to render a control:
> 'System.Web.Mvc.HtmlHelper' does not
> contain a definition for
> 'RenderPartial' and no extension
> method 'RenderPartial' accepting a
> first argument of type
> 'System.Web.Mvc.HtmlHelper' could be
> found (are you missing a using
> directive or an assembly reference?)
My markup (in the .aspx View Content Page) is:
<% Html.RenderPartial("Controls/UserForm", ViewData); %>
I've tried using Microsoft.Web.Mvc but to no avail. Does anyone know where Html.RenderPartial has gone, or what alternative I could use? | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
8434,
137,
13,
8,
113,
25,
13,
15895,
9,
99,
16706,
3091,
2815,
60,
800,
3726,
3726,
31,
22,
79,
114,
19,
14,
953,
16,
26939,
51,
16121,
331,
3010,
20,
8434,
137,
15,
17,
31,
22,
79,
1212,
80,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Service & Request queueing
===
Is using a handrolled POCO queue class using pseudo code
<code>
T Dequeue()
{
lock(syncRoot)
{
if(queue.Empty) Thread.Wait();
}
}
void Enqueue(T item)
{
queue.Enqueue(item);
Thread.Notify();
}
</code>
for WCF request queueing a scalable approach? | 0 | [
2,
11801,
410,
365,
279,
3772,
22521,
68,
800,
3726,
3726,
25,
568,
21,
224,
8694,
69,
2353,
716,
22521,
718,
568,
8452,
1797,
13,
1,
9375,
1,
13,
38,
121,
2005,
4185,
5,
6,
13,
1,
3991,
5,
9507,
150,
14032,
6,
13,
1,
100,
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... |
Is there a .NET equalent to SQL Servers newsequentialid()
===
We use Guid's for primary key, which you know is clustered by default.
When inserting a new row into a table it is inserted at a random page in the table (because Guid's are random). This has a measurable performance impact because the DB will split data pages all the time (fragmentation). But the main reason I what a sequential Guid is because I want new rows to be inserted as the last row in the table... which will help when debugging.
I could make a clustered index on CreateDate, but our DB is auto generated and in development, we need to do something extra to facilitate this. Also CreateDate is not a good candidate for a clustered index.
Back in the day I used [Jimmy Nielsons COMB's][1], but I was wondering if there is something in the .NET framework for this. In SQL 2005 Microsoft introduced newsequentialid() as an alternative to newid(), so I was hoping that they made a .NET equivalent, because we generate the ID in the code.
PS: Please don't start discussing if this is right or wrong, because GUID's should be unique etc.
[1]: http://www.informit.com/articles/article.aspx?p=25862 | 0 | [
2,
25,
80,
21,
13,
9,
2328,
2747,
2291,
20,
4444,
255,
17595,
996,
62,
5495,
10107,
1340,
5,
6,
800,
3726,
3726,
95,
275,
9457,
43,
22,
18,
26,
1256,
1246,
15,
56,
42,
143,
25,
7460,
69,
34,
12838,
9,
76,
14692,
68,
21,
78,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse, where to change the current debug line background?
===
Can anyone point me to the preferences page that has the setting of the **DEBUG** current line background color? I have changed almost all the colours to dark ones and still get annoyed by this almost white current line indicator while debugging (note that the current line indication in editing mode is OK). | 0 | [
2,
11652,
15,
113,
20,
753,
14,
866,
121,
16254,
293,
2395,
60,
800,
3726,
3726,
92,
1276,
454,
55,
20,
14,
9808,
18,
2478,
30,
63,
14,
2697,
16,
14,
13,
1409,
546,
16254,
1409,
866,
293,
2395,
1665,
60,
31,
57,
1015,
557,
65,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SQLite in a Python program
===
I have created a Python module that creates and populates several SQLite tables. Now, I want to use it in a program but I don't really know how to call it properly. All the tutorials I've found are essentially "inline", i.e. they walk through using SQLite in a linear fashion rather than how to actually use it in production.
What I'm trying to do is have a method check to see if the database is already created. If so, then I can use it. If not, an exception is raised and the program will create the database. (Or use if/else statements, whichever is better).
I created a test script to see if my logic is correct but it's not working. When I create the try statement, it just creates a new database rather than checking if one already exists. The next time I run the script, I get an error that the table already exists, even if I tried catching the exception. (I haven't used try/except before but figured this is a good time to learn).
Are there any good tutorials for using SQLite operationally or any suggestions on how to code this? I've looked through the pysqlite tutorial and others I found but they don't address this. | 0 | [
2,
568,
4444,
10601,
19,
21,
20059,
625,
800,
3726,
3726,
31,
57,
679,
21,
20059,
12613,
30,
9695,
17,
1675,
12383,
18,
238,
4444,
10601,
7484,
9,
130,
15,
31,
259,
20,
275,
32,
19,
21,
625,
47,
31,
221,
22,
38,
510,
143,
184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to change the properties of a WebReferance in run-time?
===
I am trying to come up with such a solution that the user is going to enter the URL of a web-service and it is going to be tested.
Althogh what I want is a URL change, I guarantee the Service Description is always going to be the same (except the wsdl:service tag of course which contains the soap:address); I just want to test different customers, running the same service. | 0 | [
2,
25,
32,
938,
20,
753,
14,
3704,
16,
21,
2741,
99,
2407,
2416,
19,
485,
8,
891,
60,
800,
3726,
3726,
31,
589,
749,
20,
340,
71,
29,
145,
21,
4295,
30,
14,
4155,
25,
228,
20,
2830,
14,
287,
6362,
16,
21,
2741,
8,
11449,
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... |
Suppressing Popups in Windows
===
Is there an easy way to tell Windows not to display popups on a headless server machine?
Currently occasional application popups are causing my app to freeze because no one is available to press 'Okay' on the console. Just logging to the eventlog would be more than sufficient. | 0 | [
2,
12451,
68,
1675,
15699,
19,
1936,
800,
3726,
3726,
25,
80,
40,
2010,
161,
20,
494,
1936,
52,
20,
3042,
1675,
15699,
27,
21,
157,
923,
8128,
1940,
60,
871,
7713,
3010,
1675,
15699,
50,
3242,
51,
4865,
20,
11551,
185,
90,
53,
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... |
Why global.asax Application_Error method does not catch exceptions thrown by ASMX service?
===
And how to fix it. I'd like to log every thrown exception for maintenance purpose. | 0 | [
2,
483,
2062,
9,
8588,
396,
3010,
1,
29992,
2109,
630,
52,
2949,
13392,
6027,
34,
28,
79,
396,
365,
60,
800,
3726,
3726,
17,
184,
20,
6098,
32,
9,
31,
22,
43,
101,
20,
6738,
352,
6027,
5391,
26,
5010,
2131,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
stristr(): Can you make this code faster?
===
Here is the current implementation I am using for case insensitive substring search in C/C++:
<pre><code>/* Return the offset of one string within another.
Copyright (C) 1994,1996,1997,1998,1999,2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
/*
* My personal strstr() implementation that beats most other algorithms.
* Until someone tells me otherwise, I assume that this is the
* fastest implementation of strstr() in C.
* I deliberately chose not to comment it. You should have at least
* as much fun trying to understand it, as I had to write it :-).
*
* Stephen R. van den Berg, berg@pool.informatik.rwth-aachen.de */
/*
* Modified to use table lookup instead of tolower(), since tolower() isn't
* worth s*** on Windows.
*
* -- Anders Sandvig (anders@wincue.org)
*/
#if HAVE_CONFIG_H
# include <config.h>
#endif
#include <ctype.h>
#include <string.h>
typedef unsigned chartype;
char char_table[256];
void init_stristr(void)
{
int i;
char string[2];
string[1] = '\0';
for (i = 0; i < 256; i++)
{
string[0] = i;
_strlwr(string);
char_table[i] = string[0];
}
}
#define my_tolower(a) ((chartype) char_table[a])
char *
my_stristr (phaystack, pneedle)
const char *phaystack;
const char *pneedle;
{
register const unsigned char *haystack, *needle;
register chartype b, c;
haystack = (const unsigned char *) phaystack;
needle = (const unsigned char *) pneedle;
b = my_tolower (*needle);
if (b != '\0')
{
haystack--; /* possible ANSI violation */
do
{
c = *++haystack;
if (c == '\0')
goto ret0;
}
while (my_tolower (c) != (int) b);
c = my_tolower (*++needle);
if (c == '\0')
goto foundneedle;
++needle;
goto jin;
for (;;)
{
register chartype a;
register const unsigned char *rhaystack, *rneedle;
do
{
a = *++haystack;
if (a == '\0')
goto ret0;
if (my_tolower (a) == (int) b)
break;
a = *++haystack;
if (a == '\0')
goto ret0;
shloop:
;
}
while (my_tolower (a) != (int) b);
jin:
a = *++haystack;
if (a == '\0')
goto ret0;
if (my_tolower (a) != (int) c)
goto shloop;
rhaystack = haystack-- + 1;
rneedle = needle;
a = my_tolower (*rneedle);
if (my_tolower (*rhaystack) == (int) a)
do
{
if (a == '\0')
goto foundneedle;
++rhaystack;
a = my_tolower (*++needle);
if (my_tolower (*rhaystack) != (int) a)
break;
if (a == '\0')
goto foundneedle;
++rhaystack;
a = my_tolower (*++needle);
}
while (my_tolower (*rhaystack) == (int) a);
needle = rneedle; /* took the register-poor approach */
if (a == '\0')
break;
}
}
foundneedle:
return (char*) haystack;
ret0:
return 0;
}</code></pre>
Can you make this code faster, or do you know of a better implementation?
<strong>Note:</strong> I noticed that the GNU C Library now has <a href="http://sources.redhat.com/cgi-bin/cvsweb.cgi/libc/string/strstr.c?rev=1.2&content-type=text/x-cvsweb-markup&cvsroot=glibc">a new implementation of <code>strstr()</code></a>, but I am not sure how easily it can be modified to be case-insensitive, or if it is in fact faster than the old one (in my case). I also noticed that <a href="http://sources.redhat.com/cgi-bin/cvsweb.cgi/libc/wcsmbs/wcsstr.c?rev=1.4&content-type=text/x-cvsweb-markup&cvsroot=glibc">the old implementation is still used for wide character strings</a>, so if anyone knows why, please share. | 0 | [
2,
20899,
9729,
5,
6,
45,
92,
42,
233,
48,
1797,
4233,
60,
800,
3726,
3726,
235,
25,
14,
866,
6123,
31,
589,
568,
26,
610,
19,
19435,
972,
11130,
2122,
19,
272,
118,
150,
20512,
45,
13,
1,
3515,
1,
9375,
1,
118,
2483,
788,
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... |
Scripting in Java
===
Me and some friends are writing a MORPG in Java, and we would like to use a scripting language to, eg. to create quests.
We have non experience with scripting in Java. We have used Python, but we are very inexperienced with it. One of us also have used java-script.
What scripting language should we use?
What scripting language should we not use? | 0 | [
2,
3884,
68,
19,
8247,
800,
3726,
3726,
55,
17,
109,
954,
50,
1174,
21,
3756,
9623,
19,
8247,
15,
17,
95,
83,
101,
20,
275,
21,
3884,
68,
816,
20,
15,
12369,
9,
20,
1600,
7769,
18,
9,
95,
57,
538,
1496,
29,
3884,
68,
19,
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... |
Is there an equivalent tool to TimeSnapper for MacOS?
===
(Same as above) Is there an equivalent tool to TimeSnapper for MacOS? | 0 | [
2,
25,
80,
40,
4602,
5607,
20,
436,
325,
8763,
26,
1572,
759,
60,
800,
3726,
3726,
13,
5,
18,
8357,
28,
784,
6,
25,
80,
40,
4602,
5607,
20,
436,
325,
8763,
26,
1572,
759,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
DataGrid Paging Problem in IE
===
I have a single templated column in a DataGrid, in an ASP.NET 2 web sites. The DataGrid is paged, with ten rows per page.
In Firefox, all is good, as nearly always, but when I view the site trough IE, I get the following exception:
>Invalid postback or callback argument. Event validation is enabled using <pages enableEventValidation="true"/> in configuration or <%@ Page EnableEventValidation="true" %> in a page.
Any ideas on what may cause this? | 0 | [
2,
1054,
16375,
19006,
68,
1448,
19,
13,
660,
800,
3726,
3726,
31,
57,
21,
345,
22894,
43,
4698,
19,
21,
1054,
16375,
15,
19,
40,
28,
306,
9,
2328,
172,
2741,
3259,
9,
14,
1054,
16375,
25,
2478,
43,
15,
29,
652,
11295,
416,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 change system default regional settings in windows XP?
===
How can I change the system-default regional settings in windows XP for use by services (run by the system user)?
Regional and Language Options in the control panel modify the settings for the logged-in user. However, services don't use the user's settings - they use the system settings. I know that they can be found in the registry here:
HKEY_USERS\.DEFAULT\Control Panel\International
My question is: What mechanism is there for changing the system-language/date/etc from en-us to en-gb? | 0 | [
2,
184,
20,
753,
329,
12838,
1254,
12410,
19,
1936,
23045,
60,
800,
3726,
3726,
184,
92,
31,
753,
14,
329,
8,
13862,
9708,
1254,
12410,
19,
1936,
23045,
26,
275,
34,
687,
13,
5,
3169,
34,
14,
329,
4155,
6,
60,
1254,
17,
816,
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... |
Safari/WebKit horizontal overrun when using display:none
===
Having a strange rendering issue with Safari:
I have a table inside a div. Inside the table <td> I have lots of div's floated left. So the normal display is all of the divs within the td stacked up to the left until they fill the width, then flow to the next line, and so forth. So something like this:
|===========================|
| |---------------------| |
| | XXX XXX XXX XXX | |
| | XXX XXX | |
| | | |
| |---------------------- |
|===========================|
That works fine in all browsers.
I want to keep the div hidden (style="display:none") until the user clicks something. That's easy enough using jQuery, I'm all set.
The problem is, only on safari, when I .show() the hidden div the width of the table overruns the page to the right. So I end up with something like this:
|===========================|
| |-------------------------------|
| | XXX XXX XXX XXX XXX XXX |
| | |
| |-------------------------------|
|===========================|
The page renders fine in FireFox and IE, does the above over-run only in WebKit based browsers (Safari, Chrome).
I haven't been able to create a simple test case that exhibits the issue. Perhaps someone here can point me in the right direction. | 0 | [
2,
25055,
118,
14113,
13703,
10095,
84,
3169,
76,
568,
3042,
45,
15746,
800,
3726,
3726,
452,
21,
2578,
15307,
1513,
29,
25055,
45,
31,
57,
21,
859,
572,
21,
13,
12916,
9,
572,
14,
859,
279,
255,
38,
73,
38,
43,
1569,
263,
38,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I execute javascript from the server when using asp:UpdatePanels?
===
I used to do the following to execute javascript from the server:
Page.ClientScript.RegisterStartupScript( ... );
And it would execute when the page loads back at the client. I am now modifing existing pages to use `UpdatePanels` and my javascript is no longer being fired.
| 0 | [
2,
184,
92,
31,
15644,
8247,
8741,
37,
14,
8128,
76,
568,
28,
306,
45,
576,
8209,
3206,
6798,
60,
800,
3726,
3726,
31,
147,
20,
107,
14,
249,
20,
15644,
8247,
8741,
37,
14,
8128,
45,
2478,
9,
150,
18513,
38,
8741,
9,
12463,
99... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a metaphor in the context of XP?
===
**'Metaphor' seems to be one of the least understood precepts of XP (Extreme Programming) although its supposed to be (one of?) the most important.**
Its diff to grasp and supposedly 'the bulb over your head when you get it'. Metaphor seems to be a front for 'programming is a mystic art'.. the others are easy to follow relatively. I've read quite a few books and then some.. but it remains hazy.
1. So how do I identify a metaphor for the System under development?
2. How do I know its a good one? What makes a good metaphor good?
3. What does it enable?
4. How do I get good at metaphor finding... or better than I am currently?
| 0 | [
2,
98,
25,
21,
18216,
19,
14,
4141,
16,
23045,
60,
800,
3726,
3726,
13,
1409,
22,
5909,
58,
11093,
22,
2206,
20,
44,
53,
16,
14,
639,
4014,
782,
13433,
18,
16,
23045,
13,
5,
27979,
3143,
6,
419,
82,
2293,
20,
44,
13,
5,
849,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Enum and property naming conflicts
===
When using a class that has an enum property, one usually gets a naming conflict between the property name and the enum type. Example:
enum Day{ Monday, Tuesday, ... }
class MyDateClass
{
private Day day;
public Day Day{ get{ return day; } }
}
Since only flags enums should have plural names, naming the enum "Days" is not the way to go for a non-flag enum. In the above example you could use some variation like "WeekDay" for either the enum or the property. But in the general case there are no good variations like that so you end up using properties like "FooMode" or "BarKind" for an object with enum properties of Foo and Bar type. Not so elegant.
How do you usually name enums and properties in this scenario? | 0 | [
2,
1957,
723,
17,
1354,
10929,
10344,
800,
3726,
3726,
76,
568,
21,
718,
30,
63,
40,
1957,
723,
1354,
15,
53,
951,
3049,
21,
10929,
2930,
128,
14,
1354,
204,
17,
14,
1957,
723,
1001,
9,
823,
45,
1957,
723,
208,
1,
5745,
15,
93... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.