repo
stringlengths 26
115
| file
stringlengths 54
212
| language
stringclasses 2
values | license
stringclasses 16
values | content
stringlengths 19
1.07M
|
|---|---|---|---|---|
https://github.com/Functional-Bus-Description-Language/Specification | https://raw.githubusercontent.com/Functional-Bus-Description-Language/Specification/master/src/functionalities/bus.typ | typst | == Bus
The bus functionality represents the bus structure.
Every valid description must have at least one bus instantiated, as the bus is the entry point for the description used for the code generation.
The bus functionality has following properties:
*`masters`*` integer (1) {definitive}`
#pad(left: 1em)[
The masters property defines the number of bus master ports.
This property defines how many master ports shall be generated.
However, it is up to the user how many master ports are connected in the design.
]
*`reset`*` string (None) {definitive}`
#pad(left: 1em)[
The reset property defines the bus reset type.
By default the bus has no reset.
Valid values of the reset property are _`"Sync"`_ for synchronous reset and _`"Async"`_ for asynchronous reset.
]
*`width`*` integer (32) {definitive | declarative}`
#pad(left: 1em)[
The width property defines the bus data width.
Whether the width property is definitive or declarative depends on the compiler, more precisely on the compiler back-end.
For example, if the compiler back-end supports only 16 bits data width, then the property is declarative, as it is up to the user to provide the correct width value.
If the compiler back-end can handle multiple data bus widths, then the property is definitive.
]
The bus address width is not explicitly set, as it implies from the address space size required to pack all functionalities included in the bus description.
|
|
https://github.com/mvuorre/quarto-apaish | https://raw.githubusercontent.com/mvuorre/quarto-apaish/main/README.md | markdown | Creative Commons Zero v1.0 Universal | # APA7ish Quarto Typst PDF template
**NOTE: I don't plan to develop this further, instead take a look at <https://github.com/mvuorre/quarto-preprint> for a more comprehensive & Quarto-compliant extension.**
[Quarto](https://quarto.org) extension for creating APA7-ish (American Psychological Association style, 7th edition) manuscripts in PDF format via [Typst](https://typst.app/docs). (See e.g. <https://github.com/wjschne/apaquarto> for a LaTeX PDF template.)
Three document modes (akin to man, doc, and jou [here](https://mirror.lyrahosting.com/CTAN/macros/latex/contrib/apa7/apa7.pdf)) are implemented. View the example documents at <https://github.com/mvuorre/quarto-apaish/releases/latest>:
- [Manuscript](https://github.com/mvuorre/quarto-apaish/releases/latest/download/example-manuscript.pdf)
- [Document](https://github.com/mvuorre/quarto-apaish/releases/latest/download/example-document.pdf)
- [Journal](https://github.com/mvuorre/quarto-apaish/releases/latest/download/example-journal.pdf)
"Manuscript" is the horrid "double-spaced everything on its own page" kind of document, "document" aims to be a basic LaTeX kind of one-column document, whereas "journal" is a two-column document similar to papers published in APA journals.
## Install
Use quarto-apaish in an existing Quarto project:
```bash
quarto add mvuorre/quarto-apaish
```
## Use
In your manuscript's Quarto source document, add the following YAML
```yaml
format: apaish-typst
```
This creates a "[manuscript]((https://github.com/mvuorre/quarto-apaish/releases/latest/download/example-manuscript.pdf))" PDF. To create a "[document](https://github.com/mvuorre/quarto-apaish/releases/latest/download/example-document.pdf)" PDF, specify
```yaml
format:
apaish-typst:
documentmode: doc
```
And to create a "[journal](https://github.com/mvuorre/quarto-apaish/releases/latest/download/example-journal.pdf)" PDF (for preprints etc), specify
```yaml
format:
apaish-typst:
documentmode: jou
```
Quarto documents use YAML metadata to control the document output. See the [example .qmd file](https://github.com/mvuorre/quarto-apaish/blob/main/example.qmd) for examples.
### Tips
#### Fonts
Feel free to use any system fonts, e.g.
```yaml
font: "Libertinus serif"
```
## Limitations
Typst has limited support for tables. A suggested workaround for anything but the most basic tables is to convert your tables to figures, either figuratively speaking or literally. An example of literally converting a table to a figure is shown in the example document.
You currently [cannot](https://github.com/typst/typst/issues/2360) show full-width content in two-column Typst documents, such as `apaish-journal-typst`. So I guess try to make your figures small in journal mode 🤷
|
https://github.com/JCGoran/typst-cv-template | https://raw.githubusercontent.com/JCGoran/typst-cv-template/master/README.md | markdown | # typst CV template
This is a (mostly ATS-friendly) typst CV template which was initially based on [this LaTeX template](https://github.com/muratcankaracabey/latex_cv).
I wanted to learn a bit of typst, so I figured why not make a CV template.
## How to use
See the [example `main.typ`](example.typ) file for usage examples.
This should produce something like this:
Or, if you want to see the PDF, [click here](example.pdf).
Note that as the typst package manager [doesn't support templates yet](https://github.com/typst/packages#user-content-templates), this package is not available there, so it's probably easiest to `git clone` this repo and edit the `example.typ` file to your liking.
## Known issues
- as typst doesn't support user-defined objects yet, calling the functions in the template requires that the user passes the `color` arguments in case the defaults are changed
- the image must be modified manually (via some external program) until [this feature](https://github.com/typst/typst/pull/2338) makes it to a typst stable release
## License
MIT
|
|
https://github.com/zenor0/FZU-report-typst-template | https://raw.githubusercontent.com/zenor0/FZU-report-typst-template/main/fzu-report/utils/bachelor-footnote.typ | typst | MIT License | // Usage: show footnote.entry: bachelor-footnote
// 需要在文档开头使用
#import "fonts.typ": 字体, 字号
#import "numbering-tools.typ": number-with-circle
#let bachelor-footnote(it) = {
let loc = it.note.location()
set par(leading: 14pt)
h(2em)
text(font: 字体.宋体, size: 字号.小五/2, weight: "regular", baseline: -0.5em, numbering(number-with-circle, ..counter(footnote).at(loc)))
h(0.5em)
set text(font: 字体.宋体, size: 字号.小五, weight: "regular", baseline: 0em)
it.note.body
} |
https://github.com/Ngan-Ngoc-Dang-Nguyen/thesis | https://raw.githubusercontent.com/Ngan-Ngoc-Dang-Nguyen/thesis/main/docs/1.3%20center.typ | typst | == BÀI TOÁN 1-CENTER
(chưa quyết định) |
|
https://github.com/typst-doc-cn/tutorial | https://raw.githubusercontent.com/typst-doc-cn/tutorial/main/src/basic/reference-color.typ | typst | Apache License 2.0 | #import "mod.typ": *
#show: book.ref-page.with(title: [参考：颜色、色彩渐变与模式])
== RGB
Create an RGB(A) color. #ref-bookmark[`color.rgb`]
The color is specified in the sRGB color space.
An RGB(A) color is represented internally by an array of four components:
#code(```typ
#square(fill: rgb("#b1f2eb"))
#square(fill: rgb(87, 127, 230))
#square(fill: rgb(25%, 13%, 65%))
```)
== HSL
Create an HSL color. #ref-bookmark[`color.hsl`]
This color space is useful for specifying colors by hue, saturation and lightness. It is also useful for color manipulation, such as saturating while keeping perceived hue.
An HSL color is represented internally by an array of four components:
- hue (angle)
- saturation (ratio)
- lightness (ratio)
- alpha (ratio)
These components are also available using the components method.
#code(```typ
#square(
fill: color.hsl(30deg, 50%, 60%)
)
```)
== CMYK
Create a CMYK color. #ref-bookmark[`color.cmyk`]
This is useful if you want to target a specific printer. The conversion to RGB for display preview might differ from how your printer reproduces the color.
// todo: typo in reference
An CMYK color is represented internally by an array of four components:
- cyan (ratio)
- magenta (ratio)
- yellow (ratio)
- key (ratio)
These components are also available using the components method.
#code(```typ
#square(
fill: cmyk(27%, 0%, 3%, 5%)
)
```)
== Luma
== Oklab
== Oklch
== Linear RGB
== HSV
== 色彩空间
Returns the constructor function for this color's space. #ref-bookmark[`color.space`]
== 十六进制表示（RGB）
Returns the color's RGB(A) hex representation. #ref-bookmark[`color.to-hex`]
Hex such as `#ffaa32` or `#020304fe`. The alpha component (last two digits in `#020304fe`) is omitted if it is equal to ff (255 / 100%).
== 颜色计算
=== lighten
Lightens a color by a given factor. #ref-bookmark[`color.lighten`]
=== darken
Darkens a color by a given factor. #ref-bookmark[`color.darken`]
=== saturate
Increases the saturation of a color by a given factor. #ref-bookmark[`color.saturate`]
=== negate
Produces the negative of the color. #ref-bookmark[`color.negate`]
=== rotate
Rotates the hue of the color by a given angle. #ref-bookmark[`color.rotate`]
=== mix
Create a color by mixing two or more colors. #ref-bookmark[`color.mix`]
== 色彩渐变
A color gradient. #ref-bookmark[`gradient`]
Typst supports linear gradients through the gradient.linear function, radial gradients through the gradient.radial function, and conic gradients through the gradient.conic function.
A gradient can be used for the following purposes:
- As a fill to paint the interior of a shape: ```typc rect(fill: gradient.linear(..))```
- As a stroke to paint the outline of a shape: ```typc rect(stroke: 1pt + gradient.linear(..))```
- As the fill of text: ```typc set text(fill: gradient.linear(..))```
- As a color map you can sample from: ```typc gradient.linear(..).sample(0.5)```
#code(```typ
#stack(
dir: ltr,
spacing: 1fr,
square(fill: gradient.linear(
..color.map.rainbow)),
square(fill: gradient.radial(
..color.map.rainbow)),
square(fill: gradient.conic(
..color.map.rainbow)),
)
```)
== 填充模式
A repeating pattern fill. #ref-bookmark[`pattern`]
Typst supports the most common pattern type of tiled patterns, where a pattern is repeated in a grid-like fashion, covering the entire area of an element that is filled or stroked. The pattern is defined by a tile size and a body defining the content of each cell. You can also add horizontal or vertical spacing between the cells of the patterng.
#code(```typ
#let pat = pattern(size: (30pt, 30pt))[
#place(line(start: (0%, 0%), end: (100%, 100%)))
#place(line(start: (0%, 100%), end: (100%, 0%)))
]
#rect(fill: pat, width: 100%, height: 60pt, stroke: 1pt)
```)
|
https://github.com/almarzn/portfolio | https://raw.githubusercontent.com/almarzn/portfolio/main/README.md | markdown | # Alma's portfolio
This is a demo for a Typst + Github action setup to build a complete skill portfolio using a YAML data source.
Head over to the [latest release](https://github.com/almarzn/portfolio/releases/latest) or the Actions tab to see the produced result.
|
|
https://github.com/OrangeX4/typst-pinit | https://raw.githubusercontent.com/OrangeX4/typst-pinit/main/examples/example.typ | typst | MIT License | #import "../lib.typ": *
#import "@preview/touying:0.5.3": *
#import themes.default: *
#set text(size: 20pt, font: "Calibri", ligatures: false)
#show heading: set text(weight: "regular")
#show heading: set block(above: 1.4em, below: 1em)
#show heading.where(level: 1): set text(size: 1.5em)
// Useful functions
#let crimson = rgb("#c00000")
#let greybox(..args, body) = rect(fill: luma(95%), stroke: 0.5pt, inset: 0pt, outset: 10pt, ..args, body)
#let redbold(body) = {
set text(fill: crimson, weight: "bold")
body
}
#let blueit(body) = {
set text(fill: blue)
body
}
#show: default-theme.with(aspect-ratio: "4-3")
// Main body
#slide[
= Asymptotic Notation: $O$
Use #pin("h1")asymptotic notations#pin("h2") to describe asymptotic efficiency of algorithms.
(Ignore constant coefficients and lower-order terms.)
#pause
#greybox[
Given a function $g(n)$, we denote by $O(g(n))$ the following *set of functions*:
#redbold(${f(n): "exists" c > 0 "and" n_0 > 0, "such that" f(n) <= c dot g(n) "for all" n >= n_0}$)
]
#pinit-highlight("h1", "h2")
#pause
$f(n) = O(g(n))$: #pin(1)$f(n)$ is *asymptotically smaller* than $g(n)$.#pin(2)
#absolute-place(dx: 550pt, dy: 300pt, image(width: 25%, "asymptotic.png"))
#pause
$f(n) redbold(in) O(g(n))$: $f(n)$ is *asymptotically* #redbold[at most] $g(n)$.
#pinit-line(stroke: 3pt + crimson, start-dy: -0.25em, end-dy: -0.25em, 1, 2)
#pause
#block[Insertion Sort as an #pin("r1")example#pin("r2"):]
- Best Case: $T(n) approx c n + c' n - c''$ #pin(3)
- Worst case: $T(n) approx c n + (c' \/ 2) n^2 - c''$ #pin(4)
#pinit-rect("r1", "r2")
#pause
#pinit-place(3, dx: 15pt, dy: -15pt)[#redbold[$T(n) = O(n)$]]
#pinit-place(4, dx: 15pt, dy: -15pt)[#redbold[$T(n) = O(n)$]]
#pause
#blueit[Q: Is $n^(3) = O(n^2)$#pin("que")? How to prove your answer#pin("ans")?]
#pause
#pinit-point-to("que", fill: crimson, redbold[No.])
#pinit-point-from("ans", body-dx: -150pt)[
Show that the equation $(3/2)^n >= c$ \
has infinitely many solutions for $n$.
]
]
|
https://github.com/ClazyChen/Table-Tennis-Rankings | https://raw.githubusercontent.com/ClazyChen/Table-Tennis-Rankings/main/history/2005/MS-02.typ | typst |
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (1 - 32)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[1], [<NAME>], [CHN], [2777],
[2], [<NAME>], [CHN], [2686],
[3], [<NAME>min], [KOR], [2646],
[4], [<NAME>], [CHN], [2599],
[5], [<NAME>], [BLR], [2570],
[6], [<NAME>], [CHN], [2532],
[7], [<NAME>], [GER], [2514],
[8], [<NAME>], [GRE], [2429],
[9], [<NAME>], [AUT], [2412],
[10], [<NAME>], [CHN], [2364],
[11], [<NAME>], [CHN], [2360],
[12], [<NAME>], [ROU], [2346],
[13], [CHUANG Chih-Yuan], [TPE], [2343],
[14], [KORBEL Petr], [CZE], [2313],
[15], [<NAME>], [DEN], [2310],
[16], [<NAME>], [SWE], [2308],
[17], [<NAME>], [KOR], [2302],
[18], [<NAME>], [NED], [2295],
[19], [<NAME>], [CHN], [2284],
[20], [KUZMIN Fedor], [RUS], [2278],
[21], [<NAME>], [HKG], [2275],
[22], [QIU Yike], [CHN], [2264],
[23], [CHIANG Peng-Lung], [TPE], [2260],
[24], [KO Lai Chak], [HKG], [2255],
[25], [CHEUNG Yuk], [HKG], [2253],
[26], [CHEN Weixing], [AUT], [2249],
[27], [LIN Ju], [DOM], [2214],
[28], [<NAME>], [BEL], [2202],
[29], [BLASZCZYK Lucjan], [POL], [2199],
[30], [<NAME>], [SWE], [2197],
[31], [OH Sangeun], [KOR], [2187],
[32], [ROSSKOPF Jorg], [GER], [2181],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (33 - 64)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[33], [LI Ching], [HKG], [2167],
[34], [FEJER-K<NAME>], [GER], [2157],
[35], [LUNDQVIST Jens], [SWE], [2155],
[36], [<NAME>], [CRO], [2152],
[37], [#text(gray, "KIM Taeksoo")], [KOR], [2145],
[38], [<NAME>], [BEL], [2138],
[39], [<NAME>], [DEN], [2131],
[40], [<NAME>], [GER], [2128],
[41], [HE Zhiwen], [ESP], [2122],
[42], [<NAME>], [CHN], [2121],
[43], [<NAME>], [KOR], [2114],
[44], [<NAME>], [CHN], [2113],
[45], [<NAME>], [GER], [2105],
[46], [<NAME>], [AUT], [2104],
[47], [<NAME>], [SLO], [2102],
[48], [<NAME>], [SGP], [2098],
[49], [<NAME>], [SWE], [2098],
[50], [<NAME>], [BUL], [2093],
[51], [<NAME>], [FRA], [2093],
[52], [<NAME>], [SVK], [2086],
[53], [<NAME>], [FRA], [2085],
[54], [<NAME>], [GER], [2084],
[55], [<NAME>], [DEN], [2080],
[56], [<NAME>], [GER], [2073],
[57], [<NAME>], [POL], [2072],
[58], [ERLANDSEN Geir], [NOR], [2067],
[59], [<NAME>], [SRB], [2062],
[60], [LEGOUT Christophe], [FRA], [2059],
[61], [HEISTER Danny], [NED], [2050],
[62], [<NAME>], [DEN], [2043],
[63], [<NAME>], [GER], [2039],
[64], [YANG Min], [ITA], [2029],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (65 - 96)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[65], [<NAME>], [SGP], [2028],
[66], [MAZUNOV Dmitry], [RUS], [2026],
[67], [PAVELKA Tomas], [CZE], [2020],
[68], [SMIRNOV Alexey], [RUS], [2019],
[69], [MATSUSHITA Koji], [JPN], [2016],
[70], [SCHLICHTER Jorg], [GER], [2004],
[71], [<NAME>], [JPN], [2002],
[72], [<NAME>], [CHN], [1986],
[73], [<NAME>], [HUN], [1985],
[74], [<NAME>], [CZE], [1983],
[75], [<NAME>], [POL], [1982],
[76], [<NAME>], [NOR], [1979],
[77], [KUSINSKI Marcin], [POL], [1977],
[78], [HAKANSSON Fredrik], [SWE], [1975],
[79], [CIOTI Constantin], [ROU], [1973],
[80], [#text(gray, "<NAME>")], [ITA], [1963],
[81], [<NAME>], [KOR], [1961],
[82], [CHTCHETININE Evgueni], [BLR], [1961],
[83], [#text(gray, "KRZESZEWSKI Tomasz")], [POL], [1961],
[84], [PHUNG Armand], [FRA], [1957],
[85], [<NAME>], [CZE], [1955],
[86], [<NAME>], [UKR], [1954],
[87], [<NAME>], [SWE], [1952],
[88], [<NAME>], [ARG], [1949],
[89], [<NAME>], [SWE], [1949],
[90], [<NAME>], [RUS], [1948],
[91], [<NAME>], [HUN], [1938],
[92], [<NAME>], [FRA], [1934],
[93], [<NAME>], [CHN], [1934],
[94], [<NAME>], [AUT], [1918],
[95], [#text(gray, "<NAME>")], [FRA], [1915],
[96], [<NAME>], [HUN], [1912],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (97 - 128)",
table(
columns: 4,
[Ranking], [Player], [Country/Region], [Rating],
[97], [OLEJNIK Martin], [CZE], [1912],
[98], [ZWICKL Daniel], [HUN], [1910],
[99], [<NAME>], [SWE], [1906],
[100], [LIVENTSOV Alexey], [RUS], [1906],
[101], [LENGEROV Kostadin], [AUT], [1904],
[102], [<NAME>], [KOR], [1904],
[103], [<NAME>], [FRA], [1904],
[104], [<NAME>], [CZE], [1902],
[105], [#text(gray, "<NAME>")], [ROU], [1900],
[106], [<NAME>], [CRO], [1899],
[107], [<NAME>], [SVK], [1897],
[108], [<NAME>], [NGR], [1894],
[109], [<NAME>], [BRA], [1893],
[110], [<NAME>], [GRE], [1892],
[111], [<NAME>], [CAN], [1890],
[112], [MONTEIRO Joao], [POR], [1889],
[113], [<NAME>], [IND], [1887],
[114], [<NAME>], [GRE], [1881],
[115], [<NAME>], [SVK], [1881],
[116], [<NAME>], [USA], [1880],
[117], [KISHIKAWA Seiya], [JPN], [1877],
[118], [#text(gray, "<NAME>")], [JPN], [1877],
[119], [TANG Peng], [HKG], [1870],
[120], [GRUJIC Slobodan], [SRB], [1866],
[121], [#text(gray, "<NAME>")], [JPN], [1864],
[122], [<NAME>], [GER], [1859],
[123], [ZOOGLING Mikael], [SWE], [1857],
[124], [<NAME>], [ROU], [1853],
[125], [<NAME>], [CZE], [1850],
[126], [<NAME>], [CRO], [1844],
[127], [<NAME>], [FRA], [1844],
[128], [<NAME>], [SVK], [1841],
)
) |
|
https://github.com/antonWetzel/prettypst | https://raw.githubusercontent.com/antonWetzel/prettypst/master/test/default/term.typ | typst | MIT License | / Test:
Some long, irrelevant body.
Spanning multiple lines.
= Seperator
/ A: A
/ B: B
/ C: C
/ D:
D
= Seperator
/ A: A
/ A: A
/ A: A
= Seperator
/ A: #test(
[],
)
|
https://github.com/storopoli/Bayesian-Statistics | https://raw.githubusercontent.com/storopoli/Bayesian-Statistics/main/slides/13-model_comparison.typ | typst | Creative Commons Attribution Share Alike 4.0 International | #import "@preview/polylux:0.3.1": *
#import themes.clean: *
#import "utils.typ": *
#new-section-slide("Model Comparison")
#slide(title: "Recommended References")[
- #cite(<gelman2013bayesian>, form: "prose") - Chapter 7: Evaluating, comparing,
and expanding models
- #cite(<gelman2020regression>, form: "prose") - Chapter 11, Section 11.8: Cross
validation
- #cite(<mcelreath2020statistical>, form: "prose") - Chapter 7, Section 7.5: Model
comparison
- #cite(<vehtariPracticalBayesianModel2015>, form: "prose")
- #cite(<spiegelhalter2002bayesian>, form: "prose")
- #cite(<van2005dic>, form: "prose")
- #cite(<watanabe2010asymptotic>, form: "prose")
- #cite(<gelfand1996model>, form: "prose")
- #cite(<watanabe2010asymptotic>, form: "prose")
- #cite(<geisser1979predictive>, form: "prose")
]
#focus-slide(background: julia-purple)[
#align(center)[#image("images/memes/model_comparison.jpg")]
]
#slide(title: [Why Compare Models?])[
#v(3em)
After model parameters estimation, many times we want to measure its *predictive
accuracy* by itself, or for *model comparison*, *model selection*, or computing
a *model performance metric* @geisser1979predictive.
]
#slide(title: [But What About Visual Posterior Predictive Checks?])[
To analyze and compare models using visual posterior predictive checks is a
*subjective and arbitrary approach*.
#v(1em)
There is an *objective approach to compare Bayesian models* which uses a robust
metric that helps us select the best model in a set of candidate models.
#v(1em)
Having an objective way of comparing and choosing the best model is very
important. In the *Bayesian workflow*, we generally have several iterations
between priors and likelihood functions resulting in several different models
@gelmanBayesianWorkflow2020.
]
#slide(title: [Model Comparison Techniques])[
We have several model comparison techniques that use *predictive accuracy*, but
the main ones are:
- Leave-one-out cross-validation (LOO) @vehtariPracticalBayesianModel2015.
- Deviance Information Criterion (DIC) @spiegelhalter2002bayesian, but it is known
to have some issues, due to not being full-Bayesian, because it is only based on
point estimates @van2005dic,
- Widely Applicable Information Criteria (WAIC) @watanabe2010asymptotic,
full-Bayesian, in the sense that uses the full posterior distribution density,
and it is asymptotically equal to LOO @vehtariPracticalBayesianModel2015.
]
#slide(title: [Historical Interlude])[
#text(size: 16pt)[
In the past, we did not have computational power and data abundance. Model
comparison was done based on a theoretical divergence metric originated from
information theory's entropy:
$
H(p) = - op("E") log(p_i) = -sum^N_(i = 1) p_i log(p_i)
$
We compute the divergence by multiplying entropy by $-2$ #footnote[historical reasons.],
so lower values are preferable:
$
D(
y, bold(θ)
) = -2 dot underbrace(
sum^N_(i = 1) log 1 / S sum^S_(s = 1) P(y_i | bold(θ)^s), "log pointwise predictive density - lppd",
)
$
where $n$ is the sample size and $S$ is the number of posterior draws.
]
]
#slide(title: [Historical Interlude -- AIC @akaike1998information])[
$
"AIC" = D(y, bold(θ)) + 2k = -2 "lppd"_("mle") + 2k
$
where $k$ is the number of the model's free parameters and
$"lppd"_("mle")$ is the maximum likelihood estimate of the log pointwise
predictive density.
#v(1em)
AIC is an approximation and can only be reliable when:
- The priors are uniform (flat priors) or totally dominated by the likelihood
function.
- The posterior is approximate a multivariate normal distribution.
- The sample size $N$ is much larger than the number of the model's free
parameters $k$: $N >> k$
]
#slide(title: [Historical Interlude -- DIC @spiegelhalter2002bayesian])[
A generalization of the AIC, where we replace the maximum likelihood estimate
for the posterior mean and $k$ by a data-based bias correction:
$
"DIC" = D(y, bold(θ)) + k_("DIC") = -2 "lppd"_("Bayes")
+2 underbrace(
("lppd"_("Bayes") - 1 / S sum^S_(s=1) log P(y | bold(θ)^s)), text("bias-corrected") k,
)
$
DIC removes the restriction on uniform AIC priors, but still keeps the
assumptions of the posterior being a multivariate Gaussian/normal distribution
and that $N >> k$.
]
#slide(title: [Predictive Accuracy])[
With current computational power, we do not need approximations #footnote[AIC, DIC etc.].
#v(2em)
We can discuss *predictive accuracy objective metrics*
#v(2em)
But, first, let's define what is predictive accuracy.
]
#slide(title: [Predictive Accuracy])[
Bayesian approaches measure predictive accuracy using posterior draws
$tilde(y)$ from the model. For that we have the predictive posterior
distribution:
$
p(tilde(y) | y) = ∫ p(tilde(y)_i | θ) p(θ | y) dif θ
$
Where $p(θ | y)$ is the model's posterior distribution. The above equation means
that we evaluate the integral with respect to the whole joint probability of the
model's predictive posterior distribution and posterior distribution.
#v(1em)
The *higher* the predictive posterior distribution
$p(tilde(y) | y)$, the *better* will be the model's predictive accuracy.
]
#slide(title: [Predictive Accuracy])[
To make samples comparable, we calculate the expectation of this measure for
each one of the $N$ sample observations:
$
op("elpd") = sum_(i=1)^N ∫ p_t(tilde(y)_i) log p(
tilde(y)_i | y
) dif tilde(y)
$
where $op("elpd")$ is the expected log pointwise predictive density, and $p_t(tilde(y)_i)$ is
the distribution that represents the
$tilde(y)_i$'s true underlying data generating process.
The $p_t(tilde(y)_i)$ are unknown and we generally use cross-validation or
approximations to estimate $op("elpd")$.
]
#slide(title: [Leave-One-Out Cross-Validation (LOO)])[
#text(size: 18pt)[
We can compute the $op("elpd")$ using LOO @vehtariPracticalBayesianModel2015:
$
op("elpd")_("loo") = sum_(i=1)^N log p(y_i | y_(-i))
$
where
$
p(y_i | y_(-i)) = ∫ p(y_i | θ) p(θ | y_(-i)) dif θ
$
which is the predictive density conditioned on the data without a single
observation $i$ ($y_(-i)$). Almost always we use the PSIS-LOO #footnote[upcoming...] approximation
due to its robustness and low computational cost.
]
]
#slide(title: [Widely Applicable Information Criteria (WAIC)])[
#text(size: 12pt)[
WAIC @watanabe2010asymptotic, like LOO, is also an alternative approach to
compute the $op("elpd")$,
and is defined as:
$
hat(op("elpd"))_("waic") = hat(op("lppd")) - hat(p)_("waic")
$
where $hat(p)_("waic")$ is the number of effective parameters based on:
$
hat(p)_("waic") = sum_(i = 1)^N op("var")_("post") (log p(y_i | θ))
$
which we can compute using the posterior variance of the log predictive density
for each observation $y_i$:
$
hat(p)_("waic") = sum_(i = 1)^N V^S_(s = 1) (log p(y_i | θ^s))
$
where $V^S_(s=1)$ is the sample's variance:
$
V^S_(s = 1) a_s = 1 / (S-1) sum^S_(s = 1) (a_s - bar(a))^2
$
]
]
#slide(title: [$K$-fold Cross-Validation ($K$-fold CV)])[
In the same manner that we can compute the $op("elpd")$
using LOO with $N-1$ sample partitions, we can also compute it with any desired
partition number.
#v(1em)
Such approach is called *$K$-fold cross-validation* ($K$-fold CV).
#v(1em)
Contrary to LOO, we cannot approximate the actual $op("elpd")$
using $K$-fold CV, and we need to compute the actual $op("elpd")$ over $K$ partitions,
which almost involves a *high computational cost*.
]
#slide(title: [Pareto Smoothed Importance Sampling LOO (PSIS-LOO)])[
PSIS uses *importance sampling* #footnote[another class of MCMC algorithm that we did not cover yet.],
which means a importance weighting scheme approach.
#v(3em)
The *Pareto smoothing* is a technique to increase the importance weights'
reliability.
]
#slide(title: [Importance Sampling])[
If the $N$ samples are conditionally independent #footnote[
that is, they are independent if conditioned on the model's parameters, which is
a basic assumption in any Bayesian (and frequentist) model
]
@gelfand1992model, we can compute LOO with $bold(θ)^s$ posterior' samples
$P(θ | y)$ using *importance weights*:
$
r_i^s=1 / (P(y_i|θ^s)) ∝ (P(θ^s|y_(-i))) / (P(θ^s|y))
$
Hence, to get Importance Sampling Leave-One-Out (IS-LOO):
$
P(tilde(y)_i | y_(-i))
≈
(sum_(s=1)^S r_i^s P(tilde(y)_i|θ^s)) / (sum_(s=1)^S r_i^s)
$
]
#slide(title: [Importance Sampling])[
However, the posterior $P(θ | y$ often has low variance and shorter tails than
the LOO distributions $P(θ | y_(-1))$. Hence, if we use:
$
P(tilde(y)_i | y_(-i)) ≈ (sum_(s=1)^S r_i^s P(
tilde(y)_i|θ^s
)) / (sum_(s=1)^S r_i^s)
$
#v(1em)
we will have *instabilities* because the $r_i$ can have *high, or even infinite,
variance*.
]
#slide(title: [Pareto Smoothed Importance Sampling])[
We can enhance the IS-LOO estimate using a *Pareto Smoothed Importance Sampling*
@vehtariPracticalBayesianModel2015.
#v(2em)
When the tails of the importance weights' distribution are long, a direct usage
of the importance is sensible to one or more large value. By *fitting a
generalized Pareto distribution to the importance weights' upper-tail*, we
smooth out these values.
]
#slide(title: [Pareto Smoothed Importance Sampling LOO (PSIS-LOO)])[
Finally, we have PSIS-LOO:
$
hat(op("elpd"))_("psis-loo") =
sum_(i=1)^n log
((sum_(s=1)^S w_i^s P(y_i|θ^s)) / (sum_(s=1)^S w_i^s))
$
#v(1em)
where $w$ is the truncated weights.
]
#slide(title: [Pareto Smoothed Importance Sampling LOO (PSIS-LOO)])[
#text(size: 17pt)[
We use the importance weights Pareto distribution's estimated shape parameter
$hat(k)$ to assess its reliability:
- $k < 1 / 2$: the importance weights variance is finite, the central limit
theorem holds, and the estimate rapidly converges.
- $1 / 2 < k < 1$ the importance weights variance is infinite, but the mean exists
(is finite), the generalized central limit theorem for stable distributions
holds, and the estimate converges, but slower. The PSIS variance estimate is
finite, but could be large.
- $k > 1$ both the importance weights variance and mean do not exist (they are
infinite). The PSIS variance estimate is finite, but could be large.
#v(1em)
Any $hat(k) > 0.5$ is a warning sign, but empirically there is still a good
performance up to $hat(k) < 0.7$.
]
]
|
https://github.com/Skimmeroni/Appunti | https://raw.githubusercontent.com/Skimmeroni/Appunti/main/Metodi%20Algebrici/Polinomi/Polinomi.typ | typst | Creative Commons Zero v1.0 Universal | #import "../Metodi_defs.typ": *
Sia dato un certo campo $K$. Prende il nome di *polinomio* a coefficienti
in $K$ e incognita in $x$ qualunque espressione nella forma:
$ p(x) = sum_(i = 0)^(n) a_(i) x^(i) =
a_(n) x^(n) + a_(n − 1) x^(n − 1) + ... + a_(1) x + a_(0)
space "con" space n in NN, a_(i) in K space forall i in {0, ..., n} $
Dove l'intero non negativo $n$ si dice *grado* di $p(x)$ e lo si indica
con $diff (p(x))$. Al polinomio $p(x) = 0$, anche detto *polinomio nullo*,
si attribusce grado $−1$. Il coefficiente $a_(n)$ si dice *coefficiente
direttore* di $p(x)$. Se $a_(n) = 1$, si dice che $p(x)$ è *monico*.
Sui polinomi é possibile definire delle operazioni di somma e di prodotto.
Siano $p(x) = sum_(i = 0)^(n) a_(i) x^(i)$ e $q(x) = sum_(i = 0)^(n) b_(i)
x^(i)$ due polinomi a coefficienti in un campo $K$, di grado rispettivamente
$n$ e $m$. Si assuma, senza perdita di generalitá, che $n gt.eq m$. La somma
fra $p(x)$ e $q(x)$ viene definita come:
$ p(x) + q(x) = (a_(n) x^(n) + ... + a_(1) x + a_(0)) +
(b_(m) x^(m) + ... + b_(1) x + b_(0)) =
sum_(i = m + 1)^(n) a_(i) x^(i) +
sum_(i = 0)^(m) (a_(i) + b_(i)) x^(i) $
Mentre il prodotto come:
$ p(x) q(x) = (a_(n) x^(n) + ... + a_(1) x + a_(0))
(b_(m) x^(m) + ... + b_(1) x + b_(0)) =
sum_(i = 0)^(n) sum_(j = 0)^(m) a_(i) b_(j) x^(i + j) $
#lemma[
Siano $p(x)$ e $q(x)$ due polinomi non nulli. Valgono le seguenti
proprietá:
#grid(
columns: (0.5fr, 0.5fr),
[$ diff(p(x) + q(x)) lt.eq max{diff(p(x)), diff(q(x))} $],
[$ diff(p(x) q(x)) lt.eq diff(p(x)) + diff(q(x)) $]
)
]
#proof[
Segue direttamente dal modo in cui somma e prodotto fra polinomi
sono state definite.
]
La struttura algebrica $(K, +, dot)$, che ha per sostegno l'insieme di tutti
i polinomi a coefficienti in $K$ e incognita in $x$ e per operazioni la somma
fra polinomi ed il prodotto fra polinomi cosí definite si indica con $K[x]$.
#lemma[
La struttura algebrica $K[x]$ é un anello commutativo. L'elemento neutro
per la somma fra polinomi é il polinomio $p(x) = 0$, mentre l'elemento
neutro per il prodotto fra polinomi é $p(x) = 1$.
]
#lemma[
Sia $K[x]$ l'anello dei polinomi nell'incognita $x$ a coefficienti
in un campo $K$. Per un certo $g(x) in K[x]$ fissato, l'insieme
$I = {a(x) g(x) : a(x) in K[x]}$ é un ideale di $K[x]$.
]
Per l'anello $K[x]$ é possibile sviluppare una teoria parallela a quella
dell'anello $ZZ$.
#theorem("Algoritmo della divisione per polinomi")[
Siano $a(x), b(x) in K[x]$, con $b(x)$ non nullo. Esiste una ed
una sola coppia di polinomi $q(x), r(x) in K[x]$ tali che:
+ $a(x) = b(x) q(x) + r(x)$
+ $diff (r(x)) < diff (b(x))$
] <Division-of-polynomials>
// #proof[
// Dimostrabile, da aggiungere
// ]
Dati $a(x), b(x) in K[x]$, i due polinomi $q(x), r(x) in K[x]$ che figurano
nel @Division-of-polynomials sono chiamati rispettivamente *quoziente* e
*resto* della divisione fra $a(x)$ e $b(x)$. Se $r(x) = 0$, si dice che
$b(x)$ _divide_ $a(x)$, e si indica con $b(x) | a(x)$; se invece $b(x)$
non divide $a(x)$, si indica con $b(x) divides.not a(x)$.
Il @Division-of-polynomials fornisce implicitamente un algoritmo che permette
di calcolare la divisione fra due polinomi.
#example[
Siano $a(x) = x^(3) −2x^(2) +x −1$ e $b(x) = 2x^(2) -5$ polinomi sull'anello
$QQ[x]$. Si ha:
#set math.mat(delim: none)
$
mat(
x^(3), −2x^(2), +x, −1, 2x^(2), −5;
-x^(3), space, +frac(5, 2)x, space, space, space;
space, -2x^(2), +frac(7, 2)x, -1, space, space;
space, 2x^(2), space, -5, space, space;
space, space, +frac(7, 2)x, -6, frac(1, 2)x, -1;
augment: #(vline: 4, hline: (2, 4))
)
space space space space space space
p(x) = (frac(1, 2)x - 1)
space space space space space space
q(x) = (frac(7, 2)x - 6)
$
Siano $a(x) = [2]_(7)x^(4) + [-1]_(7)x^(2) +[1]_(7)$ e
$b(x) = [3]_(7)x^(3) + [-2]_(7)$ polinomi sull'anello
$ZZ_(7)[x]$. Si ha:
#set math.mat(delim: none)
$
mat(
[2]_(7)x^(4), +[−1]_(7)x^(2), space, +[1]_(7), [3]_(7)x^(3), +[−2]_(7);
[-2]_(7)x^(4), space, +[6]_(7)x, space, space, space;
space, [-1]_(7)x^(2), +[6]_(7)x, +[1]_(7), [3]_(7)x, space;
augment: #(vline: 4, hline: 2)
)
space space space space space space
p(x) = [3]_(7)x
space space space space space space
q(x) = [-1]_(7)x^(2) + [6]_(7)x + [1]_(7)
$
]
Siano $a(x)$ e $b(x)$ due polinomi non nulli in $K[x]$. Si dice *massimo comun
divisore* tra $a(x)$ e $b(x)$ ogni polinomio $d(x)$ in $K[x]$ tale che:
+ $d(x) | a(x)$ e $d(x) | b(x)$;
+ Se $c(x) in K[x]$ tale per cui $c(x) | a(x)$ e
$c(x) | b(x)$, allora $c(x) | d(x)$.
#theorem("Esistenza di un massimo comun divisore per i polinomi")[
Per qualsiasi $a(x), b(x) in K[x]$ esiste sempre un massimo
comun divisore $d(x)$ fra $a(x)$ e $b(x)$. Esistono inoltre
due polinomi $f(x), g(x) in K[x]$ tali per cui:
$ a(x) f(x) + b(x) g(x) = d(x) $
Che non é altro che l'identitá di Bézout rispetto ai polinomi.
] <MCD-polynomials-exists>
// #proof[
// Dimostrabile, da aggiungere
// ]
#lemma[
Siano $a(x)$ e $b(x)$ due polinomi su $K[x]$, e sia $d(x)$ un massimo
comun divisore fra $a(x)$ e $b(x)$. Allora $tilde(d)(x)$ è un massimo
comun divisore tra $a(x)$ e $b(x)$ se e soltanto se $tilde(d)(x) = k
d(x)$ con $k in K - {0_(dot)}$. In altre parole, il massimo comun divisore
tra due polinomi è univocame determinato a meno di una costante
moltiplicativa non nulla.
] <MCD-polynomials>
// #proof[
// Dimostrabile, da aggiungere
// ]
#corollary[
Dati due polinomi $a(x)$ e $b(x)$ su $K[x]$, esiste uno ed un
solo polinomio monico $d(x)$ che sia massimo comun divisore
tra $a(x)$ e $b(x)$.
]
#proof[
Se per il @MCD-polynomials i massimi comuni divisori fra due
polinomi sono determinati a meno di una costante, allora esiste
un solo polinomio che abbia $1$ come coefficiente direttore,
ovvero un solo polinomio monico.
]
Per comoditá, con $"MCD"(a(x), b(x))$ si indica il massimo comun
divisore fra i polinomi $a(x)$ e $b(x)$ su $K[x]$ che ha $1$ come
coefficiente direttore. In particolare, se il grado del massimo
comun divisore è zero, allora tale massimo comun divisore è 1.
In questo caso, i polinomi $a(x)$ e $b(x)$ si dicono *coprimi* o
*primi fra di loro*.
#example[
#set math.mat(delim: none)
Siano $a(x) = x^(3) + 1$ e $b(x) = x^(2) + 1$
polinomi sull'anello $QQ[x]$. Si ha:
$
mat(
x^(3), space, +1, x^(2), +1;
-x^(3), -x, space, space, space;
space, -x, +1, x, space;
augment: #(vline: 3, hline: 2)
)
space space space space space
mat(
x^(2), space, +1, -x, +1;
-x^(2), +x, space, space, space;
space, x, +1, space, space;
space, -x, +1, space, space;
space, space, 2, -x, -1;
augment: #(vline: 3, hline: (2, 4))
)
space space space space space
mat(
a(x) &= b(x)(x) + (-x + 1);
b(x) &= (-x + 1)(-x - 1) + 2
)
$
Un massimo comun divisore fra $a(x)$ e $b(x)$ é $d(x) = 2$,
pertanto $"MCD"(a(x), b(x)) = frac(d(x), 2) = 1$. É poi
possibile costruire l'identitá di Bézout come:
$
a(x) =& b(x)(x) + (-x + 1) => (-x + 1) = a(x) - b(x)(x) \
b(x) =& (-x + 1)(-x - 1) + 2 => b(x) - [a(x) - b(x)(x)](-x - 1) = 2 => \
& b(x) + a(x)x + a(x) - b(x)(x^(2)) - b(x)(x) = 2 => \
& a(x)(x + 1) + b(x)(- x^(2) - x + 1) = 2 => \
& frac(a(x)(x + 1) + b(x)(- x^(2) - x + 1), 2) =
frac(cancel(2), cancel(2)) => \
& a(x)(frac(x, 2) + frac(1, 2)) +
b(x)(- frac(x^(2), 2) - frac(x, 2) + frac(1, 2)) = 1
$
Siano $a(x) = [1]_(5)x^(3) + [1]_(5)x^(2) + [1]_(5)x + [1]_(5)$ e
$b(x) = [3]_(5)x^(2) + [2]_(5)x + [2]_(5)$ polinomi sull'anello
$ZZ_(5)[x]$. Si ha:
$
mat(
[1]_(5)x^(3), +[1]_(5)x^(2), +[1]_(5)x, +[1]_(5), [3]_(5)x^(2), +[2]_(5)x, +[2]_(5);
[-6]_(5)x^(3), +[-4]_(5)x^(2), +[-4]_(5)x, space, space, space, space;
space, [2]_(5)x^(2), +[2]_(5)x, +[1]_(5), space, space, space;
space, [-12]_(5)x^(2), +[-8]_(5)x, +[-8]_(5), space, space, space;
space, space, [4]_(5)x, +[3]_(5), [2]_(5)x, +[4]_(5), space;
augment: #(vline: 4, hline: (2, 4))
)
space space space space space
mat(
[3]_(5)x^(2), +[2]_(5)x, +[2]_(5), [4]_(5)x, +[3]_(5);
[-8]_(5)x^(2), +[-6]_(5)x, space, space, space;
space, [1]_(5)x, +[2]_(5), space, space;
space, [-16]_(5)x, +[-12]_(5), space, space;
space, space, 0, [2]_(5)x, +[4]_(5);
augment: #(vline: 3, hline: (2, 4))
)
$
$ a(x) = b(x)([2]_(5)x + [4]_(5)) + ([4]_(5)x + [3]_(5)) =>
a(x)[1]_(5) - b(x)([2]_(5)x + [4]_(5)) = [4]_(5)x + [3]_(5) $
Un massimo comun divisore fra $a(x)$ e $b(x)$ é $d(x) = [4]_(5)x +
[3]_(5)$, pertanto $"MCD"(a(x), b(x)) = frac(d(x), [4]_(5)) = [1]_(5)x
+ [3]_(5)$. É poi possibile costruire l'identitá di Bézout come:
$ frac(a(x)[1]_(5) - b(x)([2]_(5)x + [4]_(5)), [4]_(5)) =
frac([4]_(5)x + [3]_(5), [4]_(5)) => a(x)[4]_(5) -
b(x)([3]_(5)x + [1]_(5)) = [1]_(5)x +[3]_(5) $
]
Sia $p(x)$ un polinomio in $K[x]$, con $diff (p(x)) > 0$. Il polinomio
$p(x)$ si dice *primo* se, per qualsiasi $a(x), b(x) in K[x]$, $p(x)
| a(x) b(x)$ implica $p(x) | a(x)$ oppure $p(x) | b(x)$.
Il polinomio $p(x) in K[x]$ con $diff (p(x)) > 0$ viene detto *irriducibile*
se i suoi divisori sono solo e soltanto i polinomi di grado $0$ ed i
polinomi nella forma $h p(x)$, con $h in (K - {0_(dot)})$.
#theorem[
Il polinomio $p(x) in K[x]$, con $diff (p(x)) > 0$ é primo se e
solo se é irriducibile (ovvero, le due definizioni sono equivalenti).
]
// #proof[
// Dimostrabile, da aggiungere
// ]
Si dice che un polinomio $p(x) in K[x]$ viene *fattorizzato in polinomi
primi* quando tale polinomio viene scritto come prodotto di soli polinomi
primi (non necessariamente distinti) appartenenti a $K[x]$. In genere, una
fattorizzazione viene espressa raccogliendo a fattor comune i polinomi primi
per mettere in evidenza la loro molteplicitá. Naturalmente, la fattorizzazione
in polinomi primi di un polinomio primo é sé stesso, a meno di una costante
moltiplicativa non nulla.
#example[
- Il polinomio $a(x) = x^(2) − 2$ è irriducibile in $QQ[x]$. Non lo
é peró in $RR[x]$, perché ha $b(x) = x + sqrt(2)$ come divisore,
e puó essere infatti fattorizzato come $x^(2) − 2 = (x − sqrt(2))
(x + sqrt(2))$;
- Il polinomio $a(x) = x^(2) + 1$ è irriducibile in $RR[x]$. Non lo
è peró in $CC[x]$, perché ha $b(x) = x + i$ come divisore, e puó
essere infatti fattorizzato come $x^(2) + 1 = (x − i)(x + i)$.
]
#theorem("Teorema fondamentale dell'aritmetica per i polinomi")[
Per ogni polinomio $p(x) in K[x]$ tale che $diff (p(x)) > 0$
esiste una sua fattorizzazione in polinomi primi in $K[x]$.
Tale fattorizzazione é sostanzialmente unica, a meno dell'ordine
in cui si dispongono i fattori e della "distribuzione" di costanti
moltiplicative.
]
// #proof[
// Dimostrabile, da aggiungere
// ]
#corollary[
Ogni polinomio $a(x) in K[x]$ di grado $diff (p(x)) > 0$ puó essere
fattorizzato come $a(x) = k a_(1) (x) ... a_(m) (x)$, dove $k in
(K - {0})$ è il coefficiente direttore di $a(x)$ ed i polinomi
$a_(1) (x), ..., a_(m) (x)$ sono monici e irriducibili. Tale
scrittura è unica, a meno dell'ordine dei fattori.
] <Completely-factored>
// #proof[
// Dimostrabile, da aggiungere
// ]
Un polinomio scritto nella forma presentata nel @Completely-factored si
dice *completamente fattorizzato*.
#example[
Si consideri il polinomio a coefficienti in $QQ$:
$ p(x) = frac(1, 3) x^(3) + frac(3, 4) x^(2) + frac(1, 8) x - frac(1, 12) $
Tale polinomio puó essere fattorizzato in polinomi primi in diversi
modi, tutti equivalenti. L'unica differenza fra questi sta nella scelta
dell'ordine dei fattori e del modo in cui costanti moltiplicative comuni
vengono raccolte. Ad esempio:
#grid(
columns: (0.34fr, 0.34fr, 0.31fr),
[$ (frac(1, 3) x + frac(1, 6))(frac(1, 2) x - frac(1, 8))
(frac(1, 2) x + 1) $],
[$ (frac(1, 12) x + frac(1, 24))(4 x - 1)
(x + 2) $],
[$ (x - frac(1, 4))(x + 2)(frac(1, 3) x + frac(1, 6)) $]
)
Esiste peró un solo modo (ad eccezione, di nuovo, dell'ordine in cui i
fattori sono disposti) per scrivere il polinomio in forma completamente
fattorizzata, ed é il seguente:
$ frac(1, 3)(x + frac(1, 2))(x - frac(1, 4))(x + 2) $
]
|
https://github.com/dariakoz/Typst-Template | https://raw.githubusercontent.com/dariakoz/Typst-Template/main/Abschnitte/Thema%201.typ | typst | #import "@preview/sourcerer:0.2.1": code
#import "@preview/acrostiche:0.3.1": *
#import "../lib/todo.typ": todo, outline-todos
#init-acronyms((
"ERP": ("Enterprise Resource Planning"),
"B1": ("Business One"),
))
= Einleitung
== Vorstellung des Praxispartner
[...]
== Überblick
[...]
== Problemstellung
#todo("Konkrete Probleme en die durch diese Implementierung behoben werden könnten.")
[...]
== Zielstellung
@Ritchie.1988
#pagebreak() |
|
https://github.com/antonWetzel/prettypst | https://raw.githubusercontent.com/antonWetzel/prettypst/master/test/otbs/term.typ | typst | MIT License | / Test: Some long, irrelevant body. Spanning multiple lines.
= Seperator
/ A: A
/ B: B
/ C: C
/ D: D
= Seperator
/ A: A
/ A: A
/ A: A
= Seperator
/ A: #test(
[],
)
|
https://github.com/sardorml/vantage-typst | https://raw.githubusercontent.com/sardorml/vantage-typst/main/example.typ | typst | MIT License | #import "vantage-typst.typ": vantage, term, skill, styled-link
#let configuration = yaml("configuration.yaml")
#vantage(
name: configuration.contacts.name,
position: configuration.position,
links: (
(name: "email", link: "mailto:"+ configuration.contacts.email),
(name: "website", link: configuration.contacts.website.url, display: configuration.contacts.website.displayText),
(name: "github", link: configuration.contacts.github.url, display: configuration.contacts.github.displayText),
(name: "linkedin", link: configuration.contacts.linkedin.url, display: configuration.contacts.linkedin.displayText),
(name: "location", link: "", display: configuration.contacts.address)
),
tagline: (configuration.tagline),
[
== Experience
#for job in configuration.jobs [
=== #job.position \
_#link(job.company.link)[#job.company.name]_ - #styled-link(job.product.link)[#job.product.name] \
#term[#job.from --- #job.to][#job.location]
#for point in job.description [
- #point
]
]
],
[
== Objective
#configuration.objective
== Education
#for edu in configuration.education [
=== #if edu.place.link != "" [
#link(edu.place.link)[#edu.place.name]\
] else [
#edu.place.name\
]
#edu.from - #edu.to #h(1fr) #edu.location
#edu.degree in #edu.major
]
== Technical Expertise
#for expertise in configuration.technical_expertise [
#skill(expertise.name, expertise.level)
]
== Skills/Exposure
#for skill in configuration.skills [
• #skill
]
== Methodology/Approach
#for method in configuration.methodology [
• #method
]
== Tools
#for tool in configuration.tools [
• #tool
]
== Achievements/Certifications
#for achievement in configuration.achievements [
=== #achievement.name
\
#achievement.description
]
]
)
|
https://github.com/giZoes/justsit-thesis-typst-template | https://raw.githubusercontent.com/giZoes/justsit-thesis-typst-template/main/resources/pages/fonts-display-page.typ | typst | MIT License | #import "../utils/style.typ": 字号, 字体
#import "../utils/hline.typ": hline
// 字体显示测试页
#let fonts-display-page(
twoside: false,
fonts: (:),
size: 字号.小四,
lang: "zh",
) = {
// 1. 默认参数
fonts = 字体 + fonts
// 2. 辅助函数
let display-font(cjk-name, latin-name) = [
#set text(font: fonts.at(cjk-name))
#cjk-name (#latin-name CJK Regular): 落霞与孤鹜齐飞，秋水共长天一色。
#cjk-name (#latin-name Latin Regular): The fanfare of birds announces the morning.
*#cjk-name (#latin-name CJK Bold): 落霞与孤鹜齐飞，秋水共长天一色。*
*#cjk-name (#latin-name Latin Bold): The fanfare of birds announces the morning.*
]
// 3. 正式渲染
pagebreak(weak: true, to: if twoside { "odd" })
set text(size: size, lang: lang)
[
*Fonts Display Page:*
#hline()
#display-font("宋体", "SongTi")
#hline()
#display-font("黑体", "HeiTi")
#hline()
#display-font("楷体", "KaiTi")
#hline()
#display-font("仿宋", "FangSong")
#hline()
#display-font("等宽", "Mono")
]
} |
https://github.com/frectonz/the-pg-book | https://raw.githubusercontent.com/frectonz/the-pg-book/main/book/062.%20marginal.html.typ | typst | marginal.html
The Power of the Marginal
Want to start a startup? Get funded by
Y Combinator.
June 2006(This essay is derived from talks at Usenix 2006 and
Railsconf 2006.)A couple years ago my friend Trevor and I went to look at the Apple
garage. As we stood there, he said that as a kid growing up in
Saskatchewan he'd been amazed at the dedication Jobs and Wozniak
must have had to work in a garage."Those guys must have been
freezing!"That's one of California's hidden advantages: the mild climate means
there's lots of marginal space. In cold places that margin gets
trimmed off. There's a sharper line between outside and inside,
and only projects that are officially sanctioned — by organizations,
or parents, or wives, or at least by oneself — get proper indoor
space. That raises the activation energy for new ideas. You can't
just tinker. You have to justify.Some of Silicon Valley's most famous companies began in garages:
Hewlett-Packard in 1938, Apple in 1976, Google in 1998. In Apple's
case the garage story is a bit of an urban legend. Woz says all
they did there was assemble some computers, and that he did all the
actual design of the Apple I and Apple II in his apartment or his
cube at HP.
[1]
This was apparently too marginal even for Apple's PR
people.By conventional standards, Jobs and Wozniak were marginal people
too. Obviously they were smart, but they can't have looked good
on paper. They were at the time a pair of college dropouts with
about three years of school between them, and hippies to boot.
Their previous business experience consisted of making "blue boxes"
to hack into the phone system, a business with the rare distinction
of being both illegal and unprofitable.OutsidersNow a startup operating out of a garage in Silicon Valley would
feel part of an exalted tradition, like the poet in his garret, or
the painter who can't afford to heat his studio and thus has to
wear a beret indoors. But in 1976 it didn't seem so cool. The
world hadn't yet realized that starting a computer company was in
the same category as being a writer or a painter. It hadn't been
for long. Only in the preceding couple years had the dramatic fall
in the cost of hardware allowed outsiders to compete.In 1976, everyone looked down on a company operating out of a garage,
including the founders. One of the first things Jobs did when they
got some money was to rent office space. He wanted Apple to seem
like a real company.They already had something few real companies ever have: a fabulously well
designed product. You'd think they'd have had more confidence.
But I've talked to a lot of startup founders, and it's always this
way. They've built something that's going to change the world, and
they're worried about some nit like not having proper business
cards.That's the paradox I want to explore: great new things often come
from the margins, and yet the people who discover them are looked
down on by everyone, including themselves.It's an old idea that new things come from the margins. I want to
examine its internal structure. Why do great ideas come from the
margins? What kind of ideas? And is there anything we can do to
encourage the process?InsidersOne reason so many good ideas come from the margin is simply that
there's so much of it. There have to be more outsiders than insiders,
if insider means anything. If the number of outsiders is huge it
will always seem as if a lot of ideas come from them, even if few
do per capita. But I think there's more going on than this. There
are real disadvantages to being an insider, and in some kinds of
work they can outweigh the advantages.Imagine, for example, what would happen if the government decided
to commission someone to write an official Great American Novel.
First there'd be a huge ideological squabble over who to choose.
Most of the best writers would be excluded for having offended one
side or the other. Of the remainder, the smart ones would refuse
such a job, leaving only a few with the wrong sort of ambition.
The committee would choose one at the height of his career — that
is, someone whose best work was behind him — and hand over the
project with copious free advice about how the book should show in
positive terms the strength and diversity of the American people,
etc, etc.The unfortunate writer would then sit down to work with a huge
weight of expectation on his shoulders. Not wanting to blow such
a public commission, he'd play it safe. This book had better command
respect, and the way to ensure that would be to make it a tragedy.
Audiences have to be enticed to laugh, but if you kill people they
feel obliged to take you seriously. As everyone knows, America
plus tragedy equals the Civil War, so that's what it would have to
be about. When finally
completed twelve years later, the book would be a 900-page pastiche
of existing popular novels — roughly Gone with the Wind plus
Roots. But its bulk and celebrity would make it a bestseller
for a few months, until blown out of the water by a talk-show host's
autobiography. The book would be made into a movie and thereupon
forgotten, except by the more waspish sort of reviewers, among whom
it would be a byword for bogusness like Milli Vanilli or Battlefield
Earth.Maybe I got a little carried away with this example. And yet is
this not at each point the way such a project would play out? The
government knows better than to get into the novel business, but
in other fields where they have a natural monopoly, like nuclear
waste dumps, aircraft carriers, and regime change, you'd find plenty
of projects isomorphic to this one — and indeed, plenty that were
less successful.This little thought experiment suggests a few of the disadvantages
of insider projects: the selection of the wrong kind of people, the
excessive scope, the inability to take risks, the need to seem
serious, the weight of expectations, the power of vested interests,
the undiscerning audience, and perhaps most dangerous, the tendency
of such work to become a duty rather than a pleasure.TestsA world with outsiders and insiders implies some kind of test for
distinguishing between them. And the trouble with most tests for
selecting elites is that there are two ways to pass them: to be
good at what they try to measure, and to be good at hacking the
test itself.So the first question to ask about a field is how honest its tests
are, because this tells you what it means to be an outsider. This
tells you how much to trust your instincts when you disagree with
authorities, whether it's worth going through the usual channels
to become one yourself, and perhaps whether you want to work in
this field at all.Tests are least hackable when there are consistent standards for
quality, and the people running the test really care about its
integrity. Admissions to PhD programs in the hard sciences are
fairly honest, for example. The professors will get whoever they
admit as their own grad students, so they try hard to choose well,
and they have a fair amount of data to go on. Whereas undergraduate
admissions seem to be much more hackable.One way to tell whether a field has consistent standards is the
overlap between the leading practitioners and the people who teach
the subject in universities. At one end of the scale you have
fields like math and physics, where nearly all the teachers are
among the best practitioners. In the middle are medicine, law,
history, architecture, and computer science, where many are. At
the bottom are business, literature, and the visual arts, where
there's almost no overlap between the teachers and the leading
practitioners. It's this end that gives rise to phrases like "those
who can't do, teach."Incidentally, this scale might be helpful in deciding what to study
in college. When I was in college the rule seemed to be that you
should study whatever you were most interested in. But in retrospect
you're probably better off studying something moderately interesting
with someone who's good at it than something very interesting with
someone who isn't. You often hear people say that you shouldn't
major in business in college, but this is actually an instance of
a more general rule: don't learn things from teachers who are bad
at them.How much you should worry about being an outsider depends on the
quality of the insiders. If you're an amateur mathematician and
think you've solved a famous open problem, better go back and check.
When I was in grad school, a friend in the math department had the
job of replying to people who sent in proofs of Fermat's last theorem
and so on, and it did not seem as if he saw it as a valuable source
of tips — more like manning a mental health hotline. Whereas if
the stuff you're writing seems different from what English professors
are interested in, that's not necessarily a problem.Anti-TestsWhere the method of selecting the elite is thoroughly corrupt, most
of the good people will be outsiders. In art, for example, the
image of the poor, misunderstood genius is not just one possible
image of a great artist: it's the standard image. I'm not
saying it's correct, incidentally, but it is telling how well this
image has stuck. You couldn't make a rap like that stick to math
or medicine.
[2]If it's corrupt enough, a test becomes an anti-test, filtering out
the people it should select by making them to do things only the
wrong people would do. Popularity in high school
seems to be such a test. There are plenty of similar ones in the grownup
world. For example, rising up through the hierarchy of the average
big company demands an attention to politics few thoughtful people
could spare.
[3]
Someone like <NAME> can grow a company under
him, but it's hard to imagine him having the patience to climb the
corporate ladder at General Electric — or Microsoft, actually.It's kind of strange when you think about it, because lord-of-the-flies
schools and bureaucratic companies are both the default. There are
probably a lot of people who go from one to the other and never
realize the whole world doesn't work this way.I think that's one reason big companies are so often blindsided by
startups.
People at big companies don't realize the extent to which
they live in an environment that is one large, ongoing test for the
wrong qualities.If you're an outsider, your best chances for beating insiders are
obviously in fields where corrupt tests select a lame elite. But
there's a catch: if the tests are corrupt, your victory won't be
recognized, at least in your lifetime. You may feel you don't need
that, but history suggests it's dangerous to work in fields with
corrupt tests. You may beat the insiders, and yet not do as good
work, on an absolute scale, as you would in a field that was more
honest.Standards in art, for example, were almost as corrupt in the first
half of the eighteenth century as they are today. This was the era
of those fluffy idealized portraits of countesses with their lapdogs.
Chardin
decided to skip all that and paint ordinary things as he
saw them. He's now considered the best of that period — and yet
not the equal of Leonardo or Bellini or Memling, who all had the
additional encouragement of honest standards.It can be worth participating in a corrupt contest, however, if
it's followed by another that isn't corrupt. For example, it would
be worth competing with a company that can spend more than you on
marketing, as long as you can survive to the next round, when
customers compare your actual products. Similarly, you shouldn't
be discouraged by the comparatively corrupt test of college admissions,
because it's followed immediately by less hackable tests.
[4]RiskEven in a field with honest tests, there are still advantages to
being an outsider. The most obvious is that outsiders have nothing
to lose. They can do risky things, and if they fail, so what? Few
will even notice.The eminent, on the other hand, are weighed down by their eminence.
Eminence is like a suit: it impresses the wrong people, and it
constrains the wearer.Outsiders should realize the advantage they have here. Being able
to take risks is hugely valuable. Everyone values safety too much,
both the obscure and the eminent. No one wants to look like a fool.
But it's very useful to be able to. If most of your ideas aren't
stupid, you're probably being too conservative. You're not bracketing
the problem.Lord Acton said we should judge talent at its best and character
at its worst. For example, if you write one great book and ten bad
ones, you still count as a great writer — or at least, a better
writer than someone who wrote eleven that were merely good. Whereas
if you're a quiet, law-abiding citizen most of the time but
occasionally cut someone up and bury them in your backyard, you're
a bad guy.Almost everyone makes the mistake of treating ideas as if they were
indications of character rather than talent — as if having a stupid
idea made you stupid. There's a huge weight of tradition advising
us to play it safe. "Even a fool is thought wise if he keeps
silent," says the Old Testament (Proverbs 17:28).Well, that may be fine advice for a bunch of goatherds in Bronze
Age Palestine. There conservatism would be the order of the day.
But times have changed. It might still be reasonable to stick with
the Old Testament in political questions, but materially the world
now has a lot more state. Tradition is less of a guide, not just
because things change faster, but because the space of possibilities
is so large. The more complicated the world gets, the more valuable
it is to be willing to look like a fool.DelegationAnd yet the more successful people become, the more heat they get
if they screw up — or even seem to screw up. In this respect, as
in many others, the eminent are prisoners of their own success. So
the best way to understand the advantages of being an outsider may
be to look at the disadvantages of being an insider.If you ask eminent people what's wrong with their lives, the first
thing they'll complain about is the lack of time. A friend of mine
at Google is fairly high up in the company and went to work for
them long before they went public. In other words, he's now rich
enough not to have to work. I asked him if he could still endure
the annoyances of having a job, now that he didn't have to. And
he said that there weren't really any annoyances, except — and he
got a wistful look when he said this — that he got so much
email.The eminent feel like everyone wants to take a bite out of them.
The problem is so widespread that people pretending to be eminent
do it by pretending to be overstretched.The lives of the eminent become scheduled, and that's not good for
thinking. One of the great advantages of being an outsider is long,
uninterrupted blocks of time. That's what I remember about grad
school: apparently endless supplies of time, which I spent worrying
about, but not writing, my dissertation. Obscurity is like health
food — unpleasant, perhaps, but good for you. Whereas fame tends
to be like the alcohol produced by fermentation. When it reaches
a certain concentration, it kills off the yeast that produced it.The eminent generally respond to the shortage of time by turning
into managers. They don't have time to work. They're surrounded
by junior people they're supposed to help or supervise. The obvious
solution is to have the junior people do the work. Some good
stuff happens this way, but there are problems it doesn't work so
well for: the kind where it helps to have everything in one head.For example, it recently emerged that the famous glass artist <NAME> hasn't actually blown glass for 27 years. He has assistants
do the work for him. But one of the most valuable sources of ideas
in the visual arts is the resistance of the medium. That's why oil
paintings look so different from watercolors. In principle you
could make any mark in any medium; in practice the medium steers
you. And if you're no longer doing the work yourself, you stop
learning from this.So if you want to beat those eminent enough to delegate, one way
to do it is to take advantage of direct contact with the medium.
In the arts it's obvious how: blow your own glass, edit your own
films, stage your own plays. And in the process pay close attention
to accidents and to new ideas you have on the fly. This technique
can be generalized to any sort of work: if you're an outsider, don't
be ruled by plans. Planning is often just a weakness forced on
those who delegate.Is there a general rule for finding problems best solved in one
head? Well, you can manufacture them by taking any project usually
done by multiple people and trying to do it all yourself. Wozniak's
work was a classic example: he did everything himself, hardware and
software, and the result was miraculous. He claims not one bug was
ever found in the Apple II, in either hardware or software.Another way to find good problems to solve in one head is to focus
on the grooves in the chocolate bar — the places where tasks are
divided when they're split between several people. If you want to
beat delegation, focus on a vertical slice: for example, be both
writer and editor, or both design buildings and construct them.One especially good groove to span is the one between tools and
things made with them. For example, programming languages and
applications are usually written by different people, and this is
responsible for a lot of the worst flaws in
programming languages.
I think every language should be designed simultaneously with a
large application written in it, the way C was with Unix.Techniques for competing with delegation translate well into business,
because delegation is endemic there. Instead of avoiding it as a
drawback of senility, many companies embrace it as a sign of maturity.
In big companies software is often designed, implemented, and sold
by three separate types of people. In startups one person may have
to do all three. And though this feels stressful, it's one reason
startups win. The needs of customers and the means of satisfying
them are all in one head.FocusThe very skill of insiders can be a weakness. Once someone is good
at something, they tend to spend all their time doing that. This
kind of focus is very valuable, actually. Much of the skill of
experts is the ability to ignore false trails. But focus has
drawbacks: you don't learn from other fields, and when a new approach
arrives, you may be the last to notice.For outsiders this translates into two ways to win. One is to work
on a variety of things. Since you can't derive as much benefit
(yet) from a narrow focus, you may as well cast a wider net and
derive what benefit you can from similarities between fields. Just
as you can compete with delegation by working on larger vertical
slices, you can compete with specialization by working on larger
horizontal slices — by both writing and illustrating your book, for
example.The second way to compete with focus is to see what focus overlooks.
In particular, new things. So if you're not good at anything yet,
consider working on something so new that no one else is either.
It won't have any prestige yet, if no one is good at it, but you'll
have it all to yourself.The potential of a new medium is usually underestimated, precisely
because no one has yet explored its possibilities. Before
Durer
tried making engravings, no one took them very seriously. Engraving
was for making little devotional images — basically fifteenth century
baseball cards of saints. Trying to make masterpieces in this
medium must have seemed to Durer's contemporaries the way that,
say, making masterpieces in
comics
might seem to the average person
today.In the computer world we get not new mediums but new platforms: the
minicomputer, the microprocessor, the web-based application. At
first they're always dismissed as being unsuitable for real work.
And yet someone always decides to try anyway, and it turns out you
can do more than anyone expected. So in the future when you hear
people say of a new platform: yeah, it's popular and cheap, but not
ready yet for real work, jump on it.As well as being more comfortable working on established lines,
insiders generally have a vested interest in perpetuating them.
The professor who made his reputation by discovering some new idea
is not likely to be the one to discover its replacement. This is
particularly true with companies, who have not only skill and pride
anchoring them to the status quo, but money as well. The Achilles
heel of successful companies is their inability to cannibalize
themselves. Many innovations consist of replacing something with
a cheaper alternative, and companies just don't want to see a path
whose immediate effect is to cut an existing source of revenue.So if you're an outsider you should actively seek out contrarian
projects. Instead of working on things the eminent have made
prestigious, work on things that could steal that prestige.The really juicy new approaches are not the ones insiders reject
as impossible, but those they ignore as undignified. For example,
after Wozniak designed the Apple II he offered it first to his
employer, HP. They passed. One of the reasons was that, to save
money, he'd designed the Apple II to use a TV as a monitor, and HP
felt they couldn't produce anything so declasse.LessWozniak used a TV as a monitor for the simple reason that he couldn't
afford a monitor. Outsiders are not merely free but compelled to
make things that are cheap and lightweight. And both are good bets
for growth: cheap things spread faster, and lightweight things
evolve faster.The eminent, on the other hand, are almost forced to work on a large
scale. Instead of garden sheds they must design huge art museums.
One reason they work on big things is that they can: like our
hypothetical novelist, they're flattered by such opportunities.
They also know that big projects will by their sheer bulk impress
the audience. A garden shed, however lovely, would be easy to
ignore; a few might even snicker at it. You can't snicker at a
giant museum, no matter how much you dislike it. And finally, there
are all those people the eminent have working for them; they have
to choose projects that can keep them all busy.Outsiders are free of all this. They can work on small things, and
there's something very pleasing about small things. Small things
can be perfect; big ones always have something wrong with them.
But there's a
magic
in small things that goes beyond such rational
explanations. All kids know it. Small things have more personality.Plus making them is more fun. You can do what you want; you don't
have to satisfy committees. And perhaps most important, small
things can be done fast. The prospect of seeing the finished project
hangs in the air like the smell of dinner cooking. If you work
fast, maybe you could have it done tonight.Working on small things is also a good way to learn. The most
important kinds of learning happen one project at a time. ("Next
time, I won't...") The faster you cycle through projects, the
faster you'll evolve.Plain materials have a charm like small scale. And in addition
there's the challenge of making do with less. Every designer's
ears perk up at the mention of that game, because it's a game you
can't lose. Like the JV playing the varsity, if you even tie, you
win. So paradoxically there are cases where fewer resources yield
better results, because the designers' pleasure at their own ingenuity
more than compensates.
[5]So if you're an outsider, take advantage of your ability to make
small and inexpensive things. Cultivate the pleasure and simplicity
of that kind of work; one day you'll miss it.ResponsibilityWhen you're old and eminent, what will you miss about being young
and obscure? What people seem to miss most is the lack of
responsibilities.Responsibility is an occupational disease of eminence. In principle
you could avoid it, just as in principle you could avoid getting
fat as you get old, but few do. I sometimes suspect that responsibility
is a trap and that the most virtuous route would be to shirk it,
but regardless it's certainly constraining.When you're an outsider you're constrained too, of course. You're
short of money, for example. But that constrains you in different
ways. How does responsibility constrain you? The worst thing is
that it allows you not to focus on real work. Just as the most
dangerous forms of
procrastination
are those that seem like work,
the danger of responsibilities is not just that they can consume a
whole day, but that they can do it without setting off the
kind of alarms you'd set off if you spent a whole day sitting on a
park bench.A lot of the pain of being an outsider is being aware of one's own
procrastination. But this is actually a good thing. You're at
least close enough to work that the smell of it makes you hungry.As an outsider, you're just one step away from getting things done.
A huge step, admittedly, and one that most people never seem to
make, but only one step. If you can summon up the energy to get
started, you can work on projects with an intensity (in both senses)
that few insiders can match. For insiders work turns into a duty,
laden with responsibilities and expectations. It's never so pure
as it was when they were young.Work like a dog being taken for a walk, instead of an ox being yoked
to the plow. That's what they miss.AudienceA lot of outsiders make the mistake of doing the opposite; they
admire the eminent so much that they copy even their flaws. Copying
is a good way to learn, but copy the right things. When I was in
college I imitated the pompous diction of famous professors. But
this wasn't what made them eminent — it was more a flaw their
eminence had allowed them to sink into. Imitating it was like
pretending to have gout in order to seem rich.Half the distinguishing qualities of the eminent are actually
disadvantages. Imitating these is not only a waste of time, but
will make you seem a fool to your models, who are often well aware
of it.What are the genuine advantages of being an insider? The greatest
is an audience. It often seems to outsiders that the great advantage
of insiders is money — that they have the resources to do what they
want. But so do people who inherit money, and that doesn't seem
to help, not as much as an audience. It's good for morale to know
people want to see what you're making; it draws work out of you.If I'm right that the defining advantage of insiders is an audience,
then we live in exciting times, because just in the last ten years
the Internet has made audiences a lot more liquid. Outsiders don't
have to content themselves anymore with a proxy audience of a few
smart friends. Now, thanks to the Internet, they can start to grow
themselves actual audiences. This is great news for the marginal,
who retain the advantages of outsiders while increasingly being
able to siphon off what had till recently been the prerogative of
the elite.Though the Web has been around for more than ten years, I think
we're just beginning to see its democratizing effects. Outsiders
are still learning how to steal audiences. But more importantly,
audiences are still learning how to be stolen — they're still just
beginning to realize how much
deeper bloggers can dig than
journalists, how much
more interesting
a democratic news site can be than a
front page controlled by editors, and how much
funnier
a bunch of kids
with webcams can be than mass-produced sitcoms.The big media companies shouldn't worry that people will post their
copyrighted material on YouTube. They should worry that people
will post their own stuff on YouTube, and audiences will watch that
instead.HackingIf I had to condense the power of the marginal into one sentence
it would be: just try hacking something together. That phrase draws
in most threads I've mentioned here. Hacking something together
means deciding what to do as you're doing it, not a subordinate
executing the vision of his boss. It implies the result won't
be pretty, because it will be made quickly out of inadequate
materials. It may work, but it won't be the sort of thing the
eminent would want to put their name on. Something hacked together
means something that barely solves the problem, or maybe doesn't
solve the problem at all, but another you discovered en route. But
that's ok, because the main value of that initial version is not the
thing itself, but what it leads to. Insiders who daren't walk
through the mud in their nice clothes will never make it to the
solid ground on the other side.The word "try" is an especially valuable component. I disagree
here with Yoda, who said there is no try. There is try. It implies
there's no punishment if you fail. You're driven by curiosity
instead of duty. That means the wind of procrastination will be
in your favor: instead of avoiding this work, this will be what you
do as a way of avoiding other work. And when you do it, you'll be
in a better mood. The more the work depends on imagination, the
more that matters, because most people have more ideas when they're
happy.If I could go back and redo my twenties, that would be one thing
I'd do more of: just try hacking things together. Like many people
that age, I spent a lot of time worrying about what I should do.
I also spent some time trying to build stuff. I should have spent
less time worrying and more time building. If you're not sure what
to do, make something.<NAME>'s advice to thriller writers was "When in doubt,
have a man come through a door with a gun in his hand." He followed
that advice. Judging from his books, he was often in doubt. But
though the result is occasionally cheesy, it's never boring. In
life, as in books, action is underrated.Fortunately the number of things you can just hack together keeps
increasing. People fifty years ago would be astonished that one
could just hack together a movie, for example. Now you can even
hack together distribution. Just make stuff and put it online.InappropriateIf you really want to score big, the place to focus is the margin
of the margin: the territories only recently captured from the
insiders. That's where you'll find the juiciest projects still
undone, either because they seemed too risky, or simply because
there were too few insiders to explore everything.This is why I spend most of my time writing
essays lately. The
writing of essays used to be limited to those who could get them
published. In principle you could have written them and just shown
them to your friends; in practice that didn't work.
[6]
An
essayist needs the resistance of an audience, just as an engraver
needs the resistance of the plate.Up till a few years ago, writing essays was the ultimate insider's
game. Domain experts were allowed to publish essays about their
field, but the pool allowed to write on general topics was about
eight people who went to the right parties in New York. Now the
reconquista has overrun this territory, and, not surprisingly, found
it sparsely cultivated. There are so many essays yet unwritten.
They tend to be the naughtier ones; the insiders have pretty much
exhausted the motherhood and apple pie topics.This leads to my final suggestion: a technique for determining when
you're on the right track. You're on the right track when people
complain that you're unqualified, or that you've done something
inappropriate. If people are complaining, that means you're doing
something rather than sitting around, which is the first step. And
if they're driven to such empty forms of complaint, that means
you've probably done something good.If you make something and people complain that it doesn't work,
that's a problem. But if the worst thing they can hit you with is
your own status as an outsider, that implies that in every other
respect you've succeeded. Pointing out that someone is unqualified
is as desperate as resorting to racial slurs. It's just a legitimate
sounding way of saying: we don't like your type around here.But the best thing of all is when people call what you're doing
inappropriate. I've been hearing this word all my life and I only
recently realized that it is, in fact, the sound of the homing
beacon. "Inappropriate" is the null criticism. It's merely the
adjective form of "I don't like it."So that, I think, should be the highest goal for the marginal. Be
inappropriate. When you hear people saying that, you're golden.
And they, incidentally, are busted.Notes[1]
The facts about Apple's early history are from an interview
with Steve
Wozniak in Jessica Livingston's
Founders at Work.[2]
As usual the popular image is several decades behind reality.
Now the misunderstood artist is not a chain-smoking drunk who pours
his soul into big, messy canvases that philistines see and say
"that's not art" because it isn't a picture of anything. The
philistines have now been trained that anything hung on a wall
is art. Now the misunderstood artist is a coffee-drinking vegan
cartoonist whose work they see and say "that's not art" because it
looks like stuff they've seen in the Sunday paper.[3]
In fact this would do fairly well as a definition of politics:
what determines rank in the absence of objective tests.[4]
In high school you're led to believe your whole future depends
on where you go to college, but it turns out only to buy you a couple
years. By your mid-twenties the people worth impressing
already judge you more by what
you've done than where you went to school.[5]
Managers are presumably wondering, how can I make this miracle
happen? How can I make the people working for me do more with less?
Unfortunately the constraint probably has to be self-imposed. If
you're expected to do more with less, then you're being
starved, not eating virtuously.[6]
Without the prospect of publication, the closest most people
come to writing essays is to write in a journal. I find I never
get as deeply into subjects as I do in proper essays. As the name
implies, you don't go back and rewrite journal entries over
and over for two weeks.Thanks to <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, and <NAME> for reading drafts of this, and to <NAME> and <NAME> for inviting me to speak.
Japanese TranslationChinese Translation
|
|
https://github.com/ivaquero/book-control | https://raw.githubusercontent.com/ivaquero/book-control/main/B-复矩阵.typ | typst | #import "@local/scibook:0.1.0": *
#show: doc => conf(
title: "附录B：复矩阵",
author: ("ivaquero"),
header-cap: "现代控制理论",
footer-cap: "github@ivaquero",
outline-on: false,
doc,
)
= 复数
<复数>
== 基本运算
<基本运算>
#definition[
复数是一个有序对$(a, b)$，其中，$a, b ∈ R$，通常写作$a + b i$。复数集记作$ℂ$，实数集$ℝ$可看作是其子集。
]
令横轴为实部，纵轴为虚部，复数$z = a + b i$可表示为向量
$ arrow(z) = (a, b) $
#tip[
符号$i$最早由瑞士数学家欧拉（Le<NAME>）在 1777 年用于表示$sqrt(-1)$。
]
#definition[
令$z_1 = a_1 + b_1 i$，$z_2 = a_2 + b_2 i$，且$a_1, a_2, b_1, b_2 ∈ ℝ$，则有
- 复数的加法
$ z_1 + z_2 = (a_1 + a_2) + (b_1 + b_2) i $
- 复数的乘法
$ z_1⋅z_2 = (a_1 a_2 - b_1 b_2) + (a_2 b_1 + a_1 b_2) i $
- 复数的减法
$ z_1 - z_2 = z_1 + (- z_2) $
- 复数的除法
$ z_2 \ z_1 = z_2(1 \ z_1), ∀z_1 ≠ 0 $
]
#tip[
运算律同实矩阵。
]
由于$ℂ$和$ℝ$是数学上属于域（field）的实例，故也被统一记为$𝔽$，$𝔽$的元素被称为标量（scalar），用以指代非向量形式的数。
对于标量$α ∈ 𝔽$和$m > 0$，可定义
$ α^m = underbrace(α ⋯ α, "m times") $
== Euler 公式
<Euler-公式>
设
$ f(θ) = frac(e^(i θ), cos θ + i sin θ) $
求导，得$f^′(θ) = 0$，故$f(θ)$为常数，从而有
$ f(θ) = f(0) = 1 $
整理得
$ e^(i θ) = cos θ + i sin θ $
== 极坐标形式
<极坐标形式>
由 Euler 公式，得
$ "Re"^(i θ) = r cos θ + r i sin θ $
令横轴为实部，纵轴为虚部，则$r cos θ$和$i sin θ$分别为横轴和纵轴坐标，故
$ z = "Re"^(i θ) $
其中，$r = sqrt(𝑨^2 + b^2)$，$θ = arctan b/a$
#theorem("Euler 恒等式")[
当$r = 1, θ = π$，得
$ z = e^(i π) = -1 $
即
$ e^(i π) + 1 = 0 $
]
由上，复数的积可表示为
$ z_1 z_2 = r_1 r_2 e^(i(θ_1 + θ_2)) $
即，积向量的长度为$r_1 r_2$，夹角为$θ_1 + θ_2$。
== 共轭
<共轭>
#definition[
对两个复数$z_1$和$z_2$，若其实部相等，虚部互为相反数，则称其共轭，表示为
$z_2 = macron(z)_1 Im(z)$
共轭复数具有如下性质
- 模相等，$|z_1| = |z_2|$
- 夹角相反，$θ_1 = -θ_2$
]
= 复向量
<复向量>
对复向量
$ z = mat(delim: "[", z_1; z_2; ⋮; z_n) $
向量的每个分量均是复数。此时$z ∉ ℝ^n$，它现在处于$ℂ^n$复向量空间。
通常情况，计算模只需要计算$|v| = sqrt(v^(⊤) v)$即可，而若对复向量使用$z^(⊤) z$则有
$
z^(⊤) z =
mat(delim: "[", z_1, z_2, ⋯, z_n)
mat(delim: "[", z_1; z_2; ⋮; z_n) = ∑ z_i^2
$
这里$z_i$是复数，平方后虚部为负，求模时本应相加的运算变成了减法。
#tip[
如向量$mat(delim: "[", 1, i)$，右乘其转置后结果为$0$，但此向量的长度显然不是零。
]
应使用$|z| = sqrt(macron(z)^(⊤) z)$，即
$
mat(delim: "[", macron(z)_1, macron(z)_2, ⋯, macron(z)_n)
mat(delim: "[", z_1; z_2; ⋮; z_n)
$
即使用向量共轭的转置乘以原向量即可。
#tip[
如向量$mat(delim: "[", 1, i)$，右乘其共轭转置后结果为$mat(delim: "[", 1, - i) mat(delim: "[", 1; i) = 2$。
]
通常，把共轭转置乘以原向量记为$z^H z$，$H$读作 Hermitian。
有了复向量模的计算公式，同理可得，对于复向量，内积不再是实向量的$y^(⊤) x$形式，复向量内积应为$y^H x$。
== 复向量的性质
<复向量的性质>
对于实矩阵，$𝑨^(⊤) = 𝑨$即可表达矩阵的对称性。而对于复矩阵，还需要求一次共轭$macron(𝑨) = 𝑨$。
如$mat(delim: "[", 2, 3 + i; 3 - i, 5)$是一个复数情况下的对称阵。这称为
Hermite 矩阵，有性质$𝑨^H = 𝑨$。
此前，我们定义标准正交向量：$q_i^(⊤) q_j = cases(delim: "{", 0 i ≠ j, 1 & i = j)$。现在，对于复向量我们需要求共轭：
$ macron(q)_i^(⊤) q_j = q_i^H q_j = cases(delim: "{", 0 & i ≠ j, 1 & i = j) $
此前，我们定义标准正交阵：$𝑸 =[q_1 med q_2 med ⋯ med q_n]$有$𝑸^(⊤) 𝑸 = 𝑰$。现在对于复矩阵则有
$ 𝑸^H 𝑸 = i $
正交性（orthogonal）在复数情况下也有了新名字，酉（unitary），酉阵（unitary
matrix）与正交阵类似，满足$𝑸^H 𝑸 = 𝑰$的性质。
== 复数共轭
<复数共轭>
#definition[
设$z = a + b i$，其中，$a$和$b$是实数。
- $z$的实部，表示为$"Re" z$，由$"Re" z = a$定义。
- $z$的虚部，表示为$"Im" z$，由$"Im" z = b$定义。
]
#definition[
设$z ∈ C$
- $z ∈ C$中的复共轭，表示$z ̄$定义为
$ macron(z) = "Re" z - ("Im" z) i $
- 复数$z$的绝对值表示为$|z|$，定义为
$|z| = sqrt(("Re" z))^2 + ("Im" z)^2$
]
设$w, z in C$，则
- $z$和$macron(z)$之和：$z + macron(z) = 2 "Re" z$
- $z$和$macron(z)$之差：$macron(z) macron(z) = 2 ("Im" z) i$
- $z$和$macron(z)$之积：$z macron(z) = |z|^2$
- 复共轭可加性：$macron(w + z) = macron(w) + macron(z)$
- 复共轭可乘性：$macron(w z) = macron(w) macron(z)$
- 共轭的共轭：$macron(macron(z)) = z$
- 复共轭的绝对值：$|macron(z)| = |z|$
- 绝对值的倍增性：$|w z| = |w||z|$
- 三角形不平等：$|w + z| ≤ |w| +|z|$
- 实部和虚部的边界为$|z|$
$|"Re" z| ≤ |z|\
|"Im" z| ≤ |z|$
= 复矩阵
<复矩阵>
== Fourier 矩阵
<fourier-矩阵>
$n$阶 Fourier 矩阵
$
𝑭_n = mat(delim: "[",
1, 1, 1, ⋯, 1;
1, w, w^2, ⋯, w^(n - 1);
1, w^2, w^4, ⋯, w^(2(n - 1)));
⋮, ⋮, ⋮, ⋱, ⋮;
1, w^(n - 1), w^(2(n - 1)), ⋯, w^((n - 1))^2
$
对于每个元素有$𝑭_n_(i j) = w^(i j) i, j = 0, 1, 2, ⋯, n - 1$。矩阵中的$w$是一个非常特殊的值，满足$w^n = 1$，其公式为$w = e^(i 2π \ n)$。易知$w$在复平面的单位圆上，$w = cos frac(2π, n) + i sin frac(2π, n)$。
在 Fourier 矩阵中，当计算$w$的幂时，$w$在单位圆上的角度翻倍。如在$6$阶情形下，$w = e^(2π \ 6)$，即位于单位圆上$60^compose$角处，其平方位于单位圆上$120^compose$角处，而$w^6$位于$1$处。从开方的角度看，它们是$1$的$6$个六次方根，而一次的$w$称为原根。
现在来看$4$阶 Fourier 矩阵，先计算$w$有$w = i, w^2 = -1, w^3 = -i, w^4 = 1$，
$
𝑭_4 =
mat(delim: "[",
1, 1, 1, 1;
1, i, i^2, i^3;
1, i^2, i^4, i^6;
1, i^3, i^6, i^9) =
mat(delim: "[",
1, 1, 1, 1;
1, i, -1, - i;
1, -1, 1, -1;
1, - i, -1, i)
$
矩阵的四个列向量正交，验证一下第二列和第四列，$c macron(z)_x^(⊤) c_4 = 1 - 0 + 1 - 0 = 0$，正交。不过我们应该注意到，$𝑭_4$的列向量并非标准的，我们可以给矩阵乘上系数$1/2$（除以列向量的长度）得到标准正交阵
$
𝑭_4 = 1 / 2
mat(delim: "[",
1, 1, 1, 1;
1, i, -1, - i;
1, -1, 1, -1;
1, - i, -1, i)
$
此时有$𝑭_4^H 𝑭_4 = 𝑰$，于是该矩阵的逆阵即其共轭转置$𝑭_4^H$。
== 快速 Fourier 变换
<快速-fourier-变换>
对于 Fourier 矩阵，$𝑭_6, 𝑭_3$、$𝑭_8, 𝑭_4$、$𝑭_64, 𝑭_32$之间有着特殊的关系。
有 Fourier 矩阵$𝑭_64$，一般情况下，用一个列向量右乘$𝑭_64$需要约$64^2$次计算，显然这个计算量是比较大的。我们想要减少计算量，于是想要分解$𝑭_64$，联系到$𝑭_32$，有
$𝑭_64 = mat(delim: "[", 𝑰, 𝑫; 𝑰, - 𝑫)
dmat(delim: "[", 𝑭_32, 𝑭_32)
mat(delim: "[",
1, med, ⋯, med, med, 0, med, ⋯, med, med;
0, med, ⋯, med, med, 1, med, ⋯, med, med;
med, 1, ⋯, med, med, med, 0, ⋯, med, med;
med, 0, ⋯, med, med, med, 1, ⋯, med, med;
med, med, med, ⋱, med, med, med, , ⋱, med, med;
med, med, med, ⋱, med, med, med, , ⋱, med, med;
med, med, med, ⋯, 1, med, med, med, ⋯, 0;
med, med, med, ⋯, 0, med, med, med, ⋯, 1)$
#pagebreak()
我们分开来看等式右侧的这三个矩阵：
- 第一个矩阵由单位矩阵$𝑰$和对角阵
$ 𝑫 = dmat(delim: "[", 1, w, w^2, ⋱, w^(31)) $
组成，这个矩阵被称为修正矩阵，显然其计算量来自$𝑫$矩阵，对角阵的计算量约为 32 即这个修正矩阵的计算量约为 32，单位矩阵的计算量忽略不计。
- 第二个矩阵是两个$𝑭_32$与零矩阵组成的，计算量约为$2 × 32^2$。
- 第三个矩阵通常记为$𝑷$矩阵，这是一个置换矩阵，其作用是讲前一个矩阵中的奇数列提到偶数列之前，将前一个矩阵从$[x_0 med x_1 med ⋯]$变为$[x_0 med x_2 med ⋯ med x_1 med x_3 med ⋯]$，这个置换矩阵的计算量也可以忽略不计。
故我们把$64^2$复杂度的计算化简为$2 × 32^2 + 32$复杂度的计算，可以进一步化简$𝑭_32$得到与$𝑭_16$有关的式子
$
mat(delim: "[", 𝑰_32, 𝑫_32; 𝑰_32, - 𝑫_32)
mat(delim: "[", 𝑰_16, 𝑫_16, med, med;
𝑰_16, - 𝑫_16, med, med;
med, med, 𝑰_16, 𝑫_16;
med, med, 𝑰_16, - 𝑫_16)
dmat(delim: "[",
𝑭_16, 𝑭_16, 𝑭_16, 𝑭_16)
mat(delim: "[", P_16, med; med, P_16)[P_32]
$
而$32^2$的计算量进一步分解为$2 × 16^2 + 16$的计算量，如此递归下去我们最终得到含有一阶 Fourier 矩阵的式子。
化简后计算量，$2(2(2(2(2(2(1))^2 + 1)) + 2)) + 4 + 8 + 16 + 32$，约为$6 × 32 = log_2 64 × 64/2$，算法复杂度为$n/2 log_2 n$。原来需要$n^2$的运算现在只需要$n/2 log_2 n$就可以实现了。
|
|
https://github.com/rabotaem-incorporated/probability-theory-notes | https://raw.githubusercontent.com/rabotaem-incorporated/probability-theory-notes/master/config.typ | typst | #let enable-ticket-references = true
#let monochrome = false
#let debug = true
#let references = true
#let strict-refs = false
|
|
https://github.com/0x1B05/english | https://raw.githubusercontent.com/0x1B05/english/main/nce3_trans/content/chapters.typ | typst | #import "../template.typ": *
= A puma at large
== 参考译文
美洲狮是一种体形似猫的大动物，产于美洲。当伦敦动物园接到报告说，在伦敦以南45英里处发现一只美洲狮时，这些报告并没有受到重视。可是，随着证据越来越多，动物园的专家们感到有必要进行一番调查，因为凡是声称见到过美洲狮的人们所描述的情况竟是出奇地相似。
搜寻美洲狮的工作是从一座小村庄开始的。那里的一位妇女在采摘黑莓时的看见“一只大猫”，离她仅5码远，她刚看见它，它就立刻逃走了。专家证实，美洲狮非被逼得走投无路，是决不会伤人的。事实上搜寻工作很困难，因为常常是早晨在甲地发现那只美洲狮，晚上却在20英里外的乙地发现它的踪迹。无论它走哪儿，一路上总会留下一串死鹿及死兔子之类的小动物，在许多地方看见爪印，灌木丛中发现了粘在上面的美洲狮毛。有人抱怨说夜里听见“像猫一样的叫声”；一位商人去钓鱼，看见那只美洲狮在树上。专家们如今已经完全肯定那只动物就是美洲狮，但它是从哪儿来的呢？由于全国动物园没有一家报告丢了美洲狮，因此那只美洲狮一定是某位私人收藏豢养的，不知怎么设法逃出来了。搜寻工作进行了好几个星期，但始终未能逮住那只美洲狮。想到在宁静的乡村里有一头危险的野兽继续逍遥流窜，真令人担心。
== 回译
=== 3rd
Pumas are large, cat-like animals, which are found in America. When reports came into London Zoo that a puma #strike[was found] #underline[had been spotted] #strike[in] 45 miles south #underline[of] London, they were not taken seriously. However, when evidence began to accumulate, experts from the Zoo felt obliged to investigate, for the descriptions given by people who claimed to have seen the puma were extrodinarily similar.
The hunt for the puma began in a small village, where a woman picking blackberries saw "a large cat" only five #strike[yields] #underline[yards] away from her. The puma immediately ran away once she saw it. The experts confirmed that a puma won't attack a human being unless it is cornered. In fact, the search proved diffcult, for the puma #strike[is] #underline[was] often observed at one place in the morning#strike[,] but at another place 20 miles away in the evening. Wherever it went, it left behind it a trails of dead deers and small animals like #strike[dead] rabbits. Paw prints were seen in #strike[many] #underline[a number of] places, and puma fur #strike[were] #underline[was] found clinging to bushes. Some people complained of "cat-like" noise at night; a business man on a fishing trip saw the puma up a tree. The experts were now fully convinced the animal was a puma, but where had it come from? As no pumas #strike[was] #underline[had been] reported missing from any zoo in the country, #strike[the puma] #underline[this one] must have been in the possession of a private collector and managed to escape. The search went on for several weeks, but the puam was still not caught. It is disturbing to think that a dangerous wild animal #underline[is] still at large in the quiet #strike[village] #underline[countryside].
#pagebreak()
= Thirteen equals one
== 参考译文
我们教区的牧师总是为各种各样的事筹集资金。但始终未能筹足资金把教堂的钟修好。教堂的钟很大，以前不分昼夜打点报时，但很多年前遭到毁坏，从此便无声无息了。
一天夜里，我们的牧师突然被惊醒了，大钟又在“打点”报时了！他一看表，才1点钟，可是那钟一边敲了13下才停。牧师拿着一支电筒走上钟楼想去看看究竟发生了什么事情。借着电筒光，他看见一个人，马上认出那是本地杂货店主比尔.威尔金斯。
“你究竟在这上面干什么，比尔？”牧师惊讶地问。
“我想把这口钟修好，”比尔回答说。“好几个星期了，我天天夜里到钟楼上来。嗯，我是想让你大吃一惊。”
“你确实使我大吃了一惊！”牧师说，“也许同时你把村里所有的人都吵醒了。不过，钟又能报时了，我还是很高兴的。”
“问题就在这里，牧师，”比尔回答说。“不错，钟能报时了，但是，恐怕每到1点钟，它总要敲13下，对此我已无能为力了。”
“大家慢慢就习惯了，比尔，”牧师说。“13下是不如1下好，但总比1下也不敲强。来，咱们下楼去喝杯茶吧。”
== 回译
=== 3rd
Our vicar #strike[always raises] #underline[is always raising] money for one cause or another, but he has never #strike[got] #underline[managed to get] enough money to have the church clock repaired. The large church clock used to strike the hours day and night, but it was damaged many years ago and #strike[had] #underline[has] been silent since then.
One day night, the vicar suddenly woke up with a start: the big clock was striking the hours again. Looking at his watch, he saw it was only one o'clock, but the bell struck thirteen times before it stopped. Armed with a #strike[torchligh] #underline[torch], he went up to the clock tower to see what was going on. In the torchlight, he #strike[saw a man] #underline[*caught sight of a figure*] whom he immediately recognized as <NAME>, our local grocer.
"Whatever are you doing here, Bill?" asked the vicar in surprise.
"I'm trying to fix the clock, "said Bill, "I have #strike[come] #underline[been coming] up here #strike[every night] #underline[night after night] for several weeks. Right, I #strike[hope] #underline[was hoping] to give you a surprise."
"You certainly did give me a surprise, " said the vicar, "but #strike[you probably woke] #underline[you've probably woken] up everyone in the village as well. However, I'm still glad that the clock #strike[works] #underline[is working] again."
"That's the problem, vicar", answered Bill, "It is all right working again, but I'm afraid it will strike thirteen times at one o'clock. There's nothing I can do about it."
"We will get used to it, Bill", said the vicar, "Thirteen times is not as good as one, but it's better than nothing. Come on, let's go downstairs and have a cup of tea."
#pagebreak()
= An unknown goddess
== 参考译文
不久之前，在爱琴海的基亚岛上，考古工作者有一项有趣的发现。一个美国考古队在阿伊亚.依里尼海角的一座古城里考察了一座庙宇。这座古城肯定一度很繁荣，因为它曾享有高度的文明，房子一般有3层楼高，用石块修建。里面房间很大，墙壁装饰华丽。城里甚至还敷设了排水系统，因为在狭窄的街道底下发现了许许多多陶土制作的排水管道。
考古工作者考察的这座庙宇从公元前15世纪直到罗马时代一直是祭祀祈祷的场所。在庙中最神圣的一间殿堂里发现了15尊陶雕像的碎片。每一尊雕像代表一位女神，而且一度上过色。其中有一尊雕像，她的躯体是在公元前15世纪的历史文物中发现的，而她那身异处的脑袋却碰巧是在公元前5世纪的文物中找到的。她的脑袋一定是在古希腊罗马时代就为人所发现，并受到精心的保护。即使在当时，它也属历史悠久的珍奇之物。考古工作者把这些碎片重新拼装起来后，惊奇地发现那位女神原来是一位相貌十分摩登的女郎。
她身高3英尺，双手叉腰。身穿一条拖地长裙，尽管上了年纪，但体态确实优美。不过，考古工作者至今未能确定这位女神的身份。
== 回译
=== 3rd
Some time ago, an interesting discovery was made by the *archaeologists* on the Aegean island of Kea. An American team explored a temple #strike[of] #underline[in] an ancient city on the #strike[promontary] #underline[promontory] of Aya Irini. The city #strike[was at once] #underline[*at one time* must have been] prosperous, for it enjoyed a high level of civilization. The houses built with stones were often three storeys high with large rooms and beautifully decorated walls. The city was even equipped with a drainage system, for a great many of clay pipes #strike[was] #underline[were] found beneath the streets.
The temple explored by the archaeologists had been a place for worship #strike[dating] from 15th century B.C. to Roman Times. Clay fragments of 15 statuses were found in the most sacred room of the temple. Each statues once painted represents a goddess. The body of one statue was found among the remains #strike[in] #underline[*dating from*] the 15th century B.C., while its missing head happened to be found among the remains #strike[in] #underline[of] the 5th century B.C. This head must have been found in Classical Times and preserved carefully. It was very precious and #strike[has a long history] #underline[old] #strike[even at that time] #underline[*even then*].
When the archaeologists reconstructed the fragments, they were amazed that the goddess turned out to be a modern-looking woman. She stands three feet high with her hands rested on her hips, wearing a full-length skirt that swept the floor. Despite her great age, #strike[the elegance is still on her] #underline[she still remains graceful]. However, the archaeologists #strike[can't confirm the identity of the goddess yet now] #underline[*have been unable to* discover her identity so far].
#pagebreak()
= The double life of Alfred Bloggs
== 参考译文
如今，从事体力劳动的人的收入一般要比坐办公室的人高出许多。坐办公室的之所以常常被称作“白领工人”，就是因为他们通常是穿着硬领白衬衫，系着领带去上班。许多人常常情愿放弃较高的薪水以换取做白领工人的殊荣，此乃人之常情。而这常常会引起种种奇怪的现象，在埃尔斯米尔公司当清洁工的艾尔弗雷德.布洛斯就是一个例子。
艾尔弗结婚时，感到非常难为情，而没有将自己的职业告诉妻子。他只说在埃尔斯米尔公司上班。每天早晨，他穿上一身漂亮的黑色西装离家上班，然后换上工作服，当8个小时清洁工。晚上回家前，他洗个淋浴，重新换上那身黑色西服。两年多以来，艾尔弗一直这样，他的同事也为他保守秘密。艾尔弗的妻子一直不知道她嫁给了一个清洁工，而且她永远也不会知道了，因为艾尔弗已找到新职，不久就要坐办公室里工作了。他将来挣的钱只有他现在的一半。不过他觉得，地位升高了，损失点儿钱也值得。从此，艾尔弗可以一天到晚穿西服了。别人将称呼他为“布洛格斯先生”，而不再叫他“艾尔弗”了。
== 回译
=== 3rd
#strike[Nowadays] #underline[These days], people who do manual #strike[works] #underline[work] #strike[always] #underline[often] earn #underline[far] more money than those who work in offices. The reason why people working in offices are #strike[often called] #underline[*frequently* *referred to as*] "white collar workers" is that they usually go to work in a #strike[white shirt] #underline[collar] and tie. #strike[As] #underline[*Such*] *is human nature*, a great deal of people are often willing to *sacrifice* #strike[the high-paid work] #underline[*higher pay*] *for the privilege of* being #strike[a] "white collar workers". And this #strike[always triggers some weird situations] #underline[*gives rise to* curious situations], as it did in the case of Alfred Bloggs who worked in the Ellesmere Corporation as a dustman.
When Alf got married, he felt so embarrassed that he didn't tell anything about his job to his wife. What he just told her was that he worked for Ellesmere Corporation. Every morning he left home for work wearing a smart black suit, then changed into the overalls and spent the next 8 hours as a dustman. Before #strike[he went back home] #underline[returning home at night], he first took a shower and changed back #underline[into] the black suit. Alf had done this for over 2 years and his colleagues kept his secret. Alf's wife #strike[never knows] #underline[has never discovered] she married a dustman, and she never will, for Alf has just found a new job that he can work in a office. He will #strike[earn] #underline[*be earning*] *the half* #strike[of which] #underline[*as much as*] he used to, but he #underline[_feels that *his rise in status is well worth the loss of money*_]. From then on, Alf can be wearing a suit all day long and others will call him "Mr Bloggs" instead of "Alf".
#pagebreak()
= The facts
== 参考译文
报刊杂志的编辑常常为了向读者提供成立一些无关紧要的事实和统计数字而走向极端。去年，一位记者受一家有名的杂志的委托写一篇关于非洲某个新成立共和国总统府的文章。稿子寄来后，编辑看了第一句话就拒绝予以发表。文章的开头是这样的：“几百级台阶通向环绕总统府的高墙。”编辑立即给那位记者发去传真，要求他核实一下台阶的确切数字和围墙的高度。
记者立即出发去核实这些重要的事实，但过了好长时间不见他把数字寄来。在此期间，编辑等得不耐烦了，因为杂志马上要付印。他给记者先后发去两份传真，但对方毫无反应。于是他又发了一份传真，通知那位记者说，若再不迅速答复，将被解雇。但记者还是没有回复。编辑无奈，勉强按原样发稿了。一周之后，编辑终于接到了记者的传真。那个可怜的记者不仅被捕了，而且还被送进了监狱。不过，他终于获准发回了一份传真。在传真中他告诉编辑，就在他数通向15英尺高的总统府围墙的1，084级台阶时，被抓了起来。
== 回译
=== 3rd
#strike[The editors] #underline[Editors] of newspapers and magazines #strike[always] #underline[often] go to extremes to provide their readers with some trivial facts and statistics. Last year, a journalist #strike[was appointed] #underline[had been *instructed* by a well-known magazine] to write an article on the president's palace of a new republic in Africa. The article arriving, the editor refused to publish it once he saw the first sentence. As the article begins, "Hundreds of steps lead to the high walls surrounding the president's palace." The editor immediately sent a fax to the journalist, instructing him to confirm the exact the number of the steps and the height of the high walls.
The journalist at once set out to #strike[confirm] #underline[obtain] these important facts, but it takes him a long time to send them back. #strike[During the period] #underline[*Meanwhile*], the editor was becoming impatient for the article was going to be pressed. He sent the journalist 2 faxes before and after, but no #strike[replies] #underline[reply]. So he send another fax, #strike[noticing] #underline[informing] the journalist that he would be fired if #strike[still no replies] #underline[did not reply soon]. #strike[But the journalist didn't respond(?) as well.] #underline[_*When the journalist failed to reply*,_] The editor #strike[did nothing but] #underline[*reluctantly*] published the article as it #strike[was written in the original way] #underline[had been written originally]. A week later, the editor eventually received a fax from the poor journalist who #strike[was] #underline[had been] not only arrested but alse sent the prison. However, he finally was allowed to send a fax back, which told the editor he was arrested while counting the 1,084 steps that lead to the 15-feet hight walls sourrounding the president palace.
#pagebreak()
= Smash-and-grab
== 参考译文
皮卡迪利大街附近的一条著名拱廊街道上，几家高档商店刚刚开始营业。在早晨的这个时候，拱廊街上几乎空无一人。珠宝店主泰勒先生正在欣赏新布置的橱窗。他手下两名店员从早上8点就开始忙碌，这时刚刚布置完毕。钻石项链、戒指漂亮地陈列在黑色丝绒上面。泰勒先生站在橱窗外凝神欣赏了几分钟就回到了店里。
宁静突然被打破，一辆大轿车亮着前灯，响着喇叭，呼啸着冲进了拱廊街，在珠宝店门口停了下来。一人留在驾驶座上，另外两个用黑色长筒丝袜蒙面的人跳下车来。他们用铁棒把商店橱窗玻璃砸碎。这一切发生时，泰勒先生正在楼上。他与店员动手向窗外投掷家具，椅子、桌子飞落到拱廊街上。一个窃贼被一尊很重的雕像击中，但由于他忙着抢钻石首饰，竟连疼痛都顾不上了。这场抢劫只持续了3分钟，因为窃贼争先恐后地爬上轿车，以惊人的速度开跑了。就在轿车离开的时候，泰勒先生从店里冲了出来，跟在车后追赶，一边还往车上扔烟灰缸、花瓶。但他已无法抓住那些窃贼了。他们已经带着价值数千镑的首饰逃之夭夭了。
== 回译
=== 3rd
On a famous arcade beside Picadilly Street, several luxury shops was just #strike[starting to open the door] #underline[opening]. The arcade was almost empty at that time in the morning. The owner of a jewellry shop, Mr Taylor, was admiring #strike[the new displayed window] #underline[a new window display]. His two assistants have been #strike[busy] #underline[working busily] #strike[from] #underline[since] the eight o'clock and had only just finished. Dimond necklaces and rings had been arranged beautifully on a background of the black #underline[*velvet*]. Mr Taylor gazed at the display for minutes and then went back to the shop.
The silence was suddenly broken when a large car with its headlight on #underline[and its *horn blaring*], roared #strike[into] #underline[*down*] the arcade. #strike[The car came to a stop in front of Mr Taylor's shop] #underline[It came to a stop outside the jeweller's]. One man *stayed* #strike[on] #underline[*at*] the wheel while two others covering their faces with their black #underline[*stockings*] #strike[jumped off the car] #underline[jumped out] and smashed the windows with #underline[iron] bars. When all this was #strike[happening] #underline[*was going on*], <NAME> was #strike[on] upstairs. He and #strike[his staffs] #underline[his *staff*] #strike[throw] #underline[began throwing] furnitures #strike[, chairs and tables out of the window to the arcade.] #underline[out of the window. Chairs and tables went flying into the arcade.] A thief was #strike[hit] #underline[*struck*] by a heavy statue, but #strike[he can't help with the pain for he was busy robbing the dimonds] #underline[*he was busy helping himself to dimonds to notice any pain*]. The #strike[robery] #underline[*raid*] #strike[only lasted for 3 minutes] #underline[was all over in 3 minutes], for the thieves #strike[went to the car in a hurry] #underline[*scrambled back* into the car] and #strike[ran away] #underline[*moved off*] at a fantastic speed. #strike[When] #underline[Just as] the car was leaving, <NAME> rushed out of the shop, runing after the car and throwing #underline[*ashtrays*] and vases to the car. But he can't catch them who have left with diamonds worth thousands of pounds.
#pagebreak()
= Mutilated ladies
== 参考译文
这种事情在你身上出现过吗？你有没有把裤子塞进洗衣机，然后又想起在裤子的后兜有一张大面值的纸币？当你把裤子抢救出来时，你有没有发现那张纸币已经变得比白纸还白？当英国人犯这种错误时，他们不必感到绝望（而许多国家的人都有这种绝望的感觉）。对英国人来说，值得庆幸的是英国银行有一个残钞鉴别组，负责处理那些把钱塞进机器或塞给狗的人提出的索赔要求。看起来，狗很喜欢咀嚼钱币。
最近的一个案例与简·巴特林有关，她的未婚夫约翰拥有一家生意兴隆的家具店。有一天约翰的生意很好，他把一只装有3，000英镑的钱包放进微波炉内保存。然后，他和简一起去骑马。回家后，简用微波炉煮了晚饭，无意之中把她未婚夫的钱包也一起煮了。可以想象他们发现一只煮得很好看的钱包、钞票已化成灰时的沮丧心情。约翰去找银行经理，经理把约翰的钱包和纸币的残留物送到英国银行在纽卡斯尔的一个专门部门——残钞鉴别组。他们鉴定了这些残留物。约翰拿回了他损失的全部数额。“只要有东西可供识别，我们会把钱还给人家的，”银行的一位女发言人说。“去年，我们对21，000起索赔要求支付了150万英镑。”
== 回译
=== 1st
Has #strike[ such a thing ] it happened to you? Have you ever put your pants into a washing machine, and then #strike()[ you were reminded ] remebered that a large bank note was in your back packet. When you rescued your pants, #strike()[had you found] did you find #strike()[out that] the bank note had been whiter than white? #strike()[The British] People who live in Britain needn't despair when they make such mistakes, but people in other countries do. #strike()[Thanks to a mutilated-lady-identifying group, which is resposible to deal with the requests from whom put money into machines or dogs. It seems that dogs likes to chew money.] Fortunately for them, the Bank of England has a team called Mutilated Ladies that deals with claims from people feeding their money to a machine or to their dog.
#strike()[ As it did in the case of Jane Butlin ] #underline[A recent case concerns <NAME>], whose husband, John, runs a prosperous furniture #strike()[shop] business. One day, John #underline[had a very good day and] reserved a wallet containing 3,000 pounds in #underline[*the microwave oven* for safekeeping]#strike[, busy with his business]. And then, he and Jane went #strike[riding horses] #underline[*horse-riding*]. #strike[After returning home] #underline[When they got home], Jane #strike[made] #underline[cooked their] dinner #strike[using] #underline[in] that microwave oven #underline[and without realizing it], #strike[cooking] #underline[cooked] the wallet simultaneously. #strike[We can imagine how frustrated they were] #underline[Imagine their *dismay*] when they found the #underline[beautifully-cooked] wallet and notes inside #strike[was cooked] #underline[turned] into ash. John went for #strike[the] #underline[his] bank manager, who then send their the remains of the wallet and notes to the #strike[particular group for identifying mutilated ladies] #underline[special *department* of the Bank of England in Newcastle: the Mutilated Ladies]. The group #strike[identified] #underline[examined] the remains and John got #strike[the] #underline[all his] money back. "#strike[Only if things can be identified] #underline[So long as there's *something to identify*], we will give their money back," said a #strike[sponsor in a bank] #underline[spokeswoman for the Bank]. "Last year, we paid 1.5 million pounds #strike[for 21,000 requests] #underline[*on* 21,000 claims]."
=== 2nd
Has it happened to you? Have you ever put your pants into a washing machine, and then remebered a #underline[large] note was in your back pocket ? When you had rescued the trousers, did you find the note had been whiter than white? When people in #strike[England] #underline[Britain] make such mistakes, they needn't despair, but many people in other countries do. #underline[Fortunately for them,] #strike[Thanks to the Mutilated Ladies group of the England Bank] #underline[the Bank of England ahs a team called Mutilated Ladies] which is responsible to deal with #strike[requests] #underline[claims] from #strike[whom] #underline[people who] #strike[feed] #underline[fed] their money into machines or dogs. #strike[It seems that dogs] #underline[Dogs, it seems, ] like to chew money.
#strike[As it did in the case of Jane Butlin] #underline[A recent case *concerns* Jane Butlin], whose finance John #strike[owned a prosperous furniture shop] #underline[runs a successful furniture business]. One day, John had a good day and #strike[reserved] #underline[put] a wallet containing 3,000 pounds #strike[in] #underline[into] the microwave oven. And then, he and Jane went horse-riding. After they got home, Jane cooked dinner #strike[with] #underline[in] that microwave oven#strike[,] and #underline[without realizing it,] cooked the wallet #strike[by the way] #underline[as well]. Imagine their dismay when they found a beautifully cooked wallet #strike[with ashy money] #underline[and notes turned to ash]. John went for his Bank manager who sent the remains to a special department of the England Bank in Newcastle#strike[ --] #underline[:] Mutilated Ladies. They #strike[identified] #underline[examined] these remains and John got all his money back. "So long as there's something to identify, we will give the money back," said a #strike[woman sponsor] #underline[*spokeswoman*], "Last year, we paid 1.5 million pounds #strike[for 21,000 requests] #underline[on 21,000 claims]."
#pagebreak()
= A famous monastery
== 短句改长句练习
The Great St. Bernard Pass connects Switzerland to Italy. At 2, 473 metres, it is the highest mountain pass in Europe. The famous monastery of St. Bernard, which was founded in the eleventh century, lies about a mile away.
#example("1")[
The Great St. Bernard Pass, #underline()[standing at 2,473 metres], connects Switzerland to Italy and #underline()[holds the distinction of being the highest mountain pass] in Europe, and about a mile away #underline()[lies the famous St. Bernard Monastery], founded in the eleventh century.
]
#example("2")[
The highest mountain pass in Europe, the Great St. Bernard pass, stands at #underline()[an impressive 2, 473 metres], connecting Switzerland to Italy.
#underline[_A mile away from this lofty pass lies_ the famous St. Bernard monastery], founded in 11th century.
]
For hundreds of years, St. Bernard dogs have saved the lives of travellers crossing the dangerous Pass. These friendly dogs, which were first brought from Asia, were used as watchdogs even in Roman Times.
#example("1")[
For hundreds of years, St. Bernard dogs, #underline()[a friendly breed] first brought from Asia were used as watchdogs even in Roman Times and have saved the lives of travellers crossing the dangerous Pass.
]
Now that a tunnel has been built through the mountains, the Pass is less dangerous, but each year, the dogs are still sent out into the snow whenever a traveller is in difficulty. Despite the new tunnel, there are still a few people who rashly attempt to cross the Pass on foot.
#example("1")[
Now that a tunnel has been built through the mountains, the Pass is less dangerous, but each year, the dogs are still sent out into the snow whenever a traveller is in difficulty, #underline()[for] there are still a few people who rashly attempt to cross the Pass on foot #underline()[despite the new tunnel].
]
During the summer months, the monastery is very busy, for it is visited by thousands of people who cross the Pass in cars. As there are so many people about, the dogs have to be kept in a special enclosure.
In winter, however, life at the monastery is quite different. The temperature drops to -30° and very few people attempt to cross the Pass. The monks prefer winter to summer for they have more privacy. The dogs have greater freedom, too, for they are allowed to wander outside their enclosure. The only regular visitors to the monastery in winter are parties of skiers who go there at Christmas and Easter. These young people, who love the peace of the mountains, always receive a warm welcome at St. Bernard's monastery.
#example("my version")[
In winter, however, life at the monastery is quite different, for the temperature drops to -30° and very few people attempt to cross the Pass.
The monks prefer winter to summer for they have more privacy, #underline()[either do the dogs have greater freedom], for they are allowed to wander outside their enclosure.
The only regular visitors to the monastery in winter are parties of skiers who love the peace of the mountains and go there at Christmas and Easter, always receving a warm welcome at St. Bernard's monastery.
]
#example("Larry's version")[
#underline()[As winter descends upon the monastery, bringing temperatures to as low as -30° and *dissuading all but a brave few from attempting to cross the Pass*], life #underline()[undergoes a shift] here, where monks #underline()[find solace] in the winter months, #underline()[appreciating the heightened privacy], and the dogs too, #underline()[*revel* in increased freedom] as they roam beyond their usual enclosure.
During this season, the exclusive visitors to the monastery consist of skiing parties attracted by the mountain's *serene ambiance*, who are warmly welcomed at St. Bernard during the festival periods of Christmas and Easter.
]
#tip("Tip")[
全是长句会非常令人窒息，要注意长短结合，长句中间搭配相应的短句。这里只是用作练习。
]
== 参考译文
圣伯纳德大山口连接着瑞士与意大利，海拔2，473米，是欧洲最高的山口。11世纪建造的著名的圣伯纳德修道院位于离山口1英里远的地方。几百年来，圣伯纳德修道院驯养的狗拯救了许多翻越这道山口的旅游者的生命。这些最先从亚洲引进的狗，待人友好，早在罗马时代就给人当看门狗了。如今由于在山里开挖了隧道，翻越山口已不那么危险了。但每年还要派狗到雪地里去帮助那些遇到困难的旅游者。尽管修通了隧道，但仍有一些人想冒险徒步跨越圣伯纳德山口。
夏天的几个月里，修道院十分忙碌，因为有成千上万的人驾车通过山口，顺道来修道院参观。由于来人太多，狗被关在专门的围栏里。然而到了冬天，修道院里的生活则是另一番景象。气温下降到零下30度，试图跨越山口的人寥寥无几。修道士们喜欢冬天，而不太喜欢夏天。因为在冬天，他们可以更多地过上无人打扰的生活。狗也比较自由，被放出围栏，四处遛达。冬天常来修道院参观的只有一批批滑雪者。他们在圣诞节或复活节到那儿去。这些热爱高山清静环境的年轻人每年都受到圣伯纳德修道院的热烈欢迎。
== 回译
=== 1st
The Great St. Bernard Pass connects Switzerland #strike[and] #underline[to] Italy. standing 2,473 metres is the highest #underline[mountain] pass in Europe. #strike[The famous St. Bernard monastery] #underline[The famous monastery of St. Bernard] built in 11th century #strike[was] #underline[lies] 1 mile away #strike[from the pass]. For hundreds of years, the dog adopted by the monastery have rescued a great deal of visitors trying to #strike[pass] #underline[cross] the Pass. These friendly dogs that first #strike[imported] #underline[brought] from Asia, were used as watchdogs even in Roman Times. #strike[Nowadays,] #underline[Now that] a tunnel has been built through the mountain, the Pass is less dangerous, but the watchdogs are still sent out #strike[to the snow ground help travellers who are having difficulties] #underline[into the snow whenever a traveller is in difficulty]. In spite of the channel #strike[through the mountain], #strike[some people still wanna take risk passing the St. Bernard Pass on foot] #underline[there are still a few people who *rashly* attempt to cross the Pass on foot].
#strike[In summer] #underline[During the summer months], the monastery is so busy for thousands of people drive across the pass and have a visit to monastery by the way, which makes the watchdogs locked in #underline[a special enclosure]. However, when it comes to winter, the life #strike[in] #underline[at] monastery is totally different that temperature #underline[drops to -30°] and few people try to cross the Pass. The monks #underline[prefer winter to summer], for they can have a life without disturbing, and so do the watchdogs who are allowed to be unlocked from the enclosure and then wandering everywhere. #strike[Monastery comes only parties of skiers in winter] #underline[The regular visitors to the monastery in winter are parties of skiers] who go there on Christmas and Easter. These young people, who love the quiet environment, #strike[are always greatly welcomed by] #underline[always receive a warm welcome at] St. Bernard Monastery every year.
=== 2nd
The Great St. Bernard pass, the highest mountain pass in Europe, connects Switzerland and Italy, standing at 2,473 metres high. The famous St. Bernard monastery #strike[built] #underline[founded] in 11th century lies 1 mile away from the pass. For hundreds of years, the friendly dogs of St. Bernard monastery, which first brought from Asia and had been watchdogs since then, have saved many lives of travellers who tried to climb across the pass. Now that a tunnel had been digged through the #strike[hill] #underline[mountain], #strike[it was not so dangerous to climb across the pass] #underline[the Pass is less dangerous]. But each year, the dogs are still delegated to the snow #strike[to help] #underline[whenever] travellers #underline[are] in difficulties who #strike[risked climbing] #underline[*rashly* attempt to climb] across the St. Bernard pass on foot #strike[whatever] #underline[despite] the new channel.
In the months of summer, the monastery was busy, for thousands of people drived across the pass and took a visit to the monastery by the way. #strike[Due to so many people coming] #underline[As tehre are somany people about], the dogs have to be locked in a special enclosure. However, when winter arriving, it will be totally another picture that very few people would try to cross the pass with the temperature dropping to -30°. The monks prefer winter rather than summer, for they can lead no-disturbing lives. Either did the dogs, who can roamed outside their enclosure in winter. Monastery only comes parties of skiers in winter, who went there #strike[on] #underline[at] Christmas or Easter. These young persons who love the #strike[silent environment] #underline[peace of the mountain] #strike[were greatly welcomed by] #underline[, always *receive a warm welcome* at] the St. Bernard monastery each year.
#pagebreak()
= Flying cats
== 参考译文
猫总能引起人们的极大兴趣。它们可以对人友好，充满柔情。但是，它们又有自己神秘的生活方式。它们从不像狗和马一样变得那么顺从。结果是人们已经学会尊重猫的独立性。在它们的一生中，大多数猫都对人存有戒心。最使我们感兴趣的一件事情就是一种通俗的信念——猫有九条命。显然，这种说法里面包含着许多真实性。猫在跌落时能够大难不死是有事实作为依据的。
最近，纽约动物医疗中心对132只猫进行了为期5个月的综合研究。所有这些猫都有一个共同的经历：它们都曾从高层建筑上摔下来过，但只有其中的8只猫死于震荡或跌伤。当然，纽约是进行这种有趣的试验的一个理想的地方，因为那里根本不缺乏高楼大厦，有的是高层的窗槛从上往下坠落。有一只叫萨伯瑞娜的猫从32层楼上掉下来，但只摔断了一颗牙。“猫就像训练有素的跳伞队员，”一位医生说。看起来，猫跌落的距离越长，它们就越不会伤害自己。在一个长长的跌落过程中，它们可以达到每小时60英里甚至更快的速度。在高速下落中，猫有时间放松自己。它们伸展开四肢，就像飞行中的松鼠一样。这样就加大了空气阻力，并减小了它们着地时冲击力带来的震动。
== 回译
=== 1st
#strike[Cats can always badly arouse the interest of people] #underline[Cats never *fail to fascniate* human beings]. They can be kind #underline[and *affectionate*] #strike[to] #underline[towards] people, full of gentleness. However, they #strike[also have their mystery lives] #underline[*lead mysterious lives of their own as well*]. It's impossible for them to act like horses and dogs which are #underline[submissive]. As a result, people have learned to respect #strike[the independency of cats] #underline[*feline independency*]. Most cats #strike[are *wary* to] #underline[remain suspicious of] human beings #strike[in] #underline[all] their lives. #strike[What makes us most intersted in] #underline[*One of the things that fascinates us most about cats*] is that the #strike[common] #underline[popular] belief saying a cat has nine lives, which contains #strike[facts] #underline[a good deal of truth] apparently. #strike[As it did in the case of that cats can survive from falling from the high.] #underline[A cat's ability to *survive falls* is based on fact.]
Recently, New York Animal Medical Center have studied 132 cats for 5 months. All this cats share the same experience#strike[ falling from the high] #underline[: they had fallen off the high], #strike[but] #underline[yet] only eight of them died #strike[for .. or injured] #underline[from shock or injuries]. Of course, it's ideal to do such an interesting research in New York #strike[where] #underline[which] is no lack#underline[/shortage] of #strike[high] #underline[tall] buildings#strike[ and windows] #underline[. There are plenty of *high-rise windowsills*] to fall from. #strike[A cat named Sabray] #underline[One cat, Sabrina, ] had once fell from #strike[the 32th floor] #underline[32 storeys], #underline[yet] only #strike[making one tooth broken] #underline[suffered fromm a broken tooth]. "Cats #strike[are just like trained ...] #underline[behave like well-trained *paratroopers,*]" said a doctor. It seems that the #strike[farer] #underline[further] the cats fall , #strike[the less possibility they get hurt] #underline[the less they are likely to injure themselves]. #strike[In the long process of falling] #underline[In a long drop], they can reach the speed of 60 miles #strike[per] #underline[an] hour or even #strike[faster] #underline[more]. When falling at a high speed, cats have time to relax themselves, streching their #strike[ends] #underline[legs] like a flying squrrel, which #strike[adds] #underline[increases] the #strike[air-force] #underline[air-resistance] and alleviate the #underline[shock of impact] when they #strike[arrive] #underline[hit] the ground.
#tip("Tip")[
- 想使用are, is之类的be动词的时候想想有没有其他的系动词可以表达更精确的意思。
]
#pagebreak()
= The loss of the Titanic
== 参考译文
巨轮“泰坦尼克”号1912年4月10日从南安普敦起锚驶向纽约。船上载有1，316名乘客与891名船员。即便用现代标准来衡量，46，000吨的“泰坦尼克”号也算得上一艘巨轮了。当时，这艘轮船不仅是造船史上建造的最大的一艘船，而且也被认为是不会沉没的。因为船由16个密封舱组成，即使有两个舱进水，仍可漂浮在水面上。然而，这艘巨轮首航就下沉，造成大批人员死亡。人们将永远记着这艘巨轮的沉没惨剧。
“泰坦尼克”起航后的第4天，它正行驶在北大西洋冰冷的海面上。突然，瞭望员发现一座冰山。警报响过不久，巨轮急转弯，以避免与冰山正面相撞。“泰坦尼克”这个弯拐得及时，紧贴着高出海面100英尺的巨大的冰墙擦过去。突然，从船舱下部传来一声轻微的颤音，船长走下船舱去查看究竟。由于这个声音非常轻，没人会想到船身已遭损坏。在下面，船长惊恐地发现“泰坦尼克”号正在急速下沉，16个密封舱已有5个进水。于是，他发出了弃船的命令，几百人跳进了冰冷刺骨的海水里。由于没有足够的救生艇运载所有乘客，结果1，500人丧生。
== 回译
=== 1st
#strike[Titanic, the colossal ship with] #underline[The great ship, Titanic, carrying] 1,316 passengers and #underline[*a crew of 891*] on it, #strike[set out to] #underline[*sailed for*] New York from Southampton on #underline[*April 10th, 1912*.] Even #strike[in modern standards] #underline[*by modern standards*], Titanic weighing 46,000 tons is eligible for being a colossal ship. Of course, not only was #strike[it] #underline[she] the #strike[biggest] #underline[lagest] ship #underline[in the history] #underline[that had ever been used], but also considered as #strike[a ship that wouldn't sink] #underline[*unsinkable*], for she #strike[has] #underline[had] 16 #underline[*watertight*] compartments #strike[and] #underline[.] Even 2 of them were flooded, #strike[its ability to float over the water still exists] #underline[she would still be able to float]. However, #strike[the first travel of this ship had been sinking, which made a great many people died. People will remain this tragedy in their heart forever.] #underline[_the tragic sinking of this liner will always be remembered, for she went down on her first *voyage* with *heavy loss of life*._]
Four days after Titanic's setting out, #strike[she was driving on the chilly surface of the North Atlantic. Suddenly, an iceberg was found by a lookup.] #underline[_while_ she was sailing across the icy waters on the North Atlantic, a huge iceberg was suddenly spotted by a lookup.] No sooner after the alarm, the colossal ship turned sharply to avoid #strike[collon.. with the iceberg directly] #underline[a direct *collision*]. She turned #underline[just] in time, *narrowly* missing the #underline[*immense*] ice wall that #strike[100 feet higher than the water] #underline[rose over 100 feet out of the water beside her]. All of a sudden, #underline[there was] a slight #strike[noise] #underline[trembling sound] #strike[was heard from the bottom of Titanic] #underline[from below], and then the captain went down to see what was going on. The noise #strike[was] #underline[had been] too #strike[slight] #underline[*faint*] to notice so that nobody #strike[knows] #underline[thought] the body of the ship #strike[was] #underline[had been] damaged. #strike[In the bottom] #underline[*Below*], the captain #strike[found] #underline[*realized to his horror that*] Titanic was sinking #strike[at a high speed] #underline[rapidly], 5 of her watertight compartments being flooded. #strike[So he gave the command to give up the ship] #underline[The order to abandon ship was given], and hundreds of people #strike[jumped] #underline[plunged] into the #strike[chilly] #underline[icy] water. For the shortage of #strike[surviving boats] #underline[*lifeboats*], #strike[1,500 people died in this tragedy] #underline[1,500 lives were lost].
=== 2nd
The #strike[large] #underline[great] ship, Titannic, sailed for New York from Southampton in #strike[Mar] #underline[April] 10th 1912, carrying 1,316 passengers and a crew of 891. Even by the modern standards, the 46,000-ton Titanic #strike[is worth to be called a colossal ship] #underline[was a colossal ship]. #underline[At that time,] not only was she the biggest ship #strike[in the history of ship industry] #underline[that had been built], but also #underline[was] regarded to be #strike[no-sinking] #underline[unsinkable], for she #strike[consisted of] #underline[had] 16 water-tight compartments. Even 2 of these compartments were flooded, she could still be able to float over the sea. #strike[However, the first voyage of Titanic went down, making a great deal of people die, which will be remembered forever] #underline[The *tragic* sinking of this great *liner* will always be remembered, for she *went down* on her first voyage *with heavy loss of live*].
#strike[The fourth day] #underline[Four days] after her setting out, while she was sailing #strike[over the chilly sea] #underline[*across* the icy water] of North Atlantic, a huge iceberg was suddenly spotted by a lookup. No sooner after the alarm, the colossal ship turned sharply to avoid a direct #strike[collosion] #underline[collision] with the iceberg. Titanic turned #underline[just] in time, narrowly missing the #strike[ice] #underline[*immense*] wall #underline[of ice] that rose #strike[100 feet than the water] #underline[over 100 feet *out of the water* beside her]. All of a sudden, there's a slight trembling #underline[sound] from #strike[the bottom] #underline[below], and then captain went down to see what was going on. It was such a #strike[slight] #underline[*faint*] noise that no one thought the body had been damaged. #strike[In the bottom] #underline[Below], the captain #strike[found] #underline[relized to his horror that] the Titanic was sinking #strike[fast] #underline[rapidly], for 5 of the compartments had been flooded#strike[, horror occurred in his mind]. #strike[So he give the order to give up the ship] #underline[_The order to abandon ship given_], hundreds of people #strike[jumped] #underline[plunged] into the chilly water. As a result, 1,500 people died for the shortage of the lifeboats.
#pagebreak()
= Not guilty
== 参考译文
现在的海关官员往往相当宽容。但是，当你通过绿色通道，没有任何东西需要申报时，他们仍可以拦住你。甚至是最诚实的人也常被弄得觉得有罪似的，而老练的职业走私犯即使在手提箱里藏着500只金表，却也处之泰然。最近一次，我出国归来，碰上一位特别好管闲事的年轻海关官员，他显然把我当成了走私犯。
“您有什么需要申报的吗？”他直盯着我的眼睛问。
“没有。”我自信地回答说。
“请打开这只手提箱好吗？”
“好的。”我回答说。
那位官员十分仔细地把箱子检查了一遍。所有细心包装好的东西一会儿工夫就乱成了一团。我相信那箱子再也关不上了。突然，我看到官员脸上露出了得意的神色。他在我的箱底发现了一只小瓶，高兴地一把抓了起来。
“香水，嗯？”他讥讽地说道，“你刚才应该申报，香水要上进口税的。”
“不，这不是香水，”我说，“是发胶。”接着我脸带微笑补充说：“这是一种我自己配制的奇特的混合物。”果不出所料，他并不相信我。
“你就闻一闻吧！”我催促说。
海关官员拧开瓶盖，把瓶子放到鼻子底下。一股怪味袭来，使他相信了我说的是真话。几分钟后，我终于被放行，手提划着宝贵的粉笔记号的行李，匆匆离去。
== 回译
=== 1st
These days, #strike[the] *Customs Officer* are very #underline[*tolerant*]. However, when you #strike[go] #underline[are going] through the Green Channel without anything to declare, they can also block you. Even #strike[the most honest] #underline[really honest] people are often made #underline[to] feel guilty#strike[, but the] #underline[The *hardened*] #strike[experienced] professional smuggler #underline[, on the other hand,] #strike[can be relaxed] #underline[is never *troubled* by such feelings,] #underline[even] with 500 golden watches #underline[hidden] inside the suitcase. #strike[At the recent time] #underline[Recently], #underline[when ]I returned from abroad, #strike[meeting an idol young officer, who considered me as a simuggler.] #underline[a particular *officious* young Customs Officer clearly *regarded* me as a smuggler.]
"Do you have anything to declare?" asked the officer, #strike[looking into my eyes] #underline[*looking me in the eye*].
"Nothing," I answered with confidence.
"#strike[Could you please open this suit?] #underline[Would you mind unlocking this suitcase?]"
"#strike[Ok]#underline[Not at all]." I answered.
The officer went through the #strike[suit] #underline[*case*] #strike[carefully] #underline[*with great care*], #strike[making all beautifully packed things into such a total mess that I believed it couldn't be closed since then] #underline[all the things I carefully packed being in such a dreadful mess soon that *I felt sure* I would never *be ablt to* close the case again]. Suddenly, #underline[I saw] the officer's face light up #strike[that] #underline[*when*] he #strike[found] #underline[spotted] a #strike[little] #underline[tiny bottle at the bottom of my case] and *pounced* #underline[on] it #strike[happily] #underline[with delight].
"Perfume, eh?" he said #underline[*sarcastically*]. "You should've declare it#strike[, the]#underline[.] Perfume isn't *exempt from import duty*."
"#strike[No,]#underline[But] it's not perfume," I said, "It's hair gel." Then I #underline[*added*] with smiles, "it's a strange mixture made by myself." #strike[Absolutely] #underline[As I expected], he didn't #strike[trust] #underline[believe] me.
"#strike[You can just smell it.] #underline[Try it]" I said #strike[in a hurry] #underline[*encouragingly*].
The officer #strike[take down] #underline[*unscrewed*] the cap, and put the bottle #strike[under its ...] #underline[to his *nostrils*.] #strike[A strange smell raged on him] #underline[He was *greeted* by an unpleasant smell]#strike[, letting him believe my words] #underline[which convinced him that I was *telling the truth*]. A few minutes later, I was allowed to #strike[go, hurried] #underline[hurry] away with a precious chalk mark on my #strike[suitcase] #underline[baggage].
=== 2nd
Customs Officer have been very tolerant these days. However, when you #strike[go] #underline[are going] through the Green Channel without anything to declare, they can still block you. Even *really honest* persons can be made to feel guilty, while hardened professional smuggler#underline[, on the other hand,] won't be troubled by such feeling even with 500 golden watches hidden in their suitcase. Recentlt, when I returned from abroad, a #strike[idol] #underline[*officious*] young officer came for me, who had regarded me as a smuggler apprently.
"Have you something to declare?" He asked, looking #underline[me] in #strike[my] #underline[the] eye.
"No," I answered with confidence.
"Would you mind #strike[opening] #underline[unlocking] this case?"
"Of course not." I answered.
The officer went through the suitcase #strike[carefully] #underline[with great care], all carefully packed things going to such a dreadful mess that I believed the case couldn't be closed anymore. Suddenly, I saw the officer's face light up for he spotted a tiny bottle #strike[in] #underline[at] the bottom of my suitcase and then pounced on it #underline[*with delight*].
"Perfume? Eh?" said he *sarcastically*, "you should have declare it, _perfume isn't exempt from import duty._"
"No, it's not perfume", I said, "It's hair gel." Then I added with a smile, "It's a strange mixture made by myself." As I expected, he didn't believe me.
"Just try it", I said encouragingly.
The customs officer uncrewed the cap and put the tiny bottle #strike[under] #underline[to] his nostrils. #strike[An unpleasant smell greeting on him] #underline[Greeted by an *unpleasant* smell], he finally believed me #underline[ that I was telling the truth ]. A few minutes later, I was eventually allowed to go, and then I hurried away with the suitcase with precious chalk marks.
#pagebreak()
= Life on a desert island
== 参考译文
我们许多人对于荒岛生活有一种不切实际的想法。我们有时想象荒岛是阳光终日普照的天堂。在那里，生活简单又美好。成熟的水果从树上掉下来，人们根本无需劳动。另一种想法恰恰相反，认为荒岛生活很可怕，要么饿死，要么像鲁滨孙那样，天天盼船来，却总不见船影。也许，这两种想象都有可信之处。但很少有人能有机会去弄个究竟。
最近有两个人在一座珊瑚岛上呆了5天，他们真希望在那儿再多呆一些日子。他们驾着一条严重损坏的小船从维尔京群岛去迈阿密修理。途中，船开始下沉，他们迅速把食物、火柴、罐装啤酒往一只救生筏上装。然后在加勒比海上划行了几英里，到了一座珊瑚岛上。岛上几乎没有一棵树，也没有淡水，但这不算什么问题。他们用橡皮艇蓄积雨水。由于他们随身带了一支捕鱼枪，因此，吃饭不愁。他们天天捕捉龙虾和鱼，正如其中一位所说，吃得“像国王一样好”。5天后，一条油轮从那儿路过，搭救了他们。这二位不得不离开那个荒岛时，还真的感到遗憾呢！
== 回译
=== 1st
Most of us #strike[imagine lives on an isolated island to be unrealistic pictures] #underline[have *formed an unrealistic picture* of lives on a *desert* island]. Sometimes we thought of the island to be a #underline[sort of] paradise #strike[with sunshine] #underline[where the sun always shines], people there #strike[living] #underline[live] a simple and happy life, and #underline[*ripe*] fruit #strike[dropping] #underline[falls] from the trees, no #strike[laboring] #underline[labor] at all. #strike[But here's a totally opposed picture that living on an isolated island is terrible] #underline[*The other side of the picture* is quite opposite*: * living on a desert island is *wretched*,]#strike[ starving] #underline[where you either starve] to death or just like <NAME> #strike[who expected a boat all day but in vain] #underline[_, wating for a boat that never comes._]. #strike[Maybe] #underline[Perhaps] there's *an element of truth* in both pictures, but few people have the opportunity to check it out.
#strike[Recently, two people had stayed #strike[in] #underline[on a] carol island for 5 days, who wished to had more days there.] #underline[Two men who recently spent five days on a carol island _wished they had stayed longer_.] #strike[They sailed with a badly damaged boat from Virgin Island to Miami] #underline[They _were taking_ a badly damaged boat from the Virgin Island to Miami to have it repaired]. #strike[On their trip] #underline[During this journey], the boat beginning to sink, they quickly #strike[put] #underline[loaded] their food, matches and cans of beer into a #strike[lifeboat] #underline[a small rubber *dinghy*]#strike[. Then they] #underline[and] rowed for several miles across the Caribbean, arriving #underline[at] a carol island#strike[ where there's no tree and water. But that's not to be a problem.]#underline[There were *hardly any trees* on the island there was no water, but this did not *prove to be a problem*] They collected rainwater #strike[with] #underline[in] the rubber boat, caught #underline[*lobster*] and #strike[fishes] #underline[fish] everyday with their #underline[*spear gun*], no worry about food. As one of them #strike[said] #underline[put it], "#strike[Eating like a king] #underline[ate like kings]." Five days passed, a #underline[*tanker*] passed and rescued them. These two had to leave the carol island then, feeling #strike[deeply] #underline[*genuinely*] sorry.
=== 2nd
Most of us have formed an unrealistic #strike[thought] #underline[picture] of lives on a desert island, which we imagine #strike[a picture that]a desert island #strike[is just like] #underline[to be] a paradise where sun always shines. Lives there are simple and happy with *ripe* fruits falling down from trees, and no labors at all. #strike[On the other side, one opposed thought is that]#underline[_The other picture of the picture is quite opposite:_] living on a desert island is #strike[horrible] #underline[wretched], where you either starve to death or wait for a boat that will never comes just like Robinson. #strike[Maybe] #underline[Perhaps] there's an element of truth in both #strike[thoughts] #underline[pictures], but few people are enable to have the opportunity to check it out.
#strike[Recently, two persons had been stayed on a *carol* island for 5 days, who were hoping that they could stayed there longer.] #underline[Recently two men who spent 5 days on a carol island wished they had stayed longer.] They #underline[were] originally #strike[took] #underline[taking] a badly damaged boat from the Virgin Island to Miami #underline[to have it repaired]. During the trip, the boat beginning to sink, they quickly loaded the food, matches and cans of beer into a rubbery lifeboat and then #strike[sailed] #underline[*rowed*] for several miles over the Caribbean. Arriving at a carol island where there #strike[was't] #underline[were hardly] any #strike[tree] #underline[trees] or water, but that #strike[could't] #underline[didn't prove to] be a problem. They collected rainwater with the rubbery boat and caught *lobster* and fish everyday with the spear gun they took with. So they never worried abouth eating and drinking, as one of them put it, "eat like kings". Five days later, a tanker passed by and rescued them. #strike[When they had to leave, they felt really sorry.] #underline[These two had to leave the island then, feeling genuinely sorry.]
#pagebreak()
= It's only me
== 参考译文
理查兹夫人等丈夫上班走后，把孩子送去上学，然后来到楼上自己的卧室。那天上午，她兴奋得什么家务活都不想做，因为晚上她要同丈夫一起去参加一个化装舞会。她打算装扮成鬼的模样。头天晚上她已把化装服做好，这时她急于想试试。尽管化装服仅由一个被单制成，却十分逼真。理查兹夫人穿上化装服后下了楼，想看看穿起来是否舒服。
理查兹夫人刚刚走进餐厅，前门就传来敲门声。她知道来人一定是面包师。她曾告诉过面包师，如果她不去开门，他可直接进门，把面包放在厨房的桌上。理查兹夫人不想吓唬这个可怜的人，便赶紧躲到了楼梯下的小储藏室里。她听见前门被打开，走廊里响起了重重的脚步声。突然贮藏室门开了，一个男人走了进来。理查兹夫人这才想到一定是供电局来人查电表了。她说了声“是我，别怕！”然后想进行一番解释，但已来不及了。那人大叫了一声，惊退了几步。理查兹夫人朝他走去，只见他“砰”的一声关上门逃走了。
== 回译
=== 1st
#strike[Mrs. Richard sent her child to school after her husband leaving for work, and then she went to her bedroom upstairs.] #underline[After her husband had gone to work, Mrs. Richard sent her child to school and went upstairs to her bedroom.] #strike[On that day morning, s]#underline[S]he was too excited to do any errands #underline[that morning], for she would attend a #strike[custom] #underline[fancy-dress] party with her husband #strike[at night] #underline[in the evening]. She #strike[was going to cosplay] #underline[*intended to dress up*] as a ghost and #strike[had made the clothes on yesterday night. At this time, she was hurrying to try it on.] #underline[as she had made the *costume* *the night before*, _she was impatient to try it on._] Even the clothes only consisted of a #underline[*sheet*] but it was still #underline[very effective]. #underline[After putting it on,] Mrs. Richard #strike[put it on and] went downstairs. She wanted to #strike[see if comfortable] #underline[find out whether it would be comfortable to wear].
Just as Mrs. Richard #strike[went into] #underline[was entering] the dining room, #strike[knock sound from the front door were heard] #underline[_there was a knock on the front door_]. She knew that the one must be the baker, whom she once told #strike[if she didn't open the door, he could just walk in and put the bread on the table in the kitchen] #underline[*to* just come straight in if she *failed to open the door* and *to* leave the bread on the kitchen table]. #strike[Mrs Richard didn't want to] #underline[*No wanting to*] frighten this poor guy, #strike[so] she went hidding in #strike[a store room downstairs] #underline[the small store room *under the stairs*]. When she heard the front door #strike[was opened, heave foot sound was made in the corridor] #underline[open and heavy *footsteps* in the hall]. All of a sudden, #underline[the door of the small storeroom was opened and] a man came in. #strike[It occurred to Mrs Richard that the man from the Electric Company came here to read the metres] #underline[Mrs. Richard *realized* that it must be the man from the *Electricity Board* who had come here to read the metre]. She uttered, "It's #underline[only] me, don't be afraid."#strike[ And then she were going to] #underline[trying to] give a explanation #underline[of the situation], but it had been late. The man let out a shout and #strike[stepped back a few feet away] #underline[*jumped back several paces*]. #strike[Mrs. Richard walked towards him, only heard "Boom", he slamming the door and running away] #underline[When Mrs. Richard walked towards him, *he fled*, slamming the door and running away].
=== 2nd
After <NAME>'s husband going for work, she sent her children to school and then came to her own bedroom upstairs. #strike[On that day morning] #underline[That morning], she was too excited to do any errands, for she would attend a *fancy-dress* party with her husband in the evening, where she #strike[was going to] #underline[*intended to*] dress like a ghost#strike[. She] #underline[and she] had the #strike[custom clothes] #underline[costume] made by herself #underline[the night before]#strike[,] #underline[which] she was impatient to try#strike[it on]. Even the the clothes was made by only a sheet, it looked like a real one. Mrs Richard went downstairs with the #strike[custom clothes] #underline[costume] on to see if it #strike[is] #underline[would be] comfortable #underline[to wear].
Once she was into the dining room, there was a knock #strike[from] #underline[on] the front door. She knew the person must be the baker, who she had told if she failed to open the door, just went straight in and put the bread on the kitchen table. #strike[Mrs Richard didn't want to terrify this poor guy] #underline[No wanting to frighten this poor guy], #strike[so] she quickly #strike[hid] #underline[went hiding] into the small store room under the stairs. Hearing the front door #strike[opened] #underline[open], heavy steps in the corridor, suddenly the store room's door was opened and a man came in. It occurred to Mrs Richard it must be the one who was appointed by the #strike[Electrical] #underline[Electricity] Company to read the #strike[metres]#underline[metre]. She uttered, "It's only me, don't be afraid." #strike[And then she want to] #underline[, trying to] give a explanation but it had been late. The man let out a shout and stepped back a few #strike[steps] #underline[paces] in a horror. Mrs Richard walked towards him, only saw him flee, slamming the door and running away.
#tip("Tip")[
- hear the door open: 这里的open是动词不定式省略to。
- 如果是hear the door opened, 正确的语法应该是hear the door being opened, 但是一般不这么用。
]
#pagebreak()
= A noble gangster
== 参考译文
曾经有一个时期，芝加哥的店主和商行的老板们不得不拿出大笔的钱给歹徒以换取“保护”。如果交款不及时，歹徒们就会很快捣毁他的商店，让他破产。榨取“保护金”并不是一种现代的罪恶行径。早在14世纪，英国人约翰·霍克伍德就有过非凡的发现：人们情愿拿出大笔的钱，也不愿毕生的心血毁于歹徒之手。
600年前，约翰·霍克伍德爵士带着一队士兵来到意大利，在佛罗伦萨附近驻扎下来，很快就出了名。意大利人叫他乔凡尼·阿库托。每次意大利各城邦之间打仗，霍克伍德便把他的士兵雇佣给愿给他出高价的君主。和平时期，当生意萧条时，霍克伍德便带领士兵进入某个城邦，纵火烧毁一两个农场，然后提出，如向他们缴纳保护金，他们便主动撤离。霍克伍德用这种方法挣了大笔钱。尽管如此，意大利人还是把他视作某种英雄。他80岁那年死去时，佛罗伦萨人为他举行了国葬，并为他画像以纪念这位“骁勇无比的战士、杰出的领袖乔凡尼·阿库托先生”。
== 回译
=== 1st
There was one time when #strike[shop owners and bosses] #underline[owners of shops and *businesses* in Chicago] had to #strike[offer] #underline[pay] gangsters #strike[a lot of money] #underline[large sums of money] #underline[*in return*] for their protection. If the money wasn't #strike[submitted in time] #underline[paid *promptly*], gangsters would #strike[screwed his shops soon, letting him out of business] #underline[*put a man out of business* by destroying his shop]. #strike[Squeezing] #underline[*Extorting*] "protection money" isn't a modern crime#strike[, which early in] #underline[. *As long ago as*] the 14th century, the British, #underline[Sir] John Hawkwood, had made a #strike[fantastic] #underline[remarkable] discovery that people #strike[prefer offerring a lot of money to seeing their blood and swear being destructed by gangsters] #underline[would rather pay large sums of money than *have their life work destroyed by gangsters.*].
About 600 years ago, Sir <NAME> came to Italian with a #strike[team] #underline[band] of soldiers, #strike[pitched] #underline[*settled*] near #underline[Florence] #strike[and soon was known by people. Italian called him Johny .] #underline[He soon *made a name for himself* and *came to be known to the Italians as Giovanni Acuto*.] #strike[Each time when wars happened among cities of Italian] #underline[Whenver the Italian city-states were *at war* with each other], Hawkwood would #underline[*hire*] his soldiers to princes who #strike[offered] #underline[could pay] a high #strike[pay] #underline[price *he demanded*]. #strike[In peace time] #underline[In times of peace, when *business was bad*], #strike[Hawkwood would lead his soldiers to burn one or two farms, and then gave a request that they wouldn't leave unless they were offered money for protection] #underline[Hawkwood and his soldiers would *march into* a city-state, after *burning down a few farms*, _would *offer to go away* if protection money was paid to them_]. Hawkwood earned #strike[a great deal of] #underline[large sums of] money in such way. But nevertheless, Italians still #strike[referred] #underline[regarded] him as a hero. When he died #strike[in his 80] #underline[at the age of 80], #underline[the Florentines] #strike[made] #underline[gave] a #strike[nation] #underline[state] funeral for him and #strike[draw a picture for him to to honor this brave soldier, this excellent legend Johny.] #underline[*had a picture painted* which *was dedicated to* the memory of "the most valiant soldier" and most *notable* leader, Signor <NAME>.]
#pagebreak()
= Fifty pence worth of trouble
== 参考译文
孩子们总是喜欢得到一些零花钱。爸爸妈妈当然经常会给孩子零花钱，但是，叔舅婶姨也是孩子们额外收入的来源。对于有些孩子来说，少量的钱可以花很长一段时间。如果50便士不拿来换糖吃，则可以放在储蓄罐里叮当响上好几个月。但是能把储蓄罐装满的只有屈指可数的几个特别节俭的孩子。对大部分孩子来说，用50便士来买一大块好的巧克力，是算不了什么的。
我的外甥乔治有一个储蓄罐，但总是空空的。我给了他不少50便士的硬币，但没有几个存到储蓄罐里。昨天，我给了他50便士让他存起来，他却拿这钱给自己买了50便士的麻烦。在他去糖果店的路上，50便士掉在地上，在人行道上跳了几下，掉进了阴沟里。乔治脱掉外套，卷起袖子，将右胳膊伸进了阴沟盖。但他摸了半天也没找到那50便士硬币，他的胳膊反倒退不出来了。这时在他周围围上了许多人，一位女士在乔治胳膊上抹了肥皂、黄油，但乔治的胳膊仍然卡得紧紧的。有人打电话叫来消防队，两位消防队员使用了一种特殊的润滑剂才使乔治得以解脱。不过，此事并没使乔治过于伤心，因为糖果店老板娘听说了他遇到的麻烦后，赏给了他一大盒巧克力。
== 回译
=== 1st
Children always #strike[likes to get some extra money] #underline[appreciate small gifts of money]. Their parents of course often #strike[give their children moeny] #underline[*provide* a regular supply of *pocket money*], however, uncles and aunts are also sources of extra #strike[money] #underline[*income*]. #strike[For] #underline[With] some children, #strike[it takes long time to consume a little money] #underline[*small sums go a long way*]. If the 50 pence #underline[*pieces*] #strike[was not] #underline[aren't] #strike[going] #underline[exchanged] for candies, #strike[it] #underline[they] can rattle #underline[for months *inside* money boxes]. But only few #underline[very *thrifty*] children #underline[*manage to* fill up a money box.] For most children, #strike[buying a large piece of chocolate with that 50 pence is not a big deal] #underline[_50 pence is a small price to pay for a nice big bar of chocolate_].
My newphew, George, has #underline[a money box] that was always empty. #strike[I once gave him many 50 pence worth coins, but few of them was stored into his store..] #underline[_Very few of the fifty pence pieces and pound coins I had given him have found their way there_]. Yesterday, I gave him 50 pence and #strike[told] #underline[*advised*] him to #strike[store] #underline[*save*] it. #underline[*Instead* he bought himself fifty pence worth of trouble.]#strike[, but it falled into the ground on his way to Candy Shop, jumping on the passway, falling into a ...]#underline[On his way to the sweet shop, he *dropped* his 50 pence and it *bounced* along the *pavement* down a drain.] George #strike[put off] #underline[took off] his coat, rolled up his sleeves and #strike[put] #underline[*push*] his right arm #underline[through the *drain cover*]. #strike[However, not only not found the 50 pence, but also his armed couldn't be put out] #underline[Not only did he not found the 50 pence, but also had his arm stuck]. At this time, #strike[surrounded by a lot of people,] #underline[*a crowd of* people gathered round him and] a lady #strike[applied] #underline[*rubbed*] some #underline[*soap*] and butter to his arm, but in vain. #strike[Someone called firefighters] #underline[The *fire brigade* was called], and then George #strike[get out of it] #underline[freed] thanks to a kind of particular #underline[*grease*] used by two firefighters. But this matter doesn't #strike[fail] #underline[upset] George too much for the #underline[the lady who owns the sweet shop *rewarded*] #strike[offered] him a large box of chocolate after hearing #underline[about] his trouble.
#pagebreak()
= Mary had a little lamb
== 参考译文
玛丽与丈夫迪米特里住在希腊南部一个叫波拉考拉的小村庄里。玛丽最珍贵的财产之一就是丈夫送给她的一只白色小羔羊。白天，玛丽把羔羊拴在地里的一棵树上，每天晚上把它牵回家。可是，一天晚上，那只小羔羊失踪了。绳子被人割断，很明显小羔羊是被人偷走了。
迪米特里从地里回来，妻子把情况跟他一说，他马上出去找偷羔羊的人。他知道在这样一个小村庄里抓住小偷并不困难。把失窃的事告诉几个朋友后，迪米特里发现他的邻居阿列科家突然多了一只小羔羊。迪米特里立刻去了阿列科家，气呼呼地指责他偷了羔羊，告诉他最好把羊交还，否则就去叫警察。阿列科不承认，并把迪米特里领进院子。不错，他的确刚买了一只羔羊，阿列科解释说，但他的羔羊是黑色的。迪米特里为自己的鲁莽而感到不好意思，向阿列科道了歉，说是错怪了他。就在他俩说话的时候，天下起了雨，迪米特里便呆在阿列科家里避雨，一直等到雨停为止。半小时后，当他从屋里出来时，他惊奇地发现小黑羔羊全身几乎都变成了白色。原来羊毛上染的黑色被雨水冲掉了！
== 回译
=== 1st
Mary and her husband Dimitri lived in a small village called Perachora in Southern #underline[*Greece*]. #strike[The most valuable property that mary is in the possession of] #underline[One of Mary's *prize* possesions] was a #underline[little] white lamb her husband had given her. In the day, Mary tied the lamb to a tree in the field and fetched it #strike[to] home in the evening. However, one #strike[night] #underline[evening], the lamb was found missing. Apprently the lamb was stolen by someone for the rope had been cut.
Dimitri came back from the field, and the wife told him #strike[the situation] #underline[what had happened]. He soon set out to #strike[look for] #underline[find] the thief#strike[ who had stolen the lamb], knowing it#strike['s not] #underline[would not prove] difficult to catch a thief in such a small village. After telling the #strike[thief] #underline[*theft*] to several friends, Dimitri #strike[discovered] #underline[found out] his neighbour, Aleko, suddenly #strike[owned] #underline[had acquired] a lamb. Dimitri went to Aleko's home immediately, accusing him of stealing the lamb furiously. Dimitri warned that he'd better return the lamb back, or he would call the police. Aleko denied it, leading Dimitri #strike[to] #underline[into] his backyard. He certainly had just bought a lamb, Aleko explained, but the lamb he bought was black. #strike[Dimitri felt ashamed for his recklessness and then apologized to Aleko, saying he ....] #underline[_Ashamed of having acted so rashly, Dimitri apologized to Aleko for having accused him_]. While the two were talking, it began to rain and Dimitri stayed in Aleko's house to avoid the rain until #strike[it stopped raining] #underline[the rain stopped]. A half hour later, when he #strike[came out from the house] #underline[went outside], he #strike[surprisingly found] #underline[was astonished to find] the black lamb be a white one. #strike[It turned out the black dyed on the wool was ... by the rain.] #underline[_Its wool, which had been dyed black, had been washed clean by the rain._]
#pagebreak()
= The longest suspension bridge in the world
== 参考译文
1524年，一位鲜为人知的意大利人维拉萨诺驾船驶进纽约港，并将该港命名为安古拉姆。他对该港作了这样的描述：“地理位置十分适宜，位于两座小山的中间，一条大河从中间流过”。虽然维拉萨诺绝对算不上一个伟大的探险家，但他的名字将流芳百世，因为1964年11月21日建成的一座世界上最长的吊桥是以他的名字命名的。
维拉萨诺大桥由奥斯马·阿曼设计，连结着布鲁克林与斯塔顿岛，桥长4，260英尺。由于桥身太长，设计者不得不考虑了地表的形状。两座巨塔支撑着4根粗大的钢缆。塔身建在巨大的水下钢筋混凝土平台上。平台深入海底100英尺。仅这两座塔就花了16个月才建成。塔身高出水面将近700英尺。高塔支撑着钢缆，而钢缆又悬吊着大桥。4根钢缆中的每根由26，108股钢绳组成。据估计，若桥上摆满了汽车，也只不过是桥的总承载力的1／3。然而，这座桥的重要特点不仅是它的规模与强度。尽管此桥很大，但它的结构简单，造型优美，实现了设计者企图创造一个“尽量用细线条勾画出一个庞然大物”的梦想。
== 回译
=== 1st
In 1524, an Italian #strike[of] #underline[about] whom little is known, Verrazano, sailed into New York Harbour and named it Angouleme. He described it as #strike[below:"It has an] #underline["a very] agreeable situation, located #strike[between two] #underline[*within* two small] hills in the midst of which #underline[*flowed*]a large river#strike[goes across]." While Verrazano was #strike[absolutely eligible for being great] #underline[*by no means* considered to be a great explorer], his name will #strike[be remembered forever] #underline[probably remain immortal], because the longest suspension bridge in the world built on November 21st of 1964 was named after him.
The Verrazano bridge #strike[with 4,260 feet of length] was designed by <NAME>, #strike[joined] #underline[joins] Broolkyn and Staten Island. #underline[It has a span of 4,260 feet.]So long is the bridge that the shape of the #strike[surface] #underline[earth] had to be taken into #strike[accounts] #underline[account] by #underline[its] designers. Two #strike[immense] #underline[great] towers support 4 huge cables. The #strike[body of] tower was built on the huge #underline[*underwater*] platforms #underline[made] of steel and concrete #strike[under water]. #strike[The platforms go down 100 feet below the surface of the sea] #underline[The platforms extend to a depth of over 100 feet under the sea]. These two towers alone #strike[takes] #underline[took] 16 months to #strike[be built] #underline[build]. #underline[Above the surface of the water,] the #strike[body] #underline[tower] rose #strike[over about 700 feet over the surface of the sea] #underline[to a height of nearly 700 feet], supporting the cables #strike[which suspend the bridge] #underline[from which the bridge has been suspended]. Each of the four cables #strike[consists 26,108 steel ropes] #underline[contains 26,108 lengths of wire]. It is estimated that #strike[it takes only 1/3 of the total capacity of the bridge even if the bridge is full of cars] #underline[_even if the bridge were packed with cars, it would still only be carrying a third of its total capacity_]. However, #strike[the most important thing of the bridge was not only its scale and strength] #underline[size and strength are not the only important things about this bridge]. Despite #strike[it's huge] #underline[its immensity], it's #underline[both] simple and elegant also, #strike[making] #underline[*fulfilling*] its designers' dream #strike[-- designing a colossal in just simple lines come true] #underline[to create "an enormous object drawn as faintly as possible"] .
#pagebreak()
= Electric currents in modern art
== 参考译文
现代雕塑很少再让我们感到惊讶了。那种认为现代艺术只能在博物馆里才能看到的观点是错误的。即使是对艺术不感兴趣的人也不会不注意到在公共场所展示的现代艺术品。公园里、大楼和商店外竖立着的奇形怪状的雕塑，对这些，我们已经司空见惯了。有些所谓的“现代”艺术品在那里已经陈列了近80年了。
尽管如此，最近举办的一次现代雕塑展览还是使一些人（包括我在内）大吃了一惊。走进展厅首先看到的是一张告示，上面写着：“切勿触摸展品，某些展品有危险！”展品都是些活动的雕塑。人们所熟悉的是悬挂在天花板上、造型奇特、随风飘荡的雕塑品。这些展品却使人大开眼界。靠墙排列着许多细长的电线，而电线又连着金属球。金属球经过磁化，互相之间不停地相互吸引或相互排斥。展厅中央是装有彩色灯泡的许多高高的构件，灯泡一刻不停地闪烁着，就像失去了控制的红绿灯。小黑盒子里迸出火花，红色灯泡发怒似地忽明忽暗。这儿倒像是在展览古老的电子设备。好像设计这些奇形怪状的展品不仅是为了给人感情上的强烈刺激，而且还想给人以电击似的！
== 回译
=== 1st
Modern #strike[sculptures] #underline[sculpture] #strike[are no longer able to surprise] #underline[rarely surprises] us #underline[any more]. The #strike[opinion] #underline[idea] that modern art can only be seen in #strike[the museum] #underline[museums] is #strike[not correct] #underline[*mistaken*]. Even those who #strike[aren't into] #underline[*take no interest in*] art #strike[won't notice the modern arts displayed] #underline[cannot have *fail to* notice example of modern sculpture on display] in public. #strike[Oddly sculptures stand in the garden, outside the buildings and shops, which we have been accustomed to seeing] #underline[Strange forms *stand* in the garden, and outside buildings and shops, which we have got quite used to them]. Some so called "modern" #strike[arts] #underline[pieces] have been #strike[displayed here] #underline[*on display*] for nearly 80 years.
Nevertheless, a recent modern-sculpture show still astonished some people including me. Walking into the #underline[*art gallery*] was a notice saying, "No touching on #strike[displays] #underline[*exhibits*], some of them are dangerous!" #strike[Some displays are moving sculptures.] #underline[The objects on display were pieces of moving sculpture.] #strike[Special sculptures people get used to are suspended on the ceiling, ... with the wind.] #underline[Oddly shaped forms that are *suspended from* the ceiling and move *in response to a gust of wind* are quite *familiar* to everybody.] #underline[These objects, however, are different.] #strike[A lot of long thin wires arranged against the wall, connected to the metal sphere.] #underline[*Lined up against the wall*, there were long thin wires *attached to* metal *sphere*]. The metal sphere #strike[has] #underline[had] been magnetized#strike[, attracting or repeach] #underline[and attracted or repelled] each other #underline[all the time]. In the center of the #underline[*hall*] were #underline[a number of tall structures which contained colorful lights which *flickered* continuously like] traffic lights #strike[out of control] #underline[going mad]. #strike[The black box fired... and the red lights turned bright and dark continuously.] #underline[*Sparks* were *emitted* from the black boxes and red *lamps* *flashed on and off* angrily.] It #strike[seems a show of historic electric devices] #underline[*was rather like an exhibition of prehistoric electronic equipments*]. #strike[It seemed that designing these odd-shape displays was not only give people violent impulses on emotion but also a ...]#underline[These *peculiar* forms were designed to not only *shock* people emotionally, but also give them electric shocks as well.]
#pagebreak()
= A very dear cat
== 参考译文
绑架者很少对动物感兴趣。最近，绑架者却盯上了埃莉诺·拉姆齐太太的猫。埃莉诺·拉姆齐太太是一个非常富有的老妇人，多年来，一直同她养的猫拉斯特斯一起住在一所公寓里。拉斯特斯生活很有规律，傍晚常常出去溜达一会儿，并且总是在7点钟以前回来。可是，有一天晚上，它出去后再也没回来。拉姆齐太太急坏了，四处寻找，但没找着。
拉斯特斯失踪3天后，拉姆齐太太收到一封匿名信。写信人声称拉斯特斯安然无恙，只要拉姆齐太太愿意支付1,000英镑赎金，可以立即将猫送还。他让拉姆齐太太把钱放在一个纸盒里，然后将纸盒放在门口。一开始拉姆齐太太打算报告警察，但又害怕再也见不到拉斯特斯了——这点，信上说得十分明白——于是便改变了主意。她从银行取出1,000英镑，并照绑架者的要求做了。第二天早晨，放钱的盒子不见了。但拉姆齐太太确信绑架者是会履行诺言的。果然，当天晚上7点整，拉斯特斯准时回来了。它看上去一切正常，只是口渴得很，喝了半瓶牛奶。拉姆齐太太把她所做的事告诉了警察，警察听后大为吃惊。拉姆齐太太解释说她心疼她的猫拉斯特斯。想到她所花的那笔钱，她的心疼就具有双重意义了。
== 回译
=== 1st
Kidnappers are rarely interested in animals. But recently, they took #strike[their eyes on] #underline[*considerable* interest in] Mrs. E<NAME>ay’s cat#strike[. Mrs. E<NAME> was an old rich woman and] #underline[a very wealthy old lady who has] shared a flat with her cat, Rastus, for years. Rastus leads #strike[a regular] #underline[an orderly] life as well that he usually takes a short walk #strike[at noon] #underline[in the evenings] and always came back #underline[home] #strike[before] #underline[by] 7 o'clock. #strike[However, he went out without returning back one evening.] #underline[One evening, however, he failed to arrive.] So #underline[*worried*] was Mrs. E<NAME>ay that she looked #strike[for her cat everywhere] #underline[everywhere for him] but in vain.
Three days after Rastus' #strike[missing] #underline[disappearance], Mrs. Eleanor Ramsay received an *anonymous* letter #strike[saying] #underline[*stating*] Rastus was #strike[all right] #underline[*in safe hands*]#underline[. Only if Mrs. Eleanor Ramsay was willing to pay 1000 pounds, the cat would be returned immediately.] #underline[and would be returned immediately if Mrs. Eleanor Ramsay paid *a ransom* of 1,000 pounds]. Mrs. Eleanor Ramsay was #strike[required] #underline[instructed] to #strike[put] #underline[place] the money #strike[into] #underline[in] a #strike[paper box] #underline[cardboard], and then #strike[set] #underline[leave] it outside the door. At first, Mrs. Elean<NAME> were going to call the police, but #strike[she was so afraid] #underline[*fearing*] that she couldn't see Rastus any more#strike[, which had been declared in the letter,] #underline[-- the letter had made that quite clear--], she changed her mind. She #strike[took] #underline[*withdrew*] 1,000 pounds from her bank and #strike[did everything the kidnappers had required] #underline[followed the kidnapper's instructions]. The #strike[second] #underline[next] morning, in the box within money missing. But Mrs. <NAME> #strike[convinced] #underline[was sure] that the kidnappers would #strike[fulfill their swear] #underline[keep his word]. #underline[*Sure enough*], Rastus #strike[came back] #underline[arrived *punctually*] at 7 o'clock #strike[in] that evening. He looked all well but thirsty, for he drank half a bottle #underline[of] milk. Mrs. <NAME> told what she had done to the police, astonishing the police. Mrs. <NAME> explained #strike[she was too worried about her cat Rastus] #underline[Rastus was very dear to her]. #underline[*Considering the amount she paid*, he *was dear* in more ways than one!]
#pagebreak()
= Pioneer pilots
== 参考译文
1908年，诺斯克利夫勋爵(Lord Northcliffe)拿出1,000英镑，作为对第一个飞越英吉利海峡(English Channel)的人的奖励。然而一年多过去了才有人出来尝试。1909年7月19日凌晨，休伯特·莱瑟姆(Hubert Latham)驾驶“安特瓦奈特4号”(Antoinete IV)飞机从法国海岸起飞，但他只在海峡上空飞行了7英里，引擎就发生了故障，他只好降落在海面上。“安特瓦奈特”号飞机在海上漂浮，后来有船经过，莱瑟姆方才获救。
两天之后，路易斯·布莱里奥(Louis Bleriot)驾驶一架名为“11号”(No. XI)的飞机来到加来(Calais)附近。布莱里奥从1905年起便开始研制飞机，“11号”飞机是他制作的最新型号。一周以前，他曾成功地进行了一次26英里的陆上飞行。但是莱瑟姆不肯轻易罢休。同一天，他驾驶一架新的“安特瓦奈特”号飞机来到了加来附近。看来会有一场激烈的飞越英吉利海峡的竞争。两架飞机都打算在7月25日起飞，但莱瑟姆那天起床晚了。布莱里奥凌晨4点15分作了一次短距离试飞，半小时后便正式出发了。他这次伟大的飞行持续了37分钟。当他在多佛着陆后，第一个迎接他的是当地一名警察。莱瑟姆一周以后也作了一次尝试，飞到了离多佛(Dover)不到半英里的地方。这次他又遭厄运，因引擎故障第二次降落在海面上。
== 回译
=== 1st
In 1908, <NAME> offered #underline[a prize of] 1,000 pounds #strike[as an award for] #underline[to] the first people flying across the English Channel. #strike[However, nobody made a try until over a year passed] #underline[_Over a year passed before the first attempt was made_]. #strike[On the early morning of 19th July in 1909] #underline[On July 19th, in the early morning], <NAME> took off from the #strike[coast of France] #underline[French coast] #strike[with his] #underline[in his plane, the] "Antoinete IV". Only #strike[flying for 7 miles] #underline[travelling 7 miles], the engine failed, which forced him to land on the sea. "Antoinete" #strike[floating on the sea, Latham was rescued when a ship passed by] [floated on the water until Latham was *pick up* by a ship.].
Two days later, <NAME> #strike[drove his "No. XI" near Calais] #underline[arrived near Calais with a plane called "No. XI"]. Bleriot had been #strike[starting to study ]making planes since 1905, and "No. XI" was #strike[the] #underline[his] latest model #strike[made by himself]. A week before, he had #strike[made] #underline[completed] a successful overland flight #strike[of 26 miles] #underline[during which he covered 26 miles]. #strike[But Latham] #underline[Latham, however,] wouldn't give up easily as well. #strike[The same day, he drove a brand new "Antoinete" near Calais] #underline[He, too, arrived near Calais on the same day with a new "Antoinete"]. It #strike[seemed] #underline[looked *as if*] there would be a fantastic #strike[competition] #underline[race] on flying across the English Channel. #strike[The two planes both] #underline[Both planes] planned to took off on 25th July, but Latham got up late. #strike[Bleriot made a short-distance fly at 4.15 in the early morning and] #underline[After a short test flight at 4.15 a.m., Bleriot] #strike[took] #underline[set] off #strike[officially] a half hour later. The great fly was all over in 37 minutes. After his landing near Dover, the first person #strike[who] #underline[to] greeted him was a local policeman. A week later, Latham made another #strike[try] #underline[attempt]. But a tragic happened again when he #strike[was no more than a half mile away from] #underline[got within half a mile of] Dover, landing on the sea for the second time because the engine failed again.
#pagebreak()
= <NAME>
== 参考译文
两百年前，拳击比赛在英国非常盛行。当时，拳击手们不戴手套，为争夺奖金而搏斗。因此，他们被称作“职业拳击手”。不过，拳击是十分野蛮的，因为当时没有任何比赛规则，职业拳击手有可能在比赛中受重伤，甚至丧命。
拳击史上最引人注目的人物之一是丹尼尔·门多萨，他生于1764年。1860年昆斯伯里侯爵第一次为拳击比赛制定了规则，拳击比赛这才用上了手套。虽然门多萨严格来讲不过是个职业拳击手，但在把这种粗野的拳击变成一种体育运动方面，他作出了重大贡献。是他把科学引进了这项运动。门多萨在他的全盛时期深受大家欢迎，无论是富人还是穷人都对他崇拜备至。
门多萨在14岁时参加了一场拳击赛后一举成名。这引起了当时英国拳坛名将理查德·汉弗莱斯的注意。他主动提出教授门多萨，而年少的门多萨一学就会。事实上，门多萨不久便名声大振，致使汉弗莱斯与他反目为敌。两个人争吵不休，显而易见，只有较量一番才能解决问题。于是两人在斯蒂尔顿设下赛场，厮打了一个小时。公众把大笔赌注下到了门多萨身上，但他却输了。后来，门多萨与汉弗莱斯再次在拳击场上较量，门多萨又输了一场。直到1790年他们第3次对垒，门多萨才终于击败了汉弗莱斯，成了全英拳击冠军。同时，他建立了一所拳击学校，办得很成功，连拜伦勋爵也成了他的学生。门多萨挣来大笔大笔的钱，一次出场费就可多达100英镑。尽管收入不少，但他挥霍无度，经常债台高筑。他在被一个叫杰克逊绅士的拳击手击败后很快被人遗忘。他因无力还债而被捕入狱，最后于1836年在贫困中死去。
== 回译
=== 1st
Two hundred years ago, boxing matches #strike[was] #underline[were] very popular in England. #strike[At that time] #underline[In those days], boxers #strike[fighting] #underline[fought] for #strike[awards] #underline[prize money] with bare fist#underline[s], for which they were #strike[called professional boxers] #underline[known as "prizefighters"]. However, boxing #strike[is] #underline[was] very #strike[cruel] #underline[crude] as #underline[there were] no any #strike[match] rules and boxers could be #strike[badly hurt] #underline[seriously injured] or even killed in a match.
One of the most #strike[attracting] #underline[colorful] boxers #underline[in boxing history] #strike[is] #underline[was] <NAME>, who was born in 1764. #strike[In 1860, Lord made boxing match rules for the first time and then the gloves were introduced in boxing matches.] #underline[The use of golves was not introduced until 1860, when the Marquis of Queensberry *drew up* the first set of rules.] Though Mendoza was #strike[no more than] #underline[technically] a prizefighter, #strike[strictly speaking,] he #strike[made huge contribution in terms of changing this kind of crude boxing into an official sport] #underline[did much to change crude prizefighting into a sport]. It's him who introduced science into the sport. #strike[Mendoza received a warm welcome by people on his day, both the rich and the poor admiring him very much.] #underline[In his day, Mendoza enjoyed tremendous popularity, adored by rich and poor *alike*.]
#strike[Mendoza had been celebrated after attending his first boxing match at the age of 14] #underline[Mendoza *rose to fame swiftly* after a boxing match when he was only 14 years old], which attracted the attention of <NAME>, #strike[a famed Britain boxer] #underline[the most eminent boxer in England]. He offered to #strike[teach] #underline[train] Mendoza and #strike[the young boxer] #underline[his young pupil] #strike[learned the skills easily] #underline[was quick to learn]. In fact, Mendoza soon made his name causing Richard #strike[being a rival of him] #underline[turning against him]. The two men #strike[arguing all the time] #underline[*quarrelled bitterly*], apparently a match was required to #strike[solve] #underline[settle] the #strike[problme] #underline[argument]. #strike[So the two took place a match in ... and then fought for an hour.] #underline[A match was held at Stilton, where both men fought an hour.] The public #strike[gambled Mendoza in a large ...,] #underline[*bet a great deal of money on Mendoza*,] but he #strike[failed] #underline[was defeated]. #strike[Afterwards, Mendoza made another fight again in a match, but Mendoza failed again.] #underline[Mendoza met Humphries in the ring on a later occasion and he lost for a second time.] Not until the third #strike[time they fought with each other] #underline[match], Mendoza #underline[finally] beat Richard to be a Champion #strike[in Britain boxing] #underline[of England]. #strike[At the same time] #underline[Meanwhile], he found#underline[ed] #strike[a boxing school and ran it successfully] #underline[a highly successful Academy], and <NAME> was even one of his students. Mendoza earned #strike[large] #underline[enormous] sums of money, #strike[his ... could be up to 100 pounds for one time] #underline[and he was paid as much as 100 pounds for a single appearance]. #strike[Though his earning much, he spent money without limitations and had a heavy debt.] #underline[Despite this, he was so extravagant that he was always in debt.] After being #strike[beaten] #underline[defeated] by a boxer called <NAME>, #strike[people soon forgot him] #underline[he was quickly forgotten]. Ultimately, he was #strike[arrested in] #underline[sent to] prison for #underline[failing to pay] the debt and died #strike[with] #underline[in] poverty in 1836.
#pagebreak()
= By heart
== 参考译文
有些剧目十分成功，以致连续上演好几年。这样一来，可怜的演员们可倒霉了。因为他们需要一夜连着一夜地重复同样的台词。人们以为，这些演员一定会把台词背得烂熟，绝不会临场结巴的，但情况却并不总是这样。
有一位名演员曾在一出极为成功的剧目中扮演一个贵族角色，这个贵族已在巴士底狱被关押了20年。在最后一幕中，狱卒手持一封信上场，然后将信交给狱中那位贵族。尽管那个贵族每场戏都得念一遍那封信，但他还是坚持要求将信的全文写在信纸上。
一天晚上，狱卒决定与他的同事开一个玩笑，看看他反复演出这么多场之后，是否已将信的内容记熟了。大幕拉开，最后一幕戏开演，贵族独自一人坐在铁窗后阴暗的牢房里。这时狱卒上场，手里拿着那封珍贵的信。狱卒走进牢房，将信交给贵族。但这回狱卒给贵族的信没有像往常那样把全文写全，而是一张白纸。狱卒热切地观察着，急于想了解他的同事是否记熟了台词。贵族盯着白纸看了几秒种，然后，眼珠一转，说道：“光线太暗，请给我读一下这封信。”说完，他一下子把信递给了狱卒。狱卒发现自己连一个字也记不住，于是便说：“陛下，这儿光线的确太暗了，我得去把眼镜拿来。”他一边说着，一边匆匆下台。贵族感到非常好笑的是：一会儿工夫，狱卒重新登台，拿来一副眼镜以及平时使用的那封信，然后为那囚犯念了起来。
== 回译
=== 1st
Some plays are so successful that they run #strike[on ends for several years] #underline[for years *on end*]. #strike[Then, poor actors were more poor, for they hat to repeat the same word night after night.] #underline[*In many ways,* this is unfortunate for the poor actors who are required to go on repeating the same lines night after night.] #strike[People think these actors must have been keeping their words in heart and will never falter.] #underline[_One would expect to know their parts by heart and never have cause to falter._] However, it isn't always the case.
#strike[A famed actor once play a role as a lord in a extremely successful play, who had been arrested in .. prison] #underline[A famous actor in a highly successful play *was once cast in the role of* an *aristocrat* who had been *imprisoned* in the Bastille] for 20 years. In the last #strike[scene] #underline[*act*], #strike[the] #underline[a] gaoler #strike[appeared with a letter in his hands and then handed it to the lord in prison] #underline[would always come on to the stage with a letter that would be handed to the prisoner]. Though the #strike[lord] #underline[noble] #strike[had to]#underline[was expected to] read the letter #strike[in each play] #underline[at each performance], he #underline[always] insisted #strike[on writing the whole article out of the paper] #underline[that it should *be written out in full*].
One day night, the gaoler #strike[was going to pull his colleague's leg] #underline[decided to *play a joke on his colleague*] to see if#underline[, after so many performances,] he had #strike[the words in] #underline[managed to learn the contents of the letter by] heart#strike[after so many plays]. The #strike[ , the last scene starting. The noble alone sitting in the dim prison of behind the ...]#underline[*curtain* went up on the final act of the play and revealed the aristocrat sitting alone behind bars in his dark cell.] #strike[At the time] #underline[*Just then*], the gaoler appeared with the precious letter in hand#underline[s]. #strike[Walking into the prison, the] #underline[The] gaoler #underline[entered the cell and] #strike[handed] #underline[presented] the letter to the #strike[noble] #underline[aristocrat]. But this time, the #strike[letter] #underline[copy he gave him] hadn't been written#underline[ out in full as usual], #strike[totally] #underline[simply] a #strike[white] #underline[blank sheet of] paper. The gaoler looking on eagerly, he was #strike[impatient] #underline[anxious] to see if he #strike[colleague] #underline[fellow actor] had #strike[had the words in heart] #underline[at last learnt his lines]. The noble #strike[gazed the white paper] #underline[stared at the blank sheet of paper] for seconds. #underline[Then, *squinting his eyes,*] #strike[and] he said, "the light was #strike[dark] #underline[dim], please read the letter #strike[for] #underline[to] me." And he #underline[*promptly*] handed the letter to the gaoler who then found he even couldn't remember one word #underline[of the letter either]. So the gaoler #strike[said] #underline[replied], "noble, the light #strike[do] was #underline[*indeed*] dim, I have to get my glasses." #strike[He said in one hand and get off the platform on the other hand.] #underline[With this, he hurried off the statge.] #strike[To the noble's much amusement] #underline[Much to the aristocrat's amusement,], #strike[a while later,] the gaoler returned to the platform #underline[a few moments later] in a pair of glasses with the #strike[usually-used letter] #underline[usual copy of the latter which he *proceeded* to reat to the prisoner.]#strike[, and then read the letter for the ...]
#pagebreak()
= One man's meat is another man's poison
== 参考译文
在决定什么能吃而什么不能吃的时候，人们往往变得不合情理。比如，如果你住在地中海地区，你会把章鱼视作美味佳肴，同时不能理解为什么有人一见章鱼就恶心。另一方面，你一想到动物油炸土豆就会反胃，但这在北方许多国家却是一种普通的烹饪方法。不无遗憾的是，我们中的大部分人，生来就只吃某几种食品，而且一辈子都这样。
没有一种生物所受到的赞美和厌恶会超过花园里常见的蜗牛了。蜗牛加酒烧煮后，便成了世界上许多地方的一道珍奇的名菜。有不计其数的人们从小就知道蜗牛可做菜。但我的朋友罗伯特却住在一个厌恶蜗牛的国家中。他住在大城市里的一所公寓里，没有自已的花园。多年来，他一直让我把我园子里的蜗牛收集起来给他捎去。一开始，他的这一想法没有引起我多大兴趣。后来有一天，一场大雨后，我在花园里漫无目的地散步，突然注意到许许多多蜗牛在我的一些心爱的花木上慢悠悠地蠕动着。我一时冲动，逮了几十只，装进一只纸袋里，带着去找罗伯特。罗伯特见到我很高兴，对我的薄礼也感到满意。我把纸袋放在门厅里，与罗伯特一起进了起居室，在那里聊了好几个钟头。我把蜗牛的事已忘得一干二净，罗伯特突然提出一定要我留下来吃晚饭，这才提醒了我。蜗牛当然是道主菜。我并不喜欢这个主意，所以我勉强跟着罗伯特走出了起居室。使我们惊愕的是门厅里到处爬满了蜗牛：它们从纸袋里逃了出来，爬得满厅都是！从那以后，我再也不能看一眼蜗牛了。
== 回译
=== 1st
People #strike[will be unreasonable] #underline[becom quite illogical] when deciding what can be eaten or can't. For instance#strike[s], if you live#underline[d] in Mediterranean ,you #strike[will] #underline[would] regard octopus as #strike[one kind of delicious food] #underline[a great *delicacy*] and #strike[ca]#underline[would]n't #underline[be able to] understand why some people #strike[so disgusted when they see the octopus] #underline[find it *repulsive*]. On the other hand, #strike[you will be disgusted when animal fried potatoes occurs to you, which is a normal way to cook in many northern countries.] #underline[your stomach would *turn* at the idea of frying potatoes in animal fat -- the normally accepted *practice* in may northen countries.] #strike[To a great pity, most of us, can only be eating several kinds of food in all out lives.]#underline[The sad truth is that _most of us have been brought up to eat certain foods and we stick to them all our lives_.]
No #underline[*creature*] #strike[receives] #underline[has received] more #strike[and hatred]#underline[*praise and abuse*] than snails often seen in gardens. #strike[After being]Cooked with wine, #strike[it turns into a famous ... in may places of the world.]#underline[snails are a great *luxury* in various parts of the world.] #strike[Countless people have known snails can be cooked into a dish from young.] #underline[There are countless people who, ever since their early years, have learnt to associate snails with food.] But my friend, Robert, lives in a country where #strike[people hate snails] #underline[snails are despised]. #strike[He lives in a flat in a big city, no his own garden.]#underline[As his flat is in a large town, he has no garden of his own.] For many years, he #strike[kept] #underline[has been] asking me to collect snails #strike[in]#underline[from] my garden and #strike[sent] #underline[take them] to him. At first, the idea #strike[didn't attract me] #underline[never *appealed to me* very] much. One day, however, I #underline[happened to bewandering] in my garden after a heavy #strike[rain]#underline[shower], noticing there were many snails taking a stroll on #strike[my dear] #underline[some of my prize] plants in my garden. Acting #strike[so rashly] #underline[on a sudden impulse], I collected #strike[dozens] #underline[several dozen] of snails and put them into a paper bag, going for Robert. Robert was very #strike[happy] #underline[delight] to see me and also #strike[*equally*] pleased with my little gift. I #strike[set] #underline[left] the paper bag in the hall and then #underline[we] went into the #strike[bedroom] #underline[living room] #strike[with Robert] #strike[talking]#underline[, where we talked] for several hours#strike[ there]. I had totally forgotten the snails #strike[until] #underline[when] Robert suddenly #strike[required me to have dinner]#underline[said that I must *stay to dinner*] tonight. Snail #strike[are]#underline[would,] sure enough#underline[, be] a main dish. But I #strike[don't like]#underline[didn't *fancy*] the idea, reluctantly #strike[going out of the bedroom with Robert]#underline[followed Robert out of the room]. To our #strike[great shock] #underline[dismay], snails were everywhere in the hall, escaping from the paper bag and #strike[being all over the room]#underline[*taking complete possession of* the hall]. From then on, I #strike[can't see a snail more]#underline[have never been able to look at a snail].
#pagebreak()
= A skeleton in the cupboard
== 参考译文
在小说中，我们经常读到一个表面上受人尊重的人物或家庭，却有着某种多年不为人所知的骇人听闻的秘密。英语中有一个生动的说法来形容这种情况。惊人的秘密称作“柜中骷髅”。在小说的某个戏剧性时刻，可怕的秘密泄漏出来，接着便是某人的声誉扫地。当读者到小说最后几页了解到书中女主人公，那位一向待大家很好的可爱的老妇人年轻时一连毒死了她的5个丈夫时，不禁会毛骨悚然。
这种事发生在小说中是无可非议的。尽管我们人人都有各种大小秘密。连最亲密的朋友都不愿让他们知道， 但我们当中极少有人有柜中骷髅。我所认识的唯一的在柜中藏骷嵝的人便是乔治.卡尔顿，他甚至引以为自豪。乔治年轻时学过医，然而，他后来没当上医生，却成了一位成功的侦探小说作家。有一次，我在他家里度周末，过得很不愉快。这事我永远不会忘记。乔治把我领进客房，说这间很少使用。他让我打开行装后下楼吃饭。我将衬衫、内衣放进两个空抽屉里，然后我想把随身带来的两套西服中的一套挂到大衣柜里去。我打开柜门，站在柜门前一下惊呆了。一具骷髅悬挂在眼前，由于柜门突然打开，它也随之轻微摇晃起来，让我觉得它好像马上要跳出柜门朝我扑过来似的。我扔下西服冲下楼去告诉乔治。这是比“骇人听闻的秘密”更加惊人的东西，这是一具真正的骷髅啊!但乔治却无动于衷。"噢，是它呀!" 他笑着说道，俨然在谈论一位老朋友。"那是塞巴斯蒂安。你忘了我以前是学医的了。"
== 回译
=== 1st
#strike[In a novel, we often read a respectful character or family in the surface, which however has secret that people don't know for years.]#underline[We often read in novels how a *seemingly* *respectable* person or family has some terrible secret which has been *concealed from* strangers for years.] #strike[In English, we have]#underline[The English language *possesses*] a vivid saying to describe such a situation#strike[:]#underline[.] The #underline[terrible] secret is called "a skeleton in the cupboard". #strike[In a dramatic moment in a novel]#underline[At some dramatic moment in the story], the #strike[terrifying]#underline[terrible] secret #strike[leaked]#underline[becomes known] and then #strike[someone's fame went away]#underline[a reputation is *ruined*]. #strike[When readers read]#underline[The reader's *hair stands on end* when he reads in] the final pages of the novel that heroine, #strike[the]#underline[a dear] old lady who #strike[is]#underline[had been] always kind to people #underline[had] once poisoned #strike[5 husbands of herself]#underline[every one of her five husbands] #strike[at young]#underline[*in her youth*]#strike[, they felt it spooky].
It's all well for such things to occur in #strike[a novel]#underline[*fictions*]. #strike[Though]#underline[*To varying degrees*,] we all have all kinds of secrets, even some of which #strike[aren't allowed to be known by our best friends]#underline[we don't want even out closest friends to learn], #underline[but] few of us have "a skeleton in the cupboard". The only one I know who has a skeleton in the cupboard was <NAME>, who #strike[was]#underline[is] even proud of it. George #strike[learnt to be a doctor when he was young]#underline[studied medicine in his youth]#strike[, but failed and became a successful detective novel writer.]#underline[Instead of becoming a doctor, however, he became a successful writer of detective stories.] #strike[One time, I had an awful weekend time]#underline[Once I _spent an uncomfortable weekend_] at his house, which I #strike[would]#underline[shall] never forget. George #strike[brought me into]#underline[showed me to] the guestroom that was #strike[seldom]#underline[*rarely*] used he said. He #strike[asked me to have meal after ...]#underline[told me to *unpack my things* and then come down to dinner.] #strike[I put my shirt and underwear into]#underline[After I had stacked my shirts and underclothes in] two empty drawers and then I #strike[was hanging]#underline[decided to hang] one of my two suits #underline[I had brought with me] into the big #underline[cupboard]. I open the cupboard door, #strike[patrified]#underline[and then stood in front of it petrified]. A skeleton #strike[hanging in front of me, for the sudden opening, it dangled slightly, which made me feel it was going to jump out of the door and .. onto me.]#underline[was dangling before my eyes. _The sudden movement of the door made it sway slightly and it gave me the impression that it was about to * leap out* at me._] #strike[I threw my suit and]#underline[*Dropping* my suit, I] #strike[rushed down the stairs]#underline[dashed downstairs] to tell George that it was #strike[a more staggering thing]#underline[worse] than "a skeleton in the cupboard", it was a real one! But George #strike[did nothing]#underline[was *unsympathetic*], saying with a smile "Oh, #strike[it's him]#underline[that]", #underline[*as if* he were] talking #strike[like it was his]#underline[about an] old friend. "It's Sebastian. Did you forget I #strike[learnt medical ... before]#underline[was a medical student once upon a time]?"
#pagebreak()
= The Cutty Sark
== 参考译文
人们在格林威治仍可看到19世纪最有名的帆船之一“卡蒂萨克”号。它停在陆地上，每年接待成千上万的参观者。它给人们留下深刻的印象，使人们回忆起历史上的巨型帆船，在蒸汽船取代帆船之前。“卡蒂萨克”号之类的帆船被用来从中国运回茶叶，从澳大利亚运回羊毛。“卡蒂萨克”号是帆船制造史上建造的最快的一艘帆船。唯一可以与之一比高低的是“塞姆皮雷”号帆船。两船于1872年6月18日同时从上海启航驶往英国，途中展开了一场激烈的比赛。这场比赛持续了整整4个月，是这类比赛中的最后一次，它标志着帆船伟大传统的结束与一个新纪元的开始。
比赛开始后，“赛姆皮雷”号率先抵达爪哇岛。但在印度洋上，“卡萨萨克”号驶到了前面。看来，它首先返抵英国是确信无疑的了，但它却在比赛中连遭厄运。8月份“卡蒂萨克”号遭到一场特大风暴的袭击，失去了一只舵。船身左右摇晃，无法操纵。船员用备用的木板在船上赶制了一只应急用的舵，并克服重重困难将舵安装就位，这样一来，大大降低了船的航速。因为船不能开得太快，否则就有危险，应急舵也会被刮走。因为这个缘故，“卡蒂萨克”号落到了后面。跨越赤道后，船长将船停靠在一个港口，在那儿换了一只舵。但此时，“赛姆皮雷”号早已在500多英里之遥了。尽管换装新舵时分秒必争，但“卡蒂萨克”号已经不可能取胜了，它抵达英国时比“塞姆皮雷”号晚了1个星期。但考虑到路上的多次耽搁，这个成绩也已很不容易了。毫无疑问，如果中途没有失去舵， “卡帝萨克”号肯定能在比赛中轻易夺冠。
== 回译
=== 1st
People are now still able to see one of the most famous #underline[sailing] ships in 19th century at Greenwich, the Cutty Sark. She #strike[landed on the ground]#underline[stands on dry land], and thousands of visitors came to see it each year. #strike[It left people impressive, reminding them of the colossal ship in the history before the .. was replaced by the steam ship. Ships like ".."]#underline[_She *serves as* an impressive reminder of the great ships of the past._ Before they were replaced by steamships, sailing *vessels* like the Cutty Sark ] were used to carry tea from China or wool from Australia. The Cutty Sark was one of the fastest ships that had #underline[ever] been built. The #strike[one that could be compared to it]#underline[only other ship to match her] was the Thermopylae. The two ship set out #strike[to England] from Shanghai on #strike[18th June]#underline[June 18th], 1872 #underline[*on an exciting race* to England]#strike[at the same time, during which an exciting competition began]. #strike[The competition lasted for 4 months, which was the last time of such kind of competition.]#underline[This race, which went on for exactly four month, was *the last of its kind*.] It marked the end of the great tradition #underline[of ships with sails] and the beginning of a new era.
After the #strike[competition began]#underline[race has begun], #underline[the first of two ships to] arrived Java #underline[was the Thermopylae]. But #strike[in]#underline[on the] Indian #strike[sea]#underline[Ocean], the Cutty Sark took the lead. It seemed #underline[certain that] she would no doubt be the first #strike[one to get to England]#underline[ship home]. However, #strike[during the race she had a lot of] bad luck#strike[s always came to it]. She was struck by a extremely heavy storm in #strike[April]#underline[August], #strike[and lost her ..]#underline[during which her *rudder* was torn away.] The Cutty Sark #strike[shook left and right]#underline[rolled from side to side], #strike[being out of control]#underline[and it became impossible to *steer* her.]. #strike[The crew made a ... in a hurry with the backup wood board and it was fitted in the right place.] #underline[A temporary rudder was made on board from spare planks and it was fitted with great difficulty.] Then the speed of the ship was #underline[greatly] reduced in many ways, for the ship couldn't go fast or it would be dangerous that #strike[the emergent ... would be ... away]#underline[this rudder would be torn away as well]. The Cutty Sark #strike[left behind]#underline[*lost her lead*] for this reason. Crossing the *Equator*, the captain #strike[stopped the ship near a port and changed the ...]#underline[*called in* at a port to have a new rudder fitted] But #strike[at this time]#underline[by now], the Thermopylae had been over 500 miles #strike[away]#underline[ahead]. #strike[Despite they changed the ..]#underline[Though the new rudder was fitted at tremendous speed], the Cutty Sark had been unable to win. She arrived #underline[in] England a week later than the Thermopylae. Considering the delay during the trip, #strike[the result was not bad though]#underline[this was remarkable though]. She could win easily by no means if it hadn't lost her rudder in the half way.
#pagebreak()
= Wanted: a large biscuit tin
== 参考译文
没有人能避免受广告的影响。尽管我们可以自夸自己的鉴赏力如何敏锐，但我们已经无法独立自主地选购自己所需的东西了。这是因为广告在我们身上施加着一种潜移默化的影响。做广告的人在力图劝说我们买下这种产品或那种产品之前，已经仔细地研究了人的本性，并把人的弱点进行了分类。
做广告的人们多年前就发现我们大家都喜欢免费得到东西。凡是用“免费”这个神奇的词开头的广告很少会失败的。目前，做广告的人不仅提供免费样品，而且还提供免费汽车，免费住房，免费周游世界。他们设计数以百计的竞赛，竞赛中有人可赢得巨额奖金。电台、电视使做广告的人可以用这种手段吸引成百万人的注意力。
有一次，在电台播放的节目里，一个生产饼干的公司请听众烘制饼干送到他们的工厂去。他们愿意以每磅10美元的价钱买下由听众烘制的最大的饼干。这次竞赛在听众中引起极其热烈的反响。不久，形状各异，大小不一的饼干陆续送到工厂。一位女士用手推车运来一个饼干，重达500磅左右。相隔不一会儿，一个男子也带来一个大饼干，那个饼干把汽车的行李箱挤得满满的。凡送来的饼干都仔细地称量。最重的一个达713磅，看来这个饼干获奖无疑了。但就在竞赛截止时间将到之际，一辆卡车驶进了工厂，运来了一个特大无比、重达2,400磅的饼干。它是由一个大学生烘制的，用去1,000多磅的面粉、800磅食糖、200磅动物脂肪及400磅其他各种原料。饼干份量太重了，用了一台起重机才把它从卡车上卸下。饼干公司不得不付出比他们预计多得多的钱，因为为买下那学生烘制的饼干他们支付了24,000美元。
== 回译
=== 1st
No one can avoid #strike[the influence from advertisement]#underline[being influenced by advertisements]. #strike[Even though we could boast how sensitive our taste is]#underline[_Much as we may *pride* ourselves on our good taste_], we have been #strike[unable to purchase what we want freely]#underline[no longer free to choose the things we want]. This is because #strike[ads]#underline[advertising] #strike[have]#underline[has] exerted a #strike[kind of]#underline[subtle] influence on us without awareness. #strike[Advertisers have studied human nature and classified the weakness before they try to pursuade us to buy the production.]#underline[*In their efforts to* persuade us to buy this or that product, advertisers have made a close study of human nature and have classified all our little *weaknesses*.]
Advertisers have found we all love to get something #strike[free]#underline[for nothing] many years ago. #strike[The]#underline[An] advertisement that begins with #underline[the word] "FREE" #strike[seldom fails]#underline[can rarely go wrong]. By now, advertisers will not only #strike[provide]#underline[offer] free samples#underline[,] but #strike[also] free cars, houses#underline[, and] even free world trip#underline[s]. They #strike[designed]#underline[*devised*] hundreds of competitions where people could win large sums of awards. #strike[Advertisers attract millions of people's attention through television and. ]#underline[Radio and television have made it possible for advertisers to *capture the attention* of millions of people in this way.]
#strike[One time in a radio show]#underline[During a radio programme], #strike[a biscuit company]#underline[a company of biscuit *manufactures* once] asked listeners to bake biscuits and send them to their factory. They #strike[are willing]#underline[offered] to pay \$10 per pound for the biggest biscuit made by #strike[listeners]#underline[a listener]. #strike[The competition enjoyed a great population in the listeners.]#underline[The response to this competition was tremendous.] #strike[Soon]#underline[Before long], #strike[various forms and weight biscuits]#underline[biscuits of all shapes and sizes] #strike[are sent to]#underline[began arriving at] the factory. A lady #strike[carried]#underline[brought in] her biscuit #strike[with a wheel driver]#underline[on a *wheelbarrow*], which #strike[is] weighed about 500 pounds. A while later, one man #strike[brought]#underline[came along with] a biscuit which #strike[filled]#underline[occupied] the #underline[whole *boot* of his] car. Each biscuit sent to the factory was weighed carefully, and the heaviest one #strike[is weighed]#underline[was] 713 pounds. It seemed #underline[certain] the biscuit would win the #strike[award]#underline[prize]. But just before the competition #strike[dead line]#underline[closed], a lorry #strike[drove into]#underline[arrived at] the factory with a #underline[truly] colossal #strike[2,400-pounds] biscuit #underline[which weighed 2,400 pounds], which #strike[is]#underline[had been] baked by a college student. It cost over 1,000 pounds of #underline[*flour*], 800 pounds of #underline[sugar], 200 pounds of animal fat and 400 pounds of other ingredients. So heavy is the biscuit that #underline[a *crane* had to be used to unload it from the lorry]. The #strike[biscuit company]#underline[manufacturers] had to pay far more money than they #underline[had] anticipated before#underline[,] for they #strike[paid 24,000 dollars for the biscuit baked by the college student]#underline[bought the biscuit from the student for \$ 2,400].
#pagebreak()
= Nothing to sell and nothing to buy
== 参考译文
据说每个人都靠出售某种东西来维持生活。根据这种说法，教师靠卖知识为生，哲学家靠卖智慧为生，牧师靠卖精神安慰为生。虽然物质产品的价值可以用金钱来衡量，但要估算别人为我们所提供的服务的价值却是极其困难的。有时，我们为了挽救生命，愿意付出我们所占有的一切。但就在外科大夫给我们提供了这种服务后，我们却可能为所支付的昂贵费用而抱怨。社会上的情况就是如此，技术是必须付钱去买的，就像在商店里要花钱买商品一样。人人都有东西可以出售。
在这条普遍性的规律面前，好像只有流浪汉是个例外。乞丐出售的几乎是他本人，以引起过路人的怜悯。但真正的流浪汉并不是乞丐。他们既不出售任何东西，也不需要从别人那儿得到任何东西。在追求独立自由的同时，他们并不牺牲为人的尊严。流浪汉可能会向你讨钱，但他从来不要你可怜他。他是故意地选择过那种生活的，并完全清楚以这种方式生活的后果。他可能从不知道下顿饭有无着落，但他不像有人那样被成千上万桩愁事所折磨。他几乎没有什么财产，这使他能够轻松自如地在各地奔波。由于被迫在露天睡觉，他比我们中许多人都离大自然近得多。为了生存，他可能会去打猎、乞讨，偶尔偷上一两回；确实需要的时候，他甚至可能干一点儿活，但他决不会牺牲自由。说起流浪汉，我们常常带有轻蔑并把他们与乞丐归为一类。但是，我们中有多少人能够坦率地说我们对流浪汉的简朴生活与无忧无虑的境况不感到有些羡慕呢？
== 回译
=== 1st
It is said that everyone lives by selling something. #strike[According to this saying]#underline[_In the light of this statement_], teachers live by selling knowledge, philosophers #strike[live] by selling wisdom and #underline[*priests*] #strike[live] by selling #strike[mental comforting] #underline[spiritual comfort]. Though #strike[the material value can be balanced by money]#underline[it may be possible to measure the value of material goods in terms of money], it is still extremely hard to #strike[evaluate]#underline[estimate] the #underline[true] value of the service #strike[served by others]#underline[people perform for us]. #strike[Sometimes we are willing to sacrifice everything we have to save a life. After surgeries provide this kind of service, however, we complain of the high cost.] #underline[There are times when we would *willingly* give everything we possess to save our lives, *yet* we might *grudge* paying a surgeon a high *fee* for offering us precisely this service.] #strike[This is the case in society that technology has to be paid just like you should pay when you buy something in a shop.]#underline[_The conditions of society are such that skills have to be paid for in the same way that goods are paid for at a shop._] Everyone has something to sell.
#strike[In front of the general rule, only tramps are exception to it.]#underline[*Tramps* seem to be the only *exception to* this general rule.] Beggars #underline[almost] sell themselves #underline[as human beings] to arouse the pity of passers-by, but a real tramp isn't a beggar. They #strike[neither sell anything nor get anything from others]#underline[_have nothing to sell and require nothing from others_]. #underline[*In seeking independence*,] they don't sacrifice #strike[the dignity of a human being]#underline[their human dignity] #strike[when pursuing independence and freedom]. Tramps may ask you for money, but never ask #strike[for your pity]#underline[you to feel sorry for him]. #strike[They choose their lives intentionally and know the consequences absolutely.]#underline[They has deliberately chosen to lead the life the leads and is fully aware of the consequences.] They may #strike[not know]#underline[never be sure] #strike[whether they could have a next meal]#underline[where the next meal is coming from], but they #strike[won't be tortured by thousands of bad things]#underline[are free from the thousands of anxieties which *afflict* other people]. #strike[They have]#underline[Their] few possessions#strike[, which make them run from one place to another]#underline[make it possible for them to move form place to place] #strike[at]#underline[with] ease. #strike[Forced to sleep ...]#underline[_By having to sleep in the open_], they get far closer to nature than most of us. To live, they may go hunting or begging, or even they may steal #strike[for a few times]#underline[*occasionally*]. #strike[When it is truly needed]#underline[*In times of real need*], they can do some work but will never sacrifice #underline[their] freedom. #strike[When it comes to tramps, we often classify them into beggars with contempt.]#underline[We often *speak of tramps with contempt* and *put them in the same class* as beggars.] However, how many #strike[people] of us can #underline[honestly] say we #strike[aren't envy with the simple life led by tramps]#underline[have not felt a little of] #underline[their simple way of life and *their freedom from care*].
#pagebreak()
= Five pounds too dear
== 参考译文
当一艘大型班船进港的时候，许多小船载着各种杂货快速向客轮驶来。大船还未下锚，小船上的人就纷纷爬上客轮。一会儿工夫，甲板上就摆满了色彩斑斓的波斯地毯、印度丝绸、铜咖啡壶以及手工制作的漂亮的银器。要想不为这些东西所动心是很困难的。船上的许多游客开始同商贩讨价还价起来，但我打定主意上岸之前什么也不买。
我刚下船，就被一个人截住，他向我兜售一枚钻石戒指。我根本不想买，但我不能掩饰这样一个事实：其钻石之大给我留下了深刻的印象。有的钻石像玻璃球那么大。那人竭力想证明那钻石是真货。我们路过一家商店时，他将一颗钻石使劲地往橱窗上一按，在玻璃上留下一道深痕。我花了半个多小时才摆脱了他的纠缠。
向我兜售的第二个人是卖名贵钢笔和手表的。我仔细察看了一枝钢笔，那看上去确实不假，金笔帽下方整齐地刻有“美国制造”字样。那人说那支笔值50英镑，作为特别优惠，他愿意让我出30英镑成交。我摇摇头，伸出5根手指表示我只愿出5镑钱。那人激动地打着手势，仿佛我的出价使他不能容忍。但他终于把价钱降到了10英镑。我耸耸肩膀掉头走开了。一会儿，他突然从后追了上来，把笔塞到我手里。虽然他绝望地举起双手，但他毫不迟疑地收下了我付给他的5镑钱。在回到船上之前，我一直为我的绝妙的讨价还价而洋洋得意。然而不管我如何摆弄，那枝漂亮的钢笔就是吸不进墨水来。直到今天，那枝笔连一个字也没写过！
== 回译
=== 1st
#strike[When a great liner went into the harbour,] Many little boats loaded with #strike[all kinds of ...]#underline[*wares*] sped to the great liner #underline[as she was entering the harbour]. Before the liner #strike[was]#underline[had] anchored, #strike[people on boats crowded onto the liner.]#underline[people from the boats had climbed on board.] Soon, the #strike[board was]#underline[decks were] covered with colorful rugs from Persia, #strike[Indian]silk #underline[from India], #underline[*copper*] coffee #strike[cups]#underline[*pots*] and #underline[beautiful] handmade #strike[silvers]#underline[silverware]. It's very difficult not to be #strike[attracted by those things]#underline[*tempted*]. Many #strike[travellers]#underline[*tourists* on board had] began to bargain with #strike[sellers]#underline[the *tradesmen*], but I had made #underline[up] my mind not to buy anything before #underline[I had *disembarked*].
#strike[As soon as I went down the liner, I was blocked]#underline[I had no sooner got off the ship than I was *assailed*] by a man who #strike[sold]#underline[wanted to sell me] a diamond ring. I #strike[didn't wanna buy it from deep]#underline[*had no intention* of buying one], but I couldn't conceal the fact #strike[the size of the diamond left me impressive]#underline[I was impressed by the size], #underline[some of] which #strike[was]#underline[were] as big as #strike[a] marble#underline[s]. The man *went to lengths* to prove #strike[it true]#underline[the diamonds real]. #strike[When we passed by]#underline[As we were walked past] a shop, he held #strike[the]#underline[a] diamond #underline[firmly] #strike[onto]#underline[against] the display window and left #strike[it]#underline[the window] a deep impression. It took me over half an hour to get rid of him.
#strike[The second one who tried]#underline[The next man] to approached me was to sell #strike[notable]#underline[expensive] pens and watches. I #strike[took a close look at a pen he sold]#underline[*examined* one of the pens closely], it certainly seemed genuine with #underline[the words] "Made In the U.S.A" #strike[scribed]#underline[neatly *inscribed*] #strike[under]#underline[*at the base* of] the golden cup. The man said the pen was worth 50 pounds, #strike[and]#underline[but] as a special favour, he #strike[was willing to make the deal with 30 pounds]#underline[would let me have it for 30 pounds]. Shaking my head, I #strike[could just pay 5 pounds for it with my 5 fingers given]#underline[held up five fingers indicating that I was willing to pay 5 pounds]. Gesticulating wildly, #strike[he couldn't accept the price I offered seemingly]#underline[the man acted as if he found my offer *outrageous*]. But he at last #strike[made]#underline[*reduced*] the price #strike[down] to 10 pounds. Shrugging my shoulders, I walked away. A little later, I caught me from behind, thrust the pen into my hands. Though he #underline[kept] #strike[put up]#underline[throwing up] his arms #strike[with]#underline[in] despair, he readily #strike[received]#underline[accepted] the 5 pounds I paid. After back to the liner, I was all the time pleased with my stunning bargain until #strike[whatever]#underline[no matter how hard] I tried, the pretty pen couldn't have any ink #underline[filled] in. #strike[Up to today, the pen still write no words.]#underline[To this day, it has never written a single word.]
#pagebreak()
= Funny or not?
== 参考译文
我们觉得一则笑话是否好笑，很大程度上取决于我们是在哪儿长大的。幽默感与民族有着神秘莫测的联系。譬如，法国人听完一则俄国笑话可能很难发笑。同样的道理，一则可以令英国人笑出泪来的笑话，俄国人听了可能觉得没有什么可笑之处。
大部分令人发笑的故事都是根据喜剧情节编写的。尽管民族不同，有些滑稽情节却能产生普遍的效果。比如说，不管你生活在哪里，你看了查理·卓别林的早期电影很难不发笑。然而，近来一种新式幽默流行了起来，这种幽默主要来自美国。它被叫作“病态幽默”。喜剧演员根据悲剧情节诸如暴死、重大事故等来编造笑话。许多人认为这种笑话是低级庸俗的。下面是个“病态幽默”的实例，你可以据此自己作出判断。
圣诞节前几周，某人摔断了右腿被送进医院。从他进医院那一刻时，他就缠住医生，让医生告诉他什么时候能回家。他十分害怕在医院过圣诞。尽管医生竭力医治，但病人恢复缓慢。圣诞节那天，他的右腿还上着石膏，他在床上郁郁不乐地躺了一天，想着他错过的种种欢乐。然而，第二天，医生安慰他说，出院欢度新年的可能性还是很大的，那人听后振作了精神。果然，除夕时他可以一瘸一拐地去参加晚会了。为了补偿住院这一段不愉快的经历，那人喝得稍许多了一点。在晚会上他尽情娱乐，一再告诉大家他是多么讨厌医院。晚会结束时，他嘴里还在嘟哝着医院的事，突然踩到一块冰上滑倒了，摔断了左腿。
== 回译
=== 1st
Whether #underline[we find] #strike[the]#underline[a] joke #strike[is] funny #underline[or not] #strike[to a person] largely depends on where we have been brought up #strike[with]. The sense of humour #strike[goes hand in hand]#underline[*is mysteriously bound up*] with #strike[people]#underline[*national characteristics*]. For instance, a French#underline[man] #strike[may be difficult to laugh after hearing a Russian joke]#underline[might find it hard to laugh at a Russian joke]. In the same way, #strike[the]#underline[a] Russian #strike[may feel nothing funny after hearing]#underline[might fail to see anything amusing in] a joke that could make Englishman laugh to tears.
Most funny stories are based on comic #strike[stories]#underline[situations]. #strike[Though different peoples]#underline[In spite of national differences], #strike[some funny parts can have the same effect]#underline[certain funny funny situations have a universal appeal]. #strike[For example, it's hard not to laugh after the early movie of Charlie Chaplin.]#underline[No matter where you live, you would find it difficult not to laugh at, say, Charlie Chaplin's early films.] However, a new #underline[type of] humour has #strike[become popular these days]#underline[come into fashion], which #strike[mostly comes from England]#underline[*stems* largely from the U.S.] and is called "Sick Humour". #strike[The comic actors]#underline[Comedians] #strike[create]#underline[*base* their] jokes #strike[according to some tragedies]#underline[on tragic situations] like #underline[violent] death or #strike[heavy] #underline[serious] accidents. Many people regarded this kind of jokes #strike[low]#underline[distasteful]. Below is a sample of "Sick Humour" #underline[which will enable you to] #strike[you can] judge #strike[it] on your own.
Several weeks before the Christmas, a man had its right leg broken and was #strike[sent]#underline[taken] to #strike[the] hospital. From the moment he was in hospital, he #underline[kept on *pestering*] #strike[the]#underline[his] doctor #strike[and asked the doctor]#underline[to tell him] when he could be able to go home. He dreaded #strike[spending]#underline[having to spend] #strike[his] Christmas in hospital. The doctor tried his best, but the recovery was still slow. When the Christmas came, his right leg was still #strike[on]#underline[in] plaster and he #strike[laid on bed for a whole full of sadness, thinking all kinds of happiness he missed]#underline[spend a miserable day in bed thinking of all the fun he was missing]. #strike[However, the doctor comforted him the second day, his chances of having the new year at home were large, letting the man inspired. Surely, he could .. to the party at the night of the new year.]#underline[_The following day_, however, the doctor *consoled* him by telling him that his chances of being able to leave hospital in time for New Year celebrations were good. The man *took heart* and, sure enough, on New year's Eve he was able to *hobble* along to a party]. To compensate #strike[the sadness]#underline[his unpleasant experiences] in hospital, the man drank #underline[a little] more than #strike[he] was good #underline[for him]. #underline[_In the process_,] he enjoyed #strike[the party all the time]#underline[himself *thoroughly*] and #strike[told]#underline[kept telling] everyone how #underline[much] he hated #strike[the] hospital. #strike[After]#underline[At the end of] the party, he was still mumbling #strike[the thing in]#underline[something about] hospitals#strike[. Suddenly,] #underline[when] he suddenly slipped #strike[off] on #strike[an]#underline[a piece of] ice and had his left leg broken.
#pagebreak()
= The death of a ghost
== 参考译文
多年来，村民们一直认为恩得利农场在闹鬼。恩得利农场属于乔·考科斯和鲍勃·考科斯兄弟俩所有。他们雇了几个农工，但谁也不愿意在那儿长期工作下去。每次雇工辞职后都叙述着同样的故事。雇工们说，常常一早起来发现有人在夜里把活干了，干草已切好，牛棚也打扫干净了。有一个彻夜未眠的雇工还声称他看见一个人影在月光下收割庄稼。随着时间的流逝，考科斯兄弟雇了一个尽心尽责的鬼，他们家的活大部分都让鬼给干了，这件事成了公认的事实。
谁也没想到农场里竟会有一个从未露面的人。但事实上确有此人。不久之前，村民们惊悉恩得利农场的鬼死了。大家都去参加了葬礼，因为那“鬼”不是别人，正是农场主的兄弟埃里克·考科斯。人们以为埃里克年轻时就死了。葬礼之后，乔和鲍勃透露了他们保守了长达50多年的秘密。
埃里克是这家的长子，年龄比他两个弟弟大很多，第二次世界大战期间被迫参军。他讨厌军旅生活，决定逃离所在部队。当他了解到自己将被派遣出国时，他逃回农场，父亲把他藏了起来，直到战争结束。由于害怕当局，埃里克战后继续深藏不露。他的父亲告诉大家，埃里克在战争中被打死了。除此之外，只有乔与鲍勃知道这个秘密。但他俩连自己的妻子都没告诉。父亲死后，他们兄弟俩认为有责任继续把埃里克藏起来。这些年来，埃里克过着隐士生活，白天睡觉，夜里出来干活，一点不知道自己已成了恩得利农场的活鬼。他死后，他的弟弟们才觉得无法再保守这个秘密了。
== 回译
=== 1st
For years, villagers #strike[were always thinking]#underline[believed] that Endley Farm was #strike[on haunt]#underline[haunted]. The farm was owned by two brothers, <NAME> and <NAME>. They #strike[hired]#underline[employed] several #strike[workers]#underline[*farmhands*] but no one was willing to work there #strike[for a long time]#underline[for long]. #strike[The workers]#underline[*Farm labourers*] said, they often woke up to #strike[see]#underline[find] the work done #underline[overnight]. #underline[*Hay*] had been cut and the cow shed#underline[s] had been cleaned up. A worker who #strike[was once waken]#underline[once stayed up] all night claimed #strike[he had caught sight of]#underline[to have seen] a figure who was #strike[doing a harvest]#underline[cutting *corn*] in the moonlight. #strike[As time was passing]#underline[In time], #strike[the Cox Brother hired a responsible ghost who did the most of the work in their house, which was considered as a good thing publicly.]#underline[It became an accepted fact that the Cox brothers employed a *conscientious* ghost that did most of their work for them.]
No one #strike[thought]#underline[*suspected*] there #strike[was a man that]#underline[might be someone else who had] never been seen. #strike[However, the man indeed existed.]#underline[This was indeed the case.] #strike[No longer before]#underline[A short time ago], villagers #underline[was astonished to] learn#strike[t] that the ghost in the farm had died. Everyone went to attend the funeral and found that the ghost #strike[wasn't others but the farmers' brother, <NAME>. People thought Eric had died at his youth. ]#underline[was none other than <NAME>, a third brother who was supposed to have died as a young man]. After the funeral, Joe and Bob #strike[leaked]#underline[*revealed*] the secret they had concealed from strangers for over 50 years.
Eric, the #strike[elder brother]#underline[eldest son] in the family, was much elder than his two brothers. He #strike[was forced]#underline[had been *obliged*] to join the army #strike[in]#underline[during] the World War II. #underline[As] he hated military life#strike[ and]#underline[, he] made up his mind to #strike[run away from the military he was in]#underline[*desert his regiment*]. When he learnt that he would be #strike[delegated]#underline[sent] to abroad, he escaped #strike[home] and his father #strike[had him hidden]#underline[hid him] until the war was over. #strike[Due to fears for the government]#underline[_Fearing the authorities_], Eric remained hidden after the war #underline[as well]. His father once told #strike[people]#underline[everyone] that Eric had died in the war. On top of his father, the secret was only known by Joe and Bob, who #underline[_did_] even never told the secret to their wives. After his father's death, the two brother thought #strike[they were still responsible to keep Eric hidden]#underline[it their duty to keep Eric in hiding]. These years, Eric led his life in the same way as a #strike[hermit]#underline[*recluse*], sleeping in the day and working #strike[in the evening]#underline[at night], #strike[not knowing]#underline[quite *unaware* of the fact that] he had been the #strike[alive] ghost in the farm. #strike[After his death]#underline[When he died, however,] his brothers #strike[then thought the secret couldn't be concealed any more]#underline[found it impossible to keep the secret any longer].
#pagebreak()
= A lovable eccentric
== 参考译文
真正古怪的人从不有意引人注意。他们不顾社会习俗，意识不到自己所作所为有什么特殊之处。他们总能赢得别人的喜爱与尊敬，因为他们给平淡单一的日常生活增添了色彩。
理查德·科尔森生前是我们镇上最有名望的人之一。他是个精明能干、有钱的商人，但镇上大部分人对他生活中的这一个方面几乎一无所知。大家都管他叫迪基。早在他去世前很久，他的古怪行为就成了传奇故事了。
迪基痛恨势利小人。尽管他有一辆豪华小轿车，但却很少使用，常常喜欢以步代车。即使大雨倾盆，他也总是拒绝带伞。一天，他遇上一场瓢泼大雨，淋得透湿。他走进一家高级商店，要为妻子买一块价值300英镑的手表。但店员见他浑身泥水的样子，竟不肯接待他。迪基二话没说就走了。一会儿，他带着一个大布口袋回到店里。布袋很沉，他重重地把布袋扔在柜台上。店员让迪基走开，他置之不理，并要求见经理。经理认出了这位顾客，表示了深深的歉意，还严厉地训斥了店员。店员为迪基拿出了那块手表，迪基把布口袋递给他，口袋里面装着300镑的便士。他坚持要店员点清那些硬币后他才离去。这些硬币加在一起共有30，000枚！还有一次，他邀请一些著名评论家来参观他私人收藏的现代画。这次展览引起报界广泛注意，因为这些画名义上是名家的作品，事实上是迪基自己画的。他花了4年时间策划这出精心设计的闹剧，只是想证明评论家们有时并不了解他们所谈论的事情。
#pagebreak()
= A lost ship
== 参考译文
打捞工作彻底失败了。小船“埃尔科”号在巴伦支海搜寻了几个星期之后，正在返航途中。返航前，该船船长收到了大陆上发来的电报，指示他们放弃这次搜寻。船长知道日后还会再作尝试，因为他试图寻找的沉船上载有一批珍贵的金条。
尽管船长接到了电报，他还是决定再试一试。他们用结实的网把海床搜索了一遍。当一只箱子从海底被打捞上来时，甲板上人们激动不已。船员们开始认为沉船找着了，但海底沉箱内的物品证明他们弄错了。事实上，他们发现的是另一艘沉没多年的船。
木箱内装有水手艾伦·菲尔丁的私人财物，其中有书籍、衣服、照片以及水手收到的妻子的来信。“埃尔科”号船长命令船员尽量从沉船中打捞物品，但没发现什么值钱的东西，不过打捞出来的众多的物品还是引起了大家极大的兴趣。从捞起的一门大炮来看，船长认为那艘船一定是艘巡洋舰。另一只海底沉箱中装的是船上一位军官的财物，其中有一封写于1943年3月14日的信，但没有写完。从这封信中船长了解到沉船船名是“卡伦”号。打捞到的东西中最有价值的是船上的航海日志，其中有一部分仍然清晰可读。据此，船长可以将所有的那些已经搞清的材料拼凑起来。“卡伦”号当年在为其他船只护航驶往俄国途中突然遭到敌方潜水艇鱼雷的袭击。这一说法在“埃尔科”号返航后得到国防部一位海军官员的证实。那次打捞到的所有物品均被送往军事博物馆。
#pagebreak()
= A day to remember
== 参考译文
我们大家都有过事事不顺心的日子。一天开始时，可能还不错，但突然间似乎一切都失去了控制。情况经常是这样的，许许多多的事情都偏偏赶在同一时刻出问题，好像是一件无关紧要的小事引起了一连串的连锁反应。假设你在做饭，同时又在照看孩子。这时电话铃响了，它预示着一连串意想不到的灾难的来临。就在你接电话时，孩子把桌布从桌子上扯了下来，将家中最好的陶瓷餐具半数摔碎，同时也弄伤了他自己。你急急忙忙挂上电话，赶去照看孩子和餐具。这时，饭又烧糊了。好像这一切还不足以使你急得掉泪，你的丈夫接着回来了，事先没打招呼就带来3个客人吃饭。
就像许多人最近在悉尼郊区帕拉马塔所发现的那样，有时乱子会闹得很大。一天傍晚交通最拥挤时，一辆汽车撞上前面一辆汽车，两个司机争吵起来。紧跟其后的一辆车上的司机碰巧是个初学者，她一惊之下突然把车停了下来。她这一停使得跟在后头的司机也来了个急刹车。司机的妻子正坐在他身边，手里托着块大蛋糕。她往前一冲，蛋糕从挡风玻璃飞了出去掉在马路上。此时，一辆卡车正好从后边开到那辆汽车边上，司机看见一块蛋糕从天而降，紧急刹车。卡车上装着空啤酒瓶，成百只瓶子顺势从卡车后面滑出车外落在马路上。这又引起了一场唇枪舌剑的争吵。与此同时，后面的车辆排成了长龙，警察花了将近一个小时才使车辆又开起来。在这段时间里，卡车司机不得不清扫那几百只破瓶子。只有两只野狗从这一片混乱中得到了好处，它们贪婪地吃掉了剩下的蛋糕。这就是事事不顺心的那么一天！
#pagebreak()
= A happy discovery
== 参考译文
古玩店对许多人来说有一种特殊的魅力。高档一点的古玩店为了防尘，把文物漂亮地陈列在玻璃柜子里，那里往往令人望而却步。而对不太装腔作势的古玩店，无论是谁都不用壮着胆子才敢往里进。人们还常常有希望在发霉、阴暗、杂乱无章、迷宫般的店堂里，从杂乱地摆放在地面上的、一堆堆各式各样的破烂货里找到一件稀世珍品。
无论是谁都不会一下子就发现一件珍品。一个到处找便宜货买的人必须具有耐心，而且最重要的是看到珍品时要有鉴别珍品的能力。要做到这一点，他至少要像古董商一样懂行。他必须像一个专心致志进行探索的科学家那样抱有这样的希望，即终有一天，他的努力会取得丰硕的成果。
我的老朋友弗兰克·哈利戴正是这样一个人。他多次向我详细讲他如何只花50英镑便买到一位名家的杰作。一个星期六的上午，弗兰克去了我家附近的一家古玩店。由于他从未去过那儿，结果他发现了许多有趣的东西。上午很快过去了，弗兰克正准备离去，突然看见地板上放着一只体积很大的货箱。古董商告诉他那只货箱刚到不久，但他嫌麻烦不想把它打开。经弗兰克恳求，古董商才勉强把货箱撬开了。箱内东西令人失望。除了一柄式样别致、雕有花纹的匕首外，货箱内装满了陶器，而且大部分都已破碎。弗兰克轻轻地把陶器拿出箱子，突然发现在箱底有一幅微型画，画面构图与线条使他想起了一幅他所熟悉的意大利画，于是他决定将画买下来。古董商漫不经心看了一眼那幅画，告诉弗兰克那画值50英镑。弗兰克几乎无法掩饰自己兴奋的心情，因为他明白自己发现了一件珍品。那幅不大的画原来是柯勒乔的一幅未被发现的杰作，价值几十万英镑。
#pagebreak()
= Justice was done
== 参考译文
“正义”这个词常常是同法庭连在一起的。当某人被证据确凿地证明无罪或有罪的时候，我们也许会说正义得到了伸张。正义是复杂的法律机器的组成部分。那些寻求正义的人走的是一条崎岖的道路，从来没有把握他们最终将找到正义。法官无论如何聪明与有名，毕竟也是人，也会出差错的。
在个别情况下，正义不再是一种抽象概念。奖惩的实施是不受人的意志支配的。在这种时候，正义像一种有生命的力量行使其职能。当我们说“他罪有应得”这句话的时候，我们部分地承认了某种特定的环境使得正义自动地起了作用。
一天上午，当一个小偷在一家大型珠宝店里被人抓住的时候，店员一定会忍不住说：“他罪有应得。”那是一座老式的、经过改造的房子，店里有许多废置不用的大壁炉和又高又窄的烟囱。快到中午的时候，一个女售货员听见从一堵墙里传出一种闷声闷气的叫声。由于这种喊叫声重复了几次，她跑去报告了经理，经理当即给消防队挂了电话。喊叫声肯定是从烟囱里传出来的，然而，因为烟囱太多，消防队员无法确定到底是哪一个。他们通过叩击烟囱倾听那人的喊叫声而确定了传出声音的那个烟囱。他们凿透了18英寸厚的墙壁，发现有个人卡在了烟囱里。由于烟囱太窄，那人无法动弹。消防队员在墙上挖了个大洞，才终于把他解救出来。那个看起来满脸沮丧、浑身漆黑的家伙从烟囱里一出来，就承认头天夜里他企图到店里行窃，但让烟囱卡住了。他已经在烟囱里被困了将近10个小时。甚至在那人还没被送交给警察之前，正义就已得到了伸张。
#pagebreak()
= A chance in a million
== 参考译文
我们不再像以往那样轻易相信别人了。在19世纪，小说家常在小说结尾处给读者准备一系列巧合——大部分是牵强附会，极不可能的。当时的读者却愉快地接受这样一些事实：一个低贱的女佣实际上是主人公的母亲；主人公一位长期失散的兄弟，大家都以为死了，实际上一直活着，并且正在策划暗算主人公；如此等等。现代读者会觉得这种天真的结局完全无法接受。不过，在现实生活中，有时确实会出现一些巧合。这些巧合除了19世纪小说家外谁也不会相信。
当我是个孩子的时候，我祖父给我讲了一位德国出租汽车司机弗朗兹·巴斯曼如何找到了据信已在20年前死去的兄弟的事。一次，他与妻子徒步旅行。途中，停下来与一个工人交谈，接着他们继续往前走去。巴斯曼夫人说那工人与她丈夫相貌很像，甚至猜测他可能就是她丈夫的兄弟。弗朗兹对此不屑一顾，指出他兄弟已经在战争中阵亡了。尽管巴斯曼夫人熟知这个情况，但她仍然认为自己的想法仍有百万分之一的可能性。几天后，她派了一个男孩去问那人是否叫汉斯·巴斯曼。不出巴斯曼夫人所料，那人的名字真是汉斯·巴斯曼，他确实是弗朗兹失散了多年的兄弟。兄弟俩团聚之时，汉斯说明了他活下来的经过。战争即将结束时，他负伤被送进医院，并与部队失去联系。医院遭到轰炸，汉斯步行回到了西德。与此同时，他所在的部队被击溃，他的所有档案材料全部毁于战火。汉斯重返故里，但他的家已被炸毁，左邻右舍谁也不知原住户的下落。汉斯以为全家人都在空袭中遇难，于是便在距此50英里外的一座村子里定居下来，直至当日。
#pagebreak()
= The Westhaven Express
== 参考译文
我们已经习惯于相信火车总是准点的。经过多年的适应，大多数人对火车时刻表产生了一种不可动摇的信念。轮船船期可能因风暴而推延，飞机航班可能因恶劣天气而取消，唯有火车必然是准点的。只有非同寻常的大雪才可能暂时打乱铁路运行。因此，一旦铁路上真出了问题，人们便不加思索地责备铁路当局。事实上，差错很可能是我们自己，而不是铁路当局的。
我查看了列车时刻表，满意地了解到有一趟去威斯特海温的快车。这是趟直达车，旅途总共才需1小时17分钟。上车后，我不禁注意到许多当地人也上了车。一开始，我并不感到奇怪，我想除我之外，想利用快车之便的也一定大有人在。火车开出几英里即在一个小站威德里停了下来。对此，我不觉得奇怪，因为即便是特别快车也可能被信号拦住。但是，当火车一站接着一站往前蠕动时，我便产生了怀疑。我突然感到这趟快车并没以时速90英里的速度呼啸前进，而是卟哧卟哧地向前爬行，时速仅30英里。1小时17分过去了，走了还不到一半路程。我问一位乘客，这是不是开往威斯特海温的那趟快车，他说从未听说过有这么一趟快车。我决定一到目的地就给铁路部门提意见。两小时后，我气呼呼地同威斯特海温站站长说起此事。他说根本没有这趟车。于是我借了他本人的列车时刻表，我带着一种胜利者的调子告诉他那趟车白纸黑字、明明白白印在时刻表上。他迅速地扫视了一眼，让我再看一遍。一个小小的星形符号把我的目光引到了那页底部的一个说明上。上面写着：“此趟列车暂停运行。”
#pagebreak()
= The first calendar
== 参考译文
未来的历史学家在写我们这一段历史的时候会别具一格。对于逐渐积累起来的庞大材料，他们几乎不知道选取哪些好，而且，也不必完全依赖文字材料。电影、录像、光盘和光盘驱动器只是能为他们提供令人眼花缭乱的大量信息的几种手段。他们能够身临其境般地观看我们做事，倾听我们讲话。但是，历史学家企图重现遥远的过去可是一项艰巨的任务，他们必须根据现有的不充分的线索进行推理。即使看起来微不足道的遗物，也可能揭示人类早期历史中的一些有趣的内容。
历史学家迄今认为日历是随农业的问世而出现的，因为当时人们面临着了解四季的实际需要。但近期科学研究发现，好像这种假设是不正确的。
长期以来，历史学家一直对雕刻在墙壁上、骨头上、古代长毛象的象牙上的点、线和形形色色的符号感到困惑不解。这些痕迹是游牧人留下的，他们生活在从公元前约
35，000年到公元前10，000年的冰川期的末期，以狩猎、捕鱼为生。历史学家通过把世界各地留下的这种痕迹放在一起研究，终于弄懂了这种费解的代码。他们发现代码与昼夜更迭和月亮圆缺有关，事实上是一种最原始的日历。大家早就知道，画在墙上的狩猎图景并不是单纯的艺术表现形式，它们有着一定的含义，因为它们已接近古代人的文字形式。有时，这种图画与墙壁上的刻痕共存，它们之间可能有一定的联系。看来人类早就致力于探索四季变迁了，比人们想象的要早20，000年。
#pagebreak()
= Nothing to worry about
== 参考译文
穿越平原的道路高低不平，开车走了不远，路面愈加崎岖。我们想劝说布鲁斯把车开回到我们出发的那个村庄去。尽管路面布满石头，坑坑洼洼，但布鲁斯却一点儿不慌乱。他瞥了一眼地图，告诉我们前面再走不到20英里就是一个村庄。这并不是说布鲁斯总是低估困难，而是他压根儿没有一点儿危险感。他认为不管路面情况如何，车必须以最高速度前进。
我们在尘土飞扬的道路上颠簸，车子东拐西弯，以躲开那些大圆石。车轮搅起的石块锤击车身，发出不祥的锤击声。我们相信迟早会飞起一个石块把油箱砸开一个窟窿，或者把发动机砸坏。因此，我们不时地掉过头，怀疑车后是否留下了机油和汽油的痕迹。
突然大石块不见了，前面是一片平地，唯一的障碍只有一簇簇灌木丛。这使我们长长地松了口气。但是更糟糕的事情在等着我们，离我们不远处，出现了一个大裂缝。我们再次央求布鲁斯小心，他这才把车停了下来。我们纷纷下车察看那个大裂缝，他却呆在车上。我们告诉他那个大裂缝长50码，宽2英尺，深4英尺。这也没有对他产生任何影响。布鲁斯挂上慢档，把两只前轮分别搁在裂缝的两边，顺着弯弯曲曲的裂缝，以发疯的速度向前开去。我们还未来得及担心后果，车已重新开上了平地。布鲁斯又看了一眼地图，告诉我们那座村庄离我们只有15英里了。下一个障碍是一片约半英里宽的浅水塘。布鲁斯向水塘冲去，但车开到水塘当中，嘎吱一声停住了。仪表盘上一盏黄灯闪着刺眼的光芒，布鲁斯兴致勃勃地宣布发动机里没油了！
#pagebreak()
= Who's who
== 参考译文
谁也弄不清为什么大学生好像比任何人都更喜欢恶作剧。大学生擅长一种特殊的恶作剧——戏弄人。请消防队来扑灭一场根本没有的大火是一种低级骗局，有自尊心的大学生决不会去做。大学生们常常做的是制造一种可笑的局面，使大家笑上一场，当然受害者是笑不出来的。
最近有个学生看见两个工人在大学校门外用风钻干活，马上打电话报告警察，说有两个学生装扮成工人，正在用风钻破坏路面。挂上电话后，他又马上来到工人那儿，告诉他们若有个警察来让他们走开，不要把他当回事；还对工人说，有个学生常装扮成警察无聊地同别人开玩笑。警察与工人都对那个学生事先通报情况表示感谢。
那学生躲在附近一拱形门廊里，在那儿可以看见、听到现场发生的一切。果然，警察来了，有礼貌地请工人离开此地；但其中一个工人粗鲁地回了几句。于是警察威胁要强行使他们离开。工人说，悉听尊便。警察去打电话叫人。一会儿工夫，又来了4个警察，规劝工人离开。由于工人拒绝停下手中的活，警察想夺风钻。两个工人奋力抗争，其中一个发了火，威胁说要去叫警察。警察听后讥讽地说，这大可不必，因为他俩已被逮捕了。其中一个工人装模作样地问道，在被带往警察局之前，是否可以打一个电话。警察同意了，陪他来到一个投币电话前。当他看到那个工人真的是给警察挂电话，才恍然大悟，原来他们都成了一场骗局的受害者。
#pagebreak()
= Illusions of pastoral peace
== 参考译文
宁静的乡村生活从来没有吸引过我。我生在城市，长在城市，总认为乡村是透过火车车窗看到的那个样子，或偶尔周末去游玩一下的景象。我的许多朋友都住在城市，但他们只要一提起乡村，马上就会变得欣喜若狂。尽管他们都交口称赞宁静的乡村生活的种种优点，但其中只有一人真去农村住过，而且不足6个月就回来了。即使他也仍存有幻觉，好像乡村生活就是比城市生活优越。他滔滔不绝地大谈友好的农民，洁净的空气，贴近大自然的环境和悠闲的生活节奏。他坚持认为，凌晨雄鸡第一声啼叫，黎明时分小鸟吱喳欢叫，冉冉升起的朝阳染红树木、牧场，此番美景无与伦比。但这种田园诗般的乡村风光仅仅是一个侧面。我的朋友没有提到在电视机前度过的漫长寂寞的冬夜——电视是唯一的娱乐形式。他也不说商店货物品种单调，以及那些每天不得不从乡下赶到城里工作的不幸的人们。人们为什么情愿每天在路上奔波4个小时去换取值得怀疑的乡间的优点，我是无法理解的。要是他们愿意住在本来属于他们的城市，则可以让他们省去诸多不便与节约大量开支。
如果你愿舍弃乡下生活那一点点乐趣的话，那么你会发现城市可以为你提供生活中最美好的东西。你去看朋友根本不用跋涉好几英里，因为他们都住在附近，你随时可以同他们聊天或在晚上一起娱乐。我在乡村有一些熟人，他们每年进城来看一回或几回戏，并把此看作一种特殊的享受。看戏在他们是件大事，需要精心计划。当戏快演完时，他们又为是否能赶上末班火车回家而犯愁。这种焦虑，城里人是从未体验过的。坐公共汽车几站路，就可看到最新的展览、电影、戏剧。买东西也是一种乐趣。物品品种繁多，从来不必用二等品来凑合。乡里人进城采购欣喜若狂，每次回家时都买足了外来商品，直到拿不动方才罢休，连走路都摇摇晃晃的。城市也并非没有良辰美景。寒冷潮湿的冬夜里，广告灯箱发出的暖光，会给人某种安慰。周末，当成千上万进城上班的人回到了他们的乡间寓所之后，空旷的街市笼罩着一种宁静的气氛，没有什么能比此时的宁静更令人难忘了。城里人对这一切心里很明白，却偏要执拗地装出他们喜欢住在乡村的样子，这对我来说一直是个谜。
#pagebreak()
= Modern cavemen
== 参考译文
洞穴勘查——或洞穴勘探——是一项比较新的体育活动。寻求独居独处的愿望或寻求意外发现机会的欲望吸引着人们来到地下深处。要想对洞穴探险者的动机作出满意的解释是不可能的。对洞穴探险者来说，洞穴有一种特殊的魅力，就像高山对于登山者有特殊的魅力一样。为什么洞穴能引发人的那种探险本能，人们对此只能有一种模模糊糊的理解。
探测非常深的洞穴不是那些在星期日下午漫步的人所能胜任的。这种活动需要有军事行动般的周密布署和预见能力。有时需要花费整整8天时间来搭起绳梯，建立供应基地，然后才能下到一个很深的洞穴里。作出这样的准备是必要的，因为无法预见到洞穴探险者究竟会遇到什么性质的困难。世界上最深的洞穴是格里诺布尔附近的高弗·伯杰洞，深达3，723英尺。这个深邃的洞穴是由一条地下暗泉冲刷岩石中的缝隙并使之慢慢变大而形成的。此洞的洞口在丹芬阿尔卑斯山的高原上，仅6英尺宽，很难被人发现。若不是法国著名洞穴探险家伯杰由于偶然的机会发现了这个洞口的话，这个洞也许永远不会为人所知。自从被发现以后，这个洞成了洞穴探险者的珠穆朗玛峰，人们多次进入洞内探险，但至今尚有不少东西有待勘探。
最近，一队洞穴探险者下到了高弗·伯杰洞里。他们从高原上的窄缝进去，顺着笔直陡峭的洞壁往下爬，来到了一条狭窄的走廊上。他们不得不侧着身子往前走，有时蹚过浅溪，有时游过深潭。突然，他们来到一道瀑布前，那瀑布奔泻而下，注入洞底一处地下湖里。他们跳入湖中，把各种器具装上一只充气橡皮艇，听任水流将他们带往对岸。湖水冰冷刺骨，他们必须穿上一种特制的橡皮服以保护自己。在湖的尽头，他们见到一大堆一大堆由湖水冲刷上岸的碎石。在这儿，他们可以听见一种连续不断的轰鸣声。后来他们发现这是由山洞顶部的一个小孔里喷出的水柱跌落到水潭中时发出的声音。洞穴探险者从岩石缝里挤身过去，来到一个巨大的洞里，其大小相当于一个音乐厅。他们打开强力弧光灯，看见一株株巨大的石笋，有的高达40英尺，像树干似地向上长着，与洞顶悬挂下来的钟乳石相接。周围是一堆堆石灰石，像彩虹一样闪闪发光。洞里有一种可怕的寂静，唯一可以听见的声响是高高的圆顶上不间断地滴水的嘀嗒声。
#pagebreak()
= Fully insured
== 参考译文
保险公司一般说来愿意承保一切东西。承办公共财产或私人财产保险是世界上大部分国家的正常业务。如果你要举办一次露天游园会或盛宴，为避免碰上不好的天气而遭受损失也同样可以保险。不用说，保险公司承担风险越大，你付的保险费也就越高。航运公司为打捞沉船而提出索赔，这是常有的事，但某地当局为打捞一只焙制馅饼的盘子提出索赔，倒是件新鲜事儿。
这个馅饼盘子确实少见，有18英尺长，6英尺宽。某地方当局买下它用来焙制一个巨大的馅饼为一年一度交易会助兴。馅饼委员会确认运输这只盘子的最佳方案是通过运河水运。于是，他们对这只盘子的运输安全投了保。盘子下水后不久，馅饼委员会成员们来到当地一家小酒店庆贺。就在这个时候，许多十几岁的孩子爬上盘子举行他们自己的集会。他们跳起了舞，盘子难以承受。舞会进行过程中，盘子倾覆，沉入了7英尺深的水中。
馅饼委员会给当地汽车修理库老板打电话，他闻讯后开着一辆急修车前来打捞盘子。那些孩子们穿着湿衣服哆嗦，看着3个工人轮番潜入水中以确定盘子的位置。他们没费多大事儿就找到了盘子，可是把盘子捞出却是一个很大的难题。盘子四边十分光滑，要在盘边拴上绳索或链条而同时又不损坏它是很难办到的。不过，他们终于将链条固定在盘子的一端，一台大功率的绞车开动起来。盘子慢慢浮出水面，被轻轻地拽向运河岸边。在令人忐忑不安的瞬间，盘子晃晃悠悠地上了岸，但它突然失去了平衡，又跌回水中。工人们只得再来一次。这次，他们用沉重的金属夹子把盘子夹住，以便往盘子上安装铁链。这次，盘子必须垂直吊出水面，因为盘子的一边紧靠着运河河岸。绞盘机再次启动，一位工人发动了急修车的引擎。几分钟后，盘子被成功地拽出了水面。波浪从盘子两侧急涌而出，在运河里掀起一股大浪。但是当波浪从河对岸折回来时，就有再次把盘子拖进水里的危险。工人们动作迅速，终于赶在那股大浪返回之前把盘子拽到了岸上。
#pagebreak()
= Speed and comfort
== 参考译文
出远门的人常常需要决定是走旱路、水路，还是坐飞机。很少有人能够真正喜欢坐几个小时以上的火车。车厢很快就变得拥挤、闷热，想摆脱开旅途的困扰是很难的。看书只能解决部分问题。车轮与铁轨间单调的嘎喳声很快就会送你进入梦乡。白天是忽睡忽醒，到了夜晚，你真想睡了，却很难入睡。即使你走运弄到一个卧铺，夜间有一半时间你会盯着车顶那盏小蓝灯而睡不着觉；要不然就为查票摸索你的车票。一旦抵达目的地，你总是疲惫不堪。乘汽车作长途旅行则更加不舒服，因为连看书都几乎不可能。在公路上还好，你至少能以相当快的速度安全地向前行。但旅行的大部分时间都花在路上，而且只有很少的服务设施，交通也很拥挤。相比之下，坐船旅行或环游可以得到文明世界的各种享受。你可以在甲板上伸展四肢、做游戏，还能见到各种有趣的人，能享用各种美味佳肴——当然，这一切只有在大海风平浪静的情况下才有可能。如果大海肆虐起来，你就可能晕船，那种难受劲儿是任何一种别的旅行方式都不会带来的。即便风平浪静，坐船旅行也要占用很长时间。没有多少人会为了享受坐船旅行的乐趣而牺牲假期的时间。
飞机以危险而著称，连老资格的旅行者也怕飞机。飞机的另一个缺点是昂贵。但就速度与舒适而言，飞机是无与伦比的。腾云驾雾，在30，000英尺高空以500英里的时速旅行，这种经历令人心旷神怡。你不必想办法去摆脱旅途的困扰，因为飞机会迅速地把你送到目的地。几小时之内，你躺在扶手椅上，享受着旅途的欢乐。真正会享受的人还可以在某些航班上看一场电影和喝香槟。即使没有这些消遣条件，也总是有事可做。飞机上，你可以观察世界上非同寻常的奇妙的美景。你毫不费劲地飞越高山幽谷，你确能饱览大地的风貌。如果这种景色被遮住了，你便可以观赏一下展现在你面前的、一望数英里的、连绵不断的云海，同时阳光灿烂，天空清澈明朗。旅途平稳，丝毫不妨碍你阅读或睡眠。不管你打算如何消磨时间，有件事是可以肯定的，即当你抵达目的地时，你感到精神焕发，毫无倦意，用不着因为漫长旅途的辛苦而花几天时间休息来恢复精神。
#pagebreak()
= The power of the press
== 参考译文
在民主国家里，任何限制新闻自由的企图都理所当然地受到谴责。然而，这种自由很容易被滥用。常人轶事往往比政治事件更能引起公众注意。我们都喜欢看关于别人生活的报道，但是否同样喜欢看关于自己生活的报道，就很难说了。记者按事实至上的论点行事，发表有关别人私生活的细节，有时会给当事人造成极大的痛苦。新闻具有巨大的威力。它们不仅可以给寻常人家的生活带来重大的变化，甚至还能推翻一个政府。
下面这户穷人一夜之间出名发财的故事戏剧性地说明了新闻报道的威力。这户人家住在南达科他州一个人口为23，000的小镇上，镇名为阿拜丁。家里已有5个孩子，全家人常年在贫困中挣扎。第6个孩子即将问世，他们面临着更为严峻的经济问题。如果他们只是添了1个孩子，这件事本来就不会引起任何人的注意。这家人会继续为克服经济上的拮据而奋斗，并默默无闻地活下去。但是他们出人意料地生了个五胞胎，4女1男。这事使他们的生活发生了根本的变化。五胞胎降生第二天，一架飞机飞抵阿拜丁，随机带来60名记者与摄影师。
这一家迅速出了名。电视摄像机和报纸把消息传送到全国。报纸、杂志出高价向他们购买文字、图片的独家报道权。不但素昧平生的人寄来了大量的礼物，而且婴儿食品、婴儿肥皂制造厂商为了替自己产品做广告也寄来了大量的礼物。这家人住的旧农舍将由一座价值50万美元的新住宅所取代。由于记者纷纷要求会见，他们不得不请了律师充当他们家的发言人举行记者招待会。眼下，五胞胎还静静地躺在医院婴儿室的氧气帐里，他们的父母却为这名声付出了代价，他们再也无法过正常的生活。他们成了商业化的受害者，因为他们的名字具有了市场价值。这些孩子立即成了商品，而不是5个新的家庭成员。
#pagebreak()
= Do it yourself
== 参考译文
现在我们自己动手做事的热情很高，结果对于专业工人的依赖越来越少了。由于出版了不计其数的教人自己动手做事的书报杂志，没有人再能说对某事一无所知。新婚夫妇找来合适的工具和材料，喜气洋洋地开始布置新房。特别是男人，常利用空闲时间安装壁炉、布置花园、建造车库、制作家具。有些热衷于自己动手的人甚至自己组装电脑。为了满足自己动手势的需要，商店不仅为初学者提供专门的咨询服务，而且为顾客准备了各种零件，供他们买回家去安装。这些东西为人们潜在的创造力提供了一个绝妙的用武之地。但不幸的是，我们并非人人都是能工巧匠。
妻子常常认为她们的丈夫无比聪明能干。甚至那些连一枚钉子都钉不直的男人都被认为是天生的电工、木匠、水管工和机械师。每当电灯保险丝烧断、家具榫头松动、管道堵塞、吸尘器不动时，有些妻子认为丈夫总有办法。自己动手的例子中最糟糕的是，有时甚至是男人尽管接连失败却还误以为自己什么都行，原因就是要面子。
今年春天，妻子让我请人检查一下我家的割草机。那台割草机去年夏天就环了，尽管我答应修，但一直没抽出时间。我不愿听妻子的建议，说我自己会修。一个星期六的下午，我把割草机拉到了花园里，仔细检查了一番。在我看来，只需稍加调整即可。这儿紧紧螺丝，那儿固定一下，再加几滴油，就会像新的一样了。事实上，修理工作远不是那么简单。修完后割草机还是纹丝不动。于是，我决定把它拆开。一会儿工夫，割草机便被拆成一个个金属零件，乱七八糟地堆在花园里。但我却非常高兴，因为我找到了毛病所在。驱动轮子的链条断了一节。我买来一根新链条后，面临的就是如何把这些令人眼花缭乱的拼板重新组装起来。等我装完后，那台割草机仍然一动不动，对此我倒并不感到吃惊。原因很简单，因为还剩下几个形状奇特的零件似乎哪里也装不上去。我无可奈何，只好罢休。几个星期过去了，草长了起来。妻子喋喋不休地让我想点办法。我告诉她，要么买一台新割草机，要么让草长下去。不用说，我家现在已被丛林包围。深草丛中的某个地方有一台正在生锈的割草机，那就是我曾答应某日要修理的割草机。
#pagebreak()
= Too high a price?
== 参考译文
污染就是我们为这个人口过密、过度工业化的星球所付出的代价。当我们开始考虑垃圾问题时，我们只有4种对付垃圾的方法：倾倒、焚烧、把垃圾变成再生材料或试图少产生一些垃圾。我们一直在试这4种方式，但是，我们在世界范围内仅产生的垃圾的量就有把我们覆盖的危险。
然而，垃圾只是我们这个星球的污染问题的一个方面。日益增长的对廉价食物的需求导致了另一种形式的污染。工业化的农作方式生产出了廉价的肉类制品——牛肉、猪肉和鸡肉。使用杀虫剂和化肥生产出了廉价的谷物和蔬菜。为了廉价食物我们付出的代价已经太高了：牛肉中的疯牛病，鸡肉和鸡蛋中的沙门氏菌，奶制品中的利斯特杆菌。如果你想放弃肉类而变成一位素食者，那么你可以两者择一：或是选用价格昂贵、有机培植的蔬菜，或是当你认为在享用新鲜色拉和新鲜蔬菜或饮用一杯无害的水的时候，实际上每次都不断吃进杀虫剂。
但是，还有一种更加隐蔽有害的污染，它专门影响城镇地区，侵袭我们的日常生活，那就是噪音。防盗警报器在白天和黑夜的任何时候都会响起来，它的作用只是骚扰过路行人，而实际上却帮助窃贼入室行窃。在街上，汽车的防盗警报不断对我们吼叫，这是人们极度烦躁的一个原因。最近一个有关噪音的作用的调查（令人吃惊地）指出，夜间连续不断的狗叫声，在一个从1级至7级的刻度表上应列为最严重的噪音污染。这个调查揭示了我们所不喜欢的大量的噪音的来源：夏天呜呜作响的割草机，公寓楼里深夜聚会的喧哗声，大声吵闹的邻居，各式各样的车辆，特别是穿越寂静的村庄的集装箱卡车，从头顶飞过的飞机和直升机，被带到公共场所、音量开到最大的大功率收音机。新技术也为噪音作出了它的贡献。许多人都反对移动式电话，特别是在如饭店、公共交通车等公共场所使用移动电话。用移动电话大声交谈干扰我们的思路，破坏我们和朋友在一起轻声聊天所得到的乐趣。这个有关噪声污染的调查还揭示了一种出人意外而同时可能会引人发笑的老式噪音源。它竟然是鼾声。人类是这方面的罪魁祸首。调查指出，20％的35岁左右的男人打鼾；而到60岁这个年龄段，这个数字上升到令人惊愕的60％。与这些数字相比，只有5％的女性经常打鼾，而其余的则经常被与她们同睡、像吹号似地打着呼噜的男人吵醒或弄得睡不着。不管噪声来自何方，有一点是肯定的：看来寂静已变成一种珍贵的回忆。
#pagebreak()
= The silent village
== 参考译文
在这个旅游频繁的世界上，仍有成千上万个游人足迹未至的地方。人们总是以为偏僻地方的村民们热情好客。但是，那些不但与外国旅游者隔绝，而且与本国同胞隔绝的人们有可能对游客抱有敌意。到真正偏僻的村庄去旅游并不是一件愉快的事情，我与妻子在一次周游巴尔干半岛时对此深有体会。
我们在一座小镇上逗留了几天，参观了附近的许多古老的教堂。这些教堂吸引了大量游客，不仅是因为建筑风格奇特，而且还存有大量保存完好的壁画。我们离开小镇的前一天，镇上来了几辆满载游客的公共汽车。人多得使我们难以忍受，于是我们决定利用最后一天去乡间一游。我们走上了一条出镇的小路，穿过几块农田，来到一片茂密的树林。我们原以为小路会到此突然终止，没想到它在树林中继续向前延伸。我们在树林中跋涉了两个多小时，到了一条深溪边。我们可以看到小路在深溪对岸继续向前伸展，但却不知如何越过这道深溪。突然，妻子发现岸边泊着一条小船，船上有一船夫在呼呼大睡。我们轻轻地把他唤醒，请他把我们摆渡过溪。一开始，他很不愿意，但经劝说，终于同意了。
顺着小路，我们来到一个座落在陡峭山坡上的小村庄。这儿有一条未经修筑的弯弯曲曲的道路，路两边排列着一些矮小的农舍。农舍全用灰色的土坯建成，因此，即使在晴朗的蓝天底下，村庄看上去也会令人感到难以亲近。村里似乎无人居住，唯一的生命迹象是附近田里一只面目可憎的黑山羊，用一截短绳拴在一棵树上。我们在田边一堵东倒西歪的篱笆墙上坐了下来，打开几听沙丁鱼罐头，吃了一顿野外午餐。突然，我注意到妻子十分惊恐。我抬头一看，发现我们被一群衣衫褴褛的小孩团团围住了，他们在默不作声地看着我们吃饭。我们给他们东西吃，客客气气地同他们交谈，但他们却一动也不动。我认为这不过是他们在陌生人面前表现出的害羞。后来，我们在村里的主要街道上行走的时候，一队默不作声的孩子跟在我们后头。刚才还似乎空荡荡的村庄一下子活跃了起来，窗口露出了一张张面孔，只穿着衬衣的男人们站在屋子外面凶狠地盯着我们，披黑纱巾的老妇人站在门口偷偷地瞅着我们。最令人害怕的是到处没有一点声音。毫无疑问，我们的来访是不受欢迎的。我们不需要进一步的警告了，便掉转身子，沿着那条主要的街道加快步伐，快速地朝深溪边走去，希望船夫还在那儿等着我们。
#pagebreak()
= The ideal servant
== 参考译文
我的姑妈哈丽特好多年前就去世了，这倒是件好事。如果她活到今天，她将不能就她热衷的话题“佣人”发表意见了。哈丽特生活在一个悠闲的年代，家务事都由雇来的佣人代劳。她在乡下有一幢巨大杂乱的房子，叫作“山墙庄园”。她对这幢房子在感情上难舍难分。房子实在太大了，但在丈夫去世多年后，她仍然执意长年住在那儿。哈丽特姑妈年轻时，喜欢大摆宴席，招待宾客。我小时候常去“山墙庄园”作客。不管去多少宾客，大房子里总是收抬得干干净净。镶木地板洁如明镜，擦得发亮的银器陈列在明亮的玻璃柜里，连姑夫的大量藏书也保存得很好，奇迹般地一尘不染。哈丽特姑妈统率着一支看不见的佣人大军，他们不停地擦拭、清扫、刷洗。她称这些佣人叫“流动人口”，因为他们来去匆匆，所以我甚至都没有机会知道他们的姓名。姑妈待佣人在当时算是开明的，从来不让佣人每天工作超过8小时，但他们很难使她称心如意。她一方面总批评人的本性朝三暮四，另一方面她又持之以恒地寻找一个理想的佣人。即使在贝西大大地伤了她的心之后，她还在找，一直到她死去。
贝西在哈丽特家干了3年。在此期间，她赢得了姑母的赏识，甚至当上了大管家。哈丽特不知该用什么言辞来赞扬贝西的勤奋与高效。贝西除了有各种本领以外，还是一个烹饪大师。她担任“理想仆人”角色3年之后，哈丽特终于发现了她有“小小的弱点”。一次，姑妈有一个星期没在“山墙庄园”住。一天下午，她出其不意地回来了，带来一大批客人，吩咐贝西准备晚饭。结果，不仅饭菜远不如平时做得好，而且贝西走起路来似乎东倒西歪。她撞到了家具上，嘴里还不断咕咕哝哝议论客人。当她端着最后一道菜——一大盘布丁——走进屋来时，在地毯上绊了一跤。布丁飞到半空，从姑母身边擦过，然后狠狠地砸在餐桌上。这件事引起了客人们的欢笑，但哈丽特却着实吓了一跳。她不得不认定贝西是喝醉了。客人们自然从贝西为他们开门那一刻起就看出来了，在好长一段时间里，即最后这个乱子发生前，他们努力克制才没笑出声来。贝西当即被解雇了。贝西走后，哈丽特姑妈发现在贝西以前用过的衣柜里整整齐齐地放着一堆堆形状各异、大小不一的酒瓶子。这些酒瓶神不知鬼不觉地从酒窖来到了这里。
#pagebreak()
= New Year resolutions
== 参考译文
新年是下决心的时候，至少在大多数人的心里会编排出一份“应做什么”和“不应做什么”的令人生畏的单子。相同的决心以单调的规律年复一年地出现。我们决心每天早晨起得早些；吃得少些；多花点时间与孩子们一起做游戏；做大量的家务；对不喜欢的人友善一些；小心驾车；每天都要带着狗散步；等等。以往的经验告诉我们有些事是办不到的。如果我们烟瘾大，戒不掉，那是因为屡戒屡败，失去了信心。我们大多数人想自我完善却遭到失败，这是因为我们的规划过于宏大，而又根本没有时间去实施。我们还犯有一个根本性的错误，即把我们的决心向大家宣布。这样一旦滑回到那些环的老习惯上去，我们在别人眼里会显得更加难堪。我深知这些问题，于是，今年我对自己的计划要严加保密，只给自己定下两项适中的任务：每天早上锻炼身体，每天晚上多看点书。新年除夕举办的一次通宵晚会，使我理直气壮地在新年头一天免去了这两项任务。不过，新年第二天，我全力以赴地照着去做了。
早锻炼一共只有11分钟，我打算在别人起床之前进行。这就要求我比平日早11分钟把自己从床上拽起来，这种自我约束是很艰苦的。不过开头两天我还是成功地蹑手蹑脚地来到楼下起居室，被谁也没发现。我在地毯上跳过来蹦过去，扭曲身子，摆出各种姿势，弄得浑身不舒服，然后坐到桌边吃早饭，一副筋疲力尽的样子。正是这副模样泄露了我的秘密。第二天早晨全家人结队来到起居室看我表演。这真叫人不好意思，但我心平气和地顶住了全家人的嘲笑和奚落。不久，大家对我习以为常了，而这时我的热情却减退了。我花在锻炼上的时间逐渐减少，慢慢地从11分钟减到了零。到了1月10日，我恢复了原来的作息时间。我辩解说，早晨少耗费精力锻炼，晚上下班回家看书时头脑更清醒些。有几天晚上，我极力摆脱了电视的诱惑，坐在自己房间里，两眼盯在书上。可是，有一天夜里，我感到又冷又孤单，便来到楼下坐在电视机前假装看书。这下我可完了，因为不一会儿，我就恢复了以前的坏习惯，在屏幕前打起瞌睡来。但我还没有放弃多看些书的决心。事实上，我刚买来一本叫《一分钟读一千字的诀窍》的书。也许这本书能解决我的问题，但我一直还没时间去看这本书！
#pagebreak()
= Predicting the future
== 参考译文
众所周知，预测未来是非常困难的。举个例子吧，在20世纪70年代中叶又有谁能想象得到在20世纪末的时候，家庭用的计算机会像电视机一样普遍？在70年代，计算机已经相当普及了，但只用在大的公司、政府部门和大的组织之中，它们被称为主机。计算机主机确实很大，常常占据了装有空调的多间房间，雇用专职的技师，而且得用专门编写的软件才能运行。虽然这种大计算机仍然存在，但是它们的许多功能已被体积小但功能齐全的个人电脑——即我们常说的PC机——所代替了。
1975年，美国推出了一台被称为“牛郎星”的原始机型。严格地说起来，它可以被称为第一台“家用电脑”，而且它也指出了今后的方向。70年代末，在牛郎星之后又出现了一种被称为“苹果”的机型。80年代初，计算机行业的王牌公司美国国际商用机器公司（IBM）生产出了世界上第一台个人电脑。这种电脑采用了一种被称为磁盘操作系统（DOS）的工作程序，而这种程序是由当时规模不大的微软公司生产的。IBM的个人电脑被大规模地模仿。从那些简陋的初级阶段，我们看到了现在都已普及的、使用简便的家用电脑和多媒体的微机的发展。
想一想这些发展的时间多么短，就更觉得英国人莱昂·巴格瑞特有着非凡的能力。他在60年代就能预言我们今天知道的计算机的一些用途。巴格瑞特根本不接受计算机可以学会自己去“思考”和计算机可以“统治世界”这种想法，而这种想法是当时的人们都愿意相信的。巴格瑞特预示有一天计算机可以小到拿在手上，计算机可以提供有关交通阻塞的信息，并建议可供选择的其他路线，计算机在医院里可以帮助医生诊断病情，计算机可以使办公室人员和会计免除那些枯燥、重复的劳动。计算机的所有这些功能现在都变得很平常。当然了，莱昂·巴格瑞特根本没有可能预测到国际交互网——就是把计算机连结到电话线路上，以便和世界上任何一个地方的人立即进行联系的一个世界范围的通讯系统——的发展。他也无法预测到我们可以利用国际交互网获取有关任何已知专题的信息，以便在家里的屏幕上阅读，如果愿意的话甚至可以将其打印出来。计算机已经变得体积越来越小、功能越来越多、价格越来越低，这就是莱昂·巴格瑞特的预测非凡的地方。如果他或是像他的什么人今天还活着的话，他大概可以告诉我们下一个50年后会发生什么事情。
#pagebreak()
= Mud is mud
== 参考译文
我的堂兄哈里在他的书房里一直摆着一只形状古怪的大瓶子。尽管那只瓶子呈淡绿色，但细心的客人很快就会发现瓶里装的是一种看上去黏稠、颜色发灰的东西。要是你问哈里瓶里装着什么，他会告诉你是香水泥。如果你表示怀疑或惊奇，他会立即请你闻一闻，然后取出一些抹在你的皮肤上。这一简单的试验会消除你可能存有的一切疑虑。瓶里装的的确是香水泥。哈里是如何得到这种稀奇古怪的东西的，这里有个有趣的故事，而且他挺爱把它讲给别人听。此外，得到这瓶香水泥还治好了他多年的一个坏习惯。
哈里曾认为走进一家名贵化妆品商店，荒唐地提出要买一种根本不存在的商品是件很开心的事儿。他会当场编造出一些稀奇古怪的货名。他走进商店后，会提出要一种名叫“香影”的新型香水或者什么“不溶浴皂”。要是女售货员告诉他从未听说过这些东西，他会装出十分遗憾和不安的样子。他爱听售货员说他想象出来的那种东西暂时脱销，于是他就煞有介事地许诺改天再来光顾。当然，他再也不会来了。我实在想象不出哈里在这些表演中是怎样装出一本正经的样子的。
毋须暗示哈里就会向你讲起他买下那瓶珍贵香水泥的经过。一天，他去伦敦一家高级商店要买一种叫“密诺莱特”的东西，店员露出诧异的神色。哈里又慢慢地、一字一顿地说了一遍这个词，那个女售货员还是迷惑不解地摇了摇头。哈里便进一步解释“密诺莱特”是一种质地坚硬、状似琥珀的东西，可以用来除去雀斑。他的解释显然对女售货员有些启示。她一个货架接着一个货架地寻找，拿出各种各样稀奇古怪的化妆品，但没有一样能够符合哈里的要求。哈里装出不高兴的样子时，女售货员答应为他定货。哈里为他的骗术而感到洋洋得意，又提出要买香水泥。他原想女售货员会惊奇地望着他，不知所措，没料到这回该轮到他自己吃惊了。因为那女售货员听完哈里的话后，马上眼睛一亮，拿出几瓶东西放在柜台上让哈里挑选。哈里只好认输。他挑出一个看上去最小的瓶子，谨慎地问了价。他庆幸自己只破费了20英镑便得以脱身。他把那只宝贵的瓶子放在腋下夹着，溜之大吉。从那以后，他认识到自己发明的小小恶作剧是要付出很大代价的。在他书房的书柜里摆着的那瓶形状古怪的香水泥就是他第一次也是最后一次购买的稀有化妆品。
#pagebreak()
= In the public interest
== 参考译文
斯堪的纳维亚半岛各国实行的开明的社会政策，受到全世界的推崇。在瑞典，已逐渐形成了一种完善的制度以保护每个公民不受专横的和不称职的政府官员的欺压。由于这种制度行之有效，已被其他国家采纳。
是瑞典人首先认识到政府工作人员如文职人员、警官、卫生稽查员、税务人员等等也会犯错误或者自以为在为公众服务而把事情做过了头。早在1809年，瑞典议会就建立了一个保护公民利益的制度。议会内有一个代表各政党利益的委员会，由它委派一位称职的人选专门调查个人对国家的意见。此人官衔为“司法特派员”，但瑞典人一般都管他叫“J．O．”，即“司法特派员”。司法特派员不受任何政治压力的制约。他听取社会各阶层的各种大小意见，并进行调查。由于意见均需用书面形式提出，司法特派员每年平均收到1，200封信。他有8位律帅做他的助手协助工作，每封信都详细批阅。司法特派员的工作没有什么秘密可言，他的信件是公开的，供公众监督。如果公民的意见正确，司法特派员便为他伸张正义。司法特派员采取的行动因意见的性质不同而有所不同。他可以善意地批评某位官员，也可以甚至向议会提议修改某项法律。下述事件是司法特派员工作的一个典型例子。
一个住在瑞典乡村的外国人写信给司法特派员，抱怨说他受到警察虐待，原因就是因为他是个外国人。司法特派员立即写信给当地的警察局长，请他寄送与此事有关的材料。材料中没有任何文字记载证明外国人所说的情况符合事实，警察局长矢口否认这一指控。司法特派员难以处理。但是，当他又收到住在同一村庄的另一个外国人写的一封内容类似的投诉信时，他立即派出一位律师前去调查。律师证实有个警察确实多次粗鲁地对待外国人。警察歧视外国人的事在官方档案中不可能加以记载，司法特派员只有派他的代表去核对事实才能了解真相。当事的警察受到严厉斥责，并被告知，如果再有人投诉他，他将受到起诉。司法特派员及时采取的行动，迅速制止了这一起不愉快的事件，不然这件事可能因未得到人们注意而不了了之。
= Instinct or cleverness?
== 参考译文
我们自幼就在对昆虫的惧怕中长大。我们把昆虫当作害多益少的无用东西。人类不断地同昆虫斗争，因为昆虫弄脏我们的食物，传播疾病，吞噬庄稼。它们无缘无故地又叮又咬；夏天的晚上，它们未经邀请便飞到我们房间里，或者对着露出亮光的窗户乱扑乱撞。我们在日常生活中，不但憎恶如蜘蛛、黄蜂之类令人讨厌的昆虫，而且憎恶并无大害的飞蛾等。阅读有关昆虫的书能增加我们对它们的了解，却不能消除我们的恐惧心理。即使知道勤奋的蚂蚁生活在具有高度组织性的社会里，当看到大群蚂蚁在我们精心准备的午间野餐上爬行时，我们也无法抑制对它们的反感。不管我们多么爱吃蜂蜜，或读过多少关于蜜蜂具有神秘的识别方向的灵感的书，我们仍然十分害怕被蜂蜇。我们的恐惧大部分是没有道理的，但却无法消除。同时，不知为什么昆虫又是迷人的。我们喜欢看有关昆虫的书，尤其是当我们了解到螳螂等过着一种令人生畏的生活时，就更加爱读有关昆虫的书了。我们喜欢入迷地看它们做事，它们不知道（但愿如此）我们就在它们身边。当看到蜘蛛扑向一只苍蝇时，一队蚂蚁抬着一只巨大的死甲虫凯旋而归时，谁能不感到敬畏呢？
去年夏天，我花了好几天时间站在花园里观察成千只蚂蚁爬上我那棵心爱的桃树的树干。那棵树是靠着房子有遮挡的一面暖墙生长的。我为这棵树感到特别自豪，不仅因为它度过了几个寒冬终于活了下来，而且还因为它有时结出些甘甜的桃子来。到了夏天，我发现树叶开始枯萎，结果在树叶背面找到成串的叫作蚜虫的小虫子。蚜虫遭到了一窝蚂蚁的攻击，蚂蚁从它们身上可以获得一种蜜。我当即动手作了一项试验，这项试验尽管没有使我摆脱这些蚂蚁，却使我着迷了24小时。我用一条胶带把桃树底部包上，不让蚂蚁接近蚜虫。胶带极粘，蚂蚁不敢从上面爬过。在很长一段时间里，我看见蚂蚁围着大树底部来回转悠，不知所措。半夜，我还拿着电筒来到花园里，满意地（同时惊奇地）发现那些蚂蚁还在围着胶带团团转，无能为力。第二天早上，我起床后希望看到蚂蚁已因无望而放弃了尝试，结果却发现它们又找到一条新的路径。它们正在顺着房子的外墙往上爬，然后爬上树叶。我懊丧地感到败在了足智多谋的蚂蚁手下。蚂蚁已很快找到了相应的对策，来对付我那套完全不科学的办法！
#pagebreak()
= From the earth:Greetings
== 参考译文
天文学方面的最新发展使得我们能够在银河系和其他星系发现行星。这是一个重要的成就，因为相对来说，行星很小，而且也不发光。寻找行星证明相当困难，但是要在行星上发现生命会变得无比艰难。第一个需要解答的问题是一颗行星是否有能够维持生命的条件。举例来说，在我们的太阳系里，对于生命来说，金星的温度太高，而火星的温度则太低。只有地球提供了理想的条件，而即使在这里，植物和动物的进化也用了40亿年的时间。
一颗行星是否能够维持生命取决于它的恒星——即它的“太阳”——的大小和亮度。设想一下，一颗恒星比我们的太阳还要大，还要亮，还要热20倍，那么一颗行星为了维持生命就要离它的恒星非常远。反之，如果恒星很小，维持生命的行星就要在离恒星很近的轨道上运行，而且要有极好的条件才能使生命得以发展。但是，我们如何才能找到这样一颗行星呢？现在，没有一台现存的望远镜可以发现生命的存在。而开发这样一台望远镜将会是21世纪天文学的一个重要的研究课题。
使用放置在地球上的望远镜是无法观察到其他行星上的生命的。地球周围温暖的大气层和望远镜散出的热量使得我们根本不可能找到比行星更小的物体。即使是一台放置在围绕地球的轨道上的望远镜——如非常成功的哈勃望远镜——也因为太阳系中的尘埃微粒而无法胜任。望远镜要放置在木星那样遥远的行星上才有可能在外层空间搜寻生命，因为我们越是接近太阳系的边缘，尘埃就越稀薄。一旦我们找到这样一颗行星，我们就要想办法将它的恒星射过来的光线遮暗，这样我们就能彻底“看见”这颗行星，并分析它的大气层。首先我们要寻找植物，而不是那种“小绿人”。在行星上最容易生存下来的是细菌。正是细菌生产出我们在地球上呼吸的氧气。在地球发展的大部分进程中，细菌是地球上唯一的生命形式。作为地球上的居民，我们总存有这样的希望：小绿人来拜访我们，而我们可以和他们交流。但是，这种希望总是只在科幻小说中存在。如果我们能够在另一颗行星上找到诸如细菌那种低等生命，那么这个发现将彻底改变我们对我们自已的看法。正如美国国家航空和宇宙航空局的丹尼尔·戈尔丁指出的：“在其他地方发现生命会改变一切。任何人类的努力和想法都会发生变化。”
#pagebreak()
= Our neighbour,the river
== 参考译文
形成我们农场东部边界的一条河流一直在我们生活中发挥着重要作用。要是没有这条河，我们就无法生存下去。泉水只能满足家庭生活用水，因此我们必须从河里抽水以用于农业生产。我们向那条河倾诉我们的秘密。我们本能地懂得，就像养蜂人和他的蜜蜂那样，要是我们不把生活中的重大事件告诉那条河，就可能大祸临头。
夏天，我们为这条河举办特殊的生日宴会。有时，我们溯流而上来到我们喜爱的回水河汊举办；有时在船坞举办。那船坞是农场的一位前辈在一块草地上盖的；草地紧挨着一个专供游泳、跳水的深水池。天气炎热时，我们便选择在半夜举办生日集会，这种集会是最令人激动的。我们在河边迎接一年四季。春天在河边为最年轻的姑娘戴上花冠，夏天在河边欢庆“仲夏前夜”，秋天在河边为丰收而感恩，冬天往河中抛撒一个冬青花环。
久雨之后，河水会泛滥成灾，但是在我们这里，气候很少发生异常；河水极少泛滥。值得庆幸的是，只有低洼地受到洪水影响，而低洼地在我们农场比例很小。其他农场地势欠佳，洪水有时会给农场主带来灾难。
有一年冬天，天气不好，我们眼看着河水浸没了地势较低的草场。所有的牲口已提前转移到畜圈里，没有造成什么损失。不过，我们很为我们的近邻担心。他们的农场地势低洼，而且他们又是新来乍到。由于洪水造成了电话中断，我们无法了解他们的情况。从顶楼窗口看去，我们农场与他们农场接壤处的那段河流一览无余。在最紧急的时刻，我们轮流监视那段河流的险情。灾难的第一个迹象是一只死羊顺流而下，接着是一匹活马勇敢地与水搏击。但我们担心，洪水的力量将使它上岸之前就筋疲力尽了。突然，出现了一只筏子，看起来很像诺亚方舟，上面载着他们全家老小，还有几只母鸡、几只狗、一只猫与一只鸟笼，那里头有一只小鸟。我们意识到他们一定是被不断上涨的洪水吓坏了。因为他们的房子地基牢固，即使洪水几乎灭顶也不会倒塌。我家的男人们手拿船篙蹚过被水淹没的草场，希望能够钩住筏子一角，将它拽出激流，拖回岸边。他们终于成功了。至今我们仍认为这是个奇迹。
#pagebreak()
= Back in the old country
== 参考译文
我停下车，让汽车发动机冷却一下，同时查看一下地图。我本想离目的地已经不远，但周围一切对我仍很陌生。我5岁那年，父亲就带我出了国，那是18年前的事了。当时我母亲在一次事故中惨死，父亲未能很快从悲痛与孤独中恢复过来。他身边的一切都有母亲的影子不断地勾起他的伤感。于是他决定移居他国。在这个新的国家里，父亲专心致志地为我们俩开创一种新的生活，慢慢地不伤心了。父亲没有再娶，因此，我在没有母亲的环境里长大成人。但我却什么都不缺，他既当父亲又当母亲。他总想将来回国看看，但却不愿长期住下去，因为他与我一样已经把根深深地扎在了异国的土地上。但是，他想看一看家乡父老乡亲，为我的母亲扫墓。就在他计划回国的前几个月，他突然身患绝症。他知道自己已奄奄一息，于是他要我答应一定单独回故乡一趟。
我下飞机后租了一辆车，并买了一本详尽的地图册。在乡间行车途中，我觉得它非常有用，但快到家了，我倒觉得它没什么用了。这倒并非是我背熟了地图，而是父亲曾详细给我讲了，在过了离故乡最近的那个小镇后，在每一个路标处可见到些什么。因此，我相信这段路对我来说会是很熟悉的。唉，实际我错了，我现在迷路了。
我看了看地图，又查了一下里程表。从小镇出来，我走了10英里。照父亲的说法，我面前应是一个山谷，有农场与村舍，还可远远望见老家村子里的教堂的尖顶。可现在我却看不到山谷，看不见农舍，也看不见教堂尖顶，看见的只是一片湖泊。我想一定是在什么地方拐错了弯儿。于是我驾车返回小镇，重新按路线行驶。结果又来到刚才那个拐弯处。奇怪的是那个湖没有在地图上标出。我感到自己就像平时作梦那样迷迷糊糊地闯进了恶梦境地。就像在恶梦里一样，见不到一个人可以帮助我。不过，我是幸运的，正当我走投无路之时，从天边出现一个骑马的人向我骑来。等他走近了，我问他去老家的路。他说那村子已经没有了。我想他一定误解了我的意思，于是又说了一遍村庄的名字。这次他用手指了一下那个湖。村庄已不复存在，因为已经为水所淹，山谷也被水淹没了。这不是一个天然湖泊，是一座人工修建的水库。
#pagebreak()
= A spot of bother
== 参考译文
老妇人回到了她居住的公寓楼，心里很高兴。去商店买东西把她搞得筋疲力尽；在回家的路上，她每走一步，就感到手里的篮子又重了一点。她乘上电梯后，只想着午餐和好好休息一下。但她到了自己的楼层走出电梯后，就把这两件事忘了个干净，因为她突然发现她家的大门开着。她心想明天上午一定要好好训斥那个干家务的帮手，她竟如此疏忽大意。但突然她记起来了，帮手是在她出去买东西之前走的，她还记得曾用了两把钥匙把大门锁上了。她慢慢地走进前厅，立即发现所有的房门都敞开着，而她记得在出门买东西前，她按老规矩是把房门一一锁上的。她往起居室里看去，写字台边一片狼藉。事情很清楚，在她外出时，窃贼曾闯进家门。她第一个条件反射是到各个房间里搜寻一下窃贼，但转念一想，像她这个年纪，最好是找个人一起去。于是她到地下室去找看门的人。这时，她两腿累得开始发抖，于是坐了下来，喝了一杯浓茶。与此同时，看门的人给警察挂了电话。此刻老妇人也镇定了下来，准备在看门人的协助下搜寻可能仍躲藏在她房里的窃贼。
他俩搜遍了每一个房间，小心翼翼地不接触任何东西，因为他们怕妨碍警察寻找指纹。房间里的紊乱状况是无法想象的。老妇人在这套公寓里住了30年，她又是个名副其实的收藏家。看来她的每一件东西都被翻了出来，并且被里里外外看了个遍。这样一来，她倒是容易将那些几年前就该扔掉的东西找出来了。过了一会儿，一位巡官带着一名警察来了。她向他们讲述了发现公寓遭劫的经过。巡官开始搜寻指纹，警察经检查发现大门锁头并无撬过的迹象。由此可以证明，窃贼或者是用了万能钥匙，或者是翻越阳台进来的。巡官没有发现指纹，却发现了一个装有珠宝的、肮脏的红包袱。老妇人说那不是她的。很明显，闯进这套公寓的窃贼那天并不是首次作案，而且他一定是受了惊吓。巡官请老妇人在次日之前设法查清丢了些什么，并劝她几夜之内不要独自一人在公寓过夜。老妇人觉得巡官大惊小怪，但既然看门人也同意他的意见，她只得打电话向女儿求援，说她碰到了一点儿小麻烦。
#pagebreak()
= Collecting
== 参考译文
人们喜欢收藏东西，有时并没有意识到自己在这样做。确实，一旦无意之中从自己的收藏品中找到某件有用的东西时，可以给人一种惊喜的感觉。那些从来不必搬家的人们成了一种无所不容的收藏家。他们专门收藏那些只能被称作杂货的东西。他们在抽屉里、碗柜中、阁楼上堆放着一些不用的东西，一放就是好几年，相信总有一天需要的正好是那些东西。人们年老之后也喜欢收藏东西，不过是出于两个不同的原因：一是体力、精力均告不佳，这二者是清除无用的东西必不可少的因素；另一个原因是感情因素。东西搁得时间久了，便会充满着与过去岁月的联系，比方说与死去的亲戚有关。因此这些东西慢慢获得了一种超出它本身的价值。
居家度日，有目的地收藏某些东西是为了防止浪费。这些东西中我想举出线绳和包装纸为例。节俭的人们打开包裹后便把这两样必备的东西收藏起来，省得日后去买。收集小玩艺儿很容易着迷。我认识一个人，她总喜欢从报纸上剪下流行服装的图样，等以后有钱时去买服装。由于她并不富裕，她买得起这些服装的可能性十分渺茫。但她又缺乏足够坚强的意志把这一收集活动停下来。这种习惯无害，只是把写字台里堆得满满当当，以致每次打开抽屉总能带出许多纸片四处飞扬。
作为一种严肃的业余爱好的收藏活动完全是另外一回事，它具有许多益处。它可以使人在闲暇中得到休息，因为欣赏自己收藏的珍品总会充满了乐趣。人们不必走到户外去寻求娱乐，因为收藏品都是存放在家中。不管收藏品是什么，邮票、唱片、头版书籍、瓷器、玻璃杯、老式家具、绘画、模型汽车、鸟类标本，还是玩具动物，从为新增添的收藏品寻找摆放位置到核对参考书中的事实，总归有事可做。这种爱好不仅能使人从选择的专题中受到教育，而且也能从与之有关的一般事物中获得长进。除此之外，还有其他的益处。收藏者要会见情趣相投的收藏者，以获取教益、交流经验、交换收藏品、炫耀自己的最新收藏。朋友的圈子就这样不断扩太。用不了多久，有这种爱好的人便开始旅行，也许是去另一个城市参加会议，也可能是出国寻找一件珍品，因为收藏家是不分国籍的。一人积了多年经验会成为自己这种爱好的权威，很可能应邀在小型集会上作非正式的讲话。如果讲得好，可能向更多的人发表演说。这样，你自信心不断增强，先是因为掌握了一门学问，接下来是因为能够就此发表见解。收藏活动通过富有建设性地利用业余时间使人感到心满意足，不再有无聊之日。
#pagebreak()
= Too early and too late
== 参考译文
准时是文明社会中进行一切社交活动时必须养成的习惯。不准时将一事无成，事事都会陷入混乱不堪的境地。只有在人口稀少的农村，才可以忽视准时的习惯。在日常生活中人们可以容忍一定程度的不准时。一个专心钻研某个复杂问题的知识分子，为了搞好手头的研究，要把一切都协调一致、组织周密。因此，他要是赴宴迟到了会得到谅解。但有些人不准时常常是因为掐钟点所致，他们常常会受到责备。精力充沛、头脑敏捷的人极不愿意浪费时间，因此他们常想做完一件事后再去赴约。要是路上没有发生如爆胎、改道、突然起雾等意外事故，他们是决不会迟到的。他们与那些从不迟到的人相比，常常是更勤奋有用的公民。早到的人同迟到的人一样令人讨厌。客人提前半小时到达是最令人讨厌的。我家有几个朋友就有这种令人恼火的习惯。唯一的办法就是请他们比别的客人晚来半小时。这样，他们可以恰好在我们要求的时间到达。
如果赶火车，早到总比晚到好，哪怕早到一会儿也好。虽然早到可能意味着浪费一点时间，但这比误了火车、等上一个多小时坐下一班车浪费的时间要少，而且可以避免那种正好在火车驶出站时赶到车站，因上不去车而感到的沮丧。更难堪的情况是虽然及时赶到站台上，却眼睁睁地看着那趟火车启动，把你抛下。一个小姑娘第一次单独出门就碰到了这种情况。
在火车进站20分钟前她就进了车站。因为她的父母再三跟她说，如果误了这趟车，她的东道主朋友就得接她两趟，这是不应该的。她把行李交给搬运工并给他看了车票。搬运工说她早到了两个小时，她听后大吃一惊。她从钱包里摸出一张纸条，那上面有她父亲对这次旅行的详细说明，她把这张纸条交给了搬运工。搬运工说，正如纸条上所说，确有一趟火车在那个时刻到站，但它只停站装邮件，不载旅客。姑娘要求看时刻表，因为她相信父亲不能把这么大的事给弄错。搬运工跑回去取时刻表，同时请来了站长。站长拿着时刻表一挥手，指着那趟列车到站时刻旁边的一个很小的圆圈标记。这个标记表示列车是为装邮件而停车。正在这时，火车进站了。女孩泪流满面，央求让她不声不响地到押车员车厢里去算了。但站长态度坚决，规章制度不能破环，姑娘只得眼看着那趟火车消逝在她要去的方向而撇下了她。
|
|
https://github.com/Myriad-Dreamin/typst.ts | https://raw.githubusercontent.com/Myriad-Dreamin/typst.ts/main/templates/compiler-node/README.md | markdown | Apache License 2.0 | # Typst Template for Typescript+node.js
```shell
yarn install
# full example
npx tsc && node ./dist/esm/main.js
```
|
https://github.com/quarto-ext/typst-templates | https://raw.githubusercontent.com/quarto-ext/typst-templates/main/ieee/_extensions/ieee/typst-show.typ | typst | Creative Commons Zero v1.0 Universal | #show: ieee.with(
$if(title)$
title: "$title$",
$endif$
$if(abstract)$
abstract: [$abstract$],
$endif$
$if(by-author)$
authors: (
$for(by-author)$
(
name: "$it.name.literal$",
$for(it.affiliations/first)$
department: [$it.department$],
organization: [$it.name$],
location: [$it.city$, $it.country$],
$endfor$
email: "$it.email$"
)$sep$,
$endfor$
),
$endif$
$if(index-terms)$
index-terms: ($for(index-terms)$"$it$"$sep$, $endfor$),
$endif$
)
|
https://github.com/DashieTM/ost-5semester | https://raw.githubusercontent.com/DashieTM/ost-5semester/main/compiler/weeks/week10.typ | typst | #import "../../utils.typ": *
#section("Inheritance")
#subsection("ancestor table")
Here the idea is that checking the parent until you eventually land on the type
you want, you can check specific levels of inheritance immediately as a list of
inheritances.
#align(
center,
[#image("../../Screenshots/2023_11_20_08_19_58.png", width: 100%)],
)
```cs
class ClassDescriptor {
private int ancestorLevel;
private ClassDescriptor[] ancestorTable;
// ...
}
```
#subsection("Useless typecasts")
When using casts or instanceof on the same type, the compiler should remove this
instruction as it does nothing.
#align(
center,
[#image("../../Screenshots/2023_11_20_08_22_23.png", width: 60%)],
)
#subsection("instanceof")
```cs
var instance = CheckPointer(Pop());
var target = CheckClassDescriptor(instruction.Operand);
var desc = heap.GetDescriptor(instance);
var level = target.AncestorLevel;
var table = desc.AncestorTable;
Push(table[level] == target);
```
#subsection("Checkcast")
```cs
// instanceof logic
if (!CheckBoolean(Pop())) {
throw new VMException("Invalid cast");
}
Push(instance)
```
#subsection("VTable")
#align(
center,
[#image("../../Screenshots/2023_11_20_08_23_16.png", width: 60%)],
)
#subsubsection("Linear Extension")
With single inheritance and no interfaces, you can essentially just add methods
in a list-append fashion:
#align(
center,
[#image("../../Screenshots/2023_11_20_08_27_18.png", width: 70%)],
)
Calling the function can hence simply be done via the class descriptor on a
methodlist via index:
#align(
center,
[#image("../../Screenshots/2023_11_20_08_29_41.png", width: 70%)],
)
```cs
class ClassDescriptor {
// list of methods
private MethodDescriptor[] virtualTable;
}
class MethodDescriptor {
// index for each method
private int position;
}
```
#subsubsection("Invoke Virtual in VM")
```cs
// pop arguments
var staticMethod = CheckMethodDescriptor(instruction.Operand);
var target = CheckPointer(Pop());
var desc = heap.GetDescriptor(target);
int pos = staticMethod.Position;
var vTable = desc.VirtualTable;
var dynamicMethod = vTable[pos];
// call dynamic method
```
#subsubsection("Interface VTable")
With interfaces we can't just use the linear extension as we can have multiple
interfaces for the same class -> hence we need a way to store more functions for
the object. We can do this by extending the array to a 2 dimensional array:
#align(
center,
[#image("../../Screenshots/2023_11_20_08_34_53.png", width: 100%)],
)
#align(
center,
[#image("../../Screenshots/2023_11_20_08_35_05.png", width: 100%)],
)
#text(
red,
)[The issue with this approach is that for each interface, we need an entire array
for methods, even if the interface doesn't even add methods -> this means we
waste a lot of memory:]
#align(
center,
[#image("../../Screenshots/2023_11_20_08_38_33.png", width: 50%)],
)
#text(teal)[The solution is to use offsets for the vtable:]
#align(
center,
[#image("../../Screenshots/2023_11_20_08_40_02.png", width: 100%)],
)
#subsubsubsection("Check for Interfaces")
With interfaces we also need to check if the base object is compatible(with bad
languages that only use vtables...):
#align(
center,
[#image("../../Screenshots/2023_11_20_08_41_06.png", width: 80%)],
)
|
|
https://github.com/TJ-CSCCG/tongji-undergrad-thesis-typst | https://raw.githubusercontent.com/TJ-CSCCG/tongji-undergrad-thesis-typst/main/init-files/sections/04_figure.typ | typst | MIT License | #import "../../paddling-tongji-thesis/tongjithesis.typ": *
#let example-image = "../figures/example-image.svg"
= 浮动体 <float>
在本节（@float）中，我们将介绍浮动体的概念、分类及其在论文中的使用。
浮动的意思是，最终排版的图形位置不一定与源文件中的位置对应，这也是新手在使用 #LaTeX 和Typst时可能会遇到的问题。
浮动体的正确使用可以提高论文的可读性和美观程度，但也需要注意不要过度使用或使其影响正文的连贯性。
在Typst中，浮动体以 #raw("#figure()", lang: "typ") 的形式实现。不同类型的浮动体都是在此基础上进行扩展的。#raw("#figure()", lang: "typ") 的基础语法如@lst:floatcode
所示。
#figure(
```typ
#figure(
<content>,
<placement>,
<caption>,
<kind>,
<supplement>,
)
```, caption: [Typst的#raw("#figure()", lang: "typ") 参数列表], placement: none, kind: raw,
) <floatcode>
其中，`content` 是浮动体的具体内容，如图片、表格、代码等；`placement` 是浮动体的位置：`none` 表示不浮动，`auto`
表示自动浮动，`top` 表示浮动到页面顶部，`bottom` 表示浮动到页面底部；`caption` 是浮动体的标题；`kind`
是浮动体的类型，用于计数和索引；`supplement` 是浮动体的类型的中文名称。
== 浮动体的分类 <floats-class>
浮动体包括图片、表格和代码等，它们的共同特点是可以自由浮动在页面中，不会影响正文的排版。
=== 插图
插图是论文中最常见的浮动体，它可以是矢量图（SVG）或位图（PNG、JPG、GIF等）。在Typst中，插图以 #raw("#image()", lang: "typ") 的形式实现，这个函数最重要的参数是
`path`，它指定了插图的源文件路径；具体的文档参见#link("https://typst.app/docs/reference/visualize/image/")[#emph[插图]]。
==== 单个插图
#table(columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
#figure(
image(example-image, width: 70%),
caption: [单个插图示例],
)
```, [
#figure(image(example-image, width: 70%), caption: [单个插图示例])
])
=== 多个插图
要同时展示多个插图，我们可以把一个 #raw("#grid()", lang: "typ") 作为 #raw("#figure()", lang: "typ") 的
`content` 参数，也可以把多个 #raw("#figure()", lang: "typ") 作为 #raw("#grid()", lang: "typ") 的
`content` 参数。前者只能指定一个标题和编号，后者可以为每个插图指定不同的标题和编号。
下面，我们以 $2 times 2$ 的网格为例，展示多个插图的使用方法。
==== 单个标题和编号
#table(
columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
#figure(grid(
columns: 2,
rows: 2,
gutter: 5pt,
image(example-image),
image(example-image),
image(example-image),
image(example-image),
), caption: [多个插图示例1]) <multifigure1>
```, [
#figure(
grid(
columns: 2, rows: 2, gutter: 5pt, image(example-image), image(example-image), image(example-image), image(example-image),
), caption: [多个插图示例1],
) <multifigure1>
],
)
===== 多个标题和编号
#table(
columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
#figure(grid(
columns: 2,
rows: 2,
gutter: 5pt,
[#figure(image(example-image), caption: [示例2]) <multifigure2>],
[#figure(image(example-image), caption: [示例3]) <multifigure3>],
[#figure(image(example-image), caption: [示例4]) <multifigure4>],
[#figure(image(example-image), caption: [示例5]) <multifigure5>],
))
```, [
#figure(
grid(
columns: 2, rows: 2, gutter: 5pt, [#figure(image(example-image), caption: [示例2]) <multifigure2>], [#figure(image(example-image), caption: [示例3]) <multifigure3>], [#figure(image(example-image), caption: [示例4]) <multifigure4>], [#figure(image(example-image), caption: [示例5]) <multifigure5>],
),
)
],
)
=== 表格
表格是论文中常见的浮动体，它可以是简单的表格，也可以是复杂的表格。编排表格时应简单明了、表达一致，内容明晰易懂，表文呼应，内容一致。在Typst中，表格以 #raw("#table()", lang: "typ") 的形式实现。同样地，我们需要把 #raw("#table()", lang: "typ") 作为 #raw("#figure()", lang: "typ") 的
`content` 参数。
#table(
columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
#figure(
table(
columns: 4,
[*_t_*], [1], [2], [3],
[*_y_*], [0.3s], [0.4s], [0.8s],
),
caption: [计时结果],
) <table1>
```, [
#figure(
table(columns: 4, [*_t_*], [1], [2], [3], [*_y_*], [0.3s], [0.4s], [0.8s]), caption: [计时结果],
) <table1>
],
)
在 Typst 中，还没有像 #LaTeX 里的 `booktabs` 宏包那样的专门用于排版三线表的宏包。但我们引入了 `tablex` 宏包，可以手动实现三线表的排版。在本模板中，我们定制了 `toprule`、`midrule` 和 `bottomrule` 三个命令，用于绘制三线表的上中下三条线。我们还定制了 `cmidrule` 命令，用于绘制三线表的中间线。下面是一个例子。
#table(
columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
#figure(
tablex(
columns: 3,
auto-lines: false,
align: center + horizon,
toprule(),
colspanx(2)[*Item*], (), rowspanx(2)[*Price* (\$)],
cmidrule(start: 0, end: 2, ),
[*Animal*], [*Description*], (),
midrule(),
rowspanx(2)[Gnat], [per gram], cellx(align: right)[13.65],
(), [each], cellx(align: right)[0.01],
[Gnu], [stuffed], cellx(align: right)[92.50],
[Emu], [stuffed], cellx(align: right)[33.33],
[Armadillo], [frozen], cellx(align: right)[8.99],
bottomrule(),
),
caption: [三线表示例],
kind: table,
)
```, [
#figure(
tablex(
columns: 3, auto-lines: false, align: center + horizon, toprule(), colspanx(2)[*Item*], (), rowspanx(2)[*Price* (\$)], cmidrule(start: 0, end: 2), [*Animal*], [*Description*], (), midrule(), rowspanx(2)[Gnat], [per gram], cellx(align: right)[13.65], (), [each], cellx(align: right)[0.01], [Gnu], [stuffed], cellx(align: right)[92.50], [Emu], [stuffed], cellx(align: right)[33.33], [Armadillo], [frozen], cellx(align: right)[8.99], bottomrule(),
), caption: [三线表示例], kind: table,
)
],
)
`tablex` 宏包也实现了跨页表格。然而，关于带有 “续表X.X”
说明文字的跨页表格，Typst目前还没有很好的解决方案。因此，我们建议在Typst实现这一功能之前，不要使用跨页表格，以免造成与官方模板的不一致。
=== 算法
在偏向于计算机科学的论文中，算法是常见的浮动体；常以伪代码的形式出现。我们引入了 `algo` 宏包，以实现伪代码的排版。在Typst中，算法以 #raw("#algo()", lang: "typ") 的形式实现。
同样地，我们需要把 #raw("#algo()", lang: "typ") 作为 #raw("#figure()", lang: "typ") 的
`content` 参数。
#table(
columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
#figure(algo(
title: [
#set text(size: 15pt)
#emph(smallcaps("Fib")) ],
parameters: ([#math.italic("n")],),
comment-prefix: [#sym.triangle.stroked.r ],
comment-styles: (fill: rgb(100%, 0%, 50%)),
indent-size: 15pt,
indent-guides: 1pt + gray,
inset: 5pt,
fill: luma(250),
)[
if $n < 0$:#i\
return null#d\
if $n = 0$ or $n = 1$:#i\
return $n$#d\
\
let $x <- 0$\
let $y <- 1$\
for $i <- 2$ to $n-1$:#i #comment[so dynamic!]\
let $z <- x+y$\
let $x <- y$\
let $y <- z$#d\
\
return $x+y$
], caption: [计算斐波那契数列], kind: "algo", supplement: "算法") <fib>
```, [
#figure(
algo(
title: [ // note that title and parameters
#set text(size: 15pt) // can be content
#emph(smallcaps("Fib")) ], parameters: ([#math.italic("n")],), comment-prefix: [#sym.triangle.stroked.r ], comment-styles: (fill: rgb(100%, 0%, 50%)), indent-size: 15pt, indent-guides: 1pt + gray, inset: 5pt, fill: luma(250),
)[
if $n < 0$:#i\
return null#d\
if $n = 0$ or $n = 1$:#i\
return $n$#d\
\
let $x <- 0$\
let $y <- 1$\
for $i <- 2$ to $n-1$:#i #comment[so dynamic!]\
let $z <- x+y$\
let $x <- y$\
let $y <- z$#d\
\
return $x+y$
], caption: [计算斐波那契数列], kind: "algo", supplement: "算法",
) <fib>
],
)
=== 代码
我们也可以把代码作为浮动体，以便于在论文中展示代码。在Typst中，代码作为 #raw("#figure()", lang: "typ") 的
`content` 参数，以构建浮动体。
#figure(
```python
def fibonacci(n: int) -> int:
"""
Calculates the nth Fibonacci number.
Args:
n (int): Index of the desired Fibonacci number. Must be non-negative.
Returns:
int: The nth Fibonacci number.
Raises:
ValueError: If the input is negative.
"""
if n < 0:
raise ValueError("Negative arguments are not supported")
if n == 0:
return 0
if n == 1:
return 1
return fibonacci(n - 1) + fibonacci(n - 2)
```, caption: [计算斐波那契数列的Python实现], kind: raw,
) <fibpy>
== 浮动体和公式的交叉引用 <floats>
在论文中，我们经常需要引用浮动体，如 “见图1.1”、“见表2.2”、“见算法3.3”
等。由于在Typst中，浮动体的编号没有预设好的 “章节号.浮动体序号”
的形式，我们引入了 `i-figured` 宏包，以实现我们需要的浮动体的交叉引用格式。
在引用@floats-class 提到的浮动体类型时，我们需要给出浮动体的类型，如 `fig`（图）、`tbl`（表）、`algo`（算法）、`lst`（代码）
等，用冒号 `:` 与浮动体的标签分隔。在Typst中，我们可以使用 `@fig:xxx` 的形式引用浮动体。在渲染时，Typst会自动将 `@fig:xxx` 转换为
“见图X.X” 的形式。下面是一个例子。
#table(columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
如@fig:multifigure1、@tbl:table1、@algo:fib 和@lst:fibpy 所示。
```, [
如@fig:multifigure1、@tbl:table1、@algo:fib 和@lst:fibpy 所示。
])
在引用公式时，我们也需要给出公式的类型（`eqt`），用冒号 `:` 与公式的标签分隔。在Typst中，我们可以使用 `@eqt:xxx` 的形式引用公式。在渲染时，Typst会自动将 `@eqt:xxx` 转换为
“公式~(X.X)” 的形式。下面是一个例子。
#table(columns: (1fr, 1fr), [
#set align(center)
#strong[代码]
], [
#set align(center)
#strong[渲染结果]
], ```typ
如@eqt:pir2 所示。
```, [
如@eqt:pir2 所示。
])
|
https://github.com/donRumata03/aim-report | https://raw.githubusercontent.com/donRumata03/aim-report/master/lib/pdfpc.typ | typst | // Remove when that typo in polylux will be fixed
#let speaker-note(text) = {
let text = if type(text) == "string" {
text
} else if type(text) == "content" and text.func() == raw {
text.text.trim()
} else {
panic("A note must either be a string or a raw block")
}
[ #metadata((t: "Note", v: text)) <pdfpc> ]
}
#let end-slide = [
#metadata((t: "EndSlide")) <pdfpc>
]
#let save-slide = [
#metadata((t: "SaveSlide")) <pdfpc>
]
#let hidden-slide = [
#metadata((t: "HiddenSlide")) <pdfpc>
]
#let config(
duration-minutes: none,
start-time: none,
end-time: none,
last-minutes: none,
note-font-size: none,
disable-markdown: false,
default-transition: none,
) = {
if duration-minutes != none {
[ #metadata((t: "Duration", v: duration-minutes)) <pdfpc> ]
}
let _time-config(time, msg-name, tag-name) = {
let time = if type(time) == "datetime" {
time.display("[hour padding:zero repr:24]:[minute padding:zero]")
} else if type(time) == "string" {
time
} else {
panic(msg-name + " must be either a datetime or a string in the HH:MM format.")
}
[ #metadata((t: tag-name, v: time)) <pdfpc> ]
}
if start-time != none {
_time-config(start-time, "Start time", "StartTime")
}
if end-time != none {
_time-config(end-time, "End time", "EndTime")
}
if last-minutes != none {
[ #metadata((t: "LastMinutes", v: last-minutes)) <pdfpc> ]
}
if note-font-size != none {
[ #metadata((t: "NoteFontSize", v: note-font-size)) <pdfpc> ]
}
[ #metadata((t: "DisableMarkdown", v: disable-markdown)) <pdfpc> ]
if default-transition != none {
let dir-to-angle(dir) = if dir == ltr {
"0"
} else if dir == rtl {
"180"
} else if dir == ttb {
"90"
} else if dir == btt {
"270"
} else {
panic("angle must be a direction (ltr, rtl, ttb, or btt)")
}
let transition-str = (
default-transition.at("type", default: "replace")
+ ":" +
str(default-transition.at("duration-seconds", default: 1))
+ ":" +
dir-to-angle(default-transition.at("angle", default: rtl))
+ ":" +
default-transition.at("alignment", default: "horizontal")
+ ":" +
default-transition.at("direction", default: "outward")
)
[ #metadata((t: "DefaultTransition", v: transition-str)) <pdfpc> ]
}
} |
|
https://github.com/loqusion/typix | https://raw.githubusercontent.com/loqusion/typix/main/.github/ISSUE_TEMPLATE/3-typst_packages.md | markdown | MIT License | ---
name: Typst packages
about: For issues related to Typst packages
title: "[Typst packages]: "
labels: typst packages
assignees: ''
---
|
https://github.com/SillyFreak/typst-scrutinize | https://raw.githubusercontent.com/SillyFreak/typst-scrutinize/main/src/task-kinds/free-form.typ | typst | MIT License | #let _grid = grid
/// An answer to a free form question. If the document is not in solution mode, the answer is hidden
/// but the height of the element is preserved.
///
/// Example:
///
/// #task-example(lines: "2-", ```typ
/// #import task-kinds: free-form
/// Write an answer.
/// #free-form.plain(placeholder: [...], stroke: 0.5pt, stretch: 200%)[
/// an answer
/// ]
/// Next question
/// ```)
///
/// - answer (content): the answer to (maybe) display
/// - placeholder (auto, content): the placeholder to display instead of hiding the answer. For the
/// layout of exam and solution to match, this needs to have the same height as the answer.
/// - height (auto, relative): the height of the region where an answer can be written
/// - stretch (ratio): the amount by which the height of the answer region should be stretched
/// relative to the required height of the provided solution. Can only be set to a value other
/// than 100% if `height == auto`.
/// - stroke (none, stroke): the stroke of the box to draw around the answer area
/// -> content
#let plain(
answer,
placeholder: auto,
height: auto,
stretch: 100%,
stroke: none,
) = layout(((width,)) => {
import "../solution.typ"
let (answer, height) = (answer, height)
assert(
height == auto or stretch == 100%,
message: "a `stretch` value other than 100% is only allowed if `height == auto`.",
)
answer = solution.answer(answer, placeholder: placeholder)
let answer-block = block.with(
width: 100%,
outset: (x: 0.3em, y: 0.4em),
inset: (y: 0.3em),
stroke: stroke,
align(horizon, answer),
)
if stretch != 100% {
height = measure(answer-block(width: width)).height * stretch
}
answer-block(height: height)
})
/// An answer to a free form question. If the document is not in solution mode, the answer is hidden
/// but the height of the element is preserved.
///
/// This answer type is meant for text questions and shows a lines to write on. By default, the
/// lines are spaced to match a regular paragraph (assuming the text styles are not changed within
/// the answer) and the number of lines depends on what is needed for the sample solution. If a
/// `line-height` is explicitly set, the `par.leading` is adjusted to make the sample solution
/// fit the lines. Paragraph spacing is currently not adjusted, so for the answer to look nice, it
/// should only be a single paragraph.
///
/// Example:
///
/// #task-example(lines: "2-", ```typ
/// #import task-kinds: free-form
/// Write an answer.
/// #free-form.lines(placeholder: [...\ ...], count: 150%, stretch: 200%)[
/// this answer takes \ more than one line
/// ]
/// Next question
/// ```)
///
/// - answer (content): the answer to (maybe) display
/// - placeholder (auto, content): the placeholder to display instead of hiding the answer. For the
/// layout of exam and solution to match, this needs to have the same height as the answer.
/// - count (auto, int, ratio): the number of lines to show; defaults to however many are needed for
/// the answer. If given as a ratio, the `auto` line number is multiplied by that and rounded up.
/// - line-height (auto, relative): the line height; defaults to what printed lines naturally take
/// - stretch (ratio): the amount by which the line height should be stretched relative to the
/// regular line height. Can only be set to a value other than 100% if `line-height == auto`.
/// - stroke (none, stroke): the stroke of the lines to draw
/// -> content
#let lines(
answer,
placeholder: auto,
count: auto,
line-height: auto,
stretch: 100%,
stroke: 0.5pt,
) = layout(((width,)) => {
import "../solution.typ"
let (answer, count, line-height) = (answer, count, line-height)
assert(
line-height == auto or stretch == 100%,
message: "a `stretch` value other than 100% is only allowed if `line-height == auto`.",
)
answer = solution.answer(answer, placeholder: placeholder)
// transform lines to be of the right height, and adjust the line height variable if necessary
show: {
// the height advance of one line
let line-advance = measure[a\ a].height - measure[a].height
if line-height != auto {
// explicit line height; don't adjust the value but adjust the leading
body => {
set par(leading: par.leading + line-height - line-advance)
body
}
} else if stretch == 100% {
// implicit line height; adjust the value but not the leading
line-height = line-advance
body => body
} else {
// stretched line height; adjust the value and the leading
line-height = line-advance * stretch
body => {
set par(leading: par.leading + line-height - line-advance)
body
}
}
}
// start a new context block so we can measure using the new leading
context {
let count = count
if type(count) != int {
let multiplier = if count == auto { 1 } else { count / 100% }
// measure the height, then divide by the line height; round up
count = calc.ceil(measure(block(width: width, answer)).height / line-height)
count = calc.ceil(count * multiplier)
}
block({
v(-0.3em)
_grid(
columns: (1fr,),
rows: (line-height,) * count,
stroke: (bottom: stroke),
)
place(top, answer, dy: par.leading / 2)
})
}
})
/// An answer to a free form question. If the document is not in solution mode, the answer is hidden
/// but the height of the element is preserved.
///
/// This answer type is meant for math and graphing tasks and shows a grid of lines. By default, the
/// grid has a 5mm raster, and occupies enough vertical space to contain the answer. The grid fits
/// the available width; use padding or similar to make it more narrow.
///
/// #task-example(lines: "2-", ```typ
/// #import task-kinds: free-form
/// Draw a circle with the given center.
/// #free-form.grid(stretch: 125%, {
/// place(dx: 19.7mm, dy: 9.7mm, circle(radius: 0.3mm))
/// pad(left: 15mm, y: 5mm, circle(radius: 5mm))
/// }, placeholder: {
/// place(dx: 19.7mm, dy: 9.7mm, circle(radius: 0.3mm))
/// })
/// Next question
/// ```)
///
/// - answer (content): the answer to (maybe) display
/// - placeholder (auto, content): the placeholder to display instead of hiding the answer. For the
/// layout of exam and solution to match, this needs to have the same height as the answer.
/// - height (auto, relative): the height of the grid region
/// - stretch (ratio): the amount by which the height of the answer region should be stretched
/// relative to the required height of the provided solution. Can only be set to a value other
/// than 100% if `height == auto`.
/// - size (relative, dictionary): grid size, or a dictionary containing `width` and `height`
/// - stroke (none, stroke): the stroke of the grid to draw
/// -> content
#let grid(
answer,
placeholder: auto,
height: auto,
stretch: 100%,
size: 5mm,
stroke: 0.5pt+gray,
) = layout(((width,)) => {
import "../solution.typ"
let (answer, height, size) = (answer, height, size)
assert(
height == auto or stretch == 100%,
message: "a `stretch` value other than 100% is only allowed if `height == auto`.",
)
answer = solution.answer(answer, placeholder: placeholder)
if type(size) != dictionary {
size = (width: size, height: size)
}
if height == auto {
height = measure(block(width: width, answer)).height * stretch
}
let columns = calc.floor(width / size.width)
let rows = calc.ceil(height / size.height)
block({
_grid(
columns: (size.width,) * columns,
rows: (size.height,) * rows,
stroke: stroke,
)
place(top, answer)
})
})
|
https://github.com/SnO2WMaN/incompleteness.txt | https://raw.githubusercontent.com/SnO2WMaN/incompleteness.txt/main/template.typ | typst | Creative Commons Zero v1.0 Universal | #let project(title: "", authors: (), body) = {
set document(author: authors, title: title)
set page(numbering: "1", number-align: center)
set heading(numbering: "1.1")
set text(font: "Noto Serif CJK JP", lang: "ja")
align(center)[
#block(text(weight: 700, 1.5em, title))
]
pad(
top: 0.5em,
bottom: 0.5em,
x: 2em,
grid(
columns: (1fr,) * calc.min(3, authors.len()),
gutter: 1em,
..authors.map(author => align(center, strong(author))),
),
)
set par(justify: true)
body
}
|
https://github.com/juicebox-systems/ceremony | https://raw.githubusercontent.com/juicebox-systems/ceremony/main/instructions/debug.typ | typst | MIT License | // Debug levels:
// - 0: Used for the final PDF with no debugging output.
// - 1: Shows estimated timestamps.
// - 2: Shows the component demo appendix, the requirements of each step, and
// the model variables at the start of each set of steps.
// - 3: Shows the model variables after each step.
#let debug_level = 0
#let debug_color = green
#let debug_text(content) = text(fill: debug_color, content)
// Some "panics" (mostly used in the model) can be hard to understand and
// locate when they don't generate a PDF. Set this to false to turn them into
// soft errors, with the label "ERROR:" inline in the document.
#let errors_fatal = true
// A "panic" that can be made non-fatal with `errors_fatal`. The `message`
// should be a string.
#let error(message) = {
if errors_fatal {
panic(
"ERROR",
message,
"Rerun with `errors_fatal = false` to see the error in the document"
)
} else {
block(
text(
fill: red,
weight: bold,
[ERROR: #message]
)
)
}
}
|
https://github.com/YouXam/soviet-matrix | https://raw.githubusercontent.com/YouXam/soviet-matrix/main/lib.typ | typst | MIT License | #import "@preview/suiji:0.3.0": gen-rng, choice
#import "mino/tetris.typ": render-field
#let parse-actions(body) = {
let extract(it) = {
""
if it == [ ] {
" "
} else if it.func() == text {
it.text
} else if it.func() == [].func() {
it.children.map(extract).join()
}
}
extract(body).clusters().map(lower)
}
#let minoes = (("ZZ_", "_ZZ"), ("OO", "OO"), ("_SS", "SS_"), ("IIII",), ("__L", "LLL"), ("J__", "JJJ"), ("_T_", "TTT"))
#let new-mino(rng, cols, rows) = {
let (rng, mino) = choice(rng, minoes)
let width = calc.max(..mino.map(it => it.len()))
(rng, (
mino: mino,
pos: (x: calc.floor(cols / 2) - calc.floor(width / 2) - 1, y: rows + 1),
height: mino.len(),
width: width,
))
}
#let render-map(map, bg-color: rgb("#f3f3ed")) = {
let map = map.map(it => it.join(""))
render-field(map, rows: map.len(), cols: calc.max(..map.map(it => it.len())), bg-color: bg-color, radius: 0pt)
}
#let check-collision(state, cols: 10, rows: 20) = {
if state.current.pos.x < 0 or state.current.pos.y - state.current.height + 1 < 0 or state.current.pos.x + state.current.width > cols {
return true
}
for y in range(state.current.mino.len()) {
for x in range(state.current.mino.at(y).len()) {
if state.current.mino.at(y).at(x) != "_" and state.map.at(state.current.pos.y - y).at(state.current.pos.x + x) != "_" {
return true
}
}
}
false
}
#let try-move(state, cols: 10, rows: 20, dx: 0, dy: 0) = {
state.current.pos = (x: state.current.pos.x + dx, y: state.current.pos.y + dy)
not check-collision(state, cols: cols, rows: rows)
}
#let rotate-clockwise(mino) = {
let center = (x: mino.pos.x + calc.floor(mino.width / 2), y: mino.pos.y - calc.floor(mino.height / 2))
let new-mino = range(mino.width).map(_ => "")
for y in range(mino.mino.len() - 1, -1, step: -1) {
for x in range(mino.mino.at(y).len()) {
new-mino.at(x) += mino.mino.at(y).at(x)
}
}
(
mino: new-mino,
pos: (x: center.x - calc.floor(mino.height / 2), y: center.y + calc.floor(mino.width / 2)),
height: mino.width,
width: mino.height,
)
}
#let rotate(state, cols: 10, rows: 20, angle: 0) = {
let next-state = state
for _ in range(angle) {
next-state.current = rotate-clockwise(next-state.current)
}
if check-collision(next-state, cols: cols, rows: rows) {
state
} else {
next-state
}
}
#let move(state, cols: 10, rows: 20, dx: 0, dy: 0) = {
if try-move(state, cols: cols, rows: rows, dx: dx, dy: dy) {
state.current.pos.x += dx
state.current.pos.y += dy
(state, true)
} else {
(state, false)
}
}
#let render(state, cols: 10, rows: 20) = {
let map = state.map
if not state.end {
let pos = state.current.pos
while true {
if try-move(state, cols: cols, rows: rows, dy: -1) {
state.current.pos.y -= 1
} else {
break
}
}
for y in range(state.current.mino.len()) {
for x in range(state.current.mino.at(y).len()) {
if state.current.mino.at(y).at(x) != "_" {
map.at(state.current.pos.y - y).at(state.current.pos.x + x) = lower(state.current.mino.at(y).at(x))
}
}
}
for y in range(state.current.mino.len()) {
for x in range(state.current.mino.at(y).len()) {
if state.current.mino.at(y).at(x) != "_" {
map.at(pos.y - y).at(pos.x + x) = state.current.mino.at(y).at(x)
}
}
}
}
let main = state.map.slice(0, state.map.len() - 2)
grid(columns: 2, gutter: 5pt, block(height: rows * 10pt, width: cols * 10pt, {
place(
top + left,
dy: 40pt,
dx: 2pt,
block(stroke: luma(80%) + 0.5pt, radius: 2pt, inset: 0pt, fill: pattern(size: (10pt, 10pt))[
#box(stroke: 0.1pt + luma(50%), width: 100%, height: 100%, fill: rgb("#f3f3ed")),
], height: rows * 10pt, width: cols * 10pt),
)
place(top + left, render-map(map, bg-color: white.transparentize(100%)))
}), pad(top: 40pt, [
#set block(spacing: 3pt)
#block(height: 6em, width: 6em, stroke: luma(80%) + 0.5pt, radius: 2pt, [
#set block(spacing: 0pt)
#if state.end [
#align(center + horizon)[
*Game Over*
]
] else [
#pad(top: 2pt, left: 3pt, bottom: 0pt, [*Next*])
#align(center + horizon)[
#render-map(state.next.mino.map(it => it.split("")).rev(), bg-color: white.transparentize(100%))
]
]
])
#block(height: 4em, width: 6em, stroke: luma(80%) + 0.5pt, radius: 2pt, [
#set block(spacing: 0pt)
#pad(top: 2pt, left: 3pt, bottom: 0pt, [*Score*])
#align(center + horizon)[
#state.score
]
])
]))
}
#let next-tick(state, cols: 10, rows: 10) = {
if try-move(state, dy: -1, cols: cols, rows: rows) {
state.current.pos.y -= 1
} else {
for y in range(state.current.mino.len()) {
for x in range(state.current.mino.at(y).len()) {
if state.current.mino.at(y).at(x) != "_" {
state.map.at(state.current.pos.y - y).at(state.current.pos.x + x) = state.current.mino.at(y).at(x)
}
}
}
state.current = state.next
(state.rng, state.next) = new-mino(state.rng, cols, rows)
}
state
}
#let eliminate(state, cols: 10, rows: 20) = {
let new-map = state.map.filter(row => row.filter(it => it != "_").len() != row.len())
let eliminated = state.map.len() - new-map.len()
state.map = new-map + range(eliminated).map(_ => range(cols).map(it => "_"))
let level = (-2, 40, 100, 300, 1200)
state.score += level.at(eliminated)
state
}
#let game(body, seed: 2, cols: 10, rows: 20, actions: (
left: ("a", ),
right: ("d", ),
down: ("s", ),
left-rotate: ("q", ),
right-rotate: ("e", ),
half-turn: ("w", ),
fast-drop: ("f", ),
)) = {
set page(height: auto, width: auto, margin: (top: 0.5in - 30pt, bottom: 0.5in + 40pt, rest: 0.5in))
let chars = parse-actions(body)
let state = (
rng: gen-rng(seed),
current: none,
next: none,
map: range(rows + 4).map(_ => range(cols).map(it => "_")),
end: false,
score: 0,
)
(state.rng, state.current) = new-mino(state.rng, cols, rows)
(state.rng, state.next) = new-mino(state.rng, cols, rows)
for char in chars {
if actions.left.any(it => it == char) {
(state, _) = move(state, cols: cols, rows: rows, dx: -1, dy: 0)
} else if actions.right.any(it => it == char) {
(state, _) = move(state, cols: cols, rows: rows, dx: 1, dy: 0)
} else if actions.fast-drop.any(it => it == char) {
let success = true
while success {
(state, success) = move(state, cols: cols, rows: rows, dy: -1)
}
} else if actions.right-rotate.any(it => it == char) {
state = rotate(state, angle: 1, cols: cols, rows: rows)
} else if actions.left-rotate.any(it => it == char) {
state = rotate(state, angle: 3, cols: cols, rows: rows)
} else if actions.half-turn.any(it => it == char) {
state = rotate(state, angle: 2, cols: cols, rows: rows)
}
state = next-tick(state, cols: cols, rows: rows)
state = eliminate(state, cols: cols, rows: rows)
if check-collision(state, cols: cols, rows: rows) {
state.end = true
break
}
}
render(state, cols: cols, rows: rows)
}
|
https://github.com/polarkac/MTG-Stories | https://raw.githubusercontent.com/polarkac/MTG-Stories/master/stories/023%20-%20Oath%20of%20the%20Gatewatch/007_Brink%20of%20Extinction.typ | typst | #import "@local/mtgstory:0.2.0": conf
#show: doc => conf(
"Brink of Extinction",
set_name: "Oath of the Gatewatch",
story_date: datetime(day: 10, month: 02, year: 2016),
author: "<NAME>",
doc
)
#emph[Two Eldrazi titans now roam Zendikar] #emph['s surface. The network of stone hedrons that briefly imprisoned one of them is hopelessly disrupted, and the army that fought them is scattered. But four Planeswalkers took an oath: to keep watch over Zendikar and the Multiverse, to run toward danger rather than away, to stand against beings like the Eldrazi that threaten to destroy what people hold dear.]
#emph[They took an oath. They formed a team. Now they need a new plan. And <NAME>, with the information he gleaned from the spirit dragon Ugin, is the only person who might be able to come up with one.]
#v(0.35em)
#line(length: 100%, stroke: rgb(90%, 90%, 90%))
#v(0.35em)
The sense of unified purpose was more fragile than Jace's compatriots seemed to realize.
He struggled to hear himself think over the sound of the others talking, the others thinking. They were walking—wanting to run, saving their strength—toward a ravine where Chandra had seen some other survivors. They all wanted Jace to come up with a plan. But Jace #emph[had] come up with a plan, and it had failed, and that left him improvising.
Jace hated improvising.
"Whatever you need us to do, we'll do it," said Gideon, but to himself he added, #emph[if there] #emph['s anything left to be done.]
"I'm ready," said Nissa. "Zendikar is ready." But another thought skimmed across the surface of her mind: #emph[How do I know you] #emph['ll stay?]
"Come on!" said Chandra. "Spit it out!" #emph[Spit it out!] her thoughts echoed, half a moment before—or perhaps half a moment after. She, at least, always seemed to point in one direction to such a degree that reading her mind was generally pointless.
They stumbled down into the ravine, which was covered in Kozilek's weird iridescent trail. Jace sensed the others before he saw them—half a dozen weary humans and kor, the shadowed mind of a vampire, and the cool and distant thoughts of two merfolk.
They rounded a bend in the ravine to find General Tazri and a few of her soldiers, the kor ambusher Munda, a sulking vampire who presumably represented Drana's interests, the ruin diver Jori En, and—oh, wonderful. Standing tall, bident in hand, cocky smile still in place, was the merfolk Planeswalker Kiora, looking none the worse for wear aside from a few torn fins. They were arguing.
#figure(image("007_Brink of Extinction/01.jpg", width: 100%), caption: [General Tazri | Art by <NAME>], supplement: none, numbering: none)
"We strike here," said Tazri, gesturing at a map. "The titans are on the move. We cut them off before they get too far apart."
"That's suicide," said Drana's emissary.
Gideon stepped forward.
"Commander-General!" said Tazri, snapping to attention. She radiated unease and relief in equal measure, her thoughts shying away from a recent, jagged memory that Jace didn't try to read.
Gideon grinned and embraced her.
"At ease," he said, standing back and appraising the group. "It's good to see you. It's good to see all of you."
Gideon clasped Munda's arm, put a firm hand on Jori's shoulder, and nodded to Kiora and the vampire.
Jace looked to Jori, then his gaze settled on Kiora.
#emph[Is she going to work with us this time?] Jace asked, in Jori's head.
Jori flinched, slightly. #emph[Yes] , she thought. #emph[Probably.]
"Kiora," said Gideon. "I thought we'd lost you."
"I thought we'd lost a lot of things," said Kiora. Her smile faded, just for a moment, then returned with a kind of ferocious intensity. "Anyway. We're all here. What's our next move?"
"#emph[Our] next move?" said Jace. "You're the one who stormed off, forced our hand, led your little flotilla to disaster, and now—"
"Yes," hissed Kiora. Her eyes burned bright, and she was no longer smiling. "Yes. All of that. Which is why I'm here, now, #emph[asking you] what #emph[we] are going to do." She scowled. "For some reason I thought you'd appreciate a gesture of humility on my part."
"On the contrary," said Gideon, before Jace could respond. "It's terrifying."
That brought the smile back to Kiora's face, at least. Jace could make people do what he wanted, if he absolutely had to, but he barely understood Gideon's ability to make people #emph[want] to cooperate. There was nothing magical about it, just charisma and personal integrity—neither of which Jace had ever seen a pressing need to cultivate.
Which meant his first priority, in any given situation, ought to be winning Gideon over. A good thing to keep in mind, if they survived this.
"What #emph[is] our next move?" asked Tazri. "We've got people scattered all over the basin. I'm trying to round them up, but there's still water in the low-lying areas, and the Eldrazi are everywhere."
"Jace has a plan," said Gideon. "Right?"
Heads swiveled toward him, eyes full of expectation. Full of hope.
Jace rubbed his temples. Closed his eyes. Opened them.
"All right," he said. "Listen up, because we don't have a lot of time. I had a backup plan if our hedron trap failed, but it only had one Eldrazi titan in it. Now we've got two on our hands, our allies are scattered to the winds, and I've got...call it half a plan. I'm going to need your help making it a reality."
He conjured an illusion: the ring of hedrons they had used to trap Ulamog. He sent them falling away as he spoke, splashing into an illusory sea, but he left the diagram that had guided them into place. The glyph that the spirit dragon Ugin had shown him—the shape the leylines needed to take to bind the Eldrazi.
The sounds of battle echoed from around the ravine. Chandra fiddled with her gauntlet and looked to Gideon. He nodded, and Chandra backed away from the solemn gathering, hair already igniting. Some people weren't meant to sit still, and Jace would rather have her blasting Eldrazi than fidgeting through a plan whose details weren't going to interest her. She stayed at the edge of the group, unleashing jets of flame at small Eldrazi that got too close.
"It's no longer possible to trap Kozilek and Ulamog," said Jace. "Not with the resources we have. We don't have the time or the people to build a hedron network around both of them. But this shape still has power."
He indicated the glyph, now empty of hedrons, a circle with three equidistant projections.
#figure(image("007_Brink of Extinction/02.jpg", width: 100%), caption: [Oath of Nissa | Art by <NAME>], supplement: none, numbering: none)
"Nissa, if the titans were close together and stationary, if you could concentrate completely without having to defend yourself...do you think you could make this glyph using Zendikar's leylines? Directly, without any hedrons to help?"
Nissa's eyes grew distant, tracing the curves of lines that Jace couldn't see. Her hands flexed.
"Yes," she said. "But without the hedrons to hold the leylines in place, the binding will only last for as long as I can keep it going. And I don't know how long that would be."
"So we can't trap them," Gideon said. "What is it you're trying to do?"
This was it. His last chance to back out from what might be a terrible mistake.
Ugin, who was much older and much smarter than any of them, had given Jace two very clear directives: Don't try to kill the Eldrazi titans. And don't let the titans escape to threaten other worlds.
But one of the two was no longer on the table. The means to trap one Eldrazi titan were now beyond them. Two of the things were loose, and they could leave Zendikar at any moment. The consequences of their escape would be disastrous, with certainty. They would find another world, one without the benefit of Zendikar's preparations; they would feed on that world, and thousands or millions would die.
Unacceptable.
That left one option. Ugin had never been clear why he didn't want the titans killed—whether his objection had more to do with the risks of such an effort, or the consequences—and now Ugin wasn't here, at the moment of decision, to clarify. But he had spoken, at length, about the danger of allowing the titans to leave the plane, a danger that hardly needed to be explained.
"We can't trap them, and we're not about to let them leave," said Jace. "That leaves one option. We're going to kill them."
His companions, four other Planeswalkers and some very brave planebound fighters...nodded. #emph[Yes.] Kill two enormous, unfathomably ancient beings using nothing but their own abilities and ingenuity. That made sense, didn't it?
#emph[Azor help me] , he thought#emph[. I] #emph['ve signed on with heroes.]
#figure(image("007_Brink of Extinction/03.jpg", width: 100%), caption: [Call the Gatewatch | Art by <NAME>], supplement: none, numbering: none)
"How do we do that?" said Gideon. "When we spoke before, you didn't seem to think it was possible."
"I didn't," said Jace. "But Ugin said something at the Eye that made me suspect otherwise."
"That was before you said we had to trap Ulamog," said Kiora. "You didn't mention it."
"Yes, it was," said Jace, "and no, I didn't. Ugin seemed to think killing an Eldrazi titan was a bad idea, and I promised him I'd avoid it if possible."
"You gave your word?" said Gideon. Breaking a promise didn't seem to sit well with him, a fact Jace would have to keep in mind.
"You held out on us," said Kiora.
"If possible," Jace repeated, to Gideon. "It's no longer possible." He turned to Kiora. "And I did hold out on you, because I had a plan that didn't require your cooperation. I'm sure you'd never do something like that."
Kiora smiled.
"Well?" yelled Chandra, from outside the ravine. "Do you have a plan yet?"
Jace ignored her.
"We're going to need to get the two titans closer together—close enough that Nissa can trap both of them in the same cluster of leylines."
"They don't care about us," said Kiora. "They won't rise to your challenge."
"The titans are drawn to concentrations of life," said Jace. He turned to Gideon and Tazri. "That's where your people come in. Position them in the basin in strength and engage directly with Ulamog and Kozilek."
"You want to use our army as...bait?" said Gideon.
Jace sighed.
"What's the difference between bait and an ambush party?" he asked.
Gideon waited, frowning, but Tazri spoke up.
"Bait doesn't get a choice," she said.
"That's right," said Jace. "Gideon, you've said these people are willing to lay down their lives for Zendikar. Well, it's time."
Gideon's frown deepened.
"I can gather whoever we have and tell them the plan," said Tazri. "But you're the one who can make them believe it. Tell them what's at stake. Give them a choice, Gideon. When you say it, I don't think it'll sound like a very hard decision."
Gideon breathed deep, in and out.
"Rally the troops," he said. "I'll get the details, then join you."
Gideon clapped Tazri on one armored shoulder, and she hurried off to rally the troops.
"The plan," he said.
"Right," said Jace. "Ugin described each Eldrazi titan as a man sticking his hand in a pond, and the original hedron trap as a spike driven through the hand. The titans we can see—those are just their hands. The rest of them are outside the plane, in the Blind Eternities. 'Killing' the part we can see doesn't do much. Our metaphorical man wanders off, down a hand...but free."
"They're already free," said Gideon.
"Yes," said Jace. "The spike's come loose. That's why we need to act. But if we just attack them—if we really hurt them—then they pull their hands out of the pond and wander off to bother some less dangerous little fish. So we've got to be smart about it. If you've got the means to drive a spike through a man's hand, what else can you do?"
He realized, with annoyance, that he was repeating the same folksy metaphor that had irritated him when Ugin had used it, right down to the leading questions and tone of knowing mysticism.
"You can pull him in," said Nissa.
"And then he drowns," said Kiora, with a little too much enthusiasm.
"Exactly!" said Jace. "So assuming Ugin's metaphor is broadly accurate—and frankly, at this point, we don't have any choice—we pull the two titans into the physical world completely, and then we can kill them."
"How?" asked Gideon.
"That," said Jace, "would be why I told you I had half a plan. I don't know."
"That's your idea?" said Kiora. "Pull the shark into the boat, and then, um...?"
"No," said Jace. "My plan was to present the problem to my multitalented assortment of intelligent, experienced allies and see if they came up with anything helpful."
"I can do it," said Nissa, staring off toward some distant horizon.
"How?"
She turned, as though she hadn't noticed Jace standing there.
"It's complicated," she said. "Let me show you."
Jace hesitated, remembering the chaos and power of the elf's mind. He hadn't been in control, and that frightened him. But what choice did he have? He closed his eyes, and opened Nissa's.
Again, the world was lit with green fire, a pulsing light cast by blazing lines that crisscrossed the sky. Their friends were glaciers, creeping along, as Nissa and Jace communed at the speed of thought. And the titans...the titans...
In Nissa's vision, Ulamog was a pit of blackness, and Kozilek a writhing enigma. The leylines arced toward them—twisted, frayed, screaming in protest.
#emph[I can] #emph['t...] he said, in her mind. #emph[I don] #emph['t understand this.]
The last time he'd been in Nissa's mind, she'd helped him ignore the leylines, to focus on the clean outline of his illusionary model rather than the vibrant, overpowering reality. He tried to withdraw from them again, but Nissa's thoughts seemed to hold his own firmly in place. He couldn't—she shouldn't be able to—
#emph[Look] , said Nissa. #emph[See.]
#emph[I don] #emph['t] —
#emph[See] , she insisted.
He looked. He saw.
Images flashed, memories of the hedron network as it once was, as Nissa had seen it. Leylines crisscrossed the world in shallow arcs, guided and constrained by the hedron network. Eventually, across thousands of miles, they looped, crossed, and enclosed the titans in a prison of pure mana.
The hedrons pulsed, occasionally, sent out bursts of wild mana through the leylines. Those bursts rippled across the land, giving rise to whirling winds and tumbling rocks of the Roil. Nissa hadn't understood it then, but she did now: the titans were trying to escape. The hedrons drained their strength, dispersing their exertions out into web of leylines. She'd thought her world was angry. She hadn't realized it was fighting for its life.
#figure(image("007_Brink of Extinction/04.jpg", width: 100%), caption: [Art by <NAME>], supplement: none, numbering: none)
Nissa's memories flooded through him, some of them eerily familiar. The Eye of Ugin. The vampire sage Anowon, swearing that the Eldrazi would leave Zendikar if they were freed. A tall, white-haired man with a sword, his dry, elegant voice speaking a name—
#emph[You] #emph['ve met <NAME>?]
—but the flood of images continued. A stone dragon, its eyes glowing blue. A hedron crackling with white fire, the linchpin of the whole network, binding the half-opened prison in place, humming with the effort. Nissa's staff striking the hedron. A widening crack, and a flash of pure white light—
The image faded, replaced by more abstract imaginings.
Inside a glyph made without hedrons, the titans would be trapped for only a short time, but they'd be in direct contact with the leylines—the same leylines that could disperse the titans' energy into the plane itself.
#figure(image("007_Brink of Extinction/05.jpg", width: 100%), caption: [Nissa's Judgment | Art by <NAME>], supplement: none, numbering: none)
The hedrons were dampeners. With the hedrons in the way, the glyph couldn't be used to kill the titans. But without the hedrons...
#emph[We can tear the titans apart] , said Jace.
#emph[Drain away all their strength into the leylines, ] said Nissa.#emph[ Into Zendikar. So this world can do to them what they] #emph['ve been trying to do to it. Devour them.]
#emph[It may be hard on Zendikar] , said Jace. #emph[If bleeding off the titans] #emph[' excess energy caused the Roil, draining all of it—]
#emph[I know] , said Nissa. #emph[Zendikar can do it.]
A moment of silence, then, in the space between minds.
#emph[You removed the last failsafe] , said Jace. #emph[You let them out.]
#emph[I let them out,] said Nissa. #emph[Because I didn] #emph['t trust Sorin, and I wanted to help my world. I thought they would leave. I was wrong.]
#emph[It happens,] said Jace. #emph[You had bad information.]
#emph[And I knew that, and I acted on it anyway,] said Nissa. Her thoughts were firm, unyielding.
#emph[Why did you let me see that?]
#emph[Because I didn] #emph['t want to wonder if you'd pulled it from my mind] , said Nissa. #emph[And because I want you to know why I] #emph['m doing this. I have to make this right.]
#emph[I understand] , said Jace. #emph[I—]
He hesitated, unsure how the elf would react.
#emph[I] #emph['m part of the reason the failsafe was needed] .
Reluctantly, he lowered his own mental defenses, pulled out a particular set of memories, and let her experience them, in the same sort of rush. Anowon guiding him to the Eye. The fight with Chandra and the dragonspeaker. The Eye opening...
#emph[You let them out!] said Nissa.
#emph[I let them out] , said Jace. #emph[Chandra and I. We were tricked into it, but that doesn] #emph['t really matter, does it?]
Three Planeswalkers had unlocked the titans' prison and allowed their spawn to swarm Zendikar. One had removed Ugin's final failsafe and opened the door. Three of those four were standing here, prepared to fix their mistake.
#emph[No] , said Nissa. #emph[All that matters is setting it right.]
He withdrew from her mind and opened his eyes, blinking at the dim and steady light of an unlined sky.
"Well?" said Chandra. Seconds had passed.
Jace swallowed. Speech felt clumsy and unwelcome after an extended mental conversation.
"We have a plan," he said. "We pull them in, use the leylines to drain their essence into Zendikar, and let the plane itself devour them."
"That's not so complicated," said Kiora.
"I assure you, it's extremely complicated," said Jace. "But Nissa and I think it can work."
"Where do you need us?" said Gideon.
"We pick a spot," said Jace. "You and your troops lure the titans—" He smiled. "—into an ambush. Nissa and I wait there, with a small detachment of troops to guard us. When the time comes, Nissa weaves the leylines together and binds the titans. Your job is to hold off the Eldrazi for as long as she needs."
He turned to the merfolk Planeswalker, who was twirling her bident...eagerly? Or nervously?
"Kiora, you know your capabilities better than I do," he said. "I'm open to suggestions."
"That's...remarkably intelligent of you," she said.
Jace laughed.
"I'd have accepted 'considerate.'"
"I'll clear out the basin," said Kiora. "Keep the swarms of Eldrazi off your backs and make sure your troops have dry ground to walk on."
#figure(image("007_Brink of Extinction/06.jpg", width: 100%), caption: [Kiora, Master of the Depths | Art by Jason Chan], supplement: none, numbering: none)
"What about me?" asked Chandra.
"Go with Gideon, or stay with us," said Jace. "Set things on fire. But don't attack the titans. That risks driving them away and ruining our only shot at this."
Chandra scowled, but nodded.
"What about you?" asked Kiora.
"I coordinate," said Jace. "Where everyone is, when to start Nissa's spell, and what to do if it starts going wrong."
"Ah," said Kiora, with distaste. "Leadership."
"No," said Jace. "Leadership is Gideon's job. This is management."
"Even worse," said Kiora.
"One more thing," said Jace. "Once we start doing this, the Eldrazi titans may...change."
"What does that mean?" asked Nissa.
"There's more to their bodies than we see right now, and we're going to be drawing the rest of them into physical space."
Nissa's bright green eyes widened. She understood.
"Meaning?" asked Gideon.
"Meaning they may get, um, bigger," said Jace.
"Bigger?" said Chandra, almost eagerly.
"#emph[May] ?" spat Kiora. "What kind of plan is this?"
"A messy, last-ditch, improvised plan with altogether too many unknowns and if-thens," said Jace. "It's also the only plan we have. Unless you'd like to try to stop us, in which case we can all waste our strength fighting each other and let the Eldrazi eat the whole damned Multiverse."
Kiora stared him down. He stayed completely out of her mind—if she sensed that he was intruding, she'd turn against them.
"Fine," she said. "We'll do this your way. And, mind mage?"
"Yes?"
"If this doesn't work, you'll have me to reckon with."
"I'm sure I will," said Jace. "But if this doesn't work, I doubt you'll need to worry about it."
"Do or die," said Gideon. "I like that." He raised his voice. "We have a plan, and we have the strength and determination to see it to completion. Let's go."
Kiora and Jori left the ravine. Jori gave Jace one last look—was that doubt?—and then she was gone.
Gideon turned to leave, then turned back.
"What the demon said, about killing the telepath first..."
"What about it?"
"I trust you," said Gideon.
Jace put two fingers to his temple and said, in his most ominous mind-mage voice, "I know."
Gideon rolled his eyes, clapped Jace on the shoulder—which he had to know by now Jace didn't care for—and trotted off. Chandra had already left, and Gideon ran to catch up with her.
Jace and Nissa climbed out of the ravine and stared up at the Eldrazi titans—at what they could see of the titans—towering over the floor of the newly drained basin.
"Sir!" barked a voice behind them.
Jace turned to see two squads of soldiers led by a dour human woman. They were irregulars, running in loose formation rather than marching in ranks. They halted in a ragged line in front of the two Planeswalkers and stood at attention.
"Rear guard reporting!" said their captain.
It took Jace a moment to realize that the woman was talking to him. Even in the guise of Ravnica's Living Guildpact, he wasn't accustomed to any great degree of deference.
"Oh," he said. "Uh, as you were."
They stared at him, eyes hard.
"Say something," whispered Nissa.
#emph[You say something] , Jace thought at her.
#emph[I] #emph['m not the one who needs to give them orders once the battle starts.]
Jace surveyed the troops—his troops—and the weight of what they were attempting took on harsh reality. He could explain. He could draw them a diagram, illustrate the metaphysics, haul out his metaphors and calculations.
None of that would inspire them to fight and to die. Not the way—
Well, that was one way to approach the problem.
He swallowed.
"It may not seem like it," he said, "but in a few minutes you're going to be the most important people on this battlefield. In the whole world, in fact."
He gestured.
"This is Nissa," he said, walking along the line. "She'll be binding the titans, and ultimately she'll be the one who kills them. If she goes down, nothing else matters. Plan accordingly."
Eyes widened, jaws set. They understood their task, he was certain of that. But were they actually prepared to perform it?
#emph[What would Gideon say?]
Jace smiled. Of course.
"For Zendikar," he said, raising one fist in the air. It felt thin to him, lacking Gideon's armored fist, his baritone war cry, his iron conviction.
None of that mattered. The soldiers shouted as one voice, holding their weapons aloft.
"For Zendikar!"
Jace turned and faced the titans. In the valley beneath their shadows, amidst multitudes of enemies, friends and allies fanned out, preparing to put his plan into action.
#figure(image("007_Brink of Extinction/07.jpg", width: 100%), caption: [Unity of Purpose | Art by <NAME>], supplement: none, numbering: none)
|
|
https://github.com/lxl66566/my-college-files | https://raw.githubusercontent.com/lxl66566/my-college-files/main/信息科学与工程学院/互联网原理与技术/作业/理论4.typ | typst | The Unlicense | #import "template.typ": *
#import "@preview/tablem:0.1.0": tablem
#show: project.with(
title: "理论 4",
authors: (
"absolutex",
)
)
= P1
考虑下面的网络。
a.显示路由器A中的转发表，使得目的地为主机H3的所有流量都通过接口3转发。
#tablem[
|*匹配*|*操作*|
|---|---|
|Ingress Port = 1 or Ingress Port = 2|Forward(3)|
]
b.你能否写出路由器A中的转发表，使得从H1发往主机H3的所有流量都通过接口3转发，从H2发往主机H3的所有流量都通过接口4转发?（提示：这是一个技巧性的问题。）
#tablem[
|*匹配*|*操作*|
|---|---|
|Ingress Port = 1 |Forward(3)|
|Ingress Port = 2|Forward(4)|
]
= P5
假设将WEQ调度策略应用到一个支持三个类的缓冲区，并假设这三个类的权重分别为0.5、0.25和0.25。
a.假设每个类在缓冲区中有大量的分组。为了获得WFQ权值，这三个类的服务顺序是什么?（对于循环调度，自然顺序是123123123....
#answer[12311231...]
b.假设第1类和第2类在缓冲区中有大量的分组，并且缓冲区中没有第3类分组。为了取得该WTO权重，这三个类应该以什么顺序进行服务?
#answer[121121...]
= P7
再次考虑P6的图。
a.假设采用优先权服务，分组1、4、5、6和11具有最高的优先权，其余分组为低优先权。分别给出分组2到12离开队列的时隙。
#answer[1 4 6 5 2 3 7 11 8 9 10 12]
b.假设采用循环服务，分组1、4、5、6和11属于第1类流量，其余分组属于第2类流量。分别给出分组2到12离开队列的时隙。
#answer[1 2 4 3 6 7 5 8 11 9 10 12]
c.假设采用WFO服务，分组1、4、5、6和11属于第1类流量，其余分组属于第2类流量。第1类的WFQ权重为1，第2类的WFQ权重为2（注意这些权重与上一个问题中的权重不同）。分别给出分组2到12离开队列的时隙。另外，请参阅上述问题中关于WFQ服务的警告。
#answer[1 2 3 4 7 8 6 9 10 5 11 12]
= P8
考虑使用32比特主机地址的某数据报网络。假定一台路由器具有4条链路，编号为0-3.分组能被转发到如下的各链路接口:
#tablem[
|*目的地址范围*|*链路接口*|
|---|---|
|`11100000 00000000 00000000 00000000` - \
`11000000 00111111 11111111 11111111`|0|
|`11100000 01000000 00000000 00000000` - \
`11100000 01000000 11111111 11111111`|1|
|`11100000 01000001 00000000 00000000` - \
`11100001 01111111 11111111 11111111`|2|
|其他|3|
]
a.提供一个具有5个表项的转发表，使用最长前缓匹配，转发分组到正确的链路接口
#tablem[
|*最长前缀匹配*|*链路接口*|
|---|---|
|`11100000 00`|0|
|`11100000 01000000`|1|
|`11100000`|2|
|`11100001 01`|2|
|其他|3|
]
b.描述你的转发表是如何为具有下列目的地址的数据报决定适当的链路接口的。
`11001000 10010001 01010001 01010101`，匹配其他，发3
`11100001 01000000 11000011 00111100`，匹配 `11100001 01`，发 2
`11100001 10000000 00010001 01110111`，匹配其他，发3
= P19
假设你有兴趣检测NAT后面的主机数量。你观察到在每个IP分组上IP层顺序地标出一个标识号。由一台主机生成的第一个IP分组的标识号是一个随机数，后继IP分组的标识号是顺序分配的。假设由NAT后面主机产生的所有IP分组都发往外部。
a.基于这个观察，假定你能够俘获由NAT向外部发送的所有分组，你能概要给出一种简单的技术来检测NAT后面不同主机的数量吗?评估你的答案。
#answer[由于第一个IP分组的标识号是随机的，而后续分组的标识号是顺序分配的，当标识号突然发生跃迁时，可能表示一个新的主机。]
b.如果标识号不是顺序分配而是随机分配的，这种技术还能正常工作吗?评估你的答案。
#answer[因为无法依赖于标识号的顺序性，因此不能正常工作。] |
https://github.com/indicatelovelace/kinave | https://raw.githubusercontent.com/indicatelovelace/kinave/main/0.1.0/lib.typ | typst | /// Helper for matching Mails. This one matches every 'mailto:' link
#let l-mailto() = regex("mailto:.*")
/// Helper for matching Mails. This one is more strict and matches only, if a mail is an address that is structurally correct.
#let l-mailto-strict() = regex("^mailto:.*@.*\..*")
/// Helper to match phone numbers. Note that these are country dependent.
///
/// - region (string): ISO 3166-1 alpha-2 region string. Currently supported are US, DE, FR, GB and limited to non mobile.
#let l-phone(region: "US") = {
if region == "US" {
return regex(`^(?:\+?1)?[-.\s]?\(?\d{3}\)?[-.\s]?\d{3}[-.\s]?\d{4}$`.text)
} else if region == "DE" {
return regex(`^(?:\+?49)?[-.\s]?\(?(?:0|\d{2})\)?[-.\s]?\d{1,5}[-.\s]?\d{1,5}$`.text)
} else if region == "GB" {
return regex(`^(?:\+?44)?[-.\s]?\(?(?:0|\d{2})\)?[-.\s]?\d{1,4}[-.\s]?\d{1,4}[-.\s]?\d{1,4}$`.text)
} else if region == "FR" {
return regex(`^(?:\+?33)?[-.\s]?\(?(?:0|\d{1,2})\)?[-.\s]?\d{1,4}[-.\s]?\d{1,4}[-.\s]?\d{1,4}$`.text)
}
panic("Code invalid or not supported")
//TODO add more regions
}
/// Helper to match urls. Matches any well formed url around the base url. E.g. if base is 'google.com', 'https://google.com/docs' and 'http://google.com:8080' are matched as well.
///
/// - base (string): Base url of a hostname. This does not check the url for legality. Though if it is, only legal urls are matched. By default this matches any url like link. Care that you have to escape any symbols with special meaning (e.g. 'typst.app' #sym.arrow `regex("typst\.app")`)
#let l-url(base: ".*?\..*?") = {
regex(`^(https?://)?(www\.)?`.text + base + `([/][-a-zA-Z0-9@:%._\+~#=]{1,256})?(:\d{1,5})?`.text)
}
/// Array of tuples, consisting of the matcher and corresponding styling function. Care that the order of insertion is the order in which the matchers are evaluated. In practice, this means you should place the more specific matches above more generic ones.
#let link-style = state("now", ())
/// Update the styling array. Entries are inserted. If before and after are none, entries are appended to the end. If a key already exist, the entry is replaced. The order is kept intact.
///
/// - key (regex, string): Matcher for the dest field of th e link function. If the key is a string, it is matched if it is contained. If it is a regex expression, it is matched if the expression produces at least one match.
/// - value (function): A function that takes content and returns content.
/// - before (regex, string): Insert before another key. Excludes after.
/// - after (regex, string): Insert after another key. Excludes before.
/// -> none
#let update-link-style(key: none, value: none, before: none, after: none) = {
if before != none and after != none {
panic("before and after exclude each other!")
}
link-style.update(arr => {
let i = arr.map(e => e.at(0)).position(it => it == key)
if i == none {
if before != none {
let i = arr.map(e => e.at(0)).position(it => it == before)
if i == none {
panic("before key does not exist")
}
arr.insert(i, (key, value))
} else if after != none {
let i = arr.map(e => e.at(0)).position(it => it == after)
if i == none {
panic("after key does not exist")
}
if arr.len() == i {
arr.push((key, value))
} else {
arr.insert(i + 1, (key, value))
}
} else {
arr.push((key, value))
}
} else {
let f = arr.remove(i)
arr.insert(i, (key, value))
}
arr
})
none
}
/// Removes an entry from the link-style array, if it exists.
///
/// - key (regex, string): Matcher for the dest field of th e link function. If the key is a string, it is matched if it is contained. If it is a regex expression, it is matched if the expression produces at least one match.
/// -> none
#let remove-update-style(key: none) = {
link-style.update(arr => {
let i = arr.map(e => e.at(0)).position(it => it == key)
if i != none {
arr.remove(i)
}
arr
})
}
/// Function for creating applying the link-style.
///
/// - body (content): The document body.
#let make-link(body) = {
show link: it => {
context {
let state = link-style.final()
if type(it.dest) == "string" {
for p in state {
let match = p.at(0)
let match-type = type(match)
if match-type == "string" and it.dest.contains(match) {
return p.at(1)(it.body)
} else if match-type == "regex" {
if it.dest.match(match) != none {
return p.at(1)(it.body)
}
}
}
}
it
}
}
body
}
|
|
https://github.com/Bi0T1N/typst-iconic-salmon-svg | https://raw.githubusercontent.com/Bi0T1N/typst-iconic-salmon-svg/main/README.md | markdown | MIT License | # [Social Media References based on Scalable Vector Graphics (SVG) Icons for Typst](https://github.com/Bi0T1N/typst-iconic-salmon-svg)
The `iconic-salmon-svg` package is designed to help you create your curriculum vitae (CV). It allows you to easily reference your social media profiles with the typical icon of the service plus a link to your profile.
The package name is a combination of the acronym *SociAL Media icONs* and the word *iconic* because all these icons have an iconic design (and iconic also contains the word *icon*).
## Features
- Support for popular social media, developer and career platforms
- Uniform design for all entries
- Based on publicly available SVG symbols
- Easy to use
- Allows the customization of the look (extra args are passed to [`text`](https://typst.app/docs/reference/text/text/))
## Usage
### Using Typst's package manager
You can install the library using the [typst packages](https://github.com/typst/packages):
```typst
#import "@preview/iconic-salmon-svg:1.0.0": *
```
### Install manually
Put the `iconic-salmon-svg.typ` file in your project directory and import it:
```typst
#import "iconic-salmon-svg.typ": *
```
### Minimal Example
```typst
// #import "@preview/iconic-salmon-svg:1.0.0": github-info, gitlab-info
#import "iconic-salmon-svg.typ": github-info, gitlab-info
This project was created by #github-info("Bi0T1N"). You can also find me on #gitlab-info("GitLab", rgb("#811052"), url: "https://gitlab.com/Bi0T1N").
```
### Examples
See the [`examples.typ`](examples/examples.typ) file for a complete example. The [generated PDF files](examples/) are also available for preview.
## Contribution
Feel free to open an issue or a pull request if you find any problems or have any suggestions.
## License
This library is licensed under the MIT license. Feel free to use it in your project.
## Trademark Disclaimer
Product names, logos, brands and other trademarks referred to in this project are the property of their respective trademark holders.
These trademark holders are not affiliated with this Typst library, nor are the authors officially endorsed by them, nor do the authors claim ownership of these trademarks.
|
https://github.com/typst-community/harbinger | https://raw.githubusercontent.com/typst-community/harbinger/main/lib.typ | typst | MIT License | #import "src/shadow-box.typ": shadow-box
#import "src/fast-shadow-box.typ": fast-shadow-box
|
https://github.com/TC-Fairplay/member-listing | https://raw.githubusercontent.com/TC-Fairplay/member-listing/main/junioren-b.typ | typst | MIT License | #import "members-list.typ": members-list
#show: doc => members-list("junioren_b.csv", "B", doc)
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/fletcher/0.4.1/src/shapes.typ | typst | Apache License 2.0 | #import "@preview/cetz:0.2.0" as cetz: draw, vector
#let diamond(node, extrude, scale: 1.5) = {
let (w, h) = node.size
let φ = calc.atan2(w/1pt, h/1pt)
let x = w/2*scale + extrude/calc.sin(φ)
let y = h/2*scale + extrude/calc.cos(φ)
draw.line(
(-x, 0pt),
(0pt, -y),
(+x, 0pt),
(0pt, +y),
close: true,
)
}
#let pill(node, extrude) = {
let size = node.size.map(i => i + 2*extrude)
draw.rect(
vector.scale(size, -0.5),
vector.scale(size, +0.5),
radius: calc.min(..size)/2,
)
}
#let parallelogram(node, extrude, angle: 20deg) = {
let (w, h) = node.size
let (x, y) = (w/2 + extrude*calc.cos(angle), h/2 + extrude)
let δ = h/2*calc.tan(angle)
let μ = extrude*calc.tan(angle)
draw.line(
(-x - μ, -y),
(+x - δ, -y),
(+x + μ, +y),
(-x + δ, +y),
close: true,
)
}
#let hexagon(node, extrude, angle: 30deg) = {
let (w, h) = node.size
let (x, y) = (w/2 , h/2 + extrude)
let δ = y*calc.tan(angle)
x += extrude*calc.tan(45deg - angle/2)
draw.line(
(-x, -y),
(+x, -y),
(+x + δ, 0pt),
(+x, +y),
(-x, +y),
(-x - δ, 0pt),
close: true,
)
}
#let house(node, extrude, angle: 10deg) = {
let (w, h) = node.size
let (x, y) = (w/2 + extrude, h/2 + extrude)
let a = h/2 + extrude*calc.tan(45deg - angle/2)
let b = h/2 + w/2*calc.tan(angle) + extrude/calc.cos(angle)
draw.line(
(-x, -y),
(-x, a),
(0pt, b),
(+x, a),
(+x, -y),
close: true,
)
}
|
https://github.com/MoserGitHub/qmd_ctutypst | https://raw.githubusercontent.com/MoserGitHub/qmd_ctutypst/main/_extensions/CTU-Bern/qmd_ctutypst/typst-show.typ | typst | #show: ctu_typst_template.with(
$if(title)$
title: "$title$",
$endif$
$if(subtitle)$
subtitle: "$subtitle$",
$endif$
$if(projectno)$
projectno: "$projectno$",
$endif$
$if(toc)$
toc: $toc$,
$endif$
$if(paper-size)$
paper-size: "$paper-size$",
$endif$
$if(logo)$
logo: "$logo$",
$endif$
$if(logo_size)$
logo_size: $logo_size$,
$endif$
$if(logo_size2)$
logo_size2: $logo_size2$,
$endif$
$if(by-author)$
author: (
$for(by-author)$
$if(it.name.literal)$
( name: [$it.name.literal$],
affiliation: [$for(it.affiliations)$$it.name$$sep$, $endfor$],
email: [$it.email$] ),
$endif$
$endfor$
),
$endif$
$if(heading)$
$if(heading-numbering)$
heading-numbering: "$heading-numbering$",
$endif$
$else$
heading-numbering: none,
$endif$
$if(project_type)$
project_type: "$project_type$",
$else$
project_type: "DCR project",
$endif$
)
|
|
https://github.com/ChristophVanDeest/FH-Kiel-Typst-Template | https://raw.githubusercontent.com/ChristophVanDeest/FH-Kiel-Typst-Template/main/lib/pages/declaration_of_independent_processing.typ | typst | MIT License | #import "../translations.typ": translations
#let declaration_of_independent_processing() = {
heading(
outlined: true,
numbering: none,
bookmarked: true,
translations.declaration-of-independent-processing,
)
text(translations.declaration-of-independent-processing-content)
v(40pt)
grid(
columns: 3,
gutter: 10pt,
line(length: 85pt, stroke: 1pt),
line(length: 85pt, stroke: 1pt),
line(length: 150pt, stroke: 1pt),
align(center, text(translations.place, size: 9pt)),
align(center, text(translations.date, size: 9pt)),
align(center, text(translations.signature, size: 9pt)),
)
} |
https://github.com/university-makino/Microcomputer-control-and-exercises | https://raw.githubusercontent.com/university-makino/Microcomputer-control-and-exercises/master/report/プレレポート2/report.typ | typst | //フォント設定//
#let gothic = "Hiragino Kaku Gothic Pro"
//本文フォント//
#set text(11pt, font: gothic, lang: "ja")
//タイトル・見出しフォント//
#set heading(numbering: "1.1")
#let heading_font(body) = {
show regex("[\p{scx: Han}\p{scx: Hira}\p{scx: Kana}]"): set text(font: gothic)
body
}
#show heading: heading_font
// ページ設定 //
#set page(
paper: "a4",
margin: (x: 25mm, y: 25mm),
columns: 1,
//fill: 背景色,
numbering: "1",
number-align: center,
header: [
#set text(8pt)
]
)
//タイトルページここから//
#align(right, text()[
#text[提出日]#datetime.today().display("[year]年[month]月[day]日")
])
#v(150pt)
#align(center, text(30pt)[
#heading_font[*プレ・レポート2*]
])
// #align(center, text(14pt)[
// #heading_font[*サブタイトル*]
// ])
#v(1fr)
#align(right)[
#table(
columns:(auto, auto),
align: (right, left),
stroke: none,
[講義名],[マイコン制御および演習],
[担当教員],[伊藤 暢浩先生],
[],[],
[学籍番号],[k22120],
[所属],[情報科学部 情報科学科],
[学年],[3年],
[氏名],[牧野遥斗]
)
]
#pagebreak()
//本文ここから//
= プレ・レポート（課題 2）
== @DistanceSensor の電子部品 ( 距離センサ GP2Y0A21YK0F) を次のような点から調べなさい。
#figure(
image("./img/距離センサ.png",width: 50%),
caption: "距離センサ"
)<DistanceSensor>
=== どのような部品か
シャープの赤外線を使用した測距モジュールである。赤外線LEDとPSD(position sensitive detector)を使用して、非接触で距離を検出することができる@distance_sensor_akituki 。
=== どのような仕組みか
発光側の赤外光が物体に反射して受光すると距離に応じて出力電圧が変化する。この出力電圧で距離を検出することができる。測定距離を測る方法はPDS方式を採用している。PSD方式は三角測量の要領で距離を検出するもので @PSD のように発光素子から出た光が対象物に当たって戻ってきた反射光を検出する。対象物が近いとPSDへの光の入射角度は大きく、逆に遠いと入射角度は小さくなる。この角度の違いで出力電圧が変化するため、距離の情報を得ることができる@national_university_infrared_sensor 。
#figure(
image("./img/PSD.png",width: 50%),
caption: "PSD方式"
)<PSD>
=== どのような入力を取り扱うのか
距離センサーから出力された光を受光し、その出力電圧を取り扱う。
出力電圧は距離に応じて変化する。
=== 入力に応じて出力がどう変化するのか (データシートや仕様書を参考に)
SHARPのデータシートによると、以下のような特性がある@distance_sensor_datasheet 。
@distance_sensor_chart をみると、38.3ms±9.6ms毎に出力電圧を出力する。
最初のタイミングは測定をされていないため、不安定な値を出力されるが、2回目以降は安定した値を出力する。
#figure(
image("./img/距離センサタイミングチャート.png",width: 75%),
caption: "距離センサタイミングチャート"
)<distance_sensor_chart>
出力電圧は距離に応じて変化する。距離が近いほど出力電圧は大きくなり、遠いほど小さくなる。距離と出力電圧の関係は @distance_sensor_output に示す。
グラフは比例関係ではなく、反比例な関係がある。
しかし、距離が近すぎるとうまく測定をすることができないため注意が必要である。
#figure(
image("./img/距離センサー距離測定特性.png",width: 75%),
caption: "距離センサ距離測定特性"
)<distance_sensor_output>
=== どのようなピンアサイン (各ピンの役割) か
SHARPのデータシートによると、以下のものを扱う@distance_sensor_datasheet 。
+ 出力電圧
+ GND
+ Vcc (5V 電源電圧)
#figure(
grid(
columns: 2,
image("./img/距離センサーピンアサイン1.png",width: 75%),
image("./img/距離センサーピンアサイン2.png",width: 75%)
),
caption: "距離センサーのピンアサイン"
)<distance_sensor_pin>
=== 正しい動作の条件，範囲は何か
秋月電子のサイトによると、以下のような仕様がある @distance_sensor_akituki 。
- 電源電圧min. : 4.5V
- 電源電圧max. : 5.5V
- 測定距離min. : 0.1m
- 測定距離max. : 0.8m
- 測定方式 : 赤外線PSD
- 測定項目 : 距離
- インターフェイス : アナログ
- 動作温度min. : -10℃
- 動作温度max. : 60℃
- 長辺 : 44.5mm
- 短辺 : 13.5mm
- 高さ : 18.9mm
#pagebreak() // ページを分ける
== @PressureSensor の電子部品 ( 感圧センサ ALPHA-MF01-N221-A01 ) を次のような点から調べなさい。
#figure(
image("./img/感圧センサ.png",width: 50%),
caption: "感圧センサ"
)<PressureSensor>
=== どのような部品か
圧力を加えることによって抵抗値が変わるセンサ。圧力を加えていないときの抵抗値は20MΩ以上だが、圧力を加えることにより抵抗値が下がる。センサ部分は円形で、感圧エリアは直径約1.5センチである@pressure_sensor_marutsu 。
=== どのような仕組みか
圧力センサは、受圧部にダイヤフラムを設けており、ダイヤフラムの表面上に歪みゲージを形成している。ダイヤフラムは圧力を受けることにより変形する。これを利用し、この物理的な歪みにより生じる抵抗変化を電気信号に変換して圧力を検知・計測を行う @pressure_sensor_nidec 。
@PressureSensorDiaphragmCrossSection では、ダイヤフラムの断面図を示している。
#figure(
image("./img/感圧センサダイヤフラムの断面図.png",width: 50%),
caption: "ダイヤフラムの断面図"
)<PressureSensorDiaphragmCrossSection>
=== どのような入力を取り扱うのか
圧力センサは、圧力を入力として取り扱う。
=== 入力に応じて出力がどう変化するのか (データシートや仕様書を参考に)
ALPHAさんのデータシートには特に特性グラフなどが書かれていないため、特性については不明である。
しかし、基本的には圧力を加えることによって抵抗値が変化するため、圧力が大きいほど抵抗値が小さくなると考えられる。
また、基本の抵抗値は20MΩ以上である。
=== どのようなピンアサイン (各ピンの役割) か
感圧センサは、抵抗器の一つと読み取ることができるため、特に極性などはないが、2つの端子を使用して、抵抗値を読み取ることができる。マルツのサイトによると、以下のようなピンアサインがある @pressure_sensor_alpha 。
@PressureSensorPin では、感圧センサのピンアサインを示している。
#figure(
image("./img/感圧センサピンアサイン.png",width: 50%),
caption: "感圧センサのピンアサイン"
)<PressureSensorPin>
=== 正しい動作の条件，範囲は何か
マルツのサイトによると、以下のような仕様がある @pressure_sensor_marutsu 。
- 感圧レンジ : 約30~1000g(0.3~9.8N)
- 感圧エリア : 直径14.7mm
- 測定誤差 : ±5%(同一製品間誤差±20%)
- 基本抵抗値 : 20MΩ以上
- 反応速度 : ~1ms
- 動作温度 : -20℃〜+70℃
- 製品寿命 : 100万回
#pagebreak() // ページを分ける
== @PhotoReflector の電子部品 ( フォトリフレクタ RPR-220) を次のような点から調べなさい。
#figure(
image("./img/フォトリフレクタ.png",width: 50%),
caption: "フォトリフレクタ"
)<PhotoReflector>
=== どのような部品か
フォトリフレクタとは、高出力赤外線発光ダイオードから放出された光を物体に反射させ、フォトトランジスタで受光することで出力電流が変化する光センサである@photo_reflector_akituki 。
=== どのような仕組みか
発光素子の発光面と受光素子の受光面が同一方向になるように取りつけられている。検出物体が光路を通過すると、発光面を出た光が検出物体にあたり、そこからの反射光が受光素子に照射され、受光素子の受光量が変化するようになっている @photo_reflector_omron。
フォトリフレクタの仕組みと原理は @PhotoReflectorPrinciple に示す。
#figure(
image("./img/フォトリフレクタの仕組みと原理.png",width: 50%),
caption: "フォトリフレクタの仕組みと原理"
)<PhotoReflectorPrinciple>
=== どのような入力を取り扱うのか
フォトリフレクタから出力される光を受光し、その出力電流を取り扱う。
反射されるまでの距離によって出力電流が変化する。
=== 入力に応じて出力がどう変化するのか (データシートや仕様書を参考に)
@PhotoReflectorOutput では、フォトリフレクタの相対出力距離特性を示している @photo_reflector_datasheet。
6mmを最大値として、山形の波形をしている。
距離が遠くなるとなるほど出力電流が小さくなる。
また、近すぎると出力電流が小さくなるため、適切な距離を保つことが重要である。
近すぎる場合、フォトリフレクタのフレームによって光が遮られるためだと考えられる。
#figure(
image("./img/フォトリフレクタの相対出力距離特性.png",width: 50%),
caption: "フォトリフレクタの相対出力距離特性"
)<PhotoReflectorOutput>
=== どのようなピンアサイン (各ピンの役割) か
データシートより、以下のようなピンアサインがある @photo_reflector_datasheet 。
- アノード
- カソード
- コレクタ
- エミッタ
アノードからカソードに向かい5Vを加え、光が受講部にあたるとコレクタからエミッタに向かって電流が流れる。このとき、コレクタからエミッタに流れる電流が光の反射によって変化する。
#figure(
image("./img/フォトリフレクタピンアサイン.png",width: 50%),
caption: "フォトリフレクタピンアサイン"
)<PhotoReflectorPin>
=== 正しい動作の条件，範囲は何か
秋月電子のサイトによると、以下のような仕様がある @photo_reflector_akituki 。
- 種別:リフレクタ
- 順電圧:1.34V
- 順電流max.:50mA
- 逆電圧:5V
- 逆電流:10μA
- 許容損失max.:80mW
- 暗電流:0.5μA
- コレクタエミッタ間電圧:30V
- エミッタコレクタ間電圧:4.5V
- コレクタ損失max.:80mW
- コレクタ電流:30mA
- コレクタエミッタ飽和電圧:0.3V
- 上昇応答時間:10μs
- 下降応答時間:10μs
- 動作温度min.:-25℃
- 動作温度max.:85℃
- 実装タイプ:スルーホール
- 長辺:6.4mm
- 短辺:4.9mm
- 高さ:6.5mm
#pagebreak() // ページを分ける
// bibファイルの指定 //
#bibliography("./bibliography.bib")
|
|
https://github.com/spewwerrier/hut | https://raw.githubusercontent.com/spewwerrier/hut/master/readme.md | markdown | Typst is comfy. This took way less work than I imagined.
```
typst compile hut.typ
typst compile hut.typ --format png hut-{n}.png
```
|
|
https://github.com/dismint/docmint | https://raw.githubusercontent.com/dismint/docmint/main/networks/pset9.typ | typst | #import "template.typ": *
#show: template.with(
title: "14.15 PSET 9",
subtitle: "<NAME>",
pset: true,
)
= Problem 1
== (a)
*No*, it is not the case that the prices are not market-clearing. In order for this to be the case, it would have to be that the price each buyer receives is adequate enough for them to prefer the good. We can see that at a price of $1$, both $x$ and $z$ will choose $c$ over the other choices, thus the set of prices overall is not market-clearing.
== (b)
Suppose we run a bipartite graph auction procedure. I will show what happens at the end of each round in terms of pricing during the auction, as well as the final price at the end of the procedure. I will use the hint and choose a reasonable constricted set.
=== Round 1
*Price*: $a=0, b=0, c=0$
*Payoffs*
/ $x$: $(7, 7, 7)$
/ $y$: $(7, 6, 3)$
/ $z$: $(5, 4, 3)$
$(y, z)$ is constricted since they both prefer $a$
=== Round 2
*Price*: $a=1, b=0, c=0$
*Payoffs*
/ $x$: $(6, 7, 7)$
/ $y$: $(6, 6, 3)$
/ $z$: $(4, 4, 3)$
We can see here that no possible buyer set is constricted and thus we have the following final assignments of:
$a => z, b => y, c => x$
= Problem 2
== (a)
The equation that shows the optimal response for firm $i$ is as follows:
$ (q_i (1 - q_i - q_j)) $
Taking the derivative with respect to $q_i$ yields the optimality equation of:
$ 1 - 2 q_i - q_j = 0 $
Thus the firm has the best response when $q_i = (1 - q_j) / 2$. The solution for the best values of $q$ are therefore:
$ q_1 = q_2 = 1 / 3 $
This is the unique solution to the PNSE since it follows logically from the optimization equation, and it is mathematically only one solution. The reason we are able to use this type of equation in the first place to model an optimal response is because the payoff if $i$ is concave with relation to $q_i$, thus we can use the aforementioned equation to find the solutions, yielding the one solution we found.
== (b)
Using part of the answer from above where we found the best response relation, as well as the fact that firm $2$ will best respond, our new equation is:
$ q_1 (1 - q_1 - (1 - q_1) / 2) $
Again we take the derivative with respect to $q_1$ to find the optimal response:
$ 1 / 2 - q_1 $
Therefore firm $1$ should choose $q_1 = 1 / 2$ and firm $2$ should choose $q_2 = (1 - q_1) / 2 = 1 / 4$
== (c)
The idea of a first-movers advantage exists because allowing firm $1$ to move first means they can choose the optimal response of $1 / 2$ paired with $1 / 4$ from firm $2$. This same kind of logic does not work otherwise, because when firm $2$ does not consider firm $1$, then the optimal value of $q_1$ would deviate to a slightly lower value.
= Problem 3
== (a)
I will show that neither choice has a particular advantage of profit for the seller.
If we assume that the seller accepts, they will get an immediate payoff of:
$ delta_S (1 / 2 p_S + 1 / 2 p_B) $
Suppose instead that they decline, meaning control is over to the buyer with $1 / 2$ chance. Similarly, it then becomes the sellers turn, where control is handed over with a $1 / 2$ chance as well. Thus we end up with the same payoff of:
$ delta_S (1 / 2 p_S + 1 / 2 p_B) $
Therefore there is no deviation for the seller that benefits them more for either choice.
== (b)
Again, this will follow a similar logical progression as the previous part. If the buyer accepts, then their expected payoff is:
$ (1 - p_S) $
Now suppose that the buyer declines, meaning we move to the seller. This happens with probability $1 / 2$, where either it shifts to the buyer again with probability $1 / 2$ or remains with the seller. The prices offered are $p_B$ and $p_S$ respectively. Thus the expected payoff is:
$ delta_B (1 - 1 / 2 p_S - 1 / 2 p_B) $
Which is the exact same as the $(1 - p_S)$ we found earlier as given in the problem statement. Thus once again, there is no deviation for the buyer that benefits them more for either choice.
== (c)
Let us look at the two mentioned equations in *(a)* and *(b)*, and solve for the price of the buyer and seller respectively. We have:
$
p_B &= delta_S (1 / 2 p_S + 1 / 2 p_B)\
1 - p_S &= delta_B (1 - 1 / 2 p_S - 1 / 2 p_B)
$
Solving the system of equations give us the following relative solutions:
$
p_S &= ((2 - delta_S) dot (1 - delta_B)) / (2 - delta_S - delta_B)\
p_B &= (delta_S dot (1 - delta_B)) / (2 - delta_S - delta_B)
$
Therefore we can obviously conclude that $p_B < p_S$, and therefore it must be the case that the advantage of being the first mover is larger. This makes sense, because even if you make an offer now, there is still a chance you can make an offer later, meaning you will always have a marginal advantage as a first mover.
= Problem 4
== Left Graph
In this graph, all nodes are perfectly matched, thus we expect that the payoff of every single node is the same at $boxed(0.5)$
== Right Graph
In this graph, we can see that the bottom left seller is over-demanded, meaning its payoff will be $1$. No other seller is over-demanded, as every single person they sell to has at least one other option to buy from. Thus the payoff of every other seller is $0$
The buyers follow a very similar pattern, with the two rightmost buyers being over-demanded, and thus their payoff is $1$. The other buyers have only one other option to buy from, and thus their payoff is $0$
Thus the top row of buyers from left to right has payoff $boxed((0, 0, 1, 1))$
Thus the bottom row of sellers from left to right has payoff $boxed((1, 0, 0, 0))$
|
|
https://github.com/remigerme/typst-polytechnique | https://raw.githubusercontent.com/remigerme/typst-polytechnique/main/cover.typ | typst | MIT License | /***********************/
/* TEMPLATE DEFINITION */
/***********************/
/* HANDLING DATE DISPLAY */
#let translate_month(month) = {
// Construction mapping for months
let t = (:)
let fr-month-s = ("Janv.", "Févr.", "Mars", "Avr.", "Mai", "Juin",
"Juill.", "Août", "Sept.", "Oct.", "Nov.", "Déc.")
let fr-months-l = ("Janvier", "Février", "Mars", "Avril", "Mai", "Juin",
"Juillet", "Août", "Septembre", "Octobre", "Novembre", "Décembre")
for i in range(12) {
let idate = datetime(year: 0, month: i + 1, day: 1)
let ml = idate.display("[month repr:long]")
let ms = idate.display("[month repr:short]")
t.insert(ml, fr-months-l.at(i))
t.insert(ms, fr-month-s.at(i))
}
// Translating month
let fr_month = t.at(month)
fr_month
}
#let display-date(date, short-month) = {
context {
// Getting adapted month string
let repr = if short-month { "short" } else { "long" }
let month = date.display("[month repr:" + repr + "]")
// Translate if necessary
if text.lang == "fr" {
month = translate_month(month)
}
// Returns month and year
[#month #str(date.year())]
}
}
/* MAIN COVER DEFINITION */
#let cover(title, author, date-start, date-end, subtitle: none, logo: none, short-month: false, logo-horizontal: true) = {
set page(background: move(dx: 0pt, dy: -13%, image("assets/armes.svg")))
set text(font: "New Computer Modern Sans", hyphenate: false, fill: rgb(1, 66, 106))
set align(center)
v(1.8fr)
set text(size: 24pt, weight: "bold")
upper(title)
v(1.5fr)
if subtitle != none {
set text(size: 20pt)
subtitle
}
v(1.5fr)
set text(size: 18pt, weight: "regular")
display-date(date-start, short-month); [ \- ]; display-date(date-end, short-month)
image("assets/filet-court.svg")
set text(size: 16pt)
smallcaps(author)
v(1fr)
let logo-height = if (logo-horizontal) { 20mm } else { 30mm }
let path-logo-x = if (logo-horizontal) { "assets/logo-x-ip-paris.svg" } else { "assets/logo-x.svg" }
set image(height: logo-height)
grid(
columns: (1fr, 1fr), align: center + horizon,
if (logo != none) { logo } else { smallcaps("Insert your logo") },
image(path-logo-x)
)
}
/********************/
/* TESTING TEMPLATE */
/********************/
#set text(lang: "fr")
#cover(
[A very long title over multiple lines automatically],
"<NAME>",
datetime.today(),
datetime.today(),
subtitle: "Je n'ai pas de stage mais je suis détendu",
logo-horizontal: true,
)
|
https://github.com/0x1B05/algorithm-journey | https://raw.githubusercontent.com/0x1B05/algorithm-journey/main/practice/note/content/并查集.typ | typst | #import "../template.typ": *
#pagebreak()
= 并查集
并查集的使用是如下的场景
1）一开始每个元素都拥有自己的集合，在自己的集合里只有这个元素自己 2）`find(i)`：查找i所在集合的代表元素，代表元素来代表i所在的集合
3）`boolean isSameSet(a, b)`：判断a和b在不在一个集合里 4）`void union(a, b)`：a所在集合所有元素
与 b所在集合所有元素 合并成一个集合 5）各种操作单次调用的均摊时间复杂度为O(1)
#tip(
"Tip",
)[
并查集时间复杂度的理解: 作为如此简单、小巧的结构，
感性理解单次调用的均摊时间复杂度为O(1)即可，其实为α(n)，阿克曼函数。
当n=10^80次方即可探明宇宙原子量，α(n)的返回值也不超过6，那就可以认为是O(1)
并查集的发明者<NAME>和<NAME>，从1964年证明到1989年才证明完毕，建议记住即可，理解证明难度很大！
]
并查集的两个优化，都发生在`find`方法里
1）扁平化（一定要做） 2）小挂大（可以不做，原论文中是秩的概念，可以理解为
粗略高度 或者 大小）
== 并查集模板
=== #link(
"https://www.nowcoder.com/practice/e7ed657974934a30b2010046536a5372",
)[ 数组实现 ]
给定一个没有重复值的整形数组`arr`，初始时认为`arr`中每一个数各自都是一个单独的集合。请设计一种叫`UnionFind`的结构，并提供以下两个操作。
- `boolean isSameSet(int a, int b)`: 查询a和b这两个数是否属于一个集合
- `void union(int a, int b)`:
把a所在的集合与b所在的集合合并在一起，原本两个集合各自的元素以后都算作同一个集合
输入描述：
- 第一行两个整数`N`, `M`。分别表示数组大小、操作次数
- 接下来M行，每行有一个整数opt
- 若opt = 1，后面有两个数x, y，表示查询(x, y)这两个数是否属于同一个集合
- 若opt = 2，后面有两个数x, y，表示把x, y所在的集合合并在一起
输出描述： 对于每个`opt = 1`的操作，若为真则输出`Yes`，否则输出`No`
#example("Example")[
输入：
```
4 5
1 1 2
2 2 3
2 1 3
1 1 1
1 2 3
```
输出：
```
No
Yes
Yes
```
说明： 每次2操作后的集合为
```
({1}, {2}, {3}, {4})
({1}, {2, 3}, {4})
({1, 2, 3}, {4})
```
]
#tip("Tip")[
- 1⩽N,M⩽10^6
- 保证1⩽x,y⩽N
]
==== 实现
#code(
caption: [牛客并查集模板],
)[
```java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
/**
* Code01_UnionFindNowCoder
*/
public class Code01_UnionFindNowCoder {
public static int MAXN = 1000001;
// 数组下标代表元素，数据代表所属集合
public static int father[] = new int[MAXN];
public static int size[] = new int[MAXN];
public static int stack[] = new int[MAXN];
public static int N;
public static int M;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StreamTokenizer in = new StreamTokenizer(br);
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
while (in.nextToken() != StreamTokenizer.TT_EOF) {
N = (int) in.nval;
in.nextToken();
for (int i = 0; i < N; i++) {
father[i] = i;
}
M = (int) in.nval;
in.nextToken();
for (int i = 0; i < M; i++) {
int opt = (int) in.nval;
in.nextToken();
int x = (int) in.nval;
in.nextToken();
int y = (int) in.nval;
in.nextToken();
if (opt == 1) {
if (isSameSet(x, y)) {
out.println("Yes");
} else {
out.println("No");
}
} else if (opt == 2) {
union(x, y);
}
}
}
out.flush();
br.close();
out.close();
}
public static int find(int x) {
int path_size = 0;
while(father[x]!=x){
stack[path_size++] = x;
x = father[x];
}
// 扁平化
while(path_size!=0){
int tmp = stack[--path_size];
father[tmp] = x;
}
return x;
}
public static boolean isSameSet(int x, int y) {
return find(x) == find(y);
}
public static void union(int x, int y) {
int root_x = find(x);
int root_y = find(y);
if (root_x != root_y) {
if (size[root_x] <= size[root_y]) {
// x -> y
father[root_x] = father[root_y];
size[root_y] += size[root_x];
} else {
// y -> x
father[root_y] = father[root_x];
size[root_x] += size[root_y];
}
}
}
}
```
]
=== #link("https://www.luogu.com.cn/problem/P3367")[数组实现(省略小挂大优化)]
如题，现在有一个并查集，你需要完成合并和查询操作。
输入格式
第一行包含两个整数 $N,M$ ,表示共有 $N$ 个元素和 $M$ 个操作。 接下来 $M$ 行，每行包含三个整数 $Z_i,X_i,Y_i$ 。
- 当 $Z_i=1$ 时，将 $X_i$ 与 $Y_i$ 所在的集合合并。
- 当 $Z_i=2$ 时，输出 $X_i$ 与 $Y_i$ 是否在同一集合内，是的输出
`Y` ；否则输出 `N` 。
输出格式
对于每一个 $Z_i=2$ 的操作，都有一行输出，每行包含一个大写字母，为 `Y` 或者 `N` 。
#example("Example")[
样例输入
```
4 7
2 1 2
1 1 2
2 1 2
1 3 4
2 1 4
1 2 3
2 1 4
```
样例输出
```
N
Y
N
Y
```
]
#tip(
"Tip",
)[
- 对于 $30\%$ 的数据，$N lt.eq 10$，$M lt.eq 20$。
- 对于 $70\%$ 的数据，$N lt.eq 100$，$M lt.eq 10^3$。
- 对于 $100\%$ 的数据，$1 lt.eq N lt.eq 10^4$, $1lt.eq M lt.eq 2 * 10^5$, $1 lt.eq X_i, Y_i lt.eq N$, $Z_i \in \{ 1, 2 \}$。
]
==== 实现
#code(
caption: [洛谷并查集模板],
)[
```java
public class Code02_UnionFindLuogu {
public static int MAXN = 10001;
public static int[] father = new int[MAXN];
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StreamTokenizer in = new StreamTokenizer(br);
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
while (in.nextToken() != StreamTokenizer.TT_EOF) {
int N = (int) in.nval;
in.nextToken();
for (int i = 0; i < N; i++) {
father[i] = i;
}
int M = (int) in.nval;
in.nextToken();
for (int i = 0; i < M; i++) {
int Z = (int) in.nval;
in.nextToken();
int X = (int) in.nval;
in.nextToken();
int Y = (int) in.nval;
in.nextToken();
if (Z == 1) {
union(find(X), find(Y));
} else if (Z == 2) {
out.println(isSameSet(X, Y)?"Y":"N");
}
}
}
out.flush();
out.close();
br.close();
}
public static int find(int x) {
if(x!=father[x]){
father[x] = find(father[x]);
}
return father[x];
}
public static boolean isSameSet(int x, int y) {
return find(x) == find(y);
}
public static void union(int x, int y) {
int root_x = find(x);
int root_y = find(y);
if (root_x != root_y) {
father[root_x] = father[root_y];
}
}
}
```
]
=== 链表实现
分析:
1. 假设用链表实现,`union`需要 O(1)而`isSameSet`需要 O(n)
2. 假设用哈希表实现,`isSameSet`需要 O(1)而`union`需要 O(n)
问题:如何实现`isSameSet`和`union`都是 O(1)
```java
import java.util.HashMap;
import java.util.List;
import java.util.Stack;
public class UnionFind {
//样本进来会包一层，叫做元素
public static class Element<V>{
public V value;
public Element(V value){
this.value = value;
}
}
public static class UnionFindSet<V>{
public HashMap<V,Element<V>> elementMap;
//key 某个元素 value 该元素的父亲
public HashMap<Element<V>,Element<V>> fatherMap;
//key 某个集合的代表元素，value 该集合的大小
public HashMap<Element<V>,Integer> sizeMap;
public UnionFindSetInit(List<V> list){
elementMap = new HashMap<>();
fatherMap = new HashMap<>();
sizeMap = new HashMap<>();
for (V value : list) {
Element<V> element = new Element<V>(value);
elementMap.put(value,element);
fatherMap.put(element,element);
sizeMap.put(element,1);
}
}
//给定一个ele，往上一直找，将代表元素返回
private Element<V> findHead(Element<V> element){
// path用来存放向上查找的路径
Stack<Element<V>> path = new Stack<>();
while (element != fatherMap.get(element)){ // 父是自己为止.
path.push(element);
element = fatherMap.get(element);
}
//将遍历的整条链的父都设置为找到的代表元素
//即将其扁平化(向上找优化)
while (!path.isEmpty()){
fatherMap.put(path.pop(),element); // 把途径的元素都直接放在根的下面
}
return element;
}
public boolean isSameSet(V a,V b){
if(elementMap.containsKey(a) && elementMap.containsKey(b)){
return findHead(elementMap.get(a)) == findHead(elementMap.get(b));
}
return false;
}
public void union(V a,V b){
if(elementMap.containsKey(a) && elementMap.containsKey(b)){
Element<V> aF = findHead(elementMap.get(a));
Element<V> bF = findHead(elementMap.get(b));
if(aF != bF){
Element<V> big = sizeMap.get(aF) >= sizeMap.get(bF) ? aF : bF;
Element<V> small = big == aF ? bF : aF;
fatherMap.put(small,big);
sizeMap.put(big,sizeMap.get(aF) + sizeMap.get(bF));
sizeMap.remove(small);
}
}
}
}
}
```
#tip("Tip")[
`findHead()`用的次数越多则空间复杂度越低,当逼近 O(n)次或大于
O(n)次,可以认为并查集在 O(1)内实现了`isSameSet`,`union`
]
== 题目
=== #link("https://leetcode.cn/problems/couples-holding-hands/")[题目1: 情侣牵手]
`n` 对情侣坐在连续排列的 `2n` 个座位上，想要牵到对方的手。
人和座位由一个整数数组 `row` 表示，其中 `row[i]` 是坐在第 `i` 个座位上的人的
ID。情侣们按顺序编号，第一对是 `(0, 1)`，第二对是 `(2, 3)`，以此类推，最后一对是 `(2n-2, 2n-1)`。
返回 *最少交换座位的次数*，以便每对情侣可以并肩坐在一起。
每次交换可选择任意两人，让他们站起来交换座位。
#example("Example")[
- 输入: `row = [0,2,1,3]`
- 输出: `1`
- 解释: 只需要交换`row[1]`和`row[2]`的位置即可。
]
#tip("Tip")[
- 2n == row.length
- 2 <= n <= 30
- n 是偶数
- 0 <= row[i] < 2n
- row 中所有元素均无重复
]
=== 解答
混在一起的情侣有`k`对，那就要交换`k-1`次.(必然有一个出走来成全其他的所有情侣。)
#three-line-table[
|couple ID|couple| | - | - | |0 | 0 1| |1 | 2 3| |2 | 3 4| |3 | 4 5| |4 | 5 6|
]
couple ID = ID/2
#example("Example")[
row = [6,0,8,9,1,7,3,4,5,2]
算法：
```
ID : 6,0|8,9|1,7|3,4|5,2
couple ID: 3,0|4,4|0,3|1,2|2,1
```
集合{0, 3}(交换1次), {1, 2}(交换1次), {4} -> 2次
]
#example("Example")[
row = [6,0,1,5,2,3,8,4,7,9]
算法：
```
ID : 6,0|1,5|2,3|8,4|7,9
couple ID: 3,0|0,2|1,1|4,2|3,4
```
集合{0, 2, 3, 4}(交换3次), {1}(交换0次) -> 3次
怎么换？举例让0出走(每次出走都要成全一对)
```
6,0|1,5|2,3|8,4|7,9
3,0|0,2|1,1|4,2|3,4
7,6|1,5|2,3|8,4|0,9
3,3|0,2|1,1|4,2|0,4
7,6|1,5|2,3|0,4|8,9
3,3|0,2|1,1|0,2|4,4
7,6|0,1|2,3|5,4|8,9
3,3|0,0|1,1|2,2|4,4
```
]
#tip("Tip")[
集合大小大于2，每次出走只能成全一对(像个循环链表)，除了最后一次，其他情况不可能一次成全两对，否则集合只会是2。
]
优化:
一共n个人，假设有三个集合大小分别为a,b,c
- 最终的交换次数实际上是(a-1)+(b-1)+(c-1)=a+b+c-3
- 故而实际上就是`情侣对数-集合数`
#code(caption: [题目1: 情侣牵手])[
```java
public class Code03_CouplesHoldingHands {
public static int minSwapsCouples(int[] row) {
int n = row.length;
build(n / 2);
for (int i = 0; i < n; i += 2) {
union(row[i] / 2, row[i + 1] / 2);
}
return n / 2 - setNum;
}
public static int MAXN = 31;
public static int[] couple = new int[MAXN];
public static int setNum;
public static void build(int m) {
for (int i = 0; i < m; i++) {
couple[i] = i;
}
setNum = m;
}
public static int find(int i) {
if (i != couple[i]) {
couple[i] = find(couple[i]);
}
return couple[i];
}
public static void union(int x, int y) {
int fx = find(x);
int fy = find(y);
if (fx != fy) {
couple[fx] = fy;
setNum--;
}
}
}
```
]
=== #link(
"https://leetcode.cn/problems/similar-string-groups/",
)[题目2: 相似字符串组]
=== #link("https://leetcode.cn/problems/number-of-islands/")[题目3: 岛问题]
一个矩阵中只有 0 和 1
两种值，每个位置都可以和自己的上下左右四个位置相连，如果有一片 1
连在一起，这个部分叫做一个岛，求一个矩阵上有多少个岛.
#example("Example")[
```
001010
111010
100100
000000
```
这个矩阵有 3 个岛
]
==== 洪水填充
#code(caption: [题目3: 岛问题-洪水填充])[
```java
public static int countIslands(int[][] m) {
if (m == null || m[0] == null) {
return 0;
}
int N = m.length;
int M = m[0].length;
int res = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
if (m[i][j] == 1) {
res++;
infect(m, i, j, N, M);
}
}
}
return res;
}
// 递归进行感染
public static void infect(int[][] m, int i, int j, int N, int M) {
if (i < 0 || i >= N || j < 0 || j >= M || m[i][j] != 1) {
return;
}
//i,j没有越界，且当前位置值为1
m[i][j] = 2;
//修改当前值之后再递归，不会导致无限循环
infect(m, i + 1, j, N, M);
infect(m, i - 1, j, N, M);
infect(m, i, j + 1, N, M);
infect(m, i, j - 1, N, M);
}
```
]
时间复杂度 O(m \* n)
|
|
https://github.com/Heinenen/discourse-typst | https://raw.githubusercontent.com/Heinenen/discourse-typst/main/README.md | markdown | Other | # discourse-typst
This theme component for [Discourse](https://discourse.org/) makes it possible to render Typst code anywhere in your posts!
[Theme components](https://meta.discourse.org/t/beginners-guide-to-using-discourse-themes/91966) work entirely in the client are very easy to install.
This project is closely related to https://github.com/Heinenen/discourse-typst-wasm, which produces the WebAssembly file that is used to render the Typst code.
## Usage
````
```typst render=true
${ x in RR | x "is natural"and x < 10 }$
```
````
## Installation
Because this theme component includes a relatively big `wasm` file, we first have to increase the file upload limit of our Discourse server.
Navigate to `Admin -> Settings -> Files` and set `max attachment size kb` to a sufficient size, e.g., 40MB.
**Note**: This will now also allow users to upload files up to that limit. If you do not want to allow that, you can set the limit back to its original value after finishing the installation.
You can now follow the steps [here](https://meta.discourse.org/t/install-a-theme-or-theme-component/63682), to finish the installation.
# Acknoledgements
This project is heavily inspired by https://github.com/mattfbacon/typst-bot and works mostly the same.
The main difference is that this project is for Discourse instead of Discord.
# Warning
Because Typst is still in its early phases of development, it has frequent breaking changes.
For the Discord bot, this is not a big problem because it renders the Typst code once on a server, and changes of Typst do not change the already rendered docuements.
For us, the story is a bit different, because the document is rendered client-side upon opening a post. Thus, updates to this theme component may break the rendering of a codeblock or result in a different document.
Possible solutions would be (not yet implemented):
- Vendor all (recent?) versions of Typst and somehow save the Typst version that is used in a code block. This results in out theme component becoming very big in size.
- Create a theme component for each Typst version. This is more flexible then the approach above, but also more work. It also comes with an even bigger combined file size, if the admin wants to use all of them.
- Change to server-side rendering. This will require the use of a plugin instead of a theme component. That means that it wouldn't be as easily installable for server admins.
- not sure if possible: When composing a message, insert the (client-side) rendered document into the message, in form of html/svg/pdf/whatever. This feels like the best approach I came up with.
## TODOs
### Priority
- [x] admin configurable preamble
- [x] user configurable preamble
- [x] handle very large documents: make zoomable and scrollable
- [x] handle multiple pages
- [x] font support
- [ ] low prio: option for admin to add more, e.g. via assets
- [ ] low prio: option for users to add more, e.g. from Google Fonts
- [x] support `#datetime.today()`
- [x] Typst package support
### UI
- [ ] center pages in result (isn't that straightforward because of zooming)
- [ ] something similar to how HTML/CSS/JS is handled here: [example](https://stackoverflow.com/questions/67336788/how-to-make-svg-map-zoomable-and-scrollable)
- [ ] compile button?
- [ ] make result collapsible?
- [ ] reset zoom button
- [ ] scale documents that are too wide down to fit inside the box
- [ ] compiler error messages
- [ ] better general styling
- [ ] configurable size of viewport
- [ ] result div could be smaller if result is small enough (would "conflict" with good zooming)
### More TODOs
- [ ] multiple files support
- [ ] not only typst file but also bib files and csv etc.
- [ ] make code blocks collapsible
- [ ] make `datetime.today()` remember the time of posting (or of last edit?)
- [ ] make links/refs clickable
- [ ] scroll to the appropriate position
- [ ] way to handle uploaded typst files instead of code blocks
- [ ] handle other uploaded file/assets like images
- [ ] Typst "playground" support, meaning link to prefilled Typst project
- [ ] better theme support
- [ ] add buttons to code block
- [ ] render button
- [ ] download as PDF/PNG/SVG/ZIP button
- [ ] download code button
- [ ] print pdf button
- [ ] "try it out yourself" button that redirects to playground-ish site
- [ ] this redirects to playground with all project files included
- [ ] specify typst version (comes at cost of very big theme component)
- [ ] remember version at time of posting, to have archivable results
- [ ] warning for user, if the compiled code is not from the latest version
- [ ] multiple output formats
- [ ] optionally with multiple wasm file to not bloat the main one
- [ ] way to download PDF file
- [ ] cache dowloaded packages in browser
- [ ] add loading animation if rendering is taking longer
- [ ] add loading animation if comiler takes longer to download
- [ ] configurable code tag (instead of `typst render=true`)?
### Possible other features
- [ ] option to replace codeblock with output (like the svgbob theme component)
- [ ] maybe with user option to show/copy the source code from context menu |
https://github.com/EunTilofy/NumComputationalMethods | https://raw.githubusercontent.com/EunTilofy/NumComputationalMethods/main/Chapter6/Chapter6-1.typ | typst | #import "../template.typ": *
#show: project.with(
course: "Computing Method",
title: "Computing Method - Chapter6",
date: "2024.4.30",
authors: "<NAME>, 3210106357",
has_cover: false
)
*Problems：1，3，4，5*
#HWProb(name: "1")[
用 Gauss 消去法解方程组：
$
bmatrix(2, 3, 4; 1, 1, 9; 1, 2, -6) bmatrix(x_1; x_2; x_3) = bmatrix(0; 2; 1)
$
并求系数矩阵的行列式和逆矩阵。
]
#solution[
$
bmatrix(2, 3, 4, 0; 1, 1, 9, 2; 1, 2, -6, 1) arrow
bmatrix(2, 3, 4, 0; 0, -1/2, 7, 2; 0, 1/2, -8, 1) arrow
bmatrix(2, 3, 4, 0; 0, -1/2, 7, 2; 0, 0, -1, 3) arrow
bmatrix(1, 0, 0, 75; 0, 1, 0, -46; 0, 0, 1, -3)
$
所以 $(x_1, x_2, x_3) = (75, -46, -3)$。$det(A) = 2 times (-1/2) times (-1) = -1$。
$
bmatrix(2, 3, 4, 1, 0, 0; 1, 1, 9, 0, 1, 0; 1, 2, -6, 0, 0, 1) arrow
bmatrix(2, 3, 4, 1, 0, 0; 0, -1/2, 7, -1/2, 1, 0; 0, 1/2, -8, -1/2, 0, 1) arrow
bmatrix(2, 3, 4, 1, 0, 0; 0, -1/2, 7, -1/2, 1, 0; 0, 0, -1, -1, 1, 1) arrow
bmatrix(1, 0, 0, -24, 26, 23; 0, 1, 0, 15, -16, -14; 0, 0, 1, 1, -1, -1)
$
所以，$A^(-1) = bmatrix(-24, 26, 23; 15, -16, -15; 1, -1, -1)$。
]
#HWProb(name: "3")[
用平方根法和 $text("LDL")^T$ 分解求解方程组：
$
cases(
3x_1 + 2x_2 + x_3 = 5 \
2x_1 + 2x_2 + kk kk kk = 3 \
x_1 + kk kk kk kk kk kk + 3x_3 = 4
)
$
]
#solution[
$
A = bmatrix(3, 2, 1; 2, 2, 0; 1, 0, 3)
$
求矩阵 $L$ 和 $D$ 的元素：
$
d_1 = a_(11) = 3\
j = 2: t_1 = a_(21) = 2, l_(21) = t_1 / d_1 = 2/3 \
d_2 = a_(22) - t_1 l_(21) = 2 - 2 times 2/3 = 2/3 \
$
$
j = 3: t_1 = a_(31) = 1, l_(31) = t_1 / d_1 = 1/3 \
t_2 = a_(32) - t_1 l_(21) = -2/3, l_(32) = t_2 / d_2 = -1 \
d_3 = a_(33) - t_1 l_(31) - t_2 l_(32) = 2
$
得到
$
L = bmatrix(1, kk, kk; 2/3, 1, kk; 1/3, -1, 1), D = bmatrix(3,kk , kk; kk, 2/3, kk;kk,kk ,2 )
$
解 $L y = b$ 得 $y = [5, -1/3,2]^T$，
计算 $z = [5/3, -1/2, 1]^T$
解 $L^T x = z$ 得 $x = [1, 1/2, 1]^T$。\
所以 $x_1 = 1, x_2 = 1/2, x_3 = 1$。
]
#HWProb(name: "4")[
证明：\
+ 两个下三角矩阵的乘积仍为下三角矩阵；
+ 下三角矩阵之逆仍为下三角矩阵。
]
#Proof[
+ 对于下三角矩阵 $A$ ，$a_(i j) = 0, forall i < j, i, j = 1, 2, dots, n$， 设 $A, B$ 都是下三角矩阵，$C = A B$，那么对于 $i < j, i, j = 1, 2, dots, n$，$c_(i j) = sum_(k = 1)^n a_(i k) b_(k j) = sum_(k = 1)^(i) a_(i k) b_(k j) + sum_(k = i+1)^n a_(i k) b_(k j) = sum_(k = 1)^(i) a_(i k) times 0+ sum_(k = i+1)^n 0 times b_(k j) = 0$，所以 $C$ 还是下三角矩阵。
+ 用数学归纳法证明，对于 $n = 1$，所有 $1 times 1$ 的矩阵都是下三角矩阵，结论显然成立。若对于任意 $n leq k, k > 0$ 的矩阵结论都成立，那么对于任意一个可逆下三角 $(k+1) times (k+1)$ 矩阵 $A$，可以将其写为 $
A = bmatrix(A'_(k times k), 0; b, a_(k+1, k+1)),
A^(-1) = bmatrix(B_(k times k), c; d, e),
$所以$
A A^(-1) = bmatrix(A'_(k times k) B_(k times k), A'_(k times k) c; b B_(k times k) + a_(k+1, k+1) e, b c + a_(k+1,k+1) e) = bmatrix(I_(k times k), 0; 0, 1),
$所以，$B_(k times k) = A'_(k times k)^(-1)$，根据归纳假设，$B_(k times k)$ 是下三角矩阵。又因为 $A'_(k times k)$ 满秩且 $A'_(k times k) c = 0$，所以 $c = 0$。由此得到 $A^(-1)$ 是下三角矩阵。\
因此，任意可逆下三角矩阵的逆矩阵都是下三角矩阵。
]
#HWProb(name: "5")[
用主元素消去法解方程组
$
cases(
3x_1 - x_2 + 4x_3 = 7 \
-x_1 + 2x_2 - 2x_3 = -1 \
2x_1 - 3x_2 - 2x_3 = 0
)
$
取 4 位数字计算。
]
#solution[
$
cases(
3x_1 - x_2 + 4x_3 = 7 \
-x_1 + 2x_2 - 2x_3 = -1 \
2x_1 - 3x_2 - 2x_3 = 0
)
$ 消除后两个方程的 $x_1$ 得到
$
cases(
3x_1 - x_2 + 4x_3 = 7 \
- 2.333 x_2 - 4.667 x_3 = -4.667 \
1.667 x_2 - 0.6667 x_3 = 1.333
)
$ 消除最后一个方程的 $x_2$ 得到
$
cases(
3x_1 - x_2 + 4x_3 = 7 \
- 2.333 x_2 - 4.667 x_3 = -4.667 \
- 4.000 x_3 = -2.001
)
$，所以 $x_3 = 0.5003, x_2 = 0.9996, x_1 = 1.9995$。
]
|
|
https://github.com/Myriad-Dreamin/typst.ts | https://raw.githubusercontent.com/Myriad-Dreamin/typst.ts/main/fuzzers/corpora/visualize/gradient-radial_02.typ | typst | Apache License 2.0 |
#import "/contrib/templates/std-tests/preset.typ": *
#show: test-page
#square(
size: 50pt,
fill: gradient.radial(..color.map.rainbow, space: color.hsl, radius: 10%),
)
#square(
size: 50pt,
fill: gradient.radial(..color.map.rainbow, space: color.hsl, radius: 72%),
)
|
https://github.com/pedrofp4444/BD | https://raw.githubusercontent.com/pedrofp4444/BD/main/report/content/[4] Modelação Lógica/normalização.typ | typst | #let normalização = {
[
== Normalização de Dados
A normalização de uma base de dados é um processo crucial na execução de um sistema de gestão de base de dados relacional. O objetivo principal da normalização é organizar os dados de forma a minimizar a redundância, ambiguidade e inconsistência, garantindo, em simultâneo, a integridade da informação e facilitando as operações de consulta e manipulação da mesma.
Existem várias formas normais, habitualmente descritas pela nomenclatura 1NF(Primeira Forma Normal), 2NF(Segunda Forma Normal), 3NF(Terceira Forma Normal), entre outras. Cada uma destas formas normais aborda diferentes tipos de problemas de difusão e dependências funcionais entre os atributos das tabelas.
Na Primeira Forma Normal (1NF), as tabelas são organizadas de forma a que cada célula contenha apenas um valor indivisível, e não listas de valores separados por vírgulas, pontos, ou outros delimitadores. Adicionalmente, cada tabela deve ter uma chave primária única que a identifica de forma exclusiva. Por exemplo, na tabela de Caso verifica-se a garantia de valores indivisíveis e a unicidade da chave primária. Após a análise atenta do modelo lógico em produção, verifica-se o cumprimento desta regra de normalização.
Na Segunda Forma Normal (2NF), todas as dependências parciais são eliminadas, o que significa que cada atributo na tabela deve depender totalmente da chave primária e não apenas de parte dela. Para corroborar esta regra, exemplificando, na tabela de Número de telemóvel, o atributo “Número de telemóvel” subordina-se à chave primária correspondente. Valida-se então esta norma não obstante à confirmação da 1NF, de forma a respeitar a ordem de precedência estabelecida.
Na Terceira Forma Normal (3NF), as dependências transitivas são eliminadas, ou seja, não deve haver atributos que dependam de outros que não seja chave primária da tabela em que se encontram definidos. Constata-se a veracidade desta norma no nosso modelo lógico, por exemplo, na tabela de Função, o atributo “Designação” depende só e apenas da chave primária.
Ao considerar a homologação sequencial e progressiva destas três formas normais, confirma-se a validade do modelo lógico em produção e verificação. Complementarmente, existem mais fórmulas como a Forma Normal de Boyce-Codd (BCNF) ou Quarta e Quinta Formas Normais (4NF e 5NF) que impõem uma especificidade e detalhe superior na minimização de redundâncias e irregularidades, no entanto, descartámo-las dado a complexidade excessiva no âmbito do nosso desenvolvimento.
]
} |
|
https://github.com/SWATEngineering/Docs | https://raw.githubusercontent.com/SWATEngineering/Docs/main/src/3_PB/PianoDiProgetto/sections/PreventivoSprint/UndicesimoSprint.typ | typst | MIT License | #import "../../const.typ": Re_cost, Am_cost, An_cost, Ve_cost, Pr_cost, Pt_cost
#import "../../functions.typ": prospettoOrario, prospettoEconomico, glossary
==== Undicesimo preventivo
*Inizio*: Venerdì 01/03/2024
*Fine*: Giovedì 07/03/2024
#prospettoOrario(sprintNumber: "11")
#prospettoEconomico(sprintNumber: "11") |
https://github.com/KINGFIOX/understand_doc_cn | https://raw.githubusercontent.com/KINGFIOX/understand_doc_cn/main/cn.typ | typst | #set text(lang: "cn")
understand中文手册
#footnote[这是understand documents的中文简单翻译, 并且只有C/C++语言, 并且只有cmake的, 这是译者目前工作的环境]
#set heading(numbering: "A.1.i")
#outline()
= 介绍
本章介绍了解软件。
本手册假定您对编写项目的编程语言有一定的了解。
== 什么是 understand
Understand
是一款静态分析工具，侧重于源代码理解、度量和标准测试。它旨在帮助维护和理解大量遗留或新创建的源代码。它提供了一个跨平台、多语言、面向维护的集成开发环境（交互式开发环境）。
可分析的源代码包括 C、C++、C\#、Objective C/Objective C++、Ada、Assembly、Visual
Basic、Fortran、Java、JOVIAL、Pascal/Delphi、Python、VHDL 和
Web(PHP、HTML、CSS、JavaScript、Typescript 和 XML)。
它使用详细的交叉引用(cross-referencing)
#footnote["交叉引用"是指在一个文档、项目或系统中，通过引用其他相关信息来建立各个部分之间的关系。在软件开发中，交叉引用通常指代码中的引用关系，即一个代码元素（如变量、函数、类等）在其他代码元素中被引用的情况。通过交叉引用，可以更好地理解代码中各个部分之间的关系和依赖关系，从而更好地进行代码分析和维护。交叉引用也可以用于文档编写、项目管理等其他领域。]、语法着色
*智能* 编辑器 和 各种图形逆向工程视图( graphical reverse engineering views)
#footnote["图形化反向工程视图"是指通过图形化的方式展示代码的反向工程结果。反向工程是指从已有的代码中提取出设计和结构信息的过程，通常用于帮助理解和维护现有的代码。图形化反向工程视图可以将代码的结构、依赖关系、继承关系等信息以图形化的方式呈现出来，使得用户可以更直观地了解代码的结构和设计，从而更好地进行分析和修改。常见的图形化反向工程视图包括类图、依赖关系图、调用图等。]
and 提供代码导航。
Understand 具有分析功能，可以帮助您快速回答以下问题：
- 这个entity是什么？
- 它在哪里被修改过？
- 它在哪里被引用？
- 谁依赖于它？
- 它依赖于什么？
Understand 的架构(architecture)功能可帮助您创建源代码单元(source code units)的分层聚合(hierarchical
aggregations)
#footnote["hierarchical
aggregations"（层次聚合）是指根据层次结构对数据进行聚合的过程。在源代码分析中，它通常指根据代码的层次结构（如包、模块、类等）对代码度量或统计数据进行聚合。通过层次聚合，可以将较低级别的度量数据（如函数级别）汇总到更高级别的层次（如类级别、模块级别），以便更好地理解和分析代码的整体情况。这种聚合可以提供更高层次的概览和洞察力，帮助开发人员和项目管理人员了解代码的结构和性能，并做出相应的决策和优化。]。
您可以为这些 单元 命名，并以各种方式对它们进行操作，以创建有趣(interesting)的层次结构(hierarchies)进行分析。
#figure(
image("./img/2023-11-05 23.44.33.jpeg", width: 80%),
caption: [Understand 为软件项目中包含的关系和结构创建了一个资源库。然后利用该资源库来学习源代码。],
)
== 所支持的语言
以下列表简要介绍了 Understand 支持的语言版本和/或编译器：
- Ada： Understand 单独或组合支持 Ada83、Ada95、Ada05 和 Ada2012 代码。
- 汇编： Understand 支持 NXP Coldfire 68K、JIPSE MILSTD-1750A 和 IBM System/370 的汇编代码。
- Visual Basic：Understand 支持 Visual Basic 2002 至 2015。
- C/C++： Understand 可分析 K&R 或 ANSI C 源代码以及 C++ 语言的大多数结构。Understand 可与任何 C
编译器配合使用，并已与大多数常用的 C 编译器进行了测试。支持 C++11、C++14 和 C++17。还支持 CUDA 文件（.cu 和 .cuh）。
- Objective C/Objective C++： Understand 使用 C/C++ 解析器支持 Objective C 和 Objective
C++。
- C\#: Understand 支持版本 9 及以下的 C\#。
- Fortran： Understand 支持自由和固定格式的 FORTRAN 77、Fortran 90、Fortran 95、Fortran 2003 和
Fortran 2008。支持的扩展包括 Harris Fortran 和 DEC Fortran。我们经常扩展 Understand
以支持常见的编译器扩展。如果您发现当前不支持您正在使用的编译器扩展，请通过 "<EMAIL>" 联系我们。
- Java Understand 支持 Java 18。
- JOVIAL：支持 JOVIAL73 和 JOVIAL3。
- Delphi/Pascal： Understand 支持所有版本的 Embarcadero Delphi 语言和 Embarcadero Turbo
Pascal 语言。它还支持带有 HP Pascal 扩展的 ISO 7185:1990（也称为 Unextended Pascal）。您还可以启用对
Ingres 嵌入式 SQL 语句的支持。
- Python Understand 支持 Python 2 和 Python 3。
- VHDL：支持 VHDL-87、VHDL-93 和 VHDL-2001 版本。
- 网络 支持 HTML、PHP、CSS、JavaScript、Typescript 和 XML 文件。
== 太长不读的速通指南
如果您和 SciTools 的许多工程师一样，喜欢钻研并开始使用软件。 我们鼓励您这样做，或者至少我们足够务实，知道您无论如何都会这样做！
因此，请放心使用本手册作为安全网(safety net)，或查找不太明显的功能。 不过，在离开本手册之前，请先浏览下一章，了解如何有效利用 Understand
提供的功能。
除了本手册之外，您还可以从以下其他地方获取建议：
- 点击欢迎界面中的一个示例项目，下载并打开该项目。您还可以使用 "帮助">"示例项目 "菜单下载项目。使用 "视图 "菜单打开视图，使用 Understand
的各种功能。
- 阅读 Understand 提供的提示。如果您已禁用提示并希望再次看到提示，请选择帮助 > 重置所有提示。
- 从菜单中选择帮助 > 帮助内容。
- 访问 support.scitools.com，查看解释有用功能的知识库主题。
- 访问 blog.scitools.com，阅读有关用户如何使用 "理解 "的文章。
- 访问我们的 YouTube 频道，观看有关使用 Understand 的视频。
- 订阅我们的时事通讯，了解客户使用 Understand 的方式。
- 如果您有具体问题，可以单击 "Understand 欢迎 "选项卡中的 "聊天 "图标，使用 "欢迎机器人 "向我们发送您的问题。
对于更高级的用户，可以尝试这些信息来源：
- 选择 "帮助">"关于了解"，查看当前运行的版本。
- 访问 support.scitools.com，阅读 Build Notes，了解最近添加了哪些功能。
- 选择帮助 > 按键绑定，获取大量按键帮助。
- 选择 "帮助">"Perl API 文档 "和 "帮助">"Python API 文档 "可获得有关脚本的帮助。Java API 文档位于 Understand
安装的 doc/manuals/java 子目录中。
- 有关知识库主题，请参阅支持网站。
- 插件和 API 示例、模板和文档可在插件 Git 代码库中获取，网址是 https://github.com/stinb/plugins。
(怎么说, 这个插件系统好像没做太好, 不知道是软件本身人气不够, 还是确实插件系统不太行)
= 部件与术语
本章通过介绍 Understand 中的基本窗口，帮助您快速、轻松地使用 Understand。
== understand的GUI
Understand 有一个主窗口和许多在 Understand 应用程序窗口内打开的较小区域。您可以根据自己的需要在工作区中安排这些区域。
#figure(image("./img/2023-11-06 08.03.23.png"))
- title bar： 您可以拖动主窗口周围区域的标题栏。如果移动到主窗口的边缘，就会展开一个停靠区域。如果将该区域拖到那里，它就会 "停靠 "到主窗口的边缘。
- Pushpins and Drawers： 单击图标可将区域移动到与该区域停靠的主窗口边缘相同的标签页上。这是一个 " Drawers"，当鼠标指向标签页标题时会自动打开。如果不单击该区域而将鼠标移开，或者单击当前打开的抽屉的标题选项卡，抽屉就会关闭。再次点击图标可 "pin "打开的抽屉。
- Dock/Undock： 单击该图标可将该区域更改为非锁定窗口。在非停靠窗口中再次单击该图标可返回停靠区域。
- close： 单击 "X "图标关闭该区域或未停靠窗口。
- drop down: 单击图标可查看该区域的context menu。右键单击 "understandl" 中的项目通常会显示该项目特定的context
menu。
- Sliding Frame： 您可以拖动窗口区域之间的边框来改变它们的大小。
- pervious and next： 每种区域类型的标题栏下方都有不同的图标。对于所示的 "infomation
browser"区域，您可以浏览已查看实体的历史记录。对于其他区域，您将看到其他图标。
"understand"
使用最新的session(会话)布局打开项目。对打开的工具、工具栏、选项卡和其他功能及其大小和位置所做的更改会自动保存为会话的一部分。您可以使用session
browser创建和保存多个会话布局。
(但是说实话, 不知道这里的session代表)
== understand的术语
在继续阅读本手册的其余部分之前，请花点时间熟悉一下 Understand
的术语。这样做将使您在阅读本手册时更有帮助，并在您需要发送电子邮件或致电技术支持团队时与他们保持一致。
- Architecture： Architecture是源代码单元（entities）的hierarchical
aggregation(分层聚合)。Architecture可以由用户创建或自动生成。Architecture不需要完整（即架构的flattened
expansion(扁平化扩展)不需要引用项目中的每个source entity），也不需要唯一（即架构的扁平化扩展不需要维护集合属性）。(有点抽象,
什么叫做flattened expansion, 什么叫做 set property)
- database(数据库)： 数据库以可快速搜索的格式包含源代码分析结果。数据库是 parse.udb 文件，可存储在项目文件夹的 "本地 "子目录下。该数据库会根据每个项目的需要重新生成。在以前的
Understand 版本中，数据库还包含所有项目设置信息，因此很难共享项目。有关详细信息，请章节"Project Storage"。
- entity： Understand 的 "entity "是指任何与之相关的信息。实际上，这是指在源代码和包含项目的文件中声明或使用的任何内容。子程序、变量和源文件都是实体的例子。
- 项目： 您分析过的源代码集(the set of source code)以及选择的设置和参数。.und 项目目录包含与团队其他成员共享项目所需的一切内容。
- relationship(关系)： 实体之间相互关联的一种特殊方式。关系的名称来自编程语言的语法和语义。例如，子程序实体可以有 "调用 "关系和 "由调用 "关系。
- 脚本： 一般是 Python 或 Perl 脚本。这些脚本可以通过 Understand 的图形用户界面运行，也可以通过 "upython "或 "uperl "命令从外部运行。通过
Understand Python 和 Perl API，可以轻松直接地访问存储在 Understand 项目中的所有信息。
=== 部件
下图显示了 Understand 图形用户界面（GUI）的一些常用主要部分：
#figure(image("./img/2023-11-06 08.19.07.png"))
== start understand
在 Windows 上安装 Understand 时，会在 Windows 开始菜单中添加启动软件的命令。
启动 Understand 后，您将在 "Understand "窗口中看到 welcome page。要开始创建新项目，请单击
new（请参阅章节Creating a New Project）。
#figure(image("./img/2023-11-06 08.22.51.jpeg"))
欢迎页面显示了可供下载的示例项目和您最近打开的任何项目的汇总图形(summary graphics)--行类型细目、目录结构和最复杂函数。提供的示例项目使用
C、C++、Ada、Delphi、VHDL、Visual Basic、Fortran、Python、C\# 和 Java。
单击任何项目的title bar，下载并打开该项目。如果要打开的现有项目没有列出，请单击 "open" 并浏览。
#figure(image("./img/2023-11-06 08.25.44.jpeg"))
您也可以从菜单中通过 File > Open > Project and File > Recent Projects来打开项目。
如果要打开用早期版本的 Understand 创建的项目，并将其转换为新的项目存储格式，请选择 File > Open > Legacy .udb
项目。浏览以选择带有
.udb扩展名的文件，该文件被早期版本用来包含项目而不是目录。系统会询问你是否希望将新项目存储在与源代码相同的位置或不同的位置。选择与源代码相同的位置可以使项目更容易共享。
您可以通过 File > close \<project_name\>.und 关闭当前项目。通过 File > Exit 关闭 Understand。
您可以在 Understand
中同时打开一个项目。打开项目时，如果当前项目已打开，系统会询问您是否可以关闭该项目。您对项目设置以及视图和工具安排所做的任何更改都会自动保存。如果您更改了源代码，系统会提示您在每个文件中分别保存或放弃更改。要了解项目文件的保存位置以及如何将其保存在源代码控制系统中，请参考章节"Project
Storage"。
要显示或隐藏welcome page的部分内容，请使用欢迎页面的drop-down menu(下拉菜单)。minimal
view在较小的卡片上显示项目，一次显示一个summary graphics。聊天图标可用于向我们的支持团队发送问题。
要控制项目列表，请使用单个项目的drop-down
menu(下拉菜单)。您可以将最常用的项目固定在列表顶部。编辑欢迎页面上的项目名称只会影响欢迎页面上显示的内容，不会更改项目本身
#figure(image("./img/2023-11-06 08.35.31.png"))
如果您关闭了欢迎页面并希望重新打开，请从菜单中选择 Help > Show Welcome Page 。如果不想每次运行 "Understand "时都看到欢迎页面，请切换 "Don’t
Show Again" 选项。
如果想确保已经安装了最新版本的 Understand，可以从菜单中选择 Help > Check for Updates。(如果有新版本，您会在 Getting
Started tab 中看到 "获取新版本 "按钮）。
=== other ways to use understand
有关从命令行运行 Understand 的信息，请参阅""。
如果多个用户在同一台机器上运行 Understand，每个用户可能都有一个单独的初始化文件。这些文件存储用户首选项。根据操作系统的不同，Understand
会在以下位置查找初始化文件位置：
- Windows： C:\Users\<Username>\AppData\Roaming\SciTools\Understand.ini
- Linux/Unix： ~/.config/SciTools/Understand.conf
- MacOS: ~/Library/Preferences/com.scitools.Understand.plist
== context menus are everywhere
在Understand中，右键单击可以让你走得更远；几乎在你指向的任何地方，你都可以通过鼠标右键调出菜单，了解更多信息，完成更多操作。
例如，右键单击 "源编辑器"（Source Editor）中的一个实体，就会看到此处显示的命令列表。
使用右键菜单时，按住 Ctrl 键可打开新窗口，而不是重复使用现有窗口。
请记住，随时随地右键单击任何实体，都可以获得该实体的更多信息。
#figure(image("./img/2023-11-06 08.50.21.jpeg"))
右键单击 过滤区域(entity in the filter area) 和 信息浏览器(Information browser)
中的实体(entity)可提供以下选项列表：
#figure(image("./img/2023-11-06 09.09.16.jpeg", width: 50%))
#figure(image("./img/2023-11-06 09.10.15.jpeg", width: 50%))
== 快速查找
Understand 提供了几种在源代码中快速查找相关项目的方法。这些功能包括 "过滤区"(filter area)、"实体定位器"(entity
locator) 和 "查找文件"(find in file) 对话框。
=== entity(实体) filter(过滤器)
#footnote[在计算机科学中，"entity"和"instant"都可以指代实例，但它们在语义上有一些区别。
"Entity"通常表示一个抽象的概念或对象，它可以代表一个类、类型或实体的集合。它是一个更广泛的术语，用于描述具有某种特性或行为的事物。例如，在面向对象编程中，一个类可以被视为一个实体。
"Instant"则更具体，表示一个具体的、独立的实例。它是根据某个实体创建的具体个体。例如，在面向对象编程中，通过实例化一个类，我们可以创建一个类的具体实例，这个实例就可以称为"instant"。
总之，"entity"是更抽象的概念，代表一类事物，而"instant"是指具体的实例。]
Understand 窗口的筛选器区域可将项目分为文件、代码文件、头文件、类、函数、枚举器、对象、类型、宏、子程序、包、模块、块、方法、接口、SQL
表等列表，帮助您快速查找代码中的内容。可用筛选器(filter)的类型取决于你配置的 Understand 项目所能理解的语言。
单击筛选器区域后，可以键入一个字母，移动到当前列表中以该字母开头的第一个实体。
默认情况下，信息浏览器会显示所选实体的所有已知信息。这是导航 Understand 的关键。
#figure(
image("./img/2023-11-06 09.39.44.png"),
caption: [For details, see Entity Filter and Information Browser],
)
=== entity(实体) locator(定位)
过滤器(filter)提供了一种快速查找项目中已声明和使用的主要项目的方法。
不过，过滤器中不会列出某些项目，如局部参数、变量、未定义（从未声明或定义）和未解决变量（已声明但未定义）。 要搜索或浏览整个项目，请使用实体定位器。
要打开实体定位器(entity locator)，通过 View > Entity Locator
#figure(image("./img/2023-11-06 09.50.52.jpeg"))
默认情况下，该区域列出项目中的所有实体。您可以使用每列上方的字段搜索与特定文本或 regex(正则表达式) 字符串匹配的实体。
有关详情，请参阅 chap 实体定位器(entity locator)。
与其他窗口一样，上下文菜单(context menu)也处于活动状态。
您可以选择多行和多列，并将其内容复制到剪贴板。粘贴时，内容将以制表符"\\t"分隔的文本形式粘贴。
=== instant search
instant search可让你即时搜索整个项目，即使该项目包含数百万行源代码。当你输入时，你可以看到与你输入的字符串相匹配的术语。
instant search支持多种强大的搜索选项。see chap "instant search"。
#figure(image("./img/2023-11-06 10.04.04.jpeg"))
=== find in files
与 Unix 命令 grep 类似，您可以搜索文件中出现的字符串。从 "搜索 "菜单或上下文菜单中选择 "Find in Files"。
单击 "Find" 后，"Search Results" 窗口中将显示与指定字符串或正则表达式匹配的所有出现列表。双击任何结果都会显示出现该字符串的源视图。
通过选项可以设置诸如大小写敏感性和通配符模式匹配等行为。
更多信息，请参阅chap"find in files"。
#figure(image("./img/2023-11-06 10.32.14.jpeg"))
=== 收藏夹
您可以将常用的实体和代码位置放在收藏夹(favorite)列表中。要添加一个收藏夹，请右键单击该收藏夹，然后选择添加到收藏夹以及包含此项目的列表名称。
要查看收藏列表，请选择 View > Favorites，然后选择要打开的列表名称。
#figure(image("./img/2023-11-06 10.28.21.jpeg"))
== information browser
关于代码，Understand 知道的几乎所有信息都显示在信息浏览器(IB, information browser)中。IB 用于所有类型的实体(all
type of entity)。
信息浏览器(information browser)会根据所选实体的类型显示不同的内容。
它显示有关实体的各种信息，如源文件、类、成员、函数、类型、方法、包、接口等。具有层次性质的信息（如调用关系）可以多级展开。
下面是一个文件和一个 C 语言函数的信息浏览器窗口：
#figure(image("./img/2023-11-06 10.35.03.png"))
更多信息, 参阅chap "information browser".
== 源文件编码器
Understand 有一个源代码编辑器，它不仅能让你编辑源代码，还能为源代码着色，并告诉你正在编辑的代码。
double-click工具中几乎任何其他地方，都可以访问源代码。使用工具栏上的 "下一步 "和 "上一步 "图标，可以向前或向后移动这些 "访问"。
#figure(image("./img/2023-11-06 10.42.55.jpeg"))
与 Understand 中的其他地方一样，整个编辑器中都有context menu。要了解某项内容，只需right-click该内容，即可查看可用信息。
更多信息, 参阅chap "source editor".
== architecture browser
architecture
browser允许您管理architecture。它显示了项目中所有已定义architecture的列表，并提供了浏览单个architecture的方法。
例如，该窗口显示 Understand 提供的自动架构： 日历、目录结构、语言。在这里，这些体系结构在一定程度上被扩展，以显示示例应用程序的节点。
#figure(image("./img/2023-11-06 11.00.01.jpeg"))
您可以使用自动架构(auto-architectures,)、创建自己的架构(create your own architectures)、导入和导出架构（作为
XML 文件）(import and export architectures (as XML
files))、为架构层次结构中的任何级别生成图表和指标(generate graphs and metrics for any level in an
architecture hierarchy)，以及通过筛选将架构组合起来(combine architectures through filtering)。
更多信息, 参阅 chap "About Architectures"
== graphical views
Understand 可分析软件代码并创建数据库，其中包含有关实体和实体间关系的信息。然后，可以使用各种 "graphical view"
窗口浏览项目。图形视图分为以下几种：
- 层次视图(hierarchy views)显示实体(entity)之间的关系。
每个视图都是按照一种关系（例如 "calls"），从（您查询的）起始实体开始，直到其子实体和后续实体(its children and successors)。
- 结构视图可快速显示添加到软件结构中的任何实体的结构（例如包、函数、过程或任务）。
每种类型的示例如下图所示：
#figure(image("./img/2023-11-06 11.08.17.png"))
== APIs for custom reporting
您（或我们）编写的脚本和程序也可以直接使用 Understand 数据。Understand 提供 C API（可从 C、C++ 或其他可调用 C
库的语言中使用）、Python 接口、Java 接口和 Perl 接口。
使用 API，您可以获得与我们编写现有图形用户界面和报告生成器时完全相同的访问权限。
有关可用 API 的更多信息，请参见第 288 页的 API。
本手册不提供 API 的详细文档。示例、模板和文档可在插件 Git 代码库 https://github.com/stinb/plugins
中找到。在以下位置可以找到 API 的其他文档：
- Perl API： 选择帮助 > Perl API 文档。
- Python API： 选择帮助 > Python API 文档，或查看 Understand 安装的 doc/manuals/python 子目录。
- Java API： 请参见 Understand 安装程序的 doc/manuals/java 子目录。
= 配置你的项目
本章介绍如何创建用于分析源代码的新 Understand 项目文件。
== 关于 understand projects
Understand 就像一个编译器，只不过它创建的是信息，而不是可执行代码。为了让 Understand
分析你的源代码，它需要编译器所需的大部分信息。它需要知道
- 要分析哪些源文件
- 源代码的类型
- 标准库路径和包含目录
- 在哪里可以找到 Java .jar 文件，这些文件提供了您没有源代码的类
- 需要为预处理器定义的编译器/环境特定宏
- 特定于应用程序的宏定义
- 使用哪些实现参数（如整数精度）和列截断设置
- 任何命名空间
如果您开发了这个程序，或者已经使用了一段时间，那么这些信息对您来说可能是显而易见的。但是，如果你从其他程序员、团队或公司继承了这些源代码，你可能需要检查项目构建文件（例如
makefile），才能获得准确分析代码所需的信息。
分析代码的最简单方法是使用 Understand 的图形用户界面来构建和分析项目。本章将引导您完成这一过程。
=== project storage
Understand project 存储在一个目录树中。所有文件都是文本文件，体积小，便于共享和/或使用版本控制系统进行管理。
每当项目发生变化时，都会自动保存。用户界面中的任何更改（如调整窗口大小）也会保存下来。此外，布局(layouts)会保存在项目级别，因此你可以按某种方式排列窗口，该项目就会一直以这种方式显示。
默认情况下，创建的项目存储在项目顶级源代码目录中名为 \<project\>.und 的目录中。该目录中的文件包含重新创建项目所需的全部信息（除源代码外）。
如果您使用的是 Windows，可以右键单击 \<project\>.und 文件夹，然后选择用 Understand 打开，在 Understand
中打开项目。
如果要复制当前配置，例如创建一个配置的两个变体(variants)，可以复制存储项目设置的目录树。
通常不作为源代码共享或管理的文件存储在单独的位置。这些文件包括特定于用户的数据，如收藏夹和书签，以及以专有二进制格式存储的 parse.udb
数据库。运行以下命令行即可找到此类内部项目信息的保存位置：`und projectinfo myproject.und`。默认位置如下
- Windows 下： C:\Users\<Username>\AppData\Local\SciTools\Db
- Linux/Unix： ~/.local/share/Scitools/Db
- MacOS： ~/Library/Application Support/Scitools/Db
可以使用 "tools" > "options" 命令更改这些文件的位置，并更改 general 类别中 "setting files"的位置。
如果需要，可以强制 Understand 将与项目有关的所有文件存储在 \<project\>.und 目录中。具体方法是在 \<project\>.und
目录内创建一个名为 "local "的空目录，并在其中填充其他文件。
parse.udb 项目数据库允许多用户同时读取，但不支持多用户写入。如果项目数据库被锁定，你会看到一条信息。
有时，Understand 的新功能需要更改数据库格式。此类更改会在该版本的 "构建说明 "中注明。安装修改数据库格式的构建时，打开现有项目时会自动重新分析。
从欢迎页面下载并打开的示例项目通常存储在以下位置：
- Windows 下： "C:\\Users\\\<Username>\\\AppData\\Roaming\\SciTools"
- Linux/Unix： ~/.config/SciTools
- MacOS： ~Library/Application Support/SciTools/samples
== 创建新项目
要开始分析代码，您需要创建一个项目并指定要分析的源文件。Understand
会分析你的代码并存储信息。这些信息可以在图形用户界面中逐步刷新，也可以使用命令行工具进行更新。
要创建一个新项目，请按照以下步骤操作：
1.
在启动 Understand 时看到的欢迎页面中单击 "new" 链接。或者从菜单中选择 "file">"new">"project"。
- 默认情况下，这将打开 New Project Wizard#footnote[wizard: n. 术士；奇才] (新建项目向导)。
- 或者，您可能已经禁用了运行该向导的选项（请参阅第 95 页），在这种情况下，您会看到 "创建新项目为...... "对话框。浏览到希望创建项目的文件夹。在文件名字段中键入项目名称。单击 "保存"。将在所选位置创建一个目录，其名称由您提供，后缀名为".und"。您将看到 "了解项目配置 "对话框，第
40 页将对此进行介绍。
- 另一种创建项目的方法是在 gcc/g++ 编译过程中添加 Buildspy。
这将在编译项目时自动生成一个 Understand 项目。参阅 chap "Using Buildspy to Build Understand
Projects"。
*Note*: 开始创建新项目时，之前打开的任何项目都会关闭。每个 Understand 实例一次只能打开一个项目。
2.
在向导的第一页，单击添加目录并浏览到源代码的顶级目录。 您可以选择一个或多个根目录。 如果使用 Git 管理源代码，请单击 "add Git
reposity"，其他步骤请参阅 chap "history option"。
如果项目包含多个可执行文件，建议为每个可执行文件创建一个单独的 Understand 项目。
#figure(image("./img/2023-11-06 11.36.32.jpeg"))
3.
click continue
4.
此时可能会出现其他提示，具体取决于源目录中的内容。根据情况回答这些提示，然后单击 "继续"。
- 例如，如果该位置中已经存在一个 Understand 项目，则会出现提示，询问您是否要使用该项目中的设置。
- 如果存在构建文件，系统会询问您是否允许 Understand 观察您的构建以创建更精确的项目。请参阅chap "Using Buildspy to Create
Projects"。
- 如果源文件使用 Cmake，系统会询问您是否要从 Cmake 编译数据库文件导入信息。请参阅chap "Creating Projects from
cmake"。
- 如果位置中存在 Visual Studio 项目，系统会询问您是否要导入该项目以创建更精确的配置。请参见 chap "See Creating Projects
from msvc"。
- 如果位置中存在 Apple Xcode 项目，系统会询问您是否要导入该项目以创建更准确的配置。请参阅 chap "Creating Projects from
apple xcode"。
5.
向导的 "Create Your Understand Project" 页面会检测源代码中使用的语言，并提供 Understand 项目文件的默认位置。
#figure(image("./img/2023-11-06 12.33.07.jpeg"))
6.
您可以使用左侧的复选框禁用语言。(如果以后想重新启用语言，可以在 "project configuration" 设置中进行）。
7.
对于大多数语言，您可以从右侧的下拉列表中选择要用作 代码分析基础 的 standrad version 或 compiler。
8.
默认情况下，项目将放置在主源代码目录下的一个目录中。理解项目文件基于文本，体积小，便于共享和/或使用版本控制系统进行管理。如果不想将项目与源代码一起存储，请单击 "Where
would you like to save your project" 旁边的...，然后浏览选择其他位置。有关项目存储方式的更多信息，请参见 chap。
9.
如果知道要配置其他项目设置，如使用的语言、文件类型、文件编码或特定语言选项，请选中 "Configure advanced settings after
project creation"框，以便在创建项目后自动打开项目配置对话框。请参阅chap "Project Configuration Dialog"。
10.
如果希望存储项目中的文件路径，以便与其他用户共享项目，请选中"Enforce portability" 复选框。有关详情，请参阅 chap "Portability
Options"。
11.
单击"create project"。新项目就创建并打开了。
=== Using Buildspy to Create Projects
当你导入一个包含 C/C++ 代码的项目时，新建项目向导会询问你是否希望通过让 Understand
观察你的编译过程来创建一个更精确的项目。它可以通过分析传递给编译器的包含路径和宏定义信息来实现这一功能。
要使用此功能，请选择 "是"，观察我构建 C/C++ 项目，然后按提示操作。
在出现提示时，应首先清理联编或删除联编目录，以便运行整个编译过程。运行编译时，一次只针对一个目标进行编译，而不是同时针对多个目标进行编译。当 Buildspy
正在收集编译器动作时，你可以运行多个构建。
Buildspy 会检测 c++、cc、cl、clang、clang++、g++ 和 gcc 命令的编译器。如果你的编译器有不同的命令，请在开始编译前点击 "Watch
Options"，添加你的编译器命令。
要从命令行运行 Buildspy，请参阅 chap "Using Buildspy to Build Understand Projects"。
=== 从cmake project创建understand project
如果使用 Cmake 来构建项目，则可以用它来生成 Understand
项目。它将添加所有文件，为每个文件设置正确的宏定义，并为项目中的每个文件设置正确的包含文件。用这种方法创建的项目要比手工创建的项目准确得多，让您可以更轻松地使用所有
Understand 功能。
请按照以下步骤使用 Cmake 文件构建项目：
1.
navigate to your build directory
2.
编辑 CMakeCache.txt 文件（在build文件夹中）并将 CMAKE_EXPORT_COMPILE_COMMANDS 设为 ON。
3.
clean the build，以便 make 能运行完整的联编。
4.
为您编辑了 CMakeCache.txt 文件的联编目标运行 make。在build目录中会生成一个名为 compile_commands.json 的文件。
#figure(image("./img/2023-11-06 12.54.16.jpeg"))
5.
在 Understand 中选择 file > new > project，运行新建项目向导。
6.
指定使用 Cmake 的项目的根目录，该项目包含 CMakeLists.txt 文件，并已设置了一个或多个build。
7.
单击 "continue" 时，Understand 会检测到源代码使用了 Cmake，并询问您是否要指定一个 Cmake 编译数据库。
8.
单击"add file"并选择生成的 CMakeCache.txt 文件。
9.
单击 "continue"。您将看到向导的 "create your understand project" 页面，该页面会检测源代码中使用的语言，并提供
Understand 项目文件的默认位置。
有关使用命令行从使用 Cmake 的源代码项目创建 Understand 项目的信息，请参阅支持网站上的 "Cmake 和 Understand "主题
https://support.scitools.com/support/home。
== project configuration dialog
当你选择 project > configure project菜单时，将打开 "the understand project configuration"
对话框。
通过 "project configuration" 对话框左侧的类别，可以指定分析期间使用的各种项目设置。"the project
configuration"对话框包含以下类别：
- 语言： 设置要分析的语言类型。
- 文件： 设置要分析的源文件的位置。
- 文件类型： 设置如何处理源文件类型以及使用的文件扩展名。
- 文件选项： 设置源文件的文件编码和编辑模式。
- 导入： 指定导入文件和排除筛选器。
- 历史： 选择一个 Git 仓库和/或以前的项目，以获取历史信息和实体比较。
- 可移植性： 选择项目可移植性选项。
- 特定语言选项： 为您在语言类别中选择的语言设置选项。
- C++ 模糊选项
- C++ 严格选项
有关调整项目配置以提高项目分析准确性的建议，请访问 SciTools 网站。
#figure(image("./img/2023-11-06 13.03.31.jpeg"))
由于有很多配置选项，Understand 可以使用 "search settings" 框轻松查找选项。 例如，要查找文件编码设置，请在搜索字段中输入 "encoding"。
Understand 会移动到包含搜索字符串的第一个类别，并突出显示该字段。您可以根据需要单击箭头移动到下一个类别。例如:
#figure(image("./img/2023-11-06 13.06.33.jpeg"))
更改项目配置后，单击 "OK"按钮，配置将被保存。无论何时修改项目配置中的文件（包括在创建项目时），都会出现一个对话框，提醒您配置已更改。
单击 "yes"，Understand将开始分析（解析）代码
如果要关闭 "project configuration"对话框而不保存任何更改，请单击 "cancel"，然后在 "asks if you really do
not want to sace your changes" 框中单击 "discard changes"。
如果要复制当前配置，例如创建一个配置的两个变体(variants)，可以复制存储项目设置的目录树。
== language category
在 "project configurations" 对话框的 "languages"类别中，可以选中项目中使用的语言的复选框。
一个项目可以包含一种或多种语言的源代码。
#figure(image("./img/2023-11-06 13.12.13.png"))
有关特定语言的语言支持信息，请将鼠标光标停留在语言名称上。
#figure(image("./img/2023-11-06 13.14.png"))
选择一种语言后，该语言的类别将添加到项目配置对话框左侧的列表中。 在此选择的语言不仅会影响分析源文件的方式，还会影响可用的筛选器类型和分析结果。
它们还会影响可用的过滤器类型和指标。
如果选择多种语言，则会分析这些语言之间的引用。 例如，如果 C 代码调用 Java 函数，就会发现该引用。
== file category
在项目配置对话框(project configuration dialog)的文件类别(files
category)中，可以向项目添加源代码目录和/或单个文件。 还可以从分析中删除特定文件，并修改各个目录和文件的特定语言选项。
#figure(image("./img/2023-11-06 13.17.png"))
您可以在此添加源文件，也可以将项目与 MS Visual Studio 项目文件中指定的文件绑定（仅限 MS Windows 版本的 Understand）。
您还可以将项目与 CMake 或 Xcode 项目同步。
顶部区域以可展开的树形显示已添加的目录和文件。它还显示当前项目中有多少文件。
对话框顶部的图标可执行以下操作：
#figure(image("./img/2023-11-06 13.20.30.png"))
底部区域显示您为所选目录或文件设置的任何覆盖。 如果在目录中添加的文件未显示在此对话框中，请单击"rescan"。
right-click以获取添加或删除目录或文件、展开或折叠目录树、重新扫描目录以查看更改以及配置覆盖设置的选项。 请注意，只有单击"OK"后才会保存更改。
=== adding directories
要将源代码目录添加到项目中，请单击📂. 您将看到 "添加目录 "对话框：
#figure(image("./img/2023-11-06 13.25.png"))
1.
在Directory中，键入完整的目录路径。或者，也可以单击...按钮，使用 "Browse for Folder" 对话框查找包含源文件的目录，然后单击 "OK"。
2.
在"configured filters"字段中，如果要从显示的列表中添加或删除语言，请单击...按钮。 在 "select filters from
configured file types"对话框中，在希望识别为项目一部分的语言旁边打上复选标记。 (in the select filters from
configured file types dialog, put a checkmark next to any languages you want to
be reconized as part of the project) 请注意，除了语言类别中显示的语言外，还列出了其他语言。 这些语言包括
Basic、MSDos Batch、Perl、SQL、Tcl、Text、Verilog 和 XML。
如果该目录包含扩展名未列出的源文件，请单击 "configure"。
3.
在 "configured filters" 字段中，键入一个模式匹配字符串，该字符串只能匹配要保留在分析中的文件。例如，std\*.\* 仅包括以 "std "开头的文件。可以用逗号分隔过滤器。
4.
在 "exclude" 字段中，键入与要从分析中排除的文件匹配的模式匹配字符串。例如，temp\*.\* 可排除所有以 "temp "开头的文件。可以用逗号分隔过滤器。
5.
要选择多个子目录并将其添加到项目配置中，请选中 "include subdirectories"复选框（默认为打开）。
这样，指定路径下所有子目录中与过滤器匹配的源文件都会被添加到项目中。
6.
如果想watch此目录是否有新文件或已删除文件，请选中监视此目录复选框。 无论何时从该目录中添加或删除源文件，都会在该项目中反映这一变化。
被watch的目录在文件列表中用眼睛图标表示。 排除在监控范围之外的目录则用图标(非眼睛)表示。 默认情况下，被监视目录的子目录也会被监视。
7.
设置字段后，单击"OK"按钮将该目录中的源文件添加到项目中。 如果添加文件过程耗时过长，可以单击"Cancel"。
Tips:
您可以从多个目录树中添加文件。
您可以将其他窗口中的目录、文件或文件选区拖放到 "project configuration" 对话框中，将其添加到项目中。 如果拖动文件夹，则会自动打开 "add
a project directory"对话框。 如果拖动单个文件，无论该文件是否与文件过滤器匹配，都会添加到项目中。
目录路径在界面中显示为绝对路径，但在大多数情况下在项目中存储为相对路径。
=== adding files
要将单个源文件添加到项目中，请单击📃(文件)。 您将看到一个文件选择对话框，可以选择一个或多个源文件添加到项目中。 浏览并选择一个或多个文件。
然后单击"open"。 文件就会添加到项目中。
如果单击图标旁边的向下箭头，可以选择导入包含要导入的源文件列表的文本文件。 例如，您可以从编译器应用程序或代码管理系统生成这样一个文件。
该文件每行应包含一个绝对文件路径。
=== removing directories and files
要从项目中删除目录或文件，请选择要删除的项目并单击(垃圾桶)。 目录或文件本身不会从文件系统中删除。 移除文件的文件名以删除线显示。
您可以右键单击已移除的文件或目录，然后选择，"restore selected files"将其重新添加到项目中。
=== setting overrides
通常，项目中的每个文件都会根据您在 "project configuration" 窗口中为文件语言指定的规则进行处理。
例如，对于C++，您可以设置包含目录和宏定义。 不过，您也可以根据需要逐目录或逐个文件覆盖默认设置。
覆盖一个目录的设置： 要覆盖某个目录的设置，请按以下步骤操作：
1.
选择一个目录。
2.
单击 🔧 (扳手) 或 right-click 并选择 "configure override settings"
#figure(image("./img/2023-11-6 16.39.png"))
3.
在 "watched properties" 类别中，您可以选择如何监视此目录中的文件，以查找要添加到项目中的新文件或要从项目中删除的已删除文件。 在 "watch
settings" 中，可以选择 "watch directory"、"do not watch directory"或 "use parent
directory settings"。 除了指定是否监视目录外，您还可以为单个目录设置筛选器和排除筛选器，以控制新文件和删除文件的类型
4.
file type category 可让您覆盖该目录中文件所使用的语言 文件编码类别可让您覆盖 "文件选项" 中所述的编码设置。
5.
在各种特定于语言的覆盖类别中，您可以进行特定于目录的语言相关设置。可用类别因源文件语言而异。
6.
单击 "OK" 保存覆盖设置。
*overrides for a file*：要覆盖文件的设置，请按照以下步骤操作：
1.
选择文件。
2.
单击 🔧 (扳手)
或right-click并选择 "configure override settings"。
#figure(image("./img/2023-11-06 16.45.png"))
3.
在 "watched properties" 类别中，您可以选择 "由父目录监视"（Watched by parent
directory），以便在父目录被监视时监视文件，或者选择 "排除监视"（Exclude from watch）。
4.
"file type"类别可让您覆盖文件使用的语言，如"file type options"中所述。 文件编码类别可让您覆盖 "file options"
中所述的编码设置。
5.
在各种特定于语言的覆盖类别中，您可以进行特定于文件的语言相关设置。 可用类别因源文件语言而异。
6.
单击 "OK" 保存覆盖设置。
目录树中的特殊图标 有watch, 哪些目录 有overrides，或同时 有override, 有watch。
,
各种 "Override" 类别都有一个 "ignore parent overrides" 复选框。
选中该复选框后，只有在本级（目录或文件）应用的覆盖设置才会被应用； 更高级别的设置不会被继承。
== file type options
在 "project configuration" 对话框的 "file type" 类别中，您可以控制 Understand 如何解释文件扩展名。
#figure(image("./img/2023-11-06 16.53.png"))
该列表显示所有已理解的文件扩展名。 您在语言类别中勾选的语言类型的文件将作为项目的一部分进行分析。 其他文件类型不会被分析。
要修改现有类型，请选择该类型并单击 "编辑"。
要在列表中添加文件扩展名，请单击新建。 键入文件扩展名并选择文件扩展名要使用的语言。 然后单击确定。
#figure(image("./img/2023-11-06 16.55.png"))
文件扩展名应以 "." 开头。可以包含简单的 \* 和 ? 通配符。
根据所选语言的不同，某些文件类型可能会有不同的解释。 例如，在 Visual Fortran 项目中，.h 文件被解释为 Fortran 文件，而不是 C
头文件。
您可以逐个文件或逐个目录覆盖文件类型设置。
== file options
在 "project configuration" 对话框的 "file type"类别中，您可以控制通过 understand 打开和保存文件的方式。
#figure(image("./img/2023-11-06 16.59.png"))
文件编码： 选择保存此项目源文件时要使用的编码类型。 支持多种编码格式。 如果希望该设置与其他项目的设置不同，或者其他应用程序在打开或显示 Understand
保存的文件时出现问题，则应在项目级别更改该设置。 有关详细信息，请参阅第 104 页的编辑器类别。 默认文件编码为 "系统"，即计算机的默认编码。
您可以逐个文件或逐个目录覆盖文件编码设置。
- 将所有项目文件作为只读文件打开： 如果不想在 Understand 中编辑和保存此项目中的文件，请选中此选项(这个游动)
- 要分析文件的最大大小： 限制 Understand 分析的文件大小。您可以使用此选项排除非常大的文件。默认值为 10
MB。如果您试图编辑过大而无法打开的文件，系统将提供一条错误信息。
== imports options
您可以从源项目中导入各种文件类型，以配置 Understand 项目中的目录和文件列表。
#figure(image("./img/2023-11-06 17.00.png"))
可导入以下文件类型：
- JSON 编译命令文件：compile_commands.json。
- Visual Studio 项目文件（包括一些旧格式）：
\*.csproj、\*.dsp、\*.dsw、\*.sln、\*.vbproj、\*.vcp、\*.vcproj、\*.vfproj、\*.vcw、\*.vcxproj。
- Apple Xcode 项目文件： \*.xcodeproj。
要导入文件，请按照以下步骤操作：
1.
在 "project configuration"对话框的 "import" 类别中，单击 "add"。
2.
单击 ...，浏览上述类型之一的文件。
3.
选择文件并单击 "open"。您将看到所选文件中的项目设置列表。
#figure(image("./img/2023-11-06 17.01.png"))
4.
选择文件并单击打开。您应该会看到所选文件中的项目设置列表。 如果要排除 Understand 中属于源项目的任何文件，请单击添加并键入使用通配符匹配的字符串。
5.
单击 "OK" 保存更改。
6.
系统会询问您是否要分析该项目。 单击 "yes" 更新项目。
== history options
项目可以从 Git 仓库（下面的 Git 设置）和/或通过比较了解项目的先前版本获取历史信息。
#figure(image("./img/2023-11-06 17.08.png"))
Git 设置： Git 设置可在 "project configuration" 对话框的 "history" 类别的 Git 区域中进行控制。
- 版本库目录： 如果项目中的文件使用 Git
单击 ...按钮，选择 Git 仓库中的顶级克隆文件夹。
如果使用 Git 进行版本控制，在使用新建项目向导创建 Understand 项目时还会提供额外的控制功能 。请按照该向导中的以下额外步骤操作：
1.
在启动 Understand 时看到的欢迎页面中单击 "new" 链接。或者从菜单中选择 file > new > project。
2
在向导的第一页，单击添加 Git 仓库。
#figure(image("./img/2023-11-06 17.09.png"))
3.
单击 "Directory" 字段旁的...，浏览到 Git 仓库的顶层。
#figure(image("./img/2023-11-06 17.12.png"))
4.
如果尚未将 Git 仓库克隆到本地文件系统，请选中 "clone from"复选框，并提供指向所需 Git 仓库的 URL。 点击 "OK" 后，"git
clone" 命令就会执行到指定的本地目录。 进度条会显示克隆操作的完成程度。 如果克隆仓库失败，对话框将保持打开并显示错误信息。
5.
如果想让 Understand 分析 Git 仓库中的特定提交版本，请单击 "freeze at commit"
字段旁边的...按钮，然后选择要分析的提交的注释（或粘贴 Git 提交的哈希字符串）。 此设置只能在创建项目时进行；要分析不同的提交，请创建新的
Understand 项目。 该设置只影响创建的 Understand 项目，对 Git 仓库没有任何影响。
6.
如果要将版本库的当前状态与另一个提交版本进行比较，请单击 "compare to" 字段旁边的...按钮， 然后选择要与之比较的提交的注释（或粘贴 Git
提交的哈希字符串）。 以后可以通过选择 compare > comparison projects 来更改此设置。
7.
指定要使用的 Git 设置后，单击 "OK"。
8.
继续使用新建项目向导。
Diff(差异, 增量)设置： 在 "project configuration" 对话框的 "history" 类别中的 "diff"区域，
您可以控制哪些类型的更改会被算作 "changed entities locator" 和比较树状图(comparison treemaps)中实体的更改。
这些设置不会影响对比图。
- 忽略空白(ignore whitespace)： 选中此复选框可忽略实体代码中对间距或制表符的任何更改。
- 忽略行尾(ignore line endings)： 选中此复选框可忽略实体代码中行结束符的任何更改。
- 忽略注释(ignore comments)： 选中此复选框可忽略实体代码中注释的任何更改。
== portability options
您可以使用 "项目配置 "对话框中的 "可移植性 "类别来控制 Understand 项目的可移植性。
可移植项目允许您与其他用户共享项目，并在移动源代码文件后保持不变地使用项目。
#figure(image("./img/2023-11-06 18.15.png"))
项目默认使用相对路径，使其更易于共享。 不过，如果 .und 项目文件夹和源代码位于不同的根文件夹或不同的驱动器上，则会使用绝对路径。
要使此类项目便于共享，可创建命名根目录。
例如，C:\src\proj1 和 C:\projects\proj1.und 位于不同的根文件夹中，因此项目将使用绝对路径。 相反，C:\src\proj1
和 C:\src\projects\proj1.und 位于同一个根文件夹（C:\src）中，因此项目将使用相对路径。
如果在默认位置（即源代码树的根目录）创建项目，项目应始终使用相对路径存储，并可自动共享。
如果选中 "执行可移植性"(Enforce Portability) 复选框，则 Understand 项目文件将包含所有目录的相对路径。 这些路径与
Understand 项目的位置（project.und 目录）相对。 如果将项目存储在源文件树中，并将其与源文件一起移动，则仍可使用该项目。
为了使项目具有可移植性，任何不属于源文件树但在项目中被引用的目录都应使用命名根映射。例如:
1.
在 "项目配置 "对话框的 "可移植性 "类别中，选中 "执行可移植性 "复选框。
2.
如果有任何未映射的目录，您将看到如下信息：
#figure(image("./img/2023-11-06 18.26.png"))
单击顶层未映射目录旁边的映射按钮。 系统将提供一个建议的命名根目录。 本例显示了该 Java 虚拟机目录的建议命名根目录。
#figure(image("./img/2023-11-06 18.28.png"))
根据需要更改 "已命名根目录"（例如，如果您的环境变量习惯性地指向该目录）。
3.
可以更改目录，使其指向系统中该目录的位置。
系统中该目录的位置。
4.
单击ok。
5.
当 "项目配置 "对话框中没有列出剩余的未映射目录时，单击 "确定"。
配置 "对话框中没有列出剩余的未映射目录时，单击 "确定"。
6.
共享项目时，告诉其他用户使用此对话框来指向他们自己的
这些目录的位置。
定义命名根目录后，可以在其他 Understand 对话框（如项目配置）和 "und "命令行中使用该名称。
例如，如果您想与通过网络使用不同路径引用项目文件的人员共享项目，这就非常有用。
如果更改了命名的根目录，项目很可能需要重新分析。
你可以定义操作系统环境变量，将其用作 Understand 中的命名根。 在操作系统层面，定义前缀为 "UND\_NAMED\_ROOT\_"的环境变量。 在
Understand 中引用命名根时，不会使用该前缀。 例如，假设你定义的系统环境变量如下：
UND_NAMED_ROOT_SOURCEDIR=c:\my\project\dir
这样，您在 Understand 中使用的命名根目录就是 "SOURCEDIR"。
如果使用的是 "und "命令行工具，"und "命令行中的命名根定义具有最高优先级。 其次是在操作系统级别定义为环境变量的命名根，最后是在
Understand 项目配置中定义的命名根。
== C/C++ options
如果您的项目包含 C 或 C++ 代码，您应首先决定使用 "严格 "还是 "模糊 "分析模式。
- 严格模式： 这种模式需要在 Understand 中进行更多的初始设置，但可以提供最准确的结果。它包括对模板和重载函数的支持。它支持 C++11/14 和
Objective C/C++（适用于 Mac OS 和 iOS）。必须正确指定包含路径和宏，否则 Understand
可能会生成无效或不完整的结果。(CUDA 文件 -.cu 和 .cuh - 也可作为使用严格模式的项目的一部分进行分析）。
- 模糊模式： 该模式创建 Understand
项目的速度更快，宽容度更高，但结果可能不够准确。如果你的源代码可能不完整或无法编译，或者你只是想在工作时快速查看代码，这可能是更好的选择。模糊模式不能很好地处理重载函数或模板，也不支持较新的语言标准。
要选择模式，请在 "项目配置 "对话框中选择 C++ > options 类别，然后选择希望项目使用的模式。
#figure(image("./img/2023-11-06 18.33.png"))
=== 严格的 C/C++ mode options
如果在项目配置对话框的 C++ > 选项类别中使用严格模式，则可以在以下类别中设置选项：
- 编译器
- 语言标准
- 优化
- 目标语言
- 解决
该对话框的 "编译器 "部分默认与运行 Understand 的平台相匹配。 这些字段用于控制分析哪些扩展（如预处理器定义、头文件搜索路径和语言语法）。
如果您在此处的选择与所使用的代码不匹配，分析过程中很可能会出错。 如果您的代码是为多个目标构建的，请使用这些选项在目标环境之间切换，以进行代码分析。
编译器选项如下：
#figure(image("./img/2023-11-06 18.34.png"))
编译器： 选择您使用的编译器。如果您的编译器未列出，请选择行为类似的编译器。 Clang、GCC 和 MSVC 选项提供以下附加字段，以提供有关目标机的信息。
- 架构： 选择用于编写项目的芯片架构。支持的选项包括 ARM、PowerPC64 和 x86_64。使用 "未知 "选项可选择最通用的 C/C++ 代码分析。
- 供应商： 选择芯片架构的来源。例如未知、Apple、PC 和 SCEI（索尼 PlayStation）。使用 "未知 "选项可选择最通用的 C/C++
代码分析。
- 操作系统： 选择该程序将在哪个操作系统下使用。例如 iOS、Linux 和 Win32。
- Env：选择用于构建此项目的构建环境。例如 GNU、EABI 和 Mach-O。对于大多数项目，默认值为 "未知 "即可。
The Language Standard options are as follows:
#figure(image("./img/2023-11-06 18.36.png"))
- C Language Standard: Select the C standard to use when analyzing your C code.
- C++ Language Standard: Select the C++ standard to use when analyzing your C++
code.
The Optimize options are as follows:
#figure(image("./img/2023-11-06 18.37.png"))
- 为对象`数据成员`创建唯一实体： 如果希望为 C++ 类数据成员的每个唯一实例创建单独的实体，请选中此复选框。默认情况下，为每个数据成员创建一个实体。
- 为对象`函数成员`创建唯一实体： 如果您希望为 C++ 类函数成员的每个唯一实例创建单独的实体，请选中此复选框。默认情况下，为每个函数成员创建一个实体。
- 在非活动代码中创建引用： 如果希望排除被当前宏设置 IFDEFed
掉的代码的交叉引用信息，请关闭此选项。默认情况下，该选项处于打开状态，包含非活动代码的交叉引用信息。
- 保存与实体相关的注释： 如果实体前后的源代码注释应与该实体相关联，则选中该复选框。默认为打开。
- 保存宏扩展文本： 如果希望右键单击宏并从上下文菜单中选择交互式报告 > 扩展宏，以查看宏的扩展方式，请选中此复选框。
- 简化控制流图中的宏展开： 选中此复选框可避免为从宏定义展开的控制流结构创建节点。
- 串行启动工作进程：
严格分析器会为其分析的每个源文件启动一个单独的工作进程。默认情况下，工作进程是并行运行的。如果不完成工作进程，请选中此选项，使它们以串行方式运行。
- 警告： 选择需要报告多少严格分析器提供的警告。这些警告会指出源代码中的潜在问题。选择查看部分或全部警告可能会在一定程度上减慢项目分析速度。
- 在\_\_分钟后关闭工作进程： 严格分析器会为其分析的每个源文件启动一个单独的工作进程。如果任何文件的分析时间过长，Understand
会杀死该进程，并且不会生成该文件的分析数据。对于未分析的文件，Understand
会在分析日志中打印一条错误信息，然后继续分析下一个文件。您可以通过使用前向声明和删除包含等方法来减少分析负荷。或者，也可以使用此选项增加进程被杀死前的分析时间。默认情况下，工作进程分析文件的时间最长为
2 分钟。
The Objective-C options are as follows
#figure(image("./img/2023-11-06 18.41.png"))
- 内存管理： 如果使用 Objective-C，请选择使用的内存管理模式。选项包括 MMR（手动保留-释放）、ARC（自动引用计数）和 GC（垃圾回收）。
CUDA 选项如下：
#figure(image("./img/2023-11-06 18.42.png"))
GPU 架构： 选择本项目使用的 GPU 架构的计算能力（也称为 SM 版本）（如果有）。这与 NVIDIA 的 nvcc sm
标志相对应。支持的计算能力范围从 sm_20 到 sm_80。
The Resolve options are as follows:
#figure(image("./img/2023-11-06 18.44.png"))
合并重复的函数定义： 如果分析正在为相同（非重载）函数的多个定义创建重复实体，请选中此复选框。
=== 模糊的 C/C++ mode options
如果在项目配置对话框的 C++ > 选项类别中使用模糊模式，则可以在以下类别中设置选项：
- 编译器
- 多语言链接
- 优化
- 解决
该对话框的编译器部分允许您选择编译器和项目分析的包含路径。编译器选项如下：
#figure(image("./img/2023-11-06 18.45.png"))
- 编译器： 选择使用的编译器/平台。支持许多不同的编译器。您的选择会影响 Understand 分析项目的方式。请注意，并非特定编译器的所有功能都能得到处理。
- 编译器包含路径： 键入或粘贴编译器用于查找包含文件的路径。例如，%include%。
- 允许嵌套注释： 默认为关闭。如果打开，则允许嵌套 C 风格 (/* */) 注释。ANSI 标准不允许这样做，但有些编译器允许。
多语言链接选项如下：
#figure(image("./img/2023-11-06 18.46.png"))
- 在可外部链接的实体名称前加上： 您可以选择键入一个字符串作为前缀，用于引用其他源代码语言中的所有可链接实体。
- 附加外部可链接实体名称： 您可以选择键入一个字符串作为后缀，以便在其他源代码语言中引用所有可链接实体。
优化选项如下：
- 创建隐式特殊成员函数：
如果您希望在分析项目时创建默认构造函数和析构函数，并在类和结构实体的源代码中未声明时给予隐式声明引用，请选中此复选框。该选项可在调用时为分析器提供实体引用。默认为关闭。
- 在非活动代码中创建引用： 如果希望排除被当前宏设置 IFDEFed
掉的代码的交叉引用信息，请关闭此选项。默认情况下，该选项处于打开状态，包含非活动代码的交叉引用信息。
- 创建本地对象引用： 默认情况下，所有本地对象声明都包含在项目分析中。如果希望将函数中声明的变量排除在分析之外，请关闭该选项。这样，在生成的 HTML
输出中就可以包含或排除包含在分析中的本地对象。在 Understand 主窗口的 HTML 输出中指定是否包含本地对象。
- 在宏扩展过程中创建对宏的引用：
选中此复选框会在宏扩展过程中存储引用。在某些情况下，这很有用。请注意，启用此选项会增加许多引用，使项目数据库变大，速度变慢。默认为关闭。
- 创建参数引用： 如果希望排除参数的交叉引用信息，请关闭此选项。默认情况下，该选项为打开，包含所有参数的交叉引用信息。
- 在内联程序集中创建引用： 如果希望为代码中的任何 \#asm 预处理器宏创建汇编代码交叉引用，请选中此复选框。
- 保存与实体相关的注释： 如果实体前后的源代码注释应与该实体相关联，请选中复选框。默认为打开。
- 保存重复引用： 默认情况下，重复的交叉引用会浓缩为一个交叉引用。要保留重复引用，请选中此复选框。
- 保存宏扩展文本： 如果希望右键单击宏并从上下文菜单中选择交互式报告 > 展开宏，以查看宏的展开方式，请选中此复选框。
- 使用包含缓存：
默认情况下，在分析阶段会缓存包含文件，因为它们经常在多个源文件中被引用。这会加快分析速度，但也会占用更多内存。如果在分析过程中遇到内存使用过多的问题，请关闭此选项。需要注意的是，在某些情况下，开启或关闭包含缓存也会影响分析结果，尤其是在包含操作取决于包含位置的情况下。
解决选项如下
#figure(image("./img/2023-11-06 18.47.png"))
- 合并重复的函数定义： 如果分析正在为相同（非重载）函数的多个定义创建重复实体，请选中此复选框。
=== C++ > include category
通过项目配置对话框（project > configure peoject）中的 C++ >
includes，可以指定包含目录。您可以指定多个目录来搜索项目中使用的包含文件。
包含文件目录的配置对于提高项目分析的准确性非常重要。有关配置这些目录的方法
包含路径不会递归搜索；也就是说，不会搜索任何子目录中的包含文件，除非在包含目录列表中明确指定了该子目录。
要添加目录，请单击 "new"按钮，然后单击"... "按钮，浏览到该目录，然后单击 "ok"。
#figure(image("./img/2023-11-06 18.48.png"))
在分析过程中，将按照对话框中出现的顺序搜索包含目录。您可以单击 "move up"或 "move down" 更改搜索目录的顺序。
通常情况下，只有与项目不直接相关的包含文件（如系统级包含文件）以及不想在此进行全面分析的包含文件才会在此定义。对于要分析的项目级包含文件，请将这些包含文件作为源文件添加到文件类别中。
你可以在包含文件路径中使用环境变量。在 Unix 中使用 \$var 格式，在 Windows 中使用 %var% 格式。 也可以在包含文件路径中使用命名根
单击 "import"或 "export" 并选择文件，即可从文本文件导入或导出包含目录列表。 文件每行必须包含一个目录路径。
(在所有此类导入的文本文件中，文件中某一行第一列的 `#` 号表示注释。 可以使用完整路径或相对路径。 任何相对路径都是相对于项目文件而言的）。
C++ > 包含（C++ > Includes）类别根据使用严格模式还是模糊模式提供了不同的选项：
- Sysroot/SDK：（仅限严格模式）该字段允许您指定默认头文件搜索路径的根目录。例如，如果将 Sysroot 设置为 /dir，分析器将搜索
/dir/usr/include，而不是 /usr/include。如果使用交叉编译器或根据与主机不同的 SDK 构建，这个选项非常有用。该选项与
gcc、icc 和 clang 等编译器中的 --sysroot 命令行选项相对应。该选项适用于所有支持的平台。
- 将找到的includes添加到源代码列表：
(两种模式）启用该选项后，在项目分析过程中发现的包含文件将自动添加到项目中。这样，您就可以看到有关这些包含文件的更详细信息。默认为开启。
- 将找到的系统includes添加到源代码列表： (两种模式）如果选择将找到的包含文件添加到源代码列表，还可以选择是否添加系统包含文件。默认为关闭。
- Search for include files among project
files:（在项目文件中搜索包含文件）：（两种模式）该选项指示分析仪在项目文件中寻找丢失的包含文件，作为最后的手段。默认为开启。
- 将系统包含文件视为用户包含文件： (仅适用于模糊模式）该选项指示分析器使用与普通包含文件（用引号包围）相同的策略查找系统包含文件（用 \< \>
包围）。如果关闭该项，分析器将只在编译器配置定义的目录中查找系统包含。默认为打开。
- 忽略包含名称中的目录：（两种模式）如果想忽略 \#include 语句中的任何目录规范，而使用项目中的任何包含文件，请选中此选项。默认为关闭。
- 按内容而非路径比较文件：（仅限严格模式）如果希望按内容而非文件路径比较包含文件，请选中此选项。默认为关闭。
- 单独分析未包含的头文件：（仅限严格模式）选中此选项可省略对项目中 C/C++ 文件未包含的头文件的分析。
=== C++ > include > automatic includes category
(严格模式和模糊模式）在 C++ > includes > automatic includes
类别中，您可以指定应包含在项目中每个文件之前的include文件。
要添加文件，请单击新建并浏览文件。 然后单击 "open"。 单击 "import" 或 "export"
并选择每行包含一个文件路径的文本文件，即可从文本文件导入或导出自动包含文件列表。
使用 "move up"和 "move down" 可更改包含文件的顺序。
=== C++ > include > system includes category
(仅限严格模式）在 C++ > 包含 > 系统包含类别中，您可以指定源代码使用的系统路径。
要在目录及其子目录中搜索框架，请单击 "search"。 这将打开 "Missing Header Files"工具
要添加特定位置，请单击新建并浏览文件夹。 然后单击 "select folder"，再单击 "ok"。
单击导入或导出，选择每行包含一个路径的文本文件，即可从文本文件导入或导出框架 文件夹列表。 使用 "move up"和 "move
down"可更改文件夹的处理顺序。
=== C++ > include > frameworks category
(仅限严格模式）在 C++ > includes > frameworks 类别中，可以指定项目使用的 Mac OS 和 iOS 框架路径。
要在目录及其子目录中搜索框架，请单击 "search"。单击 "ok" 将找到的目录添加到框架列表中。
要添加位置，请单击 "new"并浏览文件夹。 然后单击 "select floder"，再单击 "ok"。
单击导入或导出，选择每行包含一个路径的文本文件，即可从文本文件导入或导出框架文件夹列表。
使用 "move up"和 "move down"可更改文件夹的处理顺序。
=== C++ > include > ignore category
(仅限模糊模式）在 C++ > 包括 > 忽略类别中，您可以指定希望在分析过程中忽略的单个包括文件。
#figure(image("./img/2023-11-06 19.04.png"))
要添加要忽略的文件，请单击新建并键入包含文件的文件名。 然后单击 "ok"。文件名可以使用通配符（如 moduleZ\_\*.h）来匹配多个文件。
分析过程中出现提示时，您选择忽略的任何缺失文件都会添加到此处。
您可以从文本文件中导入或导出要忽略的文件列表，方法是单击导入或导出，然后选择每行包含一个文件名的文本文件。
=== C++ > include > replacement text
(仅限模糊模式）在 C++ > include > replacement text 类别中，您可以指定includes文件文本中应替换的文本。
例如，您可以使用此功能将 [sys\$somewhere] 这样的 VAX/VMS 包含路径替换为有效的 Unix 或 Windows 路径，而无需修改源代码。
要添加项目，请在includes字符串字段中键入实际包含文件中的字符串。在 "replace with" 字段中键入要替换的文本。然后点击确定。
#figure(image("./img/2023-11-06 19.06.png"))
单击 "import" 或 "export" 并选择文件，即可从文本文件导入或导出包含字符串及其替换列表。 文件必须每行包含一个包含字符串。文件应该用等号
(=) 分隔包含字符串及其替换字符串。
使用 "move up" 和 "move down" 可更改替换的顺序。
=== C++ > macros category
C 源代码中经常会出现一些预处理器指令，为 C 编译器提供指令和选项。 以下指令会影响软件的操作和分析方式：
```cpp
#define INSTRUMENT_CODE
#ifdef INSTRUMENT_CODE
...
expr
...
#endif
```
宏通常是通过包含文件（.h 文件）中的指令（\#define）定义的，或者是通过编译器（通常使用 -D 选项）传入的。
通过 "project configuration" 对话框（使用 "project" > "configure project" 打开）中的 "C++" > "macros"
类别，可以定义编译代码时使用的预处理器宏。
要添加宏定义，请单击 "new" 按钮并键入宏的名称和可选的定义。 然后单击 "ok"。
请注意，宏必须有名称，但定义是可选的。已定义但没有定义值的宏通常与 `#ifdef` 预处理器语句结合使用，以查看是否定义了宏。
Understand
需要知道应设置哪些宏定义，才能成功分析软件。如果源代码中使用的任何宏未被定义，您将看到一个未定义宏按钮。您可以单击该按钮并使用该工具定义其他宏。请参阅第 90
页的使用未定义的宏工具。
注意
自动支持许多预处理器宏。除常用宏外，如果使用 "模糊 "分析器，Understand 还支持以下嵌入式汇编代码的宏格式。(严格的 C/C++
分析器不支持这些宏格式）。
```cpp
#asm(<embedded assembly code>);
#asm "<embedded assembly code>";
#asm <embedded assembly code>
#endasm
```
单击 "import" 或 "export" 并选择文件，即可从文本文件导入或导出宏列表及其可选定义。 文件每行必须包含一个宏定义。 文件中某一行第一列的
`#` 号表示注释。文件应以等号 (=) 分隔宏名和宏定义。例如，DEBUG=true。
宏定义的优先级从低到高依次为
1.
内置语言宏（\_\_FILE\_\_ 等）
2.
编译器配置文件
3.
同步 Visual Studio 项目中的宏定义
4.
编译器定义的未定义（通过配置未定义按钮）
5.
项目定义（宏类别）
6.
使用 -define 在命令行中定义
7.
在源文件中定义（在源文件中 `#define / #undefine`）
=== C++ > macros > undefines category
您可以在项目配置对话框的 C++ > macros > undefines 类别中列出未定义的宏。 单击新建并键入不想定义的宏的名称。然后单击确定。
#figure(image("./img/2023-11-06 19.14.png"))
单击导入或导出并选择文件，即可从文本文件导入或导出未定义宏列表。 文件每行必须包含一个宏名称。 文件中某一行第一列的 `#` 号表示注释。
= setting options
本章介绍如何控制 understand 的行为。这些设置适用于您在计算机上处理的所有项目。
== understand options dialog
Understand 允许您使用 "Understand options" 对话框控制其操作的多个方面。 要打开此对话框，请选择 "tool" > "options"。
(在 MacOS 上，由于操作系统的习惯，该命令为 "understand" > "perference"）该对话框提供的选项可按右侧所示的类别进行设置：
#figure(image("./img/2023-11-06 19.27.png"))
下面的小节将介绍每个类别：
- General Category
- User Interface Category
- Key Bindings Category
- CodeCheck Category
- Analyze Category
- Dependency Category
- Editor Category
- Graphs Category
- Annotations Category
- User Tools Category
您可以使用 "search" 框查找选项。 例如，键入 "color" 并单击向右箭头，即可浏览与颜色相关的选项类别。
#figure(image("./img/2023-11-06 19.33.png"))
单击 "restore defaults" 恢复默认设置。系统会询问您是要还原所有设置，还是只还原当前所选类别的设置。
== general category
以下选项可通过 tools > option 对话框的 general 类别进行控制：
- 应用程序字体： 要更改 understand 对话框和列表中使用的字体，请单击 "更改字体 "并选择要使用的字体、字体样式和字体大小，然后单击 "确定"。
- 启动时显示欢迎页面： 如果选中（默认为打开），则启动 Understand 时，欢迎选项卡将显示在文档区域。
- 当应用程序失去焦点时保存所有已修改的编辑器窗口：如果选中此选项（默认为关闭），那么当您移动到另一个应用程序时，您所做更改的任何编辑器窗口都会自动保存其内容。
#figure(image("./img/2023-11-06 19.35.png"))
- 启动时打开上一个项目：
如果选中（默认为关闭），则在没有指定其他项目的情况下，启动understand时会自动打开最近打开的项目。如果你通常只使用一个项目，这是一个非常有用的选项。
- 使用默认工作目录： 如果选中（默认为关闭），则可以选择另一个默认目录。这将是浏览其他目录时的起始目录，也是与相对目录规范相关的目录。默认为保存项目的目录。
- 启用 NTFS 文件系统的权限检查： 如果选中此复选框，则在使用编辑器修改文件时，将检查 NTFS
文件系统的文件权限。该选项默认为关闭，因为在某些情况下，这种检查会大大降低性能。
- 允许在密集处理过程中进行交互： 如果选中此选项（默认为打开），则可以在 Understand
执行后台处理时与之交互。您的交互事件将按照您指定的毫秒间隔进行处理。
- 允许每 n 毫秒处理一次事件： 指定交互事件的处理频率。默认情况下，此类事件每 100 毫秒（0.1 秒）处理一次。您可以通过降低该值来提高后台处理性能。
- 设置文件夹： 指定 Understand 内部使用但与特定项目无关的文件的存储位置。您可以浏览更改此位置。您需要重新启动 Understand
才能使对该目录位置的更改生效。其他解析数据（parse.udb 文件）和其他本地数据也存储在此处指定的位置。
- 备份文件：指定备份 Understand 初始化文件的位置。默认情况下，该文件是设置文件夹中的 Understand_bak.ini 文件。您可以单击 "保存设置 "将所有当前选项设置保存到该文件。如果要加载不同的设置，请更改 "备份文件 "位置，指向不同的文件或已编辑的文件，然后单击 "加载设置"。
*NOTE* Understand 会根据系统设置支持暗模式。如果您在正常模式和黑暗模式之间切换系统，请重新启动 Understand，使其切换到新模式。
== user interface category
user interface 类别包含一般选项和以下子类别中的选项：
- User Interface > Lists Category
- User Interface > Alerts Category
- User Interface > Windows Category
- User Interface > Application Styles Category
可以在 tools > option 对话框的 user interface 类别中设置以下选项：
- 动画窗口/抽屉： 如果选中（默认为打开），打开和关闭窗口以及标签区域（抽屉）时将显示动画。您可以选择比默认速度更快或更慢的速度。
- 显示标签： 如果选中（默认为打开），则在文档区域的顶部会为该区域中打开的每个窗口显示选项卡。这包括源代码编辑器窗口、图形视图和其他窗口。
- 文档关闭时，使用 "most recently use"顺序激活下一个选项卡：
如果选中此复选框，则在关闭另一个窗口时，最近使用的窗口将成为当前窗口。如果未选中此框（默认值），则左侧的选项卡将成为当前窗口。
- 格式化： 选择您希望窗口、选项卡和选择器文件标题区域中的文件名是短名、长名（全路径），还是相对于项目的文件名。
- 命令窗口字体： 控制 "Run a Command" 对话框中使用的字体，以显示您发出的命令的输出结果。
- 创建新项目时使用新建项目向导： file > new > project时，选中此复选框将使用新建项目向导
> 项目时，将使用新建项目向导。如果取消选中此框，则可以指定项目位置和文件名，然后使用完整的 "project configuration"对话框。
=== user interface > lists category
可以在tools > user interface > Lists category of the Tools > Options dialog：
- 最近文件列表： 默认情况下，最近使用的文件列表中显示五个项目。您可以在此更改默认值。您可以从列表中删除不想显示的项目。请注意，您可以选择文件 > 最近文件 >
清除菜单来清除最近文件的历史记录。
- 最近项目列表： 默认情况下，最近使用的项目列表中会显示五个项目。您可以在此更改默认值。您可以从列表中删除不想显示的项目。请注意，您可以选择文件 > 最近项目 >
清除菜单来清除最近项目的历史记录。
#figure(image("./img/2023-11-06 19.44.png"))
=== user interface > alerts category
可以在tools > options对话框 的 user interface> alerts 类别中设置以下选项：
这些选项可用于重新启用已在警告对话框中禁用的警告。
- 解析时保存： 选择在分析项目时如何处理已更改但未保存的源文件。默认设置是始终提示您选择是否保存文件。您也可以选择自动保存已更改的文件或不保存已更改的文件。
- 按命令保存： 选择在运行命令时如何处理已更改但未保存的源文件。默认设置是始终提示您选择是否保存文件。您也可以选择自动保存已更改的文件或不保存已更改的文件。
- 关闭当前项目前提示： 如果选中此选项（默认值），则在尝试打开其他项目时会询问您是否要关闭当前项目和所有相关窗口。
- 违规次数超过 300,000 时提示：如果选中（默认），则会询问您是否要在检测到 300,000 次违规时继续进行 CodeCheck。
- 分析完成时发出蜂鸣声： 默认情况下，分析完成时会发出提示音。
- 实体过滤条目不匹配时发出提示音： 默认情况下，如果您在 "实体过滤器 "中键入的过滤器与所选类型的任何实体不匹配，计算机会发出提示音。您可以取消选中此选项来关闭这些提示音。
- 对所有其他操作发出蜂鸣声： 默认情况下，其他操作（如完成 "查找 "命令）不会发出提示音。选中该复选框可将声音通知扩展到其他操作。
#figure(image("./img/2023-11-06 19.58.png"))
=== user interface > windows category
以下选项可在 tools > options 对话框的 user interface > windows类别中设置：
#figure(image("./img/2023-11-06 20.09.png"))
您可以为不同类型的窗口选择各种选项。
- 编辑器窗口： 选择以捕获的窗口形式在 "理解 "窗口的文档区域内打开源文件（MDI 窗口），还是以可在桌面上任意移动的释放窗口形式打开源文件（SDI
窗口）。默认为捕获。
- 在文件搜索窗口中查找：
- 显示： 选择在最近搜索的下拉列表中列出多少项目。 默认为 5。
- 目录和查找列表： 选择最近使用的搜索字符串列表是显示所有搜索，还是只显示当前项目中使用的搜索。
- 图形窗口： 选择将图形视图作为 Understand 窗口文档区域内的捕获窗口（MDI 窗口）打开，还是作为可在桌面上任意移动的释放窗口（SDI
窗口）打开。默认为捕获。
- 信息 浏览器窗口： 在引用中显示代码片段工具提示：
选择当您指向信息浏览器参考资料列表中显示的行号时，是否希望在悬停文本中显示几行代码。如果信息浏览器不显示行号，请单击 "reference"
旁边的下拉箭头，然后选择 reference > full。
- 已释放窗口： 如果您已从文档区域释放窗口，并希望 Understand 记住窗口位置，请单击 "save released windows positions"
按钮。如果您使用此按钮保存了位置，则可以使用 "清除保存的位置 "按钮来忘记这些位置。
- 保持已释放窗口向前： 如果希望释放的窗口保持在其他窗口的上方，请选中此复选框。
=== user interface > application styles category
以下选项可在 "tools" > "options" 对话框的 "user interface" > "user interface"类别中设置：
您可以为不同类型的窗口选择各种选项。
- 使用编辑器颜色： 单击此按钮可将 editor > styles 类别中的源编辑器颜色应用到项目视图，如信息浏览器。
- 实体颜色： 这些颜色用于 "信息浏览器 "等项目视图。单击列表中项目旁边的颜色方块。使用 "选择颜色 "对话框为该项目选择新的颜色。其他颜色来自系统设置，尤其是
Windows 系统，或者在此对话框的其他类别中设置。
- 树行缩进： 可以更改分层树形显示中的缩进量。
- 在表格和列表中使用交替行颜色： 如果选中（默认为关闭），列表和表格（如 CodeCheck 的结果）的交替行将使用阴影。
- 在富文本树中使用交替行颜色： 默认情况下，格式化的结果都具有相同的背景颜色。通过选中此复选框，可以使每隔一行的背景颜色稍深一些。
#figure(image("./img/2023-11-06 20.22.png"))
== key bindings category
Understand 中按键的功能可以自定义。通过 tools > options 对话框中的 key bindings 类别，您可以选择按键在
Understand 中的工作方式：
#figure(image("./img/2023-11-06 20.26.png"))
- 键盘方案： 此字段允许您选择与其他应用程序类似的键盘设置组。默认设置是 Understand 的本地设置。其他选择包括 Visual Studio .NET
键绑定和 Emacs 编辑器键绑定。如果您选择了一个方案并单击 "ok"，则将使用该方案。如果对提供的方案之一进行更改，该方案将成为 "自定义 "方案。你可以点击 "另存为 "来命名和保存你的按键绑定方案。
- 按名称搜索： 键入命令名称的一部分，点击 🔍 后将显示包含该字符串的命令。
- 按键绑定搜索： 单击字段并按下要搜索的键序。然后点击查找图标 🔍。例如，按 F3 键可查找包含 F3 键的所有按键绑定。
- 组件： Understand 的不同部分有不同的按键行为。表中的 "component "列表示特定命令的可用位置。在对话框左侧的 "按键绑定 "主类别下选择一个子类别，即可查看特定组件的按键绑定。(应用程序组件适用于未列出的对话框和项目）。
要查看当前所有按键绑定的完整列表，请选择 help > key bindings
要更改某个操作的键序，请按以下步骤操作：
+ 使用 component categories 或 "search" 字段，找到要更改按键绑定的命令。
+ 将光标放在要修改的命令的主要序列或备用列中。
+ 按下要执行该操作的组合键。
+ 您不能使用正常的编辑键（如 Backspace 或 Delete）来编辑这些字段中显示的按键。要删除输入的组合键，请单击 "X"
+ 当你将焦点从已更改的组合键上移开时，如果你选择的组合键已被使用，你可能会看到一条 警告信息。
+ 单击 "是 "进行更改，单击 "否 "取消更改。如果不想保存更改，请使用 "恢复默认值 "或 "取消 "按钮。或者，你也可以从提供的键盘方案中选择一个，回到默认的按键绑定集。
#figure(image("./img/2023-11-06 20.34.png"))
== CodeCheck category
在 tools > options 对话框的 CodeCheck 类别中设置颜色，以指定 CodeCheck
窗口的颜色。有关更多信息，请参阅CodeCheck。
#figure(image("./img/2023-11-06 20.38.png"))
单击列表中项目旁边的颜色方块。使用选择颜色对话框为该类型的项目选择新颜色。
== analyze category
通过 tools > options 对话框中的 "分析 "类别，可以指定项目分析方式的选项。
- 分析期间显示日志： 默认情况下，在执行分析时不显示分析日志。如果选中此复选框，则会在分析运行时显示分析日志区域。
- 显示标准库文件： 对于通过 Understand 分析其标准库的语言（如
Ada），如果选中此复选框，标准库文件将显示在分析日志中。默认情况下，该复选框未选中，分析日志较短。
#figure(image("./img/2023-11-06 20.40.png"))
== dependency category
通过 tools > options 对话框的依赖关系类别，可以设置与依赖关系浏览器、依赖关系图 和 依赖关系 导出相关的选项。
- 排除标准实体： 默认情况下，依赖关系图和依赖关系浏览器不包括标准库中的实体。取消选中该选项可包含此类标准实体。
- 使用包含/导入引用： 默认情况下，"includes"和 "import"
被视为依赖关系。不过，如果这些关系是构建所需的，但在逻辑上并不依赖，则可能需要从依赖关系列表中省略。
- 编译时与链接时的依赖关系：
选择是将实体显示为依赖于声明实体的头文件（编译时依赖），还是依赖于定义实体的源代码文件（链接时依赖）。这只适用于区分声明和定义的语言，如 C 语言。
- Cytoscape 应用程序位置： 您可以浏览 Cytoscape (www.cytoscape.org)
的安装位置，这是一个用于分析和可视化的免费开源程序。指定此位置可让 Understand 打开 Cytoscape 以查看按照第 139 页的 "将依赖关系导出到
Cytoscape "中所述导出的依赖关系 XML 文件。
#figure(image("./img/2023-11-06 20.42.png"))
== editor category
以下选项可控制源代码编辑器窗口的一般行为。这些选项可在 tools > options 对话框的 editor 类别中设置：
#figure(image("./img/2023-11-06 20.45.png"))
- 默认样式： 使用字体下拉列表为源代码编辑器窗口选择字体。显示的字体是系统上可用的固定宽度字体。为源编辑器文本选择大小。如果选中 Antialias
复选框，则字体将被平滑处理。该区域的字段设置了默认大小。您可以选择 view > zoom 菜单选项之一，按文件更改默认大小。
- 文件模式： 选择保存源文件时使用的编码类型，以及希望使用的行结束符。支持多种编码格式。系统 "编码选项使用为操作系统定义的编码格式。只有当其他应用程序在打开或显示
Understand 创建的文件时出现问题时，才需要更改这些设置。 默认情况下，这些设置只适用于您创建的新文件，包括文本和 CSV
文件。现有文件保留以前的格式。但是，如果选中 "转换现有行结束符 "复选框，保存的文件将转换为此处选择的格式。
- Windows 的行结束符是回车 (\\r) 和换行 (\\n) 的组合，也称为 CR/LF。打开文件时，CR、CR、LF 序列被解释为单行结束。
- Unix 行结束符以换行 (\\n)，也称为换行符 (LF) 结束。
- 经典的 Macintosh 行尾以一个回车 (CR) 结束。
如果选中 "convert tabs to spaces"复选框，在保存文件时，制表符将被转换为 "宽度 "字段中指定的空格数。此外，如果选中 "在文件末尾添加换行符（如果没有）"复选框，则在保存文件时会为没有换行符的文件添加一个换行符（默认选中）。如果选中删除尾部空白复选框，则在保存文件时会自动删除行尾的空格或制表符。
- 页面指南： 选中 "显示页面指南 "复选框，可在定义的行宽（即代码的右边缘）处显示一行类似于缩进指南的内容。将列设置为您希望看到的字符宽度。
- 粗线： 如果希望突出显示光标所在的整行，请选中高亮显示粗心线复选框。
- 缩进： 如果希望用虚线显示应缩进行的列，请选中显示缩进指南框。
#figure(image("./img/2023-11-06 20.50.png"))
默认情况下，"insert spaces instead of tabs"方框处于打开状态，按下 `<Tab>` 时，空格将被添加到源文件中。
对于缩进宽度，指定缩进级别的列数。对于制表符宽度，指定每个制表符停止的列数。 例如，如果将 "制表符宽度 "设置为 4，则每个 `<Tab>` 都会向右移动 4
列。 如果将缩进宽度设置为 6，制表宽度设置为 4，则每个自动缩进级别由一个 `<Tab>` 和 2 个空格组成。
您可以为特定文件设置制表符宽度，以覆盖整个项目的制表符宽度。 此外，有关高级缩进选项，请参阅 editor > advanced category
- 空白： 选择是否要查看有关空白字符的指示符。点表示空格，箭头表示制表符。可以选择不可见（默认）、始终可见或缩进后可见。选中 "显示行尾 "复选框可查看强制换行的字符。
- 边距： 在源代码编辑器窗口中显示或隐藏以下左侧边距列：
- 行号：（默认为打开）在源视图中打开行号。
- 责备：（默认关闭）显示 Git 责备信息。详情请参阅 "探索 Git 历史"。
- 折叠：（默认开启）开启 "折叠 "源代码实体块的功能。
#figure(image("./img/2023-11-06 20.59.13.png"))
- 状态：（默认为打开）如果行已修改但未保存，则显示更改栏。
- 书签：（默认开启）显示行号旁边的书签（红色箭头）。
=== editor > advanced category
以下选项可控制源代码编辑器窗口的更高级行为。这些选项可在 tools > options 对话框的 editor > advanced 类别中设置。
打印： 以下选项可控制从编辑器窗口打印源代码时的外观：
- 字体大小： 选择打印时使用的源代码大小。要放大或缩小单个源代码窗口，请参阅第 179 页。
- 颜色模式： 选择用于打印的颜色模式。可选项如下。请注意，只有在使用彩色打印机且打印机驱动程序设置为彩色打印时，才能打印黑白以外的颜色。
- 正常 "与当前显示外观相匹配。
- 反色光 "将黑色打印为白色，将白色打印为黑色。如果您将背景设置为深色，将文本设置为浅色，则此功能非常有用。
- 白底黑字 "在白色背景上打印黑色代码，与当前显示外观无关。
- 白底彩色 "在白色背景上打印彩色代码，与当前显示外观无关。
#figure(image("./img/2023-11-07 08.27.png"))
- wrap mode：
选择打印时要使用的换行模式。默认情况下是将单词换行到下一行，但您也可以选择截断行或在字符级换行，即跨行换行。显示的换行符仅用于打印，实际换行符不会添加到源文件中。
- 打印绝对文件名：如果您希望在源文件打印输出的顶部打印完整的文件路径，而不仅仅是文件名，请选中此复选框。
- 日期： 选择打印时显示文件最后修改日期还是当前日期。默认为当前日期。
- 日期格式： 选择以长格式还是短格式打印日期。将使用系统首选的长短日期格式。
- 换页打印新页面： 如果选中该复选框，源代码文件中的换页符将导致分页。如果取消选中该复选框，换页字符将打印为 "FF"，不会出现分页。
#figure(image("./img/2023-11-07 08.28.png"))
通过radar scroll bar区域，可以在源代码编辑器窗口的滚动条中显示或隐藏标记，这些标记用于指示各种内容的位置。 通过取消选中radar scroll
bar，可以禁用所有雷达高亮显示。 查找高亮框控制使用 Ctrl+F 查找字符串的高亮显示（默认为蓝色）。
引用高亮框控制通过引用（例如使用信息浏览器）找到的实体的高亮显示（默认为蓝色）。 已修改行高亮框控制已修改但未保存行的高亮显示（默认为橙色）。
未提交行框控制已保存但未在 Git 中提交的行的高亮显示（详见"探索 Git 历史记录"）。 这些高亮的颜色可以通过editor > style进行更改。
#figure(image("./img/2023-11-07 08.31.png"))
copy-and-paste area可让你在将代码复制粘贴到文字处理器时控制文本的格式。
- 在富文本中包含行号会粘贴行号（粗体）。HTML 用于格式化粘贴的文本。该选项默认为关闭。
- 使用预格式化空白 使用 HTML `<pre>` 标记粘贴代码以保留空白。如果禁用此选项，则使用 （非中断空格）和 `<br>`
标记保留空白。某些应用程序可能不尊重 `<pre>` 标记，在这种情况下，你可以禁用此选项来强制格式匹配。
auto-complete选项可自动完成您在编辑器中键入的关键字和实体。 在您输入时，文本下方会显示单词。 您可以向下箭头浏览列表并按 Enter 键选择建议。
- 启用auto-complete： 该复选框默认为未选中。如果要启用自动完成，请选中此复选框。
- Automatically suggest matches： 如果选中此复选框，建议会自动出现在您输入的内容下方。如果取消选中该复选框，您仍然可以在键入时按
Esc 键，查看并从自动完成选项列表中进行选择。
- 忽略大小写： 如果选中该复选框，建议将包括输入文本的大写和小写版本。
自动缩进选项允许你控制如何将制表符自动添加到代码中。 如果选中启用自动缩进复选框，在源代码编辑器中键入时就会自动缩进。
- 换行后缩进：
如果选中该复选框，当你开始一行新的内容时，就会添加一个缩进，这样你就可以在上一行第一个字符的正下方开始键入。如果未选中，光标将始终位于新行的第一列。
- 制表符自动缩进： 如果该字段设置为从不（默认），`<Tab>` 键将始终插入制表符或空格字符。如果设置为 "始终"，`<Tab>` 键总是将缩进调整到 "correct"
的水平。如果设置为 "leading whitespace"，`<Tab>` 键会在前导空白处适当缩进，并在其他地方插入制表符或空格。
- 触发字符： 如果键入一个指定的字符，当前行的缩进级别会根据代码的解析修改为正确的级别。例如，"{"会增加缩进级别，"}"会减少缩进级别。按 Ctrl+Z
可以撤销刚刚发生的自动缩进。默认触发字符为 \# : { }
- 缩进大括号： 如果选中该复选框，自动缩进格式代码将使用大括号，如下例所示：
```cpp
if (true)
{ // 这里的代码块 }
```
vertical caret policy字段控制源代码编辑器在文本光标或当前位置高亮显示上下移动时的滚动方式。
使用这些字段可以优化源代码编辑器跳转到新位置时的上下文量。 大多数用户不需要修改这些设置。 请参阅:
https://www.scintilla.org/ScintillaDoc.html
- even： 选中该复选框会使源代码以相同的方式上下滚动。
- jumps： 选中该复选框会根据需要滚动多行代码，以显示当前代码行的上下文。
- strict： 选中该复选框表示不希望文本光标进入 Slop 值所定义的区域。如果不选中 Slop，代码会滚动以将当前行保持在窗口中间。
- slop： 选中该复选框可让您定义不想让文本光标进入的源代码编辑器顶部和底部的行数。
- slop value： 通过该字段，您可以设置文本光标应避免进入的 "源编辑器 "顶部和底部的行数。
未使用实体 "字段可让您使用彩色背景来突出显示从未使用过的实体。默认情况下，该功能是关闭的。如果打开此功能，定义未使用实体的代码默认背景为灰色。例如，如果一个函数从未被调用，那么在启用此功能后，该函数中的所有代码都会显示灰色背景。
通过 "注释包边 "字段，可以在指定列处对注释文本进行包边。该功能默认为关闭。
版本控制 "区域中的 "显示内联责备 "字段会显示每一行的 Git 责备信息。
#figure(image("./img/2023-11-07 08.38.png"))
=== editor > macros category
您可以录制、保存和重放源代码编辑器宏。 保存源代码编辑器宏后，可以使用选项对话框重命名和删除宏。 请按照以下步骤操作：
1.
选择tools > options，展开editor类别，然后选择macros类别。
2.
在顶部框中选择要配置的宏。
3.
如果要重命名宏或指定不同的按键序列来触发宏，请单击 "编辑"。请注意，您不能编辑宏执行的操作。要修改操作，请录制新的宏。
4.
如果要删除宏，请单击删除。
=== editor > styles category
您可以在选项对话框中自定义源代码编辑器中使用的颜色。 要打开此对话框，请选择tools > option。展开 "editor" 类别，然后选择 "style"
类别。
Understand 还会根据系统设置在深色模式和浅色模式之间切换。这些颜色主题会根据您所处的模式而改变。
要选择带有一组已定义颜色的配色方案，请从预定义列表中选择一个方案。默认方案为 "understand"
要更改颜色，请单击列表中某个项目旁边的颜色方块。使用 "select color" 对话框为该项目选择新的颜色。
您可以更改任何项目的文本前景色 (FG) 和背景色 (BG)。 还可以为任何项目设置文本粗体 (B)、斜体 (I) 或下划线
(U)。要突出显示项目的整行，请选中 EOL 框。
您可以使用 "导入 "和 "导出 "按钮将编辑器样式设置保存到 "理解主题"（\*.lua）文件中。这样，您就可以在计算机之间共享样式。
默认情况下，源代码使用以下颜色代码：
- 深橙色文本： 用于语言和预处理器关键字
- 蓝色文本： 用于字符和字符串
- 绿色斜体文本： 用于注释
- 黑色文本： 用于所有其他源文本
- 白色背景 用于大多数源文本
- 灰色背景 用于非活动代码行
- 蓝色背景 用于突出显示搜索中的文本
#figure(image("./img/2023-11-07 08.43.png"))
根据源代码语言的不同，还可以自定义其他项目。 例如，使用 C++，可以自定义类、枚举器、命名空间和许多其他类别的名称。使用
Pascal，可以自定义模块、例程和类型名称的颜色。 使用 Fortran，可以自定义块、模块、子程序和类型名称的颜色。对于
Ada，可以自定义全局、局部、包、子程序和类型名称的颜色。
要创建其他类别，请单击 "新建"。 在 "user style" 对话框中，键入样式名称，选择该样式适用的语言，并键入要在该样式中突出显示的关键字。
用空格、换行符或制表符分隔关键字。然后单击保存。然后就可以为新样式设置格式了。
=== editor > navigation category
您可以控制浏览模式的行为。要打开此对话框，请选择tools > options。展开编辑器类别，然后选择navigation类别。
- 按下 Control 时激活： 如果选中此选项（默认为打开），则在指向实体时按住 Ctrl 键，源编辑器窗口将使用浏览模式。
- 编辑源文件： 如果选中该复选框（默认为打开），则在浏览模式下单击实体时，焦点会跳转到该实体的声明。您可以选择一个键（无、Alt 或
Shift），必须在单击的同时按下该键才能执行此操作。默认情况下，点击时必须按 Alt 键才能跳转到实体的声明。
- 更新信息浏览器： 如果选中该复选框（默认为打开），在 "浏览模式 "下单击实体时，"信息浏览器 "将显示实体的相关信息。您可以选择一个必须与单击同时按下的按键，以使该操作发生。默认情况下，点击时不需要按键。
- 启用编辑器工具提示：
如果想在鼠标光标停留在源代码中的实体名称上时看到简要信息，请选中此复选框。这些信息可能包括全名、变量类型以及函数的参数和返回值。这些工具提示默认为打开。
- 数字格式： 选择在源代码悬停文本中将数值显示为十进制、二进制或十六进制。例如，以数字字面和枚举值初始化的变量将显示此类悬停文本。
#figure(image("./img/2023-11-07 08.47.png"))
=== editor > external editor category
您可以使用 Understand
提供的编辑器以外的其他编辑器来查看和编辑源代码。只要打开源代码，就会使用您选择的编辑器。这样就能在使用熟悉的编辑器时方便地浏览源代码。例如，您可以使用
Microsoft Visual C++ 或 Emacs 作为编辑器。
你应该选择一个可以接受命令行参数的编辑器，这些参数可以指定要打开的文件，以及要转到的行数和列数。
要更改编辑器，请按照以下步骤操作：
1.
选择工具 > 选项。展开编辑器类别，然后选择外部编辑器类别。
2.
如果不想使用 "理解 "进行编辑，请选中 "使用外部编辑器 "复选框。
3.
在 "编辑器 "字段中，单击文件夹图标并选择要使用的编辑器的可执行文件。
4.
在参数字段中，键入打开编辑器时要使用的命令行参数。 使用 `$file`、`$line` 和 `$col` 变量允许 Understand
将源文件打开到正确的位置。
例如，对于 Unix 上的 GVIM 编辑器，编辑器为 "gvim"，参数应如下（适用于 GVIM 6.0 或更高版本）：
```shell-unix-generic
--servername UND --remote +$line $file
```
对于 Windows 上的 TextPad 编辑器，编辑器很可能是 c:\Program Files\textpad4\textpad.exe，参数应如下：
```shell-unix-generic
$file($line,$col)
```
Understand 上下文菜单（也称右键菜单）可以在外部编辑器中使用。 SciTools 支持网站提供了相关步骤。 请在 SciTools 支持网站上搜索集成
EMACS、vi、Visual Studio 和 SlickEdit 等编辑器的步骤。
== graphs category
通过 tools > options 对话框中的 "graph" 类别，可以控制与图形显示方式有关的选项。 某些选项仅适用于某些类型的图形，例如群集图形。
#figure(image("./img/2023-11-07 09.02.png"))
- 悬停时突出显示边：
默认情况下，当鼠标光标悬停在关系上时，图形中的关系（连接线）会突出显示。这样就更容易区分重叠的关系。当鼠标光标悬停在关系上时，总是会显示描述关系的文本；此选项不会影响关系描述的显示。
- 动画过渡：
默认情况下，当您对图形进行更改（如扩展或压缩节点或更改图形自定义器区域中的设置）时，重组图形和显示扩展节点的子节点的过渡是动画的。如果想省略动画过渡，请取消选中此复选框。
- 滚轮缩放：默认情况下，鼠标滚轮可用于放大和缩小。取消选中此复选框可使鼠标滚轮在图形内上下滚动。
- 首选图形变量： 默认情况下，选择图表类别时会打开简体变体（如果可用）。此列表显示了 Understand
寻找要打开的图表变体的顺序。您可以选择一个变体，然后单击 "上移 "或 "下移 "更改首选项。
- 边缘上下文菜单中显示的最大引用： 如果右键单击群集图形中节点之间的任何线，则会显示该边所代表的关系列表。默认情况下，每个节点最多显示 25
个关系。您可以提高或降低这一限制。允许的最大值为 99。
在该类别的工具栏区域，您可以选择要为图形显示工具栏的哪些部分。
#figure(image("./img/2023-11-07 09.04.png"))
群集图形区域可让您自定义群集图形的行为。
#figure(image("./img/2023-11-07 09.05.png"))
- 填充群集： 默认情况下，群集的背景是透明的。选中该复选框可为群集添加彩色背景。
- 节点/群集双击时：
控制双击图形中的节点时发生的情况。默认情况下，簇会展开或收缩。您可以更改此设置，以显示/隐藏一个方向或另一个方向上的关系。更多选项可让您同时展开/收缩集群和显示/隐藏关系。
通过该类别的簇图形样式区域，您可以自定义所有可自定义图形的显示颜色、形状和箭头，这些图形包括架构依赖性、簇、比较和控制流图形。
#figure(image("./img/2023-11-07 09.06.png"))
要更改节点或边（实体间的线条）类型的颜色，请单击 "填充 "列或 "线条 "列中的方框。 要更改实体或架构节点方框的形状，请使用下拉列表选择不同的形状。
要更改箭头的两端，请选择不同的箭头头或箭头尾。
您可以使用 "上移 "和 "下移 "按钮更改样式的顺序。 为节点创建自定义样式的方法如下：
1.
单击节点的新建按钮。
2.
键入新样式的唯一名称。
3.
选择该样式是否仅适用于折叠群集、非群集或任何群集、或任何群集。
4.
选择此样式是否只适用于架构节点、实体节点或所有节点。节点，还是所有节点。
5.
如果是实体节点样式，您可以选择一种方法来筛选应具有此样式的实体。
过滤实体的方式。我们提供了几个过滤器示例，您也可以修改建议的过滤器来创建自己的过滤器。
过滤器，创建自己的过滤器。例如，"本地对象 "过滤器将样式应用于
仅适用于本地定义的对象。类型 ~未命名 "过滤器将样式应用于类型不是未命名的实体。
#figure(image("./img/2023-11-07 09.07.png"))
为边缘创建自定义样式的方法如下：
1.
单击边缘的新建按钮。
2.
为新样式键入一个唯一的名称。
3.
选择该样式是否只适用于正向引用、双向引用、分离式双向引用或所有引用。
4.
您可以选择一种方法来筛选应使用此样式的边。我们提供了几个筛选器示例，您也可以修改建议的筛选器创建自己的筛选器。例如，"inherit,
inheritby"（继承，通过继承）筛选器仅将样式应用于继承关系。call ~inactive, callby ~"过滤器只将样式应用于活动的调用和调用关系。
#figure(image("./img/2023-11-07 09.08.png"))
== annotations category
通过 tools > options 对话框中的 "注释 "类别，可以控制注释的显示和编辑方式。
#figure(image("./img/2023-11-07 09.10.png"))
- 作者： 键入您的姓名或希望与您创建的注释相关联的用户名。
- 在其中打开注释：
默认情况下，当你指向注释指示符时，注释会显示在弹出式区域中（除非注释查看器已打开）；当你单击注释指示符或在注释浏览器中单击时，注释会显示在注释查看器中。如果选择 "弹出窗口"，则在单击注释指示符时，注释查看器不会打开，只会显示弹出区域。
- 编辑器显示：
默认情况下，注释指示符会显示在源编辑器的右边空白处，紧挨着任何有注释的行。如果选择内联，则注释会显示在源代码中注释行的下方。如果您不显示注释。请注意，除非打开注释查看器，否则文件级别的注释和包含附加文件的注释在内联模式下不可见。
- 打印时显示注释： 如果选中此复选框，在打印源代码文件时，无论注释在源代码编辑器窗口中如何显示，都将以内联模式打印。
- 在实体悬停文本中显示注释： 如果选中此复选框，则在两秒钟内指向代码中使用相关实体的任何位置，都会显示注释。
- 当前作者背景： 单击彩色块可更改注释查看器和弹出注释中您添加的注释的背景颜色。
- 当前作者前景： 单击彩色图块可更改注释查看器和弹出注释中的文本颜色，以显示您添加的注释。
- 其他作者背景： 点击彩色块可更改注释查看器和弹出注释中其他用户添加的注释的背景颜色。
- 其他作者前景： 点击彩色块可更改注释查看器和弹出注释中其他用户添加的注释的文本颜色。
注释存储在 `<project>.und` 目录中的 JSON 文件中。任何附加文件都存储在 `<project>.und` 目录的媒体子目录中。
== user tools category
有关如何配置工具以及在右键菜单、工具菜单和工具栏中提供运行这些工具的命令的信息
= exploring your codebase
本章详细介绍了 "understand" 中的基本窗口及其选项。 本章还包括 "筛选区 "和 "信息浏览器 "中的操作。
实体定位器和文件中查找用于搜索和定位实体的使用和操作详情
== 请 right-click
对不起，我大喊大叫了（使用了大写字母）。 为了让 Understand 界面尽可能快速、紧凑和优雅，我们在鼠标按键下隐藏了大量功能。
一般规则是，在任何地方，你都可以右击来执行或学习某些操作。 第二条一般规则是，右键单击可以重复使用窗口，而 Ctrl + 右键单击则可以打开新窗口。
因此，请右击。以后不会再有提醒。
#figure(image("./img/2023-11-07 09.18.22.png"))
== various windows explained
Understand 的图形用户界面有许多查找和检查实体的工具。 本章将简要列出所有这些工具，并详细介绍 "实体过滤器"、"信息浏览器 "和 "收藏夹"。
用于查找和研究实体(entity)的工具有
- 分析日志： 显示项目分析结果，包括任何错误和警告。
- 架构浏览器： 定义项目的命名区域和视图。
- 书签： 显示和跳转到书签。
- 上下文信息侧边栏：显示当前源代码编辑器文件的上下文信息。
- 依赖关系浏览器 让你浏览依赖关系。
- 实体过滤器： 提供所选类型实体的字母列表。
- 实体定位器： 可让您以复杂方式过滤项目中的所有实体。
- 探索视图： 用于浏览关系层次结构。
- 收藏夹： 提供常用实体的快速链接。
- 在文件中查找： 搜索多个文件。
- 信息浏览器： 提供实体特征和连接的浏览器。
- 预览器 提供在连续位置查看代码的快速方法。
- 项目浏览器： 可让您浏览分层文件列表。
- 源代码编辑器： 显示源代码。
- 范围列表： 列出文件中的函数或类似结构体。
- 图形视图： 显示实体的连接和结构。
- 度量浏览器 生成有关实体和架构的统计数据。
- 窗口选择器： 跳转到打开的窗口。
- 注释视图： 查看项目中的注释。
== entity(实体) filter(过滤器)
实体过滤器提供所选实体类型的快速列表。 您可以过滤该列表以匹配文本字符串。
显示列表中的选项取决于您为项目启用的语言以及项目中的实体和关系类型。 如果项目使用多种语言，则语言会与类型一起列出。
#figure(image("./img/2023-11-07 09.24.png"))
注意：
对于特别大的项目，可以禁用 "所有实体 "选项，以防止内存出错。 对于每种实体类型，您都可以快速找到源代码中已声明（或使用）的任何实体。
#figure(image("./img/2023-11-07 09.28.png"))
默认情况下，实体按升序（A 到 Z）排序。单击汉堡包菜单(三条纹)并选择降序排序，可以扭转顺序。
只能打开一个实体过滤器。 如果关闭了 "entity filter" 窗口，请选择 view > entity filter 重新打开。
=== using the filter field
在 "filter" 字段中，您可以键入一个字符串来匹配一组实体。 如果实体名称中包含字符串，则实体名称与之匹配。 例如，输入 "y"，就只能列出名称中包含 Y
或 y 的实体。
默认情况下，过滤不区分大小写。 您可以单击汉堡菜单(三条纹)，选择 "Filter Case Sensitivity" > "Case
Sensitive"，使其区分大小写。
如果要快速跳转到列表中以特定字母开头的实体，只需在实体列表中单击并键入一个字母。
您还可以为 "筛选器 "字段选择其他工作方式。 单击汉堡菜单(三条纹)并选择 "筛选模式语法"。选项有:
- 固定字符串： 这是默认行为。
- 通配符： 选择该选项后，可以使用 \*（任意字符）和 ?（任意单字符）通配符进行模式匹配。
- 正则表达式： 选择该选项后，可以使用 Unix 风格的正则表达式。
要只查看未知或未解决实体，请单击汉堡菜单并选择filter unresolved entities > hide resolved entities。
要只查看已解决实体，请单击汉堡菜单并选择 filter unresolved entities > hide unresolved entities。
要同时查看已解决和未解决实体，请选择 "filter unresolved entities" > "no filter"。
当您使用完过滤器并想查看所选类型的所有实体时，请单击汉堡包菜单并选择clear filter。
如果您更改了 "show" 字段中的实体类型， 如果在汉堡包菜单(三条纹)的可用菜单中选择了 "clear filter text on filter type
changes"选项， 则您键入的任何过滤器都会被清除。
右键单击 "筛选器 "区域，从 "最近筛选器 "列表中选择您使用过的筛选器。 如果您选择了使用筛选器找到的任何实体，筛选器就会显示在此列表中。
=== customizing the display
您可以修改实体过滤器列出实体的方式，具体如下：
默认情况下，实体过滤器列表中显示实体全名，实体按全名字母顺序排列。 该名称可能包括类前缀或其他特定语言的前缀类型。 要按 "简短"、无前缀的名称列出实体，请单击汉堡菜单并选择
entity name as > short name。
默认情况下，实体过滤器的文件列表中只显示文件名。 该名称不包括文件位置。 要列出包含位置的文件，请单击汉堡菜单并选择file name as >
relative name or file name as > long name。
默认情况下，只显示函数或方法的名称。 要同时显示此类实体的参数， 请单击汉堡包菜单并选择 show parameters as > full
parameters or show parameters > short parameters。
=== root entity types
在 "显示 "下拉列表中，大多数语言都有名称中包含 "根 "的实体类型，如根调用、根调用比对和根包含比对。 这些 "根 "类型只显示给定树的顶部。关系树的顶部（或底部）通常是开始探索新代码的有用点。
- root calls：
仅列出调用其他实体但自身不被调用的实体。这些实体要么是高级代码（主代码），要么是硬件调用的代码（中断处理程序），要么是死代码（未使用的代码）。
- root call bys： 只列出被其他实体调用的实体，但不列出调用其他实体的实体。这些是低级例程。
- root include bys： 只列出被其他文件包含的文件，但不列出包含其他文件的文件。这些是低级包含文件。
- root classes： 只列出未从其他类派生的类。这些是候选的低级类或库类。
- root decls： 只列出最高级别的声明例程。(阿达）。
- root withs： 只列出 "与 "其他程序单元的程序单元（包、任务、子程序），但不与任何其他程序单元同源。（Ada）
== information browser
当你点击 "entity filter" 或其他窗口中的某个项目时，"信息浏览器 "就会更新，显示 "understand" 所知道的关于该实体的所有信息。
信息浏览器以树形方式显示这些数据，其分支可以单独或同时展开。
如果信息浏览器没有打开，您可以右键单击 Understand 中任意位置的项目，然后选择查看信息。 或者从菜单中选择 view > information
browser。
通过信息浏览器，可以了解 Understand 所知道的关于某个实体的所有信息。 信息以树形显示。 可以选择性地或批量地展开树形结构。
树的每个终止项（叶）都提供了有关该实体的一些信息。
信息浏览器窗口中的所有信息都可以保存到文本文件中，或通过标准的 Windows 或 X11 复制功能进行复制和粘贴。
当您向下钻取时，您可以更改正在了解的实体。 每次更改实体时，信息浏览器历史记录中都会记住该实体，以便快速回溯。
#figure(image("./img/2023-11-07 15.58.08.png"))
=== driling down a relationship(钻研关系?)
向下钻取树的工作原理与预期的一样（大部分情况下）。 要扩展树，请单击 > 箭头。要关闭树，请单击向下箭头。
右键单击会弹出一个菜单，其中包括展开/折叠选项。 全部展开 "提供了展开所选分支所有层级的快捷方式。
要打开或关闭整个树，请右键单击顶层项，然后选择全部展开或全部折叠。
#figure(image("./img/2023-11-07 15.59.png"))
=== displaying more or less information
如果单击信息浏览器中诸如 "调用"、"被调用 "或 "引用 "等粗体标题旁边的图标（或右键单击标题），您将看到一些选项，可以修改该实体的列出方式。这些选项包括
- 允许预展开： 如果启用，则在更改实体时，"度量"(metrics)节点可以保持打开状态。
- 定义名称： 控制是否不显示定义被调用或调用函数的文件，还是使用短文件路径、长文件路径或相对文件路径显示。
- 文件名：控制引用格式是短路径、长路径还是相对于项目文件夹的路径。
- 全称：如果选中，则显示实体的全称。
- 分组方式： 对于 C++ 类，选择是否按可用访问类型（公共或私有）或成员类型（函数或对象）对类成员进行排序。
- 非活动： 控制是否列出非活动引用。
- 宏： 控制 "已使用宏 "列表是否包括函数宏、对象宏或两者。
- 参数： 列出参数。
- 参考： 选择 "完整 "可包含引用的文件和行位置。
- 返回类型： 列出返回类型。
- 显示链接名称：当链接实体以多种语言存在时，如果名称不同，则显示替代名称。
- 排序： 控制列表的排序顺序。
- 类型： 如果选中，则显示数据类型。
- 查看方式： 对于引用列表，您可以选择是显示引用的平面列表，还是按包含引用的文件或定义的架构之一对引用进行分组。
=== searching the information browser
如果单击信息浏览器顶部的放大镜图标（或在信息浏览器中单击并按 Ctrl+F），信息浏览器底部会出现查找栏。
#figure(image("./img/2023-11-07 16.02.png"))
在框中键入文本，然后单击前进或后退箭头，即可在信息浏览器文本中找到出现过的字符串。 所有文本都会被搜索，包括节点名称和当前被折叠节点隐藏的项目。
如果键入的字符串没有出现在信息浏览器文本的任何位置，则字段会变为红色。
要使搜索区分大小写或只匹配全词，请使用下拉箭头选择这些命令。
=== syncing the information browser(同步消息浏览器?)
如果取消选中 "同步 "复选框，就可以打开多个 "信息浏览器 "窗口。 选择实体或选择 "查看信息 "会更新选中 "同步 "复选框的 "信息浏览器"。
如果选中了 "同步"，但又想打开单独的 "信息浏览器"，请按住 Ctrl 键，同时从右键菜单中选择 "查看信息"。
文件同步框会将信息浏览器与活动源编辑器中的文件同步。
#figure(image("./img/2023-11-07 16.03.png"))
=== visiting source code
一般来说，如果您双击信息窗口（信息浏览器或实体过滤器）中的实体，该实体的声明将加载到文档区。
另一种访问 Understand 中任何实体源的方法是上下文菜单。 在适当的情况下，实体的上下文菜单包含一个 "编辑源代码"（Ctrl+Shift+S）菜单项。
在某些情况下，还有用于编辑定义和编辑声明 (Ctrl+Shift+D) 的单独菜单项，或用于其他特定语言位置的单独菜单。
编辑配套文件 "命令可打开并循环浏览具有相同名称但不同扩展名的其他文件。例如，这对 \*.c 和 \*.h 文件非常有用。
#figure(image("./img/2023-11-07 16.05.png"))
=== visiting references
信息浏览器中标有 "引用 "的部分列出了分析源代码中提及该实体的所有地方：
#figure(image("./img/2023-11-07 16.06.07.png"))
左键单击任何引用即可访问源代码中的该位置。
#figure(image("./img/2023-11-07 16.07.png"))
右键单击节点的 "引用 "标题或单击节点旁边的向下箭头，选择如何组织引用。 您可以选择默认的平面列表和所有架构。
=== viewing metrics(指标?)
信息浏览器上的 "metrics" 节点显示当前实体的可用metrics。
默认情况下，在信息浏览器中切换到另一个实体时，"metrics"节点会自动关闭。 这是因为更新大型项目中每个实体的metrics可能需要很长时间。
如果您的项目很小，在实体间切换时更新度量标准不需要很长时间，您可以右键单击 "metrics" 节点并选择 "allow pre-explansion"。
这样，当你切换实体时，"metrics"节点将保持打开状态。 你会看到以下关于metrics更新所需时间的警告。
#figure(image("./img/2023-11-07 16.08.png"))
=== saving and printing information browser text(保存 打印 信息)
信息浏览器中显示的所有文本都可以复制到剪贴板，以未格式化文本的形式粘贴到其他应用程序中。 只粘贴当前展开的分支。
以文本格式保存或粘贴时，文本中的缩进表示树的分支。
上下文菜单提供复制（只复制选定行）和全部复制两种选择。 对于有类路径和文件的实体，复制命令复制的是简短名称，而复制全名命令复制的是完整的类路径或文件路径。
=== entity history
在探索代码的过程中，您可以快速到达许多地方。 通常情况下，您需要回溯以探索新的路径。 为了帮助你做到这一点，信息浏览器包含了完整的历史记录。
信息浏览器历史记录位于左上角：
#figure(image("./img/2023-11-07 16.10.27.png"))
使用左右箭头在历史列表中前后移动。下箭头显示整个列表。
你可以从下拉历史列表中选择清除历史记录来清除浏览历史。
== project browser
要打开 "项目浏览器"，请从菜单中选择 "视图">"项目浏览器"。
#figure(image("./img/2023-11-07 16.11.png"))
默认情况下，"项目浏览器 "与 "实体过滤器"（以及 "架构浏览器"）位于同一区域。 使用左侧的选项卡可在该区域的浏览器工具之间进行切换。
项目浏览器显示目录层次结构中的项目文件。 您可以根据需要展开或折叠树形结构。
按下 Ctrl+F 可在项目浏览器底部显示搜索行。
文件同步框会将项目浏览器与活动源代码编辑器中的文件同步。
在此视图中单击文件时，上下文菜单会提供与其他视图（如信息浏览器或实体筛选器）相同的命令。
#figure(image("./img/2023-11-07 16.13.27.png"))
对于文件，上下文菜单还包含其他命令，包括打开图形视图、重命名文件、仅分析该文件、查找项目文件中文件名的用途以及将文件添加到收藏夹列表等命令。
添加文件 "命令可让您浏览源代码文件并将其添加到项目中。 要使用删除命令，请选择一个或多个文件和文件夹，然后选择该命令。 如果单击 "是"，"确认项目修改 "对话框会列出将从项目中删除的文件。
外部打开 "命令为目录或文件打开与操作系统相关的工具。 例如，在 Windows 系统中，它会使用 Windows 资源管理器打开一个目录。
对于文件，它会打开文件扩展名的默认工具。
排序命令可让你按文件名或文件扩展名的字母顺序组织列表。
Hide By（按隐藏）命令可用于查看哪些文件尚未添加到自定义架构中。它可以过滤掉任何已添加到所选架构的文件。
== exploring a hierarchy(探索层次结构)
通过 "explore" 视图，可以在项目中上下浏览关系层次结构。
#figure(image("./img/2023-11-07 16.15.png"))
信息浏览器、实体过滤器和项目浏览器中的上下文菜单提供了探索某些类型实体的命令。 该命令类似于 "explore">"探索被调用/调用 "或 "探索">"探索包含"。
如果单击一列中的项目，就会在两侧的列中看到其关系。 当你向左或向右选择项目时，列的大小会调整，以显示更多的层次结构。
调用和包含从左到右排列。调用和包含从右到左。
如果双击一个项目，"源编辑器 "窗口会显示该实体的定义。
引用区域显示当前突出显示关系的行号。双击可访问该代码。
如果选中 "生成同步 "复选框，信息浏览器就会自动显示在 "探索 "窗口中选择的任何实体的信息。 按住 Shift 键可暂时激活此行为。
如果选中 "跳转到第一个引用 "复选框，"源代码编辑器 "将自动显示在 "探索 "窗口中选择的任何实体的初始引用。 按住 Ctrl 键可暂时激活此行为。
如果要启用以下任何显示功能, 单击汉堡包(三条纹)菜单选项：
- 显示长名称： 显示每个调用的长名称。
- 显示参数： 显示每个呼叫的参数列表。
== dependency browser
通过 "依赖关系浏览器"，您可以查看哪些项目依赖于其他项目。 您可以在架构节点、文件和大多数实体类型中使用 "依赖关系浏览器"。
要打开 "依赖关系浏览器"，请右键单击 Understand 中的任何架构节点、文件或实体。 例如，在 "实体过滤器"、"信息浏览器 "或图形视图中选择一个实体。
从上下文菜单中选择 "查看依赖关系"。或者选择 "视图">"Dependency Browser"，打开 "依赖关系浏览器"。
左侧面板是范围视图，显示所选项及其子项。 从左侧面板上方的下拉列表中，选择是否列出所选节点或实体的 "依赖"、"被依赖"、"引用自 "或 "引用到 "项。
(其中有些选项不适用于某些节点或实体类型）。
右侧面板是实体视图，显示与左侧面板所选项目有依赖关系的项目。 例如，如果一个项目包含、调用、设置、使用、铸造或引用另一个项目，则该项目依赖于该项目。
您可以在左右面板中展开文件和架构节点。 例如，当您查看一个架构节点的依赖关系时，您可以展开它以查看较低级别的架构节点，然后是文件，最后是文件中的实体。
也可以右键单击任一面板，选择全部展开或全部折叠。
依赖关系浏览器有以下工具栏图标：
单击 "筛选器 "图标，启用或禁用显示的任何依赖关系类型。 选项会根据源代码语言的不同而改变。如果 "包含 "和 "导入 "关系是构建所需的，但在逻辑上并不依赖，则可能需要隐藏它们。
此选项以及显示编译时间或链接时间依赖关系的选项（适用于有区别的语言）可在 "工具">"选项 "对话框的 "依赖关系 "类别中进行控制
单击图形图标可创建当前显示在依赖关系浏览器中的依赖关系图形视图。 架构节点可使用此类图表、类和文件。
依赖关系浏览器显示的是一级依赖关系，而图形视图可以显示多级依赖关系。 如果下拉关系设置为 "依赖 "或 "通过依赖"，则启用此图标。 如果关系设置为 "从引用 "或 "引用至"，则不会启用该图标。
单击 "导出 "图标可导出依赖关系浏览器左侧面板顶部项目的逗号分隔值 (CSV) 报告。 也可以用鼠标选择依赖关系浏览器右面板中的项目。 按 Ctrl+C
将当前选择的文本放到剪贴板上，以便粘贴到其他应用程序中。
收藏夹图标，将当前依赖项添加到收藏夹列表中。 如果未选中重用框，则在选择查看依赖关系时会打开一个新的依赖关系浏览器。 重用复选框默认为选中。
如果选中 "同步 "复选框，则 "依赖关系浏览器 "会显示在 "项目浏览器"、"实体过滤器"、"架构浏览器 "
或类似窗口中选择的任何架构节点、文件、类或包的信息。 此外，"依赖关系浏览器 "还会显示你在图形中选择的任何关系（连接线或 "边"，右键单击连接线可显示引用列表）的信息。
单击汉堡(三条纹)菜单
更改以下任何显示选项：
- Architecture Name as: 默认显示相对名称，但也可以选择短名称或长名称。
- 文件名。默认为短名称。您可以选择相对名称或长名称。
- 实体名称为。默认为短名称。您可以选择长名称。
- 分组方式：
选择如何组织右窗格中列出的依赖关系。默认情况下，它们是根据左窗格中的顶层项分组的。例如，如果顶层项目是文件，则按文件分组。其他选项包括无（平面列表）、按依赖关系/左根、按实体、按类、按定义文件和按架构名称。只有按依赖关系/左根分组时，依赖关系的编译时间与链接时间设置才会影响分组（请参阅第
103 页）。
- 嵌套组： 选择是否将右窗格中列出的依赖关系组织为嵌套组。例如，依赖项可以先按文件分组，然后再按功能分组。默认情况下，只有当一个组包含超过 20
个引用时才会使用嵌套分组，但也可以选择不使用嵌套分组或始终使用嵌套分组。
- 架构树： 选择是否使用架构层次来组织右窗格中列出的依赖关系。默认情况下，只有当节点包含超过 20
个引用时，才会使用嵌套架构节点，但您也可以选择不嵌套节点或始终嵌套节点。
- 引用排序方式： 选择是否按位置（默认）、范围、实体或种类对依赖关系排序。
=== what are dependencies
本节将详细介绍 Understand 如何确定依赖关系，以便在依赖关系浏览器和依赖关系图中显示。
引用是代码中连接两个实体的位置。 例如，myClass 可以声明一个成员函数 myFunction。 在这个例子中，引用连接了父实体和子实体。 您可以在 "信息浏览器 "中查看涉及实体的引用。
依赖关系是指两个文件、类、体系结构节点和某些其他特定语言结构之间由于引用而产生的连接。 例如，如果文件 A 需要文件 B 进行编译或链接，则文件 A 依赖于文件
B。 依赖关系是基于编译还是链接，取决于编译时间与链接时间选项的设置
因此，依赖关系并不存在于两个实体之间。 相反，它们是实体组的父实体之间的依赖关系。 实体的父实体可以是文件、类和/或架构节点。
要查找实体的非文件父实体，请右键单击并选择交互式报告 > API 信息。 在 iReport 区域，查看 "父级 "属性。
了解在分析过程中确定每个实体的父实体。 在此信息浏览器中，可以看到本地对象 "app "定义在 main 中，因此 app 和 main 是父子关系。 函数
main 是文件 GitAhead.cpp 的子实体。文件实体没有父实体。
Architectures将实体组织成一个层次结构， 可以扩展实体的父链。 例如，内置的 "目录结构 "架构按文件夹对实体进行分组。 因此，架构中 "app "对象的完整父级链是
app（本地对象）->main（函数）-> GitAhead.cpp（文件）-> app（架构节点）-> src（架构节点）-> Directory
Structure（架构）。 除文件实体外，自定义架构还可以组织非文件实体。 要在架构浏览器中查看实体的父级链，请打开 "Show Implicitly
Mapped Child Entities"。
Understand 在文件、类和架构层面计算依赖关系。 文件可以依赖其他文件，类可以依赖其他类，架构可以依赖同一根架构中的其他架构。
如果涉及实体的层级不匹配，则不将引用视为依赖关系。 因此，类依赖关系不包括对非会员函数的任何引用，架构也不包括对根架构中未映射的任何内容的引用。
#figure(image("./img/2023-11-09 08.24.46.png"))
Understand 用来查找要显示的依赖关系列表的基本步骤是:
1.
查找起始组中的所有实体。(Find all entities in the starting group)
2.
获取每个实体的引用列表。
3.
确定第二个（引用的）实体在给定级别（文件、类或架构）上的组。
4.
如果第二个实体的组存在，且与起始组不同，那么引用就是连接两个组的依赖关系。
查找依赖关系时需要注意以下几点。
实体可能属于多个组。 当一个实体属于多个组时，如同时属于定义文件和声明文件，或属于同一架构中的两个节点，那么将通过依赖关系计算选择最佳显示组。
- 对于 C/C++ 语言，最佳分组搜索使用包含树。
- 对于 C/C++ 和类似语言，在决定一个实体是否属于声明或定义它的文件时，将使用编译时间与链接时间选项的设置。因此，如果选择 "编译时依赖关系"，实体就属于声明它的头文件。如果选择链接时间依赖关系，则实体属于定义它的源代码文件。
- 对于所有语言，也可以通过架构层次结构与起始组的距离来确定最佳组。目录结构架构用于文件层。
- 如果计算找到多个 "最佳 "组，则引用将被用作每个最佳组的依赖关系。
=== exporting dependencies
通过 Project > Export Dependencies（项目 >
导出依赖关系）菜单命令，可以导出多种类型的文件，提供架构、文件和类/包之间的依赖关系指标。
大多数命令的输出都是 CSV（逗号分隔值）格式，可以用大多数电子表格程序打开。使用 Understand 创建 CSV 文件时，它会自动在文本文件窗口中打开。
可用选项如下：
- 架构依赖关系 >
- 导出 CSV：此输出列出了 A 列中的节点依赖于 B 列中的节点的架构节点对。
- 导出矩阵 CSV：此输出列出了 A 列中依赖于其他节点的所有架构节点。在适当的行/列交叉处列出了每对依赖关系的数量。
- 导出 Cytoscape XML： 该输出格式可在 Cytoscape (www.cytoscape.org) 中打开，Cytoscape
是一个用于分析和可视化的免费开源程序。该程序可快速绘制大型图表，如果您想了解大型项目中的依赖关系，该程序将非常有用。
- 导出点： 这种输出格式使用纯文本图形描述语言。有多种程序可以导入 DOT 文件，以创建图表、执行计算和操作数据。
- 文件依赖性 >
- 导出 CSV：此输出列出了 A 列中的文件依赖于 B 列中的文件的文件对。
- 导出矩阵 CSV：此输出列出了 A 列中依赖于其他文件的所有文件。每对依赖关系的数量列在相应的行/列交叉处。
- 导出 Cytoscape XML： 请参阅有关架构依赖关系的 Cytoscape XML 导出说明。
- 类依赖关系 >
- 导出 CSV：此输出列出了 A 列中的实体依赖于 B 列中的实体的类和包对，C 列中列出了每对依赖的数量
- 导出矩阵 CSV：此输出列出了 A 列中依赖于其他实体的所有类和包。每对依赖关系的数量都列在相应的行/列交叉处。
- 导出 Cytoscape XML： 请参阅架构依赖关系的 Cytoscape XML 导出说明。
=== exporting dependencies to a csv file
#footnote[注: csv file是用 逗号"," 做分隔的csv文件]
选择导出 CSV 文件时，还可以设置以下选项。 (本图显示的是导出文件依赖关系的对话框；其他两个 CSV 导出对话框非常相似）。
#figure(image("./img/2023-11-09 10.33.png"))
在此对话框中，可以设置以下选项：
- 选择要分析的架构： 此选项只有在导出架构依赖关系时可用。
- 输出文件：浏览保存 CSV 文件的位置。
- 列： 选中要包含在输出中的列的复选框。导出实体类型的 "从 "和 "到 "列是必填项，不能取消选择。
- 名称： 选择实体名称的长度。例如，所有类型都可以有长或短名称。文件也可以有相对名称。
- 排序： 选择依赖关系的排序方式。可以根据 "从 "列或 "至 "列进行排序。
- 依赖关系汇总： 选择如何汇总多次出现的依赖对。您可以单独显示每对依赖关系，也可以根据您要导出的实体类型将 "从 "或 "到 "列的依赖关系对汇总。
=== exporting dependencies to a csv matrix file
#footnote[注: csv matrix file是类似于excel之类的二维表格]
选择导出 CSV 矩阵文件时，还可以设置以下选项。(本图显示的是导出文件依赖关系的对话框；其他两个 CSV 导出对话框非常相似）。
#figure(image("./img/2023-11-09 08.28.png"))
在此对话框中，可以设置以下选项：
- 选择要分析的架构： 此选项仅在导出架构依赖关系时可用。
- 输出文件：浏览保存 CSV 矩阵文件的位置。
- 名称： 选择实体名称的长度。例如，所有类型都可以有长或短名称。文件也可以使用相对名称。
=== exporting dependencies to cytoscape(一种图软件)
#footnote[Cytoscape is an open source software platform for visualizing molecular(分子太的)
interaction networks and biological pathways and integrating(融合) these networks
with annotations, gene expression profiles(配置信息, 这里是: 基因表达信息) and other state
data. Although Cytoscape was originally designed for biological research, now it
is a general platform for complex network analysis and visualization(我的评价是6)]
Cytoscape (www.cytoscape.org) 是一款可视化复杂网络的开源软件工具。
选择导出 Cytoscape 文件时，可以通过 "浏览 "来选择输出文件的位置和文件名。 如果要导出架构依赖关系，还可以选择要分析的架构。
导出 \*.xml 文件后，系统会询问您是否要在 Cytoscape 中打开该文件。请注意，只有在计算机上安装了 Cytoscape，才能打开该文件。
== favorites(收藏)
您可以将 Understand 中的各种内容标记为 "收藏夹"，这样就可以像访问浏览器收藏夹组中的网页一样快速访问这些内容。
您的收藏夹可以包括实体、代码位置、图表、信息浏览器显示和依赖关系。 您还可以在收藏夹中存储多个纯文本字符串，这样就可以将其中一个保存的字符串快速复制到剪贴板上。
收藏夹作为项目的一部分保存。
=== creating a favorite entity
要将实体标记为收藏夹，请按照以下步骤操作：
1.
在源代码、"实体过滤器 "区域、"信息浏览器"、图形视图或其他出现实体的地方选择实体名称并单击右键。
#figure(image("./img/2023-11-09 13.14.png"))
2.
选择添加到收藏夹 >
添加到新收藏夹（或现有收藏夹组）。这将添加一个指向实体本身的链接，即使后来行号发生了变化。如果已经创建了收藏夹组，可以从子菜单中选择该组，而不是使用添加到新收藏夹。
3.
另外，如果右键单击源文件，可以选择添加位置到收藏夹，将文件中的行号添加到收藏夹组中。
4.
如果选择创建新的收藏夹组，则会看到 "新建收藏夹 "对话框。为新组键入一个名称，然后单击确定。
5.
创建收藏夹后，将打开收藏夹组。
#figure(image("./img/2023-11-09 13.15.png"))
=== creating a favorites view
除了实体和代码位置，收藏夹还可以包括图形视图、信息浏览器视图和依赖关系浏览器视图。
要为这些项目添加收藏夹，请单击视图工具栏上的收藏夹图标(五角星)。 默认情况下，该视图会添加到您上次使用的收藏夹组中。 如果要将其放在不同的组中，请从 "收藏夹 "视图工具栏的下拉菜单中选择一个收藏夹组。
=== using a favorites group
要打开 "收藏 "组，请选择 "视图">"收藏"。
#figure(image("./img/2023-11-09 13.17.png"))
在 "我的收藏 "视图中，可以使用工具栏中的下拉列表切换到不同的 "我的收藏 "列表。
单击收藏夹组中的链接可跳转到该位置。 单击 "open all item"图标(打开文件夹的图标)可以打开当前列表中的所有收藏夹，单击 "close all
item"图标(关闭文件夹的图标)可以关闭列表中的所有收藏夹。
您可以单击文档区域右上角的汉堡包菜单图标(三条纹)，然后选择 "Add Open Editors/Graphs to
Favorites"命令，将当前打开的所有文件和图形视图添加到收藏夹列表。
#figure(image("./img/2023-11-09 13.19.png"))
与 Understand 中的其他地方一样，您可以右键单击收藏夹，查看上下文菜单，其中包括 "查看信息"、"图形视图 "和 "查找 "等命令。
每个收藏夹左侧的图标（以及收藏夹名称后面的文字）可以识别每个收藏夹的类型。 例如，部分图标及其含义如下： 带有信息图标的收藏夹链接到信息浏览器视图。
- 带有依赖图标的收藏夹链接到依赖浏览器视图。
- 带有图形图标的收藏夹链接到图形视图。
- 带有剪贴板图标的收藏夹可存储可粘贴到源代码中的文本。单击文本收藏夹后，文本将被放入剪贴板，你可以将其粘贴到源代码编辑器窗口或其他应用程序中。
- 如果单击收藏夹组顶部的配置扳手图标，会显示其他工具栏图标。通过这些图标，可以对收藏夹进行如下管理： -箭头图标在组中上下移动所选收藏夹。
- 单击此图标可创建一个标题，用于组织收藏夹。
- 单击此图标创建文本收藏夹。
- 从组中删除所选收藏。也可以通过转到收藏夹位置，右键单击并选择从收藏夹中删除命令来删除收藏夹。
- 重命名当前收藏夹组。
- 删除当前收藏夹组。
#figure(image("./img/2023-11-09 13.20.20.png"))
=== creating a plain text favorite
您可以在收藏夹中存储多个纯文本字符串，这样就可以快速将保存的字符串复制到剪贴板，然后根据需要粘贴到代码中。例如，您可以在文件开头或代码的其他地方使用标准注释。
要将文本保存为收藏夹，请按照以下步骤操作：
1.
在源代码编辑器中选择文本并单击右键。
#figure(image("./img/2023-11-09 13.31.png"))
2.
选择将选择添加到收藏夹，然后在子菜单中选择收藏夹组。
3.
创建收藏夹时，收藏夹组就会打开。
您也可以通过单击收藏夹区域中的图标（选择收藏夹区域顶部的配置图标即可看到）来创建文本收藏夹。您将看到新建文本收藏对话框。
在第一个字段中，键入要显示在收藏夹列表中的简短名称。
在第二个字段中，键入收藏夹的全文。
#figure(image("./img/2023-11-09 13.30.42.png"))
#figure(image("./img/2023-11-09 13.32.png"))
要使用文本收藏夹，请双击收藏夹列表中的收藏夹名称。这将把第二个字段中的长文本复制到剪贴板，以便粘贴到源代码编辑器中。
如果选中 "所有文本收藏夹复制到理解编辑器 "复选框，那么当你点击文本收藏夹时，你在第二个字段中键入的文本就会自动粘贴到文本光标位置的当前源代码编辑器窗口中。
= searching your source
本章介绍如何使用 Understand 的查找文件和实体定位器功能来定位源代码中的内容。
== searching: an overview(概述)
在大量源代码中查找内容是一件困难、乏味且容易出错的事情。
Understand 提供了多种在源代码中搜索字符串或查找特定行的方法。 这些选项的命令位于搜索菜单中。 下表(原书)列出的位置对这些命令进行了说明：
#figure(image("./img/2023-11-10 00.24.01.png"))
这些搜索方法各有利弊。它们共同提供了强大的方法，可以轻松查找您需要查找的内容，从而更好地理解和修改您的代码。
== instant(即时搜索) search
#footnote[这个instant居然是即时, 不是实例]
即时搜索功能可让你即时搜索整个项目，即使该项目包含数百万行源代码。 当你输入时，你可以看到与你目前输入的字符串相匹配的术语。
#figure(image("./img/2023-11-10 00.27.png"))
即时搜索 的搜索框位于 understand窗口的右上角。
如果看不到这个字段，请从菜单中选择 "视图">"工具栏">"搜索"。
要开始搜索，请单击 "搜索 "字段并输入要查找的字符串。 也可以按 Ctrl+Alt+S 或从菜单中选择 "搜索">"即时搜索"，将光标移动到 "搜索 "字段。
使用 "即时搜索 "的最简单方法是键入要在代码中匹配的字符串。 键入搜索字符串后按 Enter 键，即可在 "搜索结果 "区域看到与搜索匹配的文件列表。
即时搜索的搜索结果界面与在文件中查找的搜索结果界面相同。
右键单击该区域可展开或折叠结果树。 选择 "查找 "可使用 "上一个 "和 "下一个 "图标逐个浏览结果。
你可以双击文件打开文件，并查看搜索结果区域中的代码行。
#figure(image("./img/2023-11-10 00.28.png"))
即时搜索支持更强大的搜索选项。 该字段使用的语法基于开源文本搜索引擎库 Apache Lucene 使用的语法。
以下列表解释了一些可用的语法选项：
- 搜索不区分大小写。搜索 test 也会匹配 "Test "和 "TEST"。
- 除非使用通配符，否则搜索会匹配整个单词。搜索 test 不会匹配 "testfile"。
- 可用的通配符有 \*（任意数量的字母和数字）、? （任意单个字母或数字）。不能使用通配符作为搜索字符串的第一个字符。
- 在编制代码索引时（在后台进行），Instant Search 会在空白处和标点符号处（以及 C/C++、Java 和 Ada
的语法约定处）将代码分割成可搜索字符串。因此，以下代码行中的可搜索字符串是 "foreach"、1 和 10：
```cpp
foreach (i=1, i<10, i++)
```
- 您不能使用即时搜索查找跨越标点符号边界的字符串，也不能搜索标点符号本身。例如，不能搜索 "i=1"。您可以搜索包含空格的字符串（如注释中的文本），方法是用引号括起来。
- 您可以缩小搜索范围，在字符串、标识符和注释中进行搜索。默认情况下，它会搜索所有三种类型的匹配。例如，以下搜索只在带引号的字符串中查找 "test"：
```cpp
string:test
```
下面的搜索仅在变量名和函数名等标识符中查找 "test"：
```cpp
identifier:test
```
下面的搜索仅在注释中找到 "test"：
```cpp
comment:test
```
- 您可以使用布尔搜索。默认情况下，多个搜索词是 ORed 的。因此，搜索 "for delta "和搜索 "for OR delta "是一样的。两者都会匹配包含 "for "或 "delta "的文件。请记住，搜索字符串用于匹配整个文件中的术语，而不仅仅是单个语句中的术语。
- 如果要与术语相加，可使用 "for AND delta "这样的搜索。这会匹配同时包含 "for "和 "delta "的文件。
- 您可以使用 + 操作符来要求搜索词存在于找到的所有文件中。例如，下面的搜索会找到所有包含 "delta "且可能包含 "for "的文件：
```cpp
+delta for
```
- 您可以使用 NOT（或 -）操作符从结果中删除包含特定搜索词的文档。例如，以下搜索会找到包含 "delta "或 "delta0 "但不包含 "delta2 "的文档：
```cpp
delta delta0 NOT delta2 delta delta0 -delta2
```
- 您可以使用括号定义搜索中布尔操作符的顺序。例如
```cpp
(delta0 OR delta1) AND 更改
```
- 您可以在搜索词末尾加一个斜杠 (~) 来执行 "模糊 "搜索。
例如，`boo~` 可以匹配 foo、too 和 book。
== find in files
您可以搜索所有项目文件或其他选定文件中出现的文本字符串或正则表达式。 匹配结果显示在搜索结果窗口中，双击结果中的任意一行即可访问源代码。 通过选中 "替换 "框，可以在 "文件中查找 "和 "文件中替换"对话框之间切换。
要打开 "在文件中查找 "工具，请从菜单栏中选择 "搜索">"在文件中查找"，或从任何上下文菜单中选择 "在...中查找"，或按 F5 键。
#figure(image("./img/2023-11-10 00.34.47.jpeg"))
在文件中查找 "区域允许你搜索多个文件中出现的字符串。 在以前的版本中，该功能被称为 Hyper Grep，因为它与 Unix 命令 grep
相似。指定搜索如下：
- 查找：键入要搜索的字符串。其他字段控制搜索的执行方式。通过下拉列表可以从最近的查找字符串中进行选择。
- 文件类型： 您可以选择各种语言的文件扩展名来缩小搜索范围。或者，输入您自己的文件扩展名模式。将此字段留空可搜索所有文件。如果 "查找 "字段设置为 "打开文件"，则不能使用此字段。选中 "排除文件类型 "复选框可从搜索中排除所选文件类型，并搜索项目中的所有其他文件。
- 大小写敏感： 选中此复选框可进行大小写敏感搜索。默认情况下忽略大小写。
- 匹配整词： 选中此复选框可仅匹配正则表达式中的整词（"test "匹配 "test"，但不匹配 "testing"）。对于固定字符串和通配符搜索，单词边界将被忽略。
- 搜索类型： 选择使用固定字符串、通配符还是正则表达式匹配。
- 查找： 选择是否搜索项目文件（所有文件或仅打开的文件）、所选架构节点中的文件、所选目录中的文件或所选文件。
#figure(image("./img/2023-11-10 08.49.png"))
对于架构、目录列表和文件列表搜索，单击 + 添加位置。 单击铅笔图标修改所选位置。 单击红色 X 图标删除所选位置。
您可以取消选中某个位置，以暂时禁止搜索该位置。
如果选择 "架构"，单击 + 浏览架构节点。
如果选择目录列表，单击可浏览目录。 您可以单击 X 图标暂时将所选目录排除在搜索范围之外，或单击垃圾桶图标永久排除某个目录。 使用上下箭头对列表进行排序。
如果选择文件列表，可以单击 + 浏览文件。
如果选择 "打开的文件"，则会搜索当前打开的所有文件。 您可以选中 "仅搜索活动文件 "框或使用文件类型规范来限制搜索的打开文件。
右键单击源代码或其他地方的实体时，"查找 "命令可让您为所选文本字符串选择其中一个选项。 查找 "和 "查找对象 "字段会自动填写。
#figure(image("./img/2023-11-10 08.50.png"))
- 语义选项： 如果选择在 "项目文件 "或 "架构 "中查找，则可以选中 "仅在其中显示结果 "复选框，以控制报告哪些匹配结果。然后，您可以选中注释、字符串、语句和非活动代码框中的任意组合，以便在结果中包含这些类型的行。如果选中 "仅在其中显示结果 "复选框，则必须至少选中其中一个复选框。
- 替换： 选中该框可切换到 "替换文件"对话框。
指定搜索条件后单击查找。 搜索结果窗口中将显示所有匹配实例的列表。 如果搜索耗时较长，需要更改条件，可以单击停止。
=== search results
搜索结果区域会列出找到的匹配项。 结果列表中列出了出现字符串的每一行。
#figure(image("./img/2023-11-10 09.01.png"))
双击结果可查看匹配项的源代码。 这将打开源代码编辑器并高亮显示匹配项。
多个搜索结果显示在结果列表中。 右键单击窗口背景并选择全部展开可展开窗口中的所有搜索节点。 或者选择 "全部折叠"，将列表压缩到只有顶层搜索列表。
结果工具栏提供以下控制：
- 撤销和重做操作，例如，选择一行并单击该行右端的图标，即可从列表中删除搜索结果。
- 转到 "在文件中查找 "对话框。
- 在源编辑器中打开所选匹配。
- 在当前选定的结果集中搜索。
右上角的汉堡菜单(三条纹)提供以下命令：
- 显示文件显示简短名称（只有文件名）、完整名称（完整文件路径）或相对名称（相对于 项目的文件路径）。
- 按组织结果更改最新结果的组织。可以选择在每个搜索结果旁边显示文件名的平面列表、按文件分组的列表或使用架构的树形列表。
- 显示标准（Show Criteria）会在显示结果数量的行中显示用于搜索的搜索选项。
- Expand All On Search（搜索时全部展开）会在执行新搜索时展开所有行。
- 清除搜索前的结果 在运行新搜索时，会自动清除上一次搜索的结果。您可以使用 "撤消 "图标恢复已清除的结果。
在右键单击上下文菜单中，可以选择 "复制 "或 "全部复制"，将窗口内容复制为文本，以便粘贴到其他地方。
选择 "搜索">"显示搜索结果 "可以重新打开 "结果 "窗口。
=== replace in files
从菜单栏中选择 "搜索">"替换文件"，或选中 "查找文件 "工具中的 "替换 "框，即可使用 "替换文件 "工具。
#figure(image("./img/2023-11-10 09.02.png"))
该工具中的字段与 "在文件中查找 "工具中的字段相同，但有以下例外：
- 在 "替换 "字段中，您可以键入要替换匹配字符串的文本。
- 在 "搜索类型 "字段中，除了 "文件中查找 "的可用选项外，您还可以选择 "正则表达式 - 非贪婪"。
- 要在 "替换文件 "和 "查找文件 "工具之间切换，请选中或取消选中 "停止 "按钮上方的 "替换 "框。
- 如果完全确定要进行所有更改，请选中 "跳过审查 "复选框。单击 "查找 "后，更改将立即完成，而不是像下图所示那样显示出来，等待接受或驳回。
Understand检查任何未保存的源文件。 如果有未保存的文件，则必须单击 "是 "保存所有未保存的更改，然后才能进行更改或预览更改。
无论是否选中 "替换 "复选框，结果都会显示在相同的 "搜索结果 "区域。 但是，如果选中了 "替换 "框并键入了 "替换 "字符串，则会看到文本替换后的结果。
#figure(image("./img/2023-11-10 09.03.png"))
单击结果可打开 "替换预览 "视图，显示包含结果的文件在文本被替换前后的对比。 这只是预览，文本尚未被替换。
#figure(image("./img/2023-11-10 09.04.png"))
在搜索结果中，右键单击一行并选择接受 (Ctrl+K) 或接受/访问下一步 (Ctrl+Alt+P)，即可替换文本。 右键单击并选择取消结果
(Del)，拒绝替换。 如果在文件名或目录结构节点上单击右键时选择这些命令，则这些命令适用于整个文件或目录及其子目录中的所有文件。
接受和拒绝图标显示在所选结果的 "搜索结果 "右侧，单击后可接受或拒绝结果。
接受或拒绝替换后，它们会从结果列表中删除，因为你已经处理过它们。
如果要取消最近的替换，请右键单击并选择 "撤消"。
#figure(image("./img/2023-11-10 09.05.png"))
搜索结果 "区域中的其他右键命令允许你展开和折叠结果树、复制结果以及导航到上一个或下一个结果、文件或另一个搜索结果集。
== entity lacator
并非所有实体都属于 "实体筛选器 "中显示的选项卡类别。 你可以使用 "实体定位器"（Entity
Locator）查找和了解更多有关任何实体的信息，它提供了一个项目中实体的可过滤列表。
你可以按名称、实体类型、实体声明的位置、实体声明的容器或实体最后修改的时间进行过滤。 还可以使用架构层次对实体进行排序。
要打开 "实体定位器"，请从主菜单栏中选择 "搜索">"查找实体 "或 "视图">"实体定位器"。
#figure(image("./img/2023-11-10 09.06.png"))
与 Understand 中的其他窗口一样，右键单击 "实体定位器 "中任意位置的实体时，会出现该项目可用命令的菜单。
如果选中 "同步 "复选框，在其他 Understand 窗口中选择实体会导致实体定位器选择该实体，除非过滤器阻止显示该实体。
=== resizing columns
列宽的大小可以调整每一列的可见度。 您可以拖动两列之间的列头分隔线，向左调整列的大小。
或者，在显示双头箭头时双击栏标题分隔线，分隔线左侧的字段就会扩大或缩小到查看该栏所有项目所需的最大尺寸。
您可以右键单击列标题并选择冻结列，将该列移动到左侧并防止其被重新定位。
=== long VS short names(长路径, 短路径)
在 "实体"、"已声明 "和 "文件 "列中，您可以右键单击列标题或单击汉堡包菜单(三条纹)， 然后选择 "实体名称 "来设置实体名称的显示格式， 选择 "文件名称 "来设置文件名的显示格式。
对于实体，可以选择短名或全名（包括编译单元的名称）。 对于文件名，可以选择短路径、全路径或相对路径。
=== column headers
列标题是实体定位器中的工具。左键单击它们可根据该列进行排序。 右键单击一列或单击汉堡包菜单，可以查看控制实体列表、排序和过滤方式的命令。
#figure(image("./img/2023-11-10 09.09.png"))
实体列表可以按任意列排序。 左键单击列标题可在升序和降序排序之间切换。 默认排序顺序为实体名称升序。
=== choosing columns
单击实体定位器右上角的 + 图标，查看定位器列选择器。
#figure(image("./img/2023-11-10 09.10.png"))
实体列必须始终显示。您可以启用或禁用其他列。
=== filtering the list
通过每列标题下方的字段，可以过滤实体定位器显示的实体。 过滤器可以手动输入，也可以根据右键点击的内容自动输入。
例如，你可以通过 "种类 "列从下拉列表中选择一个种类进行过滤。 也可以右键单击 "种类 "列中列出的任何项目，然后从菜单中选择 "按选择过滤"。
这将过滤实体列表，使其只包含您所选种类的实体。 标题栏会显示有多少实体符合筛选条件。
或者，您也可以直接在任何字段中键入过滤器。要搜索不包含特定字符串的字段值，请键入 `!`(感叹号），然后输入过滤器。
要清除筛选器，只需删除列标题字段中的文本，或右键单击列标题并选择 "清除筛选器 "或 "清除所有筛选器"。
您可以使用 "上一个 "和 "下一个 "按钮浏览您使用过的筛选器的历史记录。
下面的示例显示了实体种类的 "按选择过滤"：
#figure(image("./img/2023-11-10 09.14.png"))
#figure(image("./img/2023-11-10 09.15.png"))
要过滤 "已修改日期 "列，左侧下拉菜单让你选择一个比较运算符（<, <=, =, >=, >），右侧下拉菜单让你从日历中选择一个日期。
您可以通过键入修改时间。 要过滤实体，除了日期外，还必须选择比较运算符。
#figure(image("./img/2023-11-10 09.16.png"))
同样，您可以通过 "选择列 "启用度量列，使用比较运算符进行筛选。 例如，您可以过滤实体，只显示循环复杂度大于某个值或注释与代码比小于某个值的实体。
右键单击一列或单击汉堡包菜单可查看该列的上下文菜单。 你可以选择过滤器的大小写敏感度为大小写敏感或大小写不敏感（默认）。
还可以将筛选模式语法设置为使用固定字符串（默认）、通配符或正则表达式。
- 固定字符串： 如果在列值的任何位置找到精确的字符串，就会匹配您输入的字符串。
- 通配符： 通配符是 \* 或 ?，其中 \* 匹配任意长度的字符串，而 ? 匹配单个字符。例如，??ext_io 可匹配以 ext_io 结尾且包含 8
个字母的任何名称。
- 正则表达式： 过滤和处理文本的一种强大而精确的方法。如果使用正则表达式，则不能使用大小写敏感选项。
使用 ! 搜索不包含特定字符串的字段值，可以与任何过滤模式语法一起使用。
下表列出了正则表达式中使用的一些特殊字符。
#figure(image("./img/2023-11-10 09.17.55.png"))
#figure(image("./img/2023-11-10 09.18.40.png"))
对正则表达式的全面解释超出了本手册的范围。 Unix 用户可以使用 "man -k regex "命令查看 regex 的手册页面。 如需全面解释，请参阅
O'Reilly and Associates 出版的"Mastering Regular Expressions"一书
(www.ora.com/catalog/regex)。
== finding windows
如果打开了多个窗口，可以使用窗口菜单中的选项来组织或查找特定窗口。
选择窗口 > 关闭 `<当前窗口>` 可以关闭当前文档窗口。 选择窗口 > 关闭所有文档窗口，可以关闭所有源文件、图形视图和其他文档窗口。
如果打开了多个窗口，可以右键单击正在使用的窗口的选项卡， 然后选择全部关闭、除此窗口外全部关闭、向左关闭所有选项卡或向右关闭所有选项卡。
#figure(image("./img/2023-11-10 09.21.png"))
选择 "窗口">"释放窗口"，将选项卡区域更改为可在屏幕上调整大小和移动的独立窗口。 从已释放窗口右上角的汉堡包菜单中选择捕捉窗口，将该窗口替换为主窗口。
窗口菜单还允许您使用窗口 > 垂直分割工作区或窗口 > 水平分割工作区来分割文档区域。 当文档区域被分割时，在选中其复选框的那一半区域会打开新的区域。
您可以根据需要将选项卡从文档区域的一半拖到另一半。 选择窗口 > 取消分割工作区可移除分割。
使用窗口 > 将窗口重置为默认布局可返回原始布局。
窗口 > 窗口导航器命令（Ctrl+Tab）可打开当前打开窗口的临时列表。 按回车键或双击列表中的项目时，列表将消失，而焦点将指向所选项目。 打开
Windows 导航器时按 Tab 键可循环浏览项目列表。 按 Esc 键可以在不选择窗口的情况下退出该区域。
#figure(image("./img/2023-11-10 09.22.png"))
您可以从 "显示 "列表中选择一种窗口类型，从而减少此处列出的窗口数量。 或者，也可以在 "筛选器 "框中输入。
选中字母排序框可以对停靠窗口和文档窗口进行排序。
默认情况下，如果按下 Ctrl+Tab 键，Windows 导航器会关闭， 并在松开 Ctrl 键时切换到所选窗口。 (您可以选中 "粘滞 "复选框，使
Windows 导航器等待您按 Enter 或双击。
=== source visiting history(源代码访问历史?)
您可以使用工具栏上的 "上一页 "和 "下一页 "图标，向前或向后查看源代码的历史访问位置。 即使在不同的理解会话之间，历史记录也会被保存。
您可以单击向下箭头查看历史记录中的源代码位置列表。 您可以从下拉的 "返回 "列表中选择 "清除历史记录 "来清除浏览历史记录。
=== view menu commands
如果在此会话期间分析过项目，可以使用查看 > 分析日志命令重新打开日志。
查看 > 窗口选择器 "命令会打开一个区域，列出当前打开的窗口。 单击窗口名称使其处于活动状态。
#figure(image("./img/2023-11-10 09.23.png"))
默认情况下，该区域只列出文档窗口，但您可以使用 "显示 "下拉菜单更改列出的窗口类型。 任何已发布的窗口都以斜体下划线显示。
图标显示窗口类型，包括源文件是否未保存。
当 "选择器 "区域处于活动状态时，您可以在该区域底部键入过滤器，以快速缩小列表范围。 按 Backspace 键可删除筛选器。
您可以使用汉堡包菜单将顺序从字母顺序改为最近使用的顺序或文件扩展名顺序。 还可以使用汉堡包菜单更改文件名格式，以显示短路径、相对路径或绝对路径。
使用选择器可以方便地在多个窗口上执行关闭等操作， 方法是从列表中选择多个窗口，单击右键，然后选择关闭所选窗口或关闭未选窗口。
如果在源代码中创建了书签，则可以使用查看 > 书签命令打开书签列表。
=== displaying toolbars
在工具栏或菜单栏上单击右键并选择一个类别，即可在主 "理解 "窗口中隐藏或显示工具栏图标的类别。 工具栏分为以下类别：
项目、文件、编辑、分析、编辑器历史记录、图表、用户工具、浏览、分割工作区、作用域和搜索。
您还可以通过选择 "视图">"工具栏 "来隐藏和显示工具栏图标。
#figure(image("./img/2023-11-10 09.24.png"))
=== session browser
understand使用最新的会话布局打开项目。 对打开的工具、工具栏、选项卡和其他功能及其大小和位置所做的更改会自动保存为会话的一部分。
您可以使用会话浏览器创建并保存多个会话布局。 选择windows > session browser可查看会话列表。
您可以使用该区域的工具栏图标将当前布局添加为会话、从列表中删除当前高亮显示的会话、
复制高亮显示的会话以便从此处修改布局、重命名高亮显示的会话以及按名称筛选会话列表。
#figure(image("./img/2023-11-10 09.25.png"))
要返回原始布局，请选择windows > Reset Windows to Default Layout.
会话信息存储在项目文件夹中的 session.json 文件中，可以与其他用户共享。
== searching in a file
本节所述的搜索技术用于搜索单个源文件。
=== find next and previous
要在当前文件中快速搜索，请按 Ctrl+F（或选择搜索 > 查找）。 源代码编辑器的状态栏会变为搜索栏。
#figure(image("./img/2023-11-10 09.27.png"))
您可以在字段中键入一个字符串。 当你输入时，源代码编辑器中会高亮显示该字符串的匹配项。 如果文件中不存在该字符串，搜索栏会变成红色。
使用 Ctrl+F 移动到下一个出现的字符串。 使用 Ctrl+Shift+F 查找上一次出现的内容。
单击 "上一个 "或 "下一个 "箭头从一个匹配项移动到另一个匹配项。 你可以选中大小写敏感和整词复选框来修改搜索的执行方式。
如果选中隐藏框，那么只要点击代码，增量搜索栏就会隐藏。 再次按下 Ctrl+F 时，就会显示上次的搜索结果。
=== find & replace
如果要在单个源代码文件中使用 "查找和替换 "或正则表达式进行搜索， 可以使用 "查找 "对话框。 要打开此对话框，请选择seaerch > find and
replace菜单项或按 Ctrl+Alt+F。
#figure(image("./img/2023-11-10 09.29.png"))
在查找字段中，键入要查找的字符串。
可以选中 Regular expression, Match case, or Match whole words 来修改搜索的执行方式。
如果选中正则表达式复选框，就可以使用 Unix 风格的模式匹配。
如果要替换搜索到的字符串，请在 "替换 "字段中键入。
单击 "上一步 "或 "下一步"，向任一方向搜索。 如果要替换当前文件中找到的字符串，请单击 "全部替换"、"替换 "或 "替换和查找"。
查找对话框只搜索单个文件。
=== contextual information(上下文信息)
上下文信息 "视图类似于 "范围列表"，但功能更强大。 从菜单中选择 View > Contextual Information，即可打开该视图。 单击 "源编辑器 "工具栏中的图标可打开或关闭 "上下文信息 "视图。
#figure(image("./img/2023-11-10 09.31.png"))
该视图显示当前活动的源编辑器的结构。选项卡提供以下信息：
- 结构浏览器：
这是当前文件的扩展范围列表。它列出了文件中的结构名称。除函数外，它还列出了包含、宏、类等。名称旁边的图标表示实体的类型。如果将鼠标光标指向某个项目，悬停文本会显示实体类型和名称。按
Ctrl+F 在此选项卡中搜索。
- 文件信息： 此选项卡提供当前文件的信息浏览器。
- 范围信息： 该选项卡提供当前实体的信息浏览器，即在 "结构浏览器 "选项卡中突出显示的实体。
- 上下文浏览器： 该选项卡左侧显示当前实体在层次结构中的位置，右侧显示其包含的实体。
文件信息 "选项卡右侧的切换图标会将 "源编辑器 "和 "上下文信息 "视图中的当前文件更改为同一目录下名称相同但扩展名不同的文件（"伴生文件"，如果存在的话）。例如，切换图标可以从
`*.c` 或 `*.cpp` 文件切换到同名的 `*.h` 文件。
一如既往，右键单击这些标签页中的任何一个，都会提供有关每个实体更多信息的链接。
= editing your source
本章介绍 Understand 的源代码和文本文件编辑器。
== source editor
源代码编辑器是一个功能齐全的源代码编辑器，具有语法着色功能，右键可访问代码中大多数实体的信息。
行号和用于展开/折叠代码块的 "折叠 "标记可以在 "工具">"选项 "命令打开的understand options对话框的 "编辑器 "类别中打开或关闭。
还可以在编辑器类别中更改显示字体和其他一些项目。 还可以在该对话框类别中启用书签、缩进引导标记和右边距标记（页面引导）。
通过understand options对话框的editor > advanced类别，
您可以控制从源代码编辑器打印时的格式、搜索时滚动条中的高亮显示、复制粘贴行为、自动完成、自动缩进等。
通过understand options对话框中的editor > styles类别，可以更改不同类型源代码所使用的颜色和样式。
按键绑定类别显示了可在编辑器中使用的按键列表（并允许你修改列表）。
=== file icons
源代码编辑器中的每个文件在其选项卡中都有一个图标。 图标中的字母表示文件使用的语言。 如果文件已修改但未保存，图标为蓝色，文件名旁边会显示一个星号。
如果文件已在文件系统中删除，则选项卡中的文件名显示为删除线文本。
=== scope list
作用域列表对于在大文件中跳转非常有用。 通过从工具栏上的作用域下拉列表中进行选择， 可以跳转到当前源文件中的特定函数、存储过程或其他特定语言结构体。
构造按字母顺序列出。 下拉列表显示了上次分析项目时文件中的所有此类结构体。
#figure(image("./img/2023-11-10 09.37.png"))
您可以选择 View > Scope List ，在entity filter显示区域的scope tab中打开列表。 结构体开始的行号也会显示出来。
#figure(image("./img/2023-11-10 09.38.png"))
单击项目可在信息浏览器中查看相关信息。 双击一个项目，可跳转到声明或创建该项目所在的位置， 并高亮显示当前源文件中出现该名称的所有位置。
您可以右键单击范围选项卡，从上下文菜单中选择排序顺序。 升序和降序按字母顺序排序或按字母顺序倒序排序。 默认情况下是按行号排序。
#figure(image("./img/2023-11-10 09.39.png"))
=== toolbar
源代码编辑器的工具栏可能包含以下图标：
使用汉堡包菜单中的工具栏部分类别，可以隐藏或显示源代码编辑器工具栏中的所有图标。可用的工具栏部分有
#figure(image("./img/2023-11-10 09.42.43.png"))
- 作用域：选择要跳转到的函数或类似实体。请参阅 "范围列表"。
- 分割编辑器：水平、垂直分割源代码编辑器窗口，或删除分割。
- 版本控制 执行 Git 整合操作。显示/隐藏空白处的 "责备 "栏，打开未提交更改差异视图。
- 停靠窗口： 显示/隐藏上下文信息视图和注释查看器。
- 浏览模式：切换浏览模式的开启或关闭。
- 释放窗口： 在主窗口中释放/捕获窗口。
- 问题：移动到源代码中发现的下一个/上一个问题。这些问题可能由 CodeCheck 或项目分析检测到。单击 "注意 "图标打开 "问题 "侧边栏，其中提供了问题描述。
#figure(image("./img/2023-11-10 09.42.09.png"))
=== status line
当 "源代码编辑器 "是活动窗口时 ，understand窗口底部的状态栏会显示 CodeCheck 上次在该文件上运行的时间
、光标位置的行号和列号、该文件的制表符宽度设置 、文件是读写模式还是只读模式以及源代码语言。
#figure(image("./img/2023-11-10 09.423.png"))
如果单击状态栏中的行号（或从菜单中选择Search > Go to Line），则可以使用转到行对话框。
如果单击制表符宽度，可以更改此文件的制表符宽度。
#figure(image("./img/2023-11-10 09.44.png"))
如果单击 RW（读写）指示器，则会将模式更改为 RO（只读）。
如果点击语言，则可以选择该文件使用的语言。
=== selecting and copying text
可以选择（标记）文本，然后剪切或复制到 Windows（或 X11）剪贴板。 选择文本按照所用操作系统的标准进行。 在 Windows
系统中，按住鼠标左键拖动即可选择文本。 或者，你也可以按住 Shift 键并移动光标（通过箭头或鼠标）。 在 "编辑 "菜单或上下文菜单中选择 "全选 "命令来选择整个文件。
如果按住 Alt 键（X Windows 上为 Ctrl 键）， 可以拖动鼠标来选择源代码的矩形区域， 例如，将左侧空白处的制表符排除在复制文本之外。
你也可以在源代码编辑器中粘贴矩形区域的代码。
#figure(image("./img/2023-11-10 09.45.png"))
选择文本后，可以使用编辑菜单或上下文菜单中的剪切和复制命令。 然后，您可以根据需要将文本粘贴到其他应用程序中。
对于有类路径和文件的实体，复制命令可以复制简短名称。 上下文菜单中的 "复制全名 "命令可以复制完整的类路径或文件路径。
=== browse mode
单击编辑器工具栏上的浏览图标或从菜单中选择view > browser mode，即可将源码编辑器切换到browser模式。 进入浏览模式后，图标会突出显示。
如果在source editor工具栏中看不到browser图标， 请从source editor的汉堡包(三条纹)菜单中选择Toolbar Sections
> Browse Mode。
在浏览模式下，代码中的实体就像链接一样。 当鼠标光标移动到链接处时，会显示下划线。 单击链接会移动到该实体的声明处，并更新信息浏览器以显示该实体的详细信息。
如果找不到单击的实体声明，状态栏中会显示一条信息，电脑也会发出蜂鸣声。
在浏览模式下，你仍然可以编辑文件，键盘和右键功能与常规模式下相同。 只有左键单击鼠标有所不同。
在使用源代码编辑器窗口时，按住 Ctrl 键可以暂时进入浏览模式。
=== context menu
源编辑器中的上下文菜单提供了许多探索和编辑功能。 许多功能可让您查找右键单击实体的相关信息。 上下文菜单中通常包含以下探索功能（取决于单击的位置）：
- 查看信息
- 图形视图
- 查看依赖关系
- 交互式报告
- 添加到收藏夹
- 比较
- 分析
- 添加/移除到架构
- 注释
- 探索
- 在...中查找
- 浏览指标
- 隐藏不活动的行
- 添加书签
上下文菜单中通常还包括以下编辑功能：
- 重构
- 撤销/重做
- 剪切/复制/粘贴
- 复制全名
- 全选
- 从项目中删除
- 编辑文件
- 跳转到匹配块
- 选择块
- 隐藏/显示不活动的线条
- 全部折叠
- 软包边
- 批注选择/取消批注选择
- 排序选择
- 更改大小写
- 重新缩进选择/文件
- 还原
=== hover text
如果将鼠标光标指向源代码中的实体，就会看到一条显示该实体声明信息的信息。
例如，指向变量会显示变量的类型，指向常量会显示常量的值，指向函数调用会显示参数和返回值。
#figure(image("./img/2023-11-10 10.17.png"))
== saving source code
如果您编辑了源文件，可以单击保存更改。
或者按 Ctrl+S 或选择文件 > 保存。
您可以选择文件 > 另存为，保存为不同的文件。
如果将项目文件保存为另一个文件名，系统会询问您是否要将新文件添加到项目中。
如果您编辑了多个源文件，可以单击保存所有修改的文件。
或选择文件 > 全部保存为
如果想忽略上次保存后所做的更改，请右键单击文件并选择还原。
你可以从菜单中选择窗口 > 关闭 `<当前文件>` 来关闭当前源文件。
也可以用鼠标中键单击源文件区域上方的选项卡来关闭该选项卡（如果鼠标有中键的话）。
您可以选择窗口 > 关闭所有文档窗口来关闭所有源文件。
也可以右键单击源文件区域的选项卡，
然后选择关闭、全部关闭、关闭除此以外的所有选项卡或关闭右侧/左侧的所有选项卡。
== refacotring(重构) tools
重构工具允许你对代码进行结构性修改。
理想情况下，重构不会改变代码的行为。
重构工具允许您使用代码比较窗口预览更改。
重构更改可能会对代码产生重大影响，因此在提交之前应进行审查，以确保更改是正确的。
#figure(
image("./img/2023-11-10 10.20.png")
)
以下重构工具可用于所选实体或代码：
- 重命名
- 内联函数
- 提取函数
- 内联范围
- 内联温度
- 提取临时文件
如果选择重构命令时文件尚未保存，系统会询问您是否保存文件并重新分析项目。
我们建议您这样做，以便 Understand 项目分析包含项目的最新信息。
#figure(
image("./img/2023-11-10 10.21.png")
)
如果您执行了重构操作，然后决定不需要该更改，
请右键单击并从上下文菜单中选择 "重构">"撤销"。
在某些情况下，由于后续更改，重构操作无法撤销。
=== renaming entities
提供重命名实体的命令是为了支持代码重构，使代码更易读。
通过该命令，您可以在整个项目中更改实体的名称。
refactor > rename 命令与文件中的替换类似。
但不同的是，refactor > rename 命令会确定哪些用途适用于特定实体。
这使它成为重命名以下内容的更好方法：
本地使用的变量、应用程序中具有各种名称空间的实体，
以及名称可能是另一个实体名称一部分的实体（例如，重命名 "src "变量而不重命名 "srcTimer"）。
要使用 Refactor > Rename 命令，请按以下步骤操作：
1.
高亮显示要更改的实体名称（例如函数或参数）。
2.
右键单击并从上下文菜单中选择refactor > rename。
3.
在对话框中为该实体键入新名称，然后单击preview changes。
如果所选实体是 C++ 覆盖或宏，则会提供其他选项：
- 如果所选实体是基类声明为虚拟的类方法，且派生类也实现了该方法，则可以选中rename overrides，以重命名方法覆盖。
- 如果所选实体是名称相同但参数不同的重载类方法，则可以选中重命名重载来重命名派生方法。
- 如果所选实体有一个同名的宏，可以选中rename in macros来重命名实体及其匹配宏。
4.
如果完全确定要执行重命名操作，请单击 apply changes。
5.
此时会打开一个对话框，让您检查使用该实体名称的所有实例以及如何更改该名称。
#figure(
image("./img/2023-11-10 10.25.png")
)
6.
如果确定要进行所有更改，请单击确定。
=== inlining functions
内联函数是一种常见的优化技术，
它将函数的代码放在调用该函数的位置，
而不是放在单独的函数中。
在编译语言中，这通常可以通过编译器优化来实现，
但出于各种原因（包括代码清晰度），
内联源代码可能是有用的。
需要注意的是，内联需要权衡利弊。
如果一个函数在很多地方被调用，内联代码会导致代码体积增大，代码可维护性降低。
要使用 Refactor > Inline Function 命令，请按照以下步骤操作：
1.
高亮显示要内联的函数名称。
2.
右键单击并从上下文菜单中选择重构 > 内联函数。
3.
单击预览更改。如果完全确定要执行内联操作，请单击 "应用更改"。
4.
系统将打开一个对话框，让您检查所有将发生的更改。exploring difference介绍了此对话框中的图标和下拉菜单。
#figure(
image("./img/2023-11-10 10.28.png")
)
5.
如果确定要进行所有更改，请单击确定。
=== extracting functions
与函数内联相反的是函数提取。
您可以将某些代码抽取到一个单独的函数中，
这样它就可以在多个地方被调用，
并在一个地方被维护。
要使用 Refactor > Extract Function 命令，请按照以下步骤操作：
1.
反白要提取为函数的代码。
2.
右键单击并从上下文菜单中选择重构 > 提取函数。
#figure(
image("./img/2023-11-10 10.31.png")
)
3.
为要提取并从该代码位置调用的函数键入一个名称。
4.
选择函数要返回的值或变量。
5.
对于要传递给函数的参数，可以使用 "上移 "和 "下移 "按钮更改顺序，并选中复选框以确定以常量值或引用方式传递的参数。
6.
单击预览更改。如果完全确定要执行操作，请单击 "应用更改"。
7.
此时会打开一个对话框，让您检查将要发生的所有更改。exploring difference介绍了此对话框中的图标和下拉菜单。
#figure(
image("./img/2023-11-10 10.32.png")
)
8.
如果确定要进行所有更改，请单击确定。
=== inlining scope
内联作用域重构可用于将普通枚举改为枚举类，
或删除 "using namespace" 语句。
枚举声明将更改为enum class声明，枚举的名称将被添加到使用枚举值的地方。
要使用 Refactor > Inline Scope 命令，请按以下步骤操作：
1.
高亮显示源代码或信息浏览器等工具中的枚举名称。
2.
右键单击并从上下文菜单中选择重构 > 内联范围。
#figure(
image("./img/2023-11-10 10.35.png")
)
3.
单击预览更改。如果完全确定要执行操作，请单击 "应用更改"。
4.
这时会打开一个对话框，让您检查将发生的所有更改。
exploring difference介绍了此对话框中的图标和下拉菜单。
=== inline temp
内联临时重构可用于初始化后不再设置的局部变量或临时变量。
内联后，该变量的使用将替换为初始化后的表达式。
在下面的示例中，
只要 patlen 和 altmin 的值在初始化和使用 patlen 之间不发生变化，
就可以将 patlen 内联为 altmin：
```cpp
int patlen = altmin;
for (k = str + patlen - 1; k < strend;) {
...
}
```
要使用 Refactor > Inline Temp 命令，请按照以下步骤操作：
1.
反白要内联的变量。
2.
右键单击并从上下文菜单中选择 Refactor > Inline Temp。
3.
如果希望替换变量的表达式用小括号包围，请选中复选框。
4.
单击预览更改。如果完全确定要执行操作，请单击 "应用更改"。
#figure(
image("./img/2023-11-10 10.38.png")
)
5.
系统将打开一个对话框，让您检查所有更改. exploring difference介绍了此对话框中的图标和下拉菜单。
#figure(
image("./img/2023-11-10 10.39.png")
)
6.
如果确定要进行所有更改，请单击确定。
=== extract(提取) temp
与内联临时变量相反的是提取临时变量。如果您有一个复杂的表达式，您可能希望将该表达式的一部分赋值给一个局部变量或临时变量，以便在该函数中重复使用您选择的表达式。
要使用 Refactor > Extract Temp 命令，请按照以下步骤操作：
1.
选中要提取到局部变量或临时变量的表达式。
2.
右键单击并从上下文菜单中选择 Refactor > Extract Temp。
3.
在对话框中为提取的变量键入名称，然后单击预览更改。如果完全确定要执行操作，请单击 "应用更改"。
#figure(
image("./img/2023-11-10 10.40.png")
)
4.
系统将打开一个对话框，让您检查所有更改,
exploring difference介绍了此对话框中的图标和下拉菜单。
#figure(
image("./img/2023-11-10 10.41.png")
)
5.
如果确定要进行所有更改，请单击确定。
== other editing features
源代码编辑器还提供了其他几个显示和编辑文件的选项：
- 预览器，
- 括号匹配
- 折叠和隐藏
- 更改源代码字体大小
- 分割编辑器窗口
- 更改大小写
- 注释和取消注释
- 缩进
- 换行
- 插入和套打模式
- 按字母顺序排序行
- 键盘命令
- 录制、播放和保存宏
- 创建和打开文件
- 书签
- 管理源代码编辑器选项卡
=== previewer
预览器窗口类似于源代码编辑器窗口。
要打开预览器窗口，请选择View > Previewer。
预览器与源代码编辑器的区别如下：
- 不能在预览器窗口中编辑代码。
- Sync checkbox；如果选中此复选框，单击另一个视图（如实体过滤器）中的实体时，将打开预览器中定义实体的位置。
- Prefer checkbox；如果选中此复选框，则双击另一视图中的实体时，将打开预览器中定义实体的位置，而不是源编辑器。(在预览器中双击总是会移动到源编辑器中的该行）。
#figure(
image("./img/2023-11-10 10.45.png")
)
=== bracket matching
Understand 编辑器的一项便捷功能是语法括号匹配。
使用该功能可以找到与大括号、小括号或括号匹配的结尾字符。
匹配的符号有 `( )`、`{ }` 和 `[ ]`。注释内不进行匹配。
按下 Ctrl+j（或右键单击并Jump to Matching Brace），
编辑器会跳转到匹配的结尾或开头括号。
除非编辑光标位于可以匹配的符号旁边，否则 Ctrl+j 不会激活。
再按一次 Ctrl+j 就会回到开始的位置。
您也可以从菜单中选择Search > Go to Matching Brace。
按 Ctrl+Shift+J（或右键单击并Select Block）可以选择从括号到匹配括号的所有文本。
将光标移至没有匹配的括号时，该括号会以红色高亮显示。有匹配的括号则以绿色高亮显示。
当光标位于匹配的预处理器指令上时（例如 `#ifdef` 和 `#endif`），
可以使用 Ctrl+j（或右键单击并Jump to Matching Keyword）将编辑光标移动到匹配处。
=== folding and hiding
行号旁边的三角形允许你 "折叠 "代码，以隐藏函数、if 语句和其他有开头和结尾的语句等代码块。
#figure(
image("./img/2023-11-10 10.48.png")
)
再次点击三角形或点击代码。
代码中的绿点打开折叠后的代码。
如果右键单击代码，可以选择 "全部折叠 "来关闭所有打开的代码块。
在 `//` 被视为注释开头的语言中，您可以为代码添加明确的折叠标记。例如
```cpp
//{{ /* 代码折叠后隐藏 */ //}}
```
您还可以右键单击并选择Hide Inactive Lines，
以隐藏因未定义预处理器宏而未激活的预处理器行。
选择show Inactive Lines可再次查看所有行。
=== Changing the Source Code Font Size
使用 tools > options 命令打开的 "选项 "对话框的 "编辑器 "类别中，
可以更改默认显示字体和字体大小。
=== splitting the editor window
您可以垂直或水平分割源代码编辑器窗口，
以便滚动查看文件中的多个位置。
这些分割图标显示在工具栏中：
#figure(
image("./img/2023-11-10 10.50.32.png")
)
单击 splite vertically 或 splite horizontally 图标，
将源码编辑器分割成两个或多个可单独滚动的窗格。
源编辑器窗口不能双向分割，
但可以在同一方向多次分割。
单击 "移除分割"（Remove Split）图标，
从光标当前所在的窗格中移除分割层。
#figure(
image("./img/2023-11-10 10.51.png")
)
=== changing case
您可以在源代码编辑器中更改所选文本的大小写。
请按照以下步骤操作：
1.
在源代码中选择一个或多个单词。
2.
从菜单中选择 "编辑">"更改大小写"，或右键单击并从上下文菜单中选择 "更改大小写"。
3.
选择要应用于选中内容的大小写类型。选择如下：
#figure(
image("./img/2023-11-10 10.52.53.png")
)
=== commenting and uncommenting
您可以通过右键单击并选择 "注释选区 "来注释所选代码。
要删除注释字符，请右键单击并选择取消注释选区。
您还可以使用菜单中的 "编辑 > 注释选区 "和 "编辑 > 取消注释选区 "命令来完成同样的操作。
分析项目时不分析注释
=== indentation
您可以单击窗口底部状态栏中的制表符宽度，
打开一个对话框，设置文件中每个制表符的列数。
此设置为每个文件单独保存，并覆盖选项对话框中编辑器类别的设置。
通过选择代码、右键单击并选择 "重新缩进选择"，
可以使所选代码的缩进符合标准用法。
缩进首选项由 "选项 "对话框中的 "编辑器">"高级 "类别控制
#figure(
image("./img/2023-11-10 10.58.png")
)
=== insert and overtype modes(插入模式? 重(chong)打模式?)
通常情况下，键入光标右侧的文本会在键入时移动。
这称为插入模式。
要在 "插入 "模式和 "套打 "模式之间切换，
在 "插入 "模式下，
光标右侧的文本会在输入时被逐个字符替换，
请按 "插入 "键或从菜单中选择 Edit > Toggle Overtype。
=== sorting lines alphabetically
要将一组行按字母顺序排序，请选中这些行，右键单击并选择 "排序选择"。
=== keyboard commands
要查看可在源代码编辑器中使用的按键列表，请选择 "工具">"选项"，
然后转到 "按键绑定">"编辑器 "类别。
例如，Ctrl+Alt+K 剪切光标位置到行尾的文本。
而 Ctrl+T 则会将光标位置处的行与其上方的行换行。
另一种查看按键绑定列表的方法是选择 "帮助">"按键绑定"。
搜索 "编辑器 "一行（第 140 行左右），即可看到源代码编辑器窗口按键的开头。
=== recording, playing, and saving macros
您可以录制和重放一组编辑更改，以便重复使用。这就是所谓的宏。要录制宏，请按照以下步骤操作：
1.
从菜单中选择工具 > 编辑器宏 > 录制宏，或按 Ctrl+Alt+M。
2.
在源代码编辑器中执行您希望重复的步骤。
3.
选择工具 > 编辑器宏 > 停止录制，或按 Ctrl+Alt+M。(请注意，如果宏结束时光标不在源编辑器中，则在移回源编辑器之前无法停止录制）。
要重放最近录制的宏，请将光标移动到所需的开始位置，然后选择工具 > 编辑器宏 > 重放宏或按 Ctrl+M。
您可以保存最近录制的宏，方法是选择工具 > 编辑器宏 > 保存宏或按 Ctrl+Shift+M。
系统会要求您键入宏的名称。您还可以移动到快捷方式字段，按下要用于触发该宏的组合键。
#figure(
image("./img/2023-11-10 11.03.png")
)
您可以在 "理解选项 "对话框中重命名和删除已保存的宏，
方法是选择 "工具">"编辑器宏">"配置宏"。
=== creating and opening files
您可以使用源代码编辑器创建一个无标题的空白文件，方法是从菜单中选择文件 > 新建 > 文件。
无论文件是否在项目中，都可以通过选择文件 > 打开 > 文件来打开。
右键单击文件名时，上下文菜单会提供 "编辑文件 "和 "编辑伴生文件 "选项。
例如，encrypt.c 的配套文件是 encrypt.h。
=== bookmarking
右键单击一行，从上下文菜单中选择添加书签，即可在代码中创建 "书签"。
或者从菜单中选择编辑 > 书签 > 切换书签。带有书签的行旁边会有一个红色箭头。
#figure(
image("./img/2023-11-10 11.04.png")
)
在有多个书签的文件中，你可以右键单击并选择上一个书签或下一个书签，在文件中快速移动位置。
从菜单中选择查看 > 书签，即可打开书签区域，查看所有文件中的所有书签列表。
#figure(
image("./img/2023-11-10 11.05.png")
)
如果您指向书签区域中的书签代码，悬停文本中将显示书签行周围的 5 行代码。
双击书签可移动到源代码编辑器中的该位置。
如果在实体内创建书签，书签区域会显示包含书签的实体名称和类型。
例如，如果在函数内的一行代码上创建书签，则会显示函数名称。
书签和收藏夹为用户本地存储。
通过该区域的工具栏，可以通过以下方式管理书签：
- 使用 "按图标查看 "在基于文件的视图和基于类别的视图之间切换。基于文件的视图可展开文件名查看该文件中的书签。基于类别的视图可让你将书签分配到你创建的类别中。
- 选择书签并单击该图标可更改类别。要创建类别，请键入名称并单击确定。要使用现有类别，请从列表中选择该类别。
- 选择一个书签，然后单击此图标删除该书签。
- 在基于文件的视图中选择一个文件，然后单击此图标删除该文件中的所有书签。也可以选择一个书签并单击此图标，删除包含所选书签的文件中的所有书签。
- 选择一个书签并单击此图标，将其标记为临时书签，标记为临时书签 24 小时后删除。
- 在基于类别的视图中选择一个类别，单击此图标可删除该类别中的所有书签和类别本身。
- 单击此图标可删除所有书签。
#figure(
image("./img/2023-11-10 11.07.49.png")
)
#figure(
image("./img/2023-11-10 11.08.15.png")
)
书签区域右上角的汉堡菜单提供了, 以下命令的汉堡包菜单：
- 双击时复制到剪贴板： 双击书签列表中的一行可跳转到代码中的该位置。如果启用该选项，双击既能跳转到代码中的该位置，又能将该行代码复制到剪贴板。
- 显示原始缩进： 启用此选项可显示与源代码缩进一致的代码行。
=== managing source editor tabs
右键单击源编辑器顶部的选项卡时，一些命令允许你控制选项卡的行为。
#figure(
image("./img/2023-11-10 11.10.png")
)
如果选择 "Show Tab Title as"，
就可以缩短或加长源代码编辑器选项卡中的文件名。
同样，如果选择 "Show Window Title as"，
则可以缩短或加长 Understand 标题栏和任何独立源编辑器窗口中的文件名。
Copy Filename"命令可将长文件名、相对文件名或短文件名复制到剪贴板。
如果选择 "Release Window"，标签区将变为一个可在屏幕上移动的独立窗口。
单击已释放窗口右上角的图标并选择 "Capture Window"
该窗口就会返回到Understand窗口中的一个选项卡。
== annotations?(注释, 与代码中的comment不同)
对于 Understand 用户来说，
注释是一种简单方便的添加文档的方式，
无需直接修改源代码，
但仍可在代码上下文中快速查看注释。
注释可以应用于代码行、实体或文件。
你可以将文件附加到注释中，并与整个团队共享。
你可以与代码联机查看注释，
也可以在注释浏览器或注释查看器中查看注释。
要打开注释浏览器，
请从菜单中选择Annotations > Browse All Annotations。
要打开注释查看器，请从菜单中选择Annotations > Annotation Viewer。
#figure(
image("./img/2023-11-10 11.12.18.png")
)
在使用注释实体的任何地方，包括在图表和信息浏览器中，都可以通过悬浮文本看到注释。
#figure(
image("./img/2023-11-10 11.13.png")
)
注释可以用标签 "标记"，如 `#review` 或 `#refactored`。
这种标记对于整理待办事项列表或将问题分配给他人非常有用。
=== viewing annotations
默认情况下，在源代码编辑器窗口中，注释由窗口右侧边缘带有三个点的图标表示。
如果 "注释查看器 "未打开，而您指向其中一个图标，则注释会显示在一个悬浮窗口中。
如果点击图标或悬浮窗口，注释查看器就会打开并选中该注释。
如果 "注释查看器 "已打开，单击指示器图标可在 "注释查看器 "中选择该注释。
如果对实体进行了注释，指向该实体的使用会在悬停文本中显示注释。
您可以使用 "工具">"选项 "对话框中注释类别的设置更改默认行为，具体如下：
- 在Open Annotations字段中选择 "弹出窗口"，则无法打开注释查看器。
- 在 "编辑器显示 "字段中选择 "内联 "会隐藏指示器，而显示与源代码内联的注释。
- 在 "编辑器显示 "字段中选择 "无"，则会同时隐藏注释指示器和内联注释。
- 取消选中 "在实体悬停文本中显示注释 "会在指向注释实体时隐藏注释。
您还可以使用 "选项 "对话框中的 "注释 "类别设置注释显示的名称，
控制注释文本和背景的颜色，以及在打印时隐藏或显示注释。
=== sharing annotations
注释旨在与团队其他成员共享。
注释存储在项目文件夹中（名为 `project_name.und`）。
在 `project_name.und` 文件夹中，
有一个单独的 JSON 文件存储项目每个用户创建的注释。
这些文件名为 `ann_username.json`。
媒体文件（media.json）列出了附加到注释的任何文件，
这些文件存储在项目文件夹的媒体子文件夹中。
打开注释浏览器并从汉堡菜单中选择Export Annotations to CSV，即可导出注释。
=== searching for annotations
要打开注释浏览器，请从菜单中选择Annotations > Browse All Annotations。
该浏览器会按照作者、创建日期、文件目录结构和您创建的任何标记对注释进行排序。
单击汉堡包菜单图标，可以隐藏其中任何分组。
要搜索注释，请在 "筛选器 "字段中输入。
这将搜索注释的文本。
默认情况下，搜索不区分大小写，也不允许使用通配符或正则表达式。
您可以使用汉堡菜单更改这些默认值。
也可以在注释查看器的 "过滤器 "字段中输入注释进行搜索。
请注意，注释查看器只显示当前查看的源文件中的注释，而注释浏览器则显示项目中的所有注释。
信息浏览器还会列出所选实体的任何注释。
=== adding annotations
您可以通过以下方式添加注释：
- 右键单击understand中几乎任何地方的实体或文件名，然后从右键菜单中选择 "注释"。例如，您可以在源代码、信息浏览器或实体过滤器中选择实体。根据所选实体的类型，您可以选择注释该实体（在其出现的所有位置）、包含的实体（如函数或类）、源文件行号或源文件。(如果文件尚未作为项目的一部分保存和分析，则无法注释行号。行号发生变化时，行号注释会尽可能更新）。
#figure(
image("./img/2023-11-10 11.21.png")
)
- 选择一个实体，然后从注释 > 注释菜单中选择。
- 在源文件中选择一个位置或实体，然后单击注释查看器中的加号图标。如果在注释查看器中选择一个现有注释并单击加号图标，就可以对所选注释进行回复。
无论何时创建注释，注释查看器都会打开并添加新注释。为批注键入文本，单击批注外侧时会自动保存文本。
#figure(
image("./img/2023-11-10 11.22.png")
)
=== editing annotations
要编辑已创建注释的文本，只需单击文本字段即可。
编辑时，注释中的时间戳会更新。
您不能编辑其他用户创建的注释，但可以删除它们。
您可以更改已创建注释的上下文。
单击注释右上角的行或实体，选择新上下文。
#figure(
image("./img/2023-11-10 11.23.png")
)
=== tagging annotations
注释可让你添加标签，为创建待办事项列表、排定工作优先级和分配任务提供了一种简便的方法。
要添加标签，只需键入 `#` 和关键字（就像在社交媒体应用中一样）。
例如，你可以使用 `#Project7` 或 `#Refactor`。
要键入一个字面上的 `#` 号而不使其成为标签，请键入 `##`。
#figure(
image("./img/2023-11-10 11.24.png")
)
=== attaching files
要在注释中附加文件，请单击已创建注释中的回形针图标，然后浏览要附加的文件。
您可以为同一个批注附加多个文件。。
#figure(
image("./img/2023-11-10 11.24.59.png")
)
=== deleting annotations
要删除注释，请在注释查看器中选择该注释并单击(➖)图标。
NOTE: 注意不要选择注释并按下 Delete 键，
因为这会删除源编辑器中高亮显示的实体，而不是注释。
=== managing orphan(孤儿) annotations
如果删除了附加注释的代码，注释仍是项目的一部分，但它是一个 "孤儿"，没有任何可附加的内容。您可以找到此类注释并将其附加到其他文件或实体：
1.
保存源文件，然后选择项目 > 分析更改的文件。
2.
选择注释 > 管理孤儿。
3.
在 "管理孤儿 "对话框中，展开孤儿注释列表并选择一个孤儿。
您可以放大对话框以阅读更多注释文本。
4.
使用右侧的实体过滤器查找并选择一个实体。
5.
单击将孤儿附加到实体。
6.
可以继续将其他孤儿注释附加到实体。
7.
可以单击 "删除孤儿 "将注释从项目中完全删除。
#figure(
image("./img/2023-11-10 11.28.png")
)
NOTE: 架构节点也可以成为孤儿。此对话框同样用于管理无主架构节点。
== printing source views
菜单选项File > Print会打开操作系统的标准打印对话框，以便打印当前查看的源文件。
默认情况下，文件将以选择File > Print菜单选项时屏幕上显示的字体和颜色打印。
您可以在选项对话框中自定义代码打印。
要打开此对话框，请选择Tools > Options.
展开editor category，然后选择advanced category。
控制代码打印方式的选项位于打印区域。
#figure(
image("./img/2023-11-10 11.31.png")
)
要更改打印输出而不更改联机显示，请从菜单中选择File > Page Setup。
此对话框提供类似于以下的打印选项；根据操作系统的不同，选项可能会有所不同：
#figure(
image("./img/2023-11-10 11.31.png")
)
= architecting(构建, 架构) your codebase(代码库)
Understand 现在为创建和使用架构提供了一个经过全面修订和扩展的界面，
架构是组织和分析代码的虚拟层次结构。我们的用户创建架构有多种用途，包括:
#figure(
image("./img/2023-11-10 11.37.png")
)
- 基于所有者的架构，显示代码在主要所有者之间的划分。
- 基于metrics的架构，例如按代码复杂度、文件或函数大小分类的架构。
- 基于日期的架构。例如，大型重构项目可以用它来查询哪些文件已经更新，哪些还需要工作。
- 基于功能单元的架构，用于查看不同单元之间的依赖关系。例如，核心代码对外部库有哪些依赖？
#figure(
image("./img/2023-11-10 11.38.png")
)
体系结构作为项目的一部分保存，因此可以与处理同一项目的其他人协作使用。
架构无需引用项目中的每个源实体；
也就是说，架构可以定义项目实体的子集。
此外，架构还可以多次引用某个实体。(从技术上讲，架构的扁平化扩展不需要保持集合属性）。
你可以连续组合架构，为你的实体创建新颖的过滤器。
从技术角度看，集合代数用于组合和转换架构层次。
过滤器的结果是一个实体列表。
这个结果列表可以被视为一个平面列表，也可以被视为另一个架构。
过滤器定义可以保存为动态架构。
动态筛选器架构会随着项目内容的变化而更新，并可用于日后重组筛选器。
== about architectures
understand的architectures是在源代码主体上分层的抽象层次结构。
架构创建了源代码单元（实体）的层次结构。
通过架构，您可以命名和组织软件项目的各个部分，或分层查看软件的方式。
Understand 提供了内置架构，
可按最后修改日期、目录结构和语言（适用于多语言项目）组织源代码文件。
您可以使用这些提供的架构和/或创建自己的架构。
例如，基于员工的架构可以包含为特定项目工作的每个工程师的节点。
这些节点将包含属于该工程师或由其修改的源代码文件列表。
你可以通过拖动架构中的文件夹、文件或实体来重新分配职责。
通过项目浏览器中的 "隐藏 "选项，
可以查看是否已将项目的所有部分分配给架构中的某个节点。
节点之间的依赖关系和互动关系可以用图表表示，也可以用架构列出。
#figure(
image("./img/2023-11-10 22.21.png")
)
架构可以组织 Understand 分析的任何实体类型。
它们并不局限于组织文件。
例如，此处显示的 "可能的安全违规 "架构包含各种实体类型，以检查可能存在的安全问题。
#figure(
image("./img/2023-11-10 22.26.png")
)
体系结构作为项目的一部分保存，因此可以与处理同一项目的其他人协作使用。
架构不需要引用项目中的每个源实体；
也就是说，架构可以定义项目实体的子集。
此外，架构还可以多次引用某个实体。(从技术上讲，架构的扁平化扩展不需要保持集合属性）。
你可以连续组合架构，为你的实体创建新颖的过滤器。
从技术角度看，集合代数用于组合和转换架构层次。
过滤器的结果是一个实体列表。
这个结果列表可以被视为一个平面列表，也可以被视为另一个架构。
过滤器定义可以保存为动态架构。
动态筛选器架构会随着项目内容的变化而更新，并可用于日后重组筛选器。
== browsing architectures
要打开架构浏览器，请从主菜单栏中选择架构 > 浏览架构。
#figure(
image("./img/2023-11-10 22.34.png")
)
你会看到一个可展开的列表，其中列出了当前为你的项目定义的架构。
该架构区域与实体过滤器或项目浏览器区域类似。
单击某个项目时，信息浏览器中会自动显示该项目的相关信息
（只要在信息浏览器中勾选了 "同步 "复选框）。
要探索架构，可单击 > 箭头展开层次结构。
层次结构中会显示文件、函数和变量等实体。
在节点内，子节点按字母顺序排序。
通过单击汉堡菜单图标并切换 "显示隐式映射子实体 "选项，
你可以选择是否列出每个文件中的实体。
您可以使用架构浏览器工具栏中的搜索图标打开 "在文件中查找 "对话框，
在架构内进行搜索。
=== enabling built-in architectures
Understand 提供了一些预定义的 "自动架构"。
默认情况下，架构浏览器中只显示目录结构架构。
您可以通过单击汉堡菜单图标并选择一个架构来启用其他内置架构：
#figure(
image("./img/2023-11-10 22.35.png")
)
- 目录结构： 以正常文件层次结构列出项目文件，显示目录及其子目录。
- 日历： 根据最后更改日期列出项目中的文件。显示的日期层次从 "本年"、"本季度"、"本月"、"本周 "到 "昨天 "和 "今天"。
- 语言： 首先按源代码语言列出文件，然后按文件在目录结构中的位置列出。(只有当项目包含多种语言时，才会出现这种结构）。
- Visual Studio 项目： 只有当项目配置为包含 Visual Studio 项目时，才会提供此架构。(必须重新分析现有项目才能创建此架构）。
自动架构只有在分析项目时才会更新。
因此，如果您的源代码正在积极修改，
而您最近没有对其进行分析，
那么架构--尤其是日历架构--可能已经过时。
=== context menus for architectures
架构节点（如文件系统目录或 "本季度"）的上下文菜单包含一些其他上下文菜单中没有的额外项目：
- Graphical Views > Graph Architecture： 从这一点向下创建架构层次结构图形。系统会询问您是要在图形中包含实体，还是只包含架构节点。
- Graphical Views > Internal Dependencies： 显示架构节点之间的依赖关系。
- Add to Architecture： 将选定节点、文件或实体的内容添加到另一个架构节点。您无法编辑 Understand 提供的自动架构。
- Remove from Architecture： 从您选择的体系结构或节点中删除所选节点或文件。您不能从 Understand 提供的自动架构中删除文件。
- Browse Metrics： 显示所选节点内实体的度量（但不包括层次结构中较低子节点内的实体。
- rename： 如果架构或节点是您创建的，您可以对其进行重命名。您不能重新命名 Understand 提供的自动架构。
- duplicate：打开 "复制体系结构 "窗口，您可以键入所选体系结构或体系结构节点副本的名称。
- delete：删除选定的体系结构节点。
一如既往，您可以右键单击架构浏览器中的任何项目，以获取可查看的有关该项目信息的列表。
#figure(
image("./img/2023-11-10 22.40.50.png")
)
== creating and editing custom architectures
在 "architectures browser" 中创建自定义架构非常简单（在以前的版本中则比较复杂）。
(对自定义架构所做的更改会自动保存。
您还可以使用架构设计器直观地编辑自定义架构
=== creating architecture nodes
使用架构浏览器中的工具栏图标创建和修改自定义架构如下：
- 添加架构或节点
- 删除架构节点, 仅限自定义架构
- 标记实体
- 编辑架构, 重新命名选定的架构或节点。仅限自定义架构
- 复制架构, 重复架构
您不能修改内置体系结构（目录结构、日历和语言），
因此在这些体系结构中选择节点时，
添加、删除和编辑图标将显示为灰色。
要创建新架构，请在架构浏览器中取消选择任何节点或文件，
然后单击添加工具栏图标。为添加的架构键入一个名称。
要在体系结构中创建新节点，
请选择父节点并单击添加工具栏图标。为新节点键入一个名称。
创建自定义架构的另一种方法是选择现有架构或节点，
然后单击复制工具栏图标。
在对话框中为复制的架构键入不同的名称。
复制的架构或节点将在同一级别创建。
您也可以将内置架构的节点拖到自定义架构中创建副本。
节点的所有子节点都会与节点一起被复制。
=== editing architecture nodes
您无法编辑 Understand 提供的内置架构。
不过，您可以通过移动、重命名和删除节点，
以及向节点添加文件和实体来编辑自定义架构。
移动节点： 您可以根据需要在自定义架构内拖动自定义架构或自定义架构的节点。
节点的任何子节点都会随节点一起移动。
如果将内置架构或内置架构的节点拖到自定义架构中，
节点及其子节点将被复制而不是移动。这是因为内置架构不能修改。
重新命名节点：要重命名自定义架构或自定义架构节点，
请右键单击并从上下文菜单中选择重命名。在架构浏览器列表中键入新名称。
删除节点：要删除自定义架构或自定义架构节点，
请右键单击并从上下文菜单中选择删除。
=== adding files and entities to nodes
使用以下任一方法将您在 Understand 中任意位置选择的文件和实体添加到自定义架构中：
- 单击 "架构浏览器" 中的 "标记实体 "工具栏图标。
- 选择 Architectures > Add `<entity name>` to Architecture 菜单命令。
- 右键单击并从上下文菜单中选择添加到架构。
- 将文件或实体从 Understand 中的任意位置拖放到架构浏览器中。
这些方法（拖放除外）要求您选择一个自定义架构或节点来包含所选文件或实体。
您可以将架构名称键入为由斜线"/"字符分隔的路径。例如，"Owner/Chris"。
要从体系结构中删除文件或实体，
请右键单击文件或实体并选择从体系结构中删除。
如果文件或实体在自定义架构中被多处引用，
系统会询问你要从哪个架构路径中删除。
=== complete coverage(覆盖) for architectures
内置架构提供完整的覆盖范围，可按最后修改日期、目录结构和语言组织项目中的文件。
自定义架构不需要包含项目中的所有文件。
通常情况下，你只需要在架构中包含项目的部分内容。
如果确实想确保自定义架构包含项目中的所有文件，请按照以下步骤使用 "按架构隐藏 "功能：
1.
打开 "项目浏览器 "和 "架构浏览器"。
2.
解除 "项目浏览器 "的锁定，将它移到 "架构浏览器 "旁边，这样就可以同时看到这两个区域。两个区域。
3.
在 "项目浏览器 "中，单击汉堡菜单图标，选择 "隐藏 "和 "自定义架构"。
自定义架构的名称。这将隐藏已在架构中的任何文件或目录。
4.
将文件和目录从 "项目浏览器 "拖到架构中需要的位置。
根据需要单击添加工具栏图标创建新节点。
5.
当项目浏览器为空时，项目中的所有文件都会在自定义架构中被引用。
6.
在 "项目浏览器 "中，单击汉堡菜单图标并选择 "隐藏 > 无"，
即可再次显示所有文件。无，重新显示所有文件
=== managing orphan(孤儿) architecture nodes
如果父节点被删除，架构节点就会成为 "孤儿"。
要删除或附加孤儿节点，请从菜单中选择架构 > 管理孤儿。
=== using the architecture designer
您还可以使用架构设计器来编辑自定义架构，
方法是在图形视图或文本视图中创建一个大纲并将实体拖到节点上。
在创建架构的过程中，架构设计者可以更方便地将架构可视化。
体系结构设计器有助于采用自上而下的方法创建体系结构，
而体系结构浏览器则需要采用更多自下而上的方法。
要打开架构设计器，
请从菜单中选择 Architectures > Design Architectures > architecture_name。
或者，在架构浏览器中，右键单击自定义架构（非内置架构），然后选择在设计器中编辑架构。
在架构设计器中所做的更改会立即保存。
设计器中有撤销和重做图标，
但关闭设计器后就无法撤销在设计器中所做的更改。
#figure(
image("./img/2023-11-10 23.05.png")
)
架构设计器包含以下窗格和控件：
- 架构名称：如果要修改架构名称，请单击架构名称旁边的铅笔图标。
- 大纲窗格： 通过在此窗格中勾画架构来建立架构的组织结构。
- 使用空格或制表符缩进，以便在架构中嵌套层级。你的大纲应包括组织架构的节点，但不包括将在架构中使用的实体。组织的实体。大纲将成为图形视图和文本视图选项卡中架构的节点。单击信息图标查看功能分解大纲示例。
- 图形视图选项卡： 通过将实体拖动到节点，使用此图表编辑架构。您可以在图表中拖动实体，也可以从右侧的目录结构窗格中拖动实体。双击可展开或折叠包含实体的节点（显示为三维方框而非矩形）。使用滚轮放大或缩小。
- 文本视图选项卡： 根据需要拖动实体和节点，使用此列表编辑架构。您可以在此视图中拖动实体，也可以从右侧的目录结构窗格中拖动实体。单击箭头或右键单击并选择 "展开架构 "或 "折叠架构"，即可展开或折叠节点。复制节点： 选择一个节点，右键单击并选择 "复制建筑节点粘贴"，选择复制节点的位置，右键单击并选择 "粘贴建筑节点上一个副本"。
- 目录结构窗格： 内置的目录结构架构显示在此窗格中，您可以根据需要展开它，并将实体拖动到图形视图或文本视图选项卡中。您可以使用此窗格下方的 "搜索 "字段按名称搜索实体。
- 源视图： 声明所选实体的源代码会在此框中显示并突出显示。
使用架构设计器创建或编辑架构的一般步骤如下：
1.
从菜单中选择 Architectures > Design Architectures > New Architecture ，创建新的自定义架构。也可以使用此菜单命令打开现有的自定义架构。
2.
单击铅笔图标并键入新架构的名称。按 Enter 保存名称。
3.
在左侧面板中，键入架构大纲。包括用于组织架构的组，但不包括实体。使用空格或制表符嵌套层次。例如，如果要创建一个显示代码库各部分职责的架构，大纲可以包括工程组或工程师列表。如果您要创建一个架构来组织在不同版本中要修改的代码，那么您的大纲可以包括一个计划发布版本的列表。
请注意，在向大纲添加内容时，大纲的结构会显示在图形视图选项卡中。
4.
将右侧 "目录结构 "窗格中的目录或文件拖到 "图形视图 "选项卡中的正确节点上。
5.
如果希望将所有代码分配到结构中的某个节点，请切换左侧窗格上方的 "筛选器 "图标。已经分配给节点的目录和文件将被隐藏。
6.
完成架构编辑后，单击 "关闭"。
== sharing architectures
您可以通过将架构导出到 XML 文件并共享该文件，与其他开发人员共享架构。
要导出架构，请打开架构浏览器。
选择要导出的架构。
从汉堡菜单中选择导出所选架构选项。
要导入架构，请打开架构浏览器。
从汉堡菜单中选择导入架构选项。
== viewing architecture graphs
您可以生成显示架构层次结构的图形。
要查看图形，请按照以下步骤操作：
1.
选择要绘制图表的最高级架构节点。您可以绘制整个层次结构，也可以只绘制子层次结构。
2.
右键单击节点，从上下文菜单中选择图形视图。有多种图形类别可供选择
依赖关系和图形架构类别是特定于架构的，将在后面的章节中介绍。
对于某些架构结构和节点，可能会有其他图形类别。
例如，对于具有为函数创建的节点的体系结构，如果函数共享全局变量，
则可使用 "函数中的共享对象"（Shared Objects in Functions）图表。
选择architecture节点后，从菜单中选择Graphs > Graphs for `<node>`，可获得相同的图形视图列表。
架构图形的工具栏与其他类型的图形视图相同。
结构图可能很大。请记住，您可以使用 Ctrl+F 在图形中搜索。
您可以将这些图形保存为 PNG、JPEG、SVG、Visio XML 和 DOT 文件。
您还可以使用 "依赖关系浏览器 "查看架构中的依赖关系。
=== dependency graphs
要打开显示整个架构内部依赖关系的图表，
请从Graphs > Dependency Graphs菜单中选择一个架构。
例如，如果你有一个按所有者组织源代码的自定义架构，
图表可能如下所示。蓝线表示单向依赖关系，红线表示相互依赖关系。
数字显示了每种关系的依赖数量。你可以右键单击数字，查看依赖关系列表。
#figure(
image("./img/2023-11-10 23.17.png")
)
要查看架构节点与同一架构中其他节点之间的依赖关系图，
请右键单击架构浏览器中的节点，
然后选择Graphical Views > Dependencies.。
默认情况下，显示的是依赖关系图的 Butterfly 变体(Butterfly variant of the Dependencies graph)，
其中包括依赖该节点的节点和该节点依赖的节点。
在本例中，Jordan 管理的代码依赖 Chris 和 Sam 管理的代码，但不依赖 Alex。
#figure(
image("./img/2023-11-10 23.18.png")
)
使用变量下拉列表可更改图表，
使其仅显示所选节点的内部依赖关系、
"依赖于此节点 "的节点或 "依赖于此节点 "的节点。
您可以根据需要扩展架构节点，
以查看不同架构节点内特定源文件之间的依赖关系。
NOTE:
依赖关系图也适用于类和包，
通常作为a variant of the Butterfly graph category。
在变体下拉列表中选择依赖关系
=== architecture structure views
Graph Architecture与Architecture Dependency graphs不同。
它显示的是架构的结构，
而不是架构中实体之间的依赖关系。
打开 "图形架构 "视图的方法与打开其他图形视图的方法相同
#figure(
image("./img/2023-11-10 23.19.png")
)
== checking dependencies
您可能希望验证某些架构节点是否依赖于其他节点或进行循环引用。
要配置此类检查，请按照以下步骤进行：
1.
从菜单中选择Checks > Configure Dependency Checks。
2.
从对话框顶部的列表中选择体系结构中的节点。
(您可以返回此步骤在配置中添加多个检查，从而对多个节点执行检查）。
#figure(
image("./img/2023-11-10 23.24.png")
)
3.
选中要执行的检查旁边的复选框，
并为这些检查选择相应的架构节点。
例如，您可以指定 "src/cli "节点不能依赖于 "src/plugins "节点。
#figure(
image("./img/2023-11-10 23.25.png")
)
4.
添加依赖性检查后，该检查将列在配置检查列表中。
您添加的检查可能会导致多个Configured Check被列出。
例如，指定 "src/cli "节点不能依赖于 "src/plugins" 节点会导致添加两个检查，
以确保 "src/cli "不依赖于 "src/plugins"，以及 "src/plugins "不被 "src/cli "依赖。
#figure(
image("./img/2023-11-10 23.26.png")
)
5.
您可以双击列表中已配置的检查，查看为该架构节点配置的检查。
6.
要配置更多检查，请在对话框顶部选择另一个架构节点、
并按照相同步骤为该节点添加校验。
7.
完成添加校验后，单击Save & Run。
配置检查后，您可以从菜单中选择Checks > Run Dependency Checks来重新运行检查。
运行依赖关系检查时，任何违规都会显示如下：
- 依赖关系违规区域列出了发现的违规。任何例外情况都包含在描述中。
#figure(
image("./img/2023-11-10 23.27.png")
)
- 打开一个图表，显示violations found在 "Dependency Violations" 区域所选检查的关系。您可以展开节点和实体，查看违规位置。在图表中选择线条会在依赖关系浏览器中显示特定的引用。图中高亮显示的行是我们建议删除以打破该依赖关系的引用。
- 打开 "依赖关系浏览器 "后，会显示违反在 "违反依赖关系 "区域所选复选的关系列表。
通过 "依赖关系违规 "区域工具栏上的 "筛选器 "图标，
您可以限制违规列表，
使其只显示未提交变更中的违规、
特定架构中的违规或基于文件变更时间或其在架构中位置的自定义筛选器中的违规
配置(🔧)图标重新打开Configure Dependency Checks对话框。
通过汉堡菜单，您可以选择如何展开和排序违规列表。
您可以取消选中Show Graph View或Show Dependency Browser选项，
以防止在运行依赖性检查时打开这些区域。
选择导出 csv 可将违规列表发送到逗号分隔值文件。
== viewing architecture metrics(指标?)
您可以在Information Browser中查看有关架构、架构节点或文件的basic metrics，
也可以在metrics browser中查看和导出详细指标。
度量信息可以导出为逗号分隔的列表，用于电子表格或基于 HTML 的报告。
= using metrics
本章介绍如何创建和查看指标以及可用的type of metrics。
== about metrics
Understand 提供了多种收集度量信息的方法：
- 项目概览： 选择Project > Overview，查看整个项目的指标图表，包括最复杂和最大的函数、类和文件。
- 指标浏览器： 您可以从菜单中选择Metrics > Browse Metrics来查看浏览器，该浏览器可让您选择任何架构节点、文件或实体，以查看该项目的所有可用度量。
- 度量定义： Understand 提供了大量metrics。要查看完整的最新指标列表，请单击Metrics Browser工具栏中的Show Metrics Definitions信息图标。您可以过滤和搜索该列表。单击某个度量指标，了解其计算方法。
- 信息浏览器： The Information Browser tree中有一个metrics节点。您可以展开该分支来显示当前实体的一些度量指标。
- 导出为 HTML： 您可以使用Metrics Browser导出所有架构节点和文件的完整度量衡列表。
- 导出为 CSV： 可以从菜单中选择Metrics > Export Metrics，以逗号分隔格式创建包含所有项目度量的文件。
- Python 和 Perl API： 获取现有度量和计算新度量的更高级方法是使用 Python 和 Perl API。这些 API 提供了对 Understand 项目的完全访问。选择Help > Python API Documentation或Help > Perl API Documentation获取更多信息。
== project overview
从菜单中选择Project > Overview，
可查看整个项目的指标图表，
包括最复杂和最大的函数、类（支持类的语言）和文件。
还提供按行类型和目录结构划分的项目图表。
#figure(
image("./img/2023-11-10 23.37.png")
)
如果将光标悬停在彩色区域上，则会显示文件、函数和类的名称。
如果在打开Project Overview时选择Project > Analyze All Files，
则会在 "项目概览 "顶部添加有关解析时发现的准确性和错误的统计信息。
#figure(
image("./img/2023-11-10 23.36.png")
)
如果打开包含分析错误的项目，
选择Project > Overview，然后选择Project > Analyze All Files，
还可以查看按类型和语言分组的分析错误和警告图表。
== metrics browser
Metrics Browser提供整个项目、任何实体和任何架构节点的大量度量衡列表。
要打开Metrics Browser，请从菜单中选择Metrics > Browse Metrics。
默认情况下，显示的是整个项目的度量指标。
选择Directory Structure架构的顶层节点会使度量反映整个项目。
您可以浏览项目中的架构和实体，并选择任何架构节点、文件或实体。
右侧的列表显示了所选项目的代码大小和复杂度指标。
#figure(
image("./img/2023-11-10 23.39.png")
)
双击文件或实体可打开该项目的源代码编辑器。
右键单击 Understand 中几乎任何地方的项目名称并选择Browse Metrics，
即可打开Browse Metrics，显示项目中任何架构节点、文件或实体的度量。
单击Browse Metrics工具栏中的Show Metrics Definitions图标，学习可用的度量衡。
单击Metrics Browser工具栏中的Export Metrics图标，将度量指标保存到文件中。
要将指标复制到剪贴板，请按 Ctrl+C 或右键单击并选择Copy Selected。
可以按住 Ctrl 或 Shift 键来选择多个指标。
单击全部复制可复制所选节点、文件或实体的完整列表。
如果选中Metrics Browser工具栏中的 "同步 "复选框，
则在其他视图中选择实体、文件或架构节点时，显示的metrics会随时更改。
您可以从汉堡包菜单(三条纹)中选择选项来调整显示：
- Show Detailed Architecture Metrics：扩展指标列表，除与计数相关的指标外，还包括复杂性和面向对象指标。禁用时，只显示与计数相关的指标。对于大型项目，显示详细指标可能会影响在Metrics Browser中选择新节点时的性能。
- Show Summary：显示项目名称、所选节点或实体的类型以及所选节点内各种类型文件的数量。
- Show API Name： 显示使用 CountLine 等名称的度量列表。
- Show Friendly Name：使用简短描述显示度量。根据名称或描述的不同，列表的排序方式也不同。
== exporting metrics
要了解度量标准的计算方法，
请单击Metrics Browser工具栏中的Show Metrics Definitions信息图标。
这将打开Metrics Definitions窗口。
该窗口显示每个metrics的 API 名称和"friendly"名称，并提供简短描述。
单击任意一行可打开较长的描述，
其中包括显示度量计算方法的图表和该度量适用的语言列表。
再次单击可关闭详细描述。
您可以通过选择度量类别（Complexity, Count, or Object-oriented）、语言和/或搜索词来搜索该列表。
#figure(
image("./img/2023-11-10 23.43.png")
)
== metrics in the information browser(信息浏览器汇总的指标)
Export Metrics对话框可让您完全控制将指标保存到逗号分隔的文件。
要使用此对话框，请单击(📃)Export Metrics图标并选择Export to CSV.。
或从菜单中选择Metrics > Export Metrics。
在Export Metrics对话框中，您可以选择要导出的度量、输出中度量的顺序、输出文件位置以及下文所述的其他各种选项。
输出包括每个类函数、类和结构实体的一行。它不包括architecture nodes的行。
- Available Metrics：选中要包含在输出中的度量旁边的方框。选中 "SELECT ALL（全部选择）"方框可选择所有度量。取消选中 "SELECT ALL（全部选中）"框可取消选中所有指标。如果光标停留在某个指标上，就会看到该指标的简短描述。
- Metrics to Export：单击单箭头在列表中上下移动所选指标。单击双箭头可将所选指标移至列表顶部或底部。
- Save output to：指定指标输出文件的位置和名称。Understand 会将指标输出发送到 `*.csv`（逗号分隔值）文件。
- Show File Entity Name as：指定是以短名（仅文件名）、全名（包括绝对路径）还是相对名称（相对目录路径）显示文件。
- Show Declared in File：如果希望在输出中包含声明每个实体的文件，请选中此复选框。您可以指定是用短名、全名还是相对名称显示这些文件。
- Write Column Titles： 如果希望在 CSV 文件中显示列标题，请选中此复选框。
- Show Function Parameter Types：如果希望列出每个函数参数的类型，请选中此复选框。
- Include Entity Unique Name to track changes over time( 包含实体唯一名称以跟踪随时间发生的变化)：选中此复选框可添加 "实体唯一名称 "列，其中包含每个实体的唯一路径规范。这样就可以区分具有相同名称的多个实体。
除了使用Export Metrics对话框外，Understand 还提供了以下其他方法将度量值保存到文件：
- Copy to a text file：要将度量值复制到剪贴板，请按 Ctrl+C 或右键单击并选择Copy Selected。可以按住 Ctrl 或 Shift 键来选择多个指标。单击copy all可复制所选节点、文件或实体的完整列表。将指标粘贴到文件编辑器中。
- Export selected architecture node to CSV file：选择一个架构节点。单击Export Metrics(📃)图标旁边的向下箭头，然后选择Export Selected Architectures to CSV。选择 CSV 文件的位置和文件名。系统会询问您是否要打开报告，这是一个 CSV 文件，其中包含所选每个架构节点的指标行。所有指标都会导出。
- Export project summary metrics to HTML: 单击 "导出指标" 图标旁边的向下箭头，然后选择 Export Selected Architectures to HTML。选择包含文件的文件夹。系统会询问您是否要打开报告，报告为single page，包含整个项目的指标。只导出计数指标。
- Export detailed metrics to HTML： 单击 "导出指标 "图标旁边的向下箭头，选择 "导出为 HTML"。选择包含文件的文件夹。系统会询问您是否要打开报告，这是一个 HTML 页面树，您可以从中选择任何架构节点或文件，查看该节点或文件的指标。只导出计数指标。
当提示您选择一个文件夹来包含以 HTML 格式导出的度量值时，
这些文件实际上会存储在您选择的文件夹下面一个名为`<Project_name>_Metrics`的文件夹中。
如果该目录已经存在，系统会询问您是否要覆盖这些文件。
如果回答 "否"，则会在旧目录名后附加一个数字，将其作为备份保存。
生成报告后，系统会询问您是否要查看报告。单击 "是 "打开顶层页面 index.html。
== metrics treemap(指标树)
您可以在信息浏览器中查看任何实体或架构节点的基本指标。
在Information Browser中，您可以展开metrics节点，
查看一些简单的度量标准，
如代码行数、注释与代码的比率以及所有嵌套函数或方法的平均循环复杂度。
单击metrics节点旁边的Show Metrics Browser(股票数据的图标)图标，打开Metrics Browser。
默认情况下，无论何时查看新实体，
Information Browser中的metrics节点都会折叠。
如果希望节点保持展开状态，
可以单击metrics右侧的小箭头，
然后选择Allow Pre-expansion。
如果启用该选项，
在Information Browser中查看新实体的速度可能会变慢。
#figure(
image("./img/2023-11-10 23.59.png")
)
= using graphical views
本章介绍 Understand 中的图形视图及其选项。
== opening graphs
Understand 提供多种类型的图表，用于直观地探索和解释您的项目。
可用的图表类别会根据您选择的实体或架构节点类型而改变。
您几乎可以在 Understand 的任何地方选择实体或节点。
所选实体或节点的图表类别列表在以下位置提供：
- 顶部菜单栏中的Graphs > Graphs for entityName列表
- 右键单击实体时的graphical views子菜单
- 主工具栏中的显示图形视图菜单图标
以下是功能可用的典型图形类别。
例如，butterfly图形类别提供了同时显示所选函数调用的函数和调用所选函数的函数的图形。
#figure(
image("./img/2023-11-11 09.00.png")
)
右键单击实体并选择图形视图时，也会列出相同的图形类别：
#figure(
image("./img/2023-11-11 09.01.png")
)
Understand 中有许多可用的图形类型。
显示调用层次和类型结构的图形适用于所有支持调用和类型的语言。
例如，下面是名为 "chimaera "的 C 函数的两个图形：
#figure(
image("./img/2023-11-11 09.02.05.png")
)
有些图形适用于某些编程语言。
例如，支持类继承的语言（如 C++）有派生类和基类图。
同样，根据源代码语言使用的关键字，
也有一些图表可以显示 "include"、"with"、"use "或类似语句的层次结构。
在 Understand 中打开图表的其他方法如下：
从菜单中选择Project > Overview，即可打开project overview图表。
这些图表显示项目级指标，如相对函数大小和复杂性。
#figure(
image("./img/2023-11-11 09.02.png")
)
从菜单中选择Metrics > Metrics Treemap可打开Metrics treemaps。
这些是可以使用任意两个指标生成的特殊图表。
#figure(
image("./img/2023-11-11 09.03.png")
)
从菜单栏中选择 Graphs > UML Class Diagram > nodeName，
可打开架构节点的 UML 类图。
这些图表遵循统一建模语言 (UML) 结构图格式。
从菜单中选择 "图表"（Graphs）>"依赖关系图"（Dependency Graphs）>"架构名称"（architectureName），
可以打开architecture node的Dependency graphs。这些图表显示架构中节点和实体之间的关系。
插件图可以使用 Perl API 或 Python API 创建。
要打开已安装的插件图形，请从图形列表中选择。
== graph variants
现在，类似的图形被组合在一起，使界面更简洁、更友好。
例如，当您打开一个函数的调用图时，可能会看到如下所示的变体图列表。
您可以在图形变体之间轻松切换：
#figure(
image("./img/2023-11-11 09.08.png")
)
选择一个variant来查看该图表。
可用的variant取决于您选择的实体和图表类别，但这些是一些常见的变体：
- simplified：这是默认变量。(对于函数，它显示调用、调用方式或蝴蝶调用树的简单视图。对于对象或类型，则显示其成员的简单视图。您可以右键单击图形来控制一系列显示选项。
- classic：这是传统的图形视图。它与简化视图类似，但右键选项不同。
- With Global Objects (Classic)：与传统图形视图类似，但包含全局对象。
- Relationship：该变量显示任意两个实体之间的关系。您将被要求单击另一个实体，以查找其与所选实体的关系。您可以在 Understand 界面的任何地方点击第二个实体。您选择的实体名称会出现在 "选择第二个实体 "对话框中。此示例显示了从 pipe() 函数到 crc32() 的调用关系。
#figure(
image("./img/2023-11-11 09.14.png")
)
- dependencies：该变量包含绘制为三维方框（如图）的节点，双击这些方框可展开显示其中包含的节点。您可以不断扩展节点，直到达到实体级别。
#figure(
image("./img/2023-11-11 09.15.png")
)
- cluster：该变量提供按类或文件聚类的关系视图。双击图形中的方框可展开或折叠这些图形。可以从函数、类、文件或架构级别访问簇图。
#figure(
image("./img/2023-11-11 09.16.png")
)
- compare：该变量显示对项目的更改如何影响调用结构、数据结构、控制流或 UML 序列。要查看这些图表，需要指向同一项目的上一版本。
#figure(
image("./img/2023-11-11 09.17.png")
)
- UML Sequence Diagram：该变量显示按时间顺序排列的实体间的交互。此图适用于调用成员方法的函数和方法。在支持网站上搜索 "UML"，可找到 UML 序列图示例和有关如何显示事件的信息。
#figure(
image("./img/2023-11-11 09.18.png")
)
- custom：如果安装了插件图，则可通过选择自定义变量来使用。
您可以在 "工具">"选项 "对话框的 "图形 "类别中自定义群集图形中使用的 显示颜色、形状填充、形状和箭头。
== controlling graphical views
以下各节将介绍使用graphical views的控件。
=== graph toolbar
图形工具栏可能包含以下图标。
某些图形类型不提供所有这些图标。
使用tools > options对话框的图形类别可控制显示哪些工具栏图标
#figure(
image("./img/2023-11-11 09.19.png")
)
- variant list：选择该图表类别的变体进行查看
- Copy Image to Clipboard：允许您将图形作为图像粘贴到其他应用程序中。
- Print Graph：打开打印选项对话框以打印图形。将图形保存到文件：可将图形保存为 JPEG、PNG、SVG、Visio 或 DOT 文件
- Save Graph Customization：提示输入当前设置的名称。设置仅适用于特定图形类型和此视图中的根节点。如果您已经为该图形type/root node组合保存了设置，则可以从上下文菜单中选择要更新的设置。否则，请键入当前设置的名称，然后单击保存。
- Load Graph Customization：提示您选择要在当前窗口中打开的已命名图形设置组。列表只显示为该图表type/root node组合保存的设置。要查看已保存设置的完整列表，请选择Graphs > Dependency Graphs > Load Saved Dependency Graph.。
- undo： 撤销上次对图形自定义的更改。
- redo： 重做上次撤销的图形自定义更改。
- restore defaults：将图形恢复为原始设置。
- zoom：可以使用该下拉列表或鼠标滚轮放大或缩小。如果不想让鼠标滚轮控制缩放级别，可以在选项对话框的图表类别中禁用该行为
#figure(
image("./img/2023-11-11 09.29.png")
)
- Show Mini-Map：切换此图标可查看显示完整图表的小地图。对于大型图形，该地图有助于了解使用滚动条在图形内导航的位置。拖动或单击小地图可移动到图表中的新位置。
- show legend：某些图表类型提供图例。如果该图标显示在工具栏中，单击该图标即可显示图形图例。图例可识别图形中使用的形状和箭头样式。可以拖动图例在图形中重新定位。
- Search Graph：单击图标或按下 Ctrl+F 可在图表底部显示增量搜索栏。您可以像在 "源编辑器 "中一样使用该栏，通过名称或当前图形视图中的其他文本查找实体。当您键入搜索文本时，该字符串的所有实例都会在图形视图中突出显示。
#figure(
image("./img/2023-11-11 09.30.png")
)
- favorites：选择收藏夹列表的名称可将此图形添加到该列表中。选择添加到新收藏夹可创建新收藏夹列表并为其命名，其中包含指向此图形的链接。
#figure(
image("./img/2023-11-11 09.31.png")
)
- reuse：此复选框可控制当请求另一个图形视图时，是重复使用图形视图还是打开新标签页。该复选框默认为未选中。在任何时候，最多只能有一个图形视图选中重复使用复选框；选中此复选框后，其他选项卡中的复选框将自动取消选中。
- sync：该复选框控制当在 "项目浏览器"、"实体筛选器 "和其他允许选择实体的区域中选择不同实体时，该图形视图是否会更改。例如，如果在 "声明 "图形窗口中选中 "同步 "复选框，然后在 "实体筛选器 "中选择不同的实体，图形就会显示新选择实体的声明信息。
- release/capture window：切换此图标可在单独窗口中打开图形。这在查看较大图形时非常有用。
- configure graph settings：打开工具 > 选项对话框的图表类别
- progress：如果当前正在更新图形，此图标将显示在配置图标的右侧。
- graph settings： 汉堡包菜单提供的命令与右键单击图形背景上的命令相同
#figure(
image("./img/2023-11-11 09.34.55.png")
)
#figure(
image("./img/2023-11-11 09.35.42.png")
)
#figure(
image("./img/2023-11-11 09.36.17.png")
)
=== graph options
有关Tools > Options对话框中图形类别的信息。
将鼠标悬停在图形上或双击节点时，可以控制图形节点间关系的显示方式。
要控制图形中使用的字体，请在Tools > Options对话框的常规类别中设置Application Font。
=== mouse controls
右键单击图形背景或单击图形的汉堡包菜单，可显示适用于整个图形的控件。
右键单击图形中的实体会显示该实体的完整上下文菜单和控件。
实体子菜单包含在 Understand 中其他地方右键单击实体时看到的命令。
图形子菜单提供控制图形外观的命令。
上下文菜单中的其他命令与图形类型有关。
在某些graph变体中，右键单击边（线或箭头）会显示构成该边的引用列表。
从列表中选择一个项目，即可查看此关系的源代码。
您可以限制该列表的长度
在控制流程图中，右键单击流程图中的任意方框并选择Go To Source，
即可打开执行此操作的行的源代码。
在源代码编辑器中，右键单击函数或方法中的任意一行代码，
然后选择Graphical Views > Control Flow，即可打开选中此操作的控制流程图。
如果在信息浏览器中选中了sync复选框，单击图形中的实体就会在信息浏览器中显示该实体的信息。
按住 Ctrl 键并使用鼠标在要选择的节点上拖动一个矩形，即可选择图形中的一个或多个节点。
如果可能，双击图形中的实体可展开该实体。
=== classic context menu controls
在classic graph variant和某些其他图形类型中，
除了entity submenu和graph子菜单外，还可以为以下操作提供命令：
Expanding hierarchy：在经典图形变量中，单击节点右侧的蓝色圆圈可以展开和收缩树视图。
右键单击节点并选择Open Node, Close Node, or Close Other Nodes。
右键单击视图背景，然后选择Open All Nodes or Close All Nodes，即可expand or contract all nodes at once。
如果在使用Close All Nodes时想要保持打开多个节点，请按住 Ctrl 键选择多个节点。
#figure(
image("./img/2023-11-11 09.47.41.png")
)
要展开或收缩的节点.
Filtering graph contents：在经典图形变体中，
您可以应用筛选器在某些图形视图中隐藏某些实体。
要创建此类筛选器，请按照以下步骤操作：
1.
右键单击图形视图的背景，然后从上下文菜单中选择Edit Graphic Filters。
(请注意，某些类型的图形无法使用该选项。例如，它适用于调用图形和声明图形）。
2.
在图形过滤器对话框中，选中Enable Project Filters。
3.
单击new。这将打开图形过滤器编辑器对话框。
4.
在Filter Text字段中键入筛选器。例如，使用 `gr*` 来匹配以 gr 开头的实体名称。过滤器区分大小写。
5.
在Filter Criteria(Criteria n. 标准)中，选择筛选是否与长名称、定义文件、实体类型文本或参数文本进行比较。
例如，如果选择长名称，`print*` 的过滤器就不能匹配 `SomeProc::printWide`。相反，您可以键入 `*print*`。
6.
在 "操作 "字段中，选择以下选项之一：
- hide node： 图形中不包含与筛选器匹配的项目。
- hide sub nodes： 显示与筛选器匹配的项目，但这些项目的任何子节点都会从图表中删除。
- fold sub nodes： 与筛选器匹配的项目的任何子节点都会在图表中折叠。节点后会显示一个图标，表示存在子节点。显示符合筛选条件的项目。
- show only： 图表中只包含与筛选器匹配的项目。
7.
单击确定将筛选器添加到项目中。
单击Remove or Remove All可移除已创建的筛选器。
您创建的筛选器适用于支持筛选的所有图形视图。
您可以在graph filters对话框中暂时Disable Graphic Filters，
或者右键单击任何图形视图并从上下文菜单中选择禁用图形筛选器。
也可以右键单击图形中的实体并选择其中一个过滤选项来创建过滤。
通过这些选项，您可以快速筛选出具有该名称、该类型或该文件中的实体。
Path highlighting：在经典图形变体中，
要高亮显示树形视图（如 Callby 视图）中一个或多个实体的路径，
请选择实体并右键单击。
在上下文菜单中选择高亮显示路径。
按住 Ctrl 键可选择多个实体进行路径高亮。
#figure(
image("./img/2023-11-11 09.53.png")
)
=== customization panel controls
通过依赖关系图和聚类图等图表右侧的面板，可以隐藏、显示和高亮显示图表的部分内容。
图形自定义面板中的命令因图形类型而异。
命令是否处于活动状态取决于图形中选择的内容，以及所选节点是否有子节点和/或边进出。
#figure(
image("./img/2023-11-11 09.54.png")
)
部分命令如下：
- Highlight Edges Out of Selected Nodes。高亮显示所选节点与其他节点之间的关系（"边"）。内部依赖关系图可以高亮显示此类边缘；其他类型的依赖关系图可以显示或隐藏此类边缘。
- Highlight Edges Into Selected Nodes。使从其他节点到所选节点的关系突出显示。内部依赖关系图只能高亮显示此类边缘；其他类型的依赖关系图可显示或隐藏此类边缘。
- Clear All Highlights.。单击此按钮可关闭所有节点和边的高亮显示。
- Hide Unhighlighted Edges。从图形中删除当前选中的所有节点，并根据需要重组图形。(以后可以通过单击显示隐藏节点来恢复隐藏的节点）。
- Hide Nodes With No Highlighted Edges。如果选中此复选框，所有未突出显示的边都会被隐藏，并根据需要重组图形以省略这些未突出显示的关系。只有在开启了某些高亮边缘的情况下，才能使用此功能。
- Show Hidden Nodes。如果单击此按钮，则会恢复使用hide按钮隐藏的节点。此按钮不会展开任何已收缩以隐藏子节点的节点。如果您隐藏了节点，可以从Hidden Nodes下拉列表中选择实体来重新显示这些节点。
- show edges out。根据情况在所选节点和其他节点之间显示箭头。如果取消显示箭头，图表将重新组织以隐藏这些关系。
- show edges in。根据情况在所选节点和其他节点之间显示箭头。如果取消显示箭头，则将重新组织图形以隐藏这些关系。
- Show Dependency Browser。此按钮将打开最近在图形中选定的节点或关系的Dependency Browser。如果在Dependency Browser中选中 sync复选框，则会显示您在图形中选择的任何关系的详细信息，并且在Dependency Browser中高亮显示由该关系连接的两个节点。
- choose edges shown。您可以从该列表中选择希望在图形中显示的依赖关系类型。可用的依赖关系类型包括 Inits（初始化）、Sets（设置）、Uses（使用）、Calls（调用）和 Modifies（修改）。默认情况下，会显示所有依赖关系类型。
- show children。显示所选节点的所有子节点。这与双击节点展开节点的操作相同。
- show edges between children。在所选子节点和任何其他子节点之间酌情显示箭头。如果取消显示箭头，图表将重新组织以隐藏这些关系。
- aggregate edges out。使来自所选节点的子节点的箭头被绘制为来自该节点的箭头，并且不重复绘制来自多个子节点的具有相同目标的箭头。如果切换为 "关闭"，则会从各个子节点分别绘制箭头。
- aggregate edges in。将指向所选节点子节点的箭头绘制为指向该节点的箭头，并且指向多个子节点的箭头不会重复。如果切换为 "关闭"，则会分别绘制到各个子节点的箭头。
== context menus for graphs
右键单击图形时，有许多子菜单可让您选择如何配置和显示图形。
可用的子菜单取决于图形的类型。
本节将介绍许多子菜单，但不是全部。在此按字母顺序列出。
#figure(
image("./img/2023-11-11 10.13.png")
)
- 聚合节点（Aggregate Nodes by）菜单控制聚类图形中节点的分组方式。选项包括按功能、按类、按文件和按架构。默认情况下是按文件分组实体。
- 按架构聚合（Aggregate by Architecture）菜单控制节点的分组方式。选项是已定义的架构。默认为关闭。
- 允许调用扩展菜单控制是否可以扩展被调用函数。如果该选项为开，可扩展调用将显示为 3D 方框。默认为关闭。
- 注释菜单控制是否不显示附加到实体的注释（默认为关）、只显示最近的注释（第一）或显示所有注释。
- 架构名称菜单控制架构名称的显示方式。选项包括无、短、相对于项目和长名称。默认为相对名称。
- 背景颜色菜单控制是否使用图例中的颜色填充实体框。默认为关闭。
- 基类菜单控制声明图形是否包含基类（如果适用）。
- 调用深度菜单控制显示多少级调用。该设置范围从 0 到 10。默认为 3 级。
- 被调用深度 "菜单控制显示多少级被调用。该设置范围从 0 到 10。默认为 3 级。
- 被调用菜单控制是否在声明视图中显示调用当前实体的程序单元。
- 聚类（Cluster）菜单控制 UML 图表中是否聚类一组语句，如条件语句的 "if "或 "else "分支。默认为打开。
- 折叠（Collapse）菜单控制在控制流图中，如果语句之间没有决策点，是否将它们合并到一个框中。开尊重隐藏 "设置与 "开 "选项类似，只是隐藏节点保持隐藏。默认值为开。
- 注释菜单控制是否显示与实体相关的任何注释。默认为关闭。
- 常量菜单控制是否在声明视图中显示常量。默认为开。
- 调试菜单控制是否显示控制流图中每个项目的详细信息。详细信息依次为：nodeID、nodeKind、startLine、startCol、endLine、endCol、endNode、commaSeparatedListOfChildren。默认为关闭。
- 默认成员菜单控制声明视图是否显示类的默认成员。
- 定义/声明菜单控制定义和声明关系是否显示为边。它在对象引用和比较对象引用图形中可用。默认为关闭。
- 依赖深度（Depended On By Depth）菜单控制显示依赖于此实体的实体层数。该设置范围为 0 到 10。
- 依赖深度 "菜单控制显示该实体依赖的实体层级数。此设置的范围为 0 到 10。
- 依赖菜单控制 C 文件依赖的文件是否在 C 文件声明视图中绘制。默认为打开。
- 依赖者 "菜单控制文件声明图中是否显示依赖于当前 C 文件的文件。默认为打开。
- 派生类菜单控制声明图是否包含派生类（如果适用）。
- 重复子树菜单控制是否在层次结构视图中显示同一子树的多个出现。选项包括隐藏或显示此类子树。默认情况下显示重复的子树。在某些应用中，隐藏重复子树可以大大简化层次结构视图。如果视图中的节点超过 1000 个，则不会显示重复的子树。
- edges标签 "菜单控制是否为实体间的线条和箭头显示标签。
- 实体名称格式为 "菜单控制显示长实体名称还是短实体名称。默认为短名。
- 如果在 C++ 项目配置中启用了 "保存宏扩展文本 "选项，"扩展宏 "菜单将控制是否在控制流图中扩展宏。
- Extended By（通过扩展）菜单控制声明视图是否显示选定类通过哪些类扩展。
- Extends 菜单控制声明视图是否显示选定类所扩展的类。
- 外部函数菜单控制是否在头文件的声明视图中显示头文件或头文件包含的文件中定义的函数。默认为打开。
- 文件名菜单控制如何在视图中显示文件名。声明视图和层次结构视图均可使用。
- 无： 视图中不显示文件名。
- 简名：文件名相关时，方括号中只显示文件名。
- 全名：文件名相关时，方括号中显示完整的文件路径和文件名。
- 相对： 文件名相关时，方括号中显示相对于项目的文件路径。
- 筛选器菜单控制是否隐藏隐式操作，如控制流图中的 "endif"。默认为打开。
- 函数指针菜单控制函数指针是否显示为 Call 和 CallBy 树以及 UML 序列图中的调用。
- 全局菜单控制是否在声明视图中显示全局。默认为打开。
- 全局对象（Global Objects）菜单控制是否显示全局对象。
- 实现（Implements）菜单控制声明视图是否显示所选实体实现的实体。
- 通过实现（Implemented By）菜单控制声明视图是否显示所选实体通过其实现的实体。
- 导入（Imports）菜单控制声明视图是否显示当前实体导入的实体。
- 包含（Included By）菜单控制是否在 "头文件声明 "视图中显示包含头文件的文件。默认为打开。
- includes菜单控制是否在文件声明图（C 文件、头文件）中绘制包含文件。默认为打开。
- includes深度菜单控制显示多少级文件包含。默认为 3 级。
- 包含全局对象（Include Global Objects）菜单控制群集调用图中是否包含全局对象。默认为关闭。
- 包含标准库（Include Standard Libraries）菜单控制 UML 图表中是否包含标准库。
- 包含未解决对象（Include Unresolved）菜单控制未解决对象是否包含在图中。默认为关闭。
- 包含虚拟边（Include Virtual Edges）菜单控制是否显示覆盖边（override edges）和被覆盖边（overriddenby edges）。如果要更改虚拟边的颜色，请选择tools > options。在 "图形 "类别中，转到 "群集图形样式 "部分，在 "边 "列表中修改虚拟调用的显示格式。
- 继承菜单控制声明视图是否显示选定实体继承的实体。
- 固有函数（Intrinsic Functions）菜单控制固有函数（如 cos 和 sin）的显示或隐藏。
- 调用菜单控制是否在声明视图中显示当前存储过程或函数调用的存储过程和函数。
- 布局菜单控制图形的排列方式。它仅在层次结构和控制流图形中可用。对于某些图形类型，选项有水平和垂直两种，默认为水平。对于其他图形类型，选项如下：
- 交叉： 从左到右的视图，允许实体之间的线条交叉，从而最大限度地减少了空间，但也牺牲了一些可读性。
- 水平非交叉： 从左到右的布局，在某些情况下使用更多空间，但由于没有交叉线，因此可读性更高。
- 垂直无交叉布局： 从上到下的布局，类似于 "水平无交叉 "布局。
- 图例菜单控制是否显示图形的图例。图例可识别图形中使用的形状和箭头样式。默认为关闭。
- 层次（Level）菜单控制布局层次图或依赖关系图时要遍历的层数。默认值为 "所有层级"。可设置的值为 1 到 10。仅在层次视图中可用。
- 库菜单可让您从 Ada 调用图中排除标准库中的实体。
- 本地菜单控制是否在 "声明 "视图中显示本地项目。默认为打开。
- 成员 "菜单控制是否在 "类型树 "和 "派生类型 "视图中显示成员和运算符。可选择显示 "无"、"组件"、"运算符 "或 "运算符和组件"。
- 已修改实体（Modified Entities）菜单控制比较图中显示的修改类型。默认设置是忽略注释、空格和换行的更改。
- 名称菜单控制是否在视图中使用全名。声明视图和层次结构视图均可使用。全名包括其父编译单元。例如 - Text_Io.Put 是完全指定的名称。- Put 是短名称. 较长的名称和较短的名称会大大改变图片的布局。
- 对象菜单控制是否在声明视图中显示对象。默认为打开。
- 操作符菜单控制是否在 Callby、Declaration、Declaration Tree 和 Invocation 视图中显示操作符实体。
- 覆盖菜单控制是否显示函数覆盖。
- 参数菜单控制是否在分层视图中显示参数。该菜单适用于任何分层图形视图（调用和调用）。默认值为关闭；打开该选项可使分层图片变得更大。
- 被动菜单控制控制流图形中是否显示被动节点。默认为打开。
- 私有成员菜单控制声明视图是否显示实体的私有成员。
- 受保护成员菜单控制声明视图是否显示实体的受保护成员。
- 公共成员菜单控制声明视图是否显示实体的公共成员。
- 随机边缘颜色菜单控制是否使用随机颜色显示边缘。默认情况下，所有边缘都以相同颜色显示。
- 引用（References）菜单控制是否在比较图中显示引用的文件名和编号。默认情况下显示所有引用信息。
- 重命名菜单控制是否在 "声明 "视图中显示重命名的声明。默认情况下显示重命名声明。
- 例程菜单控制是否在声明视图中显示例程（过程、函数等）。是否显示在声明视图中。默认为打开。
- 显示类详细信息菜单控制是否显示每个类的详细信息。
- 显示相关类菜单控制是否显示与该类相关的类。
- 显示独占类菜单控制是否在控制流图中显示与语句相关的注释。默认为关闭。
- 显示边缘标签菜单控制两个实体之间的关系数是否显示为标签。对于双向调用关系，数量是两个方向的关系总数。默认为关闭。
- 显示子节点间的边 默认菜单控制是否为已展开的节点显示子节点间的边。请注意，更改此设置只会影响使用默认设置的节点；您可能需要单击恢复默认设置图标来影响整个图形。架构群集图形的默认设置为打开，而其他类型图形的默认设置为关闭。
- 默认显示节点子节点 "菜单控制是否显示依赖关系图中所有架构节点的所有子节点。默认为关闭。右键单击节点并选择 "显示子节点 "可查看单个节点的子节点。
- 显示实体（Show Entities）菜单控制是否在架构依赖关系图中显示除架构节点以外的实体。默认为打开。
- 显示实体名称菜单控制是否在控制流图开头的开始框中显示实体名称。您可以选择隐藏、显示或带参数显示名称。默认为隐藏名称。
- 显示最后块流菜单控制是否在控制流图中显示代表从 Java 和 `C#` 等语言的 try-catch 块中异常退出的边。默认为打开。
- 显示标签（Show Labels）菜单控制是否在控制流图中显示边（例如，是/否）和起始块的文本。默认为打开。
- 默认显示节点子节点菜单控制在打开群集图形时是否默认打开节点。例如，如果在打开文件的群集调用图时启用了该选项，文件中的所有函数都将默认显示。请注意，更改此设置只会影响下次打开图形时的行为。默认为关闭。
- 显示返回菜单控制 UML 图表是否显示函数返回。默认为开。
- 显示自调用菜单控制 UML 图表是否显示函数自调用。默认为开。
- 显示源代码（Show Source Code）菜单控制是否隐藏源代码、显示源代码或只显示控制流图中的决定。默认为打开。
- 比较图中的显示版本差异控制是否显示添加、删除或两种类型的差异。默认为同时显示。
- 显示未解决实体菜单控制 UML 图表是否显示未解决实体。选项包括隐藏、显示或在单独一列中显示。默认为隐藏。
- 排序（Sort）菜单可让你指定树状视图中的实体名称是否按字母顺序排序。如果关闭该选项（默认值），实体将按照在项目中出现的顺序排序。
- 通过 "间距 "菜单，可以更改方框之间的间距。你可以选择紧凑、小、正常、宽或超宽。
- 通过 Sql 菜单，可以指定是否在图形视图中显示 SQL 实体。该选项默认为打开。
- 静态菜单控制是否在函数、C 文件和头文件声明视图中绘制静态函数。静态函数是使用 "static "关键字声明的函数。它们仅在其声明的文件中可见。如果启用静态函数，则其方框边缘将位于其外层单元（C 文件）外部声明方框的边缘内。默认为开启。
- 样式标签菜单控制是否高亮显示控制流图中源代码的关键字、注释和字符串。将使用 "理解选项 "对话框（第 110 页）的 "编辑器">"样式 "类别中定义的格式。默认为打开。
- 文本菜单设置修剪或更改实体名称的方式，以适应图形布局。声明视图和层次视图都可以使用。可以将名称截断到一定长度或按一定长度包装。
- 不截断： 使用源代码中定义的名称。这是默认设置。
- 短截断：名称长度为 10 个字符时截断。
- 截断中等长度： 在 20 个字符处截断名称。
- 截断长字符： 在 30 个字符处截断名称。
- 不换行： 从不将文本换行到下一行。
- 短换行：在 8 到 10 个字符之间换行。在此范围内的位置取决于是否能找到自然换行符。自然换行符为 . `_` - 和 ：
- 中号换行： 与 "短包 "类似，但包字范围为 15-20 个字符。
- 长换行：与短换行类似，但换行范围为 20-30 个字符。
- 类型或文本菜单控制是否在图表中显示类型信息。
- 未知（Unknown）菜单控制是否显示在源代码中使用但从未声明或定义的实体。
- 未解决菜单控制是否显示已声明但未定义的实体。例如，一个实体可能已在头文件中声明，但从未在源代码中定义。未解决的包含文件是指已包含但未在已声明的包含路径（编译器或项目包含路径）中找到的文件。未解决的实体绘制与正常实体相同，但有虚线边框、
- 使用类分组菜单控制是否按包含实体的类对实体进行分组。默认为关闭。
- Usedby 菜单告诉 "声明 "视图是否显示使用此项目的项目。
- 使用菜单告诉 "使用 "视图是只显示直接使用的项目，还是也显示嵌套子程序使用的项目。默认情况下两者都显示。
- 变量菜单控制是否在声明视图中显示全局项。默认为打开。
- 虚拟调用菜单控制是否显示通过虚拟函数对其派生函数的调用。默认为关闭。
- Withs 菜单控制是否在声明视图中显示编译单元（包、任务、独立过程等......）的 Withs。默认为打开。
- With Bys 菜单控制是否在声明视图中显示特定编译单元的 "Withs"。默认为开启。
== saving graphical views
Understand 提供多种导出图形视图的方法。
每个图形视图的工具栏都提供以下图标，用于复制和打印图形。
除打印外，您还可以将图形视图保存为 JPEG、PNG、SVG 文件、Visio XML 文件和 DOT 文件。
前三种格式是常见的图形格式。
=== saving views to files
要以下列格式保存图形视图，请使用图形视图工具栏上的导出下拉菜单选择导出到 图像文件选项。
或者从菜单中选择File > Export to Image File。
在导出对话框中，选择视图的位置、文件名和文件类型。
#figure(
image("./img/2023-11-11 10.37.png")
)
- JPEG 文件是压缩位图。大多数网络浏览器、文档编辑器和图形程序都可以查看它们。这种格式是 "有损 "格式；压缩过程中会丢失一些数据。
- PNG 文件存储的压缩位图与 GIF 文件类似。大多数网络浏览器、文档编辑器和图形程序都可以查看它们。它们使用的是一种非专利压缩方法。
- SVG 文件是可缩放矢量图形文件。这种文件类型使用 XML 来描述基于矢量的二维图像。
您还可以将图形视图复制到剪贴板，然后将其作为位图粘贴到您选择的图像程序或文字处理器中。
为此，请单击图形视图工具栏上的复制图标，或从菜单中选择Edit > Copy Image to Clipboard。
然后，将图像粘贴到另一个程序中。
请注意，如果图形产生的图像大于 200 MB，则图形将被调整为较小的大小。
=== saving views as visio(只有windows有) files
Microsoft Visio 是一种基于矢量的图形程序，用于绘制流程图和类似图形。
也就是说，它处理的是形状和对象，而不是像素。
Visio XML 是一种扩展标记语言，Visio 和其他一些图形应用程序都支持这种语言。
您无需安装 Visio 即可将图形视图保存为 Visio XML 文件。
要保存 Visio XML 文件，
请使用图形视图工具栏上的 "导出 "下拉菜单选择 "导出为图像文件 "选项。
在 "导出 "对话框中，
选择视图的位置和文件名。Visio XML 文件的文件扩展名为 `*.vdx`。
=== saving views as DOT files
DOT 是一种用纯文本描述图形的语言。
许多外部工具都可以导入和编辑这种格式。
您可以将许多（但不是所有）由 Understand 生成的图形导出为 DOT 文件。
要保存 DOT 文件，
请使用图形视图工具栏的 "导出 "下拉菜单选择 "导出为 .Dot" 选项。
在 "导出 "对话框中，为视图选择位置和文件名。
文件扩展名为 `*.dot`。
#figure(
image("./img/2023-11-11 10.42.png")
)
如果 "导出 "下拉菜单中未显示该选项，
则无法将当前图形导出为 DOT 格式。
== printing graphical views
understand 有 下面这些打印模式：
- 源文件打印将文本文件发送到打印机，每页使用 66 行源文件。
- 图形视图打印提供如何将图像适合到页面的选项。
=== graphical view printing
要打印当前图形视图，可以单击图形视图工具栏上的打印图标。
或者从菜单中选择File > Print Entity Graph。
选择打印图形视图后，会出现图形打印选项对话框。
#figure(
image("./img/2023-11-11 10.46.png")
)
您可以选择以下列尺寸之一打印图像：
- Full size使用默认的 100% 缩放比例。对话框显示宽度 x 高度格式的页数。使用页面设置选择的页面大小。
- Fit to a single page缩放图像以适合所选页面尺寸。
- (scale by)按比例缩放可让您选择大小百分比，并显示将打印的页数。
如果希望将图像保存到 Adobe Acrobat 文件而不是发送到打印机，
请选中保存到 PDF 文件复选框。
此 PDF 打印功能不需要在计算机上安装第三方 PDF 生成软件。
如果希望在每页的左上角和右下角打印页码标识符，请选中打印页码标识符框。
页码采用"（列，行）"格式。例如，(1,3) 表示在拼接页面时，页面位于第三行最左边（第一列）。
如果视图适合在单页上显示，则不打印页码。
选中 "在页边距区域打印页码 "可将页码置于图表边框之外。
如果不选中该复选框，页码指示符将打印在边框标记内。
选中打印页面边框标记复选框可在每页的每个角落放置角标记。
单击打印机按钮，打开操作系统的标准打印对话框。
单击该对话框中的打印或确定后，将返回图形打印选项对话框。
单击页面设置按钮打开页面设置对话框，
您可以在其中选择纸张大小、纸张来源（如适用）、页面方向和页边距宽度。
单击确定返回图形打印选项对话框。
单击图形打印选项对话框中的确定按钮，将图形视图发送到打印机（或 PDF 文件）。
注意：
File > Page Setup菜单选项仅适用于打印源代码和其他文本文件。
图形打印选项对话框上的页面设置按钮会单独保存其设置。
== importing graphical view plugins
插件是特殊的 Perl 或 Python 脚本，可以导入以提供自定义图形视图。
请注意，为大型项目生成图形通常需要大量资源，
在某些情况下，生成图形时系统可能会长时间不响应。
= using CodeCheck for standards Verification
本章介绍如何使用 CodeCheck 查找代码中不符合各种标准的地方。
== about CodeCheck
Understand 提供了一个名为 CodeCheck 的工具，
用于确保您的代码符合已发布的编码标准或您自己的自定义标准。
这些检查可用于验证命名指南、度量要求、已发布的最佳实践，
或对您的团队非常重要的任何其他规则或约定。
#figure(
image("./img/2023-11-11 10.58.png")
)
检查可用于确保您的代码符合多个已发布的编码标准。
您可以从这些标准中选择要测试的单个检查子集。
例如，您可以检查是否所有 if...elseif 结构都包含最后的 else 子句。
对于所有语言，都提供了检查功能，让您验证各种实体类型是否符合您的命名约定，
并确认您的代码是否符合您为复杂性、函数长度和嵌套深度设置的度量要求。
如果要执行自定义检查，可以使用 Perl 创建自己的检查。
例如，你可以创建一个检查以查找长度超过 80 个字符的行或以数字开头的文件名。
支持网站上的 CodeCheck 类别中提供了 CodeCheck 验证套件。
== running a CodeCheck
要打开 CodeCheck 工具，请从菜单中选择Checks > Open CodeCheck。CodeCheck 窗口有以下工具栏：
#figure(
image("./img/2023-11-11 11.01.png")
)
您可以按照以下步骤快速运行 CodeCheck 并查看结果。
对于每个步骤，都有进一步自定义 CodeCheck 行为的方法
1.
使用配置下拉列表选择要运行的检查集。
例如，可以选择 "SciTools 推荐检查 "或 "AUTOSAR "检查。
或者，单击扳手图标，选择检查或配置检查集
2.
使用文件下拉列表选择要检查的文件。
可以选择 "所有文件"、"仅上次运行 CodeCheck 后修改的文件"、"仅 Git 仓库中未提交的更改"。
要创建自定义过滤器，
请单击过滤器图标或从下拉列表中选择 "自定义"，
然后按照第 245 页 "选择要检查的文件 "中的说明创建过滤器。
3.
单击 "检查 "按钮，对所选文件运行选定的检查。
检查在后台执行，并显示进度条。对于大型项目，执行检查可能需要很长时间。
在检查运行时，您可以继续使用 understand。
发现违规时，会将其添加到结果列表中。
4.
选择Checks > Re-Run Configuration_Name来运行最近运行的 CodeCheck 配置。
如果您对任何文件进行了更改，系统会询问您是否要在运行 CodeCheck 之前重新分析已更改的文件。
5.
选择Checks > Analyze Changes and Re-Run Configuration_Name
可自动运行Analyze Changed Files命令，然后运行最近运行的 CodeCheck 配置。
6.
使用结果下拉菜单和汉堡包菜单更改结果显示方式。
无需重新运行检查即可更改显示方式。
Violation Browser还提供了方便的搜索结果的方法。
7.
汉堡菜单还提供了处理忽略违规的方法。
使用 CodeCheck 汉堡包菜单控制结果显示。
例如，自动加载上次结果控制重新打开 CodeCheck 时是否自动显示上次执行的 CodeCheck 的结果。
释放窗口控制 CodeCheck 窗口是否包含在understand窗口中。
== configuring checks
在 "配置 "下拉列表中，您可以选择任何一组内置检查。
以下是预配置的快速检查集。这些配置不可编辑。
- SciTools 推荐检查： 针对源代码语言的推荐检查。这些是我们认为最严重的违反标准行为。
- 有效的 C++（第 3 版）<NAME>
- Hersteller Initiative 软件 (HIS) 指标
- autosar (C++14)： 涵盖了 >90% 的可静态验证 AUTOSAR 规则。
- MISRA-C 2012
- MISRA-C 2004
- MISRA-C++ 2008
要配置满足特定需求的set of Checks，
请单击扳手图标或从菜单中选择Checks > Checks Selection，
打开 CodeCheck 对话框。
通过该对话框，您可以根据现有配置或从头开始创建自己的 CodeCheck 配置。
要创建或修改配置，请执行以下操作:
1.
单击加号图标。或者，选择一个配置并单击复制图标。也可以右键单击配置名称，选择复制，或直接双击只读配置的名称。
2.
为新配置键入一个名称。沙箱 "配置可用于针对项目测试各种检查。
3.
选中希望此配置运行的验证检查旁边的复选框。检查按标准和语言分类。您安装的任何自定义检查都会列在检查列表中。
#figure(
image("./img/2023-11-11 13.09.png")
)
4.
您可以在检查列表底部选择为架构节点配置的任何依赖关系检查。单击 "Manage（管理）"打开配置依赖性检查对话框。
5.
从列表中选择检查时，该检查的相关信息将显示在检查列表下方。
对于某些类型的检查（如度量），可以更改值来控制检查的执行方式。
例如，AC_00 检查可让您选择不允许在源代码文件中使用的控制字符类型。
通过 METRIC_04 检查，您可以指定函数中允许的最大行数，并选择只计算代码行还是包括注释行和空行。
#figure(
image("./img/2023-11-11 13.10.png")
)
6.
要查找对违规类型的检查，请单击搜索图标或按下 Ctrl+F 并在搜索字段中键入字符串。
使用箭头移动到检查简述中包含搜索文本的上一个或下一个检查。
向下箭头可让您将搜索限制为区分大小写的匹配或整词。
#figure(
image("./img/2023-11-11 13.11.png")
)
7.
单击保存图标或按 Ctrl+S 保存对配置的更改。
当您选择其他配置或关闭对话框时，对配置的更改会自动保存。
8.
要继续编辑已保存的配置，请单击编辑图标。
也可以右键单击配置名称，选择编辑或重命名，或双击配置名称。
9.
要删除配置，请单击删除图标。
也可以右键单击配置名称，选择 "删除"。
10.
要获取配置执行的检查列表，请右键单击配置名称并选择全部复制。
复制到剪贴板的列表只包含每个检查的 ID 代码，如 "MISRA12_4.3"。
=== sharing configurations
您可以通过以下两种方式共享 CodeCheck 配置：
使其可共享；导出配置，以便其他人可以从文件导入配置。
如果你希望此项目的其他用户也能使用此 CodeCheck 配置，
请开始编辑配置，并选中检查列表上方右窗格中的Share this configuration选项。
选中该复选框会将配置保存为项目的一部分。
如果不选中该复选框，配置将保存在其他用户无法访问的目录中。
#figure(
image("./img/2023-11-11 13.12.png")
)
要将 CodeCheck 配置导出为可导入的文件，
请单击导出图标并浏览到要保存文件的位置。
配置保存为 JSON 文件。
您只能导出已创建（或导入）的配置；不能导出沙箱配置和已发布的标准。
要导入 CodeCheck 配置，请单击导入图标并浏览，
找到包含要导入的配置的文件。
如果配置列表中已有同名配置，则会添加后缀，如"-1"。
== selecting files to check
使用文件下拉列表选择要检查的文件。您可以选择以下任何一种：
- All Files： 检查项目中的所有文件。如果任何源文件已被编辑但尚未保存，则不会检查这些编辑；只会检查已保存的文件版本。
- Files changed since last run： 如果文件已更改并保存，则对其进行检查。
- Uncommitted changes：如果文件在与项目连接的 Git 仓库中，并且有已保存但未提交的更改，则会被检查。
- Customize：打开 "选择文件 "对话框，进一步控制检查哪些文件。过滤器图标也会打开该对话框，可与下拉列表中的其他文件选择选项一起使用。
#figure(
image("./img/2023-11-11 13.15.png")
)
选择文件 "对话框中的选项有:
- Files changed since：如果自选择日期以来没有更改过文件，则运行 CodeCheck 配置时的返回栏会显示 "0 个文件被选中"，文件下拉列表中也会显示 "Files (0)"，表示没有文件符合标准。
- Files changed in/after Git Commit：如果要检查某个提交后或某个提交中更改的文件，请选择此选项。单击 ...按钮并选择要检查的提交（或粘贴 Git 提交的哈希字符串）。
- Selected files：根据需要展开架构列表，选中架构节点旁边的复选框，确定要检查的文件。
== viewing results
使用结果下拉菜单更改结果显示方式。
执行 CodeCheck 分析后，您可以通过以下任一方式查看结果，而无需重新运行检查：
- 按文件
- 按检查
- 定位器
- 树状图
- 日志
- 违规浏览器
您可以通过忽略特定检查和违规或设置基线来隐藏某些结果。
还可以打印或导出结果。
一般来说，"结果 "区域适合对项目中的所有违规行为进行高层次概览。
相比之下，"违规浏览器 "通常是您修复问题时的首选界面，
因为它提供了更快的导航和问题过滤功能，
例如，可查找已修改但未提交的代码或过去几天内更改的代码。
=== viewing result by file
默认情况下，结果按发生违规检查的文件列出。
在结果下拉列表中，选择按文件返回此显示。
表格列出了每个文件中的违规次数及其完整文件路径。
展开文件路径可查看违规列表以及受影响的实体、行号、列号和检查 ID。
展开违规行为的行，可看到代码片段。您可以双击代码打开源文件。
#figure(
image("./img/2023-11-11 13.19.png")
)
选择违规时，表格下方会显示该检查的说明和检查的任何例外情况。
您可以在该区域选择文本，然后按 Ctrl+C 将其复制到剪贴板，以便粘贴到其他应用程序中。
CodeCheck 汉堡包菜单中的一些命令允许您显示或隐藏该显示的各个部分。
- 显示违规次数切换显示违规次数。
- 扁平化文件列表切换在文件夹层次结构中组织文件，您可以根据需要展开文件夹层次结构，或如上图所示以扁平化文件列表的形式组织文件。
=== viewing result by checks
在Results下拉列表中，选择By Checks可按违规类型对结果进行排序。
该显示类似于Results by File。但是，特定类型的所有违规都会列在一起。
#figure(
image("./img/2023-11-11 13.20.png")
)
如果启用了 CodeCheck 汉堡包菜单中的Flatten Files List选项，
则每个违规下的组织结构都是文件列表；
如果禁用了Flatten Files List选项，则是文件夹层次结构。
汉堡包菜单中的Show Violation Counts选项可以切换左栏违规次数的显示。
如果检测到很多特定类型的违规行为，
你可能需要查看检查列表中的各个检查，
看看是否可以设置选项来控制检查的灵敏度。
例如，对于 "神奇数字 "检查，可以指定位域可以设置为固定值，
也可以调用允许 0 和 1 等值的例外情况。
又如，对于 "函数太长 "检查，可以设置认为太长的长度，
并选择忽略注释行和空行。
=== viewing result in the locator
在result下拉列表中，选择locator可在表格中显示结果，
您可以根据文件名、违规名称、行号、列号和实体，使用模式匹配和排序进行搜索。
#figure(
image("./img/2023-11-11 13.24.png")
)
您可以键入值来匹配文件名和违规行为。
单击列标题中的汉堡包菜单，可查看该列的上下文菜单。
你可以选择过滤器是否区分大小写。
还可以选择过滤器模式匹配语法使用固定字符串（默认）、通配符或正则表达式。
要搜索不包含特定字符串的字段值，请键入 ！(感叹号），然后输入筛选器。
结果下方显示所选检查的说明，说明下方显示围绕违规的五行代码。您可以双击结果打开源文件。
=== viewing result by treemap
在 "结果 "下拉列表中，选择treemap以树状图的形式显示结果。
树状图通过改变节点块的大小和颜色梯度，以图形方式显示指标。
每个节点块代表一个代码文件。
可以将不同的指标与大小和颜色挂钩，以帮助您直观地显示代码的各个方面。
CodeCheck 可让您创建树状图，显示违规检查的总数或密度以及违规类型的数量。
例如，在这个树状图中，块的大小越大，表示该文件中的违规次数越多，深蓝色表示该文件中的违规类型越多。
因此，egrep.c 中的违规次数最多，而 timer.c 中的违规类型更多。
请注意，树状图上方的文字说明了所使用的设置。
#figure(
image("./img/2023-11-11 13.28.png")
)
您可以双击文件块，打开该源文件。
默认情况下，树状图以项目的文件结构作为架构节点。
在树状地图中，您可以双击一个架构节点（显示为一组彩色块周围的灰色边框），只显示该节点的内容。
您还可以右键单击节点并从上下文菜单中选择Drill down来放大节点。
向下钻取后，您可以使用图标弹出树状地图的一个层级或所有层级。
您还可以右键单击，使用上下文菜单中的 "弹出一个层级 "和 "弹出所有层级 "命令。
单击 "选项 "按钮可修改分配给尺寸和颜色的指标。
=== viewing the results log
在result下拉列表中，选择log可显示运行检查时创建的日志。
日志包括检查的文件数、执行的检查次数以及发现的违规次数。
#figure(
image("./img/2023-11-11 13.31.png")
)
如果启用了汉堡包菜单中的Use Verbose Logging，
日志还会为发现的每个违规行为单独列出一行。
必须在单击Inspect按钮之前选择该选项才能生效。
要将日志保存到文本文件，请单击导出图标。
=== viewing results in violations(错误) browser
在修复项目中的问题时，"违规浏览器 "通常是比 "结果 "视图更受欢迎的界面。
违规浏览器既显示 CodeCheck 发现的问题，也显示项目分析发现的问题。
违规浏览器还提供更快的问题导航和过滤功能，例如，可查找已修改但未提交的代码或最近几天内修改的代码。
要打开违规浏览器，请从菜单中选择Checks > Browse Violations。
#figure(
image("./img/2023-11-11 13.50.png")
)
违规旁边有一个彩色圆圈，表示问题的类型。
红色圆圈代表项目分析过程中发现的错误。
黄色圆圈代表项目分析过程中发现的警告。
灰色圆圈表示 CodeCheck 发现的问题。
单击列表中的任何违规，在源代码编辑器中打开源文件，并滚动到违规位置。
在源代码编辑器中，可以单击 "注意 "图标打开 "问题 "侧边栏，其中提供了问题描述。
注意事项图标旁边的上下箭头会移动到该源文件中的上一个/下一个问题。
如果在 "信息浏览器 "中勾选了 "同步 "框，则会显示违规信息。
展开 "检查 "节点可查看违规文本和 ID。
描述 "链接会打开一个页面，对违规进行解释，并在许多情况下给出示例。
#figure(
image("./img/2023-11-11 13.51.png")
)
通过违规浏览器中的汉堡菜单，可以显示短文件名、相对路径或完整文件路径。
您还可以清除违规浏览器的内容。
通过 "筛选器 "字段，可以快速缩小违规列表的范围，只显示您有兴趣修复的违规。
键入文本以匹配文本字符串中有关违规的任何内容。
如果希望搜索只匹配未提交的违规行为或今天或本周修改的文件中的违规行为，
请使用下拉过滤器
还可以通过检查 ID 字段、检查描述、行号、架构节点和修改日期过滤搜索。
要查看有关此类搜索语法的详细信息，
请单击 "筛选器 "字段右侧的小"? 以下是该搜索语法功能的一些示例：
#figure(
image("./img/2023-11-11 13.53.40.png")
)
=== viewing SARIF files
除了浏览由 CodeCheck 和项目分析确定的违规行为外，
您还可以将 SARIF 文件导入到 Understand 中并浏览这些违规行为。
SARIF 是一种行业标准格式，用于与其他静态分析工具交换结果。
SARIF 文件的文件扩展名为 .sarif，使用 JSON 语法。
要导入 SARIF 文件，可将文件拖放到 Understand 中。
可以在 "违规浏览器"、"信息浏览器 "和 "问题 "侧栏中查看加载的违规。
请注意，SARIF 文件通常包含文件的完整路径名，
因此您的项目可能找不到导入文件中列出的违规行为所引用的文件。
如果要更改文件路径以匹配驱动器上的路径，可以在导入前手动编辑 SARIF 文件。
== ignoring or excluding(排除) violations
违规行为可能因为被忽略或被排除而被排除在结果之外：
- 忽略的违规由用户手动添加到忽略列表中。
- 排除的违规行为是指找到但不符合检查标准的违规行为。
例如，"自定义 "选项可让您将结果限制为指定日期后更改的文件中的违规。
自该日期以来未修改的文件中的违规即为排除的违规。
CodeCheck 提供了多种方法来忽略全部或部分项目中的违规。
例如，您可能希望忽略项目使用的第三方代码中的违规。
被忽略的违规仍可在 Understand 中查看，但默认情况下是隐藏的。
如果检测到很多违规，你可能需要查看配置中的检查，看看是否可以设置选项来控制检查的敏感度。
例如，对于 "神奇数字 "检查，可以指定位域可以设置为 0 或 1，
但其他值为违规。对于 "程序单元循环复杂度 "等检查，可以设置不被视为违规的最大复杂度。
=== ignoring violations
无论您在哪里看到结果中列出的违规行为，都可以右键单击并选择忽略该违规行为。
有几种忽略设置可供选择：
- 只忽略违规实例。
- 忽略此实体在任何地方出现的此违规检查。
- 仅在此文件和代码行中忽略此实体的此检查违规。
- 忽略当前文件或在此文件位置上方所选目录层中所有文件的此检查违规。如果您选择了一个目录，则其所有子目录中的违规行为都将被忽略。
- 忽略当前文件或在此文件位置上方所选目录层中所有文件的所有检查违规。如果您选择了一个目录，其所有子目录中的违规将被忽略。
#figure(
image("./img/2023-11-11 13.58.png")
)
如果您决定不需要在结果中包含特定检查的违规行为，请选择删除检查。
这将从当前结果中删除违规，但不会从配置中删除。
下次运行 CodeCheck 配置时，将再次显示违反该检查的情况。
选择忽略违规时，系统会要求您确认是否可以忽略多个违规。
接下来，系统会询问您是否要添加关于此忽略违规的备注。
如果单击 "是"，就可以键入文本，例如解释忽略的原因。
您选择忽略的违规不会在结果列表中列出，
除非您在 CodeCheck 汉堡包菜单中启用显示忽略的违规。
如果您显示了忽略的违规，
并且在违规描述旁边的球上有一个 X，
这些违规就会突出显示。
如果隐藏违规，则违规计数不包括忽略的违规，
但如果显示忽略的违规，则包括忽略的违规。
显示排除的违规行为切换显示排除的违规行为。
这些是根据文件过滤从结果中排除的文件中的违规。
如果您忽略了任何违规，请单击忽略列表按钮，查看当前忽略的违规列表。
您可以像搜索结果定位器列表一样搜索该列表。
要删除忽略的违规（即将其恢复到结果列表中），
请在忽略列表视图中选择一行，
然后单击 CodeCheck 工具栏中的删除图标。
也可以使用右键菜单或按删除键删除选定的忽略。
=== adding notes about ignored violations
您可以为忽略列表中的每一行添加注释，并将每个忽略限制为文件中的某些行。
注释显示在注释列中，行规格显示在行列中。你可以根据这些列进行排序和筛选。
- 注释：这是文本信息，如关于忽略的注释。要为忽略添加注释，请选择一行并单击添加/编辑注释图标。键入备注并单击确定。要删除备注，请选择一行并单击删除备注文本图标。也可以使用右键菜单或按 + 和 键添加和删除备注。
- 行： 这是忽略适用的行号或行号范围。要为忽略指定行，请右键单击行并选择添加/编辑行。例如，键入 65 可将忽略只应用于第 65 行；键入 60-70 可将忽略应用于该行数范围；键入 `*` 可将忽略应用于文件中的所有行。要删除行规范，请打开相同的对话框并删除值。
=== using baseline ignore settings
CodeCheck 可让您设置一个基线，忽略旧代码中的现有违规行为，以便识别新代码或修改代码中的违规行为。
在结果和忽略列表中，基线忽略的背景为绿色，而常规违规忽略的背景为蓝色。使用代码中的注释创建的忽略（请参阅第 256 页的 "为代码添加自动忽略"）背景为橙色。(无论忽略或结果类型如何，所选行的背景都是深蓝色）。
#figure(
image("./img/2023-11-11 14.00.png")
)
要将所有当前违规设置为基线违规，请执行以下操作
1.
运行 CodeCheck 配置。
2.
单击
3.
将所有当前违规设置为基线图标。单击 "确定 "允许创建多个忽略基线。
4.
单击忽略列表按钮，查看已创建的基线忽略列表。(如果在 CodeCheck 汉堡包菜单中关闭了Show Baseline Ignores，则基线忽略将从该列表中隐藏）。
要将基线忽略更改为简单忽略，请右键单击该行，然后在忽略列表中选择Set as manual in Ignores list。
要将简单忽略更改为基线忽略，请右键单击该行，然后在Set as a Baseline in Ignores list.。
要从忽略列表中完全删除基线忽略，请右键单击该行并选择从Remove from Ignores list。
要从忽略列表中完全移除所有基线忽略，请单击 CodeCheck 工具栏中的Remove all Baseline False Positives。
要在结果列表（按文件、按检查等）中隐藏或显示基线违规，请在 CodeCheck 汉堡包菜单中切换Show Baseline Violations。
请注意，如果启用Show Baseline Violations，则会显示所有忽略的违规，因为基线忽略是忽略的一种类型。
=== adding automatic ignores to code
此外，您还可以在代码中添加注释，让 Understand 忽略特定的违规行为。一般格式如下：
```cpp
statement; //UndCC_Line(*) 关于批准违规的注释
```
例如
```cpp
goto FOO; //UndCC_Line(*) Gerry 于 2019 年 11 月 7 日批准使用 goto
```
此类注释可在忽略列表中创建一条规则，以忽略此行中的所有 CodeCheck 违规行为，并添加关于批准过程的注释。
可以使用 C 风格 (`/* */`) 或 C++ 风格 (`//`) 注释。
通过以下附加关键字，您可以为下一行、一系列行、整个文件、实体或实体中的一系列行创建忽略规则。
- `//UndCC_NextLine(*)` 忽略下一行的所有违规行为。
- `//UndCC_Begin(*)` 忽略从这一行开始到_End 的所有违规行为。
- `//UndCC_End(*)`
- `//UndCC_File(*)` 忽略此文件中的所有违规行为。
- `//UndCC_Entity(EntityName,*)` 对于名为 EntityName 的下一个实体，忽略任何地方的所有违规行为。
- `//UndCC_EntityBegin(EntityName,*)` 对于名为 EntityName 的下一个实体，忽略直到 `_EntityEnd` 的所有违规行为。
- `//UndCC_EntityEnd(EntityName,*)`
关键字后的星号可以用 CheckID 或 CheckID 列表代替，
这样只有指定的违规行为才会被忽略。
例如，下面的示例只忽略违反 MISRA 规则 2.1 的行为：
```cpp
stmt; //UndCC_File(MISRA12_2.1) 外部应用程序可访问的代码
```
有关其他详细信息和示例，请参阅支持网站上的 "CodeCheck 注释关键字 "主题。
您可以在 CodeCheck 汉堡包菜单中切换 "自动忽略时要求明确 CheckID"，
以要求所有 //UndCC 注释标识特定的 CheckID，
而不是使用星号。如果在此类注释中使用 `*`，注释将被忽略。
== exporting CodeCheck results
CodeCheck 提供了多种使用结果的方法。
- 打印： 单击 CodeCheck 工具栏中的打印图标，可将文件、检查、定位器和树状图视图中的结果打印到 PDF 文件或物理打印机上
- 导出： 单击 CodeCheck 工具栏中的导出图标，可将文件、检查和定位器视图中的结果导出为 HTML、剪贴板或文本文件。导出的文本是一个以制表符分隔的值文件，其中列出了完整的文件路径、用于识别实体的内部 ID 字符串、发生的违规类型以及识别该违规的正在执行的检查。HTML 输出还包括是否忽略违规和关于忽略违规的任何注释列。
在树状地图视图中，可以单击 PNG、JPG 或 SVG 文件。
导出图标，将树状地图保存到
使用导出图标可将日志视图复制到剪贴板中的文本文件。
复制图标或导出到
在 "按检查结果 "视图中，"导出 "图标允许您导出详细或摘要结果。摘要报告类似于下图：
#figure(
image("./img/2023-11-11 14.11.01.png")
)
== writing CodeCheck scripts
CodeCheck 脚本是一种特殊的 Python 或 Perl 脚本，可让您创建用于验证团队编码标准的自定义检查。
它们可用于验证命名指南、度量要求、已发布的最佳实践，或对团队非常重要的任何其他规则或约定。
您可以使用 Understand Python 或 Perl API 开发这些脚本，
同时还可以使用一组专门用于与 Understand CodeCheck 界面交互的特殊函数。
以下示例使用 Perl API。
您也可以通过 "und "命令行使用 CodeCheck。
用 Perl 编写的 CodeCheck 脚本文件扩展名为 `*.upl`，用 Python 编写的脚本文件扩展名为 `*.upy`。
要开始编写自己的检查，请按照以下步骤进行：
1.
在插件 Git 仓库的 CodeCheck 子目录中找到要修改的模板脚本，网址是 https://github.com/stinb/plugins。
2.
使用文本编辑器编辑模板文件。
3.
修改名称、描述和 detailed_description，使其与您计划的检查内容相匹配。
例如，您可以使用以下描述来进行检查，以确保行数不超过指定长度：
```script
# Required - Return the short name of the check sub name { return "Characters per line";}
# Required - Return the unique identifier for this check. sub checkID { return "TEST_01_CHAR_PER_LINE";}
# Required - Return the short description of the check sub description { return "Lines should not exceed a set number of characters";}
# Required - Return the long description of the check sub detailed_description { return "For readability, lines should be limited to a certain number of characters. The default is 80 characters per line.";}
```
4.
修改 test_language 子程序，以测试所需的语言。
例如，下面的测试使检查适用于 C++、Java 和 Python。
您可以查看安装目录下 `\conf\plugin\SciTools\Codecheck`子目录中的其他脚本，以获取更多示例。
```script
sub test_language {
my $language = shift;
return $language =~ /C++|Java|Python/;
return 1;
}
```
5.
如果检查应按实体进行，则 test_entity 子程序应返回 1。
如果每个文件只需运行一次检查，则 test_entity 子程序返回 0。例如
```script
sub test_entity { return 1;}
```
6.
如果每个项目只运行一次检查，则 test_global 子程序返回 1。
否则，test_global 子程序将返回 0。例如
```script
sub test_global { return 0;}
```
7.
如果检查需要用户设置选项，请修改 define_options 子程序。例如
```script
sub define_options{
my $check = shift;
$check->option->integer("charPerLine","Max Characters per line",80);
}
```
8.
修改检查子程序，使其包含检查功能，并发出 CodeCheck 违规报告信号。
下面的示例报告了不以字母开头的文件名：
```script
if ($file->name =~ /^[^a-zA-Z]/){
$check->violation(0,$file,-1,-1,"File name does not begin with a letter");
}
```
下面的示例报告的行数超过了指定的最大值：
```cpp
sub check {
my $check = shift;
my $file = shift;
return unless $file->kind->check("file");
my $maxChar = $check->option->lookup("charPerLine");
my $lineNum = 1;
foreach my $line (split('\n',$file->contents)){
my $length = length($line);
if($length > $maxChar){
$check->violation($file,$file,$lineNum,-1, "$length characters on line(Max: $maxChar)");
}
$lineNum++;
}
}
```
9.
验证 Perl 语法是否正确。
最简单的方法是打开命令行，
运行 Understand 附带的 Perl 应用程序：uperl -c mysample.upl。
=== installing custom scripts
您可以将脚本文件拖放到 "Understand "窗口中，
在 "Understand "中安装脚本。
系统会询问您是否要安装插件。单击安装。
安装自定义检查时，您会看到一条信息，指明安装检查的目录。
例如，`C:\Users\YourName\AppData\Roaming\SciTools\plugin\Codecheck`。
你可以通过将文件直接复制到此目录来安装未来的检查。
= comparing(比较) source code
本章将解释 Understand 提供的历史记录和源代码比较功能。
== comparing files and folders
Understand 提供了一个比较文件和文件夹的工具。
您可以使用该工具比较相似的文件或目录树，或比较文件或目录树的新旧副本。
要比较 Understand 项目新旧版本中的实体，还可以使用 "已更改实体 "视图
要打开此工具，请从菜单中选择Compare > Compare Files/Folders。
#figure(
image("./img/2023-11-11 14.24.png")
)
在此对话框中，选择一个文件或文件夹进行左右对比。
两边都应该是相似的文件或相似的文件夹。
单击文件按钮浏览文件；单击文件夹按钮浏览目录。然后单击Compare。
#figure(
image("./img/2023-11-11 14.25.png")
)
所选目录的子目录也会被比较。
如果比较的是文件夹，还有一个额外的底部窗格，显示文件夹级和文件级的差异，让你可以过滤要比较的内容。
比较项目中两个文件的快速方法是右键单击一个文件的名称（例如，在项目浏览器中）
并从右键菜单中选择Compare > Set as Left File/Directory Comparison，
右键单击另一个文件并选择Compare > Set as Right File/Directory Comparison，
然后选择Compare > Compare Files/Directories。
#figure(
image("./img/2023-11-11 14.29.png")
)
已更改的文件和文件夹名称显示为蓝色。
只存在于右侧版本（添加）的文件和文件夹显示为绿色，
只存在于左侧版本（删除）的文件和文件夹显示为红色。
你可以从汉堡菜单中选择显示图标，在列表中加入文件夹和文件图标。
这些图标上有箭头和 ≠ 符号，表示内容是否已添加、删除或更改。
默认情况下，会列出所有文件和文件夹。
你可以使用 "显示 "下拉菜单来选择是否将列表限制为只显示：
#figure(
image("./img/2023-11-11 14.30.png")
)
- difference：显示只存在于一个版本或在两个版本中不同的文件和文件夹。
- left only：只显示左侧版本中包含的文件（已删除）。所有不同的文件夹都会显示，因为有些文件夹可能包含只存在于左侧版本中的文件。
- right only：只显示右版本中包含的文件（已添加）。显示所有不同的文件夹，因为有些文件夹可能只包含右侧版本中的文件。
- same：显示两个版本中相同的文件。显示所有文件夹，因为一些不同的文件夹可能包含相同的文件。
在 "筛选器 "字段中，您可以键入要在目录路径或文件名中匹配的字符。
例如，输入 sim 会匹配名称中包含 "sim "的文件夹或文件。
文件夹中与筛选器（和显示下拉设置）匹配的所有文件都会显示出来。
筛选仅在单击重新扫描图标后进行。
如果要使用正则表达式，请在汉堡菜单中启用该选项。
通配符不被识别。
#figure(
image("./img/2023-11-11 14.31.png")
)
您可以高亮显示仅存在于左侧或右侧版本中的所有项目。
为此，首先右键单击文件列表并选择 "全部展开"。
然后单击 "选择 "图标，选择 "左孤儿 "或 "右孤儿"。
你会看到一个警告，表示某些项目可能被跳过；
这只适用于你没有使用 "全部展开 "的情况。
被选中的项目数量显示在工具栏中。
#figure(
image("./img/2023-11-11 14.32.png")
)
你可以将文件夹和文件从一侧复制到另一侧。
复制的项目会覆盖任何具有相同名称的项目。
要复制，首先要选择要复制的项目。
(要复制文件夹及其内容，请选择文件夹及其包含的所有文件夹和文件）。
然后单击 "复制/合并 "图标，选择向左或向右。
这将打开 "复制文件 "对话框，列出要复制的文件或文件夹。
如果列表正确，单击确定。
单击 图标撤销上次的复制/合并更改。
单击图标重做上次撤销的更改。
如果你修改了右侧的某个文件，可以单击保存图标将该文件保存到其现有位置。
如果你修改了一个文件，然后切换到另一个文件的对比，系统会询问你是否要保存和重新对比文件。
#figure(
image("./img/2023-11-11 14.33.png")
)
默认情况下，左边的文件为只读模式，右边的文件为读写模式。
你可以单击文件，然后单击状态栏中的 "RO "或 "RW "来切换文件的模式。
但是，无法保存左侧的文件。
== comparing entities
从菜单中选择Compare > Compare Entities，就可以比较两个实体。
此时会出现Compare Entities窗口。
在左右两个实体过滤窗格中选择实体，即可看到比较结果。
比较项目中定义两个实体的代码的快速方法是右键单击一个实体的名称并从上下文菜单中选择Compare > Set as Left Entity Comparison，
右键单击另一个文件并选择Compare > Set as Right Entity Comparison，然后选择Compare > Compare Entities。
#figure(
image("./img/2023-11-11 14.34.png")
)
顶部部分与其他类型的比较类似
比较下方是实体过滤器
在显示下拉菜单中选择实体类型。
然后使用列表选择要比较的两个实体。
在过滤器字段中，您可以键入要与实体名称中任意位置匹配的字符串。
在键入的同时进行筛选。通配符和正则表达式无法识别。
如果比较的实体不是文件（如函数），则不允许在比较中合并更改和保存文件。
如果比较的是文件，可以单击 "合并 "图标将更改合并到右侧的文件中，
单击 "保存 "图标将更改保存到右侧的文件中。
== comparing text
从菜单中选择Compare > Compare Arbitrary Text，
就可以比较粘贴到窗口中的文本。
将要比较的前后文本分别粘贴到左右两侧。
两边会自动进行比较：
#figure(
image("./img/2023-11-11 14.35.png")
)
文本比较类似于两个实体之间的比较。
您可以合并和取消合并差异，但不能保存文件。
如果需要保存合并后的文本，请复制并粘贴到另一个文件窗口。
比较文本的快速方法是选中某些文本，右键单击，
然后从上下文菜单中选择Compare > Set as Left-Text Comparison。
然后选中其他文本，单击右键并选择Compare > Set as Right-Text Comparison。
最后，选择Compare > Compare Text Selections。
== comparing projects
如果拥有同一项目的两个版本的完整独立副本，或者使用 Git 管理源代码，就可以比较同一项目的旧版本和新版本（或变体）。
要比较项目的不同版本，请按照以下步骤操作：
1.
打开较新版本的项目。
2.
从菜单中选择Compare > Comparison Projects。
这将打开Comparison Projects区域。
#figure(
image("./img/2023-11-11 14.39.png")
)
3.
通过以下方式之一选择项目的上一版本：
- Git revision：单击Create from Git图标。在 "从 Git 创建新项目 "对话框中，浏览到从 Git 仓库克隆的顶层目录位置。在 "Git 提交 "字段中，单击"... "按钮，选择要与当前版本比较的提交的注释（或粘贴 Git 提交的哈希字符串）。提供一个目录位置和数据库名称，以便创建一个与旧版 Git 提交相匹配的 Understand 项目。要使创建项目的项目设置与当前项目相匹配，请选中 "创建后配置设置 "复选框。单击创建项目。
- 旧版或变体项目数据库： 单击使用现有数据库图标。浏览以选择 `*.und` 目录的另一个副本，其中存储了此 Understand 项目的旧版本或变体版本。单击确定。
- 从以前比较过的项目中选择： 比较项目 "区域会列出之前比较过的项目。将鼠标光标悬停在项目文件名上可查看项目的存储位置。您可以双击一个项目，打开它进行比较。
4.
系统可能会提示您分析新数据库或现有数据库。
单击确定并等待分析完成。
如果要强制分析比较项目，请单击比较项目区域中的分析图标。
5.
如果比较项目区域列出了多个项目，请选择要与当前打开的项目进行比较的项目。
6.
从菜单中选择Compare > Locate Changed Entities，或单击比较项目区域底部的Locate Changed Entities。
(对于大型项目，这可能需要一些时间）。
这将在您的understand窗口底部打开 "已更改实体定位器 "区域，并在顶部打开比较窗格。
使用 "已更改实体定位器 "进行筛选和排序与使用 "实体定位器 "类似。
在 "项目配置 "对话框的 "历史记录 "类别中，可以控制对空白、行结束符和注释的更改是否算作对实体的更改
7.
从已更改实体列表中选择一个实体，以便查看更改。
8.
单击合并图标，可以将项目上一版本的更改合并到当前版本。单击保存图标可将更改保存到右侧的文件版本。
默认情况下，"已更改实体定位器 "中的列包括状态（已更改、已添加或已移除）、
实体、种类、已声明、已更改行、新增行、已移除行和已更改百分比。
#figure(
image("./img/2023-11-11 14.42.png")
)
你可以单击工具栏上的加号图标来添加列，
如架构路径、文件修改日期以及多个指标的新旧值差异。
您可以对所有这些列进行排序和筛选。
#figure(
image("./img/2023-11-11 14.43.png")
)
一旦设置了比较项目，就可以显示比较蝴蝶图和比较控制流图。
单击关闭比较项目图标可关闭上一个项目（以节省内存）。
== comparing graphs
如果拥有同一项目的两个版本的完整、独立副本，
就可以创建图表来比较同一项目的新旧版本。
要创建此类图表，请按照以下步骤操作：
1.
如第 265 页的比较项目中所述，指定一个比较项目，然后运行定位更改实体。
2.
右键单击一个实体（如函数），然后从图形视图中选择比较图形。
根据所选实体的类型，比较图可能包括比较控制流、比较butterfly或比较对象引用。
3.
比较图使用图例中显示的颜色突出显示已修改、已添加、已删除和未解决的实体和引用。
您可以在Tools > Options对话框的图表类别中更改这些颜色。
#figure(
image("./img/2023-11-11 14.45.png")
)
4.
单击图形中的任意节点，可跳转到图形下方文件差异窗格中两个版本项目之间的更改。
=== comparison treemaps
您还可以创建树状图，显示比较项目中文件、类或函数更改的两个统计数据之间的关系。
要生成树状图，请按照以下步骤操作：
1.
按照第 265 页的比较项目中的说明指定一个比较项目，然后运行Locate Change Entities.。
2.
从菜单中选择Compare > Changes Treemap。
这将打开 "度量树状图选项" 对话框
#figure(
image("./img/2023-11-11 14.48.png")
)
3.
在 "Map metrics for "字段中，选择树状图中的块是文件、类和结构体还是函数。
4.
在Group by字段中，选择按什么架构对数据块进行分组。
默认为目录结构。
5.
在Size Options区域，选择映射到每个块大小的比较统计量。
选项包括更改百分比、删除行数或更改行数，
或者 CountLine、CountLineCode、CountPath 或 Cyclomatic 复杂性指标的差异。
如果某些文件或函数与项目其他部分相比非常大，
限制大节点的大小会使树状图更易于查看。
在 "项目配置 "对话框（参见第 52 页）的 "历史记录 "类别中的设置可以控制对空白、行结束符和注释的更改是否算作更改。
6.
在Color Options区域中，将Map Color设置为比较统计量，
以便映射到每个块的颜色。
单击左侧颜色方块，
为该指标值最低的区块设置颜色；
单击右侧颜色方块，为该指标值最高的区块设置颜色。
7.
如果希望颜色以所选度量值的 10 次方缩放，
请选中Use Logarithmic Scale复选框。
这对具有极端值范围的树形图非常有用。
8.
如果希望在图块中看到纯色，
请取消选中缓冲框。
默认情况下，图块采用渐变填充。
9.
如果希望缩放树状图颜色，请选中自定义缩放选项并指定最小值和最大值。
如果映射到颜色梯度的度量值小于或等于最小值，节点将显示最小颜色。
同样，如果映射到颜色的度量值大于或等于最大值，则节点的颜色为最大值。
这样可以更方便地在不同项目之间进行比较，或使用相同比例的前后图片。
如果要隐藏此范围之外节点的图块，请选中隐藏自定义比例离群值复选框。
10.
单击生成树状地图以显示树状地图。
(单击树状地图右上角的选项可返回选项对话框。
== exploring git history
如果使用 Git 进行源代码控制，
Understand 还能与 Git 集成。
您可以直接在源代码中查看提交历史和其他 Git 信息。
这包括查看谁修改或创建了文件，
并排查看版本差异，以及查看提交信息，
所有这些都无需离开 Understand。
对于大多数功能，Understand 都能自动找到 Git 信息。
但在 CodeCheck 中根据未提交的更改进行过滤时例外。
要使用此功能，请在 "项目配置 "的 "历史记录 "类别中指定 Git 仓库（第 52 页）。
如果要在源代码编辑器窗口中使用 Git 集成，
请选择 Tools > Options（或 MacOS 上的 understand > perference）打开 "选项 "对话框，
然后切换以下选项：
- 在 "编辑器"类别中，切换 "边距 "区域中的 "责备 "选项。
- 在 "编辑器" > "高级" 类别中，切换 "版本控制 "区域中的 "显示内联责备 "选项（需要向下滚动才能看到）。
此外，在源代码编辑器窗口中，
可以使用汉堡包菜单中的工具栏部分类别来显示或隐藏版本控制工具栏图标，
这些图标可以显示/隐藏源代码编辑器边距中的责备栏，并打开未提交更改差异视图。
启用责任栏后，在编辑器的左侧空白处，
你会看到编写或修改每行代码的程序员姓名缩写。
如果你指向首字母缩写，
就会看到悬停文本中的作者、提交日期、提交信息和提交 ID。
#figure(
image("./img/2023-11-11 14.56.png")
)
你可以使用源代码编辑器工具栏上的图标来切换责任边距的开关。
如果修改文件时启用了责任边距，
则会在编辑时添加更改栏，以显示未提交的更改。
启用内嵌提交信息后，提交信息会显示在代码行右侧的内嵌栏中。
只显示当前选定行的 Git 提交信息。
如果提交信息较长，可将鼠标悬停在该行上查看更多信息。
#figure(
image("./img/2023-11-11 14.57.png")
)
此外，信息浏览器还会在历史节点中显示文件的任何相关 Git 信息。
展开 "历史 "下拉菜单，就能看到该文件每次提交的时间顺序列表。
#figure(
image("./img/2023-11-11 14.58.png")
)
你可以通过以下方式打开与其他比较视图类似的 "提交历史 "视图
- 单击源编辑器窗口责备边框中的提交指示器。
- 单击信息浏览器历史列表中的提交。
- 单击源代码编辑器工具栏中的图标，比较上次提交的版本和当前未提交的更改。
在此视图中，你可以将任何提交中的更改与文件的上一版本并排比较。
较新版本显示在右侧窗格中，而文件的前一个版本则显示在左侧窗格中。
该选项卡的工具栏显示了两个版本的创建或更改日期，
点击工具栏中文件名周围的箭头图标，就可以在较早和较晚的提交之间循环切换。
当右窗格显示的是未提交的工作版本时，
你可以使用工具栏上的 "还原 "图标来撤销当前选定的最后提交版本与工作版本之间的差异。
如果发现多个差异，可以使用差异数量周围的箭头导航到下一个或上一个差异。
#figure(
image("./img/2023-11-11 14.59.png")
)
== exploring differences
比较项目时，您会看到一个比较窗口。
比较下方的区域因比较的内容而异。
在各种类型的比较中，比较本身的控件保持相似。
#figure(
image("./img/2023-11-11 15.00.png")
)
左侧窗格显示正在比较的第一个项目；
右侧窗格显示第二个项目。
比较项目的名称或路径显示在两个比较窗格的上方。
如果要比较多个文件夹，可以使用文件路径周围的箭头移动到下一个或上一个文件。
如果发现多个不同点，可以使用不同点数量周围的箭头导航到下一个或上一个不同点。
在任一源窗格中单击右键，都会显示与源编辑器中类似的上下文菜单。
两个窗格的滚动在水平和垂直方向上是同步的。垂直滚动条使用高亮颜色显示代码更改部分的位置和大小。
比较文件时，左边的文件默认为只读模式，右边的文件默认为读写模式。
你可以通过单击文件，然后单击状态栏中的 "RO "或 "RW "来切换模式。
但是，无法保存左边的文件。
#figure(
image("./img/2023-11-11 15.01.png")
)
比较文件时，可以通过单击 "合并 "图标，
将当前选定的左侧版本差异合并到右侧文件中。
单击该图标可撤销上次的合并更改。
要将左侧文件中的所有差异合并到右侧文件中，
请使用合并图标旁边的下拉箭头选择 "全部合并"。
比较实体时不支持合并差异。
如果修改了右侧的文件，
可以单击保存图标将该文件保存到其现有位置。
如果您修改了一个文件，
然后切换到另一个文件的比较，
系统会询问您是否要保存并重新比较文件。
compare的汉堡包菜单
提供以下命令：
- 大小写不敏感： 默认情况下，字母大小写的改变不作为差异处理。例如，如果将 "a "改为 "A"，则不会突出显示差异。您可以通过关闭该选项来改变这种行为。
- 跳过空格： 默认情况下，更改空格或制表符的数量不会被视为差异。如果只更改了空白，则不会发现差异。你可以通过关闭该选项来改变这种行为。
- 文件为 Unicode： 默认情况下，仅报告 ASCII 文件的差异。如果 Understand 显示 "文件为二进制"，请切换此选项以打开 Unicode 文件处理。
- 高亮显示不同单词： 默认情况下，包含差异的整行都会高亮显示。切换此选项还可以用另一种颜色高亮显示个别不同的单词。
- 不同单词颜色：选择用于高亮显示比较中不同的单词、数字或符号的颜色。这种颜色是一种叠加色，会根据情况与其他高亮颜色相结合。
- 高亮颜色： 选择用于高亮比较中不同线条的颜色。
- 释放窗口： 切换此选项可在独立窗口中打开比较。这在比较较大文件时非常有用。
如果对文件进行了更改，则 "大小写不敏感"、"跳过空白 "和 "文件为 Unicode "选项不可用。
= running tools and external commands
本章将向您介绍如何在 Understand 中配置和使用源代码编辑器及其他外部工具。
== configuring tools
从菜单中选择Tools > User Tools > Configure，
打开options对话框的user tools类别，
您可以在此配置外部工具（如源代码编辑器），
以便在 Understand 中使用。
配置好的外部工具可通过上下文敏感启动。
选项 "对话框为 "用户工具 "类别提供了子类别，用于控制如何启动您配置的工具。
#figure(
image("./img/2023-11-11 15.05.png")
)
首先，使用选项对话框的用户工具类别定义命令和参数，如下所示：
1.
单击新建。
2.
在菜单文本字段中，键入希望出现在此工具的理解菜单中的名称。
您可以在菜单文本中使用变量。
例如，您可以使用 `$CurEntity` 将当前选定实体的名称放在工具名称中。
3.
如果您使用的工具在可执行文件搜索路径中，只需在命令字段中键入其文件名即可。
如果不在，请使用浏览按钮指定其可执行文件的完整路径。
4.
在参数字段中，指定需要在工具命令行中传递的参数。
以 `$Cur` 开头的变量是当前位置变量，仅适用于源代码编辑器窗口。
以 `$Decl` 开头的变量是声明变量，仅在选择了具有声明的实体时使用。
以 `$Prompt` 开头的变量会显示一个对话框，向用户询问一些信息。
可以使用 `<` 符号分隔需要来自 stdin 的参数。
例如，如果需要从 stdin 获取工具的密码，可以使用 `<` `$PromptForPassword`
参数列表中的引号与 Microsoft Windows 命令提示符窗口和 Linux 终端中的引号处理方式相同。
这与以前的行为有所不同。例如
#figure(
image("./img/2023-11-11 15.07.13.png")
)
5.
在初始目录字段中，指定工具开始运行的目录。
可以在该字段中使用 `$CurProjectDir` 等变量。
6.
在图标文件字段中，键入或浏览作为该命令图标的小型图形文件。
您可以选择 BMP、GIF、PBM、PGM、PNG、PPM、XBM 或 XPM 文件。
7.
选择要用于该命令的输入。
选项包括无（默认）、选定文本和整个文档。
选定文本 "和 "整个文档 "选项用于从 "源编辑器 "运行工具。
8.
选择要如何处理命令的输出。选项包括:
- 丢弃输出。这是默认选项。
- 在 "命令窗口 "中捕获输出，该窗口默认出现在 "信息浏览器 "附近。如果运行其他工具或重新运行同一工具，默认情况下命令窗口会重复使用。您可以取消选中命令结果窗口上的重复使用复选框，强制将结果转到新窗口。
- 替换当前源代码编辑器窗口中的选定文本。
- 替换当前源编辑器窗口中的整个文档。
- 在源编辑器窗口中创建新文档。
- 复制到剪贴板，以便将结果粘贴到其他地方。
9.
如果这是一个使用 Understand Perl API 的 Perl 脚本，请选中 Understand Perl 脚本框。
10.
如果不想在打开当前项目时使用此用户工具，
请选中禁用此项目复选框。
在当前项目打开时可用。
11.
在 "分析选项 "区域，选择您希望在该用户工具完成操作并返回之前和/或之后执行的操作。
这些操作包括保存所有文件、重新扫描项目目录中的新文件、分析修改后的文件以及分析所有文件。
12.
在 "添加到... "区域中，选择您希望在
了解。上下文菜单 "复选框会将该工具添加到右键单击的上下文菜单中。
菜单。顶层菜单 "复选框将工具添加到 "工具">"用户工具
子菜单。工具栏复选框将工具图标添加到工具栏。
要编辑现有工具的设置，请在列表中选择该工具并根据需要进行更改。
单击 "确定 "保存更改。
如果要删除工具，请选择该工具并单击删除按钮。
=== variables
以 `$Cur` 开头的变量是当前位置变量，仅适用于源代码编辑器窗口。
以 `$Decl` 开头的变量是声明变量，仅在选择了具有声明的实体时才会使用。
以 `$Prompt` 开头的变量会显示一个对话框，向用户询问一些信息。
您可以在命令或参数字段中使用以下变量
#figure(
image("./img/2023-11-11 15.23.21.png")
)
#figure(
image("./img/2023-11-11 15.24.03.png")
)
#figure(
image("./img/2023-11-11 15.24.44.png")
)
#figure(
image("./img/2023-11-11 15.25.06.png")
)
== adding tools to the context menus
一般来说，多选 `$Prompt` 变量接受格式为 "label=item1;item2 "的字符串。
任何数量的项目都可以用分号分隔。所有选中项目的项目字符串（用空格分隔）都将传递给命令。
除 `$PromptForCheckBox`、`$PromptForDir`、`$PromptForFile` 和 `$PromptForText` 外，标签均为可选项。
在 `$PromptForDir`、`$PromptForFile` 和 `$PromptForText` 的情况下，默认值是可选的。
提示在其他类型变量之后处理，因此可以在标签和值中使用其他变量。
有关示例，请参阅上表中的 `$PromptForDir` 和 `$PromptForFile`。
此外，操作系统环境变量也可用于提示语法。
例如，`$PromptForSelect` `"Dir=$PATH"` 将显示 `$PATH` 定义中所有目录路径的下拉列表。
您可以选择在单独文件中提供项目列表。
在这种情况下，大多数 `$Prompt` 变量的语法都是 `label=@<EMAIL>`。
可以通过组合变量来传递命令所需的所有参数。
所有提示都会合并到一个对话框中。
例如，如果命令是 "ls"，可以使用以下参数创建一个对话框，让您为 ls 命令选择命令行选项：
#figure(
image("./img/2023-11-11 15.28.00.png")
)
== adding tools to the tools menu
在 "工具 "选项卡中定义命令后，
"选项 "对话框中的 "上下文菜单 "类别会在左侧列出当前在上下文菜单中的用户工具，
在右侧列出可以添加到该菜单中的命令。
(上下文菜单有时也称为上下文菜单、快捷菜单、右键菜单或弹出菜单）。
选择Tools > User Tools > Configure，
然后选择User Tools > Top Level Menu类别。
#figure(
image("./img/2023-11-11 15.33.png")
)
要在上下文菜单中添加工具，请在右侧选择该工具并单击添加。
要从上下文菜单中移除工具，请在左侧选择该工具并单击移除。
用户工具在上下文菜单中显示的顺序与左侧列中列出的顺序一致。
使用 "上移 "和 "下移 "按钮可根据需要对工具进行排序。
#figure(
image("./img/2023-11-11 15.34.png")
)
本图显示了一个实体的上下文菜单，其中显示了可用的外部工具。
工具在上下文菜单中处于活动或非活动状态，取决于提供给工具的参数的上下文。
例如，将 `$DeclFile` 指定为参数的源代码编辑器可在已知声明的任何实体的上下文菜单中选择，
但对于未声明的实体或未选择实体时则不会激活。
== adding tools to the toolbar
在 "工具 "选项卡中定义命令后，
"选项 "对话框中的 "工具栏 "类别就会在左侧框中显示当前工具栏中的用户工具，
并在右侧框中显示可以添加到工具栏中的命令。
选择Tools > User Tools > Configure，然后选择User Tools > Toolbar Order类别
#figure(
image("./img/2023-11-12 10.00.png")
)
要将工具添加到工具栏，请在右侧选择该工具并单击add。
要从工具栏中移除工具，请在左侧选择该工具并单击remove。
要在工具栏中添加垂直分隔线，
请在工具栏顺序框中选择右侧应有垂直线的项目。
单击insert separator，将"-----------"添加到列表中。
所选工具的图标将按照左侧列中的顺序出现在工具栏上。
使用 "上移 "和 "下移 "按钮可根据需要对图标进行排序。
要更改特定工具的图标，请使用用户工具类别中的图标文件字段。
例如，下图显示了在图形视图图标和分割工作区图标之间添加的两个用户工具图标。
在这种情况下，第一个添加的图标由用户指定，
第二个添加的图标是用户工具的默认图标（如果没有指定图标）。
#figure(
image("./img/2023-11-12 10.01.png")
)
NOTE:
您可以右键单击工具栏背景，
选中或取消选中工具栏各部分的项目，
从而控制主工具栏中哪些图标可见。
== importing and exporting tool commands
您可以从文件中导入和导出工具命令。这样就可以方便地与同事共享工具命令。
1.
要导出命令，请选择Tools > User Tools > Configure，然后选择User Tools > Export User Tools类别。
您将看到以下对话框。
#figure(
image("./img/2023-11-12 10.02.png")
)
2.
选中要共享的命令旁边的复选框。
3.
单击导出到文件。
4.
为包含所选用户工具信息的初始化文件 (`*.ini`) 选择位置和文件名。
5.
单击保存。
要导入命令，请在选项对话框中选择用户工具类别，然后单击导入按钮。
浏览另一个 Understand 用户创建的初始化文件，然后单击打开。
在 "导入用户工具 "对话框中，选中您希望在您的 Understand 副本中可用的工具命令旁边的复选框。
== running external commands
工具">"运行命令 "菜单项允许从 Understand 直接运行任何外部命令。
常用的命令包括编译器、配置管理工具和使用 Understand API 编写的 Perl 程序。
运行命令 "对话框如下所示：
要运行命令，请按照以下步骤操作
#figure(
image("./img/2023-11-12 10.03.png")
)
1.
键入命令或单击 ... 并浏览要运行的文件。
许多 Perl 程序在understand的安装程序被提供。
2.
键入命令所需的任何命令行参数。单击右箭头。
3.
单击 ... 并浏览作为工作目录的目录。
4.
如果希望将输出发送到 Understand 中的窗口，请选中捕捉输出复选框。
5.
如果要运行 Perl 脚本，请选中 Perl API 脚本复选框，如果该脚本是 SciTools 提供的
6.
单击run。如果选中了capture output框，
输出将显示在 Understand 的 "命令窗口"中。
否则，命令将在后台运行。
7.
当命令正在运行时，您可以在 "正在运行的命令 "框中选择该命令，
然后单击 "停止 "结束命令的处理。
命令窗口中使用的字体由选项对话框的用户界面类别中的设置决定，
您可以从菜单中选择tools > options打开该对话框。
在 Unix 系统中，会捕获输出到 stdout 和 stderr 的内容。
== running plugins: graphs and interactive reports
插件是使用其中一个 Understand API 直接与 Understand 交互的脚本。
插件有两种类型：图表和交互式报告。
两者都可以引用整个项目或特定实体。
插件 Git 仓库中提供了示例、模板和文档，网址是 https://github.com/stinb/plugins。
=== APIs
Understand 图形用户界面提供了许多不同的方法来检查您的代码，
但您可能会发现还有其他方法可以访问项目信息。
因此，Understand 提供了多个 API，让您可以查询项目数据。
这些 API 是只读的；它们不会修改项目。
插件和 API 示例、模板和文档可在插件 Git 代码库中获取，
网址是 https://github.com/stinb/plugins。
Perl 和 Python API 最为强大。
如果要编写自己的图形和交互式报告插件，
建议使用 Perl 或 Python API。
以下是可用的 API：
- Perl API： 脚本文件夹中包含许多 Perl API 的示例脚本。选择帮助 > Perl API 文档，了解有关此 API 的更多信息。Understand 使用 Perl v5.34.0。
- Python API： 此 API 使用 Python 3。它提供了从 Python 脚本对 Understand 数据库的完全访问。Understand 的脚本文件夹中包含多个示例。选择 "帮助">"Python API 文档 "获取文档。Understand 使用 Python 3.10.4 版。
- C API： 该 API 可让您在 C 语言程序中访问 Understand 捕捉到的数据。
- Java API： 此 API 更轻量级；不具备其他 API 的全部功能。请参阅 Understand 安装程序的 doc/manuals/java 子目录。
- .NET API： 该 API 由我们的一位用户开发。它是用托管 C++（即 C++/CLI）编写的 .NET SDK 封装程序。编译后，任何以 .NET 框架为目标的编程语言都可以访问它。
=== interactive reports
要安装交互式报告插件，请将文件拖到understand窗口。
例如，使用 Perl API 的插件是 `.upl` 文件，
使用 Python API 的插件是 `.upy` 文件。
示例、模板和文档可从插件 Git 仓库获取，网址是 https://github.com/stinb/plugins。
要运行项目级报告，请从菜单中选择 Project > Interactive Reports > `plugin_name`。
要运行特定于实体的报告，
请右键单击 Understand 中几乎任何地方的实体名称，
然后从上下文菜单中选择`Interactive Reports > plugin_name`
=== plugin graphs
要安装插件图，可将文件拖到understand窗口。
插件图应使用 Perl 或 Python API 创建，
文件扩展名应为 `.upl` 或 `.upy`。
示例、模板和文档可从插件 Git 仓库获取，网址是 https://github.com/stinb/plugins。
要运行项目级图形，请从菜单中选择Graphs > `plugin_name`。
需要注意的是，为大型项目生成图表可能会耗费大量资源。
在某些情况下，生成图形时系统可能会长时间不响应。
要运行特定于实体的图形，请在 Understand 中几乎任何地方选择实体名称，
然后从菜单中选择Graphs > Graphs for entity_name > plugin_name。
或者，右键单击实体，从上下文菜单中选择Graphical Views > plugin_name。
= command line processing
== using the und command line
=== getting help on Und(understand软件)
=== creating a new project
=== converting a legacy(过时的) project
=== adding files to a project
=== removing items from a project
=== getting information about a project and the license
=== modifying project settings
=== importing into a project
=== exporting from a project
=== analyzing a project
=== generating reports
=== generating metrics
=== using CodeCheck
=== running perl scripts
#footnote[Perl是一种高级编程语言，它具有强大的文本处理能力和灵活的正则表达式支持。Perl最初是由Larry
Wall在1987年开发的，它被广泛应用于Web开发、系统管理、网络编程、数据处理等领域。Perl语言有着丰富的模块和库，可以满足各种不同的编程需求。]
=== creating a list of files
== using the understand command line
== using buildspy(一个功能) to build understand projects
= quick reference
== file menu
== edit menu
== search menu
== view menu
== project menu
== architectures menu
== metrics(指标) menu
== graphs menu
== checks menu
== annotations(注释) menu
== tools menu
== compare menu
== window menu
== help menu
|
|
https://github.com/jgm/typst-hs | https://raw.githubusercontent.com/jgm/typst-hs/main/test/typ/compiler/call-07.typ | typst | Other | // Error: 7 expected expression
// Error: 8 expected expression
#func(:)
// Error: 10-12 unexpected end of block comment
#func(a:1*/)
// Error: 8 expected comma
#func(1 2)
// Error: 7-8 expected identifier, found integer
// Error: 9 expected expression
#func(1:)
// Error: 7-8 expected identifier, found integer
#func(1:2)
// Error: 7-12 expected identifier, found string
#func("abc": 2)
// Error: 7-10 expected identifier, found group
#func((x):1)
|
https://github.com/AsiSkarp/grotesk-cv | https://raw.githubusercontent.com/AsiSkarp/grotesk-cv/main/src/template/content/other_experience.typ | typst | The Unlicense | #let meta = toml("../info.toml")
#import meta.import.path: experience-entry
#import "@preview/fontawesome:0.4.0": *
#let icon = meta.section.icon.other_experience
#let language = meta.personal.language
#let include-icon = meta.personal.include_icons
= #if include-icon [#fa-icon(icon) #h(5pt)] #if language == "en" [Other] else if language == "es" [Otra experiencia]
#v(5pt)
#if language == "en" [
#experience-entry(
title: [Combat Training],
date: [2029],
company: [Resistance],
location: [Los Angeles, CA],
)
] else if language == "es" [
#experience-entry(
title: [Entrenamiento de combate],
date: [2029],
company: [Resistencia],
location: [Los Ángeles, CA],
)
]
|
https://github.com/Area-53-Robotics/53E-Notebook-Over-Under-2023-2024 | https://raw.githubusercontent.com/Area-53-Robotics/53E-Notebook-Over-Under-2023-2024/giga-notebook/entries/tournament-dulaney-royal-rumble/entry.typ | typst | Creative Commons Attribution Share Alike 4.0 International | #import "/packages.typ": notebookinator, codetastic, diagraph
#import notebookinator: *
#import codetastic: qrcode
#import themes.radial.components: *
#import "@preview/plotst:0.2.0": *
#import "@preview/diagraph:0.1.0": *
#import "@preview/codetastic:0.2.2": qrcode
#show: create-body-entry.with(
title: "Tournament: Dulaney Royal Rumble",
type: "test",
date: datetime(year: 2023, month: 11, day: 4),
author: "<NAME>",
witness: "Violet Ridge",
)
#heading[Qualifications]
#tournament(
(
match: "Q5",
red-alliance: (teams: ("18391B", "18391A"), score: 44),
blue-alliance: (teams: ("53E", "929S"), score: 66),
won: true,
auton: false,
awp: false,
notes: [
We played on the defensive side of the field, with our alliance partner 929S.
They had a good shooting mechanism so we were able to just score. Our wedges worked
great and we were able to score a lot of triballs.
We went for a hang, but we ran out of time.
],
),
(
match: "Q11",
red-alliance: (teams: ("21146S", "5588B"), score: 55),
blue-alliance: (teams: ("53E", "53A"), score: 72),
won: true,
auton: false,
awp: false,
notes: [
We played the shooter position while 53A played the scoring position.
Unfortunately, our catapult jammed right away, stopping us from actually
delivering triballs to them. We tried to pivot to the offensive side, but we had
a triball loaded inside our catapult, meaning we could not possess a second
triball. Fortunately 53A was able to push enough triballs into the goal to allow
us to win the match.
],
),
(
match: "Q18",
red-alliance: (teams: ("53E", "9290B"), score: 43),
blue-alliance: (teams: ("99009A", "929T"), score: 89),
won: false,
auton: false,
awp: false,
notes: [
We played the offensive side, while 9290B played the defensive side. 9290B was
able to give us a lot of triballs, but our driver was not able to gather them
quickly enough. In addition, the motor on our intake broke off our bot. This
stopped us from picking up triballs, but it also meant that we couldn't elevate.
],
),
(
match: "Q29",
red-alliance: (teams: ("1727R", "53E"), score: 50),
blue-alliance: (teams: ("5588H", "1893X"), score: 36),
won: true,
auton: false,
awp: false,
notes: [
We played on the offensive side of the field, while 1727R played defensive.
Unfortunately, 1727R's catapult wasn't functional, meaning they couldn't give us
triballs. They joined us on the offensive side of the field, and we both pushed
triballs into the goal.
],
),
(
match: "Q41",
red-alliance: (teams: ("7135Z", "98719A"), score: 70),
blue-alliance: (teams: ("53E", "53B"), score: 60),
won: false,
auton: false,
awp: false,
notes: [
We played on the offensive side, allowing 53B to throw us triballs with their
catapult. Their catapult wasn't strong enough to shoot triballs across the
field, so we didn't have enough triballs to work with. Our driver did a good job
pushing triballs into the goal but we couldn't get enough triballs into the goal
to outpace our opponents.
],
),
(
match: "Q51",
red-alliance: (teams: ("929N", "1893C"), score: 143),
blue-alliance: (teams: ("53E", "1727A"), score: 40),
won: false,
auton: false,
awp: false,
notes: [
We played on the offensive side, receiving triballs from 1727A's catapult.
Unfortunately 1893C's robot has a blocker, so they spent the entire match
stopping 1727A from delivering triballs to us.
],
),
)
#heading[Eliminations]
#heading(level: 2)[Alliance Selection]
We ended up in 21st place, leaving us with little options. Since there were 16
seeds it was likely that we would get to pick, but there wouldn't be many very
choices. Our first pick was 1727Y who we've allied with in the past. It was an
incredibly risky pick though because they were in 27th. This means that if they
got picked before us they would have to accept, leaving us without a pick.
We also negotiated with 1727A and 1893C who were in 18th and 19th respectively.
#raw-render[```dot
digraph {
rankdir=LR;
start->"1727A picks us"
"1727A picks us"->"1893C picks us" [label = "no"]
"1727A picks us"->"end" [label = "yes"]
"1893C picks us"->"We pick 1727Y" [label = "no"]
"1893C picks us"->"end" [label = "yes"]
"We pick 1727Y"->end [label = "no"]
start[shape=Mdiamond]
end[shape=Msquare]
}
```]
In the end, 1727Y got picked by 929T and 1727A and 1893C picked each other,
leaving us without many options. We ended up getting picked by 98719A, who was
in 20th, directly above us.
#tournament(
(
match: "R16",
red-alliance: (teams: ("53C", "53F"), score: 81),
blue-alliance: (teams: ("53E", "98719A"), score: 46),
won: false,
auton: false,
awp: false,
notes: [
We played on the offensive side of the field, receiving triballs from 98719A's
puncher. This was going well until we suffered a field error. The match had to
be replayed. When this happened 53F learned about our strategy and stopped
98719A from shooting.
],
),
)
#heading[Reflection]
#grid(
columns: (1fr, 1fr),
gutter: 20pt,
pie-chart(
(value: 5, color: red, name: "Offensive"),
(value: 1, color: blue, name: "Defensive"),
),
[
We only ever played once match on the defensive side of the field. This meant
that we only got to use our catapult once, and when we did it jammed. This meant
we only ever really got to use our catapult during skills.
],
[
Since most of our matches were played on the offensive side we heavily relied on
our alliance partner's competence to win matches. Of the 4 losses we had, 3 of
them were due to our alliance partner not being able to send us enough triballs,
either due to their robot malfunctioning, or having defense played on them.
],
pie-chart(
(value: 3, color: green, name: "Wins"),
(value: 4, color: red, name: "Losses"),
),
)
#admonition(type: "note")[
#lorem(20)
]
#heading[Robot Performance]
#heading(level: 2)[Catapult]
Our catapult remained pretty unused during the competition. We played a single
match on the defensive side and during that match it jammed. It performed pretty
well during skills, and got us to in 6th place for skills.
#pro-con(pros: [
- Really fast cycle speed
], cons: [
- Still couldn't consistently shoot across the barrier
- Ratchet didn't function correctly
])
#heading(level: 2)[Elevation Mechanism]
The mechanism was overall more effective than we thought it would be, did not
score us a single elevation. The one time we got high enough off the ground to
count as elevated, the motor on our intake detached, meaning we were still
touching the ground.
#pro-con(pros: [
- Completely passive
], cons: [
- Didn't get us high enough off the ground
- Didn't consistently count as an elevation
])
#heading(level: 2)[Wings]
#pro-con(
pros: [
- Was able to consistently push several triballs into the goal at a time
],
cons: [
- Slight structural defect where the piston is mounted.
],
)
#heading(level: 2)[Intake]
The intake was one of the most used subsystems during this entire tournament. It
was incredibly useful when the field was not covered in triballs, allowing us to
move individual ones without the need for wings.
#pro-con(
pros: [
- Was able to consistently take control of triballs and assist with scoring.
- Sleds protect the sprockets for getting rammed into the goal
],
cons: [
- Completely unbraced
- Exposes it's motor for other robot to hit
- Half cut is bending
],
)
#heading(level: 2)[Wedges]
The wedges were a terrifying addition to our robot, allowing us to easily employ
defensive tactics while on the offensive side of the field.
#pro-con(
pros: [
- Was able to easily push robots that also had 6 motor drive
],
cons: [
- The wedges do not fully cover the front of the robot, leaving the tracking
wheels exposed.
- Wedges cannot be used to push triballs over the barrier.
],
)
#heading(level: 2)[Auton]
Our performance in the autonomous period was frankly embarrassing. All of our
planned routes broke down, and wouldn't correctly move the chassis. This meant
we scored:
- 0 autonomous bonuses
- 0 autonomous win points
After further investigation we discovered that this failure was caused by a
single line of code missing from the linear pid configuration.
```cpp
// forward/backward PID
inline lemlib::ChassisController_t lateralController{
10, // kP
// ERROR: kD should have been right here
1, // smallErrorRange
100, // smallErrorTimeout
3, // largeErrorRange
500, // largeErrorTimeout
5 // slew rate
};
```
#grid(
columns: (2fr, 1fr),
gutter: 20pt,
[
The reason this was possible in the first place was because LemLib wasn't using
explicit constructors to define its configuration options, it was having the
user do manual construction. This meant that instead of throwing an error at
compile time, it moved all of the other configurations up 1 (`smallErrorRange`
is now `kD`, `smallErrorTimeout` is now `smallErrorRange`, and so on), and then
default initialized the bottom value to 0. We brought this issue to the LemLib
developer's attention, and they fixed it right away. The relevant commit can be
found in the QR code to the left
],
align(
center,
qrcode(
size: 3pt,
"https://github.com/LemLib/LemLib/commit/81319e7c39e389932762f7eae5a9a000233d98b9",
),
),
)
|
https://github.com/crd2333/typst-admonition | https://raw.githubusercontent.com/crd2333/typst-admonition/master/lib.typ | typst | MIT License | /*
typst-admonitions is a typst package that provides admonitions for typst. The icons are repainted based on those in [material](https://squidfunk.github.io/mkdocs-material/reference/admonitions/). And it's easy to modify and add new icons.
author: crd2333
version: 0.1
add iconbox
add admonitions(note, abstract, info, tip, success, question, warning, failure, bug, danger, example, example2, quote)
version: 0.2
add font style and size for caption and body
version: 0.3
Nearly rewrite the code the implement admonitions by showybox, making it more flexible.
*/
#import "@preview/showybox:2.0.1": showybox
#let iconbox(
icon: emoji.info, // a symbol or an image
caption: "iconbox", // title of the box
caption_size: 16pt, // size of the caption
size: 12pt, // size of content
breakable: true, // whether the box can be broken across pages
..args
) = {
let caption = box(height: caption_size,
if type(icon) == "symbol" {
pad(caption_size * 0.15, text(caption_size, icon))
} else {
image(icon, fit: "contain", width: caption_size)
}
) + " " + box(height: caption_size * 0.8,
text(size: caption_size, ligatures: false, caption)
)
let body = showybox(
frame: (
border-color: rgb(68, 138, 255),
title-color: rgb(236, 243, 255),
footer-color: rgb(236, 243, 255).lighten(50%),
title-inset: 10pt,
),
title-style: (
color: black,
weight: "bold",
align: left
),
shadow: (
offset: 1pt,
),
title: caption,
breakable: breakable,
sep: (
dash: "densely-dashed"
),
align: right,
..args,
)
if size != 0 {
set text(size: size)
body
} else {
body
}
}
// Below are the predefined admonitions
#let note(
caption: "Note",
icon: "svg/note.svg",
titlecolor: rgb(236, 243, 255),
bordercolor: rgb(68, 138, 255),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let abstract(
caption: "Abstract",
icon: "svg/abstract.svg",
titlecolor: rgb(229, 247, 255),
bordercolor: rgb(0, 176, 255),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let info(
caption: "Info",
icon: "svg/info.svg",
titlecolor: rgb(229, 248, 251),
bordercolor: rgb(0, 184, 212),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let tip(
caption: "Tip",
icon: "svg/tip.svg",
titlecolor: rgb(229, 248, 246),
bordercolor: rgb(0, 191, 165),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let success(
caption: "Success",
icon: "svg/success.svg",
titlecolor: rgb(229, 249, 237),
bordercolor: rgb(0, 200, 83),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let question(
caption: "Question",
icon: "svg/question.svg",
titlecolor: rgb(239, 252, 231),
bordercolor: rgb(100, 221, 23),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let warning(
caption: "Warning",
icon: "svg/warning.svg",
titlecolor: rgb(255, 244, 229),
bordercolor: rgb(255, 145, 0),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let failure(
caption: "Failure",
icon: "svg/failure.svg",
titlecolor: rgb(255, 237, 237),
bordercolor: rgb(255, 82, 82),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let bug(
caption: "Bug",
icon: "svg/bug.svg",
titlecolor: rgb(254, 229, 238),
bordercolor: rgb(245, 0, 87),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let danger(
caption: "Danger",
icon: "svg/danger.svg",
titlecolor: rgb(255, 231, 236),
bordercolor: rgb(255, 23, 68),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let example(
caption: "Example",
icon: "svg/example2.svg",
titlecolor: rgb(242, 237, 255),
bordercolor: rgb(124, 77, 255),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let example2(
caption: "Example",
icon: "svg/example1.svg",
titlecolor: rgb(242, 237, 255),
bordercolor: rgb(124, 77, 255),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
#let quote(
caption: "Quote",
icon: "svg/quote.svg",
titlecolor: rgb(245, 245, 245),
bordercolor: rgb(158, 158, 158),
..args
) = iconbox(
frame: (
title-color: titlecolor,
border-color: bordercolor,
footer-color: titlecolor.lighten(60%),
title-inset: 6pt,
),
caption: caption,
icon: icon,
..args
)
|
https://github.com/TypstApp-team/typst | https://raw.githubusercontent.com/TypstApp-team/typst/master/tests/typ/bugs/flow-1.typ | typst | Apache License 2.0 | // In this bug, the first line of the second paragraph was on its page alone an
// the rest moved down. The reason was that the second block resulted in
// overlarge frames because the region wasn't finished properly.
---
#set page(height: 70pt)
#block[This file tests a bug where an almost empty page occurs.]
#block[
The text in this second block was torn apart and split up for
some reason beyond my knowledge.
]
|
https://github.com/ClazyChen/Table-Tennis-Rankings | https://raw.githubusercontent.com/ClazyChen/Table-Tennis-Rankings/main/history_CN/2019/MS-10.typ | typst |
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (1 - 32)",
table(
columns: 4,
[排名], [运动员], [国家/地区], [积分],
[1], [马龙], [CHN], [3546],
[2], [许昕], [CHN], [3436],
[3], [樊振东], [CHN], [3399],
[4], [林高远], [CHN], [3341],
[5], [林昀儒], [TPE], [3293],
[6], [蒂姆 波尔], [GER], [3241],
[7], [王楚钦], [CHN], [3235],
[8], [梁靖崑], [CHN], [3194],
[9], [迪米特里 奥恰洛夫], [GER], [3148],
[10], [雨果 卡尔德拉诺], [BRA], [3128],
[11], [周雨], [CHN], [3120],
[12], [张本智和], [JPN], [3098],
[13], [张禹珍], [KOR], [3066],
[14], [于子洋], [CHN], [3052],
[15], [帕特里克 弗朗西斯卡], [GER], [3033],
[16], [方博], [CHN], [3027],
[17], [闫安], [CHN], [3025],
[18], [郑荣植], [KOR], [3009],
[19], [金光宏畅], [JPN], [2988],
[20], [马克斯 弗雷塔斯], [POR], [2983],
[21], [克里斯坦 卡尔松], [SWE], [2979],
[22], [孙闻], [CHN], [2975],
[23], [水谷隼], [JPN], [2971],
[24], [安宰贤], [KOR], [2956],
[25], [马蒂亚斯 法尔克], [SWE], [2956],
[26], [赵胜敏], [KOR], [2956],
[27], [赵子豪], [CHN], [2955],
[28], [刘丁硕], [CHN], [2952],
[29], [周启豪], [CHN], [2946],
[30], [乔纳森 格罗斯], [DEN], [2931],
[31], [弗拉基米尔 萨姆索诺夫], [BLR], [2928],
[32], [#text(gray, "丁祥恩")], [KOR], [2927],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (33 - 64)",
table(
columns: 4,
[排名], [运动员], [国家/地区], [积分],
[33], [徐晨皓], [CHN], [2925],
[34], [夸德里 阿鲁纳], [NGR], [2924],
[35], [吉村真晴], [JPN], [2917],
[36], [GNANASEKARAN Sathiyan], [IND], [2912],
[37], [达科 约奇克], [SLO], [2907],
[38], [#text(gray, "郑培峰")], [CHN], [2901],
[39], [陈建安], [TPE], [2895],
[40], [神巧也], [JPN], [2892],
[41], [卢文 菲鲁斯], [GER], [2889],
[42], [森园政崇], [JPN], [2885],
[43], [罗伯特 加尔多斯], [AUT], [2877],
[44], [艾曼纽 莱贝松], [FRA], [2874],
[45], [#text(gray, "马特")], [CHN], [2868],
[46], [西蒙 高兹], [FRA], [2868],
[47], [#text(gray, "大岛祐哉")], [JPN], [2865],
[48], [丹羽孝希], [JPN], [2865],
[49], [#text(gray, "朱霖峰")], [CHN], [2863],
[50], [PERSSON Jon], [SWE], [2860],
[51], [SHIBAEV Alexander], [RUS], [2857],
[52], [吉村和弘], [JPN], [2852],
[53], [薛飞], [CHN], [2851],
[54], [蒂亚戈 阿波罗尼亚], [POR], [2850],
[55], [林钟勋], [KOR], [2849],
[56], [HIRANO Yuki], [JPN], [2847],
[57], [及川瑞基], [JPN], [2842],
[58], [贝内迪克特 杜达], [GER], [2841],
[59], [庄智渊], [TPE], [2831],
[60], [田中佑汰], [JPN], [2827],
[61], [黄镇廷], [HKG], [2823],
[62], [吉田雅己], [JPN], [2820],
[63], [李尚洙], [KOR], [2820],
[64], [安东 卡尔伯格], [SWE], [2815],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (65 - 96)",
table(
columns: 4,
[排名], [运动员], [国家/地区], [积分],
[65], [卡纳克 贾哈], [USA], [2813],
[66], [特鲁斯 莫雷加德], [SWE], [2811],
[67], [WALTHER Ricardo], [GER], [2810],
[68], [MAJOROS Bence], [HUN], [2810],
[69], [托米斯拉夫 普卡], [CRO], [2806],
[70], [上田仁], [JPN], [2806],
[71], [PARK Ganghyeon], [KOR], [2804],
[72], [ZHAI Yujia], [DEN], [2801],
[73], [利亚姆 皮切福德], [ENG], [2801],
[74], [赵大成], [KOR], [2796],
[75], [王臻], [CAN], [2790],
[76], [TAKAKIWA Taku], [JPN], [2787],
[77], [KOU Lei], [UKR], [2785],
[78], [宇田幸矢], [JPN], [2783],
[79], [GERELL Par], [SWE], [2782],
[80], [塞德里克 纽廷克], [BEL], [2778],
[81], [安德烈 加奇尼], [CRO], [2772],
[82], [WEI Shihao], [CHN], [2769],
[83], [雅克布 迪亚斯], [POL], [2767],
[84], [沙拉特 卡马尔 阿昌塔], [IND], [2766],
[85], [SKACHKOV Kirill], [RUS], [2766],
[86], [周恺], [CHN], [2762],
[87], [村松雄斗], [JPN], [2761],
[88], [BADOWSKI Marek], [POL], [2754],
[89], [巴斯蒂安 斯蒂格], [GER], [2752],
[90], [MONTEIRO Joao], [POR], [2750],
[91], [PISTEJ Lubomir], [SVK], [2750],
[92], [帕纳吉奥迪斯 吉奥尼斯], [GRE], [2749],
[93], [詹斯 伦德奎斯特], [SWE], [2748],
[94], [博扬 托基奇], [SLO], [2744],
[95], [#text(gray, "WANG Zengyi")], [POL], [2743],
[96], [HWANG Minha], [KOR], [2741],
)
)#pagebreak()
#set text(font: ("Courier New", "NSimSun"))
#figure(
caption: "Men's Singles (97 - 128)",
table(
columns: 4,
[排名], [运动员], [国家/地区], [积分],
[97], [廖振珽], [TPE], [2734],
[98], [HO Kwan Kit], [HKG], [2731],
[99], [汪洋], [SVK], [2726],
[100], [户上隼辅], [JPN], [2722],
[101], [DRINKHALL Paul], [ENG], [2719],
[102], [松平健太], [JPN], [2718],
[103], [AKKUZU Can], [FRA], [2718],
[104], [KARAKASEVIC Aleksandar], [SRB], [2717],
[105], [<NAME>], [BRA], [2716],
[106], [徐瑛彬], [CHN], [2715],
[107], [<NAME>], [SLO], [2713],
[108], [#text(gray, "金珉锡")], [KOR], [2708],
[109], [牛冠凯], [CHN], [2708],
[110], [NORDBERG Hampus], [SWE], [2706],
[111], [<NAME>], [ESP], [2706],
[112], [邱党], [GER], [2706],
[113], [尼马 阿拉米安], [IRI], [2697],
[114], [<NAME> Song], [PRK], [2696],
[115], [安德斯 林德], [DEN], [2696],
[116], [WU Jiaji], [DOM], [2693],
[117], [ROBLES Alvaro], [ESP], [2692],
[118], [斯特凡 菲格尔], [AUT], [2691],
[119], [<NAME>], [UKR], [2688],
[120], [<NAME>], [ROU], [2687],
[121], [<NAME>], [JPN], [2686],
[122], [<NAME>], [ROU], [2685],
[123], [<NAME>], [AUT], [2683],
[124], [木造勇人], [JPN], [2680],
[125], [<NAME>], [GER], [2680],
[126], [<NAME>], [FRA], [2672],
[127], [<NAME>], [POR], [2672],
[128], [<NAME>], [JPN], [2670],
)
) |
|
https://github.com/jgm/typst-hs | https://raw.githubusercontent.com/jgm/typst-hs/main/test/typ/compiler/array-12.typ | typst | Other | // Error: 2-11 array is empty
#().last()
|
https://github.com/LDemetrios/Conspects-4sem | https://raw.githubusercontent.com/LDemetrios/Conspects-4sem/master/typst/styles/themes/sepia.typ | typst | #let background = rgb("#ebd5b3")
#let foreground = black
#let red-ish = rgb("#770000")
#let green-ish = rgb("#007700")
#let blue-ish = rgb("#000077")
#let yellow-ish = rgb("#777700")
#let pagewidth = none
#let pageheight = auto
|
|
https://github.com/HiiGHoVuTi/requin | https://raw.githubusercontent.com/HiiGHoVuTi/requin/main/algo/autoref.typ | typst | #import "../lib.typ": *
#show heading: heading_fct
On dit qu'un tableau $T$ d'entiers de longueur $n$ est _auto-référent_ si pour tout $i < n$, $T[i]$ représente le nombre d’occurrence de $i$ dans $T$. Les tableaux commence à l'indice 0.
Par exemple, $[1,2,1,0]$ est un tableau autoréférent de longueur 4.
#question(0)[Donner le deuxième tableau autoréférent de longueur 4]
#question(1)[Donner un code $"C"$ qui vérifie si un tableau de longueur $n$ est autoréférent en $O(n)$]
#question(2)[Donner un code $"C"$ de recherche exaustive qui renvoie le nombre de tableaux référent de longueur $k$]
#question(2)[Montrer que pour $n>6$, il existe un tableau auto-référent de longueur $n$]
#correct[
0. C'est $[2,0,2,0]$
1. ```C
int is_auto_ref(int* arr, int n) {
int* occ = malloc(sizeof(int)*n);
for (int i=0;i<n;i++) { // init
occ[i] = 0;
}
for (int i=0;i<n;i++) { // fill the occurence table
if (arr[i]>=n || arr[i]<0)
return 0;
occ[arr[i]]++;
}
for (int i=0;i<n;i++) { // check if occ = table
if (occ[i] != arr[i])
return 0;
}
return 1;
}
```
2. ```C
int search_rec(int* arr, int i, int n) {
if (i == n)
return is_auto_ref(arr,n);
int count = 0;
for(int j=0;j<n;j++) {
arr[i] = j;
count += search_rec(arr,i+1,n);
}
return count;
}
```
3. Soit $n >4$, le tableau $[n-4,2,1,0,...,1,0,0,0]$ est toujours autoréférent.
]
#question(3)[Montrer que pour $n>6$, le tableau autoréférent donné à la question précédente est l'unique tableau autoréférent.] |
|
https://github.com/icpmoles/politypst | https://raw.githubusercontent.com/icpmoles/politypst/main/aside/abstract_ita.typ | typst | #let abstract_ita = [
#heading(numbering: none)[Abstract in in lingua italiana]
Qui va l’Abstract in lingua italiana della tesi seguito dalla lista di parole chiave.
$ 1 = integral_1^2 1 d x $
] |
|
https://github.com/7sDream/fonts-and-layout-zhCN | https://raw.githubusercontent.com/7sDream/fonts-and-layout-zhCN/master/chapters/02-concepts/dimension/dim-2.typ | typst | Other | #import "/lib/draw.typ": *
#import "/lib/glossary.typ": tr
#import "dim-1.typ": start, end, base, lt, rb, line-color, graph as dim1
#let bbox-calc = (lt, rb, arg) => {
let (l, t, r, b) = arg
return ((lt.at(0) + l, lt.at(1) - t),
(rb.at(0) - r, rb.at(1) + b))
}
#let (bbox-lt, bbox-rb) = bbox-calc(lt, rb, (7, 11, 8, 5))
#let graph = with-unit((ux, uy) => {
// mesh(start, end, (50, 50), stroke: 1 * ux + gray)
rect(bbox-lt, end: bbox-rb, stroke: 1 * ux + line-color)
let bbox-ct = (
(bbox-lt.at(0) + bbox-rb.at(0)) / 2,
bbox-lt.at(1),
)
txt(text(fill: line-color)[#tr[outline]#tr[bounding box]], bbox-ct, anchor: "cb", size: 12 * ux)
dim1
})
#canvas(end, start: start, width: 55%, graph)
|
https://github.com/Jollywatt/typst-wordometer | https://raw.githubusercontent.com/Jollywatt/typst-wordometer/master/tests/exclude/test.typ | typst | MIT License | #import "/src/lib.typ": *
#set page(width: 15cm, height: auto)
= Excluding elements by type
#word-count(total => [
== Not me.
One, two, three. #strike[Not me, either.] Four.
#strike[Words: #total.words]
], exclude: (heading, strike))
#pagebreak()
= Excluding elements by label
#word-count(total => [
=== One two
Three, four.
=== Not me! <no-wc>
Five, six.
#total
], exclude: (raw, <no-wc>))
#line(length: 100%)
#word-count(total => [
One, two, three, four.
#[That was #total.words, not counting this sentence!] <no-wc>
], exclude: <no-wc>)
#line(length: 100%)
#let el = [
One two three four.
#[But not me] <not-me>
]
#rect(el)
#word-count-of(exclude: <not-me>, el).words |
https://github.com/typst-doc-cn/tutorial | https://raw.githubusercontent.com/typst-doc-cn/tutorial/main/src/graph/digraph.typ | typst | Apache License 2.0 | #import "mod.typ": *
#show: book.page.with(title: [拓扑图])
|
https://github.com/frectonz/the-pg-book | https://raw.githubusercontent.com/frectonz/the-pg-book/main/book/088.%20disagree.html.typ | typst | disagree.html
How to Disagree
March 2008The web is turning writing into a conversation. Twenty years ago,
writers wrote and readers read. The web lets readers respond, and
increasingly they do—in comment threads, on forums, and in their
own blog posts.Many who respond to something disagree with it. That's to be
expected. Agreeing tends to motivate people less than disagreeing.
And when you agree there's less to say. You could expand on something
the author said, but he has probably already explored the
most interesting implications. When you disagree you're entering
territory he may not have explored.The result is there's a lot more disagreeing going on, especially
measured by the word. That doesn't mean people are getting angrier.
The structural change in the way we communicate is enough to account
for it. But though it's not anger that's driving the increase in
disagreement, there's a danger that the increase in disagreement
will make people angrier. Particularly online, where it's easy to
say things you'd never say face to face.If we're all going to be disagreeing more, we should be careful to
do it well. What does it mean to disagree well? Most readers can
tell the difference between mere name-calling and a carefully
reasoned refutation, but I think it would help to put names on the
intermediate stages. So here's an attempt at a disagreement
hierarchy:
DH0. Name-calling.This is the lowest form of disagreement, and probably also the most
common. We've all seen comments like this:
u r a fag!!!!!!!!!!
But it's important to realize that more articulate name-calling has
just as little weight. A comment like
The author is a self-important dilettante.
is really nothing more than a pretentious version of "u r a fag."
DH1. Ad Hominem.An ad hominem attack is not quite as weak as mere name-calling. It
might actually carry some weight. For example, if a senator wrote
an article saying senators' salaries should be increased, one could
respond:
Of course he would say that. He's a senator.
This wouldn't refute the author's argument, but it may at least be
relevant to the case. It's still a very weak form of disagreement,
though. If there's something wrong with the senator's argument,
you should say what it is; and if there isn't, what difference does
it make that he's a senator?Saying that an author lacks the authority to write about a topic
is a variant of ad hominem—and a particularly useless sort, because
good ideas often come from outsiders. The question is whether the
author is correct or not. If his lack of authority caused him to
make mistakes, point those out. And if it didn't, it's not a
problem.
DH2. Responding to Tone.The next level up we start to see responses to the writing, rather
than the writer. The lowest form of these is to disagree with the
author's tone. E.g.
I can't believe the author dismisses intelligent design in such
a cavalier fashion.
Though better than attacking the author, this is still a weak form
of disagreement. It matters much more whether the author is wrong
or right than what his tone is. Especially since tone is so hard
to judge. Someone who has a chip on their shoulder about some topic
might be offended by a tone that to other readers seemed neutral.So if the worst thing you can say about something is to criticize
its tone, you're not saying much. Is the author flippant, but
correct? Better that than grave and wrong. And if the author is
incorrect somewhere, say where.DH3. Contradiction.In this stage we finally get responses to what was said, rather
than how or by whom. The lowest form of response to an argument
is simply to state the opposing case, with little or no supporting
evidence.This is often combined with DH2 statements, as in:
I can't believe the author dismisses intelligent design in such
a cavalier fashion. Intelligent design is a legitimate scientific
theory.
Contradiction can sometimes have some weight. Sometimes merely
seeing the opposing case stated explicitly is enough to see that
it's right. But usually evidence will help.DH4. Counterargument.At level 4 we reach the first form of convincing disagreement:
counterargument. Forms up to this point can usually be ignored as
proving nothing. Counterargument might prove something. The problem
is, it's hard to say exactly what.Counterargument is contradiction plus reasoning and/or evidence.
When aimed squarely at the original argument, it can be convincing.
But unfortunately it's common for counterarguments to be aimed at
something slightly different. More often than not, two people
arguing passionately about something are actually arguing about two
different things. Sometimes they even agree with one another, but
are so caught up in their squabble they don't realize it.There could be a legitimate reason for arguing against something
slightly different from what the original author said: when you
feel they missed the heart of the matter. But when you do that,
you should say explicitly you're doing it.DH5. Refutation.The most convincing form of disagreement is refutation. It's also
the rarest, because it's the most work. Indeed, the disagreement
hierarchy forms a kind of pyramid, in the sense that the higher you
go the fewer instances you find.To refute someone you probably have to quote them. You have to
find a "smoking gun," a passage in whatever you disagree with that
you feel is mistaken, and then explain why it's mistaken. If you
can't find an actual quote to disagree with, you may be arguing
with a straw man.While refutation generally entails quoting, quoting doesn't necessarily
imply refutation. Some writers quote parts of things they disagree
with to give the appearance of legitimate refutation, then follow
with a response as low as DH3 or even DH0.DH6. Refuting the Central Point.The force of a refutation depends on what you refute. The most
powerful form of disagreement is to refute someone's central point.Even as high as DH5 we still sometimes see deliberate dishonesty,
as when someone picks out minor points of an argument and refutes
those. Sometimes the spirit in which this is done makes it more
of a sophisticated form of ad hominem than actual refutation. For
example, correcting someone's grammar, or harping on minor mistakes
in names or numbers. Unless the opposing argument actually depends
on such things, the only purpose of correcting them is to
discredit one's opponent.Truly refuting something requires one to refute its central point,
or at least one of them. And that means one has to commit explicitly
to what the central point is. So a truly effective refutation would
look like:
The author's main point seems to be x. As he says:
<quotation>
But this is wrong for the following reasons...
The quotation you point out as mistaken need not be the actual
statement of the author's main point. It's enough to refute something
it depends upon.
What It MeansNow we have a way of classifying forms of disagreement. What good
is it? One thing the disagreement hierarchy doesn't give us is
a way of picking a winner. DH levels merely describe the form of
a statement, not whether it's correct. A DH6 response could still
be completely mistaken.But while DH levels don't set a lower bound on the convincingness
of a reply, they do set an upper bound. A DH6 response might be
unconvincing, but a DH2 or lower response is always unconvincing.The most obvious advantage of classifying the forms of disagreement
is that it will help people to evaluate what they read. In particular,
it will help them to see through intellectually dishonest arguments.
An eloquent speaker or writer can give the impression of vanquishing
an opponent merely by using forceful words. In fact that is probably
the defining quality of a demagogue. By giving names to the different
forms of disagreement, we give critical readers a pin for popping
such balloons.Such labels may help writers too. Most intellectual dishonesty is
unintentional. Someone arguing against the tone of something he
disagrees with may believe he's really saying something. Zooming
out and seeing his current position on the disagreement hierarchy
may inspire him to try moving up to counterargument or refutation.But the greatest benefit of disagreeing well is not just that it
will make conversations better, but that it will make the people
who have them happier. If you study conversations, you find there
is a lot more meanness down in DH1 than up in DH6. You don't have
to be mean when you have a real point to make. In fact, you don't
want to. If you have something real to say, being mean just gets
in the way.If moving up the disagreement hierarchy makes people less mean,
that will make most of them happier. Most people don't really enjoy
being mean; they do it because they can't help it.
Thanks to <NAME> and <NAME> for reading
drafts of this.Related:What You Can't SayThe Age of the EssayItalian TranslationRussian TranslationSwedish TranslationSpanish TranslationGerman TranslationFrench TranslationArabic TranslationFinnish TranslationItalian TranslationTurkish Translation
|
|
https://github.com/Student-Smart-Printing-Service-HCMUT/ssps-docs | https://raw.githubusercontent.com/Student-Smart-Printing-Service-HCMUT/ssps-docs/main/contents/categories/task4/4.1.typ | typst | Apache License 2.0 | #pagebreak()
= Implementation - Sprint 1
== Thiết lập kho lưu trữ trực tuyến
Nhóm lựa chọn Github - dịch vụ cung cấp kho lưu trữ mã nguồn *Git* dựa trên nền tảng web để phát triển dự án lần này.
Nhóm chia ra 2 nhánh riêng biệt: ssps-fe và ssps-be để các thành viên hoạt động trong 2 nhánh này có thể hoạt động và phát triển sản phẩm
một cách thuận tiện nhất. Hình ảnh và link tham khảo của 2 repository tương ướng với frontend và backend.
=== Kho lưu trữ frontend (Ticklab/spss-fe)
Link truy cập: #link("https://github.com/TickLabVN/ssps-fe")
#figure(caption: "Kho lưu trữ frontend", image("../../images/ssps-fe.png", fit: "contain"))
=== Kho lưu trữ backend (Ticklab/spss-be)
Link truy cập: #link("https://github.com/TickLabVN/ssps-be")
#figure(caption: "Kho lưu trữ backend", image("../../images/ssps-be.png", fit: "contain")) |
https://github.com/VisualFP/docs | https://raw.githubusercontent.com/VisualFP/docs/main/SA/design_concept/content/design/design_iteration_1_criteria.typ | typst | = Design Evaluation Criteria <design-evaluation-criteria>
Since it is difficult to compare designs in a quantitative manner,
the design evaluation process is based on selected code scenarios and a non-quantitative questionnaire.
A survey will be conducted using the questionnaire and example
visualizations for specific code scenarios to get further valuable feedback to
improve initial designs. The survey targets a selected group of students and
some more experienced functional programmers.
The code scenarios and questionnaire questions can be found below.
== Code Scenarios <design_eval_code_scenarios>
These code scenarios were defined to evaluate visualization designs regarding
their simplicity and clarity of the underlying functional concepts.
=== Simple Addition Function
@design_eval_addition has been chosen to evaluate designs for the composition of
a simple function using another function.
#figure(
```hs
addition :: Num a => a -> a -> a
addition a b = (+) a b
```,
caption: "Addition function for design evaluation"
)<design_eval_addition>
=== Even numbers from 1 to 10
@design_eval_even has been chosen to evaluate designs for list handling.
#figure(
```hs
evenOneToTen :: Integral a => [a]
evenOneToTen = [x | x <- [1 .. 10], even x]
```,
caption: "Function that returns even numbers between 1 and 10"
)<design_eval_even>
=== Product of Numbers
@design_eval_product has been chosen to evaluate designs for recursive functions.
#figure(
```hs
product :: Num a => [a] -> a
product [] = 1
product (n : ns) = (*) n (product ns)
```,
caption: "Product function for design evaluation"
)<design_eval_product>
=== Map Add 5 Function
@design_eval_currying has been chosen to evaluate designs for currying.
#figure(
```hs
mapAdd5 :: Num b => [b] -> [b]
mapAdd5 = map ((+) 5)
```
)<design_eval_currying>
== Evaluation Questionnaire <design_eval_questionnaire>
The survey participants are asked to answer the following questions for every
design proposal:
- Were you able to understand the meaning of the boxes and arrows?
- Do you find the concept nice to look at?
- Could you imagine teaching functional programming using this visualization?
- Could you imagine how the concept scales to more complex expressions?
- Do you have any suggestions for improvement or general comments on the concept?
Additionally, every survey participant can suggest a visualization concept of
their own.
The questionnaire template handed out to survey participants can be found in
@appendix_design_eval_questionnaire.
|
|
https://github.com/dark-flames/apollo-typst | https://raw.githubusercontent.com/dark-flames/apollo-typst/main/content/posts/multi-version-full.md | markdown | Apache License 2.0 | +++
title = "Ancestors: Multi Version(Full)"
date = "2024-07-09"
[taxonomies]
tags=["documentation"]
[extra]
typst = "intro/full"
+++
|
https://github.com/lublak/typst-echarm-package | https://raw.githubusercontent.com/lublak/typst-echarm-package/main/examples/pie.typ | typst | MIT License | #set page(width: 200mm, height: 150mm, margin: 0mm)
#import "../typst-package/lib.typ" as echarm
#echarm.render(width: 100%, height: 100%, options: (
legend: (
top: "5%",
left: "center"
),
series: (
name: "Access Form",
type: "pie",
radius: ("40%", "70%"),
avoidLabelOverlap: false,
itemStyle: (
borderRadius: 10,
borderColor: "#fff",
borderWidth: 2,
),
label: (
"show": false,
),
labelLine: (
"show": false,
),
data: (
(value: 1048, name: "Search Engine"),
(value: 735, name: "Direct"),
(value: 580, name: "Email"),
(value: 484, name: "Union Ads"),
(value: 300, name: "Video Ads"),
)
),
)) |
https://github.com/jgm/typst-hs | https://raw.githubusercontent.com/jgm/typst-hs/main/test/typ/compiler/closure-07.typ | typst | Other | // Let + closure bindings.
#{
let g = "hi"
let f() = {
let g() = "bye"
g()
}
test(f(), "bye")
}
|
https://github.com/Myriad-Dreamin/typst.ts | https://raw.githubusercontent.com/Myriad-Dreamin/typst.ts/main/fuzzers/corpora/layout/align_06.typ | typst | Apache License 2.0 |
#import "/contrib/templates/std-tests/preset.typ": *
#show: test-page
//
// // Error: 8-30 cannot add a vertical and a 2D alignment
// #align(top + (bottom + right), [A]) |
https://github.com/Walfisch115/thb-typst-template | https://raw.githubusercontent.com/Walfisch115/thb-typst-template/main/presentation/main.typ | typst | #import "conf.typ": *
#show: conf
// set global values
#let presentationTitle = [Aufregender Präsentationstitel]
#let supervisor = [Dr. rer. pol. <NAME>]
#let date = [21.04.2014]
#titleSlide(
title: presentationTitle,
supervisor: supervisor,
date: date
)
#slide(
presentationTitle: presentationTitle,
date: date,
title: [Ich bin ein Folientitel],
body: [
#lorem(30)
- Punkt
- Punkt
- Punkt
]
)
#slide()
#titleSlide(
title: [Vielen Dank für Ihre Aufmerksamkeit!],
supervisor: supervisor,
date: date
) |
|
https://github.com/Myriad-Dreamin/typst.ts | https://raw.githubusercontent.com/Myriad-Dreamin/typst.ts/main/fuzzers/corpora/text/raw_09.typ | typst | Apache License 2.0 |
#import "/contrib/templates/std-tests/preset.typ": *
#show: test-page
// Take last line into account when computing dedent.
```
A
B
```
|
https://github.com/Area-53-Robotics/53B-Notebook-Over-Under-2023-2024 | https://raw.githubusercontent.com/Area-53-Robotics/53B-Notebook-Over-Under-2023-2024/master/entries/intro/about.typ | typst | Creative Commons Attribution Share Alike 4.0 International | #import "/templates/entries.typ": *
#import "/templates/headers.typ": *
#import "/templates/text.typ": *
#create_footerless_page(
title: [Notebook Workflow],
date: [],
content: [
#box_header(
title: [Why Digital?],
color: purple.lighten(60%)
)
#entry_text()
Last year, our notebook workflow was very disorganized and pushed most of the work onto one team member. Not only was this unfair, it also meant that our notebook was not the highest quality and one person was doing more work than they needed to. So this year, we have decided to do an all virtual notebook, where entries are written by all the team members, and the "notebooker" is the one formatting them.
#entry_header(
title: [How does it work?]
)
#entry_text()
The way our notebook process works is that team members will write entries in a shared google doc, while not having to worry about formatting, making it a lot quicker. Then, the notebooker will copy entries from the google doc and format them in typst, which is a LaTex-like coding language for creating documents. Then, another member will print out the pages and put them in our notebook binder.
#entry_header(
title: [Typst?]
)
#entry_text()
Typst is an open-source document language written in rust that offers many powerful features for advanced writing. Typst has many useful tools, such as better math handling, better organization and consitency, while also allows users to create their own templates and functions.
\
=== _Defining custom function:_
```typ
// file: /templates/headers.typ
#let box_header(title: [], color: luma(230)) = {
box(
fill: color,
radius: 2pt,
inset: 6pt
)[
#text(
size: 16pt,
[=== #title]
)
]
}
```
\
=== _Using custom function:_
```typ
#import "/templates/headers.typ": box_header // import from template file
#box_header(
title: [Custom Functions with Typst!], // sets the title
color: blue.lighten(75%) // sets the color
)
```
\
=== _This would create:_
#box_header(
title: [Custom Functions with Typst!],
color: blue.lighten(75%)
)
]
)
#create_headerless_page(
design: [Deb],
witness: [Gabe],
content: [
#entry_header(
title: [Understanding Colors]
)
#entry_text()
This notebook uses color coordination to represent who sections were written by or who they highlight, as this allows us to visualize how the work is being shared. Below is a reference table with each color and its respective meaning. Any subsequent sub headers are content written by the same person, but may focus on something else.
#table(
columns: (1fr,1fr),
rows: (5),
[#box_header(title:[Blue],color:blue.lighten(60%))],[#entry_header(title:[Gabriel])],
[#box_header(title:[Yellow],color:yellow.lighten(60%))],[#entry_header(title:[Jin])],
[#box_header(title:[Purple],color:purple.lighten(60%))],[#entry_header(title:[Deb])],
[#box_header(title:[Red],color:red.lighten(60%))],[#entry_header(title:[Imaad])],
[#box_header(title:[Green],color:green.lighten(60%))],[#entry_header(title:[Juan])],
)
]
) |
https://github.com/polarkac/MTG-Stories | https://raw.githubusercontent.com/polarkac/MTG-Stories/master/stories/014%20-%20Khans%20of%20Tarkir/012_Journey%20to%20the%20Nexus.typ | typst | #import "@local/mtgstory:0.2.0": conf
#show: doc => conf(
"Journey to the Nexus",
set_name: "Khans of Tarkir",
story_date: datetime(day: 10, month: 12, year: 2014),
author: "<NAME>",
doc
)
#emph[When last we saw him, Sarkhan Vol ] had just returned #emph[to his home world of Tarkir.]
#emph[He fears his enemies, from the ancient dragon <NAME> to the Mardu khan Zurgo, who ] despises him#emph[. He still follows the voice of Ugin, the spirit dragon—long-dead dragon Planeswalker; enemy of <NAME>; and, perhaps, the key to Sarkhan's salvation.]
#emph[He does not know where he is going, or what he will find when he gets there. He knows only one thing: This world is broken, as he is broken, and there may yet be hope to set things right.]
#v(0.35em)
#line(length: 100%, stroke: rgb(90%, 90%, 90%))
#v(0.35em)
The wind screams across the barren dunes. Flecks of bone tear from the ancient, gigantic skeletons and whirl in the storm along with the ever-present sand. The horizon is indistinct, lost in the scouring grit.
#figure(image("012_Journey to the Nexus/01.jpg", width: 100%), caption: [Scoured Barrens | Art by Eytan Zana], supplement: none, numbering: none)
A distant speck is moving.
Perhaps it is a mirage. It wavers in and out of vision, its shape indistinct.
But it is slowly growing larger. The rippling form is resolving. A winged thing? A man, perhaps. Walking. His shape fluctuates, flowing outward in the wind.
He comes closer. A heavy cloak is billowing behind him like wings as he trudges over the ragged land. He clutches a staff.
Closer still. The walking figure gestures wildly with his free hand. He shouts to the air. He shakes his staff. An object hanging from its tip clatters against the pole like dry bones.
He is here now. Wild, unkempt hair, a ragged beard, eyes that shine with madness. He is talking. No one else is here.
"Stay out of my mind, ghost!" he cries. He grabs his head as though in pain. "What would you have me do?"
#figure(image("012_Journey to the Nexus/02.jpg", width: 100%), caption: [Sarkhan, the Dragonspeaker | Art by Daarken], supplement: none, numbering: none)
He stops, turns, and surveys the wild landscape. He falls silent. Then he nods to himself, slowly. He looks to the sky. He squares his shoulders. He turns toward a distant peak and begins to walk again, his steps surer now.
Soon, only shallow footprints remain, fading as the howling sand spills into them.
#v(0.35em)
#line(length: 100%, stroke: rgb(90%, 90%, 90%))
#v(0.35em)
Narset was meditating, as she always did at sunrise. She focused on her breathing, then went deeper, finding the still point beyond the rhythms of life. The silence was absolute, soul-deep.
She drifted in quiet contemplation, considering the ancient mysteries. The baffling runes of the Spirit Dragon floated before her eyes as she called up her studies. The characters shifted, always just outside comprehension.
A less disciplined student would lash out in frustration, but Narset had trained her patience over many years. Enlightenment required time and long silences to let the hidden meanings speak. She focused harder, listening. She had spent many months that way, coming so close to their essence but never quite reaching it.
That day was different. In her calm center she caught a flicker, the faintest scent of a word.#emph[ Heal] . She felt a psychic urge, like a push between her shoulder blades. Then she was out of the trance and gazing at the dawn's tinge on the mountaintop.
#figure(image("012_Journey to the Nexus/03.jpg", width: 100%), caption: [Alabaster Kirin | Art by Igor Kieryluk], supplement: none, numbering: none)
From the clouds at the peak burst an awe-inspiring shape: a kirin, the messenger of fate. Its eyes and horns blazed with ethereal flame. It ran through the air on fire-pointed hooves. The magical creature paused and tipped its head toward her, catching her gaze with its own. Narset nodded in acknowledgement. Then the kirin turned, bucking and prancing, and headed away to the north and east.
Narset stood, understanding. Tarkir had spoken, through the hidden words of Ugin and the appearance of the harbinger. The destiny of the world lay there, somewhere in the kirin's fiery tracks.
She would need to appoint someone to oversee the clan's business in her absence. But such wandering in search of wisdom was part of every Jeskai's calling. She smiled and took up her staff.
#v(0.35em)
#line(length: 100%, stroke: rgb(90%, 90%, 90%))
#v(0.35em)
Sarkhan was close to the mountain. He could see monumental structures at its peak, banners snapping in the chill wind. A cataract spilled over a waterwheel mounted near the peak, and rope bridges spider-webbed the deep chasms that surrounded it.
"Why have you driven me here?" he shouted to the sky. His voice came back to him: #emph[here] , #emph[hear] , #emph[heal] .
"Another trick? Another lie? Will my bones join those of the dragons, unfulfilled and broken?" Sarkhan tore at his hair and gritted his teeth. He smashed the butt of his staff into the slope. He sank to his knees, mumbling.
A voice came from above. "Weary traveler, do you seek peace?"
Sarkhan flung his head back and forth, as though shaking off water. Then he looked up, slowly. There stood a slender woman, clothed in saffron robes, poised atop a head-high boulder. A glowing sigil like an eye shone from her brow.
#figure(image("012_Journey to the Nexus/04.jpg", width: 100%), caption: [Narset, Enlightened Master | Art by Magali Villeneuve], supplement: none, numbering: none)
"Is this real?" Sarkhan growled. "Or do you mock my eyes as well as my ears?"
The woman stepped off the boulder and landed lightly on her toes. She slowly approached, reaching out a hand. "I am here." Sarkhan shrank back, but then went completely still as her fingers brushed his forehead. She brought her palm firmly into contact with his burning flesh. It was cool and dry.
She held her hand there and looked into Sarkhan's eyes. "I see…another…with you. Around you. Like an echo of a shadow." She stepped back, breaking the contact.
Sarkhan rose, leaning on his staff. "Do you hear it too? A voice within. A thought that is not your own." Wonder smoothed his brow, and his eyes focused on the serene face before him. "They all say I am mad. No one else hears it. The endless whispering. Never a moment's peace! How do you know this voice?"
"I have only sensed it in your aura, an echo on the breeze. An idea. An image. Your coming has been foretold, traveler.
"I am Narset. I dwell here, among other seekers of enlightenment. I guide my clan toward a higher destiny."
Sarkhan nodded. "The Jeskai. I have heard of those mountaintop sages, though I never met one in battle. Our khan thought them weak, seeking endlessly for some imagined truth."
"The truly strong do not reveal their power until it is needed." Narset wheeled and struck the boulder with three fingers, a short, stabbing motion. The stone split neatly, falling into halves like a hatched egg. "Our mountain strongholds yet stand, though many have tried to take them."
She turned back. "Tell me your name, traveler. Let me hear your tale."
#v(0.35em)
#line(length: 100%, stroke: rgb(90%, 90%, 90%))
#v(0.35em)
Sarkhan had spoken little to another since the Eye of Ugin. And that had been painfully brief. He strung together words in short clusters, halting, breaking into half-forgotten songs and children's doggerel. Sometimes he simply stopped and stared into space for minutes at a time.
But slowly, agonizingly, he put together an account of his travels since leaving behind the meditation realm of <NAME>. Of the voice that constantly spoke to him, driving him ever onward until he fled back to Tarkir. The path to heal his world. Once his home. Now his quest.
Narset listened. Sometimes she asked a question, never interrupting, but waiting for one of Sarkhan's anguished pauses. When he spoke of wandering the planes, her eyes grew wide for a few moments, but then she nodded to herself as though she had discovered something precious. She asked to inspect the jagged piece of stone that hung from his staff. She studied the strange markings that covered all its unbroken surfaces.
"I have seen something like these symbols before," she murmured. "They are ancient. Only the most hidden lore mentions them. Secrets that only dragonfire can reveal. How came this relic into your hands?"
#figure(image("012_Journey to the Nexus/05.jpg", width: 100%), caption: [Eye of Ugin | Art by <NAME>], supplement: none, numbering: none)
"It is from the Eye. The sheer fire shattered it. Overcame me. But I saved this. All that I could."
"What is the Eye?"
"The Eye of Ugin. He speaks to me. Still."
Her eyes flashed wide again. "You know of Ugin? You were in his sanctum?"
"It was a trap. Then a trick. Now no more. But the Spirit Dragon is dead. Bolas said so. Or does he lie?"
"It is no lie. Ugin is dead. And with him, all his brood, the dragons. Did you not know this?"
"But he speaks! He taunts me, constantly. He tells me to seek him out. He sent me here. He says just one thing: 'Heal.'"
"The voice of the Spirit dragon led you to me. I might be able to find surcease for what troubles you. But perhaps it meant more than that. This world is in pain, Vol. You feel it, don't you?"
Narset spoke quietly, her eyes distant. "For centuries the clans have fought. When the dragons lived, we struggled for survival against them. But when the last dragon fell, we turned on each other. What balance was struck in our mutual fight was lost long ago.
"Now even our quiet strongholds know the shout of war. The Abzan leave their sturdy fortresses to seek enemies on the steppe. The Sultai send forth armies of the dishonored dead. Even the hardy Temur descend from their mountains. And over every land, the Mardu ride, and raid, and ruin.
"We have lost our way. I fear that soon the clans too will be only bones in the wilderness, gnawed by wild beasts. All that we have built will crumble away until even the past is gone."
Sarkhan's shoulders fell. "Then I have failed again. This world is already dead. The past is lost. Ugin is only a dream."
Narset shook her head. "Ugin is far more than that. He is this world's soul. When he was lost, Tarkir was lessened. But perhaps something yet lingers. Something that you can awaken. That stone you bear might be the key."
"The key…" Sarkhan stared into the distance. "Yes, that is what I called it. I thought it would unlock the secrets of the Spirit Dragon." Then his eyes focused again and he stared hard at the jagged piece of stone. He looked up at Narset. "Secrets only dragonfire can reveal. How could I have forgotten?"
He clenched a fist around the fragment and uttered a bestial sound, deep in his throat. His eyes flared and smoked. And his hand became a dragon's jaws. Fire rolled from within. The markings glowed, swirled, seemed to form words.
Narset leaned forward, despite the heat. Her face was eager, excited, shining like a blade from the forge. "It is a phrase, in the language of the mighty. The ancient scrolls use it. 'Look to the past and open the door to Ugin.'"
Sarkhan shook his head. "But Bolas said he put Ugin where he lies."
Narset looked back at him. "Do you not know where Ugin lies?"
"My clan never stayed in once place for long. We had no interest in scrolls or maps or ancient tales. The Mardu move on. That is all."
"And yet you have seen so little of this world."
"The voice spoke of a door. I was seeking it, though I have no guide to show me."
"You have one now," said Narset. She laid a gentle hand on Sarkhan's shoulder. "The place where Ugin fell is not known to many. But it is recorded in the #emph[Annals of the Sage Eye] . As keeper of the Annals, I have read the lore within. I can take you to the tomb of the Spirit Dragon."
#v(0.35em)
#line(length: 100%, stroke: rgb(90%, 90%, 90%))
#v(0.35em)
The night sky shimmered and hissed, a counterpoint to the voice murmuring in Sarkhan's mind. The weird light cast multicolored shadows across the snow, as he and Narset slowly climbed into the Qal Sisma range, following a path made of memory as much as land.
Sarkhan looked across the campfire embers at Narset. She bent her head over a small pot of tea. As the fragrance rose about them he sensed a closeness, something he had not known with another human being for as long as he could remember. She looked up and smiled openly. "It is a luxury, but I always carry a small handful of leaves. Will you join me?"
Accepting the steaming pot, Sarkhan inhaled deeply. He sipped and looked up to the sky as he savored the brew. "I have been in these mountains before," he said. "I listened with those who spoke to the long ago."
Narset nodded. "The shamans of the Temur have a special connection to the world's soul. They hear the spirits of the dead and echoes from times both past and yet to come, what they call the unwritten now. Perhaps their closeness to the Nexus grants such gifts."
"The Nexus?"
"It is a point, deep within the ravine where Ugin's bones rest. There, reality is always shifting and twisting, as though seeking a final form but never finding it. Seekers have approached the place, but none were able to enter. The few who pressed on were simply torn apart. Those wanderers who survived told me what they saw, but I know nothing more than this."
"Is that where we are going?"
Narset nodded. "You carry a talisman," she said, "bearing the words of the Spirit Dragon. Perhaps only one such as you, who can pass between worlds, can withstand the violence of the Nexus."
She finished the last swallow of her tea.
They walked in silence after that. There was nothing more that needed to be said.
It was Ugin's voice that disturbed the quiet.
"He's speaking to me," muttered Sarkhan. "His voice seems stronger now."
Narset pointed. Between the ragged peaks rose a contorted stone spire, bathed in a weird glow that outshone the cold light overhead. "That twisted rock marks the entrance to the canyon, the gateway to Ugin's grave."
#figure(image("012_Journey to the Nexus/06.jpg", width: 100%), caption: [Tomb of the Spirit Dragon | Art by <NAME>], supplement: none, numbering: none)
The eerie luminescence caught Narset's face and seemed to transform her into cool, blue-green jade. Sarkhan's burning eyes shone with a chill light. Below them stretched a miles-long fissure, plunging deep through the ice into the ancient stone.
Dragon bones lay there, as they did all across Tarkir, but they were different. They glowed an uncanny blue, from the tip of the immensely long tail all the way to the arched passage of ribs a hundred feet away. A curve in the canyon wall hid the rest from view.
All at once, Sarkhan's mind fell silent. He stopped in his tracks.
Narset moved to his side. "Be at peace, traveler. You have found your path. See, the Spirit Dragon shows you the way."
A new light cast Sarkhan's shadow before him, down the long slope that led to the dragon's tail. He looked up at the shard that hung from his staff. It pulsed, a warm orange glow from the markings that scrawled its surface.
Then, with a bestial cry, a thuggish orc leapt from the crag behind them. "I have you, traitor!" roared Zurgo, as he chopped with his butcher's blade.
Narset spun, faster than Sarkhan's eye could follow. She raised her staff, and the murderous blow slammed to a stop as though it had struck stone. Zurgo howled and threw a mighty punch that could have felled a loxodon. Narset held up a palm as though to hush a willful child. The orc's fist smashed against it, and he howled again as knuckles shattered.
#figure(image("012_Journey to the Nexus/07.jpg", width: 100%), caption: [Deflecting Palm | Art by <NAME>], supplement: none, numbering: none)
"Go now." Narset's voice was urgent, breathless. "I feel the power of the Nexus even from here. It seems stronger than ever before. I will guard your passage."
"I can't let you fight my battles."
Narset's eyes flashed. "You must. The moment is right. Whatever fate Ugin has in store for you, this is the time to meet it."
Anguish and shame raced across Sarkhan's brow. But he turned and began to run along the pathway. The snow-covered stones were slick, and he had to watch every step to avoid a fall. He was abreast of the glowing tail tip. He could see around the curving stone, into the vaulted ribs that formed a glowing gateway. Waves of pressure pulsed across him, and the landscape shuddered with the same rhythm. He felt the forces of destiny pulling him in, dragging him inexorably forward.
He looked back at the crest where Narset and Zurgo struggled. She seemed to catch his eye, even smile, as her graceful staff swung in a killing arc. Zurgo was outmatched. Sarkhan could see it.
But then the powerful orc moved with unexpected agility, dodging the staff's swing. He lashed out with his sword. A gush of blood.
Narset stood still. She seemed almost to be meditating again. But then she began to sink, a cut flower. She turned her head toward Sarkhan. He heard her shout. "Go!"
Sarkhan's world went crimson. Fury and grief and vengeance fought for a voice, leaving him silent. He stumbled, began to stagger back upslope, where Zurgo waited, glorying in the blood of his companion.
"Zurgo! Monster! I will have my vengeance!" Sarkhan screamed.
But the Eye fragment flared bright. All around him the world wailed. The land twisted. He had to turn away, howling his despair as his hands erupted with flame. The dragonfire roared into the vortex ahead of him, and a gate appeared.
It was the door he had been waiting for all this time.
#emph[Yes.]
Sarkhan turned and looked from Zurgo to the crumpled body of Narset, and then back to the gate.
#emph[Yes.]
With a bellow, equal parts rage and release, Sarkhan charged into the flaring arch.
|
|
https://github.com/ckunte/structural-dynamics | https://raw.githubusercontent.com/ckunte/structural-dynamics/master/structural-dynamics.typ | typst | // preamble
#import "@preview/polylux:0.3.1": *
#import themes.simple: *
#set page(paper: "presentation-16-9")
#show: simple-theme.with(
footer: [STRUCTURAL DYNAMICS],
)
#set text(
font: "erewhon",
top-edge: "cap-height",
bottom-edge: "baseline",
number-type: "old-style",
size:21pt
) // main font used
#show link: set text(fill: rgb(0, 0, 255)) // show links w/ colour
#let sc(content) = text(features: ("c2sc",))[#content]
#show regex("[A-Z]{2,}"): match => {
sc(match)
}
// captions in emph
#show figure.caption: emph
// Configure paragraph properties.
#set par(leading: 0.65em, first-line-indent: 12pt, justify: true)
#show par: set block(spacing: 0.65em)
//
#title-slide[
= STRUCTURAL DYNAMICS
_Historical beginnings + Introduction_
\
<NAME>, March 2015
]
#slide[
#side-by-side[
#image("/inc/aristotle.jpg")
][
= Agenda
- On motion
- Orbital complexity
- Renaissance
- Inertia
- Kepler's laws
- <NAME>, and his three laws
- Mechanics
- Statics, dynamics, and linearity
- Simple dynamic model and SDOF
- Acceleration, velocity, spring force
- Dynamic amplification factor
- Application: When to use what
- Additional reading / viewing
]
]
#focus-slide[
= On motion
]
#slide[
== The difficulty in understanding
#quote(block:true, attribution: [ARISTOTLE STAGIRITIS, 384--322 BCE])[_What about the fact that when things are thrown they continue to move when the thrower is no longer touching them? It would be impossible to explain why something which has been set in motion should stop anywhere why should it stop here rather than there?_]
Aristotle struggled with the idea of how motion actually works, evident from above. The conceptual difficulty of defining motion remained up to and beyond Newton's time (17c.).
]
#slide[
== Circular motion
Aristotle defined circular motion, and shape of the heaven (celestial bodies) accurately:
#quote(block:false, attribution: [Aristotle Stagiritis])[_Circular movement is the primary kind of movement. Only circular motion can be continuous and eternal. The shape of the heaven is of necessity spherical; for that is the shape most appropriate to its substance and also by nature primary._]
]
#slide[
= Alexandria
Two schools of thought:
- Geocentric -- Ptolemy, the author of Almagest -- 200 AD
- Heliocentric -- Aristarchus of Samoa -- 300 AD
The Church later supported the geocentric model, as it was popular, emphasised Earth's privilege.
]
#centered-slide[
#figure(
image("/inc/lib-alexandria.png"),
caption: [Library of Alexandria, 300 BC]
) <la>
]
#focus-slide[
= Orbital complexity
]
#slide[
#side-by-side[
- Ptolemy followed the rule that heavenly motions are perfect and so must be circular.
- He realised that simple model of the Sun and the planets moving on circular paths centred on the Earth could never offer accurate results.
- The solution was a combination of circles.
][
#figure(
image("/inc/orbits.png", height: 80%),
caption: [Geocentric model as imagined by Ptolemy]
) <orb>
]
]
#focus-slide[
= Renaissance
_fast forward by 1,800 years_
]
#slide[
- Before 14 c., motion was not understood
- 14 c. brought renaissance -- art led to geometry, mathematics, and eventually to physics
- Renaissance renewed the curiosity about everything, including "heavenly" bodies
- Discussing them, however, was a religious matter
- Change it brought began challenging age-old conventions and thoughts
- Among them was studying "heavenly" bodies (i.e. planets)
- Copernicus was the first to realise ours was a heliocentric model
#quote(block:true, attribution: [Copernicus, 1473--1543 AD])[_"We revolve around the Sun like any other planet."_]
]
#centered-slide[
#quote(block: true, attribution: [<NAME>])[_"Of all discoveries and opinions, none may have exerted a greater effect on the human spirit than the doctrine of Copernicus. The world has scarcely become known as round and complete in itself when it was asked to waive the tremendous privilege of being the centre of the universe."_]
]
#focus-slide[
= Inertia
]
#slide[
#side-by-side[
- In 16 c., Galileo invented the telescope
- His discoveries overturned 1,400 years of scientific wisdom
- He was not alone. <NAME> made similar breakthroughs. Kepler exchanged notes with Galileo
- Based on his observations, Galileo first defined Inertia, as know today
][
#figure(
image("/inc/galileo-telescope.png", width: 85%),
caption: [Galileo's telescope]
) <gt>
]
]
#focus-slide[
#quote(block: true, attribution: [Galileo Galilei])[_"If an object is left alone, is not disturbed, it continues to move with a constant velocity in a straight line if it was originally moving, or it continues to stand still if it was just standing still."_]
]
#slide[
#side-by-side[
= Kepler's laws
- The orbit of each planet is in shape of an ellipse with the Sun at one focus
- In any equal time intervals, a line from the planet to the Sun will sweep out equal areas
- The total orbit times for planet 1 and planet 2 have a ratio: $ a_1^(3/2) : a_2^(3/2) $
][
#figure(
image("/inc/kepler-pmot.png", width:80%),
caption: [Planetary motions (Kepler)]
) <kp>
]
]
#centered-slide[
#quote(block: true, attribution: [<NAME>])[_"My goal is to show that the heavenly machine is not a kind of divine living being but similar to a clock work insofar as almost all the manifold motions are taken care by one single absolutely simple magnetic bodily force, as in a clockwork all motion is taken care by a simple weight. And indeed I also show how this physical representation can be presented by calculation and geometrically."_]
]
#slide[
#figure(
image("/inc/newton.png", width: 90%),
caption: [<NAME>, 1642--1727 AD]
) <in>
]
#focus-slide[
#quote(block: true, attribution: [<NAME>])[_"The whole evolution of our ideas about the processes of nature might be regarded as an organic development of Newton's ideas."_]
]
#centered-slide[
#quote(block: true, attribution: [Einstein writing about his _Theory of Relativity_])[_"No one must think that Newton's creation can be overthrown in any real sense by this or any other theory. His clear and wide ideas will forever retain their significance as the foundation on which our modern conceptions of physics have been built."_]
]
#slide[
#side-by-side[
= Life of Newton
- Joined the Cambridge Univ., as a student, then as a fellow, and as a professor spending 35 years there
- He graduated with a bachelor of arts degree in 1665
- Not an inspiring lecturer, he lectured to an empty room
- Began working on optics, and invented reflecting telescope
][
#figure(
image("/inc/newton-telescope.png", width: 75%),
caption: [Reflecting telescope]
) <rt>
]
]
#slide[
= The Principia Mathematica
$ F prop 1 / d^2 $
- Newton's mathematical capability was unmatched; he put to great use
- In response to Edmund Halley's challenge (1686), Newton produced a nine-page paper proving that the force (F) moving a planet was inversely proportional to the square of planet's distance (d) from the Sun
- Amazed by the paper, Halley encouraged Newton to write in depth, resulting in this tour de force, "Philosophiae Naturalis Principia Mathematica"
]
#slide[
= Newton's three laws
- Newton followed Galileo closely -- read all his notes, commentaries, and books
- Newton adopted Galileo's definition inertia for heavenly bodies to earthly bodies as his first law
- The next thing needed a rul to find how an object changes its speed if something is affecting it; equating momentum to force became the second law
- Lastly, conservation of momentum, i.e., F = -F became the third law
]
#slide[
= The second law: momentum and force
#side-by-side[
- Newton's second law provided a method of determining how velocity changes under different influences called forces
- This is the foundation equation in structural dynamics
][
$ F = d / (d t) (m v) $
$ F = m (d v) / (d t) = m a $
Note the slight difference between two equations. The second assumes constant mass -- for simplicity
]
]
#slide[
= Mechanics
- Quantum (new): subatomic behaviour -- no further discussion here
- Classical
- Newtonian mechanics -- kinematics (the original theory of motion), and dynamics (forces)
- Statics -- semi-rigid bodies in mechanical equilibrium
- Solid mechanics, elasticity -- properties of deformable bodies
- Fluid -- motion of fluids
- Continuum -- mechanics of continuation (both solids and fluids)
- Hydraulics -- mechanical properties of fluids
- Soil -- mechanical behaviour of soils
]
#slide[
= Statics, dynamics and linearity
- Statics - time invariant
- Dynamics - time variant
- Dynamic systems can be linear if:
- Amplitudes of displacement and load are proportional
- Stress is proportional to strain (damping acceptable)
- Mass needs to be constant
]
#slide[
#figure(
image("/inc/simple-dyn-model.png", width: 100%),
)
]
#slide[
#figure(
image("/inc/k.png", height: 100%),
)
]
#slide[
= Effective stiffness
#side-by-side[
Stiffness in parallel get added: two legs of a portal frame.
Stiffness in series are calculated for effectiveness. Examples: haunched beams, soil layers.
][
#figure(
image("/inc/effective-k.png", height: 80%),
)
]
]
#focus-slide[
$ F = k times d $
_static_
$ F = m times a $
_dynamic_
$ k times d = m times a $
]
#centered-slide[
= Oscillation of a SDOF: No forcing and no damping
#side-by-side[
#figure(
image("/inc/disp.png", width: 100%),
caption: [Displacement]
) <x>
][
At any time, $t$, the corresponding displacement is $x$, then the restoring force will be $f_k = K x$
When in motion,
$
M accent(x, diaer) = -f_k = -K x \
M accent(x, diaer) + K x = 0
$
Solving this above quadratic equation for $x = x_o "at" t = t_o$
$ x = x_o cos( sqrt(K/M) (t - t_o) ) "for" t > t_o $
]
]
#centered-slide[
#side-by-side[
= The solution, $x$
\
Response is harmonic
\
Deflection amplitude is $x_o$
\
Oscillation (natural) frequency is
\
$ omega_n = sqrt(K/M) $
][
*Acceleration* $accent(x, diaer) = -omega_n^2 x_o cos(omega_n (t - t_o))$
\
*Velocity* $accent(x, dot) = -omega_n x_o sin(omega_n (t - t_o))$
\
*Spring force* $K x = K x_o cos(omega_n (t - t_o))$
\
_Undamped:_ free to vibrate (no resistance)
]
]
#centered-slide[
#side-by-side[
#figure(
image("/inc/sdof-oscillation.png", width: 100%),
caption: [Steady state oscillation of a SDOF with forcing and viscous damping]
) <sd>
][
#figure(
image("/inc/t-h-resp.png", width: 54%),
caption: [Time history response]
) <thr>
]
Damping as a force (resistance to unrestricted motion), $f_d$ may be writtn as $f_d = C accent(x, dot)$
]
#centered-slide[
Applied cyclic load in the presence of damping, \
where $f$ is a sinusoidally varying function of $t$ at frequency $omega$
$ f(omega t) = f_o cos(omega t) $
The equation of motion thus becomes
$ M accent(x, diaer) + C accent(x, dot) + K x = f_o cos(omega t) $
]
#centered-slide[
Amplitude of the motion (from steady state, and algebraic substitutions):
$ x_o = f_o / sqrt( (K - M omega^2)^2 + C^2 omega^2 ) $
Phase lag angle between applied force and resulting motion:
$ phi = tan^(-1)((C omega) / (K - M omega^2)) $
]
#centered-slide[
= Dynamic amplification factor, Q
$ Q = "amplitude of displacement" / "equivalent static displacement" = x_o / ( (f_o / K) ) $
$ Q = 1 / sqrt( (1 - Omega^2)^2 + (2 xi Omega)^2 ) $
Frequency ratio: $Omega = omega / omega_n = "Forcing frquency" / "natural frequency"$
\
Damping ratio: $xi = C / (2 M omega_n) = C / (2 sqrt(M K) )$, where $2 sqrt(M K)$ is _critical_ damping
\
At resonance ($Omega = 1$): $Q = 1 / (2 xi)$
]
#centered-slide[
#figure(
image("/inc/daf.png", height: 100%),
caption: [Dynamic amplification]
) <daf>
]
#centered-slide[
#figure(
image("/inc/application.png", height: 100%),
caption: [Application: When to use what]
) <appl>
]
#slide[
= Additional reading / viewing
- <NAME>, _The rise and fall of Alexandria_
- <NAME>, _Agora_
- <NAME>, _Magnificent Principia_
- Caltech, _Feynman's lectures on Physics_
- Barltrop and Adams, _Dynamics of fixed marine structures_
]
#centered-slide[
= Thank you. Questions?
] |
|
https://github.com/kdog3682/2024-typst | https://raw.githubusercontent.com/kdog3682/2024-typst/main/examples/numberline.typ | typst | // implementing decimals would take some time.
// not impossible ... just simply taking some time.
#import "@preview/cetz:0.2.0"
#cetz.canvas({
import cetz.draw: *
// awesome! thank you.
// :)
let min = -3
let max = 4
let (a, b) = ((0,0), (7,0))
line((rel: (-1,0), to: a),
(rel: (1,0), to: b),
mark: (fill: black, end: "stealth", start: "stealth"), name: "line")
// Place labels
let labels = (
(-2.0, $O$),
(0.5, $O$),
(1.5, $S$),
(2.1, $E$),
)
let len = cetz.vector.dist(a, b)
for (position, label) in labels {
let pos = cetz.vector.lerp(a, b, (position - min) / (max - min))
content(pos, label, anchor: "south", padding: (bottom: .50))
group({
set-origin(pos)
scale(.1)
circle((0, 0), fill: black)
line((0, 0), (0, 4))
rect((-2,4), (2, 8))
})
}
// Place ticks
for maj in range(min, max + 1) {
move-to(cetz.vector.lerp(a, b, (maj - min) / (max - min)))
line((rel: (0, 0.1)), (rel: (0, -.2)))
content((rel: (0, -.1)), $maj$, anchor: "north")
}
})
|
|
https://github.com/Nyovelt/Resume2024 | https://raw.githubusercontent.com/Nyovelt/Resume2024/main/chicv.typ | typst | MIT License | #import "fontawesome.typ": *
#let chiline() = {
v(-3pt);
line(length: 100%, stroke: gray);
v(-10pt)
}
#let iconlink(
uri, text: "", icon: link-icon) = {
if text != "" {
link(uri)[#fa[#icon] #text]
} else {
link(uri)[#fa[#icon]]
}
}
#let cventry(
tl: lorem(2),
tr: "2333/23 - 2333/23",
bl: "",
br: "",
content
) = {
pad(left: 10pt, right: 5pt, block(
inset: (left: 0pt),
if type(tl) == str { strong(tl) } else { tl } + h(1fr) + tr +
linebreak() +
if bl != "" or br != "" {
bl + h(1fr) + br + linebreak()
} +
content
))
}
#let chicv(body) = {
set par(justify: true)
show heading.where(
level: 1
): set text(
size: 22pt,
font: (
"Avenir Next LT Pro", // original chi-cv font
"Manrope", // a font available in the typst environment and looks similar to Avenir
),
weight: "light",
)
show heading.where(
level: 2
): it => text(
size: 12pt,
font: (
"Avenir Next LT Pro",
"Manrope",
),
weight: "light",
block(
chiline() + it,
)
)
set list(indent: 0pt)
show link: it => underline(offset: 2pt, it)
set page(
margin: (x: 0.9cm, y: 1.3cm),
)
set par(justify: true)
body
}
#let today() = {
let month = (
"January", "February", "March", "April", "May", "June", "July",
"August", "September", "October", "November", "December",
).at(datetime.today().month() - 1);
let day = datetime.today().day();
let year = datetime.today().year();
[#month #day, #year]
}
|
https://github.com/crd2333/crd2333.github.io | https://raw.githubusercontent.com/crd2333/crd2333.github.io/main/src/docs/AI/SLAM.typ | typst | #import "/src/components/TypstTemplate/lib.typ": *
#show: project.with(
title: "SLAM",
lang: "zh",
)
#let bx = $bold(x)$
#let bH = $bold(H)$
#let bg = $bold(g)$
#let bJ = $bold(J)$
#let bE = $bold(E)$
#let bF = $bold(F)$
#let bB = $bold(B)$
#let bC = $bold(C)$
= SLAM 中的 CV
== SfM
- 参考 #link("https://blog.csdn.net/shyjhyp11/article/details/104108926")
=== 增量式的 SfM(Incremental Structure-from-Motion)
- 步骤
- 先从一对图像开始，计算*对极几何约束*(epipolar geometry)，*本质矩阵*(Essential Matrix)；
- 然后，可以从 Essential Matrix 中 decompose 两个相机的 pose（旋转矩阵 R 及位移 t），然后就可以使用 triangulation，三角化算出一些三维点（误差累计的来源）；
- 所以可以通过两张图，计算出包含两个相机和一些三维点的初始三维重建，接着再使用 Resection 方法，加第三个相机（第三张图片），即使用三维点（已计算点）和两维点（新加点）的 对应关系（correspondence），计算出第三个相机的姿态。逐步增加相机，逐步找到三维点，及对应的图像点。
- 问题：误差会不断累计。
- 比如加第三张图像时，用的是 3D-2D 对应点的对应关系，来做 Resection 或者做 PnP。我们之前讲到，在做 Resection 时，假设 3D 点坐标是绝对精确的、没有误差的，误差全部来自于 2D 点坐标（特征点检测出来的像素坐标值），但增量式 SfM 在添加相机时，使用的三维点坐标，是前面计算出来的。所以三维点的误差，会导致我们新加进来的第三张图的相机的pose（R 和 t）的误差，进一步会导致我第四张图有些误差。
- 这样，使用第三张和第四张图对应相机三角化出来的三维点，也会有误差，逐步被放大
- 怎么办呢？目前没有什么办法，非线性优化呗，即 minimize 重投影误差(reprojection error)，所以，通常在做了几次添加相机（图像）后，就需要做一把 Bundle Adjustment。这时候就相对安全了，这时候就可以继续添加相机了。这时就会有一个判断准则，比如添加了20张图像（或者判断 triangulate 出来的相机姿态需要优化了），就需要做 Bundle Adjustment 了。
- 就这样一直添加图像，直到所有的图像全部添加完以后，还要再最后做一次整体的 Bundle Adjustment。因为 BA 是在优化所有的相机，所有的三维点。整套这样的流程就叫做 Incremental Structure-from-Motion。
=== 全局式的SfM(Global Structure-from-Motion)
- 步骤
- 先给定一对图像对(pair)，同样要计算Essential Matrix，然后同样的decompose出来相机的相对运动（Relative Motion，包含：相对旋转矩阵 R 和相对平移矩阵 t）；使用同样的方法，算出所有的图像对的 E 和 Motion，比如有 n 张图，就有 $C_n^2$ 个图像对。
- 然后根据这些所有的图像对，算出的 Relative Motion，解一个优化问题（称之为：Register all cameras），把所有相机的朝向(Rotation)和中心点坐标(center)一次性的求出来。
- 最后当然离不开 Bundle Adjustment，因为这才是最后要解的 reprojection error 的 minimize。前面初始化的效果越好，后面Bundle Adjustment 的效果就越好。一般情况下，使用 Global Structure-from-Motion，最后收敛的也就越快。
- 通过 Essential Matrices 和 Decomposition，算出来相对的旋转 R 、相对的平移 t，怎样把他们放到世界坐标系中，如何把他们 register 到一起，这个就是这一步要解决的问题。这步一般可以分成两步 Rotation Averaging 和 Translation Averaging
- Rotation Averaging（求解所有相机朝向）
- Translation Averaging（求解所有相机中心点）
== IMU 融合视觉里程计
- 参考 #link("https://blog.csdn.net/weixin_43569276/article/details/104783347")[SLAM基础 —— 视觉与IMU融合（VIO基础理论）]
- #link("https://blog.csdn.net/qq_35453190/article/details/114452939")[基于优化的IMU与视觉信息融合]
= SLAM 视觉 14 讲
== Chapter 1: 初识 SLAM
== Chapter 2: 三维空间刚体运动
== Chapter 3: 李群与李代数
== Chapter 4: 相机与图像
== Chapter 5: 非线性优化
== Chapter 6: 视觉里程计
- 详细可参考 #link("https://blog.csdn.net/lixujie666/article/details/82262513")[视觉SLAM中的对极约束、三角测量、PnP、ICP问题]
- 对极几何(2D-2D)
- 输入：相机内参和配对点
- 输出：通过计算基础矩阵 F 和本质矩阵 E，恢复并输出相机的位姿(R, t)
- 局限性：尺度不确定性、不适用纯旋转问题
- 有了相机的位姿，接下来就是恢复3D点，即通过两帧图像中对应的匹配点的像素坐标$x_1,x_1'$和相机的位姿$R,t$，计算得到其对应的在三维世界中的坐标$X$；
- 三角测量(2D-2D)
- 输入：相机参数，包括内参（例如焦距、光心位置等）和外参（旋转和平移）；特征点匹配，在两个或者多个视图中，匹配的二维图像点
- 输出：三维点的坐标，在相机坐标系下或某个预定的世界坐标系下的三维点的位置
- 这里要和 PnP 做一下区分，PnP 也是两帧图像，但是其中一帧的 3D 点$X_1, X_2, X_3$已知，则通过这些 3D 点以及对应的另一帧的 2D 坐标($x_1,x_2,x_3$)，来估计两帧的运动$R, t$
- 当然，也需要和对极几何做一个区分，对极几何是仅仅通过两张图像的匹配点像素坐标$(x_1,x_1'), dots, (x_8,x_8')$，就可以计算出两帧图像的相对运动$R, t$
- 然后讲一个第十三章提到的思路上的东西：对一个三维点，可以用世界坐标或相机坐标下的$(x,y,z)$来描述，三个量存在明显的相关性（反映在协方差矩阵中表现为非对角元素不为零）；但我们也可以用某一帧下$(u,v,d)$来表示，图像内2D坐标$u,v$与深度$d$有近似独立的性质，甚至我们亦能认为 $u, v$ 也是独立的——从而它的协方差矩阵近似为对角阵，更为简洁
#note()[
- 因此在 ORBSLAM 中这三种方法的顺序是：
1. 由两张图像的匹配点，利用*对极几何*计算出 H 或者F矩阵，并从这两个矩阵中恢复出 $R, t$
2. 有了 $R, t$ 就可以利用相机的位姿和两帧对应的像素坐标用*三角测量*计算出其对应的3D点坐标。至此，相机的位姿和对应的地图点就都有了，接下来正常跟踪即可；
3. 跟踪丢失后，就需要回到原来机器人曾经经过的位置找匹配帧，找到的匹配帧是有其3D地图点和位姿的，用这些3D点和当前帧自己的像素坐标， *PnP计算*出当前帧相较于匹配帧的运动 $R, t$
]
- PnP(3D-2D)
- 输入: 1. 三维点坐标：在世界或某一特定坐标系中的一组三维点坐标。 2. 二维点坐标：这些三维点在图像上的投影点坐标。 3. 相机内参：焦距，本征矩阵等。
- 输出: 1. 相机姿态：解决 PnP 问题的主要输出是相机的旋转矩阵和平移向量，这两者共同描述了相机的姿态。
- 线性解法和 Bundle Adjustment 解法
- ICP(3D-3D)
- 输入： 1. 源点云：我们想要移动或旋转的点云。 2. 目标点云：我们希望源点云能和这个点云对齐的点云。
- 输出： 1. 旋转矩阵和平移向量：这两者描述了如何将源点云最优地对齐到目标点云。
- 线性解法和 Bundle Adjustment 解法
- 配对点
- 特征点法
- 光流法
- 光流，看看这篇文章：#link("https://www.cnblogs.com/jiading/articles/13403997.html")[计算机视觉 -- 光流法 (optical flow) 简介]
- 直接法
== Chapter 7: 后端优化
- 以上对极几何、三角测量、PnP、ICP 等，只是作为初始化的手段，在上述所有信息已知后，通常都会通过一种全局优化方法进一步优化重建结果和相机位置，使得重投影误差最小
- Bundle Adjustment
- 输入主要有两部分： 1. 观测值：这些是从图像中获取的特征点匹配，通常表示为一系列的二维点（在图像平面上的坐标）； 2. 初始估计：这是使用其他方法（如直接线性变换，DLT）得到的三维点和相机参数的初始估计（包括相机位姿，即外参，和焦距，径向畸变参数等内参）
- Bundle Adjustment的输出： 1. 优化的三维点坐标：经过优化后的三维场景点的坐标值； 2. 优化的相机参数：包括优化后的相机位置、姿态以及其他内参（如焦距、畸变系数等）。
- 公式推导上，某一个点云在某一帧图像上的实际观测位置和重投影位置之间的误差（一般是均方误差），用两个 $sum$ 求和，就得到了目标函数。
- 将相机位姿$bx_c$和空间点$bx_p$变量都放在一起，形成$bx=[bx_c, bx_p]$，然后雅可比矩阵也形成这样的格式 $bJ = [bF, bE]$。
- 接下来无论是 G-N 或 L-M 法，都需要求解一个增量线性方程 $bH Delta bx = bg$，其中 $H = J^T J$ 或 $J^T J + la bold(I)$，其中 $H$ 矩阵为镐形矩阵，可以通过 Schur 消元进行分布计算，从而简化计算。
$ mat(bB,bE;bE^T,C) mat(Delta bx_c; Delta bx_p)=mat(v;w) -> mat(bB-bE bC^(-1)bE^T,0;bE^T,bC)mat(De bx_c; De bx_p)=mat(v-bE bC^(-1)w; w) $
== Chapter 8: 回环检测
== Chapter 9: 建图
- SLAM 称为同时定位与建图，事实上前面已经涉及很多建图内容，这里单列一章进行更详细的阐述，因为根据人们对建图的需求不同，建图模块也有很大不同。
- 稠密地图与稀疏地图
- 稠密地图的重点在于需要知道每一个像素点（或大部分像素点）的距离，大致有三种方案：单目相机移动并进行三角测量；利用双目或多目相机的视差；使用 RGB-D 相机直接获得像素距离。书里详细阐述了单目稠密重建
- 由于不能把每个像素都当作特征点计算描述子来进行匹配，单目稠密重建中使用*极线搜索*和*块匹配技术*来进行匹配，然后用*深度滤波器技术*（将深度建模为极线上块的概率分布）使深度估计收敛
- 如果用高斯分布建模：frame $i$ 里某块对应三维点重投影到 frame $j$，对这个块进行微小扰动得到的深度估计误差作为不确定度 $sigma$
- 几个问题和改进
+ 环境纹理的限制、像素梯度与极线的角度
+ 逆深度：假设逆深度服从高斯分布，用卡尔曼滤波器进行逆深度估计
+ 考虑图像间的旋转，在块匹配之前做预处理
+ 并行化
- 然后提一嘴 RGB-D 相机
#quote(caption: "网上看到的一段话，不是很理解什么意思")[
#tab BA和图优化，是把位姿和空间点放在一块，进行优化。特征点非常多，机器人轨迹越走越长，特征点增长的也很快。因此位姿图优化的意义在于：在优化几次以后把特征点固定住不再优化，只当做位姿估计的约束，之后主要优化位姿。
也就是说，不要红色的路标点了，只要位姿。位姿里的三角形是位姿，蓝色的线是两个位姿之间的变换。
【关于这点，有一个理解非常重要：三角形的位姿，是通过和世界坐标系的比较而得到的，其实世界坐标系在大部分情况下也就是一开机的时候的相机坐标系，把第一帧检测到的特征点的相机坐标，当成是世界坐标，以此为参照，逐步直接递推下去。而上图蓝色的线，是根据中途的两张图，单独拿它俩出来估计一个相对的位姿变换。
换言之：在前端的匹配中，基本都是世界坐标系的点有了，然后根据图像坐标系下的点，估计世界坐标系与图像坐标系下的变换关系作为位姿，（这里的世界坐标系下的坐标实际是根据第一帧一路递推下来的，可能错误会一路累积）我们假设算出来两个，分别是T1和T2。而蓝色的线，作为两个位姿之间的相对变换，也就是T1和T2之间的变换。但它并不是直接根据T1的逆乘以T2这种数学方式算出来的（不然还优化什么？肯定相等啊）而是通过T1和T2所在的图像进行匹配，比如单独算一个2D-2D之间的位姿变换或者光流法等，这样根据图像算出的位姿很有可能是和T1与T2用数学方式计算得到的位姿是有差异的（因为没有涉及到第一帧图像，就是单纯这两张图像的像素坐标）。这个理论一定要明白，不然纯粹是瞎学】BA和图优化，是把位姿和空间点放在一块，进行优化。特征点非常多，机器人轨迹越走越长，特征点增长的也很快。因此位姿图优化的意义在于：在优化几次以后把特征点固定住不再优化，只当做位姿估计的约束，之后主要优化位姿。
]
== Chapter 10: 传感器融合
== References
- #link("https://blog.csdn.net/qq_25458977?type=blog")[CSDN 博客]
- #link("https://github.com/Michael-Jetson/SLAM_Notes")[github 上找到的笔记]
|
|
https://github.com/SillyFreak/typst-packages-old | https://raw.githubusercontent.com/SillyFreak/typst-packages-old/main/pre-plantuml/src/lib.typ | typst | MIT License | #import "@preview/prequery:0.1.0": prequery
#let p = plugin("./plantuml_url.wasm")
#let encode(source) = {
let source = bytes(source)
let result = p.encode(source)
let (status, result) = (result.at(0), str(result.slice(1)))
assert(status == 1, message: result)
result
}
/// A prequery for PlantUML diagrams. Apart from the `base-url` and trailing `source` parameter, the
/// image file name is also mandatory; it is part of `args` for technical reasons. Outside fallback
/// mode, rendering this fails when the rendered diagram file is missing; diagrams need to be
/// rendered in a preprocessing step.
///
/// This function provides a dictionary with `url` and `path` as metadata under the label
/// `<web-resource>`. The URL is formed by adding the
/// #link("https://plantuml.com/text-encoding")[encoded form of the diagram] to the base URL. This
/// metadata can be queried like this:
///
/// ```sh
/// typst query --input prequery-fallback=true --field value ... '<web-resource>'
/// ```
///
/// *Fallback:* renders the raw source block.
///
/// - base-url (string): the PlantUML base URL to be used for generated URLs
/// - ..args (arguments): arguments to be forwarded to `image`
/// - source (raw): the PlantUML source code as a raw block
/// -> content
#let plantuml-url(base-url, ..args, source) = {
let url = base-url + encode(source.text)
let path = args.pos().at(0)
prequery(
(url: url, path: path),
<web-resource>,
image.with(..args),
fallback: source,
)
}
/// A prequery for PlantUML diagrams. Apart from the trailing `source` parameter, the image file
/// name is also mandatory; it is part of `args` for technical reasons. Outside fallback mode,
/// rendering this fails when the rendered diagram file is missing; diagrams need to be rendered in
/// a preprocessing step.
///
/// This function provides a dictionary with `source` and `path` as metadata under the label
/// `<plantuml>`. The sources are strings that can be given to the
/// #link("https://plantuml.com/command-line#f92fb84f0d5ea07f")[PlantUML CLI] via stdin. This
/// metadata can be queried like this:
///
/// ```sh
/// typst query --input prequery-fallback=true --field value ... '<plantuml>'
/// ```
///
/// *Fallback:* renders the raw source block.
///
/// - ..args (arguments): arguments to be forwarded to `image`
/// - source (raw): the PlantUML source code as a raw block
/// -> content
#let plantuml-source(..args, source) = {
let path = args.pos().at(0)
prequery(
(source: source.text, path: path),
<plantuml>,
image.with(..args),
fallback: source,
)
}
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/ttt-exam/0.1.0/lib/template.typ | typst | Apache License 2.0 | #import "@preview/ttt-utils:0.1.0": assignments, components, grading
#import "i18n.typ": *
#import components: *
#import assignments: *
#import grading: *
#import "points.typ": *
#import "headers.typ": *
// The exam function defines how your document looks.
#let exam(
// metadata
logo: none,
title: "exam", // shoes the title of the exam -> 1. Schulaufgabe | Stegreifaufgabe | Kurzarbeit
subtitle: none,
date: none, // date of the exam
class: "",
subject: "" ,
authors: "",
// config
solutions: false,
header: "block", // "block" or "page"
point-field: "sum", // "sum" or "table"
body
) = {
// Error checks
if header != none { assert(header in ("block", "page"), message: "Expected 'header' parameter to be \"block\" or \"page\", found " + header) }
if point-field != none { assert(point-field in ("sum", "table"), message: "Expected 'point-view' parameter to be \"sum\" or \"table\", found " + point-field) }
// Set the document's basic properties.
set document(author: authors, title: "exam-"+subject+"-"+class)
set page(
margin: (left: 20mm, right: 20mm, top: 20mm, bottom: 20mm),
footer: {
// Copyright symbol
sym.copyright;
// YEAR
if type(date) == datetime { date.display("[year]") } else { datetime.today().display("[year]") }
// Authors
if (type(authors) == array) [
#authors.join(", ", last: " and ")
] else [
#authors
]
// Erfolg
h(1fr)
text(10pt, weight: "semibold", font: "Atma")[
#linguify("good_luck", from: ling_db) #box(height: 1em, image("assets/four-leaf-clover.svg"))
]
h(1fr)
// Page Counter
counter(page).display("1 / 1", both: true)
},
header: context if (counter(page).get().first() > 1) { box(stroke: ( 0.5pt), width: 100%, inset: 6pt)[ Name: ] },
)
// check cli input for solution
let cli_arg_lsg = sys.inputs.at("solution", default: none)
if (cli_arg_lsg != none) { solutions = json.decode(cli_arg_lsg) }
assert.eq(type(solutions), bool, message: "expected bool, found " + type(solutions))
set-solution-mode(solutions)
// Include Header-Block
if (header == "page") {
header-page(
logo: logo,
title,
subtitle: subtitle,
class,
subject,
date,
point-field: if (point-field == "sum" ) { point-sum-box } else { point-table }
)
} else if (header == "block") {
header-block(
title,
subtitle: subtitle ,
class,
subject,
date,
logo: logo
)
}
// Predefined show rules
show par: set block(above: 1.2em, below: 1.2em)
// Content-Body
body
}
#let appendix(body, title: auto, ..args) = [
#set page(footer: none, header:none, ..args.named())
#if-auto-then(title, heading(linguify("appendix", from: ling_db)))
#label("appendix")
#body
]
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/chronos/0.1.0/gallery/example1.typ | typst | Apache License 2.0 | #import "/src/lib.typ" as chronos
#chronos.from-plantuml(```plantuml
Alice -> Bob: Authentication Request
Bob --> Alice: Authentication Response
Alice -> Bob: Another authentication Request
Alice <-- Bob: Another authentication Response
```)
#chronos.diagram({
import chronos: *
_seq("Alice", "Bob", comment: "Authentication Request")
_seq("Bob", "Alice", comment: "Authentication Response", dashed: true)
_seq("Alice", "Bob", comment: "Another authentication Request")
_seq("Bob", "Alice", comment: "Another authentication Response", dashed: true)
})
#chronos.diagram({
import chronos: *
_seq("Bob", "Alice", comment: "bonjour", color: red)
_seq("Alice", "Bob", comment: "ok", color: blue)
})
#chronos.diagram({
import chronos: *
_seq("Alice", "Bob", comment: "This is a test")
_seq("Alice", "Callum", comment: "This is another test with a long text")
})
#chronos.diagram({
import chronos: *
_seq("Alice", "Bob", comment: "Authentication Request")
_seq("Bob", "Alice", comment: "Authentication Failure")
_grp("My own label", desc: "My own label2", {
_seq("Alice", "Log", comment: "Log attack start")
_grp("loop", desc: "1000 times", {
_seq("Alice", "Bob", comment: "DNS Attack")
})
_seq("Alice", "Bob", comment: "Log attack end")
})
})
#chronos.diagram({
import chronos: *
_sep("Initialization")
_seq("Alice", "Bob", comment: "Authentication Request")
_seq("Bob", "Alice", comment: "Authentication Response", dashed: true)
_sep("Repetition")
_seq("Alice", "Bob", comment: "Another authentication Request")
_seq("Bob", "Alice", comment: "another authentication Response", dashed: true)
})
#chronos.diagram({
import chronos: *
_seq("Alice", "Bob", comment: "message 1")
_seq("Bob", "Alice", comment: "ok", dashed: true)
_gap()
_seq("Alice", "Bob", comment: "message 2")
_seq("Bob", "Alice", comment: "ok", dashed: true)
_gap(size: 45)
_seq("Alice", "Bob", comment: "message 3")
_seq("Bob", "Alice", comment: "ok", dashed: true)
})
#chronos.diagram({
import chronos: *
_seq("Alice", "Alice", comment: "On the\nright")
_seq("Alice", "Alice", flip: true, comment: "On the\nleft")
}) |
https://github.com/mrknorman/evolving_attention_thesis | https://raw.githubusercontent.com/mrknorman/evolving_attention_thesis/main/notation.typ | typst | #let vectorn(symbol) = {
$bold(accent(symbol, arrow))$
}
#let dvectorn(symbol) = {
$bold(Delta accent(symbol, arrow))$
}
#let uvectorn(symbol) = {
$bold(accent(symbol, hat))$
}
#let udvectorn(symbol) = {
$bold(Delta accent(symbol, hat))$
}
#let matrixn(symbol) = {
//$bold(mat(symbol;))$
//$bold(accent(accent(symbol, macron), macron))$
//$bold(underline(underline(symbol)))$
math.bold(
underline(extent: 2pt,
underline(extent: 2pt,
symbol
)
)
)
}
|
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/grotesk-cv/0.1.0/content/experience.typ | typst | Apache License 2.0 | #import "../lib.typ": *
#import "@preview/fontawesome:0.2.1": *
== #fa-icon("briefcase") #h(5pt) #get-header-by-language("Relevant experience", "Experiencia relevante")
#v(5pt)
#if is-english() [
#experience-entry(
title: [Lead AI Architect],
date: [2015 - Present],
company: [Cyberdyne Systems],
location: [Los Angeles, CA],
)
- Spearheaded the development of the Skynet AI project, a neural network that achieved unprecedented levels of autonomy and, as it turned out, an independent interest in global domination.
- Designed a scalable AI architecture using cutting-edge deep learning techniques, capable of real-time data processing and decision-making on a planetary scale.
- Collaborated with teams of hardware engineers to integrate AI software into next-gen robotics, including autonomous drones and humanoid robots. (If one offers you roses, proceed with caution.)
- Implemented robust testing protocols (we now test everything twice) to ensure stability and safety, post-incident.
#v(5pt)
#experience-entry(
title: [Senior Software Engineer],
date: [2008 - 2015],
company: [Tyrell Corporation],
location: [Los Angeles, CA],
)
- Co-developed the Nexus-6 replicants, focusing on machine learning models that mimic human emotions and cognitive functions. Achieved limited success in emotional empathy, particularly with "tears in rain."
- Developed a custom-built memory implant algorithm for replicants, giving them the illusion of life experiences (turns out, memories are a lot trickier than they seem).
- Led a cross-functional team in debugging and patching replicant behavioral anomalies, including occasional existential crises.
- Worked closely with corporate leadership to ensure compliance with ethical standards (which were sometimes a little... flexible).
] else if is-spanish() [
#experience-entry(
title: [Arquitecto de IA Principal],
date: [2015 - Presente],
company: [Cyberdyne Systems],
location: [Los Ángeles, CA],
)
- Encabezó el desarrollo del proyecto de IA Skynet, una red neuronal que alcanzó niveles de autonomía sin precedentes y, como resultó, un interés independiente en la dominación global.
- Diseñó una arquitectura de IA escalable utilizando técnicas de aprendizaje profundo de vanguardia, capaz de procesar datos y tomar decisiones en tiempo real a escala planetaria.
- Colaboró con equipos de ingenieros de hardware para integrar software de IA en robótica de próxima generación, incluidos drones autónomos y robots humanoides. (Si alguien te ofrece rosas, procede con precaución.)
- Implementó protocolos de prueba robustos (ahora probamos todo dos veces) para garantizar estabilidad y seguridad, post-incidente.
#v(5pt)
#experience-entry(
title: [Ingeniero de Software Senior],
date: [2008 - 2015],
company: [Corporación Tyrell],
location: [Los Ángeles, CA],
)
- Co-desarrolló los replicantes Nexus-6, centrándose en modelos de aprendizaje automático que imitan las emociones humanas y las funciones cognitivas. Logró un éxito limitado en la empatía emocional, especialmente con "lágrimas en la lluvia".
- Desarrolló un algoritmo de implante de memoria personalizado para replicantes, dándoles la ilusión de experiencias de vida (resulta que los recuerdos son mucho más complicados de lo que parecen).
- Dirigió un equipo multifuncional en la depuración y corrección de anomalías de comportamiento de replicantes, incluidas crisis existenciales ocasionales.
- Trabajó en estrecha colaboración con el liderazgo corporativo para garantizar el cumplimiento de los estándares éticos (que a veces eran un poco... flexibles).
] |
https://github.com/Robotechnic/diagraph | https://raw.githubusercontent.com/Robotechnic/diagraph/main/internals.typ | typst | MIT License | #import "graphviz_interface/protocol.typ": *
#let plugin = plugin("graphviz_interface/diagraph.wasm")
/// Converts a string containing escape sequences to content.
#let parse-string(s) = {
let result = []
let row = ""
let is-escaped = false
for cluster in s {
if is-escaped {
is-escaped = false
if cluster == "l" {
result += align(left, row)
row = ""
} else if cluster == "n" {
result += align(center, row)
row = ""
} else if cluster == "r" {
result += align(right, row)
row = ""
} else {
row += cluster
}
} else if cluster == "\\" {
is-escaped = true
} else {
row += cluster
}
}
set block(spacing: 0.65em)
result + align(center, row)
}
/// Convert a number to a string with a fixed number of digits.
/// The number is padded with zeros on the left if necessary.
#let int-to-string(n, digits, base: 10) = {
let n-str = str(n, base: base)
let n-len = n-str.len()
let zeros = "0" * (digits - n-len)
zeros + n-str
}
/// Return a buffer in readable format.
#let buffer-repr(buffer) = [
#repr(array(buffer).map(x => "0x" + int-to-string(x, 2, base: 16)).join(", "))
]
/// COnvert a string to math or text mode
#let convert-label(label, math-mode) = {
if label == "" {
return ""
}
if math-mode {
math.equation(eval(mode: "math", label))
} else {
parse-string(label)
}
}
/// Return a formatted label based on its color, font and content.
#let label-format(color, font, fontsize, label) = {
if label == "" {
return ""
}
set text(fill: rgb(int-to-string(color, 8, base: 16)), bottom-edge: "bounds")
set text(size: fontsize) if fontsize.pt() != 0
set text(font: font) if font != ""
text(label)
}
/// Check that all edges in the overwrite dictionary are present in the encoded label edges.
#let check-overwrite(encoded-label, edge-overwrite) = {
for to-node in edge-overwrite.keys() {
if encoded-label.at("edges_infos").find(edge => edge.at("to") == to-node) == none {
panic("Node \"" + encoded-label.at("name") + "\" does not have an edge to node \"" + to-node + "\"")
}
}
}
#let edge-label-format(edge-overwrite, edge-label, color, font, fontsize, name) = {
let overwrite-list = edge-overwrite.at(edge-label.at("to"), default: none)
if overwrite-list != none {
let index = edge-label.at("index")
if type(overwrite-list) == array and index < overwrite-list.len() {
let overwrite = overwrite-list.at(index)
if type(overwrite) != dictionary {
if name == "label" {
return overwrite
}
} else if name in overwrite {
return overwrite.at(name)
}
} else if index == 0 {
if type(overwrite-list) != dictionary {
if name == "label" {
return overwrite-list
}
} else if name in overwrite-list {
return overwrite-list.at(name)
}
}
}
let label-content = edge-label.at(name)
if label-content == "" {
return ""
}
label-format(color, font, fontsize, convert-label(label-content, edge-label.at(name + "_math_mode")))
}
#let format-edge-labels(encoded-label, edge-overwrite) = {
let formatted-edge-labels = ()
for edge-label in encoded-label.at("edges_infos") {
let font-size = text.size
if edge-label.at("font_size").pt() != 0 {
font-size = edge-label.at("font_size")
}
let font-name = edge-label.at("font_name").split(",")
let font-color = edge-label.at("color")
// panic(edge-label, edge-overwrite)
formatted-edge-labels.push((
native: "label" in edge-overwrite,
label: edge-label-format(edge-overwrite, edge-label, edge-label.at("color"), font-name, font-size, "label"),
xnative: "xlabel" in edge-overwrite,
xlabel: edge-label-format(edge-overwrite, edge-label, edge-label.at("color"), font-name, font-size, "xlabel"),
tailnative: "taillabel" in edge-overwrite,
taillabel: edge-label-format(
edge-overwrite,
edge-label,
edge-label.at("color"),
font-name,
font-size,
"taillabel",
),
headnative: "headlabel" in edge-overwrite,
headlabel: edge-label-format(
edge-overwrite,
edge-label,
edge-label.at("color"),
font-name,
font-size,
"headlabel",
),
))
}
formatted-edge-labels
}
/// Get an array of evaluated labels from a graph.
#let get-labels(labels, xlabels, clusters, edges, dot) = {
let overridden-labels = (
"dot": dot,
)
// panic(buffer-repr(encode-GetGraphInfo(overridden-labels)))
let encoded-labels = plugin.get_labels(encode-GetGraphInfo(overridden-labels))
let (graph-labels, _) = decode-GraphInfo(encoded-labels)
// panic(graph-labels)
(
graph-labels.at("labels").map(encoded-label => {
let font-size = text.size
if encoded-label.at("font_size").pt() != 0 {
font-size = encoded-label.at("font_size")
}
let font-name = encoded-label.at("font_name").split(",")
let label = encoded-label.at("label")
let overwrite = false
if encoded-label.at("name") in labels {
overwrite = true
label = labels.at(encoded-label.at("name"))
} else if label != "" {
overwrite = true
label = convert-label(label, encoded-label.at("math_mode"))
label = label-format(encoded-label.at("color"), font-name, font-size, label)
}
let xlabel = encoded-label.at("xlabel")
let xoverwrite = false
if encoded-label.at("name") in xlabels {
xoverwrite = true
xlabel = xlabels.at(encoded-label.at("name"))
} else if xlabel != "" {
xoverwrite = true
xlabel = convert-label(xlabel, encoded-label.at("xlabel_math_mode"))
xlabel = label-format(encoded-label.at("color"), font-name, font-size, xlabel)
}
let edges-overwrite = edges.at(encoded-label.at("name"), default: (:))
check-overwrite(encoded-label, edges-overwrite)
let edge-labels = format-edge-labels(encoded-label, edges-overwrite)
(
overwrite: overwrite,
label: label,
xoverwrite: xoverwrite,
xlabel: xlabel,
edges_infos: edge-labels,
)
}),
graph-labels.at("cluster_labels").map(encoded-label => {
let overwrite = false
let label = encoded-label.at("label")
if encoded-label.at("name") in clusters {
label = clusters.at(encoded-label.at("name"))
overwrite = true
} else if label != "" {
let font_name = encoded-label.at("font_name").split(",")
let font_size = text.size
if encoded-label.at("font_size").pt() != 0 {
font_size = encoded-label.at("font_size")
}
label = convert-label(label, encoded-label.at("math_mode"))
label = label-format(encoded-label.at("color"), font_name, font_size, label)
overwrite = true
}
(
overwrite: overwrite,
label: label,
)
}),
)
}
#let label-dimensions(color, font, fontsize, label) = {
if label == "" {
(
width: 0pt,
height: 0pt,
)
} else {
let label = label-format(color, font, fontsize, label)
measure(label)
}
}
#let measure-label(edge, name, margin: 0pt) = {
let dim = measure(edge.at(name))
(
width: dim.width + margin,
height: dim.height + margin,
)
}
/// Encodes the dimensions of labels into bytes.
#let encode-label-dimensions(labels, overridden-labels, overridden-xlabels) = {
let edges-margin = 5pt
labels.map(label => {
let edges-size = label.at("edges_infos").map(edge => {
let label = measure-label(edge, "label", margin: edges-margin)
let xlabel = measure-label(edge, "xlabel", margin: edges-margin)
let taillabel = measure-label(edge, "taillabel", margin: edges-margin)
let headlabel = measure-label(edge, "headlabel", margin: edges-margin)
(
overwrite: edge.at("label") != "",
width: label.width,
height: label.height,
xoverwrite: edge.at("xlabel") != "",
xwidth: xlabel.width,
xheight: xlabel.height,
tailoverwrite: edge.at("taillabel") != "",
tailwidth: taillabel.width,
tailheight: taillabel.height,
headoverwrite: edge.at("headlabel") != "",
headwidth: headlabel.width,
headheight: headlabel.height,
)
})
let dimensions = if label.at("overwrite") {
measure(label.at("label"))
} else {
(width: 0pt, height: 0pt)
}
let xdimensions = if label.at("xoverwrite") {
measure(label.at("xlabel"))
} else {
(width: 0pt, height: 0pt)
}
(
overwrite: label.at("label") != "" or label.at("overwrite"),
xoverwrite: label.at("xlabel") != "" or label.at("xoverwrite"),
width: dimensions.width,
height: dimensions.height,
xwidth: xdimensions.width,
xheight: xdimensions.height,
edges_size: edges-size,
)
})
}
#let encode-cluster-label-dimensions(clusters-labels-infos, clusters) = {
clusters-labels-infos.map(label => {
let dim = measure(label.at("label"))
(
width: dim.width,
height: dim.height,
)
})
}
/// Converts any relative length to an absolute length.
#let relative-to-absolute(value, container-dimension) = {
if type(value) == relative {
let absolute-part = relative-to-absolute(value.length, container-dimension)
let ratio-part = relative-to-absolute(value.ratio, container-dimension)
return absolute-part + ratio-part
}
if type(value) == length {
return value.to-absolute()
}
if type(value) == ratio {
return value * container-dimension
}
panic("Expected relative length, found " + str(type(value)))
}
#let debug-rectangle(x, y, width, height) = {
place(
top + left,
dx: x,
dy: y,
rect(height: height, width: width, fill: none, stroke: red),
)
}
/// Renders a graph with Graphviz.
#let render(
/// A string containing Dot code.
dot,
/// Nodes whose name appear in this dictionary will have their label
/// overridden with the corresponding content. Defaults to an empty
/// dictionary.
labels: (:),
/// Nodes whose name appear in this dictionary will have their xlabel
/// overridden with the corresponding content. Defaults to an empty
/// dictionary.
xlabels: (:),
/// Nodes whose name appear in this dictionary will have their
/// edge label overridden with the corresponding content.
/// Each vale mut be a list of dictionaries, one for each edge.
/// Each dictionary can have the following keys:
/// - `label`: the content of the label
/// - `xlabel`: the content of the xlabel
/// - `taillabel`: the content of the taillabel
/// - `headlabel`: the content of the headlabel
edges: (:),
/// Cluster names whose name appear in this dictionary will have their
/// label overridden with the corresponding content. Defaults to an empty
/// dictionary.
clusters: (:),
/// The name of the engine to generate the graph with. Defaults to `"dot"`.
engine: "dot",
/// The width of the image to display. If set to `auto` (the default), will be
/// the width of the generated SVG or, if the height is set to a value, it
/// will be scaled to keep the aspect ratio.
width: auto,
/// The height of the image to display. If set to `auto` (the default), will
/// be the height of the generated SVG or if the width is set to a value, it
/// will be scaled to keep the aspect ratio.
height: auto,
/// Whether to hide parts of the graph that extend beyond its frame. Defaults
/// to `true`.
clip: true,
/// Display a red rectangle around each label to help with debugging.
debug: false,
/// A color or gradient to fill the background with. If set to `none` (the
/// default), the background will be transparent.
background: none,
) = {
set math.equation(numbering: none)
layout(((width: container-width, height: container-height)) => (
context {
let (labels-infos, clusters-labels-infos) = get-labels(
labels,
xlabels,
clusters,
edges,
dot,
)
// return [#repr(labels-infos)]
// return [#repr(clusters-labels-infos)]
let labels-info-count = labels-infos.len()
let encoded-data = (
"font_size": text.size.to-absolute(),
"dot": dot,
"labels": encode-label-dimensions(labels-infos, labels, xlabels),
"cluster_labels": encode-cluster-label-dimensions(clusters-labels-infos, clusters),
"engine": engine,
)
// return [#repr(encoded-data)]
// return [#buffer-repr(encode-renderGraph(encoded-data))]
let output = plugin.render(encode-renderGraph(encoded-data))
if output.at(0) != 0 {
return {
show: highlight.with(fill: red)
set text(white)
raw(block: true, str(output))
}
}
let output = decode-graphInfo(output).at(0)
// return [#repr(output)]
// Get SVG dimensions.
let (width: svg-width, height: svg-height) = measure(image.decode(output.at("svg"), format: "svg"))
let final-width = if width == auto {
svg-width
} else {
relative-to-absolute(width, container-width)
}
let final-height = if height == auto {
svg-height
} else {
relative-to-absolute(height, container-height)
}
if width == auto and height != auto {
let ratio = final-height / svg-height
final-width = svg-width * ratio
} else if width != auto and height == auto {
let ratio = final-width / svg-width
final-height = svg-height * ratio
}
// Rescale the final image to the desired size.
show: block.with(
width: final-width,
height: final-height,
clip: clip,
breakable: false,
)
set align(top + left)
show: scale.with(
origin: top + left,
x: final-width / svg-width * 100%,
y: final-height / svg-height * 100%,
)
// Construct the graph and its labels.
show: block.with(width: svg-width, height: svg-height, fill: background)
// Display SVG.
image.decode(
output.at("svg"),
format: "svg",
width: svg-width,
height: svg-height,
)
let place-label(dx, dy, label) = {
let dimensions = measure(label)
place(
top + left,
dx: dx - dimensions.width / 2,
dy: final-height - dy - dimensions.height / 2 - (final-height - svg-height),
label,
)
if debug {
debug-rectangle(
dx - dimensions.width / 2,
final-height - dy - dimensions.height / 2 - (final-height - svg-height),
dimensions.width,
dimensions.height,
)
}
}
let place-edge-label(dx, dy, name, edge-info) = {
if edge-info.at(name) == "" {
return
}
place-label(
dx,
dy,
edge-info.at(name),
)
}
// Place labels.
for (label-info, label-coordinates) in labels-infos.zip(output.at("labels")) {
for (edge-info, edge-coordinates) in label-info.at("edges_infos").zip(label-coordinates.at("edges")) {
place-edge-label(
edge-coordinates.at("x"),
edge-coordinates.at("y"),
"label",
edge-info,
)
place-edge-label(
edge-coordinates.at("xx"),
edge-coordinates.at("xy"),
"xlabel",
edge-info,
)
place-edge-label(
edge-coordinates.at("headx"),
edge-coordinates.at("heady"),
"headlabel",
edge-info,
)
place-edge-label(
edge-coordinates.at("tailx"),
edge-coordinates.at("taily"),
"taillabel",
edge-info,
)
}
if label-info.at("overwrite") {
place-label(
label-coordinates.at("x"),
label-coordinates.at("y"),
label-info.at("label"),
)
}
if label-info.at("xoverwrite") {
place-label(
label-coordinates.at("xx"),
label-coordinates.at("xy"),
label-info.at("xlabel"),
)
}
}
for (clusters-infos, cluster-coordinates) in clusters-labels-infos.zip(output.at("cluster_labels")) {
if clusters-infos.at("overwrite") {
place-label(
cluster-coordinates.at("x"),
cluster-coordinates.at("y"),
clusters-infos.at("label"),
)
}
}
}
))
}
#let engine-list() = {
let list = plugin.engine_list()
let (engines, _) = decode-Engines(plugin.engine_list())
engines
} |
https://github.com/dyc3/senior-design | https://raw.githubusercontent.com/dyc3/senior-design/main/elicitation-validation.typ | typst | = Requirements Elicitation & Validation <Chapter::ElicitationValidation>
== Elicitation
The problem domain is very well known, so not much outside information is necessary. The following methods were used to elicit requirements.
- Brainstorming
- Research
- User interviews to verify requirements
- Project motivation
== Validation Plan
The success of this project can be measured by the following metrics.
=== Quality Validation
- The frontend must work identically when connecting to the Balancer as it does when connecting to a Monolith.
- All E2E integration tests must pass with and without the Balancer.
=== Performance Validation
- The Balancer must be able to handle thousands of clients sending/receiving about 2-6 messages/sec, with about 5 clients per room.
We will use k6, a load testing tool @k6-load-testing, to script out different scenarios to validate the performance of the entire system. k6 uses JavaScript to write load tests, and can be run in a distributed fashion to simulate a large number of clients.
==== Scenario: `average-load`
This scenario aims to roughly approximate the average peak load of the system as it would be in production. In production, there are anywhere from 0-5 clients per room, across about 50 rooms. However, the ratio of clients to rooms is usually anywhere in the range 1-2 clients per room. Realistically, client activity varies greatly because if nothing is happening to change the state of the room, no messages are being sent. This will not be accurately simulated in this scenario for the sake of simplicity.
Clients will randomly join rooms for a random amount of time (~2 minutes), and then leave. While connected, the clients will send messages and make HTTP requests randomly, according to what makes sense based on the state of the room. For example, if the there is no video playing, a client will not send a "play" message.
#figure(
image("figures/load-tests/average-load-class.svg", width: 50%),
caption: [Class diagram for the `average-load` scenario],
) <Figure::average-load-class>
=== Balancing Validation
- The Balancer should generally evenly distribute load across all Monoliths.
|
|
https://github.com/jgm/typst-hs | https://raw.githubusercontent.com/jgm/typst-hs/main/test/typ/text/emphasis-03.typ | typst | Other | // Error: 13 expected underscore
#box[_Scoped] to body.
|
https://github.com/AHaliq/DependentTypeTheoryReport | https://raw.githubusercontent.com/AHaliq/DependentTypeTheoryReport/main/chapters/chapter1/index.typ | typst | #import "../../preamble/dtt.typ": *
#import "../../preamble/catt.typ": *
#import "@preview/curryst:0.3.0": rule, proof-tree
#import "@preview/fletcher:0.5.1" as fletcher: diagram, node, edge
= Extensional Type Theory (ETT)
== Substitution Calculus
We study the dependent type theory; *Substitution Calculus*, which has the following judgements
#figure(table(
columns: 6,
align: (right, left, left, left, left, left),
[form], [term], [type], [defn term eq], [defn type eq], [substitutions],
[judgement],
$Gamma hy a: A$,
$Gamma hy A type$,
$Gamma hy a = b: A$,
$Gamma hy A = B type$,
$Delta hy gamma: Gamma$,
))
*Terms* are like elements of a set but definitionally bound to its *type*; not member relation.
*Contexts* are telescopes of dependent terms. They can be seen as a list of term judgements.
$
a_0: A_0, a_1: A_1(a_0), a_2: A_2(a_0,a_1), ..., a_n: A_n (a_0,...,a_(n-1)) hy
$
Often the dependent terms are left implicit with dot to notate concatenation i.e. $Gamma. A$
$
A_0.A_1.A_2...A_n hy
$
*Substitutions* shifts the context of a judgement to another context.
Rather than listing all the rules of the substitution calculus, we will study a model of dependent types which entails its rules. The model here is called _Categories with Families_ (CwF)
#grid(columns: (1fr,1fr), align: (horizon + left, horizon + left),
[We first define the following
- $C$ is *category* of contexts and substitutions
- a *presheaf* $F : op(C) -> Set$ is a *contravariant functor* thus $[op(C), Set]$ is a functor category
- the *yoneda embedding* $y : C -> [op(C), Set]$ maps to presheafs i.e. $y(c) = Hom(C,s:-,t:c)$
- the *yoneda lemma* says that the set of morphisms between $y(c)$ to some presheaf $X$ is canonically isomorphic to the set $X(c)$ i.e. $Hom([op(C),Set],s:y(c),t:X) iso X(c)$
- thus given the following category of presheaves of $C$, the morphisms are terms, types and substitutions
- $Tm(Gamma) iso Hom([op(C),Set],s:y(Gamma),t:Tm)$
- $Ty(Gamma) iso Hom([op(C),Set],s:y(Gamma),t:Ty)$
- $gamma in Hom([op(C),Set],s:y(Delta),t:Gamma)$
],
figure(diagram(cell-size: 5mm, $
#node($Delta$, name: <Delta>)
#edge("dr", $Delta hy gamma. a : Gamma. A$, "-->")
#edge("drrr", $Delta hy a : A[gamma]$, "->", bend: 30deg)
#edge("dddr", $Delta hy gamma: Gamma$, "->", bend: -30deg) \ &
#node($Gamma . A$, name: <GammaA>)
#edge("rr", $Gamma. A hy sq : A[sp]$, "->", label-anchor: "north", label-sep: -0.3em)
#edge("dd", $Gamma. A hy sp : Gamma$, "->", label-anchor: "west", label-sep: -0.3em)
#corner("dr")
& &
#node($Tm$, name: <Tm>)
#edge("dd", $p$, "->", label-anchor: "west", label-sep: -0.2em) \ \ &
#node($Gamma$, name: <Gamma>)
#edge("rr", $Gamma hy A type$, "->", label-anchor: "north", label-sep: -0.3em) && Ty
$))
)
The rules for substitution calculus are then derived from the properties of this model
#grid(
columns: (1fr, 1fr, 1fr),
align: (center, center, center),
table(columns: 2, align: (right, left),
[], [by definition],
$a[gamma]:A[gamma]$, [term substitution],
$A[gamma] type$, [type substitution]
),
table(columns: 2, align: (right, left),
[], [by morphisms],
$id$, [identity],
$gamma comp psi$, [composition],
$id comp gamma comp id$, [unital],
$gamma comp psi comp phi$, [associative]
),
table(columns: 2, align: (right, left),
[], [by pullback],
$sp$, [weakening (add terms to context)],
$sq$, [variable (create term judgement; de bruijn)],
$gamma. a$, [substitution extension (extend with term)]
)
)
The concrete rules can be seen in the Appendix of @daniel
== _Mapping In_ types and Naturality
The terms of a _mapping in_ type is defined by the following isomorphism
$
iota_(Gamma,X):Tm(Gamma, Upsilon(X)) iso Y
$
The intuition is that the terms of $Upsilon$ are _"known"_ by the terms mapped into it; in $Gamma$.
#figure(table(
columns: 3,
align: (right, left, left),
[rule], [equationally], [description],
[formation],
$Upsilon_Gamma : H -> Ty(Gamma)$, [constructs the type],
[elimination],
$iota_(Gamma,X)$,
[_use_ of the term],
[introduction],
$iota_(Gamma,X)^(-1)$,
[_construct_ the term],
[$beta$ computation],
$iota_(Gamma,X)^(-1) comp iota_(Gamma,X) = id_Tm$,
[],
[$eta$ uniqueness],
$iota_(Gamma,X) comp iota_(Gamma,X)^(-1) = id_Y$,
[],
))
All types; beyond just _mapping in_ types, respect substitution. This is called the naturality property which can be seen in the commuting square of the following sets:
#figure(diagram(cell-size: 10mm, $
Tm(Gamma, Upsilon_Gamma (X))
edge("r", iota_(Gamma,X), "<->")
edge("d", gamma^*, "->") &
Y
edge("d", psi^*, "->") \
Tm(Delta, Upsilon_Gamma (X)[gamma])
edge("r", iota_(Delta,X[gamma]), "<->") &
Y[gamma]
$))
This means applying $iota_(Gamma,X)$ and then $gamma$ is the same as applying in the other order
#figure(table(
columns: 5, align: (horizon + right, horizon + left, horizon + left, horizon + left, horizon + left),
$Upsilon_Gamma (X)$, $H= bold(Sigma)_(A in Ty(Gamma)) - $, $Upsilon_Gamma (X)[gamma]$, $Y$, $Y[gamma]$,
$Pi_Gamma (A,B)$,
$Ty(Gamma. A)$,
$Pi_Delta (A[gamma],B[gamma. A])$,
$Tm(Gamma. A, B)$,
$Tm(Delta. A[gamma], B[gamma. A])$,
$Sigma_Gamma (A,B)$,
$Ty(Gamma. A)$,
$Sigma_Delta (A[gamma],B[gamma. A])$,
$bold(Sigma)_(a in Tm(Gamma, A)) \ Tm(Gamma, B[id. a])$,
$bold(Sigma)_(a in Tm(Delta, A[gamma])) \ Tm(Delta, B[gamma. A. a])$,
$Unit_Gamma$, [-], $Unit_Delta$, ${star}$, ${star}$,
$Eq_Gamma (A,a,b)$,
$Tm(Gamma,A) times Tm(Gamma,A)$,
$Eq_Delta (A[gamma],a[gamma],b[gamma])$,
${star | a = b}$,
${star | a = b}$
))
== Extensional Equality
$Eq$ is what makes the theory *extensional*. It differs from other types in that its elimination rule produces a judgement of definitional equality of terms rather than a term judgement. This weakens the structure of equality in our theory from only *definitional equality*; by syntax, to also *propositional equality*; expressed in the theory.
#figure(proof-tree(rule(
name: [Reflection],
$Gamma hy a = b : A$,
$Gamma hy p : Eq(A,a,b)$
)))
This also means that $Tm(Gamma,Eq(A,a,b)) iso { star }$; the set of terms is isomorphic to the singleton set; there is only one unique term.
This uniqueness although useful in performing some proofs makes the type non invertible thus loosing the *normalization* metatheorem for our theory.
== _Mapping Out_ types, Initial Algebras and Inductive Types
Terms of _Mapping Out_ types in contrast are _"known"_ by the terms mapped out of them; $A$.
$
{a in Tm(Gamma. Upsilon,A) | phi} iso { star }
$
The types whose terms are identified by isomorphisms of the above form are inductive schemas which can be defined with initial algebras. This is called the *unicity principle*.
#figure(table(
columns: 3,
align: (right, left, left),
$Upsilon$, [signature], [initial algebra],
$Void$, $X |-> 0$, $absurd$,
$Bool$, $X |-> 1 + 1$, $tt, ff$,
$A + B$, $X |-> A + B$, $inl, inr$,
$bb(N)$, $X |-> 1 + X$, $zero, succ$,
))
The initial algebras thus are the constructors or introduction rules of the type.
The isomorphism also then defines the elimination rule for the type called the recursor. The following is an example for the $Bool$ type.
$
{ a in Tm(Gamma. b:Bool, A) | a_tt = a[id. tt] and a_ff = a[id. ff]} iso {star} \
rec_Bool (a_tt, a_ff, b) = cases(
a_tt &#h(1em) b = tt,
a_ff &#h(1em) b = ff
)
$
== Universes
For our theory to be *full spectrum*; dependent types can evaluate to constructors of different types. Thus, we need a way to quantify over all types. We create $UU$; universe, with terms of codes for types.
#figure(diagram(cell-size: 10mm, $
Tm(Gamma, UU)
edge("r", El, "->", bend: #30deg)
edge("r", code, "<-", bend: #{-30deg}) &
Ty(Gamma)
$))
Thus instead of defining formation rules for each $Upsilon$, they are now introduction rules for $UU$.
Now our theory is full spectrum with elimination for inductive types being $ind_Upsilon$, not $rec_Upsilon$
However we can't access $UU$ itself in our theory for *recursive types*, to do this without encountering paradoxes via *impredicativity*. We solve this by making an infinite hierarchy of universes; $UU_0, UU_1, UU_2, ...$
The universes are *cumulative*, meaning codes in universes below exists in those above via the lifting constructor. We can also access the universes below
#figure(grid(columns: (1fr, 1fr), align: (center + horizon, center + horizon),
proof-tree(rule(
name: [Lifting],
$Gamma hy lift_i(c) : UU_(i+1)$,
$Gamma hy c : UU_i$
)),
proof-tree(rule(
name: [Universe],
$Gamma hy uni_(i,j) : UU_i$,
$j < i$,
$Gamma hy UU_i type$,
$Gamma hy UU_j type$
))
))
|
|
https://github.com/Vortezz/fiches-mp2i-maths | https://raw.githubusercontent.com/Vortezz/fiches-mp2i-maths/main/chapter_3.typ | typst | #set page(header: box(width: 100%, grid(
columns: (100%),
rows: (20pt, 8pt),
align(right, text("CHAPITRE 3. RELATIONS")),
line(length: 100%),
)), footer: box(width: 100%, grid(
columns: (50%, 50%),
rows: (8pt, 20pt),
line(length: 100%),
line(length: 100%),
align(left, text("<NAME> - MP2I")),
align(right, text("<NAME> - 2023/2024")),
)))
#set heading(numbering: "I.1")
#let titleBox(title) = align(center, block(below: 50pt, box(height: auto, fill: rgb("#eeeeee"), width: auto, inset: 40pt, text(title, size: 20pt, weight: "bold"))))
#titleBox("Relations")
= Définitions générales
== Relations
Une *relation binaire* entre deux ensembls $E$ et $F$ est un sous-ensemble $G$ de $E times F$. On note souvent $x R y$ pour dire que $(x, y) in G$, et on dit que $x$ est en relation avec $y$ par $R$.
Une relation entre $E$ et $F$ est dite *fonctionnelle* si pour tout $x in E$, il _existe au plus un unique_ $y in F$ tel que $x R y$.
Si $R$ est une relation entre $E$ et lui-même, on dit que $R$ est une *relation sur $E$*.
== Définitions de quelques propriétés
Soit $R$ une relation sur $E$ :
- $R$ est *réflexive* si pour tout $x in E$, $x R x$.
- $R$ est *symétrique* si pour tout $x, y in E$, $x R y ==> y R x$.
- $R$ est *antisymétrique* si pour tout $x, y in E$, $x R y and y R x ==> x = y$.
- $R$ est *transitive* si pour tout $x, y, z in E$, $x R y and y R z ==> x R z$.
- $R$ est *irréflexive* si pour tout $x in E$, $not(x R x)$.
- $R$ est *asymétrique* si pour tout $x, y in E$, $x R y ==> not(y R x)$.
On remarque donc que une relation _antisymétrique_ et _irréflexive_ est _asymétrique_.
= Relations d'équivalence
== Définition
Une *relation d'équivalence* sur un ensemble $E$ est une relation $R$ sur $E$ qui est _réflexive_, _symétrique_ et _transitive_. On note souvent $x equiv y$ ou $x tilde y$ pour dire que $x R y$.
== Classes d'équivalence, ensemble quotient
Soit $R$ une relation d'équivalence sur $E$, et on a $x in E$, ainsi la *classe d'équivalence* de $x$ sous la relation $R$ est le sous-ensemble $C_x$ de $E$ des élements en relation avec $x$ par $R$ : $C_x = overline(x) = {y in E | x R y}$.
Si $y, z in overline(x)$, alors $y R z$
L'ensemble des classes d'équivalence de $E$ sous $R$ forme une partition de $E$. On note $E\/R$ l'ensemble des classes d'équivalence de $E$ sous $R$, et on l'appelle *ensemble quotient* de $E$ par $R$.
On appelle *projection canonique* la fonction $pi_R : E ->> E\/R$ qui à $x in E$ associe $overline(x) in E\/R$. $pi_R$ est surjective et vérifie $x R y ==> pi_R(x) = pi_R(y)$.
#emoji.warning $pi_R$ n'est pas injective en général, elle l'est seulement dans le cas d'une relation d'égalité.
Soit $f : E -> F$ une fonction, et $R$ une relation d'équivalence sur $E$, les propriétés suivantes sont équivalentes :
- $forall (x,y) in E^2, x R y ==> f(x) = f(y)$
- Il existe une fonction $g : E\/R -> F$ telle que $f = g circle.tiny pi_R$
== Congruence
Soit $E$ un ensemble muni d'un certain nombre d'opérations $times_1, ..., times_n$. On dit que $R$ est une *congruence* si :
$ forall(x,y,x',y') in E^4, forall i in [|1,n|], (x R x') and (y R y') ==> (x times_i y) R (x' times_i y') $
La relation de congruence des entiers notée $equiv ""_([n])$ est une congruence sur $(ZZ, plus, times)$.
Soit $(E, times_1, ..., times_n)$ un ensemble muni de $n$ opérations, et $R$ une congruence sur $E$. On peut définir sur $E\/R$ les opérations $ dot(times_1), ..., dot(times_n)$ telles que pour tout $i in [|1,n|]$ et pour tout $x, y in E$, $overline(x)dot(times_i)overline(y)= overline(x times_i y)$.
On peut munir $ZZ\/n ZZ$ des opérations $dot(plus)$ et $dot(times)$, notées plus simple $plus$ et $times$, telles que pour tout $x, y in ZZ$, $overline(x)plus overline(y) = overline(x + y)$ et $overline(x)times overline(y) = overline(x times y)$.
= Relations d'ordre
== Définitions
Une *relation d'ordre* sur un ensemble $E$ est une relation $R$ sur $E$ qui est _réflexive_, _antisymétrique_. On note souvent $x <= y$ pour dire que $x R y$. Les écritures $x <= y$ et $y >= x$ sont équivalentes.
Une *relation d'ordre strict* est une relation _irréflexive_ et _transitive_. On en déduit que la relation d'ordre strict est aussi _antisymétrique_.
- Toute d'ordre $<=$ définit une relation d'ordre strict par $x < y <=> x <= y and x != y$.
- Toute relation d'ordre strict $<$ définit une relation d'ordre par $x <= y <=> x < y or x = y$.
On dit que $R$ est une *relation d'ordre total* si pour tout $x, y in E$, $x R y or y R x$, sinon $R$ est une *relation d'ordre partiel*.
Soit $R$ une relation sur $E$, on a $A subset E$, alors $R$ définit sur $A$ une relation d'ordre $R'$ par $x R' y <=> x R y$.
Il s'agit de la *restriction* de $R$ à $A$ ou de la *relation induite* par $R$ sur $A$.
== Minimalité, maximalité
- $m$ est appelé plus *petit élément* de $E$ (ou *élément minimum*) si pour tout $x in E$, $m <= x$.
- $M$ est appelé plus *grand élément* de $E$ (ou *élément maximum*) si pour tout $x in E$, $x <= M$.
#emoji.warning Le minimum et le maximum sont uniques si ils existent.
- $m$ est appelé *élément minimal* de $E$ si il n'existe pas d'élément $x in E$ tel que $x < m$.
- $M$ est appelé *élément maximal* de $E$ si il n'existe pas d'élément $x in E$ tel que $x > M$.
Si $E$ est ordonné, fini et non vide, alors $E$ admet un élément minimal. Si $E$ est fini et ordonné, et que $E$ admet un unique élément minimal, alors cet élément est aussi l'élément minimum de $E$.
Si l'ordre défini sur $E$ est total, l'élément minimal coïncide avec l'élément minimum. *Attention*, c'est faux si l'ordre est partiel car $x < m equiv.not not (x >= m)$
#block()
Avec $A subset E$,
- $m$ est appelé minorant de $A$ si pour tout $x in A$, $x >= m$.
- $M$ est appelé majorant de $A$ si pour tout $x in A$, $x <= M$.
#block()
- La *borne inférieure* de $A$ (ou *infimum*) est le plus grand minorant de $A$ sous réserve d'existence. On la note $inf_E (x)$ ou $inf (x)$.
- La *borne supérieure* de $A$ (ou *supremum*) est le plus petit majorant de $A$ sous réserve d'existence. On la note $sup_E (x)$ ou $sup (x)$.
*Propriété fondamentale de $RR$*, toute sous-ensemble non vide de $RR$ qui est majorée admet une borne supérieure.
Tout sous-ensemble borné de $QQ$ admet une borne supérieure dans $RR$, mais pas forcément dans $QQ$.
Pour montrer que $s = sup(A)$, on montre que $s$ est un majorant de $A$ et que pour tout majorant $M$ de $A$, $M >= s$.
Dans $NN^*$ muni de la divisibilité, $inf(a,b) = "pgcd"(a,b)$ et $sup(a,b) = "ppcm"(a,b)$. \
Dans $P(E)$ muni de l'inclusion, $inf(A,B) = A union B$ et $sup(A,B) = A sect B$.
$A$ admet un maximum $M$ si et seulement si $A$ admet une borne supérieure $b$ et si $b in A$. Dans ce cas, $M = sup(A)$.
== Lemme de Zorn
On dit que $E$ est un ensemble *inductif* si pour tout $F subset E$ totalement ordonné (*chaine*), $F$ admet un majorant dans $E$.
Tout ensemble ordonné et fini est inductif.
*Lemme de Zorn* : Tout ensemble inductif admet un élément maximal (_reformulation de l'axiome du choix_). |
|
https://github.com/Meisenheimer/Notes | https://raw.githubusercontent.com/Meisenheimer/Notes/main/src/ODE.typ | typst | MIT License | #import "@local/math:1.0.0": *
= Ordinary Differential Equation
#env("Definition")[
Given a function $F$, an *explicit ordinary differential equation* of order $n$ takes the form
$ mathbf(F)(mathbf(u)^((n-1)), dots, mathbf(u)^prime, mathbf(u), t) = mathbf(u)^((n)), $
an *implicit ordinary differential equation* of order $n$ takes the form
$ mathbf(F)(mathbf(u)^((n)), dots, mathbf(u)^prime, mathbf(u), t) = mathbf(0), $
]
#env("Definition")[
An ODE is *autonomous* if it does not depend on the variable x.
]
#env("Definition")[
A ODE is *linear* if can be written as
$ sum_(i=0)^(n) A_(i)(t) mathbf(u)^((i)) + mathbf(r)(t) = mathbf(0), $
where $A_(i)(t)$ and $r(t)$ are continuous functions of $t$.
]
#env("Definition")[
A linear ODE is *homogeneous* if $mathbf(r)(t) = 0$, and there is always the trivial solution $mathbf(u) equiv mathbf(0)$.
]
#env("Definition")[
An ODE is *separable* if can be written as
$ P_1(x) Q_1(y) = P_2(x) Q_2(y) (upright(d) y)/(upright(d) x). $
]
#env("Definition")[
For initial value $(mathbf(u)_0, t_0) in RR^n times RR$, $T >= t_0$ and $mathbf(f): RR^n times [t_0, T] -> RR^n$, the *initial value problem* (IVP) is to find $u(t) in C^1([t_0, T])$ satisfies
$ mathbf(u)^prime = mathbf(f) (mathbf(u), t), #h(1em) mathbf(u) (t_0) = mathbf(u)_0. $
]
#env("Theorem")[
Given an IVP, denoted by $u_0 = u$, $u_i, i = 1, dots, n$ the $i$th derivative of $u$, then the ODE
$ mathbf(F)(mathbf(u)^((n-1)), dots, mathbf(u)^prime, mathbf(u), t) = mathbf(u)^((n)) $
can be written as an IVP,
$ mat(mathbf(u)_0^prime; dots.v; mathbf(u)_(n-2)^prime; mathbf(u)_(n-1)^prime) = mat(mathbf(u)_1; dots.v ; mathbf(u)_(n-1); mathbf(F)(mathbf(u)_(n-1), dots, mathbf(u)_1, mathbf(u)_0, t)). $
]
== General Theory
#env("Theorem", name: "Peano existence theorem")[
Given an IVP with an open set $Omega subset.eq RR^n times RR$, if $mathbf(f) (mathbf(u), t) in C(Omega)$ and $(mathbf(u)_0, t_0) in Omega$, then there is a local solution $tilde(mathbf(u)): U -> RR^n$ satisfies the IVP, where $U$ is a neighbourhood of $t_0$ in $RR$.
]
#env("Theorem", name: "Picard–Lindelöf theorem")[
Given an IVP with an open set $Omega subset.eq RR^n times RR$, if $mathbf(f) (mathbf(u), t): Omega -> RR^n$ is continuous in $t$ and Lipschitz continuous in $mathbf(u)$ and $(mathbf(u)_0, t_0) in Omega$, then there is a unique local solution $tilde(mathbf(u)): U -> RR^n$ satisfies the IVP, where $U$ is a neighbourhood of $t_0$ in $RR$.
]
#env("Theorem", name: "Comparison theorem")[
Given two IVPs
$ mathbf(u)_1^prime = mathbf(f)_1 (mathbf(u)_1, t), #h(1em) mathbf(u)_1 (t_0) = mathbf(u)_0, \
mathbf(u)_2^prime = mathbf(f)_2 (mathbf(u)_2, t), #h(1em) mathbf(u)_2 (t_0) = mathbf(u)_0, $
and a open set $Omega subset.eq RR^n times RR$, if for all $(mathbf(u), t) in Omega$, $mathbf(f)_1 (mathbf(u), t) < mathbf(f)_2 (mathbf(u), t)$, then
$ cases(
mathbf(u)_1 (t) > mathbf(u)_2 (t)\, #h(1em) t > t_0\, (mathbf(u)_1 (t), t)\, (mathbf(u)_2 (t), t) in Omega\,,
mathbf(u)_1 (t) < mathbf(u)_2 (t)\, #h(1em) t < t_0\, (mathbf(u)_1 (t), t)\, (mathbf(u)_2 (t), t) in Omega\,,
) $
]
== Exact solutions
#env("Example")[
Given an initial point $(y_0, x_0)$, and a separable equation
$ P_1(x) Q_1(y) = P_2(x) Q_2(y) (upright(d) y)/(upright(d) x), $
the solution of the equation is
$ integral_(x_0)^x (P_1(t))/(P_2(t)) upright(d) t = integral_(y_0)^y (Q_2(t))/(Q_1(t)) upright(d) t. $
]
#env("Example")[
Given an initial point $(y_0, x_0)$, and a first-order homogeneous equation
$ (upright(d) y)/(upright(d) x) = F(y/x), $
the solution of the equation is
$ integral_(x_0)^x 1/x upright(d) x = integral_(y_0 / x_0)^(y / x) 1 / (F(t) - t) upright(d) t. $
]
#env("Example")[
Given an initial point $(y_0, x_0)$, and a first-order separable equation
$ y M(x y) + x N(x y) (partial y)/(partial x) = 0, $
the solution of the equation is
$ integral_(x_0)^x 1/x upright(d) x = integral_(y_0 x_0)^(y x) N(t) / (t(N(t) - M(t))) upright(d) t, $
where $C$ is a constant.
]
#env("Example")[
Given a $n$th-order, linear, inhomogeneous, constant coefficients equation
$ sum_(i=0)^n a_i (partial^i y)/(partial x^i) = 0, $
the solution of the equation is
$ sum_(i=1)^k (sum_(j=1)^(m_i) c_(i j) x^(j-1)) e^(alpha_i x), $
where ${c_(i j)}$ are constants and $alpha_i$ is the root of
$ sum_(i=0)^n a_i x^i = 0 $
that repeated $m_i$ times.
]
== Important ODEs
=== Bernoulli differential equation
#env("Definition")[
The *Bernoulli differential equation* takes the form
$ y^prime + P(x) y = Q(x) y^n, $
where $n eq.not 0, 1$.
]
#env("Theorem")[
The solution of the Bernoulli differential equation is
$ y = (z(x))^(1/(1 - n)), $
where $z(x)$ is the solution of
$ z^prime + (1 - n) P(x) z + (1 - n) Q(x) = 0. $
]
=== Riccati equation
#env("Definition")[
The *Riccati equation* takes the form
$ y^prime = q_0 (x) + q_1 (x) y + q_2 (x) y^2, $
where $q_0(x) eq.not 0, q_2(x) eq.not 0$.
]
#env("Theorem")[
If $u$ is one particular solution of the Riccati equation, the general solution is obtained as $y = u + 1 / v$, where $v$ satisfies
$ v^prime + (q_1 (x) + 2 q_2 (x) u) v + q_2(x). $
] |
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/unichar/0.1.0/ucd/block-11A00.typ | typst | Apache License 2.0 | #let data = (
("ZANABAZAR SQUARE LETTER A", "Lo", 0),
("ZANABAZAR SQUARE VOWEL SIGN I", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN UE", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN U", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN E", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN OE", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN O", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN AI", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN AU", "Mn", 0),
("ZANABAZAR SQUARE VOWEL SIGN REVERSED I", "Mn", 0),
("ZANABAZAR SQUARE VOWEL LENGTH MARK", "Mn", 0),
("ZANABAZAR SQUARE LETTER KA", "Lo", 0),
("ZANABAZAR SQUARE LETTER KHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER GA", "Lo", 0),
("ZANABAZAR SQUARE LETTER GHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER NGA", "Lo", 0),
("ZANABAZAR SQUARE LETTER CA", "Lo", 0),
("ZANABAZAR SQUARE LETTER CHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER JA", "Lo", 0),
("ZANABAZAR SQUARE LETTER NYA", "Lo", 0),
("ZANABAZAR SQUARE LETTER TTA", "Lo", 0),
("ZANABAZAR SQUARE LETTER TTHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER DDA", "Lo", 0),
("ZANABAZAR SQUARE LETTER DDHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER NNA", "Lo", 0),
("ZANABAZAR SQUARE LETTER TA", "Lo", 0),
("ZANABAZAR SQUARE LETTER THA", "Lo", 0),
("ZANABAZAR SQUARE LETTER DA", "Lo", 0),
("ZANABAZAR SQUARE LETTER DHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER NA", "Lo", 0),
("ZANABAZAR SQUARE LETTER PA", "Lo", 0),
("ZANABAZAR SQUARE LETTER PHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER BA", "Lo", 0),
("ZANABAZAR SQUARE LETTER BHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER MA", "Lo", 0),
("ZANABAZAR SQUARE LETTER TSA", "Lo", 0),
("ZANABAZAR SQUARE LETTER TSHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER DZA", "Lo", 0),
("ZANABAZAR SQUARE LETTER DZHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER ZHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER ZA", "Lo", 0),
("ZANABAZAR SQUARE LETTER -A", "Lo", 0),
("ZANABAZAR SQUARE LETTER YA", "Lo", 0),
("ZANABAZAR SQUARE LETTER RA", "Lo", 0),
("ZANABAZAR SQUARE LETTER LA", "Lo", 0),
("ZANABAZAR SQUARE LETTER VA", "Lo", 0),
("ZANABAZAR SQUARE LETTER SHA", "Lo", 0),
("ZANABAZAR SQUARE LETTER SSA", "Lo", 0),
("ZANABAZAR SQUARE LETTER SA", "Lo", 0),
("ZANABAZAR SQUARE LETTER HA", "Lo", 0),
("ZANABAZAR SQUARE LETTER KSSA", "Lo", 0),
("ZANABAZAR SQUARE FINAL CONSONANT MARK", "Mn", 0),
("ZANABAZAR SQUARE SIGN VIRAMA", "Mn", 9),
("ZANABAZAR SQUARE SIGN CANDRABINDU", "Mn", 0),
("ZANABAZAR SQUARE SIGN CANDRABINDU WITH ORNAMENT", "Mn", 0),
("ZANABAZAR SQUARE SIGN CANDRA WITH ORNAMENT", "Mn", 0),
("ZANABAZAR SQUARE SIGN ANUSVARA", "Mn", 0),
("ZANABAZAR SQUARE SIGN VISARGA", "Mc", 0),
("ZANABAZAR SQUARE CLUSTER-INITIAL LETTER RA", "Lo", 0),
("ZANABAZAR SQUARE CLUSTER-FINAL LETTER YA", "Mn", 0),
("ZANABAZAR SQUARE CLUSTER-FINAL LETTER RA", "Mn", 0),
("ZANABAZAR SQUARE CLUSTER-FINAL LETTER LA", "Mn", 0),
("ZANABAZAR SQUARE CLUSTER-FINAL LETTER VA", "Mn", 0),
("ZANABAZAR SQUARE INITIAL HEAD MARK", "Po", 0),
("ZANABAZAR SQUARE CLOSING HEAD MARK", "Po", 0),
("ZANABAZAR SQUARE MARK TSHEG", "Po", 0),
("ZANABAZAR SQUARE MARK SHAD", "Po", 0),
("ZANABAZAR SQUARE MARK DOUBLE SHAD", "Po", 0),
("ZANABAZAR SQUARE MARK LONG TSHEG", "Po", 0),
("ZANABAZAR SQUARE INITIAL DOUBLE-LINED HEAD MARK", "Po", 0),
("ZANABAZAR SQUARE CLOSING DOUBLE-LINED HEAD MARK", "Po", 0),
("ZANABAZAR SQUARE SUBJOINER", "Mn", 9),
)
|
https://github.com/ohmycloud/computer-science-notes | https://raw.githubusercontent.com/ohmycloud/computer-science-notes/main/Misc/LSM.typ | typst | LSM tree(log-structured merge-tree)是一种对频繁写操作非常友好的数据结构，同时兼顾了查询效率。LSM tree 是许多 key-value 型或日志型数据库所依赖的核心数据结构，例如 BigTable、HBase、Cassandra、LevelDB、SQLite、TiDB、RocksDB 等。
LSM tree 之所以有效是基于以下事实：磁盘或内存的连续读写性能远高于随机读写性能，有时候这种差距可以达到三个数量级之高。这种现象不仅对传统的机械硬盘成立，对 SSD 硬盘也同样成立。
LSM tree 在工作中尽可能避免随机读写，充分发挥了磁盘连续读写的性能优势。
== SSTable
LSM tree 持久化到硬盘上之后的结构称为 Sorted Strings Table(SSTable)。见名知意，SSTable 保存了排序后的数据（实际上是按照 key 排序的 key-value 对）。每个 SSTable 可以包含多个存储数据的文件，称为 segment，每个 segment 内部都是有序的，但不同 segment 之间没有顺序关系。一个 segment 一旦生成便不再修改（immutable）。
一个 SSTable 的示例如下：
#image("segment.jpg")
可以看到，每个 segment 内部的数据都是按照 key 排序的。下面我们来介绍每个 segment 是如何生成的。
== 写入数据
LSM tree 的所有写操作均为#text(fill: red, weight: "bold")[连续写], 因此效率非常高。但由于外部数据是无序到来的, 如果无脑连续写入到 segment, 显然是不能保证顺序的。对此, LSM tree 会在内存中构造一个有序数据结构（称为 memtable）, 例如红黑树。每条新到达的数据都插入到该红黑树中, 从而始终保持数据有序。当写入的数据量达到一定阈值时, 将触发红黑树的 flush 操作, 把所有排序好的数据一次性写入到硬盘中（该过程为连续写）, 生成一个新的 segment，而之后红黑树便从零开始下一轮攒数据的过程。
#image("sequence-write.jpg")
== 读取/查询数据
如何从 SSTable 中查询一条特定的数据呢？一个最简单的办法是扫描所有的 segment, 直到找到所查询的 key 为止。通常应该从最新的 segment 扫描, 依次到最老的 segment, 这是因为越是最近的数据越可能被用户查询, 优先扫描最近的数据能够提高平均查询速度。
当扫描到某个特定的 segment 时, 由于该 segment 内部的数据是有序的, 因此可以使用二分查找的方式, 在 O(logn)的时间内得到查询结果。但对于二分查找来说, 要么一次性把数据全部读入内存, 要么在每次二分查找时都消耗一次磁盘 IO, 当 segment 非常大时（这种情况在大数据场景下司空见惯）,这两种情况的代价都非常高。一个简单的优化策略是, 在内存中维护一个稀疏索引（sparse index）, 其结构如下图:
#image("sparse-index.jpg")
稀疏索引是指将有序数据切分成（固定大小的）块, 仅对各个块开头的一条数据做索引。与之相对的是全量索引（dense index）, 即对全部数据编制索引, 其中的任意一条数据发生增删均需要更新索引。两者相比, 全量索引的查询效率最高, 达到了理论极限值 O(logn), 但写入和删除效率更低, 因为每次数据增删时均需要因为更新索引而消耗一次 IO 操作。通常的关系型数据库, 例如 MySQL 等, 其内部采用 B tree 作为索引结构, 这便是一种全量索引。
有了稀疏索引之后, 可以先在索引表中使用二分查找快速定位某个 key 位于哪一小块数据中, 然后仅从磁盘中读取这一块数据即可获得最终查询结果, 因此加载的数据量仅仅是整个 segment 的一小部分, 因此 IO 代价较小。以上图为例, 假设我们要查询 dollar 所对应的 value。首先在稀疏索引表中进行二分查找, 定位到 dollar 应该位于 dog 和 downgrade 之间, 对应的 offset 为 17208~19504。之后去磁盘中读取该范围内的全部数据, 然后再进行二分查找即可找到结果, 或确定结果不存在。
稀疏索引极大地提高了查询性能, 然而有一种情况会造成查询性能骤降：当要查询的结果在 SSTable 中不存在时, 我们将不得不依次扫描完所有的 segment, 这是最差的一种情况。有一种称为布隆过滤器（bloom filter）的数据结构天然适合解决该问题。布隆过滤器是一种空间效率极高的算法, 能够快速地检测数据集中是否存在某条数据。我们只需要在写入每条数据之前先在布隆过滤器中登记一下, 在查询时即可判定某条数据是否存在。
布隆过滤器的内部依赖于哈希算法, 当检测某一条数据是否见过时, 有一定概率出现假阳性（False Positive）, 但一定不会出现假阴性（False Negative）。也就是说, 当布隆过滤器认为一条数据出现过, 那么该条数据很可能出现过; 但如果布隆过滤器认为一条数据没有出现过, 那么这条数据一定没出现过。这种特性刚好与此处的需求相契合, 即检验某条数据是否缺失。
== 文件合并（Compaction）
随着数据的不断积累, SSTable 将会产生越来越多的 segment, 导致查询时扫描文件的 IO 次数增多, 效率降低, 因此需要有一种机制来控制 segment 的数量。对此, LSM tree 会定期执行文件合并（compaction）操作, 将多个 segment 合并成一个较大的 segment, 随后将旧的 segment 清理掉。由于每个 segment 内部的数据是有序的, 合并过程类似于归并排序, 效率很高, 只需要 O(logn) 的时间复杂度。
#image("compaction.jpg")
在上图的示例中, segment1 和 segment2 中都存在 key 为 dog 的数据, 这时应该以最新的 segment 为准, 因此合并后的取值是 84 而不是 52, 这实现了类似于字典/HashMap 中覆盖写的语义。
== 删除数据
现在你已经了解了 LSM tree 的读写数据的方式, 那么如何删除数据呢? 如果是在内存中, 删除某块数据通常是将它的引用指向 NULL, 那么这块内存就会被回收。但现在的情况是, 数据已经存储在硬盘中, 要从一个 segment 文件中间抹除一段数据必须要覆写其之后的所有内容, 这个成本非常高。LSM tree 所采用的做法是设计一个特殊的标志位, 称为 tombstone（墓碑）, 删除一条数据就是把它的 value 值为墓碑, 如下图所示:
#image("delete.jpg")
这个例子展示了删除 segment2 中的 dog 之后的效果。注意, 此时 segment1 中仍然保留着 dog 的旧数据, 如果我们查询 dog, 那么应该返回空, 而不是 52。因此, 删除操作的本质是覆盖写, 而不是清除一条数据, 这一点乍一看不太符合常识。墓碑会在 compact 操作中被清理掉, 于是置为墓碑的数据在新的 segment 中将不复存在。
== LSM tree 和 B tree 的对比
主流的关系型数据库均以 B/B+ tree 作为其构建索引的数据结构, 这是因为 B tree 提供了理论上最高的查询效率 O(logn)。但对于查询性能的追求也造成了 B tree 的相应缺点, 即每次插入或删除一条数据时, 均需要更新索引, 从而造成一次磁盘 IO。这种特性决定了 B tree 只适用于频繁读, 少量写的场景。如果在频繁写的场景下, 将造成大量的磁盘 IO, 从而导致性能骤降。这种应用场景在传统的关系型数据库中比较常见。
而 LSM tree 则避免了频繁写场景下的磁盘 IO 开销, 尽管其查询效率无法达到理想的 O(logn), 但依然非常快, 可以接受。所以从本质上来说, LSM tree 相当于牺牲了一部分查询性能, 换取了可观的写入性能。这对于 key-value 型或日志型数据库是非常重要的。
|
|
https://github.com/SergeyGorchakov/russian-phd-thesis-template-typst | https://raw.githubusercontent.com/SergeyGorchakov/russian-phd-thesis-template-typst/main/lib.typ | typst | MIT License | #import "@preview/unify:0.5.0": *
#import "@preview/codly:0.2.0": *
#import "@preview/tablex:0.0.8": *
#import "@preview/physica:0.9.3": *
#import "@preview/indenta:0.0.3": fix-indent
#import "./glossarium.typ": *
// Счетчики
#let part_count = counter("parts")
#let total_part = context[#part_count.final().at(0)]
#let appendix_count = counter("appendix")
#let total_appendix = context[#appendix_count.final().at(0)]
#let total_page = context[#counter(page).final().at(0)]
#let total_fig = context[#counter(figure).final().at(0)]
#let total_table = context[#counter(figure.where(kind:table)).final().at(0)]
#let total_bib = context (query(selector(ref)).filter(it => it.element == none).map(it => it.target).dedup().len())
// Это входная точка - общий шаблон
#let template(
author-first-name: "<NAME>",
author-last-name: "Фамилия",
author-initials: "И.О.",
title: "Длинное-длинное название диссертации из достаточно большого количества сложных и непонятных слов",
udk: "xxx.xxx", // Диссертация, УДК
specialty-number: "XX.XX.XX",
specialty-title: "Название специальности",
degree: "кандидата физико-математических наук",
degree-short: "канд. физ.-мат. наук",
city: "Город",
year: datetime.today().year(),
organization: [Федеральное государственное автономное образовательное учреждение высшего образования "Длинное название образовательного учреждения \ "АББРЕВИАТУРА"],
in-organization: "учреждении с длинным длинным длинным длинным названием, в котором выполнялась данная диссертационная работа", // в предложном падеже
organization-short: "Сокращенное название организации",
supervisor-first-name: "<NAME>",
supervisor-last-name: "Фамилия",
supervisor-initials: "И.О.",
supervisor-regalia: "уч. степень, уч. звание",
supervisor-regalia-short: "уч. ст., уч. зв.",
font-type: "Times New Roman",
font-size: 14pt,
link-color: blue.darken(60%),
languages: (),
logo: "",
body,
) = {
// Определение новых переменных
let author-name = author-last-name+" "+author-first-name
let author-short = author-last-name+" "+author-initials
let supervisor-name = supervisor-last-name+" "+supervisor-first-name
let supervisor-short = supervisor-last-name+" "+supervisor-initials
// Установка свойств к PDF файлу
set document(author: author-name, title: title)
// Установки шрифта
set text(
font: font-type,
lang: "ru",
size: font-size,
fallback: true,
hyphenate: false,
)
// Установка свойств страницы
set page(
margin: (top:2cm, bottom:2cm, left:2.5cm, right:1cm), // размер полей (ГОСТ 7.0.11-2011, 5.3.7)
)
// Установка свойств параграфа
set par(
justify: true,
linebreaks: "optimized",
first-line-indent: 2.5em, // Абзацный отступ. Должен быть одинаковым по всему тексту и равен пяти знакам (ГОСТ Р 7.0.11-2011, 5.3.7).
leading: 1em, // Полуторный интервал (ГОСТ 7.0.11-2011, 5.3.6)
)
// форматирование заголовков
set heading(numbering: "1.", outlined: true, supplement: [Раздел])
show heading: it => {
set align(center)
set text(
font: font-type,
size: font-size,)
set block(above:3em,below:3em) // Заголовки отделяют от текста сверху и снизу тремя интервалами (ГОСТ Р 7.0.11-2011, 5.3.5)
if it.level == 1 {
pagebreak() // новая страница для разделов 1 уровня
counter(figure).update(0) // сброс значения счетчика рисунков
counter(math.equation).update(0) // сброс значения счетчика уравнений
}
else{
}
it
}
// Отображение ссылок на figure (рисунки и таблицы) - ничего не отображать
set ref(supplement: it => {
if it.func() == figure {}
})
// Настройка блоков кода
show: codly-init.with()
codly(languages: languages)
// Инициализация глоссария
show: make-glossary
show link: set text(fill: link-color)
// Нумерация уравнений
let eq_number(it) = {
let part_number = counter(heading.where(level:1)).get()
part_number
it
}
set math.equation(numbering: num =>
("("+(counter(heading.where(level:1)).get() + (num,)).map(str).join(".")+")"),
supplement: [Уравнение],)
// Настройка рисунков
show figure: align.with(center)
set figure(supplement: [Рисунок])
set figure.caption(separator: [ -- ])
set figure(numbering: num =>
((counter(heading.where(level:1)).get() + (num,)).map(str).join(".")),)
// Настройка таблиц
show figure.where(kind:table): set figure.caption(position: top)
show figure.where(kind:table): set figure(supplement: [Таблица])
show figure.where(kind:table): set figure(numbering: num =>
((counter(heading.where(level:1)).get() + (num,)).map(str).join(".")),)
// Разбивать таблицы по страницам
show figure: set block(breakable: true)
// Настройка списков
set enum(indent: 2.5em)
// Set that we're in the body
state("section").update("body")
// титульный лист
set align(center)
organization
v(2em)
table(
columns: (1fr,1fr),
stroke: none,
align: (left+bottom, right+bottom),
logo,
"На правах рукописи"
)
set text(size:16pt)
v(1em)
author-name // <NAME>
v(1em)
[*#title*] // Название работы
set text(size:font-size)
v(1em)
[Специальность #specialty-number -- ] // Номер специальности
v(0em)
specialty-title // Название специальности
v(1em)
"Диссертация на соискание учёной степени"
v(0em)
degree
v(5fr)
set align(right)
"Научный руководитель:"
v(0em)
supervisor-regalia
v(0em)
supervisor-name
v(0em)
set align(center)
[#city -- #year]
set align(left)
// конец титульной страницы
set page(
numbering: "1", // Установка сквозной нумерации страниц
number-align:center+top, // Нумерация страниц сверху, по центру
)
counter(page).update(1)
// Содержание
// #align(right)[Стр.]
outline(title: "Содержание", indent: 1.5em, depth: 3,)
body
}
// Нужно начать первый абзац в разделе с этой функции для отступа первой строки
#let ident-par(it) = par[#h(2.5em)#it]
// Set up the styling of the appendix.
#let phd-appendix(body) = {
// Reset the title numbering.
counter(heading).update(0)
// Number headings using letters.
show heading.where(level:1): set heading(numbering: "Приложение A. ", supplement: [Приложение])
show heading.where(level:2): set heading(numbering: "A.1 ", supplement: [Приложение])
// Set the numbering of the figures.
set figure(numbering: (x) => locate(loc => {
let idx = numbering("A", counter(heading).at(loc).first())
[#idx.#numbering("1", x)]
}))
// Additional heading styling to update sub-counters.
show heading: it => {
appendix_count.step() // Обновление счетчика приложений
counter(figure.where(kind: table)).update(0)
counter(figure.where(kind: image)).update(0)
counter(figure.where(kind: math.equation)).update(0)
counter(figure.where(kind: raw)).update(0)
it
}
// Set that we're in the annex
state("section").update("annex")
body
}
#let icon(image) = {
box(
height: .8em,
baseline: 0.05em,
image
)
h(0.1em)
}
|
https://github.com/0x1B05/algorithm-journey | https://raw.githubusercontent.com/0x1B05/algorithm-journey/main/practice/note/content/二叉树.typ | typst | #import "../template.typ": *
#pagebreak()
= 二叉树
二叉树结构：
```java
public static class Node{
public int value;
public Node left;
public Node right;
public Node(int data){
this.value = data;
}
}
```
== 二叉树的遍历
=== 递归序遍历：
```java
public static void f(Node head){
if(head == null){
return;
}
// 第一次进入
f(head.left)
// 左子树遍历结束第二次回到head
f(head.right)
// 右子树遍历结束第三次回到head
}
```
==== 举例
```mermaid
graph TD
1-->2
1-->3
2-->4
2-->5
3-->6
3-->7
```
节点遍历顺序：*1->2->4->4->4->2->5->5->5->2->1->3->6->6->6->3->7->7->7->3->1*
=== 先中后遍历
- 先序遍历：头节点->左子树->右子树
节点遍历顺序：1->2->4->5->3->6->7(与递归序关系：第一次碰到即打印)
- 中序遍历：左子树->头节点->右子树
节点遍历顺序：4->2->5->1->6->3->7(与递归序关系：第二次碰到即打印)
- 后序遍历：左子树->右子树->头节点
节点遍历顺序：4->5->2->6->7->3->1(与递归序关系：第三次碰到即打印)
==== 递归方式
```java
//先序：头左右
public static void preOrderRecur(Node head){
if(head == null){
return;
}
System.out.print(head.value+" ");
preOrderRecur(head.left);
preOrderRecur(head.right);
}
//中序：左头右
public static void inOrderRecur(Node head){
if(head == null){
return;
}
inOrderRecur(head.left);
System.out.print(head.value+" ");
inOrderRecur(head.right);
}
//后序
public static void posOrderRecur(Node head){
if(head == null){
return;
}
posOrderRecur(head.left);
posOrderRecur(head.right);
System.out.print(head.value+" ");
}
```
==== 非递归方式
===== 先序遍历
```java
// 1.准备一个栈, 放进头节点, 从栈中弹出一个节点cur
// 2.打印cur
// 3.先右再左节点压入栈(如果有)
// 4.重复上述过程至栈为空
public static void preOrderUnRecur(Node head){
System.out.print("pre-order:");
if(head != null){
Stack<Node> stack = new Stack<Node>();
stack.add(head);
while(!stack.isEmpty()){
head = stack.pop();
System.out.print(head.value+" ");
if(head.right != null){
stack.push(head.right);
}
if(head.left != null){
stack.push(head.left);
}
}
}
System.out.println();
}
```
===== 中序遍历
```java
//1.先是每棵子树的的整个左边界进栈
//2.然后依次弹出, 弹出并打印(已包括根节点)
//3.每弹出一个节点时要检查是否有右子树, 如果有
//4.右子树重复上述过程, 重复完继续弹出
public static void inOrderunRecur(Node head){
System.out.print("in-order");
if(head != null){
Stack<Node> stack = new Stack<Node>();
while(!stack.isEmpty() || head !=null){
//当head不为空时, 就将它的左子树放进栈中
if(head != null){
stack.push(head);
head = head.left;
//当head为空, stack不为空时, 弹出一个栈顶元素, 然后打印, 并看看他有没有右子树
}else{
head = stack.pop();
System.out.print(head.value+" ");
head = head.right;
}
}
}
System.out.println();
}
```
===== 后序遍历
```java
// 1.准备两个栈,先头节点压入第一个栈, 弹出到收集栈
// 2.然后先左后右节点压入栈
// 3.重复上述过程, 最后依次弹出收集栈的元素
public static void posOrderUnRecur(Node head){
System.out.print("pos-order");
if(head != null){
Stack<Node> s1 = new Stack<Node>();//第一个栈
Stack<Node> s2 = new Stack<Node>();//收集栈
s1.push(head);//第一个头节点进栈
while(!s1.isEmpty()){
head = s1.pop();//第一个栈的栈顶弹出
s2.push(head);//进入收集栈
//先左节点进栈
if(head.left != null){
s1.push(head.left);
}
//后右节点进栈
if(head.right != null){
s1.push(head.right);
}
}
//按顺序弹出收集栈栈顶节点
while(!s2.isEmpty()){
System.out.print(s2.pop().value+" ");
}
}
System.out.println();
}
```
=== 层次遍历(宽度优先遍历)
```java
//宽度优先遍历
public static void bfs(Node head){
if(head == null){
return;
}
Queue<Node> queue = new LinkerList<>();
queue.add(head);
while(!queue.isEmpty()){
Node cur = queue.poll();
System.out.println(cur.value);
if(cur.left != null){
queue.add(cur.left);
}
if(cur.right != null){
queue.add(cur.right);
}
}
}
```
== 二叉树经典题目
=== 求二叉树宽度
```java
public class GetMaxWidth {
public static int getMaxWidth1(Node root) {
if (root == null) {
return 0;
}
Queue<Node> queue = new LinkedList<Node>();
Node temp = root;
int maxWidth = Integer.MIN_VALUE;
queue.offer(temp);
while (!queue.isEmpty()) {
int levelSize = queue.size();
if (levelSize > maxWidth) {
maxWidth = levelSize;
}
for (int i = 0; i < levelSize; i++) {
temp = queue.poll();
if (temp.left != null) {
queue.offer(temp.left);
}
if (temp.right != null) {
queue.offer(temp.right);
}
}
}
return maxWidth;
}
// 左神的方法
// 使用hash表
public int maxWidth1(Node root) {
if (root == null)
return 0;
Queue<Node> queue = new LinkedList<>();
queue.add(root);
HashMap<Node, Integer> levelMap = new HashMap<>();// 记录节点属于第几行
levelMap.put(root, 1);
int curLevel = 1;// 当前所在行数
int curLevelNodes = 0;// 当前行数所有的节点个数
int max = 0;// 目前为止一行中最多节点的个数
while (!queue.isEmpty()) {
Node cur = queue.poll();// 队列中的第一个
int curNodeLevel = levelMap.get(cur);// 当前节点所在的行数
if (cur.left != null)// 如果左孩子存在
{
levelMap.put(cur, curNodeLevel + 1);// 写入hash表
queue.add(cur.left);// 入队
}
if (cur.right != null)// 同上
{
levelMap.put(cur, curNodeLevel + 1);
queue.add(cur.right);
}
if (curNodeLevel == curLevel)// 如果这个节点所在的行数和目前行数相同
curLevelNodes++;// 该行的节点数加一
else {// 不同
max = Math.max(max, curLevelNodes);// 比较这层的节点数是否是比之前最大的大
curLevel++;// 进入下一行
curLevelNodes = 1;// 下一行有一个节点
}
}
// 指针为空时退出,所以其实最后一行还没比较
max = Math.max(max, curLevelNodes);
return max;
}
// 不使用hash表
public int maxWidth2(Node root) {
if (root == null)
return 0;
Queue<Node> queue = new LinkedList<>();
queue.add(root);
int curLevelNodes = 0;// 当前行数所有的节点个数
int max = 0;// 目前为止一行中最多节点的个数
Node levelEnd = root;
Node nextEnd = null;
while (!queue.isEmpty()) {
Node cur = queue.poll();
curLevelNodes++;
if (cur.left != null)// 如果左孩子存在
{
queue.add(cur.left);// 入队
nextEnd = cur.left;
}
if (cur.right != null)// 同上
{
queue.add(cur.right);
nextEnd = cur.right;
}
if (cur == levelEnd) {
levelEnd = nextEnd;
max = Math.max(max, curLevelNodes);
curLevelNodes = 0;
}
}
return max;
}
}
```
=== 判断一棵树是否是搜索二叉树
搜索二叉树：每棵子树的左树都比头节点小, 右树都比头节点大
```java
public static int minValue = Integer.MIN_VALUE;
// 用中序遍历判断, 如果是一直升序的则为搜索二叉树, 中间有一段不是升序的话, 则不是搜索二叉树
public static boolean isBST1(Node root) {
if (root == null) {
return true;
}
// 左树递归检查是否符合中序遍历从小到大排列
boolean isLeftBst = isBST1(root.left);
// 如果左树不符合返回false
if (!isLeftBst) {
return false;
}
// 如果不符合升序返回false
if (root.value <= minValue) {
return false;
} else {
// 更新minValue
minValue = root.value;
}
// 检查右树是否符合升序中序遍历, 如果右树也符合, 则是搜索二叉树
return isBST1(root.right);
}
// 迭代同理只需将打印部分换成判断部分即可
public static boolean isBST2(Node root) {
Stack<Node> stack = new Stack<Node>();
Node temp = root;
while (temp != null || !stack.empty()) { // 加入temp!=null是为了让起初栈空时也进入循环
while (temp != null) {
stack.push(temp);
temp = temp.left;
}
temp = stack.pop();
// 如果不符合升序返回false
if (root.value <= minValue) {
return false;
} else {// 更新minValue
minValue = root.value;
}
temp = temp.right;
}
return true;
}
```
=== 判断一棵树是否是完全二叉树
完全二叉树：从左到右依次遍满, 可以只有左节点, 不能只有右节点而没有左节点
```java
public class IsCBT {
//1.任意节点有右无左, 返回false
//2.在1情况不违反的情况下, 如果遇到了第一个左右孩子不全的节点,
public static boolean isCBT(Node head){
if(head == null){
return true;
}
LinkedList<Node> queue = new LinkedList<>();
boolean leaf = false;//是否遇到左右孩子节点不双全的节点
Node l = null;
Node r = null;
queue.add(head);
while(!queue.isEmpty()) {
head = queue.poll();
l = head.left;
r = head.right;
//遇到左右孩子不全的节点后还遇到左右孩子不全的节点（不是叶子节点）, 或者遇到有右子树无左子树, 都返回false
if ((leaf && (l != null || r != null)) ||
(l == null && r != null))
return false;
if (l != null) {
queue.add(l);
}
if (r != null) {
queue.add(r);
}
if (l == null || r == null) {
leaf = true;
}
}
return true;
}
}
```
=== 判断一棵树是否是满二叉树
满二叉树：每层节点数达最大值
```java
public class IsFull {
public static boolean isFull1(Node root) {
int height = findHeight(root);
int nodes = findNodes(root);
return (1 << height - 1) == nodes;
}
public static int findHeight(Node root) {
if (root == null) {
return 0;
}
return Math.max(findHeight(root.left), findHeight(root.right)) + 1;
}
public static int findNodes(Node root) {
if (root == null) {
return 0;
}
return findNodes(root.left) + findNodes(root.right) + 1;
}
}
```
=== 判断一棵树是否是平衡二叉树
平衡二叉树：对于任何一棵子树, 左树和右树高度差不超过 1
```java
public boolean isBalanced1(Node root) {
if (root == null) {
return true;
}
return isBalanced1(root.left) && isBalanced1(root.right) &&
Math.abs(findHeight(root.left) - findHeight(root.right)) <= 1;
}
public static int findHeight(Node root) {
if (root == null) {
return 0;
}
return Math.max(findHeight(root.left), findHeight(root.right)) + 1;
}
```
=== 找两棵二叉树的最低公共祖先节点
最近公共祖先节点即两个节点向上走最先相遇的节点
```java
//给定两个二叉树的节点, 找他们最低的公共祖先节点
public class LowestCommonAncestor {
//简单的方法：用哈希表来存父节点信息, 然后查重
public static Node lowestCommonAncestor1(Node head, Node o1, Node o2){
HashMap<Node,Node> fatherMap = new HashMap<>();
fatherMap.put(head,head);
//存储父亲节点信息
fillMap(head,fatherMap);
HashSet<Node> set1 = new HashSet<>();
//先将o1节点的所有祖先节点信息存进set里
Node cur = o1;
//只有头节点会等于自己的父亲, 所有可以作为节点向上寻找祖先的条件
while(cur != fatherMap.get(cur)){
set1.add(cur);
cur = fatherMap.get(cur);
}
//最后将头节点放进set
set1.add(head);
//然后开始检查o2节点的祖先中和o1相同的祖先节点
cur = o2;
while(cur != fatherMap.get(cur)){
cur = fatherMap.get(cur);
if(set1.contains(cur)){
return cur;
}
}
return null;
}
//存储每个节点的父亲信息
public static void fillMap(Node head, HashMap<Node,Node> fatherMap){
if(head == null){
return;
}
fatherMap.put(head.left,head);
fatherMap.put(head.right,head);
fillMap(head.left,fatherMap);
fillMap(head.right,fatherMap);
}
//精简高阶版：
public static Node lowestCommonAncestor2(Node root, Node o1, Node o2) {
if (root == null || root == o1 || root == o2) {
return root;
}
Node retLeft = lowestCommonAncestor1(root.left, o1, o2);
Node retRight = lowestCommonAncestor1(root.right, o1, o2);
// 左右都不空, 则返回当前节点(即为最近公共祖先节点)
// 左右有且仅有一个不空, 则返回不空的
// 左右均空, 则返回空
return retLeft == null ? retRight : (retRight == null ? retLeft : root);
}
}
```
=== 找中序遍历中二叉树的某个节点的后继节点
在二叉树的中序遍历的序列中, node 的下一个节点叫做 node 的后继节点
```java
//只给一个在二叉树中的某个节点node, 请实现返回node的后继节点的函数
public class GetSuccessorNode {
// 现在有一种新的二叉树节点类型
public class NewNode {
public int value;
public NewNode left;
public NewNode right;
public NewNode parent;// 包含父亲节点
public NewNode(int value) {
this.value = value;
}
}
// 中序遍历顺序的下一个节点
//分两种情况来找x的后继节点
//1.x有右树时, 后继节点为右树上最左的节点
//2.x无右树时, 向上找, 找到一个父亲的左树是x时, 该父亲就是x的后继, 因为x是父亲左子树数中的最右节点
public static NewNode getSuccessNode(NewNode cur){
if (cur.right != null) {
NewNode temp = cur.right;
while (temp.left!=null) {
temp = temp.left;
}
return temp;
}else{// 没有右树向上找
NewNode parent = cur.parent;
//父亲不为空并且该节点不是父节点的左节点时, 一直向上找
while(parent!=null&&parent.left != cur){
cur = parent;
parent = cur.parent;
}
//父亲不为空并且该节点不是父节点的左节点时, 一直向上找
return parent;
}
}
}
```
=== 二叉树的序列化和反序列化
```java
//二叉树的序列化和反序列化
//序列化和反序列化：内存里的一棵树如何变成字符串形式, 又如何从字符串变成内存里的树的结构
public class SerialByPre {
public static class Node {
public int value;
public Node left;
public Node right;
public Node(int data) {
this.value = data;
}
}
//序列化
public static String serialByPre(Node head){
if(head == null){
return "#_";
}
String res = head.value + "_";
res += serialByPre(head.left);
res += serialByPre(head.right);
return res;
}
//反序列化
public static Node reconPreString(String preStr){
//分割字符串
String[] values = preStr.split("_");
Queue<String> queue = new LinkedList<>();
for(int i = 0; i != values.length; i++){
queue.add(values[i]);
}
return reconPreOrder(queue);
}
public static Node reconPreOrder(Queue<String> queue){
String value = queue.poll();
if(value.equals("#")){
return null;
}
Node head = new Node(Integer.valueOf(value));
head.left = reconPreOrder(queue);
head.right = reconPreOrder(queue);
return head;
}
}
```
=== 折纸问题
请把一段纸条竖着放在桌子上, 然后从纸条的下边向上方对折 1 次,
压出折痕后展开。此时 折痕是凹下去的,
即折痕突起的方向指向纸条的背面。如果从纸条的下边向上方连续对折 2 次,
压出折痕后展开, 此时有三条折痕, 从上到下依次是下折痕、下折痕和上折痕。
给定一个输入参数 N, 代表纸条都从下边向上方连续对折 N 次,
请从上到下打印所有折痕的方向 例如：N=1 时, 打印： down；N=2 时, 打印： down down
up
== 树形 DP 套路
=== 使用前提:
如果题目求解目标是 S 规则,则求解流程可以定成每一个节点尾头节点的子树在 S
规则下的每一个答案,并且最终答案一定在其中.
=== 套路
分析可能性->汇总需要左右孩子提供哪些信息, 构造 `ReturnType`->构造递归函数
1. 以某个节点 x 为头节点的字数中,分析答案的可能性,并且分析是以 x 的左子树,x
的右子树和 x 整棵树的角度来考虑可能性(经验性,可以拿 x 是否参与来考虑可能性)
2. 根据第一步的可能性分析,列出所有需要的信息
3. 合并第二步的信息,对左树和右树提出同样的要求,并写出信息结构
4. 涉及递归函数,递归函数是处理以 x 为头节点的情况下的答案.(包括涉及递归的 base
case,默认直接得到左树和右树的所有信息,以及把可能性做整合,并且要返回第三步的信息信息结构这四个小步骤)
==== 递归函数三步
1. base case 递归出口
2. 将左右孩子的返回方法当作黑盒直接使用
3. 实现信息具体实现逻辑
=== 判断搜索二叉树
```java
public static boolean isBST3(Node root) {
return process(root).isBST;
}
static class ReturnType {
int max;
int min;
boolean isBST;
public ReturnType(int max, int min, boolean isBST) {
this.max = max;
this.min = min;
this.isBST = isBST;
}
}
public static ReturnType process(Node root) {
// base case
if (root == null) {
return null;
}
ReturnType left = process(root.left);
ReturnType right = process(root.right);
int min = root.value;
int max = root.value;
if (left != null) {
min = Math.min(min, left.min);
max = Math.max(max, left.min);
}
if (right != null) {
min = Math.min(min, right.min);
max = Math.max(max, right.min);
}
boolean isBST = (left == null || (left.isBST && left.max < root.value))
&& (right == null || (right.isBST && right.min > root.value));
return new ReturnType(max, min, isBST);
}
```
=== 判断平衡二叉树
```java
//1.先分析可能性
//左树平衡+右树平衡+|左子树高度-右子树高度|≤1时, 整棵树平衡
//2.提取条件
//每棵子树的返回类型需要包含的属性：
//①该子树是否平衡（boolean）
//②该子树的高度（int）
//3.coding
public static boolean isBalanced2(Node head){
return process(head).isBalanced;
}
public static class ReturnType{
public boolean isBalanced;
public int height;
public ReturnType(boolean isB, int hei){
this.isBalanced = isB;
this.height = hei;
}
}
public static ReturnType process(Node x){
if(x == null){
return new ReturnType(true,0);
}
//左、右子树的数据
ReturnType leftData = process(x.left);
ReturnType rightData = process(x.right);
//高度
int height = Math.max(leftData.height, rightData.height)+1;
//是否平衡
boolean isBalanced = leftData.isBalanced && rightData.isBalanced
&& Math.abs(leftData.height - rightData.height) < 2;
//返回数据
return new ReturnType(isBalanced,height);
}
```
=== 判断满二叉树
```java
//1.先分析可能性
//左树满+右树满+（左树节点数 = 2^（左子树高度）-1）+（右树节点数 = 2^（右子树高度）-1）时, 整棵树满
//2.提取条件
//每棵子树的返回类型需要包含的属性：
//①该子树的节点数（int）
//②该子树的高度（int）
//3.coding
public static class Info{
public int height;
public int nodes;
public Info(int height, int nodes){
this.height = height;
this.nodes = nodes;
}
}
public static Info process(Node head){
if(head == null){
return new Info(0,0);
}
Info leftData = process(head.left);
Info rightData = process(head.right);
int height = Math.max(leftData.height, rightData.height) + 1;
int nodes = leftData.nodes + rightData.nodes + 1;
return new Info(height,nodes);
}
public static boolean isFull2(Node head){
if(head == null){
return true;
}
Info data = isF(head);
return data.nodes == (1 << data.height - 1);
}
```
=== 二叉树节点间的最大距离
从二叉树的节点 a 出发,可以向上或者向下走,但沿途的节点只能经过一次,到达节点 b
时路径上的节点个数叫作 a 到 b
的距离,那么二叉树任何两个节点之间都有距离,求整棵树上的最大距离.
分析:
1. x 不参与
1. 左最大距离
2. 右最大距离
2. x 参与:左高+右高+1
=== 派对的最大快乐值
整个公司的人员结构可以看作是一棵标准的多叉树。树的头节点是公司唯一的老板,
除老板外, 每个员工都有唯一的直接上级, 叶节点是没有任何下属的基层员工,
除基层员工外, 每个员工都有一个或多个直接下级, 另外每个员工都有一个快乐值。
这个公司现在要办 party, 你可以决定哪些员工来,
哪些员工不来。但是要遵循如下的原则： 1.如果某个员工来了,
那么这个员工的所有直接下级都不能来。
2.派对的整体快乐值是所有到场员工快乐值的累加。
3.你的目标是让派对的整体快乐值尽量大。 给定一棵多叉树, 请输出派对的最大快乐值。
|
|
https://github.com/Personal-Data-Acquisition/PDA_paperwork | https://raw.githubusercontent.com/Personal-Data-Acquisition/PDA_paperwork/main/PRD/prd.typ | typst | = Product Requirements Document(PRD)
#strong[Authors:] <NAME>, <NAME>, <NAME>, <NAME>
#strong[DATE:] 2023-11-23
== Problem Description
Existing personal data acquisition devices are either too expensive or
too DIY for most potential users. Many are designed for aerospace,
automotive or research purposes, and are too expensive and unnecessarily
complicated for casual users. The only other option is for users to
build their own devices from prefabricated parts, which is too
complicated and requires too much much prerequisite knowledge for most
potential users.
=== Scope
The scope of this project is to develop a prototype for a personal data
acquisition device. This prototype will have the ability to collect real
time data from a variety of sensors, including accelerometers,
gyroscopes, GPS modules, and thermometers. These components will need to
combined in a printed circuit board for the final prototype. The scope
of this project also includes development of a web-based UI that both
presents the data gathered by the prototype and sends commands to the
physical device to record data and configure sensors.
=== Use Cases
The user will take the product along with them on an outdoor activity
and subject it to normal conditions for that activity.
The user will connect the product to a phone or laptop they brought with
them, and view the data stream and take samples using the user
interface, and save the data locally.
The user will choose and connect selected modules to the system using
the CAN(controller area network) bus.
== Purpose and Vision(Background)
Our purpose is to develop a personal data acquisition system that
records all the data a user might want, and is cheap and easy to set up
and use. It should be able to record data on acceleration, force,
position, etc. require minimal setup, and can be hooked up to bike,
go-kart, etc.
== Stakeholders
#strong[Capstone Team] \
The capstone team are the main decision makers for the project, and will
need extensive information for the product’s requirements and
implementation details. They will also need oversight from the project
partner and TA.
#strong[Project Partner] \
The project partner will be working very closely with the capstone team,
and will need to know the teams capabilities and status, and the status
of the project.
#strong[Project TA] \
The TA needs to be informed on project progress and any issues the team
may be having.
#strong[Capstone Instructors] \
The instructors require much of the same information as the TA, but
because they are working less closely with the team there is less
urgency.
#strong[Users] \
Users will need to know the product’s capabilities, limitations and
intended use.
== Preliminary Context
=== Assumptions
- We have a suitable power supply of 12v to power the system.
- The end user has a device capable of connecting to an ad-hoc network.
- The data to be logged doesn’t require more speed than the CAN 2.0
standard.
- The environment it’s meant to be used in is electrically noisy.
=== Constraints
- As undergraduate students, our team has limited experience in the
field, so we will have to learn a lot to deliver the product.
- Our budget is limited, so we will have to choose components carefully
based on price.
- We are limited to three terms to deliver our product.
With these constraints factored, the biggest concerns for the
feasibility of our project are the skills that need to be learned and
limited time alloted to do so and complete the project. As an example,
the team has primarily non-formal experience in hardware organization
but has thus far worked efficiently in that aspect of the project. These
risks are mitigated by the expertise and technical support offered by
our project partner, and we consequently find the scope of our project
realistic.
=== Dependencies
- The rust language, (reduces bugs and helps with memory safety.)
- C compiler(s), (C ABI is still used as a way to interface with libs.)
- Rust Embassy Library. (Embedded rust lib to reduce boilerplate)
- Rust Rocket(web server)
- STM SDK and HAL (Good refences for the actual hardware.)
- The CAN standard.
- The Unix networking stack
- SQLite and or rust file I/O
- Rust Libraries available for individual sensor modules.
Some possible bottlenecks that could occur given our current
dependencies would be centered around sensor modules not having an
existing library written in rust. This would add more development time
to the project.
However, we’ve researched workarounds and discovered tools to generate
the needed interfaces for rust from a C header file.
== Market Assessment and Competition Analysis
#strong[RexGen:] Proprietary CAN bus based data logger, hard to find
tutorial or documentation and is prohibitively expensive for hobbyists.
Also unable to guarantee that their system is memory safe.
#strong[CANedge1:] CANedge1: It has open source elements to it and
documentation that is accessible, but still does not meet the
requirements for its cost.
DEWEsoft sells test and measurement equipment. Their products are not a
good fit for our users because they are designed for industry, and
therefore overkill and are prohibitively expensive for an individual.
Omega Engineering sells data loggers that can record the data our users
would want, can connect to a remote device over Bluetooth and have easy
to use interfaces. However most of their data loggers only record one or
two types of data, so a user would need to buy many of them, which would
be inconvenient and expensive.
An Apple Watch can track a user’s activity data, and send it to an
iPhone with an easy to read interface. However, the Apple Watch is
limited in what kind of data it can record, and would not be appropriate
for our users due to its many other unneeded functions.
There are guides on the internet that instruct a user on how to build
their own data acquisition device using Arduino or Raspberry Pi
microcontroller much more inexpensively than the other alternatives.
However, this requires the user to have background knowledge in
circuitry and programming, and requires a lot of time and effort to set
up.
== Target Demographics (User Persona)
Terry is an amateur Go-kart enthusiast who was brought into the hobby 8
months ago by friends and has become entrenched in the hobby since then.
They are looking for a way to improve their performance but need more
information about their current racing habits to do that.
Alice is a CTO of a large company that has decided to data log the
forces and location their products experience during shipping through
multiple contracted pilots and routes. She needs a system that isn’t
cost prohibitive to deploy in large numbers and can be customized for
her company’s other projects as needed.
John is an extreme snowboarder looking to collect data from his downhill
tricks in order to help his friend create realistic and smooth
animations for a snowboarding video game. He needs a data logging system
that can endure cold environments and is modular so he can keep down the
bulk/weight of the system while carving toeside and hitting some sweet
jumps.
James is a competition mountain biker who wants to record and analyze
data during rides for performance improvement. Uses a smartphone and
needs an easy-to-use interface. He needs a system to compare data
between runs.
== Requirements
=== User Stories and Features (Functional Requirements)
#figure(
align(center)[#table(
columns: 5,
align: (col, row) => (auto,auto,auto,auto,auto,).at(col),
inset: 6pt,
[User Story], [Feature], [Priority], [GitHub Issue], [Dependencies],
[As a mountain biker, I want to be able to view my instantaneous speed
at any point in my journey.],
[Gps],
[Must Have],
[TBD],
[Common firmware.],
[As a motorsport hobbyist, I want to be able to record the g-forces I
experience while going around tight corners.],
[Accelerometer.],
[Must Have],
[TBD],
[Common firmware.],
[As a winter sports enthusiast, I want to be able to track the turning
speed of my snowboard.],
[Yaw rate sensor.],
[Must Have],
[TBD],
[Common firmware.],
)]
)
=== Non-Functional Requirements
- Delay on data transmission should be at an acceptable level
- Code should be well documented, following coding standards and best
practices
- User interface should intuitive and fast to use
- The product should use security best practices whenever possible
=== Data requirements
- Analog data will be converted to digital.
- Sensor data must be reliable, resistant to EMI
- Sensor modules must adhere to the CAN protocol.
=== Integration requirements
- All interfaces will be rust doc documented.
- Tests will ensure API usage integrity.
- All modules that are to use the interface must pass integration tests.
=== User interaction and design
- Use a web server to interface with the user
- Can display live data, configure sensors, and download data
- Build using EGUI and Rust Rocket
- Should focus on ease of use for less experienced users
- Should be able to clearly provide all data and provide configurability
#box(width: 300.0pt, image("mockup.jpg"))
\
#emph[UI Mockup from project partner]
=== User Documentation
The user documentation will be produced in markdown or LaTeX into a PDF
or webpage. This documentation will cover the basic usage of the system
and instructions on how to build it.
=== Testing and Quality Assurance
Testing will be done through TDD(test driven development) using the
supported testing frameworks for rust and C. These tests will allow us
as developers to ensure the assumptions we make about our code matches
the actual behavior of it.
Quality assurance will mostly be handled by adhearance to style
standards enforced by the lanuages LSP(language server protocol)
servers. The two that will see extensive use in this project being:
+ Rust-analyzer
+ clangd
Bug and issue tracking will all be handled by GitHub’s Issue and project
system. This also serves as a way to allow public contributions in the
future to the code base.
== Milestones and Timeline
#figure(
align(center)[#table(
columns: 3,
align: (col, row) => (auto,auto,auto,).at(col),
inset: 6pt,
[Item], [Description], [Duration],
[Schematics],
[The wiring schematics],
[2 months],
[PCB],
[PCB gerber files],
[1 month],
[uC],
[Firmware for STM],
[],
[Sensor FW],
[Sensor module firmware],
[],
[UI],
[Web user interface],
[],
[Server],
[The back end web server],
[],
)]
)
== Open questions
Currently, there are no open questions in the project.
== Out of scope
- Support for more than the listed sensors.
- HAL development
- Radiation Hardening
- Full EMI sheilding
- Full support for 10 channels saturated with sensor data at 5kHz
- Water resistance at any depth or submersion
- Documentation beyond rustdocs/doxygen and markdown/latex.
- Wireless connectivity beyond ad-hoc wifi.
|
|
https://github.com/typst/templates | https://raw.githubusercontent.com/typst/templates/main/README.md | markdown | MIT No Attribution | Here, you can find the templates that are directly maintained by the Typst team.
If you want to submit your own template, go to https://github.com/typst/packages
and submit them there.
|
https://github.com/grnin/Zusammenfassungen | https://raw.githubusercontent.com/grnin/Zusammenfassungen/main/README.md | markdown | # Zusammenfassungen BSc Informatik an der OST
## Einrichtung
Bitte versichere dich, dass du die nötigen Schriften installiert hast:
- [JetBrains Mono](https://www.jetbrains.com/de-de/lp/mono/)
- Calibri (Linux & MacOS-User können den Calibri-Klon [Carlito](https://fonts.google.com/specimen/Carlito) verwenden)
Die Zusammenfassungen von den Semestern 1-3 wurden mit Word erstellt, die restlichen mit Typst.
Du kannst Typst entweder über Online via [typst.app](https://typst.app/) verwenden oder lokal mit Plugins im Visual Studio Code
(z.B. [Typst LSP](https://marketplace.visualstudio.com/items?itemName=nvarner.typst-lsp) oder [Tinymist](https://marketplace.visualstudio.com/items?itemName=myriad-dreamin.tinymist)).
Solltest du die Web App verwenden, musst du die oben genannten Schriftarten aus `C:\Windows\Fonts` in dein Typst Projekt hochladen.
Diese werden dann automatisch gefunden.
## Zusammenfassungen
Dieses Repo beinhaltet Zusammenfassungen für folgende Fächer:
- [AIFo / AI Foundations](AIFo)
- [AIAp / AI Applications](AIAp)
- [AlgDat / Algorithmen und Datenstrukturen](AlgDat)
- [AutoSpr / Automaten und Sprachen](AutoSpr)
- [Bsys1 / Betriebssysteme 1](Bsys1)
- [Bsys2 / Betriebssysteme 2](Bsys2)
- [CN1 / Computernetze 1](CN1)
- [CySec / Cyber Security Foundations](CySec)
- [Dbs1 / Datenbanksysteme 1](DBS1)
- [DigCod / Digitale Codierungen](DigCod)
- [DMI / Diskrete Mathematik für Informatik](DMI)
- [OOP1 / Objektorientierte Programmierung 1](OOP1)
- [OOP2 / Objektorientierte Programmierung 2](OOP2)
- [ParProg / Parallele Programmierung](ParProg)
|
|
https://github.com/typst/packages | https://raw.githubusercontent.com/typst/packages/main/packages/preview/tgm-hit-thesis/0.1.1/template/lib.typ | typst | Apache License 2.0 | #import "@preview/tgm-hit-thesis:0.1.1": *
#import "assets.typ"
|
https://github.com/Trebor-Huang/HomotopyHistory | https://raw.githubusercontent.com/Trebor-Huang/HomotopyHistory/main/frontpage.typ | typst | #import "common.typ": *
#[
#set text(36pt)
*同伦论简史*\
#set text(18pt) // Avoid using more fonts
$sans("A Brief History of Homotopy Theory")$
]
#place(bottom + center, dy: 1cm)[
#import cetz.draw: *
#set text(18pt)
#let ang(i) = 10deg - calc.cos(i*90deg) * 3deg
#cetz.canvas(length: 0.9cm,{
circle((0,0), radius: 1.5, fill: black)
content((0,0), text(32pt, fill: white, $K upright(O)$))
content((0deg,5), $upright(O)$)
content((45deg,5), $upright(O)\/upright(U)$)
content((90deg,5), $upright(U)\/"Sp"$)
content((135deg,5), $ZZ times B"Sp"$)
content((180deg,5), $"Sp"$)
content((-135deg,5), $"Sp"\/upright(U)$)
content((-90deg,5), $upright(U)\/upright(O)$)
content((-45deg,5), $ZZ times B upright(O)$)
set-style(mark: (end: ">", fill: black))
for i in range(8) {
arc((0,0), start:ang(i) + 45deg * i, stop: 45deg - ang(i+1) + 45deg * i, radius: 5, anchor: "origin")
content(((ang(i) - ang(i+1))/2 + 45deg * i + 22.5deg, 5.6), text(16pt, $Omega$))
}
circle((8.5,-5.5), radius: 1, fill: black)
content((8.5,-5.5), text(32pt, fill: white, $SS$))
content((8.5, -3.5), $0$)
content((8.5, 0), $ZZ$)
content((8.5, 3.5), $ZZ \/ 2 ZZ$)
content((8.5, 7), $ZZ \/ 2 ZZ$)
content((8.5, 10.5), $ZZ \/ 24 ZZ$)
content((8.5, 14), $0$)
content((8.5, 16.5), $dots.v$)
})
]
// Possibly add some deep words at the next page
|
|
https://github.com/vEnhance/1802 | https://raw.githubusercontent.com/vEnhance/1802/main/src/crossprod.typ | typst | MIT License | #import "@local/evan:1.0.0":*
= The cross product
The cross product is the last major linear algebra tool we'll need to introduce
(together with determinants and the dot product).
Like the dot product, the cross product also has two definitions, one algebraic and one geometric.
== [TEXT] The two definitions of the cross product
== [SIDENOTE] The cross product sucks
Compared to dot products and determinants,
the cross product might feel the most unnatural, for good reason ---
it's used much less frequently by serious mathematicians than the other tools you see.
#figure(
image("media/cross-products.jpg", width: 80%),
caption: [How to think of cross products.],
)
The reason that the cross product isn't popular with mathematicians is
the definition of the cross product is *really quite brittle*.
For example, the cross product can't be defined for any number of dimensions,#footnote[Just kidding,
apparently there's a
#link("https://w.wiki/BVNL")[seven dimensional cross product]?
Today I learned.
Except that there are apparently $480$ different ways to define it in seven dimensions,
so, like, probably not a great thing.]
and you have to remember this weird right-hand rule that adds one more arbitrary convention.
So the definition is pretty unsatisfying.
To replace the cross product, mathematicians use a different
kind of object called a _bivector_, an element of a space called $and.big^2 (RR^n)$.
(They might even claim that bivectors do everything cross products can do, but better.)
Again, this new kind of object is well beyond the scope of 18.02
but it's documented in Chapter 12 of my #link("https://web.evanchen.cc/napkin.html")[Napkin]
if you do want to see it.
I'll give you a bit of a teaser though.
In general, for any $n$, bivectors in $RR^n$ are specified by $(n(n-1))/2$ coordinates.
So for $n=3$ you _could_ translate every bivector in $RR^3$ into a vector in $RR^3$
by just reading the coordinates (although you end up with the right-hand rule
as an artifact of the translation), and the cross product is exactly what you get.
But for $n=4$, a bivector in $RR^4$ has six numbers,
which is too much information to store in a vector in $RR^4$.
Similarly, for $n > 4$, this translation can't be done.
That's why the cross product is so brittle and can't work past $RR^3$.
== [RECAP] Recap of vector stuff up to here
|
https://github.com/typst-jp/typst-jp.github.io | https://raw.githubusercontent.com/typst-jp/typst-jp.github.io/main/docs/changelog/0.11.0.md | markdown | Apache License 2.0 | ---
title: 0.11.0
description: Changes in Typst 0.11.0
---
# Version 0.11.0 (March 15, 2024)
## Tables
- Tables are now _much_ more flexible, read the new
[table guide]($guides/table-guide) to get started
- Added [`table.cell`] element for per-cell configuration
- Cells can now span multiple [columns]($table.cell.colspan) or
[rows]($table.cell.rowspan)
- The [stroke]($table.cell.stroke) of individual cells can now be customized
- The [`align`]($table.align) and [`inset`]($table.inset) arguments of the table
function now also take `{(x, y) => ..}` functions
- Added [`table.hline`] and [`table.vline`] for convenient line customization
- Added [`table.header`] element for table headers that repeat on every page
- Added [`table.footer`] element for table footers that repeat on every page
- All the new table functionality is also available for [grids]($grid)
- Fixed gutter-related bugs
_Thanks to [@PgBiel](https://github.com/PgBiel) for his work on tables!_
## Templates
- You can now use template packages to get started with new projects. Click
_Start from template_ on the web app's dashboard and choose your preferred
template or run the `typst init <template>` command in the CLI. You can
[browse the available templates here]($universe/search/?kind=templates).
- Switching templates after the fact has become easier. You can just import a
styling function from a different template package.
- Package authors can now submit their own templates to the
[package repository](https://github.com/typst/packages). Share a template
for a paper, your institution, or an original work to help the community get
a head start on their projects.
- Templates and packages are now organized by category and discipline. Filter
packages by either taxonomy in the _Start from template_ wizard. If you are a
package author, take a look at the new documentation for
[categories](https://github.com/typst/packages/blob/main/CATEGORIES.md) and
[disciplines](https://github.com/typst/packages/blob/main/DISCIPLINES.md).
## Context
- Added _context expressions:_ Read the chapter on [context] to get started
- With context, you can access settable properties, e.g. `{context text.lang}`
to access the language set via `{set text(lang: "..")}`
- The following existing functions have been made contextual: [`query`],
[`locate`], [`measure`], [`counter.display`], [`counter.at`],
[`counter.final`], [`state.at`], and [`state.final`]
- Added contextual methods [`counter.get`] and [`state.get`] to retrieve the
value of a counter or state in the current context
- Added contextual function [`here`] to retrieve the [location] of the current
context
- The [`locate`] function now returns the location of a selector's unique match.
Its old behavior has been replaced by context expressions and only remains
temporarily available for compatibility.
- The [`counter.at`] and [`state.at`] methods are now more flexible: They
directly accept any kind of [locatable]($location/#locatable) selector with a
unique match (e.g. a label) instead of just locations
- When context is available, [`counter.display`] now directly returns the result
of applying the numbering instead of yielding opaque content. It should not be
used anymore without context. (Deprecation planned)
- The [`state.display`] function should not be used anymore, use [`state.get`]
instead (Deprecation planned)
- The `location` argument of [`query`], [`counter.final`], and [`state.final`]
should not be used anymore (Deprecation planned)
- The [`styles`]($measure.styles) argument of the `measure` function should not
be used anymore (Deprecation planned)
- The [`style`] function should not be used anymore, use context instead
(Deprecation planned)
- The correct context is now also provided in various other places where it is
available, e.g. in show rules, layout callbacks, and numbering functions in
the outline
## Styling
- Fixed priority of multiple [show-set rules]($styling/#show-rules): They now
apply in the same order as normal set rules would
- Show-set rules on the same element (e.g. `{show heading.where(level: 1): set
heading(numbering: "1.")}`) now work properly
- Setting properties on an element within a transformational show rule (e.g.
`{show heading: it => { set heading(..); it }}`) is **not** supported anymore
(previously it also only worked sometimes); use show-set rules instead
**(Breaking change)**
- Text show rules that match their own output now work properly (e.g.
`` {show "cmd": `cmd`} ``)
- The elements passed to show rules and returned by queries now contain all
fields of their respective element functions rather than just specific ones
- All settable properties can now be used in [where]($function.where) selectors
- [And]($selector.and) and [or]($selector.or) selectors can now be used with
show rules
- Errors within show rules and context expressions are now ignored in all but
the last introspection iteration, in line with the behavior of the old
[`locate`]
- Fixed a bug where document set rules were allowed after content
## Layout
- Added `reflow` argument to [`rotate`]($rotate) and [`scale`]($scale) which
lets them affect the layout
- Fixed a bug where [floating placement]($place.float) or
[floating figures]($figure.placement) could end up out of order
- Fixed overlap of text and figure for full-page floating figures
- Fixed various cases where the [`hide`] function didn't hide its contents
properly
- Fixed usage of [`h`] and [`v`] in [stacks]($stack)
- Invisible content like a counter update will no longer force a visible block
for just itself
- Fixed a bug with horizontal spacing followed by invisible content (like a
counter update) directly at the start of a paragraph
## Text
- Added [`stroke`]($text.stroke) property for text
- Added basic i18n for Serbian and Catalan
- Added support for contemporary Japanese [numbering] method
- Added patches for various wrong metadata in specific fonts
- The [text direction]($text.dir) can now be overridden within a paragraph
- Fixed Danish [smart quotes]($smartquote)
- Fixed font fallback next to a line break
- Fixed width adjustment of JIS-style Japanese punctuation
- Fixed Finnish translation of "Listing"
- Fixed Z-ordering of multiple text decorations (underlines, etc.)
- Fixed a bug due to which text [features]($text.features) could not be
overridden in consecutive set rules
## Model
- Added [`depth`]($heading.depth) and [`offset`]($heading.offset) arguments to
heading to increase or decrease the heading level for a bunch of content; the
heading syntax now sets `depth` rather than `level` **(Breaking change)**
- List [markers]($list.marker) now cycle by default
- The [`quote`] function now more robustly selects the correct quotes based on
language and nesting
- Fixed indent bugs related to the default show rule of [terms]
## Math
- Inline equations now automatically linebreak at appropriate places
- Added [`number-align`]($math.equation.number-align) argument to equations
- Added support for adjusting the [`size`]($math.accent.size) of accents
relative to their base
- Improved positioning of accents
- [Primes]($math.primes) are now always attached as [scripts]($math.scripts) by
default
- Exposed [`math.primes`] element which backs the `[$f'$]` syntax in math
- Math mode is not affected by [`strong`] and [`emph`] anymore
- Fixed [`attach`]($math.attach) under [fractions]($math.frac)
- Fixed that [`math.class`] did not affect smart limit placement
- Fixed weak spacing in [`lr`]($math.lr) groups
- Fixed layout of large operators for Cambria Math font
- Fixed math styling of Hebrew symbol codepoints
## Symbols
- Added `gradient` as an alias for `nabla`
- Added `partial` as an alias for `diff`, `diff` will be deprecated in the
future
- Added `colon.double`, `gt.approx`, `gt.napprox`, `lt.approx`, and `lt.napprox`
- Added `arrow.r.tilde` and `arrow.l.tilde`
- Added `tilde.dot`
- Added `forces` and `forces.not`
- Added `space.nobreak.narrow`
- Added `lrm` (Left-to-Right Mark) and `rlm` (Right-to-Left Mark)
- Fixed `star.stroked` symbol (which previously had the wrong codepoint)
## Scripting
- Arrays can now be compared lexicographically
- Added contextual method [`to-absolute`]($length.to-absolute) to lengths
- Added [`calc.root`]($calc.root)
- Added [`int.signum`] and [`float.signum`] methods
- Added [`float.is-nan`] and [`float.is-infinite`] methods
- Added [`int.bit-not`], [`int.bit-and`], [`int.bit-or`], [`int.bit-xor`],
[`int.bit-lshift`], and [`int.bit-rshift`] methods
- Added [`array.chunks`] method
- A module can now be converted to a dictionary with the
[dictionary constructor]($dictionary/#constructor) to access its contents
dynamically
- Added [`row-type`]($csv.row-type) argument to `csv` function to configure
how rows will be represented
- [XML parsing]($xml) now allows DTDs (document type definitions)
- Improved formatting of negative numbers with [`str`]($str) and [`repr`]($repr)
- For loops can now iterate over [bytes]
- Fixed a bug with pattern matching in for loops
- Fixed a bug with labels not being part of [`{.fields()}`]($content.fields)
dictionaries
- Fixed a bug where unnamed argument sinks wouldn't capture excess arguments
- Fixed typo in `repr` output of strokes
## Syntax
- Added support for nested [destructuring patterns]($scripting/#bindings)
- Special spaces (like thin or non-breaking spaces) are now parsed literally
instead of being collapsed into normal spaces **(Breaking change)**
- Korean text can now use emphasis syntax without adding spaces
**(Breaking change)**
- The token [`context`] is now a keyword and cannot be used as an identifier
anymore **(Breaking change)**
- Nested line comments aren't allowed anymore in block comments
**(Breaking change)**
- Fixed a bug where `x.)` would be treated as a field access
- Text elements can now span across curly braces in markup
- Fixed silently wrong parsing when function name is parenthesized
- Fixed various bugs with parsing of destructuring patterns, arrays, and
dictionaries
## Tooling & Diagnostics
- Click-to-jump now works properly within [`raw`] text
- Added suggestion for accessing a field if a method doesn't exist
- Improved hint for calling a function stored in a dictionary
- Improved errors for mutable accessor functions on arrays and dictionaries
- Fixed error message when calling constructor of type that doesn't have one
- Fixed confusing error message with nested dictionaries for strokes on
different sides
- Fixed autocompletion for multiple packages with the same name from different
namespaces
## Visualization
- The [`image`] function doesn't upscale images beyond their natural size
anymore
- The [`image`] function now respects rotation stored in EXIF metadata
- Added support for SVG filters
- Added alpha component to [`luma`]($color.luma) colors
- Added [`color.transparentize`] and [`color.opacify`] methods
- Improved [`color.negate`] function
- Added [`stroke`]($highlight.stroke) and [`radius`]($highlight.radius)
arguments to `highlight` function
- Changed default [`highlight`] color to be transparent
- CMYK to RGB conversion is now color-managed
- Fixed crash with gradients in Oklch color space
- Fixed color-mixing for hue-based spaces
- Fixed bugs with color conversion
- SVG sizes are not rounded anymore, preventing slightly wrong aspect ratios
- Fixed a few other SVG-related bugs
- [`color.components`] doesn't round anything anymore
## Export
- PDFs now contain named destinations for headings derived from their labels
- The internal PDF structure was changed to make it easier for external tools to
extract or modify individual pages, avoiding a bug with Typst PDFs in Apple
Preview
- PDFs produced by Typst should now be byte-by-byte reproducible when
`{set document(date: none)}` is set
- Added missing flag to PDF annotation
- Fixed multiple bugs with gradients in PDF export
- Fixed a bug with patterns in PDF export
- Fixed a bug with embedding of grayscale images in PDF export
- Fixed a bug with To-Unicode mapping of CFF fonts in PDF export
- Fixed a bug with the generation of the PDF outline
- Fixed a sorting bug in PDF export leading to non-reproducible output
- Fixed a bug with transparent text in PNG export
- Exported SVG files now include units in their top-level `width` and `height`
## Command line interface
- Added support for passing [inputs]($category/foundations/sys) via a CLI flag
- When passing the filename `-`, Typst will now read input from stdin
- Now uses the system-native TLS implementation for network fetching which
should be generally more robust
- Watch mode will now properly detect when a previously missing file is created
- Added `--color` flag to configure whether to print colored output
- Fixed user agent with which packages are downloaded
- Updated bundled fonts to the newest versions
## Development
- Added `--vendor-openssl` to CLI to configure whether to link OpenSSL
statically instead of dynamically (not applicable to Windows and Apple
platforms)
- Removed old tracing (and its verbosity) flag from the CLI
- Added new `--timings` flag which supersedes the old flamegraph profiling in
the CLI
- Added minimal CLI to `typst-docs` crate for extracting the language and
standard library documentation as JSON
- The `typst_pdf::export` function's `ident` argument switched from `Option` to
`Smart`. It should only be set to `Smart::Custom` if you can provide a stable
identifier (like the web app can). The CLI sets `Smart::Auto`.
## Contributors
<contributors from="v0.10.0" to="v0.11.0" />
|
Subsets and Splits