Search Results

Search found 27142 results on 1086 pages for 'control structure'.

Page 662/1086 | < Previous Page | 658 659 660 661 662 663 664 665 666 667 668 669  | Next Page >

• 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

• Wordpress page linking

  - by danixd

  I am trying to implement WordPress into quite a large site with a complex page structure and struggling to get normal pages to work (not created through the admin) The pages are created, but when I link to them, nothing happens... The desired url - www.website.com/dir1/dir2/dir3/page.php The actual url- www.website.com/wp-content/themes/themename/dir1/dir2/dir3/page.php The problem with linking to the latter is that it breaks the WordPress functions I don't want to have to give every page a template, then add it through the admin, it is too much work. I only need 2 pages to contain dynamic content. Am I being silly? I am really confused.

  Read the article

• Java Swing architecture for flipping through JPane based views

  - by imhotep

  Hi all, I have done a couple of simple swing based apps with static layout, but now I've run into a problem while trying to create an app containing multiple views which are changed by pressing appropriate navigational button. You could compare the idea to a website so that every view has buttons to access certain other views but this would work inside a single JFrame. I've found that maybe CardLayout (Cardlayout example) might be appropriate solution for this kind of structure, but I'm unable to figure out a way to switch the views from the buttons which are inside of the JPanes that I've implemented in their separate classes, Of course one way would be to instantiate everything in the parent class like in the small java tutorial example, but this isn't quite clean nor modular for multiple views, isn't it. How can this be implemented so that I can access the view switching method?

  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

• c++ Initializing a struct with an array as a member

  - by Drew Shafer

  I've got the following reduced testcase: typedef struct TestStruct { int length; int values[]; }; TestStruct t = {3, {0, 1, 2}}; This works with Visual C++, but doesn't compile with g++ under linux. Can anyone help me make this specific kind of initializer portable? Additional details: the actual structure I'm working with has several other int values, and the array can range in length from a single entry to over 1800 entries. Any help much appreciated. Thanks!

  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

• 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

• 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

• 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

• 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

• How do I resolve this scope issue in VB .NET?

  - by froadie

  I have a code structure something like this: For row = 1 To numRows Dim arrayIndex As Integer = 0 For column As Integer = bucketStartColumn To bucketEndColumn ' whatever code arrayIndex = arrayIndex + 1 Next Next Dim arrayIndex As Integer = 0 For column As Integer = bucketStartColumn To bucketEndColumn ' whatever code arrayIndex = arrayIndex + 1 Next Not exactly the code, so I don't really need suggestions about refactoring, but my problem is this - with this code I get a compiler error for the first Dim arrayIndex As Integer = 0 - "Variable 'arrayIndex' hides a variable in an enclosing block." As far as I can tell, arrayIndex is local to the first for loop and shouldn't exist by the time we reach the second loop. If I try to change the second declaration of arrayIndex to arrayIndex = 0, I get the error "Name 'arrayIndex' is not declared", as I expected. So is it visible, or not? Does this have something to do with the Dim keyword? Any suggestions of how to get around this, other than naming the second index variable something else?

  Read the article

• Get records based on child condition

  - by Shawn Mclean

  In LINQ To Entities: How do I get the records (including both child and parent) based on a condition of the child in a one to many. My structure is set up as follows: GetResources() - returns a list of Resources. GetResources().ResourceNames - this is the child, which is an entity collection. GetResources().ResourceNames - a property of one record of this child is Name. I'd like to construct something like this: return (from p in repository.GetResources() where p.ResourceNames.Exist(r => r.Name.Contains(text, StringComparison.CurrentCultureIgnoreCase)) select p).ToList(); but of course, Exist doesn't exist. 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

• Where to place log4j.xml

  - by Farid

  Hi , How can we specify were log4j has to look at when trying to find its xml configuration file ? It seems that by default, log4j looks into the root of a class folder, I can say that using the debug log4j functionality and running my application from the IDE. However, I don't have any class folder in my jar anymore. And the log4j.xml file is at the root of the jar. I have already tried to set the option -Dlog4j.configuration=log4j.xml but it doesn't work. Here is the global structure of my application at the moment : com lib meta-inf log4j.xml Thanks !

  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

• 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

• How To Collapse Just One Field in Django Admin?

  - by Apreche

  The django admin allows you to specify fieldsets. You properly structure a tuple that groups different fields together. You can also specify classes for certain groups of fields. One of those classes is collapse, which will hide the field under a collapsable area. This is good for hiding rarely used or advanced fields to keep the UI clean. However, I have a situation where I want to hide just one lonesome field on many different apps. This will be a lot of typing to create a full fieldset specification in every admin.py file just to put one field into the collapsed area. It also creates a difficult maintenance situation because I will have to edit the fieldset every time I edit the associated model. I can easily exclude the field entirely using the exclude option. I want something similar for collapse. Is this possible?

  Read the article

