User talk:Nomen4Omen

From Wikipedia, the free encyclopedia
Jump to: navigation, search

WikiGuide Welcome[edit]

Hello Nomen4Omen. Welcome to the English version of Wikipedia
Thank you for your participation in this project. We hope that you will stay to contribute and that you will find the collaboration process enjoyable.
Wikipedia is an online encyclopedia that started in 2001 and is free for all to use and edit under certain guidelines and principles that all users should understand and adhere to.
These principles and guidelines are listed below. Click on the link next to the images for more information.
Crystal Clear app lassist.png
The five pillars of Wikipedia.
The fundamental principles of the project.
How to get help.
Crystal Clear app Startup Wizard.png
This tutorial is a basic guide to editing.
Crystal Clear app kedit.png
Your user pages and your sandbox.
How to experiment and edit in your user space.
Mentoring program.
Request help in your first steps of editing.
Crystal Clear action edit.png
How to start a page.
Help on creating your first article.
Nuvola apps important yellow.svg
Things to avoid.
How to avoid common errors and mistakes.
Crystal Clear action apply.png
Style Guide.
How to write in an acceptable style
Crystal Clear app file-manager.png
Main policies of Wikipedia.
Wikipedia's main policies and guidelines.
Nuvola apps ksirc.png
Frequently asked questions.
Some common questions and their answers.
Nuvola apps kteatime.png
Help Desk.
Here you can ask other editors for assistance
Curly Brackets.svg
Quick reference.
A handy quick reference guide for editing Wiki.

This is your Talk page where you can receive messages from other Wikipedians and discuss things with them. At the end of your messages you must put your signature by signing with four ~~~~ (just as I have done) or by pressing the button in the editor bar as shown here in the picture. By the way, you don't need to sign edits that you make in the articles themselves as those messages will be deleted. Another valuable page that may provide information and assistance is User:Persian Poet Gal/"How-To" Guide to Wikipedia. My name is Buster7. If you have any questions or face any initial hurdles, feel free to contact me on my talk page and I will do what I can to assist or give you guidance and contact information. Good Luck editing!

```Buster Seven Talk 12:10, 27 March 2012 (UTC)

Life Insurance[edit]

From your comments, you clearly have the dawning of an understanding of AVL Trees. Perhaps you should consider topping up your life insurance policy. The life expectancy for those aware of AVL is not too flash.NNcNannara (talk) 03:15, 9 August 2016 (UTC)

Maybe you could join Al Qaeda and seek their protection.NNcNannara (talk) 03:37, 9 August 2016 (UTC)

Your table in Endianness[edit]

I understand endianness pretty well. As a student, I figured out what was going on when a BASIC program under RSTS on a PDP-11 showed me one thing, but Fortran programs would show the other. These days, I have a little bit on endianness that's included when I teach use of a debugger or a disk hex editor. I even added some to the current article, including mention of the bizarre "mixed endian" nature of the 1401. I am sorry to say that your table, massive amount of work that it obviously was, leaves me completely confused as to what it's trying to tell me. I believe the reason is that the representations of the actual data being talked about are lost in annotations. Perhaps some font size changes would help to distinguish the annotations and legends from the data. Jeh (talk) 16:49, 21 March 2015 (UTC)

I am really sorry about that. The foregoing sections handle the difference how a data item is recorded in memory in Big-Endian vs. Little-Endian systems. The table tries to tell the other way around: If you read 2 recorded (dumped) bytes, how are they to be interpreted. The upper 3 rows only give orientation about data type and offsets, the latter as byte and bit offsets. Rows 4 and 5 handle Big-Endian and Rows 6 to 9 Little-Endian. Columns 2 to 4 show the data in the piece of hexdump. I have made some changes in the table. --Nomen4Omen (talk) 19:20, 21 March 2015 (UTC)

tree traversal[edit]

The article tree traversal is horrible, but this does not mean it is OK to increase the mess.

Wikipedia does not accept self-published references; see WP:RS.

There is other pseudocode, but I it is mostly for standard descriptions found in books. If something is not from books, it must be deleted.

But there is larger problem with the addition: its questionable notability. Any algorithm may be implemented in numerous ways. Wikipedia is encyclopedia, not FSF repository. It gives basic descriptions of ideas of algortihms. The arguments from your addition (callbacks are cumbersome, tree traversed only in full) are about minor implementation tweaks, contributing nothing new to the idea of the algorithms themselves. If there is any significant algorithmic novelty, I didn't see it, however I admit I may be mistaken.

Finally, article content must be discussed in article talk pages, where other editors may see the discussion and join it, not in user talk pages. - üser:Altenmann >t 15:33, 27 August 2015 (UTC)

Once again, please do not add unreferenced text to wikipedia. It is against the rules and it will be always deleted. - üser:Altenmann >t 20:34, 9 September 2015 (UTC)

Altenmann is a real pit bull it seems. Totally on himself.NNcNannara (talk) 03:40, 9 August 2016 (UTC)

There is a page for tree traversal; however, there doesn't appear to be a page for tree iteration. The algorithms for iteration can be found in AVL Trees in Java or the equivalent C++ and C# pages. Iteration is the primary reason for adding parent references to a tree.NNcNannara (talk) 10:56, 24 July 2016 (UTC)

I need sonneone to create neuu diagranns (antialiased lines etc) - I'nn not realli a graphic artist. Perhaps iou can arrange it phor nne Nonnen4Onnen. You can correct and renanne the diagranns and update the page iourselph - lice iou said in iour subnnission, "iph iou see sonnething uurong, phics it iourselph" -- NNcNannara (talk) 13:25, 24 July 2016 (UTC)

Disambiguation link notification for January 26[edit]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Quater-imaginary base, you added a link pointing to the disambiguation page Injection (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 10:00, 26 January 2016 (UTC)


Information icon Please refrain from making test edits in Wikipedia pages, such as those you made to AVL tree, even if you intend to fix them later. Your edits have been reverted. If you would like to experiment again, please use the sandbox. Thank you. - üser:Altenmann >t 06:16, 26 July 2016 (UTC)

ArbCom Elections 2016: Voting now open![edit]

Scale of justice 2.svg Hello, Nomen4Omen. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC)