Search Results

Search found 9226 results on 370 pages for 'cocktail sort'.

Page 220/370 | < Previous Page | 216 217 218 219 220 221 222 223 224 225 226 227  | Next Page >

• Must I loop to search results for a specific value?

  - by tag

  I have a table in the database: name Opinion Tim Tim has an opinion John other random text Dan Dan's random text Al Al says something else I call this data and get it back in getRecords.lastResult To access John's opinion, I could use: getRecords.lastResult[1].opinion But that's only because I know that John is the second record (record 1), but this may change. So the right way is to search through the results to first find the record index for John, then access his opinion. My guess is I need some sort of a loop? Is there an easier way to search for John directly without a loop?

  Read the article

• How to order the images in a mysql database?

  - by user305270

  Hy! Here is my problem: i have a profile and this profile has for example 100 images. When someone visit this profile the first image will be the first result of my query that sorts by updated_at. But if the user would want to put the image with the (id = 8) to be the first, then (id = 22) then (id = 88) and so on? I need to put another field or is really necessary a new table to make a custom sort on images? and maybe someone explain this to me how to do? thanks, i appreciate your help ;)

  Read the article

• Binary search of unaccesible data field in ldap from python

  - by EricR

  I'm interested in reproducing a particular python script. I have a friend who was accessing an ldap database, without authentication. There was a particular field of interest, we'll call it nin (an integer) for reference, and this field wasn't accessible without proper authentication. However, my friend managed to access this field through some sort of binary search (rather than just looping through integers) on the data; he would check the first digit, check if it was greater or less than the starting value, he would augment that until it returned a true value indicating existence, adding digits and continuing checking until he found the exact value of the integer nin. Any ideas on how he went about this? I've access to a similarly set up database.

  Read the article

• Is it possible to create thread-safe collections without locks?

  - by Andrey

  This is pure just for interest question, any sort of questions are welcome. So is it possible to create thread-safe collections without any locks? By locks I mean any thread synchronization mechanisms, including Mutex, Semaphore, and even Interlocked, all of them. Is it possible at user level, without calling system functions? Ok, may be implementation is not effective, i am interested in theoretical possibility. If not what is the minimum means to do it? EDIT: Why immutable collections don't work. This of class Stack with methods Add that returns another Stack. Now here is program: Stack stack = new ...; ThreadedMethod() { loop { //Do the loop stack = stack.Add(element); } } this expression stack = stack.Add(element) is not atomic, and you can overwrite new stack from other thread. Thanks, Andrey

  Read the article

• Strange padding in Safari when using SVG images

  - by Naman Goel

  I thought I was having issues with margins but then on a closer look I found that SVGs are acting funky in Safari 6. I am building a simple Hexagon based website. Of course I used negative vertical margins to for a little overlap to 'inter-lock' the hexagons. And to save space I was using SVG images for the hexagons. It works great in chrome and firefox, but in Safari, there is a strange padding in the SVG images. I'm using simple img tags for the svg images. Everything works when I switch to PNG, but I'd prefer to stick to SVGs. Any insight? Can I perhaps delve into the SVG code and somehow fix the SVG problem in Safari? or is it some sort of bug, that I can do nothing about without browser sniffing?

  Read the article

• Monitor database table for external changes from within Rails application

  - by jhwist

  I'm integrating some non-rails-model tables in my Rails application. Everything works out very nicely, the way I set up the model is: class Change < ActiveRecord::Base establish_connection(ActiveRecord::Base.configurations["otherdb_#{RAILS_ENV}"]) set_table_name "change" end This way I can use the Change model for all existing records with find etc. Now I'd like to run some sort of notification, when a record is added to the table. Since the model never gets created via Change.new and Change.save using ActiveRecord::Observer is not an option. Is there any way I can get some of my Rails code to be executed, whenever a new record is added? I looked at delayed_job but can't quite get my head around, how to set that up. I imagine it evolves around a cron-job, that selects all rows that where created since the job last ran and then calls the respective Rails code for each row.

  Read the article

