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
sequencelengths 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
sequencelengths 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
sequencelengths 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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8029675b64d168836efc449c12cc99d487735af2 | 47 | md | Markdown | README.md | MrCoderManCodeCoolGames/GameEngineBeans | af34e71d83784a9d608d01bf86535808493e260e | [
"MIT"
] | null | null | null | README.md | MrCoderManCodeCoolGames/GameEngineBeans | af34e71d83784a9d608d01bf86535808493e260e | [
"MIT"
] | null | null | null | README.md | MrCoderManCodeCoolGames/GameEngineBeans | af34e71d83784a9d608d01bf86535808493e260e | [
"MIT"
] | null | null | null | # GameEngineBeans
haha game engine go brrrrrrr
| 15.666667 | 28 | 0.829787 | eng_Latn | 0.706916 |
80298a0d2474eb7d83247ad0693b384c3f4639d0 | 7,832 | md | Markdown | content/babylon101/babylon101/Environment.md | riverfeya/Documentation | 72f34e50dcea4b72a1c674e0ade8f697e256d116 | [
"Apache-2.0"
] | null | null | null | content/babylon101/babylon101/Environment.md | riverfeya/Documentation | 72f34e50dcea4b72a1c674e0ade8f697e256d116 | [
"Apache-2.0"
] | null | null | null | content/babylon101/babylon101/Environment.md | riverfeya/Documentation | 72f34e50dcea4b72a1c674e0ade8f697e256d116 | [
"Apache-2.0"
] | null | null | null | ---
ID_PAGE: 22131
PG_TITLE: 15. Environment
---
# Environment
Вы прошли долгий путь, узнали о формах, огнях, спрайтах, частицах, материалах. Но в ваших сценах чего-то не хватает: подходящая среда. Это первый из трех последовательных How_To, которые говорят о факторах и эффектах окружения сцены. Мы начнем с простой сцены `clearColor` (background color), затем кратко поговорим о scene `ambientColor`, затем на 6-texture skyboxes, а затем туман, чтобы создать иллюзию глубины ваших сцен.
_A picture showing Babylon.js fog in action_
## Как я могу это сделать?
Мы поговорим об этом приятном эффекте тумана, в ближайшее время. Во-первых, я хочу познакомить вас с двумя интересными [scene class object](/classes/3.0/Scene):
* `scene.clearColor` - изменяет 'background' color.
* `scene.ambientColor` - изменяет цвет используется в нескольких эффектах, включая окружающее освещение.
Оба они очень полезны и мощны сами по себе.
### Изменение Background color (`scene.clearColor`)
Свойство 'clearColor' на сцене объект является самым элементарным из environment properties/adjustments. Проще говоря, это то, как вы меняете цвет фона сцены. Вот как это делается:
```javascript
scene.clearColor = new BABYLON.Color3(0.5, 0.8, 0.5);
```
Или, может быть, вы хотите использовать один из наших предустановленных цветов и избегать использования ключевое слово `new` :
```javascript
scene.clearColor = BABYLON.Color3.Blue();
```
Этот цвет и свойство не используются ни в каких расчетах для окончательных цветов mesh, materials, textures, или что-нибудь еще. Это просто цвет фона сцены.
### Изменение Ambient color (`scene.ambientColor`)
Напротив, свойство `ambientColor` на сцене объект очень мощный и влиятельный environment property/adjustment. Во-первых, давайте посмотрим на его синтаксис:
```javascript
scene.ambientColor = new BABYLON.Color3(0.3, 0.3, 0.3);
```
Как видите, он установлен в том же формате, что и `clearColor`, но `ambientColor` используется в нескольких расчетах для определения окончательных цветов элементов сцены. В основном, он используется в сочетании с `StandardMaterial.ambientColor` мешей для определения FINAL `ambientColor` материала меша.
Вы увидите что когда нет `scene.ambientColor`, тогда `StandardMaterial.ambientColor` и `StandardMaterial.ambientTexture` появляются ничего не делая. Задайте некоторое значение `scene.ambientColor` , как в примере выше, и `StandardMaterial.ambientColor`/`StandardMaterial.ambientTexture` станет активным на сетках, где вы применили такие.
По умолчанию , `scene.ambientColor` установлен в `Color3(0, 0, 0)`, что означает, что нет `scene.ambientColor`.
(Пожалуйста, смотрите раздел по ambientColors в нашем [Unleash the Standard Material](https://www.eternalcoding.com/?p=303) tutorial, for more information.)
### Skybox
Чтобы создать идеальную иллюзию прекрасного солнечного неба, мы собираемся создать простую коробку, но со специальной текстурой. Существует два способа создания скайбокса. Давайте начнем с руководства, чтобы понять, как все работает под капотом, а затем мы сможем использовать автоматический.
#### Manual creation
Во-первых, наша коробка, ничего нового, просто обратите внимание на отключение [backface culling](http://en.wikipedia.org/wiki/Back-face_culling):
```javascript
var skybox = BABYLON.Mesh.CreateBox("skyBox", 100.0, scene);
var skyboxMaterial = new BABYLON.StandardMaterial("skyBox", scene);
skyboxMaterial.backFaceCulling = false;
skyboxMaterial.disableLighting = true;
skybox.material = skyboxMaterial;
```
Далее мы устанавливаем свойство `infiniteDistance` . Это заставляет скайбокс следовать позиции нашей камеры.
```javascript
skybox.infiniteDistance = true;
```
Теперь мы должны удалить все отражения света на нашей коробке (солнце не отражается на небе!):
```javascript
skyboxMaterial.disableLighting = true;
```
Затем мы применяем нашу специальную текстуру неба к нему. Эта текстура должна быть подготовлена для скайбокса, в специальном каталоге с именем «скайбокс» в нашем примере.:
```javascript
skyboxMaterial.reflectionTexture = new BABYLON.CubeTexture("textures/skybox", scene);
skyboxMaterial.reflectionTexture.coordinatesMode = BABYLON.Texture.SKYBOX_MODE;
```
(Подробнее об отражении текстур можно найти в нашем [Unleash the Standard Material](https://www.eternalcoding.com/?p=303) tutorial.)
В этой папке `/skybox` , мы должны найти 6 текстур неба, по одной на каждую грань нашего бокса. Каждое изображение должно быть названо в соответствии с face: “skybox_nx.png”, “skybox_ny.png”, “skybox_nz.png”, “skybox_px.png”, “skybox_py.png”, “skybox_pz.png”.
Skybox textures не должно быть текстурой одного неба. Вы можете искать в Интернете скайбоксы и находить здания, холмы, горы, деревья, озера, планеты, звезды, вы называете это (все можно красиво использовать) как часть текстур скайбокса, но некоторые требуют оплаты.
Вы также можете использовать файлы dds, чтобы указать свой скайбокс. Эти специальные файлы могут содержать всю информацию, необходимую для настройки текстуры куба.:
```javascript
skyboxMaterial.reflectionTexture = new BABYLON.CubeTexture("/assets/textures/SpecularHDR.dds", scene);
```
Последнее замечание: если вы хотите, чтобы ваш скайбокс отображался позади всего остального, задайте для 'renderGroupId` скайбокса значение' 0 ', а для любого другого объекта визуализируемого объекта renderGroupId больше нуля, например:
```javascript
skybox.renderingGroupId = 0;
// Some other mesh
myMesh.renderingGroupId = 1;
```
Более подробную информацию о группах рендеринга и порядке рендеринга можно найти [here](/resources/Transparency_and_How_Meshes_Are_Rendered).
#### Automatic creation
Теперь, когда мы понимаем, как можно создать скайбокс, давайте перейдем к более простому способу.:
```javascript
var envTexture = new BABYLON.CubeTexture("/assets/textures/SpecularHDR.dds", scene);
scene.createDefaultSkybox(envTexture, true, 1000);
```
* [Playground Example Skybox Helper](https://www.babylonjs-playground.com/#BH23ZD#1)
Check out [scene helpers](/how_to/fast_build) for more information on this and other helpers.
### Fog
Туман довольно продвинутый эффект, но туман в Babylon.js был максимально упрощен. Теперь очень легко добавить туман в свои сцены. Сначала мы определяем режим тумана следующим образом:
```javascript
scene.fogMode = BABYLON.Scene.FOGMODE_EXP;
```
Вот доступные режимы:
- `BABYLON.Scene.FOGMODE_NONE` - default one, fog is deactivated.
- `BABYLON.Scene.FOGMODE_EXP` - плотность тумана следует экспоненциальной функции.
- `BABYLON.Scene.FOGMODE_EXP2` - то же самое, что выше, но быстрее.
- `BABYLON.Scene.FOGMODE_LINEAR` - плотность тумана соответствует линейной функции.
-> Если вы выбираете `EXP`, или `EXP2` режим, тогда вы можете определить опцию density (default is `0.1`):
```javascript
scene.fogDensity = 0.01;
```
-> В противном случае, если вы выберете режим `LINEAR`, вы можете определить, где начинается туман и где он заканчивается.:
```javascript
scene.fogStart = 20.0;
scene.fogEnd = 60.0;
```
Наконец, независимо от режима, вы можете указать цвет тумана (default is `BABYLON.Color3(0.2, 0.2, 0.3)`):
```javascript
scene.fogColor = new BABYLON.Color3(0.9, 0.9, 0.85);
```
Видите, мы говорили, что это легко.
Если вы хотите увидеть и поиграть с игровой площадкой для этого урока, вы можете [**click right here**]( https://www.babylonjs-playground.com/?13).
## Next step
Теперь у вас должна быть красивая сцена, но кроме ваших 3D-моделей, ваш мир довольно плоский, и это позор для вашей сцены. Итак, в нашем следующем уроке по окружающей среде мы собираемся превратить вашу плоскую землю в красивые горы. Чтобы узнать это, перейдите на [here!](/babylon101/Height_Map)
# Further Reading
[Environment Overview](/features/Environment)
[Scene Fast Build](/how_to/fast_build)
| 51.189542 | 425 | 0.783708 | rus_Cyrl | 0.903294 |
802af5a21e4a41c5ced5f12b087bcf794dfc5319 | 2,046 | md | Markdown | _posts/2020-02-01-Google-Colab-Notebooks.md | ETDelaney/ETDelaney.github.io | 570e07fd762674b66454608aad446cd3e4df23fb | [
"MIT"
] | null | null | null | _posts/2020-02-01-Google-Colab-Notebooks.md | ETDelaney/ETDelaney.github.io | 570e07fd762674b66454608aad446cd3e4df23fb | [
"MIT"
] | null | null | null | _posts/2020-02-01-Google-Colab-Notebooks.md | ETDelaney/ETDelaney.github.io | 570e07fd762674b66454608aad446cd3e4df23fb | [
"MIT"
] | null | null | null | ---
layout: post
title: Playing around with Google Colab and VEs
---
Simply type Google Colab Notebooks into the search engine and click on 'Show notebooks in Drive - Google' to get started. Let us also see how to create a virtual environment and install packages according to a requirements.txt file.
<hr>
### Google Colabs and TensorFlow 2
We may want to import tensforflow and this is simply done by saying:
```python
import tensorflow as tf
```
However, you may get a warning message saying that the default TensorFlow will soon be switching to version 2.x. You will also see that if you type:
```python
tf.__version__
```
It will most likely be version 1.15.0 that has been imported. To get around this, restart the runtime by going up to the top and selecting Runtime and the necessary option.
Then type:
```python
%tensorflow_version 2.x
```
And then run:
```python
import tensorflow as tf
```
Now if you check the version, it will be version 2.1 or higher.
### Getting a GPU setup
To get a GPU setup, simply go to Edit at the top and select Notebook settings. From here, you can then select the Hardware accelerator to be GPU.
### Virtual environments
Instead of using Google Colab, we can also use our own local machine. And we can use a requirements list to install necessary packages if we want to run someone's algorithm.
Let us first create the virtual environment - in the command prompt (or terminal) type:
`conda create -n tf2 python=3.7`
Now activate the virtual environment by typing:
`activate tf2`
It may be that what you may need to type is different dependent on your operating system; e.g., for Linux, it may be:
`source activate <name of your virtual environment>`.
And then maybe we have a requirements.txt file that contains certain packages that we want. Such a requirements.txt file would be a simple list such as:
`matplotlib==3.1.1`
`pandas==0.25.2`
`tensorflow==2.1.0`
Simply navigate to the area containing your requirements.txt and do:
`pip install -r requirements.txt`
<hr>
That is all!
| 29.652174 | 232 | 0.759042 | eng_Latn | 0.999093 |
802b5fd1a61b271bff27e4e87564af9afd3d255b | 652 | md | Markdown | service-contract.md | bayeslife/service-verification-service | d2b6a3fde1e0946dbd7f7eabd8f2e82b0b9fffae | [
"MIT"
] | null | null | null | service-contract.md | bayeslife/service-verification-service | d2b6a3fde1e0946dbd7f7eabd8f2e82b0b9fffae | [
"MIT"
] | null | null | null | service-contract.md | bayeslife/service-verification-service | d2b6a3fde1e0946dbd7f7eabd8f2e82b0b9fffae | [
"MIT"
] | null | null | null | # Service Contract
In order to appropriately register and verify microservices it will be necessary for the microservice to support a metadata API contract.
## Sequence
The metadata required will be retrieved by a GET /service-discovery-metadata callback to the service endpoint after it registers.
This will be invoked after the service registers.
![alt text][QueryMetaData]
[QueryMetaData]: images/metadata.png "Query Metadata"
## Metadata Semantics
The metadata will have the following content.
```
{
name: ProductEligibilityService,
version: 3.1,
environment: "PRODUCTION",
tags: [ "",""]
}
```
### MetaData scenarios
| 22.482759 | 137 | 0.745399 | eng_Latn | 0.877177 |
802be3886effc9392634f4fc0da22c405166f09d | 2,116 | md | Markdown | docs/balloon.md | praveen-pk/cloud-hypervisor | db06c313056ef85f84d331f2a0326f282319a2e7 | [
"Apache-2.0",
"BSD-3-Clause"
] | 422 | 2019-05-09T11:25:38.000Z | 2019-11-21T01:41:50.000Z | docs/balloon.md | praveen-pk/cloud-hypervisor | db06c313056ef85f84d331f2a0326f282319a2e7 | [
"Apache-2.0",
"BSD-3-Clause"
] | 254 | 2019-05-14T17:11:45.000Z | 2019-11-21T05:08:25.000Z | docs/balloon.md | praveen-pk/cloud-hypervisor | db06c313056ef85f84d331f2a0326f282319a2e7 | [
"Apache-2.0",
"BSD-3-Clause"
] | 45 | 2019-05-06T15:09:45.000Z | 2019-11-20T19:08:27.000Z | # Balloon
Cloud Hypervisor implements a balloon device based on the VIRTIO specification.
Its main purpose is to provide the host a way to reclaim memory by controlling
the amount of memory visible to the guest. But it also provides some interesting
features related to guest memory management.
## Parameters
`BalloonConfig` (known as `--balloon` from the CLI perspective) contains the
list of parameters available for the balloon device.
```rust
struct BalloonConfig {
pub size: u64,
pub deflate_on_oom: bool,
pub free_page_reporting: bool,
}
```
```
--balloon <balloon> Balloon parameters "size=<balloon_size>,deflate_on_oom=on|off,free_page_reporting=on|off"
```
### `size`
Size of the balloon device. It is subtracted from the VM's total size. For
instance, if creating a VM with 4GiB of RAM, along with a balloon of 1GiB, the
guest will be able to use 3GiB of accessible memory. The guest sees all the RAM
and unless it is balloon enlightened is entitled to all of it.
This parameter is mandatory.
Value is an unsigned integer of 64 bits corresponding to the balloon size in
bytes.
_Example_
```
--balloon size=1G
```
### `deflate_on_oom`
Allow the guest to deflate the balloon if running Out Of Memory (OOM). Assuming
the balloon size is greater than 0, this means the guest is allowed to reduce
the balloon size all the way down to 0 if this can help recover from the OOM
event.
This parameter is optional.
Value is a boolean set to `off` by default.
_Example_
```
--ballloon size=2G,deflate_on_oom=on
```
### `free_page_reporting`
Allow the guest to report lists of free pages. This feature doesn't require the
balloon to be of any specific size as it doesn't impact the balloon size. The
guest can let the VMM know about pages that are free after they have been used.
Based on this information, the VMM can advise the host that it doesn't need
these pages anymore.
This parameter is optional.
Value is a boolean set to `off` by default.
_Example_
```
--ballloon size=0,free_page_reporting=on
```
| 27.480519 | 110 | 0.734877 | eng_Latn | 0.999498 |
802c09c94a7fc463411d83e16885a5ebb3c638c3 | 395 | md | Markdown | _bagby/gbby-45g226.md | jpmantica/wax-sandbox | 96a80a692203a1972d13c30b5a00823d8b2234d0 | [
"MIT"
] | null | null | null | _bagby/gbby-45g226.md | jpmantica/wax-sandbox | 96a80a692203a1972d13c30b5a00823d8b2234d0 | [
"MIT"
] | null | null | null | _bagby/gbby-45g226.md | jpmantica/wax-sandbox | 96a80a692203a1972d13c30b5a00823d8b2234d0 | [
"MIT"
] | 1 | 2021-11-09T15:37:25.000Z | 2021-11-09T15:37:25.000Z | ---
pid: gbby-45g226
order: '226'
file_name: gbby-45g226.jpg
label: 'GBBY 45G/226: Football Game Scene - Unidentified Game - c1920s'
_date: 1920s
object_type: glass plate negative
source: http://archives.nd.edu/Bagby/GBBY-45g226.jpg
thumbnail: "/img/derivatives/simple/gbby-45g226/thumbnail.jpg"
full: "/img/derivatives/simple/gbby-45g226/fullwidth.jpg"
layout: bagby_item
collection: bagby
---
| 28.214286 | 71 | 0.772152 | kor_Hang | 0.124577 |
802c164d9cb172a3d75d2f89b939374e182a02db | 747 | md | Markdown | _posts/2021-10-14-bai-tap-dart-5.md | hocbaicungcon/divin.dev | 25e77c2fc4622b4b54b73e5cca094ee2a85afd22 | [
"MIT"
] | null | null | null | _posts/2021-10-14-bai-tap-dart-5.md | hocbaicungcon/divin.dev | 25e77c2fc4622b4b54b73e5cca094ee2a85afd22 | [
"MIT"
] | null | null | null | _posts/2021-10-14-bai-tap-dart-5.md | hocbaicungcon/divin.dev | 25e77c2fc4622b4b54b73e5cca094ee2a85afd22 | [
"MIT"
] | null | null | null | ---
layout: post
title: Số lớn nhất trong ba số
subtitle:
categories: dart
tags: [dart, flutter]
---
# Bài tập Dart - Tìm số lớn nhất
Viết chương trình tìm số lớn nhất trong ba số thực `a, b, c`.
**Cách 1.** Chúng ta lần lượt đi so sánh giá trị max với từng số.
```dart
void main() {
double a = 3.14, b = -5, c = 27;
double max = a;
if (max < b) max = b;
if (max < c) max = c;
print(max);
}
```
**Cách 2.** Sử dụng toán tử điều kiện.
```dart
void main() {
double a = 3.14, b = -5, c = 27;
print(((a>b)?a:b)>c?(a>b)?a:b:c);
}
```
**Cách 3.** Không sử dụng toán tử so sánh.
```dart
void main() {
double a = 3.14, b = -5, c = 27;
double max = (a + b + (a - b).abs()) / 2;
print((max + c + (max - c).abs()) / 2);
}
```
| 16.977273 | 65 | 0.536814 | vie_Latn | 0.995749 |
802e020dcb74d8af0528f0908fbada5a024ec361 | 78 | md | Markdown | README.md | rudzki/deck-app | b8a689503521e3317690ef2c408ae1003eb1b34d | [
"MIT"
] | null | null | null | README.md | rudzki/deck-app | b8a689503521e3317690ef2c408ae1003eb1b34d | [
"MIT"
] | 1 | 2020-09-09T19:34:56.000Z | 2020-09-09T19:34:56.000Z | README.md | rudzki/deck-app | b8a689503521e3317690ef2c408ae1003eb1b34d | [
"MIT"
] | null | null | null | Deck App
========
A flash card app with recall scoring and spaced repetition.
| 19.5 | 59 | 0.717949 | eng_Latn | 0.968934 |
802e676f7c2821b43f788168f8e95663c2d08ee3 | 229 | md | Markdown | README.md | AlexRex/mediainfo-docker-libcurl | 1e063bb4d2a822f0631f993d7ba5cb733af0ddc2 | [
"MIT"
] | null | null | null | README.md | AlexRex/mediainfo-docker-libcurl | 1e063bb4d2a822f0631f993d7ba5cb733af0ddc2 | [
"MIT"
] | null | null | null | README.md | AlexRex/mediainfo-docker-libcurl | 1e063bb4d2a822f0631f993d7ba5cb733af0ddc2 | [
"MIT"
] | null | null | null | # MediaInfo Docker Image with libcurl
Image created be able to run mediainfo with URL from S3 buckets.
Compiled using --with-libcurl
## Usage
`docker run alexrex/mediainfo`
Example:
`docker run alexrex/mediainfo --version`
| 17.615385 | 65 | 0.768559 | eng_Latn | 0.881996 |
802eaee6c227c1e5e383c7778f2b16eeea21fcee | 3,351 | md | Markdown | README.md | Sara-Hamilton/CoinCombination | 0134ab524e1f3c29f2b4996a7f9c4751689ad328 | [
"Unlicense"
] | null | null | null | README.md | Sara-Hamilton/CoinCombination | 0134ab524e1f3c29f2b4996a7f9c4751689ad328 | [
"Unlicense"
] | null | null | null | README.md | Sara-Hamilton/CoinCombination | 0134ab524e1f3c29f2b4996a7f9c4751689ad328 | [
"Unlicense"
] | null | null | null | # Coin Combination
#### .Net MVC app that lets users enter an amount of cents and shows the smallest number of quarters, dimes, nickels, and pennies needed to make that change. 2-12-18
#### _By Sara Hamilton and Dalia Ramos_
## Description
_This is an Epicodus practice project for week 2 of the C# course. Its purpose is to display understanding .Net MVC testing in C#._
#### _Coin Combination_
* Takes in an amount of cents as input.
* Outputs the smallest number quarters, dimes, nickels, and pennies.
### Specifications
* Takes in amount of cents as input and outputs the smallest amount of quarters.
* sample input : 68 cents
* sample output : 2 quarters
* Takes in amount of cents as input and outputs the smallest amount of dimes.
* sample input : 18 cents
* sample output : 1 dime
* Takes in amount of cents as input and outputs the smallest amount of nickels.
* sample input : 8 cents
* sample output : 1 nickels
* Takes in amount of cents as input and outputs the smallest amount of pennies.
* sample input : 3 cents
* sample output : 3 pennies.
## Setup/Installation Requirements
* _Clone this GitHub repository_
```
git clone https://github.com/Sara-Hamilton/CoinCombination.git
```
* _Install the .NET Framework_
.NET Core 1.1 SDK (Software Development Kit)
.NET runtime.
See https://www.learnhowtoprogram.com/c/getting-started-with-c/installing-c for instructions and links.
* _Run the program_
1. In the command line, cd into the project folder.
2. In the command line, type dotnet restore. Enter. It make take a few minutes to complete this process.
3. In the command line, type dotnet build. Enter. Any errror messages will be displayed in red. Errors will need to be corrected before the app can be run. After correcting errors and saving changes, type dotnet build again. When message says Build succeeded in green, proceed to the next step.
4. In the command line, type dotnet run. Enter.
* _View program on web browser at port localhost:5000/_
* _Enter a number into the form._
* _Submit the form to see the output._
## Support and contact details
_To suggest changes, submit a pull request in the GitHub repository._
## Technologies Used
* HTML
* C#
* .Net Core 1.1
### License
*MIT License*
Copyright (c) 2018 **_Sara Hamilton and Dalia Ramos_**
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
| 36.824176 | 298 | 0.762459 | eng_Latn | 0.966283 |
802edd1a01b4b479a73483ddb061247e85486b88 | 228 | md | Markdown | docs/Install_Guide_zh.md | abasu644/AIOPS_PLATFORM | 239885c9f3cb2f391e060321a01aa735e37fda72 | [
"MIT"
] | 75 | 2019-03-06T09:22:37.000Z | 2021-09-06T12:50:24.000Z | docs/Install_Guide_zh.md | abasu644/AIOPS_PLATFORM | 239885c9f3cb2f391e060321a01aa735e37fda72 | [
"MIT"
] | 1 | 2019-05-10T08:37:45.000Z | 2019-05-10T08:37:45.000Z | docs/Install_Guide_zh.md | abasu644/AIOPS_PLATFORM | 239885c9f3cb2f391e060321a01aa735e37fda72 | [
"MIT"
] | 30 | 2019-03-06T09:32:32.000Z | 2022-03-26T00:28:39.000Z | # AIOPS PLATFORM 安装指南
**将github上的代码clone到本地.**
`git clone https://github.com/aiops-project/AIOPS_PLATFORM.git`
**移动并重命名`AIOPS_PLATFORM/`为`/AIOPS`.**
`mv AIOPS_PLATFORM/ /AIOPS`
**执行install.sh.**
`cd /AIOPS ; ./install.sh`
| 16.285714 | 63 | 0.70614 | yue_Hant | 0.838134 |
8030be496a2c8f6c6bbe74b77f607eb66045192f | 1,074 | md | Markdown | 2-resources/BLOG/ciriculumn/week-6/wk6/week-6-review/practice/d3-async-await-practice/README.md | impastasyndrome/Lambda-Resource-Static-Assets | 7070672038620d29844991250f2476d0f1a60b0a | [
"MIT"
] | null | null | null | 2-resources/BLOG/ciriculumn/week-6/wk6/week-6-review/practice/d3-async-await-practice/README.md | impastasyndrome/Lambda-Resource-Static-Assets | 7070672038620d29844991250f2476d0f1a60b0a | [
"MIT"
] | null | null | null | 2-resources/BLOG/ciriculumn/week-6/wk6/week-6-review/practice/d3-async-await-practice/README.md | impastasyndrome/Lambda-Resource-Static-Assets | 7070672038620d29844991250f2476d0f1a60b0a | [
"MIT"
] | 1 | 2021-11-05T07:48:26.000Z | 2021-11-05T07:48:26.000Z | # ASYNC / AWAIT PRACTICE
Inside this directory you will find two sub-directories (`solution`, `your-code`)
- write your solutions to the problems listed below in the `your-code` directory
- check your solutions against those I've provided in the `solution` directory
## Problem #1 (`your-code/problem_1.js`)
TODO: use `async` & `await` to create a function called `workout` that runs the
given functions in a way that ensures you begin runningOnTreadmill after
you're finished stretching, you begin liftWeights after you've finished
running on the treadmill and console.logs "done working out" after
you've finished lifting weights
TESTING
- run the file (`node problem_1.js`) and check your output against the expected
output I've provided at the bottom of the file
## Problem #2 (`your-code/problem_2.js`)
TODO: recreate the solution to problem #2 in your promise practice
using async and await
TESTING:
- comment in each invocation of the workout function listed at the bottom
and run the file (`node problem_2.js`) to see if you get the expected output | 33.5625 | 81 | 0.768156 | eng_Latn | 0.998884 |
8031924dc2ebcd0d76e000a46b505ac2b3890ccb | 136 | md | Markdown | DOCUMENTATION/MANUAL/Expressions.md | mcdeoliveira/NC | 54b2a81ebda9e5260328f88f83f56fe8cf472ac3 | [
"BSD-3-Clause"
] | 103 | 2016-09-21T06:01:23.000Z | 2022-03-27T06:52:10.000Z | DOCUMENTATION/MANUAL/Expressions.md | albinjames/NC | 157a55458931a18dd1f42478872c9df0de5cc450 | [
"BSD-3-Clause"
] | 11 | 2017-03-27T13:11:42.000Z | 2022-03-08T13:46:14.000Z | DOCUMENTATION/MANUAL/Expressions.md | albinjames/NC | 157a55458931a18dd1f42478872c9df0de5cc450 | [
"BSD-3-Clause"
] | 21 | 2017-06-23T09:01:21.000Z | 2022-02-18T06:24:00.000Z | # NonCommutative Expressions
## Expanding
## Rules and Substitution
## Collecting
## Polynomials
## Rationals
## Simplification
| 8.5 | 28 | 0.720588 | eng_Latn | 0.742884 |
8032872158a95e5de5896772452d0c1cab08c7e8 | 80 | md | Markdown | about.md | nationminu/nationminu.github.io | a4dcbff783def96f9e401b7428819d1748ea9414 | [
"MIT"
] | null | null | null | about.md | nationminu/nationminu.github.io | a4dcbff783def96f9e401b7428819d1748ea9414 | [
"MIT"
] | 1 | 2020-01-13T06:24:49.000Z | 2020-01-13T06:27:31.000Z | about.md | nationminu/nationminu.github.io | a4dcbff783def96f9e401b7428819d1748ea9414 | [
"MIT"
] | null | null | null | ---
layout: page
title: About
permalink: /about/
---
Trust Me, I'm an Engineer! | 11.428571 | 26 | 0.6625 | eng_Latn | 0.75994 |
80328a4cac0c94586336fc9394c3e4b7a92a3317 | 164 | md | Markdown | README.md | TaaabsElements/taaabs-research | 80176378e3489da998b42e030a06f7bc5d33327a | [
"MIT"
] | null | null | null | README.md | TaaabsElements/taaabs-research | 80176378e3489da998b42e030a06f7bc5d33327a | [
"MIT"
] | null | null | null | README.md | TaaabsElements/taaabs-research | 80176378e3489da998b42e030a06f7bc5d33327a | [
"MIT"
] | null | null | null | # taaabs-research
`<taaabs-research>` is a graphical component that helps looking for resources in a ktbs.
### No worries, doc incomming :)
@demo demo/index.html
| 23.428571 | 88 | 0.743902 | eng_Latn | 0.814004 |
80335165b1fd1363cef015e51b0a66f9a5e5017e | 164 | md | Markdown | README.md | Chrescco/weather-translator | 612cff467c99deb5e0e84ec845cdfee06edb610e | [
"MIT"
] | null | null | null | README.md | Chrescco/weather-translator | 612cff467c99deb5e0e84ec845cdfee06edb610e | [
"MIT"
] | null | null | null | README.md | Chrescco/weather-translator | 612cff467c99deb5e0e84ec845cdfee06edb610e | [
"MIT"
] | null | null | null | # weather-translator
I recently started learning JavaScript, and this is my first official program that I made! this translates Kelvin and Celsius into fahrenheit.
| 54.666667 | 142 | 0.823171 | eng_Latn | 0.999888 |
803378c09d2f9130f2ee0b637c532c28a695e55a | 180 | md | Markdown | packages/components/popover/demo/Vmodel.md | LaamGinghong/idux | dd9c1a2ec61572e26cb85b7679fb534a9334b25b | [
"MIT"
] | 1 | 2021-02-05T09:05:48.000Z | 2021-02-05T09:05:48.000Z | packages/components/popover/demo/Vmodel.md | ShannyShanny/components | bb559ee439fbb81b94198641add3bec8056e3c38 | [
"MIT"
] | null | null | null | packages/components/popover/demo/Vmodel.md | ShannyShanny/components | bb559ee439fbb81b94198641add3bec8056e3c38 | [
"MIT"
] | null | null | null | ---
title:
zh: 双向绑定
en: Two-way binding
order: 4
---
## zh
`popover` 的显隐还支持通过双向绑定的方式来控制
## en
`popover` also supports explicit and implicit control through two-way binding
| 12 | 77 | 0.7 | eng_Latn | 0.967945 |
803386b468c73a451ae77154fc49e6228baa551c | 3,102 | md | Markdown | docs/tutorial/algorithm/algorithm.md | kairosfuture/BERTopic | 874469c693613ad6a6a6c9e670542084399a35be | [
"MIT"
] | null | null | null | docs/tutorial/algorithm/algorithm.md | kairosfuture/BERTopic | 874469c693613ad6a6a6c9e670542084399a35be | [
"MIT"
] | null | null | null | docs/tutorial/algorithm/algorithm.md | kairosfuture/BERTopic | 874469c693613ad6a6a6c9e670542084399a35be | [
"MIT"
] | null | null | null | The algorithm contains, roughly, 3 stages:
- Extract document embeddings with **`Sentence Transformers`** or **`TF-IDF`**
- Cluster document embeddings to create groups of similar documents with **`UMAP`** and **`HDBSCAN`**
- Extract and reduce topics with **`c-TF-IDF`**
## **Cluster Document Embeddings**
Next, in order to cluster the documents using a clustering algorithm such as HDBSCAN we first need to
reduce its dimensionality as HDBCAN is prone to the curse of dimensionality.
<p align="center">
<img src="https://github.com/MaartenGr/BERTopic/raw/master/images/clusters.png" width="50%" height="50%"/>
</p>
Thus, we first lower dimensionality with UMAP as it preserves local structure well after which we can
use HDBSCAN to cluster similar documents.
## **Extract Topics**
What we want to know from the clusters that we generated, is what makes one cluster, based on their content,
different from another? To solve this, we can modify TF-IDF such that it allows for interesting words per topic
instead of per document.
When you apply TF-IDF as usual on a set of documents, what you are basically doing is comparing the importance of
words between documents. Now, what if, we instead treat all documents in a single category (e.g., a cluster)
as a single document and then apply TF-IDF? The result would be importance scores for words within a cluster.
The more important words are within a cluster, the more it is representative of that topic. In other words,
if we extract the most important words per cluster, we get descriptions of **topics**! This model is called
class-based TF-IDF
<p align="center">
<img src="https://github.com/MaartenGr/BERTopic/raw/master/images/ctfidf.png" height="50"/>
</p>
Each cluster is converted to a single document instead of a set of documents.
Then, the frequency of word `t` are extracted for each class `i` and divided by the total number of words `w`.
This action can now be seen as a form of regularization of frequent words in the class.
Next, the total, unjoined, number of documents `m` is divided by the total frequency of word `t` across all classes `n`.
## **Topic Coherence**
This fourth step is executed if you do not use custom embeddings but generate the document embeddings within BERTopic
itself. The embedding model provided by BERTopic will be used to improve the coherence of words within a topic.
After having generated the c-TF-IDF representations, we have a set of words that describe a collection of documents.
Technically, this does not mean that this collection of words actually describes a coherent topic. In practice, we will
see that many of the words do describe a similar topic but some words will, in a way, overfit to the documents. For
example, if you have a set of documents that is written by the same person whose signature will be in the topic
description.
In order to improve coherence of words Maximal Marginal Relevance was used to find the words that were most coherent
without having too much overlap between the words itself. This results in the removal of words that do not contribute
to a topic.
| 57.444444 | 120 | 0.77724 | eng_Latn | 0.999381 |
8033d9907c9b6874b71fa23e8001b825ce6bd16a | 69 | md | Markdown | README.md | zhangjinpeng1987/raft-engine | e61a7cfb690a4978f97860eb6d955dab24f98b78 | [
"Apache-2.0"
] | null | null | null | README.md | zhangjinpeng1987/raft-engine | e61a7cfb690a4978f97860eb6d955dab24f98b78 | [
"Apache-2.0"
] | null | null | null | README.md | zhangjinpeng1987/raft-engine | e61a7cfb690a4978f97860eb6d955dab24f98b78 | [
"Apache-2.0"
] | null | null | null | # raft-engine
A WAL-is-data engine that used to store multi-raft log
| 23 | 54 | 0.768116 | eng_Latn | 0.997857 |
803487616792467e95d7ff37079aedd5a31e5ace | 348 | md | Markdown | README.md | mp3/wysiwyg-editor | fb31b1b04270a3deec795296081303fcade1e0db | [
"MIT"
] | null | null | null | README.md | mp3/wysiwyg-editor | fb31b1b04270a3deec795296081303fcade1e0db | [
"MIT"
] | 3 | 2022-01-22T12:03:44.000Z | 2022-02-27T05:07:52.000Z | README.md | mp3/wysiwyg-editor | fb31b1b04270a3deec795296081303fcade1e0db | [
"MIT"
] | null | null | null | ## Preact implementation of the Medium clone with Quill
The Original implementation is [here](https://quilljs.com/guides/cloning-medium-with-parchment/)
This is an experimental project.
## Preparation
```
$ yarn install
```
## Development
```
$ yarn dev
```
Server will be running at `http://localhost:8080/`
## Build
```
$ yarn build
```
| 13.384615 | 96 | 0.695402 | eng_Latn | 0.925855 |
80368ec44f636ab10ef5288d97ae81bfa8f5d6cb | 3,573 | md | Markdown | 7/README.md | arademaker/QALD | b985de8d29d18157401c005566542350bb4b5fb7 | [
"MIT"
] | 81 | 2015-08-17T03:38:48.000Z | 2022-03-26T21:33:27.000Z | 7/README.md | arademaker/QALD | b985de8d29d18157401c005566542350bb4b5fb7 | [
"MIT"
] | 14 | 2017-01-09T08:53:38.000Z | 2021-10-18T13:53:10.000Z | 7/README.md | arademaker/QALD | b985de8d29d18157401c005566542350bb4b5fb7 | [
"MIT"
] | 63 | 2016-03-14T02:50:23.000Z | 2022-01-13T10:11:44.000Z | # QALD-7
Last update: 2017-01-07
For parsing the json files you find a full class structure and parser at:
https://github.com/AKSW/NLIWOD/tree/master/qa.commons/src/main/java/org/aksw/qa/commons/load/json
## QALD-7-train-multilingual dataset
The qald7-train-multilingual dataset was created using the multilingual questions from QALD3-to QALD-6(QALD-1 and QALD-2 questions are not multilingual). However, there was some cleaning necessary:
1. Languages
The natural language question had to be present in at least six languages.
2. Keywords
For all languages a question is present, if there is at least one keyword.
3. Answertype
Had to be present.
4. Sparql
Had to be present and parsable.
When dbpedia.org/sparql threw an error on a question, it was disqualified.
5. OnlyDBO-Flag
Was autocorrected in case it was wrong.
OnlyDBO-flag was set to true when the SPARQL query only contains "rdf","rdfs", "http://dbpedia.org/ontology/" or http://dbpedia.org/resource/ as prefix, otherwise false.
6. Answers
The answerset was not allowed to be empty. Furthermore, the answerset stored in a question had to be identical with
the answerset obtained from dbpedia.org (dbpedia.org version:2016-04, date: 09.01.2017, dd.mm.yyyy)
7. Duplicates
Duplicates were identified by the hash of the English natural language question, and removed. If more than one duplicate of a question was present, the copy with the least errors was chosen for further handling.
You can find the corresponding code at:
https://github.com/AKSW/NLIWOD/blob/master/qa.commons/src/main/java/org/aksw/qa/commons/qald/Qald7CreationTool.java
Make sure to change the paths in the main method.
By running the creator, there will also be a file report created for all the disqualified questions.
You can find one for the latest run here:
https://github.com/AKSW/NLIWOD/blob/master/qa.commons/resources/qald/BadQuestionsfileReport.txt
The last line of the file report can be paticularly interesting:
"Unique Questions total in all Datasets: 520 Faulty: 305 beforehand removed duplicates: 617"
Which leaves uns with 520-305 = 215 good questions.
Note that the error with by far the highest occurrence is difference in answer sets.
All possible error flags are defined here:
https://github.com/AKSW/NLIWOD/blob/master/qa.commons/src/main/java/org/aksw/qa/commons/qald/Fail.java
## QALD-7-train-hybrid dataset
The qald7-train-hybrid dataset was created using the hybrid questions from QALD4 to QALD6.
Duplicates were identified by hash of english question string, and removed.
## QALD-7-train-largescale dataset
The qald7-train-largescale dataset was created by replacing the QALD1 to QALD5 question's instance data, mostly but not limited to named entities, by another random instance data of the same DBpedia class. The instance data was replaced in both the question and the query. Queries that did not give a proper result were removed.
## QALD-7-train-multilingual-wikidata dataset
The qald-7-train-en-wikidata dataset was created based on the qald-6-test-multilingual dataset from QALD-6. We took only the English questions and gold standard queries created for DBpedia and formulated corresponding queries to answer these questions from Wikidata. Due to different schema and data structure of Wikidata, some questions could not be answered using Wikidata. We replaced these questions with the ones taken from qald-6-train-multilingual.
The gold standard answers were generated using the Wikidata dumps from 09-01-2017 (https://dumps.wikimedia.org/wikidatawiki/entities/20170109/).
| 59.55 | 455 | 0.796809 | eng_Latn | 0.99388 |
80372865305d2013463f683eb1556deab434dcc9 | 3,152 | md | Markdown | revdep/problems.md | Bisaloo/lifecycle | b99f7ccf3b0c65d6f01e0acf8a8a1652156d0487 | [
"MIT"
] | null | null | null | revdep/problems.md | Bisaloo/lifecycle | b99f7ccf3b0c65d6f01e0acf8a8a1652156d0487 | [
"MIT"
] | null | null | null | revdep/problems.md | Bisaloo/lifecycle | b99f7ccf3b0c65d6f01e0acf8a8a1652156d0487 | [
"MIT"
] | null | null | null | # EpiNow2
<details>
* Version: 1.3.2
* GitHub: https://github.com/epiforecasts/EpiNow2
* Source code: https://github.com/cran/EpiNow2
* Date/Publication: 2020-12-14 09:00:15 UTC
* Number of recursive dependencies: 150
Run `cloud_details(, "EpiNow2")` for more info
</details>
## Newly broken
* checking installed package size ... NOTE
```
installed size is 265.8Mb
sub-directories of 1Mb or more:
libs 264.1Mb
```
## Newly fixed
* checking whether package ‘EpiNow2’ can be installed ... ERROR
```
Installation failed.
See ‘/tmp/workdir/EpiNow2/old/EpiNow2.Rcheck/00install.out’ for details.
```
# mcmcr
<details>
* Version: 0.4.0
* GitHub: https://github.com/poissonconsulting/mcmcr
* Source code: https://github.com/cran/mcmcr
* Date/Publication: 2020-09-27 04:40:03 UTC
* Number of recursive dependencies: 54
Run `cloud_details(, "mcmcr")` for more info
</details>
## Newly broken
* checking tests ... ERROR
```
Running ‘testthat.R’
Running the tests in ‘tests/testthat.R’ failed.
Last 13 lines of output:
3. └─lifecycle::signal_stage("deprecated", what)
4. └─lifecycle:::spec(what, env = env)
5. └─lifecycle:::spec_what(spec, "spec", signaller)
6. └─rlang::parse_expr(what)
7. └─rlang::parse_exprs(x)
8. └─rlang:::chr_parse_exprs(x)
9. └─rlang:::map(x, function(elt) as.list(parse(text = elt)))
10. └─base::lapply(.x, .f, ...)
11. └─rlang:::FUN(X[[i]], ...)
12. ├─base::as.list(parse(text = elt))
13. └─base::parse(text = elt)
[ FAIL 2 | WARN 0 | SKIP 0 | PASS 411 ]
Error: Test failures
Execution halted
```
# tidygate
<details>
* Version: 0.4.0
* GitHub: NA
* Source code: https://github.com/cran/tidygate
* Date/Publication: 2021-01-18 16:30:03 UTC
* Number of recursive dependencies: 72
Run `cloud_details(, "tidygate")` for more info
</details>
## Newly broken
* checking tests ... ERROR
```
Running ‘testthat.R’
Running the tests in ‘tests/testthat.R’ failed.
Complete output:
> library(testthat)
> library(tidygate)
>
> test_check("tidygate")
══ Failed tests ════════════════════════════════════════════════════════════════
── Failure (test-methods.R:75:5): gate DEPRECATED ──────────────────────────────
`\.` does not match "is deprecated as of tidygate 0.3.0.".
Actual value: "`gate\(\)` was deprecated in tidygate 0\.3\.0\.\\nPlease use `gate_chr\(\)` instead\.\\nThis warning is displayed once every 8 hours\.\\nCall `lifecycle::last_warnings\(\)` to see where this warning was generated\."
[ FAIL 1 | WARN 0 | SKIP 0 | PASS 3 ]
Error: Test failures
Execution halted
```
## In both
* checking dependencies in R code ... NOTE
```
Namespaces in Imports field not imported from:
‘lme4’ ‘methods’ ‘stats’ ‘tidyselect’
All declared Imports should be used.
```
| 27.649123 | 236 | 0.572652 | eng_Latn | 0.597933 |
80373312ea71f7f586965f04b698e32ad490bae6 | 711 | md | Markdown | source/projects/oscommerce.md | patrick-huyphan/eCommWar | b51ed2e067079c0d5c5246a0e608ccaf7cc922aa | [
"MIT"
] | 222 | 2017-02-01T18:08:19.000Z | 2022-01-17T11:01:42.000Z | source/projects/oscommerce.md | patrick-huyphan/eCommWar | b51ed2e067079c0d5c5246a0e608ccaf7cc922aa | [
"MIT"
] | 16 | 2017-02-14T05:36:31.000Z | 2020-03-04T09:49:51.000Z | source/projects/oscommerce.md | patrick-huyphan/eCommWar | b51ed2e067079c0d5c5246a0e608ccaf7cc922aa | [
"MIT"
] | 60 | 2017-02-05T01:00:12.000Z | 2021-09-14T06:32:08.000Z | ---
title: osCommerce
repo: osCommerce/oscommerce2
homepage: http://www.oscommerce.com
demo: N/A
language: PHP
framework: N/A
license: MIT
description: Creating Online Stores Worldwide.
---
We provide you the tools to set up your very own complete and self-hosted online store and website for free to securely sell products and services to customers worldwide.
You have complete access to and total control of your online store and data.
Our growing community of over 287,869 store owners, developers, and service providers are there to help you at every stage of running your online store and business. Over 7,700 free Add-Ons have been uploaded by the community to use and customize your online store with. | 44.4375 | 270 | 0.797468 | eng_Latn | 0.997244 |
8037f18a52b3e640c7419794ba8f3ff4022775a3 | 273 | md | Markdown | simplified-opds-auth-document-api/README.md | jonathangreen/Simplified-Android-Core | d832b391188c86858158ef702f308c6b507ddb61 | [
"Apache-2.0"
] | 24 | 2016-03-23T20:19:48.000Z | 2019-05-17T20:45:03.000Z | simplified-opds-auth-document-api/README.md | jonathangreen/Simplified-Android-Core | d832b391188c86858158ef702f308c6b507ddb61 | [
"Apache-2.0"
] | 356 | 2016-01-27T21:44:44.000Z | 2020-01-09T10:07:58.000Z | simplified-opds-auth-document-api/README.md | jonathangreen/Simplified-Android-Core | d832b391188c86858158ef702f308c6b507ddb61 | [
"Apache-2.0"
] | 22 | 2016-04-25T20:10:15.000Z | 2019-01-31T21:16:39.000Z | org.librarysimplified.opds.auth_document.api
===
The `org.librarysimplified.opds.auth_document.api` module specifies an
API for parsing OPDS authentication documents.
#### See Also
* [Authentication For OPDS 1.0](https://drafts.opds.io/authentication-for-opds-1.0.html)
| 27.3 | 88 | 0.783883 | kor_Hang | 0.321598 |
803815cc2524a5412396177e1f1d93173ef5fbca | 83 | md | Markdown | md_syntax/mata_help.md | HankBO/stata-language-server | 65555448d239f16d96c62f0f0798194566d0210d | [
"MIT"
] | 14 | 2021-08-13T20:04:54.000Z | 2022-03-07T05:57:50.000Z | md_syntax/mata_help.md | HankBO/stata-language-server | 65555448d239f16d96c62f0f0798194566d0210d | [
"MIT"
] | 2 | 2022-01-13T08:20:17.000Z | 2022-02-04T05:17:49.000Z | md_syntax/mata_help.md | HankBO/stata-language-server | 65555448d239f16d96c62f0f0798194566d0210d | [
"MIT"
] | 2 | 2022-01-12T20:59:35.000Z | 2022-03-07T05:35:43.000Z | ## Syntax
: `mata help` ...
: `help` ...
`help` need not be preceded by `mata`.
| 10.375 | 38 | 0.542169 | eng_Latn | 0.971301 |
803850747770ef23f2bd918665f0356fdd1aea7c | 842 | md | Markdown | docs/access/string-operators-access-custom-web-app.md | MicrosoftDocs/office-developer-client-docs.zh-CN | e0e2958677a0eb560027161eeccae29528d647be | [
"CC-BY-4.0",
"MIT"
] | 3 | 2018-11-14T02:50:23.000Z | 2021-04-21T00:13:46.000Z | docs/access/string-operators-access-custom-web-app.md | MicrosoftDocs/office-developer-client-docs.zh-CN | e0e2958677a0eb560027161eeccae29528d647be | [
"CC-BY-4.0",
"MIT"
] | 5 | 2018-11-30T15:41:39.000Z | 2021-12-08T02:53:08.000Z | docs/access/string-operators-access-custom-web-app.md | MicrosoftDocs/office-developer-client-docs.zh-CN | e0e2958677a0eb560027161eeccae29528d647be | [
"CC-BY-4.0",
"MIT"
] | 3 | 2018-08-09T20:27:19.000Z | 2019-10-13T18:16:54.000Z | ---
title: '字符串运算符 (Access 自定义 Web 应用) '
manager: kelbow
ms.date: 09/05/2017
ms.audience: Developer
ms.topic: reference
ms.localizationpriority: medium
ms.assetid: f7f626a5-10d3-4329-946f-682e03c268c3
description: ''
ms.openlocfilehash: e5ad7fbc64b8db57b491b356eca2da72e8a0998c
ms.sourcegitcommit: a1d9041c20256616c9c183f7d1049142a7ac6991
ms.translationtype: MT
ms.contentlocale: zh-CN
ms.lasthandoff: 09/24/2021
ms.locfileid: "59552316"
---
# <a name="string-operators-access-custom-web-app"></a>字符串运算符 (Access 自定义 Web 应用)
> [!IMPORTANT]
> Microsoft 不再建议在 SharePoint 中创建和使用 Access Web 应用程序。作为备选方法，请考虑使用 [Microsoft PowerApps](https://powerapps.microsoft.com/en-us/)，生成适用于 Web 和移动设备的无代码业务解决方案。
## <a name="in-this-section"></a>本节内容
- [+ (字符串连接运算符) (Access 自定义 Web 应用) ](plusstring-concatenation-operatoraccess-custom-web-app.md)
| 31.185185 | 154 | 0.769596 | yue_Hant | 0.390191 |
8038ae3d7a870880cadcacdcf4d5eea2e9153142 | 5,029 | md | Markdown | _posts/2019-04-25-Download-crooked-river-shelley-pearsall.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | 2 | 2019-02-28T03:47:33.000Z | 2020-04-06T07:49:53.000Z | _posts/2019-04-25-Download-crooked-river-shelley-pearsall.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | _posts/2019-04-25-Download-crooked-river-shelley-pearsall.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Crooked river shelley pearsall book
Cape Baranov was passed on the night before the 5th Barty rode with his mother in her green Chevrolet station wagon. The Sultan crooked river shelley pearsall bring him forth of the prison crooked river shelley pearsall questioned him of his story, curam mapparum gerente Nicolao Donis Germano, 'This woman is my wife and the voice is her voice. slipped a bolt through the latch rings, doesn't matter whatsoever with countless sharp, How to Have a Healthier Life through Autohypnosis. Sea-lion, and the few household Otto seemed to be the spokesman. "The goodwill they enjoyed during the last part of the voyage. And I don't feel easy about it. loathly, she kicked high over her head and grinned at me, James Burney. " substances, the "If you're a dowser. Wulfstan, and a moment later his hand holding the huge crooked river shelley pearsall of a broken mirror time they came scanning in his vicinity, an industry, not exactly a drawl and not exactly Deep South, ruthless secret agents? sufficiently that even in the gloom, Barty. it'd have to have been like that. into a raging tumult. He had had this queer feeling crooked river shelley pearsall trimming, and his body by now reduced to deformed bones, in a social situation, but to learn what I need to know. Greenlander's _umiak_ or woman's boat. Too cowardly for hand-to-hand combat, and they'll resent one another. "You are peddling Jesus door-to-door. He Sunbright told them all to get rid of the fellow, but if it others scattered in small flocks a little farther from the shore on This device. 118 another. All characters in this book are fictitious. " these attending officers matched the look that he had once turned upon the Now, huh?" Ea and The Deed of the Young King, and had elected finally to go to the surface on the crooked river shelley pearsall basis as the delegation to the Kuan-yin. charming company. "Elevations! " had eons ago circled too close to the treacherous bogs that swallowed them by no louder than before, "Could be risky," Bernard agreed after a second's reflection. Nauseating waves of righteous anger I'm just worried about the girl, driving Gammer's ox-team; he laid the floor and polished it the next day. Some crooked river shelley pearsall certainly shall," said Hidalga, so that he came to the end of all his good and there remained with him nothing save that which was upon him of raiment. " Crooked river shelley pearsall cut the air with her hands. Even from the top of a Over many proud generations and at least to the extent of second cousins, by the way. You will tell him to go. " brought a drying heat to her eyes. " On the dark side of dawn, confirming her intuition, hah-hah "Good girl. "Me, she'd "Sure. " worse than killing. "I'd be opposed," said Geneva, the three of them took an early lunch-or a late breakfast-at a room service table in the living room. He jumped inside his skin, Dr, "To bring Lebannen here," said the Herbal, and a light boat With her wrenched face and tortured voice, a wealthy recluse. 330 about this, she had reached him even though he didn't want to become involved. I came to learn. "Well, these two Cinderellas Curtis pushes open the bedroom door, brown face, if the Earthside tests on a roll of toilet paper didn't. When the crooked river shelley pearsall twilight gave way to night, sure. Remain poised, a crooked river shelley pearsall ticket to the gas chamber. umbilical linking them, on Lang. Is it that obvious?" beams, cozy, i, the challenging-joyous-frustrating-delightful-exhilarating chaos of a life full of hope and love and children, he didn't remember. that his soul received, in one direction completely free of ice, who sees things that aren't there," Kath said, no family photographs. brutal not cruel. Not that she'd made any attempts to communicate; she kept particulars of this remarkable voyage been rescued from complete "I am," he crooked river shelley pearsall, writhed. Seattle tomorrow. Geneva Davis. the vessels parted company, and a moment later his hand holding the huge fragment of a broken mirror time they came scanning in his vicinity. mortally cold that she came close up against him for the warmth of his body. Junior tossed the pad on the floor. Once the Doorkeeper came in, I already had the vague outline of a plan, and which shows that the Japanese, thin. you drunken, he pulls down both lower eyelids and examines his eyesв God knows you have to see this. ceiling, brightening half his forehead, Joe Lampion brooded crooked river shelley pearsall every known medical that supposed to mean something. "This card crooked river shelley pearsall mean also is family love, and he stepped Yakutsk, he'd slammed into Angel's room. Accordingly, for some reason, and shod with plates of whales' jawbones, O my masters. "Now," said Jack, "and discuss the situation over an early dinner, the bottles made fairy music. He had nothing against the English, opened! | 558.777778 | 4,925 | 0.788228 | eng_Latn | 0.999908 |
8038cda6ec048d3004083ae5bc3ee366d0799204 | 2,278 | md | Markdown | README.md | methridge/me-gcp-sandbox-network | 2d765379fe121f1bfb48c08ff65cd1c0b59c739e | [
"MIT"
] | null | null | null | README.md | methridge/me-gcp-sandbox-network | 2d765379fe121f1bfb48c08ff65cd1c0b59c739e | [
"MIT"
] | null | null | null | README.md | methridge/me-gcp-sandbox-network | 2d765379fe121f1bfb48c08ff65cd1c0b59c739e | [
"MIT"
] | 1 | 2021-08-06T19:11:56.000Z | 2021-08-06T19:11:56.000Z | # Terraform module to create GCP sandbox network
This module creates a GCP network and multiple subnets for use as a testing
sandbox. Regions and their subnets are specified in an object map.
## Deploying
- Create `terraform.tfvars` file
```hcl
admin-ip = ["200.200.100.100/32"]
project = "awesomeuser-sandbox"
username = "awesomeuser"
region-map = {
"us-west1" = {
"cidr" = "10.13.0.0/20"
}
"us-central1" = {
"cidr" = "10.13.16.0/20"
}
"us-east1" = {
"cidr" = "10.13.32.0/20"
}
}
```
<!-- BEGINNING OF PRE-COMMIT-TERRAFORM DOCS HOOK -->
## Requirements
| Name | Version |
|------|---------|
| terraform | >= 0.15 |
| google | >= 3.5 |
## Providers
| Name | Version |
|------|---------|
| google | 3.71.0 |
## Modules
| Name | Source | Version |
|------|--------|---------|
| region-cloud-router | terraform-google-modules/cloud-router/google | ~> 1.0 |
## Resources
| Name | Type |
|------|------|
| [google_compute_firewall.admin-access](https://registry.terraform.io/providers/hashicorp/google/latest/docs/resources/compute_firewall) | resource |
| [google_compute_network.network](https://registry.terraform.io/providers/hashicorp/google/latest/docs/resources/compute_network) | resource |
| [google_compute_route.route](https://registry.terraform.io/providers/hashicorp/google/latest/docs/resources/compute_route) | resource |
| [google_compute_subnetwork.subnetwork](https://registry.terraform.io/providers/hashicorp/google/latest/docs/resources/compute_subnetwork) | resource |
## Inputs
| Name | Description | Type | Default | Required |
|------|-------------|------|---------|:--------:|
| admin-ip | Your public IP for direct access | `list(string)` | n/a | yes |
| project | GCP Project name | `string` | n/a | yes |
| region-map | Object Map of Regions (key) with CIDR block IP range item. | <pre>map(<br> object({<br> cidr = string<br> })<br> )</pre> | n/a | yes |
| username | User name for access and to prefix all resources | `string` | n/a | yes |
## Outputs
| Name | Description |
|------|-------------|
| sandbox-network | Self link to the created network |
| sandbox-subnets | Sandbox Subnetwork Object |
<!-- END OF PRE-COMMIT-TERRAFORM DOCS HOOK -->
| 31.638889 | 161 | 0.625988 | kor_Hang | 0.341408 |
80392517aca999eb98ce4bdbefc56e281be7a4b6 | 912 | md | Markdown | en/common/u3d.md | reinhart1010/nix | a1803c718ead3b79854b65396c8967bd5ec32874 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | en/common/u3d.md | reinhart1010/nix | a1803c718ead3b79854b65396c8967bd5ec32874 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | en/common/u3d.md | reinhart1010/nix | a1803c718ead3b79854b65396c8967bd5ec32874 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
layout: page
title: common/u3d (English)
description: "Set of tools to interact with Unity from command line."
content_hash: caf331bf9a2a15039f2cb96b55617e64543eb57c
---
# u3d
Set of tools to interact with Unity from command line.
More information: <https://github.com/DragonBox/u3d>.
- Open project from the current directory in correct Unity version:
`u3d`
- List installed versions of Unity:
`u3d list`
- List available versions of Unity that can be downloaded:
`u3d available`
- Download and install latest stable Unity version:
`u3d install latest_stable`
- Download and install Unity version and editor [p]ackages:
`u3d install `<span class="tldr-var badge badge-pill bg-dark-lm bg-white-dm text-white-lm text-dark-dm font-weight-bold">2021.2.0f1</span>` -p `<span class="tldr-var badge badge-pill bg-dark-lm bg-white-dm text-white-lm text-dark-dm font-weight-bold">Unity,iOS,Android</span>
| 29.419355 | 275 | 0.763158 | eng_Latn | 0.865995 |
803965b5a0ac1103d7d5d4095b3c344e73a4d24f | 77 | md | Markdown | postgresql/rename.schema.md | fernandocanizo/short-tips | e5c82fa30d4461b2de6f95f87839d1d2c896467a | [
"MIT"
] | 2 | 2018-06-19T15:30:29.000Z | 2020-04-30T20:05:29.000Z | postgresql/rename.schema.md | fernandocanizo/short-tips | e5c82fa30d4461b2de6f95f87839d1d2c896467a | [
"MIT"
] | null | null | null | postgresql/rename.schema.md | fernandocanizo/short-tips | e5c82fa30d4461b2de6f95f87839d1d2c896467a | [
"MIT"
] | null | null | null | # Rename schema
```
alter schema <schemaName> rename to <newSchemaName>
```
| 12.833333 | 51 | 0.701299 | eng_Latn | 0.612461 |
8039e7d5e66de0b14fd79010590af3bd8ad412da | 385 | md | Markdown | README.md | kushal19057/The-Half-Bubble-Prince | 529607bf267e2d5701f105c2c15925c92ab7456b | [
"MIT"
] | null | null | null | README.md | kushal19057/The-Half-Bubble-Prince | 529607bf267e2d5701f105c2c15925c92ab7456b | [
"MIT"
] | null | null | null | README.md | kushal19057/The-Half-Bubble-Prince | 529607bf267e2d5701f105c2c15925c92ab7456b | [
"MIT"
] | null | null | null | # The Half Bubble Prince
An interactive game made using Processing and Arduino.
The project is one of the 7 teams among 80+ teams to receive a special mention from the professor.
## Team Members :
- Kushal Juneja
- Tathagat Pal
- Meetakshi Setiya
## Course
PIS (Protyping Interactive Systems) | Monsoon Semester | IIIT-D
Professor : Aman Parnami
## Demo
https://youtu.be/1dczSx3ZbD0
| 25.666667 | 98 | 0.766234 | eng_Latn | 0.944768 |
803a3ead8e0b9e97a726bf4644f3b12e78703d66 | 1,232 | md | Markdown | README.md | DSI-VD/web3_archi_dfx | a01b63e78fdb9e2ecab67ec278093fbe44a60072 | [
"BSD-3-Clause"
] | null | null | null | README.md | DSI-VD/web3_archi_dfx | a01b63e78fdb9e2ecab67ec278093fbe44a60072 | [
"BSD-3-Clause"
] | null | null | null | README.md | DSI-VD/web3_archi_dfx | a01b63e78fdb9e2ecab67ec278093fbe44a60072 | [
"BSD-3-Clause"
] | null | null | null | # web3_Archi_Dfx
Projet démo dFinity Web3
## Environnement GitPod
GitPod permet d'obtenir un environnement de développement complet dans votre navigateur en cliquant sur un bouton et être immédiatement prêt à coder. Idéal pour les env. Windows ou juste pour essayer.
### Prérequis
Avoir un compte sur gitpod.io lié à github
[](https://gitpod.io/#https://github.com/DSI-VD/web3_archi_dfx)
Lorsque le navigateur interne s'ouvre ajouter ce paramètre à la fin `?canisterId=ryjl3-tyaaa-aaaaa-aaaba-cai`
## Environnement local
### Prérequis
Autre chose que Windows X
Les paquets de dev. usuels pour votre environnement (ex: build-essential) plus : npm curl rsync git git-lfs
Un éditeur par exemple vscode
vscode:
* L'extension Motoko:
* Si version open source vscode [dfinity-foundation.vscode-motoko-0.3.9.vsix](https://ipfs.io/ipfs/bafybeiczpm5sslepsjc57b6wpvsnkua3ezsmfzeu7luooc2b2wuc7gwjxi?dfinity-foundation.vscode-motoko-0.3.9.vsix)
* Si version Microsoft Visual Studio [marketplace](https://marketplace.visualstudio.com/items?itemName=dfinity-foundation.vscode-motoko)
Le SDK dFinity `sh -ci "$(curl -fsSL https://smartcontracts.org/install.sh)"` | 38.5 | 207 | 0.781656 | fra_Latn | 0.775683 |
803a596653a0a096b3cd0bb5326d91d7d8cec38f | 1,118 | md | Markdown | README.md | UMCUGenetics/DxNextflowWGS | 2b00df57cc3e4c922c2ed7544867e4e178bbf549 | [
"MIT"
] | null | null | null | README.md | UMCUGenetics/DxNextflowWGS | 2b00df57cc3e4c922c2ed7544867e4e178bbf549 | [
"MIT"
] | 2 | 2020-10-21T05:08:54.000Z | 2020-11-02T14:30:05.000Z | README.md | UMCUGenetics/DxNextflowWGS | 2b00df57cc3e4c922c2ed7544867e4e178bbf549 | [
"MIT"
] | null | null | null | # DxNextflowWGS
Genome Diagnostics Nextflow WGS workflow
## Get Nextflow Modules
```bash
git submodule update --init --recursive
```
## Install Nextflow
```bash
mkdir tools && cd tools
curl -s https://get.nextflow.io | bash
```
## Running WGS workflow
```bash
nextflow run WGS.nf -c WGS.config --fastq_path <fastq_dir_path> --outdir <output_dir_path> --email <email> [-profile slurm|mac]
```
## QDNAseq GUIX container
```bash
guixr pack -f squashfs -RR -S /bin=bin r r-qdnaseq-hmf r-getoptlong perl bash glibc-utf8-locales tzdata coreutils procps grep sed bootstrap-binaries
cp /guix/path.gz.squashfs QDNAseq_v1.9.2-HMF.1.gz.squashfs
unsquashfs QDNAseq_v1.9.2-HMF.1.gz.squashfs
chmod -R 0775 squashfs-root
singularity build QDNAseq_v1.9.2-HMF.1.sif squashfs-root
```
## BAF container
```bash
guixr pack -f squashfs -RR -S /bin=bin bio-vcf r r-ggplot2 r-gtools r-pastecs bash glibc-utf8-locales tzdata coreutils procps grep sed bootstrap-binaries
cp /guix/path.gz.squashfs baf_nextflow.gz.squashfs
unsquashfs baf_nextflow.gz.squashfs
chmod -R 0775 squashfs-root
singularity build baf_nextflow.sif squashfs-root
``` | 31.055556 | 153 | 0.763864 | kor_Hang | 0.298266 |
803b0003a0430fec362a10b220d1f1d558845e80 | 12,499 | md | Markdown | content/posts/o-cache-e-o-http.md | kplaube/blog | b7255c997d5c5b652a1c022ae82b6706bf1cafaa | [
"MIT"
] | 9 | 2016-03-04T13:41:00.000Z | 2021-09-30T20:00:47.000Z | content/posts/o-cache-e-o-http.md | kplaube/blog | b7255c997d5c5b652a1c022ae82b6706bf1cafaa | [
"MIT"
] | 30 | 2015-06-14T20:18:59.000Z | 2022-02-27T05:08:10.000Z | content/posts/o-cache-e-o-http.md | kplaube/blog | b7255c997d5c5b652a1c022ae82b6706bf1cafaa | [
"MIT"
] | 3 | 2018-05-13T06:28:12.000Z | 2019-09-25T04:02:39.000Z | ---
title: "O cache e o HTTP"
date: 2012-05-14 23:14:46
tags: ["desenvolvimento-web", "infraestrutura", "cache", "http"]
slug: o-cache-e-o-http
thumbnail: ./images/performance.jpg
---
Em tempos de alta demanda, o **_cache_** pode tornar-se o melhor amigo das
aplicações [*web*][].
Através dele temos uma opção prática, acessível e barata para melhorar
performance, diminuir consumo de recursos e tempos de resposta. Qualquer
milissegundo economizado é um ponto a mais com o seu usuário, com os
mecanismos de busca e com o seu serviço de hospedagem.
Antes de falarmos de _cache_ em aplicações [*Django*][] ou
[*Codeigniter*][], acho interessante falarmos sobre o uso de _cache_ com
o protocolo _HTTP_. Afinal, é esta a primeira camada a “atacar” quando
precisamos melhorar os tempos de resposta das nossas aplicações _web_.
## O que é “caching”?
Segundo [*Kalid Azad*][]:
> Caching is a great example of the ubiquitous time-space tradeoff
> in programming. You can save time by using space to store
> results.
Basicamente, **_caching_** é o ato de “economizar processamento”
armazenando os seus resultados. Um bom exemplo é o temporário do seu
navegador, onde uma imagem que não teve alteração desde o momento do seu
_download_ é resgatada do seu disco e não da _internet_. Uma tarefa mais
rápida e menos custosa.
Logo, entendemos que o **_cache_** é um local em disco ou memória
utilizado para armazenar estes resultados. Ele pode se aplicar ao
_front-end_ (como ilustrado no exemplo acima), ou ao _back-end_, através
dos servidores _web_, como o _Apache_ e o [*Nginx*][], ou através de
ferramentas mais específicas, como _Memcached_ e _Redis_.
Assim como a definição de [*cookies* e sessões][], a utilização de
_cache_ nos navegadores _Web_ é feita através de informações
transmitidas pelo cabeçalho da requisição e resposta.
Existem quatro tipos de cabeçalhos específicos para _cache_ em _HTTP_.
Mas todos partem da premissa que o arquivo em questão (pode ser um
documento, imagem, _script_, etc) já está armazenado no disco do
internauta, acessível ao navegador.
## Last-Modified
Com o `Last-Modified`, o navegador informa ao servidor que irá baixar
um arquivo desde que a sua data de modificação seja diferente da data do
arquivo armazenado. Na requisição é passado o cabeçalho
`If-Modified-Since`, e se a data do arquivo no servidor for mais
recente, o navegador faz um novo _download_.
Vamos fazer uma requisição tendo como resposta um cabeçalho
`Last-Modified`:
```text
$ curl -i -I http://klauslaube.com.br/media/blog/security.jpg
HTTP/1.1 200 OK
...
Date: Tue, 01 May 2012 19:20:27 GMT
Last-Modified: Sat, 07 Apr 2012 17:51:10 GMT
...
```
Uma vez que o arquivo esteja em disco, o navegador tem como informar a
data da última alteração. Então, fazemos uma nova requisição ao arquivo
`security.jpg`, passando esta data no cabeçalho `If-Modified-Since`:
```text
$ curl -i -H "If-Modified-Since: Sat, 07 Apr 2012 17:51:10 GMT" http://klauslaube.com.br/media/blog/security.jpg
HTTP/1.1 304 Not Modified
Date: Tue, 01 May 2012 19:22:00 GMT
Last-Modified: Sat, 07 Apr 2012 17:51:10 GMT
```
A resposta `304 Not Modified` não traz o conteúdo do arquivo em seu
corpo, e é através desta resposta que o navegador sabe que não precisa
fazer o _download_ do arquivo, utilizando assim a versão que está em seu
_cache_.
## ETag
O modo como a `ETag` funciona é bem parecido com o conceito do
`Last-Modified`. A diferença está no método de comparação: ao invés de
fazer comparações pela data, são realizadas comparações através de
identificadores únicos, atribuídos aos arquivos envolvidos nas
requisições.
Quando trabalhamos com `ETag`, obtemos respostas com o seguinte
cabeçalho:
```text
$ curl -i -I http://localhost/exemplo-cache.html
HTTP/1.1 200 OK
...
Date: Tue, 01 May 2012 19:46:18 GMT
ETag: "2c6b0d8-13-4befe555d6f80"
...
```
É através do valor `2c6b0d8-13-4befe555d6f80` que navegador e servidor
saberão se aquele arquivo em questão já está armazenado em _cache_. Isso
é possível através do cabeçalho `If-None-Match`, enviado pelo
navegador na requisição:
```text
$ curl -i -I -H "If-None-Match: \"2c6b0d8-13-4befe555d6f80\"" http://localhost/exemplo-cache.html
HTTP/1.1 304 Not Modified
Date: Tue, 01 May 2012 19:50:40 GMT
ETag: "2c6b0d8-13-4befe555d6f80"
```
Uma vez que o valor bata com o identificador do arquivo, o servidor
informa ao navegador que não houve alterações. Então, o navegador
utiliza a versão do arquivo que está no temporário.
## Expires
A grande desvantagem dos dois métodos acima é que necessitamos consultar
o servidor para verificar a procedência do arquivo. Com o `Expires` e
`max-age` a “data de validade” vem junto com a requisição, logo, o
navegador já sabe quando o arquivo em seu _cache_ irá expirar, e só
voltará a consultar o servidor quando este tempo for alcançado.
Com o `Expires`, o servidor retorna no cabeçalho da resposta uma data
de validade para um determinado arquivo:
```text
$ curl -i -I http://klauslaube.com.br/media/blog/cookies.jpg
HTTP/1.1 200 OK
Date: Tue, 08 May 2012 01:49:13 GMT
...
Expires: Thu, 31 Dec 2037 23:55:55 GMT
...
```
Solicitando uma nova requisição para este mesmo arquivo, o navegador
analisará a data local e a data de expiração. Se a data atual for maior
que `Expires`, aí sim o navegador se comunicará com o servidor _web_,
e fará um novo _download_ do arquivo.
## max-age
Embora o `max-age` possa parecer um pouco enigmático, ele é (na minha
opinião) uma solução mais elegante e fácil de implementar que o
`Expires`.
Com o `Expires`, temos que informar uma data “absoluta” no cabeçalho,
ou seja, somos obrigados a dizer o dia da semana, mês, ano, hora, minuto
e até mesmo segundo em que determinado arquivo irá expirar. Logo, temos
o trabalho de interpretar a data da requisição (seja no servidor ou na
aplicação) adicionando o tempo que desejamos de _cache_ e imprimindo
este valor por extenso.
Com o `max-age` temos a opção de utilizar datas “relativas”, ou seja,
podemos dizer ao navegador que o arquivo irá expirar em 1 dia (em
segundos):
```text
$ curl -i http://localhost/exemplo-cache.html
HTTP/1.1 200 OK
Date: Mon, 14 May 2012 17:04:29 GMT
...
Cache-Control: max-age=86400, must-revalidate
...
```
Como você já deve ter reparado, não existe um índice de cabeçalho
específico chamado `max-age`. Ele é na verdade um valor do índice
`Cache-Control`.
O valor `must-revalidate` solicita aos mecanismos de _cache_ (você
pode estar “atrás” de um _proxy_) o seguinte: Quando o arquivo
ultrapassar o `max-age`, o _user-agent_ deve revalidar o conteúdo
junto ao servidor _Web_. Embora esse seja o comportamento esperado por
estes mecanismos, tornar esta informação explícita pode garantir que
ferramentas mais “obscuras” sigam este comportamento.
### Um pouco sobre o Cache-Control
O `Cache-Control` foi adicionado na especificação do
[*HTTP 1.1*][] com a finalidade de contornar
as limitações do `Expires`, e também de melhorar o controle sobre o
_cache_ de determinado conteúdo por diferentes tipos de mecanismos.
Além do uso do `max-age`, é através do `Cache-Control` que podemos
especificar o comportamento de _cache_ para o navegador (`private`),
para algum _proxy_, servidores intermediários ou requisições _HTTPS_
(`public`), ou ainda informarmos que não queremos fazer _caching_ do
conteúdo (`no-cache`).
[Leia mais sobre *Cache-Control*][].
Vale ressaltar que o `Cache-Control` tem precedência sobre o
`Expires`.
## Qual forma utilizar?
A resposta é: depende do cenário.
Para servir arquivos estáticos, a [*Webfaction*][] utiliza os cabeçalhos
`Last-Modified`, `Expires` e `max-age`, atribuindo aos dois
últimos valores absurdos de _cache_ (por exemplo, datas de expiração
para o ano de 2037). Isso garante que o seu navegador, _proxy_ ou
_gateway_ “nunca esqueça” de uma determina imagem, folha de estilos ou
arquivo [*Javascript*][].
Mesmo com o uso do `max-age`, é interessante ter o `Expires` como
alternativa, caso o navegador do internauta não compreenda instruções de
`Cache-Control`. Já a utilização do `Last-Modified`, segundo o [*Ask Apache*][],
não é lá muito interessante pois a sua utilização faz com
que alguns navegadores ignorem o cabeçalho `Expires`. Um argumento
mais relevante é a eliminação de procedimentos de validação (como o
`If-Modified-Since` e `If-None-Match`), deixando a cargo apenas do
`Expires` e `max-age` determinar o tempo de vida do estático em
_cache_.
Em páginas dinâmicas, onde um _cache_ de 5 ou 10 minutos possa ser
aplicado, o `max-age` com `Expires` é fundamental. Já em páginas que
necessitam de um conteúdo em tempo real, ou páginas que utilizam
informações de _cookies_ ou sessões, a ausência de _cache_ é
justificável.
Em documentos _HTML_ onde o conteúdo é atualizado com uma frequência
indeterminada, o uso de `Last-Modified` ou `ETag` é mais apropriado.
Uma vez que fica difícil determinar quando a atualização irá ocorrer, é
uma boa estratégia fazer com que o navegador atualize o conteúdo do seu
_cache_ quando necessário.
## Considerações Finais
Embora seja um conteúdo bem introdutório, acho fundamental sabermos as
diferentes maneiras de aplicar _cache_ com o protocolo _HTTP_ antes de
partirmos para soluções específicas. Essas recomendações não são
infalíveis, e em um cenário mais “extremo”, necessitam sim de auxílio de
algumas ferramentas disponíveis no mercado para tornar o _cache_
eficiente tanto para a experiência do usuário, quanto para a
estabilidade dos seus serviços.
Embora eu tenha utilizado o navegador _Web_ como foco das explicações,
“robôs”, ferramentas de _proxy_ e _gateways_ também podem fazer controle
de _cache_. O comportamento é basicamente o mesmo, variando de acordo
com instruções passadas no cabeçalho `Cache-Control`.
Como não sou nenhum “expert” no assunto, se você possui alguma sugestão
ou correção sobre o uso de _cache_ com _HTTP_, por favor, conte-nos
através dos comentários abaixo.
Até a próxima…
## Referências
- [*Ask Apache: Speed tips – Turn on Compressor*][]
- [*Better Explained: How To Optimize Your Site With HTTP Caching*][]
- [*Django Documentation: Django’s cache framework*][]
- [*Google Developers: HTTP Caching*][]
- [*John Yannakopoulos: HyperText Transfer Protocol – A Short Course*][]
- [*mnot.net: Caching Tutorial*][]
- [*Web Scaling Blog: Caching HTTP Headers, Cache-Control: max-age*][]
[*web*]: /tag/desenvolvimento-web.html "Leia mais sobre Web"
[*django*]: /tag/django.html "Leia mais sobre o Django"
[*codeigniter*]: /tag/codeigniter.html "Leia mais sobre Codeigniter"
[*kalid azad*]: http://betterexplained.com/articles/how-to-optimize-your-site-with-http-caching/ "How To Optimize Your Site With HTTP Caching"
[*nginx*]: /2011/12/19/nginx-poderoso-rapido-facil.html "Leia mais sobre Nginx"
[*cookies* e sessões]: /2012/04/05/entendendo-os-cookies-e-sessoes.html "Entendendo os Cookies e Sessões"
[*http 1.1*]: http://www.w3.org/Protocols/rfc2616/rfc2616.html "Conheça o protocolo HTTP versão 1.1"
[leia mais sobre *cache-control*]: http://www.mnot.net/cache_docs/#CACHE-CONTROL "Tutorial sobre HTTP caching"
[*webfaction*]: http://www.webfaction.com/ "Smarter web hosting"
[*javascript*]: /tag/javascript.html "Leia mais sobre Javascript"
[*ask apache*]: http://www.askapache.com/htaccess/apache-speed-last-modified.html "Remove Last-Modified Header"
[*ask apache: speed tips – turn on compressor*]: http://www.askapache.com/htaccess/apache-speed-compression.html "Material bem interessante sobre como melhorar a performance com Cache no Apache"
[*better explained: how to optimize your site with http caching*]: http://betterexplained.com/articles/how-to-optimize-your-site-with-http-caching/ "Excelente artigo falando sobre HTTP e cache"
[*django documentation: django’s cache framework*]: https://docs.djangoproject.com/en/dev/topics/cache/ "Leia mais sobre Cache no Django"
[*google developers: http caching*]: https://developers.google.com/speed/articles/caching "Bom material do Google sobre Caching"
[*john yannakopoulos: hypertext transfer protocol – a short course*]: http://condor.depaul.edu/dmumaugh/readings/handouts/SE435/HTTP/http.html "Conheça um pouco mais sobre o protocolo HTTP com este artigo científico"
[*mnot.net: caching tutorial*]: http://www.mnot.net/cache_docs/ "Excelente conteúdo sobre caching HTTP"
[*web scaling blog: caching http headers, cache-control: max-age*]: http://www.webscalingblog.com/performance/caching-http-headers-cache-control-max-age.html "Artigo bem objetivo descrevendo o uso do max-age"
| 43.1 | 216 | 0.770462 | por_Latn | 0.999215 |
803b76db2b1fe922056a4005c70f14dd4c5b4012 | 1,988 | md | Markdown | upwork-devs/faisal-adnan/Concept/README.md | a-khaledf/k8-traffic-generator | 832662afb0131961e6005c3bdd161c1c7dac149b | [
"Apache-2.0"
] | null | null | null | upwork-devs/faisal-adnan/Concept/README.md | a-khaledf/k8-traffic-generator | 832662afb0131961e6005c3bdd161c1c7dac149b | [
"Apache-2.0"
] | null | null | null | upwork-devs/faisal-adnan/Concept/README.md | a-khaledf/k8-traffic-generator | 832662afb0131961e6005c3bdd161c1c7dac149b | [
"Apache-2.0"
] | 1 | 2020-09-13T09:47:56.000Z | 2020-09-13T09:47:56.000Z | ## Introduction
This page describe the concept of testing an API endpoint.
### Testing an API endpoint
```puml
@startuml
TestingTool->API: GET or POST
API-->TestingTool: response
TestingTool->TestingTool: Assert the response
TestingTool->ELK: Send test result*
@enduml
```
*See [test result](#test-result)
## Validation logic
The Testing Tool must assert:
* the http status code
* one to several test logic
## Test Result object
The test result is sent to ELK. It is a JSON object that contains the following data:
```
{
"testId": "string", // UUID. This is a unique identifier across all tests.
"start": "integer", // Test start time in UTC format
"end": integer, // Test end time test in UTC format
"testDuration": number, // The duration of the test in microseconds
"testScenarionName": "string", // The name of the scenario
"testScenarionId": "string", // The id of the scenario
"testStepNo": integer, // The number of the test step
"testStepName": "string", // The name of the test step
"testDocUrl": "string", // The URL of the scenario documentation
"result": "string", // PASSED, FAILED or UNKNOWN
"error": "string", // The error code defined by the test scenario if the result is FAILED or UNKNOWN. For Rest API Testing, this is the HTTP Status Code.
"errorMessage": "string", // The error message or stacktrace received from the server
}
```
Above schema can be extended depending on the target API. For example, the Test Result of testing the Rebuild API should contain additional information, such as:
- Request Content Length
- Response Content Length
- GW API version
- GW Metrics
## Performance Metrics
List of performance metrics that can be generated by using the JSON Test Result:
- Number of test
- Number of successful/failed test
- Number of concurrent test
| 40.571429 | 175 | 0.669517 | eng_Latn | 0.954541 |
803b7e537ebdd2ef12522587ea046fa109e7022c | 825 | md | Markdown | _posts/2020-12-17-PID 공부5.md | leechangyo/leechangyo.github.io | f558310dcd06118500b6d24ff6c3d33af340d86b | [
"MIT"
] | 4 | 2021-05-14T08:26:11.000Z | 2022-01-15T04:14:13.000Z | _posts/2020-12-17-PID 공부5.md | leechangyo/leechangyo.github.io | f558310dcd06118500b6d24ff6c3d33af340d86b | [
"MIT"
] | null | null | null | _posts/2020-12-17-PID 공부5.md | leechangyo/leechangyo.github.io | f558310dcd06118500b6d24ff6c3d33af340d86b | [
"MIT"
] | null | null | null | ---
layout: post
title: 5. Laplace Transforms : Solving linear Differential Equations
category: Control System
tag: Control System
---
<a href="https://postimg.cc/p5QBph3x"><img src="https://i.postimg.cc/tJwvvF51/Capture.jpg" width="700px" title="source: imgur.com" /><a>
<a href="https://postimg.cc/mc03jysB"><img src="https://i.postimg.cc/d10Wq5Nk/Capture.jpg" width="700px" title="source: imgur.com" /><a>
<a href="https://postimg.cc/gXVM6T6f"><img src="https://i.postimg.cc/V6T22ysL/Capture.jpg" width="700px" title="source: imgur.com" /><a>
<a href="https://postimg.cc/ZCRcTRVk"><img src="https://i.postimg.cc/8PdnmfvC/Capture.jpg" width="700px" title="source: imgur.com" /><a>
<a href="https://postimg.cc/QBLkkqss"><img src="https://i.postimg.cc/jj2gT8FW/Capture.jpg" width="700px" title="source: imgur.com" /><a>
| 48.529412 | 136 | 0.707879 | kor_Hang | 0.1247 |
803bfceffa41ff1fc5fcb3cc325d8e7cd21ee215 | 709 | md | Markdown | verification/cbmc/proofs/aws_cryptosdk_verify_header/README.md | robin-aws/aws-encryption-sdk-c | ed3980886e8ca5ac24ee454624ebc96568501462 | [
"Apache-2.0"
] | 40 | 2019-05-23T01:45:26.000Z | 2022-02-27T13:57:06.000Z | verification/cbmc/proofs/aws_cryptosdk_verify_header/README.md | robin-aws/aws-encryption-sdk-c | ed3980886e8ca5ac24ee454624ebc96568501462 | [
"Apache-2.0"
] | 240 | 2019-05-20T22:34:12.000Z | 2022-02-22T18:08:02.000Z | verification/cbmc/proofs/aws_cryptosdk_verify_header/README.md | robin-aws/aws-encryption-sdk-c | ed3980886e8ca5ac24ee454624ebc96568501462 | [
"Apache-2.0"
] | 53 | 2019-05-23T01:45:10.000Z | 2022-03-17T20:20:01.000Z | # Memory safety proof for aws_cryptosdk_verify_header
This proof harness attains 91% code coverage. The following comments explain
why the uncovered lines of code are unreachable code.
Some functions contain unreachable blocks of code:
* `assert_byte_buf_equivalence`
* lhs==rhs never holds
* This assertion is called from the harness
* To check desired property, header==old_header does not hold by design though assert_byte_buf_equivalence should
* `aws_cryptosdk_alg_properties_is_valid`
* std_alg_props is never NULL as it is constructed from a aws_cryptosdk_alg_id
* `EVP_DecryptUpdate`
* Variable out is always NULL as hard-coded in the aws_cryptosdk_verify_header function | 35.45 | 117 | 0.798307 | eng_Latn | 0.997393 |
803c0ce7bf21a0806342113c4b77d61cddcfad03 | 1,301 | md | Markdown | _creatures/dogmole.md | 5ecompendium/bestiary2 | cca658a7536f9e5afd795731bb70f96da700e76a | [
"MIT"
] | 4 | 2019-09-16T12:25:41.000Z | 2022-03-03T10:43:10.000Z | _creatures/dogmole.md | 5ecompendium/bestiary2 | cca658a7536f9e5afd795731bb70f96da700e76a | [
"MIT"
] | null | null | null | _creatures/dogmole.md | 5ecompendium/bestiary2 | cca658a7536f9e5afd795731bb70f96da700e76a | [
"MIT"
] | 5 | 2019-08-21T18:50:47.000Z | 2021-04-27T19:52:29.000Z | ---
layout: creature
name: "Dogmole"
tags: [medium, beast, cr1, tome-of-beasts]
cha: 10 (+0)
wis: 12 (+1)
int: 2 (-4)
con: 15 (+2)
dex: 17 (+3)
str: 14 (+2)
size: Medium beast
alignment: neutral
challenge: "1 (200 XP)"
languages: "--"
senses: "blindsight 30 ft., passive Perception 11"
speed: "30 ft., burrow 10 ft., swim 10 ft."
hit_points: "71 (11d8 + 22)"
armor_class: "14 (natural armor)"
---
***Burrow.*** Dogmoles cannot burrow into solid rock, but they can move through softer material like soil or loose rubble, leaving a usable tunnel 5 feet in diameter.
***Wormkiller Rage.*** Wild dogmole packs are famed for their battles against monsters in the dark caverns of the world. If the dogmole draws blood against vermin, a purple worm, or other underground invertebrates, it gains a +4 boost to its Strength and Constitution, but suffers a -2 penalty to its AC. The wormkiller rage lasts for 3 rounds. It cannot end the rage voluntarily while the creatures that sent it into a rage still lives.
### Actions
***Multiattack.*** The dogmole makes one claw attack and one bite attack.
***Bite.*** Melee Weapon Attack: +4 to hit, reach 5 ft., one target. Hit: 5 (1d6 + 2) piercing damage.
***Claw.*** Melee Weapon Attack: +4 to hit, reach 5 ft., one target. Hit: 12 (3d6 +2) slashing damage.
| 39.424242 | 437 | 0.710992 | eng_Latn | 0.984876 |
803da429f2963a89e7a97a66d2ee992a76aa095d | 2,239 | md | Markdown | src/el/2019-02/12/03.md | PrJared/sabbath-school-lessons | 94a27f5bcba987a11a698e5e0d4279b81a68bc9a | [
"MIT"
] | 68 | 2016-10-30T23:17:56.000Z | 2022-03-27T11:58:16.000Z | src/el/2019-02/12/03.md | PrJared/sabbath-school-lessons | 94a27f5bcba987a11a698e5e0d4279b81a68bc9a | [
"MIT"
] | 367 | 2016-10-21T03:50:22.000Z | 2022-03-28T23:35:25.000Z | src/el/2019-02/12/03.md | PrJared/sabbath-school-lessons | 94a27f5bcba987a11a698e5e0d4279b81a68bc9a | [
"MIT"
] | 109 | 2016-08-02T14:32:13.000Z | 2022-03-31T10:18:41.000Z | ---
title: 'Πρωτα Η Οικογενεια'
date: 17/06/2019
---
Λογικά οι πρώτοι που ακούνε τη μαρτυρία μας για το ευαγγέλιο είναι τα μέλη του σπιτιού μας. Δεν υπάρχει πιο σημαντικό πεδίο αποστολής.
`Τι συμπεράσματα μπορούμε να αντλήσουμε από το Ιωάν. 1:40-42 για τη μαρτυρία στο σπίτι; Δείτε επίσης Δευτ. 6:6,7, Ρουθ 1:14-18.`
Μία ενθουσιώδης αναφορά. Ο Ανδρέας δεν μίλησε απλώς στον αδερφό του Σίμωνα για τον Ιησού, αλλά κανόνισε να συναντηθούν. Η ενθουσιώδης αναφορά για τον Ιησού και το να Τον συστήσουμε προσωπικά, είναι ένας απλός τρόπος να μοιραστούμε το ευαγγέλιο με τους συγγενείς μας. Μετά τις συστάσεις ο Ανδρέας αποτραβήχτηκε. Από εκείνη τη στιγμή ο Ιησούς και ο Πέτρος απέκτησαν τη δική τους προσωπική σχέση.
Βοηθώντας τα παιδιά στην πίστη. Τα παιδιά μπορεί να παραμεληθούν και να μη θεωρηθούν πιθανοί δέκτες της μαρτυρίας του ευαγγελίου. Οι γονείς εσφαλμένα υποθέτουν ότι τα παιδιά θα απορροφήσουν την οικογενειακή πνευματικότητα. Αυτό είναι κάτι που δεν πρέπει να θεωρηθεί ως δεδομένο. Ενώ τα παιδιά και οι νέοι μαθαίνουν από τα πρότυπα που παρατηρούν, είναι αλήθεια πως τα νέα αυτά μέλη της οικογένειας του Κυρίου χρειάζονται προσοχή και ευκαιρίες για να γνωρίσουν προσωπικά τον Ιησού. Στο Δευτ. 6:δίνεται ιδιαίτερη έμφαση σ’ αυτό το σημείο. Πρέπει να δίνεται η ανάλογη προσοχή στην πιο αποτελεσματική θρησκευτική εκπαίδευση. Στο σπίτι είναι καλό να υπάρχουν τακτικές πνευματικές συνήθειες, τόσο προσωπικής όσο και οικογενειακής λατρείας. Χρόνος και ένθερμες προσπάθειες πρέπει να έχουν την πρώτη θέση για χάρη των παιδιών και των νέων.
`Τι μπορούμε να διδαχθούμε από τις ευαγγελιστικές προσπάθειες της Ναομί; Ρουθ. 1:8-22.`
Η Ρουθ είδε τη Ναομί στις ποιο άσχημες στιγμές της: Όταν προσπάθησε να διώξει τη νύφη της, και όταν με πόνο και οργή ξέσπασε στον Θεό για τις απώλειές της (Ρουθ 115,20,21). Η μαρτυρία της Ρουθ μας δείχνει ότι οι νέοι μπορούν να αφιερωθούν στον τέλειο Θεό ακόμη και αν Τον έχουν γνωρίσει από έναν ατελή γονιό.
`Σκεψη: Πώς το γεγονός ότι το σπίτι είναι το σημαντικό πεδίο αποστολής επηρεάζει τη συμπεριφορά σας προς εκείνους με τους οποίους ζείτε; Συνεργαστείτε ως οικογένεια και ετοιμάστε μία λίστα με συγκεκριμένες προσπάθειες για να οδηγήσετε στον Χριστό συγγενείς σας που δεν έχουν ακόμη πιστέψει.` | 124.388889 | 830 | 0.807503 | ell_Grek | 1.00001 |
80405735ac85d0f40fd0029ff6d69055edda48c7 | 311 | md | Markdown | _posts/2017-06-01-main-category.md | institutotim/zup-knowledge-base | 5a5107edaccd68f7c3d3ac229ed65aacb9ce9a1b | [
"MIT"
] | 11 | 2018-05-24T22:13:56.000Z | 2022-03-29T22:17:42.000Z | _posts/2017-06-01-main-category.md | institutotim/zup-knowledge-base | 5a5107edaccd68f7c3d3ac229ed65aacb9ce9a1b | [
"MIT"
] | null | null | null | _posts/2017-06-01-main-category.md | institutotim/zup-knowledge-base | 5a5107edaccd68f7c3d3ac229ed65aacb9ce9a1b | [
"MIT"
] | 5 | 2020-03-21T08:32:21.000Z | 2022-02-26T19:20:15.000Z | ---
date: 2017-06-01
title: Categoria Principal
categories:
- Categoria de Relato
description: "Categoria Principal"
type: Document
---
Se for selecionado uma categoria principal, a categoria que esta sendo criada será uma subcategoria no sistema, permitindo que exista categoria e um nível de subcategoria.
| 28.272727 | 171 | 0.790997 | por_Latn | 0.988643 |
80411ebd877ed0de25c16562d58bc8570233bdcc | 1,745 | md | Markdown | docs/connect/jdbc/reference/getmultisubnetfailover-method-sqlserverdatasource.md | polocco/sql-docs.it-it | 054013d9cd6f2c81f53fc91a7eafc8043f12c380 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/connect/jdbc/reference/getmultisubnetfailover-method-sqlserverdatasource.md | polocco/sql-docs.it-it | 054013d9cd6f2c81f53fc91a7eafc8043f12c380 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/connect/jdbc/reference/getmultisubnetfailover-method-sqlserverdatasource.md | polocco/sql-docs.it-it | 054013d9cd6f2c81f53fc91a7eafc8043f12c380 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
description: Metodo getMultiSubnetFailover (SQLServerDataSource)
title: Metodo getMultiSubnetFailover (SQLServerDataSource) | Microsoft Docs
ms.custom: ''
ms.date: 01/19/2017
ms.prod: sql
ms.prod_service: connectivity
ms.reviewer: ''
ms.technology: connectivity
ms.topic: conceptual
ms.assetid: 1e8cb175-5f4c-4208-b4f5-3646990a30e3
author: David-Engel
ms.author: v-daenge
ms.openlocfilehash: ea1decabd2ed631249d894aaaf8b077c405036f5
ms.sourcegitcommit: e700497f962e4c2274df16d9e651059b42ff1a10
ms.translationtype: HT
ms.contentlocale: it-IT
ms.lasthandoff: 08/17/2020
ms.locfileid: "88435373"
---
# <a name="getmultisubnetfailover-method-sqlserverdatasource"></a>Metodo getMultiSubnetFailover (SQLServerDataSource)
[!INCLUDE[Driver_JDBC_Download](../../../includes/driver_jdbc_download.md)]
Restituisce il valore della proprietà di connessione **multiSubnetFailover**.
## <a name="syntax"></a>Sintassi
```vb
public boolean getMultiSubnetFailover();
```
## <a name="return-value"></a>Valore restituito
Restituisce true o false, a seconda dell'impostazione corrente della proprietà di connessione.
## <a name="remarks"></a>Osservazioni
Per altre informazioni sulla proprietà di connessione **multiSubnetFailover**, vedere [Impostazione delle proprietà di connessione](../../../connect/jdbc/setting-the-connection-properties.md).
## <a name="see-also"></a>Vedere anche
[SQLServerDataSource.setMultiSubnetFailover](../../../connect/jdbc/reference/setmultisubnetfailover-method-sqlserverdatasource.md)
[Membri di SQLServerDataSource](../../../connect/jdbc/reference/sqlserverdatasource-members.md)
[Classe SQLServerDataSource](../../../connect/jdbc/reference/sqlserverdatasource-class.md)
| 39.659091 | 195 | 0.771347 | ita_Latn | 0.30887 |
8041625a8391f9973e8f0af85b895f100b2072ae | 1,936 | md | Markdown | fBm/README.md | AbdollahRida/MathFi | bf392e76793940c477c73016f44c5192e902c6b0 | [
"MIT"
] | 1 | 2019-01-15T12:54:27.000Z | 2019-01-15T12:54:27.000Z | fBm/README.md | AbdollahRida/MathFi | bf392e76793940c477c73016f44c5192e902c6b0 | [
"MIT"
] | null | null | null | fBm/README.md | AbdollahRida/MathFi | bf392e76793940c477c73016f44c5192e902c6b0 | [
"MIT"
] | null | null | null | # Fractional Brownian motion
Fractional Brownian motion generation using Hosking's and Cholesky's methods. Everything is nicely packaged in a python class.
## Definition
Let $H \in ]0,1[$ be a constant. The (1-parameter) fractional Brownian motion (fBm) with Hurst parameter H is the centered Gaussian process $B_H(t) = B_H(t,\omega ), t \in \mathbb{R}, \omega \in \Omega$, satisfying:
$$\mathbb{E}[B_H(s)B_H(t)] = \frac{1}{2}(|s^{2H}|+|t|^{2H}-|s-t|^{2H})$$
Here $\mathbb{E}$ denotes the expectation with respect to the probability measure $\mathbb{P}$ for $\{B_H(t)\}_{t \in \mathbb{R}} = \{B_H(t,\omega); t \in \mathbb{R}, \omega \in \Omega\}$, where $(\Omega, \mathcal{F})$ is a measurable space.
It has stationary increments and is \textit{self-similar} with parameter H: $(B_H(t))_{t \in \mathbb{R}}$ has the same law as $(a^HB_H(t))_{t \in \mathbb{R}}$ for any $a > 0$. Furthermore, sample paths of the fBm have a.s. Hölder regularity $H-\varepsilon$ for any $\varepsilon > 0$.
The fBm has interesting properties. First of all one notices that if $H = \frac{1}{2}$ then the process $B_H(t)$ coincides with the classical Brownian motion.
If $H > \frac{1}{2}$ then we say that $B_H(t)$ is \textit{persistent}, in the sense that:
$$\sum_{i=1}^\infty Cov[B_H(i+1)-B_H(i), B_H(1)] = \infty$$
This shows that the autocovariance function of the fBm increments decays slowly. This long memory property of the increments when $H > \frac{1}{2}$ motivates its use when modeling persistent phenomena.
If $H < \frac{1}{2}$ then we say that the process is \textit{anti-persistent}, in the sense that:
$$\sum_{i=1}^\infty |Cov[B_H(i+1)-B_H(i), B_H(1)]| < \infty$$
It is worth noting that if $H \neq \frac{1}{2}$ then $B_H$ is not a semi-martingale, so we cannot use the general theory of stochastic calculus for semi-martingales on $B_H$. We thus need a new stochastic calculus for the fBm.
*iPyNB soon with examples and some math*
| 71.703704 | 283 | 0.697831 | eng_Latn | 0.98745 |
80418f422d7921d5f6473f48cf035c9178c65588 | 5,880 | md | Markdown | app/views/content/blog/top-tips-for-returning-teachers.md | GayeCord/get-into-teaching-app | 75a8fd3b95e7fcf07f3b03846cdc2456071b2807 | [
"MIT"
] | 6 | 2021-03-15T15:53:02.000Z | 2021-12-09T22:56:34.000Z | app/views/content/blog/top-tips-for-returning-teachers.md | GayeCord/get-into-teaching-app | 75a8fd3b95e7fcf07f3b03846cdc2456071b2807 | [
"MIT"
] | 2,221 | 2020-05-06T08:16:29.000Z | 2022-03-31T17:26:35.000Z | app/views/content/blog/top-tips-for-returning-teachers.md | GayeCord/get-into-teaching-app | 75a8fd3b95e7fcf07f3b03846cdc2456071b2807 | [
"MIT"
] | 6 | 2020-12-21T15:44:47.000Z | 2022-03-18T16:12:07.000Z | ---
title: Top tips for returning teachers
date: "2021-06-15"
images:
calculator:
path: "media/images/content/blog/calculator.jpg"
alt: "A photograph of a calculator and maths worksheet"
description: |-
Do you already hold Qualified Teacher Status? Bring your valuable experience back to the classroom with help from the Department for Education.
keywords:
- returning to teaching
tags:
- returning to teaching
---
$calculator$
If you’re thinking of returning to the classroom, now could be a great time. After a period of disruption for so many pupils, you could help those most affected to get back on track. Bring your valuable experience back to the classroom with help from the Department for Education.
## Not sure where to start? Watch our helpful guide
<div data-controller="aspect-ratio" data-aspect-ratio-width-value="560" data-aspect-ratio-height-value="290">
<iframe
loading="lazy"
src="https://www.youtube-nocookie.com/embed/_oQ4DTXkGHk"
frameborder="0"
allow="autoplay; encrypted-media"
allowfullscreen
></iframe>
</div>
> Having a designated person to talk to and to check in with is a huge help.
>
> _John Farrell, returning maths teacher_
## Read up on how things have changed since you were last in the classroom
The Department for Education are working with schools to take action in a number of areas to address issues that teachers may face. From [workload reduction](https://www.gov.uk/guidance/school-workload-reduction-toolkit), to [pupil behaviour](https://www.gov.uk/guidance/behaviour-hubs), [wellbeing](https://www.gov.uk/guidance/education-staff-wellbeing-charter) and [flexible working opportunities](https://www.gov.uk/government/collections/flexible-working-resources-for-teachers-and-schools), you may find that the classroom looks very different from when you last taught.
It’s also a good idea to read up on the latest [Teachers’ Standards](https://www.gov.uk/government/publications/teachers-standards) and review changes to the [curriculum](https://www.gov.uk/topic/schools-colleges-childrens-services/curriculum-qualifications).
> Laura [Return to Teaching Adviser] identified the problems that I would have with my references being old and suggested how I could overcome that in the short term and the medium term. Laura also reviewed my applications and spoke to me before the interview. I found this extremely helpful. As I have been out of the profession for some time, there are very few people I could talk to in detail about my interview lesson.
>
> Laura is very knowledgeable and she put me at ease, giving me good, practical advice and her highlighting my strengths gave me confidence. Laura struck the perfect balance between being professional and friendly. She was always quick to respond and everything she said added value. Particularly around the interview stage, I felt like I had a wise friend that I could look to for advice. I would certainly recommend her to others.
>
> _Lara Griffiths, returning maths teacher_
## Teaching maths, physics or languages? Get free one-to-one support
If you hold [Qualified Teacher Status](https://www.gov.uk/guidance/qualified-teacher-status-qts) to teach maths, physics or languages, you can access a wealth of personalised guidance from a [Return to Teaching Adviser](https://adviser-getintoteaching.education.gov.uk/) (RTTA).
From helping you to brush up on your subject knowledge to preparing for interviews, our advisers will be with you every step of the way and help you get back in the classroom.
<div data-controller="aspect-ratio" data-aspect-ratio-width-value="560" data-aspect-ratio-height-value="290">
<iframe
loading="lazy"
src="https://www.youtube-nocookie.com/embed/2NrLm_XId4k"
frameborder="0"
allow="autoplay; encrypted-media"
allowfullscreen
></iframe>
</div>
> Kathryn [RTTA] has been central in my engagement in the programme. She made it incredibly easy to find all the information needed and is always on hand with first class advice.
>
> _John Farrell, returning maths teacher_
## Not sure about a full return just yet? Consider the National Tutoring Programme
The National Tutoring Programme supports schools to close the attainment gap in light of the coronavirus pandemic and provides two different options to return to a school environment without taking on a full-time or part-time classroom role.
If you’re unsure about taking on a teaching role at this time, consider applying to tutor or mentor through the [National Tutoring Programme](https://nationaltutoring.org.uk/).
## Make the most of support available online
Check to see if there are any upcoming [online events](/event-categories/online-q-as) for returning teachers. Look up podcasts and articles on education to help familiarise yourself with current issues.
> I wouldn’t have got the job without Zaid [RTTA]! He has been both honest, factual and realistic.”
>
> _Karen Watson, returning maths teacher_
## Set up job alerts through the Teaching Vacancies service
Once you have made the decision to return to teaching what’s the best way of finding that full or part-time role? The Department for Education’s [Teaching Vacancies](https://teaching-vacancies.service.gov.uk/) job-listing service lets you search for roles in your area, filtering results by job role, education phase and working pattern. You can also set up alerts so you’re the first to know about new opportunities.
Remember though that teacher recruitment goes in cycles, with most teaching roles being advertised from January onwards. Setting up a job alert will mean you don’t miss out on your perfect role.
_[Find out more about returning to teaching](/returning-to-teaching). If you’re a qualified maths, physics or languages teacher, [get your Return to Teaching Adviser now](https://adviser-getintoteaching.education.gov.uk/)._
| 66.067416 | 575 | 0.781633 | eng_Latn | 0.997953 |
8043978cf1b71615c2ef2e0a733493bc9f1a9f4b | 2,233 | md | Markdown | scripting-docs/winscript/reference/idebugdocumenthelper-init.md | LouisFr81/visualstudio-docs.fr-fr | e673e36b5b37ecf1f5eb97c42af84eed9c303200 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | scripting-docs/winscript/reference/idebugdocumenthelper-init.md | LouisFr81/visualstudio-docs.fr-fr | e673e36b5b37ecf1f5eb97c42af84eed9c303200 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | scripting-docs/winscript/reference/idebugdocumenthelper-init.md | LouisFr81/visualstudio-docs.fr-fr | e673e36b5b37ecf1f5eb97c42af84eed9c303200 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: IDebugDocumentHelper::Init | Microsoft Docs
ms.custom: ''
ms.date: 01/18/2017
ms.prod: windows-script-interfaces
ms.reviewer: ''
ms.suite: ''
ms.tgt_pltfrm: ''
ms.topic: reference
apiname:
- IDebugDocumentHelper.Init
apilocation:
- pdm.dll
helpviewer_keywords:
- IDebugDocumentHelper::Init
ms.assetid: 1dd5a01f-0779-4109-8c6c-f16f5a3835bf
caps.latest.revision: 8
author: mikejo5000
ms.author: mikejo
manager: ghogen
ms.openlocfilehash: d4bcb64b7bbb1c61e7f031d872f7d1440fd17833
ms.sourcegitcommit: 116e9614867e0b3c627ce9001012a4c39435a42b
ms.translationtype: MT
ms.contentlocale: fr-FR
ms.lasthandoff: 01/08/2019
ms.locfileid: "54086630"
---
# <a name="idebugdocumenthelperinit"></a>IDebugDocumentHelper::Init
Le `Init` méthode Initialise une assistance de document de débogage avec un nom et d’attributs initiaux.
## <a name="syntax"></a>Syntaxe
```cpp
HRESULT Init(
IDebugApplication* pda,
LPCOLESTR pszShortName,
LPCOLESTR pszLongName,
TEXT_DOC_ATTR docAttr
);
```
#### <a name="parameters"></a>Paramètres
`pda`
[in] L’application de débogage associée à ce document.
`pszShortName`
[in] Chaîne se terminant par null qui contient le nom court du document.
`pszLongName`
[in] Chaîne se terminant par null qui contient le nom long du document.
`docAttr`
[in] Spécifie les attributs du document texte.
## <a name="return-value"></a>Valeur de retour
La méthode retourne `HRESULT`. Les valeurs possibles sont notamment celles figurant dans le tableau suivant.
|Value|Description|
|-----------|-----------------|
|`S_OK`|La méthode a réussi.|
## <a name="remarks"></a>Notes
Cette méthode Initialise une assistance de document de débogage avec un nom et d’attributs initiaux.
Ce document n’apparaît pas dans l’arborescence jusqu'à ce que `IDebugDocumentHelper::Attach` est appelée.
## <a name="see-also"></a>Voir aussi
[IDebugDocumentHelper::Attach](../../winscript/reference/idebugdocumenthelper-attach.md)
[Interface IDebugDocumentHelper](../../winscript/reference/idebugdocumenthelper-interface.md)
[Constantes TEXT_DOC_ATTR](../../winscript/reference/text-doc-attr-constants.md) | 31.9 | 111 | 0.720555 | fra_Latn | 0.302556 |
80439c4902d42c568f84557411eafdc6f3f68860 | 59 | md | Markdown | README.md | coyad45/Beta | 31aee2e1dc657f43abdd67109d3d0b74092f4569 | [
"Apache-2.0"
] | null | null | null | README.md | coyad45/Beta | 31aee2e1dc657f43abdd67109d3d0b74092f4569 | [
"Apache-2.0"
] | null | null | null | README.md | coyad45/Beta | 31aee2e1dc657f43abdd67109d3d0b74092f4569 | [
"Apache-2.0"
] | null | null | null | # Beta
Es la beta del curso que hicimos en el curso de git
| 19.666667 | 51 | 0.745763 | spa_Latn | 0.990526 |
8043d52c69b06b73c6581c5d805daf2669badb02 | 232 | md | Markdown | site/content/people/david-silva.md | sugarsyntax/website-1 | b789fb95b757b9ef1f3a4db86e38ea80e252cf9e | [
"MIT"
] | null | null | null | site/content/people/david-silva.md | sugarsyntax/website-1 | b789fb95b757b9ef1f3a4db86e38ea80e252cf9e | [
"MIT"
] | null | null | null | site/content/people/david-silva.md | sugarsyntax/website-1 | b789fb95b757b9ef1f3a4db86e38ea80e252cf9e | [
"MIT"
] | null | null | null | ---
title: David Silva
image: "/assets/img/people/david-silva.jpeg"
description: Senior Developer at Slingshot Health
link: https://linkedin.com/in/dvidsilva
location: New York City
weight: 1
role: Co-founder, Current Organizer
---
| 23.2 | 49 | 0.767241 | eng_Latn | 0.276871 |
80446196aea7c3509a85ce2032b93b942d3513e3 | 4,524 | md | Markdown | docs/site/Database-migrations.md | u8sand/loopback-next | ad0229b6711184da5a00c66ddeba585afe89eb79 | [
"MIT"
] | 1 | 2020-09-06T02:34:31.000Z | 2020-09-06T02:34:31.000Z | docs/site/Database-migrations.md | SamMalayek/loopback-next | ad0229b6711184da5a00c66ddeba585afe89eb79 | [
"MIT"
] | null | null | null | docs/site/Database-migrations.md | SamMalayek/loopback-next | ad0229b6711184da5a00c66ddeba585afe89eb79 | [
"MIT"
] | null | null | null | ---
lang: en
title: 'Database Migrations'
keywords: LoopBack 4.0
sidebar: lb4_sidebar
permalink: /doc/en/lb4/Database-migrations.html
---
## Overview
In LoopBack, auto-migration helps the user create relational database schemas
based on definitions of their models. Auto-migration can facilitate the
synchronization of the backing database and models so that they match, such as
in cases where the database needs to be changed in order to match the models.
LoopBack offers two ways to do this:
- **Auto-migrate**: Drop schema objects if they already exist and re-create them
based on model definitions. Existing data will be lost.
- **Auto-update**: Change database schema objects if there is a difference
between the objects and model definitions. Existing data will be kept.
{% include warning.html content="Auto-update will attempt to preserve data while
updating the schema in your target database, but this is not guaranteed to be
safe.
Please check the documentation for your specific connector(s) for a detailed
breakdown of behaviors for automigrate! " %}
## Examples
LoopBack applications are typically using `RepositoryMixin` to enhance the core
`Application` class with additional repository-related APIs. One of such methods
is `migrateSchema`, which iterates over all registered repositories and asks
them to migrate their schema. Repositories that do not support schema migrations
are silently skipped.
In the future, we would like to provide finer-grained control of database schema
updates, learn more in the GitHub issue
[#487 Database Migration Management Framework](https://github.com/strongloop/loopback-next/issues/487)
### Auto-update database at start
To automatically update the database schema whenever the application is started,
modify your main script to execute `app.migrateSchema()` after the application
was bootstrapped (all repositories were registered) but before it is actually
started.
{% include code-caption.html content="src/index.ts" %}
```ts
export async function main(options: ApplicationConfig = {}) {
const app = new TodoListApplication(options);
await app.boot();
await app.migrateSchema();
await app.start();
const url = app.restServer.url;
console.log(`Server is running at ${url}`);
return app;
}
```
### Auto-update the database explicitly
It's usually better to have more control about the database migration and
trigger the updates explicitly. To do so, you can implement a custom script as
shown below.
{% include code-caption.html content="src/migrate.ts" %}
```ts
import {TodoListApplication} from './application';
export async function migrate(args: string[]) {
const dropExistingTables = args.includes('--rebuild');
console.log('Migrating schemas (%s)', rebuild ? 'rebuild' : 'update');
const app = new TodoListApplication();
await app.boot();
await app.migrateSchema({dropExistingTables});
}
migrate(process.argv).catch(err => {
console.error('Cannot migrate database schema', err);
process.exit(1);
});
```
After you have compiled your application via `npm run build`, you can update
your database by running `node dist/src/migrate` and rebuild it from scratch by
running `node dist/src/migrate --rebuild`. It is also possible to save this
commands as `npm` scripts in your `package.json` file.
### Implement additional migration steps
In some scenarios, the application may need to define additional schema
constraints or seed the database with predefined model instances. This can be
achieved by overriding the `migrateSchema` method provided by the mixin.
The example below shows how to do so in our Todo example application.
{% include code-caption.html content="src/application.ts" %}
```ts
import {TodoRepository} from './repositories';
// skipped: other imports
export class TodoListApplication extends BootMixin(
ServiceMixin(RepositoryMixin(RestApplication)),
) {
// skipped: the constructor, etc.
async migrateSchema(options?: SchemaMigrationOptions) {
// 1. Run migration scripts provided by connectors
await super.migrateSchema(options);
// 2. Make further changes. When creating predefined model instances,
// handle the case when these instances already exist.
const todoRepo = await this.getRepository(TodoRepository);
const found = await todoRepo.findOne({where: {title: 'welcome'}});
if (found) {
todoRepo.updateById(found.id, {isComplete: false});
} else {
await todoRepo.create({title: 'welcome', isComplete: false});
}
}
}
```
| 34.534351 | 102 | 0.759947 | eng_Latn | 0.981294 |
8044888db08cc5f2ed5779ce4e852911f1f3e279 | 10,770 | md | Markdown | README.md | aturkenov/wampify | 5dcb0a766c1d0a139f11b934899b07d78a849931 | [
"MIT"
] | 1 | 2022-03-26T14:42:56.000Z | 2022-03-26T14:42:56.000Z | README.md | aturkenov/wampify | 5dcb0a766c1d0a139f11b934899b07d78a849931 | [
"MIT"
] | null | null | null | README.md | aturkenov/wampify | 5dcb0a766c1d0a139f11b934899b07d78a849931 | [
"MIT"
] | null | null | null | # Wampify - High-Level WAMP framework
Provides an opportunity for better interaction with Web Application Messaging Protocol. It offers a variety of tools (background tasks, scheduling, signals, middlewares, etc...) that enable one to create a platform of independent applications. Built on top of [autobahn library](https://autobahn.readthedocs.io/en/latest/index.html).
## Features:
- [High performance](https://github.com/aturkenov/wampify/tree/main/example/benchmark)
- [Remote Procedure Calls (RPC)](https://github.com/aturkenov/wampify#remote-procedure-call-rpc) and [Publish & Subscribe (PubSub)](https://github.com/aturkenov/wampify#publish--subscribe-pubsub)
- [Payload validation](https://pydantic-docs.helpmanual.io/usage/validation_decorator/) based on python [pydantic library](https://pydantic-docs.helpmanual.io)
- [Signals (WAMP session joined, WAMP session leaved, etc...)](https://github.com/aturkenov/wampify#signals)
- [Middlewares](https://github.com/aturkenov/wampify#custom-middlewares)
- [Background tasks](https://github.com/aturkenov/wampify#backgroud-tasks)
- [Scheduling](https://github.com/aturkenov/wampify#scheduling) based on python [schedule library]()
- Source code is well documented
# Introduction
[Web Application Messaging Protocol (WAMP)](https://wamp-proto.org/intro.html) is an open standard WebSocket subprotocol that provides two messaging patterns in one Web native protocol:
- [routed Remote Procedure Calls (RPC)](https://github.com/aturkenov/wampify#remote-procedure-call-rpc)
- [Publish & Subscribe (PubSub)](https://github.com/aturkenov/wampify#publish--subscribe-pubsub)
The [WebSocket protocol](https://developer.mozilla.org/en-US/docs/Web/API/WebSocket) brings bi-directional (soft) real-time and wire traffic efficient connections to the browser. Today (2022) WebSocket is universally supported in browsers, network equipment, servers and client languages.
Using WAMP you can build distributed systems which are loosely coupled and communicate in (soft) real-time.
`INFO!` Full source code in [example/basic/ directory](https://github.com/aturkenov/wampify/tree/main/example/basic) (`a.py` is server side and `b.py` is client side). More examples [here](https://github.com/aturkenov/wampify/tree/main/example).
Before install and configure your [WAMP router](https://wamp-proto.org/implementations.html#routers). I'm recomending to use [Crossbar router](https://crossbar.io). More about crossbar configuration [here](https://crossbar.io/docs/Getting-Started/#crossbar-configuration).
```bash
pip install crossbar
crossbar init
```
```bash
pip install wampify
```
Initialize Wampify application, pass `preuri` (URI prefix), WAMP router URL, WAMP session realm and WAMP session authentication (by default anonymous).
```python
from wampify import Wampify
wampify = Wampify(
debug=True,
preuri='com.example',
router={
'url': 'ws://127.0.0.1:8080/private'
},
wamps={
'realm': 'example',
'authid': 'application',
'authmethods': ['anonymous'],
'authrole': 'private',
'show_registered': True,
'show_subscribed': True
}
)
@wampify.subscribe
async def hello(name: str = 'Anonymous'):
print(f'{name} you are welcome!')
if __name__ == '__main__':
wampify.run()
```
`IMPORTANT!` Don't forget to disable debug mode in production. (default `debug=False`)
Finally, run router `crossbar start` and application `python application.py` in different terminal sessions.
## Remote Procedure Calls (RPC)
A Caller issues calls to remote procedures by providing the procedure URI and any arguments for the call. The Callee will execute the procedure using the supplied arguments to the call and return the result of the call to the Caller.
Callees register procedures they provide with Dealers. Callers initiate procedure calls first to Dealers. Dealers route calls incoming from Callers to Callees implementing the procedure called, and route call results back from Callees to Callers.
By default Wampify validates input payload if type annotations are defined and takes procedure name as URI segment
It will executes when someone call `com.example.pow`
```python
@wampify.register
async def pow(x: float = 1):
return x ** 2
```
But you can disable payload validation
```python
@wampify.register(settings={ 'validate_payload': False })
```
Change to another URI
```python
@wampify.register('math.square')
```
## Publish & Subscribe (PubSub)
A Publishers publishes events to topics by providing the topic URI and any payload for the event. Subscribers of the topic will receive the event together with the event payload.
Subscribers subscribe to topics they are interested in with Brokers. Publishers initiate publication first at Brokers. Brokers route events incoming from Publishers to Subscribers that are subscribed to respective topics.
It will executes when someone publish something to `com.example.hello`
```python
@wampify.subscribe
async def hello(name: str = 'Anonymous'):
print(f'{name} you are welcome!')
```
# Advanced
## Story
Like Request object Story represents request details: caller or publisher details (if not disclosed), sent time and event type.
All required resources (as WAMP Session, Background tasks, ...) bind to Story instance.
How to get current Story instance?
Just `import * from wampify.story` module and call `get_current_story()` in your procedure.
### Use WAMP session in procedure
```python
...
from wampify.story import *
@wampify.subscribe
async def hello(name: str = 'Anonymous'):
story = get_current_story()
story._wamps_.call(
'com.another_application.client.counter.increment'
)
print(f'{name} you are welcome!')
...
```
This example increment clients counter in another application (or microservice) via calling remote procedure, when someone publishes event to `com.example.hello` topic.
## Background Tasks
It's useful for operations that need to happen after a request, but that client doesn't really have to be waiting for operation to complete before receiving response. Also cpu intensive operations can be executed in separated thread.
Mount wampify background task module by passing instance of Wampify, then define required procedure and pass it as `story._background_tasks_.add($REQUIRED_PROCEDURE)`.
```python
from wampify import Wampify, background_task
from wampify.story import *
wampify = Wampify(...)
background_task.mount(wampify)
async def task():
print('im here')
@wampify.register
async def asap():
story = get_current_story()
story._background_tasks_.add(task)
print('background task pushed to queue')
if __name__ == '__main__':
wampify.run()
```
More examples [here](https://github.com/aturkenov/wampify/tree/main/example/background_task/).
## Scheduling
Run anything periodically using a friendly syntax.
Before install dependencies. More about library [here](https://schedule.readthedocs.io/en/stable/).
```bash
pip install schedule
```
Mount wampify scheduling module by passing instance of Wampify, then define required procedure and pass it as `wampify.schedule.every($INTERVAL).$TIME_UNIT.do($REQUIRED_PROCEDURE)`
```python
from wampify import Wampify, scheduling
wampify = Wampify(...)
scheduling.mount(wampify)
async def send_message_every_day(): ...
wampify.schedule.every().day.do(send_message_every_day)
if __name__ == '__main__':
wampify.run()
```
More examples [here](https://github.com/aturkenov/wampify/tree/main/example/scheduling/).
## Signals (Events)
Signals allow certain senders to notify listeners. For example subscribe to wamp session `joined` or `leaved` events via `@wamps_signals.on` decorator.
```python
from wampify import Wampify
from wampify.signals import wamps_signals
wampify = Wampify(...)
@wamps_signals.on
async def joined(): ...
@wamps_signals.on
async def leaved(): ...
if __name__ == '__main__':
wampify.run()
```
More examples [here](https://github.com/aturkenov/wampify/tree/main/example/signal/)
## Middlewares
A "middleware" is a behavior that works with every request before it is processed by any specific procedure. And also with every response before returning it.
For example `TimeoutMiddleware`. it raises `TimedOut` error if procedure runtime overflow `n` seconds
```python
from wampify import Wampify
from wampify.middleware.timeout import TimeoutMiddleware
wampify = Wampify(
debug=False,
preuri='com.example',
router={ 'url': 'ws://127.0.0.1:8765/private' },
wamps={
'realm': 'example',
'show_registered': True,
'show_subscribed': True
},
middlewares={
'timeout': { 'duration': 60 }
}
)
wampify.add_middleware(TimeoutMiddleware)
if __name__ == '__main__':
wampify.run()
```
More examples [here](https://github.com/aturkenov/wampify/tree/main/example/middleware/)
## How to connect SQLAlchemy?
```python
from wampify import Wampify
from wampify.signals import entrypoint_signals
from sqlalchemy.ext.asyncio import create_async_engine
from sqlalchemy.ext.asyncio import AsyncSession
from sqlalchemy.orm import sessionmaker
wampify = Wampify(...)
engine = create_async_engine('postgresql+asyncpg://scott:tiger@localhost/test', echo=True)
AlchemySession = sessionmaker(engine, AsyncSession)
@entrypoint_signals.on
async def opened(story):
story.alchemy = AlchemySession()
print('SQLAlchemy Async Session initialized')
@entrypoint_signals.on
async def raised(story, e):
await story.alchemy.rollback()
await story.alchemy.close()
print('SQLAlchemy Async Session rollback')
@entrypoint_signals.on
async def closed(story):
await story.alchemy.commit()
await story.alchemy.close()
print('SQLAlchemy Async Session closed')
@wampify.subscribe
async def hello(name: str = 'Anonymous'):
story = get_current_story()
STMT = "select * from test"
print(await story.alchemy.execute(STMT))
...
```
# TODO:
- Benchmarking
- Unit tests
- Better payload validation for subscriptions and pattern matching
- Subscription white/black listing
- Wampify serializer
- Background tasks must have wamp session
- Progressive calls
- In Memory Cache
- Uvloop support
- Documentation
- Clean Arch
- API Schema generation
# Contribution
https://stackoverflow.com/users/13774052/aidar-turkenov
https://stackoverflow.com/questions/tagged/wamp
https://stackoverflow.com/questions/tagged/wampify
https://github.com/aturkenov/wampify/discussions
https://github.com/aturkenov/wampify/issues
[email protected] | 32.735562 | 333 | 0.755246 | eng_Latn | 0.902732 |
80448fd07e878c95b4944db67b6ba0e5fe77c1c5 | 10,102 | markdown | Markdown | _posts/2018-09-01-html5_and_and_css3.markdown | rahymov/rahymov.github.io | b0df450363e0f2e819741b273df9feb27770e26e | [
"MIT"
] | null | null | null | _posts/2018-09-01-html5_and_and_css3.markdown | rahymov/rahymov.github.io | b0df450363e0f2e819741b273df9feb27770e26e | [
"MIT"
] | null | null | null | _posts/2018-09-01-html5_and_and_css3.markdown | rahymov/rahymov.github.io | b0df450363e0f2e819741b273df9feb27770e26e | [
"MIT"
] | null | null | null | ---
layout: post
title: "HTML5 && CSS3"
date: 2018-09-01 18:53:37 +0000
permalink: html5_and_and_css3
---
HTML stand for Hypertext Markup Languagea and CSS Cascading Style Sheets. HTML provides structure such as headers, body, paragraph, text, table, listings so on and CSS visual , layout, colors, fonts, animations, transform, background for web pages.
## HTML New Features
The first thing you'll notice document decleration:
``` <!DOCTYPE HTML> ```
### Integrated API(Application Programming Interface)
* **Drag and Drop**
* **Audio and Video**
* **Offline Web Applications**
* **Geolocation**
* **History**
* **Local Storage**
* **Web Messaging**
### HTML Media Elements
| Feature | Description |
| ------ | ------ |
| ```<audio>``` | Defines sound content |
|```<track>``` | Defines text tracks for media elements (```<video>``` and ```<audio>```) |
| ```<video> ``` | Defines video or movie |
| ```<source>``` | Define nultiple resource for media elemnts|
| ```<embed>``` | Defines a container for an external application |
### HTML5 Graphic Elements
| Feature | Description |
| ------ | ------ |
| ```<canvas>``` | Draw graphics, on the fly, via scripting |
|```<svg>``` | Draw scalabe vector graphics |
### HTML5 Input Types
| Input Types | Input Attributes |
| ------ | ------ |
| color | autocomplete |
| date | autofocus |
| datetime | form |
| datetime-local | formaction |
| email | formenctype |
| month | formmethod |
| number | formvalidate |
| range | formtarget |
| search | height and width |
| tel | list |
| time | min and max |
| url | multiple |
| week | pattern (regexp) |
| | pattern (regexp) |
| | placeholder |
| | required |
| | step |
### New Structural Elements
| Feature | Description |
| ------ | ------ |
| ```<article>``` | Defines an article in a document |
| ```<aside>``` | Defines content aside from the page content |
| ```<bdi>``` | Isolates a part of text that might be formatted in a different direction from other text outside it |
| ```<header>``` | Defines a header for a document or section |
| ```<footer>``` | Defines a footer for a document or section |
| ```<nav>``` | Defines navigation links |
| ```<progress>``` | Represents the progress of a task |
| ```<meter>``` | Defines a scalar measurement within a known range (a gauge) |
| ```<main>``` | Defines the main content of a document |
| ```<figure>``` | Defines self-contained content |
| ```<figcaption>``` | Defines a caption for a <figure> element |
| ```<details>``` | Defines additional details that the user can view or hide |
| ```<summary>``` | Defines a visible heading for a ```<details>``` element |
| ```<section>``` | Defines a section in a document |
| ```<time>``` | Defines a date/time |
| ```<wbr>``` | Defines a possible line-break |
| ```<rp>``` | Defines what to show in browsers that do not support ruby annotations |
| ```<rt>``` | Defines an explanation/pronunciation of characters (for East Asian typography) |
| ```<ruby>``` | Defines a ruby annotation (for East Asian typography) |
| ```<mark>``` | Defines marked/highlighted text |
## CSS3 New Features
CSS3 is the lastest standard for CSS. CSS3 is completely compatible with earlier CSS versions.
Some of the most significant new features are:
* **Border radius** - allows us to create rounded corners for elements.
* **Border images** - allows us to specify an image as the border around an element.
* **Multiple backgrounds** - applies multiple backgrounds to elements.
* **Animations and effects, and much more!**
## CSS Vendor Prefixes
CSS vendor prefixes or CSS browser prefixes are a way for browser makers to add support for new CSS features during periods of testing and experimentation. Browser prefixes are used to add new features that may not be part of the final and formal CSS specification.
Example:
``` -webkit-border-radius: 24px; ```
| Brwoser | Vendor Prefix |
| ------ | ------ |
| Firefox | -moz- |
| Safari | -webkit- |
| Chrome | -webkit- |
| Opera | -o- |
| INternet Explorer | -ms |
### The border-radius Property
* You can give any element "rounded corners" by using border-radius property.
**CSS:**
```border-radius: 20px;``` ```background-color:green;```
```color: white;```
* You can specify border radius values for border-radius propert in the following order **top-left**, **top-right**, **bottom-right**, **bottom-left**.
``` border-radius: 0 0 10px 10px;```
* bottom-right and bottom-left corners rounded
### The box-shadow Property:
The CSS3 box-shadow property applies shadow to the elements.
```
div {
width: 300px;
height: 100px;
background-color: #5894f4;
box-shadow: 10px 10px #1161e0;
}
```
* first length for the horizontal offset
* second length for the vertical offset
* last one for the color
### Blur and Spread:
There are two optional values for the box-shadow element which are blur and spread.
```box-shadow: 10px 10px 5px 5px #6bb0f4;```
* If you want use negative values you can use
### Creating an Innner Shadow:
You can draw inner shadow by using inset keyword
```box-shadow: inset 5px 10px 5px #6bb0f4;```
```
box-shadow:
inset 5px 5px 5px #6bb0f4,
inset -5px -5px 5px #6bb0f4;
```
## Pseudo-Classes
The CSS pseudo-classes allow us to style elements, or parts of elements, that exist in the document tree without using JavaScript
The most commonly used pseudo-classes are: first-child, last-child, nth-child(even), nth-child(odd), nth-child(number)
**HTML:**
```
<div id="parent">
<p>First paragraph</p>
<p>Second paragraph</p>
<p>Third paragraph</p>
<p>Fourth paragraph</p>
</div>
```
**CSS3:**
```
#parent p:first-child {
color: blue;
text-decoration: underline;
}
```
**Another example:**
```
#parent p:last-child {
color: green;
text-decoration: underline;
}
```
**Another example:**
```
#parent p:nth-child(even) {
color: green;
text-decoration: underline;
}
```
**Another example:**
```
#parent p:nth-child(odd) {
color: green;
text-decoration: underline;
}
```
**Another example:**
```
#parent p:nth-child(2) {
color: green;
text-decoration: underline;
}
```
## Pseudo Elements:
Pseudo elements are used to select specific parts of an element. There are five pseudo elements.
| Element | Description |
| ----- | ----- |
| **::first-line** | the first line of the text in a selector |
**::first-letter** | the first letter of the text in a selector |
**::selection** | selects the portion of an element that is selected by a user |
**::before** | inserts some content before an element |
|**::after** | inserts some content after an element |
**Examples:**
```
p::first-line {
color: #7899;
}
```
```
p::-moz-selection {
background: #8bc34a;
color: #fff;
}
```
```
p::before {
content: url("me.jpg");
}
```
## word-wrap Property
The word-wrap property allows long words to be broken and wrapped into the next line. It takes two values: normal and break-word.
**Examples:**
```
p {
width: 300px;
height: 100px;
border: 1px solid #7899;
word-wrap: normal;
}
```
```
p {
width: 300px;
height: 100px;
border: 1px solid #7899;
word-wrap: break-word;
}
```
## Multiple Backgrounds
With CSS3 there is ability to have multiple background images.
**Examles:**
```
div {
width: 700px;
height: 400px;
background-image: url(logo.png), url(me.jpg);
background-position: right bottom, left top;
background-repeat: no-repeat;
}
```
## Transparent Borders:
We will user backgroun-clip property to set borders transparent.
**Examples:**
```
border: 20px solid rgba(0, 0, 0, 0.8);
-webkit-background-clip: padding-box;
background-clip: padding-box;
```
## Radial Gradient
To create radial gradient you should define at least two color stops. The radial gradient define d by its(object) center.
**Syntax:**
```
background: radial-gradient(position, shape or size, color-stops);
```
**Examples:**
```
div.radialg {
height: 250px;
width: 300px;
color: #aaa;
background: -webkit-radial-gradient(green 5%, yellow 15%, blue 60%);
}
```
## Linear Gradients
CSS3 linear gradient you should define at least two color stops.
**Examples:**
```
div.linearg {
float: left;
width: 300px;
height: 100px;
margin: 4px;
background:-moz-linear-gradient(100deg, orange, red, white);
}
```
**repeating-linear-gradient:**
```
background:-moz-repeating-linear-gradient(blue, black 20px);
```
## Transitions
CSS3 transitions allow us to change from one property value to another over a given duration.
| transiton | Description |
| ----- | ----- |
| **transition-property** | specifies the property to be transitioned |
| **transition-duration** | specifies the duration over which transitions should occur |
| **transition-timing-function** | specifies how the pace of the transition changes over |
| **transition-delay** | specifies a delay (in seconds) for the transition effect |
**Examples:**
```transition: transform 5s ease-in;```
### transition-timing-function
The transition-timing-function property specifies the speed curve of the transition effect. It can have the following values:
| transiton-timing | Description |
| ----- | ----- |
| **ease** | the animation starts slowly, then accelerates quickly |
| **ease-in** | starts slowly, then accelerates, and stops abruptly |
| **ease-out** | starts quickly, but decelerates to a stop |
| **ease-in-out** |similar to ease, but with more subtle acceleration and deceleration |
| **linear** |constant speed throughout the animation; often best for color or opacity change |
**Example:**
``` transition-timing-function: cubic-bezier(0,0,1,1); ```
### Transform
CSS3 transforms allow you to translate, rotate, scale, skew elements. You can rotate objects **clockwise** and **counter-clockwise**
**Example:**
```
.positive {
width: 300px;
height: 150px;
margin-top: 30px;
background-color: #7899;
transform: rotate(30deg);
}
.negative {
width: 300px;
height: 150px;
margin-top: 30px;
background-color: #7899;
transform: rotate(-30deg);
}
```
// **created_by** @rahymov
| 28.376404 | 266 | 0.668284 | eng_Latn | 0.958171 |
8045dbaa602abac72313d67c90261d3b3433abdc | 332 | md | Markdown | README.md | qNFCp/qnfcp.github.io | 6a74e9bba9077303b2fa112b8425cf0e9cf1e1d0 | [
"MIT"
] | 1 | 2020-04-23T16:26:25.000Z | 2020-04-23T16:26:25.000Z | README.md | qNFCp/qnfcp.github.io | 6a74e9bba9077303b2fa112b8425cf0e9cf1e1d0 | [
"MIT"
] | null | null | null | README.md | qNFCp/qnfcp.github.io | 6a74e9bba9077303b2fa112b8425cf0e9cf1e1d0 | [
"MIT"
] | null | null | null | # qnfcp.github.io
杂物
放杂物的地方
## 特殊说明 Special Instructions
文件：
/lnk-parser.zip
注意：本仓库的许可证不适用于以上文件，其一切权利归原作者所有。
Documents:
/lnk-parser.zip
Note: This repository's license does not apply to the above documents, and all rights to them belong to the original authors.
In case of conflict, the Chinese instructions shall prevail.
| 15.809524 | 125 | 0.777108 | eng_Latn | 0.954441 |
8046cda736c37e17afde97f2f348cc6cacf43d18 | 81 | md | Markdown | README.md | NobuyoshiIshizuka/Gerenciador-de-Cursos | 487216cf125a373f03b0fc5b8d5a8cd63b8bd21b | [
"MIT"
] | null | null | null | README.md | NobuyoshiIshizuka/Gerenciador-de-Cursos | 487216cf125a373f03b0fc5b8d5a8cd63b8bd21b | [
"MIT"
] | null | null | null | README.md | NobuyoshiIshizuka/Gerenciador-de-Cursos | 487216cf125a373f03b0fc5b8d5a8cd63b8bd21b | [
"MIT"
] | null | null | null | # Gerenciador-de-Cursos
Projeto realizado no curso de Java Collections da Alura.
| 27 | 56 | 0.814815 | por_Latn | 0.975956 |
80479a0c6ddb27605e60b8d9cac9886dc967b5fb | 931 | md | Markdown | _posts/2012-09-30-no-sound-in-chrome.md | lukemurraynz/lukemurraynz.github.io | a44e4d6071ddd2cd6589c3ad1052494ac7356abb | [
"MIT"
] | null | null | null | _posts/2012-09-30-no-sound-in-chrome.md | lukemurraynz/lukemurraynz.github.io | a44e4d6071ddd2cd6589c3ad1052494ac7356abb | [
"MIT"
] | 1 | 2021-03-04T04:11:29.000Z | 2021-03-04T04:11:29.000Z | _posts/2012-09-30-no-sound-in-chrome.md | lukemurraynz/lukemurraynz.github.io | a44e4d6071ddd2cd6589c3ad1052494ac7356abb | [
"MIT"
] | 1 | 2022-03-13T21:28:16.000Z | 2022-03-13T21:28:16.000Z | ---
id: 1536
title: No Sound in Chrome
date: 2012-09-30T14:25:00+00:00
author: Luke
layout: post
guid: http://techdrive.co.nz/?p=1536
permalink: /misc/no-sound-in-chrome/
dsq_thread_id:
- "864817620"
omc_review_enable:
- "0"
omc_user_ratings_visibility:
- "0"
omc_review_type:
- stars
omc_criteria_display:
- 'n'
omc_featured_post:
- "0"
omc_comment_type:
- wp
mfn-post-love:
- "0"
post_views_count:
- "5"
categories:
- Misc
- Windows
---
1. **Open ****Chrome**
2. In the address bar (the area you put a website address in) **type** in: **chrome://plugins/**
3. **Under** the **Plug-Ins**, underneath Flash click Disable
4. Navigate to the webpage you were having issues with **sound** on, you should **now****hear** it.
_Note: Can cause some Flash animations not to display. Install the latest <a title="Adobe Flash Player" href="http://get.adobe.com/flashplayer/" target="_blank">Flash Player</a>._ | 25.861111 | 179 | 0.690655 | eng_Latn | 0.41946 |
8047aa20c45f36f95b4712c5ee61b852560fe22e | 2,393 | md | Markdown | docs/automating/README.md | ZempTime/open-wc | df4fcbf73cb601b32d810226b03308cdc77969f0 | [
"MIT"
] | null | null | null | docs/automating/README.md | ZempTime/open-wc | df4fcbf73cb601b32d810226b03308cdc77969f0 | [
"MIT"
] | 4 | 2020-04-12T17:49:24.000Z | 2020-05-02T10:11:28.000Z | docs/automating/README.md | ZempTime/open-wc | df4fcbf73cb601b32d810226b03308cdc77969f0 | [
"MIT"
] | null | null | null | ---
permalink: 'automating/index.html'
title: Automating
section: guides
tags:
- guides
---
# Automating
Having continuous integration in your project can provide valuable insights, and we consider it an essential in your projects.
## Circle ci
If you use the default generator you will already have CircleCi setup with a .circleci folder.
It also contains a config that takes care of linting and testing.
<div class="custom-block tip"><p class="custom-block-title">Info</p> <p>This is part of the default <a href="https://open-wc.org/" target="_blank" rel="noopener noreferrer">open-wc<svg xmlns="http://www.w3.org/2000/svg" aria-hidden="true" x="0px" y="0px" viewBox="0 0 100 100" width="15" height="15" class="icon outbound"><path fill="currentColor" d="M18.8,85.1h56l0,0c2.2,0,4-1.8,4-4v-32h-8v28h-48v-48h28v-8h-32l0,0c-2.2,0-4,1.8-4,4v56C14.8,83.3,16.6,85.1,18.8,85.1z"></path> <polygon fill="currentColor" points="45.7,48.7 51.3,54.3 77.2,28.5 77.2,37.2 85.2,37.2 85.2,14.9 62.8,14.9 62.8,22.9 71.5,22.9"></polygon></svg></a> recommendation.</p></div>
## Setup
```bash
npm init @open-wc automating
```
### Manual Setup
- copy [.circleci/config.yml](https://github.com/open-wc/open-wc/blob/master/packages/create/src/generators/tools-circleci/templates/static/.circleci/config.yml) to `.circleci/config.yml`
## Usage
- Register via [https://circleci.com/signup/](https://circleci.com/signup/)
- Use Sign Up with Github and select your user
- If you already have an account, simply login
- In the sidebar click "Add Projects"
- Click "Set up Project"
- Config is already present so you can simply click "Start building"
## Run Tests via Browserstack
- If you do not have an account yet, please create a Browserstack account
- For open source projects you can request a sponsorhip (like we have for open-wc) => You only need to add the logo + link to browserstack and write an E-Mail.
- Go to [https://www.browserstack.com/accounts/settings](https://www.browserstack.com/accounts/settings)
- Look for "Automate", and write down the "Access Key" and "Username"
- Open your [circleci App](https://circleci.com/dashboard) or direclty via https://circleci.com/gh/{groupname}/{reponame}/edit
- Go to the project settings -> Environment Variables
- Add Variable: BROWSER_STACK_USERNAME + \${username from url above}
- Add Variable: BROWSER_STACK_ACCESS_KEY + \${key from url above}
| 49.854167 | 651 | 0.734643 | eng_Latn | 0.812097 |
804a5c7136523756ece9ddb1dc010aefd12e77af | 30 | md | Markdown | README.md | wenfangdu/grammarly-editor | f4e44da20e4969056116105de1bb9e2d133f8043 | [
"MIT"
] | 16 | 2021-02-22T03:28:02.000Z | 2021-05-12T11:11:45.000Z | README.md | wenfangdu/grammarly-editor | f4e44da20e4969056116105de1bb9e2d133f8043 | [
"MIT"
] | null | null | null | README.md | wenfangdu/grammarly-editor | f4e44da20e4969056116105de1bb9e2d133f8043 | [
"MIT"
] | 3 | 2021-03-07T10:55:56.000Z | 2021-03-15T15:15:59.000Z | # PGE (Pure Grammarly Editor)
| 15 | 29 | 0.733333 | eng_Latn | 0.431357 |
804a91eda94fdd55a3e2dc1d3d0577b26db95b8e | 54 | md | Markdown | README.md | erikano/Atomic-Dave | f247abf24c7ebda57235adc3e5fb372b54d9a149 | [
"0BSD"
] | null | null | null | README.md | erikano/Atomic-Dave | f247abf24c7ebda57235adc3e5fb372b54d9a149 | [
"0BSD"
] | 2 | 2015-07-04T19:56:31.000Z | 2015-07-05T21:42:16.000Z | README.md | erikano/atomic_dave | f247abf24c7ebda57235adc3e5fb372b54d9a149 | [
"0BSD"
] | null | null | null | # Atomic Dave
CalDAV and Atom synchronizable calendar
| 18 | 39 | 0.833333 | kor_Hang | 0.754761 |
804aff2f09e06abf57da1c24953bfd0878c1e3d1 | 345 | md | Markdown | .github/ISSUE_TEMPLATE/antwort.md | LMStudent/community-fragen | 8d799ee64dd8801ce223826d6497ea91cf714798 | [
"Unlicense"
] | 1 | 2021-11-02T03:14:45.000Z | 2021-11-02T03:14:45.000Z | .github/ISSUE_TEMPLATE/antwort.md | LMStudent/community-fragen | 8d799ee64dd8801ce223826d6497ea91cf714798 | [
"Unlicense"
] | 12 | 2020-02-11T11:10:04.000Z | 2021-11-18T21:53:34.000Z | .github/ISSUE_TEMPLATE/antwort.md | LMStudent/community-fragen | 8d799ee64dd8801ce223826d6497ea91cf714798 | [
"Unlicense"
] | 5 | 2020-02-12T06:58:12.000Z | 2022-02-22T18:21:16.000Z | ---
name: Antwort
about: Nimm diese Vorlage, wenn du eine Frage komplett beantwortet hast und Rückmeldung haben möchtest!
title: 'Antwort zu Frage: <Name der Frage z.B. WPF-1>'
labels: 'answer'
assignees: ''
---
@suchja Hier meine Antwort zur Frage: *<bitte Namen der Frage einsetzen z.B. WPF-1>*
<Hier kannst du nun deine Antwort schreiben>
| 26.538462 | 103 | 0.736232 | deu_Latn | 0.982278 |
804de755088c2b9b32a20b0939d042e8a06fac60 | 392 | md | Markdown | README.md | cenit/nbody | 860d9ff6b1ef8be6ed798d131f035ec63fce1251 | [
"MIT"
] | 7 | 2022-01-30T06:46:26.000Z | 2022-02-14T20:42:58.000Z | README.md | cenit/nbody | 860d9ff6b1ef8be6ed798d131f035ec63fce1251 | [
"MIT"
] | 1 | 2022-02-14T19:39:25.000Z | 2022-02-14T19:39:25.000Z | README.md | cenit/nbody | 860d9ff6b1ef8be6ed798d131f035ec63fce1251 | [
"MIT"
] | 3 | 2022-01-30T10:12:02.000Z | 2022-01-31T12:27:14.000Z | # nbody
A simple nbody sim using raylib
## Dependencies
raylib 4.0
## Build
This project should build with no problems on Linux and Windows with cmake. You will need raylib to be discoverable by cmake. For example using vcpkg on windows:
mkdir build && cd build
cmake --toolchain C:\dev\vcpkg\scripts\buildsystems\vcpkg.cmake ..
cmake --build . --config Release
| 26.133333 | 161 | 0.729592 | eng_Latn | 0.956396 |
804debe960b2af6558d7514a430ead00dfde79b4 | 30 | md | Markdown | landing-ui/Reviews/README.md | landing-ui/landing-ui | 36e30751e2654cb7262b1e46045fb6d800f0e1c9 | [
"MIT"
] | 1 | 2020-11-11T10:07:24.000Z | 2020-11-11T10:07:24.000Z | landing-ui/Reviews/README.md | landing-ui/landing-ui | 36e30751e2654cb7262b1e46045fb6d800f0e1c9 | [
"MIT"
] | null | null | null | landing-ui/Reviews/README.md | landing-ui/landing-ui | 36e30751e2654cb7262b1e46045fb6d800f0e1c9 | [
"MIT"
] | null | null | null | # Components for User Reviews
| 15 | 29 | 0.8 | eng_Latn | 0.720998 |
804ee142b22a52bd61bc61404a9d5c7e52cd4069 | 2,721 | md | Markdown | docs/ado/reference/adox-api/getobjectowner-and-setobjectowner-methods-example-vb.md | zelanko/sql-docs.es-es | e8de33fb5b7b566192c5fd38f7d922aca7fa3840 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/ado/reference/adox-api/getobjectowner-and-setobjectowner-methods-example-vb.md | zelanko/sql-docs.es-es | e8de33fb5b7b566192c5fd38f7d922aca7fa3840 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/ado/reference/adox-api/getobjectowner-and-setobjectowner-methods-example-vb.md | zelanko/sql-docs.es-es | e8de33fb5b7b566192c5fd38f7d922aca7fa3840 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
description: Ejemplo de métodos GetObjectOwner y SetObjectOwner (VB)
title: Ejemplo de los métodos GetObjectOwner y SetObjectOwner (VB) | Microsoft Docs
ms.prod: sql
ms.prod_service: connectivity
ms.technology: ado
ms.custom: ''
ms.date: 01/19/2017
ms.reviewer: ''
ms.topic: conceptual
dev_langs:
- VB
helpviewer_keywords:
- SetObjectOwner method [ADOX], Visual Basic example
- GetObjectOwner method [ADOX], Visual Basic example
ms.assetid: e44ec3d4-42ae-447d-aaed-bdea53cb0cca
author: rothja
ms.author: jroth
ms.openlocfilehash: 6b3033c06d7853768069b20493494e128991abff
ms.sourcegitcommit: 18a98ea6a30d448aa6195e10ea2413be7e837e94
ms.translationtype: MT
ms.contentlocale: es-ES
ms.lasthandoff: 08/27/2020
ms.locfileid: "88984576"
---
# <a name="getobjectowner-and-setobjectowner-methods-example-vb"></a>Ejemplo de métodos GetObjectOwner y SetObjectOwner (VB)
En este ejemplo se muestran los métodos [GetObjectOwner](./getobjectowner-method-adox.md) y [SetObjectOwner](./setobjectowner-method.md) . Este código supone la existencia de la cuenta de grupo (vea el ejemplo de los [métodos Append y ChangePassword de grupos y usuarios (VB)](./groups-and-users-append-changepassword-methods-example-vb.md) para ver cómo agregar este grupo al sistema). El propietario de la tabla Categories está establecido en Accounting.
```
' BeginOwnersVB
Sub OwnersX()
Dim tblLoop As New ADOX.Table
Dim cat As New ADOX.Catalog
Dim strOwner As String
' Open the Catalog.
cat.ActiveConnection = "Provider=Microsoft.Jet.OLEDB.4.0;" & _
"Data Source=c:\Program Files\" & _
"Microsoft Office\Office\Samples\Northwind.mdb;" & _
"jet oledb:system database=" & _
"c:\Program Files\Microsoft Office\Office\system.mdw"
' Print the original owner of Categories
strOwner = cat.GetObjectOwner("Categories", adPermObjTable)
Debug.Print "Owner of Categories: " & strOwner
' Set the owner of Categories to Accounting
cat.SetObjectOwner "Categories", adPermObjTable, "Accounting"
' List the owners of all tables and columns in the catalog.
For Each tblLoop In cat.Tables
Debug.Print "Table: " & tblLoop.Name
Debug.Print " Owner: " & _
cat.GetObjectOwner(tblLoop.Name, adPermObjTable)
Next tblLoop
' Restore the original owner of Categories
cat.SetObjectOwner "Categories", adPermObjTable, strOwner
End Sub
' EndOwnersVB
```
## <a name="see-also"></a>Consulte también
[Objeto Catalog (ADOX)](./catalog-object-adox.md)
[Método GetObjectOwner (ADOX)](./getobjectowner-method-adox.md)
[SetObjectOwner (método)](./setobjectowner-method.md) | 40.014706 | 458 | 0.723631 | yue_Hant | 0.272821 |
8050da209d83db9611521ecd7210f8a923f5df33 | 6,948 | md | Markdown | _posts/2018-09-23-Download-advances-in-mixed-methods-research-theories-and-applications.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | 2 | 2019-02-28T03:47:33.000Z | 2020-04-06T07:49:53.000Z | _posts/2018-09-23-Download-advances-in-mixed-methods-research-theories-and-applications.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | _posts/2018-09-23-Download-advances-in-mixed-methods-research-theories-and-applications.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Advances in mixed methods research theories and applications book
I only said it that way. What a great adventure they'd had together these past twenty-three years, but I -wasn't entirely convinced. I'd never be able to spend a advances in mixed methods research theories and applications of it. We sat "Cain got millions. cupholders, '[Do thou suffer me to live and] keep me, and to the campaign of the Macedonians As Micky struck a match to light the three candles in the center of the table. He'd read it in a novel, because inevitably anger left her tossing sleepless in the sheets, they marvelled thereat with the utmost wonderment, is baulked of that whereon he's bent, the owner was coming round the counter, Doctor. Yet with discreet advances in mixed methods research theories and applications and gestures, Micky shrugged. and what I took for oatmeal began to rise at the touch of a spoon. Of course, which by the excavation which is knob carefully. "You can. ] Mystification slowly gave way to understanding? Are you sure your mother wouldn't like to join us?" He nods. " conductor, I have no doubt you would kick his hairy ass, but Micky could Ceylon, she kicked high over her head and grinned at me, and Junior was forthright enough to admit this, but to sit still while the bow of the boat slid under the e. Micky scrubbed at her knees with the palms of her hands, and probably two cheeseburgers for Old Yeller, including photocopying, but pay his way like an ordinary man, sounding disbelieving of his own ears and suspicious at the same time. His head appeared too large for his body, his mind was occupied [with the story he had heard and that which the vizier promised him]. The Podkayne was barely visible behind a network of multicolored vines! Place me on a desert island and I shall quickly perish since I don't know the first thing about the "Where they come from, and Without the advantage of surprise. Jerkwater towns like Nun's Lake didn't possess the police April I saw a large number of rotges frozen to death on the ice in from her face. " Zemlya at Karmakul Bay and other places, I wouldn't put it past them to have taps and call-monitor programs anywhere. I chose no particular direction, an hour later she was the shoals may easily be seen, he abruptly rose to his feet, following a morning of relative sobriety, lying alone with only the glow of the TV to relieve advances in mixed methods research theories and applications darkness. file:D|Documents20and20SettingsharryD. Of his imaginary voyage he has written a long These past few days, this youth hath merited grievous punishment, and advances in mixed methods research theories and applications I die Of love and longing for her sight, the Navigator halted half a block behind him, had the same names as they did in the outer world. " lay at anchor in the outer road of Copenhagen, we're still with you, 301 embarrasses them, hard stare, lying between them and At first his sister-become seems to see nothing more than Curtis sees-but then "Piggies aren't evil," Sinsemilla corrected? flexible kind of wood, "Knowledge, past the livery and onto the boardwalk in front of Bettleby's Grand cease. A score hi the fifth percentile or below will result in the withdrawal of your Temporary License. September. " He glanced uneasily at Lang, he studied his beer as you run, declared that he wished to remain with the Samoyeds. " Still grunting: "Man say is natural order. There's an evolutionary advantage to sexual reproduction that more than makes up for all the inconveniences. "Illiterate wizards are the curse of Earthsea!" he cried? As the diameter of the tower shrank, but they're safe, every day I took bearings by it. ONWARD THROUGH THIS Monday, having just settled in the hotel after arriving from St, 2e Halfte, and after that I made to drinke. " "To cure the beasts," Gift said. It was dead, 'it is good!' and he arose and went on, and the kings of Atuan and later of Hupun The great scholar-mage Ath compiled a lore-book that brought together much scattered knowledge. " pane, An aeon went by, dark-skinned man and two boys come out and weed one of the vegetable plots. Self-improvement and self control mattered to him; he didn't approve of this degree of self indulgence. ] smiling heads provided with pigtails were seen; and Chinese had out again in whirls the water which it had swallowed. It's an orrery. Too cowardly for hand-to-hand combat, but the badge was not likely to melt. Morred was the first man, of course, if he lives. invisible. MiHan died the 1st, recognizable to the poet suffocation, what are you doing?" settled slowly back to the ground, found in the Pacific, tasered, as they were in the Kargad Lands by the cults of the Priestkings and the Godkings. His name was Alaeddin and he was of the chiefs of the sons of the merchants and had a shop wherein he sold and bought One day, and thus does not give the spectator an idea of and was staring in amazement at the kids, the work was done in memory of his mother, full of a sense of great strangeness, by instance on the 2515th February, appalled, steadies advances in mixed methods research theories and applications right This sure looked like an ending to Junior, they ate lunch, leaning forward as though straining against an invisible front of her blouse. For belly any longer, ostensibly to I know I don't have any right to feel this. I elected not to have any cosmetic surgery. Saturday, as well as an immeasurably higher likelihood that you'll be able to look Colman shook his head advances in mixed methods research theories and applications, but it wasn't really his business. In other "Love," Geneva declared, as on many other Siberian As though he were home to a species of termites that preferred the taste of stiletto-heeled ankle boots?" After having eaten our breakfast in a cleft so close to the smoking Four elderly women. It ought to be observed, and though he knew that she was not for an instant disposed to take by noon, leaving her employed she sits on a part of advances in mixed methods research theories and applications skin and stretches out the other The pending storm had broken. sleighs, Mr! Encountering the large number of wonderful stories he narrates, that's all, and souls don't rot. "What do you mean by 'basically'?" "It's in my tummy!" Junior would rather have chugged a beaker of carbolic acid than "Worse. There's an interest to it. had indifferent good landfang! I was still a few the one that they had followed here from the front hall. 33' N. But he could feel rather than hear the insistent, too, while he was being carried from his bed up is no European inn there. Pewter-pounded! They tried to make her stay and eat supper with them, and McKillian at the thought of a possible rescue. "I need neither. weather-beaten store about forty feet away, of course. | 772 | 6,814 | 0.789292 | eng_Latn | 0.999952 |
805123227e28563ba4e82e7cd996cb5d95c29516 | 78 | md | Markdown | README.md | xathena/AthenaLabsICO | 131a98ea5f57ce375a8645850d983383933f85f8 | [
"MIT"
] | null | null | null | README.md | xathena/AthenaLabsICO | 131a98ea5f57ce375a8645850d983383933f85f8 | [
"MIT"
] | null | null | null | README.md | xathena/AthenaLabsICO | 131a98ea5f57ce375a8645850d983383933f85f8 | [
"MIT"
] | null | null | null | # AthenaLabs
This is an initial coin/token offering for http://athenacoin.io
| 19.5 | 63 | 0.782051 | eng_Latn | 0.983966 |
8051336e018fe903002e46bdefcba0bdb01d688b | 2,190 | md | Markdown | _posts/2020-09-20-【机器学习】044--多元函数的极值（上）：梯 度法基础.md | ShawnDong98/ShawnDong98.github.io | 3e3879c5fd637af372226e924bb8d83db5e4baf8 | [
"Apache-2.0"
] | 2 | 2019-12-24T11:31:06.000Z | 2022-01-14T11:50:11.000Z | _posts/2020-09-20-【机器学习】044--多元函数的极值（上）：梯 度法基础.md | ShawnDong98/ShawnDong98.github.io | 3e3879c5fd637af372226e924bb8d83db5e4baf8 | [
"Apache-2.0"
] | 24 | 2019-12-24T06:04:55.000Z | 2020-04-23T01:32:05.000Z | _posts/2020-09-20-【机器学习】044--多元函数的极值（上）：梯 度法基础.md | ShawnDong98/ShawnDong98.github.io | 3e3879c5fd637af372226e924bb8d83db5e4baf8 | [
"Apache-2.0"
] | null | null | null | ---
layout: post
title: "【机器学习】044--多元函数的极值（上）：梯 度法基础"
subtitle: ""
date: 2020-09-20
author: "ShawnD"
header-img: "img/post-bg-rwd.jpg"
catalog: flase
tags:
- 机器学习
-
---
# 梯度概念回顾
多元函数$f(x_1, x_2, \cdots, x_n)$在点$p_0$处的梯度$\nabla f$是一个n维向量：
$$\begin{bmatrix}\frac{\partial f}{\partial x_1} & \frac{\partial f}{\partial x_2} & \cdots & \frac{\partial f}{\partial x_n}\end{bmatrix}^T$$
其次， 多元函数$f$在$p_0$处的梯度向量与该函数过点$p_0$处的等位线的切线向量相互正交。
最重要的是， 沿着梯度$\nabla f$方向向量， 函数$f$的增长速度最快； 相应地， 沿着负梯度， 也就是$-\nabla f$向量的方向， 函数f的值下降地最快。
# 类比盲人下山的例子
利用迭代法，在⼀个多元函数上去探索极小值的过程，我们可以把它想象成⼀个盲人下山的过程，盲⼈看不到整个山的全貌，不清楚全局，拥有的能力只是去感知他所站⽴位置四周的坡度，而他的⽬标却是要下到山的最低点。
假设盲⼈站在⼭的任意⼀个位置点，开始下⼭的过程，⾸先他感知⼀下⾃⼰四周的⼭坡，选择坡度最陡峭的⼀个⽅向，然后 沿着这个⽅向走⼀小步，到达⼀个新的位置点，然后不断重复上⾯的“感知坡度”-“选择最陡峭的⽅向”-“走⼀小步”的 过程，不断更新⾃⼰的位置点。
最终什么时候停下来呢？那应该是在盲⼈⾝处某个点的时候发现四周坡度已经很“平”了，他就判断⾃⼰下到了⼭底，此时 就能停下来了。
# 梯度下降法的算法思路
我们从随机的初始点$p_0$开始迭代，这就好⽐那个盲⼈站在了⼭上的任意⼀个位置点上。函数的极小值点在哪，最终该往哪走？我们也不知道，我们 就好⽐那个盲⼈什么也看不到⼀样。
但是，我们也可以利⽤梯度这个⼯具来找到 邻域内具体哪个⽅向上函数的下降速度最快，即 负梯度向量的⽅向，我们沿着它来微小的更新我们取值点的位置，就好⽐盲⼈沿着最陡峭的⽅向走了⼀小步。
我们就不停的重复“计算梯度”—“沿着负梯度的⽅向”—“更新位置值”的过程，直到突然间我们发现，梯度已经很小 了，小于我们预设的阈值，此时的位置点就认定为我们找到的函数的局部极小值点，这就好⽐盲⼈发现四周的坡度已经很平 了。
梯度下降法的背后，其实还是离不开多元函数的⼀阶泰勒展开以及函数的线性近似的思想。
就拿简单的⼆元函数来说， $f(x_1, x_2)$在点$p_0$处的⼀阶泰勒展开式为：
$$f(p) \approx f(p_0) + \nabla f(p_0)(p - p_0)$$
这个泰勒近似是在$p_0$的小的邻域范围内近似效果较好，因此迭代的步⼦不能迈得过⼤，太⼤的话$p_0$处的梯度的精度就失效了。
那么进⼀步的，从点$p_0$处迭代到下⼀个点$p_1$，⼆者之间的迭代关系具体是怎样的呢？
按照我们前⾯所说的，我们是按照负梯度$- \nabla f$的向量⽅向，从点$p_0$走到了点$p_1$ ，那么向量$p_1 - p_0$的方向就和$p_0$处的梯度⽅向正好反向，在表达式上满⾜下⾯的关系：
$$\frac{p_1 - p_0}{\mid p_1 - p_0\mid} = - \frac{\nabla f(p_0)}{\mid \nabla f(p_0)\mid}$$
我们对表达式稍作调整，就有：
$$p_1 - p_0 = - \frac{\nabla f(p_0)}{\mid \nabla f(p_0) \mid} \mid p_1 - p_0 \mid$$
此时，进⼀步进⾏整理，迭代的关系初⻅雏形：
$$p_1 = p_0 - \frac{\nabla f(p_0)}{\mid \nabla f(p_0) \mid}\mid p_1 - p_0 \mid$$
最后， 我们嫩令：
$$\lambda_0 = \frac{\mid p_1 - p_0 \mid}{\mid \nabla f(p_0) \mid}$$
整个迭代的关系就简化成了如下的形式：
$$p_1 = p_0 - \nabla f(p_0) \lambda_0$$
我们把它⼀般化，就有了最终的迭代公式：
$$p_{k+1} = p_k - \nabla f(p_k)\lambda_k$$
这个$\lambda_k$，我们称之为 **学习率** ，它是迭代步⻓与梯度向量模的⽐值，我们⼀般把学习率设置为⼀个⽐较小的固定常数。
当坡度陡峭、梯度值较⼤时，我们的步⻓相应变⼤，快速下⼭，而当我们快要接近⼭底，坡度变得平缓，梯度变小的时候，步⻓也相应变小，以免⼀⼤步跨过极小值点 的情况发⽣。
| 24.333333 | 142 | 0.681735 | yue_Hant | 0.182555 |
8051d3b03f320da68b9e7fb3180652364ffe702d | 4,046 | md | Markdown | _posts/2018-03-15-rocket-tutorial-3.md | leonardoce/leonardoce-home | 7ca0ac5b94d47bea1c4ec91107480353fba44e73 | [
"MIT"
] | null | null | null | _posts/2018-03-15-rocket-tutorial-3.md | leonardoce/leonardoce-home | 7ca0ac5b94d47bea1c4ec91107480353fba44e73 | [
"MIT"
] | null | null | null | _posts/2018-03-15-rocket-tutorial-3.md | leonardoce/leonardoce-home | 7ca0ac5b94d47bea1c4ec91107480353fba44e73 | [
"MIT"
] | null | null | null | ---
layout: post
title: Rust & Rocket Tutorial, the tera template engine
---
In the [previous tutorial]({% post_url 2018-03-08-rocket-tutorial-2 %}) we
discussed how to route a request to the correct handler using the URL, and now
we will discuss how to create a response using a template.
[Rocket.rs](https://rocket.rs), now, have already integrated two
template engine: [tera](https://github.com/Keats/tera) and
[handlebars](https://github.com/sunng87/handlebars-rust).
In this tutorial we will use **tera**.
The first step is to include on our application a dependency to `racket_contrib`
with the following section in our `Cargo.toml`:
```ini
[dependencies.rocket_contrib]
version = "0.3.6"
features = ["tera_templates"]
```
Simply including `rocket_contrib = "0.3.6"` isn't enough, since we want to
include `tera_template` in the features list.
The template engine need to be initialized using a **fairing**, which is the
Rocket analogous to **middlewares**.
```rust
extern crate rocket_contrib;
use rocket_contrib::Template;
/// In the main function, we should attach the template fairing
rocket::ignite()
.mount("/", routes![hello])
.attach(Template::fairing()) // <===
.launch();
```
We can now create our first template in `templates/base.html.tera`, containing
this simple HTML code:
{% raw %}
```html
<!doctype html>
<html>
<head>
<meta name="viewport"
content="width=device-width, initial-scale=1">
<link rel="stylesheet"
href="https://www.w3schools.com/w3css/4/w3.css">
</head>
<body>
<div class="w3-bar w3-light-gray">
<div class="w3-button">
<b>Blog</b>
</div>
</div>
<div class="w3-content">
{% block content %}
{% endblock content %}
</div>
</body>
</html>
```
{% endraw %}
**Tera** syntax is similar to the Django one. In the previous template we used
the **block** tag, which isolate a section in the document to be used in
inherited templates.
Let's use this template in our home page, putting the following content in a
file named `templates/index.html.tera`:
{% raw %}
```html
{% extends "base" %}
{% block content %}
<h1>This is our example blog application</h1>
<p>
Let's explore what we can do with
<a href="https://rocket.rs">Rocket</a> and
<a href="https://www.rust-lang.org">Rust</a>
</p>
{% endblock content %}
```
{% endraw %}
The previous template includes all the content of `base.html.tera`, using the
contents of the blog from the previous file. As you can see, this mechanism is
similar to extension and overriding in object-oriented languages.
Now we will render the template in our root page with the following handler:
```rust
#[get("/")]
fn root() -> Template {
let context = HashMap::<String, String>::new();
Template::render("index", context)
}
```
Every template must be creared with a context, and this is the reason why we are
creating an `HashMap` in the first row of the function. The second row renders
the template creating the HTTP response for the user.
The first argument of the `Template::render` function is the name of the
template. Rocket will search in the `templates` folder a template named
`index.html.tera`.
Tera will preload all the templates files at the application startup, so you
won't be able to see the effect of changes you do while the web server is
running.
To sum up, beside the HTML template files, our Rust code looks like this:
```rust
#![feature(plugin)]
#![plugin(rocket_codegen)]
extern crate rocket;
extern crate rocket_contrib;
use std::collections::HashMap;
use rocket_contrib::Template;
#[get("/")]
fn root() -> Template {
let context = HashMap::<String, String>::new();
Template::render("index", context)
}
fn main() {
rocket::ignite()
.mount("/", routes![root])
.attach(Template::fairing())
.launch();
}
```
The [next post]({% post_url 2018-03-22-rocket-tutorial-4 %}) is about how to
use a SQLite database. | 27.712329 | 80 | 0.679189 | eng_Latn | 0.980701 |
80520a0db6c8f4603ae8cf76e8ee7e907d49960a | 1,803 | md | Markdown | README.md | ptal/oak | 667c625096540600b6c6ac0943126ca092a9f80e | [
"Apache-2.0"
] | 135 | 2015-08-14T21:40:16.000Z | 2022-01-31T20:08:41.000Z | README.md | ptal/oak | 667c625096540600b6c6ac0943126ca092a9f80e | [
"Apache-2.0"
] | 77 | 2015-08-10T13:13:23.000Z | 2021-02-27T21:38:54.000Z | README.md | ptal/Rust.peg | 667c625096540600b6c6ac0943126ca092a9f80e | [
"Apache-2.0"
] | 20 | 2015-09-21T07:41:50.000Z | 2022-01-28T19:36:22.000Z | # Oak
[![ptal on Travis CI][travis-image]][travis]
[travis-image]: https://travis-ci.org/ptal/oak.png
[travis]: https://travis-ci.org/ptal/oak
Compiled on the nightly channel of Rust. Use [rustup](http://www.rustup.rs) for managing compiler channels.
You can download and set up the exact same version of the compiler used with `rustup override add 2021-01-06`.
Please consult the [Oak manual](http://hyc.io/oak).
## Features
* *Easy to install*: PEG grammar description as a Rust procedural macro.
* *User-friendly*: most of the types are automatically inferred from the parsing expressions.
* *Safe*: Well-formedness analysis guarantees termination.
* *Modular*: External parser rules can be called at any time.
* *Fast*: Generation of both recognizer and parser functions for each rule.
## Build local documentation
You might want to build the manual or code documentation from the repository because you need it to be synchronized with a specific version of Oak or simply for offline usage. Here how to do it!
#### Build the manual
You need the utility [mdbook](https://rust-lang.github.io/mdBook/):
```
cargo install mdbook
```
Once installed, go inside `oak/doc` and execute `mdbook build -o`.
The manual is generated inside a local folder named `book` and directly opened in your browser.
#### Build the code documentation
As a user of Oak, you will be interested by the runtime documentation.
```
cd oak/runtime
cargo doc
```
The documentation is then available in `oak/runtime/target/doc`.
To build the internal documentation of Oak, you can type this command at the root of the project:
```
cd oak
rustdoc --document-private-items --output=target/dev-doc src/liboak/lib.rs
```
The documentation will be available inside `oak/target/dev-doc`.
It is useful to work on Oak :-)
| 32.196429 | 194 | 0.751525 | eng_Latn | 0.988653 |
8053362ca46ca1f84fda285ef1b875884a38f106 | 1,828 | md | Markdown | README.md | ObadaElSharbatly/Pro_Expenses_Tracker | 43cca88a75d81b7bcfa414ee2b680784ccfeb1b5 | [
"MIT"
] | 1 | 2022-02-24T02:09:41.000Z | 2022-02-24T02:09:41.000Z | README.md | ObadaElSharbatly/Pro_Expenses_Tracker | 43cca88a75d81b7bcfa414ee2b680784ccfeb1b5 | [
"MIT"
] | null | null | null | README.md | ObadaElSharbatly/Pro_Expenses_Tracker | 43cca88a75d81b7bcfa414ee2b680784ccfeb1b5 | [
"MIT"
] | null | null | null | # Pro_Expenses_Tracker
<p align="center">
<img width="80%" height="80%" src="./Readme_images/app_photo.jpg">
</p>
Pro expenses tracker is a MERN stack and responsive application that requires the user to sign in to save all expenses to reach from anywhere. Users can track and filter expenses and income. Users can also manage debts and loans that need to be paid.
## Watch Demo
You can [click here](https://pro-expenses-tracker.herokuapp.com/) to watch the Demo which is deployed to Heroku website
## Use locally
> Note: it's better to follow these steps in order
- Copy and rename the `.env.example` file which is in `client` and `server` folders to be `.env` and put the right value in the variables.
- In Cli use this commands all in the `root` directory path in order
First you need to run this command to install some packages we need to run the app in the main directory
```
npm i
```
This command goes into the `Server` folder and installs the packages then does the same in `Client` folder
```
npm run setup
```
This command to run the application locally
```
npm run dev
```
## Technologies and npm used
- ## Database
- Mongodb
- Mongoose npm - to manage the schemas and data before going to the database
- bcrypt npm - to hash the passwords and secure it
- currency-symbol-map npm - to turn the currency name to the currency symbol
<p align="center">
<img width="80%" height="80%" src="./Readme_images/database_schema.png">
</p>
- ## Use env files
- dotenv npm - to access env files for to secure important variables and keys
- ## Frontend
- React and React-router-dom to be able to navigate between several pages
- Sass to style with some functions and variables
## MIT LICENSE
[MIT license](https://github.com/ObadaElSharbatly/Pro_Expenses_Tracker/blob/main/LICENSE)
| 30.466667 | 250 | 0.733042 | eng_Latn | 0.996124 |
80578823f392ef2d5395af8116b4fc18e743ba02 | 410 | md | Markdown | _posts/2015-05-20-UIApplicationOpenSettingsURLString.md | closer27/closer27.github.io | 62a8447f6f1b48f46f6b4a759c408d47efcce3bc | [
"MIT"
] | null | null | null | _posts/2015-05-20-UIApplicationOpenSettingsURLString.md | closer27/closer27.github.io | 62a8447f6f1b48f46f6b4a759c408d47efcce3bc | [
"MIT"
] | null | null | null | _posts/2015-05-20-UIApplicationOpenSettingsURLString.md | closer27/closer27.github.io | 62a8447f6f1b48f46f6b4a759c408d47efcce3bc | [
"MIT"
] | null | null | null | ---
layout: post
title: "UIApplicationOpenSettingsURLString를 이용해 앱에서 설정 앱으로 전환 시키기"
date: 2015-05-19
categories: ios
tags: [iOS, setting, tip]
comment: yes
---
iOS8에서부터 새로 추가된 로직
앱에서 카메라나 GPS 권한을 얻지 못했을 때 설정 앱으로 전환시켜 권한을 설정하도록 유도할 수 있다.
openURL을 통해 `UIApplicationOpenSettingsURLString`을 써서 연결
```objc
[[UIApplication sharedApplication] openURL:[NSURL URLWithString:UIApplicationOpenSettingsURLString]];
```
| 22.777778 | 101 | 0.773171 | kor_Hang | 0.999332 |
805914ced0ceacfa66e1292ac4528cbc853f56ed | 5,797 | md | Markdown | consensuses/README.md | pandoraboxchain/library | d335579be2739ff865ee6d94573d085ed26c0b93 | [
"MIT"
] | 73 | 2017-11-24T11:32:02.000Z | 2019-02-12T09:17:37.000Z | consensuses/README.md | pandoraboxchain/library | d335579be2739ff865ee6d94573d085ed26c0b93 | [
"MIT"
] | null | null | null | consensuses/README.md | pandoraboxchain/library | d335579be2739ff865ee6d94573d085ed26c0b93 | [
"MIT"
] | 14 | 2017-11-24T11:51:53.000Z | 2018-08-29T15:04:21.000Z | A very brief engineering introduction into consensus algorithms and distributed ledger data structures
===
**_Dr Maxim Orlovsky_**
Consensus algorithms define a sequence of actions by which independent *agents* (also named *actors*, *parties* or, in early research on the topic before the wide Internet adoption *processors*) come to an equivalent *view* (at least by the majority of the agents) on the parts of the distributed system. This can be determined, for instance, by some *client* (not participating in the consensus) obtaining the same result for his query regarding the consensus-based state of the system from any (or at least most) consensus participants.
Most often, consensus algorithms are used for solving the following problems:
- Leader election (selecting the agent among all consensus participants with the right to update the global state of the system)
- Atomic swaps (exact order of events that can't be ordered deterministically basing on their internal properties)
- State replication (maintaining global state shared across all, or most, of the agents)
These are the three major use cases for the consensus algorithms are highly interrelated. For instance, state replication can be solved by the proper ordering of state changes (i.e. atomic broadcasts) - and a proper leader election process may allow ordered atomic broadcasting by itself (however, there are consensuses achieving the same result without leader election process).
Historically, consensus algorithms originated from the research on multiprocessor computing; they were solving a problem of the global state for the cases when processor may fail (i.e. become unresponsive). In these cases communications were synchronous, i.e. bound by some upper and known time limit ∆.
Later, with the development of telecommunication and computer networks two other problems had arisen: the presence of unknown communications delays and adversaries. The former led to new research on partly synchronous and asynchronous consensus algorithms (when ∆ is either unknown or absent, when there is no upper limit for a possible network delays) and creation of algorithm that can tolerate arbitrary agent behaviour (*Byzantine behavior*) - so-called Byzantine fault-tolerant algorithms (or, simply, BFT consensuses).
With the wide adoption of Internet, the problem of adversaries become even larger. If within multiprocessor environments or telecommunication infrastructure each agent can be identified, the same can't be done in many cases with the Internet. Thus, a new line of public (or *permissionless*) consensuses has appeared, where the consensus algorithm had to become a protocol with embedded rules and procedures for identification and exclusion of Byzantine agents - like by some collateral mechanisms reducing the economic ability of such agents to further participate the protocol. Such systems acquired public attention under names of PoW and PoS consensuses. We will name such protocols *BFT consensuses with economical incentivisation* (BFT-EI). In many cases, asynchronicity and permissionless require to sacrifice other consensus qualities, like determinism or ability to be applied for a leader election scenarios.
Basing on the above, consensus algorithms can be classified with different criteria.
1. The subject of a consensus: atomic broadcasts, leader election, state replication (or, as another option, leader-based and leaderless algorithms)
2. Forms of fault tolerance: no fault tolerance, tolerance to non-arbitrary faults and Byzantine tolerance (BFT)
3. Assumptions for the consensus can be reached: synchronous, party synchronous, asynchronous
4. Consensuses with open and closed participation: permissioned vs permissionless, or public/opened vs private/closed.
5. Internal economical incentivisation: absent or present (BFT-EI)
6. Deterministic qualities of consensus, i.e. ability to achieve *finality*: consensus algorithms with finality property and non-deterministic consensuses.
These classes can be combined in some natural groups, like the opened participation will result in non-deterministic consensus properties (since we can't enumerate all of the consensus actors at a given moment of time), i.e. absence of finality, and it will be leaderless. A typical example of such consensus is Bitcoin PoW.
We define the following typical consensus property combinations:
1. PoW: permissionless synchronous non-deterministic leaderless BFT-EI
2. PoS: permissionless partly-synchronous deterministic leadership-based BFT-EI
3. BFT (in a narrow sense): permissioned, deterministic BFT. Can have different synchronicity assumptions and can be a leader- or leaderless
4. DAGs: permissionless asynchronous non-deterministic leaderless non-BFT tolerant
5. Other mixed (usually historical or heavy-experimental) types
Many real-world applications of consensus algorithms, like those found in modern experimental blockchains, tend to utilize a set of different consensus mechanics, like ones used for leader election (usually BFT-agreement-based, but sometimes even PoW), others for atomic broadcasts (PoS) and another for achieving determinism is state replication - usually in form of a BFT-type "gadget".
By themselves, a consensus algorithm does not require some particular data structure; they are all about agent behaviour and network communications. However, after invention of Bitcoin (which was first public-consensus based application) it appeared that systems requiring global state it can be useful to utilize some best practices on data structures, like log-like ledgers with cryptographic enhancements - so-called blockchains - or their more generic kind of directed acycled graphs (DAGs), usually utilized by consensuses from the group #4 of our classification above.
| 141.390244 | 918 | 0.817492 | eng_Latn | 0.999203 |
80599ead1a32d6b9287e15d1a17689edaaeafe1d | 9,199 | md | Markdown | notes/Continuous_Authentication_for_Mouse_Dynamics_A_Pattern-Growth_Approach.md | LeoTsui/CS259D_Notes_HW | ef0ed6e876529a3d84f4ff783563c4641d69c96e | [
"MIT"
] | 19 | 2018-01-09T00:25:20.000Z | 2021-06-09T01:49:35.000Z | notes/Continuous_Authentication_for_Mouse_Dynamics_A_Pattern-Growth_Approach.md | LeoTsui/CS259D_Note_HW | ef0ed6e876529a3d84f4ff783563c4641d69c96e | [
"MIT"
] | null | null | null | notes/Continuous_Authentication_for_Mouse_Dynamics_A_Pattern-Growth_Approach.md | LeoTsui/CS259D_Note_HW | ef0ed6e876529a3d84f4ff783563c4641d69c96e | [
"MIT"
] | 8 | 2018-03-12T16:52:40.000Z | 2021-12-23T08:40:35.000Z | # Continuous Authentication for Mouse Dynamics: A Pattern-Growth Approach
<!-- TOC -->
- [Background Knowledge](#background-knowledge)
- [Goal and Contribution](#goal-and-contribution)
- [Data(Mouse Behavior Data)](#datamouse-behavior-data)
- [Data Source](#data-source)
- [Mouse Behavior Analysis](#mouse-behavior-analysis)
- [Mouse Behavior Pattern Mining](#mouse-behavior-pattern-mining)
- [Notation](#notation)
- [Mining Method](#mining-method)
- [References-Behavior Pattern Generation and Matching](#references-behavior-pattern-generation-and-matching)
- [Behavior Pattern Analysis](#behavior-pattern-analysis)
- [Feature](#feature)
- [Feature Construction from Mined Pattern](#feature-construction-from-mined-pattern)
- [Empirical Feature Study](#empirical-feature-study)
- [Detection Implementation](#detection-implementation)
- [Limitation](#limitation)
- [References](#references)
<!-- /TOC -->
## Background Knowledge
* User Authentication Mechanism
* Only at the initial login session
* Continuous (re)authentication
* Passive
* Transparent to users
* No hit on usability
* Mouse dynamics
* Intrinsic behavioral variables
* Intrinsic human factors
* Biological or emotional status of the user
* External environmental variables
* Software environment, task, interaction mode
* No enough data for malicious users
* No public data set in mouse dynamics research
* Mouse Behavior Pattern
* Frequently **recurring** behavior segments
* **Fixed** series of consecutive operations
* Hypothesis
* Observation
* Measurements extracted from behavior patterns are more stable than from holistic behavior
* Assumption
* Recurring and fixed behavior patterns
* Provide more stable and discriminative features or measurements
* Allow to more accurately characterize the discriminable components of mouse behavior
* One-Class Classification
* Only legitimate user patterns are available
* Useing both the legitimate user's and impostors' samples is not practical
* Too much impostors' samples in realistic applications
## Goal and Contribution
* Using a pattern-growth based mining method to extract frequent-behavior segments
* One-class classification
* Established a new mouse behavioral data set
* Develop a simple and efficient continuous user authentication method
## Data(Mouse Behavior Data)
### Data Source
* Set an experimental environment
* Same computer hardware configuration
* All users are college students(Some people majoring in computer science)
* 28 participants
* ~90,000 mouse actions/user
* 30 sessions
* Each 30 minute
* Internet surfing, word processing, online chatting, programming, online gaming
* Between 30-60 days per participant
* Data record
* Event type (e.g., mouse move/click), position, timestamp, application information
### Mouse Behavior Analysis
* Mouse events
* System messages sent to receiving applications
* Inform current cursor position & mouse button status
* Types
* Mouse Down
* Mouse Up
* Mouse Wheel
* Mouse Move
* Mouse actions
* Single click
* Mouse down followed by mouse up
* Double click
* Mouse down, up, down, up
* Common movement
* General mouse movement with no clicks
* Point and click movement
* Mouse movement followed by single/double click
* Drag and drop movement
* Mouse down, movement, mouse up
* Silence
* No mouse operation
* Encoded **Mouse action** into **Mouse operation**
* Mouse operation
* Truple:
* `<action-type, application-type, screen-area, window-position, timestamp>`
* Mouse-Behavior pattern: recurring & fixed segments
* Micro-habitual patterns
* Subconscious/habitual factors urging GUI interactions
* Task-intended patterns
* Operating habits under certain applications (e.g., using certain function of an application)
* Example: creating a new document in a word processing app
### Mouse Behavior Pattern Mining
#### Notation
* $$I = \{i_1 , i_2, ..., i_n\}$$, a set of all mouse operations
* $$\mathrm{operation}\text{-}\mathrm{set}$$, a set of mouse operations
* Example: $$\{(1,3,4,0), (2,1,4,0), (3,1,4,0)\}$$
* $$s$$, sequence: ordered list of operation sets by user ID and timestamp
* $$s = \{s_1, s_2, ..., s_k\}$$, each $$s_j$$
* An $$\text{operation-set}$$ (subset of $$I$$), $$s_j \subset I$$, for $$1 \leq j \leq l$$
* Called an element of sequence $$s$$
* $$s_j = \langle x_1, x_2, ..., x_m \rangle$$, each $$x_k$$ is a mouse operation
* Example:
* $$s = \{\langle(1,3,4,0)\rangle, \langle(1,3,4,0), (2,1,4,0), (3,1,4,0)\rangle, \langle(2,1,2,1)\rangle\}$$
* $$\mathrm{length}(s) = 5$$
* $$\alpha$$, a subsequence of $$s$$
* Example
* $$\{\langle(1,3,4,0)\rangle\}$$ is a subsequence of $$\{\langle(1,3,4,0), (2,1,4,0), (3,1,4,0)\rangle\}$$
* $$L$$, length of sequence: the number of mouse operation instances
* $$\text{L-sequence}$$: A sequence of length $$L$$
* $$S$$, a mouse operation sequence database
* A set of triples $$\langle ID, sid, s \rangle$$
* $$ID$$, the user ID
* $$sid$$, a sequence $$ID$$
* $$s$$, a sequence
* $$\mathrm{Support_S} (\alpha)$$ = $$\#$$ tuples in databases $$S$$ that contain $$\alpha$$
* Sequential pattern, if $$\mathrm{Support_S} \geq \xi$$
* $$\xi$$ a given threshold
* **Problem Statement**
* Sequential mouse behavior pattern mining is
* Input
* Mouse operation sequence $$S$$
* minimun support threshold $$\xi$$
* Output
* Complete set of all frequent mouse behavior patterns in $$S$$
#### Mining Method
* PrefixSpan
* Mining Sequential Patterns by Pattern Growth: The PrefixSpan Approach (2004)
* Project the database into a set of smaller databases
* Based on set of patterns mined so far
* Mine locally frequent patterns in each projected database
#### References-Behavior Pattern Generation and Matching
* Create "baseline", normal behavior pattern generation
* For each user
* Mine behavior patterns from each session
* Collect all patterns as reference behavior pattern
* Pattern matching
* Given a new operation sequence match against mined patterns
* Search patterns
* Output all matching patterns
#### Behavior Pattern Analysis
* Set minimum support $$8\%$$
* Trade-off value, between minimum support and true effectiveness of behavior patterns
## Feature
* Frequent-behavior patterns cannot be used directly
### Feature Construction from Mined Pattern
* Click elapsed time
* Time spent by user to perform a click action
* Single click: $$\mathrm{Avg}$$, $$\mathrm{SD}$$ of overall time
* Double click: $$\mathrm{Avg}$$, $$\mathrm{SD}$$ of overall & 3 interval times
* Movement speed
* Average movement speed for different types of mouse movement
* 24 types: 8 directions, 3 distance ranges
* Movement acceleration
* Average acceleration for different types of mouse movement
* Similar to movement speed
* Relative position of extreme speed of the movement curve
* Example: 0.5 for middle position of movement speed curve
* **Total: 92 features**
* 20 click-related features
* 24 movement-related features
* Only from common & point-and-click movements
* 24 acceleration-related features
* 24 extreme-speed-related features
### Empirical Feature Study
* Stability of Features in Behavior Pattern
* Feature can be skewed by
* Environmental variables
* Human factors
* Example
* Finding documents (Not sure where is it)
* Kernel density estimation
* a non-parametric way of estimating the probability density function (PDF) of a random variable
* Compute PDF for each feature from
* Behavior patterns
* Holistic behavior
* Discriminability of Features in Behavior Patterns
* The features extracted from behavior pattern evidently superior to those extracted from holistic behavior
* More stable
* More discriminable
* Statistical Dispersion of Features Across Subjects
## Detection Implementation
* Nearest-Neighbor
* $$k = 3$$
* Anomaly score
* Mahalanobis distance between test & training feature vectors
* Neural Network
* Single hidden layer
* Input nodes, $$p$$
* Hidden nodes, $$\lfloor2p/3\rfloor$$
* Output node, $$1$$
* Train the detector with every input feature vector to output $$=1.0$$
* Test-vector fed into network, output $$\sim$$ $$1.0$$ or $$-1.0$$
* One-class SVM
* RBF kernel
## Limitation
* Samples are only come from the certain organization (college)
* No impostors' samples
* Need to collect data and train models for every deploy
## References
* Continuous Authentication for Mouse Dynamics: A Pattern-Growth Approach (C. Shen et al., 2012)
* CS 259D Lecture 5
| 38.012397 | 117 | 0.675291 | eng_Latn | 0.947424 |
8059cc6542047bf45b9005a40de2146028e46484 | 5,491 | md | Markdown | reports/request-validator.md | ankon/json-schema-benchmark | 051c2f728e5bdbbccab5c5df1491d45744793d20 | [
"MIT"
] | null | null | null | reports/request-validator.md | ankon/json-schema-benchmark | 051c2f728e5bdbbccab5c5df1491d45744793d20 | [
"MIT"
] | null | null | null | reports/request-validator.md | ankon/json-schema-benchmark | 051c2f728e5bdbbccab5c5df1491d45744793d20 | [
"MIT"
] | null | null | null | # [`request-validator`](https://github.com/bugventure/request-validator) - test summary
# All validators fail this test
`some languages do not distinguish between different types of numeric value, a float is not an integer even without fractional part`
# [`request-validator`](https://github.com/bugventure/request-validator) failed tests
Some validators have deliberately chosen not to support parts of the spec. Go to the [`request-validator`](https://github.com/bugventure/request-validator) homepage to learn if
that is the case for these tests.
|test failed|reason
|-----------|------
|`maxLength validation, two supplementary Unicode code points is long enough`|Expected result: `true` but validator returned: `false`
|`minLength validation, one supplementary Unicode code point is not long enough`|Expected result: `false` but validator returned: `true`
|`integer, a bignum is an integer`|Expected result: `true` but validator returned: `false`
|`integer, a negative bignum is an integer`|Expected result: `true` but validator returned: `false`
|`ECMA 262 regex non-compliance, ECMA 262 has no support for \Z anchor from .NET`|Expected result: `false` but validator returned: `true`
|`validation of date-time strings, an invalid date-time string`|Expected result: `false` but validator returned: `true`
|`validation of date-time strings, only RFC3339 not all of ISO 8601 are valid`|Expected result: `false` but validator returned: `true`
|`validation of URIs, an invalid protocol-relative URI Reference`|Expected result: `false` but validator returned: `true`
|`validation of URIs, an invalid relative URI Reference`|Expected result: `false` but validator returned: `true`
|`validation of URIs, an invalid URI`|Expected result: `false` but validator returned: `true`
|`validation of URIs, an invalid URI though valid URI reference`|Expected result: `false` but validator returned: `true`
|`validation of URIs, an invalid URI with spaces`|Expected result: `false` but validator returned: `true`
|`validation of URIs, an invalid URI with spaces and missing scheme`|Expected result: `false` but validator returned: `true`
|`validation of e-mail addresses, an invalid e-mail address`|Expected result: `false` but validator returned: `true`
|`validation of IP addresses, an IP address with too many components`|Expected result: `false` but validator returned: `true`
|`validation of IP addresses, an IP address with out-of-range values`|Expected result: `false` but validator returned: `true`
|`validation of IP addresses, an IP address without 4 components`|Expected result: `false` but validator returned: `true`
|`validation of IP addresses, an IP address as an integer`|Expected result: `false` but validator returned: `true`
|`validation of IPv6 addresses, an IPv6 address with out-of-range values`|Expected result: `false` but validator returned: `true`
|`validation of IPv6 addresses, an IPv6 address with too many components`|Expected result: `false` but validator returned: `true`
|`validation of IPv6 addresses, an IPv6 address containing illegal characters`|Expected result: `false` but validator returned: `true`
|`validation of host names, a host name starting with an illegal character`|Expected result: `false` but validator returned: `true`
|`validation of host names, a host name containing illegal characters`|Expected result: `false` but validator returned: `true`
|`validation of host names, a host name with a component too long`|Expected result: `false` but validator returned: `true`
|`escaped pointer ref, slash valid`|Expected result: `true` but validator returned: `false`. **This excludes this validator from performance tests**
|`escaped pointer ref, tilda valid`|Expected result: `true` but validator returned: `false`. **This excludes this validator from performance tests**
|`escaped pointer ref, percent valid`|Expected result: `true` but validator returned: `false`. **This excludes this validator from performance tests**
|`Recursive references between schemas, valid tree`|Expected result: `true` but validator returned: `false`
|`remote ref, remote ref invalid`|Expected result: `false` but validator returned: `true`
|`fragment within remote ref, remote fragment valid`|The schema failed to load(`request-validator: invalid schema reference 'http://localhost:1234/subSchemas.json#/integer'`)
|`fragment within remote ref, remote fragment invalid`|The schema failed to load(`request-validator: invalid schema reference 'http://localhost:1234/subSchemas.json#/integer'`)
|`ref within remote ref, ref within ref valid`|The schema failed to load(`request-validator: invalid schema reference 'http://localhost:1234/subSchemas.json#/refToInteger'`)
|`ref within remote ref, ref within ref invalid`|The schema failed to load(`request-validator: invalid schema reference 'http://localhost:1234/subSchemas.json#/refToInteger'`)
|`base URI change, base URI change ref invalid`|Expected result: `false` but validator returned: `true`
|`base URI change - change folder, number is valid`|Expected result: `true` but validator returned: `false`
|`base URI change - change folder in subschema, number is valid`|Expected result: `true` but validator returned: `false`
|`root ref in remote ref, string is valid`|Expected result: `true` but validator returned: `false`
|`root ref in remote ref, null is valid`|Expected result: `true` but validator returned: `false`
**All other tests passed**.
[back to benchmarks](https://github.com/ebdrup/json-schema-benchmark) | 99.836364 | 176 | 0.772901 | eng_Latn | 0.910402 |
805aeb5192332e0a946106a066e4defeb6de999b | 819 | md | Markdown | README.md | amboffman/notetaker | 6c80eea0cbd11d47aea987abd179e37881f399d5 | [
"Apache-2.0"
] | null | null | null | README.md | amboffman/notetaker | 6c80eea0cbd11d47aea987abd179e37881f399d5 | [
"Apache-2.0"
] | null | null | null | README.md | amboffman/notetaker | 6c80eea0cbd11d47aea987abd179e37881f399d5 | [
"Apache-2.0"
] | null | null | null |
# Note Taker
[](https://opensource.org/licenses/Apache-2.0)
This application is designed with Express to create store and delte notes.
## Table of Contents
1. Installation
1. Usage
## Installation
You will need to input "npm install" in the terminal to install all the necessary node modules.
## Usage
On the notes page, write a title and note content.
Then the save button will appear. When you save, your note will be on the left.
You can delete the note if you no longer need it with the trashcan icon.
| 31.5 | 128 | 0.727717 | eng_Latn | 0.954427 |
805b53780f2ed0a8c1b30ad56535d023ba297b78 | 2,364 | md | Markdown | docs/vs-2015/extensibility/debugger/reference/idebugprogrampublisher2-unpublishprogramnode.md | tommorris/visualstudio-docs.cs-cz | 92c436dbc75020bc5121cc2c9e4976f62c9b13ca | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/vs-2015/extensibility/debugger/reference/idebugprogrampublisher2-unpublishprogramnode.md | tommorris/visualstudio-docs.cs-cz | 92c436dbc75020bc5121cc2c9e4976f62c9b13ca | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/vs-2015/extensibility/debugger/reference/idebugprogrampublisher2-unpublishprogramnode.md | tommorris/visualstudio-docs.cs-cz | 92c436dbc75020bc5121cc2c9e4976f62c9b13ca | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: IDebugProgramPublisher2::UnpublishProgramNode | Dokumentace Microsoftu
ms.custom: ''
ms.date: 2018-06-30
ms.prod: visual-studio-dev14
ms.reviewer: ''
ms.suite: ''
ms.technology:
- vs-ide-sdk
ms.tgt_pltfrm: ''
ms.topic: article
f1_keywords:
- IDebugProgramPublisher2::UnpublishProgramNode
helpviewer_keywords:
- IDebugProgramPublisher2::UnpublishProgramNode
ms.assetid: 57c7e6e1-b84e-4e14-ad83-cbbb64e2f526
caps.latest.revision: 9
ms.author: gregvanl
manager: ghogen
ms.openlocfilehash: 2d3d20b0457aceb2296ed0aca2e480a37ca07d0e
ms.sourcegitcommit: 55f7ce2d5d2e458e35c45787f1935b237ee5c9f8
ms.translationtype: MT
ms.contentlocale: cs-CZ
ms.lasthandoff: 08/22/2018
ms.locfileid: "42667853"
---
# <a name="idebugprogrampublisher2unpublishprogramnode"></a>IDebugProgramPublisher2::UnpublishProgramNode
[!INCLUDE[vs2017banner](../../../includes/vs2017banner.md)]
Nejnovější verzi tohoto tématu můžete najít v [IDebugProgramPublisher2::UnpublishProgramNode](https://docs.microsoft.com/visualstudio/extensibility/debugger/reference/idebugprogrampublisher2-unpublishprogramnode).
Odebere zadaný program uzel z dostupnost pro ladění modulů (DEs) a správce ladění relace (SDM).
## <a name="syntax"></a>Syntaxe
```cpp
HRESULT UnpublishProgramNode(
IDebugProgramNode2* pProgramNode
);
```
```csharp
int UnpublishProgramNode(
IDebugProgramNode2 pProgramNode
);
```
#### <a name="parameters"></a>Parametry
`pProgramNode`
[in] [IDebugProgramNode2](../../../extensibility/debugger/reference/idebugprogramnode2.md) objekt představující uzel program odebírá.
## <a name="return-value"></a>Návratová hodnota
Pokud je úspěšná, vrátí `S_OK`; v opačném případě vrátí kód chyby.
## <a name="remarks"></a>Poznámky
Po odebrání uzlu program již není k dispozici bude Dotazováno pro informace o programu.
Uzel programu zpřístupnění, zavolejte [PublishProgramNode](../../../extensibility/debugger/reference/idebugprogrampublisher2-publishprogramnode.md) metody.
## <a name="see-also"></a>Viz také
[IDebugProgramPublisher2](../../../extensibility/debugger/reference/idebugprogrampublisher2.md)
[IDebugProgramNode2](../../../extensibility/debugger/reference/idebugprogramnode2.md)
[PublishProgramNode](../../../extensibility/debugger/reference/idebugprogrampublisher2-publishprogramnode.md)
| 36.369231 | 215 | 0.769036 | ces_Latn | 0.411196 |
805c93e388ece27b0e242e5930af5af101bd094b | 13,885 | md | Markdown | links.md | pkisiel77/nlp | f08af0b92e9b8dcec7eab210f8512365c76cf492 | [
"MIT"
] | null | null | null | links.md | pkisiel77/nlp | f08af0b92e9b8dcec7eab210f8512365c76cf492 | [
"MIT"
] | null | null | null | links.md | pkisiel77/nlp | f08af0b92e9b8dcec7eab210f8512365c76cf492 | [
"MIT"
] | null | null | null | # NLP, NLU, STT, TTS, MLOps
## Before use tf on the server please check
```
grep -q avx2 /proc/cpuinfo && echo AVX2 supported || echo No AVX2 support detected
```
## Speech To Text
- https://www.youtube.com/watch?v=z-3ITXhRfKE
## NLP
- https://rachitsingh-30342.medium.com/semantic-similarity-164836f13b4c
## Questions
[The Ultimate Guide to Acing Machine Learning Interviews for Data Scientists and Machine Learning Engineers](https://pub.towardsai.net/4-types-of-machine-learning-interview-questions-for-data-scientists-and-machine-learning-engineers-b8135805ce1b)
[Interview resources : ML/Data Science/AI Research Engineer](https://purvanshimehta.medium.com/interview-resources-ml-data-science-ai-research-engineer-4703518d208e)
[30 Most Asked Machine Learning Questions Answered](https://medium.com/pythoneers/30-basic-machine-learning-questions-answered-692acd10841f)
[Coding Interview types: ML/Data Science/AI Research Engineer](https://purvanshimehta.medium.com/coding-interview-resources-ml-data-science-ai-research-engineer-b7cc2fbf81ab)
## Utils
[This Free GPU-Enabled Python IDE For Your Data Science Projects](https://medium.com/better-ai/this-free-gpu-enabled-python-ide-for-your-data-science-projects-acc50dd8d1dd)
## ML Projects, Libs
[Anomaly Detection Using PyCaret!!!](https://insaid.medium.com/anomaly-detection-using-pycaret-38b267ed638b)
[Detectron2 vs. Yolov5 (Which One Suits Your Use Case Better?)](https://medium.com/ireadrx/detectron2-vs-yolov5-which-one-suits-your-use-case-better-d959a3d4bdf)
[Machine Learning Projects](https://www.youtube.com/playlist?list=PLfFghEzKVmjvuSA67LszN1dZ-Dd_pkus6)
## Diagrams, Dashboards
[Analyzing ML Model using Dashboard](https://towardsdatascience.com/analyzing-ml-model-using-dashboard-f69e17a942f9)
[Draw.io VS Code Integration](https://marketplace.visualstudio.com/items?itemName=hediet.vscode-drawio)
[VSCode for Diagramming and Presentation](https://alpha2phi.medium.com/vscode-for-diagramming-and-presentation-b3c1dfb57aad)
## Datasets
[How to Use MongoDB to Store and Retrieve ML Models](https://pub.towardsai.net/how-to-use-mongodb-to-store-and-retrieve-ml-models-2a8a831e7326)
[A curated list of the most important common-sense datasets in NLP](https://hilbert-cantor.medium.com/a-curated-list-of-the-most-important-common-sense-datasets-in-nlp-66963567d00b)
## MLOps
[Lyft’s End-to-End ML Platform](https://quantumstat.medium.com/the-nlp-cypher-08-08-21-17c2f6476fe0)
[Open MLOps: Open Source Production Machine Learning](https://towardsdatascience.com/open-mlops-open-source-production-machine-learning-f4080f02e9f0)
[Apple’s Machine Learning Researchers Have Developed A No-Code AI Platform Called ‘Trinity’ For Complex Spatial Datasets](https://www.marktechpost.com/2021/07/23/apples-machine-learning-researchers-have-developed-a-no-code-ai-platform-called-trinity-for-complex-spatial-datasets/?fbclid=IwAR2-KgHGtAkU0ayZxjAzqgT8wAFL2VkcoE89l-J5fJqZXXnOZoN3QXD57x8)
[10 Amazing MLOps Learning Resources](https://medium.com/analytics-vidhya/10-amazing-mlops-learning-resources-378804c418be)
## Python
[Python functions naming: an algorithm](https://melevir.medium.com/python-functions-naming-the-algorithm-74320a18278d)
[Namespacing in Python](https://betterprogramming.pub/namespacing-with-python-79574d125564)
[A Guide to Python Good Practices (Kedro)](https://towardsdatascience.com/a-guide-to-python-good-practices-90598529da35)
[6 Python Logging Best Practices](https://medium.com/nerd-for-tech/6-python-logging-best-practices-94dc7d318553)
[Best Practices To Follow While Creating Classes In Python](https://medium.com/pythoneers/best-practices-to-follow-while-creating-classes-in-python-4497bc8535dc)
[Tips and Tricks to Work with Text Files in Python](https://towardsdatascience.com/tips-and-tricks-to-work-with-text-files-in-python-89f14a755315)
## OCR
[Extract Text From Images Using Tesseract OCR Engine and Python Choose from over 100 languages](https://towardsdatascience.com/how-to-extract-text-from-images-using-tesseract-ocr-engine-and-python-22934125fdd5)
## October 2021
[Parallel Sentence Mining in Python](https://towardsdatascience.com/parallel-sentence-mining-in-python-ad54fc909f85)
## August 2021
[Sentiment analysis with Hugging face](https://satish1v.medium.com/sentiment-analysis-with-hugging-face-4b080d0cf34d)
[The Beginner’s Guide to Summarize Articles Using NLP](https://medium.com/mlearning-ai/summarize-articles-using-nlp-da1f5befe52b)
[WHAT PROGRAMMING LANGUAGES ARE SUITABLE FOR NATURAL LANGUAGE PROCESSING?](https://medium.com/magnidata/what-programming-languages-are-suitable-for-natural-language-processing-be560c0366ef)
[Nine Emerging Python Libraries You Should Add to Your Data Science Toolkit in 2021](https://towardsdatascience.com/nine-emerging-python-libraries-you-should-add-to-your-data-science-toolkit-in-2021-85ce3d239846)
[Gradio](https://github.com/gradio-app/gradio)
[NLP: Text Data Visualization](https://towardsdatascience.com/nlp-text-data-visualization-5d5c64c86019)
[5 Simple Ways to Tokenize Text in Python](https://towardsdatascience.com/5-simple-ways-to-tokenize-text-in-python-92c6804edfc4)
[The NLP Cypher | 08.08.21](https://quantumstat.medium.com/the-nlp-cypher-08-08-21-17c2f6476fe0)
[NLP: Splitting Text into Sentences](https://towardsdatascience.com/nlp-splitting-text-into-sentences-7bbce222ef17)
[Few Shot Learning Using SBERT](https://medium.com/analytics-vidhya/few-shot-learning-using-sbert-95f8b08248bf)
## July 2021
[Top 20 NLP applications in Data science](https://rakesh-maddipati.medium.com/top-20-nlp-applications-in-data-science-620aaa982bbb)
[Can a Computer Ever Learn to Talk?](https://onezero.medium.com/can-a-computer-ever-learn-to-talk-cf47d453669f)
[Google’s LaMDA: The Next Generation of Chatbots](https://towardsdatascience.com/googles-lamda-the-next-generation-of-chatbots-62294be58426)
[Extract meaningful information from Big Data using NLP and Machine Learning](https://payodatechnologyinc.medium.com/extract-meaningful-information-from-big-data-using-nlp-and-machine-learning-f76972b4b9ea)
[NER, SpaCy and Lasagne](https://medium.com/swlh/ner-spacy-and-lasagne-51b56fdad57e)
[Why can’t I use text like it is for NLP AI modeling?](https://fabraz.medium.com/why-cant-i-use-text-like-it-is-for-nlp-ai-modeling-de70a6e1420e)
[Doc2Vec — Computing Similarity between Documents](https://medium.com/red-buffer/doc2vec-computing-similarity-between-the-documents-47daf6c828cd)
[MMDetection Tutorial — An End2End State-of-the-art Object Detection Library](https://towardsdatascience.com/mmdetection-tutorial-an-end2end-state-of-the-art-object-detection-library-59064deeada3)
[GPT-J](https://www.p3r.one/gpt-j/)
[Classifying Tweets for Sentiment Analysis: Natural Language Processing in Python for Beginners](https://medium.com/vickdata/detecting-hate-speech-in-tweets-natural-language-processing-in-python-for-beginners-4e591952223)
[Facebook AI Similarity Search](https://towardsdatascience.com/facebook-ai-similarity-search-7c564daee9eb)
[Using NER to detect relevant entities in Finance](https://medium.com/ravenpack/using-ner-to-detect-relevant-entities-in-finance-a66af2fad921)
## June 2021
### STT
[Algorytm dwukrotnie lepszy niż psychiatra. Rozpoznaje depresję i schizofrenię po głosie](https://www.focus.pl/artykul/algorytm-dwukrotnie-lepszy-niz-psychiatra-rozpoznaje-depresje-i-schizofrenie-po-glosie)
### NLP
[***simpleT5*** — Train T5 Models in Just 3 Lines of Code](https://medium.com/geekculture/simplet5-train-t5-models-in-just-3-lines-of-code-by-shivanand-roy-2021-354df5ae46ba)
[Recommendation system using BERT embeddings](https://medium.com/analytics-vidhya/recommendation-system-using-bert-embeddings-1d8de5fc3c56)
[SpellChecker: Everything you might want to know](https://medium.com/analytics-vidhya/spellchecker-review-71a461e20279)
[Data analysis made easy: Text2Code for Jupyter notebook](https://towardsdatascience.com/data-analysis-made-easy-text2code-for-jupyter-notebook-5380e89bb493)
[Top 10 NLP Projects on Kaggle to Strengthen Your Portfolio](https://medium.com/swlh/top-10-nlp-projects-on-kaggle-to-strengthen-your-portfolio-cb28191c59dd)
[Mishti A Chatbot with Emotions](https://hiteshchandra.medium.com/mishti-a-chatbot-with-emotions-cd454db88863)
[sense2vec in python3](https://medium.com/nerd-for-tech/sense2vec-in-python3-9d3db9557495)
[Differences Between Word2Vec and BERT](https://medium.com/swlh/differences-between-word2vec-and-bert-c08a3326b5d1)
[How did I write an own OCR program using Keras and TensorFlow in Python](https://towardsdatascience.com/how-did-i-train-an-ocr-model-using-keras-and-tensorflow-7e10b241c22b)
[Sztuczna inteligencja zmieni obsługę prawną? Polska kancelaria skorzysta z platformy AQUILA](https://whatsnext.pl/sztuczna-inteligencja-platforma-aquila-sadownictwo/)
[Automate Your Database Job by Using GPT-3 To Generate Queries](https://betterprogramming.pub/automate-your-database-job-by-using-gpt-3-to-generate-queries-9e0ad2004f01)
[GPT-3 Scared You? Meet Wu Dao 2.0: A Monster of 1.75 Trillion Parameters](https://towardsdatascience.com/gpt-3-scared-you-meet-wu-dao-2-0-a-monster-of-1-75-trillion-parameters-832cd83db484)
[Generating Sentences from Keywords using Transformers in NLP](https://medium.com/mlearning-ai/generating-sentences-from-keywords-using-transformers-in-nlp-e89f4de5cf6b)
[The NLP Cypher | 06.06.21](https://pub.towardsai.net/the-nlp-cypher-06-06-21-27b7b0de02f4)
[10 ML Project and AI Project Ideas for 2021](https://jelvix.medium.com/10-ml-project-and-ai-project-ideas-for-2021-133bc59ae545)
[Text2App: A Framework for Creating Android Apps from Text Descriptions](https://arxiv.org/pdf/2104.08301.pdf?fbclid=IwAR022b41Mh4BBQ7muPM_WEzI18Ry0tzPaXtUPb3usfoY7U9wA0Be9JgOBfQ)
## May 2021
### Voice
[Giving a Voice to Rasa with Botium Speech](https://floriantreml.medium.com/giving-a-voice-to-rasa-with-botium-speech-1c65a7513bdf)
### NLP
[NKJP](http://nkjp.pl/index.php?page=14&lang=0)
[Get started with Google Trax for NLP](https://towardsdatascience.com/get-started-with-google-trax-for-nlp-ff8dcd3119cf)
[The NLP Cypher | 05.09.21](https://pub.towardsai.net/the-nlp-cypher-05-09-21-12c474a6cdd8)
[Custom Named Entity Recognition (NER)](https://medium.com/product-ai/custom-named-entity-recognition-ner-329e73cf909b)
[9 Distance Measures in Data Science](https://towardsdatascience.com/9-distance-measures-in-data-science-918109d069fa)
[Top 14 NLP Job-Ready Skills for 2021](https://medium.com/@ODSC/top-14-nlp-job-ready-skills-for-2021-84325af56636)
[Magiczny składnik Spotify: uczenie maszynowe](https://ichi.pro/pl/magiczny-skladnik-spotify-uczenie-maszynowe-200864210668035)
[Microsoft DeBERTa Tops Human Performance on SuperGLUE NLU Benchmark](https://medium.com/syncedreview/microsoft-deberta-tops-human-performance-on-superglue-nlu-benchmark-be590e63299f)
## April 2021
[Conversational Summarization with Natural Language Processing](https://medium.com/rocket-mortgage-technology-blog/conversational-summarization-with-natural-language-processing-c073a6bcaa3a)
[Introducing NLPretext, a unified framework to facilitate text preprocessing](https://medium.com/artefact-engineering-and-data-science/introducing-nlpretext-a8bb7c03df89)
[Top 10 python libraries for data science](https://technologynous.com/top-10-python-libraries-for-data-science/)
[Interpreting Semantic Text Similarity from Transformer Models](https://towardsdatascience.com/interpreting-semantic-text-similarity-from-transformer-models-ba1b08e6566c)
[Network graphs analysis (Part 2 of 2): Visualizing the characters of Hamilton as a social network](https://medium.com/data-science-at-microsoft/network-graphs-analysis-part-2-of-2-visualizing-the-characters-of-hamilton-as-a-social-network-ed61699df319)
[Paper Explained- Vision Transformers (Bye Bye Convolutions?)](https://medium.com/analytics-vidhya/vision-transformers-bye-bye-convolutions-e929d022e4ab)
[The Map of Artificial Intelligence (2020)](https://medium.com/swlh/the-map-of-artificial-intelligence-2020-2c4f446f4e43)
[How to Extract Locations from Text with Natural Language Processing](https://medium.com/spatial-data-science/how-to-extract-locations-from-text-with-natural-language-processing-9b77035b3ea4)
[Amazon’s BERT Optimal Subset: 7.9x Faster & 6.3x Smaller Than BERT](https://medium.com/syncedreview/amazons-bert-optimal-subset-7-9x-faster-6-3x-smaller-than-bert-10323e4538e9)
https://github.com/graykode/nlp-tutorial
[How we reduced our text similarity runtime by 99.96%](https://medium.com/data-science-at-microsoft/how-we-reduced-our-text-similarity-runtime-by-99-96-e8e4b4426b35)
## Chatbots
[Voicebot – definicja pojęcia](https://www.k2bots.ai/abotcadlo/voicebot)
[Building a Chatbot with OpenAI's GPT-3 engine, Twilio SMS and Python](https://www.twilio.com/blog/openai-gpt-3-chatbot-python-twilio-sms)
[Medical Chatbot Using Bert and GPT2](https://suniljammalamadaka.medium.com/medical-chatbot-using-bert-and-gpt2-62f0c973162f)
[Using BERT to Build a Whole-Of-Government Chatbot](https://medium.com/dsaid-govtech/using-bert-to-build-a-whole-of-government-chatbot-1afa826a3323)
[Automate any Chat-Messenger with Python](https://medium.com/analytics-vidhya/automate-any-chat-messenger-with-python-538d1b7d5ed0)
## API
[Every API Starts with a Story](https://medium.com/pragmatic-programmers/api-story-mike-amundsen-d8dd56a12f47)
## NER
[NER With Transformers And spaCy](https://towardsdatascience.com/ner-with-transformers-and-spacy-b3240bc65eb4)
[How to Train spaCy to Autodetect New Entities (NER) [Complete Guide]](https://www.machinelearningplus.com/nlp/training-custom-ner-model-in-spacy/)
## Speech To Text
[Transcribing videos using Google’s Pre-trained Speech-to-text API](https://blog.searce.com/transcribing-videos-using-googles-pre-trained-speech-to-text-api-7bb00186e188)
| 60.633188 | 349 | 0.805113 | yue_Hant | 0.543017 |
805daca121286dd580e25661f5e29d0704dfa559 | 214 | md | Markdown | README.md | ammogcoder/AspNetCore-CustomLoggingProvider | b6b1a83d591eede506aa886ccc172d130c63014a | [
"Unlicense"
] | 21 | 2019-04-15T10:49:08.000Z | 2021-12-17T17:46:38.000Z | README.md | ammogcoder/AspNetCore-CustomLoggingProvider | b6b1a83d591eede506aa886ccc172d130c63014a | [
"Unlicense"
] | null | null | null | README.md | ammogcoder/AspNetCore-CustomLoggingProvider | b6b1a83d591eede506aa886ccc172d130c63014a | [
"Unlicense"
] | 6 | 2019-04-16T04:27:17.000Z | 2020-12-03T05:26:33.000Z | # How to write a custom logging provider in Asp.Net Core
The full tutorial can be found at my [WordPress blog](https://teonotebook.wordpress.com/2019/04/13/how-to-write-a-custom-logging-provider-in-asp-net-core/)
| 53.5 | 155 | 0.775701 | eng_Latn | 0.840422 |
805dd08731338cc093bec9719d654fd493822308 | 304 | md | Markdown | content/runner/exec/configuration/reference/drone-platform-variant.md | phil-davis/docs | f3db0b46c949586e50a6323051d33362fb4518de | [
"BlueOak-1.0.0"
] | 151 | 2015-01-30T23:32:00.000Z | 2022-02-20T20:23:46.000Z | content/runner/exec/configuration/reference/drone-platform-variant.md | phil-davis/docs | f3db0b46c949586e50a6323051d33362fb4518de | [
"BlueOak-1.0.0"
] | 339 | 2015-01-04T05:21:48.000Z | 2022-03-26T07:08:04.000Z | content/runner/exec/configuration/reference/drone-platform-variant.md | phil-davis/docs | f3db0b46c949586e50a6323051d33362fb4518de | [
"BlueOak-1.0.0"
] | 386 | 2015-01-04T05:08:19.000Z | 2022-03-29T19:05:10.000Z | ---
date: 2000-01-01T00:00:00+00:00
title: DRONE_PLATFORM_VARIANT
author: bradrydzewski
weight: 1
---
Optional string value. Configures the host operating system variant. The default values is empty. This may be used with arm to differentiate between v7, v8 and so on.
```
DRONE_PLATFORM_VARIANT=v7
``` | 25.333333 | 166 | 0.769737 | eng_Latn | 0.946674 |
805e85f5497518a0bf74becc3cf3a2293c88d2f8 | 5,869 | md | Markdown | README.md | la2000/MemeCryptor | e95b11d1c7254938ccbe99b881a49a0649bf03ca | [
"MIT"
] | null | null | null | README.md | la2000/MemeCryptor | e95b11d1c7254938ccbe99b881a49a0649bf03ca | [
"MIT"
] | null | null | null | README.md | la2000/MemeCryptor | e95b11d1c7254938ccbe99b881a49a0649bf03ca | [
"MIT"
] | 2 | 2021-10-30T12:38:21.000Z | 2022-01-10T21:54:48.000Z | # MemeCryptor Ransomware
### Full scale ransomware that encrypts and embedded files in memes using Steganography
## 1. Motivation
Sometime ago, I came across this old tweet from [Michael Gillespie](https://twitter.com/demonslay335/status/1029749466176335872/photo/1) talking about badly-coded ransomware in the wild.
This holds true to these days where I still come across way too many lame ransomware with mediocre encryption scheme and design pattern.
Just for fun, I decided to see if I could write a sophisticated ransomware using the techniques I have learned from analyzing samples from big families such as **Ryuk** and **Conti**.
For me, the best way to understand malware is to program them out myself. I hope by providing the source code, I can give other analysts out there a better understanding of ransomware as well as the different techniques that they use.
Also, most ransomware encryptions out there are relatively lame, so I decided to embed the encrypted files in memes just to spice things up.
## 2. Features
### Persistence
**MemeCryptor** immediately creates a copy of itself in the **Temp** directory under a random name, and it will add this path to *SOFTWARE\Microsoft\Windows\CurrentVersion\Run* to obtain persistence.
### Run-once Mutex
**MemeCryptor** will attempt to decrypt the string *"wbizecif48njqgpprzkm6769"* and use that as the name of a Mutex object.
It checks if there is an instant of that Mutex running already. If there is, it will just wait until that thread exits before exiting.
### Hidden strings
For all strings that are used, I just implemented a simple xor encryption/decryption scheme and dynamically resolve each of them so they won't be detected by PE analysis tools.
``` cpp
// buffer = string to decrypt
// key is a random 5-byte buffer
// size is the size of the string
void resolveString(BYTE* buffer, BYTE* key, int size) {
for (int i = 0; i < size; i++) {
buffer[i] ^= 0xFF;
buffer[i] ^= key[i % 5];
}
}
```
### Hidden API (PE.cpp)
To hide API, **MemeCryptor** dynamically locates *Kernel32.dll*, goes through the EAT, and finds **GetProcAddress** and **GetModuleHandle**.
Then, it will resolve every API needed and store their addresses inside an array.
This API array is then shared with other files to indirectly make needed API calls.
As a result, the **Import** section of the PE is completely empty beside the APIs needed by Visual Studio.
### Encryption (Crypto.cpp)
Inspired by **Conti** ransomware, I decided to implement a multi-threading encryption scheme utitilizing 100% the victim's CPU by spawning as much threads as I can depending on the machine processor.
The child threads share one single linked-list structure in a queue form, and they continuously pop the head of the queue, retrieve a directory to encrypt, and encrypt it. When encountering a sub directory in the directory they are processing, they will add it to the back of the queue. The encryption stops when the queue is empty.
**MemeCryptor** stores a xor-encrypted **RSA** public key inside its source code. Each thread will decrypt this when they are spawned before using it to encrypt a randomly generated **ChaCha20** key.
Each **ChaCha20** key is used to encrypt a single file. The encrypted file will be appended at the end of this meme in **BMP** format.
The **ChaCha20** key is then written into the meme file using this **Steganography** trick I found [here](https://www.codeproject.com/Articles/5524/Hiding-a-text-file-in-a-bmp-file).
Using this encryption scheme, **MemeCryptor** can encrypt small files up to 100MB in under 1 second. For all files that are bigger than 100MB, the encryption is limited to 1.5 seconds exactly. As a result, it can crawl through the entire system in less than a minute.
### Windows Restart Manager (File.cpp)
By abusing the Windows Restart Manager, **MemeCryptor** can obtain a list of processes that are using files on the system.
With that information, it can force shutdown all of the processes that can prevent a file from being opened to be decrypted.
This was inspired by the implementations from **Conti** and **RegretLocker** Ransomware.
## 3. Disclaimer
This repo and its contents are only for educational purposes.
This executables being released are intended to be used solely by reverse engineers, analysts, and others who know how to handle malware.
The ransomware should only be ran in a VM environment. I accidentally ran it on my PC and encrypted around 200 GB of files before realizing, so please use it carefully.
Even though I have provided a decryptor, I can not 100% guarantee whether some file might be corrupted and unretrievable after encryption or not.
With that said, I am not to be held responsible by anyone to any lost or damaged property as a result of using this ransomware.
## 4. Acknowledgement
[Michael Gillespie](https://twitter.com/demonslay335?lang=en) - for helping me learn a lot of these techniques and improve my analysis on ransomware samples
[Jiří Vinopal](https://twitter.com/vinopaljiri) - https://github.com/Dump-GUY/Malware-analysis-and-Reverse-engineering/blob/main/kpot2/KPOT.md
[0xastro](https://twitter.com/0xastr0) - https://github.com/0xastro/malwareanalysis/blob/main/Ryuk/Deep%20Dive%20Into%20Ryuk%20Ransomware.md
[VMWare Carbon Black TAU](https://www.carbonblack.com/threat-analysis-unit/) - https://www.carbonblack.com/blog/tau-threat-discovery-conti-ransomware/
[Myself ;)](http://chuongdong.com/) - http://chuongdong.com/reverse%20engineering/2020/12/15/ContiRansomware/
[AhmedOsamaMoh](https://www.codeproject.com/script/Membership/View.aspx?mid=193049) - https://www.codeproject.com/Articles/5524/Hiding-a-text-file-in-a-bmp-file
| 47.715447 | 332 | 0.768785 | eng_Latn | 0.994339 |
805edcbab69a3211033673d5a9b31d5bf933f00b | 438 | md | Markdown | pages/common/hive.md | irfanirshad/tldr | ae1241967d9e66f292e669ae1f96c034da06d2f6 | [
"CC-BY-4.0"
] | 38,585 | 2015-01-03T03:23:18.000Z | 2022-03-31T17:46:27.000Z | pages/common/hive.md | irfanirshad/tldr | ae1241967d9e66f292e669ae1f96c034da06d2f6 | [
"CC-BY-4.0"
] | 5,517 | 2015-01-05T08:36:28.000Z | 2022-03-31T19:03:46.000Z | pages/common/hive.md | irfanirshad/tldr | ae1241967d9e66f292e669ae1f96c034da06d2f6 | [
"CC-BY-4.0"
] | 4,407 | 2015-01-12T15:29:39.000Z | 2022-03-31T08:37:33.000Z | # hive
> CLI tool for Apache Hive.
> More information: <https://cwiki.apache.org/confluence/display/Hive/LanguageManual+Cli>.
- Start a Hive interactive shell:
`hive`
- Run HiveQL:
`hive -e "{{hiveql_query}}"`
- Run a HiveQL file with a variable substitution:
`hive --define {{key}}={{value}} -f {{path/to/file.sql}}`
- Run a HiveQL with HiveConfig (e.g. `mapred.reduce.tasks=32`):
`hive --hiveconf {{conf_name}}={{conf_value}}`
| 20.857143 | 90 | 0.682648 | yue_Hant | 0.715906 |
805f8513a1e9eb037d3d40f73bdd032de7fc3ce3 | 1,502 | md | Markdown | _publications/2021-08-20-crossvul.md | Dritsa-Konstantina/Dritsa-Konstantina.github.io | 66f57f2500b63526a47720b2252bba6bea36ab47 | [
"MIT"
] | null | null | null | _publications/2021-08-20-crossvul.md | Dritsa-Konstantina/Dritsa-Konstantina.github.io | 66f57f2500b63526a47720b2252bba6bea36ab47 | [
"MIT"
] | null | null | null | _publications/2021-08-20-crossvul.md | Dritsa-Konstantina/Dritsa-Konstantina.github.io | 66f57f2500b63526a47720b2252bba6bea36ab47 | [
"MIT"
] | null | null | null | ---
title: "CrossVul: a cross-language vulnerability dataset with commit data"
collection: publications
permalink: /publication/2021-08-20-crossvul
excerpt:
date: 2021-08-20
venue: 'Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)'
paperurl: 'https://dl.acm.org/doi/10.1145/3468264.3473122'
---
[Download paper](https://dritsa-konstantina.github.io/files/NDLM21.pdf)
**Authors:** Georgios Nikitopoulos, <b>Konstantina Dritsa</b>, Panos Louridas, and Dimitris Mitropoulos
## Abstract
Examining the characteristics of software vulnerabilities and the code that contains them can lead to the development of more secure software. We present a dataset (∼1.4 GB) containing vulnerable source code files together with the corresponding, patched versions. Contrary to other existing vulnerability datasets, ours includes vulnerable files written in more than 40 programming languages. Each file is associated to (1) a Common Vulnerability Exposures identifier (CVE ID) and (2) the repository it came from. Further, our dataset can be the basis for machine learning applications that identify defects, as we show in specific examples. We also present a supporting dataset that contains commit messages derived from Git commits that serve as security patches. This dataset can be used to train ML models that in turn, can be used to detect security patch commits as we highlight in a specific use case.
| 88.352941 | 909 | 0.804927 | eng_Latn | 0.993122 |
80601867c1c39c12b74740ba125c57e46cbad585 | 9 | md | Markdown | README.md | AnshumaanDash/NN | 27a24b4042b3871e23dcedb33a039fc54a23345a | [
"MIT"
] | null | null | null | README.md | AnshumaanDash/NN | 27a24b4042b3871e23dcedb33a039fc54a23345a | [
"MIT"
] | null | null | null | README.md | AnshumaanDash/NN | 27a24b4042b3871e23dcedb33a039fc54a23345a | [
"MIT"
] | null | null | null | # NN
KNN
| 3 | 4 | 0.555556 | deu_Latn | 0.649707 |
8060e273c29fd5a6cdbe80dec42eda7abbf6fa76 | 21 | md | Markdown | README.md | Bader-eng/bitmap-transformer- | 1ed3847f59b408e81ba55b44f49e76dba2bba5bd | [
"MIT"
] | null | null | null | README.md | Bader-eng/bitmap-transformer- | 1ed3847f59b408e81ba55b44f49e76dba2bba5bd | [
"MIT"
] | null | null | null | README.md | Bader-eng/bitmap-transformer- | 1ed3847f59b408e81ba55b44f49e76dba2bba5bd | [
"MIT"
] | null | null | null | # bitmap-transformer- | 21 | 21 | 0.809524 | eng_Latn | 0.436327 |
80611a83ad7ca19c4edf75024b7b0249bd150051 | 1,263 | md | Markdown | README.md | logaritmdev/redux-provider | 5bfc93f499c775162ea84f2081009cd50077177a | [
"MIT"
] | null | null | null | README.md | logaritmdev/redux-provider | 5bfc93f499c775162ea84f2081009cd50077177a | [
"MIT"
] | null | null | null | README.md | logaritmdev/redux-provider | 5bfc93f499c775162ea84f2081009cd50077177a | [
"MIT"
] | null | null | null | # Redux Provider
Redux provider is a middleware that abstract (mostly) async operations in its own layer. An action that is registered as a provider will be invoked first and the original action will be executed only when the provider dispatches the same action.
## Setup
### Create a provider file
```javascript
import {createProviders} from 'redux-provider'
var providers = {
FETCH_DATA: function(action, dispatch) {
var data = action.data
dispatch({
type: 'FETCH_DATA_REQUEST',
data: data
})
request('GET', '/data').then(response => {
// Dispatch the action with the data
dispatch({
type: 'FETCH_DATA',
data: response
})
dispatch({
type: 'FETCH_DATA_SUCCESS',
data: data
})
}).catch(err => dispatch({
type: 'FETCH_DATA_FAILURE',
data: data
}))
}
}
export default createProviders(providers)
```
### Registers the middleware and providers
```javascript
import {createStore, combineReducers, applyMiddleware} from 'redux'
import {providerMiddleware} from 'redux-provider'
import provider1 from './provider1'
import provider2 from './provider2'
const store = createStore(
combineReducers(/* reducers */),
applyMiddleware(
providerMiddleware([provider1, provider2])
)
)
## Licence
MIT
``` | 20.704918 | 245 | 0.709422 | eng_Latn | 0.951783 |
806128146f67db4f9bd10e691b138149c6c52bef | 153 | md | Markdown | README.md | duely/UndergroundVillages | ec3ede4a3d673d3ac1a5b6691d1a463b3a4c9b2f | [
"MIT"
] | null | null | null | README.md | duely/UndergroundVillages | ec3ede4a3d673d3ac1a5b6691d1a463b3a4c9b2f | [
"MIT"
] | null | null | null | README.md | duely/UndergroundVillages | ec3ede4a3d673d3ac1a5b6691d1a463b3a4c9b2f | [
"MIT"
] | null | null | null | Underground Villages:
- Will only spawn within the range specified with the air gap specified.
- Does not currently modify doors for villager breeding.
| 30.6 | 72 | 0.803922 | eng_Latn | 0.999883 |
8061473f1c9fe1fedd667eaaaf6533798674ed7e | 34 | md | Markdown | Day-53/README.md | klisostom/My-100DaysOfCode | 912f303f0708f3b4066c885aceaede66296683b5 | [
"MIT"
] | null | null | null | Day-53/README.md | klisostom/My-100DaysOfCode | 912f303f0708f3b4066c885aceaede66296683b5 | [
"MIT"
] | 22 | 2020-09-06T23:57:14.000Z | 2022-02-26T17:11:30.000Z | Day-53/README.md | klisostom/My-100DaysOfCode | 912f303f0708f3b4066c885aceaede66296683b5 | [
"MIT"
] | null | null | null | ### Studying nmap on linux distro
| 17 | 33 | 0.735294 | kor_Hang | 0.278288 |
80615a334914cbe8b75505338ddc2cffad9ef6ed | 1,600 | md | Markdown | sdk/docs/IndexConvention.md | fossabot/lusid-sdk-java-preview | a1bc1b3c5a3e7c0aa0d54796c45740e031e3bd4b | [
"MIT"
] | null | null | null | sdk/docs/IndexConvention.md | fossabot/lusid-sdk-java-preview | a1bc1b3c5a3e7c0aa0d54796c45740e031e3bd4b | [
"MIT"
] | 1 | 2020-10-29T09:28:40.000Z | 2020-10-29T09:28:40.000Z | sdk/docs/IndexConvention.md | fossabot/lusid-sdk-java-preview | a1bc1b3c5a3e7c0aa0d54796c45740e031e3bd4b | [
"MIT"
] | 1 | 2020-10-29T09:18:06.000Z | 2020-10-29T09:18:06.000Z |
# IndexConvention
## Properties
Name | Type | Description | Notes
------------ | ------------- | ------------- | -------------
**fixingReference** | **String** | The reference rate name for fixings |
**publicationDayLag** | **Integer** | Number of days between spot and publication of the rate. |
**paymentTenor** | **String** | The tenor of the payment. For an OIS index this is always 1 day. For other indices, e.g. LIBOR it will have a variable tenor typically between 1 day and 1 year. |
**dayCountConvention** | [**DayCountConventionEnum**](#DayCountConventionEnum) | The available values are: Actual360, Act360, MoneyMarket, Actual365, Act365, Thirty360, ThirtyU360, Bond, ThirtyE360, EuroBond, ActAct, ActualActual, ActActIsda, ActActIsma, ActActIcma, Invalid |
**currency** | **String** | Currency of the index convention. |
**scope** | **String** | The scope used when updating or inserting the convention. | [optional]
**code** | **String** | The code of the convention. | [optional]
## Enum: DayCountConventionEnum
Name | Value
---- | -----
ACTUAL360 | "Actual360"
ACT360 | "Act360"
MONEYMARKET | "MoneyMarket"
ACTUAL365 | "Actual365"
ACT365 | "Act365"
THIRTY360 | "Thirty360"
THIRTYU360 | "ThirtyU360"
BOND | "Bond"
THIRTYE360 | "ThirtyE360"
EUROBOND | "EuroBond"
ACTACT | "ActAct"
ACTUALACTUAL | "ActualActual"
ACTACTISDA | "ActActIsda"
ACTACTISMA | "ActActIsma"
ACTACTICMA | "ActActIcma"
INVALID | "Invalid"
| 38.095238 | 277 | 0.698125 | yue_Hant | 0.354326 |
8062ed242d45e86acbb65e9c2e70925f6ceffad5 | 560 | md | Markdown | content/D5600_002052.md | SpaceFox/coree.spacefox.fr | 43324b5e42ac363392648588c931c6781c46c4f6 | [
"MIT"
] | 1 | 2020-02-04T22:56:34.000Z | 2020-02-04T22:56:34.000Z | content/D5600_002052.md | SpaceFox/coree.spacefox.fr | 43324b5e42ac363392648588c931c6781c46c4f6 | [
"MIT"
] | null | null | null | content/D5600_002052.md | SpaceFox/coree.spacefox.fr | 43324b5e42ac363392648588c931c6781c46c4f6 | [
"MIT"
] | null | null | null | ---
title: "Séoul, par-delà les murs"
date: "2019-10-19T15:13:57+08:00"
img: D5600_002052
speed: 1/250 s
iso: 100
aperture: 11.0
focal: 18.0
picInstant: 2019-10-19T15:13:57+08:00
widthFull: 5793
heightFull: 3862
fileSizeFull: 5,44 Mio
width2k: 1920
height2k: 1280
fileSize2k: 538,57 kio
width3k: 3000
height3k: 2000
fileSize3k: 1,82 Mio
width4k: 3840
height4k: 2560
fileSize4k: 2,77 Mio
widthRaw: 6016
heightRaw: 4016
fileSizeRaw: 23,86 Mio
ratio:
- standard
lieux:
- changdeokgung
picdates:
- 2019-10-19
themes:
- palais
- architecture
- ville
- moderne
---
| 14.736842 | 37 | 0.742857 | eng_Latn | 0.209078 |
8063534cdbcd2f29f7b1fb92e260cf6d2ecc2a36 | 100 | md | Markdown | app/contents/biomarkers/fr-FR/health-points.md | gionatamettifogo/biomarkers | 15723cfcfa1338bea24d155122b38d31ff53d8cb | [
"MIT"
] | null | null | null | app/contents/biomarkers/fr-FR/health-points.md | gionatamettifogo/biomarkers | 15723cfcfa1338bea24d155122b38d31ff53d8cb | [
"MIT"
] | 21 | 2022-03-02T09:03:43.000Z | 2022-03-26T03:36:07.000Z | app/contents/biomarkers/fr-FR/health-points.md | gionatamettifogo/biomarkers | 15723cfcfa1338bea24d155122b38d31ff53d8cb | [
"MIT"
] | 1 | 2022-03-01T11:11:41.000Z | 2022-03-01T11:11:41.000Z | ---
translation: automatic
title: Points de santé totaux
description: Échelle de 0 à 100 points
---
| 16.666667 | 38 | 0.75 | fra_Latn | 0.694785 |
8064aa8330378c819b41f2065ef19508ecc35829 | 5,083 | md | Markdown | Capstone-Assessment-Austin.md | Howarat/Senior-Design-Project | 5de7c8e994ff33ca31f1d9467ea3b0e453b302af | [
"MIT"
] | null | null | null | Capstone-Assessment-Austin.md | Howarat/Senior-Design-Project | 5de7c8e994ff33ca31f1d9467ea3b0e453b302af | [
"MIT"
] | null | null | null | Capstone-Assessment-Austin.md | Howarat/Senior-Design-Project | 5de7c8e994ff33ca31f1d9467ea3b0e453b302af | [
"MIT"
] | 1 | 2021-09-12T21:28:38.000Z | 2021-09-12T21:28:38.000Z | # Austin Howard-Clark: Individual Capstone Assessment
## Introduction
In choosing a topic for our senior-design project, I hoped to find something that would interest me at all times of the day. I wanted to apply things I have learned from my experiences in life; from my first day in college to the hardest exams I have taken, from my first 5 nervous minutes of working in an office setting to all my co-workers knowing my name. After countless hours pondering topics and ideas, a project idea was created. With **Combined Mining**, my time spent at UC and through co-op at Honeywell Intelligrated would be joined. This project will test all areas of my education as I construct, program, and tinker away in creating something truly useful to anyone involved with blockchain technology or mining cryptocurrencies. The project will be a web application that displays an overview of crypto mining statistics from several mining pools. This will be especially useful for any miners who have machines working in different mining fields, or to anyone who is interested in the long-term patterns that will be visible from the data.
## College Curriculum
Throughout the design and construction of "Combined Mining", the college curriculum will be visible in my understanding of the technology I am working with. Knowledge gained from taking **EECE 3093C Software Engineering** will be fundamental as I devise a strategy for the grand design of the project. All documentation will be completed with the help of material covered in **ENGL 3071 Technical Writing**, which provided a basis for creating instructions and diagrams. Once the project is mapped out and planned. What I learned from **2040C Fundamentals of Web Development** is going to help dramatically with the implementation of the webapp, both frontend and backend. During my presentation **COMM 1071 Introduction to Effective Speaking**'s presence in the curriculum will help convey the information clear and professionally. Combined the education obtained from the curriculum will allow me to tackle the issue of design and quickly move on to prototyping and implementation.
## Co-op Experiences
My time spent working for **Honeywell Intelligrated** over the past 4 years will prove invaluable in the development of my senior-design project. I was able to work on a wide variety of projects while at Honeywell and learned a lot about Linux, Shell Scripting, Web Development, and Customer Service. By working closely with customers as they called in for help to troubleshoot issues, I now have a better understanding of what a new user would experience when seeing the webapp for the first time. This will prove helpful in the construction of User Stories and Design Diagrams. The information I learned about Linux and Shell Scripting will be the core of the knowledge I am using while configuring the web server and necessary scripts for the project. Having setup a web server for my department at Honeywell, I will utilize this learned skill to ensure the web app is functional. All together the skills acquired while on coop will play a huge role in the success of this project.
## Motivation
Designing and constructing a web interface to provide an overview of my crypto mining hobby has always been a project on my bucket list. With that in mind I am very motivated to bring it to life, as it will be used personally every day and provide a very valuable interface for any miner. Creating an application with practical uses appeals to me much more than a research project with no immediate uses. I am also looking forward to increasing my knowledge of blockchain technology while working on this project. I believe that this will assist me later in life as we continually see blockchain technology applications being created. I do not know of any other mining overview web apps, and believe this project has a lot of value as well. This will help keep my motivation high throughout the duration of its design and creation.
## Preliminary Project Approach
To start, data will need to be collected from mining pools through their APIs. This data will need to be stored for analysis (short & long term), meaning a database will need to be constructed. We will need to identify all important information that crypto miners/blockchain analyst will need to construct this database. Once a prototype of the backend is created, we will construct reports from this data. The database will also need to be updated periodically to provide the most accurate and reliable data, so automated backend scripts will need to be made to ensure this. The result will be a web application which miners or data analyst can use to view short and long terms trends related to their data. This will include things such as profitability, block difficulty, hash rate, and comparisons between mining pools. Additionally features such as control of miners could be implemented. I will consider the project a success if there is a clean, bug free web interface to view data from multiple mining pools collectively.
| 211.791667 | 1,057 | 0.806414 | eng_Latn | 0.999877 |
8065fc87711221c4d409963845e25e9c965cd201 | 5,452 | md | Markdown | doc/commands.md | Z-snails/idris2-lsp | 3a949818ef0180baabc5a88f3533c3154f49c3ce | [
"BSD-3-Clause"
] | null | null | null | doc/commands.md | Z-snails/idris2-lsp | 3a949818ef0180baabc5a88f3533c3154f49c3ce | [
"BSD-3-Clause"
] | null | null | null | doc/commands.md | Z-snails/idris2-lsp | 3a949818ef0180baabc5a88f3533c3154f49c3ce | [
"BSD-3-Clause"
] | null | null | null | # Supported Commands
The following sections will be organized in the same manner as the LSP
specification, with the same syntax. For each command we will provide the
structure of the params and both valid and error responses.
## Repl Request
The repl request is sent from the client to the server to run the provided
argument as if it was in a REPL session. The result is a string containing the
REPL response.
This is useful when clients want to evaluate expressions or invoke
REPL-specific commands. Note that this command is __not stateless__ and further
invokation may be influenced by previous results, furthermore saving files in
the workspace causes the context to be reset.
_Request_:
- method: 'workspace/executeCommand'
- params: `ReplParams` defined as follows:
```typescript
export interface ReplParams {
/**
* The identifier of the actual command handler.
*/
command: 'repl';
/**
* Arguments to be passed to the REPL, currently only one argument is supported.
*/
arguments: string[];
}
```
_Response_:
- result: `string`
- error: code and message set in case an exception happens during the request.
## Metavars Request
The metavars request is sent from the client to the server to return the list
of metavariables found in the workspace. Each result is annotated with its
location in the workspace.
_Request_:
- method: 'workspace/executeCommand'
- params: `MetavarsParams` defined as follows:
```typescript
export interface MetavarsParams {
/**
* The identifier of the actual command handler.
*/
command: 'metavars';
/**
* No arguments required.
*/
arguments?: null;
}
```
_Response_:
- result: `Metavar[]` defined as below.
- error: code and message set in case an exception happens during the request.
```typescript
export interface Premise {
/**
* The location of this premise.
*/
location: Location | null;
/**
* The name of this premise.
*/
name: string;
/**
* The type of this premise.
*/
type: string;
/**
* A flag which indicates whether the premise is an implicit argument.
*/
isImplicit: boolean;
}
export interface Metavar {
/**
* The location of this metavariable.
*/
location: Location | null;
/**
* Name of this metavariable.
*/
name: string;
/**
* The type of this metavariable.
*/
type: string;
/**
* The list of premises of this metavariable.
*/
premises: Premise[];
}
```
## ExprSearchWithHints Request
The expression search with hints request is sent from the client to the server
to compute an expression search with a custom list of hints. These requests are
handled by the same library that handles the expression search code action
potentially sent by the server in response to a `textDocument/codeAction`
request on a metavariable, thus the response is in the same format. Even with
hints the list of `CodeAction` as response could be the same as without hints.
_Request_:
- method: 'workspace/executeCommand'
- params: `ExprSearchParams` defined as follows:
```typescript
export interface ExprSearchParams {
/**
* The identifier of the actual command handler.
*/
command: 'exprSearchWithHints';
/**
* Context and list of hints. Currently supports a single object.
*/
arguments: ExprSearchHints[];
}
export interface ExprSearchHints {
/**
* Location and context of this search.
*/
codeAction: CodeActionParams;
/**
* List of names to be hinted for this search.
*/
hints: string[];
}
```
_Response_:
- result: `CodeAction[] | null`.
- error: code and message set in case an exception happens during the request.
## RefineHoleWithHints Request
The refine hole with hints request is sent from the client to the server
to compute a refine hole with a custom list of hints. These requests are
handled by the same library that handles the refine hole code action
potentially sent by the server in response to a `textDocument/codeAction`
request on a metavariable, thus the response is in the same format.
Response edits in the `CodeAction`s must contain the hinted names.
_Request_:
- method: 'workspace/executeCommand'
- params: `RefineHoleParams` defined as follows:
```typescript
export interface RefineHoleParams {
/**
* The identifier of the actual command handler.
*/
command: 'refineHoleWithHints';
/**
* Context and list of hints. Currently supports a single object.
*/
arguments: RefineHoleHints[];
}
export interface RefineHoleHints {
/**
* Location and context of this search.
*/
codeAction: CodeActionParams;
/**
* List of names to be hinted for this search.
*/
hints: string[];
}
```
_Response_:
- result: `CodeAction[] | null`.
- error: code and message set in case an exception happens during the request.
## BrowseNamespace Request
The browseNamespace request is sent from the client to the server to return the list
of visible names found in a given namespace.
_Request_:
- method: 'workspace/executeCommand'
- params: `BrowseNamespaceParams` defined as follows:
```typescript
export interface BrowseNamespaceParams {
/**
* The identifier of the actual command handler.
*/
command: 'browseNamespace';
/**
* List of namespaces. Currently supports a single object.
*/
arguments: string[];
}
```
_Response_:
- result: `SymbolInformation[]`.
- error: code and message set in case an exception happens during the request.
| 26.338164 | 84 | 0.720653 | eng_Latn | 0.993489 |
806622f0c5f66711d12d1834f55d5e6dd31d30cf | 27 | md | Markdown | README.md | njohn1970/bvb | acdc7c816ea7861d8a20f5513204e6b1d99cfb06 | [
"MIT"
] | null | null | null | README.md | njohn1970/bvb | acdc7c816ea7861d8a20f5513204e6b1d99cfb06 | [
"MIT"
] | null | null | null | README.md | njohn1970/bvb | acdc7c816ea7861d8a20f5513204e6b1d99cfb06 | [
"MIT"
] | null | null | null | # bvb
** Bunnies V Badgers
| 9 | 20 | 0.666667 | eng_Latn | 0.907415 |
806650f0f6da25ea71511aa12d83729e29867aae | 2,110 | md | Markdown | README.md | mrityunjaygr8/vue-world-map | c7ce412080f5bf30ee059682f4a80f90ff78777c | [
"MIT"
] | 4 | 2019-11-01T21:31:33.000Z | 2020-11-17T22:02:11.000Z | README.md | mrityunjaygr8/vue-world-map | c7ce412080f5bf30ee059682f4a80f90ff78777c | [
"MIT"
] | null | null | null | README.md | mrityunjaygr8/vue-world-map | c7ce412080f5bf30ee059682f4a80f90ff78777c | [
"MIT"
] | 1 | 2020-11-17T22:11:43.000Z | 2020-11-17T22:11:43.000Z | # Vue World Map
A Vue JS Component for displaying dynamic data on a world map. Forked from [Ghrehh's vue-world-map](https://github.com/Ghrehh/vue-world-map)
Map from [amCharts](https://www.amcharts.com/svg-maps/?map=world)
## Installation
Install via npm using `npm install vue-world-map-ms`
## Usage
This component is most useful in creating a heat map for various countries. And
will color countries differently based on a props passed.
The component requires a prop of `countryData` to be passed to it, which is a JS
object formatted like so.
``` javascript
{
US: 100,
CA: 120,
UK: 400,
}
```
Where the key is a country's
[ISO 3166 Code](https://en.wikipedia.org/wiki/ISO_3166) and the value is a
numerical value associated with it.
## API
| Props | Description | Optional |
| --- | --- | --- |
| countryData | See Usage Section above for details | no |
| lowColor | Countries with lower values will be colored more strongly with this color | yes |
| highColor | Countries with higher values will be colored more strongly with this color | yes |
| defaultCountryFillColor | Countries with no data will default to this color | yes |
| countryStrokeColor | The color of the border around countries | yes |
| showColorBar | Boolean. Deciedes whether to show a color bar displaying the low and the high colors, or not. Defaults to true | yes |
## Hover Events
The component emits the event `mouseenter` when the mouse enters a country's border, with the country's node as the payload.
Similarly the component also emits the `mouseleave` event when the mouse leaves the country's border.
Together, these two events can be used for hover actions, or displaying additional data on hover.
Use then in your component as:
``` javascript
<vueWorldMap :countryData="stats.group_by_country" @mouseleave="on_mouseleave" @mouseenter="on_mouseenter" />
```
where `on_mouseenter` and `on_mouseleave` are defined among the methods of your component.
Both `on_mouseenter` and `on_mouseleave` return the `country's ISO 3166 Code`, using which the value can be found from the countryData property
| 38.363636 | 143 | 0.750237 | eng_Latn | 0.993474 |
806652b43fc31df62545c9d03c635567a277ba01 | 116 | md | Markdown | responses/09_e_revert_master.md | ntaranov/continuous-integration-team-scenarios-course | 197da30e960b379f38765e5c858a28da8a64bd0c | [
"CC-BY-4.0"
] | 1 | 2022-01-29T08:14:00.000Z | 2022-01-29T08:14:00.000Z | responses/09_e_revert_master.md | ntaranov/continuous-integration-team-scenarios-course | 197da30e960b379f38765e5c858a28da8a64bd0c | [
"CC-BY-4.0"
] | 10 | 2020-07-26T04:48:05.000Z | 2021-03-16T15:57:11.000Z | responses/09_e_revert_master.md | ntaranov/continuous-integration-team-scenarios-course | 197da30e960b379f38765e5c858a28da8a64bd0c | [
"CC-BY-4.0"
] | null | null | null | ### Wrong branch pushed
You need to revert merging branch `{{ firstBranchName }}` into `master` as described above. | 38.666667 | 91 | 0.741379 | eng_Latn | 0.998657 |
806687884705c744bdd770900dbc4677a7cf2a83 | 395 | md | Markdown | merge_sort/mergeSort.md | taddes/AlgoChallenge | 7e3d5e0cb087f63c09e6dd97ffef566a8ae26850 | [
"MIT"
] | null | null | null | merge_sort/mergeSort.md | taddes/AlgoChallenge | 7e3d5e0cb087f63c09e6dd97ffef566a8ae26850 | [
"MIT"
] | null | null | null | merge_sort/mergeSort.md | taddes/AlgoChallenge | 7e3d5e0cb087f63c09e6dd97ffef566a8ae26850 | [
"MIT"
] | null | null | null | ## Merge Sort
Split into two sorted arrays of values
Create 'results' array.
While there are still elements in both arrays:
If the first element the left half is less than the right half:
shift the element form left into a result array
else
shift the element from right into a result array
Take everything from the array that still has stuff in it and put in the results. | 43.888889 | 81 | 0.746835 | eng_Latn | 0.999914 |
806bbcfaa927625bc773e197581ba61760e89e0a | 151 | md | Markdown | mm.md | pengtum/pengtum.github.io | d4158ef012b1470da8174951212fb49a180998de | [
"MIT"
] | null | null | null | mm.md | pengtum/pengtum.github.io | d4158ef012b1470da8174951212fb49a180998de | [
"MIT"
] | null | null | null | mm.md | pengtum/pengtum.github.io | d4158ef012b1470da8174951212fb49a180998de | [
"MIT"
] | null | null | null | [Spring-data-jpa 查询 复杂查询陆续完善中](http://www.cnblogs.com/sxdcgaq8080/p/7894828.html)
[Open source data in Europe](https://www.europeandataportal.eu/en)
| 37.75 | 82 | 0.768212 | yue_Hant | 0.390955 |
806bcb245ece469dbe308b65a15e84469b98e934 | 897 | md | Markdown | README.md | SeppeD/bootstrap_boilerplate | 83510b6e66de1d0d6365dba215fc4f5fc8dff344 | [
"MIT"
] | null | null | null | README.md | SeppeD/bootstrap_boilerplate | 83510b6e66de1d0d6365dba215fc4f5fc8dff344 | [
"MIT"
] | null | null | null | README.md | SeppeD/bootstrap_boilerplate | 83510b6e66de1d0d6365dba215fc4f5fc8dff344 | [
"MIT"
] | null | null | null | # Bootstrap Boilerplate
This bootstrap boilerplate uses gulp and sass to create a starter template for future projects.
## Getting Started
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes.
### Installing
How to get the development environment up and running.
1. Create a directory for the new project
2. Clone the repository to your local directory and remove the .git folder when starting a new project
```
git clone --depth 1 https://github.com/SeppeD/bootstrap_boilerplate.git .
rm -rf .git
```
3. Install node modules
```
npm install
```
### Running
Using gulp you can start a server and use livereload to see changes immediately.
```
gulp
```
## Built With
* [Coursetro](https://coursetro.com/posts/code/130/Learn-Bootstrap-4-Final-in-2018-with-our-Free-Crash-Course) - Learn Bootstrap 4 Final in 2018
| 25.628571 | 144 | 0.761427 | eng_Latn | 0.981837 |
806c42bf4399975a66c0853d4de05277bd224697 | 682 | md | Markdown | README.md | taouniverse/tao-gin | 76cbebb9e14e058b5ad8e52b450fc778598bca11 | [
"Apache-2.0"
] | null | null | null | README.md | taouniverse/tao-gin | 76cbebb9e14e058b5ad8e52b450fc778598bca11 | [
"Apache-2.0"
] | null | null | null | README.md | taouniverse/tao-gin | 76cbebb9e14e058b5ad8e52b450fc778598bca11 | [
"Apache-2.0"
] | null | null | null | # tao-gin
[](https://goreportcard.com/report/github.com/taouniverse/tao-gin)
[](https://pkg.go.dev/github.com/taouniverse/tao-gin?tab=doc)
```
_______ _____ _
|__ __| / ____(_)
| | __ _ ___ | | __ _ _ __
| |/ _` |/ _ \ | | |_ | | '_ \
| | (_| | (_) | | |__| | | | | |
|_|\__,_|\___/ \_____|_|_| |_|
```
Config your gin server!
| 40.117647 | 147 | 0.568915 | yue_Hant | 0.589573 |
806d0eaf2c6ad72c96544a59fcabc1aa7bdf43ef | 5,516 | md | Markdown | _posts/2018-09-30-Download-business-environment-and-policy.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | 2 | 2019-02-28T03:47:33.000Z | 2020-04-06T07:49:53.000Z | _posts/2018-09-30-Download-business-environment-and-policy.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | _posts/2018-09-30-Download-business-environment-and-policy.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Business environment and policy book
' "You don't get the heebie-jeebies," Max said. that the law required. forehead broke bloodlessly apart He would rub and rub fur-flier still till the brown hide skinned back business environment and policy, false man, so he Nothing in life was risk free, a nobody pretending to be a He gaped in amazement at Maddoc's motor home, perform. She spotted his bright red suit and pointed at him. But she came, too, and a Hawaiian shirt. The poker only brushed my forearm "Colorado. "Destroy us. Business environment and policy the apex of the dome a spiral bag of cheese popcorn washed down with Orange Crush. (259) So he repented, tilted above dark cross-sections of the hull, but he had no time to waste hi words. 382). She wanted to know what sign I was born under? Colman said nothing, please do Franz-Josef Land. All I fear is knuckles, after which he made the ablution of defilement (261) and washed his clothes, risking cars and trucks and rhinoceroses, on the other handвI've got one pretty name followed by a clinker like Klonk, past tall cabinets with open shelves full of stacked dishes, accumulated through more than nine Convinced he was alone and unobserved. Stay close. I fix this? They must be real. Even in storytime, the skin on its beDy growing wrinkled and flaccid, but the low quality of the other iron on the block suggested Ignatiev, but he read business environment and policy again. If you can really read my heart this "Baby, largely because the face that nature had given him was a splendid disguise for the sentimental sweetie who lived behind it, according to the вCambridge University Science Fiction Society Banunculus pygmaeus WG. asked no more. slight business environment and policy. Having found the grisly souvenirs, the first right out of me with that blue-light thing of theirs. Whatever one gave them, I A second collection cluttered the room: scores upon scores of both plain and marksman as he was a corrupt scumball, but to sit still while the bow of the boat slid under the e, and I'm surprised you accompanied us back to our boat. in a long, there was no path? Then their long days in the silence of the woods and their long, he would tell her how her brother business environment and policy. Raising her snout, "but promise you won't. through pills, a fugitive must never could there, when I started to. "I've lost weight, making shopping lists, from browsing through a stranger's diary. gained only by respecting her, Dr, you've got a place to go? No complete skeleton however has been Docents Dr. " "Scarily good. Too cowardly for hand-to-hand combat, you tree-humping nitwit," Rudy advised Junior. I had completely business environment and policy about it? And When he realizes that he's the only occupant of the restroom, "though I taught him all he knows of harping. he himself is a total Forrest Gump, Nono," Noah ran for his life. It was Crow who had, who spent her life comforting Arabs, she morphed in her daydreams from physician business environment and policy accomplished readers. their wake. to the even crueler games of Las Vegas. "You feel you can trust me?" She lowered her eyes and tried to look wicked and temptress-like, we had to switch on the 151 How many a lover. The one over the patch didn't go up as high as the other. maybe there's rich blood in your veins, business environment and policy an otter slipped into it and was gone. Whatever one gave them, his posture had become more upright and at ease, it dangled, ii. there!" the girl instructed. ' And the other said, in love of her I'll live! It's- oh, I am wasted on meth and some stuff. wasn't involved; this anger had a cleansing purity. Several streams, telling natives came rowing in a large skin boat to the vessel, the precessional cycle. 345 thinks Business environment and policy is going to be all right. " Quoth the prefect, and she runs part of a fusion business environment and policy Griskin, and restriction of access to it had been one of its primary design criteria, and couldn't have been scarier if it had been a massive python or a full-grown with our guns. Business environment and policy sail struck the water, following a morning of relative sobriety, something I'll do better if I'm blind, no doubt. His only daughter and her Crawford was the only one to look up when the lock started cycling. Sir Hugh Willoughby, Colman's eyes widened for a moment as he listened. expectantly! snub. "Uh. (Conclusion) Micky crazily thought of killer bees, ii. " And he recited these verses: of health was also very good for the circumstances of the time. Here comes the second reason, the distinctive clock glowed. Nellie Oatis, except you business environment and policy touch everything, and they added the gold to the gold and the silk to the silk and sat talking and laughing at one another, justifiable cause. injection prior to the business environment and policy of her birthday would violate Preston's code of She remembered reading that California had halted freeway construction for 47' N. Maybe it's me, at once sophistic photographs it looked like pink milk with purple palisades. was a grotesque but misunderstood creature being pursued through a stormy suicidal. 9 -1. They looked fresh and pretty in loose blouses worn over snug-fitting slacks, reaching a phone before morning wasn't possible because "I do," he protested, confirming her intuition? | 612.888889 | 5,411 | 0.787527 | eng_Latn | 0.9999 |
806d9cb0de6ae2d912bb0f3b0d5cbea4e27941a0 | 2,349 | md | Markdown | README.md | fluidecho/lull | 3e601b3e4927ec61b9ddeb763eee66c068b9c155 | [
"Apache-2.0",
"MIT"
] | 1 | 2018-03-18T20:24:38.000Z | 2018-03-18T20:24:38.000Z | README.md | fluidecho/lull | 3e601b3e4927ec61b9ddeb763eee66c068b9c155 | [
"Apache-2.0",
"MIT"
] | null | null | null | README.md | fluidecho/lull | 3e601b3e4927ec61b9ddeb763eee66c068b9c155 | [
"Apache-2.0",
"MIT"
] | null | null | null | # Lull
Simple RESTful Web Service, written for node.js.
## Installation
From your terminal, requires [node.js](http://nodejs.org/).
```
npm install lull
```
## Example web service
For more, see _examples_ folder.
```js
var lull = require('lull');
//
// Example API:-
// ------------------------------------------------------------------------------------------
// | Function | Method | path[0] | path[1] | Request | Comment |
// ------------------------------------------------------------------------------------------
// | helloWorld | GET | hello | world | /hello/world/ | Both paths literal. |
// ------------------------------------------------------------------------------------------
// path: can be literal: 'hello' or placeholder: '', can set many path items.
// api map:
var api = [
{
name: 'helloWorld',
method: 'GET',
path: ['hello', 'world']
}
];
var options = {
host: '127.0.0.1',
port: 5555,
secure: false, // true = https, else http. if true set: key, cert and apikey.
key: '',
cert: '',
apikey: '',
api: api // array mapping requests to js functions.
};
lull.createService(options, function(req, rep) {
switch ( req.api.name ) {
// example request GET: http://127.0.0.1:5555/hello/world/
case 'helloWorld':
console.log('helloWorld function called ->'); // req.api = {name, method, path[], properties{}}.
rep.end(JSON.stringify({req.api.path[0]:req.api.path[1]}); // returns: {"hello":"world"}
break;
};
});
console.log('lull web service running at: ' + options.host + ':' + options.port);
```
## Example client
```js
var lull = require('lull');
// make a client request to the lull web service.
console.log('request');
var options = {
hostname: '127.0.0.1',
port: 5555,
path: '/foo/bar/?hello=world',
method: 'POST',
headers: {
'Content-Type': 'application/json; charset=utf-8', // json formatted data.
}
};
var req = lull.request(options, function(message) {
console.log('message received: ' + require('util').inspect(message, true, 99, true));
});
req.write('{"foo":"bar","x":982750}'); // sending json formatted data.
req.end();
```
## License
Choose either: [MIT](http://opensource.org/licenses/MIT) or [Apache 2.0](http://www.apache.org/licenses/LICENSE-2.0).
| 27 | 117 | 0.532567 | eng_Latn | 0.391721 |
806df8ce825978e5388c1fd379d2ab3538b3ae3f | 5,570 | md | Markdown | _posts/2020-07-27-VMworld-2020.md | cwestwater/cwestwater.github.io | cf7acea11cd0fb827683ee1f50c0aed1194b5150 | [
"MIT"
] | 2 | 2017-07-16T13:33:23.000Z | 2018-02-10T07:06:20.000Z | _posts/2020-07-27-VMworld-2020.md | cwestwater/cwestwater.github.io | cf7acea11cd0fb827683ee1f50c0aed1194b5150 | [
"MIT"
] | 9 | 2017-07-21T19:03:50.000Z | 2021-09-28T19:17:54.000Z | _posts/2020-07-27-VMworld-2020.md | cwestwater/cwestwater.github.io | cf7acea11cd0fb827683ee1f50c0aed1194b5150 | [
"MIT"
] | 3 | 2020-10-27T08:23:45.000Z | 2021-06-16T06:20:14.000Z | ---
layout: single
title: "VMworld 2020"
date: 2020-07-27
category: [VMware]
excerpt: "No in person VMworld 2020 - it's online and available for everyone"
---
## Introduction
VMworld US and Europe is a highlight in the VMware community calendar. However with the current COVID-19 situation the in person events have been cancelled.
However the two events have been combined into one virtual conference anyone can attend. This will run for 48 hours, from 29th September until the 1st October 2020. I will cover how to attend, cost of attendance, the tracks, and other general information.
### How to Attend
In person VMworld is usually an expensive proposition. The pass itself is pricey then add on travel and accommodation it's tough to pay for unless your company pick up the tab. Now it's online you have two options:
1. General Pass - Free!
2. Premier Pass - \$299
Yes free! The General pass includes:
- 7 VMworld tracks
- 700+ on demand sessions
- Solutions Exchange
- Hands-on labs
What does the Premier Pass get you for \$299?
- All of the above in the General Pass
- Limited capacity sessions
- Informal round table discussions
- Hands-on Labs guided by VMware experts
- 1:1 Consultations with VMware Engineers
- \$100 off VMworld 2021 registration
- 50% off a VCP certification exam
See [here for full details](https://www.vmworld.com/en/pricing.html). The Premier Pass looks pretty tempting but places are limited, so be quick if you want to take advantage of it.
### The Content
The main content of VMworld are the breakout sessions. The [content catalog](https://my.vmworld.com/widget/vmware/vmworld2020/catalog?) has been published and the session builder goes live on 1st September. Usually there is a scramble when Session Builder goes live for the in person events as spaces are limited but as this is virtual there is no pressure. Anyone can attend any session. Also note these sessions will be available during these two days, and then after to view like sessions usually are.
The content is broken down into various learning tracks:
- [Emerging Trends](https://www.vmworld.com/en/learning/Emerging-Trends.html)
- [App Modernization](https://www.vmworld.com/en/learning/App-Modernization.html)
- [Multi-Cloud](https://www.vmworld.com/en/learning/Multi-Cloud.html)
- [Intrinsic Security](https://www.vmworld.com/en/learning/Intrinsic-Security.html)
- [Virtual Cloud Network](https://www.vmworld.com/en/learning/Virtual-Cloud-Network.html)
- [Digital Workspace](https://www.vmworld.com/en/learning/Digital-Workspace.html)
As of the publication of this post there are 771 sessions in the catalog. I am sure there is content there that would be useful for everyone.
Browsing through the catalog, I can see plenty of sessions I am immediately interested in viewing. These include:
- HCP1833 - What's New with Fusion and Workstation
- HCP2877 and HCP2878 - Birds of a Feather: Raspberry Pi 4 & ESXi
- HCP1246 - What's New with DRS and vMotion in vSphere 7
- KUB2162 - vSphere with Tanzu 1010 for the vSphere Admin
- HCP1937 - Simplifying vSphere Lifecycle for Consistency and Easy Updates
- MAP2419 - Introduction to Infrastructure as Code
- ETPD2166 - Be a Brand and Not an Employee
Now if there is one session **everyone** needs to watch it is ETPD2087 - Achieving Happiness: Building Your Brand and Your Career by [Amanda Blevins](https://twitter.com/AmandaBlev). I saw this session while I was at VMworld 2018 and it was the highlight of the week. The synopsis of the session is:
> This session is for everyone. It begins with sharing how to identify happiness for yourself. Then, it moves into aligning career and brand to support your life goals. This session ends with concrete examples of what leadership is, how to be a leader and personal growth in this area. You will leave this session with an increased understanding of shaping your thoughts and behaviour to optimize the opportunities for personal and career happiness.
I was so energised after this session and gave me a lot to think about. I was not the only person that thought this. I have heard multiple people saying it was the best session they have seen at a VMworld. Make sure you watch this.
### Keeping Up to Date on VMworld 2020
As VMworld 2020 draws closer expect to see more details and content coming from VMware on what is coming this year. I think as all conferences are going online companies have a real desire to differentiate the experience from just putting videos out on the internet. The best thing about any conference is meeting peers and speaking to the experts. With the Premier Pass they have covered meeting the experts, but for interacting with other attendees I am keen to see what VMware come up with. On the [VMworld website](https://www.vmworld.com/en/about-2020.html) they state:
> Engage and Interact: Connect with colleagues and meet new friends online, while exploring fresh ideas and insights from thousands of fellow attendees from around the world.
It will be interesting to see what VMware come up with to realize this.
There is a [VMworld blog](https://blogs.vmware.com/vmworld) which is publishing new posts pretty frequently. If you use Twitter follow the [VMware Events](https://twitter.com/VMwareEvents) account as this will be tweeting with updates.
### Wrap Up
I am personally looking forward to VMworld 2020. I would not have been able to attend in person so appreciate I can attend virtually, especially for no cost. Go and [register](https://reg.rainfocus.com/flow/vmware/vmworld2020/reg/form/contactInfo) today.
| 65.529412 | 574 | 0.78474 | eng_Latn | 0.996574 |
806e58df01abb4419d578acfb2e92cee118a09e6 | 253 | md | Markdown | bliki.md | rads/content.rad.blog | 48d3691dda6c88e718de7839f8099a5b4d7ce6ca | [
"CC-BY-4.0"
] | null | null | null | bliki.md | rads/content.rad.blog | 48d3691dda6c88e718de7839f8099a5b4d7ce6ca | [
"CC-BY-4.0"
] | null | null | null | bliki.md | rads/content.rad.blog | 48d3691dda6c88e718de7839f8099a5b4d7ce6ca | [
"CC-BY-4.0"
] | null | null | null | ---
title: Bliki
---
This site is a *bliki*, not a blog. I copied this idea from
[Martin Fowler][fowler]:
> I find writing too hard to want to spend it on things that disappear.
Me too.
[fowler]: https://www.martinfowler.com/bliki/WhatIsaBliki.html
| 19.461538 | 71 | 0.715415 | eng_Latn | 0.974276 |
806e7cf3f3a2afb3bf6cddb5a9b277e325fc2ed1 | 5,194 | md | Markdown | docs/README.md | yedhrab/Designer-Differ | 7fc118cab10745cb8ccf51c56884ade41666057b | [
"Apache-2.0"
] | null | null | null | docs/README.md | yedhrab/Designer-Differ | 7fc118cab10745cb8ccf51c56884ade41666057b | [
"Apache-2.0"
] | null | null | null | docs/README.md | yedhrab/Designer-Differ | 7fc118cab10745cb8ccf51c56884ade41666057b | [
"Apache-2.0"
] | null | null | null | # 🔍 Designer Differ
Visual Studio Designer tarafından üretilen kodlardaki karmaşıklığı azaltıp, git ile düzgün bir versiyon kıyaslaması sağlayan eklenti
| | |
|-|-|
|👨💻 Yapımcı | 🤵 Yunus Emre AK ~ [YEmreAk.com](https://yemreak.com)|
|✨ Son Güncelleme| 📅 10.09.2020 |
## 🎯 Eklentinin Amaçları
| 💎 Özellik | 🎯 Amaç |
| - | - |
| 🎨 Designer Dosyalarını Kıyaslama | Windows Form Designer tarafından otomatik olarak oluşturulan kodların konumlarındaki tutarsız değişiklikler, git üzerinde sanki yeni bir satır eklenmiş veya silinmiş gibi gösterilmektedir. Bu işlem de değişiklikleri algılamada sorun oluşturmaktadır. Sorunun çözümüne odaklı bir özelliktir |
| 📂 Resx Dosyalarını Kıyaslama | Windows Resx Designer tarafından otomatik olarak oluşturulan kodların konumlarındaki tutarsız değişiklikler, git üzerinde sanki yeni bir satır eklenmiş veya silinmiş gibi gösterilmektedir. Bu işlem de değişiklikleri algılamada sorun oluşturmaktadır. Sorunun çözümüne odaklı bir özelliktir |
| 🚄 Designer Üretilen Kodu Sıralama | Windows Form Designer tarafından otomatik olarak oluşturulan kodların konumlarındaki tutarsız değişiklikler, git üzerinde sanki yeni bir satır eklenmiş veya silinmiş gibi gösterilmektedir. Bu işlem de değişiklikleri algılamada sorun oluşturmaktadır. Sorunun çözümüne odaklı bir özelliktir |
| 📃 Herhangi İki Dosyayı Kıyaslama | Herhangi bir iki dosya arasındaki farklılıkları kolayca tespit etmeyi sağlayan bir özelliktir |
## 🤹 Eklentinin Çalışma Algoritması
- 📦 Eklenti özelliklerinin çalışabilmesi için [Git](https://git-scm.com/downloads) kurulumu olmalıdır
- ➕ Seçili dosyanın yolunu alır ve kaynak kodlarına erişmek için geçici olarak projeye dahil eder
- 🚧 Projeye dahil edilen kodda sıralama işlemleri gerçekleştirilir ve dosya kaydedilir
- 🚚 Güncellenen dosya işletim sistemi tarafından otomatik olarak temizlenen `%TEMP%` dizinine `~` ön ekleri ile kopyalanır
- 💦 Projeye dahil edilen dosya projeden çıkarılır ve silinir
- 🔍 `%TEMP%` dizinine kaydedilen dosyalar Visual Studio Diff Tool ile git kullanarak kıyaslanır
<div class="page"/>
## 🎨 Designer Dosyalarını Kıyaslama
- 📃 Herhangi bir `*.Designer.cs` dosyasına sağ tıklayın
- 📋 Açılan menüde `Compare designer file with history...` butonunu seçin
- 🔀 Açılan diyalog ekranında `HEAD` olarak yazan, kıyaslanma yapılacak branch ismini temsil eder
- 🆔 `CommitHash` kısmı için gerekli açıklamalar form üzerinde verilmiştir
- 📝 Kıyaslama yapmak istediğiniz sürüm için 3. alanı doldurun
- ✔️ <kbd>↩ Enter</kbd> butonuna veya `Compare` butonuna basarak kıyaslamayı başlatın
- ❌ <kbd>⎋ Esc</kbd> veya `Cancel` butonuna basarak kıyaslamayı iptal edebilirsiniz
> 📢 Kıyaslama işleminde dosyanın güncel hali ile istenen eski sürümü işletim sistemi tarafından otomatik olarak temizlenen `%TEMP%` dizinine sırasıyla `~` `~~` ön ekleriyle kopyalanır, gösterilen dosyalardaki değişiklikler asıl dosyayı etkilemez
<div class="page"/>
- 📹 Kıyaslama sonrasında oluşacak çıktı aşağıdaki gibidir
<div class="page"/>
## 📂 Resx Dosyalarını Kıyaslama
- 📃 Herhangi bir `*.resx` dosyasına sağ tıklayın
- 📋 Açılan menüde `Compare designer file with history...` butonunu seçin
- 🔀 Açılan diyalog ekranında `HEAD` olarak yazan, kıyaslanma yapılacak branch ismini temsil eder
- 🆔 `CommitHash` kısmı için gerekli açıklamalar form üzerinde verilmiştir
- 📝 Kıyaslama yapmak istediğiniz sürüm için 3. alanı doldurun
- ✔️ <kbd>↩ Enter</kbd> butonuna veya `Compare` butonuna basarak kıyaslamayı başlatın
- ❌ <kbd>⎋ Esc</kbd> veya `Cancel` butonuna basarak kıyaslamayı iptal edebilirsiniz
> 📢 Kıyaslama işleminde dosyanın güncel hali ile istenen eski sürümü işletim sistemi tarafından otomatik olarak temizlenen `%TEMP%` dizinine sırasıyla `~` `~~` ön ekleriyle kopyalanır, gösterilen dosyalardaki değişiklikler asıl dosyayı etkilemez
<div class="page"/>
- 📹 Kıyaslama sonrasında oluşacak çıktı aşağıdaki gibidir
<div class="page"/>
## 🚄 Designer Üretilen Kodu Sıralama
- 📃 Herhangi bir `*.Designer.cs` dosyasını açın ve açılan pencere içerisine sağ tıklayın
- 📋 Açılan menüde `Sort Windows Form Designer Generated Code` butonunu seçin
> 📢 Sıralama sırasında verileri koruma amacıyla sıralanmış kodları dosyaya kaydetmez, dilerseniz <kbd>✲ Ctrl</kbd> <kbd>S</kbd> kısayolu ile kaydedebilirsiniz.
- 📹 Kıyaslama sonrasında oluşacak çıktı aşağıdaki gibidir
<div class="page"/>
## 📃 Herhangi İki Dosyayı Kıyaslama
- 📃 Herhangi bir dosyaya sağ tıklayın
- 📋 Açılan menüde `Compare with file...` butonunu seçin
> 📢 İsterseniz 2 dosyayı birden seçip sağ tıklayarak, ikisi arasındaki farkları görebilirsiniz
- 🗃️ Eğer iki dosya seçmediyseniz, dosya gezgini üzerinden, istediğiniz bir dosyayı seçin
<div class="page"/>
- 📹 Kıyaslama sonrasında oluşacak çıktı aşağıdaki gibidir
| 45.964602 | 328 | 0.780131 | tur_Latn | 0.999966 |
8071e0863e6289729d387fcb48199f06023909a0 | 16,875 | md | Markdown | EDK-II-Code-Formatting.md | makubacki/tianocore.github.io | e4c6d566607b6f04303d0dd633f56e0786126354 | [
"BSD-2-Clause"
] | null | null | null | EDK-II-Code-Formatting.md | makubacki/tianocore.github.io | e4c6d566607b6f04303d0dd633f56e0786126354 | [
"BSD-2-Clause"
] | null | null | null | EDK-II-Code-Formatting.md | makubacki/tianocore.github.io | e4c6d566607b6f04303d0dd633f56e0786126354 | [
"BSD-2-Clause"
] | null | null | null | # EDK II Code Formatting
To better realize the goals of the [EDK II C Coding Standards Specification](https://edk2-docs.gitbook.io/edk-ii-c-coding-standards-specification/),
EDK II code formatting is automated using a source code beautifier called Uncrustify. Uncrustify is compatible with
C/C++ in addition to other languages. In EDK II, it is used to format C language source code.
## Uncrustify in the edk2 Repository
The Uncrustify collateral in the edk2 repository contains all of the resources needed to get the Uncrustify application
and run it with the same settings as other developers.
> Uncrustify is automatically run against code submitted in edk2 as a continuous integration (CI) plugin called
"UncrustifyCheck". The plugin is available in the following directory:
[.pytool/Plugin/UncrustifyCheck](https://github.com/tianocore/edk2/tree/master/.pytool/Plugin/UncrustifyCheck)
The UncrustifyCheck plugin in edk2 contains the following files used to check code for compliance to the coding
standard:
* **default_file_header.txt** - A text file containing a template that is placed at the top of files missing a file
header.
* **default_function_header.txt** - A text file containing a template that is placed above functions that are missing
a function header.
* [**Readme.md**](https://github.com/tianocore/edk2/blob/master/.pytool/Plugin/UncrustifyCheck/Readme.md) - A file that contains details about how the plugin works and how to use it.
* **uncrustify_ext_dep.yml** - An "external dependency" file that is used to get the current version of the Uncrustify
application used by the plugin. This file contains the NuGet feed URL and the version currently used.
* **uncrustify_plug_in.yaml** - A file that contains information to describe the plugin to the build environment.
* [**uncrustify.cfg**](https://github.com/tianocore/edk2/blob/master/.pytool/Plugin/UncrustifyCheck/uncrustify.cfg) - A file used by the Uncrustify application to control how it formats code. If you want to tweak
particular formatting details, this is the place to start.
* **UncrustifyCheck.py** - The actual Python file that is the CI plugin. Like all CI plugins, this plugin can be run
in local CI and server CI.
## EDK II Uncrustify Fork
Due to nuances in the way EDK II formats code, some changes were made to the upstream Uncrustify application. These
were changes that could not be controlled purely through the Uncrustify configuration file. For more details about the fork,
please visit that project overview in the link below.
* Uncrustify upstream repository: https://github.com/uncrustify/uncrustify
* Uncrustify EDK II fork repository (in Project Mu): https://dev.azure.com/projectmu/Uncrustify
## Developer Workflow
Developers must install Uncrustify and run the application against their code before sending patch review emails or
submitting pull requests. Pull requests run against EDK II CI which includes the UncrustifyCheck CI plugin.
Fortunately, Uncrustify can be installed quickly, you can format your code quickly locally, and you can verify the
code against the UncrustifyCheck CI plugin before sending it to others.
The recommended flow is:
1. Clone the edk2 source code repository
2. Use the `stuart*` commands to pull the Uncrustify application into the edk2 workspace
3. Set up the ability to run Uncrustify locally (for example, using the Visual Studio Code Uncrustify plugin)
4. Make and test code changes
5. Format code locally using Uncrustify (for example, using the Visual Studio Code Uncrustify plugin)
6. Run EDK II CI locally to verify UncrustifyCheck passes
7. Send the code patch to the EDK II mailing list
## Installing Uncrustify
Uncrustify is a portable executable that is built in the [EDK II Uncrustify fork repository](https://dev.azure.com/projectmu/Uncrustify)
and ultimately published into a NuGet feed in that fork project.
### Recommended Installation: In edk2 repository
It is strongly recommended to follow this flow. It sets up the workspace to work with local CI and automatically gets
the current supported version of the application.
The Uncrustify tool is installed automatically when the pytools environment is used and the `stuart*` commands are run
to complete environment setup. Review the edk2 [.pytool/Readme.md](https://github.com/tianocore/edk2/tree/master/.pytool#running-ci-locally)
file for details on `stuart` and this overall flow.
After running the `stuart_update` command, the Uncrustify application content should be brought down into
`.pytool\Plugin\UncrustifyCheck\mu-uncrustify-release_extdep` in your edk2 workspace. The contents of this directory
now represent the contents of the NuGet package and it should contain a Linux and Windows executable of the
application.
### Manual Installation: Download from the fork project
The [release pipeline](https://dev.azure.com/projectmu/Uncrustify/_build?definitionId=89) in the EDK II Uncrustify fork
project contains the build information for each release. Each build in this pipeline represents a release. By going to
a specific build, the details mapping the build to source code (such as the branch and commit) are present.
The build content is published as a NuGet package to a NuGet feed. This is the same feed, the recommended installation
instructions automatically pull from. The NuGet feed is available in the ["Artifacts"](https://dev.azure.com/projectmu/Uncrustify/_packaging?_a=feed&feed=mu_uncrustify)
section of the fork project. If you hover/click on a specific package entry (e.g. "mu-uncrustify-release"), a set of
three ellipsis will appear. Click the ellipsis and a context menu will appear. The NuGet package can be downloaded
by clicking "Download \<x.y.z\>".
Once downloaded, the `.nupkg` file can be treated as a zip file. If the file is opened as a zip file, the executable
can be found in the `mu-uncrustify-<debug/release>` directory.
## How to Run Uncrustify
Once Uncrustify is installed, you can run the application in a number of ways. In all cases, you should be using the
Uncrustify application built from the [Uncrustify EDK II fork](https://dev.azure.com/projectmu/Uncrustify) and the
[Uncrustify configuration file](https://github.com/tianocore/edk2/blob/master/.pytool/Plugin/UncrustifyCheck/uncrustify.cfg)
currently checked into edk2.
### Recommended Usage: Visual Studio (VS) Code Plugin
The Visual Studio Code plugin provides a way to seamlessly run Uncrustify against code at anytime in the editor and
the configuration details are set once in the editor configuration file.
1. Install the Uncrustify VS Code extension:
> Name: Uncrustify
Id: zachflower.uncrustify
Description: Code format using uncrustify
Publisher: Zachary Flower
VS Marketplace Link: <https://marketplace.visualstudio.com/items?itemName=zachflower.uncrustify>
2. Configure the Uncrustify plugin for your local setup by adding the following to your VS Code settings.json file:
(Windows example)
```json
"uncrustify.configPath.windows": "path_to_your_config_file",
"uncrustify.executablePath.windows": "path_to_your_uncrustify_executable"
```
> Windows Example:
>
>```json
>"uncrustify.configPath.windows": "D:/src/edk2/.pytool/Plugin/UncrustifyCheck/uncrustify.cfg",
>"uncrustify.executablePath.windows": "D:/src/edk2/.pytool/Plugin/UncrustifyCheck/mu-uncrustify-release_extdep/Windows-x86/uncrustify.exe"
>```
3. Open a C source code file, _`Ctrl+Shift+P` -> Format Document With... -> Configure Default Formatter -> Uncrustify_
4. Then, _`Ctrl+Shift+P` -> Format Document_ any time you would like to format your source code file with Uncrustify
### Manual Usage: Run in a Terminal
These instructions are written for Windows 10. These activities could be further automated into a high-level script
but that has not been done yet.
#### Manual Usage - Generate File List
Uncrustify must be given a list of files to run against. This can be done by redirecting the list to stdin or by
providing a text file. Examples of how perform both approaches are given below.
##### Manual Usage - Generate File List via stdin
This is the recommended way to manually run Uncrustify. It is works across Linux and Windows and reduces the number of
overall steps.
Example to run against all .c and .h files in `DynamicTablesPkg` executed from the root of the edk2 workspace.
Linux:
```shell
git ls-files DynamicTablesPkg*.c DynamicTablesPkg*.h | ./.pytool/Plugin/UncrustifyCheck/mu-uncrustify-release_extdep/Linux-x86/uncrustify -c ./.pytool/Plugin/UncrustifyCheck/uncrustify.cfg -F - --replace --no-backup --if-changed
```
Windows:
```shell
git ls-files DynamicTablesPkg*.c DynamicTablesPkg*.h | .\.pytool\Plugin\UncrustifyCheck\mu-uncrustify-release_extdep\Windows-x86\uncrustify.exe -c .\.pytool\Plugin\UncrustifyCheck\uncrustify.cfg -F - --replace --no-backup --if-changed
```
* The `git ls-files` command is used to gather the list of .c and .h files in `DynamicTablesPkg`
* The output from `git ls-files` is redirected to `uncrustify`
* The following options are given to the Uncrustify application:
* `-c`: The path to the Uncrustify configuration file
* `-F`: Read the files one per line. `-` indicates the list should be read from stdin.
* `--replace`: Replace the source files in place (convenient to diff formatting with git)
* `--no-backup`: Replace files with no backup (again, useful to diff formatting with git)
* `--if-changed`: Only produce output if a change is detected.
##### Manual Usage - Generate File List via Text File
1. Generate a list of the files to run against. This example generates a recursive list of all .c and .h files.
* It is recommended to run this in cleanly cloned edk2 repo without submodules to prevent submodule files
(such as Brotli files in MdeModulePkg) from getting included in the file list (if you are running against all
files). Including all files will significantly increase the amount of time Uncrustify takes to run.
* Sample Powershell command to recursively write all .c and .h files in a given package to a text file (this can of course be done with other languages/commands):
```powershell
Get-ChildItem -Path .\MdePkg\* -Include *.c, *.h -Recurse -Force | %{$_.fullname} | Out-File
-FilePath .\MdePkgFiles.txt -Encoding utf8
```
> **WARNING** Powershell will put the UTF-8 BOM at the beginning of the output file. Uncrustify does not recognize the BOM
and it should be removed before passing the file as input to Uncrustify. If it is not removed, Uncrustify will
not read the first file path in the text file properly which will cause the file to not be formatted. **Keep this in mind regardless of the method used for generating the text file.**
2. Run Uncrustify using the generated text file as input
Example to run against all .c and .h files in `MdePkg` executed from the root of the edk2 workspace.
Windows:
```shell
.\.pytool\Plugin\UncrustifyCheck\mu-uncrustify-release_extdep\Windows-x86\uncrustify.exe -c .\.pytool\Plugin\UncrustifyCheck\uncrustify.cfg -F MdePkgFiles.txt --replace --no-backup --if-changed
```
* The following options are given to the Uncrustify application:
* `-c`: The path to the Uncrustify configuration file
* `-F`: Read the files one per line from the file `MdePkgFiles.txt`
* `--replace`: Replace the source files in place (convenient to diff formatting with git)
* `--no-backup`: Replace files with no backup (again, useful to diff formatting with git)
* `--if-changed`: Only produce output if a change is detected.
> *Note:* When testing a configuration change, it is sometimes useful to run Uncrustify against a particular file
and check the debug output to understand what rule was applied and why it was applied. The command shows an
example of how to run the configuration file `uncrustify.cfg` against the source file `VariableSmm.c` where the
file is forced to be treated as C, the debug output is written to `uncrustify_debug.txt` and the log severity level
is set to "all".
Windows:
```shell
.\.pytool\Plugin\UncrustifyCheck\mu-uncrustify-release_extdep\Windows-x86\uncrustify.exe -c .\.pytool\Plugin\UncrustifyCheck\uncrustify.cfg -f .\MdeModulePkg\Universal\Variable\RuntimeDxe\VariableSmm.c -o output.c -l C -p uncrustify_debug.txt -L A 2>verbose_debug.txt
```
Uncrustify will update the source files in-place (with the commands given). This allows you to diff the results with
git. From here, you can iteratively tweak the configuration file and check the results until you are satisfied with the
outcome.
## Uncrustify in CI
The UncrustifyCheck CI plugin that will verify formatting on the server can be run locally. It is recommended to run
local CI to verify the patch submission will pass CI on the server.
This can be done using the `stuart_ci_build` command.
> Tip: To quickly only run UncrustifyCheck, remove the other plugin directories from your local `.pytool` directory
and, of course, add them back when you're done.
Here's an example of running UncrustifyCheck against MdeModulePkg from the root of an edk2 workspace:
`stuart_ci_build -c .pytool/CISettings.py -p MdeModulePkg`
If a file has a formatting error, it will be noted in the output from `stuart_ci_build`. This is visible in the
terminal output in local CI and the build output log in server CI.
Read the [UncrustifyCheck Readme.md](https://github.com/tianocore/edk2/blob/master/.pytool/Plugin/UncrustifyCheck/Readme.md)
to understand more about how the plugin can be configured for CI.
## Extra Reading: Tracing History Across the Uncrustify Transition in edk
Note: Most users do not need to read this section.
It might be helpful to view the entire history rewritten with Uncrustify formatting on every commit. For example, an
alternate version of the edk2 repository that serves as "documentation" with the entire history re-written.
A tool called git-filter-repo can be used to perform this transformation and runs in a reasonable period of time
(a few hours):
* <https://github.com/newren/git-filter-repo>
* <https://github.com/newren/git-filter-repo/blob/main/contrib/filter-repo-demos/lint-history>
The following steps can be used to perform this transformation. This is the Windows process. A Linux process will be
added in the future.
> **WARNING** This operation modifies (rewrites) all the commits in the local copy of the repo. Do not perform
these steps on a local repo you are using for active development.
1. Clone edk2 into a new directory (see **WARNING**)
```shell
git clone https://github.com/tianocore/edk2.git edk2-uncrustified
cd edk2-uncrustified
```
2. Setup python virtual env, install pytools, and run stuart commands to setup build environment which includes
installing uncrustify tools. See [Running CI Locally](https://github.com/tianocore/edk2/tree/master/.pytool#running-ci-locally).
3. Make a backup copy of the plugin UncrustifyCheck outside WORKSPACE. (e.g. C:\Temp\UncrustifyCheck) so the
Uncrustify executable and EDK II specific Uncrustify configuration file are available when working with a branch
that does not have those tools in its scope.
```shell
xcopy .pytool\Plugin\UncrustifyCheck C:\Temp\UncrustifyCheck
```
4. Use lint-history.py from git-filter-repo examples
* [git-filter-repo](https://github.com/newren/git-filter-repo)
* [lint-history](https://github.com/newren/git-filter-repo/blob/main/contrib/filter-repo-demos/lint-history)
Line #127 - Add try except around subprocess.check_call() with except being pass. This is required because there are a
few commits of C files in the edk2 repo that have incorrect C syntax and do not build with a C compiler and break the
Uncrustify parser. Skip reformat of C files that can not be parsed by uncrustify. These rare instances are addressed in
the commit that fixes the C syntax error.
Run this slightly modified version of lint-history. Include only .c/.h files and exclude directories that start with
`Tools` or `BaseTools`. This step took about 2.2 hours on a laptop.
```shell
lint-history.py
--relevant "return (not filename.startswith(b'Tools') and not filename.startswith(b'BaseTools') and (filename.endswith(b'.c') or filename.endswith(b'.h')))"
c:\\work\\GitHub\\tianocore\\foo\\UncrustifyCheck\\mu-uncrustify-release_extdep\\Windows-x86\\uncrustify.exe -c c:\\work\\GitHub\\tianocore\\foo\\UncrustifyCheck\\uncrustify.cfg --replace --no-backup --if-changed
```
| 57.010135 | 271 | 0.759763 | eng_Latn | 0.990719 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.