Search Results

Search found 3996 results on 160 pages for 'operations'.

Page 62/160 | < Previous Page | 58 59 60 61 62 63 64 65 66 67 68 69  | Next Page >

• what are the advantages and disadvantages of making ajax calls using jquery?

  - by Pandiya Chendur

  As jquery ajax calls makes life really cool without a page refresh... But still interested to know some of the advantages and disadvantages of making ajax calls with jquery.... As i am using ajax calls for all my Add,Edit and Delete operations in my website it works pretty well as of now... Still knowing about the disadvantages would make life easier during deployment....

  Read the article

• In Pylons, how do I perform actions after writing the response?

  - by Chung Wu

  In a pylons controller, I would like to first return the response to the request (so that the user gets a response ASAP), and then perform some additional operations (say, updating view counts, etc.) that didn't need to happen to generate the response. What's the best-practice for doing things like this? Thanks!

  Read the article

• Creating JMS Queues at runtime.

  - by ankur

  I am working on an application where the app user can create / delete queues . Also , he would be able to move a message from 1 queue to another, delete a message , rearrange the messages in the queue based on some filter. One possible design is to use activemq for queues and apache camel for various other operations having integrated with Grails. But I am not sure whether ActiveMQ allows creation /deleltion queues at runtime. Would this be a good choice to implement such system?

  Read the article

• Record a copy or move that has already occurred using Subversion

  - by Matt Joiner

  Mercurial provides a -A, --after option for moves and copies, which records those operations after they've already occurred. How can I achieve this using Subversion?

  Read the article

• Issue in CheckedChanged event

  - by Gaddigesh

  I have a check box and I have subscribed for the CheckedChanged event. The handler does some operations in there. I check and uncheck the checkbox programmatically (ex: chkbx_Name.Checked = true), and the CheckedChanged event gets fired. I want this event to be fired only when I manually check or uncheck it. Is there any way to avoid firing of this event when i check/uncheck it programmatically?

  Read the article

• Windows Azure: Parallelization of the code

  - by veda

  I have some matrix multiplication operation. I want to parallelize the execution of those operations through multiple processors.. This can be done on high performance computing cluster using MPI (Message Passing Interface). Like wise, can I do some parallelization in the cloud using multiple worker roles. Is there any means for doing that.

  Read the article

• DOM Storage and locks

  - by user535759

  Since DOM storage and its equivalencies persist in between tabs and windows, I've thought about using it for message passing. The problem is that fetch and store are different operations, and therefore not atomic. I have models that rely on UUID generation, conflict resolutions, and beaconing to do the small subset of what I need to do, but my real question is this: Since the local storage is a shared memory resource, what are the locking mechanisms available for mutual access?

  Read the article

• pattern to transfer search model to dao

  - by zeroed

  We have a dao as a project (jar file). Clients use its interfaces and factories to operate with database. Using standard CRUD operations, dao allows you to search an entity by some search criteria. What is the best way to represent this criteria? Is transfer object appropriate pattern in this situation? How should client create SearchModel instance? Please, share. Regards.

  Read the article

• Where can I find a C# implementation of SHA-1 not using the built in libraries?

  - by Peter

  I am trying to rewrite the sha-1 algorithm for parallelization in a personal project of mine. Just wondering if anyone knows where I can find a C# implementation of the actual mathematical operations to perform the hash, not just the System.Security.Cryptography function.

  Read the article

• Java library for trees similar to JGraphT for graphs?

  - by lexicore

  I'm a big fan of JGraphT, a Java library for graphs. Could anyone recommend a similar Java library for trees? Preferrably FOSS. What I need is a good API, preferrably typesafe with generics which allows modelling different kinds of trees (with some user data attached to verticies/edges) and run different algorithms and operations on these trees. For instance, traverse or balance. At the moment I'm not interested in visualization of trees.

  Read the article

• Use Java and RegEx to convert casing in a string

  - by Andreas

  Problem: Turn "my testtext TARGETSTRING my testtext" into "my testtext targetstring my testtext" Perl supports the "\L"-operation which can be used in the replacement-string. The Pattern-Class does not support this operation: Perl constructs not supported by this class: [...] The preprocessing operations \l \u, \L, and \U. http://java.sun.com/j2se/1.4.2/docs/api/java/util/regex/Pattern.html

  Read the article

• Return dataset in dataflow

  - by praveen

  Hi All, Could I get ideas on retrieving the dataset using lookup method. Basically, my scenario as I have source data needs to lookup for other source table and on matching column from source I need to get all the records from other source data. its a one to many relations. I tried Lookup but gives only one record on matching condition, OLE DB command don't retrieve any data as it will do only Insert/Update operations. Thanks prav

  Read the article

• What is "urgent data"?

  - by timn

  The man page of epoll_ctl() says about EPOLLPRI: There is urgent data available for read(2) operations. How exactly is "urgent data" defined and who decides which data has priority?

  Read the article

• Erlang: What are the pros and cons of different methods for avoiding intermediate variables?

  - by erlacher

  At one point while traveling the web, I came across a great page which contrasted the clarity and terseness of different methods of doing a sequence of operations without having to make a bunch of throwaway variables, e.g., Var1, Var2, Var3. It tried list comprehensions, folds, maps, etc. For some reason, now matter what I google, I can't find it again. Anyone have any idea what I'm talking about? Or want to explore the topic anyway?

  Read the article

