Search Results

Search found 16329 results on 654 pages for 'b long'.

Page 421/654 | < Previous Page | 417 418 419 420 421 422 423 424 425 426 427 428  | Next Page >

• Is it possible to have a composite index with a list property and a sort order?

  - by npdoty

  And if not, why not? The following index always fails for me, even though I had thought I could have a sort order with a list property as long as the index didn't sort or match against any other properties. - kind: Foo properties: - name: location_geocells - name: time direction: desc If such a composite index is allowed, are there any reasons that this might be failing for me? Do the existence of other indices on the same model increase the likelihood of this failure? Does the combination of a sort order with a list property require more than N entries, where N is the number of values in the list property? (If so, how many does it require?)

  Read the article

• Can I preload multiple video resources to load in the same HTML5 <video> element?

  - by Sergio1132

  I'm working out details on a web application which involves the sequential loading of a long series of (very short) video clips, one after the other, with occasional input from the user establishing new directions for which video clips to load. I would like to be able to have the browser preload the video clips five at a time. However, the way that we currently have the site working is by means of a single video element which is having its src attribute continually updated through JavaScript. So, my question is, is there a straightforward way I can get the browser to preload multiple video clips even though I am ultimately loading them all (one at a time) into the same video element? This is my first question here, so let me know if I could have phrased that better...

  Read the article

• finding character in string C language

  - by iSight

  Hi, I am searching a character at first occurence in string using the following code. But, it is taking some time when the character is too long or the character that i am searching is at far extend, which makes delay in other operations. How could i tackle with this problem. The code is below here. Note: attrPtr is a char* which holds a reference to a string containing '"' character at far extend. int position = 0; char qolon = '"';//character to search while (*(attrPtr + position++) != qolon); char* attrValue = NULL; attrValue = (char*)malloc(position * sizeof(char)); strncpy(attrValue, attrPtr, position-1);

  Read the article

• How to detect mobile and tablet using CSS or JavaScript regardless of brands?

  - by user144966

  Basically what I'm trying to do is have 3 css stylesheets for desktop, mobile, and tablet. And I don't care if it is ipad or samsung galaxy tab as long as I know it is a tablet, so that I just apply tablet css to it. Same as iphone or Nexus which I don't care either. I just care about the dimension basically. That would be good if JQuery Mobile could do this. I know there is lots of code for detecting iphone, ipad, and etc, hope my post still makes sense. Thanks.

  Read the article

• Steps to take for figuring out the delay when calling service and loading data with the result?

  - by VoodooChild

  Hello, In a client server app, where client front end is done in silverlight using C# and the services are the WCF services. If I am to hit the service and do a query and bring back a result and I notice that it is taking a relatively long time to load my page which is just loading the grid with the data, what things should I look at fix this issue or how would I fix this issue? What steps could I take to determine the problem? where is the bottle-neck, can anyone know from the little information provided here? Does this have anything to do with serialization? Any insight on what could be causing this delay? My service calls are made async. I hope this question makes sense :) Thanks

  Read the article

• What is the difference between "a is b" and "id(a) == id(b)" in Python?

  - by bp

  The id() inbuilt function gives... an integer (or long integer) which is guaranteed to be unique and constant for this object during its lifetime. The is operator, instead, gives... object identity So why is it possible to have two objects that have the same id but return False to an is check? Here is an example: >>> class Test(): ... def test(): ... pass >>> a = Test() >>> b = Test() >>> id(a.test) == id(b.test) True >>> a.test is b.test False A more troubling example: (continuing the above) >>> b = a >>> b is a True >>> b.test is a.test False >>> a.test is a.test False

  Read the article

• How do I get the value of the item selected in ListView?

  - by user357032

  I thought I could use the position int, but when I click on the item in the list view, nothing happens. Please help! ListView d = (ListView) findViewById(R.id.apo); ArrayAdapter adapt = ArrayAdapter.createFromResource(this, R.array.algebra, android.R.layout.simple_list_item_1); d.setAdapter(adapt); d.setOnItemClickListener(new OnItemClickListener() { public void onItemClick(AdapterView<?> parent, View view, int position, long id) { if (position == '0') { Intent intent = new Intent(Algebra.this, Alqv.class); startActivity(intent); } if (position == '2') { Intent intent1 = new Intent(Algebra.this, qfs.class); startActivity(intent1); } }); }

  Read the article

