Search Results

Search found 2725 results on 109 pages for 'nodes'.

Page 78/109 | < Previous Page | 74 75 76 77 78 79 80 81 82 83 84 85  | Next Page >

• Lucene neo4j sort with boolean fields

  - by Daniele

  I have indexed some documents (nodes of neo4j) with a boolean property which not always is present. Eg. Node1 label : "label A" Node2: label : "label A" (note, same label of node1) special : true The goal is to get Node2 higher than node 1 for query "label A". Here the code: Index<Node> fulltextLucene = graphDb.index().forNodes( "my-index" ); Sort sort = new Sort(new SortField[] {SortField.FIELD_SCORE, new SortField("special", SortField.????, true) }); IndexHits<Node> results = fulltextLucene.query( "label", new QueryContext( "label A").sort(sort)); How can I accomplish that? Thanks

  Read the article

• PHP DOMElement::getElementsByTagName - Anyway to get just the immediate matching children?

  - by rr

  Hi All, is there a way to retrieve only the immediate children found by a call to DOMElement::getElementsByTagName? For example, I have an XML document that has a category element. That category element has sub category elements (which have the same structure), like: <category> <id>1</id> <name>Top Level Category Name</name> <subCategory> <id>2</id> <name>Sub Category Name</name> </subCategory> ... </category> If I have a DOMElement representing the top level category, $topLevelCategoryElement->getElementsByTagName('id'); will return a list with the nodes for all 'id' elements, where I want just the one from the top level. Any way to do this outside of using XPath?

  Read the article

• How to get some xml that comes before and a little from after a DOM Node.

  - by startoftext

  I am using java and I am pretty open to using w3c DOM or DOM4J at this point. So lets say I have a Node like a text node that I have found something interesting in, like say an occurrence of a substring in the nodes text. If I want to get a string with a number characters preceding that node and a few characters after that node how may I do that? Basically I need to be able to display a snippet of the original xml around the occurrence of that string. The problem I have with getting the parent node for example and then calling asXML is that I no longer know the exact location of the substring in the text node. If I search again for that string value in the parents xml then I may find 2 occurrences or many more if the parent has other children that contain an occurrence of that string. Much appreciation if any one can answer this question.

  Read the article

• Linq to Entities, checking for specific foreign key id?

  - by AaronLS

  I am trying to get rows where the foreign key ParentID == 0, and this is what I am trying but I get a NotSupportedException because it can't translate the ArrayIndex [0]: IQueryable<ApplicationSectionNode> topLevelNodeQuery = from n in uacEntitiesContext.ApplicationSectionNodeSet where (int)n.Parent.EntityKey.EntityKeyValues[0].Value == 0 orderby n.Sequence select n; So I need to pull that ArrayIndex out of the query so that the runtime can successfully translate the query. I'm not sure how to do that though. How does one query a specific object via it's primary key or set of objects via foreign key? Edit: Note that there is not actually a row in the table with NodeId == 0, the 0 is a magic value(not my idea) to indicate top level nodes. So I can't do n.Parent.NodeId == 0

  Read the article

• Why isn't Hadoop implemented using MPI?

  - by artif

  Correct me if I'm wrong, but my understanding is that Hadoop does not use MPI for communication between different nodes. What are the technical reasons for this? I could hazard a few guesses, but I do not know enough of how MPI is implemented "under the hood" to know whether or not I'm right. Come to think of it, I'm not entirely familiar with Hadoop's internals either. I understand the framework at a conceptual level (map/combine/shuffle/reduce and how that works at a high level) but I don't know the nitty gritty implementation details. I've always assumed Hadoop was transmitting serialized data structures (perhaps GPBs) over a TCP connection, eg during the shuffle phase. Let me know if that's not true.

  Read the article

