Search Results

Search found 26214 results on 1049 pages for 'farm solution'.

Page 190/1049 | < Previous Page | 186 187 188 189 190 191 192 193 194 195 196 197  | Next Page >

• How to exit a process run with C++ if it takes more than 5 seconds?

  - by Alex

  I'm implementing a checking system in C++. It runs executables with different tests. If the solution is not correct, it can take forever for it to finish with certain hard tests. That's why I want to limit the execution time to 5 seconds. I'm using system() function to run executables: system("./solution"); .NET has a great WaitForExit() method, what about native C++?. I'm also using Qt, so Qt-based solutions are welcome. So is there a way to limit external process' execution time to 5 seconds? Thanks

  Read the article

• Why does Visual Studio 2008 try to open a project from the wrong folder?

  - by Rising Star

  I'm having a bizarre problem with Visual Studio 2008. I wanted to debug one of the libraries that my web application references. Therefore, I decide to add the project containing the library to my solution so that I can debug them together. The project containing my library sits at c:\webLibs\myproj.vbproj. However, when I try to add the project to my solution, Visual Studio throws the following error: "The project file 'c:\someOtherFolder\myproj.vbproj'. has been moved, renamed, or is not on your computer." As you can see, VS appears to be trying to open a different file than the one I clicked on. I used to have the file in that other location, but not anymore. I've tried restarting VS several times. What could cause this bizarre behavior? Why would Visual Studio try to open my project from the wrong folder?

  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

• is it possible to create a multi-project template that references n number of existing projects and

  - by jcollum

  The situation: I need to create about 40+ solutions that all reference 3 projects and have one project that is unique to each one. I'd like to create a multi-project template that does this, but from what I've read it looks like it's very difficult or impossible (related SO question, but doesn't answer). I want my solution to look like this (names changed of course): These three are used by all solutions created under this "family": MyCompany.Extensions MyCompany.MyProject.Tests.Shared MyCompany.MyProject.Scripts This one is the one that makes the solution unique, 123, 124, 125 etc: MyCompany.MyProject.Tests.Unit123 Is it possible to set up a multi-project template that will generate this structure? References: MSDN Create Multi Project Templates

  Read the article

• how to escape slashes in perl command in unix script?

  - by understack

  end_date=$(date +"%m/%d/%Y") /usr/bin/perl -pi -e "s/_end_date_/${end_date}/g" filename I want to replace string '_end_date_' with current date. Since current date has slashes in it(yes I want the slashes), I need to escape them. How can I do this? I've tried several ways like replacing slashes with "\/" using sed and perl itself but it didn't work. Finally I used 'cut' to break date in 3 parts and escaped slashes but this solution doesn't look good. Any better solution?

  Read the article

• Efficient mapping for a particular finite integer set

  - by R..

  I'm looking for a small, fast (in both directions) bijective mapping between the following list of integers and a subset of the range 0-127: 0x200C, 0x200D, 0x200E, 0x200F, 0x2013, 0x2014, 0x2015, 0x2017, 0x2018, 0x2019, 0x201A, 0x201C, 0x201D, 0x201E, 0x2020, 0x2021, 0x2022, 0x2026, 0x2030, 0x2039, 0x203A, 0x20AA, 0x20AB, 0x20AC, 0x20AF, 0x2116, 0x2122 One obvious solution is: y = x>>2 & 0x40 | x & 0x3f; x = 0x2000 | y<<2 & 0x100 | y & 0x3f; Edit: I was missing some of the values, particularly 0x20Ax, which don't work with the above. Another obvious solution is a lookup table, but without making it unnecessarily large, a lookup table would require some bit rearrangement anyway and I suspect the whole task can be better accomplished with simple bit rearrangement. For the curious, those magic numbers are the only "large" Unicode codepoints that appear in legacy ISO-8859 and Windows codepages.

  Read the article

