text:
GB 18030

GB 18030 is a Chinese government standard, described as Information Technology — Chinese coded character set and defines the required language and character support necessary for software in China. GB18030 is the registered Internet name for the official character set of the People's Republic of China (PRC) superseding GB2312. As a Unicode Transformation Format (i.e. an encoding of all Unicode code points), GB18030 supports both simplified and traditional Chinese characters. It is also compatible with legacy encodings including GB/T 2312, CP936, and GBK 1.0.

The Unicode Consortium has warned implementers that the latest version of this Chinese standard, GB 18030-2022, introduces what they describe as "disruptive changes" from the previous version GB 18030-2005 "involving 33 different characters and 55 code positions". GB 18030-2022 was enforced from 1 August 2023. It has been implemented in ICU 73.2; and in Java 21, and backported to older Java 8, 11, 17 (LTS releases) and 20.0.2.

In addition to the encoding method, this standard contains requirements about which additional scripts and languages should be represented, and to whom this standard is applicable. This standard however does not define the official character forms for the Chinese characters; this is standardised in Table of General Standard Chinese Characters.

History
The GB18030 character set is formally called "Chinese National Standard GB 18030-2005: Information Technology—Chinese coded character set". GB abbreviates Guójiā Biāozhǔn (国家标准), which means national standard in Chinese. The standard was published by the China Standard Press, Beijing, 8 November 2005. Only a portion of the standard is mandatory. Since 1 May 2006, support for the mandatory subset is officially required for all software products sold in the PRC.

An older version of the standard, known as "Chinese National Standard GB 18030-2000: Information Technology—Chinese ideograms coded character set for information interchange—Extension for the basic set", was published on March 17, 2000. The encoding scheme stays the same in the new version, and the only difference in GB-to-Unicode mapping is that GB 18030-2000 mapped the character A8 BC (ḿ) to a private use code point U+E7C7, and character 81 35 F4 37 (without specifying any glyph) to U+1E3F (ḿ), whereas GB 18030-2005 swaps these two mapping assignments. More code points are now associated with characters due to update of Unicode, especially the appearance of CJK Unified Ideographs Extension B. Some characters used by ethnic minorities in China, such as Mongolian characters and Tibetan characters (GB 16959-1997 and GB/T 20542-2006), have been added as well, which accounts for the renaming of the standard.

Compared with its ancestors, GB 18030's mapping to Unicode has been modified for the 81 characters that were provisionally assigned a Unicode Private Use Area code point (U+E000–F8FF) in GBK 1.0 and that have later been encoded in Unicode. This is specified in Appendix E of GB 18030. There are 24 characters in GB 18030-2005 that are still mapped to Unicode PUA.

In the GB 18030-2022 update, the requirements for characters to be mapped to PUA has been lifted completely and all characters should be mapped to their standard Unicode codepoints. Of these, 18 mappings were updated by position-swapping similar to what happened between GBK and GB 18030. The remaining six kept the two-byte PUA mappings, so that a change to the 4-byte sequence is needed to follow the non-PUA preference.

As a national standard
The first version of GB 18030, designated GB 18030-2000 Information Technology—Chinese coded character set for information interchange — Extension for the basic set, consists of 1-byte and 2-byte encodings, together with 4-byte encoding for CJK Unified Ideographs Extension A matching those in Unicode 3.0. The corresponding Unicode code points of this subset, including provisional private assignments, lie entirely in the BMP. These parts are fully mandatory in GB 18030-2000. Most major computer companies had already standardized on some version of Unicode as the primary format for use in their binary formats and OS calls. However, they mostly had only supported code points in the BMP originally defined in Unicode 1.0, which supported only 65,536 codepoints and was often encoded in 16 bits as UCS-2. This standard is basically an extension based on GBK with additional characters in CJK Unified Ideographs Extension A.

The second version designated GB 18030-2005 Information Technology—Chinese coded character set has the same mandatory subset as GB 18030-2000 of 1-, 2- and 4-byte encodings. This version also includes the full CJK Unified Ideographs Extension B in the 4-byte encoding section which is outside the BMP as a suggestion support requirement. However, as the inclusion of CJK Unified Ideographs Extension B in a 4-byte region is required to be maintained during information processing, software can no longer get away with treating characters as 16-bit fixed width entities (UCS-2). Therefore, they must either process the data as a variable-width format (as with UTF-8 or UTF-16), which is the most common choice, or move to a larger fixed-width format (i.e. UTF-32). Microsoft made the change from UCS-2 to UTF-16 with Windows 2000. This version matches with Unicode 3.1, and also provided support for Hangul (Korean), Mongolian (including Manchu, Clear script, Sibe hergen, Galik), Tai Nuea, Tibetan, Uyghur/Kazakh/Kyrgyz and Yi.

The third and latest version, GB 18030-2022 Information Technology—Chinese coded character set, mandates the suggestion support part of CJK Unified Ideographs Extension B in GB 18030-2005, along with updates up to Unicode 11.0 including Kangxi Radicals and CJK Unified Ideographs Extension C, D, E and F. Additional languages are also recognized by GB 18030-2022 such as part of Arabic, Tai Le, New Tai Lue, Tai Tham, Lisu, and Miao. GB 18030-2022 also introduces three implementation levels, with the requirement of "all products using this standard should implements Implementation Level 1" that includes 66 new BMP characters in the 4-byte encoding region that were added between Unicode 3.1 and Unicode 11.0. Implementation Level 2 requires the support of Table of General Standard Chinese Characters, and Implementation Level 3 requires all other specified regions in the standard.

Mapping
GB 18030 defines a one (ASCII), two (extended GBK), or four-byte (UTF) encoding. The two-byte codes are defined in a lookup table, while the four-byte codes are defined sequentially (hence algorithmically) to fill otherwise unencoded parts in UCS. GB 18030 inherits the bad aspects of GBK, most notably needing special code to safely find ASCII characters in a GB18030 sequence.

The one- and two-byte code points are essentially GBK with the euro sign, PUA mappings for unassigned/user-defined points, and vertical punctuations. The four byte scheme can be thought of as consisting of two units, each of two bytes. Each unit has a similar format to a GBK two byte character but with a range of values for the second byte of 0x30–0x39 (the ASCII codes for decimal digits). The first byte has the range 0x81 to 0xFE, as before. This means that a string-search routine that is safe for GBK should also be reasonably safe for GB18030 (in much the same way that a basic byte-oriented search routine is reasonably safe for EUC).

This gives a total of 1,587,600 (126×10×126×10) possible 4 byte sequences, which is easily sufficient to cover Unicode's 1,112,064 (17×65536 − 2048 surrogates) assigned, reserved, and noncharacter code points.

Unfortunately, to further complicate matters there are no simple rules to translate between a 4 byte sequence and its corresponding code point. Instead, codes are allocated sequentially (with the first byte containing the most significant part and the last the least significant part) only to Unicode code points that are not mapped in any other manner. For example:

U+00DE (Þ) → 81 30 89 37 U+00DF (ß) → 81 30 89 38 U+00E0 (à) → A8 A4 U+00E1 (á) → A8 A2 U+00E2 (â) → 81 30 89 39 U+00E3 (ã) → 81 30 8A 30

An offset table is used in the WHATWG and W3C version of GB 18030 to efficiently translate code points. ICU and glibc use similar range definitions to avoid wasting space on large sequential blocks.

Encoding
GB18030 has been supported on Windows since the release of Windows 95, as code page 54936. Windows 2000 and XP offer a GB18030 Support Package. The open source PostgreSQL database supports GB18030 through its full support for UTF-8, i.e. by converting it to and from UTF-8. Similarly Microsoft SQL Server supports GB18030 by conversion to and from UTF-16.

More specifically, supporting the GB18030 encoding on Windows means that Code Page 54936 is supported by  and. Due to the backward compatibility of the mapping, many files in GB18030 can be actually opened successfully as the legacy Code Page 936, that is GBK, even if the Code Page 54936 is not supported. However, that is only true if the file in question contains only GBK characters. Loading will fail or cause corrupted result if the file contains characters that do not exist in GBK (see § Technical details for examples).

GNU glibc's gconv, the character codec library used on most Linux distributions, supports GB 18030-2000 since 2.2, and GB 18030-2005 since 2.14; glibc notably includes non-PUA mappings for GB 18030-2005 in order to achieve round-trip conversion. GNU libiconv, an alternative iconv implementation frequently used on non-glibc UNIX-like environments like Cygwin, supports GB 18030 since version 1.4.

As of 2022, "supporting non-Chinese scripts continues to be optional" (presumably for display/font support only; and in China, since the encoding is a full UTF). The standard is known to support English/ASCII and the "following non-Chinese scripts are recognized by GB 18030-2022: Arabic, Tibetan, Mongolian, Tai Le, New Tai Lue, Tai Tham, Yi, Lisu, Hangul (Korean), and Miao."

