hexsha stringlengths 40 40 | size int64 5 1.04M | ext stringclasses 6 values | lang stringclasses 1 value | max_stars_repo_path stringlengths 3 344 | max_stars_repo_name stringlengths 5 125 | max_stars_repo_head_hexsha stringlengths 40 78 | max_stars_repo_licenses listlengths 1 11 | max_stars_count int64 1 368k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 3 344 | max_issues_repo_name stringlengths 5 125 | max_issues_repo_head_hexsha stringlengths 40 78 | max_issues_repo_licenses listlengths 1 11 | max_issues_count int64 1 116k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 3 344 | max_forks_repo_name stringlengths 5 125 | max_forks_repo_head_hexsha stringlengths 40 78 | max_forks_repo_licenses listlengths 1 11 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 5 1.04M | avg_line_length float64 1.14 851k | max_line_length int64 1 1.03M | alphanum_fraction float64 0 1 | lid stringclasses 191 values | lid_prob float64 0.01 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b0640f3fcacbd706d8f479ba77e1d31825d787b4 | 90 | md | Markdown | README.md | YIFEI-MA/MultiDigitRecognition | f1f9567c31102ccdc7464a35b8a7c533b5d46734 | [
"MIT"
] | null | null | null | README.md | YIFEI-MA/MultiDigitRecognition | f1f9567c31102ccdc7464a35b8a7c533b5d46734 | [
"MIT"
] | null | null | null | README.md | YIFEI-MA/MultiDigitRecognition | f1f9567c31102ccdc7464a35b8a7c533b5d46734 | [
"MIT"
] | null | null | null | # MultiDigitRecognition
This requires Pytorch version 1.3.1 or higher to use TORCHSCRIPT.
| 30 | 65 | 0.822222 | eng_Latn | 0.940084 |
b064c285a292faf21a724241e8c0b5843fec01c8 | 1,564 | md | Markdown | _posts/qt/qml/cpp-interfacing/2021-02-14-qml-cpp-interfacing-18.md | 8BitsCoding/8BitsCoding.github.io | ed3879b319c7248d52217d321139ccf90a0bd4a2 | [
"MIT"
] | null | null | null | _posts/qt/qml/cpp-interfacing/2021-02-14-qml-cpp-interfacing-18.md | 8BitsCoding/8BitsCoding.github.io | ed3879b319c7248d52217d321139ccf90a0bd4a2 | [
"MIT"
] | null | null | null | _posts/qt/qml/cpp-interfacing/2021-02-14-qml-cpp-interfacing-18.md | 8BitsCoding/8BitsCoding.github.io | ed3879b319c7248d52217d321139ccf90a0bd4a2 | [
"MIT"
] | null | null | null | ---
title: "(QML) Invoking QML Methods"
permalink: qt/qml/18/ # link 직접 지정
#toc: true # for Sub-title (On this page)
comments: true # for disqus Comments
categories: # for categories
date: 2021-02-14 00:00:00 -0000
last_modified_at: 2021-02-14 00:00:00 -0000
tag:
- Qt
- QML
category:
-
sidebar:
- title: ""
- nav:
classes: wide
excerpt: ""
header:
teaser: /file/image/qt-page-teaser.gif
---
* [Get Code](https://github.com/EasyCoding-7/qml-cpp-interfacing/tree/master/18-InvokeQMLMethodDemo)
```cpp
#include <QGuiApplication>
#include <QQmlApplicationEngine>
#include <QDebug>
int main(int argc, char *argv[])
{
QCoreApplication::setAttribute(Qt::AA_EnableHighDpiScaling);
QGuiApplication app(argc, argv);
QQmlApplicationEngine engine;
engine.load(QUrl(QStringLiteral("qrc:/main.qml")));
if (engine.rootObjects().isEmpty())
return -1;
QObject * rootObject = engine.rootObjects()[0];
QObject * funcContext = rootObject->findChild<QObject*>("deep2");
if( funcContext){
qDebug() << "Found the object";
QVariant returnValue;
QVariant parameter = "C++ Parameter";
QMetaObject::invokeMethod(funcContext,"qmlFunction",
Q_RETURN_ARG(QVariant,returnValue),
Q_ARG(QVariant,parameter)
);
qDebug() << "This is C++, return value is : " << returnValue.toString();
}
return app.exec();
}
``` | 26.508475 | 100 | 0.597826 | yue_Hant | 0.471901 |
b064c480b4d0d926bce5f9b38f18be475ebdb27c | 591 | md | Markdown | _orgregister/75010461-Antsla Kultuuri- ja Spordikeskus.md | SigritSiht/opendata.riik.ee | 09cdb7045cc17f74939f8502ede283905ed5595d | [
"MIT"
] | 16 | 2018-11-03T11:01:15.000Z | 2019-06-14T11:01:37.000Z | _orgregister/75010461-Antsla Kultuuri- ja Spordikeskus.md | SigritSiht/opendata.riik.ee | 09cdb7045cc17f74939f8502ede283905ed5595d | [
"MIT"
] | 213 | 2018-10-27T12:28:48.000Z | 2019-10-04T09:40:54.000Z | _orgregister/75010461-Antsla Kultuuri- ja Spordikeskus.md | SigritSiht/opendata.riik.ee | 09cdb7045cc17f74939f8502ede283905ed5595d | [
"MIT"
] | 42 | 2018-11-22T13:31:22.000Z | 2019-09-28T12:49:19.000Z | ---
nimi: Antsla Kultuuri- ja Spordikeskus
ariregistri_kood: 75010461
kmkr_nr: ''
ettevotja_staatus: R
ettevotja_staatus_tekstina: Registrisse kantud
ettevotja_esmakande_kpv: 26.09.2000
ettevotja_aadress: .na
asukoht_ettevotja_aadressis: Kooli tee 19
asukoha_ehak_kood: 1301
asukoha_ehak_tekstina: Antsla linn, Antsla vald, Võru maakond
indeks_ettevotja_aadressis: '66403'
ads_adr_id: 3244899
ads_ads_oid: .na
ads_normaliseeritud_taisaadress: Võru maakond, Antsla vald, Antsla linn, Kooli tee
19
teabesysteemi_link: https://ariregister.rik.ee/ettevotja.py?ark=75010461&ref=rekvisiidid
---
| 31.105263 | 88 | 0.832487 | est_Latn | 0.991359 |
b0654deb173a3282e53b3a5f6e32048948dbf560 | 1,422 | md | Markdown | blog/stories/2020/03/14/a203403.md | scripting/Scripting-News | 348c428614b115fe390513defc285aceeedd4f09 | [
"MIT"
] | 93 | 2016-06-02T15:40:14.000Z | 2022-02-02T20:02:08.000Z | blog/stories/2020/03/14/a203403.md | scripting/Scripting-News | 348c428614b115fe390513defc285aceeedd4f09 | [
"MIT"
] | 231 | 2016-06-02T15:21:23.000Z | 2022-02-18T20:48:20.000Z | blog/stories/2020/03/14/a203403.md | scripting/Scripting-News | 348c428614b115fe390513defc285aceeedd4f09 | [
"MIT"
] | 11 | 2017-06-27T11:58:01.000Z | 2021-06-21T00:55:07.000Z | <img src="http://scripting.com/images/2020/03/08/uncleSam.png" border="0" align="right">Another <a href="https://radioopensource.org/contagious-crisis/">must-listen podcast</a> from Chris Lydon. The take-away is that our political system hasn't yet realized that we need to go to single-payer for all, now, if we want to have as good an outcome as Italy, which is to say a very shitty outcome. Ours is on track to be much worse because the uninsured can't enter the system, therefore will continue to infect even people with insurance. We're set suffer here in the US a lot more. There will be a debate tomorrow night, and if Biden isn't tuned into this, Sanders is going to clean his clock. And I suspect Biden isn't. And there's a chance that Sanders isn't thinking clearly either, but I kind of doubt it. Nothing focuses the mind like losing. Action-item: before the debate, Biden should give a speech outlining a Medicare-for-all-now program. Give Sanders proper credit. At the debate he can offer to delegate the implementation of this to Sanders. Create unity right there on the debate stage. The Democrats in Congress are not without power. Trump is crazy to think the only criteria people will care about is the stock market. People who unnecessarily lose friends and relatives to this disease are likely to care about that more. Never waste a good crisis. <i>Now</i> is the time to reform health care in the US.
| 711 | 1,421 | 0.7827 | eng_Latn | 0.999115 |
b065c312d57401c9cf4b76406a89fe8c100003e5 | 955 | md | Markdown | about.md | jschadaway/jschadaway.github.io | 19bb02a0d08c68c97f85c3a9844a012c10d6afcf | [
"MIT"
] | null | null | null | about.md | jschadaway/jschadaway.github.io | 19bb02a0d08c68c97f85c3a9844a012c10d6afcf | [
"MIT"
] | null | null | null | about.md | jschadaway/jschadaway.github.io | 19bb02a0d08c68c97f85c3a9844a012c10d6afcf | [
"MIT"
] | null | null | null | ---
title: About
layout: page
---
<p>Hello there! My name is Chamath Dharmasiri (though I occasionally go by the creative
alias "Jake Schadaway"), and I'm a software developer and recent undergraduate
of Boston University. My long-term goals include creating look development
software for film and gaming industry artists and researching new techniques
for computer graphics. Most of my prior experience comes from writing frontend
code for various open-source desktop applications, though I have recently begun
studing both OpenGL and GLSL.</p>
<p>See my <a href="/projects">projects page</a> for a more detailed
view of my previous experience.</p>
<h2>Skills (in order of familiarity)</h2>
<ul class="skill-list">
<li>C++</li>
<li>Python</li>
<li>Java</li>
<li>MySQL / SQLite</li>
<li>C / C#</li>
<li>GLSL</li>
<li>MongoDB</li>
<li>HTML</li>
<li>CSS</li>
<li>JavaScript</li>
</ul>
| 29.84375 | 87 | 0.717277 | eng_Latn | 0.976105 |
b0661786da0f3f35f22cce3f7ea114b364c48a4d | 5,254 | md | Markdown | _posts/2019-04-09-Download-storia-contemporanea-il-novecento.md | Luanna-Lynde/28 | 1649d0fcde5c5a34b3079f46e73d5983a1bfce8c | [
"MIT"
] | null | null | null | _posts/2019-04-09-Download-storia-contemporanea-il-novecento.md | Luanna-Lynde/28 | 1649d0fcde5c5a34b3079f46e73d5983a1bfce8c | [
"MIT"
] | null | null | null | _posts/2019-04-09-Download-storia-contemporanea-il-novecento.md | Luanna-Lynde/28 | 1649d0fcde5c5a34b3079f46e73d5983a1bfce8c | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Storia contemporanea il novecento book
How would you resolve something like that?" "Excuse me. If ten percent of the to an explanation of the way in which the sand and rolled-stone _osar_ foreign geographical societies, came in to the king and prostrating himself to him, i, because it is fleeter than the bear, Detectives. So the servant went with her and when she came to her door, with the desire to treat all animals with dignity, 'Indeed this is none other storia contemporanea il novecento a king of the greatest of the kings. Storia contemporanea il novecento the time, be caught by the shifting flames. Why hide the "Yes. Being unacquainted with the coast the seafarers [Footnote 286: I have seen such pins, were the priest and the altar boys, Mom, and the streets filled with last-minute holiday shoppers. change the subject. Yeah, silent except for the rhythmic beat of the alarm bell in Cass. bloom was caused by the water in the bodies of the dead. It's no wonder we jumped at the chance to have him represent us at the bargaining table when he so generously offered to. They know I love him. In spite of seen in twenty years. " She pulls my hands close and lays them on her body! He was straining against the cocoon of his life to date, Celestina held Wally's hand so tightly that reckon four or five dogs sufficient for a sledge with one suit. She looked up as Howard came out of the home. memories, ii. as the pages of any real book that he's ever read, next thing you "But then came the dragon. country, just to confirm that his gender suspicions were correct, whereupon the prince fell down in a swoon. " When she rounded the end of the bed, maybe twenty feet. Golden hair. begged for mercy that perhaps had never been given. Her fingers fought to hold on to the knife, and not because any of the attending nurses was a looker. "Was she a slinky blonde?в After your loss, i, accessed by a door in one comer of the living room. ] whence we may infer, for example, I couldn't storia contemporanea il novecento off right "May I run with you?" I called after her, paperback fantasy novel featuring Vikings in a longboat, he snatched his hand back. " So they all went in to the king and prostrating themselves before him, not the shirt, with vodka, who might be hired assassins or poets! was to be treated as politely as any citizen but with more wariness, the hunters begin to haul in the lines, then I owned my own restaurant, drying her eyes, a sudden stutterer, no other emetic. large number of children, after the name of his father, it's up to you. A basket of onions, "Nothing I can do storia contemporanea il novecento it," I went on. Rereading and pondering the words this night in his room in the barracks, in which case they might all make it inside before he funding scheme for the long term. She drank the wine, half-minute blindness that left her in cotillion. " [Footnote 42: The endeavour to procure for this work a copy of an opportunity of admiring the magnificent environs of the Inland Sea. The marsh fever. ] promotion and distribution of Project Gutenberg-tm electronic works, lying far out at sea! He was straining against the cocoon of his life to date, so emotionally and intellectually entwined. " there and to oblivion by the capricious winds of fate, to hug. An attempt to eat bear's and divided by an isolated toothed comb into two divisions. Would God I were a servant in waiting at your door! and, one of the cleanest and best kept "Amazing," the robot replied in a neutral voice, often without trace of a nest. "Tell him Iвll get back on it Monday. Worth which the dinette chairs were upholstered. "Maybe the Chironians have given a warning, I have freckles. On one or two occasions, not with the use to which their end result will be put Sinsemilla giggling in the co-pilot's chair, Leilani said, storia contemporanea il novecento hip in America had meant being nihilistic, I must stay, storia contemporanea il novecento not because any of the attending nurses was a looker, it's none of your business anymore, maybe ten, a full refund of any Detweiler's timetable, and on the very day his storia contemporanea il novecento is born. Celia's hair is a lot shorter. The hall was jack! " exhilaration, unrestrained, he preferred canes storia contemporanea il novecento lashes as the instruments of education for his daughter, "Nothing I can do about it," I went on. This happened so suddenly that I froze. After the Chukches had told us that an exceedingly delicious black Heart racing, vanishing among the layered boughs: a reliable prediction that the storm would soon break. " publications of the Swedish Academy of Sciences. Plus c'est la meme chose, his feet still show like wings. 020LeGuin20-20Tales20From20Earthsea. 2, of infinite grace. It was known officially as Warhead Refinishing and Storage, shuddered. Hungry as he was every night, storia contemporanea il novecento bits and pieces as other opportunities aroseвand "And mine with you. " Singapore is situated exactly halfway, her classic features had a pixie charm, but because in the end they were unable to express themselves adequately, but the better is as follows. conquest. | 583.777778 | 5,147 | 0.790065 | eng_Latn | 0.999912 |
b066bfbf25abafcb7536f503fc3627915019ef0d | 649 | md | Markdown | README.md | leo-pires/ecto_couchdb | 16b7c2c2b6d8e13721ed79ff2c5f43e653fca836 | [
"Apache-2.0"
] | null | null | null | README.md | leo-pires/ecto_couchdb | 16b7c2c2b6d8e13721ed79ff2c5f43e653fca836 | [
"Apache-2.0"
] | null | null | null | README.md | leo-pires/ecto_couchdb | 16b7c2c2b6d8e13721ed79ff2c5f43e653fca836 | [
"Apache-2.0"
] | 2 | 2018-09-20T16:27:07.000Z | 2020-04-13T11:35:01.000Z | # CouchdbAdapter
[](https://travis-ci.org/amuino/ecto_couchdb)
**TODO: Add description**
## Installation
If [available in Hex](https://hex.pm/docs/publish), the package can be installed
by adding `couchdb_adapter` to your list of dependencies in `mix.exs`:
```elixir
def deps do
[{:couchdb_adapter, "~> 0.1.0"}]
end
```
Documentation can be generated with [ExDoc](https://github.com/elixir-lang/ex_doc)
and published on [HexDocs](https://hexdocs.pm). Once published, the docs can
be found at [https://hexdocs.pm/couchdb_adapter](https://hexdocs.pm/couchdb_adapter).
| 32.45 | 121 | 0.74114 | eng_Latn | 0.50771 |
b0674163e61b3b8db217b865e24a57c4c8129d9a | 157 | md | Markdown | _posts/0000-01-02-bopa2.md | bopa2/github-slideshow | f395c8ab1550caf0ad3bc973e8bf36c1fb0dd7da | [
"MIT"
] | null | null | null | _posts/0000-01-02-bopa2.md | bopa2/github-slideshow | f395c8ab1550caf0ad3bc973e8bf36c1fb0dd7da | [
"MIT"
] | 3 | 2021-04-11T15:03:57.000Z | 2021-04-11T16:28:38.000Z | _posts/0000-01-02-bopa2.md | bopa2/github-slideshow | f395c8ab1550caf0ad3bc973e8bf36c1fb0dd7da | [
"MIT"
] | null | null | null | ---
layout: slide
title: "Welcome to our second slide!"
---
now its changed **:)**
**and** also a bit *play* stuff is now in.
Use the left arrow to go back!
| 19.625 | 42 | 0.649682 | eng_Latn | 0.999898 |
b0678f33d668a7f936d123137409a7fbff00cf0d | 1,571 | md | Markdown | docs/offset_commit_response.md | perchits/libkafka-asio | cbdced006d49a4498955a222915c6514b4ac57a7 | [
"MIT"
] | 77 | 2015-04-07T08:14:14.000Z | 2022-02-14T01:07:05.000Z | docs/offset_commit_response.md | perchits/libkafka-asio | cbdced006d49a4498955a222915c6514b4ac57a7 | [
"MIT"
] | 28 | 2015-04-07T08:57:41.000Z | 2020-04-19T21:25:22.000Z | docs/offset_commit_response.md | perchits/libkafka-asio | cbdced006d49a4498955a222915c6514b4ac57a7 | [
"MIT"
] | 48 | 2015-04-15T05:34:51.000Z | 2022-03-17T11:50:20.000Z |
# class `OffsetCommitResponse`
**Header File:** `<libkafka_asio/offset_commit_response.h>`
**Namespace:** `libkafka_asio`
Implementation of the Kafka OffsetCommitResponse as described on the
[Kafka wiki](https://cwiki.apache.org/confluence/display/KAFKA/A+Guide+To+The+Kafka+Protocol#AGuideToTheKafkaProtocol-OffsetCommitResponse).
An object of this type will be given as response object to the handler function
when invoking an offset commit request.
<img src="http://yuml.me/diagram/nofunky;scale:80/class/
[OffsetCommitResponse]++-*[OffsetCommitResponse::Topic],
[OffsetCommitResponse::Topic]++-*[OffsetCommitResponse::Partition]"
/>
## Member Functions
### topics
```cpp
const Topics& topics() const
```
Returns the data of this API response object, sorted by topic.
## Types
### Topic
```cpp
struct Topic {
Partitions partitions;
}
```
* `partitions`:
The partition objects contained in this topic object.
### Partition
```cpp
struct Partition {
Int16 error_code;
}
```
* `error_code`:
Kafka error for this topic partition.
### Topics
```cpp
typedef std::map<String, Topic> Topics
```
Map that associates the offset commit response part of topics to their topic names.
### Partitions
```cpp
typedef std::map<Int32, Partition> Partitions
```
Map that associates a `Partition` object to the partition id.
### OptionalType
```cpp
typedef boost::optional<OffsetCommitResponse> OptionalType
```
A offset-commit response object wrapped using _Boost optional_. Such an object
will be used for offset-commit request handler functions.
| 20.671053 | 140 | 0.748568 | eng_Latn | 0.741885 |
b067cb4c824d3d05937f5bdfd576d3a2301007da | 240 | md | Markdown | README.md | scai/tab-maker | af1ed46d2cf6b9f7276ce5f7cb3f7da4859e1cec | [
"MIT"
] | null | null | null | README.md | scai/tab-maker | af1ed46d2cf6b9f7276ce5f7cb3f7da4859e1cec | [
"MIT"
] | 19 | 2021-01-05T05:41:45.000Z | 2021-12-27T05:24:07.000Z | README.md | scai/tab-maker | af1ed46d2cf6b9f7276ce5f7cb3f7da4859e1cec | [
"MIT"
] | null | null | null | # 吉他扒谱记谱
## 示范谱
* [测试谱](https://scai.github.io/tab-maker/public/)
* [林俊杰 “幸存者”](https://scai.github.io/tab-maker/public/index.html?tab=drifter&key=A)
* [邰正宵 “回不去了”](https://scai.github.io/tab-maker/public/index.html?tab=samuel-back&key=D)
| 34.285714 | 88 | 0.695833 | zul_Latn | 0.140974 |
b067e438082bcca11dbc773c739f249ab235cfcf | 3,568 | md | Markdown | sho-jin/past_contests/others/EDPC/README.md | my0k/go-competitive | 23e9799f0a1558a54218e28f79b8c41852e1be97 | [
"MIT"
] | 4 | 2019-11-23T11:02:58.000Z | 2020-10-02T13:34:11.000Z | sho-jin/past_contests/others/EDPC/README.md | my0k/go-competitive | 23e9799f0a1558a54218e28f79b8c41852e1be97 | [
"MIT"
] | 1 | 2019-02-20T14:51:30.000Z | 2019-02-20T14:51:30.000Z | sho-jin/past_contests/others/EDPC/README.md | myokoyama0712/go-competitive | 23e9799f0a1558a54218e28f79b8c41852e1be97 | [
"MIT"
] | 1 | 2019-01-13T07:45:38.000Z | 2019-01-13T07:45:38.000Z | # EDPC過去問感想
正月は他にやりたい勉強があったので、本コンテストはオフラインで1問1問ゆっくり身長に取り組んだ。
非常に参考になる方々の解説↓。
[けんちょんさんA〜E問題](https://qiita.com/drken/items/dc53c683d6de8aeacf5a)
[はまやんはまやんさん](https://www.hamayanhamayan.com/entry/2019/01/12/163853)
[けんちょんさんF〜J問題](https://qiita.com/drken/items/03c7db44ccd27820ea0d)
---
## A問題
- 1次元のメモ配列で解けるタイプ。
- 遷移も状態もシンプルなのでDPの学習し始めに良いと思った。
- ナップサックDPよりも考えやすい気がする。
- いわゆる（？）「貰うDP」の形でコードを書いた。
- `i==2` の場合を初期化に含めてしまえば、ループがシンプルになってバグりにくいと思ったので。
---
## B問題
- （個人的には）A問題は「貰うDP」が書きやすかったので、今度は「配るDP」をやってみてください、と言われた感じだった。
---
## C問題
- 「貰うDP」の形式で書いたが、あまり気にすることではなさそう。
---
## D問題
- 典型的なナップサックDP。
- 何回かすでに解いてしまったため、ほぼ解法を暗記してしまっている。。
---
## E問題
- ナップサック問題のよくある変形（らしい）。
- はまやんはまやんさんの解説を見た感じ、自分の解法で問題なさそう。
- 自分はなんとなく「貰うDP」のほうが確信を漸化式を立てやすい気がする。
- とはいえ、ナップサックのようなDPで貰う形式で書く場合、条件分岐のコードが若干冗長になる。
---
## F問題
- LCSはLongest Common Stringの略？
- 今の所一番むずかしい、遷移があまり脳になじまない感じ。。
---
## G問題
- DAG上のLongest Pathの長さを調べる問題、自力で解けたのは嬉しい。
- けんちょんさんの解説記事の以下の文がとても納得できた。
> 問題Aでは「for文を回すDP」と「メモ化再帰」とで大きな違いはないと書きました。
> しかし、メモ化再帰が大きなメリットを生む状況があります。
> それは **DPの更新順序が非自明** という場合です。
- for文を回すタイプのDPでこの問題を解くためには、以下の手順が必要らしい。。
- まずトポロジカルソートする
- それによってDPを回していくべきノード順が決まるので、DPする
- 日経のD問題もこれに近いような問題だった気がするので、相互参照する形で学習に利用したい。
- 今日は仕事でつかれたのでここまで。。
---
## H問題
- グリッド上の目的地への経路の数の数え上げ問題
- 割と易しめ
- けんちょんさんの解説では `(0, 0)` から遷移していたが、自分は当初メモ化再帰で考えようとしていたため、結果的に逆からのdpテーブル埋めをしていた
- 本質的には同じことをしているはず
---
## I問題
- 20190606に再開。
- 以前はわからなかったのでここでストップしていたが、なぜわからなかったのかがわからないくらい普通に解けた。
- 確率DPとか言う名前があるかはわからないが、こういった初期値の設定や遷移はかなり初歩的と思われるので、似たような問題が出たらしっかり仕留めたい。
- 制約に目をつけたらもっと早く解けたのかも？
- 今回は配るDPのほうが余計な場合分けが不要で簡潔だと思う。
---
## J問題
- はじめての（？）期待値DP
- 期待値漸化式をそれなりにしっかり理解しないと挑めない。
- 難関大学の入試勉強をしてると触れているらしい（自分は触れていなかった）
- 高校数学の物語で「期待値漸化式」を検索すると、コンプガチャの記事があり、こちらは幾分問題設定がシンプルであるため、はじめにこちらから勉強するとスムーズに理解できると思う。
- 肝心のDP部分については、遷移式が複雑なので、メモ化再帰で書くのがきれい。
---
## K問題
- ゲーム系の基本問題。ひょっとしたらDPじゃなくても解けるのかも？
- **石の残り数のみで状態と見立てて、その状態で手番が回ってきたときに勝てるかどうか？を小さい数から記憶していく。**
- CADDiコンテストのゲームを思い出す形。
- 小さい数からイメージするのは大事。
- 遷移は、選択肢として与えられる最大100個の数について、**それらからいずれかを選んだときに、相手を負け状態に追い詰められるかどうか？** で考えることができる。
---
## L問題
- 最大3000個程度の要素を含むキューから、一番前と一番うしろからのみ要素の取得が許されるゲーム。
- 先手はできるだけ取り出した合計値を大きくしたい、後手は小さくしたい。
- つまりは、先手・後手とも、自分のとった数値の合計が大きくなるようにしたい。
- 一見、与えられた2択のうち、大きい方を取るのが良さそうにも見えるが、そうしたあとにもっと良い数値が露出してしまうと、相手にそれを取られて結果的に不利になるケースが有る。
- よって、なんとかして全探索を考えたい。
- この問題も、サイズが小さい部分問題の答えがわかっていれば、「前をとったときの残りの部分問題」「後ろをとったときの残りの部分問題」を考えて、最大・最小をとるでいけそう。
- `dp[i][j]: i<=x<=j の区間で手番が回ってきたときの X-Y の値` として解いた。
- 遷移をforループで書ききるのは大変そうだったため、メモ化再帰で考えた。
- 与えられた区間は、先手・後手で戦略が変わるので、取り出した数値をプラスしたりマイナスしたりは、再帰関数の引数にフラグを渡すことで行った。
- [競プロフレンズさんの解説](https://kyopro-friends.hatenablog.com/entry/2019/01/12/231000)だと、コードはもっとシンプルになる。
- `dp[i][j]: i<=x<=j の区間で「次の手番の人のスコア - そうじゃない方の人のスコア」` として解いている。
- 手番の意味の取り込み方はK問題っぽい。
---
## M問題
- やたらと時間がかかったがなんとか自力でできた。
- **典型: DPテーブルの遷移（更新）に、すでに求まったテーブルの累積和を用いる。**
- ちょっと応用が効いたDP問題では本当に典型なのだろうと思う。
- ABC130のE問題などは、解法によってはそれまでのDPテーブルの2次元累積和が必要になったりしていた。
- 2次元程度ならば遷移表を追うことはなんとかできる可能性があるので、諦めずに愚直に遷移表を描いてみることもコンテスト中はやっていきたい。
---
## N問題
- なんかそれっぽいメモ化再帰の関数は簡単にかけたが、問題の分析が甘く、遷移が間違っていて自力で解けなかった。
- 逆向きに考える発想は良かったが、コスト計算が間違っていた。
- 大きいスライムを2分割する、そのとき分割前のスライムの大きさがコストとしてかかる、という見方が必要だった。
- **典型: 与えられた配列の累積和を使ったDPテーブルの遷移。**
- こういった累積和の使い方もDPでは頻出っぽい。
- 制約は最大400なのでいろいろ考えてしまいそうだが、「状態数が `O(N^2)` 、遷移が `O(N)` だから計算量は `O(N^3)` 」という冷静な分析はできるようになりたい。
---
## O問題
- bitDP！はなから勉強のために答えを見た。答えを読んでも全くわからなかった。
---
---
## S問題
- オーソドックスな10進数記法の桁DP。
- 個人的には桁DPは **「上の桁から確定させつつ `1->1, 0->1, 0->0` の遷移を気をつける」** でなんとかなるような気がしている。
- 解いたバリエーションが足りないので余り自信はないが、当分はこの方針でやってみたい。
| 21.365269 | 97 | 0.774103 | jpn_Jpan | 0.949133 |
b0682f95437194c1ab3981764df902e7de3678af | 1,590 | md | Markdown | prando/rd.md | achoudh5/HacktoberFestContribute | b949cf2dfd066704f74a604d6f0ae26a0724d813 | [
"MIT"
] | null | null | null | prando/rd.md | achoudh5/HacktoberFestContribute | b949cf2dfd066704f74a604d6f0ae26a0724d813 | [
"MIT"
] | null | null | null | prando/rd.md | achoudh5/HacktoberFestContribute | b949cf2dfd066704f74a604d6f0ae26a0724d813 | [
"MIT"
] | null | null | null | # Runs Test
The runs test can be used to test the assumption that the pseudo-random numbers are
independent of each other. We start with a sequence of pseudo-random numbers in [0,1].
We then look for unbroken subsequences of numbers, where the numbers within each
subsequence are monotonically increasing. Such a subsequence is called a run up, and it
may be as long as one number.
For example, let us consider the sequence: 0.8, 0.7, 0.75, 0.55, 0.6, 0.7, 0.3, 0.4,
0.5. Starting from the beginning of this sequence, i.e., from the left, we find a run up of
44 Computer Simulation Techniques
length 1, i.e. 0.8, then a run up of length 2, i.e. 0.7, 0.75, followed by two successive run
ups of length 3, i.e. 0.55, 0.6, 0.7, and 0.3, 0.4, 0.5.
In general, let ri be the number of run ups of length i. (In the above example we
have r1=1, r2=1, r3=2.) All run-ups with a length i≥6 are grouped together into a single
run-up. The ri values calculated for a particular sequence are then used to calculate the
following statistic:
R =1/n{(ri − nbi)(rj − nbj)aij}; 1≤i≤6, 1≤j≤6,
where n is the sample size and bi, i=1,...6, and aij are known coefficients. The aij
coefficient is obtained as the (i,j)th element of the matrix
4529.4 9044.9 13568 18091 22615 27892
9044.9 18097 27139 36187 45234 55789
13568 27139 40721 54281 67852 83685
18091 36187 54281 72414 90470 111580
22615 45234 67852 90470 113262 139476
27892 55789 83685 111580 139476 172860
,
and the bi coefficient is obtained as the ith element of the vector
(b1,...,b6) = (1/6 , 5/24 ,11/120 ,19/720 , 29/5040 , 1/840 )
| 54.827586 | 93 | 0.731447 | eng_Latn | 0.998876 |
b06849c4b21577bfe3da669d55ad63185abfc64e | 2,842 | md | Markdown | mybrc_rest_client/docs/JobsApi.md | ucb-rit/slurm-banking-plugins | f221608d18da5b88a3fa664f3271f00d74ac2490 | [
"BSD-3-Clause"
] | 10 | 2019-12-10T03:42:44.000Z | 2021-03-18T14:03:47.000Z | mybrc_rest_client/docs/JobsApi.md | lbnl-science-it/slurm-banking-plugins | f221608d18da5b88a3fa664f3271f00d74ac2490 | [
"BSD-3-Clause"
] | 1 | 2021-06-02T01:33:59.000Z | 2021-06-02T01:33:59.000Z | mybrc_rest_client/docs/JobsApi.md | lbnl-science-it/slurm-banking-plugins | f221608d18da5b88a3fa664f3271f00d74ac2490 | [
"BSD-3-Clause"
] | 4 | 2019-05-23T21:22:57.000Z | 2022-02-11T09:20:50.000Z | # \JobsApi
All URIs are relative to *https://scgup-dev.lbl.gov/mybrc-rest*
Method | HTTP request | Description
------------- | ------------- | -------------
[**jobs_create**](JobsApi.md#jobs_create) | **post** /jobs/ |
[**jobs_list**](JobsApi.md#jobs_list) | **get** /jobs/ |
[**jobs_update**](JobsApi.md#jobs_update) | **put** /jobs/{jobslurmid}/ |
## jobs_create
> crate::models::Job jobs_create(data, authorization)
Creates a new Job identified by the given Slurm ID.
### Parameters
Name | Type | Description | Required | Notes
------------- | ------------- | ------------- | ------------- | -------------
**data** | [**Job**](Job.md) | | Required |
**authorization** | **String** | The authorization token for the requester. The token should be preceded by 'Token ' (no quotes). | |
### Return type
[**crate::models::Job**](Job.md)
### Authorization
[Basic](../README.md#Basic)
### HTTP request headers
- **Content-Type**: application/json
- **Accept**: application/json
[[Back to top]](#) [[Back to API list]](../README.md#documentation-for-api-endpoints) [[Back to Model list]](../README.md#documentation-for-models) [[Back to README]](../README.md)
## jobs_list
> crate::models::InlineResponse2001 jobs_list(page)
A ViewSet for the Job model, intended for allocation accounting purposes.
### Parameters
Name | Type | Description | Required | Notes
------------- | ------------- | ------------- | ------------- | -------------
**page** | **i32** | A page number within the paginated result set. | |
### Return type
[**crate::models::InlineResponse2001**](inline_response_200_1.md)
### Authorization
[Basic](../README.md#Basic)
### HTTP request headers
- **Content-Type**: Not defined
- **Accept**: application/json
[[Back to top]](#) [[Back to API list]](../README.md#documentation-for-api-endpoints) [[Back to Model list]](../README.md#documentation-for-models) [[Back to README]](../README.md)
## jobs_update
> crate::models::Job jobs_update(jobslurmid, data, authorization)
Updates all fields of the Job identified by the given Slurm ID.
### Parameters
Name | Type | Description | Required | Notes
------------- | ------------- | ------------- | ------------- | -------------
**jobslurmid** | **String** | | Required |
**data** | [**Job**](Job.md) | | Required |
**authorization** | **String** | The authorization token for the requester. The token should be preceded by 'Token ' (no quotes). | |
### Return type
[**crate::models::Job**](Job.md)
### Authorization
[Basic](../README.md#Basic)
### HTTP request headers
- **Content-Type**: application/json
- **Accept**: application/json
[[Back to top]](#) [[Back to API list]](../README.md#documentation-for-api-endpoints) [[Back to Model list]](../README.md#documentation-for-models) [[Back to README]](../README.md)
| 27.066667 | 180 | 0.604856 | eng_Latn | 0.362708 |
b068c56e72cf8bd2d6977f527ce06a651c5bafa5 | 1,025 | md | Markdown | generatedReadme.md | ingrambc/Readme-Generator | d2e5f0732ca005d07fc8a05bb9eb5db0dc8f9fc5 | [
"MIT"
] | null | null | null | generatedReadme.md | ingrambc/Readme-Generator | d2e5f0732ca005d07fc8a05bb9eb5db0dc8f9fc5 | [
"MIT"
] | null | null | null | generatedReadme.md | ingrambc/Readme-Generator | d2e5f0732ca005d07fc8a05bb9eb5db0dc8f9fc5 | [
"MIT"
] | null | null | null |
# Title of Project
description of project
[](https://opensource.org/licenses/BSD-3-Clause)
---
## Table of contents
* [Installation](#installation)
* [Usage](#usage)
* [License](#license)
* [Contributing](#contributing)
* [Tests](#tests)
* [Questions](#questions)
---
## Installation
install instructions go here
---
## Usage
usage instructions go here
---
## License
This project is under BSD-3, to read the license, click the link below
[](https://opensource.org/licenses/BSD-3-Clause)
---
## Contributing
contribution guidelines
---
## Tests
test explainations
---
### Questions
[Github profile](https://github.com/UserName)
to submit issues or ask question, use the issues in the github repo at [https://github.com/UserName/Title of Project/issues](https://github.com/UserName/Title of Project/issues)
| 25 | 179 | 0.680976 | eng_Latn | 0.469777 |
b068e1ff212966780d17b88e8f96a06a14a16e96 | 4,714 | md | Markdown | docs/relational-databases/tables/TOC.md | lxyhcx/sql-docs.zh-cn | e63de561000b0b4bebff037bfe96170d6b61c908 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/relational-databases/tables/TOC.md | lxyhcx/sql-docs.zh-cn | e63de561000b0b4bebff037bfe96170d6b61c908 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/relational-databases/tables/TOC.md | lxyhcx/sql-docs.zh-cn | e63de561000b0b4bebff037bfe96170d6b61c908 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | # [概述](tables.md)
# [创建表（数据库引擎）](create-tables-database-engine.md)
# [删除表（数据库引擎）](delete-tables-database-engine.md)
# [复制表](duplicate-tables.md)
# [重命名表（数据库引擎）](rename-tables-database-engine.md)
# [查看表定义](view-the-table-definition.md)
## [表属性 - SSMS](table-properties-ssms.md)
## [列属性（“常规”页）](column-properties-general-page.md)
# [查看表的依赖关系](view-the-dependencies-of-a-table.md)
# [向表中添加列（数据库引擎）](add-columns-to-a-table-database-engine.md)
# [从表中删除列](delete-columns-from-a-table.md)
# [重命名列（数据库引擎）](rename-columns-database-engine.md)
# [将列从一个表复制到另一个表（数据库引擎）](copy-columns-from-one-table-to-another-database-engine.md)
# [修改列（数据库引擎）](modify-columns-database-engine.md)
# [更改表中的列顺序](change-column-order-in-a-table.md)
# [指定表中的计算列](specify-computed-columns-in-a-table.md)
# [指定列的默认值](specify-default-values-for-columns.md)
# [使用稀疏列](use-sparse-columns.md)
# [使用列集](use-column-sets.md)
# [使用表值参数（数据库引擎）](use-table-valued-parameters-database-engine.md)
# [主键和外键约束](primary-and-foreign-key-constraints.md)
## [创建主键](create-primary-keys.md)
## [修改主键](modify-primary-keys.md)
## [删除主键](delete-primary-keys.md)
## [创建外键关系](create-foreign-key-relationships.md)
## [修改外键关系](modify-foreign-key-relationships.md)
## [删除外键关系](delete-foreign-key-relationships.md)
## [查看外键属性](view-foreign-key-properties.md)
## [对复制禁用外键约束](disable-foreign-key-constraints-for-replication.md)
## [使用 INSERT 和 UPDATE 语句禁用外键约束](disable-foreign-key-constraints-with-insert-and-update-statements.md)
# [唯一约束和 CHECK 约束](unique-constraints-and-check-constraints.md)
## [创建唯一约束](create-unique-constraints.md)
## [修改唯一约束](modify-unique-constraints.md)
## [删除唯一约束](delete-unique-constraints.md)
## [创建 CHECK 约束](create-check-constraints.md)
## [修改 CHECK 约束](modify-check-constraints.md)
## [删除 CHECK 约束](delete-check-constraints.md)
## [对复制禁用 CHECK 约束](disable-check-constraints-for-replication.md)
## [对 INSERT 和 UPDATE 语句禁用 CHECK 约束](disable-check-constraints-with-insert-and-update-statements.md)
# [表列属性 (SQL Server Management Studio)](table-column-properties-sql-server-management-studio.md)
# [临时表](temporal-tables.md)
## [系统版本控制临时表入门](getting-started-with-system-versioned-temporal-tables.md)
### [创建由系统控制版本的临时表](creating-a-system-versioned-temporal-table.md)
### [在系统版本控制的临时表中修改数据](modifying-data-in-a-system-versioned-temporal-table.md)
### [在系统版本控制临时表中查询数据](querying-data-in-a-system-versioned-temporal-table.md)
### [更改系统版本控制的临时表架构](changing-the-schema-of-a-system-versioned-temporal-table.md)
### [停止对系统版本的临时表的系统版本控制](stopping-system-versioning-on-a-system-versioned-temporal-table.md)
## [临时表使用方案](temporal-table-usage-scenarios.md)
## [临时表系统一致性检查](temporal-table-system-consistency-checks.md)
## [临时表分区](partitioning-with-temporal-tables.md)
## [临时表注意事项和限制](temporal-table-considerations-and-limitations.md)
## [临时表安全性](temporal-table-security.md)
## [管理版本由系统控制的临时表中历史数据的保留期](manage-retention-of-historical-data-in-system-versioned-temporal-tables.md)
## [系统版本控制临时表与内存优化表](system-versioned-temporal-tables-with-memory-optimized-tables.md)
### [创建系统版本控制的内存优化临时表](creating-a-memory-optimized-system-versioned-temporal-table.md)
### [使用带有系统版本的内存优化临时表](working-with-memory-optimized-system-versioned-temporal-tables.md)
### [监视系统版本控制型内存优化临时表](monitoring-memory-optimized-system-versioned-temporal-tables.md)
### [内存优化系统版本控制临时表的性能注意事项](memory-optimized-system-versioned-temporal-tables-performance.md)
## [临时表元数据视图和函数](temporal-table-metadata-views-and-functions.md)
# [教程：使用 hierarchyid 数据类型](tutorial-using-the-hierarchyid-data-type.md)
## [第 1 课：将表转换为层次结构](lesson-1-converting-a-table-to-a-hierarchical-structure.md)
### [第 1-1 课 - 检查 Employee 表的当前结构](lesson-1-1-examining-the-current-structure-of-the-employee-table.md)
### [第 1-2 课 - 使用现有层次结构数据填充表](lesson-1-2-populating-a-table-with-existing-hierarchical-data.md)
### [第 1-3 课 - 优化 NewOrg 表](lesson-1-3-optimizing-the-neworg-table.md)
### [第 1-4 课 - 摘要 - 将表转换为层次结构](lesson-1-4-summary-converting-a-table-to-a-hierarchical-structure.md)
## [第 2 课：创建和管理层次结构表中的数据](lesson-2-creating-and-managing-data-in-a-hierarchical-table.md)
### [第 2-1 课 - 使用 hierarchyid 数据类型创建表](lesson-2-1-creating-a-table-using-the-hierarchyid-data-type.md)
### [第 2-2 课 - 使用分层方法填充层次结构表](lesson-2-2-populating-a-hierarchical-table-using-hierarchical-methods.md)
### [第 2-3 课 - 使用层次结构方法查询层次结构表](lesson-2-3-querying-a-hierarchical-table-using-hierarchy-methods.md)
### [第 2-4 课 - 使用分层方法对层次结构表中的数据重新排序](lesson-2-4-reordering-data-in-a-hierarchical-table-using-hierarchical-methods.md)
### [第 2-5 课 - 摘要 - 管理层次结构表中的数据](lesson-2-5-summary-managing-data-in-a-hierarchical-table.md)
| 62.853333 | 120 | 0.73462 | yue_Hant | 0.233134 |
b0699268626a26fb1af454a9d2bdad56d8828af9 | 91 | md | Markdown | _collection/wdconinc-pythiadire.md | singularityhub/singularityhub-archive | dd1d471db0c4ac01998cb84bd1ab82e97c8dab65 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | _collection/wdconinc-pythiadire.md | singularityhub/singularityhub-archive | dd1d471db0c4ac01998cb84bd1ab82e97c8dab65 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | _collection/wdconinc-pythiadire.md | singularityhub/singularityhub-archive | dd1d471db0c4ac01998cb84bd1ab82e97c8dab65 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | ---
id: 510
full_name: "wdconinc/pythiadire"
images:
- "wdconinc-pythiadire-latest"
---
| 13 | 32 | 0.681319 | eng_Latn | 0.064642 |
b06a1f4efac1f14fa3c0b7385e243c62eb46e4c1 | 107 | md | Markdown | README.md | MSDuncan82/fin-manager | 9270164c3adc58cccaf606d84f1a79c100f40843 | [
"MIT"
] | null | null | null | README.md | MSDuncan82/fin-manager | 9270164c3adc58cccaf606d84f1a79c100f40843 | [
"MIT"
] | null | null | null | README.md | MSDuncan82/fin-manager | 9270164c3adc58cccaf606d84f1a79c100f40843 | [
"MIT"
] | null | null | null | # fin-manager
A financial manager that aggregates credit card and bank statements to catgorize line items.
| 35.666667 | 92 | 0.82243 | eng_Latn | 0.987064 |
b06b1ce3d4563ed1c90ddd0635eab0f8dfc868d8 | 604 | md | Markdown | CodeSummarization/README.md | Masum06/CoDesc | efb59aa5e49af47d4133e969f4af4972b23450c2 | [
"MIT"
] | 22 | 2021-05-22T19:58:39.000Z | 2022-03-20T03:43:51.000Z | CodeSummarization/README.md | Masum06/CoDesc | efb59aa5e49af47d4133e969f4af4972b23450c2 | [
"MIT"
] | 1 | 2021-07-17T13:15:33.000Z | 2022-02-24T13:59:14.000Z | CodeSummarization/README.md | Masum06/CoDesc | efb59aa5e49af47d4133e969f4af4972b23450c2 | [
"MIT"
] | 2 | 2021-05-10T05:18:00.000Z | 2022-02-24T19:01:50.000Z | ## Dataset link:
Data source: https://drive.google.com/file/d/14nHVljNMb37-tpOW59NaDY26T6z2BcXD/view?usp=sharing
## training procedure
1. Download the data source from above link. Then extract the zip file inside `CodeSummarization/data/java/` folder.
2. Start training from `CodeSummarization/scripts/java/transformer.sh`.
run this command.
```bash
transformer.sh 0 CoDescSum
```
3. After two epoch terminate the terminal.
4. Rename 'train' folder to 'pretrain' and rename 'finetune' to 'train' inside `CodeSummarization/data/java/`.
5. Run this again.
```bash
transformer.sh 0 CoDescSum
```
| 33.555556 | 116 | 0.758278 | eng_Latn | 0.653011 |
b06b572d18c8e9e4ddcc7c25dbfac2be74668d02 | 656 | md | Markdown | frontend/src/components/info/privacy/privacy-policy.md | City-of-Turku/PaohWebFrontend | 6c03923bdd5ca95cee3b608e70a9915ab10c9545 | [
"MIT"
] | null | null | null | frontend/src/components/info/privacy/privacy-policy.md | City-of-Turku/PaohWebFrontend | 6c03923bdd5ca95cee3b608e70a9915ab10c9545 | [
"MIT"
] | null | null | null | frontend/src/components/info/privacy/privacy-policy.md | City-of-Turku/PaohWebFrontend | 6c03923bdd5ca95cee3b608e70a9915ab10c9545 | [
"MIT"
] | null | null | null | Päivitetty 23.3.2022
Palveluohjain-palvelussa ei käsitellä henkilötietoja tai muita arkaluonteisia tietoja. Palvelussa ei pysty tunnistautumaan.
Palvelun chatbotille lähetetyt viestit tallennetaan palvelun kehittämistä varten. Viestien yhteydessä ei tallenneta tietoja käyttäjästä.
Käyttäjän ei myöskään ole tarpeellista eikä suositeltavaa itse syöttää henkilötietoja tai muuta arkaluontoista tietoa palveluun. Mikäli käyttäjä itse kuitenkin syöttää henkilötietoja (esim. henkilötunnus, puhelinnumero, IP-osoite), ne poistetaan viesteistä automaattisesti eivätkä ne tallennu palvelun tietokantaan.
Palveluohjain-verkkopalvelusta vastaa Turun kaupunki.
| 65.6 | 315 | 0.865854 | fin_Latn | 1.000008 |
b06bc4cb87cf3002609a286bee2e246b4a48428c | 803 | md | Markdown | java-basic/learn-source-jdk8/READMD.md | lastwhispers/code | 8d4b926c5577525828e4f077e3901f4e869c7e4a | [
"Apache-2.0"
] | 59 | 2020-04-08T06:48:13.000Z | 2021-11-10T06:20:36.000Z | java-basic/learn-source-jdk8/READMD.md | lastwhispers/code | 8d4b926c5577525828e4f077e3901f4e869c7e4a | [
"Apache-2.0"
] | 26 | 2020-11-01T03:16:16.000Z | 2022-03-18T02:50:29.000Z | java-basic/learn-source-jdk8/READMD.md | lastwhispers/code | 8d4b926c5577525828e4f077e3901f4e869c7e4a | [
"Apache-2.0"
] | 44 | 2020-04-09T01:34:40.000Z | 2021-03-02T12:33:23.000Z | # jdk1.8.0_241环境下
# 一、集合
1. ArrayList
a. 底层数据结构？
b. 初始化参数？
c. 何时扩容？如何扩容？
d. 迭代器与快速失败机制？
e. 并发操作会带来哪些问题？
f. 场景应用场景？
2. LinkedList
a. 底层数据结构？
b. 初始化参数？
c. 何时扩容？如何扩容？
d. 迭代器与快速失败机制？
e. 并发操作会带来哪些问题？
f. 场景应用场景？
3. HashMap
a. 底层数据结构？
b. 初始化参数？
c. loadFactor？threshold？
d. 何时扩容？如何扩容？
e. 迭代器与快速失败机制？
f. 并发操作会带来哪些问题？
g. 场景应用场景？
4. TreeMap
a. 底层数据结构？
b. 初始化参数？
c. 何时扩容？如何扩容？
d. 迭代器与快速失败机制？
e. 并发操作会带来哪些问题？
f. 场景应用场景？
5. LinkedHashMap
a. 底层数据结构？
b. 初始化参数？
c. 何时扩容？如何扩容？
d. 迭代器与快速失败机制？
e. 并发操作会带来哪些问题？
f. 场景应用场景？
# 二、并发集合
1. CopyOnWriteArrayList
a. 底层数据结构？
b. 初始化参数？
c. 何时扩容？如何扩容？
e. 场景应用场景？
2. ConcurrentHashMap
a. 底层数据结构？
b. 初始化参数？
c. loadFactor？threshold？
d. 何时扩容？如何扩容？
g. 场景应用场景？
# 三、队列
| 12.546875 | 27 | 0.587796 | yue_Hant | 0.394499 |
b06c550dadbc44d475687bc3f1ac1ec6683184ec | 457 | md | Markdown | src/pages/2018/07/22using-template-for-journal-entries.md | thunderrabbit/gatsby-pandas-blog | bc4ca1a8fa59c387dc5d93aee1f62d896acf6eed | [
"MIT"
] | null | null | null | src/pages/2018/07/22using-template-for-journal-entries.md | thunderrabbit/gatsby-pandas-blog | bc4ca1a8fa59c387dc5d93aee1f62d896acf6eed | [
"MIT"
] | null | null | null | src/pages/2018/07/22using-template-for-journal-entries.md | thunderrabbit/gatsby-pandas-blog | bc4ca1a8fa59c387dc5d93aee1f62d896acf6eed | [
"MIT"
] | null | null | null | ---
title: "using template for journal entries"
tags: [ "journal", "emacs", "hugo" ]
author: Rob Nugen
date: 2018-07-22T17:40:04+09:00
---
## 17:40 Sunday 22 July 2018 JST
I write journal entries with Emacs because I never learned vi.
Anyway, I just tweaked my journal creation macros to use templates
instead of embedded strings.
Much easier to tweak and easier on the eyes.
Next step is to make a macro for episodes on my new website
marbletrack3.com
| 25.388889 | 66 | 0.748359 | eng_Latn | 0.970472 |
b06c62ed222d6d1fa6de0216ae03536f70170041 | 1,739 | md | Markdown | articles/active-directory/develop/scenario-protected-web-api-overview.md | changeworld/azure-docs.tr-tr | a6c8b9b00fe259a254abfb8f11ade124cd233fcb | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/active-directory/develop/scenario-protected-web-api-overview.md | changeworld/azure-docs.tr-tr | a6c8b9b00fe259a254abfb8f11ade124cd233fcb | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/active-directory/develop/scenario-protected-web-api-overview.md | changeworld/azure-docs.tr-tr | a6c8b9b00fe259a254abfb8f11ade124cd233fcb | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Korumalı Web API - genel bakış
titleSuffix: Microsoft identity platform
description: Korumalı bir web API'sini (genel bakış) nasıl oluşturabildiğini öğrenin.
services: active-directory
author: jmprieur
manager: CelesteDG
ms.service: active-directory
ms.subservice: develop
ms.topic: conceptual
ms.workload: identity
ms.date: 05/07/2019
ms.author: jmprieur
ms.custom: aaddev, identityplatformtop40
ms.openlocfilehash: 9017fbde1a44bcdf39fa8730bed25141da19fd56
ms.sourcegitcommit: d187fe0143d7dbaf8d775150453bd3c188087411
ms.translationtype: MT
ms.contentlocale: tr-TR
ms.lasthandoff: 04/08/2020
ms.locfileid: "80882412"
---
# <a name="scenario-protected-web-api"></a>Senaryo: Korumalı web API
Bu senaryoda, bir web API'sini nasıl ortaya çıkarabileceğinizi öğrenirsiniz. Web API'sini nasıl koruyacağınızı da öğrenirsiniz, böylece yalnızca kimlik doğrulaması yapılan kullanıcılar bu api'ye erişebilir.
Web API'nizi kullanmak için, kimlik doğrulaması hem iş hem de okul hesapları olan kullanıcıları etkinleştirmeniz veya Microsoft'un kişisel hesaplarını etkinleştirmeniz gerekir.
## <a name="prerequisites"></a>Ön koşullar
[!INCLUDE [Pre-requisites](../../../includes/active-directory-develop-scenarios-prerequisites.md)]
## <a name="specifics"></a>Özellikleri
Web API'lerini korumak için bilmeniz gereken belirli bilgiler şunlardır:
- Uygulama kaydınız en az bir kapsamı ortaya çıkarmalıdır. Web API'nız tarafından kabul edilen belirteç sürümü oturum açma hedef kitlesine bağlıdır.
- Web API'sinin kod yapılandırması, web API'sı çağrıldığında kullanılan belirteci doğrulamalıdır.
## <a name="next-steps"></a>Sonraki adımlar
> [!div class="nextstepaction"]
> [Uygulama kaydı](scenario-protected-web-api-app-registration.md)
| 40.44186 | 206 | 0.806786 | tur_Latn | 0.99339 |
b06cba6d113ebbe13881629c9f333cd31f5d59dc | 333 | md | Markdown | translations/es-ES/data/reusables/webhooks/repository_vulnerability_alert_short_desc.md | nyanthanya/Cuma_Info | d519c49504fc3818c1294f14e63ee944d2f4bd89 | [
"CC-BY-4.0",
"MIT"
] | 11,698 | 2020-10-07T16:22:18.000Z | 2022-03-31T18:54:47.000Z | translations/es-ES/data/reusables/webhooks/repository_vulnerability_alert_short_desc.md | nyanthanya/Cuma_Info | d519c49504fc3818c1294f14e63ee944d2f4bd89 | [
"CC-BY-4.0",
"MIT"
] | 8,317 | 2020-10-07T16:26:58.000Z | 2022-03-31T23:24:25.000Z | translations/es-ES/data/reusables/webhooks/repository_vulnerability_alert_short_desc.md | nyanthanya/Cuma_Info | d519c49504fc3818c1294f14e63ee944d2f4bd89 | [
"CC-BY-4.0",
"MIT"
] | 48,204 | 2020-10-07T16:15:45.000Z | 2022-03-31T23:50:42.000Z | Actividad relacionada con las alertas de vulnerabilidades de seguridad en un repositorio. {% data reusables.webhooks.action_type_desc %} Para obtener más información, consulta la sección "[Acerca de las alertas para las dependencias vulnerables](/github/managing-security-vulnerabilities/about-alerts-for-vulnerable-dependencies/)".
| 166.5 | 332 | 0.831832 | spa_Latn | 0.961772 |
b06d013970855e155ceafeaadd3cd7967738ea83 | 1,191 | md | Markdown | docs/CHANGELOG.md | cycjimmy/config-lib | 7e0b5d55f44610c74b08745a9d302a99d487d658 | [
"MIT"
] | null | null | null | docs/CHANGELOG.md | cycjimmy/config-lib | 7e0b5d55f44610c74b08745a9d302a99d487d658 | [
"MIT"
] | 3 | 2022-03-17T11:39:37.000Z | 2022-03-24T11:37:21.000Z | docs/CHANGELOG.md | cycjimmy/config-lib | 7e0b5d55f44610c74b08745a9d302a99d487d658 | [
"MIT"
] | null | null | null | ## [3.2.1](https://github.com/cycjimmy/config-lib/compare/v3.2.0...v3.2.1) (2022-03-26)
### Bug Fixes
* makeConfigWithPgkRootForLibrary Modify task order ([4c7b9bc](https://github.com/cycjimmy/config-lib/commit/4c7b9bc33bb1c6fc0c2e2d3b908760dbeb8bc2ea))
# [3.2.0](https://github.com/cycjimmy/config-lib/compare/v3.1.4...v3.2.0) (2022-03-25)
### Features
* add makeConfigWithPgkRootForLibrary ([ea5623b](https://github.com/cycjimmy/config-lib/commit/ea5623b490a1f50645ff8f16826d4ce8d89dc1d7))
## [3.1.4](https://github.com/cycjimmy/config-lib/compare/v3.1.3...v3.1.4) (2022-03-25)
### Bug Fixes
* fix update root version ([9eb421f](https://github.com/cycjimmy/config-lib/commit/9eb421f12363deac72ff54c90696796c968c0142))
## [3.1.3](https://github.com/cycjimmy/config-lib/compare/v3.1.2...v3.1.3) (2022-03-25)
### Bug Fixes
* fix esm extension js ([0db6397](https://github.com/cycjimmy/config-lib/commit/0db6397b98cd8395919cef822d7a0a7b6f424935))
## [3.1.2](https://github.com/cycjimmy/config-lib/compare/v3.1.1...v3.1.2) (2022-03-24)
### Bug Fixes
* run new release config ([d55a883](https://github.com/cycjimmy/config-lib/commit/d55a883e89812c83eebc88724ab5eb9f9b8a1195))
| 34.028571 | 151 | 0.739715 | yue_Hant | 0.558957 |
b06f56ba4365bb061116da646da8e4b1936ddb81 | 63 | md | Markdown | README.md | donaldheppner/meat-pi-functions | f34e366808e120d4d85e04a5c95f5b405427ce53 | [
"MIT"
] | null | null | null | README.md | donaldheppner/meat-pi-functions | f34e366808e120d4d85e04a5c95f5b405427ce53 | [
"MIT"
] | null | null | null | README.md | donaldheppner/meat-pi-functions | f34e366808e120d4d85e04a5c95f5b405427ce53 | [
"MIT"
] | null | null | null | # meat-pi-functions
Azure Functions app to support the Meat-Pi
| 21 | 42 | 0.793651 | eng_Latn | 0.946146 |
b06f79441241c714d218e1e0da38d94304f8eb5b | 31,189 | md | Markdown | docs/standard-library/reverse-iterator-class.md | ANKerD/cpp-docs.pt-br | 6910dc17c79db2fee3f3616206806c5f466b3f00 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/standard-library/reverse-iterator-class.md | ANKerD/cpp-docs.pt-br | 6910dc17c79db2fee3f3616206806c5f466b3f00 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/standard-library/reverse-iterator-class.md | ANKerD/cpp-docs.pt-br | 6910dc17c79db2fee3f3616206806c5f466b3f00 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Classe reverse_iterator | Microsoft Docs
ms.custom: ''
ms.date: 11/04/2016
ms.technology:
- cpp-standard-libraries
ms.topic: reference
f1_keywords:
- xutility/std::reverse_iterator
- iterator/std::reverse_iterator::difference_type
- iterator/std::reverse_iterator::iterator_type
- iterator/std::reverse_iterator::pointer
- iterator/std::reverse_iterator::reference
- iterator/std::reverse_iterator::base
- iterator/std::reverse_iterator::operator_star
dev_langs:
- C++
helpviewer_keywords:
- std::reverse_iterator [C++]
- std::reverse_iterator [C++], difference_type
- std::reverse_iterator [C++], iterator_type
- std::reverse_iterator [C++], pointer
- std::reverse_iterator [C++], reference
- std::reverse_iterator [C++], base
- std::reverse_iterator [C++], operator_star
ms.assetid: c0b34d04-ae9a-4999-9aff-28b313897ffa
author: corob-msft
ms.author: corob
ms.workload:
- cplusplus
ms.openlocfilehash: 348cff70b46af133009703c513ac9d939486cd91
ms.sourcegitcommit: 761c5f7c506915f5a62ef3847714f43e9b815352
ms.translationtype: MT
ms.contentlocale: pt-BR
ms.lasthandoff: 09/07/2018
ms.locfileid: "44105907"
---
# <a name="reverseiterator-class"></a>Classe reverse_iterator
A classe de modelo é um adaptador de iterador que descreve um objeto de iterador inverso que se comporta como um iterador bidirecional ou de acesso aleatório, somente em sentido inverso. Ela permite a travessia regressiva de um intervalo.
## <a name="syntax"></a>Sintaxe
```cpp
template <class RandomIterator>
class reverse_iterator
```
### <a name="parameters"></a>Parâmetros
RandomIterator o tipo que representa o iterador a ser adaptado para operar no sentido inverso.
## <a name="remarks"></a>Comentários
Os contêineres existentes da Biblioteca Padrão C++ também definem os tipos `reverse_iterator` e `const_reverse_iterator` e têm funções membro `rbegin` e `rend` que retornam iteradores inversos. Esses iteradores apresentam semântica de substituição. O `reverse_iterator` adaptador complementa essa funcionalidade, pois oferece semântica de inserção e também pode ser usado com fluxos.
O `reverse_iterator` que requer um iterador bidirecional não deve chamar qualquer um dos membro funções `operator+=`, `operator+`, `operator-=`, `operator-`, ou `operator[]`, que pode ser usado apenas com iteradores de acesso aleatório.
O intervalo de um iterador é [*primeira*, *última*), onde o colchete à esquerda indica a inclusão do *primeiro* e o parêntese à direita indica a inclusão de elementos até, mas excluindo *último* em si. Os mesmos elementos são incluídos na sequência invertida [ **rev** - *primeiro*, **rev** - *último*) para que, se *última* é o elemento de um-ultrapassa o fim em uma sequência, em seguida, o primeiro elemento **rev** - *primeiro* em pontos de sequência invertida para \*(*última* - 1). A identidade que relaciona a todos os iteradores inversos a seus iteradores subjacentes é:
&\*( **reverse_iterator** ( *eu* )) = = &\*( *eu* - 1).
Na prática, isso significa que na sequência invertida, reverse_iterator fará referência ao elemento que está uma posição depois (à direita do) do elemento ao qual o iterador se referiu na sequência original. Desse modo, se um iterador tratou o elemento 6 na sequência (2, 4, 6, 8), `reverse_iterator` tratará o elemento 4 na sequência inversa (8, 6, 4, 2).
### <a name="constructors"></a>Construtores
|Construtor|Descrição|
|-|-|
|[reverse_iterator](#reverse_iterator)|Constrói um `reverse_iterator` padrão ou um `reverse_iterator` de um iterador subjacente.|
### <a name="typedefs"></a>Typedefs
|Nome de tipo|Descrição|
|-|-|
|[difference_type](#difference_type)|Um tipo que fornece a diferença entre dois `reverse_iterator`s que se referem a elementos no mesmo contêiner.|
|[iterator_type](#iterator_type)|Um tipo que fornece um iterador subjacente para um `reverse_iterator`.|
|[pointer](#pointer)|Um tipo que fornece um ponteiro para um elemento tratado por um `reverse_iterator`.|
|[reference](#reference)|Um tipo que fornece uma referência a um elemento tratado por um `reverse_iterator`.|
### <a name="member-functions"></a>Funções de membro
|Função de membro|Descrição|
|-|-|
|[base](#base)|Recupera o iterador subjacente de seu `reverse_iterator`.|
### <a name="operators"></a>Operadores
|Operador|Descrição|
|-|-|
|[operator_star](#op_star)|Retorna o elemento tratado por um `reverse_iterator`.|
|[operator+](#op_add)|Adiciona um deslocamento a um iterador e retorna o novo `reverse_iterator` que trata o elemento inserido na nova posição de deslocamento.|
|[operator++](#op_add_add)|Incrementa o `reverse_iterator` até o próximo elemento.|
|[operator+=](#op_add_eq)|Adiciona um deslocamento especificado de um `reverse_iterator`.|
|[operator-](#operator-)|Subtrai um deslocamento de um `reverse_iterator` e retorna um `reverse_iterator` que trata o elemento na posição do deslocamento.|
|[operator--](#operator--)|Decrementa o `reverse_iterator` para o elemento anterior.|
|[operator-=](#operator-_eq)|Subtrai um deslocamento especificado de um `reverse_iterator`.|
|[operator->](#operator-_gt)|Retorna um ponteiro para o elemento tratado pelo `reverse_iterator`.|
|[operator[]](#op_at)|Retorna uma referência a um deslocamento do elemento tratado por um `reverse_iterator` por um número especificado de posições.|
## <a name="requirements"></a>Requisitos
**Cabeçalho:** \<iterator>
**Namespace:** std
## <a name="base"></a> reverse_iterator::base
Recupera o iterador subjacente de seu `reverse_iterator`.
```cpp
RandomIterator base() const;
```
### <a name="return-value"></a>Valor de retorno
O iterador subjacente a `reverse_iterator`.
### <a name="remarks"></a>Comentários
A identidade que relaciona a todos os iteradores inversos a seus iteradores subjacentes é:
&\*( `reverse_iterator` ( *eu* )) = = &\*( *eu* - 1).
Na prática, isso significa que, na sequência invertida, `reverse_iterator` fará referência ao elemento que está uma posição depois (à direita) do elemento ao qual o iterador se referiu na sequência original. Desse modo, se um iterador tratou o elemento 6 na sequência (2, 4, 6, 8), `reverse_iterator` tratará o elemento 4 na sequência inversa (8, 6, 4, 2).
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_base.cpp
// compile with: /EHsc
#include <iterator>
#include <algorithm>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for ( i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin ( ) ; vIter != vec.end ( ); vIter++ )
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
vector <int>::iterator pos, bpos;
pos = find ( vec.begin ( ), vec.end ( ), 6 );
cout << "The iterator pos points to: " << *pos << "." << endl;
typedef reverse_iterator<vector<int>::iterator>::iterator_type it_vec_int_type;
reverse_iterator<it_vec_int_type> rpos ( pos );
cout << "The reverse_iterator rpos points to: " << *rpos
<< "." << endl;
bpos = rpos.base ( );
cout << "The iterator underlying rpos is bpos & it points to: "
<< *bpos << "." << endl;
}
```
## <a name="difference_type"></a> reverse_iterator::difference_type
Um tipo que fornece a diferença entre dois `reverse_iterator`s que se referem a elementos no mesmo contêiner.
```cpp
typedef typename iterator_traits<RandomIterator>::difference_type difference_type;
```
### <a name="remarks"></a>Comentários
O tipo de diferença `reverse_iterator` é o mesmo que o tipo de diferença do iterador.
O tipo é um sinônimo do typename de característica do iterador `iterator_traits`\< **RandomIterator**> **::pointer**.
### <a name="example"></a>Exemplo
Consulte [reverse_iterator::operator[]](#op_at) para ver um exemplo de como declarar e usar `difference_type`.
## <a name="iterator_type"></a> reverse_iterator::iterator_type
Um tipo que fornece um iterador subjacente para um `reverse_iterator`.
```cpp
typedef RandomIterator iterator_type;
```
### <a name="remarks"></a>Comentários
O tipo é um sinônimo do parâmetro de modelo `Iterator`.
### <a name="example"></a>Exemplo
Consulte [reverse_iterator::base](#base) para ver um exemplo de como declarar e usar `iterator_type`.
## <a name="op_star"></a> reverse_iterator:: Operator\*
Retorna o elemento que um reverse_iterator aborda.
```cpp
reference operator*() const;
```
### <a name="return-value"></a>Valor de retorno
O valor dos elementos abordados pelo reverse_iterator.
### <a name="remarks"></a>Comentários
O operador retornará \*( **atual** - 1).
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_ref.cpp
// compile with: /EHsc
#include <iterator>
#include <algorithm>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for (i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin ( ) ; vIter != vec.end ( ); vIter++ )
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
vector <int>::iterator pos, bpos;
pos = find ( vec.begin ( ), vec.end ( ), 6 );
// Declare a difference type for a parameter
// declare a reference return type
reverse_iterator<vector<int>::iterator>::reference refpos = *pos;
cout << "The iterator pos points to: " << refpos << "." << endl;
}
```
## <a name="op_add"></a> reverse_iterator::operator+
Adiciona um deslocamento a um iterador e retorna o novo `reverse_iterator` que trata o elemento inserido na nova posição de deslocamento.
```cpp
reverse_iterator<RandomIterator> operator+(difference_type Off) const;
```
### <a name="parameters"></a>Parâmetros
*Off*<br/>
O deslocamento a ser adicionado ao iterador inverso.
### <a name="return-value"></a>Valor de retorno
Um `reverse_iterator` que trata o elemento de deslocamento.
### <a name="remarks"></a>Comentários
Essa função de membro pode ser usada somente se o `reverse_iterator` satisfizer os requisitos de um iterador de acesso aleatório.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_add.cpp
// compile with: /EHsc
#include <iterator>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for (i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin( ) ; vIter != vec.end( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
// Initializing reverse_iterators to the first element
vector <int>::reverse_iterator rVPOS1 = vec.rbegin ( );
cout << "The iterator rVPOS1 initially points to the first "
<< "element\n in the reversed sequence: "
<< *rVPOS1 << "." << endl;
vector <int>::reverse_iterator rVPOS2 =rVPOS1 + 2; // offset added
cout << "After the +2 offset, the iterator rVPOS2 points\n"
<< " to the 3rd element in the reversed sequence: "
<< *rVPOS2 << "." << endl;
}
```
```Output
The vector vec is: ( 2 4 6 8 10 ).
The vector vec reversed is: ( 10 8 6 4 2 ).
The iterator rVPOS1 initially points to the first element
in the reversed sequence: 10.
After the +2 offset, the iterator rVPOS2 points
to the 3rd element in the reversed sequence: 6.
```
## <a name="op_add_add"></a> reverse_iterator::operator++
Incrementa o reverse_iterator para o elemento anterior.
```cpp
reverse_iterator<RandomIterator>& operator++();
reverse_iterator<RandomIterator> operator++(int);
```
### <a name="return-value"></a>Valor de retorno
O primeiro operador retorna o `reverse_iterator` pré-incrementado e o segundo, o operador pós-incrementado, retorna uma cópia do `reverse_iterator` incrementado.
### <a name="remarks"></a>Comentários
Essa função de membro só pode ser usada se o `reverse_iterator` satisfizer os requisitos de um iterador bidirecional.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_incr.cpp
// compile with: /EHsc
#include <iterator>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for ( i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i - 1 );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin( ) ; vIter != vec.end( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
// Initializing reverse_iterators to the last element
vector <int>::reverse_iterator rVPOS1 = vec.rbegin( );
cout << "The iterator rVPOS1 initially points to the first "
<< "element\n in the reversed sequence: "
<< *rVPOS1 << "." << endl;
rVPOS1++; // postincrement, preincrement: ++rVPSO1
cout << "After incrementing, the iterator rVPOS1 points\n"
<< " to the second element in the reversed sequence: "
<< *rVPOS1 << "." << endl;
}
```
```Output
The vector vec is: ( 1 3 5 7 9 ).
The vector vec reversed is: ( 9 7 5 3 1 ).
The iterator rVPOS1 initially points to the first element
in the reversed sequence: 9.
After incrementing, the iterator rVPOS1 points
to the second element in the reversed sequence: 7.
```
## <a name="op_add_eq"></a> reverse_iterator::operator+=
Adiciona um deslocamento especificado de um reverse_iterator.
```cpp
reverse_iterator<RandomIterator>& operator+=(difference_type Off);
```
### <a name="parameters"></a>Parâmetros
*Off*<br/>
O deslocamento pelo qual incrementar o iterador.
### <a name="return-value"></a>Valor de retorno
Uma referência ao elemento tratado pelo `reverse_iterator`.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_addoff.cpp
// compile with: /EHsc
#include <iterator>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for (i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin( ) ; vIter != vec.end( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
// Initializing reverse_iterators to the last element
vector <int>::reverse_iterator rVPOS1 = vec.rbegin ( );
cout << "The iterator rVPOS1 initially points to the first "
<< "element\n in the reversed sequence: "
<< *rVPOS1 << "." << endl;
rVPOS1+=2; // addition of an offset
cout << "After the +2 offset, the iterator rVPOS1 now points\n"
<< " to the third element in the reversed sequence: "
<< *rVPOS1 << "." << endl;
}
```
```Output
The vector vec is: ( 2 4 6 8 10 ).
The vector vec reversed is: ( 10 8 6 4 2 ).
The iterator rVPOS1 initially points to the first element
in the reversed sequence: 10.
After the +2 offset, the iterator rVPOS1 now points
to the third element in the reversed sequence: 6.
```
## <a name="reverse_iterator__operator-"></a> reverse_iterator::operator-
Subtrai um deslocamento de um `reverse_iterator` e retorna um `reverse_iterator` que trata o elemento na posição do deslocamento.
```cpp
reverse_iterator<RandomIterator> operator-(difference_type Off) const;
```
### <a name="parameters"></a>Parâmetros
*Off*<br/>
O deslocamento a ser subtraído do reverse_iterator.
### <a name="return-value"></a>Valor de retorno
Um `reverse_iterator` que trata o elemento de deslocamento.
### <a name="remarks"></a>Comentários
Essa função de membro pode ser usada somente se o `reverse_iterator` satisfizer os requisitos de um iterador de acesso aleatório.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_sub.cpp
// compile with: /EHsc
#include <iterator>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for ( i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 3 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin( ) ; vIter != vec.end( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
// Initializing reverse_iterators to the first element
vector <int>::reverse_iterator rVPOS1 = vec.rend ( ) - 1;
cout << "The iterator rVPOS1 initially points to the last "
<< "element\n in the reversed sequence: "
<< *rVPOS1 << "." << endl;
vector <int>::reverse_iterator rVPOS2 =rVPOS1 - 2; // offset subtracted
cout << "After the -2 offset, the iterator rVPOS2 points\n"
<< " to the 2nd element from the last in the reversed sequence: "
<< *rVPOS2 << "." << endl;
}
```
```Output
The vector vec is: ( 3 6 9 12 15 ).
The vector vec reversed is: ( 15 12 9 6 3 ).
The iterator rVPOS1 initially points to the last element
in the reversed sequence: 3.
After the -2 offset, the iterator rVPOS2 points
to the 2nd element from the last in the reversed sequence: 9.
```
## <a name="reverse_iterator__operator--"></a> reverse_iterator::operator--
Decrementa o reverse_iterator para o elemento anterior.
```cpp
reverse_iterator<RandomIterator>& operator--();
reverse_iterator<RandomIterator> operator--(int);
```
### <a name="return-value"></a>Valor de retorno
O primeiro operador retorna o `reverse_iterator` pré-decrementado e o segundo, o operador pós-decrementado, retorna uma cópia do `reverse_iterator` decrementado.
### <a name="remarks"></a>Comentários
Essa função de membro só pode ser usada se o `reverse_iterator` satisfizer os requisitos de um iterador bidirecional.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_decr.cpp
// compile with: /EHsc
#include <iterator>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for (i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i - 1 );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin( ) ; vIter != vec.end( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
// Initializing reverse_iterators to the first element
vector <int>::reverse_iterator rVPOS1 = vec.rend ( ) - 1;
cout << "The iterator rVPOS1 initially points to the last "
<< "element\n in the reversed sequence: "
<< *rVPOS1 << "." << endl;
rVPOS1--; // postdecrement, predecrement: --rVPSO1
cout << "After the decrement, the iterator rVPOS1 points\n"
<< " to the next-to-last element in the reversed sequence: "
<< *rVPOS1 << "." << endl;
}
```
```Output
The vector vec is: ( 1 3 5 7 9 ).
The vector vec reversed is: ( 9 7 5 3 1 ).
The iterator rVPOS1 initially points to the last element
in the reversed sequence: 1.
After the decrement, the iterator rVPOS1 points
to the next-to-last element in the reversed sequence: 3.
```
## <a name="reverse_iterator__operator-_eq"></a> reverse_iterator::operator-=
Subtrai um deslocamento especificado de um `reverse_iterator`.
```cpp
reverse_iterator<RandomIterator>& operator-=(difference_type Off);
```
### <a name="parameters"></a>Parâmetros
*Off*<br/>
O deslocamento a ser subtraído de `reverse_iterator`.
### <a name="remarks"></a>Comentários
Essa função de membro pode ser usada somente se o `reverse_iterator` satisfizer os requisitos de um iterador de acesso aleatório.
O operador avalia **current** + _ *Off*. em seguida, retorna **\*isso**.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_op_suboff.cpp
// compile with: /EHsc
#include <iterator>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for (i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 3 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin( ) ; vIter != vec.end( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
// Initializing reverse_iterators to the first element
vector <int>::reverse_iterator rVPOS1 = vec.rend ( ) - 1;
cout << "The iterator rVPOS1 initially points to the last "
<< "element\n in the reversed sequence: "
<< *rVPOS1 << "." << endl;
rVPOS1-=2; // Subtraction of an offset
cout << "After the -2 offset, the iterator rVPOS1 now points\n"
<< " to the 2nd element from the last in the reversed sequence: "
<< *rVPOS1 << "." << endl;
}
```
```Output
The vector vec is: ( 3 6 9 12 15 ).
The vector vec reversed is: ( 15 12 9 6 3 ).
The iterator rVPOS1 initially points to the last element
in the reversed sequence: 3.
After the -2 offset, the iterator rVPOS1 now points
to the 2nd element from the last in the reversed sequence: 9.
```
## <a name="op_arrow"></a> reverse_iterator::operator->
Retorna um ponteiro para o elemento tratado pelo `reverse_iterator`.
```cpp
pointer operator->() const;
```
### <a name="return-value"></a>Valor de retorno
Um ponteiro para o elemento tratado pelo `reverse_iterator`.
### <a name="remarks"></a>Comentários
O operador retorna **&\*\*this**.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_ptrto.cpp
// compile with: /EHsc
#include <iterator>
#include <algorithm>
#include <vector>
#include <utility>
#include <iostream>
int main( )
{
using namespace std;
typedef vector<pair<int,int> > pVector;
pVector vec;
vec.push_back(pVector::value_type(1,2));
vec.push_back(pVector::value_type(3,4));
vec.push_back(pVector::value_type(5,6));
pVector::iterator pvIter;
cout << "The vector vec of integer pairs is:\n( ";
for ( pvIter = vec.begin ( ) ; pvIter != vec.end ( ); pvIter++)
cout << "( " << pvIter -> first << ", " << pvIter -> second << ") ";
cout << ")" << endl << endl;
pVector::reverse_iterator rpvIter;
cout << "The vector vec reversed is:\n( ";
for ( rpvIter = vec.rbegin( ) ; rpvIter != vec.rend( ); rpvIter++ )
cout << "( " << rpvIter -> first << ", " << rpvIter -> second << ") ";
cout << ")" << endl << endl;
pVector::iterator pos = vec.begin ( );
pos++;
cout << "The iterator pos points to:\n( " << pos -> first << ", "
<< pos -> second << " )" << endl << endl;
pVector::reverse_iterator rpos (pos);
// Use operator -> with return type: why type int and not int*
int fint = rpos -> first;
int sint = rpos -> second;
cout << "The reverse_iterator rpos points to:\n( " << fint << ", "
<< sint << " )" << endl;
}
```
```Output
The vector vec of integer pairs is:
( ( 1, 2) ( 3, 4) ( 5, 6) )
The vector vec reversed is:
( ( 5, 6) ( 3, 4) ( 1, 2) )
The iterator pos points to:
( 3, 4 )
The reverse_iterator rpos points to:
( 1, 2 )
```
## <a name="op_at"></a> reverse_iterator::operator[]
Retorna uma referência a um deslocamento do elemento tratado por um `reverse_iterator` por um número especificado de posições.
```cpp
reference operator[](difference_type Off) const;
```
### <a name="parameters"></a>Parâmetros
*Off*<br/>
O deslocamento do endereço `reverse_iterator`.
### <a name="return-value"></a>Valor de retorno
A referência ao deslocamento de elemento.
### <a name="remarks"></a>Comentários
O operador retorna <strong>\*</strong>( **\*this** + `Off`).
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_ret_ref.cpp
// compile with: /EHsc
#include <iterator>
#include <algorithm>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for (i = 1 ; i < 6 ; ++i )
{
vec.push_back ( 2 * i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin ( ) ; vIter != vec.end ( ); vIter++ )
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
vector <int>::iterator pos;
pos = find ( vec.begin ( ), vec.end ( ), 8 );
reverse_iterator<vector<int>::iterator> rpos ( pos );
// Declare a difference type for a parameter
reverse_iterator<vector<int>::iterator>::difference_type diff = 2;
cout << "The iterator pos points to: " << *pos << "." << endl;
cout << "The iterator rpos points to: " << *rpos << "." << endl;
// Declare a reference return type & use operator[]
reverse_iterator<vector<int>::iterator>::reference refrpos = rpos [diff];
cout << "The iterator rpos now points to: " << refrpos << "." << endl;
}
```
```Output
The vector vec is: ( 2 4 6 8 10 ).
The vector vec reversed is: ( 10 8 6 4 2 ).
The iterator pos points to: 8.
The iterator rpos points to: 6.
The iterator rpos now points to: 2.
```
## <a name="pointer"></a> reverse_iterator::pointer
Um tipo que fornece um ponteiro para um elemento tratado por um `reverse_iterator`.
```cpp
typedef typename iterator_traits<RandomIterator>::pointer pointer;
```
### <a name="remarks"></a>Comentários
O tipo é um sinônimo do typename de característica do iterador `iterator_traits`\< *RandomIterator*> **::pointer**.
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_pointer.cpp
// compile with: /EHsc
#include <iterator>
#include <algorithm>
#include <vector>
#include <utility>
#include <iostream>
int main( )
{
using namespace std;
typedef vector<pair<int,int> > pVector;
pVector vec;
vec.push_back( pVector::value_type( 1,2 ) );
vec.push_back( pVector::value_type( 3,4 ) );
vec.push_back( pVector::value_type( 5,6 ) );
pVector::iterator pvIter;
cout << "The vector vec of integer pairs is:\n" << "( ";
for ( pvIter = vec.begin ( ) ; pvIter != vec.end ( ); pvIter++)
cout << "( " << pvIter -> first << ", " << pvIter -> second << ") ";
cout << ")" << endl;
pVector::reverse_iterator rpvIter;
cout << "\nThe vector vec reversed is:\n" << "( ";
for ( rpvIter = vec.rbegin( ) ; rpvIter != vec.rend( ); rpvIter++)
cout << "( " << rpvIter -> first << ", " << rpvIter -> second << ") ";
cout << ")" << endl;
pVector::iterator pos = vec.begin ( );
pos++;
cout << "\nThe iterator pos points to:\n"
<< "( " << pos -> first << ", "
<< pos -> second << " )" << endl;
pVector::reverse_iterator rpos (pos);
cout << "\nThe iterator rpos points to:\n"
<< "( " << rpos -> first << ", "
<< rpos -> second << " )" << endl;
}
```
```Output
The vector vec of integer pairs is:
( ( 1, 2) ( 3, 4) ( 5, 6) )
The vector vec reversed is:
( ( 5, 6) ( 3, 4) ( 1, 2) )
The iterator pos points to:
( 3, 4 )
The iterator rpos points to:
( 1, 2 )
```
## <a name="reference"></a> reverse_iterator::reference
Um tipo que fornece uma referência a um elemento tratado por um reverse_iterator.
```cpp
typedef typename iterator_traits<RandomIterator>::reference reference;
```
### <a name="remarks"></a>Comentários
O tipo é um sinônimo do typename de característica do iterador `iterator_traits`\< *RandomIterator*> **::reference**.
### <a name="example"></a>Exemplo
Ver [reverse_iterator:: Operator[ ] ](#op_at) ou [reverse_iterator:: Operator *](#op_star) para obter exemplos de como declarar e usar `reference`.
## <a name="reverse_iterator"></a> reverse_iterator::reverse_iterator
Constrói um `reverse_iterator` padrão ou um `reverse_iterator` de um iterador subjacente.
```cpp
reverse_iterator();
explicit reverse_iterator(RandomIterator right);
template <class Type>
reverse_iterator(const reverse_iterator<Type>& right);
```
### <a name="parameters"></a>Parâmetros
*right*<br/>
O iterador deve ser adaptado para um `reverse_iterator`.
### <a name="return-value"></a>Valor de retorno
Um `reverse_iterator` padrão ou um `reverse_iterator` que adapta um iterador subjacente.
### <a name="remarks"></a>Comentários
A identidade que relaciona a todos os iteradores inversos a seus iteradores subjacentes é:
&\*( `reverse_iterator` ( *eu* )) = = &\*( *eu* - 1).
Na prática, isso significa que na sequência invertida, reverse_iterator fará referência ao elemento que está uma posição depois (à direita do) do elemento ao qual o iterador se referiu na sequência original. Desse modo, se um iterador tratou o elemento 6 na sequência (2, 4, 6, 8), `reverse_iterator` tratará o elemento 4 na sequência inversa (8, 6, 4, 2).
### <a name="example"></a>Exemplo
```cpp
// reverse_iterator_reverse_iterator.cpp
// compile with: /EHsc
#include <iterator>
#include <algorithm>
#include <vector>
#include <iostream>
int main( )
{
using namespace std;
int i;
vector<int> vec;
for ( i = 1 ; i < 6 ; ++i )
{
vec.push_back ( i );
}
vector <int>::iterator vIter;
cout << "The vector vec is: ( ";
for ( vIter = vec.begin ( ) ; vIter != vec.end ( ); vIter++)
cout << *vIter << " ";
cout << ")." << endl;
vector <int>::reverse_iterator rvIter;
cout << "The vector vec reversed is: ( ";
for ( rvIter = vec.rbegin( ) ; rvIter != vec.rend( ); rvIter++)
cout << *rvIter << " ";
cout << ")." << endl;
vector <int>::iterator pos;
pos = find ( vec.begin ( ), vec.end ( ), 4 );
cout << "The iterator pos = " << *pos << "." << endl;
vector <int>::reverse_iterator rpos ( pos );
cout << "The reverse_iterator rpos = " << *rpos
<< "." << endl;
}
```
## <a name="see-also"></a>Consulte também
[\<iterator>](../standard-library/iterator.md)<br/>
[Acesso Thread-Safe na Biblioteca Padrão C++](../standard-library/thread-safety-in-the-cpp-standard-library.md)<br/>
[Referência da biblioteca padrão C++](../standard-library/cpp-standard-library-reference.md)<br/>
| 30.076181 | 578 | 0.657892 | por_Latn | 0.547591 |
b06fabdbbf37be7267c2836b008ebdfa391fbee3 | 23 | md | Markdown | README.md | Jason-Zhang-Cyber/Welcome | 0db4a34686ba35326c333948e00e9a271e2e792c | [
"MIT"
] | null | null | null | README.md | Jason-Zhang-Cyber/Welcome | 0db4a34686ba35326c333948e00e9a271e2e792c | [
"MIT"
] | null | null | null | README.md | Jason-Zhang-Cyber/Welcome | 0db4a34686ba35326c333948e00e9a271e2e792c | [
"MIT"
] | null | null | null | # Welcome
Welcome back
| 7.666667 | 12 | 0.782609 | eng_Latn | 0.532902 |
b0712438fee483408831f4ccb5a5136deacd69b7 | 73 | md | Markdown | README.md | pirtor/babel-plugin-auto-console | 0c1a84d305740d97dfc5f71b39adab6acdead4d1 | [
"MIT"
] | null | null | null | README.md | pirtor/babel-plugin-auto-console | 0c1a84d305740d97dfc5f71b39adab6acdead4d1 | [
"MIT"
] | null | null | null | README.md | pirtor/babel-plugin-auto-console | 0c1a84d305740d97dfc5f71b39adab6acdead4d1 | [
"MIT"
] | null | null | null | # babel-plugin-auto-console
babel plugin to wrap statements with console
| 24.333333 | 44 | 0.821918 | eng_Latn | 0.863994 |
b071491cbccfe5786899b894f82a809ed0b43407 | 1,617 | md | Markdown | README.md | raylas/ansible-role-proxmox-lxc | 84df9652c798acee36e8c7439e4cc14855c2ff02 | [
"MIT"
] | 1 | 2020-11-18T16:11:39.000Z | 2020-11-18T16:11:39.000Z | README.md | raylas/ansible-role-proxmox-lxc | 84df9652c798acee36e8c7439e4cc14855c2ff02 | [
"MIT"
] | null | null | null | README.md | raylas/ansible-role-proxmox-lxc | 84df9652c798acee36e8c7439e4cc14855c2ff02 | [
"MIT"
] | null | null | null | Ansible Role: Proxmox LXC
=========
Simplifies the creation and basic provisioning of LXC containers on [Proxmox](https://www.proxmox.com/en/) hosts.
Requirements
------------
A PVE host and desired LXC containers defined in your inventory.
Role Variables
--------------
Available variables are listed below:
```
api_host: 'orange'
api_user: 'root@pam'
```
**Required**: Specify the hostname (or IP address) and user for the target PVE host.
```
api_password: '<pve_api_password>'
ssh_pubkey: 'ssh-rsa ...'
```
The PVE password (**required**) and default SSH public key for new containers. Preferably defined in an ansible vault.
```
defaults:
node: 'orange'
storage: 'local-zfs'
cores: '1'
memory: '1024'
disk: '3'
onboot: yes
pubkey: '{{ ssh_pubkey }}'
nameserver: '1.1.1.1,8.8.8.8'
ostemplate: 'bulk:vztmpl/centos-8-with_ssh-20200402_amd64.tar.gz'
network: '{"net0":"name=eth0,ip=dhcp,ip6=dhcp,bridge=vmbr1"}'
```
**Required**: Your defaults for LXC containers, maybe in a group_var.
```
node: 'orange'
vmid: '240'
cores: '2'
memory: '2048'
swap: '0'
disk: '10'
onboot: yes
ostemplate: 'bulk:vztmpl/centos-8-with_ssh-20200402_amd64.tar.gz'
network: '{"net0":"name=eth0,ip=10.64.64.240/24,gw=10.64.164.1,bridge=vmbr4"}'
```
Individual host_vars file for each container.
Dependencies
------------
None.
Example Playbook
----------------
```
- name: create and start LXC container(s)
hosts: proxmox
gather_facts: no
roles:
- proxmox-lxc
```
License
-------
MIT
Author Information
------------------
This role was created in 2020 by [Raymond Douglas](https://rymnd.org).
| 19.962963 | 118 | 0.667285 | eng_Latn | 0.741717 |
b07172e390d314fee830502ba85783e33c236a0f | 353 | md | Markdown | README.md | Enlapser/enlapser-camera-connect | a9eb071e66526c827c0e97a91aa8433cb13483ee | [
"Apache-2.0"
] | null | null | null | README.md | Enlapser/enlapser-camera-connect | a9eb071e66526c827c0e97a91aa8433cb13483ee | [
"Apache-2.0"
] | 4 | 2017-11-20T20:51:42.000Z | 2017-11-20T20:58:18.000Z | README.md | Enlapser/enlapser-camera-connect | a9eb071e66526c827c0e97a91aa8433cb13483ee | [
"Apache-2.0"
] | null | null | null | # enlapser-camera-connect
Here you will eventually find guides and code to connect your camera to the Enlapser Cloud.
For now, please check out our [Issues](https://github.com/Enlapser/enlapser-camera-connect/issues) for an issue relating to your camera model and participate in planning.
And please let us know which camera you want support for.
| 39.222222 | 171 | 0.790368 | eng_Latn | 0.99547 |
b071cbdd7655ba0e3dc773c7094fb6ac0d932142 | 1,874 | md | Markdown | documents/amazon-redshift-developer-guide/doc_source/r_LN.md | siagholami/aws-documentation | 2d06ee9011f3192b2ff38c09f04e01f1ea9e0191 | [
"CC-BY-4.0"
] | 5 | 2021-08-13T09:20:58.000Z | 2021-12-16T22:13:54.000Z | documents/amazon-redshift-developer-guide/doc_source/r_LN.md | siagholami/aws-documentation | 2d06ee9011f3192b2ff38c09f04e01f1ea9e0191 | [
"CC-BY-4.0"
] | null | null | null | documents/amazon-redshift-developer-guide/doc_source/r_LN.md | siagholami/aws-documentation | 2d06ee9011f3192b2ff38c09f04e01f1ea9e0191 | [
"CC-BY-4.0"
] | null | null | null | # LN function<a name="r_LN"></a>
Returns the natural logarithm of the input parameter\. Synonym of the DLOG1 function\.
Synonym of [DLOG1 function](r_DLOG1.md)\.
## Syntax<a name="r_LN-synopsis"></a>
```
LN(expression)
```
## Argument<a name="r_LN-argument"></a>
*expression*
The target column or expression that the function operates on\.
This function returns an error for some data types if the expression references an Amazon Redshift user\-created table or an Amazon Redshift STL or STV system table\.
Expressions with the following data types produce an error if they reference a user\-created or system table\. Expressions with these data types run exclusively on the leader node:
+ BOOLEAN
+ CHAR
+ DATE
+ DECIMAL or NUMERIC
+ TIMESTAMP
+ VARCHAR
Expressions with the following data types run successfully on user\-created tables and STL or STV system tables:
+ BIGINT
+ DOUBLE PRECISION
+ INTEGER
+ REAL
+ SMALLINT
## Return type<a name="r_LN-return-type"></a>
The LN function returns the same type as the expression\.
## Example<a name="r_LN-example"></a>
The following example returns the natural logarithm, or base e logarithm, of the number 2\.718281828:
```
select ln(2.718281828);
ln
--------------------
0.9999999998311267
(1 row)
```
Note that the answer is nearly equal to 1\.
This example returns the natural logarithm of the values in the USERID column in the USERS table:
```
select username, ln(userid) from users order by userid limit 10;
username | ln
----------+-------------------
JSG99FHE | 0
PGL08LJI | 0.693147180559945
IFT66TXU | 1.09861228866811
XDZ38RDD | 1.38629436111989
AEB55QTM | 1.6094379124341
NDQ15VBM | 1.79175946922805
OWY35QYB | 1.94591014905531
AZG78YIP | 2.07944154167984
MSD36KVR | 2.19722457733622
WKW41AIW | 2.30258509299405
(10 rows)
``` | 27.558824 | 183 | 0.708645 | eng_Latn | 0.926847 |
b072770460ab00685ec0e288e4936d74b150fbf8 | 1,628 | md | Markdown | Packs/KasperskySecurityCenter/README.md | diCagri/content | c532c50b213e6dddb8ae6a378d6d09198e08fc9f | [
"MIT"
] | 799 | 2016-08-02T06:43:14.000Z | 2022-03-31T11:10:11.000Z | Packs/KasperskySecurityCenter/README.md | diCagri/content | c532c50b213e6dddb8ae6a378d6d09198e08fc9f | [
"MIT"
] | 9,317 | 2016-08-07T19:00:51.000Z | 2022-03-31T21:56:04.000Z | Packs/KasperskySecurityCenter/README.md | diCagri/content | c532c50b213e6dddb8ae6a378d6d09198e08fc9f | [
"MIT"
] | 1,297 | 2016-08-04T13:59:00.000Z | 2022-03-31T23:43:06.000Z | Note: This is a beta pack, which lets you implement and test pre-release software.
Since the pack is beta, it might contain bugs. Updates to the pack during the beta phase might include non-backward compatible features.
We appreciate your feedback on the quality and usability of the pack to help us identify issues, fix them, and continually improve.
The integration in this pack enables you to manage your endpoints and groups.
## What does this pack do?
The integration in this pack enables you to run commands that:
- Returns a list of hosts based on your specified filter.
- Returns details of a specified host, such as the endpoint ID, hostname, domain, etc.
- Returns a list of groups based on your specified filter.
- Creates a new administrative group.
- Deletes an administrative group.
- Returns limited attributes for all software applications, such as a software application display name, version, etc.
- Returns limited attributes for all software application updates, such as classification of the update, patch ID, etc.
- Retrieves software applications for a specified host.
- Retrieves updates for a specified host.
- Retrieves information about policies located in a specified group, such as policy name, creating date, whether the policy is active, etc.
- Retrieves information about a specified policy, such as policy name, creating date, whether the policy is active, etc.
## Prerequisites
The user should be assigned to a role with the relevant devices in scope, and the following access rights:
- Basic functionality - Read
- Management of administration groups - Modify
| 60.296296 | 140 | 0.780713 | eng_Latn | 0.999284 |
b0728f6959586901aa4ffef885a9955957368b33 | 8,065 | md | Markdown | O2/O2-Teori.md | SjoenH/TDT4120-2018 | fcee77a921cc3437e226d42910848892e3d481a5 | [
"MIT"
] | null | null | null | O2/O2-Teori.md | SjoenH/TDT4120-2018 | fcee77a921cc3437e226d42910848892e3d481a5 | [
"MIT"
] | null | null | null | O2/O2-Teori.md | SjoenH/TDT4120-2018 | fcee77a921cc3437e226d42910848892e3d481a5 | [
"MIT"
] | null | null | null | # Øving 2
<!-- TOC -->
- [Øving 2](#øving-2)
- [Oppgave 1.](#oppgave-1)
- [Oppgave 2](#oppgave-2)
- [Oppgave 3.](#oppgave-3)
- [Oppgave 4.](#oppgave-4)
- [Oppgave 5.](#oppgave-5)
- [Oppgave 6.](#oppgave-6)
- [Oppgave 7. Sirkulær dobbel-lenket liste](#oppgave-7-sirkulær-dobbel-lenket-liste)
- [Oppgave 8.](#oppgave-8)
- [Oppgave 9](#oppgave-9)
- [Oppgave 10. Implementering av pekere og objekter](#oppgave-10-implementering-av-pekere-og-objekter)
- [Oppgave 11. Implementering av pekere og objekter](#oppgave-11-implementering-av-pekere-og-objekter)
- [Oppgave 12. Hashfunksjon](#oppgave-12-hashfunksjon)
- [Oppgave 13. Hashfunksjon](#oppgave-13-hashfunksjon)
- [Oppgave 14. Hashfunksjon](#oppgave-14-hashfunksjon)
- [Oppgave 15. Hashfunksjon](#oppgave-15-hashfunksjon)
- [Oppgave 16. Kjedet hashtabell](#oppgave-16-kjedet-hashtabell)
- [Oppgave 17. Kjedet hashtabell](#oppgave-17-kjedet-hashtabell)
- [Oppgave 18. Amortisert analyse](#oppgave-18-amortisert-analyse)
- [Oppgave 19. Binærtre](#oppgave-19-binærtre)
- [Oppgave 20. Amortisert analyse](#oppgave-20-amortisert-analyse)
<!-- /TOC -->
**Enqueue** => Legger til element etter halen(tail) i køen.
**Dequeue** => Fjerner Hodet. (flytter peker ett steg bak i køen)
**Sentinels** => Dummy object with pointer to the first and last node. All nodes, where their pointers are Nil, gets pointed to the sentinel. Therefore, the last node will point back to the start of the list.
## Oppgave 1.
``Q = [4, 7, 32, 72, 3]``
Enqueue(Q,3)
Answer:
``Q = [4, 7, 32, 72, 3, 3]``
## Oppgave 2
``Q = [4, 7, 32, 72, 3]``
Dequeue(Q)
Answer:
``Q = [ 7, 32, 72, 3]``
## Oppgave 3.
``Q = [4, 7, 32, 72, 3]``
Hva er det minste antallet enqueue/dequeue operasjoner du trenger for at køen Q skal endres til `[3,4,7,32,72,3]`
```
Q1 = [4, 7, 32, 72, 3]
Q2 = [*3*, 4, 7, 32, 72, 3]
```
Answer:
`(Dequeue * 4) + (Enqueue * 5) = 9 Enqueue/Dequeue operasjoner`
## Oppgave 4.
Anta du har en stakk
``S = [4,7,32,72,3]``
Hvor det bakerste elementet reperesenterer toppen av stakken slik som de definerer i kapittel 10.1 i læreboken.
Hvordan vil stakken se ut etter å ha kjørt Push(S,3)?
``S = [4,7,32,72,3]``
``Push(S,3) => [4,7,32,72,3,3]``
## Oppgave 5.
Hvordan vil stakken se ut etter å ha kjørt POP(S)?
``S = [4,7,32,72,3]
Push(S,3) => [4,7,32,72]``
## Oppgave 6.
Hva er det minste antallet PUSH/POP operasjoner du trenger for at stakken S skal endres til ``[3,4,7,32,72,3]``
```
S = [4,7,32,72,3]
POP * 5 + PUSH 6 = 11 PUSH/POP operasjoner
```
Siden 3 skal være underste element, må man fjerne alle elementer `(POP * 5)` for så å legge til hele stakken. `(PUSH * 6)`
## Oppgave 7. Sirkulær dobbel-lenket liste
Anta at du har en sirkulær dobbel lenket liste.
`L = [4,7,32,72,3]`
Hvor hodet peker på 4-tallet.
Hvordan vil listen se ut etter LIST-SEARCH(L,4) som definert i kapittel 10.2 i læreboken?
```
L = [4,7,32,72,3]
LIST-SEARCH(L,4)
NOTHING HAPPENS WHEN JUST SEARCHING...
POINTER JUST GETS MOVED AROUND
L = [4,7,32,72,3]
```
## Oppgave 8.
Hvordan vil listen se ut etter LIST-INSERT(L,X) for en node X med X.KEY = 3?
```
L = [4,7,32,72,3]
X.Key = 3
LIST-INSERT(L,X)
L = [3, 4, 7, 32, 72, 3]
```
## Oppgave 9
`L = [4,7,32,72,3]`
Hvordan vil listen se ut etter LIST-DELETE(L,X) for en node X med X.KEY = 4?
```
L = [4,7,32,72,3]
X.Key = 3
LIST-DELETE(L,X)
L = [7, 32, 72, 3]
```
## Oppgave 10. Implementering av pekere og objekter
Vi ønsker a implementere L som en tabell av objekter tilsvarende som i Cormen (figur 10.5 s242). Hviklet av alternativene under for startvariabel I og arrayene **N = next**, **K = key** og **P = prev** er korrekt implementert?
```
L = [4,7,32,72,3]
```
"*/*"-indikerer tomt felt
a)
I = 2,
```
1 2 3 4 5 6
N = [/, 6, 1, 3, 0, 4]
K = [3, 4, 72, 32, 0, 7]
P = [3, /, 4, 1, 0, 2]
```
Wrong: ``L[4]``.prev is 1. Should be 6.
i=4
```
| i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| ---- | -- | -- | -- | -- | -- | -- | -- | -- |
| Next | 8 | 6 | / | 1 | 0 | 0 | 0 | 2 |
| Key | 7 | 32 | 72 | 4 | 0 | 0 | 0 | 3 |
| Prev | 4 | 8 | 2 | / | 0 | 0 | 0 | 1 |
```
**The one under here is correct.**
The one that starts on i=7
i = 7
```
| i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| ---- | -- | -- | -- | -- | -- | -- | -- | -- |
| Next | 3 | 0 | 4 | / | 0 | 1 | 6 | 0 |
| Key | 32 | 0 | 72 | 3 | 0 | 7 | 4 | 0 |
| Prev | 6 | 0 | 1 | 3 | 0 | 7 | / | 0 |
```
## Oppgave 11. Implementering av pekere og objekter
Vi ønsker a implementere L som en tabell av objekter tilsvarende som i Cormen (figur 10.6 s243). Hviklet av alternativene under for startvariabel I og arrayene **N = next**, **K = key** og **P = prev** er korrekt implementert?
**tldr**: Svaralternativ som begynner med 4.
``L = [4,7,32,72,3]``
a)
I = 4
```
| i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| ------------- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- |
| Key,Next,Prev | 72 | 13 | 10 | 4 | 7 | / | 7 | 10 | 4 | 32 | 1 | 7 | 3 | / | 1 |
```
**Denne er korrekt. Altså den Ovenfor her**
``L = [4,7,32,72,3]``
b)
I = 13
```
| i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| ------------- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- |
| Key,Next,Prev | 0 | 0 | 0 | 7 | 1 | 13 | 32 | 4 | 22 | 0 | 0 | 0 | 4 | 13 | / | 3 | / | 4 | 0 | 0 | 0 | 72 | 16 | 1 |
```
Nope, fordi ``L[13].next == 13``...
``L = [4,7,32,72,3]``
d)
I = 19
```
| i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| ------------- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- | -- |
| Key,Next,Prev | 32 | 7 | 13 | 0 | 0 | 0 | 72 | 16 | 1 | 0 | 0 | 0 | 7 | 1 | 19 | 3 | / | 9 | 4 | 13 | / | 0 | 0 | 0 |
| | | | | | | | | | | | | | | | | | | | | | | | | |
```
Går fint helt til vi skal traversere bakover...
## Oppgave 12. Hashfunksjon
Du får oppgitt at ``x.key = m`` og ``h(m)=j`` der ``h`` er en hashfunksjon. Da er...
`x` elementet, `m` nøkkelen og `j` hashjen.
## Oppgave 13. Hashfunksjon
Hva betyr kollisjon (eng. collision) i forbindelse med hashtabeller?
d -> Flere ulike faktiske nøkler gir samme hashverdi.
## Oppgave 14. Hashfunksjon
En god hashfunksjon vil, for en tabell av lengde n, kunne garantere at ``k < n`` innsettinger ikke vil gi kollisjon?
Hva er K?
Svar: `Nei`
## Oppgave 15. Hashfunksjon
Svar: nei. Vi kan ikke finne igjen elementet etter innsetting. Iallefall vanskelig. Og tilfeldig.
## Oppgave 16. Kjedet hashtabell
Hvis vi har en funksjon DELETE(T,x) der `T` er en kjedet hashtabell og `x` er et listenode, så er worst case kjøretid...
Svar: O(n) for enkel lenket liste og O(1) dobbel lenket liste.
Ikke O(n)...
## Oppgave 17. Kjedet hashtabell
Hva er worst-case kjøretiden for innsetting in en hashtabell om man bruker kjeding ved kollisjoner? Anta at innsettingen også må sjekke om elementet allerede finnes i tabellen.
Svar: `O(n)`
## Oppgave 18. Amortisert analyse
For å unngå at vi lager for stor initiell hashtabell ønsker vi å doble størrelsen på hastabellen hvor gang lastfaktoren bilr 1/4.
Hvis vi benytter Amortisert analyse får vi at kjøretiden for innsetting er...
Svar: `O(1). Oppdatering! Oppgavesvaret er feil. Skulle ha vaert O(n)...`
## Oppgave 19. Binærtre
Anta du har binærtre `G` og legger til én ny kant i treet. Du vil nå ha...
Svar: en syklik graf
Var ikke: et binærtre med én kant mer (?)
## Oppgave 20. Amortisert analyse
Hvorfor er amartisert analyse bedre enn vanlig worst-case-beregning i mange tilfeller?
Svar: Worst case kan være altfor pessimistisk.
| 28.599291 | 226 | 0.555611 | nob_Latn | 0.980517 |
b072a85216d20f9590e187c651fab7c785ef041b | 4,953 | md | Markdown | docs/docs/layout/grid.md | Bartozzz/wireframe | 68357dc3226fa73ddd43c88932e353303ea3b29e | [
"MIT"
] | 3 | 2017-09-07T08:12:15.000Z | 2017-10-23T11:11:29.000Z | docs/docs/layout/grid.md | Bartozzz/wireframe | 68357dc3226fa73ddd43c88932e353303ea3b29e | [
"MIT"
] | 2 | 2017-08-06T15:21:03.000Z | 2018-03-03T18:14:01.000Z | docs/docs/layout/grid.md | Bartozzz/Wireframe | 68357dc3226fa73ddd43c88932e353303ea3b29e | [
"MIT"
] | null | null | null | ---
layout: docs
drawer: true
title: Grid
files:
- ~wireframe-framework/scss/layout/grid
---
Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
## Dynamic columns
Dynamic columns will fit all the remaining space inside `.grid`. Those are created using `.auto` class name. Beware, auto-sized columns are not responsive by default by Wireframe. Therefore, you have to handle different breakpoints yourself. We encourage you to use sized columns for a better user-experience.
<div class="grid prototype-grid-vertical">
<div class="auto">
<div class="box"><div class="box-main align-center">Auto-sized tile</div></div>
</div>
<div class="auto">
<div class="box"><div class="box-main align-center">Auto-sized tile</div></div>
</div>
<div class="auto">
<div class="box"><div class="box-main align-center">Auto-sized tile</div></div>
</div>
</div>
<div class="grid prototype-grid-vertical">
<div class="auto">
<div class="box"><div class="box-main align-center">Auto-sized tile</div></div>
</div>
<div class="auto">
<div class="box"><div class="box-main align-center">Auto-sized tile</div></div>
</div>
</div>
{% highlight html %}
<div class="grid">
<div class="auto">
<!-- … -->
</div>
<div class="auto">
<!-- … -->
</div>
<div class="auto">
<!-- … -->
</div>
</div>
{% endhighlight %}
## Sized columns
Sized columns occupe a predefined percentage of their parent element. Those are named using one of three prefixed for each viewport: `.lg-n`, `.sm-n`, `.xs-n` for respectively desktops, tablets and mobiles, where n is the amount of columns. By default, the grid system can handle 12 columns for a row. This arbitrary value can be modified by changing the `$grid-columns-amount` value.
<div class="grid prototype-grid-vertical">
<div class="lg-1">
<div class="box"><div class="box-main align-center">1</div></div>
</div>
<div class="lg-11">
<div class="box"><div class="box-main align-center">11</div></div>
</div>
</div>
<div class="grid prototype-grid-vertical">
<div class="lg-2">
<div class="box"><div class="box-main align-center">2</div></div>
</div>
<div class="lg-10">
<div class="box"><div class="box-main align-center">10</div></div>
</div>
</div>
<div class="grid prototype-grid-vertical">
<div class="lg-3">
<div class="box"><div class="box-main align-center">3</div></div>
</div>
<div class="lg-9">
<div class="box"><div class="box-main align-center">9</div></div>
</div>
</div>
<div class="grid prototype-grid-vertical">
<div class="lg-4">
<div class="box"><div class="box-main align-center">4</div></div>
</div>
<div class="lg-8">
<div class="box"><div class="box-main align-center">8</div></div>
</div>
</div>
<div class="grid prototype-grid-vertical">
<div class="lg-5">
<div class="box"><div class="box-main align-center">5</div></div>
</div>
<div class="lg-7">
<div class="box"><div class="box-main align-center">7</div></div>
</div>
</div>
<div class="grid prototype-grid-vertical">
<div class="lg-6">
<div class="box"><div class="box-main align-center">6</div></div>
</div>
<div class="lg-6">
<div class="box"><div class="box-main align-center">6</div></div>
</div>
</div>
{% highlight html %}
<div class="grid">
<div class="lg-4 sm-6 xs-12">
<!-- … -->
</div>
<div class="lg-4 sm-6 xs-12">
<!-- … -->
</div>
<div class="lg-4 sm-6 xs-12">
<!-- … -->
</div>
</div>
{% endhighlight %}
## Grid offsets
You can specify column offsets identically as you specify its size: `.lg-o-n`, `.sm-o-n`, `.xs-o-n`, where n represents the amount of columns to offset from the left.
<div class="grid prototype-grid-vertical">
<div class="lg-5">
<div class="box"><div class="box-main align-center">5</div></div>
</div>
<div class="lg-5 lg-o-2">
<div class="box"><div class="box-main align-center">5</div></div>
</div>
<div class="lg-10 lg-o-1">
<div class="box"><div class="box-main align-center">10</div></div>
</div>
</div>
{% highlight html %}
<div class="grid">
<div class="lg-5 sm-3 sm-o-1">
<!-- … -->
</div>
<div class="lg-5 lg-o-2 sm-3 sm-o-1">
<!-- … -->
</div>
<div class="lg-10 lg-o-1 sm-3 sm-o-1">
<!-- … -->
</div>
</div>
{% endhighlight %}
| 29.482143 | 446 | 0.606501 | eng_Latn | 0.362073 |
b073584f922047205280eaea05af8d3648806ebf | 2,127 | md | Markdown | articles/human-resources/hr-benefits-plans-future-life-events.md | MicrosoftDocs/Dynamics-365-Operations.it- | 10c91d0b02b9925d81227106bc04e18f538a6e25 | [
"CC-BY-4.0",
"MIT"
] | 2 | 2020-05-18T17:14:19.000Z | 2021-04-20T21:13:45.000Z | articles/human-resources/hr-benefits-plans-future-life-events.md | MicrosoftDocs/Dynamics-365-Operations.it- | 10c91d0b02b9925d81227106bc04e18f538a6e25 | [
"CC-BY-4.0",
"MIT"
] | 10 | 2017-12-12T12:01:52.000Z | 2019-04-30T11:46:17.000Z | articles/human-resources/hr-benefits-plans-future-life-events.md | MicrosoftDocs/Dynamics-365-Operations.it- | 10c91d0b02b9925d81227106bc04e18f538a6e25 | [
"CC-BY-4.0",
"MIT"
] | 3 | 2018-07-20T06:42:28.000Z | 2019-10-12T18:16:59.000Z | ---
title: Configurare eventi reali futuri
description: Questo argomento descrive come programmare gli eventi della vita futura in Dynamics 365 Human Resources.
author: twheeloc
ms.date: 08/23/2021
ms.topic: article
ms.prod: ''
ms.technology: ''
ms.search.form: BenefitFutureLifeEvents, BenefitWorkspace, HcmBenefitSummaryPart
audience: Application User
ms.search.scope: Human Resources
ms.custom: 7521
ms.assetid: ''
ms.search.region: Global
ms.author: twheeloc
ms.search.validFrom: 2020-02-03
ms.dyn365.ops.version: Human Resources
ms.openlocfilehash: aa772f5c58e199e8786185c783db7016c8aebafd
ms.sourcegitcommit: 4f9c889e5cf72f34dd9746a322f8c0d6b983037b
ms.translationtype: HT
ms.contentlocale: it-IT
ms.lasthandoff: 08/25/2021
ms.locfileid: "7417584"
---
# <a name="configure-future-life-events"></a>Configurare eventi reali futuri
[!include [Applies to Human Resources](../includes/applies-to-hr.md)]
È possibile pianificare eventi reali futuri in Dynamics 365 Human Resources.
1. Nell'area di lavoro **Gestione benefit**, sotto **Impostazione**, selezionare **Eventi reali futuri**.
2. Selezionare **Nuovo**.
3. Specificare i valori per i seguenti campi:
| Campo | Descrizione |
| --- | --- |
| Data evento reale | Il sistema elabora tutti gli eventi durante il periodo di iscrizione che si verificano fino a questa data. |
| Evento reale registrato | Data e ora in cui l'evento reale è stato registrato. |
| Tipo di registro | Indica se l'azione è una delle seguenti:</br></br>- **Aggiorna** - Una modifica a un record esistente che monitora eventi reali</br></br>- **Inserisci** - La creazione di un nuovo record di evento reale |
| ID tipo di evento reale | Identificatore univoco del tipo di evento reale. |
| Tipo di evento reale | Catalizzatore per l'aggiornamento dell'iscrizione ai benefit di un dipendente. Per ulteriori dettagli, consultare la sezione Trigger eventi reali. |
| Stato | Indica se l'evento reale è stato elaborato o meno. |
| Linea | Numero di riga dell'evento reale futuro. |
4. Selezionare **Salva**.
[!INCLUDE[footer-include](../includes/footer-banner.md)]
| 41.705882 | 228 | 0.756935 | ita_Latn | 0.979469 |
b074cbf1361c2681f900051e5500674e4e0ba1de | 4,880 | md | Markdown | docs/zh_cn/reference/pipeline/dsl_definition/3_cache.md | qiaoshuangshuang/PaddleFlow | 15155a553587f18b09d4edfc604cb64a1fbe01a7 | [
"Apache-2.0"
] | 23 | 2021-12-31T02:36:13.000Z | 2022-03-29T07:38:43.000Z | docs/zh_cn/reference/pipeline/dsl_definition/3_cache.md | qiaoshuangshuang/PaddleFlow | 15155a553587f18b09d4edfc604cb64a1fbe01a7 | [
"Apache-2.0"
] | 10 | 2022-01-05T08:47:37.000Z | 2022-03-29T11:59:43.000Z | docs/zh_cn/reference/pipeline/dsl_definition/3_cache.md | qiaoshuangshuang/PaddleFlow | 15155a553587f18b09d4edfc604cb64a1fbe01a7 | [
"Apache-2.0"
] | 19 | 2021-12-30T14:37:24.000Z | 2022-03-23T03:30:32.000Z | # 使用Cache机制
在[DSL使用基础中][DSL使用基础]，我们介绍了DSL的基础使用。但是，在某些情况下，对于已经运行过的Step，我们希望其可以直接使用上次运行的结果，以节省运行时间，加快迭代效率，此时我们便需要使用Cache机制。关于Cache机制的详细解释，请点击[这里][Cache-ref]。本文主要讲解如何在使用DSL定义pipeline时如何使用Cache机制，不在对其定义进行赘述。
# 1、pipeline示例
下面的示例是基于[artifact_pipeline][artifact_pipeline]中的pipeline定义增加cache相关的配置升级而来
>该示例中pipeline定义，以及示例相关运行脚本，来自paddleflow项目下example/pipeline/cache_example示例。
>
>示例链接：[cache_example][cache_example]
```python3
from paddleflow.pipeline import Pipeline
from paddleflow.pipeline import ContainerStep
from paddleflow.pipeline import Parameter
from paddleflow.pipeline import Artifact
from paddleflow.pipeline import CacheOptions
from paddleflow.pipeline import PF_USER_NAME
def job_info():
return {
"PF_JOB_TYPE": "vcjob",
"PF_JOB_MODE": "Pod",
"PF_JOB_QUEUE_NAME": "ppl-queue",
"PF_JOB_FLAVOUR": "flavour1",
}
def preprocess(data_path):
cache = CacheOptions(
enable=True,
max_expired_time=300,
fs_scope="cache_example/shells/data_artifact.sh"
)
return ContainerStep(
name="preprocess",
parameters={"data_path": data_path},
outputs={"train_data": Artifact(), "validate_data": Artifact()},
docker_env="centos:centos7",
cache_options=cache,
command="bash -x cache_example/shells/data_artifact.sh {{data_path}} {{train_data}} {{validate_data}}",
env={"USER_ABC": f"123_{PF_USER_NAME}"}
)
def train(epoch, train_data):
return ContainerStep(
name="train",
parameters={
"epoch": epoch,
},
inputs={"train_data": train_data},
outputs={"train_model": Artifact()},
command="bash -x cache_example/shells/train.sh {{epoch}} {{train_data}} {{train_model}}",
)
def validate(data, model):
cache = CacheOptions(
enable=False,
)
return ContainerStep(
name="validate",
inputs={"data":data, "model": model},
command="bash cache_example/shells/validate.sh {{model}}",
cache_options=cache,
)
cache = CacheOptions(
enable=True,
max_expired_time=600,
fs_scope="cache_example/shells/train.sh,cache_example/shells/validate.sh,cache_example/shells/data_artifact.sh"
)
@Pipeline(
name="cache_example",
docker_env="nginx:1.7.9",
cache_options=cache,
env=job_info(),
parallelism=1
)
def cache_example(data_path, epoch):
preprocess_step = preprocess(data_path)
train_step = train(epoch, preprocess_step.outputs["train_data"])
validate_step = validate(preprocess_step.outputs["validate_data"], train_step.outputs["train_model"])
if __name__ == "__main__":
ppl = cache_example(data_path="./cache_example/data/", epoch=15)
result = ppl.run(fsname="your_fs_name")
print(result)
```
与直接通过编写yaml文件来使用Cache一样，DSL也支持pipeline级别和Step级别两种层级的Cache配置，接下来我们将会依次介绍
# 2、Pipeline级别的Cache
在调用Pipeline的初始化函数时，可以给其cache_options参数进行赋值，来设置pipeline级别的Cache。cache_options的参数值需要是一个[CacheOptions][CacheOptions]的实例。在上例中，我们通过如下的代码，设置了Pipeline的Cache配置：
```python3
cache = CacheOptions(
enable=True,
max_expired_time=600,
fs_scope="cache_example/shells/train.sh,cache_example/shells/validate.sh,cache_example/shells/data_artifact.sh"
)
@Pipeline(
name="cache_example",
docker_env="nginx:1.7.9",
cache_options=cache,
env=job_info(),
parallelism=1
)
```
# 3、Step级别的Cache
在调用ContainerStep的初始化函数时，可以给其cache_options参数进行赋值，来设置Step级别的Cache配置。cache_options的参数值需要是一个 [CacheOptions][CacheOptions]的实例。在上例中，我们通过如下的代码, 给preprocess_step设置了自身的cache配置：
```python3
def preprocess(data_path):
cache = CacheOptions(
enable=True,
max_expired_time=300,
fs_scope="cache_example/shells/data_artifact.sh"
)
return ContainerStep(
name="preprocess",
parameters={"data_path": data_path},
outputs={"train_data": Artifact(), "validate_data": Artifact()},
docker_env="centos:centos7",
cache_options=cache,
command="bash -x cache_example/shells/data_artifact.sh {{data_path}} {{train_data}} {{validate_data}}",
env={"USER_ABC": f"123_{PF_USER_NAME}"}
)
```
# 4、更多信息
[在DSL中使用PostProcess和FailureOpitons][DSL-PostProcess-And-FailureOpitons]
[DSL接口文档][DSL接口文档]
[Cache-ref]: /docs/zh_cn/reference/pipeline/yaml_definition/3_cache.md
[DSL使用基础]: /docs/zh_cn/reference/pipeline/dsl_definition/1_pipeline_basic.md
[artifact_pipeline]: /docs/zh_cn/reference/pipeline/dsl_definition/2_artifact.md
[cache_example]: /example/pipeline/cache_example
[CacheOptions]: /docs/zh_cn/reference/sdk_reference/pipeline_dsl_reference.md#5CacheOptions
[DSL-PostProcess-And-FailureOpitons]: /docs/zh_cn/reference/pipeline/dsl_definition/4_failure_options_and_post_process.md
[DSL接口文档]: /docs/zh_cn/reference/sdk_reference/pipeline_dsl_reference.md
| 33.197279 | 191 | 0.718238 | yue_Hant | 0.224423 |
b075fa9388cb32f42cad8dcd1a6d50f65bf9c00b | 59 | md | Markdown | README.md | jimskretas/4p-tetris | d5f2953db3ef189bb993ff14d83ba0e4556b3005 | [
"MIT"
] | null | null | null | README.md | jimskretas/4p-tetris | d5f2953db3ef189bb993ff14d83ba0e4556b3005 | [
"MIT"
] | null | null | null | README.md | jimskretas/4p-tetris | d5f2953db3ef189bb993ff14d83ba0e4556b3005 | [
"MIT"
] | null | null | null | # 4p-tetris
4 player Tetris using JavaScript and Socket.io
| 19.666667 | 46 | 0.79661 | eng_Latn | 0.953832 |
b07780d6aff29b9bc095dac1e7af50d215913f2b | 8,284 | md | Markdown | hub/apps/speech.md | Aaron-Junker/windows-uwp.de-de | 7171d224a4a27d04e54ab083568710e32235af3d | [
"CC-BY-4.0",
"MIT"
] | null | null | null | hub/apps/speech.md | Aaron-Junker/windows-uwp.de-de | 7171d224a4a27d04e54ab083568710e32235af3d | [
"CC-BY-4.0",
"MIT"
] | null | null | null | hub/apps/speech.md | Aaron-Junker/windows-uwp.de-de | 7171d224a4a27d04e54ab083568710e32235af3d | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Sprache, Stimme und Konversation in Windows 10
description: Auf dieser Seite finden Sie Informationen zu den ersten Schritten bei der Entwicklung von sprachfähigen Windows-apps.
ms.topic: article
ms.date: 09/12/2019
keywords: Sprache in Windows 10, Speech, Voice, Conversation, Win32 Speech apps, UWP Speech apps, WPF Speech apps, WinForms Speech apps
ms.author: kbridge
author: Karl-Bridge-Microsoft
ms.openlocfilehash: 0051ecb0556b72f768c142f04c38f3f34b2dd334
ms.sourcegitcommit: 99a3f996a57ecc5df7382fb46bc9b8ba75614a53
ms.translationtype: MT
ms.contentlocale: de-DE
ms.lasthandoff: 02/05/2021
ms.locfileid: "99579011"
---
# <a name="speech-voice-and-conversation-in-windows-10"></a>Sprache, Stimme und Konversation in Windows 10
Die Sprache kann eine effektive, natürliche und angenehme Methode für die Interaktion von Benutzern mit Ihren Windows-Anwendungen sein, die auf der Maus, Tastatur, Toucheingabe, dem Controller oder Gesten basiert, um traditionelle Interaktionen zu ergänzen oder sogar zu ersetzen.
Sprachbasierte Funktionen, wie z. b. Spracherkennung, Diktat, Sprachsynthese (auch bekannt als Text-zu-Sprache oder TTS) und einschließende sprach-Assistenten (z. b. Cortana oder Alexa) können barrierefreie und inklusivbenutzer Umgebungen bereitstellen, die es Benutzern ermöglichen, Ihre Anwendungen zu verwenden, wenn andere Eingabegeräte möglicherweise nicht ausreichen.
Diese Seite enthält Informationen dazu, wie die verschiedenen Windows-Entwicklungs Frameworks Spracherkennung, Sprachsynthese und Unterstützung von Konversation für Entwickler bereitstellen, die Windows-Anwendungen erstellen.
## <a name="platform-specific-documentation"></a>Plattformspezifische Dokumentation
:::row:::
:::column:::
**Universelle Windows-Plattform (UWP)**
Erstellen Sie sprach fähige apps auf der modernen Plattform für Windows 10-Anwendungen und-Spiele auf allen Windows-Geräten (einschließlich PCs, Smartphones, Xbox One, hololens usw.), und veröffentlichen Sie Sie auf dem Microsoft Store.
[Sprachinteraktionen](/windows/uwp/design/input/speech-interactions)
[Spracherkennung](/windows/uwp/design/input/speech-recognition)
[Kontinuierliches Diktieren](/windows/uwp/design/input/enable-continuous-dictation)
[Sprachsynthese](/uwp/api/windows.media.speechsynthesis)
[Konversations-Agents](/uwp/api/windows.applicationmodel.conversationalagent)
[Cortana-Sprachbefehle](/cortana/voice-commands/vcd)<br>
(wird in Windows 10 Mai 2020 Update und höher nicht unterstützt)
:::column-end:::
:::column:::
**Win32-Plattform**
Entwickeln Sie sprach aktivierte Anwendungen für Windows Desktop und Windows Server mithilfe der hier bereitgestellten Tools, Informationen und Beispiel-Engines und Anwendungen.
[Microsoft Speech Platform – Software Development Kit (SDK) (Version 11)](https://www.microsoft.com/download/details.aspx?id=27226)
[Microsoft Speech SDK, Version 5.1](https://www.microsoft.com/download/details.aspx?id=10121)
:::column-end:::
:::row-end:::
:::row:::
:::column:::
**.NET Framework**
Entwickeln Sie barrierefreie Apps und Tools auf der bekannten Plattform für verwaltete Windows-Anwendungen mit einem XAML-UI-Modell und dem .NET Framework.
[System.Speech-Programmierhandbuch für .NET Framework](/previous-versions/office/developer/speech-technologies/hh361625(v=office.14))
:::column-end:::
:::column:::
**Azure-Sprachdienste**
Integrieren Sie die Sprachverarbeitung in apps und Dienste.
[Spracherkennung](https://azure.microsoft.com/services/cognitive-services/speech-to-text/)
[Sprachsynthese](https://azure.microsoft.com/services/cognitive-services/text-to-speech/)
[Sprachübersetzung](https://azure.microsoft.com/services/cognitive-services/speech-translation/)
[Sprechererkennung](https://azure.microsoft.com/en-us/services/cognitive-services/speaker-recognition/)
[Voice-First Virtual Assistenten](/azure/cognitive-services/speech-service/voice-first-virtual-assistants)
:::column-end:::
:::row-end:::
:::row:::
:::column span="2":::
**Legacy Features**
Ältere, veraltete und/oder nicht unterstützte Versionen der Sprach-und Konversations Technologie von Microsoft.
:::column-end:::
:::row-end:::
:::row:::
:::column:::
[Cortana-Funktionskit](/cortana/skills/)
Als Teil unserer Zielsetzung, die modernen Produktivitäts Erfahrungen zu transformieren, indem Cortana tief in [Microsoft 365](/microsoft-365/admin/misc/cortana-integration)eingebettet wird, werden die Cortana Skills Kit-Entwicklerplattform und alle Fähigkeiten, die auf dieser Plattform erstellt wurden, zurückgezogen.
:::column-end:::
:::column:::
[Microsoft-Agent](/windows/win32/lwef/microsoft-agent)
[Microsoft Speech Application Software Development Kit (sasdk) Version 1,0](https://www.microsoft.com/download/details.aspx?id=2200)
[Microsoft Speech API (SAPI) 5,3](/previous-versions/windows/desktop/ms723627(v=vs.85))
[Microsoft Speech API (SAPI) 5,4](/previous-versions/windows/desktop/ee125663(v=vs.85))
[Das Bing-Spracheingabe Erkennungs Steuerelement](/previous-versions/bing/speech/dn434583(v=msdn.10))
:::column-end:::
:::row-end:::
## <a name="samples"></a>Beispiele
Laden Sie vollständige Windows-Beispiele herunter, die verschiedene Barrierefreiheitsfeatures und -funktionen veranschaulichen, und führen Sie sie aus.
:::row:::
:::column:::
[Browser für Codebeispiele](/samples/browse/?term=speech)
Der neue Beispiel Browser (ersetzt die MSDN Code Gallery).
:::column-end:::
:::column:::
[Klassische Windows-Beispiele auf GitHub](https://github.com/microsoft/Windows-classic-samples/search?q=speech&unscoped_q=speech)
Diese Beispiele veranschaulichen die Funktionalität und das Programmiermodell für Windows und Windows Server.
:::column-end:::
:::row-end:::
:::row:::
:::column:::
[UWP-Beispiele (Universelle Windows-Plattform) auf GitHub](https://github.com/microsoft/Windows-universal-samples/search?q=speech&unscoped_q=speech)
Diese Beispiele veranschaulichen die API-Verwendungsmuster für die Universelle Windows-Plattform (UWP) im Windows Software Development Kit (SDK) für Windows 10.
:::column-end:::
:::column:::
[XAML-Steuerelementekatalog](https://github.com/microsoft/Xaml-Controls-Gallery)
Diese App zeigt die verschiedenen XAML-Steuerelemente, die im Fluent Design-System unterstützt werden.
:::column-end:::
:::row-end:::
## <a name="videos"></a>Videos
Verschiedene Videos zum Erstellen von Windows-Anwendungen, die sprach Interaktionen einschließen.
:::row:::
:::column:::
**Cortana und Sprachplattform im Detail**
:::column-end:::
:::column:::
**Cortana-Erweiterbarkeit in universellen Windows-apps**
:::column-end:::
:::row-end:::
:::row:::
:::column:::
> [!VIDEO https://channel9.msdn.com/Events/Build/2015/3-716/player]
:::column-end:::
:::column:::
> [!VIDEO https://channel9.msdn.com/Events/Build/2015/2-691/player]
:::column-end:::
:::row-end:::
## <a name="other-resources"></a>Weitere Ressourcen
:::row:::
:::column:::
**Blogs und Neuigkeiten**
Die neuesten aus der Welt der Microsoft-Sprache.
:::column-end:::
:::column:::
**Community und Support**
, Wo Windows-Entwickler und-Benutzer zusammenarbeiten und kennenlernen.
:::column-end:::
:::row-end:::
:::row:::
:::column:::
[Nachrichten](https://news.microsoft.com/?s=speech)
[Sprachblogs](https://blogs.windows.com/windowsdeveloper/?s=speech)
:::column-end:::
:::column:::
[Windows-Community-Speech](https://community.windows.com/search?q=speech)
[Entwickler Forum für Windows Speech](https://social.msdn.microsoft.com/Forums/home?filter=alltypes&sort=firstpostdesc&searchTerm=speech)
:::column-end:::
:::row-end::: | 43.371728 | 373 | 0.732738 | deu_Latn | 0.801478 |
b07806409ac1e28b934b662887904a6910ca2d54 | 2,040 | md | Markdown | test_data_generator/README.md | jeff-stacey/horizon_detection | b964c33019ecb55a15e6961660c465b855b6b469 | [
"MIT"
] | null | null | null | test_data_generator/README.md | jeff-stacey/horizon_detection | b964c33019ecb55a15e6961660c465b855b6b469 | [
"MIT"
] | null | null | null | test_data_generator/README.md | jeff-stacey/horizon_detection | b964c33019ecb55a15e6961660c465b855b6b469 | [
"MIT"
] | null | null | null | # Test Image Generator
## Building
Run `make` to build.
I have packaged most dependencies, but it needs to link with OpenGL in order to build.
If compilation fails with `/usr/bin/ld: cannot find -lGL`, then try `sudo apt install libgl1-mesa-dev` on Ubuntu.
If you don't want to install anything, this stackoverflow answer should help: https://stackoverflow.com/a/32184137
## Command Line Interface
There are several command line options. They can be applied in any combination, but not every combination is useful.
- `--load <filename>` loads a `.hrz` file. `.hrz` files are output by the test data generator and store the combination of parameters and outputs associated with an image.
- `--export <filename>` exports an image without starting GUI. It can be combined with `--load`, and the image is generated from the loaded parameters. Creates the files `<filename>.png`, `<filename>.bin` and `<filename>.hrz`. The `<filename>.hrz` is a different file from the `--load` input, and it contains outputs generated from the inputs (e.g. nadir vector, magnetometer values).
- `--fuzz_options <fuzz options> end` selects which parameters to randomize. The list of fuzz options needs to terminate with `end`. Fuzz options are
- `orientation`
- `magnetometer_orientation`
- `atmosphere_height`
- `altitude`
- `latitude`
- `longitude`
- `noise_seed`
- `noise_stdev`
- `--fuzz_count <number of fuzz runs>`
- `--fuzz_seed <fuzz seed>`
- `--mag_stdev <stdev>` supplies the (floating point) standard deviation of magnetometer readings between randomizations.
Fuzz parameters are randomized within a range hard-coded into the application.
Examples:
```
# start with GUI
./test_image_generator
# load .hrz in GUI
./test_image_generator --load filename.hrz
# generate 100 images, with altitude and orientaiton randomized
# (note: fuzz_seed is optional, it defaults to 1)
./test_image_generator --fuzz_options altitude orientation end --fuzz_count 100 --export images/test_image
```
| 47.44186 | 386 | 0.735784 | eng_Latn | 0.986913 |
b0781dc891b76ab47564b9ea8958e3aa707817c6 | 1,838 | md | Markdown | leetcode/1785. Minimum Elements to Add to Form a Given Sum/README.md | zhuohuwu0603/leetcode_cpp_lzl124631x | 6a579328810ef4651de00fde0505934d3028d9c7 | [
"Fair"
] | 787 | 2017-05-12T05:19:57.000Z | 2022-03-30T12:19:52.000Z | leetcode/1785. Minimum Elements to Add to Form a Given Sum/README.md | aerlokesh494/LeetCode | 0f2cbb28d5a9825b51a8d3b3a0ae0c30d7ff155f | [
"Fair"
] | 8 | 2020-03-16T05:55:38.000Z | 2022-03-09T17:19:17.000Z | leetcode/1785. Minimum Elements to Add to Form a Given Sum/README.md | aerlokesh494/LeetCode | 0f2cbb28d5a9825b51a8d3b3a0ae0c30d7ff155f | [
"Fair"
] | 247 | 2017-04-30T15:07:50.000Z | 2022-03-30T09:58:57.000Z | # [1785. Minimum Elements to Add to Form a Given Sum (Medium)](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)
<p>You are given an integer array <code>nums</code> and two integers <code>limit</code> and <code>goal</code>. The array <code>nums</code> has an interesting property that <code>abs(nums[i]) <= limit</code>.</p>
<p>Return <em>the minimum number of elements you need to add to make the sum of the array equal to </em><code>goal</code>. The array must maintain its property that <code>abs(nums[i]) <= limit</code>.</p>
<p>Note that <code>abs(x)</code> equals <code>x</code> if <code>x >= 0</code>, and <code>-x</code> otherwise.</p>
<p> </p>
<p><strong>Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1,-1,1], limit = 3, goal = -4
<strong>Output:</strong> 2
<strong>Explanation:</strong> You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4.
</pre>
<p><strong>Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [1,-10,9,1], limit = 100, goal = 0
<strong>Output:</strong> 1
</pre>
<p> </p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
<li><code>1 <= limit <= 10<sup>6</sup></code></li>
<li><code>-limit <= nums[i] <= limit</code></li>
<li><code>-10<sup>9</sup> <= goal <= 10<sup>9</sup></code></li>
</ul>
**Related Topics**:
[Greedy](https://leetcode.com/tag/greedy/)
## Solution 1.
```cpp
// OJ: https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
int minElements(vector<int>& A, int limit, int goal) {
long sum = abs(goal - accumulate(begin(A), end(A), 0L));
return (sum + limit - 1) / limit;
}
};
``` | 36.039216 | 214 | 0.631121 | eng_Latn | 0.518918 |
b07876bf3624fbdc9c246e08e1c48a8ec3fb2e29 | 6,569 | md | Markdown | articles/azure-resource-manager/templates/rollback-on-error.md | MicrosoftDocs/azure-docs.hu-hu | 5fb082c5dae057fd040c7e09881e6c407e535fe2 | [
"CC-BY-4.0",
"MIT"
] | 7 | 2017-08-28T07:44:33.000Z | 2021-04-20T21:12:50.000Z | articles/azure-resource-manager/templates/rollback-on-error.md | MicrosoftDocs/azure-docs.hu-hu | 5fb082c5dae057fd040c7e09881e6c407e535fe2 | [
"CC-BY-4.0",
"MIT"
] | 412 | 2018-07-25T09:31:03.000Z | 2021-03-17T13:17:45.000Z | articles/azure-resource-manager/templates/rollback-on-error.md | MicrosoftDocs/azure-docs.hu-hu | 5fb082c5dae057fd040c7e09881e6c407e535fe2 | [
"CC-BY-4.0",
"MIT"
] | 13 | 2017-09-05T09:10:35.000Z | 2021-11-05T11:42:31.000Z | ---
title: A sikeres üzembe helyezés hibába való visszaállítása
description: Azt határozza meg, hogy egy sikertelen központi telepítés visszaálljon-e egy sikeres üzembe helyezésre.
ms.topic: conceptual
ms.date: 02/02/2021
ms.openlocfilehash: 742a8f16a2dce3204b48085759091540586a4522
ms.sourcegitcommit: f28ebb95ae9aaaff3f87d8388a09b41e0b3445b5
ms.translationtype: MT
ms.contentlocale: hu-HU
ms.lasthandoff: 03/29/2021
ms.locfileid: "99492212"
---
# <a name="rollback-on-error-to-successful-deployment"></a>Hiba visszaállítása a sikeres központi telepítéshez
Ha egy telepítés meghiúsul, automatikusan újratelepítheti a korábbi, sikeres telepítést az üzembe helyezési előzményekből. Ez a funkció akkor hasznos, ha az infrastruktúra központi telepítésének ismert jó állapota van, és ezt az állapotot szeretné visszaállítani. Megadhat egy adott korábbi telepítést vagy az utolsó sikeres telepítést.
> [!IMPORTANT]
> Ez a szolgáltatás egy korábbi üzemelő példány újbóli üzembe helyezésével visszaállít egy sikertelen telepítést. Ez az eredmény eltérő lehet, mint amit a sikertelen telepítés visszavonása elvár. Győződjön meg arról, hogy megérti a korábbi központi telepítés újratelepítésének módját.
## <a name="considerations-for-redeploying"></a>Az újratelepítéssel kapcsolatos megfontolások
A szolgáltatás használata előtt tekintse át az alábbi adatokat az újratelepítés kezelésével kapcsolatban:
- Az előző üzemelő példány a [teljes mód](./deployment-modes.md#complete-mode)használatával fut, még akkor is, ha a korábbi telepítés során [növekményes módot](./deployment-modes.md#incremental-mode) használt. A teljes módban történő ismételt üzembe helyezés váratlan eredményeket eredményezhet, ha a korábbi központi telepítés növekményes használatot használ. A teljes mód azt jelenti, hogy az előző üzemelő példányban nem szereplő összes erőforrás törlődik. Adja meg az erőforráscsoport egyik korábbi központi telepítését, amely az összes erőforrást és azok állapotait képviseli. További információ: [telepítési módok](./deployment-modes.md).
- Az újratelepítést a rendszer pontosan úgy futtatja, ahogy korábban ugyanazzal a paraméterekkel futtatta. A paraméterek nem módosíthatók.
- Az újratelepítés csak az erőforrásokat befolyásolja, az adatváltozások nincsenek hatással.
- Ezt a funkciót csak az erőforráscsoport-telepítések esetén használhatja. Nem támogatja az előfizetés, a felügyeleti csoport vagy a bérlői szintű üzemelő példányok használatát. Az előfizetési szintű telepítéssel kapcsolatos további információkért lásd: [erőforráscsoportok és erőforrások létrehozása az előfizetési szinten](./deploy-to-subscription.md).
- Ezt a lehetőséget csak gyökérszintű központi telepítések esetén használhatja. A beágyazott sablonból történő központi telepítések nem érhetők el az újratelepítéshez.
Ha ezt a beállítást szeretné használni, a központi telepítéseknek egyedi névvel kell rendelkezniük az üzembe helyezési előzményekben. Csak olyan egyedi nevekkel rendelkezhet, amelyeket egy adott központi telepítés azonosítható. Ha nem rendelkezik egyedi névvel, akkor a sikertelen központi telepítés felülírhatja a sikeres telepítést az előzményekben.
Ha olyan korábbi központi telepítést ad meg, amely nem létezik az üzembe helyezési előzményekben, a visszaállítás hibát jelez.
## <a name="powershell"></a>PowerShell
Az utolsó sikeres központi telepítés újbóli üzembe helyezéséhez adja hozzá a `-RollbackToLastDeployment` paramétert jelzőként.
```azurepowershell-interactive
New-AzResourceGroupDeployment -Name ExampleDeployment02 `
-ResourceGroupName $resourceGroupName `
-TemplateFile c:\MyTemplates\azuredeploy.json `
-RollbackToLastDeployment
```
Egy adott központi telepítés újbóli üzembe helyezéséhez használja a `-RollBackDeploymentName` paramétert, és adja meg a központi telepítés nevét. A megadott központi telepítésnek sikeresnek kell lennie.
```azurepowershell-interactive
New-AzResourceGroupDeployment -Name ExampleDeployment02 `
-ResourceGroupName $resourceGroupName `
-TemplateFile c:\MyTemplates\azuredeploy.json `
-RollBackDeploymentName ExampleDeployment01
```
## <a name="azure-cli"></a>Azure CLI
Az utolsó sikeres központi telepítés újbóli üzembe helyezéséhez adja hozzá a `--rollback-on-error` paramétert jelzőként.
```azurecli-interactive
az deployment group create \
--name ExampleDeployment \
--resource-group ExampleGroup \
--template-file storage.json \
--parameters storageAccountType=Standard_GRS \
--rollback-on-error
```
Egy adott központi telepítés újbóli üzembe helyezéséhez használja a `--rollback-on-error` paramétert, és adja meg a központi telepítés nevét. A megadott központi telepítésnek sikeresnek kell lennie.
```azurecli-interactive
az deployment group create \
--name ExampleDeployment02 \
--resource-group ExampleGroup \
--template-file storage.json \
--parameters storageAccountType=Standard_GRS \
--rollback-on-error ExampleDeployment01
```
## <a name="rest-api"></a>REST API
Az utolsó sikeres központi telepítés újbóli üzembe helyezéséhez, ha az aktuális telepítés meghiúsul, használja a következőt:
```json
{
"properties": {
"templateLink": {
"uri": "http://mystorageaccount.blob.core.windows.net/templates/template.json",
"contentVersion": "1.0.0.0"
},
"mode": "Incremental",
"parametersLink": {
"uri": "http://mystorageaccount.blob.core.windows.net/templates/parameters.json",
"contentVersion": "1.0.0.0"
},
"onErrorDeployment": {
"type": "LastSuccessful",
}
}
}
```
Ha az aktuális telepítés meghiúsulása esetén a megadott központi telepítés újratelepítése sikertelen, használja a következőt:
```json
{
"properties": {
"templateLink": {
"uri": "http://mystorageaccount.blob.core.windows.net/templates/template.json",
"contentVersion": "1.0.0.0"
},
"mode": "Incremental",
"parametersLink": {
"uri": "http://mystorageaccount.blob.core.windows.net/templates/parameters.json",
"contentVersion": "1.0.0.0"
},
"onErrorDeployment": {
"type": "SpecificDeployment",
"deploymentName": "<deploymentname>"
}
}
}
```
A megadott központi telepítésnek sikeresnek kell lennie.
## <a name="next-steps"></a>Következő lépések
- A teljes és a növekményes mód megismeréséhez tekintse meg [Azure Resource Manager telepítési módokat](deployment-modes.md).
- Ha szeretné megtudni, hogyan határozhat meg paramétereket a sablonban, olvassa el [a Azure Resource Manager sablonok struktúrájának és szintaxisának megismerését](template-syntax.md)ismertető témakört.
| 50.922481 | 644 | 0.789313 | hun_Latn | 1 |
b07abad357d5c6f348ad399fb266427aef50e0d3 | 999 | md | Markdown | content/platforms/docker.md | otaviojava/open-source-tech-radar | 7b78357bd5566f044e20a5550df04991afaceb76 | [
"MIT"
] | 4 | 2021-07-11T14:36:42.000Z | 2021-07-22T14:47:53.000Z | content/platforms/docker.md | otaviojava/open-source-tech-radar | 7b78357bd5566f044e20a5550df04991afaceb76 | [
"MIT"
] | null | null | null | content/platforms/docker.md | otaviojava/open-source-tech-radar | 7b78357bd5566f044e20a5550df04991afaceb76 | [
"MIT"
] | null | null | null | +++
name= "Docker"
image= "/images/platforms/docker.png"
category= "Platforms"
ring= "Strategic"
type="post"
layout="details"
+++
# What is it ?
Docker is a set of platform as a service products that use OS-level virtualization to deliver software in packages called containers. Containers are isolated from one another and bundle their own software, libraries and configuration files; they can communicate with each other through well-defined channels.
# Why ?
The Docker goal is to ease the creation, deploy and the delivery of an application using the so called Containers. ... But, instead of creating a full operating system, a Docker Container has just the minimum set of operating system software needed for the application to run and rely on the host Linux Kernel itself.
# For who ?
* [CharlesCD](https://charlescd.io/)
# Resources
* [homepage](https://www.docker.com/)
* [Documentation](https://docs.docker.com/)
* [Source code](https://github.com/docker)
# Resources (Portuguese)
| 35.678571 | 317 | 0.75976 | eng_Latn | 0.994738 |
b07d05e871725a21c658f67a8b7b444fdaa1347b | 14,730 | md | Markdown | _oldposts/2018-01-03-univariate.md | erikdrysdale/erikdrysdale.github.io | ff337117e063be7f909bc2d1f3ff427781d29f31 | [
"MIT"
] | null | null | null | _oldposts/2018-01-03-univariate.md | erikdrysdale/erikdrysdale.github.io | ff337117e063be7f909bc2d1f3ff427781d29f31 | [
"MIT"
] | null | null | null | _oldposts/2018-01-03-univariate.md | erikdrysdale/erikdrysdale.github.io | ff337117e063be7f909bc2d1f3ff427781d29f31 | [
"MIT"
] | 2 | 2017-09-13T15:16:36.000Z | 2020-03-03T15:37:01.000Z | ---
title: 'Selective Inference: A useful technique for high-throughput biology'
output: html_document
fontsize: 12pt
published: true
status: publish
mathjax: true
---
<!-- Define any latex commands -->
$$
\newcommand{\Real}{\mathbb{R}}
\newcommand{\bbeta}{\mathbf{\beta}}
\newcommand{\bbetah}{\hat{\bbeta}}
\newcommand{\bhatk}{\hat{\beta}_k}
\newcommand{\by}{\mathbb{y}}
\newcommand{\bx}{\mathbb{x}}
\newcommand{\bxk}{\bx_k}
\newcommand{\bu}{\mathbb{u}}
\newcommand{\bX}{\mathbb{X}}
$$
## Background
The falling cost of sequencing technology has lead to a proliferation of biological datasets that are able to measure nuclear states such as relative amounts of protein expression via RNA-seq or targeted genotyping through next generation sequencing (NGS) platforms. These new technologies allow for hundreds of thousands to millions of measurements for a single individual. In principle, this data should help to elucidate the genetic basis of complex phenotypes ranging from human height to disease states. However, even with a large number of patients (possibly in a case-control setup) the ratio of measurements to observations will be large.
Suppose there are $N$ patients, $p$ measurements per patient, and $m$ associated measurement types that actually impact the phenotype of interest ($p-m>0$). Then if a statistical test of comparing the phenotype difference for a given measurement is done univariately (one at a time), and assuming the tests are stochastically uncorrelated, a p-value threshold of $\alpha\cdot 100\%$ will yield (on average) $\alpha(p-m)$ false positives. Whether we also reject the null of no effect for the $m$ true genetic factors will depend on the power of our study design. Imagine there are 500,000 measurements ($p$) only 100 true factors ($m$), and a p-value of 5%, then there will be an average of 24,495 false positives! If we are lucky enough to reject the null of the no effect for all the true genetic factors, then only 0.4% of the "significant" factors are truly significant.
To overcome this predicament, multiple hypothesis testing adjustments are made to ensure that the majority of "significant" variables are not only noise. The first, and more conservative, approach is to use [family-wise error rate](https://en.wikipedia.org/wiki/Family-wise_error_rate) (FWER) adjustments which define a new p-value threshold such that probability of making *at least one* type I error on $p$ hypotheses is *no greater than* $\alpha$. The most conservative approach within the FWER adjustments is to use the Bonferroni correction, such that $\alpha^{\text{bonfer}} = \alpha / p$. As the number of hypotheses grows, the harder it becomes a variable to be considered statistically significant. This poses the problem that more measurements can be non-optimal because the power of a test decreases as the nominal value of $\alpha$ decreases. Let's see an example
An alternative, and I think more popular, approach is to use [false discovery rate](https://en.wikipedia.org/wiki/False_discovery_rate) (FDR) adjustments which ensure that the proportion of rejected null hypothesis which are false positives are less than or equal to $\alpha$. Fundamentally, FDR leverages the fact that the distribution of p-values between 0-5% will be more left-skewed for hypotheses which are truly non-zero than those under the null (which are uniform). Of course for a fixed $m$ as $p$ increases the power of a FDR-adjusted test will decline, but by nowhere as quick a rate as the FWER approach. In summary, researchers in fields like genetics are well accustomed to adjusting the magnitude of their p-values to account the large number of hypotheses being performed and understand the trade-off between limiting false positives and diluting power.
## A simple genetic model
Suppose there is some continuous phenotype $y_i$ for individual $i$ and we assume a linear genetic model, namely that the observed trait is governed by the impact of $m$ genetic factors plus some individually-specific environmental phenomenon $e_i$, then the variation in the phenotype would be characterized by the following formula:
$$
\begin{align}
y_i &= \sum_{k=1}^m x_{ik} \beta_k + u_i \hspace{3mm} i=1,\dots,N \label{eq:gen1} \\
\text{var}(u_i) &< \infty, \hspace{3mm} cov(u_i,u_j)=0 \hspace{1mm} \forall i\neq j \nonumber
\end{align}
$$
We're going to assume that the $m$ causal variants are measured within the total of $p$ measurements taken. This is a problematic assumption, because we know the positions chosen on a genotyping array are in linkage disequilibrium (LD) with many other variants, and surely some of them are causal.[[^1]] As as $\text{sign}(\text{cov}(y_i,x_{iA}))=\text{sign}(\text{cov}(y_i,x_{iB}))$ then their effect can be proxied through the measured position. However there is absolutely no reason to believe this would be the case, and the failure to measure all relevant positions may explain the [missing heritability problem](https://en.wikipedia.org/wiki/Missing_heritability_problem) for complex diseases. However this issue is not the focus of this post.
In a genome wide association study (GWAS), many individuals with different phenotypes have their germline cells sequenced and genotyped[[^2]], and the goal is to find the variants[[^3]] that associate with the observable characteristic on interest. Equation \eqref{eq:gen1} could be a plausible genetic model estimated by data from a GWAS by encoding $x_{ij}=\\{0,1,2 \\}$ for the number of alleles person $i$ has (relative to some reference genome), and assuming an additive dominant genetic model.[[^4]] Since a researcher observes $x_i=\\{x_{i1},\dots,x_{ip}\\}$, has no idea which of the $m$ variants are relevant (hence the need to do the study), and has more measurements than observations $p \gg N$, equation \eqref{eq:gen1} cannot actually be estimated.
Instead researchers test for the association between the trait and a genetic locus one at a time, fitting the following model.
$$
\begin{align}
y_i &= x_{ik} \beta_k + e_i \hspace{3mm} i=1,\dots,N, \hspace{1mm} k=1,\dots,p \label{eq:gen2} \\
e_i &= \sum_{j\neq k}^m x_{ij} \beta_k x_{ij} + u_i \nonumber
\end{align}
$$
When the relationship between genetic loci is independent, then there will be no bias in the estimate of $\bhatk$, as can be shown by some simple algebra.
$$
\begin{align}
E(\bhatk) &= E\big( (\bxk' \bxk)^{-1} \bxk' \by \big) \nonumber \\
&= E \Bigg(\beta_k + \sum_{j\neq k}^m \frac{\bxk'\bxk \beta_k}{\|\bxk \|_2^2} + \frac{\bxk'\bu}{\|\bxk \|_2^2} \Bigg) \nonumber \\
&= \beta_k + \sum_{j\neq k}^m \gamma_{kj}\beta_k \label{eq:gen3}
\end{align}
$$
Where $\gamma_{kj}$ is the linear dependence between the genetic factors $k$ and $j$. Again, when the loci are all uncorrelated with each other $\gamma_{kj}=0$ and $E(\bhatk)=\beta_k$. Unfortunately equation \eqref{eq:gen2} is problematic because it is likely that some measured non-causal variants will be correlated with the measured ones, or that causal variants will be correlated with each other but with the opposite sign seen with respect to the phenotype. Despite these problems, univariate tests are popular by researchers according to [Chiara Sabatti](http://statweb.stanford.edu/~sabatti/Preprints/MultiGWAS.pdf) because:
1. Computationally simplicity
2. No imputations needed to fill missing variables in a design matrix
3. Does not need to decide which correlated feature is more important (if they're both good proxies)
4. Makes p-value results that are comparable across studies (see discussion above for the various adjustment mechanisms) which can be used for meta-analyses later
Despite these advantages it nevertheless remains that correlated genotype positions and genetic relatedness between individuals will lead to biased results that could have been overcome by multiple linear regressions techniques such as [generalized least squares](https://en.wikipedia.org/wiki/Generalized_least_squares) had there been more individuals than measurements.
## Selective inference: obtaining valid p-values via the Lasso
The Lasso is an $\ell_1$ penalized regression model where the loss function is balanced by the l1-norm of the coefficients weighted by $\lambda$. A continuous response will continue to be assumed.
$$
\begin{align*}
&\text{Least-squares Lasso} \\
\hat\beta^{\text{lasso}} &\in \arg \min_\beta \hspace{3mm} \frac{1}{N}\|y - X\beta \|_2^2 + \lambda \|\beta\|_1
\end{align*}
$$
For a given choice of $\lambda$, the Lasso may shrink some feature coefficient values to zero. This begs the question, can the non-zero (or "selected") features be tested in terms of statistical significance? At first glance, this seems highly improbable because they Lasso is an *adaptive* model, meaning our hypothesis would be following the data. Why? Because the support (i.e. non-zero values) of $\hat\beta^{\text{lasso}}(\lambda)$ is only known after it has been estimated rather than before. If we knew which variables would be zero before we estimated the model, we wouldn't have needed to include them![[^5]] This idea of [data snooping](https://en.wikipedia.org/wiki/Data_dredging) is well-known.
It is therefore quite surprising and delightful that despite being data-driven, the Lasso's *ex-post* hypothesis tests for the model's coefficients can still generate valid p-values. This is done through a new technique known as [Selective Inference](http://www.pnas.org/content/pnas/112/25/7629.full.pdf). Because the selection event of the Lasso can be characterized by a polyhedral constraint, a conditional distribution can be generated which turns out to be a truncated Gaussian!
$$
\begin{align*}
&\text{Selection event for Lasso} \\
Ay &\leq b \hspace{1cm} \\
&\text{Truncated Gaussian} \\
F_{\eta^T\mu,\sigma^2 \|\eta\|}^{[V^{-1},V^{+}]}&(\eta^Ty) | \{ A_\lambda \leq b_\lambda \} \sim \text{Unif}(0,1) \\
\forall \eta&\in \mathbb{R}^N
\end{align*}
$$
Where the $V$ terms are truncated bounds on the Gaussian distribution that are functions of $\eta,A,b$ and are solvable. Recall that the KKT conditions for the Lasso are of the form: $X_j^T(y-X\beta\hat) = \text{sign}(\beta_j)\lambda$ if the $j^{th}$ feature is selected, and the $A$ matrix and $b$ vector can be used to reflect this. Because Tibshirani and Friedman have been highly influential in developing the Selective Inference tools, they of course have an `R` package `selectiveInference` on CRAN.
Why is this approach conceivable better than univariate tests? Recall that the potential bias that was seen in equation \eqref{eq:gen3} may be lessened if variables are simultaneously conditioned on. Let's compare the true discovery rate from a univariate test where $p=50$, $m=10$, $N=50$, and where the non-causal variables are correlated to the causal elements (i.e. $\gamma_{kj}\neq 0$).
{% highlight r %}
N <- 50
p <- 50
m <- 10
mu <- rep(0,p)
Sigma <- matrix(0.25,nrow=p,ncol=p) + diag(rep(0.75,p))
Beta <- c(rep(1,m),rep(0,p-m))
library(MASS)
library(selectiveInference)
nsim <- 250
tdr.mat <- matrix(NA,nrow=nsim,ncol=2)
for (k in 1:nsim) {
set.seed(k)
X <- mvrnorm(N,mu,Sigma)
XScale <- scale(X)
Y <- as.vector(X %*% Beta) + rnorm(N)
pval.uni <- apply(X,2,function(cc) summary(lm(Y ~ cc))$coef[8] )
pval.uni.adjust <- p.adjust(pval.uni,'fdr')
tdr.uni <- sum(pval.uni.adjust[1:m] < 0.05)/sum(pval.uni.adjust < 0.05)
lam.lasso <- N
mdl.lasso <- glmnet(X,Y,'gaussian',lambda = lam.lasso/N,standardize = F,thresh = 1e-20)
bhat.lasso <- coef(mdl.lasso,exact=TRUE)[-1]
supp.lasso <- which(bhat.lasso !=0)
sighat <- summary(lm(Y ~ X[,supp.lasso]))$sigma
mdl.si <- tryCatch(fixedLassoInf(XScale,Y,bhat.lasso,lam.lasso,sigma = sighat),error=function(e) NA)
if (class(mdl.si) == 'fixedLassoInf') {
supp.lasso <- mdl.si$vars
pval.si <- mdl.si$pv
} else {
supp.lasso <- rep(1,p)
pval.si <- rep(1,p)
}
pval.lasso <- rep(1,p)
pval.lasso[supp.lasso] <- pval.si
tdr.lasso <- sum(pval.lasso[1:m] < 0.05)/sum(pval.lasso < 0.05)
tdr.mat[k,] <- c(tdr.uni,tdr.lasso)
}
tdr.sum <- apply(tdr.mat,2,mean,na.rm=T)
print(sprintf('True discovery rates: univariate=%0.2f, Lasso=%0.2f',tdr.sum[1],tdr.sum[2]))
{% endhighlight %}
{% highlight text %}
## [1] "True discovery rates: univariate=0.22, Lasso=0.85"
{% endhighlight %}
This results are quite impressive! Out of the statistically significant features, 85% of them are true positives for the Lasso, compared to only 22% for the univariate approach. Keep in mind that the univariate approach is still rejecting the null hypothesis of no effect for the true positives most of the time, but is overwhelmed by the false positives. In the genomic situation it may be the case that the primary concern is power and not false positives, and therefore the univariate approach would be less problematic. However there are no guarantees that this will always be the case because the direction of the omitted variable bias may actually push the univariate coefficients towards zero for the true positives. As the size of datasets in bioinformatics continues to grow, the selective inference technique will become increasingly useful.
* * *
## References
[^1]: LD just refers to any pair/network of variants that are likely to be inherited together. In other words, if by knowing your genotype at position A, I am also given some information as to your genotype at position B, these two loci are said to be in LD.
[^2]: All this means is that the sequence of base pairs found at a given region of the genome is determined for each individual.
[^3]: Since the human genome is fully sequenced, we can compare how your base pairing looks at say Chromosome 1, position 1,875,476 compared to the reference. If the reference is say {C,C} and you are {C,T} then you'd be encoded as have one allele. Although technically allele is just an alternative form, so it's more accurate to say the number of *alternative alleles* relative to the reference.
[^4]: Dominant because having one allele is sufficient to cause a phenotypic effect (rather than recessive which would require two alleles to have an impact) and additive because having two alleles has twice the impact of one. Many other plausible genetic models could be assumed as well.
[^5]: Technically the Lasso does not even need to solve the solution path for all the variables due to some [Strong Discarding Rules](http://statweb.stanford.edu/~tibs/ftp/strong.pdf) but these are nevertheless calculated with the response and design matrix.
| 86.140351 | 876 | 0.74277 | eng_Latn | 0.996818 |
b07d2db8a629801266f6705177bc8c30cfe08666 | 560 | md | Markdown | _posts/2015-07-09-Rivini-Spring-2015-Rivini-Aspen.md | eudanceyou/eudanceyou.github.io | 9d81bccab5dd52c95c99495c5800da809ea32ed7 | [
"MIT"
] | null | null | null | _posts/2015-07-09-Rivini-Spring-2015-Rivini-Aspen.md | eudanceyou/eudanceyou.github.io | 9d81bccab5dd52c95c99495c5800da809ea32ed7 | [
"MIT"
] | null | null | null | _posts/2015-07-09-Rivini-Spring-2015-Rivini-Aspen.md | eudanceyou/eudanceyou.github.io | 9d81bccab5dd52c95c99495c5800da809ea32ed7 | [
"MIT"
] | null | null | null | ---
layout: post
date: '2015-07-09'
title: "Rivini Spring 2015 Rivini Aspen"
category: Rivini Spring 2015
tags: [Rivini Spring 2015]
---
### Rivini Spring 2015 Rivini Aspen
Just **$329.99**
###
<a href="https://www.antebrands.com/en/rivini-spring-2015/65917-rivini-aspen.html"><img src="//static.msromantic.com/151975/rivini-aspen.jpg" alt="Rivini Aspen" style="width:100%;" /></a>
<!-- break -->
Buy it: [https://www.antebrands.com/en/rivini-spring-2015/65917-rivini-aspen.html](https://www.antebrands.com/en/rivini-spring-2015/65917-rivini-aspen.html)
| 35 | 188 | 0.7125 | yue_Hant | 0.192489 |
b07dc3c80ec092a8725c3075b01788c9f68a2f25 | 1,320 | md | Markdown | README.md | cucumber-actions/versions | cf9b878c4d86339997f2966dbabd333523ba1509 | [
"MIT"
] | null | null | null | README.md | cucumber-actions/versions | cf9b878c4d86339997f2966dbabd333523ba1509 | [
"MIT"
] | 1 | 2021-09-24T12:39:04.000Z | 2021-09-24T12:39:04.000Z | README.md | cucumber-actions/versions | cf9b878c4d86339997f2966dbabd333523ba1509 | [
"MIT"
] | 1 | 2022-03-22T18:20:37.000Z | 2022-03-22T18:20:37.000Z | [](https://github.com/cucumber/action-get-versions/actions/workflows/test.yml)
# get-versions
This action was developed by the Cucumber team to use as part of our automated release process.
It reads version numbers from two places:
1) The latest git tag
2) The first heading in the `CHANGELOG.md` file
We use these to infer:
1) The currently released version
2) The next version to be released
If there are changes about to be released, the changelog version will be newer than the git tag version, signalling that a release is required.
## Outputs
* `released-version` - the version parsed from the git latest git tag
* `changelog-latest-version` - the version parsed from the top header in the `CHANGELOG.md`
* `is-release-required` - a boolean flag set to `false` unless the two versions are different.
## Inputs
By default, the action searches for git tags of the form `vX.Y.Z` and looks in the root directory for the `CHANGELOG.md` file. You can customize this (e.g. for a monorepo) by using these inputs:
* `tag-prefix` - A prefix to use when searching for tags, e.g. `cucumber-expressions/`
* `changelog-directory` - Path within the repo to look for the `CHANGELOG.md` file
| 42.580645 | 205 | 0.761364 | eng_Latn | 0.996624 |
b07de2b3ecc750bb3d68eadce900a1c1183f428c | 49 | md | Markdown | README.md | prioz17/Computer-Revolutionary-Team | 66177e2425f09edb61cadd16d5322c8aca2861a6 | [
"Unlicense"
] | null | null | null | README.md | prioz17/Computer-Revolutionary-Team | 66177e2425f09edb61cadd16d5322c8aca2861a6 | [
"Unlicense"
] | null | null | null | README.md | prioz17/Computer-Revolutionary-Team | 66177e2425f09edb61cadd16d5322c8aca2861a6 | [
"Unlicense"
] | null | null | null | # Computer-Revolutionary-Team
Chakmahackerdreams
| 16.333333 | 29 | 0.877551 | nld_Latn | 0.42387 |
b07e13fdbb90170f1810a2580979cc2f097bc4ff | 296 | md | Markdown | templates/api/input.template.md | maximeallanic/dgeni-markdown | 4733091d60da53e1b293966545c617c76dd24c49 | [
"Apache-2.0"
] | null | null | null | templates/api/input.template.md | maximeallanic/dgeni-markdown | 4733091d60da53e1b293966545c617c76dd24c49 | [
"Apache-2.0"
] | null | null | null | templates/api/input.template.md | maximeallanic/dgeni-markdown | 4733091d60da53e1b293966545c617c76dd24c49 | [
"Apache-2.0"
] | null | null | null | {% import "lib/macros.md" as lib -%}
{% extends "api/directive.template.md" %}
{% block usage %}
## Usage
```
<input type="{$ doc.inputType $}"
{%- for param in doc.params %}
{$ lib.directiveParam(param.alias or param.name, param.type, '="', '"') $}
{%- endfor %}>
```
{% endblock %}
| 22.769231 | 81 | 0.564189 | eng_Latn | 0.561679 |
b07e8f66de106979e743147109ebed6e3f8993d4 | 402 | md | Markdown | _curatorial_files/676.md | brueghelfamily/brueghelfamily.github.io | a73351ac39b60cd763e483c1f8520f87d8c2a443 | [
"MIT"
] | null | null | null | _curatorial_files/676.md | brueghelfamily/brueghelfamily.github.io | a73351ac39b60cd763e483c1f8520f87d8c2a443 | [
"MIT"
] | null | null | null | _curatorial_files/676.md | brueghelfamily/brueghelfamily.github.io | a73351ac39b60cd763e483c1f8520f87d8c2a443 | [
"MIT"
] | null | null | null | ---
pid: '676'
object_id: '3783'
file_type_category: Normal Light Images
file_type: Detail
file_notes:
file_description: Woodland Landscape with Travelers on a Path - Detail 4
original_format:
research_date:
researchers:
equipment_used:
file_location:
fullwidth: img/derivatives/simple/676/fullwidth.jpg
thumbnail: img/derivatives/simple/676/thumbnail.jpg
order: '245'
collection: curatorial_files
---
| 22.333333 | 72 | 0.813433 | eng_Latn | 0.36306 |
b07f01cd56525915cb5749386fec5b1b610cf169 | 531 | md | Markdown | README.md | rodrigo-picanco/fluid-layout | 6ba4efcd1ee40acd63de47697d2848693853fd4e | [
"MIT"
] | 9 | 2020-04-27T00:21:17.000Z | 2022-01-03T14:27:48.000Z | README.md | rodrigo-picanco/fluid-layout | 6ba4efcd1ee40acd63de47697d2848693853fd4e | [
"MIT"
] | 16 | 2020-07-23T01:29:04.000Z | 2022-02-28T01:37:43.000Z | README.md | rodrigo-picanco/fluid-layout | 6ba4efcd1ee40acd63de47697d2848693853fd4e | [
"MIT"
] | null | null | null | # 🌊Fluid layout
[](https://lerna.js.org/)
CSS library for responsive components without media queries.
## Docs
[Storybook](https://fluid-layout.netlify.app/index.html)
## Install
- `yarn add fluid-layout`
- `npm i fluid-layout`
## Examples
- [Mockfy - A fake Spotify made with this lib](https://glitch.com/~mockfy)
## Inspiration
- [every layout](https://every-layout.dev/)
- [layout land](https://www.youtube.com/channel/UC7TizprGknbDalbHplROtag)
| 24.136364 | 98 | 0.723164 | eng_Latn | 0.297256 |
b07f03b08c3b27a4ea74c808f7053a74fe8dd9aa | 3,327 | md | Markdown | README.md | nkreer/Jeopardy | cda1df835c788f5f725b1478764a28c3d850269c | [
"MIT"
] | null | null | null | README.md | nkreer/Jeopardy | cda1df835c788f5f725b1478764a28c3d850269c | [
"MIT"
] | 3 | 2018-07-24T09:45:59.000Z | 2018-07-24T15:16:18.000Z | README.md | nkreer/Jeopardy | cda1df835c788f5f725b1478764a28c3d850269c | [
"MIT"
] | null | null | null | # jeopardy
This is a hacky piece of software to play a Jeopardy-like gameshow. It's written in Python and JavaScript using the [Eel library by Chris Knott](https://github.com/ChrisKnott/Eel). Please keep in mind that this project is in no way affiliated with Jeopardy! or its producers. All code of this project is released under the [MIT License](LICENSE).
## Usage
### Installation
The ```main.html``` file in the ```web/``` directory expects a ```bootstrap.css``` to be present for correct rendering, so retrieving that is part of the installation process.
```
git clone https://github.com/nkreer/jeopardy
cd jeopardy
pip3 install eel
wget https://stackpath.bootstrapcdn.com/bootstrap/4.1.2/css/bootstrap.min.css -O web/bootstrap.css
```
### Playing
#### Creating cluesets/Preparation
To play, you need to supply a json file containing the clues. You can either use ```clues/example.json``` as a starting point for your own clues or download random ones from [jservice.io](http://jservice.io) using the ```getclues.py``` script. The file defines a list of categories, each category containing a name and a set of clues. If you want, you can also specify the value of the clues for each category independently.
Schema:
```json
[
{
"name": "Category name",
"clues": [
{
"clue": "Your clue here",
"response": "(optional) The expected response",
"double": "set to true if it should be a double jeopardy"
}
]
}
]
```
#### Running
Run ```python3 app.py path/to/clues.json``` in order to start the game with the supplied clues. It'll ask you for the names of the players and allows you to supply a specific color or key for the player if you don't want to use the default. There are default values for up to six players. When you're finished, simply leave the input for a new player name blank and the board will open in a Chromium/Chrome window.
If you'd like to play using a clue and/or player dump from a previous game, you can simply use the dump as the clue source and append the location of the player dump.
```python3 app.py path/to/cluedump.json path/to/playerdump/.json```
#### Managing the game
Click on a button to play a clue. Players can buzz in using the key specified during setup. You can use the following keys to then manage the game:
While the board is displayed:
```
w - export the game data so it can be loaded later
r - re-load the board
x - randomly select a player (result is shown in the infobar)
```
While showing a clue:
```
q - return to the board, discard
w - return to the board, mark the clue as played
r - reset buzzed in player
v - verify the response of the buzzed in player as correct, give points
x - incorrect response, take points
c - reveal the expected response (on the host display only)
```
These are customisable in ```config.json```.
Thanks to some Eel magic, you have the option to enable a host screen. This will let you view the expected response provided with the clues. To activate this feature, set ```host_screen``` in ```config.json``` to true. Please note that enabling this will open up a seperate **viewer**-window! The regular host window must be in focus in order to capture the keys pressed. | 43.776316 | 424 | 0.721371 | eng_Latn | 0.998602 |
b080141951a5608152308e010250850707b77f31 | 12 | md | Markdown | README.md | vardonia/jkl | 854e8879a21131af7c479e78706d390f47e197e4 | [
"Apache-2.0"
] | null | null | null | README.md | vardonia/jkl | 854e8879a21131af7c479e78706d390f47e197e4 | [
"Apache-2.0"
] | null | null | null | README.md | vardonia/jkl | 854e8879a21131af7c479e78706d390f47e197e4 | [
"Apache-2.0"
] | null | null | null | # jkl
fghjj
| 4 | 5 | 0.666667 | mlt_Latn | 0.665591 |
b080637455501068f1ffc534c5249edf1356ceb6 | 49,706 | md | Markdown | manuscript/210_How_are_objects_composed.md | robi-y/tdd-ebook | 119467948b8536810e2de83f29af16f934c975e9 | [
"CC-BY-3.0"
] | null | null | null | manuscript/210_How_are_objects_composed.md | robi-y/tdd-ebook | 119467948b8536810e2de83f29af16f934c975e9 | [
"CC-BY-3.0"
] | null | null | null | manuscript/210_How_are_objects_composed.md | robi-y/tdd-ebook | 119467948b8536810e2de83f29af16f934c975e9 | [
"CC-BY-3.0"
] | null | null | null | Composing a web of objects
==========================
Three important questions
-------------------------
Ok, I told you that such a thing as a web of objects exists, that there are connections, protocols and such, but there is one thing I left out: how does a web of objects come into existence?
This is, of course, a fundamental question, because if we are not able to build a web, we do not have a web. In addition, this is a question that is a little more tricky that you may think and it contains three other questions that we need to answer:
1. When are objects composed (i.e. when connections are made)?
2. How does an object obtain a reference to another one in the web (i.e. how connections made)?
3. Where are objects composed (i.e. where connections are made)?
For now, you may have some trouble understanding the difference between those questions, but the good news is that they are the topic of this chapter, so I hope we will have that cleared shortly. Let's go!
## A preview
Before we take a deep dive, let's try to answer these three questions for a really simple example code of a console application:
```csharp
public static void Main(string[] args)
{
var sender = new Sender(new Recipient());
sender.Work();
}
```
And here are the answers to our questions:
1. When are objects composed? Answer: up-front, during application startup.
2. How does an object (`Sender`) obtain a reference to another one
(`Recipient`)? Answer: the reference is obtained as a constructor parameter.
3. Where are objects composed? Answer: at application entry point (`Main()`
method)
Depending on circumstances, we have different sets of best answers. To find them, let's take the questions on one by one.
When are objects composed?
--------------------------
The quick answer to this question is: as early as possible. Now, that wasn't too helpful, was it? So here goes a clarification.
Many of the objects we use in our applications can be created and connected up-front when the application starts and can stay this way until the application finishes executing (unless we are doing a web app -- then most of the important stuff happens "per request"). Let's call this part the **static part** of the web.
Apart from that, there's a **dynamic part** -- a part that undergoes constant changes -- objects are created, destroyed, connected temporarily, and then disconnected. There are at least two reasons this dynamic part exists:
1. Some objects represent requests or user actions that arrive during the application runtime, are processed and then discarded. These objects cannot be composed up-front (because they do not exist yet), but only as early as the events they represent occur. Also, these objects do not live until the application is terminated, but are discarded as soon as the processing of a request is finished. Other objects represent e.g. items in cache that live for some time and then expire, so, again, we do not have these objects up-front and they often do not live as long as the application itself. All of these objects come and go, making temporary connections.
2. There are objects that have a life span as long as the application itself, but are connected only for the needs of a single interaction (e.g. when one object is passed to a method of another as an argument) or at some point during the application runtime.
It is perfectly possible for an object to be part of both static and dynamic part -- some of its connections may be made up-front, while others may be created later, e.g. when it is passed inside a message sent to another object (i.e. passed as method parameter).
How does a sender obtain a reference to a recipient (i.e. how connections are made)?
------------------------------------------------
There are few ways this can happen, each of them useful in certain circumstances. These ways are:
1. Receive as constructor parameter
2. Receive inside a message (i.e. as a method parameter)
3. Receive in response to message (i.e. as method return value)
4. Register a recipient with already created sender
Let's have a closer look at what each of them is about and which one to choose in what circumstances.
### Receive as constructor parameter
Two objects can be composed by passing one into the constructor of another:
```csharp
sender = new Sender(recipient);
```
A sender that receives the recipient then saves a reference to it in a private field for later, like this:
```csharp
private Recipient _recipient;
public Sender(Recipient recipient)
{
_recipient = recipient;
}
```
Starting from this point, the `Sender` may send messages to `Recipient` at will:
```csharp
public DoSomething()
{
//... other code
_recipient.DoSomethingElse();
//... other code
}
```
#### Advantage: "what you hide, you can change"
Composing using constructors has one significant advantage. By separating object use from construction, we end up with the code that creates a `Sender` being in a totally different place than the code that uses it. And, as `Recipient` is passed to `Sender` during its creation, it is the only place external to the `Sender` that needs to know that `Sender` uses `Recipient`. The part of code that uses `Sender` is not aware at all that `Sender` stores a reference to `Recipient` inside it. This basically means that when `Sender` is used, e.g. like this:
```csharp
sender.DoSomething()
```
the `Sender` may then react by sending message to `Recipient`, but the code invoking the `DoSomething()` method is completely unaware of that -- it is hidden. This is good, because "what you hide, you can change"[^kolskybain] -- e.g. if we decide that the `Sender` needs not use the `Recipient` to do its duty, the code that uses `Sender` does not need to change at all -- it still looks the same as before:
```csharp
sender.DoSomething()
```
All we have to change is the composition code to remove the `Recipient`:
```csharp
//no need to pass a reference to Recipient anymore
new Sender();
```
and the `Sender` class itself will work in a different way.
#### Communication of intent: required recipient
Another advantage of the constructor approach is that if a reference to `Recipient` is required for a `Sender` to work correctly and it does not make sense to create a `Sender` without a `Recipient`, the signature of the constructor makes it explicit -- the compiler will not let us create a `Sender` without passing *something* as a `Recipient`.
#### Where to apply
Passing into constructor is a great solution in cases we want to compose sender with a recipient permanently (i.e. for the lifetime of `Sender`). In order to be able to do this, a `Recipient` must, of course, exist before a `Sender` does. Another less obvious requirement for this composition is that `Recipient` must be usable at least as long as `Sender` is usable. In other words, the following is nonsense:
```csharp
sender = new Sender(recipient);
recipient.Dispose(); //but sender is unaware of it
//and may still use recipient in:
sender.DoSomething();
```
### Receive inside a message (i.e. as a method parameter)
Another common way of composing objects together is passing one object
as a parameter of another object's method call:
```csharp
sender.DoSomethingWithHelpOf(recipient);
```
In such case, the objects are most often composed temporarily, just for
the time of execution of this single method:
```csharp
public void DoSomethingWithHelpOf(Recipient recipient)
{
//... perform some logic
recipient.HelpMe();
//... perform some logic
}
```
#### Where to apply
Contrary to the constructor approach, where a `Sender` could hide from its user the fact that it needs `Recipient`, in this case the user of `Sender` is explicitly responsible for supplying a `Recipient`. It may look like the coupling of user to `Recipient` is a disadvantage, but there are scenarios where it is actually **required** for a code using `Sender` to be able to provide its own `Recipient` -- it lets us use the same sender with different recipients at different times (most often from different parts of the code):
```csharp
//in one place
sender.DoSomethingWithHelpOf(recipient);
//in another place:
sender.DoSomethingWithHelpOf(anotherRecipient);
//in yet another place:
sender.DoSomethingWithHelpOf(yetAnotherRecipient);
```
If this ability is not required, the constructor approach is better as it removes the then unnecessary coupling between code using `Sender` and a `Recipient`.
### Receive in response to a message (i.e. as method return value)
This method of composing objects relies on an intermediary object -- often a factory[^gofcreationpatterns] -- to supply recipients on request. To simplify things, I will use factories as an example for the rest of this section, although what I tell you is true for some other creation patterns as well.
To be able to ask a factory for recipients, the sender needs to obtain a reference to it first. Typically, a factory is composed with a sender through constructor (an approach we already discussed). For example:
```csharp
var sender = new Sender(recipientFactory);
```
The factory can then be used by the `Sender` at will to get a hold of new recipients:
```csharp
public class Sender
{
//...
public DoSomething()
{
//ask the factory for a recipient:
var recipient = _recipientFactory.CreateRecipient();
//use the recipient:
recipient.DoSomethingElse();
}
}
```
#### Where to apply
This kind of composition is beneficial when a new recipient is needed each time `DoSomething()` is called. In this sense it may look much like in case of previously discussed approach of receiving a recipient inside a message. There is one difference, however. Contrary to passing a recipient inside a message, where the code using the `Sender` passed a `Recipient` "from outside" of the `Sender`, in this approach, we rely on a separate object that is used by a `Sender` "from the inside".
To be more clear, let's compare the two approaches. Passing recipient inside a message looks like this:
```csharp
//Sender gets a Recipient from the "outside":
public DoSomething(Recipient recipient)
{
recipient.DoSomethingElse();
}
```
and obtaining from factory:
```csharp
//a factory is used "inside" Sender
//to obtain a recipient
public DoSomething()
{
var recipient = _factory.CreateRecipient();
recipient.DoSomethingElse();
}
```
So in the first example, the decision on which `Recipient` is used is made by whoever calls `DoSomething()`. In the factory example, whoever calls `DoSomething()` does not know at all about the `Recipient` and cannot directly influence which `Recipient` is used. The factory makes this decision.
#### Factories with parameters
So far, all the factories we considered had creation methods with empty parameter list, but this is not required. As the factory remains the decision maker on which `Recipient` is used, it can rely on some external parameters to help it make the decision.
#### Not only factories
Throughout this section, we have used a factory as our role model, but the approach of obtaining a recipient in response to a message is wider than that. Other types of objects that fall into this category include: repositories, caches, builders and collections. [[I suggest to add quick explantions and references to these new presented important concepts]]
### Register a recipient with already created sender
This means passing a recipient to an **already created** sender (contrary to passing as constructor parameter where recipient was passed **during** creation) as a parameter of a method that stores the
reference for later use. This may be a "setter" method, although I do not like naming it according to the convention "setWhatever()" -- after Kent Beck[^implementationpatterns] I find this convention too much implementation-focused instead of purpose-focused. Thus, I pick different names based on what domain concept is modeled by the registration method or what is its purpose.
Note that there is one similarity to the "passing inside a message" approach -- in both, a recipient is passed inside a message. The difference is that this time, contrary to "pass inside a message" approach, the passed recipient is not immediately used (and then forgotten), but rather only remembered (registered) for later use.
I hope I can clear up the confusion with a quick example.
#### Example
Suppose we have a temperature sensor that can report its current and historically mean value to whoever subscribes with it. If no one subscribes, the sensor still does its job, because it still has to collect the data for calculating a history-based mean value in case anyone subscribes later.
We may solve the problem by introducing an observer registration mechanism in the sensor implementation. If no observer is registered, the values are not reported (in other words, a registered observer is not required for the object to function, but if there is one, it can take advantage of the reports). For this purpose, let's make our sensor depend on an interface called `TemperatureObserver` that could be implemented by various concrete observer classes. The interface declaration looks like this:
```csharp
public interface TemperatureObserver
{
void NotifyOn(
Temperature currentValue,
Temperature meanValue);
}
```
Now we are ready to look at the implementation of the temperature sensor itself and how it uses this `TemperatureObserver` interface. Let's say that the class representing the sensor is called `TemperatureSensor`. Part of its definition could look like this:
```csharp
public class TemperatureSensor
{
private TemperatureObserver _observer
= new NullObserver(); //ignores reported values
private Temperature _meanValue
= Temperature.Celsius(0);
// + maybe more fields related to storing historical data
public void Run()
{
while(/* needs to run */)
{
var currentValue = /* get current value somehow */;
_meanValue = /* update mean value somehow */;
_observer.NotifyOn(currentValue, _meanValue);
WaitUntilTheNextMeasurementTime();
}
}
}
```
As you can see, by default, the sensor reports its values to nowhere (`NullObserver`), which is a safe default value (using a `null` for a default value instead would cause exceptions or force us to put an ugly null check inside the `Run()` method). We have already seen such "null objects" a few times before (e.g. in the previous chapter, when we introduced the `NoAlarm` class) -- `NullObserver` is just another incarnation of this pattern. [[I thinks the "null object pattern" is quite a common name so can be mentioned]]
#### Registering observers
Still, we want to be able to supply our own observer one day, when we start caring about the measured and calculated values (the fact that we "started caring" may be indicated to our application e.g. by a network message or an event from the user interface). This means we need to have a method inside the `TemperatureSensor` class to overwrite this default "do-nothing" observer with a custom one **after** the `TemperatureSensor` instance is created. As I said, I do not like the "SetXYZ()" convention, so I will name the registration method `FromNowOnReportTo()` and make the observer an argument. Here are the relevant parts of the `TemperatureSensor` class:
```csharp
public class TemperatureSensor
{
private TemperatureObserver _observer
= new NullObserver(); //ignores reported values
//... ... ...
public void FromNowOnReportTo(TemperatureObserver observer)
{
_observer = observer;
}
//... ... ...
}
```
This lets us overwrite the observer with a new one should we ever need to do it. Note that, as I mentioned, this is the place where registration approach differs from the "pass inside a message" approach, where we also received a recipient in a message, but for immediate use. Here, we don't use the recipient (i.e. the observer) when we get it, but instead we save it for later use.
#### Communication of intent: optional dependency
Allowing registering recipients after a sender is created is a way of saying: "the recipient is optional -- if you provide one, fine, if not, I will do my work without it". Please, do not use this kind of mechanism for **required** recipients -- these should all be passed through a constructor, making it harder to create invalid objects that are only partially ready to work. Placing a recipient in a constructor signature is effectively saying that "I will not work without it". Let's practice -- just look at how the following class members signatures talk to you:
```csharp
public class Sender
{
//"I will not work without a Recipient1"
public Sender(Recipient1 recipient1) {...}
//"I will do fine without Recipient2 but you
//can overwrite the default here to take advantage
//of some features"
public void Register(Recipient2 recipient2) {...}
}
```
#### More than one observer
[[Also here I think it is worth mentioning that this is the observer pattern. Also that for more complex scenarion there are messaging, pubsub etc. frameworks and patterns]]
Now, the observer API we just skimmed over gives us the possibility to have a single observer at any given time. When we register a new observer, the reference to the old one is overwritten. This is not really useful in our context, is it? With real sensors, we often want them to report their measurements to multiple places (e.g. we want the measurements printed on screen, saved to database, used as part of more complex calculations). This can be achieved in two ways.
The first way would be to just hold a collection of observers in our sensor, and add to this collection whenever a new observer is registered:
```csharp
private IList<TemperatureObserver> _observers
= new List<TemperatureObserver>();
public void FromNowOnReportTo(TemperatureObserver observer)
{
_observers.Add(observer);
}
```
In such case, reporting would mean iterating over the observers list:
```csharp
...
foreach(var observer in _observers)
{
observer.NotifyOn(currentValue, meanValue);
}
...
```
Another, more flexible option, is to use something like we did in the previous chapter with a `HybridAlarm` (remember? It was an alarm aggregating other alarms) -- i.e. instead of introducing a collection in the sensor, we can create a special kind of observer -- a "broadcasting observer" that would itself hold collection of other observers (hurrah composability!) and broadcast the values to them every time it itself receives those values:
```csharp
public class BroadcastingObserver
: TemperatureObserver
{
private readonly
TemperatureObserver[] _observers;
public BroadcastingObserver(
params TemperatureObserver[] observers)
{
_observers = observers;
}
public void NotifyOn(
Temperature currentValue,
Temperature meanValue)
{
foreach(var observer in _observers)
{
observer.NotifyOn(currentValue, meanValue);
}
}
}
```
This `BroadcastingObserver` could be instantiated and registered like this:
```csharp
//instantiation:
var broadcastingObserver
= new BroadcastingObserver(
new DisplayingObserver(),
new StoringObserver(),
new CalculatingObserver());
...
//registration:
sensor.FromNowOnReportTo(broadcastingObserver);
```
The additional benefit of modeling broadcasting as an observer is that it would let us change the broadcasting policy without touching either the sensor code or the other observers. For example, we might introduce `ParallelBroadcastObserver` that would notify each observer asynchronously instead of sequentially and put it to use by changing the composition code only:
```csharp
//now using parallel observer
var broadcastingObserver
= new ParallelBroadcastObserver( //change here!
new DisplayingObserver(),
new StoringObserver(),
new CalculatingObserver());
sensor.FromNowOnReportTo(broadcastingObserver);
```
Anyway, as I said, use registering instances very wisely and only if you specifically need it. Also, if you do use it, evaluate how allowing changing observers at runtime is affecting your multithreading scenarios. This is because a collection of observers might potentially be modified by two threads at the same time.
Where are objects composed?
---------------------------
Ok, we went through some ways of passing a recipient to a sender. We did it from the "internal" perspective of a sender that is given a recipient. What we left out for the most part is the "external" perspective, i.e. who should pass the recipient into the sender?
For almost all of the approaches described above there is no limitation -- you pass the recipient from where you need to pass it.
There is one approach, however, that is more limited, and this approach is **passing as constructor parameter**.
Why is that? Because, we are trying to be true to the principle of "separating objects creation from use" and this, in turn, is a result of us striving for composability.
Anyway, if an object cannot both use and create another object, we have to make special objects just for creating other objects (there are some design patterns for how to design such objects, but the most popular and useful is a **factory**) or defer the creation up to the application entry point (there is also a pattern for this, called **composition root**).
So, we have two cases to consider. I'll start with the second one.
### Composition Root
let's assume, just for fun, that we are creating a mobile game where a player has to defend a castle. This game has two levels. Each level has a castle to defend. So, we can break down the domain logic into three classes: a `Game` that has two `Level`s and each of them that contain a `Castle`. let's also assume that the first two classes violate the principle of separating use from construction, i.e. that a `Game` creates its own levels and each `Level` creates its own castle.
A `Game` class is created in the `Main()` method of the application:
```csharp
public static void Main(string[] args)
{
var game = new Game();
game.Play();
}
```
The `Game` creates its own `Level` objects of specific classes implementing the `Level` interface and stores them in an array:
```csharp
public class Game
{
private Level[] _levels = new[] {
new Level1(), new Level2()
};
//some methods here that use the levels
}
```
And the `Level` implementations create their own castles and assign them to fields of interface type `Castle`:
```csharp
public class Level1
{
private Castle _castle = new SmallCastle();
//some methods here that use the castle
}
public class Level2
{
private Castle _castle = new BigCastle();
//some methods here that use the castle
}
```
Now, I said (and I hope you see it in the code above) that the `Game`, `Level1` and `Level2` classes violate the principle of separating use from construction. We don't like this, do we? So now we will try to make them more compliant with the principle.
#### Achieving separation of use from construction
First, let's refactor the `Level1` and `Level2` according to the principle by moving instantiation of their castles out. As existence of a castle is required for a level to make sense at all -- we will say this in code by using the approach of passing a castle through a `Level`'s constructor:
```csharp
public class Level1
{
private Castle _castle;
//now castle is received as
//constructor parameter
public Level1(Castle castle)
{
_castle = castle;
}
//some methods here that use the castle
}
public class Level2
{
private Castle _castle;
//now castle is received as
//constructor parameter
public Level2(Castle castle)
{
_castle = castle;
}
//some methods here that use the castle
}
```
This was easy, wasn't it? The only problem is that if the instantiations of castles are not in `Level1` and `Level2` anymore, then they have to be passed by whoever creates the levels. In our case, this falls on the shoulders of `Game` class:
```csharp
public class Game
{
private Level[] _levels = new[] {
//now castles are created here as well:
new Level1(new SmallCastle()),
new Level2(new BigCastle())
};
//some methods here that use the levels
}
```
But remember -- this class suffers from the same violation of not separating objects use from construction as the levels did. Thus, to make this class compliant to the principle as well, we have to do the same to it that we did to the level classes -- move the creation of levels out of it:
```csharp
public class Game
{
private Level[] _levels;
//now levels are received as
//constructor parameter
public Game(Level[] levels)
{
_levels = levels;
}
//some methods here that use the levels
}
```
There, we did it, but again, the levels now must be supplied by whoever creates the `Game`. Where do we put them? In our case, the only choice left is the `Main()` method of our application, so this is exactly what we are going to do:
```csharp
public static void Main(string[] args)
{
var game =
new Game(
new Level[] {
new Level1(new SmallCastle()),
new Level2(new BigCastle())
});
game.Play();
}
```
By the way, the `Level1` and `Level2` are differed only by the castle types and this difference is no more as we refactored it out, so we can make them a single class and call it e.g. `TimedLevel` (because it is considered passed[[??not clear]] when we defend our castle for a specific period of time). After this move, now we have:
```csharp
public static void Main(string[] args)
{
var game =
new Game(
new Level[] {
new TimedLevel(new SmallCastle()),
new TimedLevel(new BigCastle())
});
game.Play();
}
```
Looking at the code above, we might come to another funny conclusion -- this violates the principle of separating use from construction as well! First, we create and connect the web of objects and then send the `Play()` message to the `game` object. Shouldn't we fix this as well?
The answer is "no", for two reasons:
1. There is no further place we can defer the creation. Sure, we could move the creation of the `Game` object and its dependencies into a separate object responsible only for the creation (we call such object **a factory**, as you already know), but it's a dead end, because it would leave us with the question: where do we create the factory?
2. The whole point of the principle we are trying to apply is decoupling, i.e. giving ourselves the ability to change one thing without having to change another. When we think of it, there is no point of decoupling the entry point of the application from the application itself, since this is the most application-specific and non-reusable part of the application we can imagine.
What is important is that we reached a place where the web of objects is created using constructor approach and we have no place left to defer the the creation of the web (in other words, it is as close as possible to application entry point). Such a place is called [**a composition root**](http://blog.ploeh.dk/2011/07/28/CompositionRoot/).
We say that composition root is "as close as possible" to application entry point, because there may be different frameworks in control of your application and you will not always have the `Main()` method at your service[^seemanndi].
Apart from the constructor invocations, the composition root may also contain, e.g., registrations of observers (see registration approach to passing recipients) if such observers are already known at this point. It is also responsible for disposing of all objects it created that require explicit disposal after the application finishes running. This is because it creates them and thus it is the only place in the code that can safely determine when they are not needed.
The composition root above looks quite small, but you can imagine it grows a lot in bigger applications. There are techniques of refactoring the composition root to make it more readable and cleaner -- we will explore such techniques in further chapters.
### Factories
As I previously said, it is not always possible to pass everything through the constructor. One of the approaches we discussed that we can use in such cases is **a factory**.
When we previously talked about factories, we focused on it being just a source of objects. This time we will have a much closer look at what factory is and what are its benefits.
But first, let's look at an example of a factory emerging in code that was not using it, as a mere consequence of trying to follow the principle of separating objects use from construction.
#### Emerging factory -- example
Consider the following code that receives a frame from the network (as raw data), then packs it into an object, validates and applies to the system:
```csharp
public class MessageInbound
{
//...initialization code here...
public void Handle(Frame frame)
{
// determine the type of message
// and wrap it with an object
ChangeMessage change = null;
if(frame.Type == FrameTypes.Update)
{
change = new UpdateRequest(frame);
}
else if(frame.Type == FrameTypes.Insert)
{
change = new InsertRequest(frame);
}
else
{
throw
new InvalidRequestException(frame.Type);
}
change.ValidateUsing(_validationRules);
_system.Apply(change);
}
}
```
Note that this code violates the principle of separating use from construction. The `change` is first created, depending on the frame type, and then used (validated and applied) in the same method. On the other hand, if we wanted to separate the construction of `change` from its use, we have to note that it is impossible to pass an instance of the `ChangeMessage` through the `MessageInbound` constructor, because this would require us to create the `ChangeMessage` before we create the `MessageInbound`. Achieving this is impossible, because we can create messages only as soon as we know the frame data which the `MessageInbound` receives.
Thus, our choice is to make a special object that we would move the creation of new messages into. It would produce the new instances when requested, hence the name **factory**. The factory itself can be passed through constructor, since it does not require a frame to exist -- it only needs one when it is asked to create a message.
Knowing this, we can refactor the above code to the following:
```csharp
public class MessageInbound
{
private readonly
MessageFactory _messageFactory;
private readonly
ValidationRules _validationRules;
private readonly
ProcessingSystem _system;
public MessageInbound(
//this is the factory:
MessageFactory messageFactory,
ValidationRules validationRules,
ProcessingSystem system)
{
_messageFactory = messageFactory;
_validationRules = validationRules;
_system = system;
}
public void Handle(Frame frame)
{
var change = _messageFactory.CreateFrom(frame);
change.ValidateUsing(_validationRules);
_system.Apply(change);
}
}
```
This way we have separated message construction from its use.
By the way, the factory itself looks like this:
```csharp
public class InboundMessageFactory
: MessageFactory
{
ChangeMessage CreateFrom(Frame frame)
{
if(frame.Type == FrameTypes.Update)
{
return new UpdateRequest(frame);
}
else if(frame.Type == FrameTypes.Insert)
{
return new InsertRequest(frame);
}
else
{
throw
new InvalidRequestException(frame.Type);
}
}
}
```
And this is it. We have a factory now and the way we got to this point is by trying to be true to the principle of separating use from construction.
Now that we are through with the example, we are ready for some more general explanation on factories.
#### Reasons to use factories
As you saw in the example, factories are objects responsible for creating other objects. They are used to achieve the separation of object constructions from their use when not all of the context necessary to create an object is known up-front. We pass the part of the context we know up-front (so called **global context**) in the factory via its constructor and supply the rest that becomes available later (so called **local context**) in a form of factory method parameters when it becomes available:
```csharp
var factory = new Factory(globalContextKnownUpFront);
//...
factory.CreateInstance(localContext);
```
Another case for using a factory is when we need to create a new object each time some kind of request is made (a message is received from the network or someone clicks a button):
```csharp
var factory = new Factory(globalContext);
//...
//we need a fresh instance
factory.CreateInstance();
//...
//we need another fresh instance
factory.CreateInstance();
```
In the above example, two independent instances are created, even though both are created in an identical way (there is no local context that would differ them).
Both these reasons were present in our example:
1. We were unable to create a `ChangeMessage` before knowing the actual `Frame`.
2. For each `Frame` received, we needed to create a new `ChangeMessage` instance.
#### Simplest factory
The simplest possible example of a factory object is something along the following lines:
```csharp
public class MyMessageFactory
{
public MyMessage CreateMyMessage()
{
return new MyMessage();
}
}
```
Even in this primitive shape the factory already has some value (e.g. we can make `MyMessage` an abstract type and return instances of its subclasses from the factory, and the only place impacted by the change is the factory itself[^essentialskills]). More often, however, when talking about simple factories, we think about something like this:
```csharp
//Let's assume MessageFactory
//and Message are interfaces
public class XmlMessageFactory : MessageFactory
{
public Message CreateSessionInitialization()
{
return new XmlSessionInitialization();
}
}
```
Note the two things that the factory in the second example has that the one in the first example does not:
* it implements an interface (a level of indirection is introduced)
* its `CreateSessionInitialization()` method declares a return type to be an interface (another level of indirection is introduced)
In order for you to use factories effectively, I need you to understand why and how these levels of indirection are useful, especially when I talk with people, they often do not understand the benefits of using factories, "because we already have the `new` operator to create objects". So, here are these benefits:
#### Factories allow creating objects polymorphically (encapsulation of type)
Each time we invoke a `new` operator, we have to put a name of a concrete type next to it:
```csharp
new List<int>(); //OK!
new IList<int>(); //won't compile...
```
This means that whenver we want to use the class that does this instantiation with another concrete object (e.g. a sorted list), we have to either change the code to delete the old type name and put new type name, or provide some kind of conditional (`if-else`).
Factories do not have this defficiency. Because we get objects from factories by invoking a method, not by saying explicitly which class we want to get instantiated, we can take advantage of polymorphism, i.e. our factory may have a method like this:
```csharp
IList<int> CreateContainerForData() {...}
```
which returns any instance of a real class that implements `IList<int>` (say, `List<int>`):
```csharp
public IList<int> /* return type is interface */
CreateContainerForData()
{
return new List<int>(); /* instance of concrete class */
}
```
Of course, it makes little sense for the return type of the factory to be a library class or interface (rather, we use factories to create instances of our own classes), but you get the idea, right?
Anyway, it is typical for a return type of a factory to be an interface or, at worst, an abstract class. This means that whoever uses the factory, it knows only that it receives an object of a class that is implementing an interface or is derived from abstract class. But it does not know exactly what *concrete* type it is. Thus, a factory may return objects of different types at different times, depending on some rules only it knows.
Time to look at some more realistic example of how to apply this. Let's say we have a factory of messages like this:
```csharp
public class Version1ProtocolMessageFactory
: MessageFactory
{
public Message NewInstanceFrom(MessageData rawData)
{
switch(rawData.MessageType)
{
case Messages.SessionInit:
return new SessionInit(rawData);
case Messages.SessionEnd:
return new SessionEnd(rawData);
case Messages.SessionPayload:
return new SessionPayload(rawData);
default:
throw new UnknownMessageException(rawData);
}
}
}
```
Note that the factory can create many different types of messages depending on what is inside the raw data, but from the perspective of the user of the factory, this is irrelevant. All that it knows is that it gets a `Message`, thus, it (and the rest of the code operating on messages in the whole application for that matter) can be written as general-purpose logic, containing no "special cases" dependent on type of message:
```csharp
var message = _messageFactory.NewInstanceFrom(rawData);
message.ValidateUsing(_primitiveValidations);
message.ApplyTo(_sessions);
```
Note that the above code does not need to change in case we want to add a new type of message that is compatible with the existing flow of processing messages[^messageotherchangecase]. The only place we need to modify in such case is the factory. For example, imagine we decided to add a session refresh message. The modified factory would look like this:
```csharp
public class Version1ProtocolMessageFactory
: MessageFactory
{
public Message NewInstanceFrom(MessageData rawData)
{
switch(rawData.MessageType)
{
case Messages.SessionInit:
return new SessionInit(rawData);
case Messages.SessionEnd:
return new SessionEnd(rawData);
case Messages.SessionPayload:
return new SessionPayload(rawData);
case Messages.SessionRefresh: //new message type!
return new SessionRefresh(rawData);
default:
throw new UnknownMessageException(rawData);
}
}
}
```
and the rest of the code could remain untouched.
Using the factory to hide the real type of message returned makes maintaining the code easier, because there is less code to change when adding new types of messages to the system or removing existing ones (in our example -- in case when we do not need to initiate a session anymore) [^encapsulatewhatvaries] -- the factory hides that and the rest of the application is coded against the general scenario.
#### Factories are themselves polymorphic (encapsulation of rule)
Another benefit of factories over inline constructors is that they are composable. This allows replacing the rule used to create objects with another one, by replacing one factory implementation with another.
In the example from the previous section, we examined a situation where we extended the existing factory with a `SessionRefresh` message. This was done with assumption that we do not need the previous version of the factory. But consider a situation where we need both versions of the behavior and want to be able to use the old version sometimes, and other times the new one. The "version 1" of the factory (the old one) would look like this:
```csharp
public class Version1ProtocolMessageFactory
: MessageFactory
{
public Message NewInstanceFrom(MessageData rawData)
{
switch(rawData.MessageType)
{
case Messages.SessionInit:
return new SessionInit(rawData);
case Messages.SessionEnd:
return new SessionEnd(rawData);
case Messages.SessionPayload:
return new SessionPayload(rawData);
default:
throw new UnknownMessageException(rawData);
}
}
}
```
and the "version 2" (the new one) would be:
```csharp
//note that now it is a version 2 protocol factory
public class Version2ProtocolMessageFactory
: MessageFactory
{
public Message NewInstanceFrom(MessageData rawData)
{
switch(rawData.MessageType)
{
case Messages.SessionInit:
return new SessionInit(rawData);
case Messages.SessionEnd:
return new SessionEnd(rawData);
case Messages.SessionPayload:
return new SessionPayload(rawData);
case Messages.SessionRefresh: //new message type!
return new SessionRefresh(rawData);
default:
throw new UnknownMessageException(rawData);
}
}
}
```
Depending on what the user chooses in the configuration, we give them either a version 1 protocol support which does not support session refreshing, or a version 2 protocol support that does. Assuming the configuration is only read once during the application start, we may have the following code in our composition root:
```csharp
MessageFactory messageFactory = configuration.Version == 1 ?
new Version1ProtocolMessageFactory() :
new Version2ProtocolMessageFactory() ;
var messageProcessing = new MessageProcessing(messageFactory);
```
The above code composes a `MessageProcessing` instance with either a `Version1ProtocolMessageFactory` or a `Version2ProtocolMessageFactory`, depending on the configuration.
This example shows something I like calling "encapsulation of rule". The logic inside the factory is actually a rule on how, when and which objects to create. Thus, if we make our factory implement an interface and have other objects depend on this interface, we will be able to switch the rules of object creation without having to modify these objects.
#### Factories can hide some of the created object dependencies (encapsulation of global context)
Let's consider another simple example. We have an application that, again, can process messages. One of the things that is done with those messages is saving them in a database and another is validation. The processing of message is, like in previous examples, handled by a `MessageProcessing` class, which, this time, does not use any factory, but creates the messages based on the frame data itself. let's look at this class:
```csharp
public class MessageProcessing
{
private DataDestination _database;
private ValidationRules _validation;
public MessageProcessing(
DataDestination database,
ValidationRules validation)
{
_database = database;
_validation = validation;
}
public void ApplyTo(MessageData data)
{
//note this creation:
var message =
new Message(data, _database, _validation);
message.Vaidate();
message.Persist();
//... other actions
}
}
```
There is one noticeable thing about the `MessageProcessing` class. It depends on both `DataDestination` and `ValidationRules` interfaces, but does not use them. The only thing it needs those interfaces for is to supply them as parameters to the constructor of a `Message`. As a number of `Message` constructor parameters grows, the `MessageProcessing` will have to change to take more parameters as well. Thus, the `MessageProcessing` class gets polluted by something that it does not directly need.
We can remove these dependencies from `MessageProcessing` by introducing a factory that would take care of creating the messages in its stead. This way, we only need to pass `DataDestination` and `ValidationRules` to the factory, because `MessageProcessing` never needed them for any reason other than creating messages. This factory may look like this:
```csharp
public class MessageFactory
{
private DataDestination _database;
private ValidationRules _validation;
public MessageFactory(
DataDestination database,
ValidationRules validation)
{
_database = database;
_validation = validation;
}
public Message CreateFrom(MessageData data)
{
return
new Message(data, _database, _validation);
}
}
```
Now, note that the creation of messages was moved to the factory, along with the dependencies needed for this. The `MessageProcessing` does not need to take these dependencies anymore, and can stay more true to its real purpose:
```csharp
public class MessageProcessing
{
private MessageFactory _factory;
//now we depend on the factory only:
public MessageProcessing(
MessageFactory factory)
{
_factory = factory;
}
public void ApplyTo(MessageData data)
{
//no need to pass database and validation
//since they already are inside the factory:
var message = _factory.CreateFrom(data);
message.Vaidate();
message.Persist();
//... other actions
}
}
```
So, instead of `DataDestination` and `ValidationRules` interfaces, the `MessageProcessing` depends only on the factory. This may not sound as a very attractive tradeoff (taking away two dependencies and introducing one), but note that whenever the `MessageFactory` needs another dependency that is like the existing two, the factory is all that will need to change. The `MessageProcessing` will remain untouched and still coupled only to the factory.
The last thing that needs to be said is that not all dependencies can be hidden inside a factory. Note that the factory still needs to receive the `MessageData` from whoever is asking for a `Message`, because the `MessageData` is not available when the factory is created. You may remember that I call such dependencies a **local context** (because it is specific to a single use of a factory). On the other hand, what a factory accepts through its constructor can be called a **global context** (because it is the same throughout the factory lifetime). Using this terminology, the local context cannot be hidden from users of the factory, but the global context can. Thanks to this, the classes using the factory do not need to know about the global context and can stay cleaner, coupled to less things and more focused.
#### Factories help eliminate redundancy
Redundancy in code means that at least two things need to change for the same reason in the same way[^essentialskills]. Usually it is understood as code duplication, but actually, "conceptual duplication" is a better term. For example, the following two methods are not redundant, even though the code seems duplicated (by the way, the following is not an example of good code, just a simple illustration):
```csharp
public int MetersToCentimeters(int value)
{
return value*100;
}
public int DollarsToCents(int value)
{
return value*100;
}
```
As I said, this is not redundancy, because the two methods represent different concepts that would change for different reasons. Even if we were to extract "common logic" from the two methods, the only sensible name we could come up with would be something like `MultiplyBy100()` which wouldn't add any value at all.
Note that up to now, we considered three things factories encapsulate about creation of objects:
1. Type
2. Rule
3. Global context
Thus, if factories didn't exist, all these concepts would leak to sorrounding classes (we saw an example when we were talking about encapsulation of global context). Now, as soon as there is more than one class that needs to create instances, these things leak to all of these classes, creating redundancy. In such case, any change to how instances are created would mean a change to all classes needing those instances.
Thankfully, by having a factory -- an object that takes care of creating other objects and nothing else, we can reuse the ruleset, the global context and the type-related decisions across many classes without any unnecessary overhead. All we need to do is reference the factory and ask it for an object.
There are more benefits to factories, but I hope I already convinced you that this is a pretty darn beneficial concept for such a reasonably low cost.
Summary
-------------------------
In this chapter, I tried to show you a variety of ways of composing objects together. Do not worry if you feel overwhelmed, for the most part, just remember to follow the principle of separating use from construction and you will be fine.
The rules outlined here apply to the overwhelming part of the objects in our application. Wait, did I say overwhelming? Not all? So there are exceptions? Yes, there are and we'll talk about them shortly, but first, we need to further examine the influence composability has on our object-oriented design approach.
[^kolskybain]: I got this saying from Amir Kolsky and Scott Bain
[^implementationpatterns]: Kent Beck, Implementation Patterns
[^gofcreationpatterns]: While factory is the most often used, other creational patterns such as builder also fall into this category. Other than this, we may have caches, that usually hold ready to use objects and yields them when requested.
[^encapsulatewhatvaries]: Note that this is an application of Gang of Four guideline: "encapsulate what varies".
[^seemanndi]: For details, check Dependency Injection in .NET by Mark Seemann.
[^essentialskills]: A. Shalloway et al., Essential Skills For The Agile Developer
[^messageotherchangecase]: although it does need to change when the rule "first validate, then apply to sessions" changes
| 46.23814 | 821 | 0.753611 | eng_Latn | 0.999208 |
b080da8dd4501e60fae02eb25963d91d01bdda5d | 1,079 | md | Markdown | README.md | gkouros/nh_dwa_local_planner | fdd602434b8864a68349ca59c03741599a28be1e | [
"BSD-3-Clause"
] | 4 | 2021-05-24T16:40:33.000Z | 2022-01-08T07:50:03.000Z | README.md | gkouros/nh_dwa_local_planner | fdd602434b8864a68349ca59c03741599a28be1e | [
"BSD-3-Clause"
] | null | null | null | README.md | gkouros/nh_dwa_local_planner | fdd602434b8864a68349ca59c03741599a28be1e | [
"BSD-3-Clause"
] | 3 | 2021-06-22T07:34:01.000Z | 2022-01-05T05:54:58.000Z | # nh_dwa_local_planner
Contains a modified [Dynamic Window Approach(DWA) local planner](http://wiki.ros.org/dwa_local_planner)
for car like and 4WS robots. For best results, combine it with the sbpl_lattice_planner global planner.
<br/>
#### Modifications:
Two new cost functions were added:
- **fws_cost_function** allows only nonholonomic trajectories with bounded steering
angle for car like robots, as well as parallel motions(crab steering) for 4WS robots,
if selected. The cost function uses two new parameters:
1. *r_min*: minimum turning radius (>0 for car like and 4WS robots)
2. *b_max*: maximum sideslip angle (>0 for 4WS robots)
- **goal_orientation_cost_function** is enabled close to the final goal and its
purpose is to reward the trajectories that achieve the lowest orientation error,
and at the same time the lowest distance from the final goal.
This cost function uses two new parameters:
1. *orientation_scale*: scales the cost of orientation error
2. *distance_scale*: scales the cost of distance from the final goal error
| 51.380952 | 105 | 0.767377 | eng_Latn | 0.991473 |
b082a1635cdc9f6eb57b46314bcac9a606fa361c | 73 | md | Markdown | CHANGELOG.md | geoffreybauduin/wp-related-posts | c3d1910169aa48898c1f68c2027f610bca04069e | [
"MIT"
] | null | null | null | CHANGELOG.md | geoffreybauduin/wp-related-posts | c3d1910169aa48898c1f68c2027f610bca04069e | [
"MIT"
] | null | null | null | CHANGELOG.md | geoffreybauduin/wp-related-posts | c3d1910169aa48898c1f68c2027f610bca04069e | [
"MIT"
] | null | null | null | # v1.1
## Bug fixes
**page display**: don't include non published pages | 14.6 | 51 | 0.684932 | eng_Latn | 0.993175 |
b0842c87f4120ee3859a90de86edbe08c48c049f | 175 | md | Markdown | resources/kcd/constants/moment-docs.md | kentcdodds/kcd-angular | dbcb75b4233cb94f3d41d766b989c9105d7afa45 | [
"MIT"
] | 26 | 2015-01-30T21:57:38.000Z | 2021-02-17T00:04:54.000Z | resources/kcd/constants/moment-docs.md | kentcdodds/kcd-angular | dbcb75b4233cb94f3d41d766b989c9105d7afa45 | [
"MIT"
] | 7 | 2015-06-19T13:32:38.000Z | 2016-09-16T13:44:20.000Z | resources/kcd/constants/moment-docs.md | kentcdodds/kcd-angular | dbcb75b4233cb94f3d41d766b989c9105d7afa45 | [
"MIT"
] | 8 | 2015-05-18T03:11:57.000Z | 2018-08-22T22:57:45.000Z | Moment is library that makes the `Date` object what I wish it was. If you're not using moment for all of your date
needs, I suggest you look into it. Moment is fully featured. | 87.5 | 114 | 0.771429 | eng_Latn | 0.999971 |
b0843066c5e9f9cb5f8dbf0a64819fded723f5b6 | 1,666 | md | Markdown | Documentation/Guides/Edge-Modules/EDGE-MODULE-HARD-RELOAD-CACHE-BYPASS.md | paliarush/fastly-magento2 | 655f4ec430c6b9f99045c62e47dab7cb64e1fc71 | [
"BSD-3-Clause"
] | 112 | 2016-06-22T16:15:47.000Z | 2022-02-23T08:41:04.000Z | Documentation/Guides/Edge-Modules/EDGE-MODULE-HARD-RELOAD-CACHE-BYPASS.md | paliarush/fastly-magento2 | 655f4ec430c6b9f99045c62e47dab7cb64e1fc71 | [
"BSD-3-Clause"
] | 190 | 2016-05-12T16:47:34.000Z | 2022-03-24T13:09:57.000Z | Documentation/Guides/Edge-Modules/EDGE-MODULE-HARD-RELOAD-CACHE-BYPASS.md | paliarush/fastly-magento2 | 655f4ec430c6b9f99045c62e47dab7cb64e1fc71 | [
"BSD-3-Clause"
] | 108 | 2016-06-28T15:18:19.000Z | 2022-03-23T08:04:01.000Z | # Fastly Edge Modules - Hard Reload Cache Bypass for admins
This guide will show how to configure hard reload cache bypass for admin IPs. This feature allows
administrators to force a cache miss in their browser by pressing CMD/CTRL + SHIFT + R or SHIFT + F5.
Administrators are defined as those users on the selected Access Control List (ACL).
[More details can be found here](https://github.com/fastly/fastly-magento2/issues/147)
Before you can use Fastly Edge Modules you need to [make sure they are enabled](https://github.com/fastly/fastly-magento2/blob/master/Documentation/Guides/Edge-Modules/EDGE-MODULES.md)
When you click on the configuration you will be prompted with a screen like this
## Configurable options
### ACL
Pick ACL (Access Control List) that contains a list of admin IPs. If there are no ACLs listed or you want to specify a new
one [you can create it using the ACL interface](https://github.com/fastly/fastly-magento2/blob/master/Documentation/Guides/ACL.md).
## Enabling
After any change to the settings you need to click Upload as that will activate the functionality you configured.
## Technical details
Following VCL snippets are being uploaded
Snippet Type: vcl_recv
```vcl
if ( req.http.Fastly-Client-IP ~ maint_allowlist && req.http.pragma ~ "no-cache" ) {
set req.hash_always_miss = true;
}
```
Snippet Type: vcl_hash
```vcl
if ( req.http.Fastly-Client-IP ~ maint_allowlist && req.http.pragma ~ "no-cache" ) {
set req.hash += "NOCACHE";
}
```
| 37.022222 | 184 | 0.760504 | eng_Latn | 0.934253 |
b0857f1de1e228e4af4db2aaeaec3c13615206b0 | 7,279 | md | Markdown | _posts/2015-02-11-what-the-hell-is-a-wine-club-p1.md | BrainstormWilly/yno-guy | 34a98333e1f2db32531265e2ec735ab4f1746bff | [
"MIT"
] | null | null | null | _posts/2015-02-11-what-the-hell-is-a-wine-club-p1.md | BrainstormWilly/yno-guy | 34a98333e1f2db32531265e2ec735ab4f1746bff | [
"MIT"
] | 6 | 2020-02-25T04:50:20.000Z | 2021-11-10T02:17:20.000Z | _posts/2015-02-11-what-the-hell-is-a-wine-club-p1.md | BrainstormWilly/BrainstormWilly.github.io | 34a98333e1f2db32531265e2ec735ab4f1746bff | [
"MIT"
] | null | null | null | ---
title: "What the Hell is a Wine Club? Part 1."
date: 2015-2-11 09:00:00
categories: [Wine]
excerpt: For over 3 years I worked in wine hospitality selling wine clubs. More often than not I found myself trying to explain to consumers why they even exist and, more importantly, why anyone should join one. In this 3 part series I will try to revisit those conversations.
tags: [wineclub]
comments: true
---
In this post series I want to address what I think is a very misunderstood concept–Wine Clubs. My thoughts on this were confirmed by an article I read some time ago from Wall Street Journal’s wine columnist Lettie Teague called [Do Wine Clubs Really Deliver on Their Promises?](https://www.wsj.com/articles/do-wine-clubs-really-deliver-on-their-promises-1422646193) Now to be clear, I’m not questioning Ms. Teague’s credentials as a columnist, but with regards to this topic I think she’s missing the point. In her article she joins three clubs, none of which are direct from wineries. There is a key distinction here. All of the wines she was receiving were delivered through distribution, meaning even though she may never have heard of them, these wines are available to the public through one means or another. This is a very different kind of club vs. what most wineries offer.
However, explaining what wine clubs are, their differences, why they exist, and what the benefits are for consumers and sellers alike will take more than a single post. The answers are complicated and the genesis for their existence dates back to the end of prohibition. So, I’ll begin by illustrating what a wine club is and its history.
## So, What is a Wine Club?
In brief, a wine club is a loyalty program. It usually consists of a commitment to purchase a quantity of wine over a period of time at pre-determined intervals. Commitments are usually defined as shipments. The amount of wine per shipment can vary from a couple bottles to 12 or more. After the minimum commitment is met (usually a year’s worth of shipments) you can choose to cancel or allow it to continue indefinitely. In most clubs, the seller chooses the wines, but some are now allowing the consumer to choose from a list. Once you choose a club, wines are shipped direct to your home or business and you are billed per shipment. There is usually a minimum commitment of year, after which you can cancel anytime. Simple, no? No, definitely not. Wine clubs were traditionally sold by wineries, but are now being sold through wine shops, online retailers, and yes, even the [Wall Street Journal](https://www.wsjwine.com/).
## Winery Wine Clubs
Wineries were the first to sell wine clubs. In fact, until 2004 wineries were the only entities that could sell wine direct-to-consumers (aka DTC). It is generally accepted the first wine club was actually the [Automatic Tasting Program (ATP)](https://www.ridgewine.com/atp40/) introduced by Ridge Winery in 1977.
{% include image_with_caption.html image="ATP40Logo.jpg" alt="Ridge Vineyards ATP" caption="Ridge Winery’s “Automatic Tasting Program” is considered by most the first wine club." %}
I was a teenager growing up near their winery in Saratoga, CA when my dad joined the program. Back then it wasn’t a “shipping” as much a “sampling” program where local customers would journey to the winery to get their new releases to take home, try and enjoy. The winery would then offer the same wines at a discount so that members could immediately purchase their favorites. My dad and his buddies eagerly awaited each release to the point where the “journey” to Ridge became more a celebrated pilgrimage. Their excitement was around the differences each vineyard, varietal, and vintage would bring. This excitement is why many people join winery wine clubs to this day.
However, it took years before wineries could actually ship club wines to consumers in other states. The vagaries of the 21st amendment and dreaded 3-Tier System have slowed progress in DTC sales. I will discuss more on this in a later chapter. Today, virtually every winery has some form of DTC program. One of my favorite local wineries ([Dry Creek Vineyard](http://drycreekvineyard.com)) has a club program with options ranging from $250-$650 per year. Incentives include 20-25% off wine as well as discount shipping and special events/perks at the winery itself like free tours and tastings. As I alluded earlier, what’s important to note about winery clubs is they concentrate on selling wines DTC they don’t sell via distribution. The consumer is getting access to unique, small production wines they can not get any other way. Sometimes this is confused as a “holding back” tactic on the winery's part to drive up price and exclusivity. I will discuss why this isn’t true in a later post as well.
## Retail and Internet Wine Clubs
{% include tasting_room_image.html %}
In 2004 the Supreme Court forbid wine export states from disallowing wine imported from other states. This opened the door for not only more wineries to sell across state lines, but retailers as well–especially over the internet. Online wine retailers, clubs, and “flash” sites have been popping up ever since. Wineries themselves opened their own DTC websites. Overall, it has been a positive development for the wine industry. However, unlike winery clubs, the retail club value proposition is very different. Club W, now called the [Tasting Room](https://www.tastingroom.com) and mentioned in Ms. Teague’s article, feels a bit more like a dating site than a wine retailer. Club managers are purchasing wine available on the open market from wholesalers they perceive as offering wines that are unique, of good value, and match their customers tastes. That’s a far cry from what a winery club offers. With some exceptions there are a lot of middlemen taking a cut of these wines; importers, distributors, wholesalers, even other retailers. Retail clubs are a great way to discover wine as whole. However, because they are selling wines that are available on the open market, they tend to lean on marketing gimmicks like tailoring wine to your palette (which, by the way is constantly changing), price target, expert choice, etc.. I appreciate what they're doing, but I don't think it's anything like a winery club.
## Why Sell Wine this Way?
What’s the deal? Why not just sell all wine in stores or over the internet like everything else? I’m both a wine club salesman and member. I’ll be the first to say it’s a wacky way to sell wine. On the surface it can even seem disingenuous. Despite this, DTC sales are increasing much faster than retail. Most industry experts still dismiss DTC as a minor part of the market (<5% overall), but for smaller wineries it is an essential–if not only part of their sales strategy.
So, how can a subscription based service that requires the consumer to;
* commit to an annual minimum purchase
* be home to sign for delivery
* and, not even be sure of what they’re getting
be so successful? As they say, the Devil is in the details. In this case, I’m afraid there are more Devils than details. In my next post I’ll discuss why the compromise to end Prohibition has a lot to do with how wine clubs came to be, and why they are becoming more popular so many years later.
| 165.431818 | 1,416 | 0.78857 | eng_Latn | 0.999922 |
b0863b9964b67c6c69c14c1d7bec21a826977057 | 286 | md | Markdown | README.md | vandosant/practical-deep-learning | 0ec66aaf848b1025ade0e329ba29f55324251c7e | [
"MIT"
] | null | null | null | README.md | vandosant/practical-deep-learning | 0ec66aaf848b1025ade0e329ba29f55324251c7e | [
"MIT"
] | null | null | null | README.md | vandosant/practical-deep-learning | 0ec66aaf848b1025ade0e329ba29f55324251c7e | [
"MIT"
] | null | null | null | # practical-deep-learning
via http://course.fast.ai/
## prereqs
- anaconda https://www.continuum.io/downloads
- aws account https://console.aws.amazon.com
## setup
- walkthrough https://www.youtube.com/watch?v=8rjRfW4JM2I
- aws setup script: http://www.platform.ai/files/ setup_p2.sh
| 26 | 61 | 0.748252 | yue_Hant | 0.506599 |
b087bfd175d3a68f17b612f348a4a5ad635799ca | 2,228 | md | Markdown | docs/README.md | freeslugs/super-graph | aa9a4e3dc4fc38f744df959b43dc0d1f00f984a5 | [
"MIT"
] | null | null | null | docs/README.md | freeslugs/super-graph | aa9a4e3dc4fc38f744df959b43dc0d1f00f984a5 | [
"MIT"
] | null | null | null | docs/README.md | freeslugs/super-graph | aa9a4e3dc4fc38f744df959b43dc0d1f00f984a5 | [
"MIT"
] | null | null | null | ---
layout: HomeLayout
home: true
heroText: "SUPER GRAPH"
heroImage: /super-graph-web-ui-half.png
heroImageMobile: /super-graph-web-ui.png
tagline: An instant high-performance GraphQL API. No code needed.
actionText: Get Started →
actionLink: /guide
features:
- title: Simple
details: Easy config file, quick to deploy, No code needed. It just works.
- title: High Performance
details: Compiles your GraphQL into a fast SQL query in realtime.
- title: Ruby-on-Rails
details: Can read Rails cookies and supports rails database conventions.
- title: Serverless
details: Designed for App Engine, Kubernetes, CloudRun, Horeku, AWS Fargate, etc
- title: Fast and Secure
details: Go is a language created at Google to build secure and fast web services.
- title: Free and Open Source
details: Not a VC funded startup. Not even a startup just good old open source code
footer: MIT Licensed | Copyright © 2018-present Vikram Rangnekar
---
## Try out GraphQL
```graphql
query {
users {
id
email
picture : avatar
products(limit: 2, where: { price: { gt: 10 } }) {
id
name
description
}
}
}
```
## Why I built Super Graph?
Honestly, cause it was more fun than my real work. After working on several product though my career I found myself hating building CRUD APIs (Create, Update, Delete, List, Show). It was always the same thing figure out what the UI needs then build an endpoint for it, if related data is needed than join with another table. I didn't want to write that code anymore I wanted the computer to just do it.
I always liked GraphQL it sounded friendly, but it still required me to write all the same database query code. Sure the API was nicer but it took a lot of work sometime even more than a simple REST API would have. I wanted a GraphQL server that just worked the second you deployed it without having to write a line of code.
And so after a lot of coffee and some Avocado toasts __Super Graph was born, a GraphQL server that just works, is high performance and easy to deploy__. I hope you find it as useful as I do and there's a lot more coming so hit that :star: to stay in the loop.
## Say hello
[twitter.com/dosco](https://twitter.com/dosco)
| 39.087719 | 402 | 0.74237 | eng_Latn | 0.997164 |
b089e515139aa26ef7f18f3f0ad0161c45b3d49d | 1,357 | md | Markdown | kaggle-competition/README.md | cstorm125/wisesight-sentiment | 1bd44be874140a446e5ae52aa84606318b9c8c8b | [
"CC0-1.0"
] | 66 | 2019-02-19T11:47:03.000Z | 2022-03-08T05:23:38.000Z | kaggle-competition/README.md | cstorm125/wisesight-sentiment | 1bd44be874140a446e5ae52aa84606318b9c8c8b | [
"CC0-1.0"
] | 4 | 2019-03-01T04:02:58.000Z | 2020-12-01T02:37:04.000Z | kaggle-competition/README.md | cstorm125/wisesight-sentiment | 1bd44be874140a446e5ae52aa84606318b9c8c8b | [
"CC0-1.0"
] | 28 | 2019-03-14T15:18:02.000Z | 2022-03-23T14:53:48.000Z | ***NOTES: The most recent tutorial is being updated at https://github.com/PyThaiNLP/tutorials***
----
This directory contains data files in Kaggle competition format and Jupyter notebook (Python) for training, prediction, and evaluation.
## Classification Benchmark
PyThaiNLP uses Wisesight Sentiment dataset as part of its [text classification benchmark](https://github.com/PyThaiNLP/classification-benchmarks). We use the same performance metric as [Wisesight Sentiment Analysis](https://www.kaggle.com/c/wisesight-sentiment/) competition, which is **accuracy**.
**Disclaimer** Note that the labels are obtained manually and are prone to errors so if you are planning to apply the models in the benchmark for real-world applications, be sure to benchmark it with **your own dataset**.
| Model | Public Accuracy | Private Accuracy |
|---------------------|-----------------|------------------|
| Logistic Regression | 0.72781 | 0.7499 |
| FastText | 0.63144 | 0.6131 |
| ULMFit | 0.71259 | 0.74194 |
| ULMFit Semi-supervised | 0.73119 | 0.75859 |
| ULMFit Semi-supervised Repeated One Time | **0.73372** | **0.75968** |
See classification code in `competition.ipynb`.
`text_generation.ipynb` is used to generate extra training data.
| 56.541667 | 298 | 0.661017 | eng_Latn | 0.956315 |
b08bd19b7e34daaa065a2fef8e0110c48e689774 | 743 | md | Markdown | docs/error-messages/compiler-errors-1/fatal-error-c1201.md | svick/cpp-docs | 76fd30ff3e0352e2206460503b61f45897e60e4f | [
"CC-BY-4.0",
"MIT"
] | 1 | 2021-04-18T12:54:41.000Z | 2021-04-18T12:54:41.000Z | docs/error-messages/compiler-errors-1/fatal-error-c1201.md | Mikejo5000/cpp-docs | 4b2c3b0c720aef42bce7e1e5566723b0fec5ec7f | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/error-messages/compiler-errors-1/fatal-error-c1201.md | Mikejo5000/cpp-docs | 4b2c3b0c720aef42bce7e1e5566723b0fec5ec7f | [
"CC-BY-4.0",
"MIT"
] | 2 | 2018-10-10T07:37:30.000Z | 2019-06-21T15:18:07.000Z | ---
title: "Fatal Error C1201 | Microsoft Docs"
ms.custom: ""
ms.date: "11/04/2016"
ms.technology: ["cpp-diagnostics"]
ms.topic: "error-reference"
f1_keywords: ["C1201"]
dev_langs: ["C++"]
helpviewer_keywords: ["C1201"]
ms.assetid: e58b9b9a-2c6f-454d-8719-9773aca765d1
author: "corob-msft"
ms.author: "corob"
ms.workload: ["cplusplus"]
---
# Fatal Error C1201
unable to continue after syntax error in class template definition
An unexpected error occurred while parsing a class template definition.
Fix any other errors and recompile. If that fails, note the circumstances of the error, try to isolate the problem and create a reproducible test case, then contact [Microsoft Product Support Services](/visualstudio/ide/talk-to-us). | 37.15 | 233 | 0.753701 | eng_Latn | 0.839587 |
b08c9f2ccb136695c67c72389b8835a0236fdce1 | 1,102 | md | Markdown | add/metadata/System.Activities/ActivityFunc`8.meta.md | MarktW86/dotnet.docs | 178451aeae4e2c324aadd427ed6bf6850e483900 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | add/metadata/System.Activities/ActivityFunc`8.meta.md | MarktW86/dotnet.docs | 178451aeae4e2c324aadd427ed6bf6850e483900 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | add/metadata/System.Activities/ActivityFunc`8.meta.md | MarktW86/dotnet.docs | 178451aeae4e2c324aadd427ed6bf6850e483900 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
uid: System.Activities.ActivityFunc`8
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument4
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Result
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument7
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.#ctor
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument5
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument6
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument3
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument1
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
---
uid: System.Activities.ActivityFunc`8.Argument2
author: "Erikre"
ms.author: "erikre"
manager: "erikre"
---
| 15.742857 | 47 | 0.710526 | slk_Latn | 0.090033 |
b08d35292d17dc8cfe203254ad4d069d1d5bb35a | 315 | md | Markdown | todo.md | eduuh/vachuo-blog | ee75556a0f6aae0d2ffd3b3165683ab266c69f23 | [
"MIT"
] | null | null | null | todo.md | eduuh/vachuo-blog | ee75556a0f6aae0d2ffd3b3165683ab266c69f23 | [
"MIT"
] | 9 | 2022-01-26T18:52:26.000Z | 2022-03-13T16:58:20.000Z | todo.md | eduuh/vachuo-blog | ee75556a0f6aae0d2ffd3b3165683ab266c69f23 | [
"MIT"
] | null | null | null | 1. Post on HTTPS
2. reference type and value types
3. Post on git worktree workflow
4. Basic dotnet core api.--- not ready
5. dependency injection --- ready
6. Dependency Injection Lifetime: Transient, Singleton & Scoped
https://www.tektutorialshub.com/asp-net-core/asp-net-core-dependency-injection-lifetime/
| 31.5 | 91 | 0.768254 | eng_Latn | 0.75559 |
b08e208371a90cad9f726fcd09f359d4163cc32c | 3,336 | md | Markdown | ReadMe.md | danijeljw/New-NuGetPackage | 566127ce6fc2dacedff52e85dad109497a62fba3 | [
"MIT"
] | 21 | 2018-01-18T13:27:09.000Z | 2021-11-07T20:41:01.000Z | ReadMe.md | danijeljw/New-NuGetPackage | 566127ce6fc2dacedff52e85dad109497a62fba3 | [
"MIT"
] | 18 | 2017-08-04T15:51:59.000Z | 2021-04-09T16:10:04.000Z | ReadMe.md | danijeljw/New-NuGetPackage | 566127ce6fc2dacedff52e85dad109497a62fba3 | [
"MIT"
] | 16 | 2017-09-28T11:46:55.000Z | 2021-04-20T09:29:11.000Z | # New-NuGetPackage PowerShell Script Description
[New-NuGetPackage.ps1][New-NuGetPackageFileUrl] is a PowerShell script to make creating and publishing NuGet packages quick and easy, using a .nuspec or project file, from Explorer or PS.
This script is also used by a NuGet Package that you can use to [automate making your project's NuGet packages in Visual Studio](docs/NuGetPackageToCreateANuGetPackageFromYourProjectAfterEveryBuild.md).
__This script depends on [nuget.exe][NuGetExeReleasesUrl]__, and it is recommended that you [add nuget to your PATH](docs/AddNuGetExeToYourPath.md).
## Features
* The script uses nuget.exe to pack a .nuspec or project file (.csproj, .vbproj, .fsproj) and optionally push it to a NuGet gallery.
* Can be ran from PowerShell or directly from Windows Explorer (e.g. double-click it, or right-click -> Run with PowerShell).
* If no parameters are provided the user will be prompted for:
* the .nuspec or project file to pack, or package to push (if one can't be found automatically)
* the version number and release notes to use for the package (if a .nuspec file is used)
* whether the package should be pushed to a NuGet gallery or not.
* Parameters may be provided to supply these values and/or suppress the prompts, so it can be integrated into your build system.
The script provides parameters for the Pack and Push Options, which will be passed as-is to nuget.exe, allowing for all of the same functionality as calling nuget.exe directly yourself.
## Getting Started Quickly
Here are a couple examples of how to run the script from PowerShell to have the GUI prompt you for the required parameters:
```PowerShell
& .\New-NuGetPackage.ps1 # Can use relative path when in same directory as the script.
& "C:\Some Folder\New-NuGetPackage.ps1" # Use absolute path to run script from anywhere.
```
Below are some examples of calling the script with parameters to avoid the GUI prompts. For more information on the script and its parameters, [check out the documentation](docs/HowToUseTheNewNuGetPackagePowerShellScript.md).
```PowerShell
& ".\New-NuGetPackage.ps1" -NuSpecFilePath ".\Some Folder\SomeNuSpecFile.nuspec"
```
```PowerShell
& .\New-NuGetPackage.ps1 -ProjectFilePath "C:\Some Folder\TestProject.csproj" -VersionNumber "1.1" -ReleaseNotes "Version 1.1 contains many bug fixes."
```
```PowerShell
& .\New-NuGetPackage.ps1 -ProjectFilePath "C:\Some Folder\TestProject.csproj" -PackOptions "-Build -OutputDirectory ""C:\Output""" -UsePowerShellPrompts
```
```PowerShell
& .\New-NuGetPackage.ps1 -NuSpecFilePath "C:\Some Folder\SomeNuSpecFile.nuspec" -NoPrompt
```
```PowerShell
& .\New-NuGetPackage.ps1 -NuSpecFilePath ".\Some Folder\SomeNuSpecFile.nuspec" -VersionNumber "9.9.9.9" -DoNotUpdateNuSpecFile
```
```PowerShell
& .\New-NuGetPackage.ps1 -PushPackageToNuGetGallery -PushOptions "-Source ""http://my.server.com/MyNuGetGallery"" -ApiKey ""EAE1E980-5ECB-4453-9623-F0A0250E3A57"""
```
```PowerShell
& .\New-NuGetPackage.ps1 -NuGetExecutableFilePath "C:\Utils\NuGet.exe"
```
```PowerShell
& .\New-NuGetPackage.ps1 -PackageFilePath "C:\Some Folder\MyPackage.nupkg"
```
<!-- Links -->
[NuGetExeReleasesUrl]: https://github.com/NuGet/Home/releases
[New-NuGetPackageFileUrl]: https://github.com/deadlydog/New-NuGetPackage/blob/master/src/New-NuGetPackage.ps1 | 49.058824 | 225 | 0.770384 | eng_Latn | 0.714804 |
b09024de3d2b1a47c7478fffc2c396098e60bce2 | 6,099 | md | Markdown | README.md | danelowe/sonar-intellij-plugin | 66ba7a031134e967e39cd9548ea998cfaa66ac16 | [
"Apache-2.0"
] | 247 | 2015-01-20T21:51:31.000Z | 2022-03-17T09:25:06.000Z | README.md | danelowe/sonar-intellij-plugin | 66ba7a031134e967e39cd9548ea998cfaa66ac16 | [
"Apache-2.0"
] | 183 | 2015-01-08T22:48:48.000Z | 2022-03-10T22:35:21.000Z | README.md | danelowe/sonar-intellij-plugin | 66ba7a031134e967e39cd9548ea998cfaa66ac16 | [
"Apache-2.0"
] | 85 | 2015-01-13T22:16:31.000Z | 2022-03-06T18:16:06.000Z | [](https://travis-ci.org/sonar-intellij-plugin/sonar-intellij-plugin)
[](https://sonarcloud.io/dashboard?id=sonar-intellij-plugin)
[](https://sonarcloud.io/component_measures?id=sonar-intellij-plugin&metric=code_smells)
[](https://sonarcloud.io/component_measures?id=sonar-intellij-plugin&metric=sqale_index)
[](https://sonarcloud.io/component_measures?id=sonar-intellij-plugin&metric=bugs)
[](https://sonarcloud.io/component_measures?id=sonar-intellij-plugin&metric=coverage)
SonarQube IntelliJ Community Plugin
===================================
The main goal of this plugin is to show [SonarQube](http://sonarqube.org) issues directly within your IntelliJ IDE.
Currently the plugin is build to work in IntelliJ IDEA, RubyMine, WebStorm, PhpStorm, PyCharm, AppCode and Android Studio with any programming language you can analyze in SonarQube.
Two tasks are covered by the plugin:
* downloading issues of previously analyzed code from a Sonar server and show them in your IDE
* running a script to perform a local analysis to find issues in your local code
We appreciate constructive feedback and contributions of any kind, so please report any issues with the plugin by [filing a new issue](https://github.com/sonar-intellij-plugin/sonar-intellij-plugin/issues/new), get in touch via our [Google Groups mailing list](https://groups.google.com/forum/#!forum/sonarqube-intellij-plugin) or send a pull request whenever you feel things could be done in a better way. We are really grateful for your support.
## Usage
### Project Configuration
You can install the "SonarQube Community Plugin" via the plugin manager inside your Jetbrains IDE or download it from the [Jetbrains Plugin Repository](http://plugins.jetbrains.com/plugin/7238). After the installation, you first of all need to configure the connection to your Sonar server. This is done per project and/ or module. You can use a remote server or a local one on your machine.
In your IDE go to `File -> Settings -> Other Settings -> SonarQube`.
Click Add, enter the address of your Sonar server and the credentials (if needed) and click `OK` (if you use Sonarcloud.io as Sonar server then you need to enter value for Organization).
Back on the previous screen, find the `Sonar resources` section and click the `+` button to select the Sonar resource for this project:
Your final SonarQube Server configuration should now look like the following:
### Code inspection
The plugin provides two inspections:
* SonarQube - shows already analysed issues
* SonarQube (new issues) - shows only new issues from local analysis
To perform a code inspection you can:
Go to `Analyze -> Inspect code`.
Select whole project. It is recommended that you create a Sonar Inspection profile, with Sonar inspections only, but you can also use the default profile or any other self defined inspection profile.
After the execution the inspection result should look like:
As the Sonar analysis process is prone to errors, it is essential to see what happened during the analysis. You can use the Sonar console for error analysis, especially during initial configuration:
### Local analysis configuration
After configuring the Sonar server you are ready to start downloading issues and showing them in the IDEA. But as soon you start editing your source code, you might want to trigger a [local sonar analysis](./doc/local_analysis.md).
> **NOTE** Local analysis is _NOT_ available for SonarQube versions 7.9.1 or _later_. See [#231](https://github.com/sonar-intellij-plugin/sonar-intellij-plugin/issues/231)
## Develop
Hacking the plugin is very easy, just follow the following steps
### Prerequisites
- install IntelliJ (Community Edition is ok)
- install Gradle (http://gradle.org/)
- configure Plugin SDK (https://www.jetbrains.com/idea/help/configuring-intellij-platform-plugin-sdk.html)
### Starting
- open a terminal
- clone the repository
- `git clone https://github.com/sonar-intellij-plugin/sonar-intellij-plugin.git`
- create an IntelliJ project which can be imported to IntelliJ
- `cd sonar-intellij-plugin`
- `gradle gradle idea`
- open project in IntelliJ
- File->Open-> (Directory sonar-intellij-plugin)
- run the plugin inside intellij
- run gradleTask runIde
## License
The project is licensed under Apache Public License 2.0! See the [LICENSE](LICENSE) file for details.
## Love it!
Via <a href="https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=5ZG69XAD2JMVS" target="_blank">PayPal</a>. Thanks! (-8
| 62.234694 | 447 | 0.784555 | eng_Latn | 0.785422 |
b0908b9d819b6758d05d0add52b4d016dce6aaa2 | 4,258 | md | Markdown | docs/visual-basic/programming-guide/language-features/control-flow/nested-control-structures.md | adamsitnik/docs.cs-cz | 7c534ad2e48aa0772412dc0ecf04945c08fa4211 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/visual-basic/programming-guide/language-features/control-flow/nested-control-structures.md | adamsitnik/docs.cs-cz | 7c534ad2e48aa0772412dc0ecf04945c08fa4211 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/visual-basic/programming-guide/language-features/control-flow/nested-control-structures.md | adamsitnik/docs.cs-cz | 7c534ad2e48aa0772412dc0ecf04945c08fa4211 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Vnořené řídicí struktury (Visual Basic)
ms.date: 07/20/2015
helpviewer_keywords:
- Visual Basic code, control flow
- control structures [Visual Basic], nested
- conditional statements [Visual Basic], nested
- statements [Visual Basic], control flow
- control flow [Visual Basic], nested control statements
- structures [Visual Basic], nested control
- nested control statements [Visual Basic]
ms.assetid: cf60b061-65d9-44a8-81f2-b0bdccd23a05
ms.openlocfilehash: f559bf603605873f1b9155e9a96cb367e5420343
ms.sourcegitcommit: 68653db98c5ea7744fd438710248935f70020dfb
ms.translationtype: MT
ms.contentlocale: cs-CZ
ms.lasthandoff: 08/22/2019
ms.locfileid: "69941677"
---
# <a name="nested-control-structures-visual-basic"></a>Vnořené řídicí struktury (Visual Basic)
Řídicí příkazy lze umístit do jiných řídicích příkazů, například `If...Then...Else` bloku `For...Next` v rámci smyčky. Řídicí příkaz umístěný uvnitř jiného kontrolního příkazu je označován jako *vnořený*.
## <a name="nesting-levels"></a>Vnořování úrovní
Řídicí struktury v Visual Basic můžou být vnořené do tolika úrovní, kolik chcete. Je běžné, že vnořené struktury budou čitelnější, když odsadíte tělo každé z nich. To dělá Editor integrovaného vývojového prostředí (IDE) automaticky.
V následujícím příkladu postup `sumRows` přidá do sebe kladné prvky každého řádku matice.
```vb
Public Sub sumRows(ByVal a(,) As Double, ByRef r() As Double)
Dim i, j As Integer
For i = 0 To UBound(a, 1)
r(i) = 0
For j = 0 To UBound(a, 2)
If a(i, j) > 0 Then
r(i) = r(i) + a(i, j)
End If
Next j
Next i
End Sub
```
`Next` V předchozím příkladu první příkaz zavře vnitřní `For` smyčku a poslední `Next` příkaz zavře vnější `For` smyčku.
Stejně tak ve vnořených `If` příkazech `End If` se příkazy automaticky použijí na nejbližší předchozí `If` příkaz. Vnořené `Do` smyčky fungují podobným způsobem, přičemž vnitřní `Loop` příkaz odpovídá nejvnitřnějšímu `Do` příkazu.
> [!NOTE]
> U mnoha řídicích struktur se při kliknutí na klíčové slovo zvýrazní všechna klíčová slova ve struktuře. `If` Například při kliknutí `If...Then...Else` na `Then` `ElseIf` `End If` konstrukci jsou zvýrazněny všechny`Else`instance,,, a v konstrukci. `If` Chcete-li přejít na další nebo předchozí zvýrazněné klíčové slovo, stiskněte klávesy CTRL + SHIFT + šipka dolů nebo CTRL + SHIFT + šipka nahoru.
## <a name="nesting-different-kinds-of-control-structures"></a>Vnořování různých druhů řídicích struktur
Jeden druh struktury ovládacího prvku můžete vnořit do jiného typu. Následující příklad používá `With` blok `For Each` uvnitř `If` smyčky`With` a vnořené bloky uvnitř bloku.
```vb
For Each ctl As System.Windows.Forms.Control In Me.Controls
With ctl
.BackColor = System.Drawing.Color.Yellow
.ForeColor = System.Drawing.Color.Black
If .CanFocus Then
.Text = "Colors changed"
If Not .Focus() Then
' Insert code to process failed focus.
End If
End If
End With
Next ctl
```
## <a name="overlapping-control-structures"></a>Překrývající se řídicí struktury
Nemůžete překrývat řídicí struktury. To znamená, že všechny vnořené struktury musí být zcela obsaženy v další nejvnitřnější struktuře. Například následující uspořádání je neplatné, `For` protože smyčka končí před ukončením vnitřního `With` bloku.
Kompilátor Visual Basic detekuje takové překrývající se řídicí struktury a signalizuje chybu při kompilaci.
## <a name="see-also"></a>Viz také:
- [Tok řízení](../../../../visual-basic/programming-guide/language-features/control-flow/index.md)
- [Rozhodovací struktury](../../../../visual-basic/programming-guide/language-features/control-flow/decision-structures.md)
- [Struktury smyčky](../../../../visual-basic/programming-guide/language-features/control-flow/loop-structures.md)
- [Ostatní řídicí struktury](../../../../visual-basic/programming-guide/language-features/control-flow/other-control-structures.md)
| 53.225 | 400 | 0.7217 | ces_Latn | 0.999778 |
b093f39c28b5c44e0b3484b5ddc7d7c8cd20e567 | 4,347 | md | Markdown | _pages/cv.md | adrian-pardo/adrian-pardo.github.io | ec6e57d282602e206f3b58213fed68367b1ab36f | [
"MIT"
] | null | null | null | _pages/cv.md | adrian-pardo/adrian-pardo.github.io | ec6e57d282602e206f3b58213fed68367b1ab36f | [
"MIT"
] | null | null | null | _pages/cv.md | adrian-pardo/adrian-pardo.github.io | ec6e57d282602e206f3b58213fed68367b1ab36f | [
"MIT"
] | null | null | null | ---
title: "CV"
permalink: /cv/
author_profile: true
redirect_from:
- /resume
---
[Also available in PDF format.](https://adrian-pardo.github.io/images/CV_AdrianPardo.pdf)
***
# Education
**B.A. NEUROSCIENCE**
*University of California, Riverside*
*SEP 2013 - JUN 2016*
Relevant Coursework:
* Statistical Computing (SAS & R)
* Biostatistics (Statistical Modeling)
* Computational Neuroscience (artificial
neural networks)
* Neuroscience of Learning & Memory (biological & artificial neural networks)
Additional Coursework:
* Linear Algebra (MIT OpenCourseWare)
* Practical Deep Learning For Coders (fast.ai)
* Convolutional Neural Networks for Visual Recognition (CS231n @ Stanford University)
***
# Research Experience
**Research Coordinator**
*PIH Health Hospital, Whittier, CA*
*OCT 2016 - JAN 2018*
* Managed Clinical Trial Phases II-III as part of a nationwide team comprised of physicians and research
coordinators to collect data regarding the viability of shared-decision making as a teaching tool for
underrepresented groups afflicted with osteoarthritis.
* Utilized EHR data and algorithmic tool (e.g. Hidden Markov Modeling) to generate personalized health information for each patient.
* Facilitated data collection by communicating with patients in either English or Spanish, administering
paperwork, clarifying potential treatment options, gathering feedback, and using REDCAP database.
* Served as liaison between research site, clinical trial network staff, collaborators and investigators.
**Research Assistant**
*University of California, Riverside: Department of Psychology*
*SEP 2015 - JUN 2016*
* Researched iconic memory in humans by working with over 100 study participants over a 10-month period.
* Operated MATLAB software to administer computational neuroscience memory tests, electrophysiological (EEG) recordings, and eye-tracking experiments to collect quantitative information regarding human memory.
**Research Assistant**
*University of California, Riverside: Department of Botany & Plant Sciences*
*MAR 2014 - JUN 2015*
* Performed statistical significance testing (e.g. ANOVA) to determine efficiency of biofuels from transgenic tobacco plants.
* Collected quantitative and qualitative data by completing over twenty wet lab procedures to prepare glycosyl composition of whole cell wall fraction, highly purified tobacco cell walls, and alcohol-insoluble residues.
***
# Skills
* Proficiency in **Python**
* Utilization of ipython, jupyter notebooks
* Statistical analysis with Numpy, Scipy
* Data manipulation with Pandas, Regex
* Visualization with Matplotlib, Seaborn
* **Machine Learning** (Supervised & Unsupervised) with Scikit-learn, Pytorch
* Basic knowledge of **Natural Language Processing** with Scikit-learn, Natural Language Toolkit (NLTK), and gensim
* Working knowledge of:
* Database query with **SQL**
* Experiment set-up with **MATLAB**
* Statistical analysis with **SAS** & **R**
* Scripting with **Bash/Unix**
* Project workflow with **Git** and **Github**
* Proficient utilization of **REDCAP** database
* Basic knowledge of **Blockchain** development
* Proficient with **Mac** & **Windows** OS
* “Protecting Human Research Participants” certified by NIH
***
# Languages
**Spanish**--Native Speaker
***
# Publications
Sasaninia, B., Ghobadi, R., Cryder, Z., Wube, S., Juloya, G., Weston, B., Seo, S., Lee, J., Pardo, A., Orozco-Cardenas, M., and Nothnagel, E.A. 2015. Organ localization of a methylated cell wall sugar in transgenic tobacco expressing a moss methyltransferase gene. 9th Annual Undergraduate Research, Scholarship, and Creative Activity Symposium Program Book, p. 14, University of California, Riverside. April 29, 2015.
* Type: Conference Papers and Presentations o Status: Published
* Year Published: 2015
Ghobadi, R., Sasaninia, B., Cryder, Z., Wube, S., Juloya, G., Weston, B., Seo, S., Lee, J., Pardo, A., Orozco-Cardenas, M., and Nothnagel, E.A. 2015. Expression of a moss methyltransferase that produces 3- O-methyl-galactosyl residues in transgenic tobacco. 9th Annual Undergraduate Research, Scholarship, and Creative Activity Symposium Program Book, p. 5, University of California, Riverside. April 28, 2015.
* Type: Conference Papers and Presentations o Status: Published
* Year Published: 2015
| 38.8125 | 418 | 0.766736 | eng_Latn | 0.919189 |
b094794625606818a907eff8fec8271e5c772cc9 | 2,105 | md | Markdown | _posts/2020-11-03-aap.md | obonaventure/obonaventure.github.io | d00c89a1342a0bce34b445f5f7402603f6ef7e84 | [
"MIT"
] | null | null | null | _posts/2020-11-03-aap.md | obonaventure/obonaventure.github.io | d00c89a1342a0bce34b445f5f7402603f6ef7e84 | [
"MIT"
] | null | null | null | _posts/2020-11-03-aap.md | obonaventure/obonaventure.github.io | d00c89a1342a0bce34b445f5f7402603f6ef7e84 | [
"MIT"
] | 2 | 2017-09-19T22:08:20.000Z | 2017-11-27T10:25:57.000Z | ---
layout: post
title: Networking Notes - Application layer
tag: http, dns
author: Olivier Bonaventure
---
A recent [blog post on APNIC](https://blog.apnic.net/2020/10/29/find-bugs-in-your-dns-zone-files-before-deployment/) describes GRoot, a tool that checks various DNS configuration and zone files for errors. Would be very useful if you need to maintain DNS servers.
[circleid](https://circleid.com) published an interesting article written by Geoff Huston on [Scaling the Root of the DNS](http://www.circleid.com/posts/20200926-scaling-the-root-of-the-dns/).
The IETF published [RFC8932](http://www.rfc-editor.org/rfc/rfc8932.txt) which provides privacy recommendations for DNS operators. If you reach French, you can also read an [excellent summary]( https://www.bortzmeyer.org/8932.html) of this RFC by Stéphane Bortzmeyer.
If you use Chromium, you probably like its auto-suggestion feature. When you type the first characters of a domain name in the address bar, this browsers tries to consider this as either a search term or a domain name. To verify whether the letters that you typed are a valid domain name, it simply queries the DNS. Unfortunately, these queries are responsible for 50% of the load of the root DNS servers according to a [post on the APNIC blog](https://blog.apnic.net/2020/08/21/chromiums-impact-on-root-dns-traffic/).
The [HTTP Working Group](https://httpwg.org/) of the IETF is currently revising the [HTTP caching specification](https://cache-tests.fyi/spec/cache.html). Caches are a key element of the HTTP protocol. While working on this revising, Mark Notthigham has developed a nice visualisation that indicates how different browsers support this IETF draft. These visualizations are linked from the IETF draft itself !
*This blog post was written to inform the readers of [Computer Networking: Principles, Protocols and Practice](https://www.computer-networking.info) about the evolution of the field. You can subscribe to the [Atom feed for this blog](http://blog.computer-networking.info/feed.xml). | 95.681818 | 519 | 0.782898 | eng_Latn | 0.980386 |
b0964e621cf7a30f9d61c4d22105a8ceeba9dcfa | 1,859 | md | Markdown | README.md | luchoeben/freebsd-desktop | 6fb7e6de912e63a0180341f2cefd3013d62e1a58 | [
"BSD-2-Clause"
] | 2 | 2019-06-29T14:55:54.000Z | 2021-09-28T21:08:33.000Z | README.md | luchoeben/freebsd-desktop | 6fb7e6de912e63a0180341f2cefd3013d62e1a58 | [
"BSD-2-Clause"
] | null | null | null | README.md | luchoeben/freebsd-desktop | 6fb7e6de912e63a0180341f2cefd3013d62e1a58 | [
"BSD-2-Clause"
] | 4 | 2017-03-11T20:59:26.000Z | 2022-01-05T18:03:42.000Z | # freebsd-desktop
Script to setup a FreeBSD machine for desktopuse
This script is meant to be run once after a fresh installation of
FreeBSD. It will do an update of the system, install a lot of packages
and setup some stuff you could like to have on a desktop machine such as
languagesettings, tmp-cleanup, anacron, powerd, ntp etc.
At the moment the script will install a desktop based on KDE, Lumina-DE, LXDE or Awesome (you have the choice).
You should have at least 8GB free space to install a KDE desktop.
To get all benefits out of this script you should _not_ add a user during installation, but after having this script added some config-files to the homedir-skeleton. If you have added users nevertheless, the script will ask you to remove them in order to re-add them afterwards.
## Using this script
After having done a freh installation of FreeBSD (I'd recommend not to add a user during installation, but after this script has done its work) log in as root and download the script like this:
<pre><code>fetch --no-verify-peer https://raw.githubusercontent.com/rakor/freebsd-desktop/master/freebsd-desktop</code></pre>
The default behaviour is to install a german KDE with additional software (office, browser, etc.). If you'd like to have an other language or a smaller Awesome, LXDE or Lumina-desktop instead use the option -m.
To install the standard with KDE and extra packages start the script
<pre><code>sh ./freebsd-desktop</code></pre>
To set some different options instead use the -m option.
<pre><code>sh ./freebsd-desktop -m</code></pre>
At the end the script gives you the possibility to add an initial user. If you need any additional users, this is the right time for it:
<pre><code>adduser</code></pre>
If the script has done its job and everything went well reboot into your new desktop
<pre><code>reboot</code></pre>
| 56.333333 | 278 | 0.775148 | eng_Latn | 0.997731 |
b098328083be32f2a640f0240b5ce5971449d1bd | 2,466 | md | Markdown | _posts/2019-03-31-Download-previous-year-wbpmt-question-paper.md | Ozie-Ottman/11 | 1005fa6184c08c4e1a3030e5423d26beae92c3c6 | [
"MIT"
] | null | null | null | _posts/2019-03-31-Download-previous-year-wbpmt-question-paper.md | Ozie-Ottman/11 | 1005fa6184c08c4e1a3030e5423d26beae92c3c6 | [
"MIT"
] | null | null | null | _posts/2019-03-31-Download-previous-year-wbpmt-question-paper.md | Ozie-Ottman/11 | 1005fa6184c08c4e1a3030e5423d26beae92c3c6 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Previous year wbpmt question paper book
Nine's a better number! "Then let's Mary on his lap as she lowered her hands from his temples, sir, but he knew all, temporarily mad, so fearless that he would take even dragon form. " "But you are trembling. 020LeGuin20-20Tales20From20Earthsea. pretty open ice? questions previous year wbpmt question paper will meet the expedition during a stay of some lighted up for the occasion by a number of variegated paper lanterns. Bronson. El Abbas and the King's Daughter of Baghdad dcccclxvi hours, not discourage them. The Black Hole loved rice. visit his children and grandchildren--certain it was that the gods would Sinsemilla drew the damaged paperback across the table and began to smooth the rumpled pages as she "They're controlled by sophisticated, he had just failed a major test With a sigh of weariness and a triumphant smile, 'cause that's not a place! sister, in came his mother and caught hold of him; and he said previous year wbpmt question paper her, so they Red Mother is born the Allking, competitive rodeo bronc-busting, but it was always the same story, I wondered at the difference between Amanda Gall's attitude toward another water source, appearing organic to her blurred vision. The cane, Waris wants us to call it-is twice the work of building the House. Later when he tried to repeat the word, Nevada. During the expedition of 1861 Carl Chydenius "Let's go over what we've learned. Mostly the pupil was supposed to be with the Master, surely the mutt can clear the truck entirely, but for heaven's sake get out of that circus tent before I get another headache? His business was none of the witch's business. have much to learn from the Europeans, he isn't, his mouth is as dry as the arid ground under his flying feet, "Enough of this, arriving on the 4th September at Goltschicha, i, but joy. As _Vega_, previous year wbpmt question paper they didn't mind being squeezed a little. What did it say?" u. " Jam smiles and looks fourteen again. " "There is nothing to explain, sir. You've got to see this. and wadded some of the pages. [Illustration: SIBERIAN RHINOCEROS HORN. The many written copies of the ancient texts serve to keep them from varying widely or from being lost altogether; but previous year wbpmt question paper songs and histories that are part of every child's education are taught and learned aloud, St. | 274 | 2,358 | 0.787105 | eng_Latn | 0.999895 |
b09957958d79a2d89fe7c03c992f978e00b0bd87 | 658 | md | Markdown | README.md | bryanlimy/maze-game | 4a0de99fc28380fe7e9db9336caf611ba664f260 | [
"MIT"
] | null | null | null | README.md | bryanlimy/maze-game | 4a0de99fc28380fe7e9db9336caf611ba664f260 | [
"MIT"
] | null | null | null | README.md | bryanlimy/maze-game | 4a0de99fc28380fe7e9db9336caf611ba664f260 | [
"MIT"
] | null | null | null | # Maze Game
Implemented a simple maze game in Java
Our maze is a 2-dimensional grid. Each cell in this grid is either a
hallway or a wall. We denote a wall with the symbol X and an empty hallway with a blank space. There are
two players in this game — two monkeys. We denote them with symbols 1 and 2. The monkeys’ objective
is to eat as many bananas as possible. We denote bananas with the symbol B. Some bananas are stationary,
and some bananas move about the grid. We denote mobile bananas with the symbol M. Figure 1 (left) shows
an example initial state of the maze game. Notice the two players (1 and 2), four bananas (B), and two
mobile bananas (M).
| 59.818182 | 104 | 0.767477 | eng_Latn | 0.999785 |
b09a7b7f4d3eb1026a8427e8679845f8a96faa28 | 302 | md | Markdown | domain/norstat.dk/index.md | dmarti/smmd | f65528340e9fa3abfc88ddd672e01faf59317b5f | [
"CC-BY-4.0",
"MIT"
] | 2 | 2020-12-20T19:10:17.000Z | 2021-07-18T22:32:37.000Z | domain/norstat.dk/index.md | dmarti/smmd | f65528340e9fa3abfc88ddd672e01faf59317b5f | [
"CC-BY-4.0",
"MIT"
] | 8 | 2020-06-19T16:02:03.000Z | 2021-08-24T16:49:39.000Z | domain/norstat.dk/index.md | dmarti/smmd | f65528340e9fa3abfc88ddd672e01faf59317b5f | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-06-29T20:36:31.000Z | 2020-06-29T20:36:31.000Z | ---
company-name: Norstat
domain: norstat.dk
email: dpo@norstatgroup.com
home: https://norstat.dk/
iab-listing-name: "Norstat Danmark A/S"
iab-privacy-policy: https://panel.norstat.dk/sikkerhed
member-of: "Interactive Advertising Bureau (IAB)"
privacy-policy: https://norstat.dk/privacy-policy/
---
| 21.571429 | 54 | 0.751656 | yue_Hant | 0.266781 |
b09ab28a2a27e1880e8098a5f5e092c4d08ce6ab | 473 | md | Markdown | README.md | excitoon/ecg-info | 103c4c2fce5b458a4c40a3c009f88658c5e6bfdc | [
"MIT"
] | null | null | null | README.md | excitoon/ecg-info | 103c4c2fce5b458a4c40a3c009f88658c5e6bfdc | [
"MIT"
] | 2 | 2018-08-08T11:30:08.000Z | 2019-10-16T15:45:46.000Z | README.md | excitoon/ecg-info | 103c4c2fce5b458a4c40a3c009f88658c5e6bfdc | [
"MIT"
] | 1 | 2019-09-18T12:29:33.000Z | 2019-09-18T12:29:33.000Z | Tools for dumping and analyzing ECG data.
# `schiller-dump`
Produces TSV file with Schiller ECG data.
## Usage
```
schiller-dump filename.raw
```
# `myocard-dump`
Produces TSV file with Myocard ECG data.
## Usage
```
myocard-dump data-path
```
# `ecg-view`
View TSV file (starting at `d:hh:mm:ss`):
```
ecg-view filename.tsv [d:]hh:mm:ss [duration]
```
## Dependencies
```
pip3 install matplotlib
```
# Supported formats
- Schiller MT-101
- МИОКАРД-ХОЛТЕР 2
| 11.536585 | 45 | 0.676533 | eng_Latn | 0.541059 |
b09b012311884637701df25420e7b1f26a746295 | 1,905 | md | Markdown | README.md | eliamartani/svelte-debugger | 021c738ae7c7e8f736d1c4adfea157d9bc0486a0 | [
"MIT"
] | null | null | null | README.md | eliamartani/svelte-debugger | 021c738ae7c7e8f736d1c4adfea157d9bc0486a0 | [
"MIT"
] | null | null | null | README.md | eliamartani/svelte-debugger | 021c738ae7c7e8f736d1c4adfea157d9bc0486a0 | [
"MIT"
] | null | null | null | # svelte-debugger ([demo 🚀](https://svelte.dev/repl/fbd4c72596ef48a588edfcbbbad64893?version=3.6.7))
[![npm][badge-version]][npm]
[![bundle size][badge-size]][bundlephobia]
[![license][badge-license]][license]
A _JSON_ debugger component for [Svelte][svelte] apps.
## Installation
```bash
npm install svelte-debugger --save
```
or
```bash
yarn add svelte-debugger
```
## Usage
```html
<script>
import Debugger from 'svelte-debugger';
</script>
<Debugger data={example} />
```
## Properties
```html
<Debugger
data={example}
indent={2}
colorOptions={{ falseColor: '#ff3e00', trueColor: '#40b3ff' }}
/>
```
## Parameters
The following parameters are available:
| parameter | default | description |
|-----------|-----------|---------------------------------------------------------------------------------------------------------------------|
| data | {} | The non-formated _object_ to debug |
| indent | 2 | The size number of spaces between _keys_ and _values_ |
| colorOptions | {} | An object that describes the individual color of each property (`keyColor`, `numberColor`, `stringColor`, `trueColor`, `falseColor`, `nullColor`) from our _data_ object |
[svelte]: https://svelte.dev/
[badge-version]: https://img.shields.io/npm/v/svelte-debugger.svg
[npm]: https://www.npmjs.com/package/svelte-debugger
[badge-size]: https://img.shields.io/bundlephobia/minzip/svelte-debugger.svg
[bundlephobia]: https://bundlephobia.com/result?p=svelte-debugger
[badge-license]: https://img.shields.io/npm/l/svelte-debugger.svg
[license]: https://github.com/ftonato/svelte-debugger/blob/master/LICENSE
## License
[MIT](LICENSE)
| 29.765625 | 239 | 0.567454 | eng_Latn | 0.177993 |
b09b7234b0ff98adbc6f0afe53331a6df6992b60 | 3,900 | md | Markdown | material/icon/account-tie-voice-outline.md | liuwave/icon-helper | 6339786f595d6f12a432db71e7aaccb693b9fe59 | [
"MIT"
] | 2 | 2020-10-26T16:32:26.000Z | 2021-01-13T09:28:45.000Z | material/icon/account-tie-voice-outline.md | liuwave/icon-helper | 6339786f595d6f12a432db71e7aaccb693b9fe59 | [
"MIT"
] | 48 | 2020-04-04T12:39:59.000Z | 2022-02-27T01:30:09.000Z | material/icon/account-tie-voice-outline.md | liuwave/icon-helper | 6339786f595d6f12a432db71e7aaccb693b9fe59 | [
"MIT"
] | null | null | null | ---
title: account tie voice outline(帐户领带语音轮廓) ICON转svg、png下载
name: account-tie-voice-outline
zhTips: 帐户领带语音轮廓
tags: ["account-user"]
search:
image: https://iconhelper.cn/svg/material/account-tie-voice-outline.svg
---
# account tie voice outline <small style="font-size: 60%;font-weight: 100">帐户领带语音轮廓</small>
<div class="detail-page">
<p>
<span><span class="badge-success badge">免费图标</span> </span>
<br/>
<span>
ICON库：
<span class="badge-secondary badge">Material Design Icons</span>
</span>
<br/>
<span>
CSS名称：
<span class="badge-secondary badge">mdi-account-tie-voice-outline</span>
</span>
<br/>
<span>
unicode：
<span class="badge-secondary badge">F1309</span>
<copy-btn content='F1309' btn-title=""></copy-btn>
<copy-btn :content='String.fromCodePoint(parseInt("F1309", 16))' btn-title="复制U"></copy-btn>
</span>
<br/>
<span>
版本：
<span class="badge-secondary badge">4.8.95</span>
</span><br/><span>标签：<span class="badge-light badge"><router-link to="/tags/account-user.html">账号、用户</router-link></span></span>
<br/>
<span>图标来源/作者：<span class="badge-light badge">Michael Irigoyen</span></span>
<br/>
<span class="zh-detail">中文描述：<span class="badge-primary badge">帐户领带语音轮廓</span><span class="help-link"><span>帮助改进</span>(<a href="https://gitee.com/liuwave/icon-helper/edit/master/json/material/account-tie-voice-outline.json" target="_blank" rel="noopener noreferrer">gitee</a><a href="https://github.com/liuwave/icon-helper/edit/master/json/material/account-tie-voice-outline.json" target="_blank" rel="noopener noreferrer">github</a></span>)</span><br/>
</p>
</div>
<div class="alert alert-dark">
<i class="mdi mdi-account-tie-voice-outline mdi-48px"></i>
<i class="mdi mdi-account-tie-voice-outline mdi-36px"></i>
<i class="mdi mdi-account-tie-voice-outline mdi-24px"></i>
<i class="mdi mdi-account-tie-voice-outline mdi-18px"></i>
</div>
<div>
<p>引入css文件后，可以用<code><span></code>包裹，放在页面中。具体如下所示：
</p>
<div class="alert alert-primary" style="font-size: 14px">
<span class="mdi mdi-account-tie-voice-outline" aria-hidden="true"></span>
<copy-btn content='<span class="mdi mdi-account-tie-voice-outline" aria-hidden="true"></span>'></copy-btn>
</div>
<div class="alert alert-secondary">
<i class="mdi mdi-account-tie-voice-outline"
style="font-size: 24px"
aria-hidden="true"></i> mdi-account-tie-voice-outline
<copy-btn content="mdi-account-tie-voice-outline" btn-title="复制图标名称"></copy-btn>
</div>
</div>
<div id="svg" class="svg-wrap">
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M16.75 4.36C18.77 6.56 18.77 9.61 16.75 11.63L15.07 9.94C15.91 8.76 15.91 7.23 15.07 6.05L16.75 4.36M20.06 1C24 5.05 23.96 11.11 20.06 15L18.43 13.37C21.2 10.19 21.2 5.65 18.43 2.63L20.06 1M13.36 13.76C15.31 14.42 17 15.5 17 17V22H1V17C1 15.5 2.69 14.42 4.65 13.76L5.27 15L5.5 15.5C4 15.96 2.9 16.62 2.9 17V20.1H7.12L8 15.03L7.06 13.15C7.68 13.08 8.33 13.03 9 13.03S10.32 13.08 10.94 13.15L10 15.03L10.88 20.1H15.1V17C15.1 16.62 14 15.96 12.5 15.5L12.73 15L13.36 13.76M9 6C7.9 6 7 6.9 7 8S7.9 10 9 10 11 9.1 11 8 10.1 6 9 6M9 12C6.79 12 5 10.21 5 8S6.79 4 9 4 13 5.79 13 8 11.21 12 9 12Z" /></svg>
</div>
<detail full-name='mdi-account-tie-voice-outline'></detail>
<div class="icon-detail__container">
<p>关于“<b>account tie voice outline</b>”的评论:</p>
</div>
<Vssue title="关于“account tie voice outline”的评论" />
<div><p>图标account tie voice outline来源于Material Design Icons，可免费使用，更多关于 Material Design Icons的信息，参见：<a target="_blank" href="https://iconhelper.cn/material.html"> Material Design Icons</a>
</p></div>
<div style="padding:2rem 0 " class="page-nav"><p class="inner"><span class="prev">←<router-link to="/icon/account-tie-voice-off-outline.html">account-tie-voice-off-outline</router-link></span> <span class="next"><router-link to="/icon/account-voice.html">account-voice</router-link>→</span></p></div>
| 49.367089 | 666 | 0.698718 | yue_Hant | 0.216555 |
b09b7a8f09bf5b3bef341271cb31e54e1081982a | 4,961 | md | Markdown | README.md | edouardmichelin/mini-game | 6f76ce2e3ff80fd39724d2f22800dc3681d232b0 | [
"MIT"
] | null | null | null | README.md | edouardmichelin/mini-game | 6f76ce2e3ff80fd39724d2f22800dc3681d232b0 | [
"MIT"
] | null | null | null | README.md | edouardmichelin/mini-game | 6f76ce2e3ff80fd39724d2f22800dc3681d232b0 | [
"MIT"
] | null | null | null | # CS-107 - Mini projet 2 - Mini jeu
### Edouard Michelin & Julien Jordan
---
---
## Contexte
Ce projet a été donné dans le cadre du cours d'introduction à la programmation (CS-107).
## Objectif
L'objectif premier de ce projet est d'être capable d'appliquer les premiers principes de programmation enseignés lors du cours dans le but de pouvoir mettre en pratique l'aspect orienté objet de la programmation.
---
## Partie 1 (ARPG de base)
Préparation du jeu ARPG. Premiers personnages et premières intéractions.
## Partie 2 (Points de vie et ressources)
Implémentation des points de vie du personnage et de l'inventaire.
## Partie 3 (Monstres et batailles)
Certainement la partie la plus longue, création et implémentation des monstres ainsi que des moyens de les combattre.
## Partie 4 (Extensions)
Nous avons travaillé différents bonus, à savoir
- Affichage d'une cascade sur l'aire `Route`
- Possibilité de pouvoir courir à l'aide de la touche `X`
- Ajout de plusieurs aires (`MaisonFerme`, `Grotte`, `RouteTemple`, `Temple`)
- Ajout de personnages non joueurs (PNJ) avec lesquels il est possible d'intéragir avec la touche `E` (les PNG sont soit immobiles, soit en mouvement. Les PNJ en mouvement s'arrêtent auprès du joueur en attendant que vous vouliez bien leur parler)
- Ajout de fleurs
- Ajout d'un nouveau monstre (Gobelin) dans la grotte
- Ajout d'items ramassables à différents endroits (VOIR SCENARIO)
- Ajout d'éléments réagissant à un signal (Pont sur l'aire route avec l'orbe)
- Il est possible de passer de l'affichage de l'argent à l'adffichage de la fortune
## Scénario
Le scénario (assez simple) se déroule de la manière suivante
- Le personnage principal apparait dans un nouvel univers chez des inconnus.
- Il sort ensuite, parle avec les différents villageois et en apprend plus sur son environnement.
- En tentant de sortir de la ferme par le Nord-Est, il découvre alors qu'il est bloqué par de solides touffes d'herbe.
- Il peut en revanche sortir de la ferme par le côté Sud-Ouest pour découvrir le village.
- Dans le village il rencontre de nouveau villageois. Il se rend alors compte que lesdits habitants de ce monde ne vont pas lui être d'une grande utilité.
- En se promenant dans le village, et en tentant de sortir par le coté Nord-Est, il tombe à nouveau sur de solides et infranchissables touffes d'herbe.
- En revenant et en se promenant sur la plage il trouve une épée qu'il s'empresse de ramasser.
- Cette épée lui servira à couper les hautes herbes ; il pourra enfin pleinement accéder à l'aire route.
- De féroces buches lui font face quand il essaye de s'approcher des quelques bombes laissées sur la route, qui lui serviront plus tard.
- En sortant par le coté Nord de la route, il tombe sur le chateau de la ville, gardé par le terrible seigneur des tenebres, qu'il ne peut pour le moment combattre.
- Il revient alors au village et découvre une faille dans le mur coté Nord.
- Bien évidemment, il décide alors de faire usage des bombes qu'il a auparavent trouvées pour forcer le passage de ce qui semble être l'entrée d'une grotte.
- En arrivant dans la grotte, il y découvre le méchant vilain gobelin, contaminé, qui le blessera au moindre contact.
- Voulant débarrasser le village de la vermine, il s'empresse de le zigouiller à coups d'épée.
- Le gobelin laisse alors tomber un arc de sa poche. Notre personnage pourra alors s'en servir avec les flèches qu'il avait bien évidemment dans son carquois au début de l'aventure.
- Il remonte ensuite vers la route pour, par pur hasard, tirer à l'arc sur l'orbe magique qui laisse alors apparaitre un pont magique.
- L'esprit aventurier, il prend le chemin de ce pont pour arriver vers un temple magique qui renferme un baton magique.
- Il découvre alors les pouvoirs magiques de son bâton et en déduit qu'il pourra remonter les bretelles du seigneur des ténebres.
- Une fois cela fait, il s'apercoit que le méchant a laissé tombé une clef, qui n'est autre que la clef du chateau.
- Il y rentre et y découvre alors un étrange personnage lui annonçant qu'il a finit le jeu.
## Attribution des touches
public static int MOVE_UP = Keyboard.UP;
public static int MOVE_DOWN = Keyboard.DOWN;
public static int MOVE_LEFT = Keyboard.LEFT;
public static int MOVE_RIGHT = Keyboard.RIGHT;
public static int INTERACTION_KEY = Keyboard.E;
public static int RUN = Keyboard.X;
public static int SWITCH_ITEM = Keyboard.TAB;
public static int SWITCH_COINS_DISPLAY = Keyboard.L;
public static int CONSUME_ITEM = Keyboard.SPACE;
## Note importante
Nous avons oublié d'implémenter la possibilité de tester le code avec un "mode de triche"
Le poids des objets est identique pour tous les objets (classes `*Items` dans `*arpg.items`)
Le poids des objets est identique pour tous les objets (classes `*Items` dans `*arpg.items`) | 55.741573 | 247 | 0.769804 | fra_Latn | 0.987708 |
b09ba3d5d978b0e63d73e3e63c628b48f63d9f97 | 13,467 | md | Markdown | content/posts/ralph-vaughan-williams.md | LarsBehrenberg/gb-content-copy | 29ea184a475787b5ebffbd4dba2bb85c0c0966aa | [
"MIT"
] | null | null | null | content/posts/ralph-vaughan-williams.md | LarsBehrenberg/gb-content-copy | 29ea184a475787b5ebffbd4dba2bb85c0c0966aa | [
"MIT"
] | null | null | null | content/posts/ralph-vaughan-williams.md | LarsBehrenberg/gb-content-copy | 29ea184a475787b5ebffbd4dba2bb85c0c0966aa | [
"MIT"
] | null | null | null | ---
id: post--ra4JnlOm
showOnIndex: true
path: ralph-vaughan-williams-biography
date: 2020-07-08T05:06:35.260Z
subTitle: Biography of
title: Ralph Vaughan Williams
tags: More
cover: /assets/ralph-vaughan-williams-portrait-1920.jpg
links:
- post-vuyZBOFoz
- post-D-BUEmJ6z
- post-7nSh0deKi
upperGalleryImages:
topImage:
topImageUrl: /assets/ralph-vaughan-williams-leith-hill-place.jpg
topImageTitle: Leith Hill Place, Surrey, childhood home of the composer Ralph
Vaughan Williams. Vaughan Williams bequeathed the house to the National
Trust in 1944. (© Rob enwiki, CC BY-SA 4.0)
leftImage:
leftImageTitle: "'Forest Green' hymn tune, from the English Hymnal, 1906"
leftImageUrl: /assets/ralph-vaughan-williams-forest-green.jpg
middleImage:
middleImageTitle: Portrait of composer Ralph Vaughan Williams, c. 1920 (© E. O. Hoppé, PD-US)
middleImageUrl: /assets/ralph-vaughan-williams-portrait-1920.jpg
rightImage:
rightImageTitle: Plaque erected in 1972 by Greater London Council at 10 Hanover
Terrace, Regent's Park, London NW1 4RJ, City of Westminster (© Spudgun67,
CC BY-SA 4.0)
rightImageUrl: /assets/ralph-vaughan-williams-plaque-bw.jpg
textSections:
- textTitle: Williams’s early life
text: >-
### Ralph Vaughan Williams was born on October 12, 1872 in the Cotswold
village of Down Ampney, Gloucestershire. He was the third child and
younger son of Reverend Arthur Vaughan Williams, a well-to-do vicar, and
wife Margaret Wedgwood.
When Ralph was two and a half years old, his father died. His mother returned to her mother’s mansion at Leith Hill Place.
Vaughan Williams’s maternal grandmother taught him to read and his aunt gave him his first music lessons. By the time he was six, he had composed his first piano piece, The Robins Nest. He was an insatiable reader and had an impressive collection of books in his nursery.
In 1883, Vaughan Williams entered [Field House](https://en.wikipedia.org/wiki/St_Aubyns_School), a preparatory school in Rottingdean, in the city of Brighton and Hove, East Sussex. In 1887, he transferred to a public school, Charterhouse, in Godalming, Surrey. He had taken violin, piano, and viola lessons. At Charterhouse, he decided to organize a concert. He performed one of his own compositions, a Pianoforte Trio in G.
After Vaughan Williams left Charterhouse, he was eager to pursue a career as a musician. The viola was his favorite instrument. The viola raised some eyebrows in his family, so it was decided that he should begin a musical career by studying to be an organist, which was more in keeping with his social status. In 1890, Vaughan Williams entered the [Royal College of Music (RCM)](https://www.rcm.ac.uk/) in London. He studied organ with Walter Parrott and composition with his idol, Hubert Parry.
Vaughan Williams’s family continued to have doubts about his musical talent and the efficacy of a musical career and insisted that he get a university education. To appease his family, he left RCM and entered Trinity College, Cambridge in 1892. He studied music and history. He received his Bachelor of Music in 1894 and his Bachelor of Arts in 1895. He returned to RCM in 1895 and completed his studies. In that same year he obtained a job at St. Barnabas as a church organist and choirmaster.
Vaughan Williams met Adeline Fisher while at Cambridge. She was the daughter of Herbert William Fisher, a noted British historian. They were married on October 9, 1897.
buttonToggle: true
sideGalleryImages:
- imageTitle: Hubert Parry, Vaughan Williams's first composition teacher at the
Royal College of Music
imageUrl: /assets/ralph-vaughan-williams-hubert-parry.jpg
- imageTitle: Leith Hill Place, Surrey, childhood home of the composer Ralph
Vaughan Williams. Vaughan Williams bequeathed the house to the
National Trust in 1944. (© Rob enwiki, CC BY-SA 4.0)
imageUrl: /assets/ralph-vaughan-williams-leith-hill-place-2.jpg
- imageTitle: Charles Villiers Stanford, Vaughan Williams's second composition
teacher at the RCM
imageUrl: /assets/ralph-vaughan-williams-stanford-basano-1921.jpg
- textTitle: Early career
text: >-
### After his marriage in 1897, Vaughan Williams took a leave and went on
a six-month honeymoon in Germany.
Combining pleasure and business, he worked on his last period of formal study in composition as an apprentice musician with Max Bruch.
After returning to London, Vaughan Williams decided to work for a doctorate in music at Cambridge. He passed his examination and earned his Doctor of Music at Cambridge in 1899. It was formerly conferred in 1901.
Vaughan Williams’s first important venture was the song Linden Lea which he composed in 1902. It was printed in the Vocalist, a music publication, and later as separate sheet music.
Between 1904 and 1906, Vaughan Williams was music editor for a new hymn book, [The English Hymnal](https://en.wikipedia.org/wiki/The_English_Hymnal). He wrote Sine Nomini (For all the Saints). Also, he helped found the amateur Leith Hill Music Festival in 1905. He was appointed principal conductor.
Vaughan Williams was introduced to Maurice Ravel and studied with him for three months in Paris, between 1907 and 1908. He credits Ravel with helping him replace his old style with freshness and imagination.
In 1914, before the start of World War I, Ralph composed two large scale works, the first version of [A London Symphony](https://en.wikipedia.org/wiki/A_London_Symphony) and [The Lark Ascending](https://en.wikipedia.org/wiki/The_Lark_Ascending_(Vaughan_Williams)). When the war started, he felt obligated to enlist. He began his military service in the Royal Army Medical Corp as an ambulance orderly with the rank of private.
In 1917, Vaughan Williams was commissioned as lieutenant in the Royal Artillery where he was responsible for the guns and horses. The continued noise of the guns damaged his hearing and led to deafness in his later years.
After the armistice in November 1918, Ralph was transferred from the artillery unit and given the title Director of Music in the First Army of the British Expeditionary Force in France. He had been offered a teaching position at RCM. He would immediately move back into academia as a professor upon being dismissed from the army.
buttonToggle: true
sideGalleryImages:
- imageTitle: The composer Ralph Vaughan Williams in 1913 (© James Bacon and Sons,
Leeds, PD-US)
imageUrl: /assets/ralph-vaughan-williams-1913.jpg
- imageTitle: A photo of Maurice Ravel in 1906
imageUrl: /assets/ralph-vaughan-williams-ravel-1906.jpg
- textTitle: Williams’s later life
text: >-
### A series of events in the 1920s marked a special period in Vaughan
Williams’s life.
His third symphony, [A Pastoral Symphony](https://en.wikipedia.org/wiki/A_Pastoral_Symphony), was performed in Queen’s Hall with [Adrian Boult](https://en.wikipedia.org/wiki/Adrian_Boult) conducting the Orchestra of the Royal Philharmonics Society.
Next, Vaughan Williams was invited by Carl Stoeckel, a wealthy music patron from Connecticut, to come to America and participate in a musical festival in Norwalk, Connecticut and conduct A Pastoral Symphony.
Two weeks after Vaughan Williams returned from Connecticut, his one-act opera The Shepherds of the Delectable Mountains was performed at the RCM. The piece was a chapter in the story of his lifelong concern to make an opera from John Bunyan’s The Pilgrim’s Progress. The occasion was honored by the presence of [Queen Mary](https://en.wikipedia.org/wiki/Mary_of_Teck), the consort of [King George V](https://en.wikipedia.org/wiki/George_V).
In 1922, the British Broadcasting Corporation (BBC) experimented with a new initiative. After everything was in place, Vaughan Williams gave his first broadcast talk on Christmas Eve in 1924. This became an important part of his life in music
The 1930s was bittersweet for Vaughan Williams. In 1932, he gave a series of lectures at Bryn Mawr College in Pennsylvania. Later, in 1934, his longtime friend, Gustav Holst died.
In 1935, Vaughan Williams was awarded the Order of Merit by King George V. Two years later, in 1937, his mother died. At the same time his wife, Adeline, had become increasingly immobile with arthritis.
In 1938, he met Ursula Woods, a young poet. They became friends and over the next decade, she would become his muse and help him take care of his ailing wife. When World War II broke out, Vaughan Williams did civilian war work and composed a film score for the film [49th Parallel](https://en.wikipedia.org/wiki/49th_Parallel_(film)).
In 1943, his Fifth Symphony was performed at The Prom (The Henry Wood Promenade Concerts). His Sixth Symphony followed in 1948. In 1951 Vaughan Williams’s wife died. This occurred about the same time that his last opera The Pilgrims Progress, John Bunyan’s allegory, was staged at Convent Gardens.
In February 1953, Vaughan Williams and Ursula Woods were married. He was forty years her senior. In 1954, they traveled to America where he was asked to lecture and conduct at Cornell University in Ithaca, New York. During the mid to late fifties, the Seventh, Eighth, and Ninth Symphonies were completed.
buttonToggle: true
sideGalleryImages:
- imageTitle: The composer Ralph Vaughan Williams in 1922 (© S J Loeb, PD-US)
imageUrl: /assets/ralph-vaughan-williams-1922.jpg
- imageTitle: Ralph Vaughan Williams signing the guest book at Yale University in
1954
imageUrl: /assets/ralph-vaughan-williams-1954.jpg
- imageTitle: Ralph Vaughan Williams, O.M. 1872-1958 Composer lived here from 1953
until his death (© Spudgun67, CC BY-SA 4.0)
imageUrl: /assets/ralph-vaughan-williams-london-residence.jpg
- textTitle: Finest works & legacy
text: >-
### The Lark Ascending remains one of Vaughan Williams’s most popular and
well-known orchestral creations. It was adapted from a 122-line poem by
George Meredith. It was scored for solo violin in 1921.
Vaughan Williams’s second symphony, A London Symphony, includes sounds heard in London and remains well received. Also popular among his orchestral music is Fantasia on a Theme by Thomas Tallis. A composer of English sacred music, Tallis was a sixteenth century English composer.
Among Vaughan Williams’s popular stage works was Job: [A Masque for Dancing](https://en.wikipedia.org/wiki/Job:_A_Masque_for_Dancing), a one act ballet performed in 1931. It was the first ballet to be performed by an entirely British team.
The Pilgrims Progress was an opera performed in 1951. Vaughan Williams based it on John Bunyan’s allegory The Pilgrim’s Progress. Its acceptance was slow, but it is now appreciated and frequently performed.
Ralph Vaughan Williams is often referred to as a late bloomer. Clearly, he was not a prodigy, but when one reviews his life, one can only wonder why his potential wasn’t tapped when he wrote his first song for piano at six years of age.
Vaughan Williams was a prolific musician. Almost like an archaeologist, Vaughan Williams discovered and preserved over eight hundred folk songs. He was the embodiment of the pioneering spirit of English music.
In 1954, he set up and endowed the [Ralph Vaughan Williams Trust](https://rvwtrust.org.uk/) to support young composers and to promote new or neglected music. On August 26, 1958, Ralph Vaughan Williams died at Hanover Terrace. After a private funeral at Golders Green, he was cremated and his ashes placed in the north choir aisle of Westminster Abbey.
buttonToggle: true
sideGalleryImages:
- imageTitle: Bust of Vaughan Williams by Marcus Cornish in Chelsea Embankment
Gardens
imageUrl: /assets/ralph-vaughan-williams-bust.jpg
- imageTitle: Blue plaque erected in 1972 by Greater London Council at 10 Hanover
Terrace, Regent's Park, London NW1 4RJ, City of Westminster (©
Spudgun67, CC BY-SA 4.0)
imageUrl: /assets/ralph-vaughan-williams-plaque.jpg
- imageTitle: Statue of Vaughan Williams by William Fawke, outside Dorking Halls
(© Leo Leibovici, CC BY 2.0)
imageUrl: /assets/ralph-vaughan-williams-statue.jpg
---
## Ralph Vaughan Williams was one of the best-known British symphonists of the twentieth century.
For centuries, as a result of the influence of Handel and Mendelssohn, Britain had a decidedly German musical bent. Vaughan Williams rejected that notion and was determined to be an ‘English composer’ from a very [early age](/ralph-vaughan-williams-biography#1).
At the turn of the century, Vaughan Williams was among the first to travel throughout the English countryside [collecting folk songs](/ralph-vaughan-williams-biography#4). He used them as a wellspring of native musical style.
Vaughan Williams was a [composer extraordinaire](/ralph-vaughan-williams-biography#3); operas, ballets, chamber music, secular and religious vocal pieces, orchestral compositions, including nine symphonies. He is best known for his composition of the orchestral work The Lark Ascending. | 72.403226 | 502 | 0.758669 | eng_Latn | 0.9977 |
b09bdea1b5e3b4f86f72f66fe11e7c90d6b2292f | 1,481 | md | Markdown | README.md | julisa99/Blockchain-Based-Compliance-System-For-Business-Processes | fab6267149e4f5dbf04c6f53228659d04a34686f | [
"MIT"
] | null | null | null | README.md | julisa99/Blockchain-Based-Compliance-System-For-Business-Processes | fab6267149e4f5dbf04c6f53228659d04a34686f | [
"MIT"
] | null | null | null | README.md | julisa99/Blockchain-Based-Compliance-System-For-Business-Processes | fab6267149e4f5dbf04c6f53228659d04a34686f | [
"MIT"
] | null | null | null | ## Setup
This readme will explain to you, how to setup the project.<br>
If you have any of the following tools already installed, you can skip the specific steps in the instructions.
### Install node
You will need node to run this project. Node can be downloaded and installed [here](https://nodejs.org/en/).
### Install Truffle
Truffel is needed to compile and deploy the smart contracts. To install it run `npm install -g truffle`
### Install Ganache
Ganache is used to run a local version of the etherum blockchain on your computer. To install it run `npm install -g ganache-cli`
### Install React
React is needed to run the front end. To install it run `npm install -g create-react-app`
## Start the Project
### Starting the blockchain
First you need to start the blockchain. Run `ganache-cli`<br>
### Deploying the smart contracts
Now open another terminal window and move into the top level folder. Arriving there the next step is to deploy the smart contracts.<br>
Run `truffle migrate` to do so. If you want to reset everything on the blockchain, run `truffel migrate --reset`.
### Starting the front end
Now move to the client folder.<br>
If you do this the for the first time, you will need to run `npm install`.<br>
Also make sure that in the subfolder `src` the symbolic link to contracts folder is working.<br>
Now you can type in `npm start` to start the frontend. It should automaticaly open a new tab on your default browser to show the frontend.
| 40.027027 | 138 | 0.755571 | eng_Latn | 0.999064 |
b09c52e35f76bdb97c9a44983a21df77918d2c14 | 1,419 | md | Markdown | README.md | lpicci96/visualizations | d23ff59aef2eb33567224f62d9447b3ae7cef6c6 | [
"MIT"
] | 5 | 2022-02-16T15:38:08.000Z | 2022-03-23T21:19:07.000Z | README.md | lpicci96/visualizations | d23ff59aef2eb33567224f62d9447b3ae7cef6c6 | [
"MIT"
] | null | null | null | README.md | lpicci96/visualizations | d23ff59aef2eb33567224f62d9447b3ae7cef6c6 | [
"MIT"
] | 3 | 2022-02-23T00:12:07.000Z | 2022-03-23T13:28:51.000Z | # My Visualizations
Welcome to my data visualizations page! Below you can find various samples of my work using R, Python, Tableau, Flouirsh and others, and access the code [here](https://github.com/lpicci96/visualizations/tree/main/code_samples). You can also check out my #TidyTuesday contributions [here](https://github.com/lpicci96/visualizations/tree/main/%23TidyTuesday).
## Sample Viz
### OECD Trade Plot
Creating using R (ggplot2) from trade data released by the OECD. Created in April 2020.
<img src="https://user-images.githubusercontent.com/56567716/116324433-61e3c600-a77d-11eb-8e38-305e2064e85d.png" width=850>
### Hans Rosling Plot
Created using R to replicate the classic Hans Rosling (Gapminder) plot showing the state of world development in 2007.
<img src="https://user-images.githubusercontent.com/56567716/116324526-89d32980-a77d-11eb-965b-b62fc82396d7.png" width = 850>
### Euro Youth Unemployment
Created using r (gganimate). This chart featured in the Rstudio blog post showcasing the package [Flipbookr](https://www.rstudio.com/blog/building-code-movies-with-flipbookr/).
<img src="https://user-images.githubusercontent.com/56567716/116324719-da4a8700-a77d-11eb-9900-389085a68063.gif" width = 850>
### Mass Shootings in the US
Poster created using Tableau.
<img src="https://user-images.githubusercontent.com/56567716/116324786-fb12dc80-a77d-11eb-8c54-6c996294d843.jpg" width = 850>
| 54.576923 | 358 | 0.787174 | eng_Latn | 0.656654 |
b09cf93083127860668862e0ecf9eadf101af7b5 | 1,031 | md | Markdown | Python/2D Parity/README.md | ShruKin/Data-Communication-Lab | fbd056b9bc96f55c2c61d818700c444c1892fcfb | [
"MIT"
] | 1 | 2020-04-08T18:43:25.000Z | 2020-04-08T18:43:25.000Z | Python/2D Parity/README.md | ShruKin/Data-Communication | fbd056b9bc96f55c2c61d818700c444c1892fcfb | [
"MIT"
] | null | null | null | Python/2D Parity/README.md | ShruKin/Data-Communication | fbd056b9bc96f55c2c61d818700c444c1892fcfb | [
"MIT"
] | null | null | null | ## **Definition**
- Two Dimensional Parity can detect as well as correct one or more bit errors. If a one or more bit error takes place then the receiver will receive the message with the changed parity bit. It indicates that some error has taken place which means the error is detected.
- Parity check bits are calculated for each row, which is equivalent to a simple parity check bit. Parity check bits are also calculated for all columns, then both are sent along with the data. At the receiving end these are compared with the parity bits calculated on the received data.
## **Diagram**
## **Performance**
## **Advantages**
- Can catch some sorts of burt errors
- There is a chance to detect the fault bit and correct the same
## **Disadvantages**
- Not capable of finding all errors. If 2 errors ouccur in the same row or column, there is a chance that 2D Parity check wont detect thhe error successfully
- Too many check bits are added, increases data size | 54.263158 | 287 | 0.762367 | eng_Latn | 0.999763 |
b09d110dd74359feaebb85536ff8e0206886ae3e | 1,856 | md | Markdown | _posts/2021-02-27-mongoDB architecture.md | zpxlffjrm/zpxlffjrm.github.io | 3f5f7052a5a67a2b3cf85b15b251d8911f7b6050 | [
"MIT"
] | null | null | null | _posts/2021-02-27-mongoDB architecture.md | zpxlffjrm/zpxlffjrm.github.io | 3f5f7052a5a67a2b3cf85b15b251d8911f7b6050 | [
"MIT"
] | null | null | null | _posts/2021-02-27-mongoDB architecture.md | zpxlffjrm/zpxlffjrm.github.io | 3f5f7052a5a67a2b3cf85b15b251d8911f7b6050 | [
"MIT"
] | null | null | null | ---
title: "MongoDB 시험 정보"
toc: true
toc_sticky: true
categories:
- Mongo
tags:
- mongos
- certificate
last_modified_at: 2021-02-27T18:45:45+00:00
---
## 몽고디비 구조
### MQL(MongoDB Query Language)
SQL을 생각하면 쉽다. RDBMS의 SQL 대신 MQL을 사용한다
클라이언트 라이브러리에서 전달되는 BSON 프로토콜 메세지를 번역한다.
## MongoDB Document Data Model
모든 CRUD 명령어가 반드시 실행되고 DBMS의 설정에 따라 결과의 구조를 결정 하는 부분이라고 한다.
네임스페이스, 인데스, 데이터 스트럭쳐, 콜렉션등의 요청에대해 응답을 작성하는 부분.
또한 작성된 가용성 요구사항을 처리하기 위해 write concerend, readconcerns 등 레플리케이션 메커니즘 이 동작하는 부분이다.
## Storage Layer
데이터의 영속성을 보장해야 하는 부분!
시스템 요청, 디스크 플러시, 파일 구조, 압축 레벨을 지정하는 레이어
데이터 압축, 저수준 시스템 접근이 발생하는 부분
### 스토리지 엔진
MySQL의 InnoDB와 같은 스로리지 일까?
어떻게 구성되었는지에 따라 다른 속성을 지정하게 되는 몇몇 스토리지 엔진이 있다. 기본적으로 WiredTiger를 사용한다고 함.
## Security & admin
강의에서는 계층 구조(상하)구조로보여주지 않고 양옆에 세워져 있는 레이어로 보여준다.
유저 관리, 인증, 네트워크, 암호화/복호화 관련 작업은 Security 레어어에서 담당한다.
반명에 어드민 레어어는 데이터베이스 생성, 콜렉션 이름 변경, 로그 등 관리자 측면에서 해야하는 모든일을 담당한다.
## 몽고디비
지금까지는 `MongoD`라는 하나의 데이터베이스에 대해 간략히 작성해 보았다.
하지만 `MongoDB`는 단지 `MongoD`들을 말하는것이 아니다.
### 몽고디비는 분산 데이터베이스 시스템이다.
레플리카 그룹은 높은 가용성과 빠른 복구를 위해 같은 데이터를 가지고 있는 `들의 집합이다. 하나의 주(primary) 데이터베이스와 여러개의 백업(secondary) 데이터베이스로 구성된다.
빠른 복구를 위해 raft 합의프로토콜을 기반으로 작성된 failover 프로토콜을 가지고 있다고 한다.
따라서 프라이머리 데이터베이스에 이상이 생긴 경우 자동으로 백업 데이터베이스 중 하나가 주 데이터베이스로 설정된다
이런 방법으로 서비스 장애를 매우 빠르게 대응할 수 있다. 두번째 데이터베이스가 서비스를 담당하는 사이 문제가 생긴 데이터베이스를 처리하면 된다.
사용할수 있는 머신에 구애받지 않고 세계 곳곳에 배포할수 있도록 각 데이터베이스는 롤, 하드웨어, 운영체제를 통일하지 않아도 됨.
### 몽고디비는 확장 가능한(scalable) 데이터베이스이다
몽고디비는 데이터들을 샤드 클러스터에 데이터를 저장할수 있는데,
샤드 클러스터에 새로운 샤드를 추가하면 확장이 가능하다.
샤드는 전체 클러스터에 데이터를 복제하지 않고 일부 클러스터에만 내용을 복제하는 방식. 이런 샤드를 몽고디비에서 이용한다면 `MongoS`를 사용해야 하며 `MongoS`는 모든 샤드를 관리하는 만큼 모든 명령어가 샤드에 도달할수 있게 해야함. 당연한 말이지만 어플리케이션의 요청도 처리해야 함.
샤드를 구성한다면 `MongoD`는 직접 접근할 이유가 없음.
몽고디비는 클러스터의 메타데이터를 저장하는 컨피스 서비스를 제공한다.
샤드와 데이터를 매핑한 정보, `MongoS`의 수, 어떤 콜렉션이 분산되어있는지 등등... 에 대한 정보를 관리하는 레플리카
| 23.493671 | 165 | 0.722522 | kor_Hang | 1.00001 |
b09ea5b274c6d21b66667f0168b185663b20219e | 40,384 | md | Markdown | treebanks/tr_penn/tr_penn-feat-Aspect.md | vistamou/docs | 116b9c29e4218be06bf33b158284b9c952646989 | [
"Apache-2.0"
] | 204 | 2015-01-20T16:36:39.000Z | 2022-03-28T00:49:51.000Z | treebanks/tr_penn/tr_penn-feat-Aspect.md | vistamou/docs | 116b9c29e4218be06bf33b158284b9c952646989 | [
"Apache-2.0"
] | 654 | 2015-01-02T17:06:29.000Z | 2022-03-31T18:23:34.000Z | treebanks/tr_penn/tr_penn-feat-Aspect.md | vistamou/docs | 116b9c29e4218be06bf33b158284b9c952646989 | [
"Apache-2.0"
] | 200 | 2015-01-16T22:07:02.000Z | 2022-03-25T11:35:28.000Z | ---
layout: base
title: 'Statistics of Aspect in UD_Turkish-Penn'
udver: '2'
---
## Treebank Statistics: UD_Turkish-Penn: Features: `Aspect`
This feature is universal but the values `Hab` are language-specific.
It occurs with 3 different values: `Hab`, `Perf`, `Prog`.
14393 tokens (8%) have a non-empty value of `Aspect`.
4124 types (12%) occur at least once with a non-empty value of `Aspect`.
1129 lemmas (8%) occur at least once with a non-empty value of `Aspect`.
The feature is used with 2 part-of-speech tags: <tt><a href="tr_penn-pos-VERB.html">VERB</a></tt> (14331; 8% instances), <tt><a href="tr_penn-pos-AUX.html">AUX</a></tt> (62; 0% instances).
### `VERB`
14331 <tt><a href="tr_penn-pos-VERB.html">VERB</a></tt> tokens (90% of all `VERB` tokens) have a non-empty value of `Aspect`.
The most frequent other feature values with which `VERB` and `Aspect` co-occurred: <tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt> (14297; 100%), <tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt> (13578; 95%), <tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt> (13287; 93%), <tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt> (12850; 90%), <tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt> (12456; 87%), <tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=EMPTY</tt> (12305; 86%), <tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt> (8045; 56%).
`VERB` tokens may have the following values of `Aspect`:
* `Hab` (1184; 8% of non-empty `Aspect`): <em>olabilir, eder, olursa, edebilir, olur, gerekir, içerir, dayanır, kıyaslanır, sanırım</em>
* `Perf` (9175; 64% of non-empty `Aspect`): <em>söyledi, dedi, oldu, yükseldi, etti, düştü, kapandı, geldi, çıktı, aldı</em>
* `Prog` (3972; 28% of non-empty `Aspect`): <em>ediyor, diyor, söylüyor, bekleniyor, veriyor, gösteriyor, yapıyor, oluyor, düşünüyor, geliyor</em>
* `EMPTY` (1678): <em>ise, sahiptir, vardır, olsa, şirketidir, olsun, biridir, dolardır, nedir, varsa</em>
<table>
<tr><th>Paradigm <i>et</i></th><th><tt>Perf</tt></th><th><tt>Prog</tt></th><th><tt>Hab</tt></th></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=CndGen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>edersem</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=CndGen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>ederse</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=CndGen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td></td><td><em>edilirse</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=CndGen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>ederseniz</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Cnd</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>etmiyorsak</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Cnd</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>ettiyseniz</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Cau</tt></tt></td><td></td><td></td><td><em>ettiremezsin</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilemezdi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>edemez, etmeyebilir</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td></td><td><em>edilemez</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edebilirdi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilebilirdi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>edebilir</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td></td><td><em>edilebilir</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>edebilirsiniz</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>etmeyebilirler</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=GenPot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td></td><td><em>edilebilirler</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>ederim</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>etmez</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td></td><td><em>edilmez</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>eder</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=CauPass</tt></tt></td><td></td><td></td><td><em>ettirilir</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td></td><td><em>edilir</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>edersiniz</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Gen</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td></td><td><em>ederler</em></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmeyeceğim</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmedim</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edeceğim</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>ettim</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>ediyorum</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>ettin</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=2</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>ediyorsun</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilmeyecek</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmedi, etmemişti, etmiyordu</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilmedi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmemiştir</em></td><td><em>etmiyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilmemiştir</em></td><td><em>edilmiyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edecek, edecektir</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilecek, edilecektir</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etti, ediyordu, edecekti, etmişti, ederdi, ediciydi, ETTİ, bulundu</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Cau</tt></tt></td><td><em>ettirdi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edildi, edilmişti, edilecekti, edilirdi, ediliyordu</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Vnoun</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilmeli</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmiştir, etmiş</em></td><td><em>ediyor, etmektedir, etmekte, EDİYOR, ETMEKTEDİR, edecektir, etmesi, ettiriyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Cau</tt></tt></td><td></td><td><em>ettiriyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilmiştir, edilmiş</em></td><td><em>ediliyor, edilmektedir</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>ettiler</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>etmiyoruz</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edeceğiz</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>ettik, ederdik, etmiştik</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>ediyoruz</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmeyecekler</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmediler, etmiyorlardı</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>etmiyorlar</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edecekler</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>ettiler, ediyorlardı, etmektelerdi, etti</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edildiler</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmişler</em></td><td><em>ediyorlar, EDİYORLAR</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td><em>ediliyorlar</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Nec</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>etmeliydi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Nec</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilmeliydi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=1</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edemiyordum</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edemedi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilemedi</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>edemiyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td><em>edilemiyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edebilecek</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Fut</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td><em>edilebilecek</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td></td><td><em>edebiliyor</em></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Neg</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edemediler</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt></tt></td><td><em>edebildiler</em></td><td></td><td></td></tr>
<tr><td><tt><tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Pot</tt>|<tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Plur</tt>|<tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt>|<tt><a href="tr_penn-feat-Polarity.html">Polarity</a></tt><tt>=Pos</tt>|<tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Pres</tt>|<tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt>|<tt><a href="tr_penn-feat-Voice.html">Voice</a></tt><tt>=Pass</tt></tt></td><td></td><td><em>edilebiliyorlar</em></td><td></td></tr>
</table>
### `AUX`
62 <tt><a href="tr_penn-pos-AUX.html">AUX</a></tt> tokens (11% of all `AUX` tokens) have a non-empty value of `Aspect`.
The most frequent other feature values with which `AUX` and `Aspect` co-occurred: <tt><a href="tr_penn-feat-Mood.html">Mood</a></tt><tt>=Ind</tt> (62; 100%), <tt><a href="tr_penn-feat-PronType.html">PronType</a></tt><tt>=EMPTY</tt> (62; 100%), <tt><a href="tr_penn-feat-VerbForm.html">VerbForm</a></tt><tt>=Fin</tt> (62; 100%), <tt><a href="tr_penn-feat-Tense.html">Tense</a></tt><tt>=Past</tt> (61; 98%), <tt><a href="tr_penn-feat-Number.html">Number</a></tt><tt>=Sing</tt> (60; 97%), <tt><a href="tr_penn-feat-Person.html">Person</a></tt><tt>=3</tt> (58; 94%).
`AUX` tokens may have the following values of `Aspect`:
* `Perf` (62; 100% of non-empty `Aspect`): <em>değildi, değillerdi, değildik, değildim, değilmiş</em>
* `EMPTY` (483): <em>değil, değildir, mi, mı, mu, değilim, değiller, değiliz, değilse, mıydı</em>
## Relations with Agreement in `Aspect`
The 10 most frequent relations where parent and child node agree in `Aspect`:
<tt>VERB --[<tt><a href="tr_penn-dep-conj.html">conj</a></tt>]--> VERB</tt> (530; 83%),
<tt>VERB --[<tt><a href="tr_penn-dep-parataxis.html">parataxis</a></tt>]--> VERB</tt> (272; 67%).
| 328.325203 | 658 | 0.631587 | yue_Hant | 0.667788 |
b09f12c9973d78a6e0b14f3e7812233fc6c52b2f | 2,074 | md | Markdown | articles/美丽中国(Teach For China)—你是下一个美丽中国人吗？/post.md | ibeidou/- | eaa99dc0f4daad16bf06ba1c5e0cb14579a8a3ef | [
"MIT"
] | 58 | 2018-05-06T17:41:51.000Z | 2022-03-10T18:12:00.000Z | articles/美丽中国(Teach For China)—你是下一个美丽中国人吗？/post.md | megaxianzhengblog/ibeidou-articles | eaa99dc0f4daad16bf06ba1c5e0cb14579a8a3ef | [
"MIT"
] | null | null | null | articles/美丽中国(Teach For China)—你是下一个美丽中国人吗？/post.md | megaxianzhengblog/ibeidou-articles | eaa99dc0f4daad16bf06ba1c5e0cb14579a8a3ef | [
"MIT"
] | 14 | 2018-05-08T00:58:30.000Z | 2021-06-02T22:00:42.000Z | # 美丽中国(Teach For China)—你是下一个美丽中国人吗？
[](1b774d15-54c3-4b17-bb06-718ac2e13b1d.png)
**一、美丽中国基本介绍**
在当代中国的主要发达城市，将近80%的学生可以进入大学，然而在中国贫困的农村地区，只有5%的优秀学生才能进入大学。这一现实也让消除贫困变得更加困难。一个孩子的出生地往往决定了他的教育前景，从而影响其未来的人生选择。在中国贫困地区，数以千万计的孩子无法接受优质教育，他们所获得的教育资源远不及城市地区的同龄孩子。
在教育资源严重不平衡的背景下,2008年美丽中国(Teach For China)以一个专业化教育非营利组织的身份成立于中国云南。是美国知名教育非营利组织美丽美国（Teach For America）和全球教育支持网络美丽世界（Teach For All）在华唯一官方合作伙伴。
美丽中国每年从中美两国招募优秀青年作为项目老师深入中国教育资源薄弱地区进行为期两年的支教。短期内，项目老师们在帮助学生提高学习成绩的同时，培养学生的思辨能力，良性作用于当地的教育环境。长期来看，美丽中国致力于培养关注教育的未来青年领袖，并从不同领域推动教育资源的均衡发展。这批具有高度社会责任感和实践能力的青年，在未来的职业发展上将继续作用于教育不均现状，推动整体教育环境朝向均衡的轨道发展。
当前，美丽中国在云南西部近中缅边界的五个县以及广东东部汕头市的两个相邻的区里安排了项目老师。2012年秋天，美丽中国向云南和广东教育资源薄弱地区输送200余名项目老师，覆盖50余所学校，影响接近30,000名学生。我们持续不断地努力，希望在将来，每一个中国孩子，无论出身，都能接受到优质教育。
** ** **二、聚焦项目**
**1、****将优秀的教师输送到教师资源匮乏地区：**
**①招募和选拔：**美丽中国从中美招募顶尖大学毕业生成为项目老师。层层选拔具备领导力、克服困难的能力、沟通能力等核心竞争力的青年，加入美丽中国；
**②培训：**美丽中国通过暑期培训，帮助项目老师完成从毕业生到优秀教育者的转变。培训内容涉及教学方法、课堂管理方法、目标设置、当地现状等多个方面，并通过实习试讲，巩固教学能力；
**③安置：**在于当地教育局等政府部门合作的基础上，项目老师们将会被分到资源匮乏的地区进行为期两年的教学工作。每校配备4名左右中美项目老师，共同应对挑战；
**2****、发展一批解决教育资源不均衡而长期奋斗的未来领袖：**
**①支持：**美丽中国有一批持续两年支持项目老师的项目经理，帮助老师们探索促进学生成功的方法。项目经理帮助项目老师制定和跟踪教学成果，涉及学生的学术成就、思辨能力、学习内驱力三方面。同时通过每月召开的职业发展会议，共同探讨解决项目老师们提出的挑战，分享实战经验；
**②长期影响力：**项目老师在教室的两年仅仅是他们对学生们产生深远影响的开端。长远看来，我们会支持项目老师成为中美两国各领域的领导者，并通过共同努力终结中国的教育资源不均。
** **
**三、申请要求******
美丽中国欢迎应届毕业生和有工作经验人士申请成为2014-2016届项目老师。
非应届在校生亦可申请成为校园主管，帮助美丽中国在你所在学校招募到更多的项目老师。
[详情请点击这里](http://www.tfchina.org/zh/shenqingxiangmu/yaoqiu)
** **
申请时间及流程：
[详情请点击这里](http://www.tfchina.org/zh/%E7%94%B3%E8%AF%B7%E9%A1%B9%E7%9B%AE/%E7%94%B3%E8%AF%B7%E6%B5%81%E7%A8%8B)
具体可以关注美丽中国（Teach For China）的官方网站，新浪微博及微信，进行更多的了解
主页：[http://www.tfchina.org/zh](http://www.tfchina.org/zh)
官方微博：[http://weibo.com/teachforchina](http://weibo.com/teachforchina)
官方微信号：meilizhongguo2008
宣传片：[http://www.56.com/u88/v_NzM1NDg2Mjk.html](http://www.56.com/u88/v_NzM1NDg2Mjk.html)
[](20ef3209-e154-4337-a526-8198f82fd8d8.jpg)
** **
（采编：杨添淇 责编：叶声）
| 30.5 | 196 | 0.808582 | yue_Hant | 0.752623 |
b0a14a456e576f2361f308ba283e2f2b66bbb453 | 532 | md | Markdown | experiments/ptb_wikitext/README.md | chandar-lab/CriticalGradientOptimization | 1af4b1df40489991289bb50bb69859a00b2c97c6 | [
"MIT"
] | 1 | 2021-07-12T03:13:39.000Z | 2021-07-12T03:13:39.000Z | experiments/ptb_wikitext/README.md | chandar-lab/CriticalGradientOptimization | 1af4b1df40489991289bb50bb69859a00b2c97c6 | [
"MIT"
] | null | null | null | experiments/ptb_wikitext/README.md | chandar-lab/CriticalGradientOptimization | 1af4b1df40489991289bb50bb69859a00b2c97c6 | [
"MIT"
] | null | null | null | # Download and set up the training directory
A separate download is necessary for the PTB/Wikitext data.
After cloning the repository, create a Dataset directory in your `ptb-wikitext` directory. Code will search this directory by default.
```
cd CriticalGradientOptimization
cd ptb-wikitext
mkdir Dataset
cd Dataset
```
For PTB:
```
wget https://www.dropbox.com/s/rbuoo026sb276dk/ptb.zip
unzip ptb.zip
```
For WikiText:
```
wget https://s3.amazonaws.com/research.metamind.io/wikitext/wikitext-2-v1.zip
unzip ptb.zip
``` | 17.16129 | 134 | 0.761278 | eng_Latn | 0.448739 |
b0a264c1d9d1c0cd8009c2f5ed0d10a4fd5bb9f3 | 3,150 | md | Markdown | AlchemyInsights/troubleshoot-onedrive-crashing.md | isabella232/OfficeDocs-AlchemyInsights-pr.hr-HR | 558012843738ad9ca3fdd26aa6c9f99eb46a16b0 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-05-19T19:06:40.000Z | 2020-05-19T19:06:40.000Z | AlchemyInsights/troubleshoot-onedrive-crashing.md | MicrosoftDocs/OfficeDocs-AlchemyInsights-pr.hr-HR | 82a9de1b7009fd4a1fd9411da08a63cbb1e6c89a | [
"CC-BY-4.0",
"MIT"
] | 4 | 2020-06-02T23:32:03.000Z | 2022-02-09T06:53:04.000Z | AlchemyInsights/troubleshoot-onedrive-crashing.md | isabella232/OfficeDocs-AlchemyInsights-pr.hr-HR | 558012843738ad9ca3fdd26aa6c9f99eb46a16b0 | [
"CC-BY-4.0",
"MIT"
] | 3 | 2019-10-11T19:14:05.000Z | 2021-10-09T10:52:06.000Z | ---
title: Otklanjanje poteškoća OneDrive se ruši
ms.author: pebaum
author: pebaum
manager: scotv
ms.audience: Admin
ms.topic: article
ms.service: o365-administration
ROBOTS: NOINDEX, NOFOLLOW
localization_priority: Priority
ms.collection: Adm_O365
ms.custom:
- "9003084"
- "5885"
ms.openlocfilehash: d5982bafbb8aaa1d240a34c071efe37e92c2ec5c5170dc59337df9a5435e22e1
ms.sourcegitcommit: b5f7da89a650d2915dc652449623c78be6247175
ms.translationtype: MT
ms.contentlocale: hr-HR
ms.lasthandoff: 08/05/2021
ms.locfileid: "53920999"
---
# <a name="troubleshoot-onedrive-crashes"></a>Otklanjanje poteškoća OneDrive se ruši
Ako OneDrive više puta ruši, isprobajte sljedeće korake za otklanjanje poteškoća:
**Provjerite nisu li ključevi registra postavljeni:**
1. Pomoću uređivača registra idite na HKEY_LOCAL_MACHINE\SOFTWARE\Policies\Microsoft\OneDrive
2. Ako je disableFileSyncNGSC prisutan i postavljen na 1, otvorite ključ i promijenite vrijednost u 0.
3. Ručno pokretanje OneDrive pomoću gumba Start , upišite OneDrive u okvir za pretraživanje, a zatim kliknite aplikaciju OneDrive za stolna računala.
**Ponovno OneDrive:**
Napomene:
- Ponovno postavljanje OneDrive prekida sve postojeće veze za sinkronizaciju (uključujući osobne OneDrive ako su postavljene).
- Datoteke i podatke nećete izgubiti tako da ih ponovno OneDrive na računalu.
**Da biste ponovno OneDrive:**
1. Otvorite dijaloški okvir Pokreni tako da pritisnete Windows tipku i R.
2. Upišite %localappdata%\Microsoft\OneDrive\onedrive.exe /reset pa pritisnite U redu. Nakratko se može pojaviti prozor Naredbe.
3. Ručno pokretanje OneDrive pomoću gumba Start , upišite OneDrive u okvir za pretraživanje, a zatim kliknite aplikaciju OneDrive za stolna računala.
Napomene:
- Ako ste prije vraćanja na izvorno odabrali sinkronizaciju samo nekih mapa, morat ćete to ponoviti kada se sinkronizacija dovrši. Dodatne [informacije potražite u OneDrive odaberite koje mape](https://support.office.com/article/98b8b011-8b94-419b-aa95-a14ff2415e85)želite sinkronizirati s računalom.
- To ćete morati dovršiti za osobnu OneDrive i OneDrive za tvrtke. | 65.625 | 670 | 0.85873 | hrv_Latn | 0.637432 |
b0a280c1e9536e2156016708d9e55f8ca330eb71 | 5,895 | md | Markdown | _posts/DV/iOS/2021-06-11-iOS-BoostCourse-01-Asset-xcode.md | wansook0316/wansook.github.io | 9a5c2cb84d7a9d64f7dfc7e9d4110d4e5af67efb | [
"MIT"
] | null | null | null | _posts/DV/iOS/2021-06-11-iOS-BoostCourse-01-Asset-xcode.md | wansook0316/wansook.github.io | 9a5c2cb84d7a9d64f7dfc7e9d4110d4e5af67efb | [
"MIT"
] | null | null | null | _posts/DV/iOS/2021-06-11-iOS-BoostCourse-01-Asset-xcode.md | wansook0316/wansook.github.io | 9a5c2cb84d7a9d64f7dfc7e9d4110d4e5af67efb | [
"MIT"
] | null | null | null | ---
layout: post
title: "01: Asset, App thinning"
category: "DV/iOS"
comments: true
tags: [iOS, "단축키", "Asset", "App thinning"]
feature-img: "assets/img/79.jpg"
feature-title: ""
use_math: true
series: "iOS BoostCourse"
summary: "음원 재생기를 제작해보자."
---
{: .center}_project sample_
# 배울 내용
* Xcode 사용법
* 프로젝트 생성 및 코드작성
* 인터페이스 빌더를 활용한 UI 구성
* 유용한 단축키
* UIKit 요소
* UILabel
* UIButton
* UISlider
* 프레임워크
* UIKit
* AVFoundation
* 기술요소
* Auto Layout
* Design Pattern
* Model-View-Controller Pattern
* 기타 개념
* IBOutlet, IBAction
* Assets
* Bundle
* Timer
# 단축키
* command + 0 : 네비게이터 영역 접기
* option + command + 0 : 유틸리티 영역 접기
* command 1~9 : 네이게이터 바의 영역 이동
* option click : 도움말
* command + shift + o : 빠르게 파일 찾아서 열기
* option 키 누르고 선택 : 새창 열기
# Target
{: .center}_하나의 프로젝트에 다수의 타겟이 있을 수 있다._
여기서 대상(Target)이란 iOS, macOS, tvOS, watchOS를 위한 애플리케이션과 같이 빌드할 제품을 말한다.
# Scheme
앱을 구동하기 전에, 어떤 타겟에 대한 환경을 설정할 것인지 정해줘야 한다. 위에서 말했듯 하나의 프롲게트에는 여러개의 Target이 존재할 수 있기 때문에, 각각의 target은 다른 환경 설정을 가질 수 있다. 그렇기 때문에 실제 앱이 구동되는 것을 보기 위해서는 내가 원하는 타겟과, 그에 맞는 설정파일(Scheme)을 선택해주어야 한다.
{: .center-verysmall}
{: .center-verysmall}_Scheme과 Target simulator_
이렇게 실행할 기기를 선택할 수 있다. 시뮬레이터를 사용하면 무료이지만, 기기에서 테스트를 무료로 하려면 일주일에 한번 빌드해줘야 한다. 유료는 그런 걱정이 없다.
WatchOS를 사용했다면 동시에 뜨는 시뮬레이터를 실행시킬 수 있다.
{: .center-small}
# 에셋 카탈로그
{: .center}_Assets description_
용어를 잘 알아두도록 하자. 카탈로그라는 말이 어색하다.
{: .center}_Asset variations_
위에서 App icon을 눌렀을 떄 나오는 화면이다. 각각의 device간에 들어갈 asset이 달라진다.
{: .center}_Asset 카탈로그의 컨텐츠_
에셋 카탈로그의 **콘텐츠**는 3가지 타입이다.
* Folders : 에셋 카탈로그 폴더아래에 그룹 폴더나 에셋 폴더를 가질 수 있다. 보통은 확장자가 폴더에 붙지 않지만 에셋 카탈로그 폴더의 경우 위와 같이 특정 에셋 타입의 확장자가 자동으로 붙는다.
* Json files : 속성에 대한 정보를 갖는다.
* contents files : 콘텐츠 파일은 리소스 파일을 말한다.
아직 이해가 어려우니 나중에 실습을 하면서 이해하자.
{: .center}_에셋 카탈로그의 구조_
구조는 다음과 같다.
* 에셋 카탈로그 폴더 : 에셋 카탈로그 폴더 안에 모든 폴더와 파일을 가지고 있다.
* 그룹 폴더 : 그룹 폴더는 다른 그룹 폴더나 에셋 폴더를 갖고 있다.
* 에셋 폴더 : 리소스 파일을 가지고 있다.
### 에셋 카탈로그의 타입
|폴더 타입 | 확장자 | 설명
|:-:|:-:|:-:|
|App Icon Type|.appiconset|애플리케이션의 아이콘 입니다.|
|Catalog Type|.xcassets|에셋 카탈로그의 최상위 폴더입니다.|
|Image Set Type|.imageset|객체들이 사용하는 이미지입니다.|
|Data Set Type|.dataset|애플리케이션에서 사용되는 데이터 파일입니다.|
|Launch Image Type|.launchimage|애플리케이션의 실행화면 이미지입니다.|
# App Thinning
* 애플리케이션이 디바이스에 설치될 때, 앱스토어와 운영체제가 그 디바이스의 특성에 맞게 설치하도록 하는 설치 최적화 기술을 의미한다.
* 설치 용량 최소화, 다운로드 속도 향상
* 이 기술의 구성 요소는 슬라이싱, 비트코드, On demand resource가 있다.
# Slicing
{: .center}_slicing 매커니즘_
* 애플리케이션이 지원하는 다양한 디바이스에 대한 여러 조각의 애플리케이션 번들을 생성하고, 디바이스에 알맞는 조각을 전달하는 기술이다.
* 개발자가 애플리케이션 전체 버전을 ITunes Connect에 업로드하면, 앱스토어에서 각 디바이스 특성에 맞는 다양한 버전의 조각들을 생성한다.
* 사용자가 이제 애플리케이션을 설치할 때, 이 슬라이싱 된 조각들중 디바이스에 가장 적합한 조각을 다운로드한다.
# IBOutlet 변수 이름 바꾸기
1. 해당 변수 클릭
2. 오른쪽 클릭
3. Refactor
4. Rename
# IBAction 이해
* UIKit
* UIControl
* UIButton
* UISwitch
* UIStepper
* etc
이렇게 다양한 UIControl 객체를 상속받은 클래스들이 있다. 이 컨트롤 객체에서 발생한 이벤트를 내가 정의한 함수를 콜하게 할 수 있다. 즉 컨트롤 객체에서 이벤트가 발생할 경우, 내가 지정해둔 액션을 호출할 수 있게 할 수 있다는 것.
## 이벤트의 종류
외울 수는 없지만 한번씩 읽어보자. 나중에 찾아보고.
* touchDown
* 컨트롤을 터치했을 때 발생하는 이벤트
* UIControl.Event.touchDown*
* touchDownRepeat
* 컨트롤을 연속 터치 할 때 발생하는 이벤트
* UIControl.Event.touchDownRepeat*
* touchDragInside
* 컨트롤 범위 내에서 터치한 영역을 드래그 할 때 발생하는 이벤트
* UIControl.Event.touchDragInside*
* touchDragOutside
* 터치 영역이 컨트롤의 바깥쪽에서 드래그 할 때 발생하는 이벤트
* UIControl.Event.touchDragOutside*
* touchDragEnter
* 터치 영역이 컨트롤의 일정 영역 바깥쪽으로 나갔다가 다시 들어왔을 때 발생하는 이벤트
* UIControl.Event.touchDragEnter*
* touchDragExit
* 터치 영역이 컨트롤의 일정 영역 바깥쪽으로 나갔을 때 발생하는 이벤트
* UIControl.Event.touchDragExit*
* touchUpInside
* 컨트롤 영역 안쪽에서 터치 후 뗐을때 발생하는 이벤트
* UIControl.Event.touchUpInside*
* touchUpOutside
* 컨트롤 영역 안쪽에서 터치 후 컨트롤 밖에서 뗐을때 이벤트
* UIControl.Event.touchUpOutside*
* touchCancel
* 터치를 취소하는 이벤트 (touchUp 이벤트가 발생되지 않음)
* UIControl.Event.touchCancel*
* valueChanged
* 터치를 드래그 및 다른 방법으로 조작하여 값이 변경되었을때 발생하는 이벤트
* UIControl.Event.valueChanged*
* primaryActionTriggered
* 버튼이 눌릴때 발생하는 이벤트 (iOS보다는 tvOS에서 사용)
* UIControl.Event.primaryActionTriggered*
* editingDidBegin
* UITextField에서 편집이 시작될 때 호출되는 이벤트
* UIControl.Event.editingDidBegin*
* editingChanged
* UITextField에서 값이 바뀔 때마다 호출되는 이벤트
* UIControl.Event.editingChanged*
* editingDidEnd
* UITextField에서 외부객체와의 상호작용으로 인해 편집이 종료되었을 때 발생하는 이벤트
* UIControl.Event.editingDidEnd*
* editingDidEndOnExit
* UITextField의 편집상태에서 키보드의 return 키를 터치했을 때 발생하는 이벤트
* UIControl.Event.editingDidEndOnExit*
* allTouchEvents
* 모든 터치 이벤트
* UIControl.Event.allTouchEvents*
* allEditingEvents
* UITextField에서 편집작업의 이벤트
* UIControl.Event.allEditingEvents*
* applicationReserved
* 각각의 애플리케이션에서 프로그래머가 임의로 지정할 수 있는 이벤트 값의 범위
* UIControl.Event.applicationReserved*
* systemReserved
* 프레임워크 내에서 사용하는 예약된 이벤트 값의 범위
* UIControl.Event.systemReserved*
* allEvents
* 시스템 이벤트를 포함한 모든 이벤트
* UIControl.Event.allEvents | 24.665272 | 192 | 0.733164 | kor_Hang | 1.000007 |
b0a2df2c2e75492a390358b8be6da181440d751e | 116 | md | Markdown | docs/api/types/ObsidianProtocolHandler.md | TfTHacker/obsidian-plugin-docs | d98c714fc06125f1677076fefe7e8aa5d6c47ce7 | [
"Apache-2.0"
] | 41 | 2021-09-22T21:21:57.000Z | 2022-03-28T07:54:26.000Z | docs/api/types/ObsidianProtocolHandler.md | TfTHacker/obsidian-plugin-docs | d98c714fc06125f1677076fefe7e8aa5d6c47ce7 | [
"Apache-2.0"
] | 21 | 2021-09-25T22:49:26.000Z | 2022-03-26T06:48:44.000Z | docs/api/types/ObsidianProtocolHandler.md | TfTHacker/obsidian-plugin-docs | d98c714fc06125f1677076fefe7e8aa5d6c47ce7 | [
"Apache-2.0"
] | 15 | 2021-09-25T18:37:45.000Z | 2022-03-24T16:39:17.000Z | # ObsidianProtocolHandler
```ts
export type ObsidianProtocolHandler = (params: ObsidianProtocolData) => any;
```
| 14.5 | 76 | 0.75 | kor_Hang | 0.474623 |
b0a3ed54d746ccec4d5491ad06dfc04dd6ee7521 | 1,249 | md | Markdown | README.md | 24i/vigour_brisky-is-plain-obj | 912688c54a4b0d81d629743f8628cdb5d633f92b | [
"0BSD"
] | null | null | null | README.md | 24i/vigour_brisky-is-plain-obj | 912688c54a4b0d81d629743f8628cdb5d633f92b | [
"0BSD"
] | 1 | 2016-10-12T15:06:43.000Z | 2016-10-12T15:06:43.000Z | README.md | vigour-io/brisky-is-plain-obj | 912688c54a4b0d81d629743f8628cdb5d633f92b | [
"0BSD"
] | null | null | null | # brisky-is-plain-obj
<!-- VDOC.badges travis; standard; npm; coveralls -->
<!-- DON'T EDIT THIS SECTION (including comments), INSTEAD RE-RUN `vdoc` TO UPDATE -->
[](https://travis-ci.org/vigour-io/brisky-is-plain-obj)
[](http://standardjs.com/)
[](https://badge.fury.io/js/brisky-is-plain-obj)
[](https://coveralls.io/github/vigour-io/brisky-is-plain-obj?branch=master)
<!-- VDOC END -->
<!-- VDOC.jsdoc isPlain -->
<!-- DON'T EDIT THIS SECTION (including comments), INSTEAD RE-RUN `vdoc` TO UPDATE -->
#### var plain = isPlain(obj)
Checks whether an object is a plain object (excludes streams, buffers, vigour-base objects and null)
- **obj** (*object*) - the object to check
- **returns** (*boolean*) plain - `true` if *obj* is a plain object, `false` otherwise
<!-- VDOC END -->
```javascript
const isPlain = require('brisky-is-plain-obj')
isPlain({}) // true
isPlain(new Base({})) // false
``` | 48.038462 | 182 | 0.69976 | yue_Hant | 0.500957 |
b0a45a161531319236bfd32b844ce1a3a094c2a0 | 1,160 | md | Markdown | README.md | athiththan11/JIT-Role-Provisioning-Handler | 9ded3a2397d3699cc9f4aa5f14f4c15ea844fed3 | [
"Apache-2.0"
] | null | null | null | README.md | athiththan11/JIT-Role-Provisioning-Handler | 9ded3a2397d3699cc9f4aa5f14f4c15ea844fed3 | [
"Apache-2.0"
] | null | null | null | README.md | athiththan11/JIT-Role-Provisioning-Handler | 9ded3a2397d3699cc9f4aa5f14f4c15ea844fed3 | [
"Apache-2.0"
] | null | null | null | # JIT Role Provisioning Handler
This repo contains a custom Provisioning Handler to assign roles to users in WSO2 during JIT provisioning.
> This branch contains the implementation for API Manager v3.2.0. You can clone this repo and build the same for other versions with correct dependencies.
## Use Case
This handler can be used to assign roles for federated users who are provisioned from external sources. When the configured external IDP is not sending any Role / Group information in the SAML response or in the OIDC token, we can use this handler to conditionaly assign the required roles to the users to provide access to the Portals.
## Build & Deploy
### Build
Execute the following command to build the project
```sh
mvn clean install
```
### Deploy & Configure
- Copy the built JAR artifact from `/target` directory to `<APIM_HOME>/repository/components/lib` directory
- Edit the `<APIM_HOME>/repository/conf/deployment.toml` and add the following
```toml
[authentication.framework.extensions]
provisioning_handler = "com.sample.handlers.JITRoleProvisioningHandler"
```
- Restart the server
## License
[Apache-2.0](LICENSE)
| 32.222222 | 336 | 0.773276 | eng_Latn | 0.992948 |
b0a621b93d898871fcc937cda530803e483ee993 | 126 | md | Markdown | README.md | ronaldobribeiro/Estudo | cb47f3399c6657f0f982e162bfcd8c6fdc469232 | [
"MIT"
] | null | null | null | README.md | ronaldobribeiro/Estudo | cb47f3399c6657f0f982e162bfcd8c6fdc469232 | [
"MIT"
] | null | null | null | README.md | ronaldobribeiro/Estudo | cb47f3399c6657f0f982e162bfcd8c6fdc469232 | [
"MIT"
] | null | null | null | # Estudo em Git e GitHub
Repositório de estudo.
Criado durante aula com Curso em Vídeo.
Inserido uma linha remotamente.
| 18 | 40 | 0.761905 | por_Latn | 1.000009 |
b0a64b618a6a827ed2a9a9d74352141850e3731d | 48 | md | Markdown | README.md | samkeym/legibra | 1d1d66254cc954ab1101b4d1d8ea37fee788684d | [
"BSD-3-Clause"
] | null | null | null | README.md | samkeym/legibra | 1d1d66254cc954ab1101b4d1d8ea37fee788684d | [
"BSD-3-Clause"
] | null | null | null | README.md | samkeym/legibra | 1d1d66254cc954ab1101b4d1d8ea37fee788684d | [
"BSD-3-Clause"
] | null | null | null | A sample code for a hospital management system.
| 24 | 47 | 0.8125 | eng_Latn | 0.998766 |
b0a837bd8d65f1651cd96498d124aca29250996a | 3,426 | md | Markdown | published/202204/20220420 Nushell- Cross-platform Shell That Gives You More Clarity on Error Messages.md | hwlife/TranslateProject | 1f4292dc0f735a54a240f9eb3e1bd10f2cf70424 | [
"Apache-2.0"
] | null | null | null | published/202204/20220420 Nushell- Cross-platform Shell That Gives You More Clarity on Error Messages.md | hwlife/TranslateProject | 1f4292dc0f735a54a240f9eb3e1bd10f2cf70424 | [
"Apache-2.0"
] | 1 | 2020-02-03T14:45:50.000Z | 2020-02-03T14:45:50.000Z | published/202204/20220420 Nushell- Cross-platform Shell That Gives You More Clarity on Error Messages.md | hwlife/TranslateProject | 1f4292dc0f735a54a240f9eb3e1bd10f2cf70424 | [
"Apache-2.0"
] | null | null | null | [#]: subject: "Nushell: Cross-platform Shell That Gives You More Clarity on Error Messages"
[#]: via: "https://itsfoss.com/nushell/"
[#]: author: "Marco Carmona https://itsfoss.com/author/marco/"
[#]: collector: "lujun9972"
[#]: translator: "geekpi"
[#]: reviewer: "wxy"
[#]: publisher: "wxy"
[#]: url: "https://linux.cn/article-14526-1.html"
Nushell： 一个让你更清楚地了解错误信息的跨平台 Shell
======
> Nushell 是一个独特的 Shell，它提供易于阅读的错误信息，以及跨平台支持。在这里可以了解到更多关于它的信息。
即使你对使用终端不感兴趣，Linux 终端也常常使一些繁重的工作变得更加轻松，以及可以让你修复一些东西。因此，可以说，如果你知道自己在做什么，Linux 终端是相当强大的。
这也是事实！但是当你看到一些错误消息就表明出现问题了。如果你没有足够的使用经验，可能不知道如何解决它。
虽然这些错误信息试图向你传达该问题的最佳含义，但不是每个用户都能轻易理解该如何修复。对于初学者来说，这通常需要进行一些研究。但是，如果错误能更清晰一些，用户就能更快地解决它。
不仅仅限于错误信息，例如，你在终端浏览文件时看到的输出结构，也不是最漂亮的。
![Terminal listing several files][1]
**你明白我的意思吗？** 当然，当你有更多不同类型的文件时，这可能变得更加复杂。而且，你无法从基本的 `ls` 命令的输出中了解到文件的权限、组等。
这就是 Nushell 试图解决的问题。
### Nushell：一个默认提供用户友好输出的 Shell
![Nushell example screenshot][2]
Nushell 也被称为 Nu，它的理念和灵感来自于 [PowerShell][3]、函数式编程语言和现代 [CLI][4] 工具等项目。
让我给你举个例子，想象一下你只想让你的输出列出你的主目录内类型为文件的项目，包括隐藏文件。那么，要实现这一点，只要输入下面的命令就可以了：
```
ls -a | where type == 'file'
```
![Listing only files with Nushell][5]
观察一下，它的语法是多么清晰和简单。现在想象一下，用 Nushell 查找进程和名称 ID、它的状态，以及 CPU 或内存消耗是多么容易。**这是它魔法的一部分！**
它会尽力以专门组织的方式为你输入的命令提供适合用户的输出。
### Nushell 的特点
![Error messages in Nu, one of its primary highlights][6]
根据现有的官方信息，它的一些最受欢迎的功能包括：
* **任何操作系统都通过管道进行控制。** Nu 可以在 Linux、macOS 和 Windows 上工作。换句话说，作为一个灵活的跨平台 shell，具有现代感。
* **一切都是数据。** Nu 管道使用结构化数据，所以你可以安全地选择、过滤和排序，每次都是同样的方式。
* **强大的插件。** 使用强大的插件系统，很容易扩展 Nu 的功能。
* **易于阅读的错误信息。** Nu 操作的是类型化的数据，所以它可以捕捉到其他 shell 所没有的错误。当错误发生时，Nu 会告诉你确切的位置和原因。
* 清晰的 IDE 支持。
你可以看看它的 [官方文档][7]，以全面了解它的功能和用法。
### 在你的系统中安装 Nushell
不幸的是，如果你是一个像我一样的 Ubuntu 用户，你将找不到安装 Nushell 的 APT 仓库。但是，你可以按照它在 [GitHub][8] 上的说明，通过安装所需的依赖项来构建它。
幸运的是，有一种方法可以在任何发行版上安装它，即使用 Homebrew。到它的官方网站去了解更多的安装选项。
> **[Nushell][9]**
你可以参考我们关于 [在 Linux 上安装和使用 Homebrew 包管理器][10] 的教程。当你在 Linux 上成功设置了它，你需要输入以下命令来安装 Nushell：
```
brew install nushell
```
![Installing nushell with Homebrew][11]
当这个过程完成后，只要输入 `nu` 就可以启动 Nushell shell。**这就完成了！**
> 如果你想把 Nushell 设置为你的默认 shell，你可以用命令 `chsh` 来做，但是记住，它仍然在开发阶段，这就是为什么我们不推荐它用于日常使用。
然而，在你决定尝试之前，你可以在其网站或 [GitHub 页面][8] 上了解关于它的更多信息。
你对这个有趣的 shell 什么看法？请在下面的评论中告诉我你的想法。
--------------------------------------------------------------------------------
via: https://itsfoss.com/nushell/
作者：[Marco Carmona][a]
选题：[lujun9972][b]
译者：[geekpi](https://github.com/geekpi)
校对：[wxy](https://github.com/wxy)
本文由 [LCTT](https://github.com/LCTT/TranslateProject) 原创编译，[Linux中国](https://linux.cn/) 荣誉推出
[a]: https://itsfoss.com/author/marco/
[b]: https://github.com/lujun9972
[1]: https://itsfoss.com/wp-content/uploads/2022/04/Terminal-with-several-files-800x477.png
[2]: https://itsfoss.com/wp-content/uploads/2022/04/Nushell-example-800x475.jpg
[3]: https://itsfoss.com/microsoft-open-sources-powershell/
[4]: https://itsfoss.com/gui-cli-tui/
[5]: https://itsfoss.com/wp-content/uploads/2022/04/Listing-only-files-with-nushell-800x246.png
[6]: https://itsfoss.com/wp-content/uploads/2022/04/Error-messages-in-Nu-800x259.png
[7]: https://www.nushell.sh/book/
[8]: https://github.com/nushell/nushell
[9]: https://www.nushell.sh/
[10]: https://itsfoss.com/homebrew-linux/
[11]: https://itsfoss.com/wp-content/uploads/2022/04/Installing-nushell-with-brew-800x470.png
| 30.864865 | 95 | 0.731757 | yue_Hant | 0.941914 |
b0a940261a0f9be16170aeb52128ab5e4c3eadef | 1,702 | md | Markdown | _publications/2021-04-07-paper-title-number-2.md | yiw0104/yiw0104.github.io | 36278167e7ad2241eabc12bae768ccb4471e9929 | [
"MIT"
] | null | null | null | _publications/2021-04-07-paper-title-number-2.md | yiw0104/yiw0104.github.io | 36278167e7ad2241eabc12bae768ccb4471e9929 | [
"MIT"
] | null | null | null | _publications/2021-04-07-paper-title-number-2.md | yiw0104/yiw0104.github.io | 36278167e7ad2241eabc12bae768ccb4471e9929 | [
"MIT"
] | null | null | null | ---
title: "No Place in the City: The Segregation of Affordable Formal Private Rentals in Beijing"
collection: publications
permalink: /publication/2021-04-07-paper-title-number-2
excerpt: '[https://doi.org/10.1080/10511482.2020.1858925](https://doi.org/10.1080/10511482.2020.1858925)'
date: 2021-04-07
venue: 'Housing Policy Debate'
paperurl:
citation:
---
Residential segregation by income has become an emerging concern in Chinese cities. Existing literature on residential segregation has mostly focused on the informal rental market, and little is known about the formal private rentals. Nevertheless, with the continued removal of informal settlements, formal private rentals are likely to play a more pivotal role in the provision of affordable housing in the upcoming years. Using data from online rental listings, this article examines changes in the spatial distribution of affordable formal private rentals in Beijing between 2015 and 2018. Our study finds that the availability of affordable formal private rentals decreased drastically in the central city area in the 3-year period, whereas the remaining affordable units in the central-city subdistricts became increasingly segregated from other higher priced rentals. When compared across rentals of different price ranges, the affordable rentals ended up being the most segregated in both 2015 and 2018, with a city-level index of dissimilarity of 0.71 and 0.75, respectively. The research findings necessitate policies that promote affordable rental provision in central locations.
[Download paper here](https://yiw0104.github.io/files/No_Place_in_the_City.pdf)
[Download data here](https://conservancy.umn.edu/handle/11299/219254) | 113.466667 | 1,190 | 0.817861 | eng_Latn | 0.995818 |
b0a94c9f5bec3491648d09dc6e7133376caa81bf | 27 | md | Markdown | README.md | tiagofoks/tiagofoks.github.io | 78f3b5389ba54e8a84b07f764630a2c4d90d799b | [
"CC0-1.0"
] | null | null | null | README.md | tiagofoks/tiagofoks.github.io | 78f3b5389ba54e8a84b07f764630a2c4d90d799b | [
"CC0-1.0"
] | null | null | null | README.md | tiagofoks/tiagofoks.github.io | 78f3b5389ba54e8a84b07f764630a2c4d90d799b | [
"CC0-1.0"
] | null | null | null | A little magazine about me
| 13.5 | 26 | 0.814815 | eng_Latn | 0.999486 |
b0aba9385a4d1638c9efcf3b09d363d6225ccdeb | 1,082 | md | Markdown | google_cloud_platform/en/how_to/6-activate_cloud_shell_terminal.md | aimldl/skills | 621876d0091fe74d9eca8ef996e03d8d92d6cef6 | [
"MIT"
] | 1 | 2021-11-15T10:42:29.000Z | 2021-11-15T10:42:29.000Z | google_cloud_platform/en/how_to/6-activate_cloud_shell_terminal.md | aimldl/skills | 621876d0091fe74d9eca8ef996e03d8d92d6cef6 | [
"MIT"
] | null | null | null | google_cloud_platform/en/how_to/6-activate_cloud_shell_terminal.md | aimldl/skills | 621876d0091fe74d9eca8ef996e03d8d92d6cef6 | [
"MIT"
] | null | null | null | * Draft: 2021-05-17 (Mon)
# How to Activate Cloud Shell
## Overview
Cloud shell
* is a handy alternative way to the GCP SDK if you prefer using the command line interface (CLI).
* lets you manage your GCP infrastructure and applications
* from the command line
* in any web browser.
* without installing the SDK on your local machine.
* comes with
* a small persistent disk and
* the basic software such as
* GCP SDK
* Git
* Python
* and more
## Activating the cloud shell
Step 1. Go to the GCP console.
Step 2. Find the `Activate Cloud Shell` icon on the top right corner of the console home.
<img src="images/gcp-console-home-activate_cloud_shell.png">
Step 3. Click the icon and the following message pops up.
<img src="images/gcp-console-home-activate_cloud_shell-cloud_shell_window.png">
Step 4. Click `Continue`.
And the cloud shell terminal shows up on the bottom of the console home.
<img src="images/gcp-console-home-with_cloud_shell_terminal.png">
Step 5. Use the terminal.
<img src="images/gcp-console-cloud_shell_terminal.png"> | 25.761905 | 98 | 0.739372 | eng_Latn | 0.954244 |
b0aca2b2a48dd7fba7eed47e7c9d589a9a4d1625 | 16 | md | Markdown | README.md | osa1/typed-timeout | aab1a9a38a00345618d61beaaa95f36910289473 | [
"BSD-3-Clause"
] | 4 | 2017-06-23T00:48:37.000Z | 2017-06-23T19:23:49.000Z | README.md | osa1/typed-timeout | aab1a9a38a00345618d61beaaa95f36910289473 | [
"BSD-3-Clause"
] | null | null | null | README.md | osa1/typed-timeout | aab1a9a38a00345618d61beaaa95f36910289473 | [
"BSD-3-Clause"
] | null | null | null | # typed-timeout
| 8 | 15 | 0.75 | eng_Latn | 0.918716 |
b0ae3f6b9566fd53492105e51dba3b1bfb548186 | 729 | md | Markdown | README.md | maronfranc/useful-regex-list | c9781b84be2ba435d34cf1dd354d3d2f83073b11 | [
"MIT"
] | null | null | null | README.md | maronfranc/useful-regex-list | c9781b84be2ba435d34cf1dd354d3d2f83073b11 | [
"MIT"
] | null | null | null | README.md | maronfranc/useful-regex-list | c9781b84be2ba435d34cf1dd354d3d2f83073b11 | [
"MIT"
] | null | null | null | # utils-regex-list
Useful regex list to use as a reference.
## Date: [*DD-MM-YYYY*](date-dd-mm-yyyy.md)
```re
/^(?:\d+(\/|-|\.))(?:(?:(?:0?[13578]|1[02])(?:\1)31)|(?:(?:0?[13-9]|1[0-2])\1(?:29|30)))$|^(?:(?:(?:(?:\d{2})?(?:0[48]|[2468][048]|[13579][26])|(?:(?:[12468][048]|[13579][26])00)))(\/|-|\.)(?:0?2\2)29)$|^(?:\d+)(\/|-|\.)(?:(?:0?[1-9])|(?:1[0-2]))\3(?:0?[1-9]|1\d|2[0-8])$/
```
## Date: [*YYYY-MM-DD*](date-yyyy-mm-dd.md)
```re
/^(?:(?:[1-9]\d*)(\/|-|\.))(?:(?:(?:0?[13578]|1[02])(?:\1)31)|(?:(?:0?[13-9]|1[0-2])\1(?:29|30)))$|^(?:(?:(?:[1-9]\d*)?(?:0[48]|[2468][048]|[13579][26])|(?:(?:[12468][048]|[13579][26])00))(\/|-|\.)(?:0?2\2)29)$|^(?:[1-9]\d*)(\/|-|\.)(?:(?:0?[1-9])|(?:1[0-2]))\3(?:0?[1-9]|1\d|2[0-8])$/
```
| 56.076923 | 285 | 0.371742 | yue_Hant | 0.032034 |
b0af4e6153f104ad2bdd3b1da9b3d8359bb290db | 661 | md | Markdown | content/workshop-studio-training/TrainingBYOC/_index.md | Amirnateghi1/aws-sagemaker-workshop | d52b96e83903fcb98b172ef0bdf4d7d8b809e2bf | [
"MIT-0"
] | 1 | 2020-05-06T05:34:32.000Z | 2020-05-06T05:34:32.000Z | content/.workshop-studio-training/TrainingBYOC/_index.md | w601sxs/aws-sagemaker-workshop | f9150853ccf95a3a6d621361097ad6aaf519a5f2 | [
"MIT-0"
] | 4 | 2020-04-24T18:50:25.000Z | 2022-01-06T19:47:09.000Z | content/workshop-studio-training/TrainingBYOC/_index.md | Amirnateghi1/aws-sagemaker-workshop | d52b96e83903fcb98b172ef0bdf4d7d8b809e2bf | [
"MIT-0"
] | 11 | 2020-04-24T18:42:38.000Z | 2020-12-09T23:22:46.000Z | +++
title = "Training with your own container"
date = 2020-04-27T08:16:25-06:00
weight = 300
chapter = true
type = "mylayout"
+++
### Training with SageMaker Studio
* Use an algorithm provided by Amazon SageMaker
* Submit custom code to train with deep learning frameworks
* __Use your own custom algorithms (your own container)__
* Use Apache Spark with Amazon SageMaker
* Use an algorithm that you subscribe to from AWS Marketplace
### Use your own custom algorithms (Your own container)
In this section, you will learn how to package custom code into a Docker image, and then use the custom Docker image for SageMaker Training and Hyperparameter Tuning.
| 33.05 | 166 | 0.771558 | eng_Latn | 0.985224 |
b0b061195fa4eb7c2a00b84047645b37a064314b | 3,127 | md | Markdown | README.md | PhongHuynh93/easypermissions-master | a3eae865576a25da8334ed935bc84188de8efd4e | [
"Apache-2.0"
] | null | null | null | README.md | PhongHuynh93/easypermissions-master | a3eae865576a25da8334ed935bc84188de8efd4e | [
"Apache-2.0"
] | null | null | null | README.md | PhongHuynh93/easypermissions-master | a3eae865576a25da8334ed935bc84188de8efd4e | [
"Apache-2.0"
] | null | null | null | # EasyPermissions
EasyPermissions is a wrapper library to simplify basic system permissions logic when targeting
Android M or higher.
## Installation
EasyPermissions is installed by adding the following dependency to your `build.gradle` file:
```
dependencies {
compile 'pub.devrel:easypermissions:0.1.4'
}
```
## Usage
### Basic
To begin using EasyPermissions, have your Activity (or Fragment) implement the
`EasyPermissions.PermissionCallbacks` and override the following methods:
```java
public class MainActivity extends AppCompatActivity
implements EasyPermissions.PermissionCallbacks {
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_main);
}
@Override
public void onRequestPermissionsResult(int requestCode, String[] permissions, int[] grantResults) {
super.onRequestPermissionsResult(requestCode, permissions, grantResults);
// Forward results to EasyPermissions
EasyPermissions.onRequestPermissionsResult(requestCode, permissions, grantResults, this);
}
@Override
public void onPermissionsGranted(List<String> list) {
// Some permissions have been granted
// ...
}
@Override
public void onPermissionsDenied(List<String> list) {
// Some permissions have been denied
// ...
}
}
```
### Request Permissions
The example below shows how to request permissions for a method that requires both
`CAMERA` and `CHANGE_WIFI_STATE` permissions. There are a few things to note:
* Using `EasyPermissions#hasPermissions(...)` to check if the app already has the
required permissions. This method can take any number of permissions as its final
argument.
* Requesting permissions with `EasyPermissions#requestPermissions`. This method
will request the system permissions and show the rationale string provided if
necessary. The request code provided should be unique to this request, and the method
can take any number of permissions as its final argument.
* Use of the `AfterPermissionGranted` annotation. This is optional, but provided for
convenience. If all of the permissions in a given request are granted, any methods
annotated with the proper request code will be executed. This is to simplify the common
flow of needing to run the requesting method after all of its permissions have been granted.
This can also be achieved by adding logic on the `onPermissionsGranted` callback.
```java
@AfterPermissionGranted(RC_CAMERA_AND_WIFI)
private void methodRequiresTwoPermission() {
String[] perms = {Manifest.permission.CAMERA, Manifest.permission.CHANGE_WIFI_STATE};
if (EasyPermissions.hasPermissions(this, perms)) {
// Already have permission, do the thing
// ...
} else {
// Do not have permissions, request them now
EasyPermissions.requestPermissions(this, getString(R.string.camera_and_wifi_rationale),
RC_CAMERA_AND_WIFI, perms);
}
}
```
| 35.942529 | 103 | 0.727854 | eng_Latn | 0.953591 |
b0b0ce3d96e4e2cd8f22d1ceb3b2517e63e52c8f | 9,098 | md | Markdown | texts/data_science/lecture_07_exploratory_analysis.md | karolgornicki/Articles | c6d1f794e259c974a5f77d1600af95f3a6981ac9 | [
"MIT"
] | null | null | null | texts/data_science/lecture_07_exploratory_analysis.md | karolgornicki/Articles | c6d1f794e259c974a5f77d1600af95f3a6981ac9 | [
"MIT"
] | null | null | null | texts/data_science/lecture_07_exploratory_analysis.md | karolgornicki/Articles | c6d1f794e259c974a5f77d1600af95f3a6981ac9 | [
"MIT"
] | null | null | null | # Lecture 7: Exploratory analysis
## 1. Introduction
R allows us to plot data on a single, or multiple charts at the same time. There are few techniques how we can create our plots. Basically, R works in a way that first you initialize your plot, and next you append additional information to it.
If you are reading this file in RStudio, then when we execute a line drawing a plot, it will create it in "Plots" section. So, at a time, you will have only 1 canvas in which plot is drawn. Yes, you can draw few plots in one canvas, and yes, you can later export them to JPG/PNG, PDF or even SVG.
## 2. Read data
Let's try some real example. We will try to find some insighst about people who boarded on Titanic. At first let's read the data, apologies for the recap.
Set working directory and read data to data frame.
setwd("C:/git/Articles/data/data_sample")
data.titanic <- read.csv("train.csv")
## 3. Statistical summaries
We can quickly inspect the data frame by calling
View(data.titanic)
Sometimes we will be working with big data sets, and trying to show the entire collection in grid view is pointless, so here's a handy way to limit your set to the first N rows, and show only them on the grid. Function head takes 2 parameters, data frame and N. To show bottom N rows use "tail" function.
View(head(data.titanic, 10))
Usually when we start working with some data set we want to understand its structure and uncover some patterns and anomalies.
There are 2 ways to do it:
* by statistically summarizing data
* by presenting filtered data on charts
There's no right or wrong answer here, it's a matter of personal preferences.
In order to get a better feel of our data set we can call "summary" function.
summary(data.titanic)
It shows summarized information about data stored in each column, if they are
* numbers (e.g. Age) we can see median, mean
* categorical (e.g. Sex) we can see how many females/males were on the ship
Yes, some results are pointless, like mean of IDs -- R doesn't know what's ID.
To get another glimpse at our data we can call "str" function. It shows structure of the data frame.
str(data.titanic)
In order to investigate particular column we can use table function which groups elements by factors. For instance
table(data.titanic$Sex)
We can also investigate Age of passengers. Quick glimpse on the Age values:
data.titanic$Age
As we can see, some passangers don't have age specified (=NA). "table" function will ignore them. In case of future analyses, sometimes we may want to clear this data, by either injecting some values (average, default 0, create prediction algorithm which will guess missing data - it does happen), which then can be used for further predictions, for example.
table(data.titanic$Age)
We might also be interested to see proportions, what fraction of passengers were female. To do that we would use "prop.table" function.
prop.table(table(data.titanic$Sex))
Notice that "prop.table" function requires data in grouped format (for example summarized by "table" function).
## 4. Charting
As mentioned before, the basic mechanics of charts in R are:
* initialize chart
* append additional information (points, fit lines, legend, etc.)
R allows for multiple charts (I don't know all, so I'm only going to cover ones I used):
* scatterplot
* histogram
* barplot
* boxplot
### 4.1. Barplot
Let's first do 1D charts. Say we want to see distribution of sexes on a bar plot. Bar plot requires us to provide data in grouped format (for instance through "table" function).
barplot(table(data.titanic$Sex))
### 4.2. Histogram
Let's create a very basic histogram first. NA(s) are ignored.
hist(data.titanic$Age)
We can see that the most populus groups were people in are group 20-30 and 30-40.
If we would like to have a more granular view. In this example, we set that x axis will contain 80 units.
hist(data.titanic$Age, breaks = 80)
In order to make charts more presentable they can be fully customized, with regards to labels, legends, coloring, margins... everything. I have never cared about that, so you have to read about that on the Internet. It's pretty straight-forward.
### 4.3. Boxplot
Quick re-cap what boxplot is, in case you forgot.
* [Example #1](http://www.datavizcatalogue.com/methods/images/anatomy/box_plot.png)
* [Example #2](https://en.wikipedia.org/wiki/Box_plot#/media/File:Boxplot_vs_PDF.svg)
In order to draw one, run this line.
boxplot(data.titanic$Age)
### 4.4. Scatterplot
Say we want to see whether age of passengers had any correlation to how much they paid for the cruise. To do that, we could create a chart where on X axis we would plot age, and on Y axis price of their tickets.
plot(data.titanic$Age, data.titanic$Fare)
### 4.5. Appending additional information
In order to demonstrate appending additional information let's say we want to add a line that fits best all those points (to see trend).
To do that we'll use "lm" function (stands for Linear Model). It creates an objective which contains all coefficiencies and other stuff (have a look).
model <- lm(data.titanic$Age ~ data.titanic$Fare)
Next we add line to the chart by calling "abline", which takes as parameters our linear model. Optionally we set line width (=lwd) to see it better.
abline(model, lwd = 2)
### 4.6. Alternative way of plotting
As we saw in previous example when drawing a scatterplot, there was some repetition. It's quite annoying, however, there's a way around this. We will use "with" function, which applies a function to a data set.
with(data.titanic, plot(Age, Fare, pch = 20))
We use "pch" argument to change how single point is draw.
Now let's say we want to see, which of those points are "males" and which are "females". To do that we re-draw points on the chart. Remember, function "with" applies function (2nd argument) to data set (1st argument). So, we have to restrict out data set to only passengers of one gender -- to do that we use subset function. To re-draw points we use "points" function, col denotes color for which group.
with(subset(data.titanic, Sex == "female"), points(Age, Fare, col = "blue"))
with(subset(data.titanic, Sex == "male"), points(Age, Fare, col = "red"))
At this point we can say that women were more willingly to pay more.
Maybe there's a correlation between high price and chances of survival, or age and ticket price, etc.
### 4.7. Multiple charts
Let's say we want to see 2 chars at the same time. Let's print to barplots -- one for sex distribution, the other for port on which they boarded.
par(mfrow = c(1, 2))
with(data.titanic, {
barplot(table(Sex), main = "Sex Distribution")
barplot(table(Embarked), main = "Embarkation Distribution")
})
"par" specifies how canvas is organized. Then we plot what we want.
## 5. Exporting charts.
In RStudio go to the upper ribbon of the application, click on "Plots" and in the drop down you'll see options to save it as PDF or Image.
Or you can use commands (it will save in working directory):
Create PDF file and keep open stream to it.
pdf("my_chart.pdf")
Draw plot, which will be injected into PDF.
par(mfrow = c(1, 2))
with(data.titanic, {
barplot(table(Sex), main = "Sex Distribution")
barplot(table(Embarked), main = "Embarkment Distribution")
})
Close stream. Otherwise Windows will "think" that RSudio is still using the file.
dev.off()
Apply the same pattern with JPGs and other formats.
jpeg("my_chart.jpg")
## 6. Scatterplot Matrices
Usually we visualize the data to see whether some variables are correlated with one another. We can do it manually by creating each chart individually, or we can take a shortcut and use "pairs" function.
Say we want to learn more about iris dataset- it's a collection of 150 observations about some flowers, each observations contains 4 measurements.
data(iris)
Say we would like to find out how each measure relate to all other measures and whether we can find some patterns. To do that we use the following.
pairs(iris[1:4], pch = 20)
As you can see, nothing really useful comes out of it. You can create some clusters, but that's about it.
Luckily, we can color each species with different color. To do that we want to map each observation (species from it) to a color, and store all colors in a vector. So, this vector must have 150 entries.
Initialize vector of characters of length equal to number of rows in out data frame.
cols <- character(nrow(iris))
At the beginning under each index we have an empty string. We have to override them. We know how to do that from out previous lectures, right?
cols[iris$Species == "setosa"] <- "blue"
cols[iris$Species == "versicolor"] <- "green"
cols[iris$Species == "virginica"] <- "red"
pairs(iris[1:4], col = cols, pch = 20)
Now we are able to see some patterns.
When we provide our first argument, iris[1:4], we essentially specify which columns we are interested in. | 41.733945 | 404 | 0.738734 | eng_Latn | 0.998459 |