Search Results

Search found 1002 results on 41 pages for 'infinite'.

Page 23/41 | < Previous Page | 19 20 21 22 23 24 25 26 27 28 29 30  | Next Page >

• Javascript: find first n prime numbers

  - by bard

  function primeNumbers() { array = []; for (var i = 2; array.length < 100; i++) { for (var count = 2; count < i; count++) { var divisorFound = false; if (i % count === 0) { divisorFound = true; break; } } if (divisorFound == false) {array.push[i];} } return array; } When I run this code, it seems to get stuck in an infinite loop and doesn't return anything... why?

  Read the article

• A basic animation not showing up

  - by Rilakkuma

  I still try different basics with android, and now I'm stuck with animation. I'm trying to implement a simple animation. I've defined animation in xml file like this: alpha android:interpolator="@android:anim/accelerate_interpolator" android:fromAlpha="0.0" android:toAlpha="1.0" duration="3000" repeatCount="infinite" In my main view group I have an ImageView defined like this: <ImageView android:id="@+id/someb" android:src="@drawable/earth_normal" android:layout_width="wrap_content" android:layout_height="wrap_content" android:padding="5dip"/> And this is from my starting activity class: public class Ohayou extends Activity { @Override public void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.main); ImageView earth = (ImageView)findViewById(R.id.someb); Animation earthFadeInAnimation = AnimationUtils.loadAnimation(this, R.anim.fade_in); earth.startAnimation(earthFadeInAnimation); } It finds ImageView successfuly and creates animation. but when I start emulator ImageView just shows the original src image, not an animation. What am I doing wrong? Thanks

  Read the article

