Search Results

Search found 5987 results on 240 pages for 'nested sets'.

Page 58/240 | < Previous Page | 54 55 56 57 58 59 60 61 62 63 64 65  | Next Page >

• Using triggers to update linked server table

  - by tabouakl

  Can I use triggers to insert or update tables in a linked server? I tried it and got the following error: Unable to start a nested transaction for OLE DB provider 'SQLOLEDB'. A nested transaction was required because the XACT_ABORT option was set to OFF. [OLE/DB provider returned message: Cannot start more transactions on this session.] OLE DB error trace [OLE/DB Provider 'SQLOLEDB' ITransactionLocal::StartTransaction returned 0x8004d013: ISOLEVEL=4096].

  Read the article

• Append a large li to ul: best way?

  - by zsharp

  I have a li that has numerous nested divs. I am appending to a ul as follows: $("ul#List").append('<li><div>....many more nested divs...</li>'); the structure of the li is the same as the other lis in ul but i have to modify some elements. My question is simply am I doing it wrong by manually writing out the entire structure?

  Read the article

• Javascript objects: get parent

  - by Dänu

  Hey Guys I got some question about nested javascript objects (is it me, google or is javascript quite poorly documented?). Now, I got the following (nested) object: obj: { subObj: { 'hello world' } }; next thing I do is to reference the subobject like this: var s = obj.subObj; now what I would like to do, is to get a reference to the object obj out of the variable s. Something like: var o = s.parent; Is this somehow possible?

  Read the article

• Resizing UIView to match its content

  - by Thody

  I have a UITextField, a UIButton, and a UIWebView nested in a UIView, which is nested in a UIScrollView. After the UIWebView has loaded its content, I need it to resize the UIWebView and UIView so that the UIScrollView will scroll. I currently have the UIScrollView getting its contentSize from the UIView, but I can't figure out how to do the resizing after the UIWebView's content has loaded.

  Read the article

• Python 3 with numpy and object refernces

  - by user963386

  I need to create a large matrix (array) structure (3 axis) and each element should store the reference to a Python object (myclass instance). Is it possible to use numpy to create such an array. Which data type should I use in order to store Python references? The advantage of numpy is the support of slicing at different levels. The alternativee is to create a nested (nested) list but it is a cumbersome solution.

  Read the article

• How to check whether the tab is active or not in JTabbedPane?

  - by Supereme

  Hi, How to check whether a tab in JTabbedPane instance is active or not, in the class of the tab(nested class) itself and not in the enclosing class? I know that there is a method 'booloean isEnabledAt(int index)'; but this method can only be called in the enclosing class whereas I want to check whether the tab is currently selected or not in the tab class (nested class) itself. Can anybody please suggest me something? Thank you!

  Read the article

• ASP.NET. Css file in master page.

  - by w1z

  Hi All, In my application I have next problem. I created master page and some content pages, some of which are located in the nested folders. In the master page I added the link to .css file <link href="default.css" rel="stylesheet" type="text/css" /> But pages are located in the nested folders can't use this .css file. How can I fix this? I want to have one .css file for all pages (: Thanks!

  Read the article

• Javascript (JSON) Objects: Get Parent

  - by Dänu

  Hey Guys I got some question about nested javascript objects (is it me, google or is javascript quite poorly documented?). Now, I got the following (nested) object: obj: { subObj: { 'hello world' } }; next thing I do is to reference the subobject like this: var s = obj.subObj; now what I would like to do, is to get a reference to the object obj out of the variable s. Something like: var o = s.parent; Is this somehow possible?

  Read the article

• Add effects to datagrid invalidate

  - by MooCow

  Is it possible to add an effect to a datagrid when I call invalidatelist to update the data? If it can be done, can the effects be selectively applied to only certain cells in the grid? The grid is showing an array with some nested array in it. I'm using an int counter to keep track of the nested array element position. When the counter is advanced, I tell the grid to update using invalidatelist.

  Read the article

• Where is all_nested_table_cols in 9i?

  - by thecoop

  Oracle 9i has nested tables, however it doesn't have the all_nested_table_cols sysview (like 10g and 11g) which lets me see what the columns are for these nested tables. How can I find this information on a 9i database?

  Read the article

• Update panel in asp.net

  - by Senthilkumar

  Hi I am using two update panel..in nested way.. can i use like this and also in my project im using clientscript.RegisterScript along with update panel , its not giving any error but , my pop up is not being displayed when i click one item on grid. the pop up is in update panel which is inside (nested).. can anyone help ??? Thank you

  Read the article

