Search Results

Search found 22627 results on 906 pages for 'program transformation'.

Page 490/906 | < Previous Page | 486 487 488 489 490 491 492 493 494 495 496 497  | Next Page >

  • How would someone implement mathematical formulae in java?

    - by Mohit Deshpande
    What I mean is like have to user input a string with multiple variables and get the value of those variable. Like a simple quadratic formula: x^2 + 5x + 10. Or in java: (Math.pow(x,2)) + (x * 5) + 10The user would then enter that and then the program would solve for x. I will be using the BeanShell Interpreter class to interpret the string as an equation. But how would I solve for x?

    Read the article

  • What software should i use to work with Ruby?

    - by paranoid_pedlar
    I've only ever learned to "program" with notepad when I was learning to create batch files in Windows. I would appreciate if you can explain to me the benefits of working with an IDE over a text editor or vice versa. Please don't give emotional responses or argue someone else's suggestion/advice. I use Linux primarily. Also, I would like to be able to make programs that can be used in Windows, but programmed in Linux. Thanks.

    Read the article

  • Debug the StackOverFlow exception

    - by BDotA
    When I run my C# program it throws an Stack Overflow exception in one of the methods on a DLL that I have a reference to it in my solution. but no debugging info is available to me because it says it is an stack overflow exception and no info is available. what are the next debugging steps that I should follow to understand what is going on and why ? thanks Edit: here is the code that stops at: static public Collection SortCollection(Collection oCollection, string sPropertyName, string sKeyPropertyName) { return SortCollection(oCollection, sPropertyName, sKeyPropertyName); }

    Read the article

  • Allocation of memory with LE routines

    - by HaWe
    At /questions/2000777/allocation-of-memory-in-variable-length-tables NealB mentioned LE routines to allocate/deallocate memory in a non-CICS COBOL program. I'd very much like to know how this is done: how the LE routine is called. (I'm familiar with the LINKAGE SECTION and with SET ADDRESS.) Since I have no access to an IBM mainframe at the moment - meaning no access to online documentation - some code snippets could enlighten me.

    Read the article

  • Multiple AHK questions

    - by Tomezor
    1 - Curious as to how to make a popup asking to confirm if I want to load the program before it loads. Example: ^g::Run C:\GW2\gw2.exe 2 - How to set a title(instead of the script name), align text within msgbox and control the perimeters of msgbox with this format: F1::msgbox, (LTrim Insert Text Here ) 3 - How to either temporarily pause and unpause a specific AHK script only allowing that hotkey to work within the script OR to disable scripted hotkeys while in a full screen application or game OR a "on/off pause/resume" command to disable multiple other commands such as ^g, ^h and the like.

    Read the article

  • Windows Explorer Context Menu Integration, get file that was right clicked on

    - by racxen
    I've already figured out how to add a menu item to the right click context menu of the windows explorer using the registry. I currently have it set to launch my application when my menu item is clicked. However, I want to know if there is a way to know what file is was right clicked on. I thought it would have been sent as a command line argument to the launched program, but it's not. Any ideas?

    Read the article

  • How to print all possibilities of a number that occur interchanging the digits in a number?

    - by RADHA KRISHNA LOLLA
    I want to print that the all possibilities of a number that occurs interchanging the digits in a number? I want to print that the all possibilities of a number that occurs interchanging the digits in a number? Suppose a number 1234 it have 24 possibilities 4!=24 123 have 6 possibilities 3!=6 123 132 213 231 312 321 i want these numbers as output please tell me the structure of this program in the python

    Read the article

  • Software testing terminology

    - by shiouming
    Let say I have written a small program that reads file_A and file_B as input data of test_case_A and test_case_B, passes the input to component_X which needs to be test, then verifies result against predefined expectation. That component_X could be in the same process, or different process on another machine. I try to learn more about testing, but confused by various terms. Take above scenario as example, which of them is fixture/mock/harness/stub? Thanks.

    Read the article

  • Best way to bind directly to objects returned from a web service

    - by zachary
    In silverlight 3 I had an object that had a property that was an observable collection. I returned this via a web service then databinded to it. Upgrade to silveright 4..... Now my program crashes because the Observable Collection is converted to an array. What is the best way to do this? Observable collection is not even an option any longer.

    Read the article

  • Start Windows GUI Application Development With C++

    - by Chris
    I'm looking into creating a GUI program for Windows in C++, I have a good knowledge of C++ in the command line and also in game creation. But I'm not sure where to start with GUI application development. I have Visual Studio 2010 and have created new projects with a GUI but these templates are complex and leaves me not understanding whats happening and how to modify it. So I'm asking where do I start? Preferably good websites that you can recommend or tutorials, rather than books being a poor student :)

    Read the article

  • finding a solution to a giving maze txt.file

    - by alberto
    how can i fix this program, the problem is when it print out the coordinate it give me a 7 for the start and finish, i would appreciated you help, thanks start = (len(data)) finish = (len(data)) pos= [] for i in range(len(pos)): for j in range(len(pos[i])): if pos[i][j] == "S": start=(i,j) elif pos[i][j] == "F": finish=(i,j) print "S found in",start, print "\nF found in",finish,"\n"

    Read the article

  • Beginner += in Ruby

    - by WANNABE
    Looking at this block, I can follow the whole program until I hit, sum += square. What is he point of this line, what does it say??? sum = 0 [1, 2, 3, 4].each do |value| square = value * value sum += square end puts sum

    Read the article

  • Qt gstreamer problem

    - by ZolaKt
    Ptterb can you post your full code please? I copied your code. Added fvidscale_cap to pipeline, with: self.player.add(self.source, self.scaler, self.fvidscale_cap, self.sink) gst.element_link_many(self.source,self.scaler, self.fvidscale_cap, self.sink) From the main program I create a new QWidget, and pass its winId() to Vid constructor. The widget start loading, but crashes. The output says: should be playing Segmentation fault

    Read the article

  • Sorting a list of numbers with modified cost

    - by David
    First, this was one of the four problems we had to solve in a project last year and I couldn’t find a suitable algorithm so we handle in a brute force solution. Problem: The numbers are in a list that is not sorted and supports only one type of operation. The operation is defined as follows: Given a position i and a position j the operation moves the number at position i to position j without altering the relative order of the other numbers. If i j, the positions of the numbers between positions j and i - 1 increment by 1, otherwise if i < j the positions of the numbers between positions i+1 and j decreases by 1. This operation requires i steps to find a number to move and j steps to locate the position to which you want to move it. Then the number of steps required to move a number of position i to position j is i+j. We need to design an algorithm that given a list of numbers, determine the optimal (in terms of cost) sequence of moves to rearrange the sequence. Attempts: Part of our investigation was around NP-Completeness, we make it a decision problem and try to find a suitable transformation to any of the problems listed in Garey and Johnson’s book: Computers and Intractability with no results. There is also no direct reference (from our point of view) to this kind of variation in Donald E. Knuth’s book: The art of Computer Programing Vol. 3 Sorting and Searching. We also analyzed algorithms to sort linked lists but none of them gives a good idea to find de optimal sequence of movements. Note that the idea is not to find an algorithm that orders the sequence, but one to tell me the optimal sequence of movements in terms of cost that organizes the sequence, you can make a copy and sort it to analyze the final position of the elements if you want, in fact we may assume that the list contains the numbers from 1 to n, so we know where we want to put each number, we are just concerned with minimizing the total cost of the steps. We tested several greedy approaches but all of them failed, divide and conquer sorting algorithms can’t be used because they swap with no cost portions of the list and our dynamic programing approaches had to consider many cases. The brute force recursive algorithm takes all the possible combinations of movements from i to j and then again all the possible moments of the rest of the element’s, at the end it returns the sequence with less total cost that sorted the list, as you can imagine the cost of this algorithm is brutal and makes it impracticable for more than 8 elements. Our observations: n movements is not necessarily cheaper than n+1 movements (unlike swaps in arrays that are O(1)). There are basically two ways of moving one element from position i to j: one is to move it directly and the other is to move other elements around i in a way that it reaches the position j. At most you make n-1 movements (the untouched element reaches its position alone). If it is the optimal sequence of movements then you didn’t move the same element twice.

    Read the article

  • iPhone Application failing to come back from sigkill

    - by overscore
    I have no idea if this is intended behaviour, but whenever the application exits (say, the user is double-clicking the home button and pressing on the red dash on the icon) I get the dreaded SIGKILL. Now, when I try to launch the app again all I get is the old screen state and a frozen (I presume ?) program. It could be because of clunky memory management, but NSZombieEnabled doesn't seem to agree. Any thoughts ?

    Read the article

  • [Errno 10061] No connection could be made because the target machine actively refused it

    - by user551717
    I've tried to connect to my local machine every time I try and run my program. I am a nub, so it's probably a simple mistake somewhere. def connect(self): self.conn = socket.socket(socket.AF_INET, socket.SOCK_STREAM) self.conn.connect((self.host,self.port)) That is the code causing the error. The host and port are defined. Why is it giving me this error report? [Errno 10061] No connection could be made because the target machine actively refused it

    Read the article

  • LINK : fatal error LNK1104: cannot open file '.obj'

    - by FL3SH
    I have a big problem with building a simple program. I am using many tutorials, instructions and I can't solve it. I edit the variable's path as follows: C/C++-General-Additionals Include Directories-MyOpenCv\build\include Linker-General-Additionals Library Directories-MyOpenCv\build\x86\vc11\lib Linker-Input-Additional Dependencies-*I added .libs The same in Debug and Release.Windows 8 x64, VS2012 x32, OpenCV 2.4.5

    Read the article

  • PHP readdir(): 3 is not a valid Directory resource

    - by Jordan
    <?php function convert(){ //enable error reporting for debugging error_reporting(E_ALL | E_STRICT); //convert pdf's to html using payroll.sh script and //pdftohtml command line tool $program = "payroll.sh"; $toexec="sh /var/www/html/tmp/" . $program . " 2>&1"; $exec=shell_exec($toexec); //display message from payroll.sh //echo $exec; //echo ('<br/>'); } function process(){ $dir = '/var/www/html/tmp/converted'; //echo ('one'); if (is_dir($dir)) { //echo ('two'); if ($dh = opendir($dir)) { //echo ('three'); while (($file = readdir($dh)) !== false) { //echo ('four'); if ($file != "." && $file != ".."){ echo 'opening file: '; echo $file; echo ("<br/>"); $fp = fopen('/var/www/html/tmp/converted/' . $file, 'r+'); $count = 0; //while file is not at the EOF marker while (!feof($fp)) { $line = fgets($fp); if($count==21) { $employeeID = substr($line,71,4); echo 'employee ID: '; echo $employeeID; echo ('<br/>'); //echo ('six'); $count++; } else if($count==30) { $employeeDate = substr($line,71,10); echo 'employee Date: '; echo $employeeDate; echo ('<br/>'); //echo ('seven'); $count++; } else { //echo ('eight'); //echo ('<br/>'); $count++; } } fclose($fp); closedir($dh); } } } } } convert(); process(); ?> I am setting up a php script that will take a paystub in pdf format, convert it to html, then import it into Drupal after getting the date and employee ID. The code only seems to process the first file in the directory then it gives me this: opening file: dd00000112_28_2010142011-1.html employee ID: 9871 employee Date: 12/31/2010 Warning: readdir(): 3 is not a valid Directory resource in /var/www/html/pay.mistequaygroup.com/payroll.php on line 29 The '3' in the error really confuses me, and google is not helping much. Could it be the 3rd iteration of the loop? The only files in the directory reddir() is scanning are the .html files waiting to be processed. Any ideas? Also, how does my code look? I'm fairly new to doing any real programming and I don't get too much input around work.

    Read the article

< Previous Page | 486 487 488 489 490 491 492 493 494 495 496 497  | Next Page >