Search Results

Search found 436 results on 18 pages for 'insertion'.

Page 8/18 | < Previous Page | 4 5 6 7 8 9 10 11 12 13 14 15  | Next Page >

• How to bind events with jquery in django admin when new *Inline is added

  - by sacabuche

  I made a jquery function that binds some fields, but it doesn't work when i add a new inline. The main problem is that i don't know how to detect the insertion in DOM and bind it to my function. Thanks

  Read the article

• What's you favorite algorithm?

  - by Helper Method

  Which algorithm do you like best and why? My favorite algorithm is Insertion Sort. Easy to understand, fast for small arrays, and useful to speed up more complex sorting algorithms (Merge Sort, Quicksort).

  Read the article

• how to use two forms and sumit once

  - by Mac Taylor

  hey guys is it possible to have two forms with two submit buttons but when i click on the button then it saves both forms input fields im concerning to solve this in php /mysql i tried my own way : if ((isset($_POST["form-1"])) && (isset($_POST["form-2"])) { //SQL Insertion } thanks in advance

  Read the article

• Controlling Trigger Execution When Bulk Importing Data

  - by Vishwa

  Hi In bulk insertion only in the last record trigger is executing. If I bulk insert 10 records the trigger is running only for the 10th record. But I need trigger to run on all 10 records. Please help me with an example

  Read the article

• Open Source/ Free alternatives to Redgate Test Data Generator

  - by Perpetualcoder

  I was wondering if there are any free / open source alternatives to RedGate's Data Generator. I do not care if the tool is script based, GUI based, written in anly language/platform. I should be able to target a SQL Server or MySQL schema and have test data generated for me which gets inserted into db directly or generate scripts for insertion.

  Read the article

• How to convert closed bezier curves to Bitmaps?

  - by Sorush Rabiee

  I need an algorithm to convert a closed bezier curve (perhaps self-crossing) to a binary bitmap: 0 for inside pixels and 1 for outside. I'm writing a code that needs to implement some operations on bezier curves, could anybody give me some resources or tutorials about beziere? Wikipedia and others didn't say anything about optimization, subtracting, union, knot insertion and deletion and other operations :-)

  Read the article

• DELETE from two tables with one OUTPUT clause?

  - by lance

  This deletes the document from the Document table and outputs information about the deleted document into the FinishedDocument table. DELETE FROM Document OUTPUT Deleted.DocumentId , Deleted.DocumentDescription INTO FinishedDocument WHERE DocumentId = @DocumentId I need to delete the document not just from the Document table, but also from the DocumentBackup table. Meanwhile, I need to maintain insertion into FinishedDocument. Is all of this possible with only one statement? If not, is a second DELETE (against DocumentBackup), with all of it wrapped in a transaction, the way to go?

  Read the article

• comparison of sorting algorithms

  - by hash5

  When do we prefer a) bucket sort, and b) radix sort over comparison sorts like bubble sort insertion sort selection sort merge sort quick sort?

  Read the article

• Logout solution (ASP.NET)

  - by Irgat

  I programmed a web site, prepared a login mechanism(via textbox, not Login tools), users want to logout, they click logout button. However, my problem is that if users don't click logout button or close web page or switch another one, How can I understand this situation? According my mechanism, when users logout ,in DB some insertion and delete operation are making. I also want to do this with closing page,switch another one. Thanks.

  Read the article

• Is there an equivalent of std::set in C#?

  - by Danvil

  I would like to have a container StdStyleSet<A> of class A : IComparable<A> { ... } which satisfies the properties of std::set. This would especially be: The elements themselve are the keys Automatically sorted on insertion

  Read the article

• How to decode "application/x-qabstractitemmodeldatalist" in Qt for drag and drop?

  - by gct

  I've created a child class of QTreeWidget that I want to be able to drag items from another tree widget too (I want to handle the insertion myself though), as well as from a QListWidget. I've overridden the dropEvent method in my class, and it looks like the mimetype of the data I'm getting from my QTreeWidget is application/x-qabstractitemmodeldatalist, how can I decode this to get the items from the tree back out?

  Read the article

• Add to SortedSet<T> and its complexity

  - by Andrei Taptunov

  MSDN states the following SortedSet(T).Add Method : If Count is less than the capacity of the internal array, this method is an O(1) operation. Could someone please explain "how so"? I mean when adding new value we need to find a correct place to add a value (comparing it with another values) and internal implementation looks like a "Red-Black tree" with O (log N) insertion complexity.

  Read the article

• Java equivalent of C++ std::map?

  - by Rudiger

  I'm looking for a Java class with the characteristics of C++ std::map's usual implementation (as I understand it, a self-balancing binary search tree): O(log n) performance for insertion/removal/search Each element is composed of a unique key and a mapped value Keys follow a strict weak ordering I'm looking for implementations with open source or design documents; I'll probably end up rolling my own support for primitive keys/values. This question's style is similar to: Java equivalent of std::deque, whose answer was "ArrayDeque from Primitive Collections for Java".

  Read the article

• Java - PriorityQueue vs sorted LinkedList

  - by msr

  Hello, Which implementation is less "heavy": PriorityQueue or a sorted LinkedList (using a Comparator)? I want to have all the items sorted. The insertion will be very frequent and ocasionally I will have to run all the list to make some operations. Thank you!

  Read the article

• Get the inserts

  - by Endrigo

  Hi there, I want to know if I can get all the INSERTs that are inserted at my database, from once. Writing just once ... I want that shows me all the inserts with the data and everything that was inserted in the moment of insertion. Not just the data, but everything including the INSERTs, is this possible? I'm using SQL server 2008, regards to everyone

  Read the article

• Not able to execute trigger at bulk insert in sql

  - by Vishwa

  Hi In bulk insertion only in the last record trigger is executing. Example : if i bulk insert 10 records the trigger is running only for the 10th record. But I need trigger to run on all 10 records. Please help me with an example

  Read the article

• about Sorting Algorithms

  - by matin1234

  Hi I want to know that we always use Sorting algorithm like (Insertion Sort or Merge Sort,...) just for lists and arrays?? and we do not use these algorithms for stack or queue ??? thanks

  Read the article

• Memory Allocation for a Map with a fixed number of insertions

  - by prasoon99

  I want to insert n elements into a map where n is known ahead of time. I do not want memory allocation at each insertion. I want all memory allocation at the beginning. Is there a way to do this? If so, how? Will writing some sort of memory allocator help?

  Read the article

• Java's equivalent to bisect in python

  - by systemsfault

  Hello all, Is there a java equivalent to python's bisect library? With python's bisect you can do array bisection with directions. For instance bisect.bisect_left does: Locate the proper insertion point for item in list to maintain sorted order. The parameters lo and hi may be used to specify a subset of the list which should be considered; by default the entire list is used.

  Read the article

• Renumbering numerically ordered div ID's when adding one in the middle with Javascript

  - by DavidR

  I'm developing an application with javascript. What I need is to have divs with id's (1,2,3...) and be able to insert a div between, for example, 2 and 3, with jquery, and then have that be the new three, and three becomes four, four becomes five, etc. I've got the div insertion working, I just need to know how to reorder the divs. Any ideas?

  Read the article

• Can I raise System Error in sql Server in a stored procedure.

  - by Shantanu Gupta

  I am writing a stored procedure where i m using try catch block. Now i have a unique column in a table. When i try to insert duplicate value it throws exception with exception no 2627. I want this to be done like this if (exists(select * from tblABC where col1='value')=true) raiseError(2627)--raise system error that would have thrown if i would have used insert query to insert duplicate value And which method will be better, using insert query or checking for duplicate value before insertion using Select query ?

  Read the article

• About Sorting Algorithms applied to Stacks and Queues

  - by matin1234

  I want to know why we always use Sorting algorithm like (Insertion Sort or Merge Sort,...) just for lists and arrays? And why we do not use these algorithms for stack or queue?

  Read the article

• Import Text Specification in Access Database

  - by MACS

  We are using C#.net & use access database code for import of text file specification into access table is there any access database limit for this action, as we may have records 5 lac (500,000) ,will this process work for huge records?? If No then how can we handle huge records insertion in access database for same ? Thanks

  Read the article

• Perl, time efficient hash

  - by Mike

  Is it possible to use a Perl hash in a manner that has O(log(n)) lookup and insertion? By default, I assume the lookup is O(n) since it's represented by an unsorted list. I know I could create a data structure to satisfy this (ie, a tree, etc) however, it would be nicer if it was built in and could be used as a normal hash (ie, with %)

  Read the article

• Limiting the size of a python dictionary

  - by anthony

  I'd like to work with a dict in python, but limit the number of key/value pairs to X. In other words, if the dict is currently storing X key/value pairs and I perform an insertion, I would like one of the existing pairs to be dropped. It would be nice if it was the least recently inserted/accesses key but that's not completely necessary. If this exists in the standard library please save me some time and point it out!

  Read the article

< Previous Page | 4 5 6 7 8 9 10 11 12 13 14 15  | Next Page >