Search Results

Search found 31417 results on 1257 pages for 'site structure'.

Page 776/1257 | < Previous Page | 772 773 774 775 776 777 778 779 780 781 782 783  | Next Page >

• Global variable not stable after platform changed.

  - by user350555

  Our embedded system is built on a hw/sw platform made by enea. After the platform updated recently, we found some operations on the global variable keep crashing the system. For example, we have a global map structure holding some data. We can insert/iterate the map once or twice, then the address of the elements in the map suddenly changed to some forbidden addresses like 0x0 or 0x1d, the system just crash. The only different before/after the platform update is : 1) sw part: It's a c++ software and We changed the compiler from diab cc to gcc. 2) hw part: we have a new board, but the cpu is still powerpc405s. I tried every possible way but still can't figure out the reason. Any thoughts?

  Read the article

• Suggested C++ books?

  - by Josh Bradley

  Ok, I've had one semester of C++ and will be taking a second semester in it after I have taken a Data Structure class this fall. In the first class, we dealt mainly with C++ syntax and the textbook we used was ok, but now I'm wanting to go ahead and purchase a great C++ book that encompasses a lot of the programming concepts used today. I'm learning Objective-C on my own and was able to get through the whole object-oriented stuff pretty easily, along with other things like pointers, inheritance, delegation, etc. It doesn't have to exactly have EVERYTHING in it, but I do want to buy the book with the most information in it. Money is no problem. So my question is what book did you use or still use for C++? Is it a book that you can reference back to if you ever forget how to do something small, or would you have to go online and find the answer.

  Read the article

• Updating XML using attribute to identify value in SQL server

  - by Tadhg

  I have a XML structure in a XML column on a SQL Server table as follows: <Customizations> <Customization name="OtherValue"> <value>Test</value> </Customization> . . . . <Customization name="Year"> <value>2009</value> </Customization> </Customizations> and I'm looking to update the value of Customization with the element with the attribute Year. Been looking at this for a while and best attempt is: UPDATE TestTable SET XmlColumn.modify( ' replace value of (/Customizations/Customization/@name[.="Year"]/value)[1] with ( "2010" ) ') Can someone help point out where I'm going wrong?

  Read the article

• Opinions on platform game actor/background collision resolving

  - by Kawa

  Imagine the following scenario: I have a level whose physical structure is built up from a collection of bounding rectangles, combined with prerendered bitmap backgrounds. My actors, including the player character, all have their own bounding rectangle. If an actor manages to get stuck inside a level block, partially or otherwise, it'll need to be shifted out again, so that it is flush against the block. The untested technique I thought up during bio break is as follows: If an actor's box is found to intersect a level box, determine where the centerpoints of each rect are. If the actor's center is higher than the level box's, move the actor so that the bottom of the actor's rect is flush with the top of the level's rect, and vice versa if it's lower. Then do a similar thing horizontally. Opinions on that? Suggestions on better methods? Actually, the bounding rects are XNA BoundingBlocks with their Z spanning from -1 to 1, but it's still 2D gameplay.

  Read the article

• Enumerating all hamiltonian paths from start to end vertex in grid graph

  - by Eric

  Hello, I'm trying to count the number of Hamiltonian paths from a specified start vertex that end at another specified vertex in a grid graph. Right now I have a solution that uses backtracking recursion but is incredibly slow in practice (e.g. O(n!) / 3 hours for 7x7). I've tried a couple of speedup techniques such as maintaining a list of reachable nodes, making sure the end node is still reachable, and checking for isolated nodes, but all of these slowed my solution down. I know that the problem is NP-complete, but it seems like some reasonable speedups should be achievable in the grid structure. Since I'm trying to count all the paths, I'm sure that the search must be exhaustive, but I'm having trouble figuring out how to prune out paths that aren't promising. Does anyone have some suggestions for speeding the search up? Or an alternate search algorithm?

  Read the article

• How to hash and check for equality of objects with circular references

  - by mfya

  I have a cyclic graph-like structure that is represented by Node objects. A Node is either a scalar value (leaf) or a list of n=1 Nodes (inner node). Because of the possible circular references, I cannot simply use a recursive HashCode() function, that combines the HashCode() of all child nodes: It would end up in an infinite recursion. While the HashCode() part seems at least to be doable by flagging and ignoring already visited nodes, I'm having some troubles to think of a working and efficient algorithm for Equals(). To my surprise I did not find any useful information about this, but I'm sure many smart people have thought about good ways to solve these problems...right? Example (python): A = [ 1, 2, None ]; A[2] = A B = [ 1, 2, None ]; B[2] = B A is equal to B, because it represents exactly the same graph. BTW. This question is not targeted to any specific language, but implementing hashCode() and equals() for the described Node object in Java would be a good practical example.

  Read the article

