Search Results

Search found 9193 results on 368 pages for 'batcher sort'.

Page 251/368 | < Previous Page | 247 248 249 250 251 252 253 254 255 256 257 258  | Next Page >

• 'Loading' web page for async call

  - by Sieg

  I have a simple web page in ASP.NET / C#. Currently to fully render the data I require calling a block of code that runs on background threads and can take multiple minutes to complete. I've got it to the point (using the async attribute on the page declaration) to execute and return fine with the html once it's done. What I'd like it to do is allow me to return immediately with a 'loading page' of some sort and then have that page be updated when the background work has been completed. Right now I get nothing on the page while the background work is being processed. Any ideas on the best way or clever way to do that would greatly be appreciated! Thanks, Sieg

  Read the article

• Does the following indicate a bad design?

  - by Mewzer

  Hello, I was wondering whether you think the following code usually indicates a bad design ... class X { public: ... private: Y y; }; Class Y { public: Y( X& value ){ x = value; }; private: X& x; } (i.e. there is some sort of cyclic dependency between the classes X and Y).

  Read the article

• Mongodb, simple IN problem

  - by afvasd

  Hi everyone I am new to mongo, this is my db design: product := { name: str group: ref, comments: [ ref, ref, ref, ref ] } comments := { ... a bunch of comments stuff } tag := { _id: int, #Need this for online requests tag: str, products: [ {product: ref, score: float}, ... ], comments: [ {comment: ref, score: float}, ...], } So my usage pattern is: GIVEN a product, find comments that have certain tag and sort them accordingly. My current approach involves: Look for that tag object that has tag=myTag pull all the comments out, sorted look for that product where product.name=myProduct pull all the comments out (which are dbrefs by the way) loop through the result of 2, and checking if they are in 4, (this I can do a limit 10) etc. It's pretty inefficient. Any better methods?

  Read the article

• What's the simplest way of defining lexicographic comparison for elements of a class?

  - by the_mandrill

  If I have a class that I want to be able to sort (ie support a less-than concept), and it has several data items such that I need to do lexicographic ordering then I need something like this: struct MyData { string surname; string forename; bool operator<(const MyData& other) const { return surname < other.surname || (surname==other.surname && forename < other.forename); } }; This becomes pretty unmanageable for anything with more than 2 data members. Are there any simpler ways of achieving it? The data members may be any Comparable class.

  Read the article

• Programmatically set browser cookie (Firefox)

  - by Andrew

  I know from this question that Firefox 3.0 and up stores its cookies in an SQLite database. My question is: can you access this database from other desktop programs in such a way that you could add a cookie? I realize this has security implications. However, I do not want to read them at all. I want to be able to set one cookie if possible. I don't even want to overwrite a cookie. I just want to add it if it isn't there already. This is sort of a personal project I'm working on for fun. This question is mostly language agnostic. I would prefer a solution in C#, but proof of concept in any language will suffice. Extra credit: It would be cool to set the same cookie in Internet Explorer, too

  Read the article

• Knowledge mining using Hadoop.

  - by Anurag

  Hello there, I want to do a project Hadoop and map reduce and present it as my graduation project. To this, I've given some thought,searched over the internet and came up with the idea of implementing some basic knowledge mining algorithms say on a social websites like Facebook or may stckoverflow, Quora etc and draw some statistical graphs, comparisons frequency distributions and other sort of important values.For searching purpose would it be wise to use Apache Solr ? I want know If such thing is feasible using the above mentioned tools, if so how should I build up on this little idea? Where can I learn about knowledge mining algorithms which are easy to implement using java and map reduce techniques? In case this is a wrong idea please suggest what else can otherwise be done on using Hadoop and other related sub-projects? Thank you

  Read the article

• categorizing items in a list with python

  - by jtc99

  Just as a heads up, I'm really new to python. Currently I have a list of 110,000 donors in Excel. One of the pieces of information they give to us is their occupation. I would like to condense this list down to say 10 or 20 categories that I define. Normally I would just chug through this, going line by line, but since I have to do this for a years worth of data, I don't really have the time to do a line by line of 1,000,000+ rows. Is there anyway to define my 10 or 20 categories and then have python sort it out from there?

  Read the article

• Comparing large strings in JavaScript with a hash

  - by user4815162342

  I have a form with a textarea that can contain large amounts of content (say, articles for a blog) edited using one of a number of third party rich text editors. I'm trying to implement something like an autosave feature, which should submit the content through ajax if it's changed. However, I have to work around the fact that some of the editors I have as options don't support an "isdirty" flag, or an "onchange" event which I can use to see if the content has changed since the last save. So, as a workaround, what I'd like to do is keep a copy of the content in a variable (let's call it lastSaveContent), as of the last save, and compare it with the current text when the "autosave" function fires (on a timer) to see if it's different. However, I'm worried about how much memory that could take up with very large documents. Would it be more efficient to store some sort of hash in the lastSaveContent variable, instead of the entire string, and then compare the hash values? If so, can you recommend a good javascript library/jquery plugin that implements an appropriate hash for this requirement?

  Read the article

• SQL Outer joins

  - by dsquaredtech

  Three tables courses,registration,students columns in students firstname,lastname,studentid,major,admitdate,graddate,gender,dob columns in registration courseid,studentid columns in courses coursenumber,coursename,credits select statement I need to modify select lastname as 'Last Name',sum(credits) as 'Credits Registered For' from students as s inner join registration as r on s.studentid = r.studentid inner join courses as c on c.coursenumber = c.courseid group by last name; the question on the lab is... Modify the previous query to show all students, even if they have not registered for a class. You should have 14 rows. Students who are not registered will show NULL in output. I know this requires outer join of some sort but I'm not fully grasping these joins i've read multiple posts on here and other sites but can't seem figure it out.

  Read the article

• Delegate Example From C# In Depth Confusion

  - by ChloeRadshaw

  I am looking at this example: List<Product> products = Product. GetSampleProducts() ; products.Sort( (first, second) => first.Name.CompareTo(second. Name) ) ; foreach (Product product in products) { Console. WriteLine(product) ; } What function is actually called in the API when you do that? Does the compiler create a class which implemnents the IComparer interface? I thought delegates were anonymous methods - Here it seems to be an anonymous interface implementation which is casuing confusion

  Read the article

• Logging a user session for playback

  - by justSteve

  Running an MVC2 site against IIS7 and would like to capture more detail of how users traverse the site - ideally to the point of being able to replay even the duration between mouse clicks - feedback of where people pause and/or backtrack. I could do this with flash but that's no longer an option. Now it's just IIS7 via asp.net f4. That should be enough IIS7 is supposed to be extensible enough that there'd be any number of 3rd party options for this sort of niche need. I'm willing to consider client-side .net components but this sure seems to be the responsibility of the server. [opps...does this belong on serverfault?] thx

  Read the article

• Java: How to store Vector<String[]> in XML (or save in any other way)

  - by hatboysam

  Basically I have a proof-of-concept application that is a digital recipe book. Each Recipe is an object and each object has, among other fields, a Vector containing arrays. The Vector is the list of all ingredients in the Recipe while each ingredient has an array showing the name of the ingredient, the amount, and the unit for that amount. I want to save each Recipe to XML so that they can be accessed by the user. How can I store a Vector of String arrays in XML or any other sort of file so that it can later be recalled and accessed?

  Read the article

• does TFS easily allow you to share testresults with people who don't have TFS?

  - by jcollum

  I'd like to publish a set of test results to a place where team members who don't have TFS can see the results. Does TFS do anything like this easily? I see that that test results do get published, but without a TFS license I don't see any way for people to view them. I think I can do this easily by pulling the XML from the test results and then pushing that out to a central location, but I was wondering if there's anything like an "official" way to do this. TFS is hard to work with when you have some people who have access to it and others who don't... I really wish there was some sort of read-only access to the server (let people get files but not check them out for instance).

  Read the article

• Can I dynamically adjust the height of a css set div border?

  - by Jeff

  Ok so I have a div that contains a few forms that have dynamically generated content. There are categories, that if you click on, slide/toggle down to reveal that categories sub-contents, or projects. Right now, I have it setup so that if the height of the div expands to exceed a set amount, a scroll bar shows up at the side, and the user can scroll down and see the content. NOW I am being asked to get rid of the scroll bar, and just have the div's border (which is just 1px set in the css) height adjust dynamically with the height of the div's content...can I even do that? Is there some sort of jquery animation that would allow that? A point in the right direction would be greatly appreciated!! Thanks

  Read the article

• How to enable ListView overscroll in HTC One X (may be all htc devices)?

  - by smeghead

  I have a listview in my app, and in my Xoom, and Galaxy S2, you get the normal glow effect when you overscroll. But in HTC One X, it doesn't show any overscroll behaviour. All the HTC apps have an accordion style overscroll behaviour. Do they use some custom listview? In any case, how do I show some sort of overscroll effect in HTC phones? Also, is there some ListView class out there, that implements overscroll effects on all phones (doesn't have to be the same effect). Some Context: The phones are on Android 4.0.3, and Xoom is on 4.0.4. The app is using the Holo Light theme. The min/target API level (as well as the Project API level) is set to 15.

  Read the article

• Counting values in data frame subject to conditions

  - by unixsnob

  I have been searching around and I cannot figure out how to sumarise the data I have in my data frame (subject to some ranges). I know that it can be done when applying some combination of daaply/taaply or table but I haven't been able to get the exact result I was expecting. Basically I want to turn this: part_no val1 val2 val3 2 1 2 3 45.3 2 1 3 4 -12.3 3 1 3 4 99.3 3 1 5 2 -3.2 3 1 4 3 -55.3 Into this: part_no val3_between0_50 val3_bw50_100 val3_bw-50_0 val3_bw-100_-50 2 1 0 0 1 0 3 0 1 0 1 1 This is dummy data, I got a lot more rows, but the idea is the same. I just want to count the number of values for a participant that meet certain condition. If anyone could explain it sort of step by step, I would really appreciate it. I saw lots of different little posts around, but none do exactly this and my attempts only got me half way there. Like using table, etc. Thanks!

  Read the article

• Key that yields multiple Results

  - by SgtStud

  I'm pretty new to programming so I'm sorry if this is a stupid question. I was wondering if there was a type of data that returns (possibly) more than one answer per key. For example: TestType<int,String> test = new TestType<int,String>(); So if you typed, test.getKey(1), you could get {"hello","this","is","a","test"}. Basically, is there a type of data that can return multiple answers, sort of like a HashMap and List combined?

  Read the article

• Socket.io Duplicate clients on a namespace

  - by Servernumber

  Hi I'm trying to use dynamic namespace to create them on demand. It's working except that I get duplicate or more client for some reason Server side : io.of("/" + group ).on("connection", function(socket_group) { socket_group.groupId = group; socket_group.on("infos", function(){ console.log("on the group !"); }) socket_group.on('list', function () { Urls.find({'group' : '...'}).sort({ '_id' : -1 }).limit(10).exec(function(err, data){ socket_group.emit('links', data); }); }) [...] }) Client Side : socket.emit('list', { ... }); On the client side only one command is sent but the server is always responding with 2 or more responses. Every time I close/open my app the response is incremented. Thanks if you find out.

  Read the article

• List.clear() followed by List.add() not working.

  - by Vincent

  I have the following C# Class/Function: class Hand { private List<Card> myCards = new List<Card>(); public void sortBySuitValue() { IEnumerable<Card> query = from s in myCards orderby (int)s.suit, (int)s.value select s; myCards = new List<Card>(); myCards.AddRange(query); } } On a card Game. This works fine, however, I had trouble at first, instead of using myCards = new List(); to 'reset' myCards, I would use myCards.clear(), however, once I called the clear function, I would not be able to call myCards.add() or myCards.addRange(). The count would stay at zero. Is my current approach good? Is using LINQ to sort my cards good/bad?

  Read the article

• download authentication?

  - by Sahat

  Hi I am sorry if this question has been asked before but I am looking for some sort of download authentication. In other words if I am going to give the user a link to a file, I want to make sure only that person will get it, and get it only once! Is there a simple solution without setting up the whole database. Even better if it's possible to have an ecrypted web link that will let you download a file from my FTP server just once, after that the link becomes invalid. Thanks.

  Read the article

• Problem Making C++ script

  - by Abs

  Hello all, I am not sure if I can post this sort of question (apologies in advance) but I am trying to build something from this blog post. # mkdir wkthumb # cat > wkthumb.cpp # qmake -project # qmake && make # ./wkthumb I have no experience with this, but I download all the files needed in the directory wkthumb using git. I have gone inside this directory and tried to execute cat > wkthumb.cpp - this just hangs for me. In addition, I thought cat was supposed to be used like this: cat file1.txt file2.txt > file3.txt? The above is blank with the first arguments? I am using Fedora Core 10.

  Read the article

• SQL most popular

  - by Brae

  I have a mysql table with items in relation to their order. CREATE DATABASE IF NOT EXISTS `sqltest`; USE `sqltest`; DROP TABLE IF EXISTS `testdata`; CREATE TABLE `testdata` ( `orderID` varchar(10) DEFAULT NULL, `itemID` varchar(10) DEFAULT NULL, `qtyOrdered` int(10) DEFAULT NULL, `sellingPrice` decimal(10,2) DEFAULT NULL ) INSERT INTO `testdata`(`orderID`,`itemID`,`qtyOrdered`,`sellingPrice`) values ('1','a',1,'7.00'),('1','b',2,'8.00'),('1','c',3,'3.00'),('2','a',1,'7.00'),('2','c',4,'3.00'); Intended Result: A = (1+1)2 B = 2 C = (2+4)6 <- most popular How do I add up all the qty's for each item and result the highest one? It should be fairly strait forward but I'm new to SQL and I can't work this one out :S Solution needs to be mysql and or php. I guess there needs to be some sort of temporary tally variable for each item ID, but that seems like it could get messy with too many items.

  Read the article

• client-side vs server-side

  - by amalafrida

  In general, should one design in order to place processing load on client-side? More specifically, a search engine to locate subscriber information requires a fair amount of parsing (multiple phone numbers to sort and format, hour of day, timezone, comparisons for possible substitutions of user information, etc.). Again, in general, is it preferred that one have client-side do the work? It seems to me 'yes' in a situation in which one will have many thousands of hits per minute. Use php for quick database queries ... process retrieved data client-side. yes ... no?

  Read the article

• When to give in and start The Big Rewrite?

  - by John Cromartie

  I've had my share of projects where the first thing I think is "let's just rewrite it in ." Everybody feels the urge at some point. In fact, I think I've had the urge to rewrite pretty much every project I've ever been on. However, it is accepted wisdom that a total rewrite is generally a bad idea. The question is: when do you look at a project and say: "OK, it's time to start over." What sort of metrics or examples can you cite of where a rewrite was truly necessary? How bad does the code have to be? How old can a project get before there too much invested?

  Read the article

• How to find out where my memory is going

  - by the_mandrill

  I've got the situation where the cycle of loading and then closing a document eats up a few Mb of RAM. This memory isn't being leaked as something owns it and cleans it up when the app exits (Visual Leak Detector and the Mac Leaks tool show agreement on this). However, I'd like to find out where it's going. I'm assuming it's some sort of cache in the application that gets populated when the document loads but not freed when the document is closed. Which methods or tools could I use to find out where these allocations are being made?

  Read the article

< Previous Page | 247 248 249 250 251 252 253 254 255 256 257 258  | Next Page >