• A single button should be used in all the forms.

  - by mugamath

  i need to use a single button for all forms in a vb.net project. The single button should be called in the forms to perform operations. For eg., In a form i need to save, update the records. When i call the button, save and update buttons should be appeared at runtime using the single button. guide me....

  Read the article

• Help me to find a better approach-Design Pattern

  - by DJay

  I am working on an ASP.Net web application in which several WCF services are being used. At client level, I am creating channel factory mechanism to invoke service operations. Right now, I have created an assembly having classes used for channel factory creation code for every service. As per my assumption this is some sort of facade pattern. Please help me to find a better approach or any design pattern, which I can use here.

  Read the article

• How to manually (bitwise) perform (float)x? (homework)

  - by Silver

  Now, here is the function header of the function I'm supposed to implement: /* * float_from_int - Return bit-level equivalent of expression (float) x * Result is returned as unsigned int, but * it is to be interpreted as the bit-level representation of a * single-precision floating point values. * Legal ops: Any integer/unsigned operations incl. ||, &&. also if, while * Max ops: 30 * Rating: 4 */ unsigned float_from_int(int x) { ... } We aren't allowed to do float operations, or any kind of casting. Now I tried to implement the first algorithm given at this site: http://locklessinc.com/articles/i2f/ Here's my code: unsigned float_from_int(int x) { // grab sign bit int xIsNegative = 0; int absValOfX = x; if(x < 0){ xIsNegative = 1; absValOfX = -x; } // zero case if(x == 0){ return 0; } //int shiftsNeeded = 0; /*while(){ shiftsNeeded++; }*/ unsigned I2F_MAX_BITS = 15; unsigned I2F_MAX_INPUT = ((1 << I2F_MAX_BITS) - 1); unsigned I2F_SHIFT = (24 - I2F_MAX_BITS); unsigned result, i, exponent, fraction; if ((absValOfX & I2F_MAX_INPUT) == 0) result = 0; else { exponent = 126 + I2F_MAX_BITS; fraction = (absValOfX & I2F_MAX_INPUT) << I2F_SHIFT; i = 0; while(i < I2F_MAX_BITS) { if (fraction & 0x800000) break; else { fraction = fraction << 1; exponent = exponent - 1; } i++; } result = (xIsNegative << 31) | exponent << 23 | (fraction & 0x7fffff); } return result; } But it didn't work (see test error below): Test float_from_int(-2147483648[0x80000000]) failed... ...Gives 0[0x0]. Should be -822083584[0xcf000000] 4 4 0 float_times_four I don't know where to go from here. How should I go about parsing the float from this int?

  Read the article

• Does acos, atan functions in stl uses lots of cpu cycles

  - by jan

  Hi all, I wanted to calculate the angle between two vectors but I have seen these inverse trig operations such as acos and atan uses lots of cpu cycles. Is there a way where I can get this calculation done without using these functions? Also, does these really hit you when you in your optimization?

  Read the article

• how to swap array-elements to transfer the array from a column-like into a row-like representation

  - by Christian Ammer

  For example: the array a1, a2, a3, b1, b2, b3, c1, c2, c3, d1, d2, d3 represents following table a1, b1, c1, d1 a2, b2, c2, d2 a3, b3, c3, d3 now i like to bring the array into following form a1, b1, c1, d1, a2, b2, c2, d2, a3, b3, c3, d3 Does an algorithm exist, which takes the array (from the first form) and the dimensions of the table as input arguments and which transfers the array into the second form? I thougt of an algorithm which doesn't need to allocate additional memory, instead i think it should be possible to do the job with element-swap operations.

  Read the article

• How does one use TrafficStats.incrementOperationCount()?

  - by Dheeraj

  The documentation for TrafficStats.incrementOperationCount() says: Increment count of network operations performed under the given accounting tag. This can be used to derive bytes-per-operation. I want to find the total number of bytes transferred during a particular network operation. Since this API claims to help in deriving bytes-per-operation, can someone help me understand how to use it?

  Read the article

• What are the tell-tale signs that my code needs to make use of multi-threading?

  - by dotnetdev

  Hi, I am using a third party API which performs what I would assume are expensive operations in terms of time/resources used (image recognition, etc). What tell-tale signs are there that the code under test should be made to use threads to increase performance? I have a profiler and will be profiling the code I write which will rely on this API. Thanks

  Read the article

• Generics that Restricts the Types to Int, Double, long

  - by Ngu Soon Hui

  Is it possible to constraint a method so that it receives only int, double, long or other numerical types that has the usual numerical operations ( such as +,-,*,/) defined?

  Read the article

• What would be the datastructure in following scenorio?

  - by Abhishek Jain

  Please note that there is no limitation of memory. I need to insert int from 1 to 1000. I can do the following operations in constant order of time: push(), pop() and getMax() Please suggest me appropriate datastructure.

  Read the article

• I want to generate DDL for entire schema in oracle 10 G ?

  - by gnash-85

  Hi Experts, I am using Oracle 10G. I am new to oracle, I have little bit regarding dbms_metadata.get_ddl, now using this utility i want to generate a DDL for my entire schema. I mean what ever DDL operations done on my schema (testschema). Please help me out. Thanks Nash.

  Read the article

• What would be the datastructure in following scenario? (Stack with maximum)

  - by Abhishek Jain

  Please note that there is no limitation of memory. I need to insert int from 1 to 1000. I can do the each of the following operations in constant order of time: push():adds to the top pop():removes the top element getMax(): returns the max element Please suggest me appropriate datastructure.

  Read the article

< Previous Page | 58 59 60 61 62 63 64 65 66 67 68 69  | Next Page >