Fonts
The GB18030 Support Package for Windows contains SimSun18030.ttc, a TrueType font collection file which combines two Chinese fonts, SimSun-18030 and NSimSun-18030. The SimSun 18030 font includes all the characters in Unicode 2.1 plus new characters found in the Unicode CJK Unified Ideographs Extension A block although, despite its name, it does not contain glyphs for all characters encoded by GB 18030, as all (about a million) Unicode code points up to U+10FFFF can be encoded as GB 18030. GB 18030 compliance certification only requires correct handling and recognition of glyphs in the mandatory (two-byte, and CJK Ext. A) Chinese part. Nevertheless, the requirement of PUA characters in the standard have hampered this implementation.

Microsoft YaHei and DengXian provided by Microsoft are updated in 2023 to match GB 18030-2022 implementation level 2, and SimSun is updated to match implementation level 3.

Source Han Sans (and its counterpart Noto Sans CJK) are already compliant with GB 18030-2022 implementation level 2 when the standard update for GB 18030 is announced. Source Han Serif (and its counterpart Noto Serif CJK) however is not compliant at the time, and an update is provided to ensure the font is compliant to implementation level 2. Similarly Microsoft YaHei and PingFang (Apple) require a small number of URO additions that are associated with implementation level 1 in order to become compliant with GB 18030-2022 implementation level 2.

Other CJK font families like HAN NOM and Hanazono Mincho provide wider coverage for Unicode CJK Extension blocks than SimSun-18030 or even SimSun (Founder Extended), but they don't support all code points defined in GB 18030.

title: GB 18030


text:
Union type

In computer science, a union is a value that may have any of several representations or formats within the same position in memory; that consists of a variable that may hold such a data structure. Some programming languages support special data types, called union types, to describe such values and variables. In other words, a union type definition will specify which of a number of permitted primitive types may be stored in its instances, e.g., "float or long integer". In contrast with a record (or structure), which could be defined to contain both a float and an integer; in a union, there is only one value at any given time.

A union can be pictured as a chunk of memory that is used to store variables of different data types. Once a new value is assigned to a field, the existing data is overwritten with the new data. The memory area storing the value has no intrinsic type (other than just bytes or words of memory), but the value can be treated as one of several abstract data types, having the type of the value that was last written to the memory area.

In type theory, a union has a sum type; this corresponds to disjoint union in mathematics.

Depending on the language and type, a union value may be used in some operations, such as assignment and comparison for equality, without knowing its specific type. Other operations may require that knowledge, either by some external information, or by the use of a tagged union.

Untagged unions
Because of the limitations of their use, untagged unions are generally only provided in untyped languages or in a type-unsafe way (as in C). They have the advantage over simple tagged unions of not requiring space to store a data type tag.

The name "union" stems from the type's formal definition. If a type is considered as the set of all values that that type can take on, a union type is simply the mathematical union of its constituting types, since it can take on any value any of its fields can. Also, because a mathematical union discards duplicates, if more than one field of the union can take on a single common value, it is impossible to tell from the value alone which field was last written.

However, one useful programming function of unions is to map smaller data elements to larger ones for easier manipulation. A data structure consisting, for example, of 4 bytes and a 32-bit integer, can form a union with an unsigned 64-bit integer, and thus be more readily accessed for purposes of comparison etc.

ALGOL 68
ALGOL 68 has tagged unions, and uses a case clause to distinguish and extract the constituent type at runtime. A union containing another union is treated as the set of all its constituent possibilities, and if the context requires it a union is automatically coerced into the wider union. A union can explicitly contain no value, which can be distinguished at runtime. An example is:

mode node = union (real, int, string, void); node n := "abc"; case n in (real r):  print(("real:", r)), (int i):   print(("int:", i)), (string s): print(("string:", s)), (void):    print(("void:", "EMPTY")), out        print(("?:", n)) esac

The syntax of the C/C++ union type and the notion of casts was derived from ALGOL 68, though in an untagged form.

C/C++
In C and C++, untagged unions are expressed nearly exactly like structures (structs), except that each data member begins at the same location in memory. The data members, as in structures, need not be primitive values, and in fact may be structures or even other unions. C++ (since C++11) also allows for a data member to be any type that has a full-fledged constructor/destructor and/or copy constructor, or a non-trivial copy assignment operator. For example, it is possible to have the standard C++ string as a member of a union.

The primary use of a union is allowing access to a common location by different data types, for example hardware input/output access, bitfield and word sharing, or type punning. Unions can also provide low-level polymorphism. However, there is no checking of types, so it is up to the programmer to be sure that the proper fields are accessed in different contexts. The relevant field of a union variable is typically determined by the state of other variables, possibly in an enclosing struct.

One common C programming idiom uses unions to perform what C++ calls a, by assigning to one field of a union and reading from another, as is done in code which depends on the raw representation of the values. A practical example is the method of computing square roots using the IEEE representation. This is not, however, a safe use of unions in general.

"Structure and union specifiers have the same form. [ . . . ] The size of a union is sufficient to contain the largest of its members. The value of at most one of the members can be stored in a union object at any time. A pointer to a union object, suitably converted, points to each of its members (or if a member is a bit-field, then to the unit in which it resides), and vice versa."

Anonymous union
In C++, C11, and as a non-standard extension in many compilers, unions can also be anonymous. Their data members do not need to be referenced, are instead accessed directly. They have some restrictions as opposed to traditional unions: in C11, they must be a member of another structure or union, and in C++, they can not have methods or access specifiers.

Simply omitting the class-name portion of the syntax does not make a union an anonymous union. For a union to qualify as an anonymous union, the declaration must not declare an object. Example:

Anonymous unions are also useful in C  definitions to provide a sense of namespacing.

Transparent union
In compilers such as GCC, Clang, and IBM XL C for AIX, a transparent_union attribute is available for union types. Types contained in the union can be converted transparently to the union type itself in a function call, provided that all types have the same size. It is mainly intended for function with multiple parameter interfaces, a use necessitated by early Unix extensions and later re-standarisation.

COBOL
In COBOL, union data items are defined in two ways. The first uses the RENAMES (66 level) keyword, which effectively maps a second alphanumeric data item on top of the same memory location as a preceding data item. In the example code below, data item PERSON-REC is defined as a group containing another group and a numeric data item. PERSON-DATA is defined as an alphanumeric data item that renames PERSON-REC, treating the data bytes continued within it as character data.

The second way to define a union type is by using the REDEFINES keyword. In the example code below, data item VERS-NUM is defined as a 2-byte binary integer containing a version number. A second data item VERS-BYTES is defined as a two-character alphanumeric variable. Since the second item is redefined over the first item, the two items share the same address in memory, and therefore share the same underlying data bytes. The first item interprets the two data bytes as a binary value, while the second item interprets the bytes as character values.

Pascal
In Pascal, there are two ways to create unions. One is the standard way through a variant record. The second is a nonstandard means of declaring a variable as absolute, meaning it is placed at the same memory location as another variable or at an absolute address. While all Pascal compilers support variant records, only some support absolute variables.

For the purposes of this example, the following are all integer types: a byte consists of 8 bits, a word is 16 bits, and an integer  is 32 bits.

The following example shows the non-standard absolute form: In the first example, each of the elements of the array B maps to one of the specific bytes of the variable A. In the second example, the variable C is assigned to the exact machine address 0.

In the following example, a record has variants, some of which share the same location as others:

PL/I
In PL/I the original term for a union was cell, which is still accepted as a synonym for union by several compilers. The union declaration is similar to the structure definition, where elements at the same level within the union declaration occupy the same storage. Elements of the union can be any data type, including structures and array. Here vers_num and vers_bytes occupy the same storage locations.

An alternative to a union declaration is the DEFINED attribute, which allows alternative declarations of storage, however the data types of the base and defined variables must match.

Rust
Rust implements both tagged and untagged unions. In Rust, tagged unions are implemented using the enum keyword. Unlike enumerated types in most other languages, enum variants in Rust can contain additional data in the form of a tuple or struct, making them tagged unions rather than simple enumerated types.

Rust also supports untagged unions using the union keyword. The memory layout of unions in Rust is undefined by default, but a union with the #[repr(C)] attribute will be laid out in memory exactly like the equivalent union in C. Reading the fields of a union can only be done within an unsafe function or block, as the compiler cannot guarantee that the data in the union will be valid for the type of the field; if this is not the case, it will result in undefined behavior.

C/C++
In C and C++, the syntax is:

A structure can also be a member of a union, as the following example shows: This example defines a variable  as a union (tagged as  ), which contains two members, a structure (tagged as  ) named   (which in turn contains three members), and an integer variable named.

Unions may occur within structures and arrays, and vice versa: The number ival is referred to as  and the first character of string sval by either of   or.

PHP
Union types were introduced in PHP 8.0. The values are implicitly "tagged" with a type by the language, and may be retrieved by "gettype".

Python
Support for typing was introduced in Python 3.5. The new syntax for union types were introduced in Python 3.10.

TypeScript
Union types are supported in TypeScript. The values are implicitly "tagged" with a type by the language, and may be retrieved using a  call for primitive values and an   comparison for complex data types. Types with overlapping usage (e.g. a slice method exists on both strings and arrays, the plus operator works on both strings and numbers) don't need additional narrowing to use these features.

