L8V2L

You'll learn all about data structures when you start writing C++.

I can't wait when I reach that point.

Don't pay more than a hundred per year.

To get reliable service, I'mma need too. I'm considering of using wordpress.

Depends on usage and your skills.

A game site, and beginner.

What the title say. ;-)Note: please note, I will be re posting this down the line... Or maybe not, I can't make promise I don't know if I can keep.

There is nothing in your code telling Firefox to open the XML file with Excel. Your content-type is text/xml, which is a generic XML file. IE might have additional tie-ins with Excel where, for example, IE will look for information in the XML file to try and figure out if it should open it in another application. Firefox just treats it like a regular XML file. You can try setting the content type to "application/vnd.ms-excel", or try changing the extension to one of the ones listed here:http://technet.microsoft.com/en-us/library/cc179191(v=office.15).aspx

JSG --you freaken block or froze my thread again you...-- aim what I'm telling this guy wrong?!?!?!? Wouldn't this had been a better fit to post in the php!?!?!

Posting a question in a forum is my method of last resort. Before I post, I will pour over reference materials for days trying to find the answer to my question. If I don't have the reference I need, I will go out and find one. Armed with this, I will spend days of trial and error in trying to make my code do just what I want it to. If that doesn't work, I'll go out onto the internet and do some research. This may lead me to a forum question that is similar to mine. On some occasions, these give me an idea that I spend days working with to try to make it fit my needs. Asking a question on a forum is done only after days of wasted research and trial and error has not led to an answer. In other words, I am desperate and need to find an answer. Among the many important things I've learned in my life is 1) if you don't have anything good to say then don't say anything at all and 2) if you're not part of the solution, you're part of the problem. So when I place a question on a forum:

• [*]If you feel the need to make a joke about part of the question, you're not being part of the solution;[*]If you suggest that another programming language might hold the answer, you're not being helpful; and[*]If you suggest that I post my question somewhere else, you're being a part of the problem.

Over the years, I have probably asked a dozen questions on forums. Each time, I was desperately looking for a solution to my problem. What I got in every case was not part of the solution but part of the problem. This is the reason for the attitude. If you can't handle it, move onto another question and let someone who really wants to help and has a solution to my problem answer my question.

READ!!!: this is the XML section! This thread does not have a lot of moderator on it. There is a php section. Your problem sound like php. So go post this on php. I'm not telling you to go to another site. I'm helping! I'm telling you that your chances are greater copying and pasting this in the php section.

Data structures: linked listcircular bufferB-treestackhash table