• SMS Through Email

  - by Patcouch22

  I know this is a subject that has been well covered here and throughout the web, so I am not asking for a list of carrier emails, however my question is how to send a text without knowing the users carrier and preferably without going through a third party. The only solution that I thought of would be send out to all carriers. I would only be sending to US carriers, however would a large number of failed emails slow the mail server at all or cause any other problems? Any advice on this solution or thoughts of others would be great.

  Read the article

• Get next key-value pair in an object

  - by captainclam

  So, given a key, I want to find the next property in an object. Then, I want to return the value of the NEXT property. I can not rely on the keys to be ordered or sequential (they're uuids). Please see below for trivial example of what I want: var db ={ a: 1, b: 2, c: 3 } var next = function(db, key) { // ??? } next(db, 'a'); // I want 2 next(db, 'b'); // I want 3 I also want a prev() function, but I'm sure it will be the same solution. This seems like such a trivial problem but I can't for the life of me figure out how to do it. Happy for the solution to use underscore.js or be written in coffeescript :)

  Read the article

• Making a Png Image transparent in older versions of Internet Explorer...

  - by GUNNOO

  Hello People i have a problem with the png formatted images, i used some PNG images in my mock. when i view the mock in I.E the background of the images are not transparent. i got one solution for making it trasparent in "I.E" from the previous POSTS in the Forum. But my Problem is, i want that image to be tiled horizantlly...using that Filter thing. can any one solve this plz....plz.... i need a solution for making a png in I.E and at the same time it shud be tiled horizontally.

  Read the article

• Using different validation rules based on user input.

  - by chiefanov

  I have a simple form: a combobox and a textbox. My combobox has 2 values: A and B. When value A is selected I want textbox to use a validation rule. When value B is selected there should be no validation rules applied to the textbox. I've read an article that has a solution and I'm trying to use it, but had no luck so far, and I think there might be a more elegant solution. Has anyone done anything like this before? Any ideas are highly appreciated.

  Read the article

• PHP object cannot find method

  - by Daniel Hertz

  Hello, So I have a very simple class that has a method called getThumbUrl() but when I try calling this method on an instance I get Notice: Undefined property: FlickrImage::$getFullUrl But it is clearly there. Here is the code of the function: public function getThumbUrl() { return "http://farm".$this->_farm.".static.flickr.com/".$this->_server."/".$this->_id."_".$this->_secret."_t.jpg"; } And here is where it fails: foreach($photos as $photo) { echo "<img src='$photo->getFullUrl()' />"; } Any ideas? Thanks!

  Read the article

• SQL Server: Find Values that don't exist in a table

  - by MacAnthony

  I have a list or set of values that I would like to know which ones do not currently exist in a table. I know I can find out which ones do exist with: SELECT * FROM Table WHERE column1 IN (x,x,x,x,x) The set is the values I am checking against. Is there a way to find out which values in that set do not exist in column1? Basically, I'm looking for the inverse of the sql statement above. This is for a report, so all I need is the values that don't exist to be returned back. I have and could do this with a left join and putting the values in another table, but the values I check are always different and was hoping to find a solution that didn't involve clearing a table and inserting data first. Trying to find a better solution for me if one exists.

  Read the article

• Alternative to css3 not selector

  - by Raynos

  Are there any alternatives to the :not css3 selector that are compliant with IE8 (and quirks mode). Either in css or javascript/jquery that emulates the selector or something similar. I am using *:not as follows below. Feel free to recommend a solution that avoids the use of :not completely. @media screen { #printable { visibility: hidden; } } @media print { *:not(#printable) { visibility: hidden; } #printable { position: absolute; visibility: visible; } } Note that the use of :not is tied to the use of @media print so just using a simple jQuery solution to apply css to $(":not(#printable)") won't work without being clever. Including an entire library like ie9.js or selectivirz isn't an option as it can effect various other parts of the pages and would involve a large section of re-testing. a jsfiddle that shows it working in browsers that support :not http://jsfiddle.net/Raynos/TjKbz/

  Read the article

• Multiplying numbers on horizontal, vertial, and diagonal lines

  - by untwisted

  I'm currently working on a project Euler problem (www.projecteuler.net) for fun but have hit a stumbling block. One of the problem provides a 20x20 grid of numbers and asks for the greatest product of 4 numbers on a straight line. This line can be either horizontal, vertical, or diagonal. Using a procedural language I'd have no problem solving this, but part of my motivation for doing these problems in the first place is to gain more experience and learn more Haskell. As of right now I'm reading in the grid and converting it to a list of list of ints, eg -- [[Int]]. This makes the horizontal multiplication trivial, and by transposing this grid the vertical also becomes trivial. The diagonal is what is giving me trouble. I've thought of a few ways where I could use explicit array slicing or indexing, to get a solution, but it seems overly complicated and hackey. I believe there is probably an elegant, functional solution here, and I'd love to hear what others can come up with.

  Read the article

• How to reverse a dictionary that it has repeated values (python)

  - by Galois

  Hi guys! So, I have a dictionary with almost 100,000 (key, values) pairs and the majority of the keys map to the same values. For example imagine something like that: dict = {'a': 1, 'c': 2, 'b': 1, 'e': 2, 'd': 3, 'h': 1, 'j': 3} What I want to do, is to reverse the dictionary so that each value in dict is going to be a key at the reverse_dict and is going to map to a list of all the dict.keys that used to map to that value at the dict. So based on the example above I would get: reversed_dict = {1: ['a', 'b', 'h'], 2:['e', 'c'] , 3:['d', 'j']} I came up with a solution that is very expensive and I would really want to hear any ideas more efficient than mine. my expensive solution: reversed_dict = {} for value in dict.values(): reversed_dict[value] = [] for key in dict.keys(): if dict[key] == value: if key not in reversed_dict[value]: reversed_dict[value].append(key) Output >> reversed_dict = {1: ['a', 'b', 'h'], 2: ['c', 'e'], 3: ['d', 'j']} I would really appreciate to hear any ideas better and more efficient than than mine. Thanks!

  Read the article

• Further Details on Vallidating Event not Working....

  - by Sameep

  I have created a custom control that inherit the TextBox, in that control i have override validating event and in validating event i have put validation that checks for the empty field. Now when i use that control on my winform and when i click on save button it immediate fires save event.. the validation event of custom control fires and it displays the error message but still it does not stop the save event to fire.... the save button CauseValidation Property is set to true.. i have also put (this.ValidateChildren()) i have also put CancelEventArgs ce.Cancel = true; in Custom Textbox control but neither working to stop the save event to fires.. i only want to fire Save event if Textbox is not empty. validating event fires, shows message for empty field and immediate fires save event.. now if you got an idea then if you have solution then please provide solution..

  Read the article

• Ruby On Rails - Collection Select - MYSQL Database - Problem Displaying ampersand ("&")

  - by dbkbaki

  I am having an annoying problem displaying the labels of a select box correctly where there is an ampersand contained within the label string. On a form being rendered with the form_for helper the collection_select reads data from a Mysql 5.075 database the text stored in the database is "Surabaya & Surrounding Areas" when rendered and displayed in firefox 3.6 or safari is is displaying as "Surabaya %amp; Surrounding Areas". The code used to render the select is as follows: <%= f.collection_select :parent_id, Destination.roots, :id, :name, {:include_blank => true} %> I have tried adding a h(:name) and also storing && in the database but it still will not display the ampersand correctly. Have searched on google for what I thought would be a simple solution but cant find anything that solves this. Using ROR 2.3.5/Ruby 1.8.7 If anyone has a solution it will be much appreciated. many thanks, David

  Read the article

• Elegant way to search for UTF-8 files with BOM?

  - by vog

  For debugging purposes, I need to recursively search a directory for all files which start with a UTF-8 byte order mark (BOM). My current solution is a simple shell script: find -type f | while read file do if [ "`head -c 3 -- "$file"`" == $'\xef\xbb\xbf' ] then echo "found BOM in: $file" fi done Or, if you prefer short, unreadable one-liners: find -type f|while read file;do [ "`head -c3 -- "$file"`" == $'\xef\xbb\xbf' ] && echo "found BOM in: $file";done It doesn't work with filenames that contain a line break, but such files are not to be expected anyway. Is there any shorter or more elegant solution? Are there any interesting text editors or macros for text editors?

  Read the article

• Where to store users visited pages?

  - by kofto4ka

  Hi there. I have a project, where I have posts for example. The task is next: I must show to user his last posts visit. This is my solution: every time user visits new (for him) topic, I create a new record in table visits. Table visits has next structure: id, user_id, post_id, last_visit. Now my tables visits has ~14,000,000 records and its still growing every day.. May be my solution isnt optimal and exists another way how to store users visits? Its important to save every visit as standalone record, because I also have feature to select and use users visits. And I cant purge this table, because data could be needed later month, year. How I could optimize this situation?

  Read the article

• 2 Column Layout - Main Link Display

  - by Allyson Aguilar

  I have a basic HTML page with a 2 column layout. I created a menu page on the sidebar column and when a link is chosen from the menu I want to display it in the main section of the index.html page. I tried doing this with iframes but its basically creating a duplicate of the index page. Help! I guess I can't post a picture because I'm new to this but I basically have an index page and then a farm with a duplicate of my index page.

  Read the article

• Writing array to text file

  - by user3661876

  I have an array, but it won't write each index to the text file. Instead it is only writing the last index and the other indexes are not appearing. Can anyone help me to get the entire array printed to the text file? static void solve(int k) { if (k == N) // We placed N-1 queens (0 included), problem solved! { // Solution found! using (StreamWriter sw = new StreamWriter("names.txt")) { Console.Write("Solution: "); for (int i = 0; i < N; i++) { Console.Write(position[i] + " "); foreach (int s in position[i].ToString()) { string list = position[i].ToString(); sw.Write(list + " "); } } Console.WriteLine(); sum += 1; } }

  Read the article

• How do I convert output of number_format back to numbers in PHP?

  - by user198729

  PHP can't recognize 1,200.00(generated by number_format) but only 1200.00, What's the general solution for this problem?

  Read the article

• Detect JRE before running Java Application

  - by SamSol

  How to detect JRE when it is not registerd in registry? Is there any solution?

  Read the article

• IIS7: How to bind SSL Certificate to Https Host Header?

  - by h3n

  I have the following Web Farm: 1. http: mydomain1.com port: 80 2. http: mydomain2.com port: 80 3. https: port: 443 SSL Certificate: myCertificate In II7 when you select https binding, the host name will be disabled. I used the appcmd to bind the host name "admin.mydomain2.com" to the website. appcmd set site /site.name:"admin" /+bindings.[protocol='https',bindingInformation='*:443:admin.mydomain2.com'] A new item was added to the bindings. 3. a. https: port: 443 SSL Certificate: myCertificate b. https: admin.mydomain2.com port:443 SSL Certificate: None If for example I want to remove the first item (a), is it possible to assign a certificate to the second binding (b)?

  Read the article

• What is most efficient way of setting row to zeros for a sparce scipy matrix?

  - by Alex Reinking

  I'm trying to convert the following MATLAB code to Python and am having trouble finding a solution that works in any reasonable amount of time. M = diag(sum(a)) - a; where = vertcat(in, out); M(where,:) = 0; M(where,where) = 1; Here, a is a sparse matrix and where is a vector (as are in/out). The solution I have using Python is: M = scipy.sparse.diags([degs], [0]) - A where = numpy.hstack((inVs, outVs)).astype(int) M = scipy.sparse.lil_matrix(M) M[where, :] = 0 # This is the slowest line M[where, where] = 1 M = scipy.sparse.csc_matrix(M) But since A is 334863x334863, this takes like three minutes. If anyone has any suggestions on how to make this faster, please contribute them! For comparison, MATLAB does this same step imperceptibly fast. Thanks!

  Read the article

< Previous Page | 186 187 188 189 190 191 192 193 194 195 196 197  | Next Page >