Search Results

Search found 16914 results on 677 pages for 'single threaded'.

Page 446/677 | < Previous Page | 442 443 444 445 446 447 448 449 450 451 452 453  | Next Page >

• How to access Dispatcher in Silverlight tests?

  - by bluebit

  I am using the SL unit test framework for tests (http://code.msdn.microsoft.com/silverlightut). My code is heavily client-server communications dependant, and I access the GUI dispatcher in several places to make sure important data is only accessed on a single thread (ie. the GUI thread). This dispatcher seems unavailable in the unit tests - I have tried using Deployment.Current.Dispatcher and even created an instance of a blank control to try use its own dispatcher, but both don't work. The code inside of Dispatcher.BeginInvoke() just never executes, even if I include a Thread.Sleep afterwards.

  Read the article

• Replace token in ANTLR

  - by user1019710

  I want to replace a token using ANTLR. I tried with TokenRewriteStream and replace, but it didn't work. Any suggestions? ANTLRStringStream in = new ANTLRStringStream(source); MyLexer lexer = new MyLexer(in); TokenRewriteStream tokens = new TokenRewriteStream(lexer); for(Object obj : tokens.getTokens()) { CommonToken token = (CommonToken)obj; tokens.replace(token, "replacement"); } The lexer finds all occurences of single-line comments, and i want to replace them in the original source too.

  Read the article

• What is the most efficient way to delete all selected items in a ListViewItem collection

  - by Andrew

  My user is able to select multiple items in a ListView collection that is configured to show details (that is, a list of rows). What I want to do is add a Delete button that will delete all of the selected items from the ListViewItem collection associated with the ListView. The collection of selected items is available in ListView.SelectedItems, but ListView.Items doesn't appear to have a single method that lets me delete the entire range. I have to iterate through the range and delete them one by one, which will potentially modify a collection I'm iterating over. Any hints? Edit: What I'm basically after is the opposite of AddRange().

  Read the article

• How do I convert an arbitrary list of strings to a SQL rowset?

  - by Jim Kiley

  I have a simple list of strings, which may be of arbitrary length. I'd like to be able to use this list of strings as I would use a rowset. The app in question is running against SQL Server. To be clearer, if I do SELECT 'foo', 'bar', 'baz' I get 'foo', 'bar', and 'baz' as fields in a single row. I'd like to see each one of them as a separate row. Is there a SQL (or SQLServer-specific) function or technique that I'm missing, or am I going to have to resort to writing a function in an external scripting language?

  Read the article

• Read a file with 2048 bytes

  - by Suresh S

  Guys i have a file which has only one line. The file has no encoding it is a simple text file with single line. For every 2048 byte in a line , there is new record of 151 byte (totally 13*151 byte = 1945 records + 85 byte empty space). similarly for the next 2048 bytes. What is the best file i/o to use? i am thinking of reading 2048 bytes from file and storing it in an array . while (offset < fileLength &&(numRead=in.read(recordChunks, offset,alength)) >= 0) { } how can i get from the read statement only 2048 bytes at a time . i am getting IndexOutofBoundException.

  Read the article

• Construct A Polygon Out of Union of Many Polygons

  - by Ngu Soon Hui

  Supposed that I have many polygons, what is the best algorithm to construct a polygon--maybe with holes- out of the union of all those polygons? For my purpose, you can imagine each piece of a polygon as a jigsaw puzzle piece, when you complete them you will get a nice picture. But the catch is that a small portion <5% of the jigsaw is missing, and you are still require to form a picture as complete as possible; that's the polygon-- maybe with holes-- that I want to form. My naive approach is to take two polygons, union them, and take another polygon, union it with the union of the two polygons, and repeat this process until every single piece is union. Then I will run through the union polygon list and check whether there are still some polygons can be combined, and I will repeat this process until a satisfactory result is achieved. But this seems to be like an extremely naive approach. I just wonder is there any other better algorithm?

  Read the article

• static images aren't caching with php-generated page

  - by scootklein

  Our website was just converted to being generated by mod_rewrite and php scripts. Images aren't caching in browsers when they seemingly should be. All images follow format: <img src="/images/header.png" /> I must avoid the script completely caching because the PHP parser needs to handle each page dynamically on each request; however, the download overhead of the large images is cumbersome on every single page load. I would ideally provide headers for "Cache-Control: no-cache, must-revalidate" and "Expires: some_date_in_the_past" to force revalidation of the PHP script. Why isn't the browser caching static images with consistent href values across all pages?

  Read the article

• Is a PHP-only "cache engine" ever worth it?

  - by adsads

  I wrote a rather small skeleton for my web apps and thought that I would also add a small cache for it. It is rather simple: If the current page exists as a file in the cache and the file isn't too old, read it out and exit instead of rebuilding the page If the current page isn't cached/outdated recalc the page and save it However, the bad thing about it is: My performance tests with a page that receives 40 relatively long posts via a MySQL query said that with using the cache, it took even longer to handle a single request (1000 tests each) How can that happen? Should I just remove the complete raw-PHP cache and relieve on the availability of some PHP cache like memcached or so?

  Read the article

• Android ListView highlight multiple items

  - by Tobias Kuess

  I want my ListView to change its background for each selected item (Multi-Selection). I used this code: <ListView ... android:drawSelectorOnTop="false" android:listSelector="@android:color/darker_gray" > This works fine, but it is just possible to select one single item of the list. If I select another one the selection is resetted and the new one changes its background. Is there an easy and fast way to make it possible to select more than one item at the same time with changing the background of every selected item?

  Read the article

• How would I implement separate databases for reading and writing operations?

  - by Matt

  I am interested in implementing an architecture that has two databases one for read operations and the other for writes. I have never implemented something like this and have always built single database, highly normalised systems so I am not quite sure where to begin. I have a few parts to this question. 1. What would be a good resource to find out more about this achitecture? 2. Is it just a question of replicating between two identical schemas, or would your schemas differ depending on the operations, would normalisation vary too? 3. How do you insure that data written to one database is immediately available for reading from the second? Any further help, tips, resources would be appreciated. Thanks.

  Read the article

• Enumerating combinations in a distributed manner

  - by Reyzooti

  I have a problem where I must analyse 500C5 combinations (255244687600) of something. Distributing it over a 10 node cluster where each cluster processes roughly 10^6 combinations per second means the job will be complete in about 7hours. The problem I have is distributing the 255244687600 combinations over the 10 nodes. I'd like to present each node with 25524468760, however the algorithms I'm using can only produce the combinations sequentially, I'd like to be able to pass the set of elements and a range of combination indicies eg: [0-10^7) or [10^7,2.0 10^7) etc and have the nodes themselves figure out the combinations. The algorithms I'm using at the moment are from the following: http://home.roadrunner.com/~hinnant/combinations.html A logical question I've considered using a master node, that enumerates each of the combinations and sends work to each of the nodes, however the overhead incurred in iterating the combinations from a single node and communicating back and forth work is enormous, and will subsequently lead to the master node becoming the bottleneck. Are there any good combination iterating algorithms geared up for efficient/optimal distributed enumeration?

  Read the article

• Why, in Ruby, does Array("foo\nbar") == ["foo\n", "bar"]?

  - by Tyson

  In Ruby 1.8.7, Array("hello\nhello") gives you ["hello\n", "hello"]. This does two things that I don't expect: It splits the string on newlines. I'd expect it simply to give me an array with the string I pass in as its single element without modifying the data I pass in. Even if you accept that it's reasonable to split a string when passing it to Array, why does it retain the newline character when "foo\nbar".split does not? Additionally: >> Array.[] "foo\nbar" => ["foo\nbar"] >> Array.[] *"foo\nbar" => ["foo\n", "bar"]

  Read the article

• Paypal API for preapproved payments , is the merchant charged for pre-approved transactions ?

  - by Michael

  I'm running an classified ads website and I'm charging a specific fee for each ad placed. As you may know paypal charges a specific percent for each transaction + a specific amount fee (e.g 2,9% + 0.30 cents) . I have customers who place about 30 ads per month therefore I would like to integrate a schema that would cut the specific amount fee . Basically I'm looking to make "pre-approve" call every time after the client place an ad to make sure that he has the money to pay and at the end of the month to cancel all the scheduled pre-approved transactions and make a single payment request with the whole amount. The question that I have is : Will I be charged for the pre-approved transactions that I cancel ?

  Read the article

• How to get an ordered list parsed by XML parser?

  - by Matthias Doringer

  I am using a xsd schema file; there I specified an ordered list. When parsing an XML node of the kind... <myOrderedList> "element_1" "element_2" "element_3" </myOrderedList> (which is valid XML syntax) ...all XML parsers I know parse this as a single node element. Is there a way to get the XML parser parse this list for me (return it as a list or an array or whatever) or do I always have to parse it myself?

  Read the article

• Help needed with simple mysql group by query

  - by Jack

  This query fails when I add the line shown... :BEGIN FAIL: I have this so far Select Companyid, count(*) as cnt from mytable where State is not null and cnt = 1 <------------------------- FAIL group by CompanyID :END FAIL: Any way to do this? Here's a long winded background if it'll help.... I have a single table query. here's a sample of the table: CompanyID, State 1,OH 1,IL 1,NY 2,IL 3,NY 3,OH 4,NY 5,CA 5,WA I want a query that'll return something like this: 2,IL 4,NY I have this so far Select Companyid, count(*) as cnt from mytable where State is not null group by CompanyID This gives me a count of the number of records for each company. IE: 1,3 2,1 3,2 4,1 5,2 Now I want to filter the above list to just the two records with one result. I tried adding another where clause, but it failed: BEGIN FAIL: I have this so far Select Companyid, count(*) as cnt from mytable where State is not null and cnt = 1 <-------------------- FAIL group by CompanyID END FAIL:

  Read the article

• How to create a cross-plataform application, doing the interface modules (Mac/Qt/GTK+) in a totally

  - by Somebody still uses you MS-DOS

  I'm amazed at Transmission, a BT client. It has a Mac, a GTK+, a QT, a Web Client and a CLI interface to it. I tried reading some of it's source to understand how he creates all these interfaces, but no luck. Does the developer creates them using a single ide? Or does he create the interface logic in each specific environment (specially mac), "exports" this window code and integrates with the main logic? Is it possible to create that mac interface in another OS using an IDE? How did the developers create this software with so many interfaces, in a independent way?

  Read the article

• event vs thread programming on server side.

  - by AlxPeter

  We are planning to start a fairly complex web-portal which is expected to attract good local traffic and I've been told by my boss to consider/analyse node.js for the serve side. I think scalability and multi-core support can be handled with an Nginx or Cherokee up in the front. 1) Is this node.js ready for some serious/big business? 2) Does this 'event/asynchronous' paradigm on server side has the potential to support the heavy traffic and data operation ? considering the fact that 'everything' is being processed in a single thread and all the live connections would be lost if it got crashed (though its easy to restart). 3) What are the advantages of event based programming compared to thread based style ? or vice-versa. (I know of higher cost associated with thread switching but hardware can be squeezed with event model.) Following are interesting but contradicting (to some extent) papers:- 1) http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html 2) http://pdos.csail.mit.edu/~rtm/papers/dabek:event.pdf

  Read the article

• Orverride Problem for Custom Design on Product - Magneto

  - by Chris

  I am running several sites in several different languages off of single instance of magneto. There are two main styles Site 1 Site 2 Each site has some cusomtimizations based on language So each shop view has an some templates defined Site 2 - DE Site 2 - UK Now the problem is that when I apply a product level design, it forget's about the language level definition and skips back to the main definition. I want it to work like this Site 2 Site 2 DE Product Style But Instead it seems to work like this Site 2 Site 2 DE Product Style Where Site 2 DE is not ignored because a custom product style has been defined. How can I get the first hierarchy to work? So that my product styles do not override the language styles completely.

  Read the article

• Silverlight Bind to TextBlock from RIA Services

  - by DaRKoN_

  I've a TextBlock that looks like so: <TextBlock Text="{Binding Name}" /> This is inside a <Canvas> with the DataContext set to MyClient which is in the ViewModel: public Client MyClient { get; private set; } // This is a RIA Entity, hence supports INotifyPropertyChanged public ViewModel() { MyClient = new Client(); LoadOperation<Client> loadClient = RiaContext.Load<Client>(RiaContext.GetClientsQuery()); loadClient.Completed += new EventHandler(loadClient_Completed); } void loadClient_Completed(object sender, EventArgs e) { MyClient = DB.Clients.Single(); } Setting MyClient like the above does not raise the PropertyChanged event. As such the UI is never updated.

  Read the article

• measuring uncertainty in matlabs svmclassify

  - by Mark

  I'm doing contextual object recognition and I need a prior for my observations. e.g. this space was labeled "dog", what's the probability that it was labeled correctly? Do you know if matlabs svmclassify has an argument to return this level of certainty with it's classification? If not, matlabs svm has the following structures in it: SVM = SupportVectors: [11x124 single] Alpha: [11x1 double] Bias: 0.0915 KernelFunction: @linear_kernel KernelFunctionArgs: {} GroupNames: {11x1 cell} SupportVectorIndices: [11x1 double] ScaleData: [1x1 struct] FigureHandles: [] Can you think of any ways to compute a good measure of uncertainty from these? (Which support vector to use?) Papers/articles explaining uncertainty in SVMs welcome. More in depth explanations of matlabs SVM are also welcome. If you can't do it this way, can you think of any other libraries with SVMs that have this measure of uncertainty?

  Read the article

• What's the right way to handle "One, Both, or None" logic?

  - by Stephen

  I have a logic situation that is best described as two "Teams" trying to win a task. The outcome of this task could be a single winner, a tie (draw), or no winner (stalemate). Currently, I'm using a nested if/else statement like so: // using PHP, but the concept seems language agnostic. if ($team_a->win()) { if ($team_b->win()) { // this is a draw } else { // team_a is the winner } } else { if ($team_b->win()) { // team_b is the winner } else { // This is a stalemate, no winner. } } This seems rather spaghetti-like and repetitive. Is there a more logical, DRY pattern I could use?

  Read the article

• How can I take eclipse out of MDI mode?

  - by user51189

  Does anyone know of a way to make Eclipse an SDI application rather than an MDI one? SDI - Single document interface, each pane is its own window MDI - Multiple document interface, all of the panes are stuck inside one "master" window. Eclipse is an MDI application. All of the little panes (like the call stack, variable viewer, ect) are part of the one master Eclipse window. Rather than having all of the windows stuck inside one master "eclipse" window, I'd like them to all be their own free-floating windows.

  Read the article

• BIRT PDF report : fixed table heigth?

  - by kiwifrog

  Hi, I am trying to display a table to display of products (rows) in a single A4 fixed layout page. I manage to add a table with header/detail/footer sections but I can not set a minimum heigth for the detail section (150mm for example). If I set a 150mm heigth on the detail row, then Each row will have that 150mm heigth. Whereas I would like, each row to have a minimal heith (could be on several line if the content of some columns is wrapped). +---------+--------+--------------+ Tbl Hdr | col1 | col2 | col3 | +---------+--------+--------------+ Tbl Dtl | [val1] | [val2] | [val3] | +---------+--------+--------------+ | | <-should have a variable heigth +---------+--------+--------------+ Tbl Ftr | | | Total | +---------+--------+--------------+ If a set not heigth on the detail row then the footer comes, right beneath the detail rows, instead of sticking at the bottom of the page :-( I hope this makes sense (if not I could provide more details). Any help would be greatly appreciated. Thanks in advance.

  Read the article

• Looking for a clear and concise web page explaining why lower bits of random numbers are usually not

  - by Hamish Grubijan

  I am putting together an internal "every developer should know" wiki page. I saw many discussions regarding rand() % N, but not a single web page that explains it all. For instance, I am curious if this problem is only C- and Linux-specific, or if it also applies to Windows, C++,. Java, .Net, Python, Perl. Please help me get to the bottom of this. Also, just how non-random do the numbers get? Thank you!

  Read the article

• Understanding the concept of Inodes

  - by darkie15

  Hi All, I am referring to the link: http://www.tux4u.nl/freedocs/unix/draw/inode.pdf I am confused on parts: 1 12 direct block pointers 2 1 single indirect block pointer 3 1 double indirect block pointer 4 1 triple indirect block pointer Now the diagram says that each pointer is 32/64 bits. [Query]: Why and how are these values inferred? I mean why specifically have only 32 or 64 bit pointers? The diagram says, One data block{8 KB} for each pointer {4 bytes/8 bytes} [Query]: How does this actually work out? i.e. 8*1024 bytes / 8 bytes = 1024 bytes? What is the logic behind having a 8 bytes pointer for 8KB block? Regards, darkie.

  Read the article

< Previous Page | 442 443 444 445 446 447 448 449 450 451 452 453  | Next Page >