• Low-overhead way to access the memory space of a traced process?

  - by vovick

  Hello all. I'm looking for an efficient way to access(for both read and write operations) the memory space of my ptraced child process. The size of blocks being accessed may vary from several bytes up to several megabytes in size, so using the ptrace call with PTRACE_PEEKDATA and PTRACE_POKEDATA which read only one word at a time and switch context every time they're called seems like a pointless waste of resources. The only one alternative solution I could find, though, was the /proc/<pid>/mem file, but it has long since been made read only. Is there any other (relatively simple) way to do that job? The ideal solution would be to somehow share the address space of my child process with its parent and then use the simple memcpy call to copy data I need in both directions, but I have no clues how to do it and where to begin. Any ideas?

  Read the article

• how to use OR in jquery

  - by user1493339

  1st i would like to thanks all who view this and special thanks for those who answer this. today, i tested this out but it not working, so just want to know how should this code. multiple "OR" in one line $("input[name='ABC']or[name='DEF']or[name='GHI']or[name='JKL']").click(function (){ //do something }); or even put else for it like... $("input[name='ABC'][name='DEF'][name='GHI'][name='JKL']").click(function (){ //do something }else{ //do something else }); i know both code is invalid, so is that possible to code in that way? so far i code it all one by one, so my coding is very long.

  Read the article

• Requiring clients to solve computational puzzles...

  - by acidzombie24

  Not that I need it, but it was interesting to hear someone speak about their server and protecting it from DOS attack by having a puzzle that the client must solve before the server will do anything (it doesnt do allocations or make a session unless solved). The person also said puzzles can be made to take a quick amount of time or long. And they are easy to check for correct solutions but difficult to solve. What are these puzzles? I never heard of one. Can someone give an example (or a link)?

  Read the article

• PHP cURL loading delay

  - by lasquarte

  Hello. My problem is, I need to cURL-load a page that uses Ajax-based search, to get results of that search. And I need to organize a delay between curl_exec() and value returning. In other words, I need to execute curl_exec() for no less than 5 seconds. sleep() seems to stop curl execution and does not work. Will greatly appreciate any hint or clue UPD I don't know how, but on this page http://vkontakte.ru/gsearch.php?section=video&q=sample&name=1, but it requires an account to access curl DOES capture the search made by ajax. But if page tooks too long to load, Ajax returns "action was too fast" error. So I just need to prolong curl execution. Sorry if being unclear.

  Read the article

• SQL: Interrupting a query

  - by NoozNooz42

  I've worked on a project using a proprietary non-SQL DB where queries could be interrupted and in the codebase there were quite some spots where that functionnality was used and made perfect sense (for example to stop a long running query that gets cancelled by the user, or when a more recent query takes place and renders the previous query obsolete, etc.) and I realized I never really saw that kind of "interrupted queries" previously and thought it could make a good SO question (several questions, but they're all related to exactly the same thing): can SQL queries be interrupted? is this part of the SQL standard? if it's not part of the SQL standard, which SQL DBs allow queries to be interrupted (any example most welcome)? is it common to interrupt a DB query (SQL or not) which you'll know you won't care about the result anymore? (in the codebase I've worked on, it sure helps lighten the server's load)

  Read the article

• Can JavaScript be overused?

  - by ledhed2222

  Hello stackoverflow, I'm a "long time reader first time poster", glad to start participating in this forum. My experience is with Java, Python, and several audio programming languages; I'm quite new to the big bad web technologies: HTML/CSS/JavaScript. I'm making two personal sites right now and am wondering if I'm relying on JavaScript too much. I'm making a site where all pages have a bit of markup in common--stuff like the nav bar and some sliced background images--so I thought I'd make a pageInit() function to insert the majority of the HTML for me. This way if I make a change later, I just change the script rather than all the pages. I figure if users are paranoid enough to have JavaScript turned off, I'll give them an alert or something. Is this bad practice? Can JavaScript be overused? Thanks in advance.

  Read the article

• Solve Physics exercise by brute force approach..

  - by Nils

  Being unable to reproduce a given result. (either because it's wrong or because I was doing something wrong) I was asking myself if it would be easy to just write a small program which takes all the constants and given number and permutes it with a possible operators (* / - + exp(..)) etc) until the result is found. Permutations of n distinct objects with repetition allowed is n^r. At least as long as r is small I think you should be able to do this. I wonder if anybody did something similar here..

  Read the article

• perforce implementation of clearcase like "views"

  - by Pradyot

  I have read through the documentation on perforce and the "branching strategy" advice as well. One thing thats left me baffled, is how a simple concern is does not seem to adequtely adressed. When I am working on a project that touches many parts of our code base , I cannot checkin my code at the end of the day without checking into the trunk. So do I need to branch in this situation? I want to be able to have the ability to have a history of my changes in a long and hard project, so I can go back when I I make a wrong turn.. The problem with branching I see is that I will be creating copies of almost the entire codebase .. Am I missing an obvious solution here? thanks

  Read the article

• Joomla 2.5 disable and remove Smart Cache

  - by WooDzu

  I am maintaining a Joomla 2.5 based magazine website with 3-4 new, long articles every day. Smart Search was enabled by default and now I've got a few "finder" tables full of indexed phrases and therms. I wonder if there are any disadvantages if I'd: Disable the Smart Search plugin Remove these 'finder' tables completely Aha, we're using a Search field, which works fine, but I'm not sure what's going to happen if I disable the plugin and remove these tables. Will it then search for phrases in content Joomla tables or simply break w/o missing 'finder' tables Has anyone tried this before?

  Read the article

• Memory is leaked only in some machines.

  - by Jorge Córdoba

  We've got a situation where our application is leaking memory while doing some periodic action. The test scenario is composed of a series of processes across two relatively complex WPF windows. The weird thing about the situation is that memory only gets leaked on SOME machines, while others, having exactly the same hardware, can be working for really long times (repeating the process every minute) having their memory almost unchanged (once the GC gets rid of used memory, etc). This is .NET + WPF. Any ideas about where to start looking? What can cause leaks in only some machines? (we're talking about a 30 machine test scenario). I have few experience with WPF, could the graphic card had anything to do with it?

  Read the article

• Debugging metaprograms [C++]

  - by atch

  Hi, Is there any way to check step by step what's going on in let's say template? I mean how it is instantiated step by step and so on? In book I've mentioned here , I found (2 minutes ago) quite interesting example of how binary could be implemented as a metafunction. template <unsigned long N> struct binary { static unsigned const value = binary<N/10>::value << 1 // prepend higher bits | N%10; // to lowest bit }; template <> // specialization struct binary<0> // terminates recursion { static unsigned const value = 0; }; and I think it could be quite useful to be able to see step by step what's been done during the instantiation of this template. Thanks for your replies.

  Read the article

• Programmatically determine the relative "popularities" of a list of items (books, songs, movies, etc

  - by Horace Loeb

  Given a list of (say) songs, what's the best way to determine their relative "popularity"? My first thought is to use Google Trends. This list of songs: Subterranean Homesick Blues Empire State of Mind California Gurls produces the following Google Trends report: (to find out what's popular now, I restricted the report to the last 30 days) Empire State of Mind is marginally more popular than California Gurls, and Subterranean Homesick Blues is far less popular than either. So this works pretty well, but what happens when your list is 100 or 1000 songs long? Google Trends only allows you to compare 5 terms at once, so absent a huge round-robin, what's the right approach? Another option is to just do a Google Search for each song and see which has the most results, but this doesn't really measure the same thing

  Read the article

• Create set of random JPGs

  - by Kylar

  Here's the scenario, I want to create a set of random, small jpg's - anywhere between 50 bytes and 8k in size - the actual visual content of the jpeg is irrelevant as long as they're valid. I need to generate a thousand or so, and they all have to be unique - even if they're only different by a single pixel. Can I just write a jpeg header/footer and some random bytes in there? I'm not able to use existing photos or sets of photos from the web. The second issue is that the set of images has to be different for each run of the program. I'd prefer to do this in python, as the wrapping scripts are in Python. I've looked for python code to generate jpg's from scratch, and didn't find anything, so pointers to libraries are just as good.

  Read the article

• How do I make a DIV stay at the top of the screen no matter ow far down the page my visitor scrolls?

  - by user1289863

  What I'm saying is, I have some extremely long pages on my website, which can make it annoying I've my visitors need to scroll to the top of the page to be able to navigate to another page. I'm not quite sure what I would call this but any Google search that contains the words 'DIV' and 'float' come up with completely unrelated results... What I'm looking to do is create a DIV that stays at the top of the Screen (not to be confused with the page) so that if the user is at the bottom of the page, they can still see the navigation bar just floating at the top of the screen. What I can think of is to position the DIV relative to the position of the screen but I don't know how to code this. I'm happy to use JavaScript (preferably in the form of jQuery), but if you know how to do this using CSS, I would favour your response. This might help: I know a little bit of jQuery and JavaScript and I know a good deal of CSS and HTML. Thanks in advance.

  Read the article

• Get current location using CLLocationCoordinate2D

  - by Mobility

  I am trying to get current location of user using CLLocationCoordinate2D. I want the values in the format like CLLocationCoordinate2D start = {-28.078694,153.382844 }; So that I can use them like following: NSString *urlAddress = [NSString stringWithFormat:@"http://maps.google.com/?saddr=%1.6f,%1.6f&daddr=%1.6f,%1.6f", start.latitude, start.longitude, destination.latitude, destination.longitude]; I used CLLocation *location = [[CLLocation alloc]init ]; CLLocationDegrees currentLatitude = location.coordinate.latitude; CLLocationDegrees currentLongitude = location.coordinate.longitude; to get current lat & long. But I am getting 0.000 for both when I try to test. I am testing on iPhone 4s. If there is any sample code, it will be great.

  Read the article

• Minimizing distance to a weighted grid

  - by Andrew Tomazos - Fathomling

  Lets suppose you have a 1000x1000 grid of positive integer weights W. We want to find the cell that minimizes the average weighted distance.to each cell. The brute force way to do this would be to loop over each candidate cell and calculate the distance: int best_x, best_y, best_dist; for x0 = 1:1000, for y0 = 1:1000, int total_dist = 0; for x1 = 1:1000, for y1 = 1:1000, total_dist += W[x1,y1] * sqrt((x0-x1)^2 + (y0-y1)^2); if (total_dist < best_dist) best_x = x0; best_y = y0; best_dist = total_dist; This takes ~10^12 operations, which is too long. Is there a way to do this in or near ~10^8 or so operations?

  Read the article

• Gradient boosting predictions in low-latency production environments?

  - by lockedoff

  Can anyone recommend a strategy for making predictions using a gradient boosting model in the <10-15ms range (the faster the better)? I have been using R's gbm package, but the first prediction takes ~50ms (subsequent vectorized predictions average to 1ms, so there appears to be overhead, perhaps in the call to the C++ library). As a guideline, there will be ~10-50 inputs and ~50-500 trees. The task is classification and I need access to predicted probabilities. I know there are a lot of libraries out there, but I've had little luck finding information even on rough prediction times for them. The training will happen offline, so only predictions need to be fast -- also, predictions may come from a piece of code / library that is completely separate from whatever does the training (as long as there is a common format for representing the trees).

  Read the article

• Throwing special type of exception to terminate unit test

  - by trendl

  Assume I want to write a unit test to test a particular piece of functionality that is implemented within a method. If I wanted to execute the method completely, I would have to do some extra set up work (mock objects expectations etc.). Instead of doing that I use the following approach: - I set up the expectations I'm interested in verifying and then make the tested method throw a special type of exception (e.g. TerminateTestException). - Further down in the unit test I catch the exception and verify the mock object expectations. It works fine but I'm not sure it is good practice. I do not do this regularly, only in cases where it saves me time and effort. One thing that comes to mind as an argument against using this is that throwing exceptions takes long time so the tests execute slower than if I used a different approach.

  Read the article

< Previous Page | 417 418 419 420 421 422 423 424 425 426 427 428  | Next Page >