Expression Download

[Doménica Spielmann]

What Does the Law Cover?

Discrimination on the basis of gender identity or expression is prohibited in all areas covered by the Human Rights Law, including employment, housing, places of public accommodation, non-religious schools, and more

What Is Gender Identity or Expression?

Gender identity or expression means a person's actual or perceived gender-related identity, appearance, behavior, expression, or other gender-related characteristic regardless of the sex assigned to that person at birth, including, but not limited to, the status of being transgender. A transgender person is an individual who has a gender identity different from the sex assigned to that individual at birth. Gender dysphoria is a recognized medical condition related to an individual having a gender identity different from the sex assigned at birth. Gender non-conforming is a term used to describe a person whose gender expression differs from gender stereotypes, norms, and expectations in a given culture or historical period. Non-binary is term used to describe a person who does not identify as exclusively male or female.

What Is Prohibited by the Law?

Unlawful discrimination based on gender identity or expression can include:

In 2019, the Human Rights Law was amended through the Gender Expression Non-Discrimination Act (GENDA) to explicitly add gender identity or expression as a protected category. Discrimination on the basis of gender identity or expression is prohibited in all areas covered by the Human Rights Law.

Online communities that frame themselves as refuges for free expression often find themselves pulled to the fringes, forcing members to either confront the shift or tolerate increasingly radical ideas.

Yale has a deep history of fostering expressive activity. As an academic institution dedicated to free inquiry and the search for truth, the university is committed to free expression. These guidelines summarize university policies, provide relevant information to students, and are intended to promote the exercise of free expression and the safety and security of all members of the university community.

As an academic institution dedicated to free inquiry and the search for truth, the university is committed to free expression. In 1975, Yale adopted the Report of the Committee on Freedom of Expression at Yale (the Woodward Report ) as providing the standard for university policy. These guidelines are intended to promote the exercise of free expression and the safety and security of all members of the university community.

Both patterns and strings to be searched can be Unicode strings (str)as well as 8-bit strings (bytes).However, Unicode strings and 8-bit strings cannot be mixed:that is, you cannot match a Unicode string with a bytes pattern orvice-versa; similarly, when asking for a substitution, the replacementstring must be of the same type as both the pattern and the search string.

A regular expression (or RE) specifies a set of strings that matches it; thefunctions in this module let you check if a particular string matches a givenregular expression (or if a given regular expression matches a particularstring, which comes down to the same thing).

Regular expressions can be concatenated to form new regular expressions; if Aand B are both regular expressions, then AB is also a regular expression.In general, if a string p matches A and another string q matches B, thestring pq will match AB. This holds unless A or B contain low precedenceoperations; boundary conditions between A and B; or have numbered groupreferences. Thus, complex expressions can easily be constructed from simplerprimitive expressions like the ones described here. For details of the theoryand implementation of regular expressions, consult the Friedl book [Frie09],or almost any textbook about compiler construction.

Repetition operators or quantifiers (*, +, ?, m,n, etc) cannot bedirectly nested. This avoids ambiguity with the non-greedy modifier suffix?, and with other modifiers in other implementations. To apply a secondrepetition to an inner repetition, parentheses may be used. For example,the expression (?:a6)* matches any multiple of six 'a' characters.

(Dot.) In the default mode, this matches any character except a newline. Ifthe DOTALL flag has been specified, this matches any characterincluding a newline. (?s:.) matches any character regardless of flags.

Like the '*', '+', and '?' quantifiers, those where '+' isappended also match as many times as possible.However, unlike the true greedy quantifiers, these do not allowback-tracking when the expression following it fails to match.These are known as possessive quantifiers.For example, a*a will match 'aaaa' because the a* will matchall 4 'a's, but, when the final 'a' is encountered, theexpression is backtracked so that in the end the a* ends up matching3 'a's total, and the fourth 'a' is matched by the final 'a'.However, when a*+a is used to match 'aaaa', the a*+ willmatch all 4 'a', but when the final 'a' fails to find any morecharacters to match, the expression cannot be backtracked and will thusfail to match.x*+, x++ and x?+ are equivalent to (?>x*), (?>x+)and (?>x?) correspondingly.

