unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Binding TRANSFORM query in Access to a report
===
Whats the best way to bind variable column names to a report field in Access when using a crosstab query? | 0 | [
2,
8728,
8007,
25597,
19,
1381,
20,
21,
1330,
800,
3726,
3726,
98,
18,
14,
246,
161,
20,
10193,
7612,
4698,
1817,
20,
21,
1330,
575,
19,
1381,
76,
568,
21,
919,
15783,
25597,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
databinding a property to either of two dependency properties
===
I have two custom controls that are analogous to a node and the control that draws links between nodes.
I would like to have both controls written as much in xaml as possible. The link stores both nodes as dependency properties, and I use databinding to move the line between the nodes whenever the nodes move.
It would be great to be able to change some other value of the line, for instance the stroke width, depending on the distance between the two nodes. So the property needs to update when either node moves, and I can't quite get my head around how that would work.
Anyone got any ideas? | 0 | [
2,
1054,
22260,
21,
1354,
20,
694,
16,
81,
26835,
3704,
800,
3726,
3726,
31,
57,
81,
5816,
8671,
30,
50,
21837,
20,
21,
15421,
17,
14,
569,
30,
10802,
6271,
128,
16272,
9,
31,
83,
101,
20,
57,
156,
8671,
642,
28,
212,
19,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In ASP.NET how you get the physcial file path when HttpContext.Current is NULL?
===
I'm working with DotNetNuke's scheduler to schedule tasks and I'm looking to get the physical file path of a email template that I created. The problem is that HttpContext is NULL because the scheduled task is on a different thread and there is not http request. How would you go about getting the file's physical path? | 0 | [
2,
19,
28,
306,
9,
2328,
184,
42,
164,
14,
13,
10100,
19034,
3893,
2013,
76,
7775,
1126,
11969,
9,
17657,
25,
16203,
60,
800,
3726,
3726,
31,
22,
79,
638,
29,
14123,
2328,
4215,
1048,
22,
18,
4345,
139,
20,
4345,
8674,
17,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Testing rendering of a given layout with RSpec & Rails
===
Is it possible to test the use of a given layout using RSpec with Rails, for example I'd like a matcher that does the following:
response.should use_layout('my_layout_name')
I found a use_layout matcher when Googling but it doesn't work as neither the response or controller seem to have a layout property that matcher was looking for. | 0 | [
2,
4431,
15307,
16,
21,
504,
9106,
29,
13,
1224,
12610,
279,
2240,
18,
800,
3726,
3726,
25,
32,
938,
20,
1289,
14,
275,
16,
21,
504,
9106,
568,
13,
1224,
12610,
29,
2240,
18,
15,
26,
823,
31,
22,
43,
101,
21,
730,
106,
30,
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... |
What would you like to see in an beginner's ASP.NET security book
===
*This is a shameless information gathering exercise for my own book.*
One of the talks I give in the community is an introduction to web site vulnerabilities. Usually during the talk I can see at least two members of the audience go very pale; and this is basic stuff, Cross Site Scripting, SQL Injection, Information Leakage, Cross Site Form Requests and so on.
So, if you can think back to being one, as a beginning web developer (be it ASP.NET or not) what do you feel would be useful information about web security and how to develop securely? I will already be covering the [OWASP Top Ten][1]
(And yes this means stackoverflow will be in the acknowledgements list if someone comes up with something I haven't thought of yet!)
[1]: http://www.owasp.org/index.php/OWASP_Top_Ten_Project | 0 | [
2,
98,
83,
42,
101,
20,
196,
19,
40,
26931,
22,
18,
28,
306,
9,
2328,
1221,
360,
800,
3726,
3726,
1637,
1565,
25,
21,
7912,
923,
676,
5822,
5935,
26,
51,
258,
360,
9,
2483,
53,
16,
14,
7837,
31,
590,
19,
14,
514,
25,
40,
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... |
Are writes from within a Tomcat 6 CometProcessor non-blocking
===
I have a CometProcessor implementation that is effectively doing a Multicast to a potentially large number of clients. When an event occurs that needs propagated to to all the clients, the CometProcessor will need to loop through the list of clients writing out the response. If writing responses block then there is the possibility that potentially slow clients could have an adverse effect on the distribution of the event. Example:
public class MyCometProcessor implements CometProcessor {
private List<Event> connections = new ArrayList<Event>();
public void onEvent(byte[] someInfo) {
synchronized (connections) {
for (Event e : connections) {
HttpServletResponse r = e.getHttpResponse();
// -- Does this line block while waiting for I/O --
r.getOutputStream().write(someInfo);
}
}
}
public void event(CometEvent event) {
switch (event.getEventType()) {
case READ:
synchronzied (connections) {
connections.add(event);
}
break;
// ...
}
}
} | 0 | [
2,
50,
6215,
37,
363,
21,
2067,
5782,
400,
15625,
16835,
248,
538,
8,
12048,
68,
800,
3726,
3726,
31,
57,
21,
15625,
16835,
248,
6123,
30,
25,
5463,
845,
21,
1889,
6146,
20,
21,
9465,
370,
234,
16,
7421,
9,
76,
40,
807,
3690,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.Net GridView Size Formatting
===
I have an ASP.Net GridView control that I need to remain a fixed size whether there are 0 records or *n* records in the grid. The header and the footer should remain in the same position regardless of the amount of data in the grid. Obviously, I need to implement paging for larger datasets but how would I achieve this fixed sized GridView? | 0 | [
2,
28,
306,
9,
2328,
7354,
4725,
1072,
2595,
1203,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
7354,
4725,
569,
30,
31,
376,
20,
2166,
21,
3535,
1072,
1472,
80,
50,
713,
742,
54,
1637,
103,
2483,
742,
19,
14,
7354,
9,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PostgreSQL "DESCRIBE TABLE"
===
I am trying to learn PostgreSQL after already having used MySQL and Oracle for some time now. It seems that using psql is a step backwards...
How do you perform the psql equivalent of a "DESCRIBE TABLE"? | 0 | [
2,
678,
6879,
18,
22402,
13,
7,
546,
12543,
859,
7,
800,
3726,
3726,
31,
589,
749,
20,
2484,
678,
6879,
18,
22402,
75,
614,
452,
147,
51,
18,
22402,
17,
15759,
26,
109,
85,
130,
9,
32,
2206,
30,
568,
8613,
22402,
25,
21,
1424,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Batching in REST
===
Is there any way to batch call RESTful services? | 0 | [
2,
13064,
68,
19,
760,
800,
3726,
3726,
25,
80,
186,
161,
20,
13064,
645,
760,
1566,
687,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
All possible uses for the Application.SysCmd Method
===
Is there a place to find all possible uses of the syscmd method in MS Access? I know Microsoft has a [developer reference][1], but I have found there are many other uses for this method that are not listed here.
[1]: http://msdn.microsoft.com/en-us/library/bb214117.aspx | 0 | [
2,
65,
938,
2027,
26,
14,
3010,
9,
4980,
18,
9095,
43,
2109,
800,
3726,
3726,
25,
80,
21,
209,
20,
477,
65,
938,
2027,
16,
14,
10315,
18,
9095,
43,
2109,
19,
4235,
1381,
60,
31,
143,
7099,
63,
21,
636,
26051,
106,
2801,
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... |
Bezier clipping
===
I'm trying to find/make an algorithm to compute the intersection (a new filled object) of two arbitrary filled 2D objects. The objects are defined using either lines or cubic beziers and may have holes or self-intersect. I'm aware of several existing algorithms doing the same with polygons, [listed here][1]. However, I'd like to support beziers without subdividing them into polygons, and the output should have roughly the same control points as the input in areas where there are no intersections.
This is for an interactive program to do some CSG but the clipping doesn't need to be real-time. I've searched for a while but haven't found good starting points.
[1]: http://www.complex-a5.ru/polyboolean/comp.html | 0 | [
2,
44,
15029,
29568,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
118,
11115,
40,
9083,
20,
23909,
14,
5351,
13,
5,
58,
78,
1943,
3095,
6,
16,
81,
17237,
1943,
172,
43,
3916,
9,
14,
3916,
50,
2811,
568,
694,
1560,
54,
11306,
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... |
What is the fastes way to learn LaTeX basics?
===
I am completely new to LaTeX. I know, it is not _very_ complicated. But there are always some basics that one need to be taught before going into the autonomous exploration stage.
Currently, I have installed [MiKTeX][1], but I can't even figure out how to compile a dummy example. Can you help me?
[1]: http://miktex.org/ | 0 | [
2,
98,
25,
14,
1512,
160,
161,
20,
2484,
456,
396,
2125,
18,
60,
800,
3726,
3726,
31,
589,
1524,
78,
20,
456,
396,
9,
31,
143,
15,
32,
25,
52,
13,
1,
7864,
1,
8343,
9,
47,
80,
50,
550,
109,
2125,
18,
30,
53,
376,
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... |
How to sort a Map<Key, Value> on the values in Java?
===
I am relatively new to Java, and often find that I need to sort a Map<Key, Value> on the values. Since the values are not unique, I find myself converting the keySet into an array, and sorting that array through array sort with a custom comparator that sorts on the value associated with the key. Is there an easier way?
| 0 | [
2,
184,
20,
2058,
21,
2942,
1,
4237,
15,
1923,
1,
27,
14,
4070,
19,
8247,
60,
800,
3726,
3726,
31,
589,
3109,
78,
20,
8247,
15,
17,
478,
477,
30,
31,
376,
20,
2058,
21,
2942,
1,
4237,
15,
1923,
1,
27,
14,
4070,
9,
179,
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... |
Can you do Desktop Development using JavaScript?
===
I know there's JScript.NET, but it isn't the same as the JavaScript we know from the web.
Does anyone know if there are any JavaScript based platforms/compilers for desktop development? Most specifically Windows desktop development. | 0 | [
2,
92,
42,
107,
17404,
522,
568,
8247,
8741,
60,
800,
3726,
3726,
31,
143,
80,
22,
18,
487,
8741,
9,
2328,
15,
47,
32,
2532,
22,
38,
14,
205,
28,
14,
8247,
8741,
95,
143,
37,
14,
2741,
9,
630,
1276,
143,
100,
80,
50,
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... |
Given sufficient experiece in C/C++, Python and Java, what would be another good language to learn, and why?
===
I have some free time on my hands and am interested in broadening my horizons. My background is in Python, C/C++ and Java. Does anyone have any recommendations on a new language to learn, and why? | 0 | [
2,
504,
6722,
13,
6899,
8337,
1105,
19,
272,
118,
150,
20512,
15,
20059,
17,
8247,
15,
98,
83,
44,
226,
254,
816,
20,
2484,
15,
17,
483,
60,
800,
3726,
3726,
31,
57,
109,
551,
85,
27,
51,
473,
17,
589,
3158,
19,
23356,
68,
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... |
What are the key strengths of ASP.NET Webforms?
===
What are the key strengths of ASP.NET Webforms (2.0-3.5)? I'm not looking for comparisons to other frameworks, I'm just am looking for feedback on ASP.NET as it stands today.
| 0 | [
2,
98,
50,
14,
1246,
2169,
18,
16,
28,
306,
9,
2328,
2741,
4190,
18,
60,
800,
3726,
3726,
98,
50,
14,
1246,
2169,
18,
16,
28,
306,
9,
2328,
2741,
4190,
18,
13,
5,
135,
9,
387,
8,
240,
9,
264,
6,
60,
31,
22,
79,
52,
699,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the easiest way to learn the basics of iPhone App creation?
===
I'm primarily a designer, with a fairly high level of understanding of CSS and HTML. I have an idea for a very simple iPhone app, largely involving a timer, an animated graphic, and some sound. If I get more advanced there could be some simple customization settings
I have no understanding of Objective C, or C of any kind for that matter. (The closest I got was a Pascal course 20 years ago.) Aside from befriending a developer with motivation to help me out, what would be the simplest, most likely method of learning the minimum I need to know to create my own iPhone App? | 0 | [
2,
98,
25,
14,
27237,
161,
20,
2484,
14,
2125,
18,
16,
21024,
4865,
2502,
60,
800,
3726,
3726,
31,
22,
79,
2257,
21,
4742,
15,
29,
21,
6647,
183,
662,
16,
3260,
16,
272,
18,
18,
17,
13,
15895,
9,
31,
57,
40,
882,
26,
21,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What not to test when it comes to Unit Testing?
===
In which parts of a project writing unit tests is nearly or really impossible? Data access? ftp?
If there is an answer to this question then %100 coverage is a myth, isn't it? | 0 | [
2,
98,
52,
20,
1289,
76,
32,
1624,
20,
1237,
4431,
60,
800,
3726,
3726,
19,
56,
1341,
16,
21,
669,
1174,
1237,
4894,
25,
1212,
54,
510,
3992,
60,
1054,
1381,
60,
1187,
306,
60,
100,
80,
25,
40,
1623,
20,
48,
1301,
94,
13,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best git repository hosting for commercial project?
===
Which git hosting provider would you use for commercial development? | 2 | [
2,
246,
13,
10404,
24869,
10637,
26,
1439,
669,
60,
800,
3726,
3726,
56,
13,
10404,
10637,
11747,
83,
42,
275,
26,
1439,
522,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
PHP replace double backslashes "\\" to a single backslash "\"
===
Okay so im working on this php image upload system but for some reason internet explorer turns my basepath into the same path, but with double backslashes instead of one; ie:
C:\\Documents and Settings\\kasper\\Bureaublad\\24.jpg
This needs to become C:\Documents and Settings\kasper\Bureaublad\24.jpg. | 0 | [
2,
13,
26120,
3934,
1494,
97,
18,
9545,
160,
13,
7,
1,
7,
20,
21,
345,
97,
18,
9545,
13,
7,
1,
7,
800,
3726,
3726,
1705,
86,
797,
638,
27,
48,
13,
26120,
1961,
71,
8294,
329,
47,
26,
109,
1215,
2620,
8520,
2844,
51,
1000,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reporting Services Line Graph: How to better control the smoothed curve.
===
I have a report that I built for a client where i need to plot x 0-100, y 0-100. Lets imagine I have these points:
0,0
2,24
50,70
100,100
I need to represent these as a smoothed line chart, as the application of it is a dot gain graph for printing presses.
Heres the problem. The line draws fine from 100,100 (top right) down to 2,24. But then what happens is from 2,24 to 0,0 the line curves out off the left of the graph and then to down to 0,0. Imagine it putting a point at -10,10.
I understand this is because of the generic bezier curve algoritm it is using and the large seperation of control points, thus heavily weighting it.
I was wondering however if anyone knows a way I can control it. I have tried adding in averaged points between the existing control points but it still curves off the graph as if its still heavily weighted.
The only other answer I can think of is custom drawing a graph or looking into dundas charts and using its GDI+ drawing support.
But before I go that route anyone have any thoughts? | 0 | [
2,
6670,
687,
293,
7210,
45,
184,
20,
574,
569,
14,
21296,
7101,
9,
800,
3726,
3726,
31,
57,
21,
1330,
30,
31,
392,
26,
21,
6819,
113,
31,
376,
20,
3798,
993,
713,
8,
4031,
15,
13,
93,
713,
8,
4031,
9,
6884,
4382,
31,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Caching paginated results, purging on update - how to solve?
===
I've created a forum, and we're implementing an apc and memcache caching solution to save the database some work.
I started implementing the cache layer with keys like "Categories::getAll", and if I had user-specific data, I'd append the keys with stuff like the user ID, so you'd get `"User::getFavoriteThreads|1471"`. When a user added a new favorite thread, I'd delete the cache key, and it would recreate the entry.
**However, and here comes the problem:**
I wanted to cache the threads in a forum. Simple enough, "Forum::getThreads|$iForumId". But... With pagination, I'd have to split this into several cache entries, for example
"Forum::getThreads|$iForumId|$iLimit|$iOffset".
Which is alright, until someone posts a new thread in the forum. I will now have to delete all the keys under `"Forum::getThreads|$iForumId"`, no matter what the limit and offset is.
What would be a good way of solving this problem? I'd really rather not loop through every possible limit and offset until I find something that doesn't match anymore.
Thanks. | 0 | [
2,
1658,
7192,
19006,
12721,
1736,
15,
6771,
2762,
27,
11100,
13,
8,
184,
20,
8402,
60,
800,
3726,
3726,
31,
22,
195,
679,
21,
5691,
15,
17,
95,
22,
99,
17333,
40,
21,
5779,
17,
55,
4829,
9616,
1658,
7192,
4295,
20,
2079,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it bad design to use table tags when displaying forms in html?
===
So I keep hearing that div tags should be used for layout purposes and not table tags. So does that also apply to form layouts? I know a form layout is still a layout, but it seems like creating form layouts with divs requires plenty more html and css. So with that in mind, should forms layouts use div tags instead? | 0 | [
2,
25,
32,
896,
704,
20,
275,
859,
3383,
18,
76,
17418,
1997,
19,
13,
15895,
60,
800,
3726,
3726,
86,
31,
643,
3229,
30,
13,
12916,
3383,
18,
378,
44,
147,
26,
9106,
4612,
17,
52,
859,
3383,
18,
9,
86,
630,
30,
67,
5645,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problems with accessing FlashVars via parameters in AS3
===
I keep getting compiler errors when I try to access flashVars in an AS3 class.
Here's a stripped version of the code:
package myPackage {
import flash.display.Loader;
import flash.display.LoaderInfo;
import flash.display.Sprite;
public class myClass {
public function CTrafficHandler() {
var myVar:String = LoaderInfo(this.root.loaderInfo).parameters.myFvar;}}}
And I get a compilation error:
*1119: Access of possibly undefined property root through a reference with static type source:myClass.*
When I change the class row to
public class myClass extends Sprite {
I don't get a compiler error, but I do get this in the output window:
*TypeError: Error #1009: Cannot access a property or method of a null object reference.*
How can I solve this? | 0 | [
2,
1716,
29,
1381,
68,
4433,
3311,
18,
1197,
12905,
19,
28,
240,
800,
3726,
3726,
31,
643,
1017,
21486,
11908,
76,
31,
1131,
20,
1381,
4433,
3311,
18,
19,
40,
28,
240,
718,
9,
235,
22,
18,
21,
10841,
615,
16,
14,
1797,
45,
603... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Gmail SMTP, how to use a custom from address
===
I've got my Rails (2.1) app setup to send email via Gmail, however whenever I send an email no matter what I set the from address to in my ActionMailer the emails always come as if sent from my Gmail email address. Is this a security restriction they've put in place at Gmail to stop spammers using their SMTP?
Note: I've tried both of the following methods within my ActionMailer (just in case):
@from = me@mydomain.com
from 'me@mydomain.com' | 0 | [
2,
2240,
18,
17,
489,
8079,
7613,
13726,
15,
184,
20,
275,
21,
5816,
37,
3218,
800,
3726,
3726,
31,
22,
195,
330,
51,
2240,
18,
13,
5,
135,
9,
165,
6,
4865,
18161,
20,
2660,
8517,
1197,
489,
8079,
15,
207,
6634,
31,
2660,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Test a Helper in Rails
===
I am creating a Rails plugin and it is dynamically adding a method to a Helper. I just want to ensure that the method is added. How can I see if the Helper responds to the method name? | 0 | [
2,
1289,
21,
448,
106,
19,
2240,
18,
800,
3726,
3726,
31,
589,
2936,
21,
2240,
18,
10922,
108,
17,
32,
25,
7782,
1326,
4721,
21,
2109,
20,
21,
448,
106,
9,
31,
114,
259,
20,
4062,
30,
14,
2109,
25,
905,
9,
184,
92,
31,
196,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Solving an exercise from Thinking C++
===
The exercise says:
> Create a Text class that contains a string object to hold the text of
> a file. Give it two constructors: a default constructor and a
> constructor that takes a string argument that is the name of the file
> to open. When the second constructor is used, open the file and read
> the contents into the string member object. Add a member function
> contents() to return the string so (for example) it can be printed. In
> main( ), open a file using Text and print the contents.
This is the class that I wrote:
class Text {
string fcontent;
public:
Text();
Text(string fname);
~Text();
string contents();
};
I haven't understood everything of this exercise. It asks to create a function `contents()`, that returns a string, but it doesn't says what the function has to do...<br />
Neither what the default constructor has to do.<br />
Could someone help me? | 0 | [
2,
17533,
40,
5935,
37,
1440,
272,
20512,
800,
3726,
3726,
14,
5935,
898,
45,
13,
1,
1600,
21,
1854,
718,
30,
1588,
21,
3724,
3095,
20,
1027,
14,
1854,
16,
13,
1,
21,
3893,
9,
590,
32,
81,
6960,
248,
18,
45,
21,
12838,
6960,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 make use of CoffeeKup when writing jQuery
===
I am quite new to web development and have started programming with node.js & express and using the coffeekup view engine. My problem is the following:
If I use the CoffeeKup view engine can I somehow insert coffeeKup code as a parameter to the jquery append method?!?
So for example instead of writing $('body').append('<p>') I can write $('body').append('p') or $('body').append(p) or something similar. I want the compiler to somehow preprocess my coffee code...
| 0 | [
2,
184,
107,
31,
233,
275,
16,
2364,
197,
576,
76,
1174,
487,
8190,
93,
800,
3726,
3726,
31,
589,
1450,
78,
20,
2741,
522,
17,
57,
373,
3143,
29,
15421,
9,
728,
18,
279,
2999,
17,
568,
14,
2364,
197,
576,
1418,
1406,
9,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating vector with normal distribution of entires in java
===
I would like to create a vector with the entries filled with normal distribution of data.How could I do it in java? | 0 | [
2,
13500,
7497,
29,
1826,
2523,
16,
1078,
18,
19,
8247,
800,
3726,
3726,
31,
83,
101,
20,
1600,
21,
7497,
29,
14,
11399,
1943,
29,
1826,
2523,
16,
1054,
9,
1544,
110,
31,
107,
32,
19,
8247,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Replacing url in a CSS with CSS Parser and Regex (Java)
===
I have this requirement that I need to replace URL in CSS, so far I have this code that display the rules of a css file:
@Override
public void parse(String document) {
log.info("Parsing CSS: " + document);
this.document = document;
InputSource source = new InputSource(new StringReader(this.document));
try {
CSSStyleSheet stylesheet = parser.parseStyleSheet(source, null, null);
CSSRuleList ruleList = stylesheet.getCssRules();
log.info("Number of rules: " + ruleList.getLength());
// lets examine the stylesheet contents
for (int i = 0; i < ruleList.getLength(); i++)
{
CSSRule rule = ruleList.item(i);
if (rule instanceof CSSStyleRule) {
CSSStyleRule styleRule=(CSSStyleRule)rule;
log.info("selector: " + styleRule.getSelectorText());
CSSStyleDeclaration styleDeclaration = styleRule.getStyle();
//assertEquals(1, styleDeclaration.getLength());
for (int j = 0; j < styleDeclaration.getLength(); j++) {
String property = styleDeclaration.item(j);
log.info("property: " + property);
log.info("value: " + styleDeclaration.getPropertyCSSValue(property).getCssText());
}
}
}
} catch (IOException e) {
e.printStackTrace();
}
}
However, I am not sure whether how to actually replace the URL since there is not much a documentation about [CSS Parser][1]
[1]: http://cssparser.sourceforge.net/ | 0 | [
2,
5496,
287,
6362,
19,
21,
272,
18,
18,
29,
272,
18,
18,
2017,
4104,
17,
7953,
1706,
13,
5,
1004,
1385,
6,
800,
3726,
3726,
31,
57,
48,
8981,
30,
31,
376,
20,
3934,
287,
6362,
19,
272,
18,
18,
15,
86,
463,
31,
57,
48,
179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
match pattern between symbols, after given pattern
===
I would like to find the first occurrence of a string, after a certain other string, and between a certain pattern. The documents that I am parsing are not xml, but have similar rules of start/end. and example of what I would be looking at:
...b.vcxproj", "{60F1D650-01D1-41BF-B885-B88B24C68AEC}"
and I am trying to get the string between { and }, right after an occurrence of a vcxproj, every time it happens in the document.
I tried the following, but I get a list of None:
my_list=[]
for line in text.split('.vcxproj'):
if '{' in line:
my_list.append(re.match( r"(?<=\{)(.*?)(?=\})", line))
I have tried to alter my expression but no success. Help ? Thank you. | 0 | [
2,
730,
3732,
128,
9794,
15,
75,
504,
3732,
800,
3726,
3726,
31,
83,
101,
20,
477,
14,
64,
12933,
16,
21,
3724,
15,
75,
21,
1200,
89,
3724,
15,
17,
128,
21,
1200,
3732,
9,
14,
4374,
30,
31,
589,
2017,
18,
68,
50,
52,
23504,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Distribution of N items into M Bins subject to constraints
===
What is the probability of distributing N identical items into M bins, such that:
Each bin gets atleast 1 item.
Atleast 1 bin gets atleast (or exactly, if this is easier to solve) K items.
Would be good to get a well-explanative solution. Thanks. | 2 | [
2,
2523,
16,
13,
103,
3755,
77,
307,
4511,
18,
1550,
20,
16747,
800,
3726,
3726,
98,
25,
14,
10177,
16,
23125,
13,
103,
6323,
3755,
77,
307,
4511,
18,
15,
145,
30,
45,
206,
4511,
3049,
35,
255,
2857,
137,
9101,
9,
35,
255,
285... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
multiple "mains" in linked OCaml modules
===
I have a number of "library" modules in OCaml (mainly utility and helper functions) where I've added the following kind of code at the end for unit-testing:
let main () = ...
main
or
let () = ...
This being code that mainly prints to the console (for testing purposes). The problem now is that when I link my "library" modules with my "main" module and execute the program I get all these distracting testing messages. Is there a way to include code in an OCaml module that gets executed when the module is linked alone (thus facilitating trivial testing) but not when used as a "library"? I 've read posts in SO to the effect that OCaml has no notion of a "main" module and that all modules are equal however it seems to me that the order of the object files given to the linker could be construed to indicate that the last module is the "main" one (since it's at the top of the "dependency food chain"). | 0 | [
2,
1886,
13,
7,
6232,
18,
7,
19,
4727,
13,
14977,
8184,
17113,
800,
3726,
3726,
31,
57,
21,
234,
16,
13,
7,
1210,
2559,
622,
7,
17113,
19,
13,
14977,
8184,
13,
5,
6232,
102,
10082,
17,
448,
106,
3719,
6,
113,
31,
22,
195,
90... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby Mail gem extract headers and clean up body
===
I'm working with the [Ruby Mail gem](https://github.com/mikel/mail) to try to read and parse out emails. I'm having a similar problem as [this post](http://stackoverflow.com/questions/4033376/mail-gem-how-to-clean-up-the-body-string), but the solutions provided only solved half my problems...
There are some email messages that don't respond to `html_part` or `text_part`, yet they are still considered "multipart". That's fine, I'll resort to manually looking at the MIME types. However, there are multipart message that have no parts!
I have a message, that `message.multipart? #=> true`, but `message.parts.length #=> 0`. As such, I can't actually extract a single part :(.
If I look at `message.body` (or `message.body.decoded`), there IS text there, and the type is `text/html`. However, it also has all the header information at the top.
It sounds crazy, but how can I get just the body (or just the headers) of this "multipart" email that has no parts? | 0 | [
2,
10811,
4216,
8551,
10962,
157,
445,
17,
2745,
71,
358,
800,
3726,
3726,
31,
22,
79,
638,
29,
14,
636,
1820,
779,
4216,
8551,
500,
5,
21127,
18,
6903,
10404,
20926,
9,
960,
118,
11753,
532,
118,
8079,
6,
20,
1131,
20,
1302,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading data from XML file into table using java
===
I have data in a XML file. The format of the XML file is like this
Code:
<employees>
<employee>
<name>rgoti</name>
<empno>2</empno>
….
….
<employee>
<employee>
<name>sganee</name>
<empno>3</empno>
….
….
<employee>
….
….
</employees>
I want to load this data into the Oracle database using Java.How to design and create table and data types for saving this xml in table?. | 0 | [
2,
12797,
1054,
37,
23504,
3893,
77,
859,
568,
8247,
800,
3726,
3726,
31,
57,
1054,
19,
21,
23504,
3893,
9,
14,
2595,
16,
14,
23504,
3893,
25,
101,
48,
1797,
45,
13,
1,
1503,
13221,
3616,
160,
1,
13,
1,
1503,
13221,
3616,
62,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 programatically manage iptables rules on the fly?
===
I need to query existing rules, as well as being able to easily add and delete rules. I haven't found any APIs for doing this, is there something that I'm missing?
The closest I've come to a solution is using `iptables-save | iptables-xml` for querying, and manually calling the iptables command itself to add/delete rules. Another solution I've considered is simply regenerating the entire ruleset out of my application's database and flushing the whole chain, then applying it again - I want to avoid this as I don't want to drop any packets (unless there's a way to atomically do this?). I'm wondering if there's a better way.
An API in C would be great, however as I'm planning to build this into a stand-alone suid program, libraries that do this in ANY language are fine too. | 0 | [
2,
184,
92,
31,
625,
721,
8438,
4705,
15735,
5924,
18,
1761,
27,
14,
2855,
60,
800,
3726,
3726,
31,
376,
20,
25597,
3149,
1761,
15,
28,
134,
28,
142,
777,
20,
2351,
3547,
17,
27448,
1761,
9,
31,
2933,
22,
38,
216,
186,
21,
895... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your approach to learning a new language or framework?
===
I've [read][1] that an effective approach to improving your programming skills is to learn new languages and frameworks.
How do you approach learning a new language/framework?
Even with the wide range of information available online, I often find myself looking for a good book on the language I'm interested in. With the basics understood, I then feel comfortable to begin to look elsewhere for further information. However, I recently began to look at the [EXT JS][2] javascript library and without a book to hand I found myself digging into the documentation in combination with the demos/samples provided. I was 'hands on' writing the code and seeing what would happen far earlier than I normally would be.
I'm interested in how others do this. Do you have a consistent approach when looking to take on new skills?
[1]: http://stackoverflow.com/questions/76364/what-is-the-single-most-effective-thing-you-did-to-improve-your-programming-ski
[2]: http://extjs.com/ | 0 | [
2,
98,
25,
154,
2141,
20,
2477,
21,
78,
816,
54,
6596,
60,
800,
3726,
3726,
31,
22,
195,
636,
10647,
500,
2558,
165,
500,
30,
40,
3140,
2141,
20,
9273,
154,
3143,
3207,
25,
20,
2484,
78,
2556,
17,
6596,
18,
9,
184,
107,
42,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open Source Alternative to Microsoft Project?
===
What is a good open-source alternative to Microsoft Project? Mac OS-X or Linux binaries available would be a huge plus. | 0 | [
2,
368,
1267,
2676,
20,
7099,
669,
60,
800,
3726,
3726,
98,
25,
21,
254,
368,
8,
12097,
2676,
20,
7099,
669,
60,
1572,
13,
759,
8,
396,
54,
13024,
4511,
11301,
904,
83,
44,
21,
2329,
3123,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I access cookies within Flash?
===
I'm looking to grab cookie values for the same domain within a Flash movie. Is this possible? | 0 | [
2,
184,
107,
31,
1381,
19396,
363,
4433,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
4931,
19980,
4070,
26,
14,
205,
4603,
363,
21,
4433,
1308,
9,
25,
48,
938,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Speed up images in Tomcat 6
===
In tomcat 6 i have a servlet running openbluedragon, everything compiles and servers up quik, with the exception of images, they really lag significantly. Any suggestions optimization for image serving?
Here is my server.xml:
<Service name="Catalina">
<Connector port="8009" protocol="AJP/1.3" />
<Connector port="8080" maxThreads="100" protocol="HTTP/1.1" connectionTimeout="20000" />
<Engine name="Standalone" defaultHost="hostname.whatever" jvmRoute="ajp13">
<Realm className="org.apache.catalina.realm.UserDatabaseRealm" resourceName="UserDatabase"/>
<Host name="hostname.whatever" appBase="webapps" unpackWARs="true" autoDeploy="true" xmlValidation="false" xmlNamespaceAware="false">
...context
</Host>
</Engine>
</Service>
| 0 | [
2,
1362,
71,
3502,
19,
2067,
5782,
400,
800,
3726,
3726,
19,
2067,
5782,
400,
31,
57,
21,
13,
10321,
1336,
946,
368,
6997,
20433,
15,
796,
26561,
18,
17,
17595,
71,
9153,
197,
15,
29,
14,
5391,
16,
3502,
15,
59,
510,
13,
6828,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Finding SQL queries in compiled app.
===
I have just inherited a server application, however it seems that the only copy of the database is corrupt and the working version is gone, so is it possible to find what queries the application is running so I can try to rebuild the tables? | 0 | [
2,
3007,
4444,
255,
9386,
2829,
19,
9316,
4865,
9,
800,
3726,
3726,
31,
57,
114,
7179,
21,
8128,
3010,
15,
207,
32,
2206,
30,
14,
104,
4344,
16,
14,
6018,
25,
11305,
17,
14,
638,
615,
25,
1042,
15,
86,
25,
32,
938,
20,
477,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
How do I position the content of a tabpage in Silverlight?
===
When I place a control on a tabpage in Silverlight the control is placed ~10 pixels down and ~10 pixels right. For example, the following xaml:
print("<System_Windows_Controls:TabControl x:Name=TabControlMain Canvas.Left="0" Canvas.Top="75" Width="800" Height="525" Background="Red" HorizontalContentAlignment="Left" VerticalContentAlignment="Top" Padding="0" Margin="0">
<System_Windows_Controls:TabItem Header="Test" VerticalContentAlignment="Top" BorderThickness="0" Margin="0" Padding="0" HorizontalContentAlignment="Left">
<ContentControl>
<Grid Width="400" Height="200" Background="White"/>
</ContentControl>
</System_Windows_Controls:TabItem>
</System_Windows_Controls:TabControl>");
will produce:
![alt text][1]
How do I position the content at 0,0?
[1]: http://i34.tinypic.com/8z1u1t.jpg | 0 | [
2,
184,
107,
31,
649,
14,
2331,
16,
21,
6523,
6486,
19,
1172,
3130,
60,
800,
3726,
3726,
76,
31,
209,
21,
569,
27,
21,
6523,
6486,
19,
1172,
3130,
14,
569,
25,
1037,
13,
1,
1036,
18146,
18,
125,
17,
13,
1,
1036,
18146,
18,
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 would you achieve this table based layout using CSS instead of HTML tables?
===
I want the following layout to appear on the screen:
FieldName 1 [Field input 1]
FieldName 2 is longer [Field input 2]
. .
. .
FieldName N [Field input N]
Requirements:
- Field names and field inputs must align on the left edges
- Both columns must dynamically size themselves to their content
- Must work cross-browsers
I find this layout extremely simple to do using HTML tables, but since I see a lot of CSS purists insisting that tables only be used for tabular data I figured I'd find out if there was a way to do it using CSS.
| 0 | [
2,
184,
83,
42,
4689,
48,
859,
432,
9106,
568,
272,
18,
18,
700,
16,
13,
15895,
7484,
60,
800,
3726,
3726,
31,
259,
14,
249,
9106,
20,
1893,
27,
14,
2324,
45,
575,
7259,
137,
636,
1109,
6367,
137,
500,
575,
7259,
172,
25,
1045... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the bigger hurdles to overcome migrating from Winforms to WPF?
===
I've been developing Winforms applications in C# for a few years now and have been interested in moving future development toward WPF, mainly because of the positive things I've been hearing about it. But, I'm wondering what sort of hurdles others have had to overcome as they migrated to WPF. Was there a significant hit to your productivity or any particular issues which you found challenging? | 0 | [
2,
98,
50,
14,
6197,
21329,
20,
9059,
28749,
37,
628,
4190,
18,
20,
619,
7721,
60,
800,
3726,
3726,
31,
22,
195,
74,
3561,
628,
4190,
18,
3767,
19,
272,
5910,
26,
21,
310,
122,
130,
17,
57,
74,
3158,
19,
1219,
1022,
522,
729,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Finding the right VPS
===
The market is flooded with VPS (virtual private server) hosting options. It seems everyone and their mother has a overloaded server in his/her closet. Enterprise options always seem priced insanely high, which make the ones that are cheap and claim enterprise level seem shaky.
What do you look for in a quality VPS provider (language support, 24/hr tech, etc), and how if at all do you check their credibility? | 2 | [
2,
3007,
14,
193,
13,
10924,
18,
800,
3726,
3726,
14,
1135,
25,
10820,
29,
13,
10924,
18,
13,
5,
8145,
38,
6948,
932,
8128,
6,
10637,
6368,
9,
32,
2206,
1266,
17,
66,
449,
63,
21,
84,
22546,
8128,
19,
33,
118,
1694,
9337,
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... |
pointers questions.
===
temp2, temp1 are pointer to some struct x. After execution of following lines
...
temp2=temp1;
temp1=temp1->nxt;
....
Will temp2 and temp1 still point to the same memory location or different? if diferent please explain.
| 0 | [
2,
454,
445,
2346,
9,
800,
3726,
3726,
13,
9577,
135,
15,
13,
9577,
165,
50,
454,
106,
20,
109,
13,
10346,
993,
9,
75,
5769,
16,
249,
1560,
13,
9,
9,
9,
13,
9577,
135,
3726,
9577,
165,
73,
13,
9577,
165,
3726,
9577,
165,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you do very quick (and dirty) estimations for coding tasks?
===
So you've just been put on the spot by The Boss.
You've got 15 minutes to come up with a back of the envelope estimate for the addition of some new feature. Your boss (fortunately) recognizes that you can't provide an accurate estimate in that time so expecting something that is in the right order of magnitude.
The question is how do you go about giving a estimate in the time frame that is accurate to an order of magnitude?
----------
Note that this is meant to be a quick and dirty estimate, not something that might be expected from questions like [this][1]
[1]: http://stackoverflow.com/questions/14279/how-to-estimate-the-length-of-a-programming-task#14289 | 0 | [
2,
184,
107,
42,
107,
253,
2231,
13,
5,
290,
6121,
6,
25390,
18,
26,
13,
15458,
8674,
60,
800,
3726,
3726,
86,
42,
22,
195,
114,
74,
442,
27,
14,
1999,
34,
14,
4054,
9,
42,
22,
195,
330,
357,
902,
20,
340,
71,
29,
21,
97,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IoC, Where do you put the container?
===
I'm using castle windsor for a pet-project I'm working on. I'm starting to notice that I need to call the IoC container in different places in my code to create new objects. This dependency on the container makes my code harder to maintain.
There are two solutions I've used to solve this problem
I tried to create abstract factories as wrappers around the container that I could inject into parts of my application that need to create objects. This works but has some drawbacks because castle has a hard time injecting it's own container as a dependency. So I have to do that by hand, this kind of defeats the whole purpose of the IoC container.
I have used the main applicationcontroller class to wrap the IoC container and work as a central factory/repository. This was quite succesfull but this class is getting too big and acts like a central god-object, almost every other objects has a reference to it.
Both solutions sort of work but both have their drawbacks. So I'm curious if other people had the same problem and have found better solutions. | 0 | [
2,
31,
2499,
15,
113,
107,
42,
442,
14,
12147,
60,
800,
3726,
3726,
31,
22,
79,
568,
1339,
10784,
26,
21,
3170,
8,
21011,
31,
22,
79,
638,
27,
9,
31,
22,
79,
1422,
20,
3551,
30,
31,
376,
20,
645,
14,
31,
2499,
12147,
19,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best c++ open-source example of good code.
===
The best way to learn is by practicing, but it's always good to learn from others who are smarter than you. What is the best example of a well-designed, well coded open-source project? I'm specifically interested in C++ projects, but other exceptional examples would be welcome, as well. | 4 | [
2,
98,
25,
14,
246,
272,
20512,
368,
8,
12097,
823,
16,
254,
1797,
9,
800,
3726,
3726,
14,
246,
161,
20,
2484,
25,
34,
13640,
15,
47,
32,
22,
18,
550,
254,
20,
2484,
37,
654,
72,
50,
3978,
106,
119,
42,
9,
98,
25,
14,
246,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
likely/unlikely macros in the Linux kernel
===
I've been digging through some parts of the Linux kernel, and found calls like this:
if (unlikely(fd < 0))
{
/* Do something */
}
or
if (likely(!err))
{
/* Do something */
}
I've found the definition of them:
#define likely(x) __builtin_expect((x),1)
#define unlikely(x) __builtin_expect((x),0)
I know that they are for optimalization, but how do they work? And how much performance/size decrease can be expected from using them? And is it worth the hassle (and losing the portability propably) at least in bottleneck code (in userspace, of course). | 0 | [
2,
1720,
118,
1020,
1403,
102,
9069,
18,
19,
14,
13024,
17007,
800,
3726,
3726,
31,
22,
195,
74,
11004,
120,
109,
1341,
16,
14,
13024,
17007,
15,
17,
216,
3029,
101,
48,
45,
100,
13,
5,
1020,
1403,
102,
5,
410,
43,
13,
1,
713,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multiple Constructors with complex logic
===
In C#, if you have multiple constructors, you can do something like this:
public MyClass(Guid inputId, string inputName){
// do something
}
public MyClass(Guid inputId): this(inputId, "foo") {}
The idea is of course code reuse. However, what is the best approach when there is a bit of complex logic needed? Say I want this contructor:
public MyClass(MyOtherClass inputObject)
{
Guid inputId = inputObject.ID;
MyThirdClass mc = inputObject.CreateHelper();
string inputText = mc.Text;
mc.Dispose();
// Need to call the main Constructor now with inputId and inputText
}
the caveat here: I need to create an object that **has** to be disposed after use. However, I did not see a way to just call the base constructor again if I add some code inside my overloaded constructor. Is there a way to call the base constructor from within an overloaded one?
Or is it possible to use
public MyClass(MyOtherClass inputObject): this(inputObject.ID, inputObject.CreateHelper().Text) {}
Would this automatically Dispose the generated Object from CreateGelper()? | 0 | [
2,
1886,
6960,
248,
18,
29,
1502,
7085,
800,
3726,
3726,
19,
272,
5910,
15,
100,
42,
57,
1886,
6960,
248,
18,
15,
42,
92,
107,
301,
101,
48,
45,
317,
51,
1898,
5,
7215,
43,
6367,
1340,
15,
3724,
6367,
7259,
6,
1,
12894,
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... |
Unit-testing COM written in .NET
===
Is there a way to unit-test COM-visible .NET assemblies from .NET (not via direct .NET assembly reference)? When i add reference in my test project to the COM component whitten in .NET it complains. | 0 | [
2,
1237,
8,
10543,
68,
13,
960,
642,
19,
13,
9,
2328,
800,
3726,
3726,
25,
80,
21,
161,
20,
1237,
8,
10543,
13,
960,
8,
3762,
3426,
13,
9,
2328,
21066,
37,
13,
9,
2328,
13,
5,
1270,
1197,
1744,
13,
9,
2328,
1475,
2801,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to branch a virtual server in Hyper-V?
===
We use Hyper-V extensively in our development environment. Each developer has a virtual server that they own and then we have a bunch of build, test, R&D, and staging virtual servers.
Is there any documented or best practice way to duplicate a virtual machine in Hyper-V?
What I would really like to be able to do is to split a machine from a snapshot and have multiple virtual machines that both roll up underneath a common root machines snapshot.
Is this possible? | 0 | [
2,
184,
20,
1686,
21,
6599,
8128,
19,
5443,
8,
710,
60,
800,
3726,
3726,
95,
275,
5443,
8,
710,
7802,
19,
318,
522,
2307,
9,
206,
10058,
63,
21,
6599,
8128,
30,
59,
258,
17,
94,
95,
57,
21,
7653,
16,
1895,
15,
1289,
15,
761,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a backend database on software update with Java
===
With which tool / library it is possible to update an existing database structure. On the update of the software it is also needed to change the database. Because there can be different versions of the software it should compare the current status with the target status of the database. It should:
- add table columns, fill it with default values.
- delete table columns
- change the data type of columns, for example varchar(30) --> varchar(40)
- add / remove indexes
- add / alter / delete views
- update some data in the tables
- ...
It should support the DBMS:
- MS SQL Server 2000 - 2008
- Oracle Server 8 - 11
- MySQL
Because our software setup and application run in Java that it must also be run in Java. What can we use?
Ideally it scan our development and save it in an XML file. Then we can add some data modification SQL command. Then it can be run on customer side with the setup of the update. | 0 | [
2,
11100,
21,
97,
2451,
6018,
27,
2306,
11100,
29,
8247,
800,
3726,
3726,
29,
56,
5607,
13,
118,
1248,
32,
25,
938,
20,
11100,
40,
3149,
6018,
1411,
9,
27,
14,
11100,
16,
14,
2306,
32,
25,
67,
851,
20,
753,
14,
6018,
9,
185,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ar_mailer fails to send emails
===
I've just switched an application to use ar_mailer and when I run ar_sendmail (after a long pause) I get the following error:
Unhandled exception 530 5.7.0 Must issue a STARTTLS command first. h7sm16260325nfh.4
I am using Gmail SMTP to send the emails and I haven't changed any of the ActionMailer::Base.smtp_settings just installed ar_mailer. | 0 | [
2,
2240,
18,
13,
512,
1,
8079,
106,
13614,
20,
2660,
8517,
18,
800,
3726,
3726,
31,
22,
195,
114,
6667,
40,
3010,
20,
275,
13,
512,
1,
8079,
106,
17,
76,
31,
485,
13,
512,
1,
18,
2451,
8079,
13,
5,
5162,
21,
175,
6911,
6,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to setup Trac to run at / with Lighttpd on a subdomain
===
I have the following config in my lighttpd.conf:
$HTTP["host"] == "trac.domain.tld" {
server.document-root = "/usr/home/daniels/trac/htdocs/"
fastcgi.server = ( "/trac" =>
( "trac" =>
( "socket" => "/tmp/trac-fastcgi.sock",
"bin-path" => "/usr/home/daniels/trac/cgi-bin/trac.fcgi",
"check-local" => "disable",
"bin-environment" =>
( "TRAC_ENV" => "/usr/home/daniels/trac" )
)
)
)
}
And it runs at trac.domain.tld/trac.
How can i make it to run at trac.domain.tld/ so i will have trac.domain.tld/wiki, trac.domain.tld/timeline, etc instead of trac.domain.tld/trac/wiki, etc... | 0 | [
2,
184,
20,
18161,
13,
38,
5797,
20,
485,
35,
13,
118,
29,
471,
38,
9251,
27,
21,
972,
537,
6232,
800,
3726,
3726,
31,
57,
14,
249,
13,
14093,
2816,
19,
51,
471,
38,
9251,
9,
14093,
45,
5579,
21127,
2558,
7,
11694,
7,
500,
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... |
Defining objects when using Jaxer
===
I've been playing with [Jaxer][1] and while the concept is very cool I cannot figure out how to define objects that are available on both the client and the server. None of the examples I can find define objects at all.
**I'd like to be able to define an object and specify which methods will be available on the server, which will be available on the client, and which will be available on the client but executed on the server (server-proxy).** Can this be done without using three separate `<script`> tags with different `runat` attributes? I would like to be able to define all of my methods in the same js file if possible, and it is not practical to define my objects inline in the html with three separate tags...
Basically I'd like to be able to do this in one js file:
function Person(name) {
this.name = name || 'default';
}
Person.runat = 'both';
Person.clientStaticMethod = function () {
log('client static method');
}
Person.clientStaticMethod.runat = 'client';
Person.serverStaticMethod = function() {
log('server static method');
}
Person.serverStaticMethod.runat = 'server';
Person.proxyStaticMethod = function() {
log('proxy static method');
}
Person.proxyStaticMethod.runat = 'server-proxy';
Person.prototype.clientMethod = function() {
log('client method');
};
Person.prototype.clientMethod.runat = 'client';
Person.prototype.serverMethod = function() {
log('server method');
};
Person.prototype.serverMethod.runat = 'server';
Person.prototype.proxyMethod = function() {
log('proxy method');
}
Person.prototype.proxyMethod.runat = 'server-proxy';
Also, assuming I was able to do that, how would I include it into html pages correctly?
[1]: http://www.aptana.com/jaxer | 0 | [
2,
14684,
3916,
76,
568,
11712,
106,
800,
3726,
3726,
31,
22,
195,
74,
791,
29,
636,
1004,
396,
106,
500,
2558,
165,
500,
17,
133,
14,
2420,
25,
253,
2700,
31,
1967,
1465,
70,
184,
20,
9267,
3916,
30,
50,
904,
27,
156,
14,
681... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 logically organize recurring tasks?
===
What's the best way to create recurring tasks?
Should I create some special syntax and parse it, kind of similar to Cronjobs on Linux or should I much rather just use a cronjob that runs every hour to create more of those recurring tasks with no end?
Keep in mind, that you can have endless recurring tasks and tasks with an enddate. | 0 | [
2,
184,
20,
11545,
102,
9213,
11344,
8674,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
1600,
11344,
8674,
60,
378,
31,
1600,
109,
621,
22649,
17,
2017,
870,
32,
15,
825,
16,
835,
20,
13,
19587,
1636,
4562,
27,
13024,
54,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Uniq by object attribute in Ruby
===
What's the most elegant way to select out objects in an array that are unique with respect to one or more attributes?
These objects are stored in ActiveRecord so using AR's methods would be fine too.
| 0 | [
2,
367,
9908,
34,
3095,
35,
14755,
19,
10811,
800,
3726,
3726,
98,
22,
18,
14,
127,
11614,
161,
20,
5407,
70,
3916,
19,
40,
7718,
30,
50,
2619,
29,
2873,
20,
53,
54,
91,
13422,
60,
158,
3916,
50,
8214,
19,
1348,
14953,
86,
568... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Use of the Exception class in c#
===
Errors that occur deep down in a data access layer or even higher up, (say within ADO.net operations for example) rarely make much sense to an end user. Simply bubbling these errors up to a UI and displaying them will generally achieve nothing except frustration for an end user.
I have recently employed a basic technique for reporting errors such as this whereby I catch the error and at least add some user friendly text so that at least the end user understands what failed.
To do this I am catching an exception within each specific function (say for example a fetch function in a data access layer), then raising a new error with user friendly text about the function that has failed and probably cause, but then embedding the original exception in the new exception as the "inner exception" of that new exception. This occurs at each layer, so that what reaches the UI is an increasingly user friendly error message.
Once the error reaches the UI - if necessary - it can then iterate through the nested exceptions in order to display an error message that firstly tells the user which operation failed, but also provides a bit of technical information about what actually went wrong.
e.g.
> "The list of customer names your
> requested could not be displayed."
>
> "Obtaining the list of customers
> you requested failed due to an error with the database."
>
> "There was an error connecting to the
> database when retrieving a list of
> customers"
>
> "Login failed for user xx"
My question is this: Is this horribly inefficient (all those nested exceptions)? I suspect it is not best practice so what should I be doing to achieve the same thing - or should I in fact be trying to achieve something better?
| 0 | [
2,
275,
16,
14,
5391,
718,
19,
272,
5910,
800,
3726,
3726,
11908,
30,
3744,
855,
125,
19,
21,
1054,
1381,
5385,
54,
166,
1184,
71,
15,
13,
5,
6366,
363,
21,
537,
9,
2328,
1311,
26,
823,
6,
5664,
233,
212,
1259,
20,
40,
241,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 current state of art in Linux virtualization technology?
===
What VM technologies exist for Linux, their pros and cons, and which is recommended for which application?
Since this kind of question can be asked for X other than "VM technologies for Linux", and since the answer changes with progress, I suggest to define a template for this kind of pages. Those pages will have the tag 'stateoftheart' and they will be revisited each month and each month there will be up-to-date list of technologies, up-to-date reviews and up-to-date recommendations. | 0 | [
2,
98,
25,
14,
866,
146,
16,
415,
19,
13024,
6599,
1829,
1099,
60,
800,
3726,
3726,
98,
13,
20147,
5740,
3182,
26,
13024,
15,
66,
895,
18,
17,
11608,
15,
17,
56,
25,
5773,
26,
56,
3010,
60,
179,
48,
825,
16,
1301,
92,
44,
41... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Database Choice for a C# 2008 front end
===
I was wondering what and why you would choose to be able to make a database that can support no more than 100 users with no more than 10 using it at once with a Visual Studio 2008 C# Windows Form front end to access it by. I have to access the database over a network connection, not just on the local machine. I also need to define where the database is found at run-time in the code as opposed to the "Data Source" view in Visual Studio. If my question needs reframing or is not understood, let me know and I will adjust. Part of my problem is I am not sure even how to ask the right question, much less what the answer is. | 0 | [
2,
6018,
1837,
26,
21,
272,
5910,
570,
431,
241,
800,
3726,
3726,
31,
23,
5712,
98,
17,
483,
42,
83,
3538,
20,
44,
777,
20,
233,
21,
6018,
30,
92,
555,
90,
91,
119,
808,
3878,
29,
90,
91,
119,
332,
568,
32,
35,
382,
29,
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... |
Programmatically determine video file format?
===
Ok, I get the basics of video format - there are some container formats and then you have core video/audio formats. I would like to write a web based application that determines what video/audio codec a file is using.
How best can I programmatically determine a video codec? Would it be best to use a standard library via system calls and parse its output? (eg ffmpeg, transcode, etc?) | 0 | [
2,
625,
6732,
1326,
3746,
763,
3893,
2595,
60,
800,
3726,
3726,
5854,
15,
31,
164,
14,
2125,
18,
16,
763,
2595,
13,
8,
80,
50,
109,
12147,
13767,
17,
94,
42,
57,
2884,
763,
118,
1346,
6921,
13767,
9,
31,
83,
101,
20,
2757,
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... |
Should I bind directly to objects returned from a webservice?
===
Should I bind directly to objects returned from a webservice or should I have client-side objects that I bind to my gridcontrols? For instance if I have a service that returns object Car should I have a client side Car object that I populate with values from the webservice Car object?
What is considered best-practice?
In C# do I need to mark my classes as serializable or do something special to them? | 0 | [
2,
378,
31,
10193,
1703,
20,
3916,
587,
37,
21,
2741,
11449,
60,
800,
3726,
3726,
378,
31,
10193,
1703,
20,
3916,
587,
37,
21,
2741,
11449,
54,
378,
31,
57,
6819,
8,
1416,
3916,
30,
31,
10193,
20,
51,
7354,
12898,
18,
60,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Not getting emails from ExceptionNotifier
===
I followed this [tutorial][1] on configuring the Rails plugin ExceptionNotifier.
I know that I have ActionMailer configured correctly because I am getting mail from other forms. I even have local_addresses.clear set so that it should be delivering mail no matter what.
I am using Apache with a mongrel_cluster running in the backend.
What am I missing?
[1]: http://svn.rubyonrails.org/rails/plugins/exception_notification/README | 0 | [
2,
52,
1017,
8517,
18,
37,
5391,
1270,
16292,
800,
3726,
3726,
31,
709,
48,
636,
2473,
9819,
192,
500,
2558,
165,
500,
27,
1065,
13549,
68,
14,
2240,
18,
10922,
108,
5391,
1270,
16292,
9,
31,
143,
30,
31,
57,
1028,
8079,
106,
28... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Object Memory Analysis in .NET
===
Is there a tool or a way to find out how much memory consumed by each DLL or object in .NET?
The more detail it analyzes the better. Thanks. | 0 | [
2,
3095,
1912,
2495,
19,
13,
9,
2328,
800,
3726,
3726,
25,
80,
21,
5607,
54,
21,
161,
20,
477,
70,
184,
212,
1912,
10936,
34,
206,
13,
43,
211,
54,
3095,
19,
13,
9,
2328,
60,
14,
91,
6110,
32,
16051,
18,
14,
574,
9,
3669,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Auto-format (phone, date) using JavaScript ideally jQuery
===
I like jQuery and I was wondering if anyone have used a good plugin or (non-jQuery) add-on JavaScript library that allows for auto-formatting of structured fields like phone numbers or dates. I know of the calendar plugin, and not what I am looking for here. You may type in a phone number as 123 which then becomes (123), additional numbers will be formatted as (123) 456 7890 Ext. 123456. If you press delete the auto-formatting stuff disappears automatically, and repositioning of the cursor, say, after (123) and pressing delete will remove the 3 and make the rest (124) 567 8901 Ext. 23456. The ones that I have played with appears unreliable.
/Allan | 0 | [
2,
3108,
8,
23588,
13,
5,
7709,
15,
1231,
6,
568,
8247,
8741,
5628,
102,
487,
8190,
93,
800,
3726,
3726,
31,
101,
487,
8190,
93,
17,
31,
23,
5712,
100,
1276,
57,
147,
21,
254,
10922,
108,
54,
13,
5,
3951,
8,
728,
8190,
93,
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... |
curses API
===
Where can I find a complete reference of the ncurses C API? | 0 | [
2,
7144,
18,
21,
2159,
800,
3726,
3726,
113,
92,
31,
477,
21,
1279,
2801,
16,
14,
9276,
9679,
160,
272,
21,
2159,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
PHP + AWASP
===
Who here is using WASP (http://wasp.sourceforge.net/content/) to in real world applications? What impressions do you have? Good? Bad? If you can provide any inputs, how good it is comparing with rails for example.
Thanks,
Victor | 0 | [
2,
13,
26120,
2754,
21,
4149,
306,
800,
3726,
3726,
72,
235,
25,
568,
23,
306,
13,
5,
21127,
6903,
4149,
306,
9,
12097,
1106,
834,
9,
2328,
118,
25424,
118,
6,
20,
19,
683,
126,
3767,
60,
98,
6394,
18,
107,
42,
57,
60,
254,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 does "datetime?" mean in C#?
===
I am reading a .Net book, and in one of the code examples there is a class definition with this field:
private datetime? startdate
What does "datetime?" mean? | 0 | [
2,
98,
630,
13,
7,
8209,
891,
60,
7,
884,
19,
272,
5910,
60,
800,
3726,
3726,
31,
589,
1876,
21,
13,
9,
2328,
360,
15,
17,
19,
53,
16,
14,
1797,
3770,
80,
25,
21,
718,
5465,
29,
48,
575,
45,
932,
1231,
891,
60,
799,
8209,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Converting PostgreSQL database to MySQL
===
I've seen questions for doing the reverse, but I have an 800MB PostgreSQL database that needs to be converted to MySQL. I'm assuming this is possible (all things are possible!), and I'd like to know the most efficient way of going about this and any common mistakes there are to look out for. I have next to no experience with Postgre. Any links to guides on this would be helpful also! Thanks. | 0 | [
2,
19583,
678,
6879,
18,
22402,
6018,
20,
51,
18,
22402,
800,
3726,
3726,
31,
22,
195,
541,
2346,
26,
845,
14,
7006,
15,
47,
31,
57,
40,
7993,
5024,
678,
6879,
18,
22402,
6018,
30,
2274,
20,
44,
3494,
20,
51,
18,
22402,
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... |
Empty error message from vmware-authd when starting a VM (VMware server 1.0.7 for Linux)
===
- VMware server 1.0.7 installed with vmware-package
- Debian GNU/Linux testing (lenny)
- Kernel 2.6.26-1-686
- vmware-any-any-update117d
When trying to start a virtual machine:
$ vmware-cmd /var/lib/vmware/vm/waffle/waffle.vmx start
/usr/bin/vmware-cmd: Could not connect to VM /var/lib/vmware/vm/waffle/waffle.vmx
(VMControl error -14: Unexpected response from vmware-authd: The process exited with an error:
End of error message) | 0 | [
2,
2424,
7019,
2802,
37,
13,
20147,
5011,
8,
1346,
96,
43,
76,
1422,
21,
13,
20147,
13,
5,
20147,
5011,
8128,
137,
9,
387,
9,
465,
26,
13024,
6,
800,
3726,
3726,
13,
8,
13,
20147,
5011,
8128,
137,
9,
387,
9,
465,
4066,
29,
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... |
Perl solution for lazy lists this side of Perl 6.
===
Has anybody found a good solution for lazily-evaluated lists in perl? I've tried a number of ways to turn something like
for my $item ( map { ... } @list ) {
}
into a lazy evaluation--by tie-ing <tt>@list</tt>, for example. I'm trying to avoid breaking down and writing a source filter to do it, because they mess with your ability to debug the code. Has anybody had any success. Or do you just have to break down and use a while loop? | 0 | [
2,
416,
255,
4295,
26,
16792,
7227,
48,
270,
16,
416,
255,
400,
9,
800,
3726,
3726,
63,
11181,
216,
21,
254,
4295,
26,
333,
2553,
102,
8,
15599,
43,
7227,
19,
416,
255,
60,
31,
22,
195,
794,
21,
234,
16,
2847,
20,
805,
301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to return JSON from a HandleError filter?
===
aspnet mvc has the HandleError filter that will return a view if an error occurs, but if an error occurs when calling a JsonResult Action how can I return a JSON object that represents an error?
I don't want to wrap the code in each action method that returns a JsonResult in a try/catch to accomplish it, I'd rather do it by adding a 'HandleJsonError' attribute or using the existing HandleError attribute to the required action methods. | 0 | [
2,
184,
20,
788,
487,
528,
37,
21,
3053,
29992,
11945,
60,
800,
3726,
3726,
28,
306,
2328,
307,
8990,
63,
14,
3053,
29992,
11945,
30,
129,
788,
21,
1418,
100,
40,
7019,
3690,
15,
47,
100,
40,
7019,
3690,
76,
2555,
21,
487,
528,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expression to match only the first file in a RAR file set
===
To see what file to invoke the unrar command on, one needs to determine which file is the first in the file set.
Here are some sample file names, of which - naturally - only the first group should be matched:
yes.rar
yes.part1.rar
yes.part01.rar
yes.part001.rar
no.part2.rar
no.part02.rar
no.part002.rar
no.part011.rar
One (limited) way to do it with PCRE compatible regexps is this:
.*(?:(?<!part\d\d\d|part\d\d|\d)\.rar|\.part0*1\.rar)
This did not work in Ruby when I tested it at [Rejax][1] however.
How would you write one **Ruby compatible** regular expression to match only the first file in a set of RAR files?
[1]: http://www.projects.aphexcreations.net/rejax/ | 0 | [
2,
1290,
1803,
20,
730,
104,
14,
64,
3893,
19,
21,
13,
15011,
3893,
309,
800,
3726,
3726,
20,
196,
98,
3893,
20,
28371,
14,
367,
15011,
1202,
27,
15,
53,
2274,
20,
3746,
56,
3893,
25,
14,
64,
19,
14,
3893,
309,
9,
235,
50,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is WAP Dead?
===
7-8 years ago I developed some cool apps using WAP. The mobile phone apps were able to help several in a few local governments, school systems as well as apartment complexes manage their mobile-workforce and various duties they did.
Back then the alternative was a Java mobile edition (I think). What is the best mobile development platform to use today. Something that the majority of mobile devices will be able to install and run easily (for the user as well as the developer)? | 0 | [
2,
25,
3142,
306,
828,
60,
800,
3726,
3726,
453,
8,
457,
122,
1464,
31,
885,
109,
2700,
4865,
18,
568,
3142,
306,
9,
14,
3241,
1132,
4865,
18,
46,
777,
20,
448,
238,
19,
21,
310,
375,
7706,
15,
116,
1242,
28,
134,
28,
2880,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Filtering duplicate newsgroup posts from Google
===
I have the constant need to Google error messages to try to find out what they mean and what solutions people might have. Usually those error messages were posted in some newsgroup. Unfortunately, Google's results (even when it says "similar results removed") usually consist of many copies of the exact same message (usually with some non-answer) replicated among many different newsgroup archives. Even just Google Groups results will be there three or four times, counting different localizations of Google Groups. How can I filter things down so I get one unique thread per result and don't end up sorting through a huge pile of the exact same newsgroup posts? | 0 | [
2,
25272,
19429,
996,
8024,
9868,
37,
8144,
800,
3726,
3726,
31,
57,
14,
3587,
376,
20,
8144,
7019,
7561,
20,
1131,
20,
477,
70,
98,
59,
884,
17,
98,
6776,
148,
530,
57,
9,
951,
273,
7019,
7561,
46,
6054,
19,
109,
996,
8024,
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... |
Multithreading in visual basic 6.0
===
How to implement multi-threading in visual basic 6.0. It would be great if someone can give an example. | 0 | [
2,
1889,
96,
22883,
19,
3458,
2125,
400,
9,
387,
800,
3726,
3726,
184,
20,
8713,
1889,
8,
96,
22883,
19,
3458,
2125,
400,
9,
387,
9,
32,
83,
44,
374,
100,
737,
92,
590,
40,
823,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
linq equivalent of 'select *' sql for generic function?
===
I've got a generic<> function that takes a linq query ('items') and enumerates through it adding additional properties. How can I select all the properties of the original 'item' rather than the item itself (as the code below does)?
So equivalent to the sql: select *, 'bar' as Foo from items
foreach (var item in items)
{
var newItem = new {
item, // I'd like just the properties here, not the 'item' object!
Foo = "bar"
};
newItems.Add(newItem);
}
| 0 | [
2,
6294,
1251,
4602,
16,
13,
22,
18,
16964,
1637,
22,
4444,
255,
26,
12733,
1990,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
12733,
1,
1990,
30,
1384,
21,
6294,
1251,
25597,
13,
5,
22,
2119,
79,
18,
22,
6,
17,
26940,
160,
120,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 to go with long term - C, Objective C, or C++?
===
One thing I've really been meaning to get back into is C++ programming but I am not sure if I should go back to C++ (which I have some basic console programming knowledge) or should I look into C or Objective C? I'm looking at the long term as well as ease of coding such as good editors, compilers, etc as well as which would be the quickest to get set up and running.
To go along with that, what software would you suggest for working with a suggested language? | 0 | [
2,
56,
20,
162,
29,
175,
981,
13,
8,
272,
15,
7038,
272,
15,
54,
272,
20512,
60,
800,
3726,
3726,
53,
584,
31,
22,
195,
510,
74,
1813,
20,
164,
97,
77,
25,
272,
20512,
3143,
47,
31,
589,
52,
562,
100,
31,
378,
162,
97,
20,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Xcode: 'Generics are not supported in -source 1.3' compiler error?
===
just a quick question:
I am a CS undergrad and have only had experience with the Eclipse, and Net Beans IDEs. I have recently acquired a Macbook and was wanting to recompile a recent school project in Xcode just to test it out. Right after the line where I declare a new instance of an ArrayList:
dictionary = new ArrayList<String>();
I get the following error: <b>generics are not supported in -source 1.3</b>.
I was just wondering if anybody could offer advice as to what the problem might be. The same project compiles in Eclipse on the same machine. I'm running OSX 10.5.4, with Java 1.5.0_13.
Thank you. | 0 | [
2,
993,
9375,
45,
13,
22,
17083,
8354,
50,
52,
1827,
19,
13,
8,
12097,
137,
9,
240,
22,
21486,
7019,
60,
800,
3726,
3726,
114,
21,
2231,
1301,
45,
31,
589,
21,
272,
18,
131,
7691,
17,
57,
104,
41,
1496,
29,
14,
11652,
15,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How should I organize my ASP.Net themes and common CSS files
===
I am currently working on a project where a programmer who fancied themselves a graphic designer attempted their hand at ASP.Net themes. The CSS is pretty bad, but that is another question altogether.
What I really need help with is the best way to organize ASP.Net Themes and the CSS that lies within them. Imagine that there is a directory structure that looks something like this:
- Themes
- Theme A
- StyleA.css
- *Common.css*
- Theme B
- StyleB.css
- *Common.css*
- Theme C
- StyleC.css
- *Common.css*
Each theme has a common stylesheet in it. Unfortunately the author of those style sheets managed to change only a few things here and there in each copy of *Common.css*. Eventually I will evaluate whether or not those changes are even necessary, but some major cleanup needs to happen first. For now just assume that the changes, ever so small, are necessary for things to look right with each theme.
I would like to know what the best practices are for using themes while also needing some common styles across your application. I want to minimize the number of AppTurns in the page load, but I really want to consolidate common styles into one place in a way that maintains the ease of themes. | 0 | [
2,
184,
378,
31,
9213,
51,
28,
306,
9,
2328,
6876,
17,
757,
272,
18,
18,
6488,
800,
3726,
3726,
31,
589,
871,
638,
27,
21,
669,
113,
21,
17968,
72,
2514,
1892,
69,
1366,
21,
8479,
4742,
3066,
66,
224,
35,
28,
306,
9,
2328,
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... |
Why should I use RSpec or shoulda with Rails?
===
I am setting up a rails app and I just finished making some unit tests and my friend said that apparently fixtures are no longer cool and people are now using RSpec or shoulda. I was wondering what the actual benefits are to use these other toolkits. Any information at all is appreciated.
-fREW | 0 | [
2,
483,
378,
31,
275,
13,
1224,
12610,
54,
378,
58,
29,
2240,
18,
60,
800,
3726,
3726,
31,
589,
2697,
71,
21,
2240,
18,
4865,
17,
31,
114,
842,
544,
109,
1237,
4894,
17,
51,
860,
87,
30,
3083,
19914,
50,
90,
1045,
2700,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get a hardware-based screen capture?
===
In the past, some of my projects have required me to create a movie version of a fullscreen Flash application. The easiest way to do this has been to get a screen capture. However, capturing anything over 1024x768 has resulted in choppy video, which is unacceptable. I understand that there are hardware based solutions for capturing fullscreen video, but I have not been able to find out what these are. My output needs to be scalable up to 1920x1080 and result in an uncompressed AVI file with no choppy-ness. | 0 | [
2,
184,
92,
31,
164,
21,
7610,
8,
1281,
2324,
3683,
60,
800,
3726,
3726,
19,
14,
640,
15,
109,
16,
51,
2314,
57,
1390,
55,
20,
1600,
21,
1308,
615,
16,
21,
503,
7187,
4433,
3010,
9,
14,
27237,
161,
20,
107,
48,
63,
74,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
request uri php: get first level
===
If I had a url such as **`www.example.com/test/example/product.html`**
How would I be able to get just the test part(so the top level)
I understand you would use `$_SERVER['REQUEST_URI']` and maybe `substr` or `trim`
But I am unsure of how to do this, thank you!
| 0 | [
2,
3772,
13,
3594,
13,
26120,
45,
164,
64,
662,
800,
3726,
3726,
100,
31,
41,
21,
287,
6362,
145,
28,
13,
1409,
1,
6483,
9,
29041,
9,
960,
118,
10543,
118,
29041,
118,
14086,
9,
15895,
1,
1409,
184,
83,
31,
44,
777,
20,
164,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LWJGL Slow rendering
===
I have made a simple LWJGL program where it makes a display and renders text to the screen. I render text with Slick-util btw.
So my question is why does it take a couple seconds of a black screen(or whatever the clear color is) before it loads up. Is there a way to fix this? Can I hide the Display until it all renders? Well those are my questions. Here is my code:
package com.survivalpixel.kopis;
import static org.lwjgl.opengl.GL11.GL_MODELVIEW;
import static org.lwjgl.opengl.GL11.GL_PROJECTION;
import static org.lwjgl.opengl.GL11.GL_TEXTURE_2D;
import static org.lwjgl.opengl.GL11.glEnable;
import static org.lwjgl.opengl.GL11.glMatrixMode;
import static org.lwjgl.opengl.GL11.*;
import static org.lwjgl.opengl.GL11.glPopMatrix;
import static org.lwjgl.opengl.GL11.glPushMatrix;
import java.awt.Font;
import org.lwjgl.LWJGLException;
import org.lwjgl.opengl.Display;
import org.lwjgl.opengl.DisplayMode;
import org.lwjgl.opengl.GL11;
import org.newdawn.slick.TrueTypeFont;
public class Menu {
private int WIDTH = 1080,HEIGHT = 720;
Font font;
TrueTypeFont gamefont;
public static void main(String args[]){
new Menu();
}
public Menu(){
try {
Display.setDisplayMode(new DisplayMode(WIDTH,HEIGHT));
Display.setResizable(false);
Display.setTitle("Kopis V.01");
Display.create();
} catch (LWJGLException e) {
}
initGL();
init();
while(!Display.isCloseRequested()){
glPopMatrix();
glClear(GL11.GL_COLOR_BUFFER_BIT);
drawString("This is a test",100,100);
Display.update();
Display.sync(100);
glPushMatrix();
}
Display.destroy();
System.exit(0);
}
private void initGL() {
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
glOrtho(0, 1080, 720, 0, -1, 1);
glMatrixMode(GL_MODELVIEW);
glClearColor(0, 0, 0, 0);
glEnable(GL_BLEND);
glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);
}
private void init() {
font = new Font("times new roman", Font.BOLD,12);
gamefont = new TrueTypeFont(font, false);
}
public void drawString(String s,int x, int y){
gamefont.drawString(x, y, s);
}
}
| 0 | [
2,
13,
23281,
728,
8430,
2276,
15307,
800,
3726,
3726,
31,
57,
117,
21,
1935,
13,
23281,
728,
8430,
625,
113,
32,
1364,
21,
3042,
17,
16535,
18,
1854,
20,
14,
2324,
9,
31,
16535,
1854,
29,
12544,
8,
14255,
334,
38,
499,
9,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strange SystemTime issues when using OpenCV + Processing
===
I'm testing using cues for a face-recognition based application. In my code, I have it so when a face is detected (line 74 onwards), it should display a gray rectangle and then wait for three seconds using a while loop. However, what happens is that the gray rectangle is not displayed until after the while loop terminates.
I noticed that if I did something like this
if (faces.length > 0) {
placeSquare();
long s = System.currentTimeMillis();
long test = 9999999;
while (abs (s- test) < 3000) {
test = test - 1;
// wait so the person can get their face centered
}
The square will appear properly i.e. before the while loop terminates, not after.
I am curious as to what exactly is happening here. Do Processing functions calls have a lower priority on the call stack?
Code: https://gist.github.com/2727748
| 0 | [
2,
2578,
329,
891,
1549,
76,
568,
368,
12732,
2754,
5511,
800,
3726,
3726,
31,
22,
79,
4431,
568,
10963,
18,
26,
21,
276,
8,
14673,
22007,
3309,
432,
3010,
9,
19,
51,
1797,
15,
31,
57,
32,
86,
76,
21,
276,
25,
11968,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to Bind multiple properties of one class to another using Entity Framework (EF) 4.1 Code First for use with Upshot.js?
===
I have a scenario where I need to bind two properties from one class to another class using Entity Framework 4.1. (For reference, this model is being consumed by Upshot.js for using in a single page application using Knockout.js 2.1)
Normally, I would have done something like the following:
public class Person
{
[Key]
public int PersonId { get; set; }
public string FirstName { get; set; }
public string LastName { get; set; }
public Address HomeAddress { get; set; }
public Address OfficeAddress { get; set; }
public virtual ICollection<PhoneNumber> PhoneNumbers { get; set; }
public int ClientId { get; set; }
public virtual Client Client { get; set; }
}
public class Address
{
[Key]
public int AddressId { get; set; }
public string StreetAddress { get; set; }
public string City { get; set; }
public string State { get; set; }
public string ZipCode { get; set; }
}
This allows HomeAddress and OfficeAddress to both reference an instance of the Address class.
*Please note this is not my real data model. It is for illustrative purposes only. In real life, I probably would have used an ICollection<Address>. Unfortunately, it is not feasible for this particular situation.*
In this particular scenario, it is possible for a person to exist *without* any addresses defined. It is also possible for addresses to exist *without* a person. (Again, this data model is just for the purposes of illustration.)
When I attempt to fetch this data using Upshot.js on the client, the system throws a real tantrum.
It gives an (inner) error like the following:
{"Unable to retrieve association information for association 'KnockoutTest.Models.Person_HomeAddress'. Only models that include foreign key information are supported. See Entity Framework documentation for details on creating models that include foreign key information."}
So... I attempted to set the Foreign Key information on the DbContext class like
protected override void OnModelCreating(DbModelBuilder modelBuilder)
{
modelBuilder.Entity<Person>()
.HasOptional(m => m.HomeAddress);
modelBuilder.Entity<Person>()
.HasOptional(m => m.OfficeAddress);
}
No joy! This still gave me the same error.
I am not sure how to set up the foreign key association so that multiple properties on one object can reference another object--at least not in a way that upshot will be pleased and stop complaining for a while.
What am I doing wrong, and how do I fix it?
| 0 | [
2,
184,
20,
10193,
1886,
3704,
16,
53,
718,
20,
226,
568,
9252,
6596,
13,
5,
6917,
6,
268,
9,
165,
1797,
64,
26,
275,
29,
71,
7868,
9,
728,
18,
60,
800,
3726,
3726,
31,
57,
21,
12705,
113,
31,
376,
20,
10193,
81,
3704,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to pack file using 7z with Delphi and show percent done?
===
When I run this from command line:
7z a 1.zip J:\test.mp4
I can see how much in % is done.
When I tried to run this from Delphi using CreateProcess and CreatePipe I got nothing until the file is packed. Then it displayed the final output from 7zip.
My code looks like this:
Stream:= THandleStream.Create(hRead);
try
if not CreateProcess(nil, PChar(Cmd), nil, nil, True, 0, nil, nil, StartupInfo, ProcessInformation) then
RaiseLastOSError;
repeat
if not GetExitCodeProcess(ProcessInformation.hProcess, ExitCode) then
RaiseLastOSError;
while Stream.Position < Stream.Size do begin
Stream.Read(C, 1);
if (C = #13) then begin
Memo1.Lines.Add(S);
S := '';
Application.ProcessMessages;
end
else if C <> #10 then begin
S := S+C;
end;
end;
until ExitCode <> Still_Active;
finally
Stream.Free; | 0 | [
2,
184,
20,
3607,
3893,
568,
453,
380,
29,
23030,
17,
298,
2091,
677,
60,
800,
3726,
3726,
76,
31,
485,
48,
37,
1202,
293,
45,
453,
380,
21,
137,
9,
2553,
306,
487,
45,
1,
10543,
9,
2554,
300,
31,
92,
196,
184,
212,
19,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
setImage animated - NSImageView
===
I'm trying to setImage of a NSImageView using animation (Mac App):
[[_image animator] setImage:[NSImage imageNamed:@"image.png"]];
But the image is just changing (without some effect). I'm trying to fade it.
Any idea how to fade two NSImageView in a Mac App?
Thanks | 0 | [
2,
309,
22039,
5784,
13,
8,
13,
2172,
22039,
4725,
800,
3726,
3726,
31,
22,
79,
749,
20,
309,
22039,
16,
21,
13,
2172,
22039,
4725,
568,
6236,
13,
5,
6893,
4865,
6,
45,
636,
2558,
1,
22039,
14487,
2153,
500,
309,
22039,
45,
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 you iterate through permutations in order of least to most non-zero elements?
===
I am trying to write a C# function that, given an argument like `new int[] { 2, 3, 2 }` which specifies the upper bound + 1 for each element, would return the following (via `IEnumberable<int[]>`):
0 0 0
0 0 1
0 1 0
0 2 0
1 0 0
0 1 1
0 2 1
1 0 1
1 1 0
1 2 0
1 1 1
1 2 1
Note that the order is important: all the permutations with 0 non-zero elements, followed by all those with 1 non-zero elements, etc. Within one of those groups the order doesn't matter.
I realize that these may not technically be permutations, but it's the closest term that I know of. Also I realize that one way would be to return all the permutations in some order and then sort them according to a function that counts how many non-zero elements there are, but I am hoping for something more elegant and efficient. | 0 | [
2,
184,
107,
42,
32,
106,
1373,
120,
28706,
18,
19,
389,
16,
639,
20,
127,
538,
8,
15938,
2065,
60,
800,
3726,
3726,
31,
589,
749,
20,
2757,
21,
272,
5910,
1990,
30,
15,
504,
40,
5476,
101,
13,
1,
2681,
19,
38,
2558,
500,
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... |
Android 4/ICS Context menu not showing up
===
I've looked at the other threads on this topic, and none of them have helped. I'm using an appropriate minSdkVersion, my menu xml appears setup correctly, my Manifest is calling Them.Holo.Light, and all of the other "typically overlooked" problems (that I'm aware of from other threads, anyway).
I'm using Eclipse with the latest SDK and following the basic tutorial from the Android dev wiki. Eclipse isn't showing any errors.
As you'll see, I'm referencing main.xml and main_activity.xml. main.xml is showing the default view when the app loads, which is a simple header bar and a picture of two ponies. The idea is that the user can use the context menu to swap between the pony picture and one of Lionel Richie (hey, it's a test app).
I've tried running it on the emulator, as well as my Xoom tablet and a phone, with no luck.
Code:<br />
/***** Contents of testIceCreamS Manifest *****/
<?xml version="1.0" encoding="utf-8"?>
<manifest xmlns:android="http://schemas.android.com/apk/res/android"
package="test.icecreams"
android:versionCode="1"
android:versionName="1.0" >
<uses-sdk android:minSdkVersion="4"
android:targetSdkVersion="11" />
<application
android:icon="@drawable/ic_launcher"
android:label="@string/app_name" >
<activity
android:name=".TestIceCreamSActivity"
android:theme="@android:style/Theme.Holo.Light"
android:label="@string/app_name"
android:uiOptions="splitActionBarWhenNarrow" >
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.LAUNCHER" />
</intent-filter>
</activity>
</application>
</manifest>
/***** Contents of TestIceCreamSActivity.java *****/
package test.icecreams;
import android.app.Activity;
import android.os.Bundle;
import test.icecreams.R;
public class TestIceCreamSActivity extends Activity {
/** Called when the activity is first created. */
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main);
}
}
/***** Contents of ActionBarUsage.java *****/
import test.icecreams.R;
import android.app.Activity;
import android.os.Bundle;
import android.view.Menu;
import android.view.MenuInflater;
import android.view.MenuItem;
import android.widget.ImageView;
import android.widget.LinearLayout;
public class ActionBarUsage extends Activity {
/** Called when the activity is first created. */
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main);
}
@Override
public boolean onCreateOptionsMenu(Menu menu) {
MenuInflater inflater = getMenuInflater();
inflater.inflate(R.menu.main_activity, menu);
return true;
}
@Override
public boolean onOptionsItemSelected(MenuItem item) {
LinearLayout bkgr = (LinearLayout)findViewById(R.id.LinearLayout1);
ImageView image = (ImageView)findViewById(R.id.imageView1);
switch (item.getItemId()) {
case R.id.buttonone:
image.setImageResource(R.drawable.ponies);
return true;
case R.id.buttontwo:
image.setImageResource(R.drawable.hello);
return true;
case R.id.buttonthree:
bkgr.setBackgroundResource(R.color.backgroundwhite);
return true;
case R.id.buttonfour:
bkgr.setBackgroundResource(R.color.background);
return true;
case R.id.buttonfive:
//The alert code goes here!
return true;
default :
return super.onOptionsItemSelected(item);
}
}
}
/***** Contents of main_activity.xml: *****/
<?xml version="1.0" encoding="utf-8"?>
<menu xmlns:android="http://schemas.android.com/apk/res/android">
<item android:id="@+id/buttonone"
android:title="@string/showimage1"
android:icon="@drawable/helloicon"
android:showAsAction="ifRoom|withText"/>
<item android:id="@+id/buttontwo"
android:title="@string/showimage2"
android:icon="@drawable/poniesicon"
android:showAsAction="ifRoom|withText"/>
<item android:id="@+id/buttonthree"
android:title="@string/showwhite"
android:showAsAction="ifRoom|withText"/>
<item android:id="@+id/buttonfour"
android:title="@string/showblack"
android:showAsAction="ifRoom|withText"/>
<item android:id="@+id/buttonfive"
android:title="@string/showalert"
android:showAsAction="ifRoom|withText"/>
</menu>
/***** Contents of main.xml: *****/
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
android:id="@+id/LinearLayout1"
android:layout_width="fill_parent"
android:layout_height="fill_parent"
android:background="#00000000"
android:orientation="vertical" >
<TextView
android:id="@+id/hellotext"
android:layout_width="fill_parent"
android:layout_height="wrap_content"
android:debuggable="true"
android:text="@string/hello" />
<ImageView
android:id="@+id/imageView1"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:contentDescription="@string/cd"
android:src="@drawable/ponies" />
</LinearLayout>
I also have the content for strings.xml, but I figured it was probably the least important of all of these.
Any suggestions? | 0 | [
2,
13005,
13,
12918,
8354,
4141,
11379,
52,
3187,
71,
800,
3726,
3726,
31,
22,
195,
292,
35,
14,
89,
20396,
27,
48,
8303,
15,
17,
2369,
16,
105,
57,
1456,
9,
31,
22,
79,
568,
40,
4593,
4232,
18,
43,
197,
10898,
15,
51,
11379,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windows Licensing Question
===
This is slightly off topic of programming but still has to do with my programming project. I'm writing an app that uses a custom proxy server. I would like to write the server in C# since it would be easier to write and maintain, but I am concerned about the licensing cost of Windows Server + CALS vs a Linux server (obviously, no CALS). There could potentially be many client sites with their own server and 200-500 users at each site. About how much would it cost to setup a Windows Server with proper licensing (per server)? | 0 | [
2,
1936,
15038,
1301,
800,
3726,
3726,
48,
25,
1847,
168,
8303,
16,
3143,
47,
174,
63,
20,
107,
29,
51,
3143,
669,
9,
31,
22,
79,
1174,
40,
4865,
30,
2027,
21,
5816,
27188,
8128,
9,
31,
83,
101,
20,
2757,
14,
8128,
19,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Not getting event arguments in IHTMLElement event handler
===
I've added a callback to an IHTMLElement instance but when the IDispatch::Invoke is called for the event, there are never any arguments (i.e. the pDispParams->cArgs and pDispParams->cNamedArgs are always 0). For example, I add a callback for an onmouseup event. From what I can tell, a callback for this event is supposed to receive a MouseEvent object. Is that correct? If so, what do I need to do to ensure this happens?
This is using the MSHTML for IE 6 sp2 (or better) on Windows XP SP2. | 0 | [
2,
52,
1017,
807,
10553,
19,
31,
15895,
27567,
807,
24641,
800,
3726,
3726,
31,
22,
195,
905,
21,
645,
1958,
20,
40,
31,
15895,
27567,
4851,
47,
76,
14,
13,
19405,
23661,
45,
45,
108,
2625,
1048,
25,
227,
26,
14,
807,
15,
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... |
Best way to stamp an image with another image to create a watermark in ASP.NET?
===
Anyone know? Want to be able to on the fly stamp an image with another image as a watermark, also to do large batches. Any type of existing library or a technique you know of would be great. | 0 | [
2,
246,
161,
20,
10151,
40,
1961,
29,
226,
1961,
20,
1600,
21,
308,
4527,
19,
28,
306,
9,
2328,
60,
800,
3726,
3726,
1276,
143,
60,
259,
20,
44,
777,
20,
27,
14,
2855,
10151,
40,
1961,
29,
226,
1961,
28,
21,
308,
4527,
15,
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... |
VisualStudio using BootCamp/VMWare on OS X
===
Just bought a 2.4GHz Intel Core 2 Duo iMac with 2GB of memory and a 320GB hard drive. I plan on doing some .net development on it using a BootCamp/VMWare combo since VMWare grants access to the bootcamp partition.
What is a recommended size for a BootCamp partition and how much memory should I give VMWare? Any pitfalls to watch out for? What is your current configuration? | 0 | [
2,
3458,
21026,
568,
6801,
8789,
118,
20147,
5011,
27,
13,
759,
993,
800,
3726,
3726,
114,
2448,
21,
172,
9,
300,
4780,
380,
14635,
2884,
172,
5356,
31,
6893,
29,
172,
11400,
16,
1912,
17,
21,
13,
12402,
11400,
552,
1493,
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... |
Is XSLT a functional programming language?
===
Several questions about functional programming languages have got me thinking about whether XSLT is a functional programming language. If not, what features are missing? Has XSLT 2.0 shortened or closed the gap? | 0 | [
2,
25,
993,
18,
255,
38,
21,
7652,
3143,
816,
60,
800,
3726,
3726,
238,
2346,
88,
7652,
3143,
2556,
57,
330,
55,
1440,
88,
1472,
993,
18,
255,
38,
25,
21,
7652,
3143,
816,
9,
100,
52,
15,
98,
967,
50,
2863,
60,
63,
993,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
Star-Schema Design
===
Is a Star-Schema design essential to a data warehouse? Or can you do data warehousing with another design pattern? | 0 | [
2,
778,
8,
7526,
540,
704,
800,
3726,
3726,
25,
21,
778,
8,
7526,
540,
704,
5832,
20,
21,
1054,
8308,
60,
54,
92,
42,
107,
1054,
176,
4362,
1291,
68,
29,
226,
704,
3732,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I determine if I should install Drupal 5.x or 6.x?
===
I'm planning to install Drupal. Is there any reason not to install the latest 6.x version as opposed to the 5.x branch? Are there any really good modules that are 5.x only? | 0 | [
2,
184,
107,
31,
3746,
100,
31,
378,
16146,
15708,
6720,
331,
9,
396,
54,
400,
9,
396,
60,
800,
3726,
3726,
31,
22,
79,
2334,
20,
16146,
15708,
6720,
9,
25,
80,
186,
1215,
52,
20,
16146,
14,
5736,
400,
9,
396,
615,
28,
3499,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good desktop sharing apps
===
I am about to be moving and working remotely full time. Right now we use Yugma and Skype for developer conferencing and showing the desktop, but we do not pay for Yugma so there is no ability to grant control. Before I recommend anything that is not free, what are the best options for apps that allow you to share your desktop with multiple other people and also have the ability to grant control of your desktop. | 0 | [
2,
254,
17404,
6126,
4865,
18,
800,
3726,
3726,
31,
589,
88,
20,
44,
1219,
17,
638,
23288,
503,
85,
9,
193,
130,
95,
275,
2600,
14336,
17,
1661,
1664,
26,
10058,
21748,
219,
6302,
17,
3187,
14,
17404,
15,
47,
95,
107,
52,
1372,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.