• Select records from XML column (SQL Server 2005) based on node order

  - by jdoe

  I have a column in a SQL Server 2005 table defined as an XML column. Is there a way to select records from this table based on the order of two nodes in that column? For example, we have the following structure in our XML: <item> <latitude/> <longitude/> </item> I want to see if there are any records that have latitude/longitude in the opposite order i.e. <longitude/> then <latitude/>. I've tried some XPath expressions but with no luck.

  Read the article

• Import C + Makefile into a linux IDE?

  - by Jessica

  I have a project for Linux that i've been developing for some time. Basically it's a bunch of C and H files together with a directory structure and a Makefile. Every time I need to debug something it's so painful, I need to manually search for var. definitions, structs, etc. Is there any good IDE out there for Linux that will allow me to import those files into a "project" and that will provide code completion or at least an easy way to get my bearings in the source code? thanks!

  Read the article

• How can I add a header folder to my project?

  - by VansFannel

  I'm developing an iOS application with latest Xcode 4.5.2. I have the following folder structure: /.../SourceCode/MyProjectFolder/projectName.xcodeproject /.../SourceCode/MyProjectFolder/projectName/ /.../SourceCode/MyProjectFolder/projectName/xxx.m /.../SourceCode/MyProjectFolder/projectName/xxx.h /.../SourceCode/MyProjectFolder/projectName/PVRT/ /.../SourceCode/MyProjectFolder/projectName/PVRT/header1.h /.../SourceCode/MyProjectFolder/projectName/PVRT/OtherFolder/header2.h If in my header files I add this: #include "header1.h" I get a "header1.h" not found error. But, if I add: #include "PVRT/header1.h" I get a "header2.h" not found. On project settings I have add the following path: ${SOURCE_ROOT}/projectName/PVRT But I'm getting the same error. How can I fix this?

  Read the article

• Finding mySQL duplicates, then merging data

  - by Michael Pasqualone

  I have a mySQL database with a tad under 2 million rows. The database is non-interactive, so efficiency isn't key. The (simplified) structure I have is: `id` int(11) NOT NULL auto_increment `category` varchar(64) NOT NULL `productListing` varchar(256) NOT NULL Now the problem I would like to solve is, I want to find duplicates on productListing field, merge the data on the category field into a single result - deleting the duplicates. So given the following data: +----+-----------+---------------------------+ | id | category | productListing | +----+-----------+---------------------------+ | 1 | Category1 | productGroup1 | | 2 | Category2 | productGroup1 | | 3 | Category3 | anotherGroup9 | +----+-----------+---------------------------+ What I want to end up is with: +----+----------------------+---------------------------+ | id | category | productListing | +----+----------------------+---------------------------+ | 1 | Category1,Category2 | productGroup1 | | 3 | Category3 | anotherGroup9 | +----+----------------------+---------------------------+ What's the most efficient way to do this either in pure mySQL query or php?

  Read the article

• Flexible Data source for Multi-Section Table View Controller

  - by TuanCM

  I have a TableViewController which display a list of NewsItem objects: @interface NewsItem : NSObject { NSString *feedID; NSString *title; NSDate *published; } I'm trying to implement a Table View Controller (multiple sections) that can display the list in two ways: One divide News Items into sections which based on Published Date The other would be based on FeedID (News source). And I don't know how to structure the data source so that the code is easy to maintain. I tried to put the list of News Items into a 2 dimension Array in this case is a NSMutableArray of NSArray objects. However I got some objc_exception_throw and I don't think this is flexible enough. Could you guys give me some ideas?

  Read the article

• Reverse Engineer a web page

  - by Phil

  Hi, I wish to reverse engineer any web-page into a logical representation of the page. For example, if a web page has a menu, then I want a logical menu structure perhaps in XML. If the webpage has an article, I want a article XML node, if it has a title for the article I want a title XML node. Basically, I want the logical form of the web-page without any of the user interface. This logical model could either be objects in code or XML it doesn't matter, the important part is that it has identified what everything on the page means.

  Read the article

