unified_texts
stringlengths
32
30.1k
OpenStatus_id
int64
0
4
input_ids
list
token_type_ids
list
attention_mask
list
Are there any user interface prototyping tools for Eclipse? === I am looking into designing new features for Eclipse-based programming tools, from the requirements/ideas perspective. To really do this quickly, I would like to sketch UI elements without having to code things -- my concern is with the concepts and ideas right now, not the possible later realization. Are there any such graphical sketching tools for Eclipse? (on a side note, I should also note that I find Eclipse a better idea every day, in the way that you can combine partial systems from very many different sources into a single environment. It really is the future of IDEs, especially for embedded systems. It used to pretty horrible pre-Eclipse-3.0, but now it does seem to work)
0
[ 2, 50, 80, 186, 4155, 6573, 9347, 1084, 3181, 4672, 26, 11652, 60, 800, 3726, 3726, 31, 589, 699, 77, 15026, 78, 967, 26, 11652, 8, 1281, 3143, 4672, 15, 37, 14, 4786, 118, 3448, 472, 6531, 9, 20, 510, 107, 48, 976, 15, 31, 83...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Awk scripting help - Logic Issue === I'm currently writing a simple .sh script to parse an Exim log file for strings matching " o' ". Currently, when viewing output.txt, all that is there is a 0 printed on every line(606 lines). I'm guessing my logic is wrong, as awk does not throw any errors. Here is my code: grep "o'" /var/log/exim/main.log | awk '{ line = "> "; for(i = 20; i <= 33; i++) { line += " " + $i; } print line; }' > output.txt Any ideas?
0
[ 2, 13, 3885, 197, 3884, 68, 448, 13, 8, 7085, 1513, 800, 3726, 3726, 31, 22, 79, 871, 1174, 21, 1935, 13, 9, 1635, 3884, 20, 2017, 870, 40, 1396, 1660, 6738, 3893, 26, 7887, 10120, 13, 7, 635, 22, 13, 7, 9, 871, 15, 76, 1124...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
ReceivePayment Pending for Quickbooks XML and Merchant Services === In the Quickbooks SDK Manual, there is a section called "Using ReceivePayment for Credit Card Authorization and Capture". It reads... > **Using ReceivePayment for Credit Card Authorization and Capture** > If the company is subscribed to QBMS, you can record a ReceivePaymentAdd that is basically a pending transaction. That is, in this usage, you want to save a QBMS authorization transaction into QuickBooks. Thus, the ReceivePaymentAdd contains a CreditCardTxnInfo aggregate with a CreditCardTxnType of Authorization. QuickBooks saves this as a pending transaction. Later, when the authorized charge is captured to become a real charge in QBMS, you can record that charge into QuickBooks by modifying that ReceivePayment (ReceivePaymentMod). The ReceivePaymentMod will have a CreditCardTxnInfoMod containing data from the QBMS capture transaction, with a CreditCardTxnType of Capture. QuickBooks automatically removes the pending status and records the transaction. My question is, **How do you actually do that with QBXML?** Right now, I have a VB.NET application that sends invoices to quickbooks, but then users have to switch to quickbooks, and click "Customers -> Receive Payments" to charge their credit card (using Quickbooks Merchant Services). It would be awfully nice to automate this in some way, perhaps by sending Quickbooks an XML message to charge the card?)
0
[ 2, 2588, 12224, 1130, 16440, 26, 2231, 13828, 23504, 17, 5080, 687, 800, 3726, 3726, 19, 14, 2231, 13828, 13, 18, 43, 197, 5132, 15, 80, 25, 21, 1050, 227, 13, 7, 12655, 2588, 12224, 1130, 26, 3251, 2056, 22677, 17, 3683, 7, 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...
What is the simplest way to convert char[] into tchar[] in C/C++(ms)? === This seems like a pretty softball question, but I always have a hard time looking up this function because there seem there are so many variations regarding the referencing of char and tchar.
0
[ 2, 98, 25, 14, 24384, 161, 20, 8406, 4892, 2558, 500, 77, 13, 38, 5433, 2558, 500, 19, 272, 118, 150, 20512, 5, 79, 18, 6, 60, 800, 3726, 3726, 48, 2206, 101, 21, 1772, 14401, 1301, 15, 47, 31, 550, 57, 21, 552, 85, 699, 71,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Pivot Table and Concatenate Columns - SQL Problem === I have a database in the following format: ID TYPE SUBTYPE COUNT MONTH 1 A Z 1 7/1/2008 1 A Z 3 7/1/2008 2 B C 2 7/2/2008 1 A Z 3 7/2/2008 Can I use SQL to convert it into this: ID A_Z B_C MONTH 1 4 0 7/1/2008 2 0 2 7/2/2008 1 0 3 7/2/2008 So, the TYPE, SUBTYPE are concatenated into new columns and COUNT is summed where the ID and MONTH match. Any tips would be appreciated. Is this possible in SQL or should I program it manually?
0
[ 2, 20670, 859, 17, 1065, 9530, 8820, 7498, 13, 8, 4444, 255, 1448, 800, 3726, 3726, 31, 57, 21, 6018, 19, 14, 249, 2595, 45, 4924, 1001, 972, 4474, 2468, 1617, 137, 21, 2052, 137, 13, 9816, 8197, 2753, 137, 21, 2052, 203, 13, 98...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Experiences and tips for programming with and for Amazon's cloud servers/apps/tools? === We're looking into developing a product that would use Amazon's cloud tools (EC2, SQS, etc), and I'm curious what tips/gotchas/pointers people that have used these technologies have. One tip/whatever per post, please.
0
[ 2, 5513, 17, 11034, 26, 3143, 29, 17, 26, 8059, 22, 18, 4005, 17595, 118, 7753, 18, 118, 20799, 18, 60, 800, 3726, 3726, 95, 22, 99, 699, 77, 3561, 21, 2374, 30, 83, 275, 8059, 22, 18, 4005, 4672, 13, 5, 3319, 135, 15, 4444, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
JPA - Unknown entity bean class === Hopefully, I can explain this issue properly. I have 3 classes that deals with my entities. @MappedSuperclass public abstract class Swab implements ISwab { ... private Collection<SwabAccounts> accounts; ... } @Entity @Table(name="switches") @DiscriminatorColumn(name="type") @DiscriminatorValue(value="DMS500") public class DmsSwab extends Swab implements ISwab, Serializable { ... private ObjectPool pool; ... @Transient public ObjectPool getPool(){ return pool; } ... } @Entity(name="swab_accounts") public class SwabAccounts implements Serializable { private static final long serialVersionUID = 1L; @Id @GeneratedValue(strategy = GenerationType.AUTO) private int swab_account_id; private int swab_id; ... } And in a EJB a query is being doing this way DmsSwab dms = em.find(DmsSwab.class, 2); List<Swab> s = new ArrayList<Swab>(1); s.add(dms); My persistence.xml looks like this: <?xml version="1.0" encoding="UTF-8"?> <persistence version="1.0" xmlns="http://java.sun.com/xml/ns/persistence" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://java.sun.com/xml/ns/persistence http://java.sun.com/xml/ns/persistence/persistence_1_0.xsd"> <persistence-unit name="dflow-pu" transaction-type="RESOURCE_LOCAL"> <provider>oracle.toplink.essentials.PersistenceProvider</provider> <class>com.dcom.sap.dms.DmsSwab</class> <class>com.dcom.sap.jpa.SwabAccounts</class> <properties> <property name="toplink.jdbc.user" value="dflow"/> <property name="toplink.jdbc.password" value="dflow"/> <property name="toplink.jdbc.url" value="jdbc:mysql://itcd-400447:3306/dflow"/> <property name="toplink.jdbc.driver" value="com.mysql.jdbc.Driver"/> </properties> </persistence-unit> </persistence> I get this error: java.lang.IllegalArgumentException: Unknown entity bean class: class com.dcom.sap.dms.DmsSwab, please verify that this class has been marked with the @Entity annotation. com.dcom.sap.SwabException: java.lang.IllegalArgumentException: Unknown entity bean class: class com.dcom.sap.dms.DmsSwab, please verify that this class has been marked with the @Entity annotation. Caused by: java.lang.IllegalArgumentException: Unknown entity bean class: class com.dcom.sap.dms.DmsSwab, please verify that this class has been marked with the @Entity annotation. at oracle.toplink.essentials.internal.ejb.cmp3.base.EntityManagerImpl.findInternal(EntityManagerImpl.java:306) at oracle.toplink.essentials.internal.ejb.cmp3.EntityManagerImpl.find(EntityManagerImpl.java:148) I am running netbeans 6.1 with the version of glassfish that comes with it. MySql 5.0.
0
[ 2, 487, 1060, 13, 8, 2562, 9252, 15322, 718, 800, 3726, 3726, 13416, 15, 31, 92, 3271, 48, 1513, 7428, 9, 31, 57, 203, 2684, 30, 10342, 29, 51, 12549, 9, 13, 1, 79, 16664, 8542, 1898, 317, 8502, 718, 10143, 220, 8713, 18, 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...
Reset Expander to default collapse behavior === I'm using an expander inside a [Resizer](http://kentb.blogspot.com/2007/04/resizer-wpf-control.html) (a ContentControl with a resize gripper), and it expands/collapses properly when the control initially comes up. Once I resize it, the Expander won't properly collapse, as documented below. I ran Snoop on my application, and I don't see any heights set on Expander or its constituents. How would I go about convincing Expander to collapse properly again? Or modifying Resizer to not make Expander sad would work as well. Expander documentation says: >"For an Expander to work correctly, do not specify a Height on the Expander control when the ExpandDirection property is set to Down or Up. Similarly, do not specify a Width on the Expander control when the ExpandDirection property is set to Left or Right. When you set a size on the Expander control in the direction that the expanded content is displayed, the area that is defined by the size parameter is displayed with a border around it. This area displays even when the window is collapsed. To set the size of the expanded window, set size dimensions on the content of the Expander control or the ScrollViewer that encloses the content."
0
[ 2, 23422, 6073, 106, 20, 12838, 6529, 3257, 800, 3726, 3726, 31, 22, 79, 568, 40, 6073, 106, 572, 21, 636, 99, 18, 11907, 500, 5, 21127, 6903, 2853, 11872, 9, 7091, 5447, 4296, 9, 960, 118, 2727, 118, 3277, 118, 99, 18, 11907, 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...
What is the best way for a website to check if a user has installed a client app? === Let's say I've got a website that works better if a client has installed and logged into a desktop application. I'd like to be able to do 2 things: - Alter the website if they haven't installed the app (to make it easy for them to find a link to the installer) - If they've installed the app on a couple of machines, determine which machine they are browsing from I'd like something that works on Windows and OSX, on any of the major browsers. Linux is a bonus. A few thoughts: - Websites can detect if you've got Flash installed. How does that work and could it be used for both of my goals? - Could I just let the client serve HTTP on localhost and do some javascript requests to fetch a local ID? I know google desktop search did something like this at one point. Is this a standard practice? Thanks!
0
[ 2, 98, 25, 14, 246, 161, 26, 21, 2271, 20, 2631, 100, 21, 4155, 63, 4066, 21, 6819, 4865, 60, 800, 3726, 3726, 408, 22, 18, 395, 31, 22, 195, 330, 21, 2271, 30, 693, 574, 100, 21, 6819, 63, 4066, 17, 13, 19287, 77, 21, 17404...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Can not get CSS Sticky footer to work. What am I doing wrong? === Well this is my first post here and really enjoying the site. I have a very basic (ugly as sin) site I have started and for some reason I can not get the CSS Sticky footer to work for FireFox. IE works but FF shows it half way up the page. The URL is [http://dev.aipoker.co.uk][1] [1]: http://dev.aipoker.co.uk I know I should be developing in FF and bug fixing in IE so I am guessing I might have actually made a mistake and some how it works in IE but no where else. Can anyone help put me out of my missery please? Thanks guys and gals.
0
[ 2, 92, 52, 164, 272, 18, 18, 19087, 1749, 106, 20, 170, 9, 98, 589, 31, 845, 1389, 60, 800, 3726, 3726, 134, 48, 25, 51, 64, 678, 235, 17, 510, 9227, 14, 689, 9, 31, 57, 21, 253, 2125, 13, 5, 5127, 102, 28, 3278, 6, 689, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Scriptaculous sortable matrix === I am trying to create a sortable image matrix, 5x5 using scriptaculous javascript library by I can't make it work. I am trying using a table but I am having trouble linking the `<td>` into the Sortable object. Do you guys have any hint or documentation I can go through to create this ? Thanks
0
[ 2, 3884, 1738, 22717, 2058, 579, 8187, 800, 3726, 3726, 31, 589, 749, 20, 1600, 21, 2058, 579, 1961, 8187, 15, 331, 396, 264, 568, 3884, 1738, 22717, 8247, 8741, 1248, 34, 31, 92, 22, 38, 233, 32, 170, 9, 31, 589, 749, 568, 21, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What languages have a good GUI API/Designer? === I've been wanting to become proficient in a new language for a while. There are a few languages I want to learn but it's pretty important for me to be able to create a (Application) GUI. I work in C# so I have become very accustom to the GUI designer. I would love to get better with C++ or Java (both of which I have a small amount of experience with). Other languages could be interesting too. I just really need to be able to make a GUI reasonably easily. So what (non .net) language has a really good method of designing GUIs? An extension to this question might be what are the most common GUI APIs/designers?
0
[ 2, 98, 2556, 57, 21, 254, 9457, 21, 2159, 118, 19862, 106, 60, 800, 3726, 3726, 31, 22, 195, 74, 4638, 20, 533, 28140, 19, 21, 78, 816, 26, 21, 133, 9, 80, 50, 21, 310, 2556, 31, 259, 20, 2484, 47, 32, 22, 18, 1772, 681, 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...
Setting the scrollbar position of a ListBox === Can I programatically set the position of a WPF ListBox's scrollbar? By default, I want it to go in the center.
0
[ 2, 2697, 14, 12159, 1850, 649, 16, 21, 968, 5309, 800, 3726, 3726, 92, 31, 625, 721, 8438, 309, 14, 649, 16, 21, 619, 7721, 968, 5309, 22, 18, 12159, 1850, 60, 34, 12838, 15, 31, 259, 32, 20, 162, 19, 14, 459, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
What are the limitations of Loose XAML? === I have been experimenting with rendering strict XAML markup in a web browser, also known as Loose XAML (explained [here][1] and [here][2]). It strikes me as mostly useful for displaying static content. However, it also appears possible to bind to an XML data provider. Loose XAML files are not compiled with an application, which creates the following limitations: - They do not allow external assemblies - No use of classes, code-behind (or any C#) - No two-way databinding Are there additional limitations? I would like to be able to databind to a database provider (SQL Server), but I have not found a way to enable this. Also, is the .NET Framework required on the client machine in order to render the XAML in the browser? [1]: http://blogs.msdn.com/tims/archive/2005/09/21/472659.aspx [2]: http://michaelbraude.com/index.php?XML/Projects/XAMLXSLT/XAMLXSLT_page1.xml
0
[ 2, 98, 50, 14, 14070, 16, 4675, 13, 6791, 8184, 60, 800, 3726, 3726, 31, 57, 74, 5737, 68, 29, 15307, 8170, 13, 6791, 8184, 943, 576, 19, 21, 2741, 16495, 15, 67, 167, 28, 4675, 13, 6791, 8184, 13, 5, 6899, 16062, 43, 636, 683...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 detect an update using .NET 2 System.Configuration.Install? === I created a class derived from System.Configuration.Install for my installer. But the code in Uninstall() is being called when I try to update the application. How can I detect that the user is trying to update instead of uninstall? Maybe [this post][1] explains it better than me: > My problem boils down to: when the > user performs an update (i.e. double > clicks on MyAppVer2.msi when they > already have MyAppVer1.msi installed) > the Uninstall method inside my > Installer is called first, but I have > no apparent property to check from > inside this method to detect that an > update is being performed so that I > can branch my code appropriately. [1]: http://www.microsoft.com/communities/newsgroups/en-us/default.aspx?dg=microsoft.public.dotnet.languages.csharp&tid=a018d064-8bb8-441d-bccc-f5ce2cc665eb&cat=&lang=&cr=&sloc=&p=1
0
[ 2, 184, 20, 9092, 40, 11100, 568, 13, 9, 2328, 172, 329, 9, 1126, 13549, 857, 9, 108, 21300, 60, 800, 3726, 3726, 31, 679, 21, 718, 3981, 37, 329, 9, 1126, 13549, 857, 9, 108, 21300, 26, 51, 16146, 106, 9, 47, 14, 1797, 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...
Editor to open big text files (XML export files) === By big, I mean atleast a hundred megabytes big? While 100+ megabyte textfiles aren't common (atleast I hope so!), I have an app that's exporting data as XML and needs to be debugged. So, need to look through the XML, and can't do that if the editor is crashy.
4
[ 2, 1835, 20, 368, 580, 1854, 6488, 13, 5, 396, 8184, 7487, 6488, 6, 800, 3726, 3726, 34, 580, 15, 31, 884, 35, 255, 2857, 21, 1874, 5957, 23246, 18, 580, 60, 133, 808, 2430, 5957, 23246, 1854, 16877, 18, 4847, 22, 38, 757, 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...
Why do I get "Cannot redirect after HTTP headers have been sent" when I call Response.Redirect(url)? === When I call Response.Redirect(someUrl) I get an HttpException: "Cannot redirect after HTTP headers have been sent".
0
[ 2, 483, 107, 31, 164, 13, 7, 1245, 1270, 302, 14706, 75, 7775, 157, 445, 57, 74, 795, 7, 76, 31, 645, 1627, 9, 99, 14706, 5, 911, 255, 6, 60, 800, 3726, 3726, 76, 31, 645, 1627, 9, 99, 14706, 5, 3220, 911, 255, 6, 31, 164,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to get SQL Profiler to monitor trigger execution === I have a trace setup for SQL Server Profiler to monitor SQL that is executed on a database. I recently discovered that trigger execution is not included in the trace. After looking through available events for a trace, I do not see any that look like they would include trigger execution. Does anyone know how to setup a trace to monitor the execution of triggers?
0
[ 2, 184, 20, 164, 4444, 255, 5296, 139, 20, 7626, 7286, 5769, 800, 3726, 3726, 31, 57, 21, 5565, 18161, 26, 4444, 255, 8128, 5296, 139, 20, 7626, 4444, 255, 30, 25, 5557, 27, 21, 6018, 9, 31, 1989, 1848, 30, 7286, 5769, 25, 52, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Nginx + fastcgi truncation problem === I'm running a Django site using the fastcgi interface to nginx. However, some pages are being served truncated (i.e. the page source just stops, sometimes in the middle of a tag). How do I fix this (let me know what extra information is needed, and I'll post it)
0
[ 2, 13, 2723, 108, 396, 2754, 1512, 150, 2234, 22328, 872, 1448, 800, 3726, 3726, 31, 22, 79, 946, 21, 3857, 14541, 689, 568, 14, 1512, 150, 2234, 6573, 20, 13, 2723, 108, 396, 9, 207, 15, 109, 4434, 50, 142, 423, 22328, 69, 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...
Mahjong - Arrange tiles to ensure at least one path to victory, regardless of layout. === Regardless of the layout being used for the tiles, is there any good way to divvy out the tiles so that you can guarantee the user that, at the beginning of the game, there exists at least one path to completing the puzzle and winning the game? Obviously, depending on the user's moves, they can cut themselves off from winning. I just want to be able to always tell the user that the puzzle is winnable if they play well. If you randomly place tiles at the beginning of the game, it's possible that the user could make a few moves and not be able to do any more. The knowledge that a puzzle is at least solvable should make it more fun to play.
0
[ 2, 6330, 12903, 13, 8, 12400, 14836, 20, 4062, 35, 639, 53, 2013, 20, 1575, 15, 7148, 16, 9106, 9, 800, 3726, 3726, 7148, 16, 14, 9106, 142, 147, 26, 14, 14836, 15, 25, 80, 186, 254, 161, 20, 13, 12916, 5903, 70, 14, 14836, 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...
Javascript Commands Only Executed When Unminimized === I want to log to the console when I'm using unminimized JS files. Comments are taken out already when I minimize JS. I'm wondering if there's a way I can write a command that isn't commented out but will still be taken out when I minimize the javascript file.
0
[ 2, 8247, 8741, 14294, 104, 5557, 76, 367, 6840, 79, 1333, 800, 3726, 3726, 31, 259, 20, 6738, 20, 14, 8650, 76, 31, 22, 79, 568, 367, 6840, 79, 1333, 487, 18, 6488, 9, 7534, 50, 658, 70, 614, 76, 31, 16713, 487, 18, 9, 31, 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...
How can I parse the first, middle and last name from a full name field in SQL? === I'm having to do some data conversion, and I need to try to match up on names that are not a direct match on full name. I'd like to be able to take the full name field and break it up into first, middle and last name. The data does not include any prefixes or suffixes. The middle name is optional.
0
[ 2, 184, 92, 31, 2017, 870, 14, 64, 15, 772, 17, 236, 204, 37, 21, 503, 204, 575, 19, 4444, 255, 60, 800, 3726, 3726, 31, 22, 79, 452, 20, 107, 109, 1054, 6263, 15, 17, 31, 376, 20, 1131, 20, 730, 71, 27, 1817, 30, 50, 52, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
LINQ to XML for a small appliction can replace a small database? === I am creating a small application that will be deployed on Window. The database will have less than 10 tables. Instead of installing a database on the client box is using XML documents for the database and LINQ going to cost in performance of queries, waiting for the XML file to be loaded and be written? If I use a database I will use LINQ to SQL.
0
[ 2, 6294, 1251, 20, 23504, 26, 21, 284, 4865, 4663, 3309, 92, 3934, 21, 284, 6018, 60, 800, 3726, 3726, 31, 589, 2936, 21, 284, 3010, 30, 129, 44, 6698, 27, 1463, 9, 14, 6018, 129, 57, 787, 119, 332, 7484, 9, 700, 16, 25429, 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...
Is there anything inherently wrong with long object invokation chains? === I've organized my code so that the data is organized hierarchically. I find myself crawling up the tree using code like the following: File clientFolder = task.getActionPlan().getClientFile().getClient().getDocumentsFolder(); Now, since I'm not drilling down into the task object, I'm drilling up to its parents, I don't think I'm loosing anything in terms of encapsulation, but there's a flag going off in the back of my mind telling me there's something dirty about doing it this way. Thoughts?
0
[ 2, 25, 80, 602, 27929, 1389, 29, 175, 3095, 19, 2625, 197, 857, 8864, 60, 800, 3726, 3726, 31, 22, 195, 2518, 51, 1797, 86, 30, 14, 1054, 25, 2518, 21376, 8438, 9, 31, 477, 992, 19108, 71, 14, 1541, 568, 1797, 101, 14, 249, 45...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to convince people to comment their code === What are good arguments to convince others to comment their code? I notice many programmers favour the perceived speed of writing code without comments over leaving some documentation for themselves and others. When I try to convince them I get to hear halfbaked stuff like "the method/class name should say what it does" etc. What would you say to them to change their minds?
4
[ 2, 184, 20, 6218, 148, 20, 6484, 66, 1797, 800, 3726, 3726, 98, 50, 254, 10553, 20, 6218, 654, 20, 6484, 66, 1797, 60, 31, 3551, 151, 17968, 18, 6342, 14, 8589, 1362, 16, 1174, 1797, 366, 7534, 84, 1107, 109, 13945, 26, 1366, 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...
Can't copy file with appropriate permissions using FileIOPermission === This snippet works well if I try to write in a user directory but as soon as I try to write in Program Files, it just executes silently and the file has not been copied (no exception). If I try to copy the file in C:\ or in C:\Windows I catch an UnauthorizedAccessException. Do you know another way to get the permissions to write in that directory or to make it work another way? Any help greatly appreciated! Thanks using(FileStream fs=File.Open(source, FileMode.Open)){ } try { FileIOPermission fp = new FileIOPermission(FileIOPermissionAccess.Write, AccessControlActions.Change, "C:\\Program Files\\MyPath"); fp.Demand(); //<-- no exception but file is not copied File.Copy("C:\\Users\\teebot\\Documents\\File.xml","C:\\Program Files\\MyPath\\File.xml",true); } catch(SecurityExceptions) { throw(s); } catch(UnauthorizedAccessException unauthroizedException) { throw unauthroizedException; }
0
[ 2, 92, 22, 38, 4344, 3893, 29, 4593, 5572, 18, 568, 3893, 49, 9477, 12385, 800, 3726, 3726, 48, 13, 29061, 693, 134, 100, 31, 1131, 20, 2757, 19, 21, 4155, 16755, 47, 28, 651, 28, 31, 1131, 20, 2757, 19, 625, 6488, 15, 32, 114...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I automatically update a web reference at build time? === I have a .net project that has a web reference to a service. I would like to update that web reference as part of every build. Is that possible?
0
[ 2, 184, 107, 31, 7499, 11100, 21, 2741, 2801, 35, 1895, 85, 60, 800, 3726, 3726, 31, 57, 21, 13, 9, 2328, 669, 30, 63, 21, 2741, 2801, 20, 21, 365, 9, 31, 83, 101, 20, 11100, 30, 2741, 2801, 28, 141, 16, 352, 1895, 9, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Multiple file upload === What is the best tool to upload multiple files (as well as directories) on a PHP-based site? I'm looking for something that is open source or free. I could do this easier by using ftp, but that is privilege I refuse to give the users. Uploading multiple files through a HTML form is a bit of a hassle when it comes to uploading more than 5-6 files, so that's out of the question. I've looked at some of the projects over at sourceforge.org, but I just wonder if anyone of you guys have any experience you want to share about this. Thanks!
0
[ 2, 1886, 3893, 71, 8294, 800, 3726, 3726, 98, 25, 14, 246, 5607, 20, 71, 8294, 1886, 6488, 13, 5, 472, 134, 28, 559, 1596, 6, 27, 21, 13, 26120, 8, 1281, 689, 60, 31, 22, 79, 699, 26, 301, 30, 25, 368, 1267, 54, 551, 9, 31...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
DB2 CLI result output === When running command-line queries in MySQL you can optionally use '**\G**' as a statement terminator, and instead of the result set coulmns being listed horizontally across the screen, it will list each column vertically, wich the corresponding data to the right. Is there a way to the same or a similar thing with the DB2 command line utility? Example regular MySQL result mysql> select * from tagmap limit 2; +----+---------+--------+ | id | blog_id | tag_id | +----+---------+--------+ | 16 | 8 | 1 | | 17 | 8 | 4 | +----+---------+--------+ Example Alternate MySQL result: mysql> select * from tagmap limit 2\G *************************** 1. row *************************** id: 16 blog_id: 8 tag_id: 1 *************************** 2. row *************************** id: 17 blog_id: 8 tag_id: 4 2 rows in set (0.00 sec) Obviously, this is much more useful when the columns are large strings, or when there are many columns in a result set, but this demonstrates the formatting better than I can probably explain it.
0
[ 2, 13, 9007, 135, 19391, 829, 5196, 800, 3726, 3726, 76, 946, 1202, 8, 1143, 9386, 2829, 19, 51, 18, 22402, 42, 92, 12832, 102, 275, 13, 22, 1409, 1, 263, 1409, 22, 28, 21, 3331, 13, 815, 28607, 15, 17, 700, 16, 14, 829, 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...
How do you implement a multiculture web application === I believe several of us have already worked on a project where not only the UI, but also data has to be supported in different languages. Such as - being able to provide and store a translation for what I'm writing here, for instance. What's more, I also believe several of us have some time-triggered events (such as when expiring membership access) where user location should be taken into account to calculate, like, midnight according to the right time-zone. Finally there's also the need to support Right to Left user interfaces accoring to certain languages and the use of diferent encodings when reading submitted data files (parsing text and excel data, for instance) Currently I'm storing all my translations for all my entities on a single table (not so pratical as it is very hard to find yourself when doing sql queries to look into a problem), setting UI translations mainly on satellite assemblies and not supporting neither time zones nor right to left design. What are your experiences when dealing with these challenges?
0
[ 2, 184, 107, 42, 8713, 21, 1889, 12518, 2741, 3010, 800, 3726, 3726, 31, 985, 238, 16, 182, 57, 614, 577, 27, 21, 669, 113, 52, 104, 14, 13, 5661, 15, 47, 67, 1054, 63, 20, 44, 1827, 19, 421, 2556, 9, 145, 28, 13, 8, 142, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Keeping Visual Studio Projects on a Network Drive === We just did a move from storing all files locally to a network drive. Problem is that is where my VS projects are also stored now. (No versioning system yet, working on that.) I know I heard of problems with doing this in the past, but never heard of a work-around. Is there a work around? So my VS is installed locally. The files are on a network drive. How can I get this to work?
0
[ 2, 2882, 3458, 1120, 2314, 27, 21, 982, 1493, 800, 3726, 3726, 95, 114, 144, 21, 780, 37, 25615, 65, 6488, 6680, 20, 21, 982, 1493, 9, 1448, 25, 30, 25, 113, 51, 4611, 2314, 50, 67, 8214, 130, 9, 13, 5, 251, 615, 68, 329, 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...
linuXploit_crew hit my webserver. === We run an old Windows NT Machine, fully patched running IIS4.0. Today we were hit by "linuXploit_crew", and they took down out websites for a minute or two. (luckily we were quick to notice a change on the websites and fix it within minutes of the attack). However -- After fixing the website, I'm left with trying to figure out ***HOW*** this happened. Looking in our FTP Logs, there's no changes in our default.asp files, and i see nothing out of the ordinary for Web Logs. Any ideas on how to pinpoint how they got in? We've only got 3 ports open, FTP, HTTP, and HTTPS (21,80,443) on a Cisco Firewall.
0
[ 2, 13024, 13221, 242, 1, 6037, 499, 770, 51, 2741, 10321, 106, 9, 800, 3726, 3726, 95, 485, 40, 315, 1936, 13, 2877, 1940, 15, 2337, 7331, 69, 946, 595, 18, 300, 9, 387, 9, 786, 95, 46, 770, 34, 13, 7, 1226, 7147, 13221, 242, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What are the best ways to publicize an open-source project? === Say you've got an open source API that you want to share with the world. What are the best ways of doing that? Since it's open source, paying for publicity isn't an option. * What are some well-known websites that accept articles written by third-parties? * Are there things like <a href="http://www.tucows.com/">Tucows</a> for open source? * How do <i>you</i> learn about the latest open-source software tools? <I>(I was going to mention my open-source API, but decided not to, because that felt sleazy. I'm genuinely interested in an answer, not in writing a self-serving post)</I>
0
[ 2, 98, 50, 14, 246, 2847, 20, 317, 2952, 40, 368, 8, 12097, 669, 60, 800, 3726, 3726, 395, 42, 22, 195, 330, 40, 368, 1267, 21, 2159, 30, 42, 259, 20, 1891, 29, 14, 126, 9, 98, 50, 14, 246, 2847, 16, 845, 30, 60, 179, 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...
How to implement custom JSON serialization from ASP.NET web service? === What options are there for serialization when returning instances of custom classes from a WebService? We have some classes with a number of child collection class properties as well as other properties that may or may not be set depending on usage. These objects are returned from an ASP.NET .asmx WebService decorated with the ScriptService attribute, so are serialized via JSON serialization when returned by the various WebMethods. The problem is that the out of the box serialization returns all public properties, regardless of whether or not they are used, as well as returning class name and other information in a more verbose manner than would be desired if you wanted to limit the amount of traffic. Currently, for the classes being returned we have added custom javascript converters that handle the JSON serializtion, and added them to the web.config as below: <system.web.extensions> <scripting> <webServices> <jsonSerialization> <converters> <add name="CustomClassConverter" type="Namespace.CustomClassConverter" /> </converters> </jsonSerialization> </webServices> </scripting> </system.web.extensions> But this requires a custom converter for each class. Is there any other way to change the out of the box JSON serialization, either through extending the service, creating a custom serializer or the like?
0
[ 2, 184, 20, 8713, 5816, 487, 528, 5956, 1829, 37, 28, 306, 9, 2328, 2741, 365, 60, 800, 3726, 3726, 98, 6368, 50, 80, 26, 5956, 1829, 76, 2485, 13946, 16, 5816, 2684, 37, 21, 2741, 11449, 60, 95, 57, 109, 2684, 29, 21, 234, 16...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Probably BAD coding style ..please cooment === i m checking where the new name already exists or not. Code 1 if(cmbxExistingGroups.Properties.Items.Cast<string>().ToList().Exists(txt => txt==txtNewGroup.Text.Trim())) { MessageBox.Show("already exists.", "Add new group"); } OR ELSE I COULD HAVE WRITTEN Code 2 foreach(var str in cmbxExistingGroups.Properties.Items) { if(str==txtNewGroup.Text) { MessageBox.Show("already exists.", "Add new group"); break; } } I wrote these two and thought i am exploiting language feature in code 1
0
[ 2, 910, 896, 13, 15458, 1034, 13, 9, 9, 6744, 10378, 1130, 800, 3726, 3726, 31, 307, 9886, 113, 14, 78, 204, 614, 5636, 54, 52, 9, 1797, 137, 100, 5, 150, 5024, 396, 21341, 8024, 18, 9, 10890, 106, 3915, 9, 2119, 79, 18, 9, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is the naming convention in Python for variable and function names? === Coming from a C# background the naming convention for variables and method names are usually either CamelCase or Pascal Case: // C# example string thisIsMyVariable = "a" public void ThisIsMyMethod() In Python, I have seen the above but I have also seen underscores being used: # python example this_is_my_variable = 'a' def this_is_my_function(): Is there a more preferable, definitive coding style for Python?
0
[ 2, 98, 25, 14, 10929, 3087, 19, 20059, 26, 7612, 17, 1990, 1817, 60, 800, 3726, 3726, 880, 37, 21, 272, 5910, 2395, 14, 10929, 3087, 26, 12157, 17, 2109, 1817, 50, 951, 694, 15386, 10325, 54, 18661, 610, 45, 12894, 272, 5910, 823,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to find oracle error codes that could result from a connection error? === I would like to handle an OracleException thrown when my network/database connection is interrupted, where can I find out what error codes I might can receive? I guess since we are talking about a connection interruption these would be technically TNS errors such as ORA-12560 "TNS:protocol adapter error." But I have noticed a couple others depending on where exactly the connection is lost and would like to get a full list.
0
[ 2, 184, 20, 477, 15759, 7019, 11358, 30, 110, 829, 37, 21, 2760, 7019, 60, 800, 3726, 3726, 31, 83, 101, 20, 3053, 40, 15759, 10066, 872, 6027, 76, 51, 982, 118, 18768, 8436, 2760, 25, 6354, 15, 113, 92, 31, 477, 70, 98, 7019, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Converting MS Word Documents to PDF in ASP.NET === Similar questions have been asked, but nothing exactly like mine, so here goes. We have a collection of Microsoft Word documents on an ASP.NET web server with merge fields whose values are filled in as a result of user form submissions. After the field merge, the server must convert the document to PDF and stream it down to the browser. Our first inclination was to use the Visual Studio Tools for Office API; however, we ran into [this warning from Microsoft][1]: > Microsoft does not currently recommend, and does not support, Automation of Microsoft Office applications from any unattended, non-interactive client application or component (including ASP, ASP.NET, DCOM, and NT Services), because Office may exhibit unstable behavior and/or deadlock when Office is run in this environment. It looks like the field manipulation can be done using the [Open XML SDK][2], but what's the best way to convert Word 2007 documents to PDF without opening Word? The optimal solution would be low-cost, scalable, have a low memory footprint, be easy to deploy, and have a .NET API. [1]: http://support.microsoft.com/?id=257757 [2]: http://msdn.microsoft.com/en-us/library/aa982683.aspx
0
[ 2, 19583, 4235, 833, 4374, 20, 13, 11124, 19, 28, 306, 9, 2328, 800, 3726, 3726, 835, 2346, 57, 74, 411, 15, 47, 626, 1890, 101, 1114, 15, 86, 235, 1852, 9, 95, 57, 21, 1206, 16, 7099, 833, 4374, 27, 40, 28, 306, 9, 2328, 27...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 a subdomain to identify a client === I'm working on building a Silverlight application whereas we want to be able to have a client hit a url like: http://{client}.domain.com/ and login, where the {client} part is their business name. so for example, google's would be: http://google.domain.com/ What I was wondering was if anyone has been able, in silverlight, to be able to use this subdomain model to make decisions on the call to the web server so that you can switch to a specific database to run a query? Unfortunately, it's something that is quite necessary for the project, as we are trying to make it easy for their employees to get their company specific information for our software.
0
[ 2, 568, 21, 972, 537, 6232, 20, 5808, 21, 6819, 800, 3726, 3726, 31, 22, 79, 638, 27, 353, 21, 1172, 3130, 3010, 5142, 95, 259, 20, 44, 777, 20, 57, 21, 6819, 770, 21, 287, 6362, 101, 45, 7775, 6903, 1, 150, 18513, 38, 1, 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...
Oracle ROWNUM === I have a complex query with group by and order by clause and I need a sorted row number (1...2...(n-1)...n) returned with every row. Using a ROWNUM (value is assigned to a row after it passes the predicate phase of the query but before the query does any sorting or aggregation) gives me a non-sorted list (4...567...123...45...). I cannot use application for counting and assigning numbers to each row.
0
[ 2, 15759, 3131, 6336, 800, 3726, 3726, 31, 57, 21, 1502, 25597, 29, 214, 34, 17, 389, 34, 9040, 17, 31, 376, 21, 22554, 3131, 234, 13, 5, 165, 9, 9, 9, 135, 9, 9, 9, 5, 103, 8, 165, 6, 9, 9, 9, 103, 6, 587, 29, 352, 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...
Do objects added to the SqlException.Data collection need to be [Serializable]? === Do objects added to the SqlException.Data collection need to be [Serializable]?
0
[ 2, 107, 3916, 905, 20, 14, 4444, 255, 10066, 872, 9, 18768, 1206, 376, 20, 44, 636, 4104, 2815, 3186, 579, 500, 60, 800, 3726, 3726, 107, 3916, 905, 20, 14, 4444, 255, 10066, 872, 9, 18768, 1206, 376, 20, 44, 636, 4104, 2815, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Is Ruby a functional language? === Wikipedia says so, but I'm not convinced.Why or why not?
0
[ 2, 25, 10811, 21, 7652, 816, 60, 800, 3726, 3726, 20169, 898, 86, 15, 47, 31, 22, 79, 52, 5329, 9, 2256, 54, 483, 52, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
VB.Net Automating WORD for Spell Check Capabilities === An application currently in development has the requirements for using MS Word to perform spell check on certain textareas within the application. I currently have Office 2007 (which is the Office 12 com objects). My question is, if I add in the Office 12 objects what will happen on boxes which have Office 2003? This is in regards to both other development boxes as well as the end users. Am I correct in believing that the end result will be that the spell capabilities will not be available for those users? And if I used an Office 11 object would that mean that the users would be unable to perform the spellchecks if they have Office 07 installed?
0
[ 2, 13, 20468, 9, 2328, 3108, 79, 1880, 833, 26, 4762, 2631, 10209, 800, 3726, 3726, 40, 3010, 871, 19, 522, 63, 14, 4786, 26, 568, 4235, 833, 20, 2985, 4762, 2631, 27, 1200, 1854, 17760, 18, 363, 14, 3010, 9, 31, 871, 57, 488, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Python Web Services === Elementree has become the accepted standard for interacting with xml. What is the prevalent web service/SOAP library in use today?
0
[ 2, 20059, 2741, 687, 800, 3726, 3726, 4520, 9495, 63, 533, 14, 2217, 1236, 26, 24747, 29, 23504, 9, 98, 25, 14, 17584, 2741, 365, 118, 656, 2552, 1248, 19, 275, 786, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
How do I scroll a UITableView to a section that contains no rows? === In an app I'm working on, I have a sectioned UITableView that can contain a section containing zero rows. I want to be able to scroll to this section using scrollToRowAtIndexPath:atScrollPosition:animated: but I get an error when I try to scroll to this section due to the lack of child rows. Apple's calendar application is able to do this, if you look at your calendar in list view, and there are no events in your calendar for today, an empty section is inserted for today and you can scroll to it using the Today button in the toolbar at the bottom of the screen. As far as I can tell Apple may be using a customized UITableView, or they're using a private API... The only workaround I can think of is to insert an empty UITableCell in that's 0 pixels high and scroll to that. But it's my understanding that having cells of varying heights is really bad for scrolling performance. Still I'll try it anyway, maybe the performance hit won't be too bad.
0
[ 2, 184, 107, 31, 12159, 21, 13, 11193, 579, 4725, 20, 21, 1050, 30, 1588, 90, 11295, 60, 800, 3726, 3726, 19, 40, 4865, 31, 22, 79, 638, 27, 15, 31, 57, 21, 1050, 69, 13, 11193, 579, 4725, 30, 92, 3717, 21, 1050, 3503, 4606, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Determine logged on user on a remote Windows machine === Is there a way to determine who is logged on to a particular (remote) machine given the IP address (or the workstation name) of the machine? - The machines in question are on an Active Directory Domain - The user running the script probably won't have any special rights on either their local or the remote machine - Operating system is Windows XP Any programming language is fine but ideally - VBScript (yeah I know) - C# - Java - DOS Batch file
0
[ 2, 3746, 13, 19287, 27, 4155, 27, 21, 5388, 1936, 1940, 800, 3726, 3726, 25, 80, 21, 161, 20, 3746, 72, 25, 13, 19287, 27, 20, 21, 1498, 13, 5, 99, 20209, 6, 1940, 504, 14, 15735, 3218, 13, 5, 248, 14, 170, 10839, 204, 6, 16...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is it possible to interpolate my angle bracket, percent, equals <%= %> syntax in external javascript files? === Often times when mixing jquery with asp.net I need to use asp .net angle bracket percent, <% %>, syntax within a jquery selector. If I would like to seperate the javascript from markup into different files is there still a way to evaluate my javascript file so the angle bracket percents are interpolated before reaching the client browser?
0
[ 2, 25, 32, 938, 20, 23336, 1373, 51, 5334, 19543, 15, 2091, 15, 2747, 18, 13, 1, 11881, 3726, 13, 11881, 1, 22649, 19, 4886, 8247, 8741, 6488, 60, 800, 3726, 3726, 478, 436, 76, 5826, 487, 8190, 93, 29, 28, 306, 9, 2328, 31, 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...
UnsatisfiedLinkError: The specified procedure could not be found === I'm writing some JNI code in C++ to be called from an applet on Windows XP. I've been able to successfully run the applet and have the JNI library loaded and called, even going so far as having it call functions in other DLLs. I got this working by setting up the PATH system environment variable to include the directory all of my DLLs are in. So, the problem, is that I add another call that uses a new external DLL, and suddenly when loading the library, an UnsatisfiedLinkError is thrown. The message is: 'The specified procedure could not be found'. This doesn't seem to be a problem with a missing dependent DLL, because I can remove a dependent DLL and get a different message about dependent DLL missing. From what I've been able to find online, it appears that this message means that a native Java function implementation is missing from the DLL, but it's odd that it works fine without this extra bit of code. Does anyone know what might be causing this? What kinds of things can give a 'The specified procedure could not be found' messages for an UnsatisifedLinkError?
0
[ 2, 367, 18, 5166, 18, 1707, 69, 6258, 29992, 45, 14, 9931, 7004, 110, 52, 44, 216, 800, 3726, 3726, 31, 22, 79, 1174, 109, 487, 889, 1797, 19, 272, 20512, 20, 44, 227, 37, 40, 4037, 38, 27, 1936, 23045, 9, 31, 22, 195, 74, 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...
subversion diff including new files === I have some local changes to an open source project which uses Subversion as its source control. My change adds a file, but this file is not included in the output of "svn diff". (It may be worth noting that the new file is a binary, not plain text.) How can I make a patch which includes the new files? ------- $ svn st A tests/foo.zip $ svn diff $
0
[ 2, 972, 10898, 20811, 215, 78, 6488, 800, 3726, 3726, 31, 57, 109, 375, 1693, 20, 40, 368, 1267, 669, 56, 2027, 972, 10898, 28, 82, 1267, 569, 9, 51, 753, 10621, 21, 3893, 15, 47, 48, 3893, 25, 52, 506, 19, 14, 5196, 16, 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...
log4net Configuration Section for NUnit Test Project === I am running NUnit with the project named AssemblyTest.nunit. The test calls another assembly which uses the log4net assembly. This is using nunit version 2.4.3 with the .net 2.0 framework. In TestFixtureSetup I am calling log4net.Config.XmlConfigurator.Configure( ) and am getting the following error: <pre> System.Configuration.ConfigurationErrorsException: Configuration system failed to initialize ---> System.Configuration.ConfigurationErrorsException: Unrecognized configuration section log4net. (C:\path\to\assembly.dll.config line 7) </pre> Is there a way to fix this without renaming the config file to 'AssemblyTest.config'?
0
[ 2, 6738, 300, 2328, 8091, 1050, 26, 10210, 242, 1289, 669, 800, 3726, 3726, 31, 589, 946, 10210, 242, 29, 14, 669, 377, 1475, 10543, 9, 103, 15464, 9, 14, 1289, 3029, 226, 1475, 56, 2027, 14, 6738, 300, 2328, 1475, 9, 48, 25, 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 do I sort my code in Visual Studio 2008? === Short of cutting and pasting, is there a way to sort the methods in my classes in Visual Studio 2008? I like orderly code.
0
[ 2, 184, 107, 31, 2058, 51, 1797, 19, 3458, 1120, 570, 60, 800, 3726, 3726, 502, 16, 5378, 17, 640, 68, 15, 25, 80, 21, 161, 20, 2058, 14, 3195, 19, 51, 2684, 19, 3458, 1120, 570, 60, 31, 101, 389, 102, 1797, 9, 3, 0, 0, 0,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Synchronized ListViews in .Net === I'm working on a control to tie together the view from one ListView to another so that when the master ListView is scrolled, the child ListView view is updated to match. So far I've been able to get the child ListViews to update their view when the master scrollbar buttons are clicked. The problem is that when clicking and dragging the ScrollBar itself, the child ListViews are not updated. I've looked at the messages being sent using Spy++ and the correct messages are getting sent. Here is my current code: public partial class LinkedListViewControl : ListView { [DllImport("User32.dll")] private static extern bool SendMessage(IntPtr hwnd, UInt32 msg, IntPtr wParam, IntPtr lParam); [DllImport("User32.dll")] private static extern bool ShowScrollBar(IntPtr hwnd, int wBar, bool bShow); [DllImport("user32.dll")] private static extern int SetScrollPos(IntPtr hWnd, int wBar, int nPos, bool bRedraw); private const int WM_HSCROLL = 0x114; private const int SB_HORZ = 0; private const int SB_VERT = 1; private const int SB_CTL = 2; private const int SB_BOTH = 3; private const int SB_THUMBPOSITION = 4; private const int SB_THUMBTRACK = 5; private const int SB_ENDSCROLL = 8; public LinkedListViewControl() { InitializeComponent(); } private readonly List<ListView> _linkedListViews = new List<ListView>(); public void AddLinkedView(ListView listView) { if (!_linkedListViews.Contains(listView)) { _linkedListViews.Add(listView); HideScrollBar(listView); } } public bool RemoveLinkedView(ListView listView) { return _linkedListViews.Remove(listView); } private void HideScrollBar(ListView listView) { //Make sure the list view is scrollable listView.Scrollable = true; //Then hide the scroll bar ShowScrollBar(listView.Handle, SB_BOTH, false); } protected override void WndProc(ref Message msg) { if (_linkedListViews.Count > 0) { //Look for WM_HSCROLL messages if (msg.Msg == WM_HSCROLL) { foreach (ListView view in _linkedListViews) { SendMessage(view.Handle, WM_HSCROLL, msg.WParam, IntPtr.Zero); } } } } } Based on [this post][1] on the MS Tech Forums I tried to capture and process the SB_THUMBTRACK event: protected override void WndProc(ref Message msg) { if (_linkedListViews.Count > 0) { //Look for WM_HSCROLL messages if (msg.Msg == WM_HSCROLL) { Int16 hi = (Int16)((int)msg.WParam >> 16); Int16 lo = (Int16)msg.WParam; foreach (ListView view in _linkedListViews) { if (lo == SB_THUMBTRACK) { SetScrollPos(view.Handle, SB_HORZ, hi, true); int wParam = 4 + 0x10000 * hi; SendMessage(view.Handle, WM_HSCROLL, (IntPtr)(wParam), IntPtr.Zero); } else { SendMessage(view.Handle, WM_HSCROLL, msg.WParam, IntPtr.Zero); } } } } // Pass message to default handler. base.WndProc(ref msg); } This will update the location of the child ListView ScrollBar but does not change the actual view in the child. So my questions are: 1. Is it possible to update the child ListViews when the master ListView ScrollBar is dragged? 2. If so, how? [1]: http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=3111420&SiteID=1
0
[ 2, 27202, 968, 4725, 18, 19, 13, 9, 2328, 800, 3726, 3726, 31, 22, 79, 638, 27, 21, 569, 20, 3795, 429, 14, 1418, 37, 53, 968, 4725, 20, 226, 86, 30, 76, 14, 1129, 968, 4725, 25, 12159, 69, 15, 14, 850, 968, 4725, 1418, 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...
From SourceSafe to Team Foundation Server === Our team would like to move from the Visual SourceSafe (VSS) to the Team Foundation Server (TFS). I know that the TFS is much more than just a version control system, but for the first time I would like to use it this way. Currently our projects are organized within the single solution that consists of the shared part (common library) and many customer projects. Is there some kind of migration guide that would describe such a challenge? Or TFS enforces its own usage scenarios (versioning of projects, releases, etc.)?
0
[ 2, 37, 1267, 18166, 20, 173, 1304, 8128, 800, 3726, 3726, 318, 173, 83, 101, 20, 780, 37, 14, 3458, 1267, 18166, 13, 5, 710, 18, 18, 6, 20, 14, 173, 1304, 8128, 13, 5, 11720, 18, 6, 9, 31, 143, 30, 14, 13, 11720, 18, 25, 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...
SqlMembershipProvider initialize method not being called === I have done a custom implementation of MembershipProvider but for some reason the initialize method is not being invoked and thus my provider is not setting up properly from the config parameters, who invokes it in the first place and how do i get it to work.
0
[ 2, 4444, 255, 6990, 2418, 26735, 139, 2104, 2952, 2109, 52, 142, 227, 800, 3726, 3726, 31, 57, 677, 21, 5816, 6123, 16, 4363, 26735, 139, 47, 26, 109, 1215, 14, 2104, 2952, 2109, 25, 52, 142, 26252, 17, 1086, 51, 11747, 25, 52, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 way to make cffile.oldFileSize return a correct value? === When working with cffile in ColdFusion, after an upload of a file to a webserver, the cffile structure is created that is supposed to have a value in it called "oldFileSize". Every time I do an upload and examine that value, it has the new file's size, not the overwritten file's size. Is there some setting somewhere to correct that or is this a bug in cffile in cf8?
0
[ 2, 25, 80, 21, 161, 20, 233, 10084, 16877, 9, 1218, 16877, 10454, 788, 21, 4456, 1923, 60, 800, 3726, 3726, 76, 638, 29, 10084, 16877, 19, 1191, 9818, 15, 75, 40, 71, 8294, 16, 21, 3893, 20, 21, 2741, 10321, 106, 15, 14, 10084, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 OK to put a database initialization call in a C# constructor? === I've seen this is various codebases, and wanted to know if this generally frowned upon or not. For example: public class MyClass { public int Id; public MyClass() { Id = new Database().GetIdFor(typeof(MyClass)); } }
0
[ 2, 25, 32, 5854, 20, 442, 21, 6018, 2104, 1829, 645, 19, 21, 272, 5910, 6960, 248, 60, 800, 3726, 3726, 31, 22, 195, 541, 48, 25, 617, 1797, 8436, 18, 15, 17, 417, 20, 143, 100, 48, 1469, 6594, 685, 54, 52, 9, 26, 823, 45, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to execute GetLastError() while debugging in Visual Studio === You're stepping through C/C++ code and have just called a Win32 API that has failed (typically by returning some unhelpful generic error code, like 0). Your code doesn't make a subsequent GetLastError() call whose return value you could inspect for further error information. How can you get the error value without recompiling and reproducing the failure? Entering "GetLastError()" in the Watch window doesn't work ("syntax error").
0
[ 2, 184, 20, 15644, 164, 8558, 29992, 5, 6, 133, 121, 16254, 2762, 19, 3458, 1120, 800, 3726, 3726, 42, 22, 99, 9451, 120, 272, 118, 150, 20512, 1797, 17, 57, 114, 227, 21, 628, 3125, 21, 2159, 30, 63, 1702, 13, 5, 26139, 34, 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...
How do I access sqlite db instance on iPhone? === I'm developing an iphone app that uses the built in sqlite db. I can view the db when running the simulator but how do i access the db instance on the physical device?? Any help is greatly appreciated.
0
[ 2, 184, 107, 31, 1381, 4444, 10601, 13, 9007, 4851, 27, 21024, 60, 800, 3726, 3726, 31, 22, 79, 3561, 40, 21024, 4865, 30, 2027, 14, 392, 19, 4444, 10601, 13, 9007, 9, 31, 92, 1418, 14, 13, 9007, 76, 946, 14, 24565, 47, 184, 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...
Working on multiple projects === I am often involved in multiple programming projects at the same time. I sometimes find it hard to time-share between those projects efficiently. For example: - Some projects get too little attention, either because they are less fun or because I forget about them. - Sometimes it feels like the context-switching between projects takes too much time. - It is difficult to prioritize between projects, and to determine how much the priority should affect the schedule. - Interruptions occur (both from external sources and by suddenly coming up with something myself), forcing me to suddenly move to another project. Do you have any good methods, tools or other suggestions for coping with multiple projects running in parallel?
0
[ 2, 638, 27, 1886, 2314, 800, 3726, 3726, 31, 589, 478, 1013, 19, 1886, 3143, 2314, 35, 14, 205, 85, 9, 31, 1030, 477, 32, 552, 20, 85, 8, 16608, 128, 273, 2314, 20519, 9, 26, 823, 45, 13, 8, 109, 2314, 164, 266, 265, 1220, 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...
Determine if a program is running on a Remote Desktop === Is there a way my program can determine when it's running on a Remote Desktop (Terminal Services)? I'd like to enable an "inactivity timeout" on the program when it's running on a Remote Desktop session. Since users are notorious for leaving Remote Desktop sessions open, I want my program to terminate after a specified period of inactivity. But, I don't want the inactivity timeout enabled for non-RD users.
0
[ 2, 3746, 100, 21, 625, 25, 946, 27, 21, 5388, 17404, 800, 3726, 3726, 25, 80, 21, 161, 51, 625, 92, 3746, 76, 32, 22, 18, 946, 27, 21, 5388, 17404, 13, 5, 20907, 687, 6, 60, 31, 22, 43, 101, 20, 9240, 40, 13, 7, 108, 19348...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
CSS/Javascript Use Div to grey out section of page === Does anybody know a way with Javascript or CSS to basically grey out a certain part of a form/div in html. I have a 'User Profile' form where I want to disable part of it for a 'Non-Premium' member, but want the user to see what is behind the form and place a 'Call to Action' on top of it. Anybody know an easy way to do this either via CSS or Javascript?
0
[ 2, 272, 18, 18, 118, 1004, 1385, 8741, 275, 13, 12916, 20, 2682, 70, 1050, 16, 2478, 800, 3726, 3726, 630, 11181, 143, 21, 161, 29, 8247, 8741, 54, 272, 18, 18, 20, 11374, 2682, 70, 21, 1200, 141, 16, 21, 505, 118, 12916, 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...
Confused on count(*) and self joins === I want to return all application dates for the current month and for the current year. This must be simple, however I can not figure it out. I know I have 2 dates for the current month and 90 dates for the current year. Right, Left, Outer, Inner I have tried them all, just throwing code at the wall trying to see what will stick and none of it works. I either get 2 for both columns or 180 for both columns. Here is my latest select statement. Sorry I can not figure out the indent markdown? SELECT count(a.evdtApplication) AS monthApplicationEntered, count (b.evdtApplication) AS yearApplicationEntered <br> FROM tblEventDates a <br> RIGHT OUTER JOIN tblEventDates b ON a.LOANid = b.loanid <br> WHERE datediff(mm,a.evdtApplication,getdate()) = 0 <br> AND datediff(yy,a.evdtApplication, getdate()) = 0 <br> AND datediff(yy,b.evdtApplication,getdate()) = 0 <br>
0
[ 2, 4230, 27, 2468, 5, 2483, 6, 17, 1119, 10612, 800, 3726, 3726, 31, 259, 20, 788, 65, 3010, 4076, 26, 14, 866, 1617, 17, 26, 14, 866, 159, 9, 48, 491, 44, 1935, 15, 207, 31, 92, 52, 1465, 32, 70, 9, 31, 143, 31, 57, 172, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 loop through a MySQL query via PDO in PHP? === I'm slowly moving all of my LAMP websites from mysql_ functions to PDO functions and I've hit my first brick wall. I don't know how to loop through results with a parameter. I am fine with the following: foreach ($database->query("SELECT * FROM widgets") as $results) { echo $results["widget_name"]; } However if I want to do something like this: foreach ($database->query("SELECT * FROM widgets WHERE something='something else'") as $results) { echo $results["widget_name"]; } Obviously the 'something else' will be dynamic.
0
[ 2, 184, 107, 31, 5293, 120, 21, 51, 18, 22402, 25597, 1197, 351, 537, 19, 13, 26120, 60, 800, 3726, 3726, 31, 22, 79, 1447, 1219, 65, 16, 51, 6792, 13931, 37, 51, 18, 22402, 1, 3719, 20, 351, 537, 3719, 17, 31, 22, 195, 770, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I make a ListView row draggable in .NET? === I am not the most experienced GUI programmer, so bear with me here. I have a custom list view. I would like to be able to drag a row from the ListView to another control on a form. I know how to catch events that are fired when an object is dragged to a control, but I am not sure how to make a row itself draggable. I could always hack together my own solution, but I am hoping that there is a better (read: easier) way of doing this. EDIT: i would really like to drag a copy of the row, but I can always work out the details myself.
0
[ 2, 184, 107, 31, 233, 21, 968, 4725, 3131, 5501, 263, 579, 19, 13, 9, 2328, 60, 800, 3726, 3726, 31, 589, 52, 14, 127, 3882, 9457, 17968, 15, 86, 2746, 29, 55, 235, 9, 31, 57, 21, 5816, 968, 1418, 9, 31, 83, 101, 20, 44, 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...
Is there any reasonable way to upgrade from subversion to cvs? === My company unwittingly switched from cvs to subversion and now we're all wishing we had cvs back. I know there's tools to migrate history and changes from cvs to svn and there's no equivalent to do the reverse. Any suggestions or ideas on how to do this?
0
[ 2, 25, 80, 186, 9954, 161, 20, 9483, 37, 972, 10898, 20, 13, 12732, 18, 60, 800, 3726, 3726, 51, 237, 367, 13098, 68, 102, 6667, 37, 13, 12732, 18, 20, 972, 10898, 17, 130, 95, 22, 99, 65, 11227, 95, 41, 13, 12732, 18, 97, 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...
Animating a custom Button ControlTemplate Foreground === I want to change/animate the Foreground property of a custom button control template depending on the control's state. Pre-RC0, I set the Foreground of the ContentPresenter, gave it an x:Name, and referenced it in the VisualStateManager transitions. Now, ContentPresenter no longer has a Foreground, since it doesn't inherit from Control anymore. I also cannot wrap it in a TextBlock which has the Foreground property set. Usually, I would set the Foreground in the Style which is applied to the templated control. But I cannot reference that from the VisualStateManager transitions / states. Help is greatly appreciated.
0
[ 2, 14487, 1203, 21, 5816, 5167, 569, 9577, 6554, 26, 62, 8810, 800, 3726, 3726, 31, 259, 20, 753, 118, 3443, 5281, 14, 26, 62, 8810, 1354, 16, 21, 5816, 5167, 569, 22894, 4758, 27, 14, 569, 22, 18, 146, 9, 782, 8, 5453, 387, 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...
One To Many To Itself === How would one structure a table for an entity that can have a one to many relationship to itself? Specifically, I'm working on an app to track animal breeding. Each animal has an ID; it's also got a sire ID and a dame ID. So it's possible to have a one to many from the sire or dame to its offspring. I would be inclined to something like this: ID INT NOT NULL PRIMARY KEY SIRE_ID INT DAME_ID INT and record a null value for those animals which were purchased and added to the breeding stock and an ID in the table for the rest. So: 1. Can someone point me to an article/web page that discusses modeling this sort of relationship? 2. Should the ID be an INT or some sort of String? A NULL in the INT would indicate that the animal has no parents in the database but a String with special flag values could be used to indicate the same thing. 3. Would this possibly be best modeled via two tables? I mean one table for the animals and a separate table solely indicating kinship e. g.: Animal ID INT NOT NULL PRIMARY KEY Kinship ID INT NOT NULL PRIMARY KEY FOREIGN KEY SIRE_ID INT PRIMARY KEY FOREIGN KEY DAME_ID INT PRIMARY KEY FOREIGN KEY I apologize for the above: my SQL is rusty. I hope it sort of conveys what I'm thinking about.
0
[ 2, 53, 20, 151, 20, 1145, 800, 3726, 3726, 184, 83, 53, 1411, 21, 859, 26, 40, 9252, 30, 92, 57, 21, 53, 20, 151, 1429, 20, 1145, 60, 3524, 15, 31, 22, 79, 638, 27, 40, 4865, 20, 792, 2383, 8183, 9, 206, 2383, 63, 40, 4924...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Changing short date format in Ubuntu === How do I change the system-wide short date format in Ubuntu? Currently, Thunderbird is showing dates in the DD/MM/YY format, and I would like to change it to MM/DD/YY or YYYY-MM-DD. The best information I can find so far is in this thread: http://ubuntuforums.org/showthread.php?t=193916
0
[ 2, 4226, 502, 1231, 2595, 19, 287, 12968, 2473, 800, 3726, 3726, 184, 107, 31, 753, 14, 329, 8, 8077, 502, 1231, 2595, 19, 287, 12968, 2473, 60, 871, 15, 25763, 25, 3187, 4076, 19, 14, 13, 8096, 118, 3363, 118, 93, 93, 2595, 15,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Subsonic and sp_help_job === Is it possible for subsonic to access dbo.sp_help_job?
0
[ 2, 972, 17766, 17, 3782, 1, 14593, 1, 1636, 220, 800, 3726, 3726, 25, 32, 938, 26, 972, 17766, 20, 1381, 13, 43, 1192, 9, 3401, 1, 14593, 1, 1636, 220, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
C# keyword usage virtual+override vs. new === Why use the "virtual" and "override" keywords in C# when a non-virtual method can be overridden using the "new" keyword?
0
[ 2, 272, 5910, 1246, 9587, 7514, 6599, 2430, 2549, 11891, 4611, 9, 78, 800, 3726, 3726, 483, 275, 14, 13, 7, 8145, 38, 6948, 7, 17, 13, 7, 2549, 11891, 7, 1246, 12827, 19, 272, 5910, 76, 21, 538, 8, 8145, 38, 6948, 2109, 92, 44...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0...
How can I create a temporary file for writing in C++ on a Linux platform? === In C++, on Linux, how can I write a function to return a temporary filename that I can then open for writing? The filename should be as unique as possible, so that another process using the same function won't get the same name.
0
[ 2, 184, 92, 31, 1600, 21, 4700, 3893, 26, 1174, 19, 272, 20512, 27, 21, 13024, 2452, 60, 800, 3726, 3726, 19, 272, 20512, 15, 27, 13024, 15, 184, 92, 31, 2757, 21, 1990, 20, 788, 21, 4700, 3893, 7259, 30, 31, 92, 94, 368, 26, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is the difference between Ruby and Python versions of the "self" keyword? === I've done some Python but have just now starting to use Ruby I could use a good explanation of the difference between the self keyword in these two languages. **Obvious on first glance:** Python methods receive self as an explicit argument, whereas Ruby does not. Ruby sometimes has methds explicitly defined as part of self using dot notation. **Initial Googling reveals** <http://rubylearning.com/satishtalim/ruby_self.html> <http://www.ibiblio.org/g2swap/byteofpython/read/self.html>
0
[ 2, 98, 25, 14, 2841, 128, 10811, 17, 20059, 3281, 16, 14, 13, 7, 8411, 7, 1246, 9587, 60, 800, 3726, 3726, 31, 22, 195, 677, 109, 20059, 47, 57, 114, 130, 1422, 20, 275, 10811, 31, 110, 275, 21, 254, 5764, 16, 14, 2841, 128, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Django: Model limit_choices_to={'user': user} === I went to all the documentation, also I went to the IRC channel (BTW a great community) and they told me that is not possible to create a model and limit choices in a field where the 'current user' is in a ForeignKey. I will try to explain this with an example: class Project(models.Model): name = models.CharField(max_length=100) employees = models.ManyToManyField(Profile, limit_choices_to={'active': '1'}) class TimeWorked(models.Model): project = models.ForeignKey(Project, limit_choices_to={'user': user}) hours = models.PositiveIntegerField() Of course that code doesn't work because there is no 'user' object, but that was my idea and I was trying to send the object 'user' to the model to just limit the choices where the current user has projects, I don't want to see projects where I'm not in. Thank you very much if you can help me or give me any advice, I don't want to you write all the app, just a tip how to deal with that. I have 2 days with this in my head and I can't figure it out :(
0
[ 2, 3857, 14541, 45, 1061, 4496, 1, 23714, 18, 1, 262, 3726, 1, 22, 16704, 22, 45, 4155, 1, 800, 3726, 3726, 31, 296, 20, 65, 14, 13945, 15, 67, 31, 296, 20, 14, 31, 5453, 1318, 13, 5, 220, 38, 499, 21, 374, 514, 6, 17, 59,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What options do exist now to implement UTF8 in Ruby and RoR? === Following the development of Ruby very closely I learned that detailed character encoding is implemented in Ruby 1.9. My question for now is: How may Ruby be used at the moment to talk to a database that stores all data in UTF8? Background: I am involved in a new project where Ruby/RoR is at least an option. But the project needs to rely on an internationalized character set (it's spread over many countries), preferably UTF8. So how do you deal with that? Thanks in advance.
0
[ 2, 98, 6368, 107, 3182, 130, 20, 8713, 287, 11720, 457, 19, 10811, 17, 761, 248, 60, 800, 3726, 3726, 249, 14, 522, 16, 10811, 253, 3368, 31, 2691, 30, 6036, 925, 19608, 25, 6807, 19, 10811, 137, 9, 518, 9, 51, 1301, 26, 130, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Determine if a resource exists in ResourceManager. === Is there anyway to determine if a ResourceManager contains a named resource? Currently I am catching the MissingManifestResourceException but I hate having to use Exceptions for non-exceptional situations. There must be some way to enumerate the name value pairs of a ResourceManager through reflection, or something?
0
[ 2, 3746, 100, 21, 6577, 5636, 19, 6577, 22256, 9, 800, 3726, 3726, 25, 80, 2774, 20, 3746, 100, 21, 6577, 22256, 1588, 21, 377, 6577, 60, 871, 31, 589, 9436, 14, 2863, 8002, 9962, 99, 12097, 10066, 872, 47, 31, 3223, 452, 20, 27...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 does Flex Builder fail to connect the app so often? === Flex Builder often fails to connect to the app that it's supposed to debug. After a minute or so it times-out and says that it couldn't connect. The only way I can get it to stop doing this is by restarting Eclipse. Very annoying. Anyone know why this is? I'm using FB 3.1 and Firefox on Win XP. Many thanks!
0
[ 2, 483, 630, 14409, 14960, 7476, 20, 6379, 14, 4865, 86, 478, 60, 800, 3726, 3726, 14409, 14960, 478, 13614, 20, 6379, 20, 14, 4865, 30, 32, 22, 18, 2293, 20, 121, 16254, 9, 75, 21, 2038, 54, 86, 32, 436, 8, 1320, 17, 898, 30,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to put breakpoint in every function of .cpp file? === Is there a macro that does it? Which DTE objects to use?
0
[ 2, 184, 20, 442, 1442, 3132, 19, 352, 1990, 16, 13, 9, 150, 3421, 3893, 60, 800, 3726, 3726, 25, 80, 21, 9069, 30, 630, 32, 60, 56, 13, 43, 591, 3916, 20, 275, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Does dependency injection break the Law of Demeter === I have been adding dependency injection to my code because it makes by code much easier to Unit test through mocking. However I am requiring objects higher up my call chain to have knowledge of objects further down the call chain. Does this break the Law of Demeter? If so does it matter?
0
[ 2, 630, 26835, 13646, 1442, 14, 451, 16, 121, 7307, 800, 3726, 3726, 31, 57, 74, 4721, 26835, 13646, 20, 51, 1797, 185, 32, 1364, 34, 1797, 212, 4950, 20, 1237, 1289, 120, 18446, 9, 207, 31, 589, 9052, 3916, 1184, 71, 51, 645, 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...
Finding the time taken to send messages with WCF net.tcp === I’m writing a prototype WCF enabled communications app, to try and find out any issues I’ll have upgrading my existing “sending xml over tcp to communicate” apps I’ve got. I’m using Callback Contracts to register clients with a server (Singleton in ServiceHost) and so far all the communications is work. I can connect multiple clients to the server and send a broadcast from the server that is received by all clients. I can block a particular client and the other clients still receive the calls. This is good. To continue my learning and evaluation of performance I would like the client to record what time the server sends each message, as well as what time the client receives that same message. How should I best go about this? Is there something similar to SOAP extensions, where I can add to the outgoing from the server and incoming to the client? Or would I need to add a “timeSent” parameter to every method that the server calls on the client and record the time received on the client (yuck!)? Is there a better way to accomplish this?
0
[ 2, 3007, 14, 85, 658, 20, 2660, 7561, 29, 11801, 410, 4275, 9, 38, 7439, 800, 3726, 3726, 31, 1, 79, 1174, 21, 7063, 11801, 410, 9338, 3380, 4865, 15, 20, 1131, 17, 477, 70, 186, 1549, 31, 1, 211, 57, 26939, 51, 3149, 13, 1, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Visual Studio Debugger + Break when a value changes? === I've always wondered if there was a way to place a watch on variable and only have visual studio break when that value changes...it would make it so much easier to find tricky state issues. Does anyone know if this can be done?
0
[ 2, 3458, 1120, 121, 2345, 11356, 2754, 1442, 76, 21, 1923, 1693, 60, 800, 3726, 3726, 31, 22, 195, 550, 3519, 100, 80, 23, 21, 161, 20, 209, 21, 1455, 27, 7612, 17, 104, 57, 3458, 1120, 1442, 76, 30, 1923, 1693, 9, 9, 9, 242, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 way to keep Visual Studio from modifying the solution file after every test run? === Visual Studio seems to be modifying a list of .vsmdi files in my .sln every time I run a unit test. This is annoying because my source control client thinks the file needs to be checked in even though I don't want to check it in. Is there any way to keep Visual Studio from munging the .sln file after every test?
0
[ 2, 25, 80, 21, 161, 20, 643, 3458, 1120, 37, 17579, 68, 14, 4295, 3893, 75, 352, 1289, 485, 60, 800, 3726, 3726, 3458, 1120, 2206, 20, 44, 17579, 68, 21, 968, 16, 13, 9, 710, 18, 79, 1115, 6488, 19, 51, 13, 9, 18, 16600, 352...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Many-to-Many with "Primary" === I'm working on a database that needs to represent computers and their users. Each computer can have multiple users and each user can be associated with multiple computers, so it's a classic many-to-many relationship. However, there also needs to be a concept of a "primary" user. I have to be able to join against the primary user to list all computers with their primary users. I'm not sure what the best way structure this in the database: 1) As I'm currently doing: linking table with a boolean IsPrimary column. Joining requires something like ON (c.computer_id = l.computer_id AND l.is_primary = 1). It works, but it feels wrong because it's not easy to constrain the data to only have one primary user per computer. 2) A field on the computer table that points directly at a user row, all rows in the user table represent non-primary users. This represents the one-primary-per-computer constraint better, but makes getting a list of computer-users harder. 3) A field on the computer table linking to a row in the linking table. Feels strange... 4) Something else? What is the 'relational' way to describe this relationship?
0
[ 2, 151, 8, 262, 8, 14842, 29, 13, 7, 29584, 7, 800, 3726, 3726, 31, 22, 79, 638, 27, 21, 6018, 30, 2274, 20, 3501, 7774, 17, 66, 3878, 9, 206, 1428, 92, 57, 1886, 3878, 17, 206, 4155, 92, 44, 1598, 29, 1886, 7774, 15, 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...
Poll: How do you decide which API function documentations to read and how seriously? === Suppose that you are writing or maintaining a piece of code that uses some API that you are not 100% familiar with. How do you decide whether to read the documentation of a certain call target, and how much time to spend reading it? How do you decide not to read it? (Let's assume you can read it by opening the HTML documentation, inspecting the source code, or using the hover mechanism in the IDE).
0
[ 2, 4994, 45, 184, 107, 42, 4073, 56, 21, 2159, 1990, 13945, 18, 20, 1302, 17, 184, 4818, 60, 800, 3726, 3726, 5787, 30, 42, 50, 1174, 54, 8215, 21, 1855, 16, 1797, 30, 2027, 109, 21, 2159, 30, 42, 50, 52, 12849, 3694, 29, 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...
What is the big deal with BUILDING 64-bit versions of binaries === There are a ton of drivers & famous applications that are not available in 64-bit. Adobe for instance does not provider a 64-bit Flash player plugin for Internet Explorer. And because of that, even though I am running 64-bit Vista, I have to run 32-bit IE. Microsoft Office, Visual Studio also don't ship in 64-bit AFAIK. Now personally, I haven't had much problems building my applications in 64-bit. I just have to remember a few rules of thumb, e.g. always use SIZE_T instead of UINT32 for string lengths etc. So my question is, what is preventing people from building for 64-bit?
0
[ 2, 98, 25, 14, 580, 1183, 29, 353, 4384, 8, 3326, 3281, 16, 4511, 11301, 800, 3726, 3726, 80, 50, 21, 13, 444, 16, 5783, 279, 1561, 3767, 30, 50, 52, 904, 19, 4384, 8, 3326, 9, 20299, 26, 4851, 630, 52, 11747, 21, 4384, 8, 3...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What's the difference between <%# %> and <%= %>? === Pardon my asp ignorance, but what's the difference?
0
[ 2, 98, 22, 18, 14, 2841, 128, 13, 1, 11881, 5910, 13, 11881, 1, 17, 13, 1, 11881, 3726, 13, 11881, 1, 60, 800, 3726, 3726, 13526, 51, 28, 306, 20949, 15, 47, 98, 22, 18, 14, 2841, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
How do you add all untracked files in svn? Something like git add -i? === I've been using this long command: svn st | awk '/\?/ {print $2}' | xargs svn add Similarly, to svn rm files I accidentally deleted with normal rm with : svn st | awk '/\!/ {print $2}' | xargs svn rm --force I guess I can write a bash function to do these two, but I'd prefer an interactive add/rm like the one git has.
0
[ 2, 184, 107, 42, 3547, 65, 367, 4792, 69, 6488, 19, 13, 18, 16578, 60, 301, 101, 13, 10404, 3547, 13, 8, 49, 60, 800, 3726, 3726, 31, 22, 195, 74, 568, 48, 175, 1202, 45, 13, 18, 16578, 354, 13, 1, 13, 3885, 197, 13, 22, 1...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can you bring a control to front in mfc === I have an MFC dialog to which I am adding controls. If there is overlap between the edges of the controls, I want to bring one to the front of the other. In Windows Forms or WPF, etc. I can Bring to Front, Send to Back, Bring Forward, Send Back. I don't find these options in MFC, nor can I tell how it determines what is in front, as a control just added is often behind a control that was there previously. How can I manipulate the Z-order in MFC? Even if I have to manipulate the .rc file code directly (i.e. end-run around the designer).
0
[ 2, 184, 92, 42, 1499, 21, 569, 20, 431, 19, 307, 7061, 800, 3726, 3726, 31, 57, 40, 307, 7061, 28223, 20, 56, 31, 589, 4721, 8671, 9, 100, 80, 25, 15406, 128, 14, 7840, 16, 14, 8671, 15, 31, 259, 20, 1499, 53, 20, 14, 431, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 implement find as you type on a TComboBox descendant === What is the correct way to implement the "find as you type" behavior on a TComboBox descendant component whose style is csOwnerDrawFixed?
1
[ 2, 184, 20, 8713, 477, 28, 42, 1001, 27, 21, 13, 38, 960, 1192, 5309, 13783, 800, 3726, 3726, 98, 25, 14, 4456, 161, 20, 8713, 14, 13, 7, 19811, 28, 42, 1001, 7, 3257, 27, 21, 13, 38, 960, 1192, 5309, 13783, 5912, 1196, 1034, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Static and Instance methods with the same name? === I have a class with both a static and a non-static interface in C#. Is it possible to have a static and a non-static method in a class with the same name and signature? I get a compiler error when I try to do this, but for some reason I thought there was a way to do this. Am I wrong or is there no way to have both static and non-static methods in the same class? If this is not possible, is there a good way to implement something like this that can be applied generically to any situation?
0
[ 2, 12038, 17, 4851, 3195, 29, 14, 205, 204, 60, 800, 3726, 3726, 31, 57, 21, 718, 29, 156, 21, 12038, 17, 21, 538, 8, 18077, 6573, 19, 272, 5910, 9, 25, 32, 938, 20, 57, 21, 12038, 17, 21, 538, 8, 18077, 2109, 19, 21, 718, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 split/merge of table partitions. What is the best approach to implement === Microsoft in its MSDN [entry][1] about altering SQL 2005 partitions, listed a few possible approaches: - Create a new partitioned table with the desired partition function, and then insert the data from the old table into the new table by using an INSERT INTO...SELECT FROM statement. - Create a partitioned clustered index on a heap - Drop and rebuild an existing partitioned index by using the Transact-SQL CREATE INDEX statement with the DROP EXISTING = ON clause. - Perform a sequence of ALTER PARTITION FUNCTION statements. Any idea what will be the most efficient way for a large scale DB (millions of records) with partitions based on the dates of the records (something like monthly partitions). Where data spreads over 1-2 years. Also, if I mostly access (for reading) recent information. Will it make sense to keep a partition for the last X days, and all the rest of the data will be another partition. Or is it better to partition the rest of the data too (for any random access based on date range). [1]: http://msdn.microsoft.com/en-us/library/ms186307(SQL.90).aspx
0
[ 2, 4444, 255, 2132, 118, 1263, 834, 16, 859, 10711, 18, 9, 98, 25, 14, 246, 2141, 20, 8713, 800, 3726, 3726, 7099, 19, 82, 4235, 43, 103, 636, 18195, 500, 2558, 165, 500, 88, 7835, 68, 4444, 255, 812, 10711, 18, 15, 1510, 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...
Catching exceptions from a constructor's initializer list === Here's a curious one. I have a class A. It has an item of class B, which I want to initialize in the constructor of A using an initializer list, like so: class A { public: A(const B& b): mB(b) { }; private: B mB; }; Is there a way to catch exceptions that might be thrown by mB's copy-constructor while still using the initializer list method? Or would I have to initialize mB within the constructor's braces in order to have a try/catch?
0
[ 2, 9436, 13392, 37, 21, 6960, 248, 22, 18, 2104, 11907, 968, 800, 3726, 3726, 235, 22, 18, 21, 7686, 53, 9, 31, 57, 21, 718, 21, 9, 32, 63, 40, 9101, 16, 718, 334, 15, 56, 31, 259, 20, 2104, 2952, 19, 14, 6960, 248, 16, 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...
"Authorization failed" with SVN 1.5.2 on OS X === I'm trying to commit to an SVN server hosted on my school's network. I have installed SVN 1.5.2 with binaries downloaded from CollabNet [here](http://www.collab.net/downloads/community/). I have tried deleting my working copy and checking it out again to no avail. The error reported is: svn: Commit failed (details follow): svn: MKACTIVITY of '/opensvn/cs598r/!svn/act/defe271c-f33b-4851-a706-b2906301fed0': authorization failed (http://dna.cs.byu.edu) I have checked and double-checked that my password is correct on the server. Other members of my team are able to commit from their computers, but when they try from mine, they get the same error. One of the members of my team is using 1.5.1 CollabNet binaries with no trouble. What about my client is broken?
0
[ 2, 13, 7, 10007, 1829, 1702, 7, 29, 13, 18, 16578, 137, 9, 264, 9, 135, 27, 13, 759, 993, 800, 3726, 3726, 31, 22, 79, 749, 20, 9686, 20, 40, 13, 18, 16578, 8128, 2812, 27, 51, 116, 22, 18, 982, 9, 31, 57, 4066, 13, 18, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Required Fields in Share Point data collection not throwing errors === I have created a workflow in Share Point Designer on our MOSS2007 dev server. (No one is allowed to have access to write .NET code yet as company policy) In this workflow I am collecting data from the user, and both of my custom content types I created are marked as required, but the page isn't tossing errors when I don't supply values; not client side nor server side. I checked the ..xoml.wfconfig.xml file and set the properties for required to true, I set the content type to required, and I used Share Point design to mark them as required. Nothing. This is a out of the box installation except for the master page and style sheets. To make sure it wasn't that, I reverted to an out of the box style sheet. Any ideas on what else to check / set?
0
[ 2, 1390, 2861, 19, 1891, 454, 1054, 1206, 52, 6033, 11908, 800, 3726, 3726, 31, 57, 679, 21, 170, 9990, 19, 1891, 454, 4742, 27, 318, 8188, 2727, 9664, 8128, 9, 13, 5, 251, 53, 25, 1159, 20, 57, 1381, 20, 2757, 13, 9, 2328, 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...
Lazy (aka short-circuit) evaluation for And and Or applied to a list in mathematica. === If I have a boolean function `f[x_]:= (Print[x]; EvenQ[x])` that does some time-consuming (in this example, for illustrative purposes, side-effect-producing) stuff and a list `a={2,3,4}` I can check if `f[]` is true for every element of `a` with And @@ (f /@ a) but that wastefully applies `f` to every element of `a` instead of returning `False` after the second element. This does the right thing And[f[2], f[3], f[4]] but of course I want to dynamically create the list. Lisp solves this problem with the `every` macro (and similarly for `some`). I'd like to do the same in mathematica: every[f, a] should return `False` without evaluating `f[4]`. (And similarly for `some`.)
0
[ 2, 16792, 13, 5, 4176, 502, 8, 14022, 11193, 6, 8670, 26, 17, 17, 54, 2435, 20, 21, 968, 19, 5057, 5996, 12630, 9, 800, 3726, 3726, 100, 31, 57, 21, 9827, 413, 210, 1990, 13, 1, 410, 2558, 396, 1, 500, 45, 3726, 13, 5, 10299...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Traversing a multi-dimensional hash in perl === If you have a hash (or reference to a hash) in perl with many dimensions and you want to iterate across all values, what's the best way to do it. In other words, if we have $f->{$x}{$y}, I want something like foreach ($x, $y) (deep_keys %{$f}) { } instead of foreach $x (keys %f) { foreach $y (keys %{$f->{$x}) { } }
0
[ 2, 19501, 68, 21, 1889, 8, 7865, 19170, 19, 416, 255, 800, 3726, 3726, 100, 42, 57, 21, 19170, 13, 5, 248, 2801, 20, 21, 19170, 6, 19, 416, 255, 29, 151, 9913, 17, 42, 259, 20, 32, 106, 1373, 464, 65, 4070, 15, 98, 22, 18, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Visual Studio 2005, how to get where project are used in a solution? === I have a solution with other 70 projects into it. My question is : How can I know where the project is used? I do not want to open all those 70 projects to verify the References one by one. How can I see which project use one project in particular?
0
[ 2, 3458, 1120, 812, 15, 184, 20, 164, 113, 669, 50, 147, 19, 21, 4295, 60, 800, 3726, 3726, 31, 57, 21, 4295, 29, 89, 3201, 2314, 77, 32, 9, 51, 1301, 25, 13, 45, 184, 92, 31, 143, 113, 14, 669, 25, 147, 60, 31, 107, 52, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to use ditto on OS X to work like cp -a on Linux === I'm a Linux guy and I'm used to copying directory trees with `cp -a`. OS X doesn't have `-a` option on `cp`... but it does have the `ditto` command. I'm reading the man on `ditto` now, but is there anything I should specifically be looking out for?
0
[ 2, 184, 20, 275, 28958, 111, 27, 13, 759, 993, 20, 170, 101, 9750, 13, 8, 58, 27, 13024, 800, 3726, 3726, 31, 22, 79, 21, 13024, 1244, 17, 31, 22, 79, 147, 20, 4344, 68, 16755, 1913, 29, 13, 1, 7439, 13, 8, 58, 1, 9, 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...
VisualSVN and class libraries not in the working copy root === We're making the switch from SourceGear Vault to TortoiseSVN with VisualSVN for Visual Studio integration - absolutely love it. However, there are multiple class libraries that we reference in multiple different applications that aren't a part of the working copy root in any of the applications. What's the best way to deal with this so that we can continue to utilize Visual Studio integration, but still keep various class libraries located outside of each project/application's root? SourceGear doesn't have an issue with this. It is possible to add class libraries separately just using TortoiseSVN in explorer, but there's no ability to commit changes to anything outside of the working copy from within Visual Studio; neither are there the VisualSVN "traffic lights" indicating status for these outside of working copy class libraries. By the way, we're also going with the "one repository with many projects" route as opposed to multiple repositories, especially as that is how we have worked for years to this point.
0
[ 2, 3458, 18, 16578, 17, 718, 8649, 52, 19, 14, 638, 4344, 5900, 800, 3726, 3726, 95, 22, 99, 544, 14, 5521, 37, 1267, 834, 512, 8654, 20, 25691, 18, 16578, 29, 3458, 18, 16578, 26, 3458, 1120, 8078, 13, 8, 6916, 339, 32, 9, 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...
What does a ListViewSubtemCollection use for its keys? === I am trying to get the value of some ListViewSubItems, but I have no idea what values it uses for its keys. I have some simple code: protected override void OnItemDrag(ItemDragEventArgs e) { base.OnItemDrag(e); ListViewItem item = e.Item as ListViewItem; string val = item.SubItems[???].ToString(); } The ??? part is where I am having a problem. I cannot figure out what the keys are. I have tried the column names of the ListView with no luck. I would like to use this method instead of using numeric indices.
0
[ 2, 98, 630, 21, 968, 4725, 7563, 38, 1503, 15015, 872, 275, 26, 82, 5534, 60, 800, 3726, 3726, 31, 589, 749, 20, 164, 14, 1923, 16, 109, 968, 4725, 7563, 2119, 79, 18, 15, 47, 31, 57, 90, 882, 98, 4070, 32, 2027, 26, 82, 553...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
ForEach loop in mathematica? === I'd like something like this: ForEach[i_, {1,2,3}, Print[i] ] Or, more generally, to destructure arbitrary stuff in the list you're looping over, like: ForEach[{i_, j_}, {{1,10}, {2,20}, {3,30}}, Print[i*j] ]
0
[ 2, 26, 14322, 5293, 19, 5057, 5996, 12630, 60, 800, 3726, 3726, 31, 22, 43, 101, 301, 101, 48, 45, 26, 14322, 2558, 49, 1, 15, 13, 1, 15793, 15, 240, 1, 15, 4793, 2558, 49, 500, 13, 500, 54, 15, 91, 1469, 15, 20, 121, 13971,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...