Search Results

Search found 25946 results on 1038 pages for 'cost based optimizer'.

Page 494/1038 | < Previous Page | 490 491 492 493 494 495 496 497 498 499 500 501  | Next Page >

  • Get location of object when animation is complete in android

    - by bgm
    Is there a way to find out the final location of my animated "object" after the animation? Let's say I am animating an ImageView with location in parent as (0,0 - 20,20) using TranslateAnimation and ScaleAnimation over 1 second with setFillAfter(true). How to I find the final location of this "object" (since the View location itself does not move)? I need to continue the animation from this point based on an user input.

    Read the article

  • Implementing coroutines in Java

    - by JUST MY correct OPINION
    This question is related to my question on existing coroutine implementations in Java. If, as I suspect, it turns out that there is no full implementation of coroutines currently available in Java, what would be required to implement them? As I said in that question, I know about the following: You can implement "coroutines" as threads/thread pools behind the scenes. You can do tricksy things with JVM bytecode behind the scenes to make coroutines possible. The so-called "Da Vinci Machine" JVM implementation has primitives that make coroutines doable without bytecode manipulation. There are various JNI-based approaches to coroutines also possible. I'll address each one's deficiencies in turn. Thread-based coroutines This "solution" is pathological. The whole point of coroutines is to avoid the overhead of threading, locking, kernel scheduling, etc. Coroutines are supposed to be light and fast and to execute only in user space. Implementing them in terms of full-tilt threads with tight restrictions gets rid of all the advantages. JVM bytecode manipulation This solution is more practical, albeit a bit difficult to pull off. This is roughly the same as jumping down into assembly language for coroutine libraries in C (which is how many of them work) with the advantage that you have only one architecture to worry about and get right. It also ties you down to only running your code on fully-compliant JVM stacks (which means, for example, no Android) unless you can find a way to do the same thing on the non-compliant stack. If you do find a way to do this, however, you have now doubled your system complexity and testing needs. The Da Vinci Machine The Da Vinci Machine is cool for experimentation, but since it is not a standard JVM its features aren't going to be available everywhere. Indeed I suspect most production environments would specifically forbid the use of the Da Vinci Machine. Thus I could use this to make cool experiments but not for any code I expect to release to the real world. This also has the added problem similar to the JVM bytecode manipulation solution above: won't work on alternative stacks (like Android's). JNI implementation This solution renders the point of doing this in Java at all moot. Each combination of CPU and operating system requires independent testing and each is a point of potentially frustrating subtle failure. Alternatively, of course, I could tie myself down to one platform entirely but this, too, makes the point of doing things in Java entirely moot. So... Is there any way to implement coroutines in Java without using one of these four techniques? Or will I be forced to use the one of those four that smells the least (JVM manipulation) instead?

    Read the article

  • Saving several Monticello packages at once

    - by Juan Barreda
    I am working with Pharo Smalltalk. Suppose you want to save your own group of packages into a local repository, you know that your packages are prefixed with "MyPrefix". What's the right message to do it? In code: | myPkgs | myPkgs := MCPackage allInstances select: [: mcPkg | mcPkg name beginsWith: 'MyPrefix' ]. myPkgs do: [ : myPkg | myPkg ??? ]. It would be too difficult to script that one for a web based repository?

    Read the article

  • Read from cin or a file

    - by m42a
    When I try to compile the code istream in; if (argc==1) in=cin; else { ifstream ifn(argv[1]); in=ifn; } gcc fails, complaining that operator= is private. Is there any way to set an istream to different values based on a condition?

    Read the article

  • Email SMTP validator

    - by Hrvoje
    I need to send hundreds of newsletters, but would like to check first if email exists on server. It's called smtp validation, at least i think so, based on my research on net. There's several libraries that can do that, and also a page with open-source code in asp (http://www.coveryourasp.com/ValidateEmail.asp#Result3), but I have hard time reading classic asp, and it seams that it uses some third-party library... Does someone have code for smtp validation in c#, and/or general explanation of how it works?

    Read the article

  • Recommended crossbrowser testing solution

    - by Kaaviar
    Hi, When developing for the web, one of the saddest issue might be crossbrowser testing. Is there a great solution for testing both on IE6, IE7, IE8, Chrome, Safari and Firefox ? I tried some web-based solutions but it's not really usable when working offline. Thx Boris

    Read the article

  • Getting keypress cursor co-ordinates

    - by nijikunai
    I'm writing a simple browser based ide with intellisense (code completion) support. So whenever the user inserts a dot (.) character, I need to display a div element (as context menu) near the cursor. Can this can be done and if yes how? Thanks in advance!

    Read the article

  • Webservice description - xsd schema and xml generation

    - by dominolog
    Hello I want to design a WebService for communication between Win Mobile 6.5 based Palm device and a PHP web server. The Palm device software will be developed on .NET compact framework. The communication between web server and device I envision as XML over HTTP. I want a tool that will let me design the Webservice (interfaces, methods) and then generate the xsd schema together with xml messages for the communication. Can you recommend something? Regards

    Read the article

  • FlexScroll and IFRAMES

    - by Neurofluxation
    Hey, I was wondering whether there is a way to use FlexScroll (JavaScript custom image based scrollbars) with IFRAMES instead of the DIVS. Yes, I know scrollable DIVS are better than IFRAMES. This is my clients requirement though. Cheers.

    Read the article

  • What makes a sexy UI?

    - by nimo
    I'm in the progress of remaking one our products user interface to be more modern and apealing aswell as user friendly. It's a web based application that is used by all types of people. My question for you is what do you think are the key factors of a sexy interface? An interface that is appealing and leave the user with a WOW feeling?

    Read the article

  • Template function in C# - Return Type?

    - by LifeH2O
    It seems that c# does not support c++ like templates. template <class myType> myType GetMax (myType a, myType b) { return (a>b?a:b); } I want my function to have return type based on its parameters, how can i achieve this in c#? How to use templates in C#

    Read the article

  • SQLITE Blob OR file system for images

    - by saint cyr
    Hello, I am building an application based on a single table with a column with text. Occassionally, an adjacent column will have an image. Is it better to store this image as a BLOB in SQLITE or should I store them on the file system and reference them from my programs. Thanks!

    Read the article

  • Perl: Compare and edit underlying structure in hash

    - by Mahfuzur Rahman Pallab
    I have a hash of complex structure and I want to perform a search and replace. The first hash is like the following: $VAR1 = { abc => { 123 => ["xx", "yy", "zy"], 456 => ["ab", "cd", "ef"] }, def => { 659 => ["wx", "yg", "kl"], 456 => ["as", "sd", "df"] }, mno => { 987 => ["lk", "dm", "sd"] }, } and I want to iteratively search for all '123'/'456' elements, and if a match is found, I need to do a comparison of the sublayer, i.e. of ['ab','cd','ef'] and ['as','sd','df'] and in this case, keep only the one with ['ab','cd','ef']. So the output will be as follows: $VAR1 = { abc => { 123 => ["xx", "yy", "zy"], 456 => ["ab", "cd", "ef"] }, def => { 659 => ["wx", "yg", "kl"] }, mno => { 987 => ["lk", "dm", "sd"] }, } So the deletion is based on the substructure, and not index. How can it be done? Thanks for the help!! Lets assume that I will declare the values to be kept, i.e. I will keep 456 = ["ab", "cd", "ef"] based on a predeclared value of ["ab", "cd", "ef"] and delete any other instance of 456 anywhere else. The search has to be for every key. so the code will go through the hash, first taking 123 = ["xx", "yy", "zy"] and compare it against itself throughout the rest of the hash, if no match is found, do nothing. If a match is found, like in the case of 456 = ["ab", "cd", "ef"], it will compare the two, and as I have said that in case of a match the one with ["ab", "cd", "ef"] would be kept, it will keep 456 = ["ab", "cd", "ef"] and discard any other instances of 456 anywhere else in the hash, i.e. it will delete 456 = ["as", "sd", "df"] in this case.

    Read the article

  • How to Workout wiht OpenSocial API in java

    - by user324929
    Hello there I'm facing problem with getting start with the Open Social API in java. I already google and bing it but still didn't found a sample to POC the usage of API for console or desktop based application. Can anybody suggest any link, forum or if possible explain the tedious flow of working of this API. You can try this link to try this API http://code.google.com/p/opensocial-java-client/ Thank You

    Read the article

  • Color scaling function

    - by Tomas Pajonk
    I am trying to visualize some values on a form. They range from 0 to 200 and I would like the ones around 0 be green and turn bright red as they go to 200. Basically the function should return color based on the value inputted. Any ideas ?

    Read the article

  • Programming With Markov Algorithms.

    - by Bubba88
    Hello! I Wonder if someone has used Markov Algorithm-based programming system or embedded facility in production or for scientific purpose. I know about 'REFAL' programming language invented a thousand years ago, but it all seems to be dead, so.. Ref: http://en.wikipedia.org/wiki/Markov_algorithm

    Read the article

  • Lookig for "GAE-TaskQueues" in Asp.net

    - by Fabrizio
    I normally works in asp.net. But recently I was testing Google App Engine and I found TaskQueues: it's very interesting and powerful. Does anyone know a similar service for asp.net? I know MSQueue but it's not what I need. I need something like GAE TaskQueue: I put an URL in queue and the URL is triggered (based on queue config).

    Read the article

  • how do you create a simple obejctice-c command line project in xcode

    - by Mark
    im moving from a c# VS2008 world into the mac world and I just wanted to know how I can create a quick little command line based application so that I can write many little objective-c apps without worrying about creating an iPhone app or whatever. Which projects do I create in xcode? I can see the Command Line Tool under "Mac os x" but the only options for the type is "C", "C++", "Core Data", "Core Foundation", "Core Services" and "Foundation" but no simple objective c project? Thanks

    Read the article

  • get a set of files that have been modified after a certain date

    - by jcollum
    Does anyone have a handy powershell script that gets a set of files from TFS based on a modification date? I'd like to say "give me all the files in this folder (or subfolder) that were modified after X/Y/ZZZZ" and dump those files to a folder other than the folder they would normally go to. I know enough powershell to hack about and get this done, eventually, but I'm hoping to avoid that.

    Read the article

  • Can I Do a Foreach on a TimeSpan by Timespan Type?

    - by IPX Ares
    I have a requirement that regardless of the start and dates that I need to loop through that timespan and calculate figures at the month level. I cannot seem to figure it out, and maybe it is not possible, but I would like to do something like: FOREACH Month As TimeSpan in ContractRange.Months Do Calculations (Month.Start, Month.End) NEXT Is this possible or do I need to calculate the number of months, and just iterate through the amount of months and calculate the start/end of that month based on my index?

    Read the article

< Previous Page | 490 491 492 493 494 495 496 497 498 499 500 501  | Next Page >