Causes the resulting RE to match from m to n repetitions of the precedingRE, attempting to match as many repetitions as possible. For example,a3,5 will match from 3 to 5 'a' characters. Omitting m specifies alower bound of zero, and omitting n specifies an infinite upper bound. As anexample, a4,b will match 'aaaab' or a thousand 'a' charactersfollowed by a 'b', but not 'aaab'. The comma may not be omitted or themodifier would be confused with the previously described form.

Causes the resulting RE to match from m to n repetitions of the precedingRE, attempting to match as few repetitions as possible. This is thenon-greedy version of the previous quantifier. For example, on the6-character string 'aaaaaa', a3,5 will match 5 'a' characters,while a3,5? will only match 3 characters.

Causes the resulting RE to match from m to n repetitions of thepreceding RE, attempting to match as many repetitions as possiblewithout establishing any backtracking points.This is the possessive version of the quantifier above.For example, on the 6-character string 'aaaaaa', a3,5+aaattempt to match 5 'a' characters, then, requiring 2 more 'a's,will need more characters than available and thus fail, whilea3,5aa will match with a3,5 capturing 5, then 4 'a'sby backtracking and then the final 2 'a's are matched by the finalaa in the pattern.xm,n+ is equivalent to (?>xm,n).

To match a literal ']' inside a set, precede it with a backslash, orplace it at the beginning of the set. For example, both [()[\]] and[]()[] will match a right bracket, as well as left bracket, braces,and parentheses.

AB, where A and B can be arbitrary REs, creates a regular expression thatwill match either A or B. An arbitrary number of REs can be separated by the'' in this way. This can be used inside groups (see below) as well. Asthe target string is scanned, REs separated by '' are tried from left toright. When one pattern completely matches, that branch is accepted. This meansthat once A matches, B will not be tested further, even if it wouldproduce a longer overall match. In other words, the '' operator is nevergreedy. To match a literal '', use \, or enclose it inside acharacter class, as in [].

Matches whatever regular expression is inside the parentheses, and indicates thestart and end of a group; the contents of a group can be retrieved after a matchhas been performed, and can be matched later in the string with the \numberspecial sequence, described below. To match the literals '(' or ')',use \( or \), or enclose them inside a character class: [(], [)].

This is an extension notation (a '?' following a '(' is not meaningfulotherwise). The first character after the '?' determines what the meaningand further syntax of the construct is. Extensions usually do not create a newgroup; (?P...) is the only exception to this rule. Following are thecurrently supported extensions.

(The flags are described in Module Contents.)This is useful if you wish to include the flags as part of theregular expression, instead of passing a flag argument to there.compile() function.Flags should be used first in the expression string.

A non-capturing version of regular parentheses. Matches whatever regularexpression is inside the parentheses, but the substring matched by the groupcannot be retrieved after performing a match or referenced later in thepattern.

Attempts to match ... as if it was a separate regular expression, andif successful, continues to match the rest of the pattern following it.If the subsequent pattern fails to match, the stack can only be unwoundto a point before the (?>...) because once exited, the expression,known as an atomic group, has thrown away all stack points withinitself.Thus, (?>.*). would never match anything because first the .*would match all characters possible, then, having nothing left to match,the final . would fail to match.Since there are no stack points saved in the Atomic Group, and there isno stack point before it, the entire expression would thus fail to match.

Similar to regular parentheses, but the substring matched by the group isaccessible via the symbolic group name name. Group names must be validPython identifiers, and in bytes patterns they can only containbytes in the ASCII range. Each group name must be defined only once withina regular expression. A symbolic group is also a numbered group, just as ifthe group were not named.

Matches if the current position in the string is not preceded by a match for.... This is called a negative lookbehind assertion. Similar topositive lookbehind assertions, the contained pattern must only match strings ofsome fixed length. Patterns which start with negative lookbehind assertions maymatch at the beginning of the string being searched.

3a8082e126