• List inside a list in linq - what is it?

  - by Jasl

  My friends were having discussion on nested lists of objects in LINQ and when I asked what does that mean, they laughed :( Can anyone here tell what is nested list. is it same like list inside list? Thank you to all who help me

  Read the article

• CodeIgniter - numbers in sql query are masked with ``

  - by Checkson

  Hello, i'm using CodeIgniter for developing a community board. As I'm using nested sets to get a nested forum hierarchy, I have to run a lot of queries such as: SELECT `id` FROM `forums` WHERE 1 BETWEEN `lft` AND `rgt` My problem: CodeIgniter is replacing the "1" by "`1`" because the "1" is recognized as a column name. Of course, the query does not work any more. Is there a way to get it working? thx in advance

  Read the article

• Suppose I have a python dictionary , many nests.

  - by alex

  If a lot of nested dictionarys, I am trying to find a certain key. this key is called "fruit". But it's nested inside somewhere. How do I find the value of this key?

  Read the article

• Optimal disk partitions for database setup (15 Drives)

  - by Jason

  We are setting up a new database system and have 15 drives to play with (+2 on-board for the OS). With a total of 15 drives would it be better to setup all 14 as one RAID-10 block (+1 hot spare) OR split into two RAID-10 sets one for Data (8 disks) and one for logs/backups (6 disks). My question boils down to the following: is there a specific point where having more drives in a RAID-10 setup will out preform having the drives broken into smaller RAID-10 sets.

  Read the article

• Duplication of Architecture State means physically extra?

  - by Doopy Doo

  Hyper-Threading Technology makes a single physical processor appear as two logical processors; the physical execution resources are shared and the architecture state is duplicated for the two logical processors. So, this means that there are two sets of basic registers such as Next Instruction Pointer, processor registers like AX, BX, CX etc physically embedded in the micro-processor chip, OR they(arch. state) are made to look two sets by some low level duplication by software/OS.

  Read the article

• Adding local users / passwords on Kerberized Linux box

  - by Brian

  Right now if I try to add a non-system user not in the university's Kerberos realm I am prompted for a Kerberos password anyway. Obviously there is no password to be entered, so I just press enter and see: passwd: Authentication token manipulation error passwd: password unchanged Typing passwd newuser has the same issue with the same message. I tried using pwconv in the hopes that only a shadow entry was needed, but it changed nothing. I want to be able to add a local user not in the realm and give them a local password without being bothered about Kerberos. I am on Ubuntu 10.04. Here are my /etc/pam.d/common-* files (the defaults that Ubuntu's pam-auth-update package generates): account # here are the per-package modules (the "Primary" block) account [success=1 new_authtok_reqd=done default=ignore] pam_unix.so # here's the fallback if no module succeeds account requisite pam_deny.so # prime the stack with a positive return value if there isn't one already; # this avoids us returning an error just because nothing sets a success code # since the modules above will each just jump around account required pam_permit.so # and here are more per-package modules (the "Additional" block) account required pam_krb5.so minimum_uid=1000 # end of pam-auth-update config auth # here are the per-package modules (the "Primary" block) auth [success=2 default=ignore] pam_krb5.so minimum_uid=1000 auth [success=1 default=ignore] pam_unix.so nullok_secure try_first_pass # here's the fallback if no module succeeds auth requisite pam_deny.so # prime the stack with a positive return value if there isn't one already; # this avoids us returning an error just because nothing sets a success code # since the modules above will each just jump around auth required pam_permit.so # and here are more per-package modules (the "Additional" block) # end of pam-auth-update config password # here are the per-package modules (the "Primary" block) password requisite pam_krb5.so minimum_uid=1000 password [success=1 default=ignore] pam_unix.so obscure use_authtok try_first_pass sha512 # here's the fallback if no module succeeds password requisite pam_deny.so # prime the stack with a positive return value if there isn't one already; # this avoids us returning an error just because nothing sets a success code # since the modules above will each just jump around password required pam_permit.so # and here are more per-package modules (the "Additional" block) # end of pam-auth-update config session # here are the per-package modules (the "Primary" block) session [default=1] pam_permit.so # here's the fallback if no module succeeds session requisite pam_deny.so # prime the stack with a positive return value if there isn't one already; # this avoids us returning an error just because nothing sets a success code # since the modules above will each just jump around session required pam_permit.so # and here are more per-package modules (the "Additional" block) session optional pam_krb5.so minimum_uid=1000 session required pam_unix.so # end of pam-auth-update config

  Read the article

• Is it possible to run multiple mongod instances on a single set of database files

  - by 9point6

  We have large multi-gigabyte data sets on which we run very complex queries, for example { $or: [ { id: 30000001, ... }, { id: 30000005, ... }, ..., { id: 30001005, ... } ] } It seems that CPU is actually a bottleneck at this point, so I'd be advantageous to be able to run multiple mongod instances on the same set of database files. We've considered using replica sets to this end, but would prefer to not require the extra disk space simply for CPU reasons.

  Read the article

