text:
Talk:Disjoint-set data structure

disjoint set
This is also known as MF-Set (Merge-Find-Set), isn't it?--216.244.232.1 03:37, 18 Oct 2004 (UTC)
 * I was not aware of this. Thanks. I've added this information and the appropriate redirects (merge-find set, merge-find-set, merge-find data structure). Derrick Coetzee 05:45, 18 Oct 2004 (UTC)

Some references
The first description of the disjoint-sets forest idea is found in:

Bernard A. Galler and Michael J. Fisher. "An improved equivalence algorithm", Communications of the ACM, Volume 7, Issue 5 (May 1964), pages 301-303.

Further reference:

Zvi Galil and Giuseppe F. Italiano. "Data structures and algorithms for disjoint set union problems", ACM Computing Surveys, Volume 23, Issue 3 (September 1991), pages 319-344.

 * Thanks for the references. I'll add them. Deco 04:10, 24 December 2005 (UTC)

Does the source code belong here?
While the source code is no doubt useful, it's not really commented on that much in the rest of the entry. Might it belong in Wikisource? --Jacj 14:21, 8 May 2006 (UTC)

some notes
wouldn't the Fredman and Saks result need a reference? (at the end of the "Disjoint-set forests" section)

also, isn't this the same algorithm that physicists know as Hoshen-Kopelman? I will try to add that in some appropriate way later.

Disjoint-set forests algorithm complexity
On the page http://en.wikipedia.org/wiki/Big_O_notation#Common_orders_of_functions it says that the complexity of the The find algorithm of Hopcroft and Ullman on a disjoint set is iterated logarithmic. Iterated logarithmic is the inverse of Tetration. On this page at the end of the chapter Disjoint-set forests algorithm complexity however it says that the complexity is the inverse of the Ackerman function.

It also says on this page that the inverse of the Ackerman function is less than 5 for all practical n, while on the Iterated_logarithm page, it says the inverse of Tetration (= the iterated logarithm) is less than 5 for all practical n.

Tetration and Ackerman are related but not the same.

What is correct and what isn't?

Lodev 15:10, 10 September 2007 (UTC)

 * Both are correct, in that both are proven upper bounds for the runtime of these operations. The inverse Ackermann function grows more slowly than the iterated logarithm, so it's a better bound. This is already described briefly in the History section of this article. Dcoetzee 18:24, 10 September 2007 (UTC)

I am not sure how to parse this:

 * Using both path compression, splitting, or halving and union by rank or size (...)

Should it be as follows?

 * Using both [path compression, splitting or halving], and [union by rank or size] (...)

If so, I think that using a bulleted list would help. Alternatively, we could do the following:

 * 1) Introduce a new name (say, “path shortening strategy”) to refer to any of path compression, path splitting or path halving.
 * 2) Introduce another new name (say, “non-naïve root selection strategy”) to refer to either union by rank or union by size.
 * 3) Say “using both a path shortening strategy and a non-naïve root selection strategy ensures that the amortized time per operation is $$O(\alpha(n))$$”.

pyon (talk) 05:10, 22 January 2020 (UTC)

Hantao Zhang says that the time is linear
This paper of Hantao Zhang, a CS professor at the University of Iowa, claims that the bound given in the Wikipedia article is not the best possible, and that a more careful analysis shows the algorithm to have linear worst-case time. I am following up with Zhang about the provenance of the paper, and whether it was published. -- Dominus (talk) 23:58, 21 January 2008 (UTC)
 * I was going to say that there's a proven lower bound, but the paper addresses this. However, I'm not confident that this paper, which is still very new, has been thoroughly peer-reviewed. I'd like to see it published in a conference or journal or at least a workshop first. Dcoetzee 03:28, 22 January 2008 (UTC)
 * It has not yet been published or peer-reviewed. It is under submission to STOC 2008. Zhang had not been aware of the  Fredman and Saks thing, although he had been aware of similar work that proves the same result.  I will post an update if I learn anything new.  -- Dominus (talk) 23:51, 28 January 2008 (UTC)
 * The paper was rejected from STOC 2008. -- Dominus (talk) 15:15, 27 February 2008 (UTC)
 * Is there any indication of why the paper was rejected -- did the reviewers find mistakes, or did they simply not think it was important enough? 24.80.10.198 (talk) 03:28, 14 April 2008 (UTC)
 * I suppose there were mistakes in it, since Zhang has removed it from his website. Does someone remember the title of the paper? Adrianwn (talk) 09:36, 18 April 2008 (UTC)
 * The title was The Union-Find Problem Is Linear. I still have a copy.  -- Dominus (talk) 13:56, 18 August 2008 (UTC)
 * Isn't the non-linear lower bound only valid under a separation assumption (i.e. disjoint sets representations do not share memory)? The following paper solves some offline version of the union-find problem in linear time by using a lookup table for small sets: "A linear-time algorithm for a special case of disjoint set union" (1983) by Gabow and Tarjan. Aureooms (talk) 16:24, 18 September 2022 (UTC)
 * What about the paper mentioned in e-maxx.ru: Wu, Otoo "A Simpler Proof of the Average Case Complexity of Union-Find with Path Compression"? https://www.researchgate.net/profile/Kesheng-Wu/publication/235708752_A_simpler_proof_of_the_average_case_complexity_of_union-find_with_path_compression/links/540bd2160cf2df04e7509fe0/A-simpler-proof-of-the-average-case-complexity-of-union-find-with-path-compression.pdf?origin=publication_detail It is for average case, but the complexity analysis seems pretty short if the paper is valid. Wqwt (talk) 15:10, 25 December 2022 (UTC)

