Search Results

Search found 9563 results on 383 pages for 'insertion sort'.

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

• 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

• 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

• 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

• 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

• 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

• Main Memory Database with C++ Interface

  - by myahya

  I am looking for a main memory database with a C++ interface. I am looking for a database with a programmatic query interface and preferably one that works with native C++ types. SQLLite, for example, takes queries as string and needs to perform parsing ... which is time consuming. The operations I am looking for are: Creation of tables of arbitrary dimensions (number of attributes) capable of storing integer types. Support for insertion, deletion, selection, projection and (not a priority) joins.

  Read the article

• Invoking a PHP script from a mysql trigger

  - by Shyju

  Is there anyway invoke a PHP page / function when a record being inserted in to the mysql db table. We dont have control over the record insertion procedure.Is there some thing called trigger which can call a PHP script back ?

  Read the article

• Please verify the trigger created below for delete is correct or not?

  - by Parth

  Please verify the trigger created below for delete is correct or not? Its for the insertion of every field of deleted row in audit table.. Please reply whether this trigger will work for me? delimiter // CREATE TRIGGER audit_menu BEFORE DELETE ON menu FOR EACH ROW BEGIN INSERT INTO audit (menuid, field, oldvalue, changedone) VALUES (OLD.menuid, 'name', OLD.name, UNIX_TIMESTAMP() ), (OLD.menuid, 'age', OLD.age, UNIX_TIMESTAMP() ), (OLD.menuid, 'address', OLD.address, UNIX_TIMESTAMP() ), (OLD.menuid, 'sex', OLD.sex, UNIX_TIMESTAMP() ), (OLD.menuid, 'town', OLD.town, UNIX_TIMESTAMP() ) END;// delimiter ;

  Read the article

• Simplest way of persisting Java Objects using Apache Camel ?

  - by sanre6

  Can JDBC component be used for inserting Java objects into a Mysql database ? I want to store Java objects that i am routing through message exchanges into a database using spring xml . i have never used hibernate before , so cannot use the hibernate or JPA components Ex Code : <from uri="bean:MessageProducer?method=send" /> /* bean sending the objects */ /* what code do i need to write for insertion of these Objects into testdb */ <to uri="jdbc:testdb"/>

  Read the article

• What is the best data-structure for storing elements which will be retrieved only once and then dele

  - by Jay

  I want to design a data-structure for storing elements, which will be retrieved only once after insertion and will be deleted after that. I can't use a stack or queue as the order of retrieval is not guaranteed. [EDIT] - I would like to use contigous memory (I would prefer to avoid doing malloc every now and then) and also I would prefer searchability also.

  Read the article

• Best Java thread-safe locking mechanism for collections?

  - by Simon

  What would be the least-slow thread-safe mechanism for controlling multiple accesses to a collection in Java? I am adding objects to the top of a collection and i am very unsure what would be the best performing collection. Would it be a vector or a queue? I originally thought an ArrayList would be fast but i ran some experiments and it was very slow. EDIT: In my insertion testing a Vector delared using volatile seems to be the fastest?

  Read the article

• MySQL: NOW() giving me zeros

  - by Tunji Gbadamosi

  I have a table which I want to record the timestamp of every order at every insertion time. However, I'm getting zero values for the timestamps. Here's my schema: CREATE TABLE IF NOT EXISTS orders( order_no VARCHAR(16) NOT NULL, volunteer_id VARCHAR(16) NOT NULL, date TIMESTAMP DEFAULT NOW(), PRIMARY KEY (order_no), FOREIGN KEY (volunteer_id) REFERENCES volunteer(id) ON UPDATE CASCADE ON DELETE CASCADE)

  Read the article

• Dynamic Date Time Dropdown List

  - by user302720

  At phpro.org and other sites there is a tutorial, "Dynamic Date Time Dropdown List". How does one get the $_POST variables for insertion into a mysql database? Thanks in advance for any and all assistance.

  Read the article

• dynamic vector-like container but whose elements save their indexes?

  - by serejko

  All the elements should have fixed position in the array after insertion until I explicitly delete them from there. Is there something like this in boost or wherever? Thanks

  Read the article

• MySQL Trigger to prevent INSERT under certain conditions

  - by Richard Mar.

  I want to make a trigger that will prevent the insertion if the birthdate (one of the columns) is in the future. I have this: CREATE TRIGGER foo BEFORE INSERT ON table FOR EACH ROW BEGIN IF NEW.birthdate > CURRENT_DATE() THEN ???mystery??? END IF; END; What goes in the mystery part?

  Read the article

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