Search Results

Search found 5102 results on 205 pages for 'tree rewriting'.

Page 119/205 | < Previous Page | 115 116 117 118 119 120 121 122 123 124 125 126  | Next Page >

• Hash Table v/s STL map in C++

  - by anon

  Hi, I am trying to learn C++ maps. Was just wondering about the implementation of STL map. I read it employs Binary search tree. Is there a implementation of hash table in STL? How exactly do STL map stores Key Value pairs?

  Read the article

• Working with Content Shell on windows 7

  - by JAre

  I can't run Content Shell on my system (Windows 7 x64): When i run --dump-render-tree with the stable release content_shell.exe crashes with message: [XXXX:XXXX:0522/XXXXXX:XXXXXXXXX:FATAL:content_main_runner.cc(735)] Check failed: base::i18n::InitializeICU() were X - some number. And i can't run dev build because it misses mojo_system.dll. Is there any way to fix it? Does it work on Linux or MacOS? If so i probably can run it in VM For the time being.

  Read the article

• Is size_t only in C++ standard or C standard as well?

  - by Crazy Chenz

  Is size_t only in C++ standard or C standard as well? I cannot find a C header in the "/usr/include" tree that defines size_t. If it is not in the C std, is GCC just doing some magic to make things work? Thanks, Chenz

  Read the article

• If I never ever use HashSet, should I still implement GetHashCode?

  - by Dimitri C.

  I never need to store objects in a hash table. The reason is twofold: coming up with a good hash function is difficult and error prone. an AVL tree is almost always fast enough, and it merely requires a strict order predicate, which is much easier to implement. The Equals() operation on the other hand is a very frequently used function. Therefore I wonder whether it is necessary to implement GetHashCode (which I never need) when implementing the Equals function (which I often need)?

  Read the article

• Drawing Directed Acyclic Graphs: Using DAG property to improve layout/edge routing?

  - by Robert Fraser

  Hi, Laying out the verticies in a DAG in a tree form (i.e. verticies with no in-edges on top, verticies dependent only on those on the next level, etc.) is rather simple. However, is there a simple algorithm to do this that minimizes edge crossing? (For some graphs, it may be impossible to completely eliminate edge crossing.) A picture says a thousand words, so is there an algorithm that would suggest: instead of:

  Read the article

• how reference copy is handled in Objective-C?

  - by Cathy

  Object graph [Instance A] tree / \ / \ / \ ↓ ↓ [Instance B] [Instance C] apple bug Question Instance A has to reference copies to Instance B and Instance C. If I retain or release Instance A, which has references to the other two instances, what happens to the various reference counts?

  Read the article

• C++ code parser/processor library

  - by uray

  is there any library that parse a source code of C++ to produce lets say, call graph, class inheritance tree, flow control, class member list or anything as a ready to use graph or structure in code (not in diagram image). to make it more clear, suppose to generate call graph image, there will be a process like this: ` C++ source -> parser -> intermediate structure -> renderer -> call graph image ^ | [i need this] `

  Read the article

• Are interval, segment, fenwick trees the same?

  - by Luiguis

  Today i listened a lecture about fenwick trees (binary indexed trees) and the teacher says than this tree is a generalization of interval and segment trees, but my implementations of this three data structures are different. Is this afirmation true? and Why?

  Read the article