• Statement hierarchy in programming languages

  - by sudo

  I quickly wrote an interpreter for some sort of experimental programing language i came up with, in PHP (yes, in PHP). The language itself doesn't have anything really special, I just wanted to give it a try. I got the basic things working (Hello World, input to output, string manipulation, arithmetics) but I'm getting stuck with the management of blocks and grouped statements. What I mean is: PHP and most other languages let you do this: ((2+2)*(8+2)+2), of course not only with mathematical computations. My program structure currently consists of a multidimensional array built like this: ID => Type (Identifier, String, Int, Newline, EOF, Comma, ...) Contents (If identifier, int or string) How could I allow statements to be executed in a defined order like in the PHP example above?

  Read the article

• Delphi component or library to display mathematical expressions

  - by Svein Bringsli

  I'm looking for a simple component that displays mathematical expressions in Delphi. When I started out I thought it would be easy to find something on the net, but it turns out it was harder than anticipated. There are lots and lots of components that will parse mathematical expressions, but few (none?) that will display them. Ideally I would like a component as simple as a TLabel, where I could set the caption to some expression and it would be displayed correctly, but some sort of library that let's me draw expressions to a canvas would also be sufficient for my needs. Update: I'm not talking about plotting graphs of functions or something like that. I want to display (for instance) (X^2+3)/X like this:

  Read the article

• Upload files with java

  - by Marius

  I'd like to upload a few files to a http server. Basically what i need is some sort of a post request to the server with a few parameters and the files. I've seen examples of just uploading files, but didn't find how to also pass additional parameters. So the question would be what's the simplest and free solution of doing this? Does anyone have any file upload examples that i could study? I've been googling for a few hours, but (maybe it's just one of those days) couldn't find exactly what i needed. The best solution would be something that doesn't involve any third party classes or libraries. Thank you

  Read the article

• Line numbering in Visual Studio

  - by Cyclone

  Why doesn't VS have any sort of line numbering? Is there any way to enable it, or a plugin for it? I know, the number of lines of code in a program doesn't matter, but sometimes it is nice to know how long a program is, or what line number something is for reference. I can't seem to find that as an option anywhere, to my surprise. Thanks for the help! This is Visual Studio 2010 Ultimate. (if you have read my older questions, I've been using 2008 Express until now.)

  Read the article

• What happened to the Windows "Midi Mapper"

  - by interstar

  I wrote a windows program many years ago, which created music by sending notes to the "midi mapper" (and thence to the midi-synth on my sound-card) Today, I have a soft-synth which, allegedly accepts midi information, so I'd assume it should be possible to use today's equivalent of a midi-mapper to route the midi output from my program to the soft-synth. There's clearly no longer a midi-mapper application in windows, but my program still works (on XP) in that it drives the built-in soundcard synth, so there must be some sort of midi handling layer in windows. How can I get at this? And maybe redirect the midi to the soft-synth?

  Read the article

• PHP regex help -- reverse search?

  - by Ian Silber

  So, I have a regex that searches for HTML tags and modifies them slightly. It's working great, but I need to do something special with the last closing HTML tag I find. Not sure of the best way to do this. I'm thinking some sort of reverse reg ex, but haven't found a way to do that. Here's my code so far: $html = "<div id="test"><p style="hello_world">This is a test.</p></div>"; $pattern = array('/<([A-Z][A-Z0-9]*)(\b[^>]*)>/i'); $replace = array('<tag>'); $html = preg_replace($pattern,$replace,$html); // Outputs: <tag><tag>This is a test</p></div> I'd like to replace the last occurance of "" with something special, say for example, "". Any ideas?

  Read the article

• How do I watch a file for changes using Python?

  - by Jon Cage

  I have a log file being written by another process which I want to watch for changes. Each time a change occurrs I'd like to read the new data in to do some processing on it. What's the best way to do this? I was hoping there'd be some sort of hook from the PyWin32 library. I've found the win32file.FindNextChangeNotification function but have no idea how to ask it to watch a specific file. If anyone's done anything like this I'd be really grateful to hear how... [Edit] I should have mentioned that I was after a solution that doesn't require polling. [Edit] Curses! It seems this doesn't work over a mapped network drive. I'm guessing windows doesn't 'hear' any updates to the file the way it does on a local disk.

  Read the article