Shorten Applications section
I will shorten the Applications section; in particular I will remove all subsections except the one related to undirected Graphs. Rationale: Wikipedia is not a textbook, it is also not a programming manual or guide. Books or websites about algorithms or programming are better suited for such descriptions; however, references to them would be appropriate. Adrianwn (talk) 09:50, 18 April 2008 (UTC)
 * I disagree with this edit and with your interpretation of "Wikipedia is not a textbook". The policy page goes on to say: "It is not appropriate to create or edit articles which read as textbooks, with leading questions and step-by-step problem solutions as examples." This seems to imply that this has more to do with style than content; applications of a data structure are certainly relevant to the data structure, just as carbon dioxide describes industrial uses of that chemical in great detail. Dcoetzee 20:57, 18 April 2008 (UTC)
 * You are right, the applications of this data structure should be listed. However, the Applications section contained a lot of those step-by-step instructions. Could you please rewrite that section in a shorter, more concise way? I would do it myself if I understood more about these specific subjects. Adrianwn (talk) 07:20, 19 April 2008 (UTC)
 * You're right, it ought to summarize the applications rather than detail the application algorithms, but the point is to describe the mapping of various application domain events onto disjoint-set operations. I'll take a look at it again, at least the ones that I wrote. Dcoetzee 06:06, 30 April 2008 (UTC)
 * Also, "weighted union heuristic" is a term taken directly from CLRS, and it's used in many publications; you would have found many more Google hits if you tried searching for it with the hyphen ("weighted-union heuristic"). For this reason I've added it back. Dcoetzee 21:02, 18 April 2008 (UTC)
 * Nope, still gives about 200 hits (Google doesn't care much about hyphens), and only 11 hits in Google Scholar. Also, as far as I remember, CLRS never calls it "the" weighted-union heuristic, but rather "a" weighted-union heuristic (i.e., a description of the method instead of a name for it). What do you think about: "When the length of each list is tracked, the time needed can be ameliorated by always appending the smaller list to the longer. Using this "weighted-union heuristic", a sequence of [...]" ? Adrianwn (talk) 06:59, 19 April 2008 (UTC)
 * Sure, sounds fine. Dcoetzee 06:08, 30 April 2008 (UTC)
 * If step by step instructions have been removed from the article, maybe they could be transferred to wikibooks and linked to from here. —Preceding unsigned comment added by 207.241.238.233 (talk) 00:08, 30 April 2008 (UTC)

molecular dynamics
Why is this citation in the reference section? The article doesn't appear to actually refer to it.

 * J. A. Spirko and A. P. Hickman, Molecular-dynamics simulations of collisions of Ne with La@C82, Phys. Rev. A 57, 3674–3682 (1998). —Preceding unsigned comment added by 207.241.238.233 (talk) 00:06, 30 April 2008 (UTC)

Path compression algorithm
The find algorithm listed under path compression is the same one as the normal find, it does not include path compression at all. I figure it should be more like the following:

function Find(x) if x.parent == x        return x      else l = [ x ] x = x.parent while ( x != x.parent) l += x           x = x.parent for y in l           y.parent = x         return x Wppds (talk) 08:02, 20 October 2008 (UTC)

 * No, it isn't the same one and yes, it does perform path compression. The difference is in the else-part of the if-statement:

x.parent := Find(x.parent)
 * Once Find terminates, it returns the root node. This root node then becomes the new parent of each traversed node. Adrianwn (talk) 15:35, 20 October 2008 (UTC)

 * Right, strange that I missed that. I'll delete this comment in a few days then.Wppds (talk) 09:01, 5 January 2009 (UTC)

 * Why? It is neither necessary nor customary to delete comments from a talk page. Often this will be reverted anyway; sometimes it might even be considered vandalism. Don't worry, we all make a mistake sooner or later :-) Adrianwn (talk) 12:38, 5 January 2009 (UTC)

 * Heh I figured they were to be cleaned up at some point. Did read the guidelines now, archivable then, when this gets too long. Wppds (talk) 16:08, 7 February 2009 (UTC)

first bullet
in the first section, it says # Find: Determine which set a particular element is in. Also useful for determining if two elements are in the same set. But if this a disjoint set, how can an element be in two sets? —Preceding unsigned comment added by 24.1.30.246 (talk) 16:18, 7 April 2009 (UTC)
 * You misread it - it says "determine if two elements are in the same set", not "determine if two sets both contain the same element". Dcoetzee 22:57, 7 April 2009 (UTC)

Rank Heuristic algorithm error?
Oh gosh, I'm on a roll of stupid edits... Sorry for the noise ;-)

Complexity
The quote from the paper is unclear: is the Ackerman complexity the least an algorithm must use (a lower bound), or is it an upper-bound (the truly optimal complexity is no more than the Ackerman complexity)? --Gwern (contribs) 01:36 11 January 2010 (GMT)
 * I think it means that the Ackermann function is an upper bound for all inputs, and a lower bound for some inputs (i.e., the worst case). — Adrianwn (talk) 07:26, 11 January 2010 (UTC)

How is Union defined ?
Is it Union(x,y) and x,y are representatives ? Cormen writes they are not. I am confused. The difference is whether we have to find the roots or not. Webskipper (talk) 15:58, 21 May 2010 (UTC)

 * It depends on how Union(x,y) is defined; the pseudocode in this article does not assume that x and y are representatives. – Adrianwn (talk) 16:22, 21 May 2010 (UTC)

Error in the implementation
The implementation listed as Implementation of Disjoint-set Forests in C++, by Bo Tian seems not to update the path (it dont do path compression) which is the hole point. — Preceding unsigned comment added by 85.164.124.173 (talk) 17:57, 20 July 2011 (UTC)
 * I've removed the C++ links, as the code was poor quality. Follow the pseudocode in the article instead. The Python implementation also looks reasonably okay. If you're looking to do this in C++ in a production setting you should be using the Boost implementation instead. Dcoetzee 04:46, 21 July 2011 (UTC)

Linked lists
The article claims that concatenation of linked lists in constant time. This is not so, you have to append the second list to the tail of the first one, which requires O(|L1|) where L1 is the first list.

To get such a limit, we need more, such as a pointer to the end of our lists. These are not strictly "linked-lists" and I suggest that this is mentioned.

STL (for C++) provides "splice" on lists which is O(1). To support this, lists are actually doubly linked lists, and for instance in GNU C++ (libstdc++), they are even circular doubly-linked list with a direct access to the last element.

Akim Demaille (talk) 13:33, 23 October 2011 (UTC)
 * Keeping a tail pointer for a linked list is a trivial extension and extremely common in practice (I'd argue, more common than not keeping such a tail pointer). I really don't think this requires any further explanation. It is true that STL splice is useful for implementing list merging in C++, but that's an implementation detail and not terribly relevant here. Dcoetzee 20:10, 24 October 2011 (UTC)

I see another error, or at least a significant omission regarding linked lists. The article claims that by adding a pointer back to head on each node, find can be implemented in constant time, but doesn't explain how this is possible. Find on an linked list typically requires visiting every element, and I don't see how pointers back to head on each node would change this. 75.21.70.205 (talk) 23:02, 25 October 2011 (UTC)
 * You're confusing the linked list "find" operation with the disjoint-set data structure "find" operation. The role of the first is to find a list element with a particular value. The role of the second is, given an element, to find its set representative - which we have chosen to be the head of the list that element belongs to. I've edited to attempt to clarify this. Let me know if this can be improved further. Dcoetzee 01:41, 26 October 2011 (UTC)

Complexity of path compression
If I use only path compression without height/rank comparing, what is the complexity of the algorithm? I remember that somebody told me that it would be O(log n) but I'm not sure. It would be nice if the article provide this questionable complexity. --Nullzero (talk) 05:51, 12 February 2013 (UTC)

 * A parent-pointe tree of n nodes would have at most `log(n)` layers, which is would be the complexity of the `find` operation. Thus, even without path compression, the `find` operation would have $$\Theta(log(n))$$.
 * However, if you're using path compression with the `find` operation, then optimization would happen as $$\Theta(log(n))$$-layers would get compressed to two layers.
 * I refrained from using the word 'rank' as I'm still trying to figure out its definition. The definition of rank in this article differs from my understanding of rank.
 * Antmaker (talk) 15:21, 21 April 2022 (UTC)
 * Antmaker (talk) 15:21, 21 April 2022 (UTC)

Run time of MakeSet in Disjoint-set forests
Maybe I'm missing something very simple, but why it said that the run time of MakeSet in the Disjoint-set forests implementation is O(log(n))? Shouldn't it supposed to be O(1)?

Thanks — Preceding unsigned comment added by 79.177.179.58 (talk) 11:00, 14 January 2016 (UTC)
 * Fixed. Glrx (talk) 02:54, 16 January 2016 (UTC)

Can we add a box with the asymptotic runtimes, like some of the other data structures have? — Preceding unsigned comment added by 45.49.18.32 (talk • contribs) 18:18, 23 January 2016

if Condition is incorrect in Find function
Operations Section

Find Sub-Section

if condition x.parent != NULL is incorrect it should be x.parent != x, because at the return of function null will be return instead of root i.e when find will be used in union, find(x) will return NULL instead of Root — Preceding unsigned comment added by CY5 (talk • contribs) 15:48, 18 February 2017 (UTC)

Restructuring

 * I notice that you reverted due to a violation of a citations policy. Yet the reversion took with it much material and labour and resulted in an article that had no clear citation style (unless I'm reading it wrong). If you prefer in-line citations, I'm happy to move citations around if you prefer a different format, but I think the article in its current format (as of 2017-05-31) is significantly improved over the old version.

Similarly, if you think the material regarding linked lists should be retained (I do not), I feel this should occupy a less prominent place in the article. It is unclear to me why anyone would use an _O(n log n)_ algorithm with instead of a _O(α(n))_ algorithm having a smaller space requirement. It seems to me that the linked list alternative is more of a historical footnote than a subject worthy of several sections of discussion. Indeed, an interview I spoke with cited the Wiki article as proof that Disjoint-set was in _O(n log n)_: the old format was actively misleading people.

To all: I've made some major changes to the article as of this version. I note the article was at a C rating with High importance; hopefully, this restructuring will provide a good framework for elevating the article. Is anyone able to comment on further improvements needed?

Best regards, Finog (talk) 17:23, 31 May 2017 (UTC)

 * I've reverted you again. You need to follow WP:BRD.
 * You changed the citations from inline to out-of-line which violates WP:CITEVAR.
 * The goal of the article is to explain the algorithm. The original text goes from a naive implementation to more sophisticated versions and is a reasonable thing to do. It puts the sophistication in context. In your version, the Time complexity section has no context. Starting with a sophisticated version is OK if you already know the subject, but the readers probably do not know the subject. That's why they came here.
 * The algorithm is more important than its history. History should be down below.
 * Some algorithm descriptions were contorted. For example, in MakeSet(x), x is abused.
 * Glrx (talk) 18:19, 31 May 2017 (UTC)

 * : I've reverted your reversions and placed the citations inline, per your preference.
 * I think the history section should be placed above. This is the case for A* search algorithm, Dijkstra's algorithm, Floyd–Warshall algorithm, and Alpha–beta pruning. As such, it seems to be a common stylistic choice and using it here helps maintain consistency between articles.
 * Cormen is quoted as the source of the linked-list description. Looking at his Chapter 23 notes, I don't see an attribution for the linked list form - just mention of the forest form. Perhaps he made up the linked list as a pedagogical tool. Given the simplicity of the actual data structure, it seems better to focus on a lucid explanation of that. After all, Wikipedia is not a textbook. If you feel this section is important, it may be better to preface it with a statement that it describes a purposely simplified variant of the algorithm useful only for contextualizing what you feel is a more complex sophisticated variant.
 * I do not understand your comment about "x being abused". Perhaps you could edit that section of the article to reflect your thoughts on the matter.
 * I am not sure what WP:BRD is, but gather that it is a cycle in which, rather than collaboratively working on a product, I build something and you trash/revert it. The cycle ends when I build a thing you don't feel like trashing. It seems to me that this is the longest path to satisfaction for you and the most frustrating to me. I hope we can instead build good things together.
 * Best regards, Finog (talk) 07:16, 2 June 2017 (UTC)
 * WP:BRD means you discuss changes on this talk page and get WP:CONSENSUS before you reinsert them.
 * It makes little sense to discuss who came up with idea X when X has not yet been explained.
 * My objections are deeper than simple syntactic issues. That said, you broke many reference templates (cite book changed to citation book; I've edited the article to a consistent style), inserted spaces where they don't belong (spaces before references; multiple blank line), and made strange edits ("It is also used for implementing..." changed to "It is also a key used for implementing").
 * I'm not saying that the current exposition is great. The linked list explanation is contorted. There's mention of the "one-pass" Find algorithm, but the article never raises the constant space two-pass Find.
 * Glrx (talk) 19:08, 2 June 2017 (UTC)

 * : I've reverted your changes and updated the citation styles per your advice. Note that many of the citations you believe I changed were, in fact, copied verbatim from the original post: they were probably in an antiquated format. The rest of the citations I populated using these as templates. The citations should now all match the more appropriate format you suggest.
 * The article has an introduction which explains the gist of the idea. The user does not enter the history section entirely unprepared. Further, the current content of the History section does not presume a technical understanding of the algorithm. And, as I pointed out previously, this seems to be the standard ordering for algorithms articles. Why should this article have a different formatting? If you feel the history section should go elsewhere, why not try to edit the article?
 * None of the issues you mention require complete reversion. They can all be addressed through simple edits, as your most recent edit aptly demonstrates. If you feel the spacing is amiss, that is an easy thing to fix. I will go through the article and see if I can find/resolve such stylistic issues. Perhaps my unfamiliarity with Wiki's formatting system is at the root.
 * Best regards, Finog (talk) 19:28, 2 June 2017 (UTC)

 * : I've reduced the multiple blank line issue, the spacing before references, and the "a key" wording.
 * If your objections are deeper, they seem to be something of a moving target. Your stated reason for reverting was originally due to the citation organization. Now I'm not sure what the objections are.
 * I notice that you have used your administrative powers to put a warning on my account. I hope you appreciate the power differential that is driving this editing process. I am not an experienced editor, but am trying to improve the article and asking you to work constructively with the material I'm trying to build. Further, I've posted in both WikiProject Computing and WikiProject Computer Science looking for feedback on the article. You are rejecting my material wholesale for reasons that I see as easily resolvable via edits and using your knowledge of community arcana and, now, your ability to freeze my account to enforce your view.
 * We agree that the current exposition is not great, but it seems that, of the two of us, I am the one actively trying to improve that exposition whereas your reversions keep bringing us back to it. If I tire of this process, will you take on the responsibility of improving the exposition alone? If not, can we discuss here how I can improve my material and iterate on it, rather than repeatedly starting from scratch?
 * Best regards, Finog (talk) 19:54, 2 June 2017 (UTC)

MakeSet: if x is not already present
How would this one line of pseudocode be implemented? I assume there wouldn't be a separate hash table that makes the operation O(1). It seems like if you had to go through the list of trees in the forest, it would potentially be O(n), but that also seems wrong. — Preceding unsigned comment added by Davidvandebunte (talk • contribs) 02:48, 21 December 2017 (UTC)

 * The statement makes little sense, and the statement does not exist in earlier versions of this article. See this version. Also see my comment above that states, "Some algorithm descriptions were contorted. For example, in MakeSet(x), x is abused." The statement confuses the notion of the elements existing in an array or being individually allocated from the heap. MakeSet is not allocating, it is only initializing. When an element x is initialized, then its parent and rank need to set. The presence of x is never in doubt. InitSet might be a better name, but MakeSet is traditional.
 * Subsequent edits to the old article introduced significant confusion, poor exposition, and other problems. I didn't get anywhere with Finog.
 * I think the article should go back to the earlier text.
 * Glrx (talk) 00:44, 31 December 2017 (UTC)
 * I came to mention the same thing. It seem non obvious how (magically)
 * > if x is not already in the forest then
 * and
 * > This operation has constant time complexity.
 * would make sense, together.
 * The version you link. is way clearer and to-the-point with great examples which gradually grow in complexity. Completely agree it should go back to the earlier text. 2bam (talk) 19:12, 27 January 2024 (UTC)

Error in Union pseudocode?
The article says "If two sets are unioned and have the same rank, the resulting set's rank is one larger". However, in the pseudocode the rank of the smaller(!) set is incremented by one, while nothing happens if they are the same size. 135.84.132.56 (talk) 17:31, 14 February 2018 (UTC)

 * Perhaps the 'union by rank' pseudocode has been updated because I don't see an error in it.
 * The case when the two sets of the same rank is unioned, the final set has a rank incremented by one.
 * Antmaker (talk) 15:45, 21 April 2022 (UTC)
 * Antmaker (talk) 15:45, 21 April 2022 (UTC)

= Proof = Content merged from Talk:Proof of O(log*n) time complexity of union–find.--Salix alba (talk): 07:05, 23 April 2020 (UTC)

Formatting makeover
The formatting of this page (especially of the mathematics) was pretty cruddy, so I went through and did what I could, fixing up some grammar while I was at it. I haven't actually read the article yet, so it's quite possible I goofed something up by misinterpreting it.Dfeuer (talk) 05:27, 6 July 2012 (UTC)

Lemma 3
Lemma three isn't explicitly mentioned anywhere after its statement. Dfeuer (talk) 06:14, 6 July 2012 (UTC)

Lemma 2 wrong?
The proof of Lemma 2 only considers "Makeset" and "Union", but not "Find"; and indeed path compression will cause a violation of the claim.

This raises (again) the following question: — Preceding unsigned comment added by Martin Ziegler (talk • contribs) 09:33, 4 April 2018 (UTC)

Original research?
Whose proof is this? If it was previously published, is there a copyright problem? If not, is it prohibited as original research? Dfeuer (talk) 09:14, 7 July 2012 (UTC)

This is about the most lucid and simple proof I have seen of the (non-optimal) fact that Union-Find algs have amortized runtime bounded by O(log* n). I plan to use this in my teaching notes on the topic.

Chris Lacher — Preceding unsigned comment added by 69.254.177.155 (talk) 17:13, 15 December 2013 (UTC)

Missing steps in that proof?
The proof is basically that of Hopcroft and Ullman (1973). However, this short version does not clearly make use of the hypothesis that each Find leads to a path compression, which is crucial for the result to be correct. An extra explanation showing where and how that hypothesis is used seems needed. — Preceding unsigned comment added by Bsalvy (talk • contribs) 21:26, 15 November 2018 (UTC)

It is used (implicitly) in the argument to bound T_3. I'll try to augment that argument in the article. Preciser (talk) 02:06, 19 January 2019 (UTC)

Gaps in the proof
As I read the current proof, it reads as if the forest is unchanging. The original proof by Hopcroft and Ullman is careful (when defining the ranks, and when proving the analogous lemmas), to carefully account for how the trees change as a result of find and union operations. This issue seems to be swept under the rug in the current proof here, making it very hard to understand the details. Nealeyoung (talk) 23:18, 22 March 2019 (UTC)

Rank and Height definition
I am confused with the definition of rank as the way it is used in this article differs from my understanding.

My understanding is as follow:

 * Rank: Property of a Tree - The number of nodes from the leaf to root including the root itself; thus, a singleton would have a rank of one.
 * Height: Property of a Tree - The number of edge from the leaf to the root; thus a singleton would have a height of zero.

The article's definitions:

 * Rank: Rank is the upper bound of height, and a singleton's rank and height are both 0.

Antmaker (talk) 15:31, 21 April 2022 (UTC)

 * Rank as used in this data structure is defined by the algorithm. It is indeed an upper bound on height, where height of a node is the number of edges from the node to its deepest leaf. This notion of height is standard. The notion of rank is not standard but specific to the algorithm. There is another way to define the rank of a node - it is the height that this node would have if no compressions took place. AmirOnWiki (talk) 12:31, 11 September 2023 (UTC)

title: Talk:Disjoint-set data structure


text:
Plumas Lake, California

Plumas Lake is a master-planned exurb and census-designated place in Yuba County, California. It is located 30 mi north of Sacramento and 10 mi south of Marysville off California State Route 70. Its population was 8,126 at the 2020 census.

Plumas Lake was first conceived in 1993 as a means to guide development along the Feather and Bear Rivers. Construction began in 2003 and at full build-out the community is expected to have roughly 12,000 homes and 36,000 residents.

History
There was previously a settlement called Plumas Landing (also known as Plumas City) west of Plumas Lake on the bank of the Feather River. The old settlement was impacted by Gold rush-era hydraulic mining in the Yuba River watershed upstream. Mine tailings wound up in the riverbeds and were then transported into the Sacramento Valley, where they accumulated in the river channels and reduced their conveyance capacities.

Flood risk has been a concern throughout Plumas Lake's development and many individuals and agencies were opposed to its construction. The area that would become the community of Plumas Lake experienced major floods in 1986 and 1997. Despite this, the first master plan for Plumas Lake was approved in 1993 and construction started early 2003.

In the years since construction began the levee infrastructure has improved significantly. In 2019, FEMA accredited the community with moderate-to-low flood risk. The community is rated against 200-year floods which equates to a 1 in 200 chance (0.5% probability) that a flood will occur in any given year. Improvements to existing water management infrastructure could enable 500-year flood protection in the future.

Geography
Plumas Lake is located at 39.02073°N, -121.55802°W (39.0207272, -121.5580176). According to the United States Census Bureau, the CDP of Plumas Lake covers an area of 11.84 sqmi, all of it land. It lies at an elevation of 46 ft. It shares the same ZIP code as Olivehurst, California, a neighboring community.

Plumas Lake is in the southern tip of Yuba County near the confluence of the Feather and Bear Rivers. The community's north and south ends are connected by River Oaks Boulevard and Algodon Slough, a seasonal backwater that flows into the Bear River. A common misconception is that the community is built on top of a dry lake. The old lake is actually located northwest of the community and is now mostly agricultural land.

Since Plumas Lake is an unincorporated community there are a few ways to define its borders. The most popular definition is the census-designated place which includes land south of Algodon Road, north of Bear River, and some adjacent rural areas. The Plumas Lake Specific Plan's definition extends even further north to include the Olivehurst suburb of Wheeler Ranch, Plumas Lake Golf Club, Arboga, and rural areas in between. The largest definition is the Plumas Lake ZIP code area which includes land east of the Feather River, west of Forty Mile Road, and everything north of Bear River up to the new developments along Arboga Road.

Climate
According to the Köppen Climate Classification system, Plumas Lake has a hot-summer Mediterranean climate, abbreviated "Csa" on climate maps.

Demographics
The 2020 United States census showed Plumas Lake's population to be 8,126, an increase of 38.8% from the 2010 census. It has the 4th highest population in Yuba County among cities and CDPs, behind Linda, Olivehurst, and Marysville.

2020
According to data from the 2020 United States census the median household income for Plumas Lake was $104,021. 4.5% of the population was living below the poverty line.

The census reported that Plumas Lake had a population of 8,126. The population density was 687 PD/sqmi. The racial makeup of Plumas Lake was 4,657 (57.3%) White, 700 (8.6%) Asian, 424 (5.2%) African American, 112 (1.4%) Native American, 68 (0.8%) Pacific Islander, 655 (8.1%) from other races, and 1510 (18.6%) from two or more races. Hispanic or Latino of any race were 1,978 persons (24.3%).

There were 2,363 households, out of which 1,289 (54.5%) had children under the age of 18 living in them, 1,623 (68.7%) were opposite-sex married couples living together, 313 (13.2%) had a female householder with no husband present, 271 (11.5%) had a male householder with no wife present. There were 134 (5.7%) unmarried opposite-sex partnerships, and 156 (6.6%) same-sex married couples or partnerships. 225 households (9.5%) were made up of individuals, and 49 (2.1%) had someone living alone who was 65 years of age or older. The average household size was 3.44.

2010
The 2010 United States census reported that Plumas Lake had a population of 5,853. The population density was 698 PD/sqmi. The racial makeup of Plumas Lake was 3,923 (67.0%) White, 474 (8.1%) Asian, 372 (6.4%) African American, 73 (1.2%) Native American, 44 (0.8%) Pacific Islander, 451 (7.7%) from other races, and 516 (8.8%) from two or more races. Hispanic or Latino of any race were 1,312 persons (22.4%).

There were 1,745 households, out of which 1,043 (59.8%) had children under the age of 18 living in them, 1,195 (68.5%) were opposite-sex married couples living together, 155 (8.9%) had a female householder with no husband present, 117 (6.7%) had a male householder with no wife present. There were 127 (7.3%) unmarried opposite-sex partnerships, and 20 (1.1%) same-sex married couples or partnerships. 183 households (10.5%) were made up of individuals, and 21 (1.2%) had someone living alone who was 65 years of age or older. The average household size was 3.35. There were 1,467 families (84.1% of all households); the average family size was 3.61.

The population was spread out, with 2,144 people (36.6%) under the age of 18, 380 people (6.5%) aged 18 to 24, 2,204 people (37.7%) aged 25 to 44, 926 people (15.8%) aged 45 to 64, and 199 people (3.4%) who were 65 years of age or older. The median age was 29.1 years. For every 100 females, there were 104.6 males. For every 100 females age 18 and over, there were 99.0 males.

There were 1,924 housing units at an average density of 229.5 /sqmi, of which 1,480 (84.8%) were owner-occupied, and 265 (15.2%) were occupied by renters. The homeowner vacancy rate was 6.2%; the rental vacancy rate was 6.0%. 4,835 people (82.6% of the population) lived in owner-occupied housing units and 1,018 people (17.4%) lived in rental housing units.

Parks and recreation
Plumas Lake currently has 15+ parks (including Wheeler Ranch) and a paved pedestrian/bike path called the Bear River Habitat Trail. Also nearby is the Plumas Lake Golf Club, Toyota Amphitheatre, and Hard Rock Hotel & Casino Sacramento at Fire Mountain.

Parks

 * Bear River Park
 * Bill Pinkerton Memorial Park
 * Donald Brown Memorial Park
 * Eufay Wood Sr. Memorial Park
 * Feather River East Park
 * Orchard Glen Park
 * River Glen Park
 * River Park
 * Riverside Meadows Park
 * Rolling Hills Park
 * Veteran's Park
 * Joann Aiello Memorial Park (Wheeler Ranch)
 * Leila Smith Memorial Park (Wheeler Ranch)
 * Richard Donahue Park (Wheeler Ranch)
 * Wheeler Ranch Park (Wheeler Ranch)

Government
Plumas Lake receives water, wastewater, park, and recreation services from the Olivehurst Public Utility District. Fire services are provided by the Linda Fire Protection District.

In the Yuba County Board of Supervisors, Plumas Lake is in the 4th Supervisor district, represented by Gary Bradford.

State and federal representation
In the California State Legislature, Plumas Lake is in, and in.

In the United States House of Representatives, Plumas Lake is in.

Education
Plumas Lake is served by the Plumas Lake Elementary School District (K-8) and the Wheatland Union High School District, Plumas Lake district (9-12).

Schools

 * Cobblestone Elementary
 * Rio Del Oro Elementary
 * Riverside Meadows Intermediate School
 * Plumas Lake High School (in development)

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Plumas Lake, California


text:
John Richard Green

John Richard Green (12 December 1837 – 7 March 1883) was an English historian.

Early life
Green was born on 12 December 1837, the son of a tradesman in Oxford, where he was educated, first at Magdalen College School, and then at Jesus College, Oxford, where he is commemorated by the J. R. Green Society, which meets several times a term and is run by students from the undergraduate body. He grew up in a high-church Tory family from which he rebelled as early as 1850, being "temporarily banished from his uncle's house for ridiculing the uproar over 'Papal Aggression.'"

Ecclesiastical career
He entered the church, being ordained to the diaconate in 1860, and served various cures in London, under a constant strain caused by delicate health. Always an enthusiastic student of history, the little leisure time he had was devoted to research.

Turn to historical writings
In 1869 he finally gave up his work as a clergyman, and was appointed librarian at Lambeth. He had been laying plans for various historical works, including a History of the English Church as exhibited in a series of Lives of the Archbishops of Canterbury, and, what he proposed as his magnum opus, a history of England under the Angevin kings. After suffering from failing health he abandoned these projects and instead concentrated his energies on the preparation of his A Short History of the English People, which appeared in 1874, and at once gave him an assured place in the first rank of historical writers.

Abandoning his proposed history of the Angevins, he confined himself to expanding his Short History into A History of the English People in four volumes (1878–1880) and writing The Making of England, of which one volume only, coming down to 828, had appeared when he died at Mentone in March 1883. After his death appeared The Conquest of England. The Short History, which in 1915 was republished as part of the Everyman Library, may be said to have begun a new epoch in the writing of history, making the social, industrial, and moral progress of the people its main theme. It sold 235,000 copies in England alone.

More recently J. W. Burrow proposed that Green, like William Stubbs and Edward Augustus Freeman, was a historical scholar with little or no experience of public affairs, with views of the present that were Romantically historicised, and who was drawn to history by what was in a broad sense an antiquarian passion for the past, as well as a patriotic and populist impulse to identify the nation and its institutions as the collective subject of English history, making "... the new historiography of early medieval times an extension, filling out and democratising, of older Whig notions of continuity. It was Stubbs who presented this most substantially; Green who made it popular and dramatic ... It is in Freeman ... of the three the most purely a narrative historian, that the strains are most apparent."

Personal life and death
In 1877 he married Alice Stopford.

During the 1870s Green suffered from lung problems. His wife assisted him in carrying out and completing his work as his broken health took its toll during his few remaining years. He died on 7 March 1883.

Works

 * (1874) A Short History of the English People
 * (1879) English Literature (Editor)
 * (1879) Readings From English History (Editor)
 * (1880) A History of the English People
 * (1881) The Making of England
 * (1883) Conquest of England''
 * (1884) The Conquest of England

Legacy
Sir Leslie Stephen edited a volume of Green's correspondence, which was published in 1901. (see "Works by and About John Richard Green" under "External Links," below.)

title: John Richard Green


text:
Gerald Griffin

Gerald Griffin (Gearóid Ó Gríofa; 12 December 1803 – 12 June 1840) was an Irish-born novelist, poet and playwright. His novel The Collegians was the basis of Dion Boucicault's play The Colleen Bawn. Feeling he was "wasting his time" writing fiction, he joined the Christian Brothers, a Catholic religious congregation founded by Edmund Ignatius Rice to teach the children of the poor.

Early life
Gerald Griffin was born in Limerick in 1803, the youngest son of thirteen children of a substantial Catholic farming family. Patrick Griffin, his father, also made a living through brewing, and he participated as one of Grattan's Irish Volunteers. His mother came from the ancient Irish family of the O'Brien's, and first introduced Gerald to English literature. When he was aged seven, Griffin's family moved to Fairy Lawn, a house near Loghill, County Limerick, which sat on a hill above the bank of the Shannon estuary, about twenty-seven miles from Limerick. Here Griffin had an idyllic childhood and received a classical education. "When free from his books he was wont to roam through the neighbouring countries, so rich in ruins, which told him of the past glories of his native land. At that time, too he got an insight into the customs of the people and became familiar with the popular legends and folk-tales which he later worked into his stories."

London
In 1820 the family at Fairy Lawn was broken up. The parents with several of the children emigrated to America and settled in the state of Pennsylvania. Gerald, with one brother and two sisters, was left behind under the care of his elder brother William, a practising physician in Adare, County Limerick. Griffin met John Banim in Limerick city. Inspired by the successful production of Banim's play Damon and Pythias (1821), Griffin moved to London in 1823; he was nineteen years of age. After an unsuccessful attempt at becoming a playwright, Griffin endured years of poverty in London, managing only to scrape by through writing reviews for periodicals and newspapers. At the end of two years he obtained steady employment in the publishing house as reader and reviser of manuscripts, and in a short time became frequent contributor to some of the leading periodicals and magazines. Griffin's early Literary Gazette pieces vividly described the rural setting of his childhood; recounted Irish folklore; translated the Celtic Irish language for the English readers; and, as Robert Lee Wolff has observed, "waxed richly sardonic about Irishmen who tried to be more English than the English."

Return
Griffin's "Holland-Tide;" or, Munster Popular Tales was published by Simpkin and Marshall in 1827. "Holland-Tide" is a collection of seven short stories, all of which are told in the house of a hospitable Munster farmer during All Hallows' Eve in Munster. "Holland-Tide" established his reputation and he returned to Ireland, where he wrote Tales of the Munster Festivals in Pallaskenry to which his brother William had moved.

Experience led Griffin to modify his expectations in relation to literary work, and, with a view to the legal profession, he entered as a law student at the University of London, but in a short time removed to Dublin for the study of ancient Irish history, preparatory to his work "The Invasion", which was published in 1832. This work had a good sale and was highly praised by scholars, but never became popular.

Christian brother
With the exception of a tour through Scotland and a short trip on the Continent, he lived with his brother, keeping up to some extent his literary labours. By 1833, Griffin was increasingly concerned that "he was wasting his time", and began to devote himself to teaching the poor children of the neighbourhood. In 1838, Griffin burnt all of his unpublished manuscripts and joined the Congregation of Christian Brothers, a Catholic religious order which has as its special aim the education of children of the poor. Writing to an old friend he said "he felt a great deal happier in the practice of this daily routine than he ever did while roving about the great city, absorbed in the modest project of rivalling Shakespeare and throwing Scott in the shade". In June, 1839, he was transferred from Dublin to Cork, where he died of typhus fever at the age of thirty-six.

Legacy
However, his play Gisippus was produced posthumously at the Drury Lane Theatre on February 23, 1842 by William Macready, and it ran to a second edition in print.

One of Griffin's most famous works is The Collegians, a novel based on a trial that he had reported on, involving the murder of a young Irish Catholic girl (Ellen Hanley) by a Protestant Anglo-Irish man (John Scanlon). The novel was later adapted for the stage as The Colleen Bawn by Dion Boucicault.

He has a street named after him in Limerick City and another in Cork City, Ireland. Loughill/Ballyhahill GAA club in west Limerick play under the name of Gerald Griffins.

Works

 * The Collegians
 * Tales of the Munster Festivals
 * Tales illustrative of the Five Senses (1830)
 * Poetical works and Tragedy of Gisippus
 * The Rivals; and, Tracy's ambition (1830)
 * The invasion (1832)
 * Tales of my Neighbourhood (1835)
 * The Duke of Monmouth (1836)
 * The Fate of Cathleen: a Wicklow story (1841)
 * Tales of the Jury Room (1842)

Selected bibliography

 * Griffin, D. The Life of Gerald Griffin, Vol. I (London: 1843). online.

title: Gerald Griffin


text:
Wikipedia:Articles for deletion/C:/DOS C:/DOS/RUN RUN/DOS/RUN

 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review).  No further edits should be made to this page.

The result was delete.

C:/DOS_C:/DOS/RUN_RUN/DOS/RUN
Ridiculously self-explanatory t-shirt slogan/computer joke whose major claim to fame was a ten-second mention on The Simpsons. Next up: I Went to Idaho and All I Got was this Lousy T-Shirt. Delete. Ian Pugh 03:46, 18 Oct 2004 (UTC)
 * My favorite one is My friend went to Iraq to look for weapons of mass destruction and all he found was this lousy T-shirt. Fishal 02:22, 19 Oct 2004 (UTC)
 * Delete. Non-notable joke. jni 07:42, 18 Oct 2004 (UTC)
 * Delete: Another ancient computer joke. When "The Simpsons" quoted it, it was as an example of the stupid and old jokes that computer people tell.  Let's not be the nerds, eh? Geogre 13:09, 18 Oct 2004 (UTC)
 * Incidentally, that episode just replayed on my local station. "Only one person in a million would find that funny," says Lisa Simpson. Geogre 00:11, 19 Oct 2004 (UTC)

 * Delete. --*drew 13:11, 18 Oct 2004 (UTC)
 * Delete. Non-notable joke. Nadavspi 18:40, 18 Oct 2004 (UTC)
 * Del joke.txt --Improv 20:54, 18 Oct 2004 (UTC)
 * Keep, there is no valid reason for deletion. -- Crevaner 14:06, 19 Oct 2004 (UTC)
 * One valid reason is "No potential to become encyclopedic," see Deletion_policy [[User:Dpbsmith|Dpbsmith (talk)]] 13:05, 20 Oct 2004 (UTC)
 * DEL. Non-notable. Maybe mention this in some other article; it doesn't deserve its own article. Andre ( talk )A| 14:11, Oct 19, 2004 (UTC)
 * Merge if a suitable article exists, then Delete. Not an important meme in its own right. Not a likely search term, does not need a redirect. Individual jokes, T-shirt slogans, etc. should not have entire entries and articles. We don't (and shouldn't!) even have articles on real memes like Tippecanoe and Tyler too or 54-40 or fight or Remember the Maine or Remember Pearl Harbor or Remember the Alamo. [[User:Dpbsmith|Dpbsmith (talk)]] 13:03, 20 Oct 2004 (UTC)
 * Merge if there is something suitable. An interesting note is that I never got this joke since I am from Sweden where we, as far as I know, have no similar childrens book. I always wondered what was so funny about it, even when I saw it on the Simpsons. Thanks to this article I now know the joke.. I assume "Spot" was a dog or something in the book.. At any rate, as useful as It was for me (and I assume other non-Americans) It should not have its own article. It wouldn't hurt to mention it in another article, though, but I'll leave it up to someone else to decide which... Zelda 23:14, Oct 21, 2004 (UTC)
 * See Spot (dog); See Spot run (dog running); Run spot run (another dog picture) is classic basic English education. The most classic example is the (likely) originator, some picture book for preschool aged kids from the 1950's. It is frequently used in cultural context for various things. Such as See spot run type reports issued to women from male underlings, in criticism of male chauvanism, etc. It goes with brown cows, and jumping over lazy dogs... 132.205.15.4 03:52, 23 Oct 2004 (UTC)
 * Keep. [[User:Neutrality|Neutrality (hopefully!)]] 21:20, Oct 22, 2004 (UTC)
 * Delete. Just a joke, not notable, at least the article doesn't say why it is (one mention on Simpsons doesn't cut it). Thue | talk 12:50, 23 Oct 2004 (UTC)
 * Delete. NeoJustin 16:14 Oct. 23, 2004 (UTC)
 * Keep. Guanaco 02:07, 24 Oct 2004 (UTC)
 * Delete: nonnotable joke. Wile E. Heresiarch 02:26, 24 Oct 2004 (UTC)
 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.


text:
File:Ani DiFranco - Puddle Dive.jpg

Cover for the album Puddle Dive by Ani DiFranco

title: File:Ani DiFranco - Puddle Dive.jpg


text:
Francis Hindes Groome

Francis Hindes Groome (30 August 1851 – 24 January 1902) was a writer and foremost commentator of his time on the Romani people, their language, life, history, customs, beliefs, and lore.

He was the son of Robert Hindes Groome, Archdeacon of Suffolk.

Life
Groome was born at his father's rectory in Monk Soham, Suffolk, on 30 August 1851. He was educated at Ipswich School, where his lifelong interest in Romanies was sparked, and continued at Oxford University. He left Oxford without taking a degree, spent some time at the University of Göttingen, in Germany, and then for six years lived with Romani at home and abroad. He married a woman of Romani blood, Esmeralda Locke, in 1876 and settled down to regular literary work in Edinburgh.

Groome contributed generously and on a variety of subjects to such publications as the Encyclopædia Britannica, the Dictionary of National Biography, Blackwood's Magazine, the Athenaeum, Johnson's Universal Cyclopedia, The Bookman, Chambers' Biographical Dictionary, the Ordnance Gazetteer of Scotland, and as joint editor, with his father and poet Edward Fitzgerald, of "Suffolk Notes and Queries" for the Ipswich Journal.

His article on 'Gipsies', in the ninth edition of the Encyclopædia Britannica, made him known to the world as a "gypsyologist". In 1899 he published his most significant book for folklorists, Gypsy Folk-Tales. These well-annotated collections are a significant addition to the comparative study of the world's folktales. He also co-edited the first three volumes of Gypsy Lore Society's Journal, and wrote nineteen brief articles and collections of folktales for it.

He wrote a number of books including a novel of Romani life, an English–Scottish border history, a sketch of his father and Fitzgerald, and an autobiographical account of his time living with the Romani.

Groome was a sub-editor of Chambers's Encyclopaedia; joint-editor of the 1897 edition of Chamber's Dictionary of Biography. He is also well remembered for his six-volume Ordnance Gazetteer of Scotland.

A singularly alert, swift, and eager intellect, he was unwearied in research, impatient of anything less than precision, a frank and fearless critic; thoroughly at home in wide fields of historical and philological research, and in some of them a master. He was nicknamed the “Tarno Rye”.

Death
Groome died on 24 January 1902, aged 50, in London. He was buried at Monk Soham, Suffolk.

Legacy
In October 1901, Groome's library of books, letters, and manuscripts bearing upon the study of the Romani was purchased by the Boston Athenæum. The collection comprises over one hundred volumes, some which are rare, and others contain rare tracts and magazine articles. There are also Groome's own books with his marginal additions, over thirty volumes of manuscript notes, lectures, and his correspondence with M. Paul Bataillard, the eminent French student of the Romani, covering the years 1872 to 1880.

Works
Books and articles written on the Romani People:

 * The Gipsies: Reminiscences and Social Life of this Extraordinary Race (1881) Google Books
 * In Gipsy Tents (1881) Google Books
 * Gipsy folk-tales : A Missing Link (1888) Athenaeum catalog
 * The Influence of the Gypsies on the Superstitions of the English folk. (1892) Boston Athenaeum catalog
 * Tobit and Jack the Giant-Killer (1898) Boston Athenaeum catalog
 * Gypsy Folk-tales (1899) Internet Archive
 * Antonio de Solario (undated) Boston Athenaeum catalog

Other non-fiction:
 * The Only Darter: a Suffolk clergyman's reminiscence Boston Athenaeum catalog
 * Two Suffolk Friends (1895) Google Books
 * Edward FitzGerald: an Aftermath (1902) Google Books
 * A Short Border History 1887 Google Books

Fiction:
 * Kriegspiel: The War Game (1896) Internet Archive

Editor:
 * Ordnance Gazetteer of Scotland: a Survey of Scottish Topography, Statistical, Biographical, and Historical
 * Lavengro (1901 edition)
 * Gypsy Lore Society Journal, Volume 1–3
 * Chamber's Biographical Dictionary (1897 edition)

title: Francis Hindes Groome


text:
Francis Grose

Francis Grose (before 11June 1731 – 12May 1791) was an English antiquary, draughtsman, and lexicographer. He produced A Classical Dictionary of the Vulgar Tongue (1785) and A Provincial Glossary, with a Collection of Local Proverbs, and Popular Superstitions (1787).

Early life
Grose was born at his father's house in Broad Street, St-Peter-le-Poer, London. His parents were Swiss immigrant and jeweller Francis Jacob Grose (d. 1769), and his wife, Anne (d. 1773), daughter of Thomas Bennett of Greenford in Middlesex. Grose was baptised on 11 June 1731 in the parish of St Peter-le-Poer.

The eldest of seven children, Grose probably received a classical education but first aimed at a career in the Army. In 1747, he was in Flanders, apparently as a volunteer in Howard's (later 19th) regiment of foot: later he received a commission as cornet in Cobham's (later 10th) regiment of dragoons. Posted to Kent on excise duties in 1750, he met and married Catherine Jordan of Canterbury. They were eventually to have ten children, six of whom survived to adulthood. Their eldest son, also called Francis Grose, was the Lieutenant Governor of New South Wales, Australia from 1792 to 1794.

Grose left the army in October 1751, possibly to avoid his regiment's posting to Scotland. In 1755, his father bought him the post of Richmond Herald but Francis showed little interest in heraldry and was to sell it again in February 1763. In 1757, Grose was elected a member of the Society of Antiquaries, and 1759 he resumed his soldiering career, this time in the militia, which meant he could avoid distant postings. He was commissioned into the Surrey Militia as lieutenant and adjutant, and it was his subsequent promotion to captain in 1765 that led to his adoption of the familiar title "Captain Grose". The Surrey militia was disembodied in 1762 but this hardly affected Grose, who continued to receive a salary as paymaster and adjutant even in peacetime. With bequests from his parents and from his wife, who died in 1774, added to the salary he drew as a militia captain, Grose at this time was able to live reasonably well despite the demands made on his purse by the need to raise, educate and provide for his children.

Books and publications

Grose had early on shown a keen interest in drawing, having attempted sketches of medieval buildings as far back as 1749, and having taken formal instruction at a drawing school in the mid-1750s. He was not a particularly gifted draughtsman but he mixed in the London artistic milieu and began to exhibit, first at the Society of Artists in 1767–8 and then at the Royal Academy. His interest was in the field of medieval remains, which were beginning to exercise an increasing grip on the public imagination. In 1772, he published the first part of The Antiquities of England and Wales, a work which he unashamedly aimed at the popular market. Essentially, it targeted those who wanted to know about antiquities but had neither time nor means to visit them in person, and contained small panoramas of medieval ruins, together with an informative text on a separate page. Sometimes the text was taken from books already published, or from information supplied by other antiquaries (both acknowledged); sometimes Grose collated material himself from which he could work up an article. From 1772 onwards, he also toured the country to visit and draw sites for inclusion in The Antiquities. The fourth and last volume came out in June 1776, and Grose almost immediately began work on a supplement.

His publishing career was interrupted however, when the Surrey militia was again called into service between 1778 and 1783. This was not a happy experience for him. Where previously Grose had been able to spend his summers visiting and sketching ancient sites, he was now obliged to attend his regiment in various training camps. He did not get on well with his new commanding officer, and he handled regimental finances in a slipshod manner. The result was that he incurred debts towards fellow officers that would take years to straighten out. The financial pressure forced him to increase both the rate and the range of his publications.

The Supplement to The Antiquities was resumed in 1783, this time with a higher proportion of the illustrations being done by other artists. Drawing on his own fieldwork, Grose also branched out into producing dictionaries, including the famous A Classical Dictionary of the Vulgar Tongue (1785) and A Provincial Glossary, with a Collection of Local Proverbs, and Popular Superstitions (1787). Though intended to amuse, they give an unusually vivid picture of the speech of the day which would not normally find inclusion in standard dictionaries, and contained, in all, about 9,000 terms which more scholarly works of the time habitually overlooked. He produced books on military antiquities and armour, as well as satirical essays, and in 1788 began the first of several tours of Scotland in order to produce The Antiquities of Scotland. It was on the second of these tours, in summer 1789, that he met and immediately formed a friendship with the poet Robert Burns. Burns met him while he was staying with Robert Riddell at the Friar's Carse, collecting material for his Scottish work. Burns suggested to him that he should include Alloway Kirk in his Scottish Antiquities, and Grose agreed on condition that Burns provided a witch tale to go with his drawing. In June 1790, Burns sent Grose a prose tale with a variant in a letter to Grose, following it up with a rhymed version, "Tam o' Shanter".

Grose was the first art critic to affirm, in his "Rules for drawing caricaturas: with an essay on comic painting" (1788), published in William Hogarth's The Analysis of Beauty (1791 edition), that aesthetic emotions emerge from a specific "cultural" environment, and that aesthetics are neither innate nor universal, but formed by their cultural context. Grose therefore has a claim to be considered as the first critical "aesthetic regionalist theorist" in proclaiming the anti-universality of aesthetics.

Death
While on an expedition to Ireland to collect antiquarian material, Grose died in Dublin at the house of Horace Hone, of an apoplectic stroke. His father had built a house, known as Richmond, in Drumcondra before his death. He was buried on 18 May 1791, at Drumcondra cemetery. His nephew Daniel and a Dr. Edward Ledwich, who had already published a book on Irish antiquities, completed the final volume of Grose's Antiquities of Ireland in 1791.

Other works
In addition to the books above mentioned, Grose wrote a Treatise on Ancient Armour and Weapons.

Additionally, it is noted that he was the (anonymous) author of Advice to the Officers of the British Army: With the addition of some Hints to the Drummer and Private Soldier, which was published in 1783 as a mocking look backwards on the conduct of the war against the American Colonies. Every instance of corruption, disregard and vice are suggested for every rank of the army. Tongue in cheek, but obviously rooted in truth, it is a great companion to Vulgar Tongue. It also contains a satirical portrait of Jeremiah Hodges, Grose's erstwhile commanding officer in the Surrey militia.

Two parodies by Thomas Bridges, A Travestie of Homer and The Battle of the Genii, were formerly erroneously attributed to Francis Grose.

List of works
A list of works ordered by original year of the publication of the first volume:

Others:
 * – volume one, volume two, volume three
 * – volume one, volume two, volume three
 * – volume one, volume two, volume three
 * – volume one, volume two, volume three
 * – volume one, volume two, volume three

References and sources

 * References

 * Sources
 * Capt John Davis, Historical Records of the Second Royal Surrey or Eleventh Regiment of Militia, London: Marcus Ward, 1877.
 * Capt John Davis, Historical Records of the Second Royal Surrey or Eleventh Regiment of Militia, London: Marcus Ward, 1877.
 * Capt John Davis, Historical Records of the Second Royal Surrey or Eleventh Regiment of Militia, London: Marcus Ward, 1877.

title: Francis Grose


text:
George Grub

George Grub (1812–1892) was a Scottish law professor and church historian.

Life
Grub was born at Old Aberdeen on 4 April 1812, the only child of George Grub, a respectable citizen and convener of the trades at Old Aberdeen, and his wife, Christian Yolum.

He entered King's College, Aberdeen, at the age of thirteen and a half, and afterwards entered the law-office of Alexander Allan, advocate in Aberdeen, under whom he served the apprenticeship required by the Society of Advocates in Aberdeen. Passing as advocate in 1836, he was in 1841 appointed librarian to the society and he held this post until his death. In 1843 he became lecturer on Scots law in Marischal College, Aberdeen, and for forty-eight years was practically the sole teacher of law in the university of Aberdeen first, as holding this lectureship; next, after the union of King's and Marischal Colleges (1860–81), as 'substitute' for Professor Patrick Davidson, who held the chair of law at King's College, but never lectured. After Davidson's death in 1881, Grub became professor of law in the University of Aberdeen. In 1856, he graduated A.M. at Aberdeen, and in 1864 he received the degree of LL.D. from his university, and on resigning the chair in 1891 he was presented by his former students and fellow-citizens with his portrait painted by Sir George Reid.

By birth an inheritor of the Scottish non-juring tradition, he was himself an accomplished theologian. He had followed with enthusiasm the whole course of the Oxford Movement; and in the congregation to which he belonged (St John's Episcopal Church, Aberdeen) he had supported his clergyman, Patrick Cheyne, throughout a prosecution in regard to eucharistic doctrine, which had weighty consequences, for it led to the charge and prosecution of the bishop of Brechin, Alexander Penrose Forbes, and the intervention of Pusey and Keble in defence of that prelate. It took some time to heal the sores occasioned by that controversy.

There was at Aberdeen in the early 1830s a group of young men, all of them Aberdeen lawyers, all of them episcopalians, and all of them earnest students of history and antiquities John Hill Burton, Joseph Robertson (1810-1866), and John Stuart (1813-1877). With these Grub associated on equal terms. Like them he contributed to the Aberdeen Magazine (1831-2), and took part in a far more important undertaking, the formation of the Spalding Club. For this club he edited (1840-2), in conjunction with Joseph Robertson, James Gordon's History of Scots Affairs, 3 vols. (1853), Thomas Innes's History of Scotland, Civil and Ecclesiastical (the Life of Thomas Innes which he contributed to this volume was reprinted in the edition of Innes's Critical Essays, published in the Historians of Scotland series), and (1869) the index volume of the Illustrations of the Antiquities of Aberdeen and Banff.

In 1861, his own work, by which he is best known, An Ecclesiastical History of Scotland from the Introduction of Christianity to the Present Time (it closes with the death of Bishop Skinner on 15 April 1857), in four volumes, was published at Edinburgh, and at once stamped him as the foremost authority on the subject in Scotland.

Clear and unaffected in style, this work is learned and exact, but it suffers somewhat from the fact that his extreme scrupulosity as to literal truth caused him to hold too severely in check the wit and liveliness which were so conspicuous and charming in his conversation. As an historian he was determined to be fair, albeit he is at no pains to conceal (what he was proud of) his enthusiastic toryism and his profound attachment to the Scottish Episcopal Church. In the preface, Grub acknowledges the help he had received from Joseph Robertson and Norval Clyne; he regrets that for the history of the Roman Catholic church after the Reformation he had not been able to obtain more accurate materials; and he says that the work had occupied him more than nine years. In spite of the more recent researches on the Celtic period of Scottish history, the book is by no means out of date; but it is unfortunate that no second edition of it was called for until Grub was too old to undertake the labour of preparing one. He had made notes for this which it is understood were lent to the Rev. W. Stephen, D.D., Dumbarton, for his History. Grub contributed to Chambers's Encyclopædia the articles Scotland and Church of Scotland; that on Scottish Literature in the earlier editions was also his, but failing health prevented him from undertaking its revision for the new edition.

To the Aberdeen Philosophical Society, he contributed the Life of Bishop Elphinstone; The Life of Bishop Burnet, and his Character as a Historian and Biographer; Dr. James Beattie and his Friends; The Antiquities of Dunkeld; Froude's History and Mary, Queen of Scots; Elgin Cathedral; Review of the Evidence as to the Complicity of Queen Mary in the Murder of Darnley; and, in concert with his lifelong friend and companion, Norval Clyne, The Ecclesiastical and Baronial Antiquities of the Cathedral of Brechin and Castle of Edzell. An unpublished paper on Henry Scougal supplied materials for the Life of that author prefixed to the latest edition of Scougal's devotional treatise, The Life of God in the Soul of Man (Aberdeen, 1892).

Family
His wife, Ann Lyall, died many years before him, leaving him two sons, the Rev. George Grub, provost of St Ninian's Cathedral, Perth, and the Rev. Charles Grub, rector of St Mary's, Montrose.

Works
His Ecclesiastical History of Scotland (1861), written from the standpoint of an Episcopalian, is dry, but concise, clear, fair-minded, and trustworthy. Grub also edited (along with Joseph Robertson) Gordon's Scots Affairs for the Spalding Club, of which he was one of the founders.

title: George Grub


text:
Talk:Second-rate

First paragraph is navigational aid
Please do not remove the first paragraph as it functions as a quick navigational aid to the other articles in this series. Thank you. Petersam 03:51, 18 Oct 2004 (UTC)

While the main thrust of this article is fine, its current wording relates primarily to Second Rates of the Nelsonic Era. To avoid misleading readers, you need to explain that - like most types - the Second Rates had grown in size and firepower since the early 17th century. Early Second Rates were a lot smaller than 2,000 tons and carried fewer than 90 or 98 guns. Rif Winfield 14:50, 3 September 2007 (UTC)

explanation
I placed a cn on the claim that second rate, to refer to something inferior, derives from the RN rating system. I suspect this is a retronym. Even if it is not a retronym, we need a reference for this claim. Geo Swan (talk) 03:29, 30 March 2009 (UTC)

Capitalisation
It has become apparent that the words "first rate", "second rate", etc have become capitalised over the last year or so. This seems to me to directly contradict the guidance at Manual of Style (capital letters), and I have changed them back again. To clarify, if we were talking about frigates, we would use lower case, because it's not a proper noun; "first rate" is exactly analogous. The usage on Category:Set indices on ships follows the lower case usage almost exclusively, as far as I can tell. Please address any concerns here before making wholesale changes back again.

On another note, some of the hyphenation has been rather patchy. Adjectival use will require a hyphen (first-rate ship) but when used as a noun (first rate), it does not. Again, I've made the changes were I've spotted the need.

Apologies if I've missed any or introduced any errors, since we all err from time to time. Shem (talk) 22:31, 14 June 2010 (UTC)

French equivalent of the British rating system
I note that the reference 2e rang appears at the foot of this article. The French rating system did not correspond precisely with the British one; in fact, the French "Deuxième Rang" corresponded better to the British Third Rate (not exactly, but better than to the Second Rate). Roughly speaking (there were exceptions) the French "Premiere Rang" equated to both the First Rate and Second Rate in the British Navy, although by Napoleonic times there were in effect no French equivalents to the British Second Rate, as the French Navy was building nothing between their 118-gun three-deckers and their 80-gun two-deckers. Rif Winfield (talk) 21:50, 16 June 2010 (UTC)

Crew of 750?
This seems implausible. I suspect a zero was added there. - Smerdis of Tlön - killing the human spirit since 2003! 14:12, 21 October 2011 (UTC)
 * No, that's entirely right. With 84 to 90 guns, and a gun crew of 10 or so (even with the requirement to fight only one side), plus sail trimmers, carpenters, helmsmen, marines, officers, and all the rest, the figure is spot on. In fact, you can't even sail a 2,000 square rigger with 75 crew, let alone fight it.  Shem (talk) 17:39, 21 October 2011 (UTC)
 * I guess I'm finding it difficult to imagine such a host on a ship that would barely be 250 feet long by 60 wide, or how provisions and drinking water were stored on board for months long periods at sea. Were some people crew who were not at sea with the ship? - Smerdis of Tlön - killing the human spirit since 2003! 05:01, 22 October 2011 (UTC)
 * No, they were packed in like sardines. You can see now why the Royal Navy needed to press gang men to serve their vast manpower needs.  The sailors slept in hammocks on the gun deck (of which there were two in a second rate), with 18 inches per man.  At sea, when one (of two) watches were on deck, that became more comfortable, but in harbour, you can imagine the stink and the squeeze.  The provisions were stored in barrels in capricious holds (see the cutaway model half way down this page) and the very procurement of these vast stores (as well as the timber, sails & rigging) was one of the factors that caused the modern bureaucracy of state to come into being. Hard to imagine these days, but actually not so different from a small conventional submarine on a long patrol today, in many ways.  Shem (talk) 08:53, 22 October 2011 (UTC)

title: Talk:Second-rate


text:
Charlotte Guest

Charlotte Guest may refer to:
 * Lady Charlotte Guest (1812–1895), English aristocrat and businesswoman
 * Charlie Guest (born 1993), British alpine skier

title: Charlotte Guest


text:
Puddle Dive

Puddle Dive is the fourth studio album by American singer-songwriter Ani DiFranco, released in 1993.

Personnel

 * Ani DiFranco – acoustic guitar, steel guitar, vocals
 * Scot Fisher – accordion
 * Scott Freilich – bass
 * Rory McLeod – harmonica
 * Alex Meyer – whistle, cuíca
 * Ann Rabson – piano
 * Mary Ramsey – violin
 * Andy Stochansky – percussion, drums, marimba, triangle, steel drums, djembe, shaker, backing vocals

Production

 * Ani DiFranco – record producer
 * Dale Anderson – producer
 * Ed Stone – engineer, producer

title: Puddle Dive


text:
Talk:Third-rate

First paragraph is navigational aid
Please do not remove the first paragraph as it functions as a quick navigational aid to the other articles in this series. Thank you. Petersam 03:52, 18 Oct 2004 (UTC)

While I have not removed this paragraph, I have severely modified it to correct the large amount of misinformation that the article contained. Rif Winfield (talk) 18:13, 18 June 2009 (UTC)

Capitalisation
It has become apparent that the words "first rate", "second rate", etc have become capitalised over the last year or so. This seems to me to directly contradict the guidance at Manual of Style (capital letters), and I have changed them back again. To clarify, if we were talking about frigates, we would use lower case, because it's not a proper noun; "first rate" is exactly analogous. The usage on Category:Set indices on ships follows the lower case usage almost exclusively, as far as I can tell. Please address any concerns here before making wholesale changes back again.

On another note, some of the hyphenation has been rather patchy. Adjectival use will require a hyphen (first-rate ship) but when used as a noun (first rate), it does not. Again, I've made the changes were I've spotted the need.

Apologies if I've missed any or introduced any errors, since we all err from time to time. Shem (talk) 22:31, 14 June 2010 (UTC)

Why the hyphen?
It's a compound noun, right? Not a compound adjective. The hyphen needs to come out of the title (to match its absence in the main text). OR make it "Third-rate ship", or "Third-rate ship (British Navy)", if that pleases. We must be aware of the likely wrong meaning most readers will attach to "third-rate/third rate", too. I don't know how to get around that. Tony  (talk)  08:23, 21 January 2017 (UTC)

title: Talk:Third-rate


text:
Foz do Iguaçu

Foz do Iguaçu (Iguazu River Mouth) is the Brazilian city on the border of Iguaçu Falls. The city is the 7th largest in the state of Paraná. The city's population is approximately 258,000. It is approximately 650 km (400 mi) west of the capital of the state, Curitiba, being the westernmost city in that state.

The inhabitants of the city are known as iguaçuenses. The Iguaçu Falls located on the border of Argentina and Brazil and consisting of approximately 257 individual waterfalls over 2.7 km were chosen as one of the "New Natural Seven Wonders of the World."

The city is characterized by tourism and cultural diversity. There are about 80 nationalities, being the most representative from Italy, Portugal, Lebanon, China, Paraguay and Argentina. Foz do Iguaçu is integrated into a tri-national region, bordering the Argentine city of Puerto Iguazú and the Paraguayan city of Ciudad del Este. The city's economy is based on tourism, with emphasis on trade and services.

According to research conducted by the Brazilian Tourist Institute (Embratur) and the Foundation Institute of Economic Research (FIFE) in 2006, 2007 and 2008, Foz do Iguaçu was the 2nd most visited leisure destination by foreign tourists after Rio de Janeiro. In 2010, it received from the Brazilian Ministry of Tourism 10 awards for Best Practices and Competitiveness Index. Foz do Iguaçu has been noted as a destination by various national and international media: the British newspaper The Guardian considered it the best foreign destination for the UK. The U.S. TV network CNN classified it as one of the 14 most romantic destinations.

Foz do Iguaçu is home of the Itaipu dam, the world's second largest hydroelectric plant in power generation, after the Three Gorges Dam in China. With 20 generator units and 14,000 MW of installed capacity, it provides approximately 15% of the energy consumed in Brazil and 86% of the energy consumed in Paraguay. The city has a low crime rate by Brazilian standards.

Climate
The climate of Foz do Iguaçu is humid subtropical, with two distinctive seasons; one humid and hot in the summer and another, dry and cold, in the winter. The city's annual average temperature is 23.8 °C (74.8 °F), but can be as high as 40 °C (104 °F) in the summer (highest) or as low as -5 °C (23 °F) in the winter (lowest). The average in the summer is 26.5 °C (79.7 °F)and in the winter 15.4 °C (59.6 °F).

The climate of the city is hot or warm throughout the year, due to the relatively low altitude (standing only 173 m, 567 ft, above sea level).

Generally, the city is sunny during the year, but rain is fairly common during the spring and in the summer. The weather of the city, however, changes very constantly, because the region where the city stands is the zone where frequently three fronts meet. As consequence, it is not uncommon to see temperatures as high as 35 °C (95 °F) and in the summer as low as 8 °C (46 °F) in the city and frequent thunderstorms.

History
In 1549, a Spanish explorer, Cabeza de Vaca, found the falls while travelling down the river. Very impressed, he named them "Quedas de Santa Maria". Later the name changed to Quedas del Iguazu; which was derived from the native name of the local Guarani Indians.

Until 1860, it was under the disputed territory between Brazil and Paraguay, but given the latter's defeat in the Paraguayan War, the falls were recognized as part of the Brazilian territory.

In 1910, the colony's status was upgraded to the position of "vila" (town or village), named "Vila Iguazu", and, in 1914, to city. At that time, the city was known as Foz do Iguassu. In 1916, Alberto Santos-Dumont visited the region and, impressed with the beauty of the region, suggested more attention of the government to the area and asked for the appropriation of the land where currently is the Parque do Iguaçu (Iguaçu Park). Until 1917, this region had an owner, Jezus Val. The state appropriated the land in the next year, and, in 1939, the Parque Nacional do Iguaçu ("Iguaçu National Park") was created.

In 1945, an agreement between the Brazilian Academy of Letters and the Academy of Lisbon changed the city name to Foz do Iguaçu. The city experienced a big economical boom in the 1960s to the late 1980s, first with the construction of the Friendship Bridge, concluded in 1965, and the Itaipu Dam, in operation since in 1984. On 19 October 2005, a proposal was made to adjust the city name to Foz do Iguassu. The proposal was approved in a first debate and then rejected in a second debate, at the Town Hall (Câmara Municipal), by four votes for and eight against. The bill was initiated by city councillor Djalma Pastorello, of the PSDB.

The purpose of the adjustment to the city name was to return the spelling to the original form, as at the foundation of the city in 1914. The change occurred due language reforms of 1945, which changed the orthography of Brazilian Portuguese. However, existing proper names were not obliged to change. Another reason for the proposed adjustment back to the original was that 146 of the 198 member countries of the United Nations do not have the "ç" character in their alphabets.

The adjustment would therefore rationalise any search for the city in search engines, since Foz do Iguaçu's is more widely known for the falls, which are known as the Iguassu Falls. Djalma Pastorello felt that tourism to the city of Foz do Iguaçu would be improved greatly by a clarification of its association with the now-famous Iguassu Falls. However, he estimated that 70% of the city's population were against the name change because the local media anticipated the change and presented it in a distorted way, so that locals were unable to see that the intention was to benefit the population.

Literature
The region that today is part of Foz do Iguaçu, is described by Álvar Núñez Cabeza de Vaca in his diary that narrates the very experience at the beginning of the European colonization in the Americas. In contemporary literature one of the city's neighborhoods appears in a subjective way in the work of the writer Leonid R. Bózio, who reports in the book Tempos Sombrios, from the series Autofagia, local mysticism through the figure of Pombero, creature of the Guarani Mythology.

Demographics
The city has a population of approximately 265,000, whilst the Tríplice Fronteira (Tri Frontier) region (Ciudad del Este, Hernandarias, Puerto Iguazú and the rural areas included within those municipalities) has a population of 820,000. The city's population is heterogeneous, with many immigrant communities, such as: Arabs, Chinese, Germans, Italians, Paraguayans, Argentines, French, Swedes, Portuguese and Ukrainians.

The residents are predominantly Roman Catholic but there is a relatively large minority of Muslims and Buddhists. The city has a large mosque and a Buddhist temple.

Fenartec is an annual event held in May to commemorate the city's multicultural diversity.

Source: Paranaense Institute for Economic and Social Development (2014)

Arab influence
Since 1940, Lebanese and other Arabs have settled in the southwestern city of Foz do Iguaçu, in the "Triple Border" area where Paraguay, Argentina and Brazil converge in a region of loosely controlled borders.

People of Lebanese heritage constitute around 90% of the population from Middle East in the city, with others from Egypt, Iraq, Jordan, Kuwait, Syria and Palestine.

Transportation
Foz do Iguaçu is connected to the east by the BR-277, to Paranaguá, and to the west by the Friendship Bridge to Ciudad del Este, and to the south to Puerto Iguazú by the Fraternity Bridge. Both the BR-277 and the Friendship Bridge are very busy roads, linking Paraguay to the Paranaguá's seaport.

The city is served by the Foz do Iguaçu/Cataratas International Airport.

Public transport
The city does not operate its own municipal transport networks, but instead licenses four private bus companies to operate services on its behalf. The bus fares are set by the municipality for all four companies. In 2003, the city initiated an integrated city fare and created a hub near the city centre.

Now, most of the bus routes pass through this hub and passengers pay a standard fare within the city zone, which enables them to transfer routes, even when these may be operated by another company.

The transport network extends to certain distant areas, such as the city's airport and the Iguazu Park, but not between the city and its neighbor Ciudad del Este, nor with Puerto Iguazú, which are serviced by other companies. These routes are not part of the integrated network, a situation reflected by higher fares.

Avenida Brasil (Brazil Avenue)
Since Foz do Iguaçu's foundation, Brazil Avenue is the city's main road. While during its early years the street was primarily the military headquarters' location (now they are just in the right beginning of the Avenue), nowadays the street is a very active place where many retail stores are located. It is located at the downtown of the city and it is 5 km (3 mi) long (of which 3 km, 2 mi, is arterial road).

As of 2004, the prefecture of the city decided that a major revitalization of "Avenida Brasil" (Brazil Avenue) was needed. Attracting many consumers from many different areas of the city and even from its neighbours Ciudad del Este and Puerto Iguazú, the avenue, wide enough only to support two cars side-by-side, is frequently used during business days, and even more in important holidays (Christmas, Children's day, Easter, Mother's day), with many cars competing for a parking space.

The revitalization proposals asks for removal of parking space, giving major attention to pedestrians. Also, the avenue would be wide enough only to support one car side by side. The project started at the end of 2004, and by 2006 was completed. The avenue does not have a bus route, by municipal order.

Education
The city has a literacy rate of 95.5%, with most children attending public or private schools. Public education has been a priority of the municipality of the city and the government of the state of Paraná; however, most middle and upper-class families continue to send their children to elite private schools.

The city has approximately 30 private schools and approximately 120 public schools (including daycare and kindergarten schools). In addition, there are 7 universities:
 * Cesufoz;
 * UDC;
 * Uniamérica;
 * Unifoz;
 * Unioeste;
 * Anglo-Americano Faculdades;
 * IFPR (Technical Institute).

In January 2010, the Universidade Federal da Integração Latino-Americana (UNILA) was founded.

Tourism
The city is one of Brazil's most-frequented tourist destinations. Most tourists are Brazilians and Argentines. The city has about 100 hotels and inns. Its main attractions are:

 * Iguaçu Falls, which has a flow capacity equal to three times that of Niagara Falls. Part of the falls are on the Brazilian side. Others are on the Argentine side. "Devil's Throat" ("Garganta do Diabo" in Portuguese) is the tallest of the falls, which is 97 m (318 ft) high;
 * Parque Nacional do Iguaçu (Iguaçu National Park), in both Brazil and Argentina, where the falls are. It is protected by the IBAMA;
 * Itaipu Dam, the first-largest generator of hydro-electric power in the world, in the Parana river, between Brazil and Paraguay;
 * The Tríplice Fronteira (Triple Frontier) location where Brazil, Argentina and Paraguay meet. Each side has its own Marco (landmark);
 * The Omar Ibn Al-Khattab mosque, the largest in Latin America;
 * The Bird Park (Parque das Aves), which features a collection of wild birds, and the "Bosque Guaraní" the city's zoo.

Consular representations
Argentina and Paraguay have Consulates in Foz do Iguaçu.

Sports
Foz do Iguaçu hosted an edition of the Summer X Games in 2013.

Notable people

 * Pepê, football player
 * Fabiano Beltrame, football player

title: Foz do Iguaçu


text:
Talk:Fourth-rate

Grammar
I fixed a lot of the appalling spelling and punctuation, but more needs doing. Quite disgraceful.

First paragraph is navigational aid
Please do not remove the first paragraph as it functions as a quick navigational aid to the other articles in this series. Thank you. Petersam 03:53, 18 Oct 2004 (UTC)

puns
I love the pun in the external links section. So very Jack Aubrey...
 * Heh, it didn't even occur to me when writing it, must have been subconscious prankster at work! Stan 04:47, 14 February 2006 (UTC)
 * It is indeed amusing. =) 152.23.196.162 07:02, 9 March 2007 (UTC)

Good Article!
Really good article! Well done to everyone who worked on it. DangerousNerd talk  00:27, 16 June 2007 (UTC)

Capacity?
Unlike the articles on the 3rd, 5th and 6th rates for example, there is no mention here about the capacity in terms of number of men the 4th rates carried. Can anybody find out?

Capitalisation
It has become apparent that the words "first rate", "second rate", etc have become capitalised over the last year or so. This seems to me to directly contradict the guidance at Manual of Style (capital letters), and I have changed them back again. To clarify, if we were talking about frigates, we would use lower case, because it's not a proper noun; "first rate" is exactly analogous. The usage on Category:Set indices on ships follows the lower case usage almost exclusively, as far as I can tell. Please address any concerns here before making wholesale changes back again.

On another note, some of the hyphenation has been rather patchy. Adjectival use will require a hyphen (first-rate ship) but when used as a noun (first rate), it does not. Again, I've made the changes were I've spotted the need.

Apologies if I've missed any or introduced any errors, since we all err from time to time. Shem (talk) 22:29, 14 June 2010 (UTC)

Not a ship of the line
In the easy navigation part at the end of the page, 4th rank ships are under the title "Ships of the line" even though they were not suitable to be one. By renaming the title "Frigates" to "Warships/Frigates", one could replace it over that section. — Preceding unsigned comment added by 176.54.243.153 (talk) 16:31, 14 July 2020 (UTC)

title: Talk:Fourth-rate


text:
Mile End Stadium

Mile End Stadium, also known as the East London Stadium, is a multi-sports stadium in Mile End and situated in the park of the same name, east London, England. The stadium comprises an athletics stadium and a number of floodlit Astroturf football pitches, tennis and netball courts.

The new sports complex with a 25m swimming pool was refurbished in 2019.

The stadium is home to Sporting Bengal United F.C. and Tower Hamlets F.C. of the Eastern Counties Football League, and was formerly home to Leyton Orient Women of the FA Women's National League from 2004 to 2021.

It hosted a concert by Britpop band Blur on 17 June 1995, where 27,000 fans saw the band supported by The Boo Radleys, Sparks, John Shuttleworth, Dodgy and Cardiacs.

Transport
Mile End Stadium is served by London Buses Routes 277, 309, 323, D6, D7 and Night Route N277, and nearby Mile End is served by routes 25, 205, 339, 425 and Night Routes N25 and N205.

To the north, Mile End tube station is located nearby across Mile End Park for Central line, District line and Hammersmith & City line services. To the south, the stadium is a short walk from Limehouse DLR station for Docklands Light Railway and c2c services.

Cycle Superhighway CS2 passes close by on Mile End Road.

The Regent's Canal passes close by, and offers access to walk or cycle on the towpath. Victoria Park, Globe Town and Limehouse Basin can be reached easily from here via the towpath.

title: Mile End Stadium


text:
Talk:Fifth-rate

First paragraph is navigational aid
Please do not remove the first paragraph as it functions as a quick navigational aid to the other articles in this series. Thank you. Petersam 03:53, 18 Oct 2004 (UTC)
 * Why not make a template to do that? Loganberry (Talk) 03:54, 15 September 2005 (UTC)

add image
I replaced the image of the USS Essex with a contemporary picture of the HMS Trincomalee. Unfortunately, while it is a higher resolution, it isn't a side view. However the USN didn't use the same rating system as the RN, so the illustration should be an RN vessel, not a USN vessel.

We have a second image of the HMS Trincomalee, File:HMS Trincomalee.jpg.

Cheers! Geo Swan (talk) 02:14, 22 March 2009 (UTC)

Capitalisation
It has become apparent that the words "first rate", "second rate", etc have become capitalised over the last year or so. This seems to me to directly contradict the guidance at Manual of Style (capital letters), and I have changed them back again. To clarify, if we were talking about frigates, we would use lower case, because it's not a proper noun; "first rate" is exactly analogous. The usage on Category:Set indices on ships follows the lower case usage almost exclusively, as far as I can tell. Please address any concerns here before making wholesale changes back again.

On another note, some of the hyphenation has been rather patchy. Adjectival use will require a hyphen (first-rate ship) but when used as a noun (first rate), it does not. Again, I've made the changes were I've spotted the need.

Apologies if I've missed any or introduced any errors, since we all err from time to time. Shem (talk) 22:31, 14 June 2010 (UTC)

 * It seems like, with this reasoning (which I agree with), the article title should be "fifth rate", without a hyphen, as it's not adjectival; it's a noun. Ditto for the other five articles. Regardless, eight-plus years later, the hyphenation is still patchy in each of these articles, and I would personally prefer standardization and consistency of one or the other. 100.40.6.4 (talk) 19:19, 23 November 2018 (UTC)

title: Talk:Fifth-rate