• get the installed path of a vb.net application

  - by Matt Facer

  Hi guys... I'm nearly ready to distribute my vb.net application. I have several picturebox files which are loaded currently from c:/temp I need to change this directory to one that will be OK to use when the user installs it to their PC. My question is how can I do this? Is there a way to get the installation path, then use that within the code as a variable? eg: myInstalledPath & "/xxx.jpg" Or... would it be better for me to use mypictures within the mydocuments structure? I'd rather keep all the image files created in a folder which is more hidden from the user (by hidden I mean not cluttering up their own image folders!) I've tried searching for this, but I seem to get varying results with no real answers... (possibly searching for the wrong thing!)

  Read the article

• jquery toggle+paginate+multiple instances

  - by mark

  Hi, I'm a jquery newbie - wanted to ask what might be the best strategy for achieving what I am after as I think it uses a mix of jquery functions : If list of items exceeds 5 items a 'more' link appears which when toggled will reveal the rest of the items. If items list is 5 or less no 'more' link is shown. Hide button also at bottom of long full revealed list. (perhaps this is toggle+pagination?) And then also that this can be used in multiple instances, as it is for multiple category menu's.(to be used in typical indexhibit websites structure like http://mikeyburton.com/) link 1 link 2 link 3 link 4 link 5 link 6 link 7 link 8 more Any help or links greatly appreciated.

  Read the article

• How to use SOCI C++ Database library?

  - by NeDark

  I'm trying to implement soci in my program but I don't know how. I'm using C++ on linux, on a project on netbeans. I have followed the steps in http://soci.sourceforge.net/doc/structure.html to install it, and I tried to copy the files soci.h from /src/core and soci-mysql.h from /src/backends/mysql in my proyect but it gives compilation error (these files include other soci files, but it's illogical to copy all files into the directory...). I have read the guide several time but I don't understand what I'm doing wrong, the examples only include these files. Thanks. Edit: I have given more information in a comment below the answer. I don't know what steps I have to do to implement soci.

  Read the article

• CakePHP hasOne ineffeciency?

  - by Andre

  I was looking at examples on the CakePHP website, in particular hasOne used in linking models. http://book.cakephp.org/view/78/Associations-Linking-Models-Together My question is this, is CakePHP using two queries to build the array structure of data returned in a model that uses hasOne linkage? Taken from CakePHP: //Sample results from a $this-User-find() call. Array ( [User] => Array ( [id] => 121 [name] => Gwoo the Kungwoo [created] => 2007-05-01 10:31:01 ) [Profile] => Array ( [id] => 12 [user_id] => 121 [skill] => Baking Cakes [created] => 2007-05-01 10:31:01 ) ) Hope this all makes sense.

  Read the article

• Regular Expression issue

  - by Christian Sciberras

  I have the following URL structure which I need to match to and get the particular id from: /group/subgroup/id-name In short, I need to translate a URL like the following: /Blue Products/Dark Blue/5-Blue_Jelly To: /?pagename=Blue Products&model=5 IMPORTANT: I don't need to match group, I already have group. Example code: <?php foreach($cats as $cat) $cmd->rewrite('/\/'.$cat.'\/unused\/(ID)-unused\//','/?pagename='.$cat.'&model=%ID%'); ?> Edit: This is the completed code: if($groups->count()){ $names=array(); foreach($groups->rows as $row) $names[]=preg_quote($row->group); $names=implode('|',$names); $regex='('.$names.')/([^/]+)/([0-9]{1,})-([^/]+)/?$'; CmsHost::cms()->rewrite_url($regex,'index.php?pagename=Products',true); }

  Read the article

• Many Associations Leading to Slow Query

  - by Joey Cadle

  I currently have a database that has a lot of many to many associations. I have services which have many variations which have many staff who can perform the variation who then have details on themselves like name, role, etc... At 10 services with 3 variations each and up to 4 out of 20 staff attached to each service even doing something as getting all variations and the staff associated with them takes 4s. Is there a way I can reduce these queries that take a while to process? I've cut down the queries by doing eager loading in my DBM to reduce the problems that arise from 1+N issues, but still 4s is a long query for just a testing stage. Is there a structure out there that would help make such nested many to many associations much quicker to select? Maybe combining everything past the service level into a single table with a 'TYPE' column ?? I'm just not knowledgable enough to know the solution that turns this 4s query into a 300MS query... Any suggestions would be helpful.

  Read the article