• Finding recurrence relations of an algorithm

  - by Roarke

  I'm reading my algorithms text book, and I'm reading about recurrence relations and finding the algorithms big O complexity. I run across this line "In the case of the merge-sort algorithm, we get the recurrence equation: t(n) = b if n < 2 = 2t(n/2) +bn if n >= 2 for b > 0 my response was "how the heck did we know that?!?!" So i'm wondering if there is a systematic approach, or just a logical way of getting these recurrence relations from the algorithms can some one explain where the b and the two 2's come from?

  Read the article

• php - Can I integrate functions with same content, different names?

  - by Gal

  I have a couple of functions inside a class that essentially do the same thing: public function fn_a(){ return __FUNCTION__; } public function fn_b(){ return __FUNCTION__; } public function fn_c(){ return __FUNCTION__; } I need those functions to remain in their current names so I intentionally did not do: public function fn_($letter){ return __FUNCTION__.$letter; } I was hoping for some sort of way to minify the verboseness of code here, since they all do the same. The ultimate situation would be something like this: public functions fn_a, fn_b, fn_c() { return __FUNCTION__; } Another solution, if applicable, might be doing something like Class's "extends": fn_b, fn_c extend fn_a? What do you think guys?

  Read the article

• Search for Variable Usage In SSIS tasks

  - by yoni.s

  Hi all: As what seems to be some sort of penance for sins in a prior life, I have been tasked with maintaining some SSIS packages. (NO! NO BADMOUTHING SSIS!! BAD PROGRAMMMER! NO DOUGHNUT!). Anyhoo, I many of the packages have variables, defined in an outer container, which are used in multiple inner containers, in script tasks. What I want to do, is find out all the places in a package a variable being used; in other words, search for instances of variable usage in all tasks of a package. This would be a huge help, but I cannot for the life of me find out how this can be done in BIDS. (this is SSIS/BIDS 2008) Thanks for any help, YS

  Read the article

• Parameter Tuning for Perceptron Learning Algorithm

  - by Albert Diego

  Hi, I'm having sort of an issue trying to figure out how to tune the parameters for my perceptron algorithm so that it performs relatively well on unseen data. I've implemented a verified working perceptron algorithm and I'd like to figure out a method by which I can tune the numbers of iterations and the learning rate of the perceptron. These are the two parameters I'm interested in. I know that the learning rate of the perceptron doesn't affect whether or not the algorithm converges and completes. I'm trying to grasp how to change n. Too fast and it'll swing around a lot, and too low and it'll take longer. As for the number of iterations, I'm not entirely sure how to determine an ideal number. In any case, any help would be appreciated. Thanks.

  Read the article

• cached schwartzian transform

  - by davidk01

  I'm going through "Intermediate Perl" and it's pretty cool. I just finished the section on "The Schwartzian Transform" and after it sunk in I started to wonder why the transform doesn't use a cache. In lists that have several repeated values the transform recomputes the value for each one so I thought why not use a hash to cache results. Here' some code: # a place to keep our results my %cache; # the transformation we are interested in sub foo { # expensive operations } # some data my @unsorted_list = ....; # sorting with the help of the cache my @sorted_list = sort { ($cache{$a} or $cache{$a} = &foo($a)) <=> ($cache{$b} or $cache{$b} = &foo($b)) } @unsorted_list; Am I missing something? Why isn't the cached version of the Schwartzian transform listed in books and in general just better circulated because on first glance I think the cached version should be more efficient?

  Read the article

• Are Scala "continuations" just a funky syntax for defining and using Callback Functions?

  - by Alex R

  And I mean that in the same sense that a C/Java for is just a funky syntax for a while loop. I still remember when first learning about the for loop in C, the mental effort that had to go into understanding the execution sequence of the three control expressions relative to the loop statement. Seems to me the same sort of effort has to be applied to understand Continuations (in Scala and I guess probably other languages). And then there's the obvious follow-up question... if so, then what's the point? It seems like a lot of pain (language complexity, programmer errors, unreadable programs, etc) for no gain.

  Read the article

