unified_texts
stringlengths
32
30.1k
OpenStatus_id
int64
0
4
input_ids
list
token_type_ids
list
attention_mask
list
Does Java Connection.close rollback? === Does Java Connection.close rollback into a finally block?. I know .Net SqlConnection.close does it. With this I could make try/finally blocks without catch... Example: try { conn.setAutoCommit(false); ResultSet rs = executeQuery(conn, ...); .... executeNonQuery(conn, ...); .... conn.commit(); } finally { conn.close(); }
0
[ 2, 630, 8247, 2760, 9, 14330, 3001, 1958, 60, 800, 3726, 3726, 630, 8247, 2760, 9, 14330, 3001, 1958, 77, 21, 722, 1921, 60, 9, 31, 143, 13, 9, 2328, 4444, 255, 25996, 872, 9, 14330, 630, 32, 9, 29, 48, 31, 110, 233, 1131, 118...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to get a Compare items in a Generic List === I have a custom class that implements that IComparable. This class is stored in a Generic List. I now need to compare to lists to see which objects are in list A but not in list B. I thought the most simple way of doing this would be to iterate through list B and do A.contains(). I do not know how to get it to use my CompareTo() (or another method that I can override so that I can say if it contains a certain object or not). I could be wrong but as I understand it the contains checks if the objects are actually the same (i.e. points to the same place in memory). Could anyone help me please?
0
[ 2, 184, 20, 164, 21, 11590, 3755, 19, 21, 12733, 968, 800, 3726, 3726, 31, 57, 21, 5816, 718, 30, 8713, 18, 30, 31, 960, 3574, 579, 9, 48, 718, 25, 8214, 19, 21, 12733, 968, 9, 31, 130, 376, 20, 11590, 20, 7227, 20, 196, 56,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to reverse engineer undocumented legacy application? === Once I was assigned to a project which was about adding couple new features to the existing Java based web application. Because it was a matter of just couple simple features there was no chance for rewrite. Unfortunately, the code base came from a client without any documentation and the code itself wasn't commented too well. The original developers had left the client company so there wasn't too much knowledge available. To spice up thing structure of the user interface was stored in the DB. We managed to solve the rather interesting logic with debugger, some DB visualizing tools and plenty of mind map/relationship drawings on the paper. This was then documented in our wiki. But for some reason we did not create extensive test coverage to protect us - maybe the reason was that nobody really knew how the application and its business cases should work... How people have dealt with similar cases? Are there any specific tools for understanding application or its creator's logic?
0
[ 2, 184, 20, 7006, 2335, 367, 28132, 69, 7780, 3010, 60, 800, 3726, 3726, 382, 31, 23, 2467, 20, 21, 669, 56, 23, 88, 4721, 1335, 78, 967, 20, 14, 3149, 8247, 432, 2741, 3010, 9, 185, 32, 23, 21, 1161, 16, 114, 1335, 1935, 967,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is a Null Pointer Exception? === True beginner Ziggy again with another Java question. What are null pointer exceptions and what causes them in general? Thanks guys!
0
[ 2, 98, 25, 21, 16203, 454, 106, 5391, 60, 800, 3726, 3726, 1151, 26931, 2052, 23142, 188, 29, 226, 8247, 1301, 9, 98, 50, 16203, 454, 106, 13392, 17, 98, 4047, 105, 19, 297, 60, 3669, 2776, 187, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
stitch picture in iphone === I want to stitch 2 pieces of png side by side. In Cocoa, I would use [NSImage initWithSize], and then just drawInRect. But UIImage don't have initWithSize class, how would I do this now?
0
[ 2, 19917, 2151, 19, 21024, 800, 3726, 3726, 31, 259, 20, 19917, 172, 2491, 16, 351, 2723, 270, 34, 270, 9, 19, 24507, 15, 31, 83, 275, 636, 2172, 22039, 19, 242, 1410, 10454, 500, 15, 17, 94, 114, 2003, 108, 14673, 38, 9, 47, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Ajax GET requests: use parameters or put data in URL? === What's the advantage of passing data as parameters vs part of the URL in an Ajax GET request? Using parameters: var ajax = new Ajax.Request('server.php',{ parameters: 'store=11200&product=Meat', onSuccess: function(myData){whatever} }); Using URL: var ajax = new Ajax.Request('server.php?store=11200&product=Meat',{ onSuccess: function(myData){whatever} });
0
[ 2, 20624, 164, 12279, 45, 275, 12905, 54, 442, 1054, 19, 287, 6362, 60, 800, 3726, 3726, 98, 22, 18, 14, 3314, 16, 2848, 1054, 28, 12905, 4611, 141, 16, 14, 287, 6362, 19, 40, 20624, 164, 3772, 60, 568, 12905, 45, 4033, 20624, 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...
COM class factory error === I've been testing an application using my machine as a server, and everything's going fine with it, but when I try to set it up to run on the test server, I get this error: > Retrieving the COM class factory for > component with CLSID {XXXX} failed due > to the following error: 80040154. Any ideas? Thanks
0
[ 2, 13, 960, 718, 3129, 7019, 800, 3726, 3726, 31, 22, 195, 74, 4431, 40, 3010, 568, 51, 1940, 28, 21, 8128, 15, 17, 796, 22, 18, 228, 1123, 29, 32, 15, 47, 76, 31, 1131, 20, 309, 32, 71, 20, 485, 27, 14, 1289, 8128, 15, 31...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Monitoring a SharePoint document library === I was wondering if there was a good way to monitor a document library on SharePoint for changes (new files added, files changed / checked-in, files deleted, etc.) Basically, what `System.IO.FileSystemWatcher` does on local / network directories. Are there events that get fired when documents are uploaded to document libraries? Perhaps creating a workflow on the document library that fires onCreate / onModify would be better? Any suggestions are welcome.
0
[ 2, 8984, 21, 1891, 3132, 4492, 1248, 800, 3726, 3726, 31, 23, 5712, 100, 80, 23, 21, 254, 161, 20, 7626, 21, 4492, 1248, 27, 1891, 3132, 26, 1693, 13, 5, 2681, 6488, 905, 15, 6488, 1015, 13, 118, 6505, 8, 108, 15, 6488, 19584, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 get value of Expression<Action<T>> action quickly? === Suppose we have the following code: ExpressionHelper.GetRouteValuesFromExpression<AccountController>(ax => ax.MyAction("a", "b")); (from ASP.NET MVC Futures assembly). Method is reasonably fast - it executes 10k iterations in 150ms. Now, we change code to this: string a = "a"; string b = "b"; ExpressionHelper.GetRouteValuesFromExpression<AccountController>(ax => ax.MyAction(a, b)); This code will execute 10k iterations in 15 **seconds** The problem is the following code: Expression<Func<object>> lambdaExpression = Expression.Lambda<Func<object>>(Expression.Convert(arg, typeof (object))); Func<object> func = lambdaExpression.Compile(); value = func() Is there a better way to get value from expression than compiling expression every time? This can greatly affect ASP.NET MVC link generation speed.
0
[ 2, 184, 20, 164, 1923, 16, 1803, 1, 8645, 1, 38, 1, 1028, 976, 60, 800, 3726, 3726, 5787, 95, 57, 14, 249, 1797, 45, 1803, 14593, 106, 9, 3060, 20179, 15165, 18, 2665, 28993, 1, 29148, 12898, 1252, 1, 5, 7522, 800, 1, 21, 396,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 determine if a .NET Windows service has not hung? === What is the best way to actively monitor if a .NET Windows service is still running (e.g not hung)? The service needs to periodically respond to events raised by a timer. Thanks Jon
0
[ 2, 246, 161, 20, 3746, 100, 21, 13, 9, 2328, 1936, 365, 63, 52, 3540, 60, 800, 3726, 3726, 98, 25, 14, 246, 161, 20, 8754, 7626, 100, 21, 13, 9, 2328, 1936, 365, 25, 174, 946, 13, 5, 62, 9, 263, 52, 3540, 6, 60, 14, 365, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
loading custom framework in iphone === I'm trying to use an [external framework][1] for UPnP browsing on the iPhone. The framework works perfectly on the Mac, But when I copy it to the iPhone app, it wouldn't run even if there's no code using the framework yet. It gives weird error that I can't understand. [Session started at 2008-10-20 15:32:34 +0200.] objc[2701]: Class CAAnimationGroup is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CATransition is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAKeyframeAnimation is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CABasicAnimation is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAPropertyAnimation is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAAnimation is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CASlotProxy is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAContextImpl is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAContext is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAFilter is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CALayer is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAMediaTimingFunction is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CAScrollLayer is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CATransaction is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CATransformLayer is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class CATiledLayer is implemented in both /System/Library/Frameworks/QuartzCore.framework/Versions/A/QuartzCore and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/Frameworks/QuartzCore.framework/QuartzCore. objc[2701]: Class NSCursor is implemented in both /System/Library/Frameworks/AppKit.framework/Versions/C/AppKit and /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/PrivateFrameworks/WebCore.framework/WebCore. Using implementation from /Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator2.0.sdk/System/Library/PrivateFrameworks/WebCore.framework/WebCore. [Session started at 2008-10-20 15:32:37 +0200.] Loading program into debugger… GNU gdb 6.3.50-20050815 (Apple version gdb-962) (Sat Jul 26 08:14:40 UTC 2008) Copyright 2004 Free Software Foundation, Inc. GDB is free software, covered by the GNU General Public License, and you are welcome to change it and/or distribute copies of it under certain conditions. Type "show copying" to see the conditions. There is absolutely no warranty for GDB. Type "show warranty" for details. This GDB was configured as "i386-apple-darwin".warning: Unable to read symbols for "/System/Library/Frameworks/UIKit.framework/UIKit" (file not found). warning: Unable to read symbols from "UIKit" (not yet mapped into memory). warning: Unable to read symbols for "/System/Library/Frameworks/CoreGraphics.framework/CoreGraphics" (file not found). warning: Unable to read symbols from "CoreGraphics" (not yet mapped into memory). Program loaded. sharedlibrary apply-load-rules all Attaching to program: `/Users/danielchong/Library/Application Support/iPhone Simulator/User/Applications/305F04A8-840D-4A1A-ADD8-59CEC674152E/uPnP Browser2.app/uPnP Browser2', process 2701. (gdb) [1]: http://www.cybergarage.org/net/upnp/c/index.html
0
[ 2, 12797, 5816, 6596, 19, 21024, 800, 3726, 3726, 31, 22, 79, 749, 20, 275, 40, 636, 1706, 8766, 192, 6596, 500, 2558, 165, 500, 26, 71, 8157, 10175, 68, 27, 14, 21024, 9, 14, 6596, 693, 5759, 27, 14, 1572, 15, 47, 76, 31, 434...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Locking NFS files in PHP === Part of my latest webapp needs to write to file a fair amount as part of its logging. One problem I've noticed is that if there are a few concurrent users, the writes *can* overwrite each other (instead of appending to file). I assume this is because of the destination file can be open in a number of places at the same time. `flock(...)` is usually superb but it doesn't appear to work on NFS... Which is a huge problem for me as the production server uses a NFS array. The closest thing I've seen to an actual solution involves trying to create a lock dir and waiting until it can be created. To say this lacks elegance is understatement of the year, possibly decade. Any better ideas? Edit: I should add that I don't have root on the server and doing the storage in another way isn't really feasible any time soon, not least within my deadline.
0
[ 2, 17538, 13, 11408, 18, 6488, 19, 13, 26120, 800, 3726, 3726, 141, 16, 51, 5736, 2741, 7753, 2274, 20, 2757, 20, 3893, 21, 1768, 2006, 28, 141, 16, 82, 13, 13919, 9, 53, 1448, 31, 22, 195, 2711, 25, 30, 100, 80, 50, 21, 310, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Difference initializing static variable inline or in static constructor in C# === I would like to know what is the difference between initializing a static member inline as in: class Foo { private static Bar bar_ = new Bar(); } or initializing it inside the static constructor as in: class Foo { static Foo() { bar_ = new Bar(); } private static Bar bar_; }
0
[ 2, 2841, 2104, 3335, 12038, 7612, 19, 1143, 54, 19, 12038, 6960, 248, 19, 272, 5910, 800, 3726, 3726, 31, 83, 101, 20, 143, 98, 25, 14, 2841, 128, 2104, 3335, 21, 12038, 322, 19, 1143, 28, 19, 45, 718, 4310, 111, 13, 1, 932, 1...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
In a Firefox extension, how can I copy rich text / links to the clipboard? === Specifically, I want to copy a link (with text and location) and then to be able to paste it, e.g., into Word as a link.
0
[ 2, 19, 21, 535, 18219, 3896, 15, 184, 92, 31, 4344, 2042, 1854, 13, 118, 6271, 20, 14, 12229, 2806, 60, 800, 3726, 3726, 3524, 15, 31, 259, 20, 4344, 21, 3508, 13, 5, 1410, 1854, 17, 1474, 6, 17, 94, 20, 44, 777, 20, 640, 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, 0, 0...
Ability to set the font to italics in Visual Studio === Does anyone know how to set the code text editor font style to italics in Visual Studio 2005 or 2008? Note, I'm talking about the code editor not in code itself.
0
[ 2, 2165, 20, 309, 14, 9978, 20, 21620, 19, 3458, 1120, 800, 3726, 3726, 630, 1276, 143, 184, 20, 309, 14, 1797, 1854, 1835, 9978, 1034, 20, 21620, 19, 3458, 1120, 812, 54, 570, 60, 1945, 15, 31, 22, 79, 1582, 88, 14, 1797, 1835,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Managing database changes between a Rails and Java project === At a new job I started, we have both a Java application that handles most of the heavy lifting in the core business logic, and we also have a Rails application that of course handles the web interface to this server. Both of these access the same database. Up until now, most of the focus has been on the Java application, and as such, there are no migrations in the Rails project. The sql to update the shared database is managed in a file like changes.sql. As you can imagine, this makes it somewhat difficult to develop. My initial thought was to combine the codebases for the Java project and the Rails application, because there is a dependency there, and to manage that SQL file in the source. However, I thought I'd ask here to see if anyone else had tackled this issue with some degree of success.
0
[ 2, 5616, 6018, 1693, 128, 21, 2240, 18, 17, 8247, 669, 800, 3726, 3726, 35, 21, 78, 1205, 31, 373, 15, 95, 57, 156, 21, 8247, 3010, 30, 3053, 18, 127, 16, 14, 1278, 8855, 19, 14, 2884, 508, 7085, 15, 17, 95, 67, 57, 21, 2240...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 "best matching key" for a given key in a sorted STL container === ## Problem ## I have timestamped data, which I need to search based on the timestamp in order to get the one existing timestamp which matches my input timestamp the closest.<br> Preferably this should be solved with the STL. boost::* or stl::tr1::* (from VS9 with Featurepack) are also possible.<br> Example of timestamped data: struct STimestampedData { time_t m_timestamp; // Sorting criterion CData m_data; // Payload } ## Approach with `stl::vector`, `sort()` and `equal_range()` ## Since a `map` or `set` only allows me to find exact matches, I don't get any further using one of these. So now I have a `vector` to which I append data as it is coming in. Before searching I use `<algorithm>`'s `sort()` and supply it with a custom comparison function.<br> After that I use `<algorithm>`'s `equal_range()` to find the two neighbors of a specified value `x`. From these two values I check which one is closest to `x` and then I have my best match. <br> While this is not too complex, I wonder if there are more elegant solutions to this.<br> Maybe the STL already has an algorithm which does exactly that so I'm not re-inventing something here?
0
[ 2, 3007, 13, 7, 4936, 10120, 1246, 7, 26, 21, 504, 1246, 19, 21, 22554, 354, 255, 12147, 800, 3726, 3726, 6926, 5910, 1448, 6926, 5910, 31, 57, 436, 4919, 3631, 1054, 15, 56, 31, 376, 20, 2122, 432, 27, 14, 436, 38, 10158, 19, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Windows Server 2003 Server to Server proxy avoidance configuration === Is it possible to configure Windows Servers that reside on the same domain such that when a web service call is made from a web app using an IP address, the request does not go via a proxy server? The web service is running on one of the servers on the domain. I want to configure IP based security on the server that hosts the web service such that it only allows connections from specific servers. Currently all requests go via the proxy server rendering IPSec problematic. Within the browser I can specify that requests following a specific pattern should bypass the proxy server. It's essentially this behaviour I want to replicate with the servers. Thanks
0
[ 2, 1936, 8128, 973, 8128, 20, 8128, 27188, 26799, 8091, 800, 3726, 3726, 25, 32, 938, 20, 1065, 15951, 1936, 17595, 30, 14670, 27, 14, 205, 4603, 145, 30, 76, 21, 2741, 365, 645, 25, 117, 37, 21, 2741, 4865, 568, 40, 15735, 3218, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
MySQL Diff Tool === Does anyone know any visual MySQL diff tools? I have about 10 machines all with their own instance of MySQL. No replication is taking place, since each machine acts independently of the others. However, their table structures must be identical, and I would like a quick way to verify their table structures. I'm not so concerned about the data in the tables. However, if the tool supports table data comparisons, I'd definitely like to check that out, too. If you've worked with a good command-line tool, I'm open to that as well.
2
[ 2, 51, 18, 22402, 20811, 5607, 800, 3726, 3726, 630, 1276, 143, 186, 3458, 51, 18, 22402, 20811, 4672, 60, 31, 57, 88, 332, 6035, 65, 29, 66, 258, 4851, 16, 51, 18, 22402, 9, 90, 23841, 25, 741, 209, 15, 179, 206, 1940, 3167, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Page Management === when you open page in browser instance of page is created on server side but when you are using ajax whether object of whole page is created ?
0
[ 2, 28, 306, 9, 2328, 2478, 1097, 800, 3726, 3726, 76, 42, 368, 2478, 19, 16495, 4851, 16, 2478, 25, 679, 27, 8128, 270, 47, 76, 42, 50, 568, 20624, 1472, 3095, 16, 979, 2478, 25, 679, 13, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Customized naming of columns in JPA relationships === When I make relationsships with JPA using hibernate, some terrible long and ackward column names are generated. Eg. I have the following `actionPlan_actionPlanPK`, which means that the column `actionPlan` is a FK that points to `actionPlanPK`. To make it look just a little bit more neat in the DB I would like if I could give it a name myself, preferably just the name it has in the entity class that owns the relationship. Is this possible with JPA?
0
[ 2, 28779, 10929, 16, 7498, 19, 487, 1060, 5833, 800, 3726, 3726, 76, 31, 233, 2649, 2418, 18, 29, 487, 1060, 568, 4148, 2102, 8820, 15, 109, 5803, 175, 17, 13, 8735, 2826, 4698, 1817, 50, 6756, 9, 12369, 9, 31, 57, 14, 249, 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...
When creating forms, are fieldsets a viable option anymore? === I'm creating a few web forms that have areas to them. Are fieldsets viable options for sectioning forms anymore? Should I just use a div with styles to be similar?
0
[ 2, 76, 2936, 1997, 15, 50, 2861, 6095, 21, 17347, 4255, 3375, 60, 800, 3726, 3726, 31, 22, 79, 2936, 21, 310, 2741, 1997, 30, 57, 924, 20, 105, 9, 50, 2861, 6095, 17347, 6368, 26, 1050, 68, 1997, 3375, 60, 378, 31, 114, 275, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Suggestions please for a home version control system === I have a home project that really needs to be in Source Control. I tried installing Subversion, which I have some experience with, but couldn't get it working. I don't particularly want to use SourceSafe. I'm a bit nervous about Git/Mercury as being somewhat cryptic, although this is only based on opinion rather than my experience. Main requirements are: 1. Must be open source (well, it needs to be free but that sounds a bit 2. Must run on Win32 3. Would prefer a GUI interface if one is available Many thanks in advance!
0
[ 2, 18389, 2247, 26, 21, 213, 615, 569, 329, 800, 3726, 3726, 31, 57, 21, 213, 669, 30, 510, 2274, 20, 44, 19, 1267, 569, 9, 31, 794, 25429, 972, 10898, 15, 56, 31, 57, 109, 1496, 29, 15, 47, 711, 22, 38, 164, 32, 638, 9, 3...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I change the language in Emacs when using ispell? === I would like to use the ispell-buffer command in Emacs. It uses the english language by default. Is there an easy way to switch to another dictionary (eg another language)?
0
[ 2, 184, 92, 31, 753, 14, 816, 19, 13, 62, 6893, 18, 76, 568, 31, 23405, 60, 800, 3726, 3726, 31, 83, 101, 20, 275, 14, 31, 23405, 8, 2345, 6866, 1202, 19, 13, 62, 6893, 18, 9, 32, 2027, 14, 486, 816, 34, 12838, 9, 25, 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...
Tools for debugging xslt === I have a Java servlet which generates xml, translates it with an xslt stylesheet, and then displays the resulting HTML. This is the first time I've worked with xslt. What's a good way to debug xslt? I have (or can get) some sample XML files to apply the transform too. But I'm not really even sure of the syntax so something that would give me syntax warnings would be great.
0
[ 2, 4672, 26, 121, 16254, 2762, 993, 18, 255, 38, 800, 3726, 3726, 31, 57, 21, 8247, 13, 10321, 1336, 56, 7920, 18, 23504, 15, 18510, 32, 29, 40, 993, 18, 255, 38, 1034, 17627, 15, 17, 94, 9412, 14, 2927, 13, 15895, 9, 48, 25, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to create a repeatable signature of a data structure (Perl) === I have a situation where I want to create a signature of a data structure: my $signature = ds_to_sig( { foo => 'bar', baz => 'bundy', boing => undef, number => 1_234_567, } ); The aim should be that if the data structure changes then so should the signature. Is there an established way to do this?
0
[ 2, 184, 20, 1600, 21, 6830, 579, 7810, 16, 21, 1054, 1411, 13, 5, 1432, 255, 6, 800, 3726, 3726, 31, 57, 21, 1858, 113, 31, 259, 20, 1600, 21, 7810, 16, 21, 1054, 1411, 45, 51, 5579, 18, 2816, 20609, 800, 13, 43, 18, 1, 262,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I programatically inspect a HTML document === I have a database full of small HTML documents and I need to programatically insert several into, say, a PDF document with *iText* or a Word document with *Aspose.Words*. I need to preserve any formatting within the HTML documents (within reason, honouring &lt;b&gt; tags is a must, CSS like &lt;span style="blah"&gt; is a nice-to-have). Both iText and Aspose work (roughly) along the lines: Document document = new Document( Size.A4, Aspect.PORTRAIT ); document.setFont( "Helvetica", 20, Font.BOLD ); document.insert( "some string" ) document.setBold( true ); document.insert( "A bold string" ); Therefore (I think) I need some kind of HTML parser which will I can inspect for strings and styles to insert into my document. Can anybody suggest a good library or sensible approach to this problem? Platform is Java
0
[ 2, 184, 107, 31, 625, 721, 8438, 19, 7350, 21, 13, 15895, 4492, 800, 3726, 3726, 31, 57, 21, 6018, 503, 16, 284, 13, 15895, 4374, 17, 31, 376, 20, 625, 721, 8438, 14692, 238, 77, 15, 395, 15, 21, 13, 11124, 4492, 29, 1637, 49,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 use XML-RPC in Cocoa application? === I wanted to write a GUI-wrapper for an application which uses XML-RPC and wondered if there are any XML-RPC frameworks available for Cocoa and if so what's the best? Thanks in advance
0
[ 2, 246, 161, 20, 275, 23504, 8, 139, 5779, 19, 24507, 3010, 60, 800, 3726, 3726, 31, 417, 20, 2757, 21, 9457, 8, 499, 525, 8763, 26, 40, 3010, 56, 2027, 23504, 8, 139, 5779, 17, 3519, 100, 80, 50, 186, 23504, 8, 139, 5779, 659...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
MySQL break SP execution in an Exception like fashion === How can I break SP execution in an Exception like fashion in MySQL? I need a to break SP execution when an illegal argument is passed so no UPDATE/INSERT is performed. My teacher actually did it by creating an SP called "raise_error" which did nothing but execute a non extising table. Which I would argue is a WTF...
0
[ 2, 51, 18, 22402, 1442, 3782, 5769, 19, 40, 5391, 101, 3161, 800, 3726, 3726, 184, 92, 31, 1442, 3782, 5769, 19, 40, 5391, 101, 3161, 19, 51, 18, 22402, 60, 31, 376, 21, 20, 1442, 3782, 5769, 76, 40, 5143, 5476, 25, 1100, 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...
Running doxygen as Custom Build Step in VS2008 === I am generating doxygen documentation for my (fairly small) project on each build. I did the following to accomplish this: 1. Added the `index.html`, which doxygen generates, to the project 2. Specified a Custom Build Step for this file (not the whole project) - Command line: `doxygen ../doc/Doxyfile` - Outputs: `..doc/html/index.html` - Additional Dependencies: '../bin/foo.exe' The problem with this is, that I need to build twice until VS stops telling me that my project is out of date.<br> How can I fix this?
0
[ 2, 946, 107, 15161, 1863, 28, 5816, 1895, 1424, 19, 4611, 2753, 800, 3726, 3726, 31, 589, 13500, 107, 15161, 1863, 13945, 26, 51, 13, 5, 10487, 102, 284, 6, 669, 27, 206, 1895, 9, 31, 144, 14, 249, 20, 14570, 48, 45, 137, 9, 9...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do i stop UrlRewriter stripping my + symbols === I'm using Intelligencia's UrlRewriter in my application and I'm having a problem where the rules I've setup appear to be stripping the + symbol from my url. For example I want to have the urls `/category/catname/+tag+tag` but it appears to me as `/category/catname/ tag tag` Does anyone have any ideas and is this down to my regular expression? I've tried it in regulator and it matches fine. <rewriter> <rewrite url="^/content/(.+)$" to="~/page.aspx?name=$1" /> <rewrite url="^/category/(.+)$" to="~/catalog.aspx?category=$1" /> <rewrite url="^/product/(.+)$" to="~/catalog.aspx?product=$1" /> <rewrite url="~/login/" to="~/login.aspx"/> </rewriter>
0
[ 2, 184, 107, 31, 747, 287, 6362, 99, 9657, 25105, 51, 2754, 9794, 800, 3726, 3726, 31, 22, 79, 568, 14635, 12828, 16486, 22, 18, 287, 6362, 99, 9657, 19, 51, 3010, 17, 31, 22, 79, 452, 21, 1448, 113, 14, 1761, 31, 22, 195, 181...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Differentiating between single and double clicks in .Net === I want to override OnMouseClick and OnMouseDoubleClick and perform different actions depending on which click style was used. The problem is that OnMouseClick is happening for both single and double clicks, and is getting called before OnMouseDoubleClick. I'm certain this must be a common requirement, so I guess I'm missing something pretty obvious. Can someone fill me in? Edit to add: the MouseEventArgs.Clicks count doesn't help. In the case of a double-click, the first click is handled as a single click in OnMouseClick with MouseEventArgs.Clicks == 1. Cheers, Rob
0
[ 2, 421, 49, 1880, 128, 345, 17, 1494, 10840, 18, 19, 13, 9, 2328, 800, 3726, 3726, 31, 259, 20, 84, 11891, 27, 14002, 3319, 10129, 17, 27, 14002, 62, 14368, 150, 10129, 17, 2985, 421, 3078, 4758, 27, 56, 10840, 1034, 23, 147, 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...
Send document to printer with C# === I've been given a requirement for an internal web application to send documents to a printer transparently. The idea would be that the user can select their nearest printer, and the web application would send their print jobs to the printer they selected. The first printer we have to roll out against are Canons, so my questions is: How would I go about sending a document to print aross the network to a specific Canon? The type of Cannon is question is an iR5570 and the documents that will be said will mainly be Word and PDFs I'm currently working my way through the terrible, IE only Canon Developer site, but I'm kinda hoping someone can point me in the right direction or point me at a 3rd party assembly :)
0
[ 2, 2660, 4492, 20, 12925, 29, 272, 5910, 800, 3726, 3726, 31, 22, 195, 74, 504, 21, 8981, 26, 40, 3117, 2741, 3010, 20, 2660, 4374, 20, 21, 12925, 14862, 102, 9, 14, 882, 83, 44, 30, 14, 4155, 92, 5407, 66, 6557, 12925, 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 to query an Oracle table from SQL Server 2000? === A colleague would like to query a table in an Oracle database using SQL Server 2000, Enterprise Manager. He knows how to do the whole DTS thing, but doesn't want to go down that route for add hoc queries. Is there another way?
0
[ 2, 184, 20, 25597, 40, 15759, 859, 37, 4444, 255, 8128, 824, 60, 800, 3726, 3726, 21, 12321, 83, 101, 20, 25597, 21, 859, 19, 40, 15759, 6018, 568, 4444, 255, 8128, 824, 15, 6002, 1382, 9, 24, 3620, 184, 20, 107, 14, 979, 13, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I implement the "tap and hold" behavior in an MFC CListCtrl? === How can I implement the "tap and hold" behavior in an MFC CListCtrl? I have an MFC CListCtrl in a CDialog and I need to add to the CListCtrl the "tap and hold" behavior. That is what I mean for "tap and hold": If the user clicks (a "standard" click with the left button of the mouse) on a CListCtrl item then function A will be called. If the user click on a CListCtrl item and keep pressed down the left button of the mouse for more than one second then function B will be called.
0
[ 2, 184, 92, 31, 8713, 14, 13, 7, 38, 2552, 17, 1027, 7, 3257, 19, 40, 307, 7061, 272, 5739, 4812, 6362, 60, 800, 3726, 3726, 184, 92, 31, 8713, 14, 13, 7, 38, 2552, 17, 1027, 7, 3257, 19, 40, 307, 7061, 272, 5739, 4812, 6362...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Placement of instance variable declarations === I've seen some developers put instance variable declarations at the end of classes though I mostly see them placed at the top. The only reasons I can think of for doing this are stylistic preference or maybe it somehow makes them easier to work with in an IDE. Is there a more legitimate reason for choosing this style?
0
[ 2, 10774, 16, 4851, 7612, 7098, 18, 800, 3726, 3726, 31, 22, 195, 541, 109, 10168, 442, 4851, 7612, 7098, 18, 35, 14, 241, 16, 2684, 362, 31, 1555, 196, 105, 1037, 35, 14, 371, 9, 14, 104, 2932, 31, 92, 277, 16, 26, 845, 48, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Visual Studio jscript intellisense error with jQuery 1.2.6? === I get the warning "childNodes is null or not an object' with different line numbers, depending on which version of the library I reference (I've tried about three different versions of 1.2.6). Consequently, I get jack for jQuery intellisense. I can hack this to get it to work, but I'd rather not as I don't understand the full implications of changing the following line: elem = jQuery.makeArray(div.childNodes); to this: //HACK: VS intellisense fix if(div && div.childNodes) elem = jQuery.makeArray(div.childNodes); (The changed line only appears once in the source). What gives?
0
[ 2, 3458, 1120, 487, 8741, 14635, 3159, 6498, 7019, 29, 487, 8190, 93, 137, 9, 135, 9, 379, 60, 800, 3726, 3726, 31, 164, 14, 3590, 13, 7, 11287, 251, 3196, 25, 16203, 54, 52, 40, 3095, 22, 29, 421, 293, 2116, 15, 4758, 27, 56,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What's the best way to convert from network bitcount to netmask? === For example, if I have a network spec like 172.20.10.0/24, "224" is the bitcount. What's the best way to convert that to a netmask like 0xffffff00 ?
0
[ 2, 98, 22, 18, 14, 246, 161, 20, 8406, 37, 982, 1142, 16549, 20, 4275, 23265, 60, 800, 3726, 3726, 26, 823, 15, 100, 31, 57, 21, 982, 12737, 101, 369, 135, 9, 1323, 9, 1036, 9, 15928, 1996, 15, 13, 7, 19236, 7, 25, 14, 1142,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
A good library to do URL manipulation in Java === I need to do a few very simple URL manipulations in Java. Like get the value for a parameter in the query, or update it, ... I was expecting to find a simple utility class doing that in the commons-lang package, but no. I know it is a simple problem, but if there is something already written, why do it again ? Do you know of any ? I would like to have at least the following capabilities : String myUrl = "http://www.example.com/tes.html?toto=1&titi=2"; // get the value of a parameter String parameterValue = UrlUtils.getParameterValue(myUrl, "toto"); Assert.equals(parameterValue, "1"); // update a parameter String newUrl = UrlUtils.updateParameter(myUrl, "toto", 3); parameterValue = UrlUtils.getParameterValue(myUrl, "toto"); Assert.equals(parameterValue, "3"); Thanks for your help !
0
[ 2, 21, 254, 1248, 20, 107, 287, 6362, 17561, 19, 8247, 800, 3726, 3726, 31, 376, 20, 107, 21, 310, 253, 1935, 287, 6362, 17561, 18, 19, 8247, 9, 101, 164, 14, 1923, 26, 21, 18906, 19, 14, 25597, 15, 54, 11100, 32, 15, 13, 9, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Proper disposal of SharePoint objects? === I hope there's a SharePoint expert here on SO who can help with this. Here's the problem. My SharePoint logs contain this line, several times: `An SPRequest object was not disposed before the end of this thread. To avoid wasting system resources, dispose of this object or its parent (such as an SPSite or SPWeb) as soon as you are done using it. This object will now be disposed. Allocation Id: {8D090AD2-5D55-42C2-9873-2D5486FE257C} To determine where this object was allocated, create a registry key at HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Shared Tools\Web Server Extensions\HeapSettings. Then create a new DWORD named SPRequestStackTrace with the value 1 under this key.` That's all well and good, except I can't create a Registry entry on our production server, and this problem only occurs in Production, not in Staging or Development. As the problem gets worse, I see this: `67 heaps created, above warning threshold of 32. Check for excessive SPWeb or SPSite usage.` That value of "67" fluctuates higher and lower. I checked all of our code and we've employed the `using` pattern for the SPWeb and SPSite objects, so they're all safely disposed: `using (SPSite mySite = new SPSite(url)) { myWeb = mySite.OpenWeb(); }` Am I missing something? Is there some gotcha in there that I didn't catch? Is there a way to figure out where the undisposed object is being used without editing the Registry? EDIT: I looked at `myWeb` a little closer and I realized it's an SPWeb implemented like so: SPWeb myWeb = null; using (SPSite mySite = new SPSite(url)) { myWeb = mySite.OpenWeb(); } Could that be the problem? It looks like myWeb isn't being disposed.
0
[ 2, 4119, 13497, 16, 1891, 3132, 3916, 60, 800, 3726, 3726, 31, 1376, 80, 22, 18, 21, 1891, 3132, 5390, 235, 27, 86, 72, 92, 448, 29, 48, 9, 235, 22, 18, 14, 1448, 9, 51, 1891, 3132, 18893, 3717, 48, 293, 15, 238, 436, 45, 13...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Getting method parameter names in python === Given the python function: def aMethod(arg1, arg2): pass How can I extract the number and names of the arguments. Ie. given that I have a reference to func, I want the func.[something] to return ("arg1", "arg2") The usage scenario for this is that I have a decorator, and I wish to use the method arguments in the same order that they appear for the actual function as a key. Ie. how would the decorator look that printed "a,b" when I call aMethod("a","b")
0
[ 2, 1017, 2109, 18906, 1817, 19, 20059, 800, 3726, 3726, 504, 14, 20059, 1990, 45, 6312, 589, 6268, 5648, 5, 10663, 165, 15, 13, 10663, 135, 6, 45, 1477, 184, 92, 31, 10962, 14, 234, 17, 1817, 16, 14, 10553, 9, 13, 660, 9, 504, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 use monospace fonts in your IDE? === I've seen a couple of font topics on SO and it seems a majority of people use monospace fonts for programming tasks. I have been using Verdana for programming for a couple of years and I really like the enhanced readability, without really missing anything monospace related. Any monospacers care to elaborate why they like it?
4
[ 2, 483, 275, 4129, 5582, 9978, 18, 19, 154, 13, 3448, 60, 800, 3726, 3726, 31, 22, 195, 541, 21, 1335, 16, 9978, 7569, 27, 86, 17, 32, 2206, 21, 1698, 16, 148, 275, 4129, 5582, 9978, 18, 26, 3143, 8674, 9, 31, 57, 74, 568, 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 do I need to be cautious of when creating a user-content driven site? === I'm slowly but surely working on a site using ASP.NET MVC which will contain a bunch of user-generated content, such as submitted links, comments, markers on a map etc. I need to know what stuff I need to be mindful off when coding. Examples being scrubbing User inputs for HTML strings like the script tag, and blocking against SQL injection attacks. What other key things do I need to be cautious of when considering user input? Also, are there any readily available algorithms to scrub (and deny) inputs for rude words / porn links etc? Additionally, what's the best way to do moderation? I'm a lone-developer and doing this in my spare time so I can't afford to be a full-time moderator, and I'd prefer to implement self-moderation for the users, does this work well? If I was to want a forum, how important is it that I moderate forum posts, and can they be self-moderating? How much professional moderation is required in StackOverflow for example? Thanks for any input
0
[ 2, 98, 107, 31, 376, 20, 44, 19747, 16, 76, 2936, 21, 4155, 8, 25424, 5355, 689, 60, 800, 3726, 3726, 31, 22, 79, 1447, 47, 7608, 638, 27, 21, 689, 568, 28, 306, 9, 2328, 307, 8990, 56, 129, 3717, 21, 7653, 16, 4155, 8, 2531...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 I exclude files by name in a ClearCase find command? === Using the ClearCase find command, how do I find all files in a directory that do not have the name pom.xml? I am using a RedHat linux version of ClearCase. I have tried "cleartool find \! -name pom.xml -print" and that does not work.
0
[ 2, 184, 20, 31, 21077, 6488, 34, 204, 19, 21, 1207, 10325, 477, 1202, 60, 800, 3726, 3726, 568, 14, 1207, 10325, 477, 1202, 15, 184, 107, 31, 477, 65, 6488, 19, 21, 16755, 30, 107, 52, 57, 14, 204, 16214, 9, 396, 8184, 60, 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...
For those of you using SubSonic, what kind of performance are you seeing in large applications? === I've used SubSonic in a few POC projects, but nothing large. It's so easy to use, and it's possible to abstract away the fact that it uses the active record pattern (can move it toward a more domain driven approach). Has anyone on here used SubSonic on larger applications, and what kind of performance did you witness? Was your experience worth it overall?
0
[ 2, 26, 273, 16, 42, 568, 972, 17766, 15, 98, 825, 16, 956, 50, 42, 2078, 19, 370, 3767, 60, 800, 3726, 3726, 31, 22, 195, 147, 972, 17766, 19, 21, 310, 13, 23093, 2314, 15, 47, 626, 370, 9, 32, 22, 18, 86, 2010, 20, 275, 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...
Catch a Paste Event? === I work for a custom cabinetry manufacturer and we write our own pricing program for our product. I have a form that has a pop-up box so the user can select which side the hinge will be on for ambiguous doors on that cabinet. I've got that to work so far, but when they copy an item and paste it at the bottom I don't want the pop-up box to come up. Is there any way in Access VBA to know whether the new record is being pasted or entered manually?
0
[ 2, 2949, 21, 640, 62, 807, 60, 800, 3726, 3726, 31, 170, 26, 21, 5816, 3413, 622, 7094, 17, 95, 2757, 318, 258, 24318, 625, 26, 318, 2374, 9, 31, 57, 21, 505, 30, 63, 21, 1675, 8, 576, 1649, 86, 14, 4155, 92, 5407, 56, 270, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Possible to test if regex is valid without throwing exception === I allow users to enter a regular expression to match IP addresses, for doing an IP filtration in a related system. I would like to validate if the entered regular expressions are valid as a lot of userse will mess op, with good intentions though. I can of course do a Regex.IsMatch() inside a try/catch and see if it blows up that way, but are there any smarter ways of doing it? Speed is not an issue as such, I just prefer to avoid throwing exceptions for no reason.
0
[ 2, 938, 20, 1289, 100, 7953, 1706, 25, 7394, 366, 6033, 5391, 800, 3726, 3726, 31, 1655, 3878, 20, 2830, 21, 1290, 1803, 20, 730, 15735, 12636, 15, 26, 845, 40, 15735, 13, 21845, 19, 21, 1597, 329, 9, 31, 83, 101, 20, 7394, 1373...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Opening XPS document in .Net causes a memory leak === The following code snippet illustrates a memory leak when opening XPS files. If you run it and watch the task manager, it will grow and not release memory until the app exits. '****** Console application BEGINS. Module Main Const DefaultTestFilePath As String = "D:\Test.xps" Const DefaultLoopRuns As Integer = 1000 Public Sub Main(ByVal Args As String()) Dim PathToTestXps As String = DefaultTestFilePath Dim NumberOfLoops As Integer = DefaultLoopRuns If (Args.Count >= 1) Then PathToTestXps = Args(0) If (Args.Count >= 2) Then NumberOfLoops = CInt(Args(1)) Console.Clear() Console.WriteLine("Start - {0}", GC.GetTotalMemory(True)) For LoopCount As Integer = 1 To NumberOfLoops Console.CursorLeft = 0 Console.Write("Loop {0:d5}", LoopCount) ' The more complex the XPS document and the more loops, the more memory is lost. Using XPSItem As New Windows.Xps.Packaging.XpsDocument(PathToTestXps, System.IO.FileAccess.Read) Dim FixedDocSequence As Windows.Documents.FixedDocumentSequence ' This line leaks a chunk of memory each time, when commented out it does not. FixedDocSequence = XPSItem.GetFixedDocumentSequence End Using Next Console.WriteLine() GC.Collect() ' This line has no effect, I think the memory that has leaked is unmanaged (C++ XPS internals). Console.WriteLine("Complete - {0}", GC.GetTotalMemory(True)) Console.WriteLine("Loop complete but memory not released, will release when app exits (press a key to exit).") Console.ReadKey() End Sub End Module '****** Console application ENDS. The reason it loops a thousand times is because my code processes lots of files and leaks memory quickly forcing an OutOfMemoryException. Forcing Garbage Collection does not work (I suspect it is an unmanaged chunk of memory in the XPS internals). The code was originally in another thread and class but has been simplified to this. Any help greatly appreciated. Ryan
0
[ 2, 1214, 23045, 18, 4492, 19, 13, 9, 2328, 4047, 21, 1912, 11724, 800, 3726, 3726, 14, 249, 1797, 13, 29061, 15620, 18, 21, 1912, 11724, 76, 1214, 23045, 18, 6488, 9, 100, 42, 485, 32, 17, 1455, 14, 3005, 1382, 15, 32, 129, 3213...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Are there any control libraries for Windows Mobile that enable iPhone-style touchscreen behavior? === The way the iPhone uses the touchscreen to enable zooming in and out and scrolling and so forth is very cool, and I was wondering if there is anything available for Windows Mobile that provides a similar user experience.
0
[ 2, 50, 80, 186, 569, 8649, 26, 1936, 3241, 30, 9240, 21024, 8, 4381, 1723, 7187, 3257, 60, 800, 3726, 3726, 14, 161, 14, 21024, 2027, 14, 1723, 7187, 20, 9240, 19469, 68, 19, 17, 70, 17, 13, 28166, 17, 86, 5882, 25, 253, 2700, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Cloning Objects in VBA? === Is there a generic way to clone objects in VBA? So that i could copy x to y instead of copying just the pointer? Dim x As New Class1 Dim y As Class1 x.Color = 1 x.Height = 1 Set y = x y.Color = 2 Debug.Print "x.Color=" & x.Color & ", x.Height=" & x.Height By generic i mean something like `Set y = CloneObject(x)` rather than having to create my own method for the class copying it's properties one by one.
0
[ 2, 19226, 68, 3916, 19, 566, 969, 60, 800, 3726, 3726, 25, 80, 21, 12733, 161, 20, 13871, 3916, 19, 566, 969, 60, 86, 30, 31, 110, 4344, 993, 20, 13, 93, 700, 16, 4344, 68, 114, 14, 454, 106, 60, 5937, 993, 28, 78, 718, 165,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Your choice of cross-browser javascript GUI === There are a number of great and not so-great Javascript GUI frameworks out there. I've looked at some (only superficially). And I can't make my mind about any of them - [Ext.js][1] The obvious choice by many since it's one of the most known frameworks. *Advantages:* Looks [awesome][6], large community, lots of extensions/plugins, GPL'ed *Disadvanatges:* Inability to use third-party extensions with commercial license (and some of those extensions have killer features) - [Backbase][2] Relatively less known. A curious mix of XML and Javascript that is reminiscent of XUL. However, it's already cross-browser *Advantages:* Looks [good][7], very extensible, allows easy incorporation of [some really neat stuff][8] *Disadvantages:* Pricing is steep and CPU-bound (though free to use on up to 2 CPUs), forums are slow to respond (though commercial support is supposedly fast) - [qooxdoo][3] Also very popular. *Advantages:* *Please, fill in* *Disadvantages:* Code is slighly messy (based on hearsay) - [YUI][4] *Fill in description* *Advantages:* *Please, fill in* *Disadvantages:* *Many widgets still in beta* - [Dojo][5] *Fill in description* *Advantages:* *Please, fill in* *Disadvantages:* *Many widgets still in beta* - [jQuery UI][9] *Advantages:* Widgets not dependent on each other *Disadvantages:* In an early stage of development, very few widgets --- What say you? What do you use and why? What would you rather use and why? In any kind of project [1]: http://extjs.org/ [2]: http://backbase.com/ [3]: http://qooxdoo.org/ [4]: http://developer.yahoo.com/yui [5]: http://dojotoolkit.org/ [6]: http://extjs.com/products/extjs/ [7]: http://demo.backbase.com/explorer/index.html#|examples/welcome.xml [8]: http://bdn.backbase.com/blog/rus/advanced-3d-animations-and-transitions [9]: http://ui.jquery.com/
4
[ 2, 154, 1837, 16, 919, 8, 25699, 4104, 8247, 8741, 9457, 800, 3726, 3726, 80, 50, 21, 234, 16, 374, 17, 52, 86, 8, 6894, 8247, 8741, 9457, 6596, 18, 70, 80, 9, 31, 22, 195, 292, 35, 109, 13, 5, 4965, 22487, 102, 6, 9, 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...
Open-source pastebin in Python or Perl === I'm looking for an open-source pastebin web-application written in either Python or Perl. I need it in order to implement a web-based specialized editor for my own needs, and I want to borrow code / ideas from the pastebin since I don't have much experience in web programming. Can you point to one (or a few) ? Thanks in advance
0
[ 2, 368, 8, 12097, 640, 62, 4772, 19, 20059, 54, 416, 255, 800, 3726, 3726, 31, 22, 79, 699, 26, 40, 368, 8, 12097, 640, 62, 4772, 2741, 8, 2552, 20669, 642, 19, 694, 20059, 54, 416, 255, 9, 31, 376, 32, 19, 389, 20, 8713, 21...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How should I audit changes in a MySQL table? === I have been asked to audit any/all changes in a MySQL table. Does anyone know of any tools out there to help me do this or do I need to write my own solution? If I write my own audting, my initial thought it to make a separate table and build a string of changes in the PHP code. Something like "fieldname1 -> oldvalue | fieldname2 -> oldvalue, ...". If you see a major problem with this method, please let me know.
0
[ 2, 184, 378, 31, 13471, 1693, 19, 21, 51, 18, 22402, 859, 60, 800, 3726, 3726, 31, 57, 74, 411, 20, 13471, 186, 118, 1233, 1693, 19, 21, 51, 18, 22402, 859, 9, 630, 1276, 143, 16, 186, 4672, 70, 80, 20, 448, 55, 107, 48, 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...
VB.NET COMException Error === I have written an application in VB.NET using MS Visual Studio 2005. I am using .NET version '2.0.50727'. The application was running without errors until recently. After being used for a while it begins to produce a System.Runtime.InteropServices.COMException error (80080005). The error happens when I make a call to produce an instance of another external application. Once this error has occurred it never goes away, occurring each time my application is opened. This error breaks the functionality of my program because it is reliant on the 2nd application it is calling. I am not sure what starts this error to occurring but I do know that it is user specific and not the application. It appears to be something that occurs in the user's Windows profile. I can use a different user on the same machine or create a new profile for the user with the issue and the program will work without error for a while. Eventually (within a few weeks) the error will return and stay until I resolve it again. I am trying to debug the COM error to understand why this is happening but this is such strange behavior I'm not sure where to start. I've never seen an error that would wire itself into a profile and cause it to be persistent. I don't have a lot of .NET experience but I have done a lot of VB 6 application programming. Please offer any suggestions you have. Your help is greatly appreciated. Thank You.
0
[ 2, 13, 20468, 9, 2328, 13, 960, 10066, 872, 7019, 800, 3726, 3726, 31, 57, 642, 40, 3010, 19, 13, 20468, 9, 2328, 568, 4235, 3458, 1120, 812, 9, 31, 589, 568, 13, 9, 2328, 615, 13, 22, 135, 9, 387, 9, 264, 2984, 2567, 22, 9,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I execute code AFTER a form has loaded? === In .NET, Windows Forms have an event that fires before the Form is loaded (Form.Load), but there is no corresponding event that is fired AFTER the form has loaded. I would like to execute some logic after the form has loaded. Can anyone advise on a solution?
0
[ 2, 184, 107, 31, 15644, 1797, 75, 21, 505, 63, 8572, 60, 800, 3726, 3726, 19, 13, 9, 2328, 15, 1936, 1997, 57, 40, 807, 30, 11327, 115, 14, 505, 25, 8572, 13, 5, 4190, 9, 8294, 6, 15, 47, 80, 25, 90, 7265, 807, 30, 25, 389...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Javascript before asp:ButtonField click === I have a "GridView" control in an Asp.net application, that has a <asp:buttonField> of type="image" and CommandName="Delete". Is there any way to execute a piece of javascript before reaching the "OnRowDelete" event? I want just a simple confirm before deleting the row. Thanks!
0
[ 2, 8247, 8741, 115, 28, 306, 45, 811, 444, 1109, 10840, 800, 3726, 3726, 31, 57, 21, 13, 7, 16375, 4725, 7, 569, 19, 40, 28, 306, 9, 2328, 3010, 15, 30, 63, 21, 13, 1, 472, 306, 45, 811, 444, 1109, 1, 16, 1001, 3726, 7, 22...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
JIRA issue resolver === I'm using the standard edition of JIRA and on the whole, I love it. However, it's a frequent source of irritation that JIRA doesn't seem to record who resolved an issue, just who the current assignee is, and who reported the issue. Because the "resolver" is not recorded there's no way to find issues that I resolved, or issues that were not resolved by me (e.g. when looking for issues to test). Is there a configuration option somewhere that "turns on" resolver tracking? Cheers, Don
0
[ 2, 487, 3517, 1513, 9854, 139, 800, 3726, 3726, 31, 22, 79, 568, 14, 1236, 1322, 16, 487, 3517, 17, 27, 14, 979, 15, 31, 339, 32, 9, 207, 15, 32, 22, 18, 21, 5408, 1267, 16, 19399, 30, 487, 3517, 1437, 22, 38, 2260, 20, 571,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 reasons to prohibit inheritance in Java? === What are good reasons to prohibit inheritance in Java, for example by using final classes or classes using a single, private default constructor? What are good reasons of making a method final?
0
[ 2, 254, 2932, 20, 895, 8630, 242, 13852, 19, 8247, 60, 800, 3726, 3726, 98, 50, 254, 2932, 20, 895, 8630, 242, 13852, 19, 8247, 15, 26, 823, 34, 568, 426, 2684, 54, 2684, 568, 21, 345, 15, 932, 12838, 6960, 248, 60, 98, 50, 25...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
How to change Text Rotation Axis === I am using CGContextShowText to display text, but when rotation using CGAffineTransformation, the rotation axis is located at the left, not at the center of the drawn text, the code I am using is this: CGContextSaveGState(context); CGContextSelectFont(context, "Helvetica", 20, kCGEncodingMacRoman); CGContextSetCharacterSpacing (context, 1); CGContextSetRGBFillColor (context, 0, 0, 0, 1); CGAffineTransform xform = CGAffineTransformMake( sin(DegreesToRadians(angle)), cos(DegreesToRadians(angle)), cos(DegreesToRadians(angle)), -sin(DegreesToRadians(angle)), 0, 0); CGContextSetTextDrawingMode (context, kCGTextFill); CGPoint degreeDisplayPoint = CGPointMake(100,100); CGContextShowTextAtPoint(context, degreeDisplayPoint.x, degreeDisplayPoint.y, [angleStringWithDegree cStringUsingEncoding:NSMacOSRomanStringEncoding], [angleStringWithDegree length]); CGContextRestoreGState(context); Any ideas. Thanks for your help.
0
[ 2, 184, 20, 753, 1854, 9431, 8577, 800, 3726, 3726, 31, 589, 568, 13, 15123, 1126, 11969, 9303, 11969, 20, 3042, 1854, 15, 47, 76, 9431, 568, 13, 15123, 19704, 62, 7028, 4190, 857, 15, 14, 9431, 8577, 25, 335, 35, 14, 225, 15, 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 do you keep non-floated parents from collapsing? === Although elements like `<div>`s normally grow to fit their contents, using the `float` property can cause a startling problem for CSS newbies: **if floated elements have non-floated parent elements, the parent will collapse.** For example: <div> <div style="float: left;">Div 1</div> <div style="float: left;">Div 2</div> </div> The parent div in this example will **not expand** to contain its floated children - it will appear to have `height: 0`. #How do you solve this problem?# *I would like to create an exhaustive list of solutions here. If you're aware of cross-browser compatibility issues, please point them out.* ##Solution 1 Float the parent. <div style="float: left;"> <div style="float: left;">Div 1</div> <div style="float: left;">Div 2</div> <div class="spacer" style="clear: both;"></div> </div> **Pros**: Semantic code. **Cons**: You may not always want the parent floated. Even if you do, do you float the parents' parent, and so on? Must you float every ancestor element? ##Solution 2 Give the parent an explicit height. <div style="height: 300px;"> <div style="float: left;">Div 1</div> <div style="float: left;">Div 2</div> </div> **Pros**: Semantic code. **Cons**: Not flexible - if the content changes or the browser is resized, the layout will break. ##Solution 3 Append a "spacer" element inside the parent element, like this: <div> <div style="float: left;">Div 1</div> <div style="float: left;">Div 2</div> <div class="spacer" style="clear: both;"></div> </div> **Pros**: Straightforward to code. **Cons**: Not semantic; the spacer div exists only as a layout hack. ##Solution 4 Set parent to `overflow: auto`. <div style="overflow: auto;"> <div style="float: left;">Div 1</div> <div style="float: left;">Div 2</div> </div> **Pros**: Doesn't require extra div. **Cons**: Seems like a hack - that's not the `overflow` property's stated purpose. #Comments? Other suggestions?
0
[ 2, 184, 107, 42, 643, 538, 8, 14712, 1669, 1144, 37, 24898, 60, 800, 3726, 3726, 419, 2065, 101, 13, 1, 12916, 1, 18, 4147, 3213, 20, 2742, 66, 8478, 15, 568, 14, 13, 1, 14712, 721, 1, 1354, 92, 1679, 21, 21507, 1448, 26, 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...
When to use a private constant? === Is it right to use a private constant in the following situation: Say I have a game with a lives variable and a startingLives variable. At the start of the game I set the lives variable to equal the startingLives variable. This is how I would normally do it: private var lives:int = 0; private var startingLives:int = 3; private function startGame():void { lives = startingLives; } (example code is ActionScript btw) My question is - should this really be: private var lives:int = 0; private const STARTING_LIVES:int = 3; private function startGame():void { lives = STARTING_LIVES; } StartingLives seems unlikely to change at runtime, so should I use a const, and change back to a variable if it turns out not to be constant?
0
[ 2, 76, 20, 275, 21, 932, 3587, 60, 800, 3726, 3726, 25, 32, 193, 20, 275, 21, 932, 3587, 19, 14, 249, 1858, 45, 395, 31, 57, 21, 250, 29, 21, 1551, 7612, 17, 21, 1422, 5928, 18, 7612, 9, 35, 14, 799, 16, 14, 250, 31, 309, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there a benefit to JUST a "throw" in a catch? === Been having a "heated debate" with a colleague about his practice of wrapping most of his functions in a try/catch but the catch has JUST a "throw" in it e.g. Private sub foo() try 'Do something catch throw 'And nothing else! End Try End Sub My thought was to not even bother (assuming you don't need to do anything at this point) - the exception would bubble to the next exception handler in a parent member. The only argument that sounded plausible was that sometimes exceptions weren't caught and your code stopped (in debug mode) with the current line highlighted in green...and that this may be something to do with multiple threads? Best practice does state "an exception handler for each thread" but mostly we work single-threaded. The good thing may be it could be useful in debug mode to not suddenly pop out to a parent member (yes, Joel!) - you'd move to the "throw" statement and be able to examine your locals. But then your code would be "littered with try/catch/throws" (to quote another thread here)? And what sort of overhead would be involved in adding try/catch/throws everywhere if no exception occurs (i.e. should you avoid try/catches in tight loops)?
0
[ 2, 25, 80, 21, 4234, 20, 114, 21, 13, 7, 21440, 7, 19, 21, 2949, 60, 800, 3726, 3726, 74, 452, 21, 13, 7, 438, 1669, 4503, 7, 29, 21, 12321, 88, 33, 1345, 16, 13437, 127, 16, 33, 3719, 19, 21, 1131, 118, 18208, 47, 14, 294...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Concurrent programming c++? === I keep on hearing about concurrent programing every where. Can you guys throw some light on what it's and how c++ new standards facilitate doing the same?
0
[ 2, 19513, 3143, 272, 20512, 60, 800, 3726, 3726, 31, 643, 27, 3229, 88, 19513, 625, 68, 352, 113, 9, 92, 42, 2776, 3814, 109, 471, 27, 98, 32, 22, 18, 17, 184, 272, 20512, 78, 3364, 9681, 845, 14, 205, 60, 3, 0, 0, 0, 0, 0...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Is there a way to use jQuery's serialize form fields and trim the value in the fields? === I have a form that uses jQuery to submit an ajax post and it serializes the form that is sent up. The code looks like this: var form = $("form"); var action = form.attr("action"); var serializedForm = form.serialize(); $.post(action, serializedForm, function(data) { ... }); The problem here is that if a field has trailing white space, the serialize function will turn those spaces to plus (+) signs, when they should be stripped. Is there a way to get the fields trimmed **without** doing the following: $("#name").val( jQuery.trim( $("#name") ) );
0
[ 2, 25, 80, 21, 161, 20, 275, 487, 8190, 93, 22, 18, 5956, 2952, 505, 2861, 17, 8971, 14, 1923, 19, 14, 2861, 60, 800, 3726, 3726, 31, 57, 21, 505, 30, 2027, 487, 8190, 93, 20, 12298, 40, 20624, 678, 17, 32, 5956, 13569, 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...
In javascript how can we identify whether an object is a Hash or an Array? === The output of my JSON call can either be an Array or a Hash. How do I distinguish between these two?
0
[ 2, 19, 8247, 8741, 184, 92, 95, 5808, 1472, 40, 3095, 25, 21, 19170, 54, 40, 7718, 60, 800, 3726, 3726, 14, 5196, 16, 51, 487, 528, 645, 92, 694, 44, 40, 7718, 54, 21, 19170, 9, 184, 107, 31, 9705, 128, 158, 81, 60, 3, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
What is the right info to cache? Whats a good page load time? === I'm in the process of developing a social network site. And been thinking of scalability from day one of the project, I've fine tuned the site and queries to the best of my ability. However; Certain pages are very data heavy and I'm not quite sure if they are loading as fast as they could so I was thinking of implementing a distributed caching solution. But not quite sure what I should cache and not cache. Or if current page load times of 1 second is good or bad. The heaviest query is grabbing member information this query gets all the member's info and anything related to them such as in this site's case their goals, blog type entries, encouragements, photos, status updates (like twitter), blog info (for crossposting their entries) etc etc. Anyhow, should I cache this info? And do you think 1 second page load times are reasonably fast? Some pages are less than a second between 4-6 10ths of a second.
0
[ 2, 98, 25, 14, 193, 15404, 20, 16522, 60, 98, 18, 21, 254, 2478, 6305, 85, 60, 800, 3726, 3726, 31, 22, 79, 19, 14, 953, 16, 3561, 21, 668, 982, 689, 9, 17, 74, 1440, 16, 18957, 4091, 37, 208, 53, 16, 14, 669, 15, 31, 22, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do the ExceptionSorter classes in JBoss work? === I am wondering how the JBoss ExceptionSorter classes are able to check for database errors. The application (the EJB or persistence framework) is holding the reference to the database Connection, so SQLExceptions are caught by the application. How is JBoss able to see the contents of the exception? Does JBoss wrap the connection and intercept these messages or something like that?
0
[ 2, 184, 107, 14, 13392, 248, 815, 2684, 19, 487, 10349, 18, 170, 60, 800, 3726, 3726, 31, 589, 5712, 184, 14, 487, 10349, 18, 13392, 248, 815, 2684, 50, 777, 20, 2631, 26, 6018, 11908, 9, 14, 3010, 13, 5, 124, 13, 10022, 220, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
C# ADO.NET: nulls and DbNull -- is there more efficient syntax? === I've got a `DateTime?` that I'm trying to insert into a field using a `DbParameter`. I'm creating the parameter like so: DbParameter datePrm = updateStmt.CreateParameter(); datePrm.ParameterName = "@change_date"; And then I want to put the value of the `DateTime?` into the `dataPrm.Value` while accounting for `null`s. I thought initially I'd be clever: datePrm.Value = nullableDate ?? DBNull.Value; but that fails with the error > Operator '??' cannot be applied to operands of type 'System.DateTime?' and 'System.DBNull' So I guess that only works if the second argument is a non-nullable version of the first argument. So then I went for: datePrm.Value = nullableDate.HasValue ? nullableDate.Value : DBNull.Value; but that doesn't work either: > Type of conditional expression cannot be determined because there is no implicit conversion between 'System.DateTime' and 'System.DBNull' But I don't want to convert between those types! So far the only thing I can get to work is: if (nullableDate.HasValue) datePrm.Value = nullableDate.Value; else datePrm.Value = DBNull.Value; Is that really the only way I can write this? Is there a way to get a one-liner using the ternary operator to work?
0
[ 2, 272, 5910, 21, 537, 9, 2328, 45, 16203, 18, 17, 13, 9007, 4215, 211, 13, 8, 8, 25, 80, 91, 8243, 22649, 60, 800, 3726, 3726, 31, 22, 195, 330, 21, 13, 1, 8209, 891, 60, 1, 30, 31, 22, 79, 749, 20, 14692, 77, 21, 575, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
jmock mocking a static method === I have a static method in my code that I would like somehow to mock. I am using jmock. One way I suppose I could do this is to have "wrapper class" around the static method and mock this but I was hoping for a better solution. I am going about this the wrong way?
0
[ 2, 487, 79, 5668, 18446, 21, 12038, 2109, 800, 3726, 3726, 31, 57, 21, 12038, 2109, 19, 51, 1797, 30, 31, 83, 101, 3625, 20, 10506, 9, 31, 589, 568, 487, 79, 5668, 9, 53, 161, 31, 5787, 31, 110, 107, 48, 25, 20, 57, 13, 7, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I check my .NET assembly for freshness? === All, I'm working on a SharePoint project, but this isn't a SharePoint-specific question per-se. I have an assembly I've deployed to a SharePoint farm, and I'd like to verify whether my "newest version" is sitting in the GAC, or if an older version from late yesterday is sitting there instead. This is a test farm, so yes, we are revving versions constantly. Without doing anything crazy like changing the assembly version itself every time I compile*, is there some assembly property I can check (or set at compile-time)? *I should clarify, in SharePoint projects we hardcode the assembly's full name in multiple places (including XML files), so changing the assembly version is a less savory option than you might think.
0
[ 2, 184, 92, 31, 2631, 51, 13, 9, 2328, 1475, 26, 3180, 720, 60, 800, 3726, 3726, 65, 15, 31, 22, 79, 638, 27, 21, 1891, 3132, 669, 15, 47, 48, 2532, 22, 38, 21, 1891, 3132, 8, 9219, 1301, 416, 8, 870, 9, 31, 57, 40, 1475, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
VS2005 IDE: Automatically accept code change suggestions? === I'm pasting test data from a SQL results into my code. I'm using the SQL results to manually populate a strongly typed dataset. However, the data types need to be casted to the correct data types. VS2005 tells me that I need to cast each field as an int, decimal, date, etc., but I'd rather not have to click this hundreds of times or manually write the casts each time. Is there a shortcut to do something like navigate to the next error, then another shortcut to accept the code suggestion?
0
[ 2, 4611, 2835, 13, 3448, 45, 7499, 3440, 1797, 753, 18389, 60, 800, 3726, 3726, 31, 22, 79, 640, 68, 1289, 1054, 37, 21, 4444, 255, 1736, 77, 51, 1797, 9, 31, 22, 79, 568, 14, 4444, 255, 1736, 20, 23671, 1675, 12383, 21, 5020, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Assigning TCP/IP Ports for In-House Application Use === I've written a WCF Service hosted by a Windows Service and it needs to listen on a known TCP/IP port. From what range can I safely allocate a port for use within my organization? That port will be embedded in the config files for the service and the clients that are consuming the service.
0
[ 2, 13952, 68, 13, 38, 7439, 118, 4307, 9551, 26, 19, 8, 1682, 3010, 275, 800, 3726, 3726, 31, 22, 195, 642, 21, 11801, 410, 365, 2812, 34, 21, 1936, 365, 17, 32, 2274, 20, 3834, 27, 21, 167, 13, 38, 7439, 118, 4307, 1295, 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...
Defining a catch-all route for an MVC site === Scenario: A news site with article tagged in categories. My Controller is called "Category" and this URL : http://mysite.com/Category/Sport passes "Sport" to action "Index" in controller "Category" What I want to do is allow URLs like : <br /> http://mysite.com/Sport/Hockey<br /> http://mysite.com/Sport/Football<br /> http://mysite.com/Science/Evolution<br /> <br /> Which passes all category info to action "Index" in controller "Category". Basically I need to create a catch-all route that handles nearly all site requests. Thanks in advance. Wayne
0
[ 2, 14684, 21, 2949, 8, 1233, 858, 26, 40, 307, 8990, 689, 800, 3726, 3726, 12705, 45, 21, 996, 689, 29, 2002, 27945, 19, 6422, 9, 51, 9919, 25, 227, 13, 7, 14375, 93, 7, 17, 48, 287, 6362, 13, 45, 7775, 6903, 915, 9097, 9, 9...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Design decision: Dynamically adding data question. === I need to give users the ability to optionally add metadata to documents. Another way to state this is the fact that users need to add at least 5 categories to a document. Basically what I want to do is dynamically add metadata (or categories) to a document on an ad hoc basis. Here are the options that I have thought of: **Option 1:** Should I do this by dynamically creating new table columns in the database? **Option 2:** Should I define 5 columns called attirbute1,attirbute2,attirbute3,attirbute4,attirbute5 and then only use and show them if the user requires the attributes. **Option 3:** Should I create a metadata table that keeps track of the columns and the data associated with them? What do you think is the best way to achieve this? Can you think of any other ways to easily add this functionality. The problem is that the functionality needs to be very generic.
0
[ 2, 704, 1401, 45, 7782, 1326, 4721, 1054, 1301, 9, 800, 3726, 3726, 31, 376, 20, 590, 3878, 14, 2165, 20, 12832, 102, 3547, 28057, 20, 4374, 9, 226, 161, 20, 146, 48, 25, 14, 837, 30, 3878, 376, 20, 3547, 35, 639, 331, 6422, 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...
Using AdjustTokenPrivileges securely/robustly? === I'm just writing some code that enables the SeDebugName privilege in Windows, using AdjustTokenPrivileges. A couple of things occur to me: * What's the scope of the token? Is it per-process, or per-thread? If I enable a privilege, is that privilege enabled for just this thread, or for the entire process (or for the entire session)? * If the scope is wider than just the thread, how do I avoid race conditions when enabling or disabling it?
0
[ 2, 568, 14328, 262, 2853, 6944, 9638, 12906, 18, 4315, 102, 118, 661, 3822, 38, 102, 60, 800, 3726, 3726, 31, 22, 79, 114, 1174, 109, 1797, 30, 14645, 14, 13, 18, 13528, 16254, 7259, 16575, 19, 1936, 15, 568, 14328, 262, 2853, 694...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Will MS Visual Studio 2008 show help on my own functions if I use Javadoc style comments for them? === For example in C# or in JavaScript documents. If not, is there point in using [Javadoc][1] comments in ASP.NET programming? [1]: http://en.wikipedia.org/wiki/Javadoc
0
[ 2, 129, 4235, 3458, 1120, 570, 298, 448, 27, 51, 258, 3719, 100, 31, 275, 8247, 13799, 1034, 7534, 26, 105, 60, 800, 3726, 3726, 26, 823, 19, 272, 5910, 54, 19, 8247, 8741, 4374, 9, 100, 52, 15, 25, 80, 454, 19, 568, 636, 1004...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 display mysql data in row span using PHP? === I have data from MySQL showing all organisations a customer got, with all details of employess in each organisation. I want to list each organisation name only once i.e. in a single cell ( row span) and all employees in that organisation against this name like: Org1 Emp1 Name, Emp1 Phone, Emp1 Address Emp2 Name, Emp2 Phone, Emp2 Address Org2 Emp1 Name, Emp1 Phone, Emp1 Address Emp2 Name, Emp2 Phone, Emp2 Address How do I display this data because the number of employess for each organisation is not known in advanced, so I do'nt about setting value of rowspan. Similarly how do I start a row for other organisation? Do I have to write two queries? Many Thanks.
0
[ 2, 184, 107, 31, 3042, 51, 18, 22402, 1054, 19, 3131, 6289, 568, 13, 26120, 60, 800, 3726, 3726, 31, 57, 1054, 37, 51, 18, 22402, 3187, 65, 8626, 21, 7705, 330, 15, 29, 65, 3289, 16, 13125, 160, 18, 19, 206, 4080, 9, 31, 259, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
HTML Links and Usability === Should links on a web page ALWAYS be underlined?<br /> I do not believe this should be a Hard and Fast RULE!<br /> I wrote a comment on my [blog][1] awhile back about this after another developer complained that I was not following web standards. It is coming up again, and I want to know what you think. Her argument was that for consistance and usability, ALL links had to be underlined ALL the time. My manager agreed, so I changed two lines in a css, and it was done. I did not mind doing the work, but I think the usability of the site is less now. There are way too many things screaming for your attention.<br /><br /> I should mention that this is a web site with many pages of data entry. The links in question were navigation links to the left of the page in a box that was titled "Menu". The underline did appear when you hovered over the link already, and the background color changed when the user hovered over the link. I really could not believe I was even having the discussion. I was even more shocked when my manager agreed.<br /><br /> Am I wrong? What other arguments should I have made? Thanks! :) [1]: http://dotnetbob.blogspot.com/2007/11/links-and-usability.html
0
[ 2, 13, 15895, 6271, 17, 182, 4091, 800, 3726, 3726, 378, 6271, 27, 21, 2741, 2478, 550, 44, 131, 15875, 60, 1, 5145, 13, 118, 1, 31, 107, 52, 985, 48, 378, 44, 21, 552, 17, 1512, 1828, 187, 1, 5145, 13, 118, 1, 31, 738, 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...
C# Generics: Can I constrain to a set of classes that don't implement an interface? === I have 3 classes that are essentially the same but don't implement an interface because they all come from different web services. e.g. * Service1.Object1 * Service2.Object1 * Service3.Object1 They all have the same properties and I am writing some code to map them to each other using an intermediary object which implements my own interface IObject1 I've done this using generics public static T[] CreateObject1<T>(IObject1[] properties) where T : class, new() { //Check the type is allowed CheckObject1Types("CreateObject1<T>(IObject1[])", typeof(T)); return CreateObjectArray<T>(properties); } private static void CheckObject1Types(string method, Type type) { if (type != typeof(Service1.Object1) && type != typeof(Service2.Object1) && type != typeof(Service3.Object1) && type != typeof(Service1.Object1[]) && type != typeof(Service2.Object1[]) && type != typeof(Service3.Object1[])) { throw new ArgumentException("Incorrect type passed to ServiceObjectFactory::" + method + ". Type:" + type.ToString()); } } My client code looks like: //properties is an array of my intermediary objects Object1[] props = ServiceObjectFactory.CreateObject1<Object1>(properties); What I want to do is get rid of the CheckObject1Types method and use constraints instead so that I get a build error if the types aren't valid, because at the moment I can call this method with any type and the ArgumentException is thrown by the CheckObject1Types method. So I'd like to do something like: public static T[] CreateObject1<T>(IObject1[] properties) where T : class, new(), Service1.Object1|Service2.Object1|Service3.Object1 { return CreateObjectArray<T>(properties); } Any ideas?
0
[ 2, 272, 5910, 12733, 18, 45, 92, 31, 11608, 11809, 20, 21, 309, 16, 2684, 30, 221, 22, 38, 8713, 40, 6573, 60, 800, 3726, 3726, 31, 57, 203, 2684, 30, 50, 7398, 14, 205, 47, 221, 22, 38, 8713, 40, 6573, 185, 59, 65, 340, 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 handle multiple submissions server-side === We all know the good old "disable the submit button" trick but what are the best ways to handle multiple submissions server side? I have an application where it is absolutely _critical_ that a form only be sent once - it processes a credit card. I didn't write how it is right now but as a quick fix I threw on the disable-on-submit technique, however some impatient users that have javascript disabled are still getting charged twice. So, what are ways to avoid this? I can think of a few - I have used a few in the past - but I'd like to see if there's any "best practices" on how to tackle this one. I am using PHP but I'm more interested in concepts.
0
[ 2, 184, 20, 3053, 1886, 10923, 18, 8128, 8, 1416, 800, 3726, 3726, 95, 65, 143, 14, 254, 315, 13, 7, 2906, 579, 14, 12298, 5167, 7, 5514, 47, 98, 50, 14, 246, 2847, 20, 3053, 1886, 10923, 18, 8128, 270, 60, 31, 57, 40, 3010, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 turn an integer into a month name in c#? === Is there a best way to turn an integer into its month name in .net? Obviously I can spin up a datetime to string it and parse the month name out of there. That just seems like a gigantic waste of time.
0
[ 2, 246, 161, 20, 805, 40, 13820, 77, 21, 1617, 204, 19, 272, 5910, 60, 800, 3726, 3726, 25, 80, 21, 246, 161, 20, 805, 40, 13820, 77, 82, 1617, 204, 19, 13, 9, 2328, 60, 4409, 31, 92, 3310, 71, 21, 1231, 891, 20, 3724, 32, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Returning a PDF file from a Java Bean to a JSP === **In brief:** I have a JSP file which calls a method in a Java Bean. This method creates a PDF file and in theory, returns it to the JSP so that the user can download it. However, upon loading the PDF, Adobe Reader gives the error: *File does not begin with '%PDF-'*. **In detail:** So far, the JSP successfully calls the method, the PDF is created and then the JSP appears to give the user the finished PDF file. However, as soon as Adobe Reader tries to open the PDF file, it gives an error: *File does not begin with '%PDF-'*. Just for good measure, I have the method create the PDF on my Desktop so that I can check it; when I open it normally within Windows is appears fine. So why is the output from the JSP different? To create the PDF, I'm using [Apache FOP][1]. I'm following one of their most basic examples, with the exception of passing the resulting PDF to a JSP instead of simply saving it to the local machine. I have been following their [basic usage pattern][2] and [this example code][3]. Here's my JSP file: <%@ taglib uri="utilTLD" prefix="util" %> <%@ taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c" %> <%@ taglib uri="http://java.sun.com/jsp/jstl/xml" prefix="x" %> <%@ page language="java" session="false" %> <%@ page contentType="application/pdf" %> <%-- Construct and initialise the PrintReportsBean --%> <jsp:useBean id="printReportsBean" scope="request" class="some.package.printreports.PrintReportsBean" /> <jsp:setProperty name="printReportsBean" property="*"/> <c:set scope="page" var="xml" value="${printReportsBean.download}"/> [1]: http://xmlgraphics.apache.org/fop [2]: http://xmlgraphics.apache.org/fop/0.95/embedding.html#basics [3]: http://svn.apache.org/viewvc/xmlgraphics/fop/trunk/examples/embedding/java/embedding/ExampleFO2PDF.java?view=markup Here's my Java Bean method: //earlier in the class... private static FopFactory fopFactory = FopFactory.newInstance(); public File getDownload() throws UtilException { OutputStream out = null; File pdf = new File("C:\\documents and settings\\me\\Desktop\\HelloWorld.pdf"); File fo = new File("C:\\somedirectory", "HelloWorld.fo"); try { FOUserAgent foUserAgent = fopFactory.newFOUserAgent(); out = new FileOutputStream(pdf); out = new BufferedOutputStream(out); Fop fop = fopFactory.newFop(MimeConstants.MIME_PDF, foUserAgent, out); TransformerFactory factory = TransformerFactory.newInstance(); Transformer transformer = factory.newTransformer(); //identity transformer Source src = new StreamSource(fo); Result res = new SAXResult(fop.getDefaultHandler()); transformer.transform(src, res); return pdf; } catch (Exception e) { throw new UtilException("Could not get download. Msg = "+e.getMessage()); } finally { try { out.close(); } catch (IOException io) { throw new UtilException("Could not close OutputStream. Msg = "+io.getMessage()); } } } I realise that this is a very specific problem, but any help would be much appreciated!
0
[ 2, 2485, 21, 13, 11124, 3893, 37, 21, 8247, 15322, 20, 21, 487, 3401, 800, 3726, 3726, 13, 1409, 108, 2698, 45, 1409, 31, 57, 21, 487, 3401, 3893, 56, 3029, 21, 2109, 19, 21, 8247, 15322, 9, 48, 2109, 9695, 21, 13, 11124, 3893, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Getting jQuery tablesorter to work with hidden/grouped table rows === I have the classical table with expandable and collapsible records that if expanded show several subrecords (as new records in the same parent table, not some child div/child table). I am also using tablesorter and absolutely love it. The problem is that tablesorter isn't keeping expanded child records next to the parent records. It sorts them as if they were top level. So each time the table gets sorted by a column the child rows end up all over the place and not where I want them. Does anyone know of a good extension to tablesorter or specific configuration that enables tablesorter to keep child rows grouped together with the parent row even after sorting? Or do I have to give up tablesorter in favor of some other API or start the ugly process of writing my own widget? Should I avoid the css-based approach of hiding individual rows of the table to represent collapse rows?
0
[ 2, 1017, 487, 8190, 93, 7484, 248, 815, 20, 170, 29, 3689, 118, 8024, 69, 859, 11295, 800, 3726, 3726, 31, 57, 14, 3089, 859, 29, 6073, 579, 17, 9470, 2552, 18, 3426, 742, 30, 100, 2766, 298, 238, 972, 14953, 18, 13, 5, 472, 7...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I open a port in iptables for RMI access === I'm trying to connect from my Java application to a development server that has port 8088 closed which is used for RMI. I appreciate any help on how to open that port.
0
[ 2, 184, 92, 31, 368, 21, 1295, 19, 15735, 5924, 18, 26, 761, 1435, 1381, 800, 3726, 3726, 31, 22, 79, 749, 20, 6379, 37, 51, 8247, 3010, 20, 21, 522, 8128, 30, 63, 1295, 2972, 3020, 827, 56, 25, 147, 26, 761, 1435, 9, 31, 88...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Simple Model Checker Tool === Is there a simple Model Checker tool. I am planning to implement a model checker tool which will analyze the code for some of the predefined properties.
0
[ 2, 1935, 1061, 2631, 106, 5607, 800, 3726, 3726, 25, 80, 21, 1935, 1061, 2631, 106, 5607, 9, 31, 589, 2334, 20, 8713, 21, 1061, 2631, 106, 5607, 56, 129, 16051, 14, 1797, 26, 109, 16, 14, 782, 13439, 3704, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Does a table join break Order By clause in Access Queries ? === I have a problem perplexing me to no end. When I run the following query against an access database: SELECT * FROM PreferredSpacer INNER JOIN SpacerThickness ON PreferredSpacer.SpacerTypeID = SpacerThickness.SpacerTypeID ORDER BY PreferredSpacer.UnitTypeID DESC (UnitTypeID field is a text type) The results do not come out sorted as a normal person would expect. They are all over the place with respect to the UnitTypeID field (There are entries starting with 'W' between entries starting with 'C' and 'M'). If I remove the join and just try to order the records in the PreferredSpacer table (which contains the UnitTypeID field) I get my expected results, so I must assume the join has something to do with it. At the same time however, I honestly can't imagine a tool as ubiquitus as access could have such a glaring issue with a fairly basic query. If I am doing something wrong -- however -- I am not able to see what it could be. Any assistance would be greatly appreciated. Thanks.
0
[ 2, 630, 21, 859, 1865, 1442, 389, 34, 9040, 19, 1381, 9386, 2829, 13, 60, 800, 3726, 3726, 31, 57, 21, 1448, 416, 11326, 68, 55, 20, 90, 241, 9, 76, 31, 485, 14, 249, 25597, 149, 40, 1381, 6018, 45, 5407, 1637, 37, 5981, 5582,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
SQL Server 2000/2005 identity column + replication === I have looked at some resources already and just want to clarify and get an opinion. First of all to totally avoid any problems we could just not bother using identity columns as primary keys instead have them generated ourselves and just have those values replicated both ways presuming they are always unique at any time of creation. For the purposes of this question I am talking about 2 or more way replication to solve global access issues and we do have identity columns. Now we are setting up transactional replication and both databases should replicate to each other. As I understand it you allocate a range of seed values to each database server and it will use these, you know there unique cause you gave ranges that do not cross. So does this mean during replication these values are inserted into the seed column? so if you allocate ranges 1-10 and 11-20 to 2 servers once each server has inserted 10 rows you will have seeds 1-20 in both databases?
0
[ 2, 4444, 255, 8128, 824, 118, 2835, 3270, 4698, 2754, 23841, 800, 3726, 3726, 31, 57, 292, 35, 109, 2566, 614, 17, 114, 259, 20, 23116, 17, 164, 40, 4052, 9, 64, 16, 65, 20, 5139, 2658, 186, 1716, 95, 110, 114, 52, 8006, 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, 1, 1, 1, 1, 1, 1, 1...
how can i use sharepoint (via soap?) from python ? === I want to use Sharepoint with python (C-Python) Has anyone tried this before ?
0
[ 2, 184, 92, 31, 275, 1891, 3132, 13, 5, 5034, 6447, 60, 6, 37, 20059, 13, 60, 800, 3726, 3726, 31, 259, 20, 275, 1891, 3132, 29, 20059, 13, 5, 150, 8, 6448, 11570, 6, 63, 1276, 794, 48, 115, 13, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
SPWorkflowTaskProperties.ExtendedProperties aren’t populating the fields in my task === I am attempting to pass information from a task created within a workflow to its corresponding task form. Prior to the CreateTask activity, I create an SPWorkflowTaskProperties and fill it with the usual info (title, assigned-to, etc). I also add some elements to the ExtendedProperties property. However, those custom properties never make it into the Task. I've tried setting the property key to: - the Guid of one of my task' content type's fields; - the internal name of one of my task' content type's fields; - an unrelated name (in the hopes of getting the info into the task's properties instead of its fields). Nothing works. The task, once created, contains only the built-in field values I have set. None of values I explicitly added to the extended properties show up. The (simplified) sequence of my activities is as follows: - PrepareTask. This is a custom activity that contains the SPWorkflowTaskProperties - CreateTask. The task properties are bound to the one in the PrepareTask activity. - OnTaskCreated. The task properties are bound to the one in the PrepareTask activity. - While (task not complete) - OnTaskChanged I am using WSS 3.0 SP1 and an ASPX (NOT InfoPath) task form.
0
[ 2, 3782, 3783, 9990, 38, 20310, 10890, 106, 3915, 9, 25138, 10890, 106, 3915, 4847, 1, 38, 1675, 10038, 14, 2861, 19, 51, 3005, 800, 3726, 3726, 31, 589, 6314, 20, 1477, 676, 37, 21, 3005, 679, 363, 21, 170, 9990, 20, 82, 7265, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 determine build architecture (32bit / 64bit) with ant? === We have inherited an ant build file but now need to deploy to both 32bit and 64bit systems. The non-Java bits are done with GNUMakefiles where we just call "uname" to get the info. Is there a similar or even easier way to mimic this with ant?
0
[ 2, 184, 20, 3746, 1895, 2607, 13, 5, 3125, 3326, 13, 118, 4384, 3326, 6, 29, 40, 38, 60, 800, 3726, 3726, 95, 57, 7179, 40, 40, 38, 1895, 3893, 47, 130, 376, 20, 17617, 20, 156, 2512, 3326, 17, 4384, 3326, 1242, 9, 14, 538, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Detecting Virus Scanners === We've had problems with a virus scanner murdering the performance of our app by slowing down writes to an [H2 db][1]. So we'd like to be able to detect the presence of any virus scanner and alert the user of the potential problem. The current suggestion is a write test that displays the warning if a disk write takes an unreasonable amount of time. That does get to the actual problem, but not to the cause. So, is there any reliable and direct way to detect virus protection, one that doesn't rely on indirect effects? We might end up doing both, but it would be nice to be curtain in our 'suggestions'. [1]: http://en.wikipedia.org/wiki/H2_(DBMS)
0
[ 2, 9092, 68, 6231, 23195, 18, 800, 3726, 3726, 95, 22, 195, 41, 1716, 29, 21, 6231, 23195, 23537, 14, 956, 16, 318, 4865, 34, 21745, 125, 6215, 20, 40, 636, 252, 135, 13, 9007, 500, 2558, 165, 500, 9, 86, 95, 22, 43, 101, 20, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you learn a new skill/framework/technology? === I need to be able to contribute to a relatively large Adobe AIR project and I'm starting from scratch with this technology. What's the best way to go about it? I usually get a good book/tutorial and work my way through it but this time it seems there's just too much to learn for this to be feasible within a reasonable time frame. I would need books on Actionscript, FLEX, etc... Do you know of any good resources that might be useful for this particular case? How would you go about it if you were in my shoes?
0
[ 2, 184, 107, 42, 2484, 21, 78, 6148, 118, 8361, 3783, 118, 29393, 60, 800, 3726, 3726, 31, 376, 20, 44, 777, 20, 8606, 20, 21, 3109, 370, 20299, 282, 669, 17, 31, 22, 79, 1422, 37, 12395, 29, 48, 1099, 9, 98, 22, 18, 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...
Merging and querying multiple lists === I am still new to sharepoint and would like to know if it is possible to make a query that works across serveral lists. My list looks like this Customers (id, name and so forth) Orders ( id, order number, customer and some additional info) OrderItems (id, name, price, description and so on) I would like to create a view that will display the OrderItems grouped by Order which again will be grouped by Customer. In pure .net code that is pretty easy but is it possible to implement it only using sharepoint lists?
0
[ 2, 18842, 17, 25597, 68, 1886, 7227, 800, 3726, 3726, 31, 589, 174, 78, 20, 1891, 3132, 17, 83, 101, 20, 143, 100, 32, 25, 938, 20, 233, 21, 25597, 30, 693, 464, 8128, 192, 7227, 9, 51, 968, 1879, 101, 48, 5279, 13, 5, 1340, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Jasper report generating bad HTML === If I view the HTML generated by one of my Jasper reports in IE7 I see the following: <BR /><BR /> <A name="JR_PAGE_ANCHOR_0_1"> <TABLE style="WIDTH: 1000px" cellSpacing="0" cellPadding="0" bgColor="#ffffff" border="0"> <-- table body omitted --> </TABLE> The two BR tags are added by myself via the JRHtmlExporterParameter.HTML_HEADER parameter. After these tags and before the beginning of the report table that there's an unclosed anchor tag. The fact that this tag is not correctly closed is messing up the formatting of my report because IE is hyperlinking the entire report TABLE. I'm not actually using this anchor tag, so if I could prevent Jasper from generating it, that would solve my problem. Incidentally, this problem only occurs in IE, in Firefox everything works fine because the anchor tag is properly closed. Thanks in advance, Don
0
[ 2, 16750, 1330, 13500, 896, 13, 15895, 800, 3726, 3726, 100, 31, 1418, 14, 13, 15895, 6756, 34, 53, 16, 51, 16750, 2813, 19, 13, 660, 465, 31, 196, 14, 249, 45, 13, 1, 5145, 13, 118, 1, 5145, 13, 118, 1, 13, 1, 58, 204, 3726...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Solr Filter for Logging/Analysing Queries === I'm using Solr and wish to be able to log queries/tokens to a database for analytics for both marketing and suggested search functionality. I'm guessing that a Lucene filter would be a good way of doing this, maybe putting a filter in the query filter chain for a given field type which logs to a specified database. I'm wondering the best way to do this to minimize the impact on Solr response times. If anybody has done this in the past and is willing to share their solution, that would be fantastic.
0
[ 2, 7176, 139, 11945, 26, 13, 13919, 118, 1629, 102, 18, 68, 9386, 2829, 800, 3726, 3726, 31, 22, 79, 568, 7176, 139, 17, 2536, 20, 44, 777, 20, 6738, 9386, 2829, 118, 262, 2853, 18, 20, 21, 6018, 26, 26320, 26, 156, 4743, 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...
Help with a WHERE on a LEFT JOIN SQL Query === I'm trying to construct a query that will include a column indicating whether or not a user has downloaded a document. I have a table called HasDownloaded with the following columns: id, documentID, memberID. Finding out whether a user has downloaded a _specific_ document is easy; but I need to generate a query where the results will look like this: name id ---------------------- abc NULL bbb 2 ccc 53 ddd NULL eee 13 The ID isn't really important; what I'm interested in is whether the document has been downloaded (is it NULL or not). Here is my query: SELECT Documents.name, HasDownloaded.id FROM Documents LEFT JOIN HasDownloaded ON HasDownloaded.documentID = Documents.id WHERE HasDownloaded.memberID = @memberID The problem is, this will only return values if an entry exists for the specified user in the HasDownloaded table. I'd like to keep this simple and only have entries in HasDownloaded for documents that _have_ been downloaded. So if user 1 has downloaded abc, bbb, and ccc, I still want ddd and eee to show up in the resulting table, just with the id as NULL. But the WHERE clause only gives me values for which entries exists. I'm not much of a SQL expert - is there an operator that will give me what I want here? Should I be taking a different approach? Or is this impossible?
0
[ 2, 448, 29, 21, 113, 27, 21, 225, 1865, 4444, 255, 25597, 800, 3726, 3726, 31, 22, 79, 749, 20, 6960, 21, 25597, 30, 129, 468, 21, 4698, 7950, 1472, 54, 52, 21, 4155, 63, 23887, 21, 4492, 9, 31, 57, 21, 859, 227, 63, 2968, 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...
.net 2.0 or 3.5 === Our clients use a vb6 version of our software. We are upgrading them to a .net application written in c#... Is there less bulk using .net 2.0 than .net 3.5? My definition of less bulk would be: Smaller size, smaller installation time, etc. Most of them probably already have 2.0 anyway. I only ask because I would like to take advantage of LINQ in 3.5.
0
[ 2, 13, 9, 2328, 172, 9, 387, 54, 203, 9, 264, 800, 3726, 3726, 318, 7421, 275, 21, 13, 20468, 379, 615, 16, 318, 2306, 9, 95, 50, 26939, 105, 20, 21, 13, 9, 2328, 3010, 642, 19, 272, 5910, 9, 9, 9, 25, 80, 787, 7238, 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, 1, 1, 1, 1, 1, 1, 1...
JSON RPC: java method never called, any ideas? === I'm trying to get some code working that a previous developer has written. Yep, his now left the company. :-( I have a JSON RPC call being made from the JS code. The JS all runs fine & the callback method gets an object back (not an error object). But the method on the Java class never gets hit. The smd method does get hit though. ---------- > public String smd() <br> > { <br> > return SUCCESS; // break point reaches here<br> > } <br> > <br> > @SMDMethod <br> > public void updateRowValueForField(String key, String value, String fieldname) <br> > { <br> > // We never get into this method.<br> > } <br> ---------- > Blockquote <package name="EntryBarRPC" namespace="/" extends="star-default"> <action name="ebToggleSelection" class="eboggleSelectionAction" method="smd"> <interceptor-ref name="jsonStack"> <param name="enableSMD">true</param> </interceptor-ref> <result type="json"> <param name="enableSMD">true</param> </result> </action> </package> ---------- I'm stumpped as to why, or what I'm missing. I've read [JSON plugin page][1] over and over. I think I just need another set of eyes. Note: no errors in the Tomcat console, no JS errors. Anyone got any clues? Cheers Jeff Porter [1]: http://cwiki.apache.org/S2PLUGINS/json-plugin.html
0
[ 2, 487, 528, 761, 5779, 45, 8247, 2109, 243, 227, 15, 186, 3478, 60, 800, 3726, 3726, 31, 22, 79, 749, 20, 164, 109, 1797, 638, 30, 21, 1158, 10058, 63, 642, 9, 13, 17754, 15, 33, 130, 225, 14, 237, 9, 13, 45, 8, 5, 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...
What are some of the common programming tasks you work with in Real world? === I am working on making a list of all the common programming tasks that any regular developer works with in real world application development. Code that you work with in most regular LOB applications repeatedly. Even if it's not so common, and you think it is fairly worthwhile to add it to the list, please do so. Let me start with: 1. Reading a text file from disk, load it on to a string 2. Saving a string to a text file 3. Serialize a business object to XML 4. Deserialize XML from string and/or disk to a business object 5. Validate an XML string against an XSD schema now it's your turn.
0
[ 2, 98, 50, 109, 16, 14, 757, 3143, 8674, 42, 170, 29, 19, 683, 126, 60, 800, 3726, 3726, 31, 589, 638, 27, 544, 21, 968, 16, 65, 14, 757, 3143, 8674, 30, 186, 1290, 10058, 693, 29, 19, 683, 126, 3010, 522, 9, 1797, 30, 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...
Is it safe to use @@identity with replication enabled on Sybase ASE 15. === I am using @@identity to fetch recently updated identity column. Am not sure if this presents any problem when used on a SERVER with replication enabled. Tried googling but no luck. Can someone explain me how this works? http://infocenter.sybase.com/help/index.jsp?topic=/com.sybase.help.pb_10.5.connpb/html/connpb/connpb65.htm
3
[ 2, 25, 32, 1834, 20, 275, 13, 1, 13384, 856, 29, 23841, 9338, 27, 10315, 8436, 28, 62, 357, 9, 800, 3726, 3726, 31, 589, 568, 13, 1, 13384, 856, 20, 18312, 1989, 6372, 3270, 4698, 9, 589, 52, 562, 100, 48, 7992, 186, 1448, 76,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...