• list permutations in haskell

  - by turingcomplete

  So I'm new to haskell and I've been playing with it for a while now. I want to get my function that outputs all list permutations to work. I have written 2 implementations, one works well, the other is giving me an error. Any help would be awesome. This is the first (working) implementation: permute [] = [[]] permute xs = [y| x <- xs, y <- map (x:) $ permute $ delete x xs] This one is giving me an error: permute [] = [[]] permute xs = map (\x -> map (x:) $ permute $ delete x xs) xs and here's the error message: Occurs check: cannot construct the infinite type: t0 = [t0] Expected type: [t0] Actual type: [[t0]] In the expression: map (x :) $ permute $ delete x xs In the first argument of `map', namely `(\ x -> map (x :) $ permute $ delete x xs)' I'd appreciate if someone could explain why I'm getting this error. Thanks

  Read the article

• Multithreaded Win32 GUI message loop

  - by Dave18

  When do you need to use this type of modified message loop in multithreaded application? DWORD nWaitCount; HANDLE hWaitArray[4]; BOOL quit; int exitCode; while (!quit) { MSG msg; int rc; rc = MsgWaitForMultipleObjects(nWaitCount, hWaitArray, FALSE, INFINITE,QS_ALLINPUT); if (rc == WAIT_OBJECT_O + nWaitCount) { while (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE)) { if (msg.message == WM_QUIT) { quit = TRUE; exitCode = msg.wParam; break; } TranslateMessage(&msg); DispatchMessage(&msg); } } else if (rc >= WAIT_OBJECT_0 && rc < WAIT_OBJECT_0 + nwaitCount) { int nlndex = rc - WAIT_OBJECT_0; } else if (rc >= WAIT_ABANDONED_0 && rc < WAIT_ABANDONED_0+ nWaitCount) { int nlndex = rc - WAIT_ABANDONED_O; } }

  Read the article

• javascript function call automatically on page onload instead on onclick

  - by user357134

  I am facing a very strange problem. I have javascript function in my aspx page that i call on the onclick event.but on one particular machine it always automatically called on body onload in infinite loop. Though I already remove all the caching and delte the history and temp files. This seems very strange to me .It works fine on all the machine excpt one. The machine have windows 7 and IE verison 8.0.7600.16385 Can some one please help me. Thanks in advance.

  Read the article

• Detecting coincident subset of two coincident line segments

  - by Jared Updike

  This question is related to: How do I determine the intersection point of two lines in GDI+? (great explanation of algebra but no code) How do you detect where two line segments intersect? (accepted answer doesn't actually work) But note that an interesting sub-problem is completely glossed over in most solutions which just return null for the coincident case even though there are three sub-cases: coincident but do not overlap touching just points and coincident overlap/coincident line sub-segment For example we could design a C# function like this: public static PointF[] Intersection(PointF a1, PointF a2, PointF b1, PointF b2) where (a1,a2) is one line segment and (b1,b2) is another. This function would need to cover all the weird cases that most implementations or explanations gloss over. In order to account for the weirdness of coincident lines, the function could return an array of PointF's: zero result points (or null) if the lines are parallel or do not intersect (infinite lines intersect but line segments are disjoint, or lines are parallel) one result point (containing the intersection location) if they do intersect or if they are coincident at one point two result points (for the overlapping part of the line segments) if the two lines are coincident

  Read the article

• How to hash and check for equality of objects with circular references

  - by mfya

  I have a cyclic graph-like structure that is represented by Node objects. A Node is either a scalar value (leaf) or a list of n=1 Nodes (inner node). Because of the possible circular references, I cannot simply use a recursive HashCode() function, that combines the HashCode() of all child nodes: It would end up in an infinite recursion. While the HashCode() part seems at least to be doable by flagging and ignoring already visited nodes, I'm having some troubles to think of a working and efficient algorithm for Equals(). To my surprise I did not find any useful information about this, but I'm sure many smart people have thought about good ways to solve these problems...right? Example (python): A = [ 1, 2, None ]; A[2] = A B = [ 1, 2, None ]; B[2] = B A is equal to B, because it represents exactly the same graph. BTW. This question is not targeted to any specific language, but implementing hashCode() and equals() for the described Node object in Java would be a good practical example.

  Read the article

• .htaccess wildcard problem

  - by niggles

  I've come across a problem with an .htaccess rule I can't sort out. It works on my MAMP stack and it works on 3 other servers, but it won't work on a particular server and keeps giving me a "500 error with an additional 302 error". It's the wildcard that's throwing it and from Google research it says it may be because of an infinite loop, but it works on other servers just fine. The site in question is being developed in a sub-directory, but then again, so have the other sites: RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteRule ^$ public/ [L] RewriteRule (.*) public/$1 [L] /public has it's own .htaccess file that is: RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteRule ^(.*)$ index.php?url=$1 [PT,L] Any suggestions as mod_rewrite's not my specialty and I can't seem to fix this.2

  Read the article

• How to detect an active x component that does not respond any more?

  - by koschi

  My application is written in C++ and uses the Qt framework. I use the QAxWidget class to access an active x component. Now I need some kind of mechanism that notifies my application each time the active x component has crashed or does not respond any more (due to dead lock or infinite loop). (1) can easily been done by watching the external process of the active x component. But maybe there is a more elegant approach? But how can (2) be implemented?

  Read the article

• Validates presence of each other in two associated models

  - by Sergey Alekseev

  I have the following two models: class Parent < ActiveRecord::Base has_one :child, dependent: :destroy validates :child, presence: true end class Child < ActiveRecord::Base belongs_to :parent validates :parent, presence: true end I want to create Parent object. If I do the following: Parent.create! or Factory(:parent) Exception raises: ActiveRecord::RecordInvalid: Validation failed: Child can't be blank But I can't create Child object without Parent object for the same reason - I need to create Parent object first in order to pass presence validation. As it appears I have some kind of infinite recursion here. How to solve it?

  Read the article

• How can I search based on distance with the Google Maps API?

  - by Shamoon

  So here's the issue... I have a field where users can type in their address (which will be GeoCoded via Google Maps API). I have several addresses of widgets in my database (saved as address.. again can easily be geocoded). What I need is for the user to type in their address and for a list of my widgets to come up based on distance from their address. I have THOUSANDS of addresses for my widgets and users have an infinite number of addresses obviously. Any ideas? Thanks.

  Read the article

• remine focus on the main activity (while switching activities)

  - by rayman

  Hi, Ive got two activities in the same application. the first one is with gui(main activity) the second one is a listener which works infinite without gui. Wierd problem occurs: i am running the second activity with a diffrent thread so i could keep on manipulate the gui.. but for some reason, the gui losing it's focus for some reason, only when i press 'home' and come back to it, then i can continune maniuplate the gui. it feels like after i launch the second activity, the gui activity(the main) is losing the focus. how come? in my mainactivity i have: setContentView(R.layout.main); and its setted as the launcher in the manifest. thanks, ray.

  Read the article

• How to replace all the blanks within square brackets with an underscore using sed?

  - by Ringerrr

  I figured out that in order to turn [some name] into [some_name] I need to use the following expression: s/\(\[[^ ]*\) /\1_/ i.e. create a backreference capture for anything that starts with a literal '[' that contains any number of non space characters, followed by a space, to be replaced with the non space characters followed by an underscore. What I don't know yet though is how to alter this expression so it works for ALL underscores within the braces e.g. [a few words] into [a_few_words]. I sense that I'm close, but am just missing a chunk of knowledge that will unlock the key to making this thing work an infinite number of times within the constraints of the first set of []s contained in a line (of SQL Server DDL in this case). Any suggestions gratefully received....

  Read the article

• What algorithm would you use to code a parrot?

  - by Phil H

  A parrot learns the most commonly uttered words and phrases in its vicinity so it can repeat them at inappropriate moments. So how would you create a software version? Assuming it has access to a microphone and can record sound at will, how would you code it without requiring infinite resources? The best I can imagine is to divide the stream using silences in the sound, and then use some pattern recognition to encode each one as a list of tokens, storing new ones as you meet them. Hashing the token sequences and counting occurrences in a database, you could build up a picture of the most frequently uttered phrases. But given the huge variety in phrases, how do you prevent this just becoming a huge list? And the sheer number of pairs to match would surely generate lot of false positives from the combinatorial nature of matching. Would you use a neural net, since that's how a real parrot manages it? Or is there another, cleverer way of matching large-scale patterns in analogue data?

  Read the article

• How many double numbers are there between 0.0 and 1.0?

  - by polygenelubricants

  This is something that's been on my mind for years, but I never took the time to ask before. Many (pseudo) random number generators generate a random number between 0.0 and 1.0. Mathematically there are infinite numbers in this range, but double is a floating point number, and therefore has a finite precision. So the questions are: Just how many double numbers are there between 0.0 and 1.0? Are there just as many numbers between 1 and 2? Between 100 and 101? Between 10^100 and 10^100+1? Note: if it makes a difference, I'm interested in Java's definition of double in particular.

  Read the article

• Function to identify problematic datatypes

  - by Zach

  I just spent several hours debugging some R code, only to discover that the error was due to an Inf that had sneaked in during my calculations. I had checked for NA, but hadn't thought to check for Inf. I wrote the following function to help prevent this situation in the future: is.bad <- function(x){ is.na(x) | is.nan(x) | is.infinite(x) } > is.bad(c(NA, NaN, Inf, -Inf, 0, 1, 1000, 1e6)) [1] TRUE TRUE TRUE TRUE FALSE FALSE FALSE FALSE Are there any other special data types in R I should be aware of?

  Read the article

• why am i getting an error SyntaxError : invalid syntax for this code

  - by eragon1189

  This is a code in python which calculates f (x) =? ((-1)*x)/(x*x+n*n) n from 1 to infinite.... correct to 0.0001, for the range 1 < x < 100 in steps of 0.1.But i am getting an syntax error,as i am new to programming in python... from scipy import * from matplotlib.pyplot import * x=arange(0.1,100,0.1) f=zeros(len(x)) s=-1 for n in range (1,10000): t=s*x/(x*x+n*n) f +=t s =-s if max(abs(t))< 1e-4 break for xx in c_[x,f]: print "%f %f" % (xx[0],xx[1])

  Read the article

• Function which returns itself

  - by Juliet

  As a purely academic exercise (read "because I have no life"), I'm trying to write a function f which accepts another function g, executes g for its side effect, and returns itself. So I have this: let rec f g x = ignore(g x) fun y -> f g y F# complains: fun y -> f g y;; -------------^^^^^ C:\Users\Juliet\AppData\Local\Temp\stdin(8,14): error FS0001: Type mismatch. Expecting a 'a but given a 'b -> 'a The resulting type would be infinite when unifying ''a' and ''b -> 'a' If it works the way I intend, then I could write: let printer = f (printfn "%s") printer("this")("is")("so")("useless")("its")("awesome!") // prints: // this // is // so // useless // its // awesome Is it possible to write a function like this?

  Read the article

• How to avoid recursion in Java SecurityManager checkConnect?

  - by Zilupe

  I'm trying to take control of a Java code base that does lots of un-documented things. I'm using a custom SecurityManager to check permission requests. Specifically, my code is checking SocketPermission checks -- checkConnect. checkConnect is called when the application tries to resolve a host name to IP address and to connect to a specific IP address. The problem is that I don't know how to properly call host name resolution (InetAddress.getAddressByName) without falling into infinite recursion, because normally checkConnect is called even when I resolve the name from inside the SecurityManager.checkConnect. I have read on the web that I have to call the address resolution from a doPrivileged block, but no idea how. P.S. Is this possible without writing any policy files?

  Read the article

• accessing variable sheet ranges within Google spreadsheet?

  - by Daniel Harvey

  I've been trying to keep this little project entirely within Google docs, but I may have hit a wall. The spreadsheet is being used as a way for multiple users to record individual events with a Template they duplicate. I want to be able to compile a list of names of those attended onto a "report" sheet from all of the unique sheets, which should be after a certain sheet index [3] to [infinite]. Is this sort of variable sheet range possible in Google spreadsheets or do I need to go to the API to get this accomplished?

  Read the article

• Make a <div> square when there is a dynamically changing width based on percentage

  - by Nate

  I am working on a web app that will generate an NxN grid based on the user's selection of N. I want the total width of the grid to be relative (ie 100% of the available space) so that users can print on various paper sizes. I can easily calculate the width of the squares in the grid by % (ie: 100%/N), but I am having issues calculating the height. The height of a web page is always going to be infinite unless I artificially limit it which, like I said, I don't want to do. How can I make the squares in my grid be square versus rectangular when the height and width constraints of my grid are dynamic and not square? Thanks in advance!

  Read the article

• I want to run both MAMP and native local webserver on mac os x 10.6.4

  - by user1065921

  I have set up a local webserver using MAMP on ports 8888 for Apache and 8889 for MySQL - I am using this exclusively for Drupal 6 multisite. I would also like to have a local webserver using the native mac os x capabilities through ports 80 and 3306. Is it possible to run both MAMP local server and native osx webserver concurrently? I have tried to install php on my local server by editing the http.conf file but whenever I open a .php file (any php file) using Firefox I get an infinite loop of blank browser windows opening (FF) or in Safari the actual code of the php file is displayed rather than the php processed page. Have I missed/messed up something? Thanks,

  Read the article

• Is there away to load a page only once with AJAX?

  - by digitup

  I have an AJAX call to load a function once the page is loaded, the function opens a lightbox a like frame with some data. The issue is that if I click on close (lightbox frame), the page loads again and again loading the frame so the use never reaches the page under the layer of frame since the frame load on infinite loop. The Ajax is repeating calling the function I guess but I would like to load the frame once and when the user clicks X (close) he may return to the original page. $(document).ready(function(){ var city = $('#citycode').html(); $.ajax({ //when page is loaded, fire the following function success: function(){ //the function to be fired located in the page in seperate file openX(city + //some other parameters); }}); }); Any tips?

  Read the article

• select subquery cause mysql server to be unresponsive

  - by Xiao

  DELETE FROM item_measurement WHERE measurement_id IN ( SELECT (-id) AS measurement_id FROM invoice_item WHERE invoice_id = 'A3722' ) I've really tried hard to find what's wrong with the code. I tried to run this in a php page, which doesn't respond. I also tried the same line in phpmyadmin, infinite spinning circle and I had to restart the server(MAMP on Mac 10.9). No error was given in browser/ If I run the delete and select separately, they both finish very quickly. I don't think it's a performance issue because the separate run took < 0.1 sec each. Thanks for any help in advance. Edit: I also found that a simple select statement will also suspend mysql: select * from item_measurement where measurement_id in (select -id from invoice_item where invoice_id='A3722')

  Read the article

• c++ - FIFO implementation

  - by Narek

  While implementing a FIFO I have used the following structure: struct Node { T info_; Node* link_; Node(T info, Node* link=0): info_(info), link_(link) {} }; I think this a well known trick for lots of STL containers (for example for List). Is this a good practice? What it means for compiler when you say that Node has a member with a type of it's pointer? Is this a kind of infinite loop? And finally, if this is a bad practice, how I could implement a better FIFO.

  Read the article

< Previous Page | 19 20 21 22 23 24 25 26 27 28 29 30  | Next Page >