• What are good ways to guarantee business continuity with a SaaS product?

  - by tommyvdz

  For my Bachelor Thesis I am researching how SaaS providers can arrange some sort of business continuity guarantee. You probably know the Source Code Escrow arrangements for 'shrink-wrapped' software. They give customers access to the source code and all applicable documentation whenever the software supplier gets into (financial) trouble. This clearly does not work for SaaS, because customers have no use for just the source code, and customers probably can not afford not being able to login to their CRM system for a couple weeks because the SaaS provider went bankrupt. I am currently researching different methods to solve this problem. Do you know good and practical solutions to solve this continuity problem? Or companies that already offer a good solution? Thanks!

  Read the article

• A maximum character limit on the preg functions?

  - by animuson

  On my site I use output buffering to grab all the output and then run it through a process function before sending it out to the browser (I don't replace anything, just break it into more manageable pieces). In this particular case, there is a massive amount of output because it is listing out a label for every country in the database (around 240 countries). The problem is that in full, my preg_match functions seems to get skipped over, it does absolutely nothing and returns no matches. However, if I remove parts of the labels (no particular part, just random pieces to reduce characters) then the preg_match functions works again. It doesn't seem to matter what I remove from the label, it just seems to be that as long as I remove so many characters. Is there some sort of cap on what the preg functions can handle or will it time out if there is too much data to be scanned over?

  Read the article

• Is there a limit on the number of mutex objects that can be created in a Windows process?

  - by young-phillip

  I'm writing a c# application that can create a series of request messages. Each message could have a response, that needs to be waited on by a consumer. Where the number of outstanding request messages is constrained, I have used the windows EVENT to solve this problem. However, I know there is a limit on how many EVENT objects can be created in a single process, and in this instance, its possible I might exceed that limit. Does anyone know if there is a similar limit on creation of mutex objects or semaphores? I know this can be solved by some sort of pool of shared resources, that are grabbed by consumers when they need to wait, but it would be more convenient if each request message could have its own sync object.

  Read the article

• How can I tell NetBeans to use the latest available version of a JAR for a library?

  - by Freiheit

  I have a Netbeans project with a library defined which includes several JARs. These JARs are versioned like lib\blah\com.blah.wibble.jar_0.6.1.201004161543 . These are nightly builds from another project so that version changes often. I know I can point NetBeans at the specific JARs with the version name, but this means that every time I get a new version I have to update the NetBeans library. I can also strip the version name from the JARs, but this makes it hard to track down bugs. "What version of the blah JARs?" is usually the second thing we ask when we find a bug. Is it possible to tell Netbeans to use included com.blah.wibble.jar_[??????] where ???? is some sort of automatic pointer to use the latest available version?

  Read the article

• jQuery.post dynamic data callback function

  - by FFish

  I have a script that requires quite e few seconds of processing, up to about minute. The script resizes an array of images, sharpens them and finally zips them up for the user to download. Now I need some sort of progress messages. I was thinking that with jQuery's .post() method the data from the callback function would progressively update, but that doesn't seem to work. In my example I am just using a loop to simulate my script: $(document).ready(function() { $('a.loop').click(function() { $.post('loop.php', {foo:"bar"}, function(data) { $("div").html(data); }); return false; }); }); loop.php: for ($i = 0; $i <= 100; $i++) { echo $i . "<br />"; } echo "done";

  Read the article

• Upgrading Visual Studio web service project says to "convert to web application."

  - by Buggieboy

  I have a Visual Studio 2003 web service project that I have to upgrade to Visual Studio 2008. After I have run the conversion wizard, I get this message: You have completed the first step in converting your Visual Studio .NET 2003 web project. To complete the conversion, please select your project in the Solution Explorer and choose the 'Convert to Web Application' context menu item. I got this message with another project, which was originally a "web site", rather than an ASP.NET "web application". It made sense to in that case (sort of). Why, however, would I not just want to have this project remain a web service project? Additionally, when I follow the instructions and select "Convert to Web Application" from the context menu, I don't get any feedback that anything has changed. Should it have? If so, what?

  Read the article

< Previous Page | 216 217 218 219 220 221 222 223 224 225 226 227  | Next Page >