Rust
Tagged unions in Rust use the enum keyword, and can contain tuple and struct variants:

Untagged unions in Rust use the union keyword:

Reading from the fields of an untagged union results in undefined behavior if the data in the union is not valid as the type of the field, and thus requires an unsafe block:

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

title: Union type


text:
Talk:Hello, Dolly! (musical)

older entries
User:4.47.127.133 says the movie is "great and definitely worth watching". I have removed this comment from the article (too POV of course) and put it here.  04:53, 28 Feb 2004 (UTC)

 * Too late, they have removed it themselves. Feel free to contribute any interesting material you have, 4.47.127.133, and welcome to Wikipedia!

Hello, Dolly's 10 Tony Awards was a record held 37 years until The Producers garnered 12 Tonys in 2001. Company was nominated for 11 Tony Awards, but "only" won 5.

film version split
I, for one, agree the film version is notable enough to deserve its own page separate from the musical (though I wasn't the one to put up the split tag). thoughts? Reimelt 18:27, 6 August 2006 (UTC)

 * Someone has split it. I've removed the split tag and added a Main article tag, and with this edit, I'm removing the FilmsWikiProject tag. TheMadBaron 12:47, 4 October 2006 (UTC)

Article work needed
Work is needed on the structure and comprehensiveness of this article; as it currently stands, the article is all lead, no body (see WP:LEAD). The body is also very listy, and short on any content typical of Wikipedia articles. For an example of a featured article on a straight play, see The Country Wife, which gives a good idea of the type of sections one expects to find in a comprehensive article. This article doesn't tell our readers much about Dolly; if this is the standard, it's not surprising that MT is not represented at all in WP:GA or WP:FA. Suggestions at WP:MUSICALS are a good starting place for completing and beefing up this article to a more comprehensive piece, conforming with WP:MOS] and [[WP:LEAD. The article history shows that there was more of an article structure at year-end 2006; merging the current content and text with the earlier and a better structure might help.  Also, I'm noticing Trivia sections in many musical articles, which should be eliminated (see WP:TRIVIA).  Comments ?  Sandy Georgia  (Talk) 14:31, 6 April 2007 (UTC)
 * The edit of this article was such a travesty it didn't include Jerry Herman's name in the opening sentence!!! Furthermore, it presented its facts out-of-order - since when is chronology of no importance in articles? I am appalled that anyone would think this revision was in any way an "improvement."
 * I have revised the article to restore Herman's name to the opening, give more prominence to the plot line (which was buried in the article), separate the film adaptation from the stage productions (as it should be), and remove inconsequential details about the film The Matchmaker. Who starred in that movie has no bearing on Hello, Dolly! and those facts belong in that film's article, not here. Additionally, reference to On the Razzle makes no sense, coming as it did some twenty years after Dolly and in no way linked directly to the musical.
 * I also removed an inaccurate comment re: he film version, which was a commercial flop at the time of its release. Thank you. SFTVLGUY2 16:03, 6 April 2007 (UTC)

If you would stop moving the sections around and leave them where WP:MUSICALS guidelines indicate that they should go, it will be easier for everyone to see and discuss the various textual changes that can be made. Plot synopsis sections do not belong in the introduction of WP articles -- WP:LEAD suggests that the intro should be an overview of the rest of the article, rather than a plot summary section. -- Ssilvers 16:13, 6 April 2007 (UTC)
 * "SUGGESTS" does not mean "demands" or "forces" or "requires without question." Use some common sense here. Despite what a handful of people no longer involved with the project may have thought was a good idea, I don't think the average reader wants to wade through ¾ of an article about a musical or play before finally discovering its plot. I don't see how you can deny the way in which my articles unfold the facts is logical. Who wrote it? What is its plot? What interesting background info is there? Where was it performed? What are its musical numbers? What awards did it win?
 * Had you been one of those who compiled the WP:MUSICALS "guidelines," I could understand your resistance to changing them. But as often as I have asked, you never have explained to me why you insist on rigidly clinging to the past by claiming that the old formats designed by people who abandoned the project are the only ones that should be considered. Your argument is always the same - essentially, "it must be done that way because that's the way things are done." Why is it so difficult to accept that new ideas might hold some merit? SFTVLGUY2 17:01, 6 April 2007 (UTC)

I am simply following WP consensus on WP:LEAD and the article structure described under the WP:MUSICAL project and similar projects like WP:WPO and WP:G&S. I disagree with you about the plot section: Having a separate section gives the plot more prominence than sticking it into the introduction section. The table of contents clearly indicates where it is so that readers can find it easily. I have reorganized the article using the structure described in the Musicals project, and I have also made many of the corrections that you suggest above. I think we need more detail on the subsequent productions. Best regards. -- Ssilvers 05:44, 7 April 2007 (UTC)

 * The Merchant of Yonkers was not about Dolly Gallager Levi; in fact, she was a very minor character in that play. I have removed this incorrect info from the opening. Furthermore, Louis Armstrong never appeared in the stage production, so I have removed that info as well.
 * It's a pity that this article was permitted to evolve into the mess it is now. Ssilvers complained there was too much info about the film version, so I removed it, and then he reverted it . . . why? There also is an unnecessary repetition of facts throughout.
 * As far as structure is concerned, if you refer to WikiProject Musical Theatre/Article Structure, it clearly states, "Below you will find the suggested structure of Articles pertaining to works of Musical Theatre on Wikipeda. Please note that this is the suggested structure and is not written in stone." This appears to support my position that editors need not conform to Ssilver's demand that things be done his way, one I have held since he first started harassing me. SFTVLGUY2 17:40, 11 April 2007 (UTC)

Wikipedia articles are supposed to begin with an introduction that is an overview of the article and so, yes, it should contain information that is discussed below in more detail. See WP:LEAD. I don't demand anything. I merely point out that you ignore the WP:CONSENSUS of editors on Wikipedia and repeatedly delete information from articles that the consensus of editors find useful. -- Ssilvers 18:22, 11 April 2007 (UTC)
 * Despite your frequent and unwarranted accusations, I never have removed valuable info from any article. I rework badly written material to make it clear, concise, and free of grammatical, punctuation, and factual errors. According to your statement above, "Wikipedia articles are supposed to begin with an introduction that is an overview of the article." Why then does the intro for this one include such detailed info about the film version, which has no place in the opening? You criticized what little film data I originally had placed later in the article (where it belongs), claiming there was too much of it, and now it's given prominence to which it definitely is not entitled. Clearly there is no consistency to your thought process. SFTVLGUY2 19:45, 11 April 2007 (UTC)

Film adaptation
There is already a separate article about the film, so we don't need a separate section here. Maybe we should slim down the discussion of the film more, since people can read the film's article. -- Ssilvers 16:10, 6 April 2007 (UTC)
 * As always, I agree with less-is-better and have edited the film info, but it shouldn't be included with the stage production history. And again I have removed the comment that it was one of the most popular film musicals made earlier in the article, since it was a box office dud. SFTVLGUY2 16:16, 6 April 2007 (UTC)

Fair enough, but it is played over and over on TV, so if we say it's a dud, we should just note that it continues to be popular on TV. -- Ssilvers 16:27, 6 April 2007 (UTC)
 * You yourself said, "Maybe we should slim down the discussion of the film more, since people can read the film's article," so why should any reference to its TV popularity be mentioned here? I didn't say it was a dud within this article; if I had done so your suggestion would be valid. The film article specifies it didn't make money until it was released on video, and that's where that info belongs. SFTVLGUY2 16:40, 6 April 2007 (UTC)

I agree with that. But this (now) one-liner should not get its own heading. Best regards, Ssilvers 17:31, 6 April 2007 (UTC)
 * Since it doesn't belong with the stage production history, I'll remove it completely. The film version is referenced at the start of the article anyway. SFTVLGUY2 18:06, 6 April 2007 (UTC)

Surely it is notable that a major motion picture was made of the musical. I don't think a disambiguation notice fulfills our responsibility to mention this in the article. I'll fix it later. -- Ssilvers 19:12, 6 April 2007 (UTC)

Plot Synopsis Needs Work
I will have to get my copy of the musical, but the plot synopsis seems a little thin. Perhaps, when I find my copy, I will come back and flesh it out a little more. 66.192.126.3 10:33, 9 May 2007 (UTC)

Fair use rationale for Image:DollyPlay.jpg
Image:DollyPlay.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images lacking such an explanation can be deleted one week after being tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot (talk) 05:39, 2 January 2008 (UTC)

Chorus? Ensemble?
I was editing the song list and I noticed that there seem to be some inconsistancies in how the "cast members who have no particular role in the musical but still dance and sing" are referred to in the song list. I usually use the term "Chorus." However, I also see the terms "Ensemble", "Dancers", and "Company". Do each of these terms have a slightly different meaning? The dancers don't actually sing; do they still deserve to be mentioned on the list? Also, "The Polka Contest" is not an actual song; it is just a the polka music used for, well, the Harmonia Gardens' Polka Contest. The cast members listed after it make it look like it involves some singing, which it doesn't. I was in a production of Hello, Dolly! two years ago and I think I remember everything correctly, but I wouldn't want to make any errors. Does anyone else have any opinions regarding this?MarianKroy (talk) 18:30, 23 May 2008 (UTC)

 * I think that Ensemble and Chorus are exactly the same; however Company means both the Ensemble and the Principals. I think our articles usually use the term Ensemble instead of Chorus, which is consistent with the IBDB database, I think.  We usually do not mention dancers unless they have a big solo dance that is tantamount to their own number.  For important musical numbers that do not have lyrics, I usually write "instrumental" or something like that.  I would take out the name of the cast members, unless they are solo dancers or have specific speaking lines during the music, in which case, you can footnote this after listing the names.  Best regards, -- Ssilvers (talk) 18:45, 23 May 2008 (UTC)

Thanks! I've made some edits now, and I'm pretty happy with them. However, "Dancing" starts out as a song with Dolly teaching Cornelius and Barnaby to dance. Then they dance with the ladies and sing together in front of the curtain as the scene changes to Central Park. Then when the curtain opens again, the ensemble is there dancing. How should I best notate this?MarianKroy (talk) 21:13, 23 May 2008 (UTC)

 * Looks good. I think "Dancing" is OK as is.  You could footnote the action, but it's not really a big deal, I think.  Nice edits.  -- Ssilvers (talk) 21:49, 23 May 2008 (UTC)

Wall-E
I just saw Wall-E two days ago, and "Put on Your Sunday Clothes" and "It Only Takes A Moment" are a very significant part of the movie. However, all the music and video clips are from the movie, not the Broadway production. I don't know if this matters, since it's really just trivia. MarianKroy (talk) 13:16, 30 June 2008 (UTC)

 * Thanks! I am moving this to the film article, then.  Best regards, -- Ssilvers (talk) 22:18, 30 June 2008 (UTC)
 * You say that you moved the info to the film article, but it's not there. It should be somewhere. NPR has references. MMetro (talk) 10:39, 18 July 2009 (UTC)

 * Did you have a look at the history of Hello, Dolly! (film)? It has recently been removed as WP:TRIV, see . --FordPrefect42 (talk) 11:10, 18 July 2009 (UTC)

Rumored Broadway revival
Today I deleted an item (which had no WP:RS) about a Broadway revival "soon", "possibly with Patti LuPone in the title role. This, however, is unconfirmed.". I believe that this is still in the rumor stage and, although reported in the New York Times (yes, it is quite easy to find sources), the nature of that article makes it clear that this is not "set" and is truly unconfirmed. Should others disagree, feel free to add it, but I think it should be phrased carefully and referenced according to standard Wikipedia guidelines (WP:VERIFY).JeanColumbia (talk) 17:45, 16 December 2010 (UTC)

Update and maintenance
The following link in "References" looks broken: "Bovsun, Mara. From 'Hello, Dolly!': Dolly Gallagher Levi. barbra-archives.com. Retrieved on 2007-04-08."

I've marked it to check. Lincoln Josh (talk) 17:35, 4 January 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 3 external links on Hello, Dolly! (musical). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20150707235113/http://www.grammy.org/recording-academy/awards/hall-of-fame to http://www.grammy.org/recording-academy/awards/hall-of-fame
 * Added archive https://web.archive.org/web/20160121231903/http://bigstory.ap.org/article/4f7c279e89e04195a77f0d0e9537579d/bette-midler-return-broadway-hello-dolly to http://bigstory.ap.org/article/4f7c279e89e04195a77f0d0e9537579d/bette-midler-return-broadway-hello-dolly
 * Added archive https://web.archive.org/web/20110312043420/http://www.olivierawards.com/about/previous-winners/view/item110508/Olivier-Winners-2010/ to http://www.olivierawards.com/about/previous-winners/view/item110508/olivier-winners-2010/

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 11:47, 31 March 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Hello, Dolly! (musical). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added tag to http://www.dramadesk.org/1969_1970dd.html
 * Added tag to http://www.costumeworld.com/category/broadway-collection/
 * Added archive https://web.archive.org/web/20061101193013/http://www.barbra-archives.com/articles/streisand_dolly_bovsun_article.html to http://www.barbra-archives.com/articles/streisand_dolly_bovsun_article.html
 * Added archive https://web.archive.org/web/20071127174553/http://www.tuts.com/season07/dolly_study.pdf to http://www.tuts.com/season07/dolly_study.pdf

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 20:23, 5 December 2017 (UTC)

Replacement
Ermengarde also has been replaced for the 2019-20 tour. If Ambrose has been listed, a mention that Ermengarde has also been replaced. — Preceding unsigned comment added by Truthbetoldalways (talk • contribs)

List of productions
Please, stop deleting non-English language official productions from the chart. JoshuaPers (talk) 06:25, 6 February 2022 (UTC)

title: Talk:Hello, Dolly! (musical)


text:
Battle of Chattanooga

There were three battles of Chattanooga fought in Chattanooga, Tennessee, during the American Civil War:
 * First Battle of Chattanooga (June 7–8, 1862), minor artillery bombardment by Union Brigadier General James S. Negley against Confederate Maj. Gen. Edmund Kirby Smith
 * Second Battle of Chattanooga (August 21, 1863), Union artillery bombardment that convinced Bragg to evacuate the city
 * Chattanooga Campaign or the Battles for Chattanooga, (November 23–25, 1863) Union Major General Ulysses S. Grant, fighting alongside General George Henry Thomas, defeated Confederate General Braxton Bragg
 * Battle of Lookout Mountain, and Battle of Missionary Ridge, two battles in the campaign

title: Battle of Chattanooga


text:
Talk:Cal History

Is this page really necessary? Nothing even links here.Matt gies 04:58, 28 Feb 2004 (UTC)

title: Talk:Cal History


text:
Talk:Calif History

Is this page necessary? Nothing links to it.Matt gies 04:59, 28 Feb 2004 (UTC)

title: Talk:Calif History


text:
Bank of America Corporate Center

The Bank of America Corporate Center is an 871 ft (265 m) skyscraper in Uptown Charlotte, North Carolina. Designed by Argentine architect César Pelli and HKS Architects, and best known as the headquarters of the namesake Bank of America, it has been the tallest building in North Carolina since its 1992 construction, the 56th-tallest building in the United States, and the 174th-tallest building in the world.

Sometimes locally referred to as the "Taj McColl" after former Bank of America CEO Hugh McColl, who was responsible for the tower's construction, on a clear day the tower is visible to the naked eye from 35 mi away.

Ben Long Frescoes
Located in the Corporate Center's lobby are three frescoes that measure 18x23 feet each and are the largest secular fresco in the United States. Created by North Carolinian artist Ben Long and a team of nine artists, the frescoes were completed in approximately four months in 1992. The three frescoes are a triptych, three related works, which was inspired by Shingon. The first panel Making/Building, on left, depiction of the construction of the Corporate Center. A row of workers holding golden spades appear at the bottom, while at the top is another worker, a leader, holds a spade as he gazes into the distance towards a figure asleep on the hill. The second panel Chaos/Creativity, at center, depicts a jostling crowd of figures of various occupations, while a circle of six nude figures spin above the crowd, creating a contrast. The third panel Planning/Knowledge, on right, is a portrait of a young boy, geometric shapes, a pyramid, people in the lower-left corner in a discussion, a dancing girl, and a figure sitting by a burning tree.

Blumenthal Performing Arts Center
Connected to the Corporate Center, along East 5th Street, the Blumenthal Performing Arts Center contains three performance halls: Belk Theater, Booth Playhouse, and Stage Door Theater.

Founders Hall
Connected to the Corporate Center, Founders Hall is a large vaulted atrium that features red-brown marble floors and a water fountain. Ringed around it are two levels of retail and restaurants, which are part of the Overstreet Mall, and is connected by skybridges to neighboring Bank of America Center, One South at The Plaza, and Truist Center.

Announcement
On Wednesday, December 10, 1986, North Carolina National Bank announced that it would construct what would become the Corporate Center. Jointly developed with Charter Properties, the project was initially announced as a 50 story tower to be constructed with a 350-room hotel and what would become the North Carolina Blumenthal Performing Arts Center. The initial design for the 50 story tower was created by Charlotte-based Odell Associates. Its design featured a circular tower complete with a Greek cross lying flat on top to pay homage to the intersection of Trade and Tryon.

Additionally, its construction resulted in the demolition of an entire city block bound by North Tryon, East Trade, North College and East 5th Streets. The most notable buildings lost in its construction were the Belk department store, constructed in 1908, along East Trade and the Efird's department store, constructed in 1922, on North Tryon.

Design competition
On Monday, July 20, 1987, NCNB announced Lincoln Property as a general partner for the project. With the development team set, the process of hiring an architect of the project commenced in August 1987.

The architectural firms that competed for the job included:
 * I.M. Pei of New York City
 * Skidmore, Owings and Merrill of Chicago
 * Cesar Pelli & Associates of New Haven, Connecticut
 * HKS Architects of Dallas
 * John Burgee Architects of New York City
 * WZMH Group of Dallas
 * Kohn Pedersen Fox Associates of New York City

On Friday, September 25, 1987, the Cesar Pelli design was announced by NCNB Chairman Hugh McColl as being selected for the project. Additionally at the press conference it was revealed that the tower would be between 55-60 stories tall, sheathed in granite and be officially named the NCNB Corporate Center.

After winning the contract, its design was unveiled eight months later to the public on Tuesday, June 14, 1988. The final design was the 60 floor tower seen today. It features a 30 ft granite base along North Tryon Street followed by a facade of rosy beige granite and silver glass rising complete with curved sides. The tower gradually tapers through a series of six setbacks at the 13th, 44th and 53rd floors on the corners and at the 47th, 56th and 60th floors on the face as it reaches the tip of its crown 871 ft above Tryon Street.

Construction
On Tuesday, January 3, 1989, demolition commenced on the block where the tower would eventually rise. The demolition work would take just over seven months to complete before excavation could commence. Site preparation would continue from August through November. During the excavation for the foundation, contractors found threads and flakes of gold embedded within pieces of granite removed from the site. The discovery was not unexpected as Charlotte was the center of America's first gold rush during the 1830s.

On November 19, 1989, the initial concrete pour was completed signaling the beginning of actual construction. The mat foundation consists of a thick slab containing 3500 cuyd of concrete and 150 tons of reinforcing steel at the center of the tower. The foundation reaches 38 ft below Tryon Street at its deepest point with the tower being supported by 36 concrete and steel piers. These piers are able to withstand the 150,000 pounds of pressure per square foot placed upon them by the 300 million pound structure.

After only a couple of months, construction was temporarily halted after Hurricane Hugo slammed Charlotte with 90 mi/h winds causing some damage on-site on Friday, September 22, 1989.

By November 1990, the tower had reached its 30th floor and as a result had risen to being the 5th tallest within Charlotte. On Wednesday, March 20, 1991, the tower officially became both Charlotte's and North Carolina's tallest when it reached a height of 589 ft at its 47th floor to surpass the 588 ft tall One First Union Center. The tower was officially topped-out on Wednesday, October 2, 1991 with the final concrete pour completed. From this point, the 95 ft tall crown was installed with its completion coming in December bringing the tower to its final 871 ft height.

By January 1992, the tower had since been renamed the NationsBank Corporate Center to reflect the bank's name change from NCNB to NationsBank in summer 1991. On May 1, the first tenants moved into the tower with its inaugural crown lighting taking place on May 9.

Completed in July 1992, its official dedication ceremony took place on Saturday, October 17, 1992. The celebrations that day included live entertainment, rappellers from Fort Bragg's 16th Military Police Brigade rappelling the height of the tower and a fireworks show.

Post-opening

Since its completion, the Bank of America Corporate Center has been the world headquarters for what is now Bank of America. NationsBank bought BankAmerica Corporation in 1998, changed its name to Bank of America and sold BankAmerica's headquarters at 555 California Street, then the Bank of America Center, in San Francisco. Moore & Van Allen and Ernst & Young are also tenants in the tower.

The Bank of America Corporate Center's crown shaped spire is the focal point of the building and it makes it stand out architecturally. Its spire does not reflect from the outside like the Chrysler Building or any others; it shines from within and instead of stainless steel there is glass illuminated by floodlights, making it stand out from the many world skyscrapers. Bank of America began shining the top of the crown shaped spire from white to blue in honor of the Carolina Panthers who were NFC champions in the 2003–2004 NFL season. In 2017 it was announced LEDs had been installed in the spire.

On July 20, 2005 Ken Lewis, then CEO and Mr. Cyprian White of the Credit Bureau of the Bank of America, announced the construction of a brand new 150 key Ritz-Carlton and LEED certified 40 story office retail complex located adjacent to the Bank of America Corporate Center.

FAA controversy
On May 15, 1989, a ruling by the Federal Aviation Administration stated that the tower's height would potentially jeopardize some flights taking off and landing at Charlotte-Douglas International Airport. The ruling came even though Charlotte's dominant airline, USAir, and airport officials had determined that the tower was not a hazard. A June 12 appeal filed with the regional FAA office in Atlanta upheld the original ruling resulting in the case being appealed to Washington. Although the FAA could not force NCNB to halt construction of the tower, its "declaration of hazard to air navigation" could have potentially cost the city millions in federal airport grants as well as impeding the ability of NCNB to secure insurance for the tower upon its completion.

By December 1989, the issue was resolved when the FAA ruled that slight changes in air-traffic procedures around the building would resolve the hazard posed by the 871 ft tower. With the influence of both U.S. representative Alex McMillan and Senator Ernest Hollings, the reversal of the original ruling was made after further review by the FAA. Since its construction, there has not been an incident involving an aircraft and the tower.

title: Bank of America Corporate Center


text:
Record (computer science)

In computer science, a record (also called a structure, struct, or compound data) is a basic data structure. Records in a database or spreadsheet are usually called "rows".

A record is a collection of fields, possibly of different data types, typically in a fixed number and sequence. The fields of a record may also be called members, particularly in object-oriented programming; fields may also be called elements, though this risks confusion with the elements of a collection.

For example, a date could be stored as a record containing a numeric year field, a month field represented as a string, and a numeric day-of-month field. A personnel record might contain a name, a salary , and a rank. A Circle record might contain a center and a radius —in this instance, the center itself might be represented as a point record containing x and y coordinates.

Records are distinguished from arrays by the fact that their number of fields is determined in the definition of the record, and by the fact the records are a heterogenous data type; not all of the fields must contain the same type of data.

A record type is a data type that describes such values and variables. Most modern computer languages allow the programmer to define new record types. The definition includes specifying the data type of each field and an identifier (name or label) by which it can be accessed. In type theory, product types (with no field names) are generally preferred due to their simplicity, but proper record types are studied in languages such as System F-sub. Since type-theoretical records may contain first-class function-typed fields in addition to data, they can express many features of object-oriented programming.

Records can exist in any storage medium, including main memory and mass storage devices such as magnetic tapes or hard disks. Records are a fundamental component of most data structures, especially linked data structures. Many computer files are organized as arrays of logical records, often grouped into larger physical records or blocks for efficiency.

The parameters of a function or procedure can often be viewed as the fields of a record variable; and the arguments passed to that function can be viewed as a record value that gets assigned to that variable at the time of the call. Also, in the call stack that is often used to implement procedure calls, each entry is an activation record or call frame, containing the procedure parameters and local variables, the return address, and other internal fields.

An object in object-oriented language is essentially a record that contains procedures specialized to handle that record; and object types are an elaboration of record types. Indeed, in most object-oriented languages, records are just special cases of objects, and are known as plain old data structures (PODSs), to contrast with objects that use OO features.

A record can be viewed as the computer analog of a mathematical tuple, although a tuple may or may not be considered a record, and vice versa, depending on conventions and the specific programming language. In the same vein, a record type can be viewed as the computer language analog of the Cartesian product of two or more mathematical sets, or the implementation of an abstract product type in a specific language.

Keys
A record may have zero or more keys. A key maps an expression to a value, or a set of values, in the record. A primary key is unique throughout all stored records; only one of this key exists. In other words, no duplicate may exist for any primary key. For example, an employee file might contain employee number, name, department, and salary. The employee number will be unique in the organization and will be the primary key. Depending on the storage medium and file organization, the employee number might be indexed—that is also stored in a separate file to make the lookup faster. The department code is not necessarily unique; it may also be indexed, in which case it would be considered a secondary key, or alternate key. If it is not indexed, the entire employee file would have to be scanned to produce a listing of all employees in a specific department. Keys are usually chosen in a way that minimizes the chances of multiple values being feasibly mapped to by one key. For example, the salary field would not normally be considered usable as a key since many employees will likely have the same salary. Indexing is one factor considered when designing a file.

History
The concept of a record can be traced to various types of tables and ledgers used in accounting since remote times. The modern notion of records in computer science, with fields of well-defined type and size, was already implicit in 19th century mechanical calculators, such as Babbage's Analytical Engine.

The original machine-readable medium used for data (as opposed to control) was the punch card used for records in the 1890 United States Census: each punch card was a single record. Compare the journal entry from 1880 and the punch card from 1895. Records were well-established in the first half of the 20th century, when most data processing was done using punched cards. Typically, each record of a data file would be recorded on one punched card, with specific columns assigned to specific fields. Generally, a record was the smallest unit that could be read from external storage (e.g., card reader, tape, or disk). The contents of punchcard-style records were originally called "unit records" because punchcards had pre-determined document lengths. When storage systems became more advanced with the use of hard drives and magnetic tape, variable-length records became the standard. A variable-length record is a record in which the size of the record in bytes is approximately equal to the sum of the sizes of its fields. This was not possible to do before more advanced storage hardware was invented because all of the punchcards had to conform to pre-determined document lengths that the computer could read, since at the time the cards had to be physically fed into a machine.

Most machine language implementations and early assembly languages did not have special syntax for records, but the concept was available (and extensively used) through the use of index registers, indirect addressing, and self-modifying code. Some early computers, such as the IBM 1620, had hardware support for delimiting records and fields, and special instructions for copying such records.

The concept of records and fields was central in some early file sorting and tabulating utilities, such as IBM's Report Program Generator (RPG).

was the first widespread programming language to support record types, and its record definition facilities were quite sophisticated at the time. The language allows for the definition of nested records with alphanumeric, integer, and fractional fields of arbitrary size and precision, and fields that automatically format any value assigned to them (e.g., insertion of currency signs, decimal points, and digit group separators). Each file is associated with a record variable where data is read into or written from. COBOL also provides a    statement that assigns corresponding fields of two records according to their names.

The early languages developed for numeric computing, such as FORTRAN (up to FORTRAN IV) and ALGOL 60, did not support record types; but later versions of those languages, such as FORTRAN 77 and ALGOL 68 did add them. The original Lisp programming language too was lacking records (except for the built-in cons cell), but its S-expressions provided an adequate surrogate. The Pascal programming language was one of the first languages to fully integrate record types with other basic types into a logically consistent type system. The PL/I language provided for COBOL-style records. The C language initially provided the record concept as a kind of template that could be laid on top of a memory area, rather than a true record data type. The latter were provided eventually (by the  declaration), but the two concepts are still distinct in the language. Most languages designed after Pascal (such as Ada, Modula, and Java), also supported records.

Although records are not often used in their original context anymore (i.e. being used solely for the purpose of containing data), records influenced newer object-oriented programming languages and relational database management systems. Since records provided more modularity in the way data was stored and handled, they are better suited at representing complex, real-world concepts than the primitive data types provided by default in languages. This influenced later languages such as C++, Python, JavaScript, and Objective-C which address the same modularity needs of programming. Objects in these languages are essentially records with the addition of methods and inheritance, which allow programmers to manipulate the way data behaves instead of only the contents of a record. Many programmers regard records as obsolete now since object-oriented languages have features that far surpass what records are capable of. On the other hand, many programmers argue that the low overhead and ability to use records in assembly language make records still relevant when programming with low levels of abstraction. Today, the most popular languages on the TIOBE index, an indicator of the popularity of programming languages, have been influenced in some way by records due to the fact that they are object oriented. Query languages such as SQL and Object Query Language were also influenced by the concept of records. These languages allow the programmer to store sets of data, which are essentially records, in tables. This data can then be retrieved using a primary key. The tables themselves are also records which may have a foreign key: a key that references data in another table.

Operations

 * Declaration of a new record type, including the position, type, and (possibly) name of each field;
 * Declaration of variables and values as having a given record type;
 * Construction of a record value from given field values and (sometimes) with given field names;
 * Selection of a field of a record with an explicit name;
 * Assignment of a record value to a record variable;
 * Comparison of two records for equality;
 * Computation of a standard hash value for the record.

The selection of a field from a record value yields a value.

Some languages may provide facilities that enumerate all fields of a record, or at least the fields that are references. This facility is needed to implement certain services such as debuggers, garbage collectors, and serialization. It requires some degree of type polymorphism.

In systems with record subtyping, operations on values of record type may also include: In such settings, a specific record type implies that a specific set of fields are present, but values of that type may contain additional fields. A record with fields x, y, and z would thus belong to the type of records with fields x and y, as would a record with fields x, y, and r. The rationale is that passing an (x,y,z) record to a function that expects an (x,y) record as argument should work, since that function will find all the fields it requires within the record. Many ways of practically implementing records in programming languages would have trouble with allowing such variability, but the matter is a central characteristic of record types in more theoretical contexts.
 * Adding a new field to a record, setting the value of the new field.
 * Removing a field from a record.

Assignment and comparison
Most languages allow assignment between records that have exactly the same record type (including same field types and names, in the same order). Depending on the language, however, two record data types defined separately may be regarded as distinct types even if they have exactly the same fields.

Some languages may also allow assignment between records whose fields have different names, matching each field value with the corresponding field variable by their positions within the record; so that, for example, a complex number with fields called  and   can be assigned to a 2D point record variable with fields   and. In this alternative, the two operands are still required to have the same sequence of field types. Some languages may also require that corresponding types have the same size and encoding as well, so that the whole record can be assigned as an uninterpreted bit string. Other languages may be more flexible in this regard, and require only that each value field can be legally assigned to the corresponding variable field; so that, for example, a short integer field can be assigned to a long integer field, or vice versa.

Other languages (such as COBOL) may match fields and values by their names, rather than positions.

These same possibilities apply to the comparison of two record values for equality. Some languages may also allow order comparisons ('<'and '>'), using the lexicographic order based on the comparison of individual fields.

PL/I allows both of the preceding types of assignment, and also allows structure expressions, such as  where "a" is a record, or structure in PL/I terminology.

Algol 68's distributive field selection
In Algol 68, if  was an array of records, each with integer fields   and , one could write   to obtain an array of integers, consisting of the   fields of all the elements of. As a result, the statements  and   would have the same effect.

Pascal's "with" statement
In the Pascal programming language, the command  would execute the command sequence   as if all the fields of record   had been declared as variables. Similarly to entering a different namespace in an object-oriented language like C#, it is no longer necessary to use the record name as a prefix to access the fields. So, instead of writing  one could write with Pt do begin X := 5; Y := X + 3 end.

Representation in memory
The representation of records in memory varies depending on the programming languages. Usually the fields are stored in consecutive positions in memory, in the same order as they are declared in the record type. This may result in two or more fields stored into the same word of memory; indeed, this feature is often used in systems programming to access specific bits of a word. On the other hand, most compilers will add padding fields, mostly invisible to the programmer, in order to comply with alignment constraints imposed by the machine—say, that a floating point field must occupy a single word.

Some languages may implement a record as an array of addresses pointing to the fields (and, possibly, to their names and/or types). Objects in object-oriented languages are often implemented in rather complicated ways, especially in languages that allow multiple class inheritance.

Self-defining records
A self-defining record is a type of record which contains information to identify the record type and to locate information within the record. It may contain the offsets of elements; the elements can therefore be stored in any order or may be omitted. The information stored in a self-defining record can be interpreted as metadata for the record, which is similar to what one would expect to find in the UNIX metadata regarding a file, containing information such as the record's creation time and the size of the record in bytes. Alternatively, various elements of the record, each including an element identifier, can simply follow one another in any order.

title: Record (computer science)


text:
Witch's mark

A witch's mark, devil's mark or stigma diabolicum was a bodily mark that witch-hunters believed indicated that an individual was a witch, during the height of the witch trials. The beliefs about the mark differed, depending on the trial location and the accusation made against the witch. Use of the term is found earliest in the 16th century, and reaching its peak in 1645, but then essentially disappearing by 1700.

The Witch or Devil's mark was believed to be the permanent marking of the Devil on his initiates to seal their obedience and service to him. He is said to create the mark by raking his claw across their flesh, licking the skin to produce a death skull pattern, or using a hot iron to produce a blue or red brand. The Devil was thought to mark the individual at the end of nocturnal initiation rites.

The witch's teat was a raised bump somewhere on a witch's body. It is often depicted as having a wart-like appearance.

Beliefs about the mark on witches
The witch's teat is associated with the perceived perversion of maternal power by witches in early modern England. The witch's teat is associated with the feeding of witches' imps or familiars; the witch's familiar supposedly aided the witch in her magic in exchange for nourishment (blood) from sacrificial animals or from the witch's teat. It is also where the devil supposedly suckles when he comes at night to bed his faithful servants, sometimes impregnating them with his seed. Once the devilish half-breed has been conceived, the cambion may only feed upon this teat and no other. Folklore suggests that on the 7th day of the 7th week of consecutive feeding upon the teat, the cambion would grow to adulthood immediately and begin wreaking havoc with a range of demonic powers inherited from its supernatural father. However, should the ritual be disrupted during the 49-day period, the process has to restart all over again.

All witches and sorcerers were believed to have a witch's mark waiting to be found. A person accused of witchcraft was brought to trial and carefully scrutinized. The entire body was suspect as a canvas for a mark, an indicator of a pact with Satan. Witch's marks were commonly believed to include moles, skin tags, supernumerary nipples, and insensitive patches of skin. Experts, or inquisitors, firmly believed that a witch's mark could be easily identified from a natural mark; in light of this belief, protests from the victims that the marks were natural were often ignored.

Medieval inquisitors
Authorities in the witch trials routinely stripped an accused witch of clothing and shaved all body hair so that no potential mark could be hidden. Pins were driven into scars, calluses and thickened areas of skin: the practice of "pricking a witch". Customarily, this routine was performed in front of a large crowd. Medieval inquisitors also believed that the Devil left invisible marks upon his followers. If after stripping and shaving, the accused witch was found to have no likely blemishes, pins were simply driven into her body until an insensitive area was found. The search for witch's marks had disappeared by 1700.

The violence used against accused witches in order to discover the witch's mark included torture; "To try to force a confession, priest applied hot fat repeatedly to Catherine Boyraionne's eyes and her armpits, the pit of her stomach, her thighs, her elbows, and 'dans sa nature' – in her vagina. She died in prison, no doubt from injuries."

During the witch-trials in early modern Europe, individuals were employed to help aid in the discovery and conviction of witches. These individuals were given the title "witch finders". Perhaps the most famous witchfinder was a man named Matthew Hopkins (c. 1620–1647), who claimed to be the "Witch Finder General". Hopkins's writings reached the height of their popularity during the English Civil War (c. 1645), and contributed to the use of the witch's mark as evidence of guilt. The record shows that two Scottish women disguised themselves as men, known as "Mr. Dickson" and "Mr. Peterson", so they, too, could become witch-finders.

Pagan tattoos theory
As far as the historical study of the witch's mark goes, historians are split into different camps. The first camp, sometimes called "Murray-ists", supports British anthropologist Margaret Murray's theory of the witch's mark. Historical discussion of the witch's mark began after the publication of Murray's books on the subject: Witchcult in Western Europe and The God of the Witches in the early 20th century. Her writings argue strongly that Devil's marks were in actuality tattoos that identified members of an organized pagan religion that she believed flourished in the Middle Ages. After the publication of her work, the historical community became divided between Murrayist and non-Murrayist scholars: "When the Witchcult in Western Europe appeared in 1921, it broke this deadlock; yes, said Murray, witches had indeed been up to something of which society disapproved, but it was in no way supernatural; they were merely members of an underground movement secretly keeping pagan rituals alive in Christian Europe." Murray's work became widely accepted and she was considered an expert in witchcraft studies after its publication. Murray is also credited with the renewed interest in neo-pagan religions, and later, Wicca, which occurred after the publications of her books. However, today her controversial ideas have been largely rejected by scientists and academics due to the lack of any evidence.

Anne Barstow
Another camp believes that the witch's mark is a gendered aspect of the witch-hunts. In Anne Barstow's book, Witchcraze: A New History of the European Witch Hunts, the witch's mark is viewed from a feminist perspective. Barstow sees the witch hunts of Europe as an attempt to control women, and the witch's mark as an excuse to control women's bodies through violence and sadism. The searching of women's bodies for the witch's mark gives insight into the reality of a woman's position during this time: "when 'a personable and good-like woman' was defended by one of the local gentry the pricker argued that, having been accused, she must be tried anyway". Barstow views the violent and sexual nature of the witch's mark examinations in the witch trials to be further evidence that the witch-hunts were, in fact, "women-hunts".

Deborah Willis: Fear of maternal power theory
English Literature professor Deborah Willis, who writes from a feminist perspective, asserts that the witch-hunts resulted from a societal fear of maternal power. Willis argues that the people of early modern Europe all had similar fears about malevolent motherly nurturing, and that the witch's teat is a manifestation of that fear. Willis asserts that the witch's teat is a perversion of the female power to nourish and strengthen young.

Lyme disease theory
The witch's mark also factors into the theory proposed by M. M. Drymon that Lyme disease is a diagnosis for both witches and witch affliction, finding that many of the afflicted and accused in Salem and elsewhere lived in areas that were tick-risky, had a variety of red marks and rashes that looked like bite marks on their skin, and suffered from neurological and arthritic symptoms. The appearance of the witch's mark in Europe is only noted after Columbian contact with the New World in 1492 and may be the result of the transfer of a virulent form of borrelia infection from America into Europe, especially in areas under the control of the Spanish Empire, including parts of the Rhine River Valley that are now in Germany. This topic is the subject of a recent work in the study of witchcraft. This theory is an expansion of the idea first proposed by Laurie Winn Carlson that the bewitched in Salem suffered from encephalitis. Lyme disease is probably the only form of mild or acute encephalitis that is accompanied by a round red mark or bull's eye rash on the skin, which can appear after tick attachment.

title: Witch's mark


text:
Five Children and It

Five Children and It is a children's novel by English author E. Nesbit. It was originally published in 1902 in the Strand Magazine under the general title The Psammead, or the Gifts, with a segment appearing each month from April to December. The stories were then expanded into a novel which was published the same year. It is the first volume of a trilogy that includes The Phoenix and the Carpet (1904) and The Story of the Amulet (1906). The book has never been out of print since its initial publication.

Plot
Like Nesbit's The Railway Children, the story begins when a group of children move from London to the countryside of Kent. The five children (Cyril, Anthea, Robert, Jane, and their baby brother, known as "the Lamb") are playing in a gravel pit when they uncover a rather grumpy, ugly, and occasionally malevolent Psammead, a sand-fairy with the ability to grant wishes. The Psammead persuades the children to take one wish each day to be shared among them, with the caveat that the wishes will turn to stone at sunset. This, apparently, used to be the rule in the Stone Age, when all that children wished for was food, the bones of which then became fossils. The five children's first wish is to be "as beautiful as the day." The wish ends at sunset and its effects simply vanish, leading the Psammead to observe that some wishes are too fanciful to be changed to stone.

All the wishes go comically wrong. The children wish to be beautiful, but the servants do not recognise them and shut them out of the house. They wish to be rich, then find themselves with a gravel-pit full of gold spade guineas that no shop will accept as they are no longer in circulation, so they cannot buy anything. A wish for wings seems to be going well, but at sunset the children find themselves stuck on top of a church bell tower with no way down, getting them into trouble with the gamekeeper who must take them home (though this wish has the happy side-effect of introducing the gamekeeper to the children's housemaid, who later marries him). Robert is bullied by the baker's boy, then wishes that he was bigger — whereupon he becomes eleven feet tall, and the other children show him at a travelling fair for coins. They also wish themselves into a castle, only to learn that it is being besieged, while a wish to meet real Red Indians ends with the children nearly being scalped.

The children's infant brother, the Lamb, is the victim of two wishes gone awry. In one, the children become annoyed with tending to their brother and wish that someone else would want him, leading to a situation where everyone wants the baby, and the children must fend off kidnappers and Gypsies. Later, they wish that the baby would grow up faster, causing him to grow all at once into a selfish, smug young man who promptly leaves them all behind.

Finally, the children accidentally wish that they could give a wealthy woman's jewellery to their mother, causing all the jewellery to appear in their home. It seems that the gamekeeper, who is now their friend, will be blamed for the robbery, and the children must beg the Psammead for a complex series of wishes to set things right. It agrees, on the condition that they will never ask for any more wishes. Only Anthea, who has grown close to It, makes sure that the final wish is that they will meet It again. The Psammead assures them that this wish will be granted.

The five children

 * Cyril, known as Squirrel: the eldest sibling, who is brave, diplomatic, and book-smart (very intelligent)
 * Anthea, known as Panther: the second eldest, who is kind, sensible, and good-hearted.
 * Robert, known as Bobs: the middle child, he is a practical joker with a quick temper.
 * Jane, known as Pussy: a generally agreeable little girl with a tendency to be oversensitive, she is sometimes weepy and easily frightened.
 * Hilary, the baby, known as the Lamb (because his first word was "baa"). He is too young to walk and has to be carried everywhere.

The Psammead
The Psammead is described as having "eyes [that] were on long horns like a snail's eyes. It could move them in and out like telescopes; it had ears like a bat's ears, and its tubby body was shaped like a spider's and covered with thick soft fur; its legs and arms were furry too, and it had hands and feet like a monkey's" and whiskers like a rat's. When it grants wishes it stretches out its eyes, holds its breath and swells alarmingly.

The five children find the Psammead in a gravel pit, which used to be seashore. There were once many Psammeads, but the others died when they got wet and caught cold. It is the last of its kind. It is thousands of years old, and remembers pterodactyls and other ancient creatures. When the Psammeads were around they granted wishes that were then mostly for food. The wished-for objects turned into stone at sunset if they were not used that day, but this does not apply to the children's wishes because what they wish for is so much more fantastic than the wishes the Psammead granted in the past.

The word "Psammead", pronounced "sammyadd" by the children in the story, appears to be a coinage by Nesbit from the Greek ψάμμος "sand" after the pattern of dryad, naiad and oread, implicitly signifying "sand-nymph". However, its hideous appearance is unlike traditional Greek nymphs, who generally resemble beautiful maidens.

By Nesbit
The book's ending was clearly intended to leave readers in suspense:

"They did see it [the Psammead] again, of course, but not in this story. And it was not in a sand-pit either, but in a very, very, very different place. It was in a – But I must say no more."

The children reappear in The Phoenix and the Carpet (1904) and The Story of the Amulet (1906). The Psammead is offstage in the first of these sequels (it is simply mentioned by the Phoenix, who visits it three times to ask for a helpful wish when the situation becomes difficult), but it plays a significant role in the second sequel after the children rescue it from a pet shop. An omnibus edition of the three books titled Five Children was published in 1930. The trilogy is also known as the Psammead series.

By other authors
The Return of the Psammead (1992) by Helen Cresswell concerns another family of Edwardian children who discover the Psammead.

Four Children and It (2012) by Jacqueline Wilson is a contemporary retelling of the story in which four children from a modern stepfamily encounter the Psammead. One of the children has read the original book and wishes to meet Cyril, Anthea, Jane and Robert.

In Five Children on the Western Front (2014) by Kate Saunders, set nine years after the original story, the children encounter the horrors of the First World War.

Adaptations
Five Children and It has been adapted for television and film several times:

Television

 * In 1985–86 NHK broadcast a Japanese anime version, Onegai! Samia-don. 78 episodes were produced by animation studio TMS. No English dubbed version was ever produced, but it came out in other languages.
 * There have been two adaptations on British television of the novel, both by the BBC. In 1951 a basic two part production was dramatised by Dorothea Brooking. This was only shown in the South of England and Midlands. A more lavish production was made in 1991 when the BBC turned the story into a six-part television series. It was released in the UK under the story's original title. In the USA it was released as The Sand Fairy. This was followed by The Return of the Psammead in 1993, with the Psammead the only character linking the two series. Both these series were scripted by Helen Cresswell, and Francis Wright puppeteered and voiced the Psammead. He was voiced here by the puppeteer Francis Wright.
 * In 2018, as The Psammy Show, an animated series co-produced by DQ Entertainment, Method Animation and Disney Germany. This rendered the title character as a green dog-like creature.

Film

 * In 2004 a film version was released, starring Freddie Highmore, Tara FitzGerald, Jonathan Bailey, Zoë Wanamaker and Kenneth Branagh, with Eddie Izzard as the voice of the Psammead.

Theatre

 * A stage musical adaptation by Timothy Knapman (book) and Philip Godfrey (music/lyrics) was completed in 2016.
 * In 2022, it was adapted into another musical by playwright Rita Cheung Baird.

Comics

 * It was also adapted as a comic strip by Henry Seabright.

Works inspired by
A wizard named Psamathos Psamathide, described as a "Psamathist" (expert in sand) appears in J.R.R. Tolkien's Roverandom. The character, in an early draft, originally belonged to an order of "Psammeads".

title: Five Children and It


text:
Budweiser Rocket

The Budweiser Rocket is an American 3-wheeled land vehicle, generally resembling the 1970-era Blue Flame land speed record holding vehicle in appearance, powered by a hybrid liquid and solid-fuel rocket engine with an extra booster from a Sidewinder missile, that has been claimed as being the first vehicle to have broken the sound barrier on land. The original forerunner to the vehicle was the "SMI Motivator" which was damaged badly enough to require a replacement, which in time was called the "Budweiser Rocket".

The vehicle, like its predecessor, was owned by film director Hal Needham, driven by Stan Barrett and designed and built by William Fredrick (Died in 2020). Neither the Fédération Internationale de Motocyclisme nor the Fédération Internationale de l'Automobile, the official speed record certifying bodies, recognise the record attempt, the speed purported to have been reached or that the vehicle ever attained supersonic speeds. The original Budweiser Rocket was donated to the Smithsonian Institution and a modified version with a narrower track, is in the Talladega Superspeedway Museum, Alabama. The original is no longer on display and is now in storage at the Smithsonian Institution Archives, Record Unit 360, National Museum of American History, Office of Public Affairs and Records.

Controversy
The first run of the car at Bonneville Salt Flats showed that the propulsion system was unable to develop enough thrust to sustain a speed high enough to establish a new official World Land Speed Record. The team decided then that their goal would be to exceed the speed of sound on land, if only briefly, although no official authority would recognize this achievement as a record. The speed of sound is a function of the air temperature and pressure. In other words, the sound barrier is not an absolute speed value, but dependent on air conditions. The speed of sound during Barrett's speed run was 731.9 mph.

The claim of breaking the sound barrier on land was made on December 17, 1979 after a run on Rogers Dry Lake at Edwards AFB. While it has been claimed that the Budweiser Rocket did briefly break the sound barrier, it could not gain any official titles because standard ground speed record regulations measure an average speed over a measured distance (either one kilometer or one mile (1.6 km), depending on the particular sanctioning body's rules). The measurement of the vehicle's top speed during the run has been disputed primarily because of the methods used to calculate the speed, and its extremely small margin of success.

No independent authority sanctioned the performance, although United States Air Force radar tracked the vehicle and recorded the azimuth, elevation, timing, and range data from which a top speed solution was calculated. This, along with the on-board accelerometer data was used to produce the estimated top speed of 739.666 miles per hour, or Mach 1.01. This data, however, has never been publicly released.

Witnesses dispute whether a sonic boom was heard. At least one reported hearing the boom. It is claimed that no-one heard the boom because of the short distance between the observers and the deafening sonic waves from the combined liquid and solid-fuel rockets used to propel the vehicle. Standing shock waves in the rocket exhaust produce continuous supersonic shock waves (a continuous "sonic boom"). The auditory dynamics of two roaring rocket exhausts, combined with the pounding physical effects of such intense sound waves over the short distance to the observers, made it questionable whether close observers could have differentiated the vehicle's sonic boom from the general cacophony of background noise. No boom was heard at greater distances either, in marked contrast to the runs of ThrustSSC, which generated extensive and well attested sonic booms over a wide area and a clearly visible shockwave.

Despite an unauthorized written speed certification by the United States Air Force, there is much debate over the validity of the claim. The Air Force states it "never intended to give official sanction to test results, nor to give the appearance of expressing an official view as to the speed attained by the test vehicle. Any such opinion was that of individual Air Force personnel, not of the Air Force". None of the land speed record sanctioning groups was present for the run, nor was the run duplicated within any particular time frame as required by most sanctioning bodies for official recognition of a new land speed record. No accurate measurement was taken of the car's speed, which was announced as having been calculated from radar tracking data along with accelerometer data which has not been made public. As a result, the Budweiser Rocket Car is not officially considered as the first vehicle to have broken the sound barrier on land, and few people believe the car to have actually done so. The British Thrust SSC is officially recognized by the FIA as breaking the land speed record — and the sound barrier as well — in 1997, with an average speed of 763.035 mph (1227.99 km/h) on a measured mile in both directions.

title: Budweiser Rocket


text:
Branch (disambiguation)

A branch is a part of a woody plant.

Branch or branches may also refer to:

Australia

 * The Branch River, New South Wales

Canada

 * Branch, Newfoundland and Labrador, a town

France

 * Branches, Yonne, a commune

New Zealand

 * Branch River (Taylor River tributary)
 * Branch River (Wairau River tributary)

United States

 * Branch, Arkansas, a city
 * Branch, Louisiana, an unincorporated community and census-designated place
 * Branch, Michigan, an unincorporated community
 * Branch, Missouri, an unincorporated community
 * Branch, Texas, an unincorporated community
 * Branch, Wisconsin, an unincorporated community
 * Branch, Branch County, Michigan, a former village and first seat of the county
 * Branch County, Michigan
 * Branch Township (disambiguation)
 * Fort Branch, North Carolina, a Confederate fort in the American Civil War
 * Branch River (New Hampshire)
 * The Branch, also known as Branch River, New Hampshire
 * Branch River (Rhode Island)
 * Branch River (Wisconsin)

People

 * Branch (surname), a list of people with the name
 * Branch (given name), a list of people with the name
 * Branch McCracken (1908–1970), American college basketball player and coach nicknamed "Branch"

Arts and entertainment

 * Branch Connally, a main character in the Longmire television series
 * Branch, a troll in the 2016 film Trolls
 * Arthur Branch, a fictional district attorney in the Law & Order franchise
 * Branches (novel), a 2000 novel-in-verse by American author Mitch Cullin
 * The Branches, a 2010 EP by The Dear Hunter

Companies and organizations

 * Branch office, business organization that, unlike a subsidiary, does not constitute a separate legal entity even if physically separated from the organization's main office
 * Branch (banking), a retail location
 * Branch, a local union, in the trade union movement
 * Military branch, a component of the armed forces, such as the army, navy, or air force

Mathematics

 * Branches of mathematics, subdisciplines within mathematics
 * Branch (algebraic geometry), a smooth arc of a real algebraic curve
 * Branch (graph theory), a path of degree-two vertices ending in vertices of degree unequal to two
 * Branch-decomposition, a hierarchical clustering of the edges of a graph, and branchwidth, a graph parameter defined from these decompositions
 * Branch (mathematical analysis), a single value of a multi-valued complex function
 * Branch point, of a multi-valued function, a point where all neighborhoods are multi-valued
 * Branched covering, a generalization of multi-valued functions in topology and algebraic geometry
 * Branch (set theory), a maximal totally ordered subset of a tree-ordered set

Religion

 * Branch (LDS Church), the smaller of two types of local congregation in The Church of Jesus Christ of Latter-day Saints
 * Branch, in Jesus and messianic prophecy, a prophetic name attributed by Christians to Jesus

Other uses

 * Branch (academia), an academic sub-discipline
 * Branch (bridle), a crooked piece of iron in a bit shank
 * Branch (computer science), a point in a computer program where program-flow may change depending on a condition
 * Branch (hieroglyph), a member of the trees and plants hieroglyphs
 * Branches, the major sub-families of a language family
 * USS Branch, various US Navy ships
 * Branch, a sometimes-used taxonomic rank

title: Branch (disambiguation)