• Parsing Serialized JSON DataSet using Jquery

  - by Zachary Carter

  Hello all, and thanks for reading. I wrote a web service which is called through jsonp, and returns a .Net 3.5 DataSet which I then want to parse using jquery. It appears that the getJson() method is working fine as far as parsing the json goes. The following request - $.getJSON("http://localhost:80/ws.asmx/Example?format=json&callback=?", function(data) { alert(data.d); }); results in - {"Tables": [ { "Rows": [ { "CASE_TYP_CD": "M", "CASE_TYP_DESC": "MOVING VIOLATION", "AUTO_GENERATE": "Y", "CONFIDENTIAL_FLG": "N" }, { "CASE_TYP_CD": "T", "CASE_TYP_DESC": "TRUANCY/FAILURE TO ATTEND SCHOOL", "AUTO_GENERATE": "Y", "CONFIDENTIAL_FLG": "N" }, { "CASE_TYP_CD": "J", "CASE_TYP_DESC": "JUVENILE", "AUTO_GENERATE": "Y", "CONFIDENTIAL_FLG": "N" }... Well I'm kind of new at this whole json thing and I can't figure out how to gain access to the values held in the nodes. I was thinking it would be something like - $.each("CASE_TYP_CD", function() { //code goes here }); But that doesn't seem to be working. Could anyone help me out with this? Thanks in advance!

  Read the article

• Extending rst container to output extra div attributes

  - by Manwe

  I'm starting to use pelican with reStructuredText rst page format. I have custom javascript (jQuery) things that I'd like to control with div attributes like data-default-tpl="basename" with nested content. What to extend and what. I've looked at Directives and nodes, but I just can't wrap my head around how to do it. .. rstdiv:: class1 class2 :name: namessid :extra: thisIsMyextra .. rstdiv:: nested class3 :name: nestedid :extra: data-default-tpl="basename" some text .. container:: This is normal rst container :name: contid text From rst to html with pelican. <div id="nameisid" class="class1 class2" thisIsMyextra> <div id="nestedid" class="nested class3" data-default-tpl="basename"> some text </div> </div> <div id="contid" class="container This is normal rst container"> text </div>

  Read the article

• Why does dojo parsing time depend on css and images availability?

  - by Kniganapolke

  I have been profiling javascript on my page that uses dojo widgets. I don't use explicit parsing - the parser runs on page load. What I noticed is that if I clear browser cache before refreshing the page, dojo parsing takes much more time than if all the files are already cached. Note that we build all the required dojo modules into a layer (a single file), so we don't lazy-load any js files. I wonder if dojo parsing process depends on images and css resources, as far as I know it only instantiates widgets and injects dom nodes. Do you have any ideas why dojo parser runs longer (2-3 times longer in my case) when the cache is cleared?

  Read the article

• postgresql syntax while exists loop

  - by veilig

  I'm working at function from Joe Celkos book - Trees and Hierarchies in SQL for Smarties I'm trying to delete a subtree from an adjacency list but part my function is not working yet. WHILE EXISTS –– mark leaf nodes (SELECT * FROM OrgChart WHERE boss_emp_nbr = -99999 AND emp_nbr > -99999) LOOP –– get list of next level subordinates DELETE FROM WorkingTable; INSERT INTO WorkingTable SELECT emp_nbr FROM OrgChart WHERE boss_emp_nbr = -99999; –– mark next level of subordinates UPDATE OrgChart SET emp_nbr = -99999 WHERE boss_emp_nbr IN (SELECT emp_nbr FROM WorkingTable); END LOOP; my question: is the WHILE EXISTS correct for use w/ postgresql? I appear to be stumbling and getting caught in an infinite loop in this part. Perhaps there is a more correct syntax I am unaware of.

  Read the article

• How to select certain child node in TreeView, C#

  - by Caslav

  I am having a problem with selecting a certain child node. What I want to achieve: I you have this treeview for example (one parent with two child nodes): Parent -Child with a value 5 -Child with a value 2. I want to add these two values and assign them to Parent node: Parent result 7 -Child 5 -Child 2. Of course, a bigger treeview would have several parents and lots of children and they will all add up to one root node. How can I do this?? pls help. thx, Caslav

  Read the article

• Why is nodeName sometimes all-caps in javascript DOM?

  - by harpo

  So I have a DOM document that looks essentially like this <categories> <category id="1"/> <category id="2"/> </categories> This is how the document previews in Firebug, as I would expect. However, when I POST this to the server, I get <categories> <CATEGORY id="1"/> <CATEGORY id="2"/> </categories> Indeed, doc.documentElement.firstChild.nodeName returns "CATEGORY". The nodes are added using jQuery.append('<category/>'). Why are the child tags returned in all caps?

  Read the article

• JFrame the same shape as an Image / Program running in background

  - by Jan Weber

  My question is simple, the solution surely not. I am looking for a way to shape a JFrame the same as an Image it will be displaying. By shape I mean the shape of the pixels that have an alpha != 0. I've already found a working example using a GeneralPath object, but it created ~110000 "nodes" for an Image of about 500*400, so starting the JFrame took more than 2 minutes, which is definitely not the desired effect, the startup should be in under 2 seconds. Thanks for your time.

  Read the article

• Dynamically creating a treeview in HTML with indent lines in ASP.Net

  - by Ben

  Hi, im quite new to HTML, and am trying to create a proffessional looking TreeView. I can not use the in built treeview in ASP.Net as i need to point the target of the selection to another frame (I have tried, and this doesn't seem possible). My treeview is built up as follows: Folder1 ChildOne ChildTwo ChildThree Folder2 ChildOne ChildTwo ChildThree I have the collapsing of the folders working, but would like to know how to format this treeview so it has dotted lines down to the child nodes (as most treeviews tend to have). How would i go about this? Cheers.

  Read the article

• SelfReferenceProperty vs. ListProperty Google App Engine

  - by John

  Hi All, I am experimenting with the Google App Engine and have a question. For the sake of simplicity, let's say my app is modeling a computer network (a fairly large corporate network with 10,000 nodes). I am trying to model my Node class as follows: class Node(db.Model): name = db.StringProperty() neighbors = db.SelfReferenceProperty() Let's suppose, for a minute, that I cannot use a ListProperty(). Based on my experiments to date, I can assign only a single entity to 'neighbors' - and I cannot use the "virtual" collection (node_set) to access the list of Node neighbors. So... my questions are: Does SelfReferenceProperty limit you to a single entity that you can reference? If I instead use a ListProperty, I believe I am limited to 5,000 keys, which I need to exceed. Thoughts? Thanks, John

  Read the article

• How to convert a DOM node list to an array in Javascript?

  - by Guss

  I have a Javascript function that accepts a list of HTML nodes, but it expects a Javascript array (it runs some Array methods on that) and I want to feed it the output of Document.getElementsByTagName that returns a DOM node list. Initially I thought of using something simple like: Array.prototype.slice.call(list,0) And that works fine in all browsers, except of course Internet Explorer which returns the error "JScript object expected", as apparently the DOM node list returned by Document.getElement* methods is not a JScript object enough to be the target of a function call. Caveats: I don't mind writing Internet Explorer specific code, but I'm not allowed to use any Javascript libraries such as JQuery because I'm writing a widget to be embedded into 3rd party web site, and I cannot load external libraries that will create conflict for the clients. My last ditch effort is to iterate over the DOM node list and create an array myself, but is there a nicer way to do that?

  Read the article

• Code jumps out of a jar and runs? What is causing this?

  - by Mike

  I am trying to get a sample program working with JUNG, a graphing tool in Java. I downloaded and referenced all the .jar files in eclipse so my project hierarchy looks like this: In Test.java I have the following code: public class Test { static public void main() { System.out.print("Hello"); }} For some reason though when I try to run it as a Java Application by right clicking on Jung test in the project hierarchy I am presented with a bunch of classes. My Test.java isn't on the list so if I just leave it as ** and press ok it starts running a program that is dynamically adding nodes and vertexes to a graph. I can't seem to figure out what code its actually executing. I know java but stuff like this with the jar files seems to be getting lost on me. Any ideas? Thanks

  Read the article

• Convert XML to table in SQL Server 2005.

  - by Tamim Sadikali

  If I pass in an xml parameter to a stored proc which looks like this: <ClientKeys> <ck>3052</ck> <ck>3051</ck> <ck>3050</ck> <ck>3049</ck> ... </ClientKeys> ...and then convert the XML to a temp table like this: CREATE TABLE #ClientKeys ( ClientKey varchar(36) ) INSERT INTO #ClientKeys (ClientKey) SELECT ParamValues.ck.value('.','VARCHAR(36)') FROM @ClientKeys.nodes('/ClientKeys/ck') as ParamValues(ck) ...the temp tbl is populated and everything is good. However the time taken to populate said table is strictly proportionate to the number of 'ck' elements in the xml - which I wasn't expecting as there is no iterative step. And thus the time taken to populate the tbl soon becomes 'too long'. Is there a quicker way to achieve the above?

  Read the article

• Binary Tree operator overloading and recursion

  - by furious.snail

  I was wondering how to overload the == operator for a binary tree to compare if two trees have identical data at same nodes. So far this is what I have: bool TreeType::operator==(const TreeType& otherTree) const { if((root == NULL) && (otherTree.root == NULL)) return true; //two null trees are equal else if((root != NULL) && (otherTree.root != NULL)) { return((root-info == otherTree.root-info) && //this part doesn't actually do anything recursively... //(root-left == otherTree.root-left) && //(root-right == otherTree.root-right)) } else return false; //one tree is null the other is not } I have a similar function that takes two TreeNode pointers as parameters but I've been stuck on how to convert it to this function.

  Read the article

• Any tips of how to handle hierarchical trees in relational model?

  - by George

  Hello all. I have a tree structure that can be n-levels deep, without restriction. That means that each node can have another n nodes. What is the best way to retrieve a tree like that without issuing thousands of queries to the database? I looked at a few other models, like flat table model, Preorder Tree Traversal Algorithm, and so. Do you guys have any tips or suggestions of how to implement a efficient tree model? My objective in the real end is to have one or two queries that would spit the whole tree for me. With enough processing i can display the tree in dot net, but that would be in client machine, so, not much of a big deal. Thanks for the attention

  Read the article

• Graph diffing and versioning tool

  - by hashable

  I am working with a team that edits large DAGs represented as single files. Currently we are unable to work with multiple users concurrently modifying the DAG. Is there a tool (somewhat like the Eclipse SVN plugin) that can do do revision control on the file (manage timestamps/revision stamps) to identify incoming/outgoing/conflicting changes (Node/Link insertion/deletion/modification) and merge changes just like programmers do with source code files? The system should be able to do dependency management also. E.g. an incoming Link must not be accepted when one of the two Nodes is absent. That is, it should not "break" the existing DAG by allowing partial updates. If there is a framework to do this using generic "Node" and "Link" interfaces? Note: I am aware of Protege and its plugins. They currently do not satisfy my requirements.

  Read the article

• xml and external swf documents

  - by VideoDnd

  My XML scripts work fine in the local swf. If I load an external swf, can I still retreive XML data from the same way, or do I have to declare the root somewhere? It's a general question. I know that when animating external swf files, you have to set it up differently, if so I would like an example, and a pitcher of beer. It's St. Patrick's weekend. SAMPLE CODE ONLY XML <?xml version="1.0" encoding="utf-8"?> <SESSION> <COUNT TITLE="starting position">-77777</COUNT> </SESSION> loader swf 'nodes' //grab the data as a string myString = myXML.COUNT.text(); //grab the data as an int count = int(myXML.COUNT.text()); external swf 'variables' var myString:String = ""; var count:int = int(myString); trace(count);

  Read the article

• Multilingual in Drupal: Can't have a node and it's translations as frontpage. How to?

  - by takpar

  hi, i built a page in Persian. set it's path to front set drupal frontpage to /front everything is O.K. in mysite.com/fa i translate the page to en problem arises. now the path of Persian page changes to default node/33. now in language's frontpage drupal says Can't find the page. i tried to set path front to the translated english page. but it did not helped. i alse tried to assign path fa/front to my Persian page. nothing helped. translating brakes path in other nodes. how can i have these pages /front and /fa/front translated of each other as the same time?

  Read the article

• Replace a word in an XML file through StreamReader in XNA?

  - by kcoppock

  Okay, so this is sort of a hack...but it may have to be. I'm writing an app in XNA, which from my research into this problem apparently doesn't support XML version 1.1. I'm reading in the contents of an ePub document, and one of the newer books contains its content directory as a version 1.1 XML document. This causes my program to crash. However, the structure is the same as the rest, the only thing that should be keeping it from working is the hard-coded "1.0" in the XmlDocument class. Is it possible that I could read in the file from the stream, see if it contains: <?xml version="1.1" encoding="UTF-8" standalone="no"?> and simply replace it with "1.0"? Then I could pull it in as an XmlDocument. I'm not doing any writing to the file, or any complex structural reading, just looking for a few specific nodes, and pulling in the values, so I don't know what the ramifications of this would be.

  Read the article

• Three State Treeview Windows Forms

  - by alhambraeidos

  Hello everybody people, One of the frustrations with the standard TreeView is that you can't show a partial selection to indicate that some of the children are selected. A partial selection in a complex tree allows the user to easily determine where the selections are, even if the tree is not completely expanded. A similar idea is used in manu backup programs to allow the user to select the files to be backed up. Does anyone know of a way to make the checks in a treeview checkbox gray? I want to gray the check of a parent node when some (but not all) of its child nodes are checked. Kinda like what you see when you are selecting options to install during a software installation. I have seen several post, but is older (2000, 2007 year). I now, in 2010, the better answer possible is required. I use VS 2008 . Net 3.5 , Windows Forms Thanks in advanced, greetings

  Read the article

• Graph database for .NET

  - by Antonello

  I've been designing an application, based on .NET/Mono framework, which should make an heavy use of the shortest-path in a graph theories and I would like to use a native solution to traverse the nodes of the graph, instead of implementing surrogate solutions which would be hardly maintainable and would massively affect performances. I've found an application which would be perfect for my scope: neo4j. Unfortunately, this application is purely written in Java code and it's not portable to .NET, because of the massive differences between the two architectures. Is anyone out there knows if is it there any port of neo4j or a similar solution for .NET?

  Read the article

< Previous Page | 74 75 76 77 78 79 80 81 82 83 84 85  | Next Page >