• Open page in Joomla

  - by dutt

  I'm using Jumi to echo php code and then showing that in a Joomla Article, and everythings working fine. Now I want to do this: The output is basically a list from a database like this: Name Price Type A 1 T1 B 2 T2 In this list I want to include links to only show items of the same type, so "T1" would like to a page only showing things of type T1. So I thought I would do this by making a new page that takes a type and then get all the items of that type from the database. Without Joomla this wouldv'e been a piece of cake, with Joomla I'm not quite sure where to begin. How should the a href=... tags in the html code printed by my php script look? Is my basic structure still correct, and if so, how do I make Joomla open the new page in the normal frame and not replace the whole Joomla page. some kind of target-frame attribute?

  Read the article

• Statically initialize anonymous union in C++

  - by wpfwannabe

  I am trying to statically initialize the following structure in Visual Studio 2010: struct Data { int x; union { char ch; const Data* data; }; }; The following is fails with error C2440: 'initializing' : cannot convert from 'Data *' to 'char'. static Data d1; static Data d = {1, &d1}; I have found references to some ways this can be initialized properly but none of them work in VS2010. Any ideas?

  Read the article

• CSS Selector Issue

  - by YsoL8

  Hello html body .home blog logged-in div #wrapper div #page div .cats I have a problem with selecting unordered lists (i.e ul li.class-name class-name-number) at the above dom location in CSS. I am working with a wordpress theme. Basically could I have suggestions for the correct selector to use in order to influence this tag? I can provide a simplified html structure if it will help. I've tried a number of selectors along the lines of: (sometimes)#page (# or .)cats (sometimes)ul li(sometimes with class name) EDIT: I've tried the selectors suggested in the wordpress docs. Thanks!

  Read the article

• What is Restful Routing?

  - by John Baker

  I have been searching pretty hard for info out on the net to explain exactly what Restful routing is but I haven't had any success. There are a lot of resources but not a who lot make sense to me. I'm familiar with Ruby On Rails's routing system and well as how Code Igniter and PhpCake route things but is there more to it than having a centralized location where you give out routes based on a directory structure? Like this: controller/action/id/ Admin/editUser/22 I'd appreciate any help with this, it's had me baffled for months. I just thought of putting it on SO. Thanks

  Read the article

• Python: How to run unittest.main() for all source files in a subdirectory?

  - by Pete

  I am developing a Python module with several source files, each with its own test class derived from unittest right in the source. Consider the directory structure: dirFoo\ test.py dirBar\ __init__.py Foo.py Bar.py To test either Foo.py or Bar.py, I would add this at the end of the Foo.py and Bar.py source files: if __name__ == "__main__": unittest.main() And run Python on either source, i.e. $ python Foo.py ........... ---------------------------------------------------------------------- Ran 11 tests in 2.314s OK Ideally, I would have "test.py" automagically search dirBar for any unittest derived classes and make one call to "unittest.main()". What's the best way to do this in practice? I tried using Python to call execfile for every *.py file in dirBar, which runs once for the first .py file found & exits the calling test.py, plus then I have to duplicate my code by adding unittest.main() in every source file--which violates DRY principles.

  Read the article

• How to implement B+ Tree for file systems ?

  - by user312544

  I have a text file which contains some info on extents about all the files in the file system, like below C:\Program Files\abcd.txt 12345 100 23456 200 C:\Program Files\bcde.txt 56789 50 26746 300 ... Now i have another binary which tries to find out about extents for all the files. Now currently i am using linear search to find extent info for the files in the above mentioned text file. This is a time consuming process. Is there a better way of coding this ? Like Implementing any good data structure like BTree. If B+ Tree is used what is the key, branch factor i need to use ?

  Read the article

• Best way to store application images taken via camera

  - by Dave

  Hi all, I'm just looking for some insight into what would be the best way for me to store images as part of my app. I have an activity that represents a 'Job' which has a couple of edittext's and underneath was planning on using the Gallery component to show images relevant to this job. The job data is stored in a database (on the sdcard) so was also thinking of creating a table to store 'JobImages' and having each image stored as a byte array. But I'm not sure if it would be better to store the images directly on sdcard under a folder structure specific to my application and the job. E.g. using the job ID number as a folder name. Depending on which method I use will greatly determine the code that goes into an 'adapter' that allows me to bind to the gallery component so before I begin I was wondering if anyone has had the same design problem and what option they chose. Thanks, Dave

  Read the article

• Config file format

  - by Felics

  Hello, does anyone knows a file format for configuration files easy to read by humans? I want to have something like tag = value where value may be: String Number(int or float) Boolean(true/false) Array(of String values, Number values, Boolean values) Another structure(it will be more clear what I mean in the fallowing example) Now I use something like this: IntTag=1 FloatTag=1.1 StringTag="a string" BoolTag=true ArrayTag1=[1 2 3] ArrayTag2=[1.1 2.1 3.1] ArrayTag3=["str1" "str2" "str3"] StructTag= { NestedTag1=1 NestedTag2="str1" } and so on. Parsing is easy but for large files I find it hard to read/edit in text editors. I don't like xml for the same reason, it's hard to read. INI does not support nesting and I want to be able to nest tags. I also don't want a complicated format because I will use limited kind of values as I mentioned above. Thanks for any help.

  Read the article

< Previous Page | 658 659 660 661 662 663 664 665 666 667 668 669  | Next Page >