• Interval tree algorithm that supports merging of intervals with no overlap

  - by Dave Griffiths

  I'm looking for an interval tree algorithm similar to the red-black interval tree in CLR but that supports merging of intervals by default so that there are never any overlapping intervals. In other words if you had a tree containing two intervals [2,3] and [5,6] and you added the interval [4,4], the result would be a tree containing just one interval [2,6]. Thanks Update: the use case I'm considering is calculating transitive closure. Interval sets are used to store the successor sets because they have been found to be quite compact. But if you represent interval sets just as a linked list I have found that in some situations they can become quite large and hence so does the time required to find the insertion point. Hence my interest in interval trees. Also there may be quite a lot of merging one tree with another (i.e. a set OR operation) - if both trees are large then it may be better to create a new tree using inorder walks of both trees rather than repeated insertions of each interval.

  Read the article

• Windows 64-bit registry v.s. 32-bit registry

  - by George2

  Hello everyone, I heard on Windows x64 architecture, in order to support to run both x86 and x64 application, there is two separate/different sets of Windows registry -- one for x86 application to access and the other for x64 application to access? For example, if a COM registers CLSID in the x86 set of registry, then x64 application will never be able to access the COM component by CLSID, because x86/x64 have different sets of registry? So, my question is whether my understanding of the above sample is correct? I also want to get some more documents to learn this topic, about the two different sets of registry on x64 architecture. (I did some search, but not found any valuable information.) thanks in advance, George

  Read the article

• Polygon triangulation

  - by Saurabh

  Hey, I am working on nesting of sheet metal parts and am implementing Minkowski Sums to find No Fit Polygons for nesting. The problem is I can give only convex sets as input to the code which calculates Minkowski sums for me. Hence I need to break a concave polygon, with holes into Convex sets. I am open to triangulation also, but I am looking for a working code on VC++ (6.0). I am slightly running short on time as my whole code is ready and just waiting for input in the form of convex sets. I would really appreciate if somebody with prior experience can help me in this. I have gone through other posts but did not find anything matching to this. I am a student of mechanical engineering and really dun have much idea about computer languages. All I can handle is compiling a code on VC++ and incorporate it with my existing code. Looking forward to responses!! Thanks Warm regards Saurabh India

  Read the article

• spike in my inverse fourier transform

  - by Jon

  I am trying to compare two data sets in MATLAB. To do this I need to filter the data sets by Fourier transforming the data, filtering it and then inverse Fourier transforming it. When I inverse Fourier transform the data however I get a spike at either end of the red data set (picture shows the first spike), it should be close to zero at the start, like the blue line. I am comparing many data sets and this only happens occasionally. I have three questions about this phenomenon. First, what may be causing it, secondly, how can I remedy it, and third, will it affect the data further along the time series or just at the beginning and end of the time series as it appears to from the picture. Any help would be great thanks.

  Read the article

• The fastest way to do a collection subtraction

  - by Tony

  I have two Sets. Set<B> b is the subset of Set<A> a. they're both very huge Sets. I want to subtract b from a , what's the best practice to do this common operation ? I've written to many codes like this , and I don't think it's efficient. what's your idea ? for(int i = 0 ; i < a.size(); i++) { for (int j=0 ; j < b.size() ;j++) { // do comparison , if found equals ,remove from a break; } } And I want to find an algorithm , not only applies to Sets, also works for Array.

  Read the article

• How to expose a Delphi set type via Soap

  - by Wouter van Nifterick

  I'm currently creating soap wrappers for some Delphi functions so that we can easily use them from PHP, C# and Delphi. I wonder what's the best way to expose sets. type TCountry = (countryUnknown,countryNL,countryD,countryB,countryS,countryFIN,countryF,countryE,countryP,countryPl,countryL); TCountrySet = set of TCountry; function GetValidCountrySet(const LicensePlate:string; const PossibleCountriesSet:TCountrySet):TCountrySet; I'm currently wrapping it like this for the soap server: type TCountryArray = array of TCountry; function TVehicleInfo.GetValidCountrySet(const LicensePlate:string; const PossibleCountriesSet:TCountryArray):TCountryArray; It works, but I need to write a lot of useless and ugly code to convert sets--arrays and arrays--sets. Is there an easier, more elegant, or more generic way to do this?

  Read the article

• UPDATE and INSERT differences in syntax is an inconvenience

  - by theband

  I was going through this article today. http://vinothbabu.com/2010/05/08/update-and-insert-differences-in-syntax-is-an-inconvenience/ I was not able to understand this part of the code written by the author. list($sets,$cols,$values)=escape_arr($sets); $insert_sql=”INSERT INTO `avatars` “.implode(’,',$cols).” VALUES(”.implode(’,',$values).”)”; $update_sql=”UPDATE `avatars` SET “.implode(’,',$sets).” WHERE userid=$userid LIMIT 1?; and finally the conclusion part of the article.

  Read the article

< Previous Page | 54 55 56 57 58 59 60 61 62 63 64 65  | Next Page >