Along with these too:This is a list of data structures. For a wider list of terms, see list of terms relating to algorithms and data structures. For a comparison of running time of subset of this list see comparison of data structures.Data typesEditPrimitive typesBoolean, true or falseCharacterFloating-point, single-precision real number valuesDouble, a wider floating-point sizeInteger, integral or fixed-precision valuesEnumerated type, a small set of uniquely named valuesComposite types(Sometimes also referred to as Plain old data structures.)ArrayRecord (also called tuple or struct)UnionTagged union (also called a variant, variant record, discriminated union, or disjoint union)Abstract data typesArrayContainerMap/Associative array/DictionaryMultimapListSetMultisetPriority queueQueueDequeStackStringTreeGraphSome properties of abstract data types:Structure Stable Unique Cells per NodeBag (multiset) no no 1Set no yes 1List yes no 1Map no yes 2"Stable" means that input order is retained.Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.Linear data structuresArraysArrayBidirectional mapBit arrayBit fieldBitboardBitmapCircular bufferControl tableImageDynamic arrayGap bufferHashed array treeHeightmapLookup tableMatrixParallel arraySorted arraySparse arraySparse matrixIliffe vectorVariable-length arrayListsDoubly linked listArray listLinked listSelf-organizing listSkip listUnrolled linked listVListXor linked listZipperDoubly connected edge listDifference listTreesEditTree (data structure)Binary treesAA treeAVL treeBinary search treeBinary treeCartesian treeOrder statistic treePagodaRandomized binary search treeRed-black treeRopeScapegoat treeSelf-balancing binary search treeSplay treeT-treeTango treeThreaded binary treeTop treeTreapWeight-balanced treeBinary data structureB-treesB-treeB+ treeB*-treeB sharp treeDancing tree2-3 tree2-3-4 treeQueapFusion treeBx-treeAListHeapsHeapBinary heapWeak heapBinomial heapFibonacci heapAF-heap2-3 heapSoft heapPairing heapLeftist heapTreapBeapSkew heapTernary heapD-ary heapBrodal queueTriesIn these data structures each tree node compares a bit slice of key values.TrieRadix treeSuffix treeSuffix arrayCompressed suffix arrayFM-indexGeneralised suffix treeB-trieJudy arrayX-fast trieY-fast trieCtrieMultiway treesTernary treeK-ary treeAndor tree(a,-treeLink/cut treeSPQR-treeSpaghetti stackDisjoint-set data structureFusion treeEnfiladeExponential treeFenwick treeVan Emde Boas treeRose treeSpace-partitioning treesThese are data structures used for space partitioning or binary space partitioning.Segment treeInterval treeRange treeBinKd-treeImplicit kd-treeMin/max kd-treeAdaptive k-d treeQuadtreeOctreeLinear octreeZ-orderUB-treeR-treeR+ treeR* treeHilbert R-treeX-treeMetric treeCover treeM-treeVP-treeBK-treeBounding interval hierarchyBSP treeRapidly exploring random treeApplication-specific treesAbstract syntax treeParse treeDecision treeAlternating decision treeMinimax treeExpectiminimax treeFinger treeExpression treeHashesEditBloom filterCount-Min sketchDistributed hash tableDouble HashingDynamic perfect hash tableHash array mapped trieHash listHash tableHash treeHash trieKoordePrefix hash treeRolling hashMinHashQuotient filterCtrieGraphsEditGraphAdjacency listAdjacency matrixGraph-structured stackScene graphBinary decision diagramZero-suppressed decision diagramAnd-inverter graphDirected graphDirected acyclic graphPropositional directed acyclic graphMultigraphHypergraphOtherEditLightmapWinged edgeDoubly connected edge listQuad-edgeRouting tableSymbol tableExternal linksEditConclusion:There is many ways to organize data. And I can see XML and JSON in... I would say all of them--concept wise--, in tree structure to csv.

Gzip/Gunzip, Deflate/Inflate, read over these two, but can't seem to find information on this one; DeflateRaw/InflateRaw. Anyone care to explain?

see #1

BUT WIZARDZ!!!

 

• [*]This is site for _web_ development[*]I (and the other moderators) don't have anything to do with creating the content

BUT YOU ARE WIZARDS!!!! You could add a tutorial to this forum.

Maybe his heart isn't true.

Huh?

I think he was asking Ingolme why _I'm_ so cruel...

Yes.

That's not Ingolme. This is what invisionzone.com redirects to:http://www.invisionpower.comHere's the forum:http://www.invisionpower.com/apps/board/It's a hosted service.

I know it's not, I'm asking Ingolme.

or look them up? We've already gone over this. If you don't understand something and need clarification on specific concepts, please go ahead. Otherwise, you're just asking everyone to do the job that you could just be doing yourself with Google.

:,1( why must he be so.... Or with wiki.

Or you could just look it up instead of being unsure. Objective-C was deigned by Apple. It's a pretty important distinction.

:,-( why must... Yes you're right.

what are you even on about? 1) W3Schools does not maintain the forums, invisionzone does2) It's there for a reason, as that is an advantage of using subdomains3) This forum is not your personal wish list in life. Please stop treating it as such

:,-( why must he be so cruel. Why Ingolme, why?

Take w3school of the URL and just call the site invisionzone.com

More so go and just try to imitate the functionality of it and not worry on the actual code.

There's no problem with experimenting with new things, in fact you should be doing that. If you want to design an application that uses 3 different types of databases, that's fine as long as it's a learning exercise. I wouldn't put something like that into production without knowing that you are using exactly the right tool in every situation. Many large sites do quite well by combining something like a traditional relational database with something like memcached or redis which is used to hold specific kinds of data (non-important data that needs to be available quickly). But the people designing those sites designed them with all of their experience in mind. You don't have experience yet, so it's fine if you want to play around with various things but when you go to create an actual site that people will use I would suggest sticking with a single kind of data store until you have more experience with what works well and what doesn't.

Yeah. BaseX also hold JSON data from what I read, but XML is more... Mature. I do plan on learn php and SQL, but since I'm so fond of these three --JS, XML, CSS--, I wish to develop my skills in these first. And move on to programming language like c, c++, and objective-c. But not c#, it's design by Microsoft. Objective-c or c++ I believe was design by apple. They say c# is close to syntax of java.

C++ in college, then JS, PHP, Java, various other ones along the way.

... Than you guys could make a c, c++, objective-c tutorial.

Data structures: linked listcircular bufferB-treestackhash table

... Hey davej... Do you mind explaining each one in your own words.... Just asking.

 

var arr = new Array(100);arr[arr.length] = "elem";arr[101]; //elem

FYI, arr[101] is undefined, arr[100] is "elem". On the second line, arr.length is 100, not 101.

Yes you're right:

Array(100);

explicit the length, not the number of index.

That's because, like everything else in Javascript, an array is an object. Javascript has no native array data type in the sense that a language like C does, it has array objects. Each array is an instance of an array object. Many Javascript engines contain optimizations to treat arrays like C-style arrays as long as all of the keys are numeric, but once you add string keys then it switches to treating it like any other object and you lose some of the internal speed optimizations. If you disagree that an array is an object, then explain why an array has a constructor. Even in C arrays are random access, it can determine the specific memory address of any item in the array by knowing the starting address of the data (the address of the array itself), the data type of each element (the size in memory per element), and the offset. That's also the reason why array indexes today are 0-based.

I never said arrays wasn't object.... For now own we call

{0:0,1:1,2:2}

associate array, or key/value pairs. I was refering to this as comparison.

Neither, it is direct random access. It does not iterate through the entire array to get a certain element, it accesses the element directly. I believe that in some browsers arrays and objects are implemented like a hash table, like davej mentioned.

Yes, I read the hash table link Ingolme post me... But don't really understand it... If I had to give a visual representation, I'll say it is like a map that give the location of the value... Like an associate array, or an index array.

When you start thinking that what computers do is somehow magic or supernatural, then you're completely lost. Computers are the most deterministic things on the planet. Computers have less randomness than a crystal forming. A computer can't even generate a truly random number.

No I don't. I just wasn't giving an answer, or no one truly understood what I was asking. And your right, computer are the less randomless things--not including bugs. But even with bugs, there is logic behind it--on this earth. Everything is program to predictable action.

XML and JSON are both text. Data structures are not text.

A lot of wizards would argue against that.

First language i learnt was mIRC.First programming language I learnt was c++.

Awesome. That what I aim to learn.

In order fo understand databases properly you have to have an understanding of the data structures they use. JSON is nothing but a textual representation of information. Learn what a data structure is: http://en.wikipedia.org/wiki/Data_structure Learn types of data structures used by the database:http://en.wikipedia.org/wiki/B-treehttp://en.wikipedia.org/wiki/Hash_tablehttp://en.wikipedia.org/wiki/Red_black_tree JSON is a really superficial thing that's unrelated to the fundamental concepts of a database.

Thanks for the link. From what I have read, it sound a lot like xml, and json.