• Using many mutex locks

  - by hanno

  I have a large tree structure on which several threads are working at the same time. Ideally, I would like to have an individual mutex lock for each cell. I looked at the definition of pthread_mutex_t in bits/pthreadtypes.h and it is fairly short, so the memory usage should not be an issue in my case. However, is there any performance penalty when using many (let's say a few thousand) different pthread_mutex_ts for only 8 threads?

  Read the article

• Create select based on routing, how?

  - by huug

  I am trying to implement navigation like in Tree Based Navigation but based on url's defined in routes.rb (named routes, resources, ...). Is it possible to retreive a collection of all routes defined in routes.rb? So I can use it in a select like this: <%= f.collection_select :url, Route.all, :url, :name %> Tnx!

  Read the article

• Mac-like jQuery File Browser?

  - by viatropos

  Is there a jQuery plugin that organizes the tree of files the way mac does, in columns? That would be a nice find. Like this:

  Read the article

• Powershell, find files only in subdirectories named OLD with a certain age

  - by PS1

  How can I get a nice list of files in a directory tree that contains multiple OLD Files, I d'like to see only files from directories named OLD that have a certain age.

  Read the article

• ExtJS: Add Single Click Action To A Node In A TreePanel

  - by FluidFoundation

  [revised] I'm creating a TreePanel in ExtJs that is loading its children from a JSON file. I'm having trouble adding a click action to the nodes. I'm not sure whether it's added in the script creating the tree, or if its added as a property in the JSON, and if so, what the syntax would be. Any help would be appreciated! Please provide an example if possible.

  Read the article

• Are there IDEs in which the code-completion widget is not a linear list?

  - by Uri

  Most mainstream IDEs use code-completion in the form of a linear list of suggestions (typically methods). Are there any IDEs (mainstream or not) or IDE plugins that use a non-linear widget, such as a tree? (e.g., pick category first, then the actual recommendation)? I'm working on an IDE feature and want to make sure I'm not reinventing the wheel or infringing some patent.

  Read the article

• How to get structed result using nested set in MySQL and PHP?

  - by user198729

  There is no limitation on the depth. How to get the structed branch or even entire tree? The definition is from here: http://dev.mysql.com/tech-resources/articles/hierarchical-data.html

  Read the article

• How to find out whether an image exists within a bundle?

  - by cannyboy

  I have an array of NSStrings: Flower Car Tree Cat Shoe Some of these strings have images associated with them; some don't. I can build an image name by appending .png to the name (e.g. Flower.png). How do I check whether that image actually exists within the bundle before I try to load it into the view?

  Read the article

• a design to avoid circular reference in this scenario

  - by BDotA

  Here is our dependency tree: BigApp - Child Apps - Libraries ALL of our components are HEAVILY using one of the Libraries as above ( LibA). But it has a ‘few’ public methods that require classes from ‘higher-level’ assemblies and we want to avoid CIRCULAR references. What do you propose as a good design for this?

  Read the article

• How to remove expand on label click on TextNode YUI Treeview ?

  - by quilovnic

  I want to expand the Node only on click on Icon not on the label. With yahoo ui 2.7 : selfCategoryTree.tree.subscribe("labelClick", function(node) { alert(node.data.customData.id + " label was clicked"); }); So I catch the labelClick , I show an alert, but the Node is expanded.

  Read the article

• What's the name of the storage paradigm that uses cubes subdivided into 8 smaller cubes ad infinitum?

  - by Eric

  If I have a cube divided into 8 smaller cubes, each of which may be subdivided into a further 8 cubes, ad infinitum, what is the name of my system? I know that it's a special case of a tree, where each brance contains exactly 8 other leaves/branches. I remember the name starting with "Oct", and there was a wikipedia article on it, but I honestly can't find it! Does anyone know what such a data structure is actually known as?

  Read the article

• Notepad++ replacement

  - by bah

  Hi, I've been using notepad++ for a while now, but i noticed it doesn't have code snippets (i found quicktext plugin, but it doesn't work anymore), so i'd like to switch editor and my requirements would be: Fast startup. Code snippets. Ability to use themes. File tree view (or plugin, which does that). What are you using? Thank you all for suggestions!

  Read the article

• PowerShell; Use Get-Member to Self Document Nested COM Object

  - by Zion

  Anyone know how to use Get-Member to Recursively dump to a text file The entire properties|methods tree of a COM object? (The Output formatting of Get-Object is fine) Instead of giving me only the top level as in this example; New-Object -com AutoItX3.Control | Get-Member I need it to recurse the entire object to return results. If This is not possible, how would I dump the methods/properties of a sub object?

  Read the article

• TreeMap - Search Time Complexity

  - by java_geek

  What is the time complexity of a get() and put() in a TreeMap? Is the implementation same as a Red-Black Tree?

  Read the article

• Easy way to convert a Doctrine_Collection of Model classes to an array of simple objects?

  - by Alex

  To clearly separate the Controller and View layers, I do not longer want to pass full objects to my views. Instead I want to pass only arrays and objects that contain the data but do not have any methods. Otherwise a view script would be able to delete Doctrine records or traverse in the object tree to data that was not intended for the view.

  Read the article

• Data Structures using C or C++?

  - by user362439

  What are the advantages of using C++ based Classes/Objects over using legacy C Structures for managing standard Data Structures like Linked List, Stack, Tree, Queue ..etc? Let me know if the question is not clear.

  Read the article

• Including some static html files?

  - by user246114

  Hi, Where can we place static html files in our war file? For example, a default project has this: war/projectname.html I'd like to just make a few static folders with static pages that are like: war/projectname.html war/signup/index.html war/about/index.html so that my users can just hit those static pages like: www.myproject.com/signup www.myproject.com/about where would I put folders like that in our project tree? I tried putting them under war/, just beside projectname.html (like above), but they don't seem to be available there, I just get a 404 error, Thanks

  Read the article

< Previous Page | 115 116 117 118 119 120 121 122 123 124 125 126  | Next Page >