• How can you setup multiple WSGI apps on one server?

  - by Shakakai

  I'm working on a python based server product where a user can install WSGI-based python apps on their server. I can enforce any restriction on the application structure or format to make this easy. The user workflow would be: browse an app market, showing a list of WSGIpython apps select an app and choose "install" the app would be downloaded from a remote server to the user's server the http server would then have to be configured to start serving that application from the app's id, ex. a blog app with an id of "blog" at "/blog/", so all requests below /blog/ would be seen as root by the blog application. Any suggestions on how to set something like this up? Holler if my flow of consciousness lost you ;)

  Read the article

• How can I use Linq to create an array of dictionaries from XML?

  - by Duke

  Given the following XML structure: <courses> <course> <title>foo</title> <description>bar</description> </course> ... </courses> How could I create an array of dictionaries such that each dictionary contains all the element/value pairs within a course? What I have right now generates an array whose elements contain a single key/value dictionary for each element/value pair in a course: XElement x = XElement.Parse("...xml string..."); var foo = (from n in x.Elements() select n) .Elements().ToDictionary(y => y.Name, y => y.Value); Produces: [0] => {[course, foo]} [1] => {[description, bar]} What I'd like is this: [0] => {[course, foo], [description, bar]}

  Read the article

• Why we used double pointer in objective-C or C language?

  - by Rajendra Bhole

  Hi, I confused when i want to take single pointer and when should i take double pointer? In following structure what exactly did? struct objc_class { Class isa; Class super_class; const char *name; long version; long info; long instance_size; struct objc_ivar_list *ivars; struct objc_method_list **methodLists; struct objc_cache *cache; struct objc_protocol_list *protocols; }; Why we use the "**methodLists" double pointer?

  Read the article

• Looping differences in Ruby using Range vs. Times

  - by jbjuly

  I'm trying to solve a Project Euler problem using Ruby, I used 4 different looping methods, the for-loop, times, range and upto method, however the for-loop and times method only produces the expected answer, while the range and upto method does not. I'm assuming that they are somewhat the same, but I found out it's not. Can someone please explain the differences between these methods? Here's the looping structure I used # for-loop method for n in 0..1 puts n end 0 1 => 0..1 # times method 2.times do |n| puts n end 0 1 => 2 # range method (0..1).each do |n| puts n end 0 1 => 0..1 # upto method 0.upto(1) do |n| puts n end 0 1 => 0

  Read the article

• Write to a binary file?

  - by rick irby

  Here is data structure w/ variables: struct Part_record { char id_no[3]; int qoh; string desc; double price: }; --- (Using "cin" to input data) --- Part_record null_part = {" ", 0," ",0.0}; --- --- file.seekg( -(long)sizeof(Part_record), ios::cur); file.write( ( char *)&part, sizeof(Part_record) ); The three variables, qoh, Id_no & price, write out correctly, but the "desc" variable is not right. Do I need to initialize Part_record some other way? It should be 20 characters in length. If you have enough info here, pls share your advice,thanks.

  Read the article

• svnant: How to checkout specified URLs from a repository?

  - by Mike

  Hi all: i'm using SVNant to checkout a repository, the total repository content is so large and i'm only interest in a few file and directories, the repository structure as below: project folder1 folder2 largefolder largefile1 largefile2 folder3 fileilike1.txt fileilike2.txt file.txt file2.txt etc... i'm only interest in the files under project/ folder such as file.txt and file2.txt, and also all files under folder3. i do not want to checkout largefolder/ because it has extra-large files in it. how to write the svnant script? i use ignore but seems not work.

  Read the article

• d3 tree - parents having same children

  - by Larry Anderson

  I've been transitioning my code from JIT to D3, and working with the tree layout. I've replicated http://mbostock.github.com/d3/talk/20111018/tree.html with my tree data, but I wanted to do a little more. In my case I will need to create child nodes that merge back to form a parent at a lower level, which I realize is more of a directed graph structure, but would like the tree to accomodate (i.e. notice that common id's between child nodes should merge). So basically a tree that divides like normal on the way from parents to children, but then also has the ability to bring those children nodes together to be parents (sort of an incestual relationship or something :)). Asks something similar - How to layout a non-tree hierarchy with D3 It sounds like I might be able to use hierarchical edge bundling in conjunction with the tree hierarchy layout, but I haven't seen that done. I might be a little off with that though.

  Read the article

< Previous Page | 772 773 774 775 776 777 778 779 780 781 782 783  | Next Page >