traversal | 易学教程

Converting JavaScript 'this' to jQuery '$(this)'

阅读更多关于 Converting JavaScript 'this' to jQuery '$(this)'

Please have a look at the following code: <HTML> <HEAD> <script src="//ajax.googleapis.com/ajax/libs/jquery/1.7.1/jquery.min.js" type="text/javascript"></script> <SCRIPT type="text/javascript"> function test(target) { alert(target.nodeName); } </SCRIPT> </HEAD> <BODY> <DIV> <ul> <li onclick="test(this)">This is fair</li> <li onclick="test(this)">No its not</li> <li onclick="test(this)">Why not</li> <li onclick="test(this)">Becoz...</li> </ul> </DIV> </BODY> </HTML> The function test receives target (li node) as an argument. Now, can I somehow convert this variable to jQuery $(this) or $(e

Traverse FILE line by line using fscanf

阅读更多关于 Traverse FILE line by line using fscanf

问题 Ok so i have a text file database.txt. Each line is a user with the format below "John Smith"| 4| 80.00| "123 Lollipop Lane"| "New Jersey"| "08080" When I try do the following: database = fopen(fileName,"r"); while(fscanf(database,"%[^\n]", buffer) != EOF){ printf("ATTEMPT TO: Insert user %s\n\n", buffer); if (insert_Customer(clients, create_Customer(buffer)) < 0){ printf("\nERROR: Failed to insert and create customer %s\n", buffer); } else printf("\nSUCCESS: Inserted Customer %s\n\n", buffer

Can someone explain the traverse function in Haskell?

阅读更多关于 Can someone explain the traverse function in Haskell?

问题 I am trying and failing to grok the traverse function from Data.Traversable . I am unable to see its point. Since I come from an imperative background, can someone please explain it to me in terms of an imperative loop? Pseudo-code would be much appreciated. Thanks. 回答1: traverse is the same as fmap , except that it also allows you to run effects while you're rebuilding the data structure. Take a look at the example from the Data.Traversable documentation. data Tree a = Empty | Leaf a | Node

Traverse the DOM tree

阅读更多关于 Traverse the DOM tree

As most (all?) PHP libraries that do HTML sanitization such as HTML Purifier are heavily dependant on regex, I thought trying to write a HTML sanitizer that uses the DOMDocument and related classes would be a worthwhile experiment. While I'm at a very early stage with this, the project so far shows some promise. My idea revolves around a class that uses the DOMDocument to traverse all nodes in the supplied markup, compare them to a white list, and remove anything not on the white list. (first implementation is very basic, only removing nodes based on their type but I hope to get more

get the next element with a specific class after a specific element

阅读更多关于 get the next element with a specific class after a specific element

问题 I have a HTML markup like this: <p> <label>Arrive</label> <input id="from-date1" class="from-date calender" type="text" /> </p> <p> <label>Depart</label> <input id="to-date1" class="to-date calender" type="text" /> </p> <p> <label>Arrive</label> <input id="from-date2" class="from-date calender" type="text" /> </p> <p> <label>Depart</label> <input id="to-date2" class="to-date calender" type="text" /> </p> I want to get the next element after from dates to get the corresponding to date. (Layout

Check if an array is sorted, return true or false

阅读更多关于 Check if an array is sorted, return true or false

I am writing an easy program the just returns true if an array is sorted else false and I keep getting an exception in eclipse and I just can't figure out why. I was wondering if someone could take a look at my code and kind of explain why I'm getting an array out of bounds exception. public static boolean isSorted(int[] a) { int i; for(i = 0; i < a.length; i ++);{ if (a[i] < a[i+1]) { return true; } else { return false; } } } public static void main(String[] args) { int ar[] = {3,5,6,7}; System.out.println(isSorted(ar)); } Let's look at a cleaner version of the loop you constructed: for (i =

Efficiently Traverse Directory Tree with opendir(), readdir() and closedir()

阅读更多关于 Efficiently Traverse Directory Tree with opendir(), readdir() and closedir()

The C routines opendir(), readdir() and closedir() provide a way for me to traverse a directory structure. However, each dirent structure returned by readdir() does not seem to provide a useful way for me to obtain the set of pointers to DIR that I would need to recurse into the directory subdirectories. Of course, they give me the name of the files, so I could either append that name to the directory path and stat() and opendir() them, or I could change the current working directory of the process via chdir() and roll it back via chdir(".."). The problem with the first approach is that if the

Traverse Rectangular Matrix in Diagonal strips

阅读更多关于 Traverse Rectangular Matrix in Diagonal strips

问题 I need the same thing done here, but to work with any matrix, not just a square one. Also, the direction of traversal needs to be opposite. I tried to edit the code I found there, but couldn't figure it out. Thanks. 回答1: I remember writing that. I think for a rectangular matrix you'd need a few minor changes and one more line of incomprehensible nonsense: #include <stdio.h> int main() { int x[3][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}; int m = 3; int n = 4; for (int slice = 0; slice < m

How do I iterate over Binary Tree?

阅读更多关于 How do I iterate over Binary Tree?

Right now I have private static void iterateall(BinaryTree foo) { if(foo!= null){ System.out.println(foo.node); iterateall(foo.left); iterateall(foo.right); } } Can you change it to Iteration instead of a recursion? Can you change it to Iteration instead of a recursion? You can, using an explicit stack. Pseudocode: private static void iterateall(BinaryTree foo) { Stack<BinaryTree> nodes = new Stack<BinaryTree>(); nodes.push(foo); while (!nodes.isEmpty()) { BinaryTree node = nodes.pop(); if (node == null) continue; System.out.println(node.node); nodes.push(node.right); nodes.push(node.left); }

Traversing through all nodes of a binary tree in Java

阅读更多关于 Traversing through all nodes of a binary tree in Java

Let's say I have a simple binary tree node class, like so: public class BinaryTreeNode { public String identifier = ""; public BinaryTreeNode parent = null; public BinaryTreeNode left = null; public BinaryTreeNode right = null; public BinaryTreeNode(BinaryTreeNode parent, String identifier) { this.parent = parent; //passing null makes this the root node this.identifier = identifier; } public boolean IsRoot() { return parent == null; } } How would I add a method which is able to recursively traverse through any size tree, visiting each and every existing node from left to right, without