my current parsing technique cycles through my xml doc and turns the doc into a string for output to a dynamic text field. The problem is.. it displays all the parent nodes down in order, then it displays all the children nodes of the first parent.. then second, and so on. When I format it and output it I end up with
[Code]...
How do I parse an XML document that contains nodes where underscores exist?
<some_xml>
<child_node>
<child width_info="" height_info="" />
[code]....
I am now using the code for my background image which will rotate when you enter a new gallery.I can't get it to randomize.[code]I have tried adding: Math.floor(Math.random() * total); and it almost works. It seems everytime the last node is called it stops working (also at other random times, haven't found a pattern).
View 1 RepliesHere is the problem:
var p:int = 0;
var n:Number = 0;
n = 32.999999999999999;
p = Math.floor(n);
trace(p); // returns 33
n = 32.11111111111111;
p = Math.floor(n);
trace(p); // returns 32
I would expect both of these to return 32. I have searched, and it seems this is an unreported bug in AS3. Or ... am I doing something wrong?
Wat is the diffrence between these two?
View 2 RepliesI develop a piece of code that brings me to an xml, all Nodes i use this code:
for(var i=0; i< menu_xml.childNodes.length; i++){
corrent_node = menu_xml.childNodes[i].length;corrent_item.action = corrent_node.attributes.action;corrent_item.variables = corrent_node.attributes.variables;corrent_item.name.text = corrent_node.attributes.name;
[code]....
What I need is for each of the nodes highlighted in green to return the child Nodes. Example: when I move the mouse over the menu Indoor lighting, the results should be: Indoorlighting | LED 10W> 3W LED> LED 6W
For those unfamiliar with tree structures, tree structures are usually dynamic lists where every node has a pointer to two other nodes. They are arranged so it makes for faster searching and stuff and are very useful in programming languages that offer direct access to heap memory. Although I don't know if there would be benefits of making tree structures in AS would be of any help but I decided to have a go at it anyway. Since there are no pointers in flash I tried to just replace pointers to nodes with nodes themselves. Such things usually work in java I think because the language just automatically makes pointers for variables.
[Code]...
I have a code in which I have to use Math.round if a certain value is for example 3.67 (67 is higher than 50) and Math.ceil if a value is for example 3.23 (23 is lower than 50). What can I do to make flash calculate if what after the dot �.� in 3.23 (for example) is higher than 50?
View 2 RepliesSo here is a piece of code that I have seen used a lot but don't really quite understand:
myVar = Math.min(Math.max(myVar, this.min), this.max);
or some variation thereof. I understand that the function first finds the maximum value of two values then turns around and uses that to find the minimum between two values.why this is done? And how do you know when to use it?
So here is a piece of code that I have seen used a lot but don't really quite understand:[code]or some variation thereof. I understand that the function first finds the maximum value of two values then turns around and uses that to find the minimum between two values.And how do you know when to use it?
View 3 RepliesI think I have the recursion working properly, but I'm not able to get the originally requested item's property set to the right value.The goal here is to find the topmost parent (or "ancestor," depth = 0) of the nested item (a taxonomy based on Dictionary "parent" attributes), and assign that originally requested nested item's "ancestor" property accordingly.For instance, in
Apples
- Red
- - Empire
- - - Fresh
"Fresh"'s ancestor should be set to "Apples." While I'm attempting this on an "on-demand" and individual basis, I'm open to a solution that tags all children that are related to the same ancestor in one fell swoop or for statement, since that would probably be more efficient.
REQUEST
for (var mc:Object in taxonomy) {
var term = taxonomy[mc];[code]....
As you can see, while the recursion does find the root, the originally requested item still gets the default value.
ActionScript Code:
<root>
<node>
[Code].....
create Multidimensional Array from Recursive XML.
All I need create Array inside an Array dynamically from an unknown XML tree.
im having a problem reading a xml tree in Flash MX...[code]and this Actionscript to just to view the tree.[code]meaning that when it calls itself again, that it will stop searching the next items on the same level from where it was called.how do i not let it stop searching and complete the tree.
View 4 RepliesHow do I determine the end of a recursive loop - when going through an xml document of unknown size?
View 7 RepliesI am making a SUDOKU generator(ActionScript2.0), which would (for now) generate the full and correct sudoku table. To do that I need to use recursive functions for calculating all the possible values. The problem is that when I try to run my program I get this error :
Code:
256 levels of recursion were exceeded in one action list.
This is probably an infinite loop.
Further execution of actions has been disabled in this movie.Is it possible to somehow work around this limitation?
I'm trying to create a minesweeper game as exercise, but I stumbled upon a problem.I've cleaned the code for you so only the relevant code is here:
Code:
function expand(cell) {
getbounds(bounds,cell.row,cell.col);
[code].....
I've been studying the experiments on Levitated a lot. I've been looking over this one that deals with recursive functions. Here is the link:The actually get most of it. There is one part with an array though that pushes something and I don't understand it. Here's the code:
Code:
function addFillRequest(x0, y0, x1, y1, d) {
// que up a request to fill a region
[code].....
So, I create standard AS3 flex project. In constructor goes only start();
rest of functions are basically this:
private start():void { f1();}
private function f1():void { f2();}
private function f2():void { f1();}
And it's standard recursion. SWF either breaks or loops as many times as I tell it. One f calls the other, which calls first... I do not want that.
I want f1 to do some stuff, calls f1 and closes itself. Than f2 works, calls f1 and closes. And so on.
Like having 2 sets of code that loops through.
What's the cleanest way to do that?
I want to vreate a recursive function that will search through my xml tree and display all the leaves(node values); this is the function that I wrote:
function searchXML (theItem) {
trace("theItem.*.length() "+theItem.length());
trace("theItem.* "+theItem);
trace("--------------------------------------");
if (theItem.*.length() > 0) {
searchXML(theItem.*);
[Code] .....
I create standard AS3 flex project. In constructor goes only start();
rest of functions are basically this:
private start():void { f1();}
private function f1():void { f2();}
private function f2():void { f1();}
And it's standard recursion. SWF either breaks or loops as many times as I tell it. One f calls the other, which calls first... I do not want that. I want f1 to do some stuff, calls f1 and closes itself. Than f2 works, calls f1 and closes. And so on. Like having 2 sets of code that loops through.
I have this function to find occurences of misstyped varaible names (with wrong lower / upper case). I have a movieclip called "debug" where I define and call this funciton ("getCase(_level0)"). But It never finds my testttt variable - If I put the test varaible in _level0 the variable is found.
var targetsCase_ary:Object = new Object();
var targetsLower_ary:Object = new Object(); testttt = 1 testttT = 1 function getCase(clip:MovieClip, recu:Number){ if (recu==undefined) recu = 1; var n:String; for (n in clip){ var sPath:String = clip._target + "." + n; var sPathLower:String = sPath.toLowerCase (); //trace(sPathLower + " " +
[code]....
I have a menu of 4 buttons and I'm trying to not be redundant and recursively use the same over, out, clicked function for each button by passing it's instance through the event handler.
I haven't had a whole lot of success finding the answer except locating a thread about creating custom classes....Which would be great, but I don't want to re-create my entire structure now. So I was wondering what the best approach might be.
Here's the code I've been working on.
[Code].....
I have various custom component instances in my flex app. I want to loop through them recursively and get their instance Ids. The recursive part is very important to me. I have tried doing this, but it didn't do recursive:
for each (var myItem:* in this.MasterContainer.childDescriptors)
{
trace(myItem.id);
}
I have a difficult problem with a recursive function. Essentially I need to 'slow down' a for loop within a function that repeatedly calls itself (the function); Is this possible, or do I need to somehow extract the recursive nature of the function?
function callRecursiveFuncAgain(ob:Object):void{
//do recursive stuff;
for (var i:int = 0; i < 4; i++) {
_nextObj=foo
callRecursiveFuncAgain(_nextObj);
}}
Is it possible to use pause/resume function to this??
source.copyTo( destination );
It would be great if you can send it at the earliest.
While recursive scans are commonly use to scan through nested objects / data. It can go on an infinite loop, if some of the objects references one another. So what is the most effective way to scan all items, without crashing the computer, nor skipping a specified parameter?
Here is an example of a recursive scanner...
/**
* Triggers the scan function for each object given
**/
function recursiveScanner( object:* , scanFunction:Function ):void {
[Code].....
The objects will trigger scans for one another in an eternal loop.
I do believe in C/C++ : Each scanFunction call, will be added into a list consisting of scanned 'memory address', thus preventing a repeat. Is this even possible in AS3? Is there a more elegent way?
I have a Flex component that is a view of a data Object that recursively has a reference to itself.
For example if you had an Employee class that references a boss field of type Person, I'd like to nest the same view for that Boss. This shouldn't be an infinite recursive relationship (e.g. I'd only be viewing the boss field of each object).
I've tried creating an MXML component that references itself but when I run it locks up (seems like it gets into a recursive loop).
Is there anything you can do like includeInLayout conditions that will make sure it doesn't even instantiate that component.
I made an app (Towers of Hanoi) and i added a "demo" button that solves the problem based on a recursive function. The button is supposed to make a move one step at the time, i mean one step at every few seconds so you can actually see how the algorithm works. The problem is i haven't really used the timer event before and i have no idea how to implement it in this particular scenario.
Code:
function hanoiPlay(n:int,a:Stack,c:Stack,b:Stack):void
{
[code]......
I've been trying to implement a QuadTree to store a two-dimensional array representing a terrain. I generate the array first, then I use the below function to generate a QuadTree for the array.
[Code]....
I'm working on a grid based game where a user selects a tile and all the tiles with the same colour that are beside it disappear. Up until now I've been using this very rudimentary method to find the neighbouring tiles with the same colour (see below) but now that the game has gotten more complex and larger grids are involved performance is starting to lag so I optimizing the code. have a Tile class like this:
Code:
package {
public class Tile {
[code]....