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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5043470aa2f69e607d71304dbdce1b9e36312836 | 375 | md | Markdown | doc_center/docs/tools/gradle/README.md | colinzuo/statics_file_server | 66add7282d0117cfd2e503de6db117e1ad67247d | [
"Apache-2.0"
] | 1 | 2022-02-22T02:23:40.000Z | 2022-02-22T02:23:40.000Z | doc_center/docs/tools/gradle/README.md | colinzuo/statics_file_server | 66add7282d0117cfd2e503de6db117e1ad67247d | [
"Apache-2.0"
] | 9 | 2021-06-28T20:32:08.000Z | 2022-02-27T10:55:03.000Z | doc_center/docs/tools/gradle/README.md | colinzuo/dddtdd-docs | e15550468f84a5078519091eec9a37ce4be6e606 | [
"Apache-2.0"
] | null | null | null | ---
title: Gradle介绍
slug: /tools/gradle/
---
## 过滤测试
<https://docs.gradle.org/current/userguide/java_testing.html#simple_name_pattern>
```bash
# Executes all tests in SomeTestClass
gradle test --tests SomeTestClass
# Executes a single specified test in SomeTestClass
gradle test --tests SomeTestClass.someSpecificMethod
gradle test --tests SomeTestClass.*someMethod*
``` | 20.833333 | 81 | 0.776 | eng_Latn | 0.333735 |
5043f8eb6220aa5627535c6dc1a61f0e8e2a2686 | 6,890 | md | Markdown | articles/automation/automation-certificates.md | OpenLocalizationTestOrg/azure-docs-pr15_et-EE | bc69bd1a9d45d7abd2a3d01806d74e2b0848a808 | [
"CC-BY-3.0",
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/automation/automation-certificates.md | OpenLocalizationTestOrg/azure-docs-pr15_et-EE | bc69bd1a9d45d7abd2a3d01806d74e2b0848a808 | [
"CC-BY-3.0",
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/automation/automation-certificates.md | OpenLocalizationTestOrg/azure-docs-pr15_et-EE | bc69bd1a9d45d7abd2a3d01806d74e2b0848a808 | [
"CC-BY-3.0",
"CC-BY-4.0",
"MIT"
] | null | null | null | <properties
pageTitle="Serdi varasid Azure automatiseerimine | Microsoft Azure'i"
description="Sertide saab salvestada turvaliselt Azure automatiseerimine nii, et nad pääsevad juurde tegevusraamatud või DSC konfiguratsioone autentimiseks Azure ja kolmanda osapoole ressursid. Selles artiklis selgitatakse serdid ja kuidas nendega töötada nii teksti kui ka graafilise loome üksikasju."
services="automation"
documentationCenter=""
authors="mgoedtel"
manager="stevenka"
editor="tysonn" />
<tags
ms.service="automation"
ms.devlang="na"
ms.topic="article"
ms.tgt_pltfrm="na"
ms.workload="infrastructure-services"
ms.date="02/23/2016"
ms.author="magoedte;bwren" />
# <a name="certificate-assets-in-azure-automation"></a>Serdi varasid Azure automatiseerimine
Sertide saab salvestada turvaliselt Azure automatiseerimine nii, et nad pääsevad juurde tegevusraamatud või DSC konfiguratsioone **Get-AutomationCertificate** tegevuse abil. See võimaldab teil luua tegevusraamatud ja DSC konfiguratsioone kasutavate serdid autentimine või lisatakse Azure'i või muude tootjate ressursid.
>[AZURE.NOTE] Turvaline varasid Azure automatiseerimine kaasata mandaat, serdid, ühendused ja krüptitud muutujate. Varade krüptitud ning talletatud Azure'i automaatika kordumatu võti, mis luuakse iga automatiseerimise konto abil. See võti krüptitud juhtslaidi sertifikaadiga ja talletatud Azure automatiseerimine. Kui kavatsete turvaline vara, automatiseerimise konto võti on lahtikrüptitud juhtslaidi serdiga ja seejärel kasutatud vara krüptimiseks.
## <a name="windows-powershell-cmdlets"></a>Windows PowerShelli cmdlet-käsud
Järgmises tabelis cmdlet-käskude kasutatakse luua ja hallata serdi automatiseerimine varasid ning Windows PowerShelli abil. Need saata [Azure PowerShelli moodul](../powershell-install-configure.md) , mis on saadaval kasutamiseks automaatika tegevusraamatud ja DSC konfiguratsioone osana.
|Cmdlet-käsud|Kirjeldus|
|:---|:---|
|[Get-AzureAutomationCertificate](http://msdn.microsoft.com/library/dn913765.aspx)|Kuvatakse teave serdi kohta. Saate tuua ainult sertifikaati Get-AutomationCertificate tegevuse.|
|[Uue AzureAutomationCertificate](http://msdn.microsoft.com/library/dn913764.aspx)|Impordib uut serti Azure automatiseerimine.|
|[Eemalda – AzureAutomationCertificate](http://msdn.microsoft.com/library/dn913773.aspx)|Eemaldab serdi Azure automatiseerimine.|
|[Set - AzureAutomationCertificate](http://msdn.microsoft.com/library/dn913763.aspx)|Määrab atribuutide lüüsiarvutis olemasolev sert, sh serdi faili üleslaadimine ja säte on pfx parool.|
## <a name="activities-to-access-certificates"></a>Tegevuste juurde pääseda serdid
Järgmises tabelis tegevuste kasutatakse juurdepääsu serdid käitusjuhendi või DSC konfigureerimine.
|Tegevuste|Kirjeldus|
|:---|:---|
|Get-AutomationCertificate|Saab kasutada käitusjuhendi või DSC konfiguratsiooni sert.|
>[AZURE.NOTE] Peaks Vältige muutujat – nimi parameetris Get-AutomationCertificate, kuna see raskendada avastanud sõltuvuste tegevusraamatud või DSC konfiguratsioone ja serdi varasid koostamise ajal.
## <a name="creating-a-new-certificate"></a>Uue serdi loomine
Kui loote uue sert, mida CER- või pfx faili üleslaadimine Azure automatiseerimine. Kui märgite tunnistust eksporditav, siis saate edastada selle serdi automatiseerimine Azure'i poest välja. Kui see pole eksporditav, siis seda saab kasutada ainult allkirjastamiseks käitusjuhendi või DSC konfigureerimine.
### <a name="to-create-a-new-certificate-with-the-azure-classic-portal"></a>Azure'i klassikaline portaali luua uut serti
1. Klõpsake konto automatiseerimise **varasid** akna ülaosas.
1. Klõpsake akna allosas **Lisada säte**.
1. Klõpsake **Lisa identimisteavet**.
2. **Mandaadi tüüp** ripploendit, valige **sert**.
3. Tippige väljale **nimi** serdi nimi ja klõpsake paremnoolt.
4. Sirvige CER või pfx-faili. Kui valite pfx-fail, määrake parool ja kas see peaks olema lubatud eksportida.
1. Seejärel klõpsake märkeruutu serdi faili üles laadida ja salvestada uut serti vara.
### <a name="to-create-a-new-certificate-with-the-azure-portal"></a>Azure'i portaalis luua uut serti
1. Klõpsake automatiseerimise kontolt **varad** osa **varad** tera avamiseks.
1. Klõpsake nuppu **serdid** osa **serdid** tera avamiseks.
1. Klõpsake nuppu **Lisa serdi** tera ülaosas.
2. Tippige väljale **nimi** nimi serti.
2. Klõpsake jaotises **serdi faili üleslaadimine** CER- või pfx faili otsimiseks nuppu **Faili valimiseks** . Kui valite pfx-fail, määrake parool ja kas see peaks olema lubatud eksportida.
1. Klõpsake nuppu **Loo** uus sert vara salvestamiseks.
### <a name="to-create-a-new-certificate-with-windows-powershell"></a>Uue serdi loomine Windows PowerShelli abil
Valimi järgmised käsud näitab, kuidas luua uus serdi automatiseerimine ja see tähistab eksporditav. See impordib olemasoleva pfx-fail.
$certName = 'MyCertificate'
$certPath = '.\MyCert.pfx'
$certPwd = ConvertTo-SecureString -String 'P@$$w0rd' -AsPlainText -Force
New-AzureAutomationCertificate -AutomationAccountName "MyAutomationAccount" -Name $certName -Path $certPath –Password $certPwd -Exportable
## <a name="using-a-certificate"></a>Serdi abil
Kasutage **Get-AutomationCertificate** tegevuse kasutada sert. [Get-AzureAutomationCertificate](http://msdn.microsoft.com/library/dn913765.aspx) cmdlet-käsk ei saa kasutada, kuna annab teavet serdi varade, kuid mitte sert.
### <a name="textual-runbook-sample"></a>Teksti käitusjuhendi näidis
Järgmine proovi kood näitab, kuidas serdi lisamine rakenduses on käitusjuhendi pilveteenusesse. Selles näites tuuakse parool on krüptitud automatiseerimise muutujat.
$serviceName = 'MyCloudService'
$cert = Get-AutomationCertificate -Name 'MyCertificate'
$certPwd = Get-AutomationVariable –Name 'MyCertPassword'
Add-AzureCertificate -ServiceName $serviceName -CertToDeploy $cert
### <a name="graphical-runbook-sample"></a>Graafilised käitusjuhendi näidis
Saate lisada mõne **Get-AutomationCertificate** graafilise käitusjuhendi serdi teegi paanil pildiredaktor paremklõpsata ja valida käsu **Add lõuend**.
Järgmisel pildil on kujutatud serdiga graafiline käitusjuhendi. See on mõeldud serdi lisamine pilveteenus teksti käitusjuhendi sama näite.
Selles näites kasutatakse **UseConnectionObject** parameetri **Saada-TwilioSMS** tegevust, mis kasutab autentimiseks teenusega ühenduse objekti seadmine. [Müügivõimaluste link](automation-graphical-authoring-intro.md#links-and-workflow) tuleb kasutada siin Kuna lingi jada tagasi kogumik, mis sisaldab ühte objekti, mis on andmeühenduse parameeter ei oodanud.
## <a name="see-also"></a>Vt ka
- [Linkide graafiline koostamine](automation-graphical-authoring-intro.md#links-and-workflow)
| 63.211009 | 450 | 0.795646 | est_Latn | 0.999099 |
5045e79d941be9dce83a89fd386a40b1197004ec | 1,080 | md | Markdown | _services/society.md | BYUIDSconsulting/aboutus | 0173440b1ff3cba9cd88f06dbc64882cd031ea51 | [
"MIT"
] | null | null | null | _services/society.md | BYUIDSconsulting/aboutus | 0173440b1ff3cba9cd88f06dbc64882cd031ea51 | [
"MIT"
] | null | null | null | _services/society.md | BYUIDSconsulting/aboutus | 0173440b1ff3cba9cd88f06dbc64882cd031ea51 | [
"MIT"
] | null | null | null | ---
title: "Data Science Society"
date: 2018-11-18T12:33:46+10:00
featured: true
weight: 1
---
Our data science society is a student association that tackles business problems at little to no monetary cost. Student teams of 3-6 partner on your business-driven project to deliver your more minor data science needs.
## Details
- __Hours:__ The student teams put in 4-8 hours a week and meet on Wednesdays at 6 pm Mountain as project teams. The projects last 10-11 weeks.
- __Skill Level:__ Many of the students are in their second or third year of the program. They have experience with Python and R.
- __Project Examples:__ Clients have us build [Shiny](), [Streamlit](), or [PowerBI]() dashboards. We also tackle data automation requests (web scraping, API use, data munging).
## Expectations
Many of these projects are proof-of-concept projects. Upperclass data science students are project managers and technical experts. A faculty mentor oversees the student leadership team that supports the project managers.
 | 54 | 222 | 0.772222 | eng_Latn | 0.997062 |
504623880c8f01e45c5f86957f10dbc10c9e5837 | 364 | md | Markdown | articles/media-services/live-video-analytics-edge/includes/detect-motion-emit-events-quickstart/csharp/header.md | jayv-ops/azure-docs.de-de | 6be2304cfbe5fd0bf0d4ed0fbdf4a6a4d11ac6e0 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/media-services/live-video-analytics-edge/includes/detect-motion-emit-events-quickstart/csharp/header.md | jayv-ops/azure-docs.de-de | 6be2304cfbe5fd0bf0d4ed0fbdf4a6a4d11ac6e0 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/media-services/live-video-analytics-edge/includes/detect-motion-emit-events-quickstart/csharp/header.md | jayv-ops/azure-docs.de-de | 6be2304cfbe5fd0bf0d4ed0fbdf4a6a4d11ac6e0 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
ms.openlocfilehash: 393ab601ccf6110739705c46c50486027b59b304
ms.sourcegitcommit: eb6bef1274b9e6390c7a77ff69bf6a3b94e827fc
ms.translationtype: HT
ms.contentlocale: de-DE
ms.lasthandoff: 10/05/2020
ms.locfileid: "88690969"
---
Dieser Artikel baut auf in C# geschriebenem[ Beispielcode](https://github.com/Azure-Samples/live-video-analytics-iot-edge-csharp) auf.
| 36.4 | 134 | 0.824176 | deu_Latn | 0.279937 |
50477ec00efd2a3e1a9ca70ce7377fc8edfc667f | 325 | md | Markdown | Example/WJCoreDataAccess-example/Pods/WJUIRoutable/README.md | yunhaiwu/ios-wj-coredata-da | f1502b15498f76afef831757cad2fbab29a55692 | [
"MIT"
] | null | null | null | Example/WJCoreDataAccess-example/Pods/WJUIRoutable/README.md | yunhaiwu/ios-wj-coredata-da | f1502b15498f76afef831757cad2fbab29a55692 | [
"MIT"
] | null | null | null | Example/WJCoreDataAccess-example/Pods/WJUIRoutable/README.md | yunhaiwu/ios-wj-coredata-da | f1502b15498f76afef831757cad2fbab29a55692 | [
"MIT"
] | null | null | null | # WJUIRoutable
http 请求组件api
### CocoaPods 安装
```
'pod WJUIRoutable' or 'pod WJUIRoutable/API' 'pod WJUIRoutable/Core'
```
### 要求
* ARC支持
* iOS 6.0+
### 使用方法
* 在WJConfig配置中心：
```
//WJUIRoutable在配置中心名称
WJUIRoutable : {
defaultNavigationController:(String)默认导航控制器名称
routerURLformatter:(String)路由链接格式化器
}
```
| 11.607143 | 71 | 0.683077 | yue_Hant | 0.991841 |
5047cc5253b8ac61773ed6191e725e4b05453524 | 180 | md | Markdown | dockerfiles/rust/README.md | flash89y/dockerfiles | 7c16cca9aa1bc9b8b93a7542a55a0bb6e74991ac | [
"MIT"
] | 16 | 2020-05-28T04:15:47.000Z | 2021-04-14T16:09:17.000Z | dockerfiles/rust/README.md | flash89y/dockerfiles | 7c16cca9aa1bc9b8b93a7542a55a0bb6e74991ac | [
"MIT"
] | 66 | 2020-06-23T11:03:16.000Z | 2020-07-18T13:33:14.000Z | dockerfiles/rust/README.md | flash89y/dockerfiles | 7c16cca9aa1bc9b8b93a7542a55a0bb6e74991ac | [
"MIT"
] | 48 | 2020-05-16T19:31:50.000Z | 2021-02-09T04:49:34.000Z | Guaranteed to work with [starterkit-rust](https://github.com/icfpcontest2020/starterkit-rust).
Base image `icfpcontest2020/rust:latest` built automatically from `Dockerfile.base`.
| 60 | 94 | 0.816667 | eng_Latn | 0.615483 |
504813f05a5054da461d9011097f3057c7614d01 | 132 | md | Markdown | src/modules/user/README.md | chsjr1996/natours-nest-api | 78876c28a5336deeaa6e374755380a0b23bd182e | [
"MIT"
] | 1 | 2021-07-24T20:33:32.000Z | 2021-07-24T20:33:32.000Z | src/modules/user/README.md | chsjr1996/tours-nest-api | 78876c28a5336deeaa6e374755380a0b23bd182e | [
"MIT"
] | null | null | null | src/modules/user/README.md | chsjr1996/tours-nest-api | 78876c28a5336deeaa6e374755380a0b23bd182e | [
"MIT"
] | 1 | 2021-02-10T04:27:50.000Z | 2021-02-10T04:27:50.000Z | # User Module
---
## Todo
- [ ] Protect password with hash bcrypt (WIP)
- [ ] Improve put method to allow update registers parts
| 14.666667 | 56 | 0.674242 | eng_Latn | 0.848833 |
504883ddac5b4cbc83a85da66b10183d61f36ffe | 860 | md | Markdown | docs/csharp/misc/cs2023.md | cihanyakar/docs.tr-tr | 03b6c8998a997585f61b8be289df105261125239 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/csharp/misc/cs2023.md | cihanyakar/docs.tr-tr | 03b6c8998a997585f61b8be289df105261125239 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/csharp/misc/cs2023.md | cihanyakar/docs.tr-tr | 03b6c8998a997585f61b8be289df105261125239 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Derleyici Uyarısı (düzey 1) CS2023
ms.date: 07/20/2015
f1_keywords:
- CS2023
helpviewer_keywords:
- CS2023
ms.assetid: 2201fcbc-0eb6-4a1e-baa0-50c5968d1d92
ms.openlocfilehash: e8061feb31532869bdb1f33d38329061ee3b5300
ms.sourcegitcommit: 3d5d33f384eeba41b2dff79d096f47ccc8d8f03d
ms.translationtype: MT
ms.contentlocale: tr-TR
ms.lasthandoff: 05/04/2018
ms.locfileid: "33315548"
---
# <a name="compiler-warning-level-1-cs2023"></a>Derleyici Uyarısı (düzey 1) CS2023
Bir yanıt dosyası içinde belirtildiğinden/noconfig seçeneği yoksayılıyor
[/Noconfig](../../csharp/language-reference/compiler-options/noconfig-compiler-option.md) derleyici seçeneği verilmez bir yanıt dosyası içinde belirtildi.
Bu uyarı tarafından gizlenen olamaz [/nowarn](../../csharp/language-reference/compiler-options/nowarn-compiler-option.md) seçeneği.
| 39.090909 | 157 | 0.789535 | tur_Latn | 0.946071 |
5049fda93528a37cfceccb9ed5bdd0d1a04fb8ae | 1,615 | md | Markdown | docs/03-static.md | qudou/xmlweb | 49a67af4808624d06c4772840b6101367331e884 | [
"MIT"
] | 4 | 2017-04-09T03:21:29.000Z | 2019-02-17T10:02:29.000Z | docs/03-static.md | qudou/xmlweb | 49a67af4808624d06c4772840b6101367331e884 | [
"MIT"
] | null | null | null | docs/03-static.md | qudou/xmlweb | 49a67af4808624d06c4772840b6101367331e884 | [
"MIT"
] | null | null | null | # 静态服务器
为了方便使用，xmlweb 内置了一个简单的静态服务器的节点组件 Static。当然，在搭建 web 应用时，你可以不使用它或者使用自定义的静态服务器的节点组件。
## 静态接口
为了了解清楚该组件是如何使用的，我们从一个最简单的示例开始：
```xml
<!-- 03-01 -->
<i:HTTP xmlns:i='//xmlweb'>
<i:Static id='static'/>
</i:HTTP>
```
该静态 web 服务器侦听 8080 端口，并以代码所在的文件目录为工作目录。当然，你最好给它设置一个独立的工作目录。该示例尽管简单，但它可以正常工作，下面是一些可以提供的静态接口属性：
- `url`: `String` 描述了允许接受的请求路径集，默认为 `/*`
- `root`：`String` 工作目录，默认为代码所在的文件目录
## 内部结构
为了更好的使用该组件，对 Static 组件的内部做些了解是很有必要的。组件 Static 实质上是一个状态机组件，下面是此组件的视图项：
```xml
<Flow xmlns:s='static'>
<Router id='router'/>
<s:Status id='status'/>
<s:Cache id='catch'/>
<s:Ranges id='ranges'/>
<s:Compress id='compress'/>
<s:Output id='output'/>
<s:Error id='error'/>
</Flow>
```
从此视图项可以看出，该状态机组件包含若干个子节点组件，下面是各子节点组件的基本用途：
- Router：过滤掉所有的非 GET 请求
- Status：获取目录文件的状态属性
- Catch：文件缓存处理
- Ranges: 部分资源的范围请求的处理
- Compress：文件压缩处理
- Output：响应请求
- Error: 处理状态码为 304、412、416、500 的响应
## 自定义 404 页面
Static 组件节点对不存在的 URL 请求会导致停机，从而将后续处理交给 HTTP 组件节点，而 HTTP 组件节点的处理方式是返回一个简单的 404 页面。我们如果想返回不一样的 404 页面，那么可以自己定义一个组件节点并将其作为 Static 组件节点的后继。如下面的示例所示：
```xml
<!-- 03-02 -->
<i:HTTP xmlns:i='//xmlweb'>
<i:Static id='static'/>
<NotFound id='notfound'/>
</i:HTTP>
```
此示例中，所有的 404 响应都会由 NotFound 组件节点完成。该组件的具体定义如下：
```js
// 03-03
NotFound: {
xml: "<h1>This is not the page you are looking for.</h1>",
fun: function (sys, items, opts) {
this.on("enter", (e, r) => {
r.res.statusCode = 404;
r.res.setHeader("Content-Type", "text/html");
r.res.end(this.serialize());
});
}
}
```
当然，这个自定义组件返回的 404 页面还是非常简陋的，你可以进一步修改成你想要的样子。 | 21.533333 | 144 | 0.657585 | yue_Hant | 0.855657 |
504abb2b2e616d38dc951a8b01d87a20a385390b | 65 | md | Markdown | README.md | PookMook/CityBuilder.js | bbfbbd6c767115568f0a6e9cbfce49578678ccd9 | [
"MIT"
] | null | null | null | README.md | PookMook/CityBuilder.js | bbfbbd6c767115568f0a6e9cbfce49578678ccd9 | [
"MIT"
] | null | null | null | README.md | PookMook/CityBuilder.js | bbfbbd6c767115568f0a6e9cbfce49578678ccd9 | [
"MIT"
] | null | null | null | # CityBuilder.js
City Builder à la Sierra (caesar, pharaoh, etc)
| 21.666667 | 47 | 0.753846 | hun_Latn | 0.299874 |
504c6dcda30e0d993e3871a0e63d5e323cd29d8d | 2,442 | md | Markdown | node/tests.md | shershen08/modern_javascript_frameworks | 16f1f7a9d7c491e77336ae3d81cd999701d58c57 | [
"MIT"
] | 9 | 2018-09-24T18:28:09.000Z | 2021-09-28T19:20:26.000Z | node/tests.md | shershen08/modern_javascript_frameworks | 16f1f7a9d7c491e77336ae3d81cd999701d58c57 | [
"MIT"
] | 6 | 2020-07-17T11:48:54.000Z | 2022-03-02T04:36:52.000Z | node/tests.md | shershen08/modern_javascript_frameworks | 16f1f7a9d7c491e77336ae3d81cd999701d58c57 | [
"MIT"
] | 7 | 2018-11-08T07:18:53.000Z | 2021-07-22T10:41:58.000Z | https://www.coursera.org/learn/writing-running-fixing-code/supplement/DmsyN/revisiting-step-4
```
Test Your Algorithm
Once you have generalized your Algorithm, it is time to test it out. To test it out, you should work it on different instances of the problem than the one(s) you used to come up with it. The goal here is to find out if you mis-generalized before you proceed. We have already seen one instance of mis-generalization in our rectangle problem, in which our algorithm was too specific to the examples from which we had built it (always using r1’s bottom, r2’s left, etc…). Testing on these same examples would not have revealed any problems.
In doing this testing, you want to strike a balance—enough testing to give you confidence that your algorithm is correct before you proceed, but not an excessive amount of testing. Note that in this testing, you perform your steps by hand, so it may be somewhat slow for a long or complex algorithm. You can do more extensive testing after you translate your algorithm to code. The tradeoff there is that the computer will execute your test cases (which is fast), but if your algorithm is not correct, you have spent time implementing the wrong algorithm.
Here are some guidelines to help you devise a good set of test cases to use in Step 4:
Try test cases that are qualitatively different from what you used to design your algorithm. In the case of our rectangle example, the two examples we used to build the algorithm were both fairly similar, but the third example (which we used to show the flaw) was noticeably different—the rectangles overlapped in a very different way.
Try to find corner cases—inputs where your algorithm behaves differently. If your algorithm takes a list of things as an input, try it with an empty list. If you count from 1 to N (inclusive), try N=0 (you will count no times) and N=1 (you will count only one time).
Try to obtain statement coverage—that is, between all of your test cases, each line in the algorithm should be executed at least once. We will discuss various forms of test case coverage later in the course.
Examine your algorithm and see if there are any apparent oddities in its behavior (such as it always answers “true”, it never answers “0” even though that seems like a plausible answer), and think about whether or not you can get a test case where the right answer is something that your algorithm cannot give as its answer
```
| 152.625 | 555 | 0.791564 | eng_Latn | 0.999939 |
504cb0be49cc5726ec1b74028679b2d4c3d2e136 | 59 | md | Markdown | tags.md | bryanbraun/tiffany.blog | 5f3269485536db89d517c7e012be18caaf62a6fc | [
"MIT"
] | null | null | null | tags.md | bryanbraun/tiffany.blog | 5f3269485536db89d517c7e012be18caaf62a6fc | [
"MIT"
] | null | null | null | tags.md | bryanbraun/tiffany.blog | 5f3269485536db89d517c7e012be18caaf62a6fc | [
"MIT"
] | null | null | null | ---
title: Posts by Tag
layout: tags
permalink: /tags/
---
| 9.833333 | 19 | 0.644068 | eng_Latn | 0.698264 |
504dac8bb3726329897e0fa695919fe218f792f2 | 305 | md | Markdown | posts/2008/12/via-thoughtbot.md | atmos/tumblr.atmos.org | 1865e6fe271d4c28047ac50fd4ace154be411ff1 | [
"MIT"
] | null | null | null | posts/2008/12/via-thoughtbot.md | atmos/tumblr.atmos.org | 1865e6fe271d4c28047ac50fd4ace154be411ff1 | [
"MIT"
] | null | null | null | posts/2008/12/via-thoughtbot.md | atmos/tumblr.atmos.org | 1865e6fe271d4c28047ac50fd4ace154be411ff1 | [
"MIT"
] | 2 | 2019-05-06T18:02:23.000Z | 2019-05-06T18:27:47.000Z | <!--
id: 64372818
link: http://tumblr.atmos.org/post/64372818/via-thoughtbot
slug: via-thoughtbot
date: Thu Dec 11 2008 15:19:50 GMT-0800 (PST)
publish: 2008-12-011
tags:
title: (via thoughtbot)
-->
(via thoughtbot)
================
| 17.941176 | 66 | 0.688525 | yue_Hant | 0.21894 |
504de2011b47bc09f96e7c7611d447fc7c053061 | 922 | md | Markdown | README.md | mauriciocoelho/Cibe | 4914ce62d65fa0cf30eb6448a0f3acbac3115eaf | [
"MIT"
] | 1 | 2020-02-21T10:19:08.000Z | 2020-02-21T10:19:08.000Z | README.md | mauriciocoelho/Cibe | 4914ce62d65fa0cf30eb6448a0f3acbac3115eaf | [
"MIT"
] | 2 | 2021-03-10T04:06:32.000Z | 2021-05-10T23:55:56.000Z | README.md | mauriciocoelho/Cibe | 4914ce62d65fa0cf30eb6448a0f3acbac3115eaf | [
"MIT"
] | null | null | null | ## Sobre CibePorto
O CibePorto é um gerenciador de cadastro de pessoas (irmãos) simples, onde possui:
- Dashboard.
- Cadastro de Congregação.
- Cadastro de Pessoas.
- Cadastro de Eventos.
- Relatório de Pessoas Geral.
- Relatório de Cadastro da Pessoa.
- Relatório de Aniversários.
- Relatório de Eventos.
## Expecificações
- Linguagem: PHP 7.3.5 .
- Framework: Laravel 6.9.0 .
- Banco de Dados: Mysql.
## Instalação
- git clone https://github.com/mauriciocoelho/Cibe.git
- composer install
- cd cibeporto
- cp .env.example .env
- php artisan migrate
- php artisan serve
## Vulnerabilidades de segurança
Se você descobrir uma vulnerabilidade de segurança no Laravel, envie um e-mail para [[email protected]]. Todas as vulnerabilidades de segurança serão prontamente tratadas.
## Licença
A estrutura do Laravel é um software de código aberto licenciado sob o [MIT license](https://opensource.org/licenses/MIT). | 25.611111 | 173 | 0.760304 | por_Latn | 0.998542 |
504eb5477007bf055afc46926fd455dead744f6c | 10,043 | md | Markdown | README.md | davisdude/Brady | 6f8f8d34ddc0fde9f017233caca6e68e00a6a766 | [
"MIT"
] | 59 | 2015-04-02T21:41:36.000Z | 2021-11-25T16:20:58.000Z | README.md | davisdude/Brady | 6f8f8d34ddc0fde9f017233caca6e68e00a6a766 | [
"MIT"
] | 2 | 2016-05-27T20:24:39.000Z | 2020-06-10T00:08:08.000Z | README.md | davisdude/Brady | 6f8f8d34ddc0fde9f017233caca6e68e00a6a766 | [
"MIT"
] | 6 | 2015-08-21T09:37:14.000Z | 2021-07-15T20:04:58.000Z | Brady
===
Brady is a camera library for [LOVE] that features parallax scrolling and aspect ratios.
Minimal Example
---
Below is a minimal example of using the module. In the repository, you will find a more advanced example/demo [here](#demo)
```lua
local Camera = require 'Camera'
function love.load()
-- Create a camera with a 'width' of 400 x 300 on screen at ( 32, 32 ).
-- Because the camera has the flags 'resizable' and 'maintainAspectRatio', the default scaling will take over
-- So everything drawn will be scaled up to maximize space within the window, with a 32 pixel buffer from each edge.
cam = Camera( 400, 300, { x = 32, y = 32, resizable = true, maintainAspectRatio = true } )
end
function love.update( dt )
cam:update() -- Needed to appropriately resize the camera
end
function love.draw()
cam:push()
-- By default, translation is half camera width, half camera height
-- So this draws a rectangle at the center of the screen.
love.graphics.rectangle( 'fill', -32, -32, 64, 64 )
cam:pop()
end
```
Demo
---
Within the repo is a demo to show off some of the capabilities. To run, follow the instructions found [here](https://love2d.org/wiki/Game_Distribution#Create_a_.love-file). In the demo, the left box shows a close-up view, the right box shows an overview. Use the mouse to create squares using either box. With the mousewheel you can zoom in and out and you can move around using the `wasd` keys and rotate with `q` and `e`. To reset the view, press `o` (for origin). To clear the squares, press `c`, and to reset everything, press `r`.
Gotchas
---
- Every camera has a layer called `'main'` automatically created. This layer has the same scale as the camera and is used simply to distinguish the layers.
- Layers can have an attribute known as the "relativeScale". This value is used to control how fast the layer moves, relative to its scale. For instance, if the layer has a scale of 2 and a relativeScale of .5, it will move at the same speed as the main layer, but will appear twice as large. See [cam:addLayer](#camaddlayer) for more.
- `cam.scale` is a number, __not__ a function. Use [cam:scaleBy](#camscaleby) instead.
Functions
---
### Camera.newCamera
Creates a new camera object.
__Synopsis__: `cam = Camera.newCamera( w, h, flags )` or `cam = Camera( w, h, flags )`
- `cam`: Table. A new camera object.
- `w, h`: Numbers. The width/height of the camera. If the flags `resizable` and `maintainAspectRatio` are set, these are used to determine the scaling needed. Otherwise, it sets the camera to this size.
- `flags`: Table. These allow you to set some of the options of the camera without using getter/setter methods. Possible flags are:
- `x, y`: _Numbers_ (Default to `0, 0`). The position of the camera on the screen.
- `translationX, translationY`: _Numbers_ (Defaults to `0, 0`). The translation of the camera.
- `offsetX, offsetY`: _Numbers_ (Default to `w / 2, h / 2`). The amount to offset the camera.
- `scale`: _Number_ (Defaults to `1`). The scale of the camera.
- `rotation`: _Number_ (Defaults to `0`). The rotation of the camera.
- `resizable`: _Boolean_ (Defaults to `false`). `true` if the camera can be resized, `false` if it cannot.
- `maintainAspectRatio`: _Boolean_ (Defaults to `false`). `true` if the initial aspect ratio should be maintained, false if it shouldn't.
- `center`: _Boolean_ (Defaults to `false`). `true` if offsets should be centered on a screen, false if it shouldn't.
- `mode`: _String_ (Defaults to `'transform'`). The [StackType] to use for `push`ing and `pop`ing the camera.
- `update`: _Function_. The function called every frame used to control scaling and size. By default, if the camera is resizable, the resizing function is called, passing itself and the results of `cam:getContainerDimensions`.
- `resizingFunction`: _Function_. Only called if the `resizable` flag is true. Used to set the width and height of the camera, as well as any other changes due to resizing. By default, the function changes the `aspectRatioScale`, `offsetX` and `offsetY`, `w`, and `h` of the camera and takes the parameters `self`, `containerW`, and `containerH`.
- `getContainerDimensions`: _Function_. By default, it returns the width and height of the screen.
### cam:push
Prepare the draw area. Pseudonym for [layer:push](#layer-push).
__Synopsis__: `cam:push( layer )`
- `layer`: `nil`, _String_, or _table_ (Defaults to `'main'`, a layer that is automatically created). The name of the layer (as specified in [cam:addLayer](#camaddlayer)) __or__ the layer, as returned by [cam:addLayer](#camaddlayer).
### cam:pop
Used to stop the camera scaling, etc. Pseudonym for [layer:pop](#layer-pop).
__Synopsis__: `cam:pop( layer )`
- `layer`: `nil`, _String_, or _table_. See [cam:push](#campush) for a detailed description of the layer. By default, this is just the same as calling [love.graphics.pop](#https://love2d.org/wiki/love.graphics.pop), so specifying the layer isn't required unless you want to for stylistic reasons.
### cam:getWorldCoordinates
Returns the position within the "world," i.e. what the camera is seeing. Translates mouse coordinates to in-game coordinates.
__Synopsis__: `worldX, worldY = cam:getWorldCoordinates( screenX, screenY )`
- `worldX, worldY`: _Numbers_. The word-coordinates of the mouse.
- `screenX, screenY`: _Numbers_. The coordinates on-screen, i.e. the mouse usually.
### cam:getScreenCoordinates
Translates in-game coordinates to the screen. The opposite of [cam:getWorldCoordinates](#camtoworldcoordinates).
__Synopsis__: `screenX, screenY = cam:getWorldCoordinates( worldX, worldY )`
- `screenX, screenY`: _Numbers_. The coordinates on-screen, i.e. the mouse usually.
- `worldX, worldY`: _Numbers_. The word-coordinates of the mouse.
### cam:getMouseWorldCoordinates
Short for `cam:getScreenCoordinates( love.mouse.getPosition() )`. See [cam:getScreenCoordinates](#camtoscreencoordinates) for more.
__Synopsis__: `screenX, screenY = cam:getMouseWorldCoordinates( layer )`
- `screenX, screenY`: _Numbers_. The coordinates on-screen, i.e. the mouse usually.
- `layer`: `nil`, _String_, or _table_. See [cam:push](#campush) for a detailed description of the layer. If `nil`, the main layer is used.
### cam:setViewportPosition
Set the x and y position of the camera's upper-left corner on-screen. Wrapper function for `cam.x, cam.y = -- etc`.
__Synopsis__: `cam:setViewportPosition( x, y )`
- `x, y`: _Numbers_. The upper-left corner of the camera.
### cam:getViewportPosition
Returns the upper-left x and y position of the camera.
__Synopsis__: `x, y = cam:getViewportPosition()`
- `x, y`: _Numbers_. The upper-left corner of the camera.
### cam:setOffset
Sets the camera's offset, which, by default, is `w / 2` and `h / 2`.
__Synopsis__: `cam:setOffset( x, y )`
- `x, y`: _Numbers_. The x and y offset for the camera.
### cam:setTranslation
Gets the camera's offset.
__Synopsis__: `x, y = cam:getOffset()`
- `x, y`: _Numbers_. The x and y offset of the camera.
### cam:getTranslation
### cam:increaseTranslation
Get/set/increase the translation.
### cam:translate
Synonymous with [cam:increaseTranslation](#camincreasetranslation)
### cam:setRotation
### cam:getRotation
### cam:increaseRotation
Get/set/increase the rotation.
### cam:rotate
Synonymous with [cam:increaseRotation](#camincreaseRotation)
### cam:setScale
### cam:getScale
### cam:increaseScale
Get/set/increase the scale.
### cam:scaleBy
Increase the scale by a factor.
__Synopsis__: `cam:scaleBy( factor )`
- `factor`: _Number_. Multiply the scale by this amount. e.g. if the scale is .5 and you `scaleBy` 2, the scale is now 1.
### cam:increaseScaleToPoint
Increment the scale, while zooming in to a point
__Synopsis__: `cam:increaseScaleToPoint( ds, wx, wy )`
- `ds`: _Number_. The amount by which to increment the scale. I.e. if `scale` is _1_ and `ds` is _.1_, then new scale is _1.1_.
- `wx, wy`: `nil` or _Numbers_. The __world__ coordinates to zoom into. If left `nil`, defaults to [`cam:getMouseWorldCoordinates()`](#camgetmouseworldcoordinates).
### cam:scaleToPoint
Increase the scale by a factor, while zooming to a point
__Synopsis__: `cam:scaleToPoint( s, wx, wy )`
- `s`: _Number_. The factor by which to increase the scale. I.e. if `scale` is _1_ and `s` is _2_, the new scale is _2_.
- `wx, wy`: `nil` or _Numbers_. The _world_ coordinates to zoom into. If left `nil`, defaults to [`cam:getMouseWorldCoordinates()`](#camgetmouseworldcoordinates).
### cam:getLayer
Get the specified layer.
__Synopsis__: `layer = cam:getLayer( target )`
- `target`: _Table_ or _String_. Get the specified layer. If a table is passed, the table is returned. If a string is passed, the layer of the specified name is returned.
- `layer`: _Table_ or `nil`. The specified layer, or `nil` if the specified layer does not exist.
### cam:addLayer
Create a new layer for the camera.
__Synopsis__: `layer = cam:addLayer( name, scale, flags )`
- `name`: _String_. The name used to identify the layer.
- `scale`: _Number_. The scale of the layer.
- `flags`: _Table_. These allow you to specify values for the layer. Possible flags are:
- `relativeScale`: _Number_ (Defaults to `1`). The relative scale of the layer. This does __not__ affect the scale in any way; this controls how much the layer is translated. For instance, a layer with a scale of 2 and a relative scale of .5 moves at the same speed as the main layer, it is just twice the size.
- `mode`: _String_ (Defaults to `cam.mode`). The [StackType] of the layer.
### layer:push
Prepare for the layer's translations.
__Synopsis__: `layer:push()`
### layer:pop
Ends the layer's translations. By default, it's only [love.graphics.pop].
__Synopsis__: `layer:pop()`
[LOVE]: https://love2d.org
[StackType]: https://love2d.org/wiki/StackType
[love.graphcis.pop]: https://love2d.org/wiki/love.graphics.pop
License
---
This is under the MIT license, which can be found at the top of [camera.lua](/camera.lua)
| 40.991837 | 535 | 0.73026 | eng_Latn | 0.985964 |
504ec193cea612de6aace47086ed1afe4ab1c86f | 1,219 | md | Markdown | docs/extensibility/debugger/reference/idebugcoreserver3-disableautoattach.md | tommorris/visualstudio-docs.tr-tr | 11f1d23025c44a834e451a92828b7078fdc68a7c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/extensibility/debugger/reference/idebugcoreserver3-disableautoattach.md | tommorris/visualstudio-docs.tr-tr | 11f1d23025c44a834e451a92828b7078fdc68a7c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/extensibility/debugger/reference/idebugcoreserver3-disableautoattach.md | tommorris/visualstudio-docs.tr-tr | 11f1d23025c44a834e451a92828b7078fdc68a7c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: IDebugCoreServer3::DisableAutoAttach | Microsoft Docs
ms.custom: ''
ms.date: 11/04/2016
ms.technology:
- vs-ide-sdk
ms.topic: conceptual
f1_keywords:
- IDebugCoreServer3::DisableAutoAttach
helpviewer_keywords:
- IDebugCoreServer3::DisableAutoAttach
ms.assetid: 9d860a20-c154-4df4-ba15-636e0fcd42bf
author: gregvanl
ms.author: gregvanl
manager: douge
ms.workload:
- vssdk
ms.openlocfilehash: 5c8a36e867d4ee7c180b96db6dec004ed4d5227e
ms.sourcegitcommit: 6a9d5bd75e50947659fd6c837111a6a547884e2a
ms.translationtype: MT
ms.contentlocale: tr-TR
ms.lasthandoff: 04/16/2018
ms.locfileid: "31106334"
---
# <a name="idebugcoreserver3disableautoattach"></a>IDebugCoreServer3::DisableAutoAttach
Bu sunucu ile ilişkilendirilen tüm hata ayıklama altyapıları için otomatik ekleme devre dışı bırakır.
## <a name="syntax"></a>Sözdizimi
```cpp
HRESULT DisableAutoAttach(
void
);
```
```csharp
int DisableAutoAttach();
```
## <a name="return-value"></a>Dönüş Değeri
Başarılı olursa, döndürür `S_OK`; Aksi takdirde, hata kodunu döndürür.
## <a name="see-also"></a>Ayrıca Bkz.
[IDebugCoreServer3](../../../extensibility/debugger/reference/idebugcoreserver3.md) | 27.704545 | 103 | 0.746514 | tur_Latn | 0.258837 |
504fb345f4933b9fbc79faf1dee085318482cf37 | 43 | md | Markdown | README.md | vunb/kites-typeorm | 526b532d2d7ec22c51ac90df599cbd2ea4a3d9ea | [
"MIT"
] | null | null | null | README.md | vunb/kites-typeorm | 526b532d2d7ec22c51ac90df599cbd2ea4a3d9ea | [
"MIT"
] | null | null | null | README.md | vunb/kites-typeorm | 526b532d2d7ec22c51ac90df599cbd2ea4a3d9ea | [
"MIT"
] | null | null | null | # kites-typeorm
TypeORM for Kites Modeling
| 14.333333 | 26 | 0.813953 | kor_Hang | 0.561323 |
50500a42ad6cd19d1bbfb20182ef1a8b7f425944 | 999 | md | Markdown | _posts/Historical/1999-09-02-canada.md | Confusedfish/confusedfish.github.io | 60d405cd5ac3ecf228a7c891ba23c79b5b68eca4 | [
"CC-BY-3.0"
] | null | null | null | _posts/Historical/1999-09-02-canada.md | Confusedfish/confusedfish.github.io | 60d405cd5ac3ecf228a7c891ba23c79b5b68eca4 | [
"CC-BY-3.0"
] | 3 | 2020-12-30T22:59:17.000Z | 2022-02-26T03:28:01.000Z | _posts/Historical/1999-09-02-canada.md | Confusedfish/confusedfish.github.io | 60d405cd5ac3ecf228a7c891ba23c79b5b68eca4 | [
"CC-BY-3.0"
] | null | null | null | ---
layout: post
last_modified_at: 2017-12-17T19:00:00-00:00
title: Canada & bit of the United States
description: Our first year out together, Canada incl Vancouver, Vancouver Island, Whistler, San Francisco, Las Vegas, New Hampshire, New York
thumbSquare: https://instagram.flhr4-2.fna.fbcdn.net/t51.2885-19/891379_1503164956579343_15485354_a.jpg
image: https://farm5.staticflickr.com/4681/39115709261_78c948d62a_h.jpg
thumbSquare: https://farm1.staticflickr.com/417/32481110406_c0cab227be_q.jpg
tags: [ winter, skiing, roadtrip ]
country: Canada
published: true
---
Unfortunately predates our entry to digital cameras but it was a massive year out including:
* New York
* Vancouver
* Vancouver Island
* Whistler
* Many Hot Springs in British Columbia
* San Francisco
* Las Vegas
* Zion National Park
* Bryce Canyon
* Arches National Park
* Jasper National Park
* Peyto Lake
* Whitehorse
* Edmonton
* Ottawa
* Montreal
* Quebec
* Ending with a stay with McIntyre relatives in Lyme New Hampshire
| 29.382353 | 142 | 0.787788 | eng_Latn | 0.567599 |
4f6a95bd073fa6acb7714c1343f7bd92fa578e49 | 1,557 | md | Markdown | README.md | MehrAlsNix/ext-tinyexpr | 80b2a2375e442415310f82e8bffe93d049893fe9 | [
"MIT"
] | 1 | 2020-03-15T20:48:22.000Z | 2020-03-15T20:48:22.000Z | README.md | MehrAlsNix/ext-tinyexpr | 80b2a2375e442415310f82e8bffe93d049893fe9 | [
"MIT"
] | null | null | null | README.md | MehrAlsNix/ext-tinyexpr | 80b2a2375e442415310f82e8bffe93d049893fe9 | [
"MIT"
] | null | null | null | # PHP TinyExpression
Math evaluation for strings.
[](https://travis-ci.com/MehrAlsNix/ext-tinyexpr) [](https://ci.appveyor.com/project/siad007/ext-tinyexpr)
## TinyExpr Binding
[TinyExpr](https://github.com/codeplea/tinyexpr) Bindings for PHP
> TinyExpr is a very small parser and evaluation library for evaluating math expressions from C
### Installation
#### Linux
```
git clone --branch "master" --depth 1 https://github.com/MehrAlsNix/ext-tinyexpr.git /tmp/tinyexpression
cd /tmp/tinyexpression
phpize
./configure
make
make install
echo "extension=tinyexpression.so" > /usr/local/etc/php/conf.d/tinyexpression.ini
```
#### Windows
tbd.
<hr>
### Functions
#### tinyexpr_interp
<hr>
(TinyExpression 0.1.0)
<br>
<br>
tinyexpr_interp - Evaluate math expressions from a `string`.
##### Description
```
tinyexpr_interp ( string $expr ) : float
```
##### Parameters
<b>expr</b> `string`
##### Return Values
Returns the evaluated math expression as a `float`.
##### Examples
```
docker-compose build
docker-compose up -d
docker-compose exec php bash
```
```
php -r "var_dump(tinyexpr_interp('2*9+8-(5/9)'));"
float(25.444444444444)
```
```
php -r "var_dump(tinyexpr_interp('sin(0.6)'));"
float(0.56464247339504)
```
Not parsable expressions will return `NAN`:
```
php -r "var_dump(tinyexpr_interp('(1+2'), is_nan(tinyexpr_interp('(1+2')));"
float(NAN)
bool(true)
```
| 19.222222 | 272 | 0.710983 | kor_Hang | 0.238152 |
4f6aa4e33111c8002b6896e2fb1aa572dff05715 | 5,035 | md | Markdown | docs/parallel/concrt/reference/network-link-registry-class.md | ANKerD/cpp-docs.pt-br | 6910dc17c79db2fee3f3616206806c5f466b3f00 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/parallel/concrt/reference/network-link-registry-class.md | ANKerD/cpp-docs.pt-br | 6910dc17c79db2fee3f3616206806c5f466b3f00 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/parallel/concrt/reference/network-link-registry-class.md | ANKerD/cpp-docs.pt-br | 6910dc17c79db2fee3f3616206806c5f466b3f00 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Classe network_link_registry | Microsoft Docs
ms.custom: ''
ms.date: 11/04/2016
ms.technology:
- cpp-concrt
ms.topic: reference
f1_keywords:
- network_link_registry
- AGENTS/concurrency::network_link_registry
- AGENTS/concurrency::network_link_registry::add
- AGENTS/concurrency::network_link_registry::begin
- AGENTS/concurrency::network_link_registry::contains
- AGENTS/concurrency::network_link_registry::count
- AGENTS/concurrency::network_link_registry::remove
dev_langs:
- C++
helpviewer_keywords:
- network_link_registry class
ms.assetid: 3e7b4097-09f1-4252-964e-b15b8f7f7fc6
author: mikeblome
ms.author: mblome
ms.workload:
- cplusplus
ms.openlocfilehash: 2798c4abe33e49d2ac6199ad6f9a1013805fde7b
ms.sourcegitcommit: 799f9b976623a375203ad8b2ad5147bd6a2212f0
ms.translationtype: MT
ms.contentlocale: pt-BR
ms.lasthandoff: 09/19/2018
ms.locfileid: "46424411"
---
# <a name="networklinkregistry-class"></a>Classe network_link_registry
O `network_link_registry` gerencia a classe base abstrata os links entre os blocos de origem e destino.
## <a name="syntax"></a>Sintaxe
```
template<class _Block>
class network_link_registry;
```
#### <a name="parameters"></a>Parâmetros
*Bloco*<br/>
O bloco tipo de dados estão sendo armazenadas em do `network_link_registry`.
## <a name="members"></a>Membros
### <a name="public-typedefs"></a>Typedefs públicos
|Nome|Descrição|
|----------|-----------------|
|`const_pointer`|Um tipo que fornece um ponteiro para um `const` elemento em um `network_link_registry` objeto.|
|`const_reference`|Um tipo que fornece uma referência a um `const` elemento armazenado em um `network_link_registry` objeto para leitura e execução de operações constantes.|
|`iterator`|Um tipo que fornece um iterador que pode ler ou modificar qualquer elemento em um `network_link_registry` objeto.|
|`type`|Um tipo que representa o tipo de bloco armazenado em do `network_link_registry` objeto.|
### <a name="public-methods"></a>Métodos públicos
|Nome|Descrição|
|----------|-----------------|
|[add](#add)|Quando substituído em uma classe derivada, adiciona um link para o `network_link_registry` objeto.|
|[begin](#begin)|Quando substituído em uma classe derivada, retorna um iterador para o primeiro elemento no `network_link_registry` objeto.|
|[Contém](#contains)|Quando substituído em uma classe derivada, pesquisa o `network_link_registry` objeto para um bloco especificado.|
|[count](#count)|Quando substituído em uma classe derivada, retorna o número de itens no `network_link_registry` objeto.|
|[remove](#remove)|Quando substituído em uma classe derivada, remove um bloco especificado do `network_link_registry` objeto.|
## <a name="remarks"></a>Comentários
O `network link registry` não é seguro para o acesso simultâneo.
## <a name="inheritance-hierarchy"></a>Hierarquia de herança
`network_link_registry`
## <a name="requirements"></a>Requisitos
**Cabeçalho:** Agents. h
**Namespace:** simultaneidade
## <a name="add"></a> Adicionar
Quando substituído em uma classe derivada, adiciona um link para o `network_link_registry` objeto.
```
virtual void add(_EType _Link) = 0;
```
### <a name="parameters"></a>Parâmetros
*Link*<br/>
Um ponteiro para um bloco a ser adicionado.
## <a name="begin"></a> começar
Quando substituído em uma classe derivada, retorna um iterador para o primeiro elemento no `network_link_registry` objeto.
```
virtual iterator begin() = 0;
```
### <a name="return-value"></a>Valor de retorno
Um iterador que trata o primeiro elemento no `network_link_registry` objeto.
### <a name="remarks"></a>Comentários
O estado final do iterador é indicado por um `NULL` link.
## <a name="contains"></a> Contém
Quando substituído em uma classe derivada, pesquisa o `network_link_registry` objeto para um bloco especificado.
```
virtual bool contains(_EType _Link) = 0;
```
### <a name="parameters"></a>Parâmetros
*Link*<br/>
Um ponteiro para um bloco que está sendo procurado no `network_link_registry` objeto.
### <a name="return-value"></a>Valor de retorno
`true` Se o bloco foi encontrado, `false` caso contrário.
## <a name="count"></a> Contagem
Quando substituído em uma classe derivada, retorna o número de itens no `network_link_registry` objeto.
```
virtual size_t count() = 0;
```
### <a name="return-value"></a>Valor de retorno
O número de itens no objeto `network_link_registry`.
## <a name="remove"></a> Remover
Quando substituído em uma classe derivada, remove um bloco especificado do `network_link_registry` objeto.
```
virtual bool remove(_EType _Link) = 0;
```
### <a name="parameters"></a>Parâmetros
*Link*<br/>
Um ponteiro para um bloco a ser removido, se encontrado.
### <a name="return-value"></a>Valor de retorno
`true` Se o link foi encontrado e removido, `false` caso contrário.
## <a name="see-also"></a>Consulte também
[Namespace de simultaneidade](concurrency-namespace.md)<br/>
[Classe single_link_registry](single-link-registry-class.md)<br/>
[Classe multi_link_registry](multi-link-registry-class.md)
| 30.889571 | 173 | 0.747567 | por_Latn | 0.979525 |
4f6ae238b889f22d8ecea2a1b106c8fde12fbdb6 | 128 | md | Markdown | src/data/NCD/Cat1/SerumIronStudies/README.md | mettlesolutions/coverage_determinations | 1c4e5422204429f9784b9fa469028079bf5fb7cb | [
"Apache-2.0"
] | null | null | null | src/data/NCD/Cat1/SerumIronStudies/README.md | mettlesolutions/coverage_determinations | 1c4e5422204429f9784b9fa469028079bf5fb7cb | [
"Apache-2.0"
] | 81 | 2018-08-27T05:26:20.000Z | 2019-01-03T07:56:59.000Z | src/data/NCD/Cat1/SerumIronStudies/README.md | mettlesolutions/coverage_determinations | 1c4e5422204429f9784b9fa469028079bf5fb7cb | [
"Apache-2.0"
] | null | null | null | # Serum Iron Studies
https://www.cms.gov/medicare-coverage-database/details/ncd-details.aspx?NCDId=90&ncdver=1&bc=AAAAgAAAAAAA&
| 42.666667 | 106 | 0.804688 | kor_Hang | 0.510454 |
4f6c3b9dfb1fa9cbd1cd32612465ba1323ec2ea7 | 35 | md | Markdown | CHANGELOG.md | zane007/zlib | 5744874678c200578114bdb4af42734b4bc9f70d | [
"MIT"
] | null | null | null | CHANGELOG.md | zane007/zlib | 5744874678c200578114bdb4af42734b4bc9f70d | [
"MIT"
] | null | null | null | CHANGELOG.md | zane007/zlib | 5744874678c200578114bdb4af42734b4bc9f70d | [
"MIT"
] | null | null | null | ## 0.1.0(2018-4-21)
Create Project
| 11.666667 | 19 | 0.657143 | eng_Latn | 0.368334 |
4f6c5f4f0d3b83adc3debacd826b15aafffaed58 | 2,086 | md | Markdown | README.md | reactiveops/pentagon | 35fc59f910aabc66868c8012a416ff132ddf3911 | [
"Apache-2.0"
] | 192 | 2017-05-22T21:36:19.000Z | 2019-04-12T06:51:11.000Z | README.md | FairwindsOps/pentagon | 35fc59f910aabc66868c8012a416ff132ddf3911 | [
"Apache-2.0"
] | 132 | 2017-05-22T19:26:26.000Z | 2019-03-27T21:06:46.000Z | README.md | reactiveops/pentagon | 35fc59f910aabc66868c8012a416ff132ddf3911 | [
"Apache-2.0"
] | 29 | 2017-05-22T19:21:31.000Z | 2019-03-27T19:55:35.000Z | # Pentagon
# *Pentagon has been deprecated and will no longer be maintained.*
## What is Pentagon?
**Pentagon is a cli tool to generate repeatable, cloud-based [Kubernetes](https://kubernetes.io/) infrastructure.**
It can be used as a “batteries included” default which can:
- provide a network with a cluster
- Two HA KOPS based Kubernetes clusters
- Segregated multiple development / non-production environments
- VPN-based access control
- A highly-available network, built across multiple Availability Zones
## How does it work?
**Pentagon produces a directory.** The directory defines a basic set of configurations for [Ansible](https://www.ansible.com/), [Terraform](https://www.terraform.io/) and [kops](https://github.com/kubernetes/kops)). When those tools are run in a specific order the result is a VPC with a VPN and a Kubernetes Cluster in AWS. GKE Support is built in but not default. It is designed to be customizable while at the same time built with defaults that fit the needs of most web application companies.
## Getting Started
The [Getting Started](docs/getting-started.md) has information about installing Pentagon and creating your first project.
Table Of Contents
=================
* [Requirements](docs/getting-started.md#requirements)
* [Installation](docs/getting-started.md#installation)
* [Quick Start Guide](docs/getting-started.md)
* [VPC](docs/getting-started.md#vpc-setup)
* [VPN](docs/getting-started.md#vpn-setup)
* [KOPS](docs/getting-started.md#kops)
* [Advanced Usage](docs/getting-started.md#advanced-project-initialization)
* [Infrastrucure Repository Overview](docs/overview.md)
* [Component](docs/components.md)
## AWS Virtual Private Cloud
A VPC configuration is provided with Terraform. Details can be found on the [VPC Setup Page](docs/vpc.md).
## Virtual Private Network
Configuration is provided for an OpenVPN setup in the VPC. Details can be found on the [VPN Setup Page](docs/vpn.md).
[](https://cla-assistant.io/reactiveops/pentagon)
| 43.458333 | 497 | 0.762704 | eng_Latn | 0.955727 |
4f6cd92b99f85ef67ca0c364e13dfcedcfd7bc9a | 83,831 | md | Markdown | LeetCode/DaliyProblem.md | sxy22/MyLeetCode | 1271047c0a869117019f4076cad687b851d0e8d8 | [
"Apache-2.0"
] | 4 | 2021-11-16T07:05:03.000Z | 2022-01-21T00:08:22.000Z | LeetCode/DaliyProblem.md | sxy22/MyLeetCode | 1271047c0a869117019f4076cad687b851d0e8d8 | [
"Apache-2.0"
] | null | null | null | LeetCode/DaliyProblem.md | sxy22/MyLeetCode | 1271047c0a869117019f4076cad687b851d0e8d8 | [
"Apache-2.0"
] | null | null | null | # Leetcode每日一题
# 3/2022
## 3/22/2022
[440. 字典序的第K小数字](https://leetcode-cn.com/problems/k-th-smallest-in-lexicographical-order/)
+ long
```java
class Solution {
public int findKthNumber(int n, int k) {
int cur = 1;
k -= 1;
while (k > 0) {
int cnt = cnt(cur, n);
if (cnt <= k) {
k -= cnt;
cur += 1;
}else {
k -= 1;
cur = cur * 10;
}
}
return cur;
}
private int cnt(int cur, long n) {
int cnt = 0;
long first = cur;
long last = cur;
while (first <= n) {
cnt += Math.min(last, n) - first + 1;
first = first * 10;
last = last * 10 + 9;
}
return cnt;
}
}
```
## 3/15/2022
[2044. 统计按位或能得到最大值的子集数目](https://leetcode-cn.com/problems/count-number-of-maximum-bitwise-or-subsets/)
```java
class Solution {
int cnt = 0;
int max_or = -1;
public int countMaxOrSubsets(int[] nums) {
for (int i = 0; i < nums.length; i++) {
dfs(nums, i, nums[i]);
}
return cnt;
}
private void dfs(int[] nums, int cur_idx, int cur_or) {
if (cur_or > max_or) {
max_or = cur_or;
cnt = 1;
}else if (cur_or == max_or) {
cnt += 1;
}
for (int next_idx = cur_idx + 1; next_idx < nums.length; next_idx++) {
dfs(nums, next_idx, cur_or | nums[next_idx]);
}
}
}
```
## 3/12/2022
[590. N 叉树的后序遍历](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/)
```java
class Solution {
List<Integer> ans;
public List<Integer> postorder(Node root) {
ans = new ArrayList<>();
if (root == null) return ans;
dfs(root);
return ans;
}
private void dfs(Node root) {
if (root.children != null) {
for (Node node : root.children) {
dfs(node);
}
}
ans.add(root.val);
}
}
```
## 3/11/2022
[2049. 统计最高分的节点数目](https://leetcode-cn.com/problems/count-nodes-with-the-highest-score/)
```python
class Solution:
def countHighestScoreNodes(self, parents: List[int]) -> int:
n = len(parents)
parent2child = collections.defaultdict(list)
for i in range(1, n):
p = parents[i]
parent2child[p].append(i)
self.cnt = [-1] * n
self.dfs(0, parent2child)
max_mul = -1
cnt = -1
for i in range(n):
mul = self.get_mul(i, parent2child, n)
if mul > max_mul:
max_mul = mul
cnt = 1
elif mul == max_mul:
cnt += 1
return cnt
def dfs(self, node, parent2child):
cnt = 1
for child in parent2child[node]:
cnt += self.dfs(child, parent2child)
self.cnt[node] = cnt
return cnt
def get_mul(self, node, parent2child, n):
mul = 1
if len(parent2child[node]) == 0:
mul *= n - 1
elif len(parent2child[node]) == 1:
l_cnt = self.cnt[parent2child[node][0]]
mul *= l_cnt
mul *= max(1, n - 1 - l_cnt)
else:
l_cnt = self.cnt[parent2child[node][0]]
r_cnt = self.cnt[parent2child[node][1]]
mul *= l_cnt * r_cnt
mul *= max(1, n - 1 - l_cnt - r_cnt)
return mul
```
## 3/8/2022
[2055. 蜡烛之间的盘子](https://leetcode-cn.com/problems/plates-between-candles/)
```java
class Solution {
public int[] platesBetweenCandles(String s, int[][] queries) {
int n = s.length();
int[] pre_sum = new int[n];
int[] left = new int[n];
int[] right = new int[n];
int sum = 0;
int l = -1;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == '|') {
l = i;
pre_sum[i] = sum;
}else {
sum += 1;
}
left[i] = l;
}
int r = n;
for (int i = n - 1; i >= 0; i--) {
if (s.charAt(i) == '|') {
r = i;
}
right[i] = r;
}
int m = queries.length;
int[] ans = new int[m];
for (int i = 0; i < m; i++) {
int le = right[queries[i][0]];
int ri = left[queries[i][1]];
int cnt = 0;
if (le <= ri) {
cnt = pre_sum[ri] - pre_sum[le];
}
ans[i] = cnt;
}
return ans;
}
}
```
## 3/6/2022
[2100. 适合打劫银行的日子](https://leetcode-cn.com/problems/find-good-days-to-rob-the-bank/)
```python
class Solution:
def goodDaysToRobBank(self, security: List[int], time: int) -> List[int]:
if time == 0:
return [i for i in range(len(security))]
n = len(security)
left = [1] * n
for i in range(1, n):
if security[i - 1] >= security[i]:
left[i] = 1 + left[i - 1]
right = [1] * n
for i in range(n - 2, -1, -1):
if security[i + 1] >= security[i]:
right[i] = 1 + right[i + 1]
ans = []
# print(left)
# print(right)
for i in range(n):
if left[i] - 1 >= time and right[i] - 1 >= time:
ans.append(i)
return ans
```
# 2/2022
## 2/25/2022
[2016. 增量元素之间的最大差值](https://leetcode-cn.com/problems/maximum-difference-between-increasing-elements/)
```java
class Solution {
public int maximumDifference(int[] nums) {
int ans = -1;
int min = Integer.MAX_VALUE;
for (int num : nums) {
if (num > min) {
ans = Math.max(ans, num - min);
}else {
min = num;
}
}
return ans;
}
}
```
## 2/25/2022
[537. 复数乘法](https://leetcode-cn.com/problems/complex-number-multiplication/)
```python
class Solution:
def complexNumberMultiply(self, num1: str, num2: str) -> str:
s1 = num1.split('+')
s2 = num2.split('+')
a1, b1 = int(s1[0]), int(s1[1][:-1])
a2, b2 = int(s2[0]), int(s2[1][:-1])
c1 = a1 * a2 - b1 * b2
c2 = a1 * b2 + a2 * b1
return '{}+{}i'.format(c1, c2)
```
## 2/24/2022
```java
class Solution {
int m;
int n;
public int[] findBall(int[][] grid) {
m = grid.length;
n = grid[0].length;
int[] ans = new int[n];
for (int j = 0; j < n; j++) {
ans[j] = dfs(grid, 0, j);
}
return ans;
}
private int dfs(int[][] grid, int i, int j) {
if (i == m) return j;
int dirc = grid[i][j];
if (dirc == 1) {
if (j + 1 > n - 1 || grid[i][j + 1] == -1) return -1;
return dfs(grid, i + 1, j + 1);
}else {
if (j - 1 < 0 || grid[i][j - 1] == 1) return -1;
return dfs(grid, i + 1, j - 1);
}
}
}
```
## 2/23/2022
```python
class Solution:
def reverseOnlyLetters(self, s: str) -> str:
ans = [x for x in s]
i, j = 0, len(s) - 1
while i < j:
while i < j and not s[i].isalpha():
i += 1
while i < j and not s[j].isalpha():
j -= 1
ans[i], ans[j] = ans[j], ans[i]
i += 1
j -= 1
return ''.join(ans)
```
## 2/21/2022
[838. 推多米诺](https://leetcode-cn.com/problems/push-dominoes/)
```java
class Solution:
def pushDominoes(self, dominoes: str) -> str:
n = len(dominoes)
ans = [d for d in dominoes]
status = dict()
deque = collections.deque()
for i in range(n):
s = dominoes[i]
if s == 'L':
deque.append((i, -1))
if s == 'R':
deque.append((i, 1))
while deque:
status.clear()
for i in range(len(deque)):
idx, dirc = deque.popleft()
if dirc == -1 and idx - 1 >= 0 and ans[idx - 1] == '.':
if idx - 1 not in status:
status[idx - 1] = 0
status[idx - 1] -= 1
if dirc == 1 and idx + 1 < n and ans[idx + 1] == '.':
if idx + 1 not in status:
status[idx + 1] = 0
status[idx + 1] += 1
# print(status)
for idx in status:
if status[idx] == -1:
ans[idx] = 'L'
deque.append((idx, -1))
if status[idx] == 1:
ans[idx] = 'R'
deque.append((idx, 1))
return ''.join(ans)
```
## 2/20/2022
[717. 1比特与2比特字符](https://leetcode-cn.com/problems/1-bit-and-2-bit-characters/)
```java
class Solution {
public boolean isOneBitCharacter(int[] bits) {
int n = bits.length;
int i = 0;
while (i < n - 1) {
if (bits[i] == 1) i += 1;
i += 1;
}
return i == n - 1;
}
}
```
## 2/19/2022
[969. 煎饼排序](https://leetcode-cn.com/problems/pancake-sorting/)
```java
class Solution {
public List<Integer> pancakeSort(int[] arr) {
List<Integer> ans = new ArrayList<>();
int n = arr.length;
for (int last_idx = n - 1; last_idx > 0; last_idx--) {
int idx = last_idx;
int max = arr[last_idx];
for (int i = 0; i < last_idx; i++) {
if (arr[i] > max) {
max = arr[i];
idx = i;
}
}
if (idx == last_idx) continue;
reverse(arr, idx);
reverse(arr, last_idx);
ans.add(idx + 1);
ans.add(last_idx + 1);
}
return ans;
}
private void reverse(int[] arr, int idx) {
int i = 0, j = idx;
while (i < j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i += 1;
j -= 1;
}
}
}
```
## 2/18/2022
```java
class Solution {
public int findCenter(int[][] edges) {
int cand1 = edges[0][0];
int cand2 = edges[0][1];
int cand3 = edges[1][0];
int cand4 = edges[1][1];
if (cand1 == cand3 || cand1 == cand4) {
return cand1;
}
return cand2;
}
}
```
## 2/17/2022
[688. 骑士在棋盘上的概率](https://leetcode-cn.com/problems/knight-probability-in-chessboard/)
```java
class Solution {
public double knightProbability(int n, int k, int row, int column) {
if (k == 0) return 1.0;
double prob[][][] = new double[k + 1][n][n];
int[][] dire = {{-1, 2}, {-1, -2}, {1, 2}, {1, -2}, {-2, 1}, {-2, -1}, {2, -1}, {2, 1}};
for (int step = 0; step <= k; step++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (step == 0) {
prob[step][i][j] = 1.0;
continue;
}
for (int[] d : dire) {
int di = d[0], dj = d[1];
prob[step][i][j] += get(prob, step - 1, i + di, j + dj, n) / 8;
}
}
}
}
return prob[k][row][column];
}
private double get(double prob[][][], int step, int i, int j, int n) {
if (i < 0 || j < 0 || i >= n || j >= n) return 0.0;
return prob[step][i][j];
}
}
```
## 2/15/2022
[1380. 矩阵中的幸运数](https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix/)
```java
class Solution {
public List<Integer> luckyNumbers (int[][] matrix) {
int m = matrix.length, n = matrix[0].length;
List<Integer> ans = new ArrayList<>();
int[] row_min_idx = new int[m];
int[] col_max = new int[n];
for (int i = 0; i < m; i++) {
int min_idx = -1;
int min = Integer.MAX_VALUE;
for (int j = 0; j < n; j++) {
if (matrix[i][j] < min) {
min_idx = j;
min = matrix[i][j];
}
}
row_min_idx[i] = min_idx;
}
for (int i = 0; i < m; i++) {
int col = row_min_idx[i];
int val = matrix[i][col];
if (col_max[col] == 0) {
col_max[col] = getColMax(matrix, col, m);
}
if (val == col_max[col]) {
ans.add(val);
}
}
return ans;
}
int getColMax(int[][] matrix, int col, int m) {
int max = -1;
for (int i = 0; i < m; i++) {
max = Math.max(max, matrix[i][col]);
}
return max;
}
}
```
## 2/13/2022
[1189. “气球” 的最大数量](https://leetcode-cn.com/problems/maximum-number-of-balloons/)
```python
class Solution:
def maxNumberOfBalloons(self, text: str) -> int:
w2idx = dict()
idx = 0
for w in 'abnlo':
w2idx[w] = idx
idx += 1
cnt = [0] * 5
for w in text:
if w in w2idx:
cnt[w2idx[w]] += 1
cnt[w2idx['l']] = cnt[w2idx['l']] // 2
cnt[w2idx['o']] = cnt[w2idx['o']] // 2
return min(cnt)
```
## 2/12/2022
[1020. 飞地的数量](https://leetcode-cn.com/problems/number-of-enclaves/)
```java
class Solution {
boolean visited[][];
public int numEnclaves(int[][] grid) {
int cnt = 0;
int m = grid.length;
int n = grid[0].length;
visited = new boolean[m][n];
for (int j = 0; j < n; j++) {
dfs(grid, 0, j, m, n);
dfs(grid, m - 1, j, m, n);
}
for (int i = 1; i < m - 1; i++) {
dfs(grid, i, 0, m, n);
dfs(grid, i, n - 1, m, n);
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1 && !visited[i][j]) {
cnt += 1;
}
}
}
return cnt;
}
private void dfs(int[][] grid, int i, int j, int m, int n) {
if (i < 0 || j < 0 || i >= m || j >= n) {
return;
}
if (visited[i][j] || grid[i][j] == 0) return;
visited[i][j] = true;
dfs(grid, i - 1, j, m, n);
dfs(grid, i + 1, j, m, n);
dfs(grid, i, j - 1, m, n);
dfs(grid, i, j + 1, m, n);
}
}
```
## 2/11/2022
[1984. 学生分数的最小差值](https://leetcode-cn.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)
```java
class Solution {
public int minimumDifference(int[] nums, int k) {
Arrays.sort(nums);
int i = 0;
int j = i + k - 1;
int min = Integer.MAX_VALUE;
while (j < nums.length) {
min = Math.min(min, nums[j] - nums[i]);
i += 1;
j += 1;
}
return min;
}
}
```
## 2/10/2022
[1447. 最简分数](https://leetcode-cn.com/problems/simplified-fractions/)
+ 辗转相除法求a b的最大公因数gcd
```java
class Solution {
public List<String> simplifiedFractions(int n) {
List<String> ans = new ArrayList<>();
for (int deno = 2; deno <= n; deno++) {
for (int nume = 1; nume < deno; nume++) {
if (gcd(deno, nume) == 1) {
ans.add(nume + "/" + deno);
}
}
}
return ans;
}
private int gcd(int a, int b) {
if (b == 0) return a;
int r = a % b;
if (r == 0) {
return b;
}
return gcd(b, r);
}
}
```
## 2/9/2022
[2006. 差的绝对值为 K 的数对数目](https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k/)
```python
class Solution:
def countKDifference(self, nums: List[int], k: int) -> int:
num_cnt = collections.defaultdict(int)
cnt = 0
for num in nums:
cnt += num_cnt[num - k]
cnt += num_cnt[num + k]
num_cnt[num] += 1
return cnt
```
## 2/8/2022
```python
class Solution:
def gridIllumination(self, n: int, lamps: List[List[int]], queries: List[List[int]]) -> List[int]:
self.dire = ((-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1))
self.n = n
self.row_cnt = collections.defaultdict(int)
self.col_cnt = collections.defaultdict(int)
self.dia_sum_cnt = collections.defaultdict(int)
self.dia_diff_cnt = collections.defaultdict(int)
self.lamp_set = set()
for i, j in lamps:
if (i, j) not in self.lamp_set:
self.lamp_set.add((i, j))
self.row_cnt[i] += 1
self.col_cnt[j] += 1
self.dia_sum_cnt[i + j] += 1
self.dia_diff_cnt[i - j] += 1
ans = [0] * len(queries)
for idx in range(len(queries)):
i, j = queries[idx]
if self.is_open(i, j):
ans[idx] = 1
self.shut_adj(i, j)
return ans
def is_open(self, i, j):
return self.row_cnt[i] > 0 or self.col_cnt[j] > 0 or self.dia_sum_cnt[i + j] > 0 or self.dia_diff_cnt[i - j] > 0
def shut(self, i, j):
if i < 0 or j < 0 or i >= self.n or j >= self.n:
return
if (i, j) not in self.lamp_set:
return
self.lamp_set.remove((i, j))
self.row_cnt[i] -= 1
self.col_cnt[j] -= 1
self.dia_sum_cnt[i + j] -= 1
self.dia_diff_cnt[i - j] -= 1
def shut_adj(self, i, j):
self.shut(i, j)
for di, dj in self.dire:
self.shut(i + di, j + dj)
```
## 2/7/2022
```python
class Solution:
def longestDiverseString(self, a: int, b: int, c: int) -> str:
cnt = [[a, 'a'], [b, 'b'], [c, 'c']]
ans = []
while 1:
cnt = sorted(cnt, key=lambda x : -x[0])
if len(ans) == 0 or ans[-1] != cnt[0][1]:
c, ch = cnt[0]
idx = 0
else:
c, ch = cnt[1]
idx = 1
if idx == 0:
if c == 0:
break
elif c == 1:
ans.append(ch)
cnt[idx][0] -= 1
else:
ans.append(ch)
ans.append(ch)
cnt[idx][0] -= 2
else:
if c == 0:
break
else:
ans.append(ch)
cnt[idx][0] -= 1
return ''.join(ans)
```
# 2/6/2022
[1748. 唯一元素的和](https://leetcode-cn.com/problems/sum-of-unique-elements/)
```python
class Solution:
def sumOfUnique(self, nums: List[int]) -> int:
cnt = collections.defaultdict(int)
ans = 0
for num in nums:
if cnt[num] == 0:
ans += num
cnt[num] += 1
elif cnt[num] == 1:
ans -= num
cnt[num] = -1
return ans
```
## 2/5/2022
[1219. 黄金矿工](https://leetcode-cn.com/problems/path-with-maximum-gold/)
```java
class Solution {
// boolean[][] visited;
int[][] dire = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
public int getMaximumGold(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
// visited = new boolean[m][n];
int max = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j] != 0) {
max = Math.max(max, dfs(grid, i, j, m, n));
}
}
}
return max;
}
private int dfs(int[][] grid, int i, int j, int m, int n) {
if (i < 0 || j < 0 || i >= m || j >= n || grid[i][j] == 0) {
return 0;
}
//visited[i][j] = true;
int copy = grid[i][j];
grid[i][j] = 0;
int max = 0;
for (int[] d : dire) {
int di = d[0], dj = d[1];
int ni = i + di, nj = j + dj;
max = Math.max(max, dfs(grid, ni, nj, m, n));
}
//visited[i][j] = false;
grid[i][j] = copy;
return max + grid[i][j];
}
}
```
## 2/4/2022
[1725. 可以形成最大正方形的矩形数目](https://leetcode-cn.com/problems/number-of-rectangles-that-can-form-the-largest-square/)
```java
class Solution {
public int countGoodRectangles(int[][] rectangles) {
int maxlen = 0;
int cnt = 0;
for (int[] rec : rectangles) {
int len = Math.min(rec[0], rec[1]);
if (len == maxlen) {
cnt += 1;
}else if (len > maxlen) {
maxlen = len;
cnt = 1;
}
}
return cnt;
}
}
```
## 2/3/2022
[1414. 和为 K 的最少斐波那契数字数目](https://leetcode-cn.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/)
```python
class Solution:
def findMinFibonacciNumbers(self, k: int) -> int:
arr = []
a, b = 1, 1
while (b <= k):
arr.append(b)
a, b = b, a + b
cnt = 0
i = len(arr) - 1
while k > 0:
if arr[i] <= k:
k -= arr[i]
cnt += 1
else:
i -= 1
return cnt
```
## 2/2/2022
[2000. 反转单词前缀](https://leetcode-cn.com/problems/reverse-prefix-of-word/)
```java
class Solution {
public String reversePrefix(String word, char ch) {
char[] arr = word.toCharArray();
int n = arr.length;
int j = 0;
while (j < n) {
if (arr[j] == ch) {
break;
}
j += 1;
}
if (j == n) return word;
int i = 0;
while (i < j) {
char temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i += 1;
j -= 1;
}
return new String(arr);
}
}
```
# 1/2022
## 1/31/2022
[1342. 将数字变成 0 的操作次数](https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-to-zero/)
+ 迭代
```python
class Solution:
def numberOfSteps(self, num: int) -> int:
if num == 0:
return 0
if num & 1 == 1:
return 1 + self.numberOfSteps(num - 1)
else:
return 1 + self.numberOfSteps(num // 2)
```
+ 遍历
```java
class Solution {
public int numberOfSteps(int num) {
int step = 0;
while (num != 0) {
step += 1;
if ((num & 1) == 1) {
num -= 1;
}else {
num >>= 1;
}
}
return step;
}
}
```
## 1/30/2022
[884. 两句话中的不常见单词](https://leetcode-cn.com/problems/uncommon-words-from-two-sentences/)
```java
class Solution {
public String[] uncommonFromSentences(String s1, String s2) {
Map<String, Integer> map = new HashMap<>();
String[] arr1 = s1.split(" ");
String[] arr2 = s2.split(" ");
for (String s : arr1) {
map.put(s, map.getOrDefault(s, 0) + 1);
}
for (String s : arr2) {
map.put(s, map.getOrDefault(s, 0) + 1);
}
List<String> ans = new ArrayList<>();
for (String s : map.keySet()) {
if (map.get(s) == 1) {
ans.add(s);
}
}
return ans.toArray(new String[ans.size()]);
}
}
```
## 1/29/2022
[1765. 地图中的最高点](https://leetcode-cn.com/problems/map-of-highest-peak/)
```python
class Solution:
def highestPeak(self, isWater: List[List[int]]) -> List[List[int]]:
self.visited = set()
self.deque = collections.deque()
m, n = len(isWater), len(isWater[0])
height = [[0] * n for _ in range(m)]
# 得从0开始, 把水面点加入 visited 和 deque
for i in range(m):
for j in range(n):
if isWater[i][j] == 1:
self.visited.add((i, j))
self.deque.append((i, j, 0))
while self.deque:
i, j, val = self.deque.popleft()
height[i][j] = val
self.addAdj(i, j, m, n, val + 1)
return height
def addAdj(self, i, j, m, n, val):
# 把 i j 相邻位置加入，应该设置的高度为val
pair = ((i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1))
for x, y in pair:
if (x, y) not in self.visited and 0 <= x < m and 0 <= y < n:
self.visited.add((x, y))
self.deque.append((x, y, val))
```
## 1/28/2022
[1996. 游戏中弱角色的数量](https://leetcode-cn.com/problems/the-number-of-weak-characters-in-the-game/)
+ 先按攻击力从小打到，防御力从到到小
+ 可以避免相同攻击力，防御力小的被记录为弱角色
+ 从后向前遍历，记录最大防御力
```java
class Solution {
public int numberOfWeakCharacters(int[][] properties) {
Comparator<int[]> cmp = new Comparator<>() {
@Override
public int compare(int[] p1, int[] p2) {
if (p1[0] != p2[0]) {
return p1[0] - p2[0];
}
return p2[1] - p1[1];
}
};
Arrays.sort(properties, cmp);
// for (int[] p : properties) {
// System.out.println(Arrays.toString(p));
// }
int cnt = 0;
int maxdef = -1;
for (int i = properties.length - 1; i >= 0; i--) {
int def = properties[i][1];
if (def < maxdef) {
cnt += 1;
}else {
maxdef = def;
}
}
return cnt;
}
}
```
+ cmp to key会显著的慢
```python
class Solution:
def numberOfWeakCharacters(self, properties: List[List[int]]) -> int:
# def cmp(p1, p2):
# if p1[0] != p2[0]:
# return p1[0] - p2[0]
# return p2[1] - p1[1]
properties = sorted(properties, key=lambda x : (x[0], -x[1]))
cnt = 0
maxdef = -1
for _, d in reversed(properties):
if d < maxdef:
cnt += 1
else:
maxdef = d
return cnt
```
## 1/27/2022
[2047. 句子中的有效单词数](https://leetcode-cn.com/problems/number-of-valid-words-in-a-sentence/)
```java
class Solution {
public int countValidWords(String sentence) {
String[] tokens = sentence.split(" ");
System.out.println(Arrays.toString(tokens));
int cnt = 0;
for (String token : tokens) {
cnt += isValid(token);
}
return cnt;
}
private int isValid(String token) {
if (token.length() == 0) return 0;
int j = token.length() - 1;
if (isMark(token.charAt(j))) {
j -= 1;
}
if (j < 0) return 1;
if (token.charAt(0) == '-' || token.charAt(j) == '-') return 0;
int dash = 0;
for (int i = 0; i <= j; i++) {
char ch = token.charAt(i);
if (ch == '-') {
dash += 1;
if (dash > 1) return 0;
}
if (Character.isDigit(ch) || isMark(ch)) return 0;
}
return 1;
}
private boolean isMark(char s) {
if (s == '!' || s == '.' || s == ',') return true;
return false;
}
}
```
## 1/26/2022
[2013. 检测正方形](https://leetcode-cn.com/problems/detect-squares/)
```java
class DetectSquares {
Map<Integer, Map<Integer, Integer>> cnt;
public DetectSquares() {
cnt = new HashMap<>();
}
public void add(int[] point) {
int x = point[0], y = point[1];
if (!cnt.containsKey(x)) {
cnt.put(x, new HashMap<>());
}
Map<Integer, Integer> row = cnt.get(x);
row.put(y, 1 + row.getOrDefault(y, 0));
}
public int count(int[] point) {
int ans = 0;
int r = point[0], c1 = point[1];
if (!cnt.containsKey(r)) return 0;
Set<Integer> colset = cnt.get(r).keySet();
if (colset == null) return 0;
for (int c2 : colset) {
if (c2 != c1) {
int num = getCnt(r, c2);
int l = Math.abs(c1 - c2);
ans += num * getCnt(r - l, c1) * getCnt(r - l, c2);
ans += num * getCnt(r + l, c1) * getCnt(r + l, c2);
}
}
return ans;
}
int getCnt(int r, int c) {
if (!cnt.containsKey(r)) return 0;
return cnt.get(r).getOrDefault(c, 0);
}
// String toString(int x, int y) {
// return x + "," + y;
// }
}
```
## 1/25/2022
[1688. 比赛中的配对次数](https://leetcode-cn.com/problems/count-of-matches-in-tournament/)
```java
class Solution {
public int numberOfMatches(int n) {
int ans = 0;
while (n > 1) {
ans += n >> 1;
n = (n >> 1) + (n & 1);
}
return ans;
}
}
```
## 1/23/2022
[2034. 股票价格波动](https://leetcode-cn.com/problems/stock-price-fluctuation/)
+ treemap
```java
class StockPrice {
int maxtimestap;
Map<Integer, Integer> time2price;
TreeMap<Integer, Integer> pricecnt;
public StockPrice() {
maxtimestap = 0;
time2price = new HashMap<>();
pricecnt = new TreeMap<>();
}
public void update(int timestamp, int price) {
maxtimestap = Math.max(maxtimestap, timestamp);
int oldprice = time2price.getOrDefault(timestamp, -1);
time2price.put(timestamp, price);
if (oldprice != -1) {
pricecnt.put(oldprice, pricecnt.get(oldprice) - 1);
if (pricecnt.get(oldprice) == 0) {
pricecnt.remove(oldprice);
}
}
pricecnt.put(price, pricecnt.getOrDefault(price, 0) + 1);
}
public int current() {
return time2price.get(maxtimestap);
}
public int maximum() {
return pricecnt.lastKey();
}
public int minimum() {
return pricecnt.firstKey();
}
}
```
## 1/22/2022
[1332. 删除回文子序列](https://leetcode-cn.com/problems/remove-palindromic-subsequences/)
+ 只有 a b
+ 本身是回文串则删除一次
+ 否则所有a组成回文，所有b组成，删除两次
```java
class Solution {
public int removePalindromeSub(String s) {
int i = 0, j = s.length() - 1;
while (i < j) {
if (s.charAt(i) != s.charAt(j)) {
return 2;
}
i += 1;
j -= 1;
}
return 1;
}
}
```
## 1/21/2022
[1345. 跳跃游戏 IV](https://leetcode-cn.com/problems/jump-game-iv/)
```java
class Solution {
public int minJumps(int[] arr) {
//if (arr.length == 1) return 0;
Set<Integer> visited = new HashSet<>();
Map<Integer, List<Integer>> val2idx = new HashMap<>();
Deque<Integer> deque = new LinkedList<>();
deque.add(0);
visited.add(0);
int n = arr.length;
int step = 0;
for (int i = 0; i < n; i++) {
int val = arr[i];
if (!val2idx.containsKey(val)) {
val2idx.put(val, new ArrayList<>());
}
val2idx.get(val).add(i);
}
//System.out.println(val2idx.toString());
while (!deque.isEmpty()) {
int l = deque.size();
for (int i = 0; i < l; i++) {
int idx = deque.removeFirst();
if (idx == n - 1) return step;
if (idx - 1 >= 0 && !visited.contains(idx - 1)) {
deque.add(idx - 1);
visited.add(idx - 1);
}
if (idx + 1 < n && !visited.contains(idx + 1)) {
deque.add(idx + 1);
visited.add(idx + 1);
}
if (val2idx.containsKey(arr[idx])) {
for (int next : val2idx.get(arr[idx])) {
if (!visited.contains(next)) {
deque.add(next);
visited.add(next);
}
}
val2idx.remove(arr[idx]);
}
}
step += 1;
}
return -1;
}
}
```
## 1/19/2022
[219. 存在重复元素 II](https://leetcode-cn.com/problems/contains-duplicate-ii/)
```java
class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
Set<Integer> set = new HashSet<>();
for (int i = 0; i < nums.length; i++) {
int num = nums[i];
if (set.contains(num)) return true;
set.add(num);
if (i - k >= 0) {
set.remove(nums[i - k]);
}
}
return false;
}
}
```
## 1/18/2022
[539. 最小时间差](https://leetcode-cn.com/problems/minimum-time-difference/)
```java
class Solution {
public int findMinDifference(List<String> timePoints) {
if (timePoints.size() >= 1440) return 0;
int min_diff = 1440;
List<Integer> minutes = new ArrayList<>();
for (String t : timePoints) {
minutes.add(minute(t));
}
Collections.sort(minutes);
minutes.add(1440 + minutes.get(0));
for (int i = 1; i < minutes.size(); i++) {
min_diff = Math.min(min_diff, minutes.get(i) - minutes.get(i - 1));
}
return min_diff;
}
int minute(String t) {
int h = Integer.parseInt(t.substring(0, 2));
int m = Integer.parseInt(t.substring(3));
return h * 60 + m;
}
}
```
## 1/16/2022
[1220. 统计元音字母序列的数目](https://leetcode-cn.com/problems/count-vowels-permutation/)
```python
class Solution:
def countVowelPermutation(self, n: int) -> int:
M = 1000000007
a, e, i, o, u = 1, 1, 1, 1, 1
for _ in range(n - 1):
ta = e + i + u
te = a + i
ti = e + o
to = i
tu = i + o
a = ta % M
e = te % M
i = ti % M
o = to % M
u = tu % M
return (a + e + i + o + u) % M
```
## 1/15/2022
[1716. 计算力扣银行的钱](https://leetcode-cn.com/problems/calculate-money-in-leetcode-bank/)
```python
class Solution:
def totalMoney(self, n: int) -> int:
week = n // 7
day = n % 7
week_sum = (28 + (28 + 7 * (week - 1))) * week // 2
day_sum = day * (day + 1) // 2 + week * day
return week_sum + day_sum
```
## 1/14/2022
[373. 查找和最小的K对数字](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums/)
```java
class Solution {
public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) {
List<List<Integer>> ans = new ArrayList<>();
int n = nums1.length, m = nums2.length;
PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
return nums1[o1[0]] + nums2[o1[1]] - nums1[o2[0]] - nums2[o2[1]];
}
});
for (int i = 0; i < n; i++) {
pq.add(new int[]{i, 0});
}
while (k-- > 0 && !pq.isEmpty()) {
int[] first = pq.poll();
int i = first[0], j = first[1];
List<Integer> pair = Arrays.asList(nums1[i], nums2[j]);
ans.add(pair);
if (j + 1 < m) {
pq.add(new int[]{i, j + 1});
}
}
return ans;
}
}
```
## 1/13/2022
[47. 至少是其他数字两倍的最大数](https://leetcode-cn.com/problems/largest-number-at-least-twice-of-others/)
```java
class Solution {
public int dominantIndex(int[] nums) {
if (nums.length == 1) return 0;
int fir_idx = 0;
int sec_idx = 1;
if (nums[0] < nums[1]) {
fir_idx = 1;
sec_idx = 0;
}
for (int i = 2; i < nums.length; i++) {
if (nums[i] > nums[fir_idx]) {
sec_idx = fir_idx;
fir_idx = i;
}else if (nums[i] > nums[sec_idx]) {
sec_idx = i;
}
}
if (nums[fir_idx] >= 2 * nums[sec_idx]) {
return fir_idx;
}
return -1;
}
}
```
## 1/12/2022
[334. 递增的三元子序列](https://leetcode-cn.com/problems/increasing-triplet-subsequence/)
+ 判断当前的数之前以后没有比它更小的数，称为第二大数，需要维护一个min_val
+ 维护当前最小的第二大数
```java
class Solution {
public boolean increasingTriplet(int[] nums) {
if (nums.length < 3) return false;
int n = nums.length;
int min_val = Integer.MAX_VALUE;
int min_sec = Integer.MAX_VALUE;
for (int val : nums) {
// 判断val是否> min_sec
if (val > min_sec) return true;
// 更新
if (val > min_val && val < min_sec) {
min_sec = val;
}
min_val = Math.min(min_val, val);
}
return false;
}
}
```
## 1/10/2022
[306. 累加数](https://leetcode-cn.com/problems/additive-number/)
```python
class Solution:
def isAdditiveNumber(self, num: str) -> bool:
self.num = num
if len(num) < 3:
return False
for i in range(len(self.num) // 2):
fir = int(self.num[:i + 1])
for j in range(i + 1, len(self.num) - 1):
sec = int(self.num[i + 1: j + 1])
if self.isValid(fir, sec, j + 1):
return True
if self.num[i + 1] == "0":
break
if self.num[0] == "0":
break
return False
def isValid(self, fir: int, sec: int, start):
if start == len(self.num):
return True
third = str(fir + sec)
if len(third) > len(self.num) - start:
return False
for i in range(len(third)):
if third[i] != self.num[start]:
return False
start += 1
return self.isValid(sec, fir + sec, start)
```
## 1/9/2022
[1629. 按键持续时间最长的键](https://leetcode-cn.com/problems/slowest-key/)
```java
class Solution {
public char slowestKey(int[] releaseTimes, String keysPressed) {
char max_key = keysPressed.charAt(0);
int max_time = releaseTimes[0];
for (int i = 1; i < keysPressed.length(); i++) {
char key = keysPressed.charAt(i);
int time = releaseTimes[i] - releaseTimes[i - 1];
if (time > max_time || (time == max_time && key > max_key)) {
max_key = key;
max_time = time;
}
}
return max_key;
}
}
```
```python
class Solution:
def slowestKey(self, releaseTimes: List[int], keysPressed: str) -> str:
max_key = keysPressed[0]
max_time = releaseTimes[0]
for i in range(1, len(releaseTimes)):
key = keysPressed[i]
time = releaseTimes[i] - releaseTimes[i - 1]
if time > max_time or (time == max_time and key > max_key):
max_key = key
max_time = time
return max_key
```
## 1/8/2022
[89. 格雷编码](https://leetcode-cn.com/problems/gray-code/)
+ 设 n 阶格雷码集合为 G(n)，其中数字为n-1位二进制表示
+ 将G(n)反转，每个数最前面加上二进制1，放在G(n)后面得到G(n+1)
```java
class Solution {
public List<Integer> grayCode(int n) {
List<Integer> code = new ArrayList<>();
code.add(0);
code.add(1);
int add = 2;
for (int l = 0; l < n - 1; l++) {
int i = code.size() - 1;
while (i >= 0) {
int val = code.get(i);
code.add(val + add);
i -= 1;
}
add = add << 1;
}
return code;
}
}
```
**Python**
```python
class Solution:
def grayCode(self, n: int) -> List[int]:
code = [0, 1]
add = 2
for _ in range(n - 1):
for val in reversed(code):
code.append(val + add)
add = add << 1
return code
```
## 1/7/2022
[1614. 括号的最大嵌套深度](https://leetcode-cn.com/problems/maximum-nesting-depth-of-the-parentheses/)
```java
class Solution {
public int maxDepth(String s) {
Deque<Integer> stack = new LinkedList<>();
int max_dep = 0;
for (int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if (ch == '(') {
stack.add(0);
}
if (ch == ')') {
int dep = stack.removeLast() + 1;
if (stack.isEmpty()) {
max_dep = Math.max(max_dep, dep);
}else {
stack.add(Math.max(stack.removeLast(), dep));
}
}
}
return max_dep;
}
}
```
```java
class Solution {
public int maxDepth(String s) {
int max_dep = 0;
int dep = 0;
for (int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if (ch == '(') {
dep += 1;
}
if (ch == ')') {
dep -= 1;
}
max_dep = Math.max(max_dep, dep);
}
return max_dep;
}
}
```
## 1/6/2022
[71. 简化路径](https://leetcode-cn.com/problems/simplify-path/)
```java
class Solution {
public String simplifyPath(String path) {
LinkedList<String> stack = new LinkedList<>();
StringBuilder s = new StringBuilder();
path = path + "/";
for (int i = 0; i < path.length(); i++) {
char ch = path.charAt(i);
if (ch == '/') {
if (s.length() == 0) continue;
String dirc = s.toString();
s = new StringBuilder();
if (dirc.equals(".")) {
//pass
}else if (dirc.equals("..")) {
if (!stack.isEmpty()) {
stack.removeLast();
}
}else {
stack.add(dirc);
}
}else {
s.append(ch);
}
}
//System.out.println(stack.toString());
return "/" + String.join("/", stack);
}
}
```
```python
class Solution:
def simplifyPath(self, path: str) -> str:
step = path.split('/')
stack = []
for s in step:
if len(s) == 0:
continue
if s == '.':
pass
elif s == '..':
if stack:
stack.pop()
else:
stack.append(s)
return '/' + '/'.join(stack)
```
## 1/5/2022
[1576. 替换所有的问号](https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)
```java
class Solution {
public String modifyString(String s) {
StringBuilder ans = new StringBuilder(s);
char left, right;
for (int i = 0; i < ans.length(); i++) {
if (ans.charAt(i) != '?') {
continue;
}
if (i == 0) {
left = '?';
}else {
left = ans.charAt(i - 1);
}
if (i == ans.length() - 1) {
right = '?';
}else {
right = ans.charAt(i + 1);
}
ans.setCharAt(i, getchar(left, right));
}
return ans.toString();
}
char getchar(char left, char right) {
char ch = 'a';
for (int i = 0; i < 26; i++) {
if (ch != left && ch != right) {
return ch;
}
ch = (char) (ch + 1);
}
return ' ';
}
}
```
## 1/2/2022
[390. 消除游戏](https://leetcode-cn.com/problems/elimination-game/)
```java
class Solution {
public int lastRemaining(int n) {
if (n == 1) return 1;
int pre = n / 2;
return 2 * (pre - lastRemaining(pre) + 1);
}
}
```
```python
class Solution:
def lastRemaining(self, n: int) -> int:
a1 = 1
an = n
step = 1
while a1 != an:
# print(a1, an)
temp = a1
k = (an - a1) // step + 1
if k & 1 == 1:
a1 = an - step
else:
a1 = an
an = temp + step
step *= -2
return a1
```
## 1/1/2022
[2022. 将一维数组转变成二维数组](https://leetcode-cn.com/problems/convert-1d-array-into-2d-array/)
+ Arrays.copyOfRange
```java
class Solution {
public int[][] construct2DArray(int[] original, int m, int n) {
int L = original.length;
if (m * n != L) return new int[0][];
int[][] ans = new int[m][n];
int i = 0;
int start = 0;
while (i < m) {
ans[i] = Arrays.copyOfRange(original, start, start + n);
i += 1;
start = start + n;
}
return ans;
}
}
```
+ 直接计算小标i对应的二维下标
```java
class Solution {
public int[][] construct2DArray(int[] original, int m, int n) {
int L = original.length;
if (m * n != L) return new int[0][];
int[][] ans = new int[m][n];
for (int idx = 0; idx < L; idx ++) {
int i = idx / n;
int j = idx % n;
ans[i][j] = original[idx];
}
return ans;
}
}
```
---
# 12/2021
## 12/31/2021
[507. 完美数](https://leetcode-cn.com/problems/perfect-number/)
```java
class Solution {
public boolean checkPerfectNumber(int num) {
if (num == 1) return false;
int sum = 1;
int up = (int)Math.sqrt(num + 1);
for (int i = 2; i <= up; i++) {
int j = num / i;
if (i * j == num) {
if (i < j) {
sum += i;
sum += j;
}
if (i == j) {
sum += i;
}
}
}
return sum == num;
}
}
```
## 12/30/2021
[846. 一手顺子](https://leetcode-cn.com/problems/hand-of-straights/)
```python
class Solution:
def isNStraightHand(self, hand: List[int], groupSize: int) -> bool:
if groupSize == 1:
return True
if len(hand) % groupSize != 0:
return False
cnt = collections.defaultdict(int)
for x in hand:
cnt[x] += 1
hand = [x for x in cnt]
hand = sorted(hand)
i = 0
while i < len(hand):
# 找到起始数字
start = hand[i]
if cnt[start] == 0:
i += 1
continue
# 判断是否能组成顺子
for j in range(start, start + groupSize):
if cnt[j] == 0:
return False
cnt[j] -= 1
return True
```
## 12/29/2021
[1995. 统计特殊四元组](https://leetcode-cn.com/problems/count-special-quadruplets/)
```python
class Solution:
def countQuadruplets(self, nums: List[int]) -> int:
hmap = collections.defaultdict(int)
n = len(nums)
ans = 0
for c in range(n - 2, 1, -1):
for d in range(c + 1, n):
hmap[nums[d] - nums[c]] += 1
b = c - 1
for a in range(b):
ans += hmap[nums[a] + nums[b]]
return ans
```
## 12/28/2021
[472. 连接词](https://leetcode-cn.com/problems/concatenated-words/)
```python
class Trie:
def __init__(self):
# 保存子节点，小写字母情况下最多26个，可以用数组模拟
self.children = dict()
# 记录该节点 是否作为一个字符串的结束
self.isEnd = False
def insert(self, word: str) -> None:
"""Inserts a word into the trie.
"""
node = self
for ch in word:
# 存在则不操作，不存在则设置一个新节点
node.children.setdefault(ch, Trie())
# 继续向下，插入新的字符
node = node.children[ch]
node.isEnd = True
def DFS(self, word, start):
if start == len(word):
return True
node = self
for i in range(start, len(word)):
next_node = node.children.get(word[i], None)
if next_node is None:
return False
if next_node.isEnd:
if self.DFS(word, i + 1):
return True
node = next_node
return False
class Solution:
def findAllConcatenatedWordsInADict(self, words: List[str]) -> List[str]:
words.sort(key=len)
myTrie = Trie()
ans = []
for w in words:
if w == '':
continue
if myTrie.DFS(w, 0):
ans.append(w)
else:
myTrie.insert(w)
return ans
```
## 12/27/2021
[825. 适龄的朋友](https://leetcode-cn.com/problems/friends-of-appropriate-ages/)
```python
class Solution:
def numFriendRequests(self, ages: List[int]) -> int:
ages = sorted(ages)
ans = 0
for x in ages:
left = 0.5 * x + 7
right = x
cnt = self.bisec(ages, right) - self.bisec(ages, left)
if x > 14:
cnt -= 1
ans += max(0, cnt)
return ans
def bisec(self, arr, x):
lo = 0
hi = len(arr)
while lo < hi:
mid = (lo + hi) // 2
if arr[mid] <= x:
lo = mid + 1
else:
hi = mid
return lo
```
```python
class Solution:
def numFriendRequests(self, ages: List[int]) -> int:
cnt = [0] * 121
for age in ages:
cnt[age] += 1
presum = [0] * 121
for i in range(1, 121):
presum[i] = presum[i - 1] + cnt[i]
ans = 0
for age in ages:
if age <= 14:
continue
lo = int(0.5 * age + 7) + 1
ans += presum[age] - presum[lo - 1] - 1
return ans
```
## 12/26/2021
[1078. Bigram 分词](https://leetcode-cn.com/problems/occurrences-after-bigram/)
```python
class Solution:
def findOcurrences(self, text: str, first: str, second: str) -> List[str]:
lst = text.split(' ')
n = len(lst)
fir_idx = []
sec_idx = []
ans = []
for i, word in enumerate(lst):
if word == first:
fir_idx.append(i)
if word == second:
sec_idx.append(i)
i = 0
j = 0
while i < len(fir_idx) and j < len(sec_idx):
idx1 = fir_idx[i]
idx2 = sec_idx[j]
if idx1 + 1 == idx2:
if idx2 + 1 < n:
ans.append(lst[idx2 + 1])
i += 1
j += 1
elif idx1 < idx2:
i += 1
elif idx1 >= idx2:
j += 1
return ans
```
## 12/25/2021
[1609. 奇偶树](https://leetcode-cn.com/problems/even-odd-tree/)
```python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def isEvenOddTree(self, root: Optional[TreeNode]) -> bool:
queue = collections.deque()
queue.append(root)
level = 0
while queue:
layer = []
for _ in range(len(queue)):
node = queue.popleft()
layer.append(node.val)
if node.left is not None:
queue.append(node.left)
if node.right is not None:
queue.append(node.right)
if not self.is_valid(layer, level):
return False
level += 1
return True
def is_valid(self, layer, level):
if level % 2 == 0:
sign = 1
resi = 1
else:
sign = -1
resi = 0
pre = layer[0]
if pre % 2 != resi:
return False
for i in range(1, len(layer)):
cur = layer[i]
if cur % 2 != resi:
return False
if (cur - pre) * sign <= 0:
return False
pre = cur
return True
```
## 12/24/2021
[1705. 吃苹果的最大数目](https://leetcode-cn.com/problems/maximum-number-of-eaten-apples/)
```python
class Solution:
def eatenApples(self, apples: List[int], days: List[int]) -> int:
apple_cnt = collections.defaultdict(int)
pq = []
day = 1
ans = 0
for i in range(len(apples)):
# print(apple_cnt)
app = apples[i]
ds = days[i]
while pq and pq[0] <= day:
heapq.heappop(pq)
if app != 0:
apple_cnt[day + ds] += app
heapq.heappush(pq, day + ds)
if len(pq) > 0:
apple_cnt[pq[0]] -= 1
ans += 1
if apple_cnt[pq[0]] == 0:
heapq.heappop(pq)
day += 1
# print(ans)
while pq:
while pq and pq[0] <= day:
heapq.heappop(pq)
if len(pq) > 0:
apple_cnt[pq[0]] -= 1
ans += 1
if apple_cnt[pq[0]] == 0:
heapq.heappop(pq)
day += 1
return ans
```
## 12/22/2021
[686. 重复叠加字符串匹配](https://leetcode-cn.com/problems/repeated-string-match/)
```python
class Solution:
def repeatedStringMatch(self, a: str, b: str) -> int:
k = len(b) // len(a)
if len(b) % len(a) != 0:
k += 1
if self.is_sub(a * k, b):
return k
if self.is_sub(a * (k + 1), b):
return k + 1
return -1
def is_sub(self, ss, s):
i = 0
j = len(s) - 1
while j < len(ss):
if hash(ss[i: j + 1]) == hash(s):
return True
i += 1
j += 1
return False
```
## 12/20/2021
[475. 供暖器](https://leetcode-cn.com/problems/heaters/)
+ 二分查找距离最近的值
**Java**
```java
class Solution {
public int findRadius(int[] houses, int[] heaters) {
int ans = 0;
Arrays.sort(heaters);
int n = heaters.length;
for (int val : houses) {
int min_dist;
int idx = bisect(heaters, val);
if (idx == 0) {
min_dist = heaters[0] - val;
}else if (idx == n) {
min_dist = val - heaters[n - 1];
}else {
int l = val - heaters[idx - 1];
int r = heaters[idx] - val;
min_dist = Math.min(l, r);
}
ans = Math.max(ans, min_dist);
}
return ans;
}
int bisect(int[] arr, int value) {
int le = 0, ri = arr.length;
while (le < ri) {
int mid = (le + ri) / 2;
if (arr[mid] <= value) {
le = mid + 1;
}else {
ri = mid;
}
}
return le;
}
}
```
**Python**
```python
class Solution:
def findRadius(self, houses: List[int], heaters: List[int]) -> int:
heaters = sorted(heaters)
ans = 0
for val in houses:
idx = bisect.bisect(heaters, val)
if idx == 0:
min_dist = heaters[0] - val
elif idx == len(heaters):
min_dist = val - heaters[-1]
else:
min_dist = min(val - heaters[idx - 1], heaters[idx] - val)
ans = max(ans, min_dist)
return ans
```
## 12/19/2021
[997. 找到小镇的法官](https://leetcode-cn.com/problems/find-the-town-judge/)
+ JAVA
```java
class Solution {
public int findJudge(int n, int[][] trust) {
int[] trust_others = new int[n + 1];
int[] trusted = new int[n + 1];
for (int i = 0; i < trust.length; i++) {
int a = trust[i][0];
int b = trust[i][1];
trust_others[a] = 1;
trusted[b] += 1;
}
for (int i = 1; i < n + 1; i++) {
if (trusted[i] == n - 1 && trust_others[i] == 0) {
return i;
}
}
return -1;
}
}
```
+ Python
```python
class Solution:
def findJudge(self, n: int, trust: List[List[int]]) -> int:
trust_other = [0] * (n + 1)
trusted = [0] * (n + 1)
for a, b in trust:
trust_other[a] = 1
trusted[b] += 1
for i in range(1, n + 1):
if trusted[i] == n - 1 and trust_other[i] == 0:
return i
return -1
```
## 12/18/2021
[419. 甲板上的战舰](https://leetcode-cn.com/problems/battleships-in-a-board/)
+ python
```python
class Solution:
def countBattleships(self, board: List[List[str]]) -> int:
ans = 0
m, n = len(board), len(board[0])
for i in range(m):
for j in range(n):
if board[i][j] != 'X':
continue
if self.get(i - 1, j, board) != 'X' and self.get(i, j - 1, board) != 'X':
ans += 1
return ans
def get(self, i, j, board):
if i < 0 or j < 0:
return '.'
else:
return board[i][j]
```
+ JAVA
```java
class Solution {
char[][] board;
public int countBattleships(char[][] board) {
this.board = board;
int m = board.length;
int n = board[0].length;
int ans = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (board[i][j] != 'X') {
continue;
}
if (get(i - 1, j) != 'X' && get(i, j - 1) != 'X') {
ans += 1;
}
}
}
return ans;
}
char get(int i, int j) {
if (i < 0 || j < 0) {
return '.';
}else {
return board[i][j];
}
}
}
```
## 12/17/2021
[1518. 换酒问题](https://leetcode-cn.com/problems/water-bottles/)
+ Python
```python
class Solution:
def numWaterBottles(self, numBottles: int, numExchange: int) -> int:
ans = 0
empty = 0
while numBottles != 0:
ans += numBottles
empty += numBottles
numBottles = empty // numExchange
empty = empty % numExchange
return ans
```
+ C++
```c++
class Solution {
public:
int numWaterBottles(int numBottles, int numExchange) {
int ans = numBottles;
int empty = numBottles;
while (empty >= numExchange) {
int temp = empty / numExchange;
ans += temp;
empty = empty % numExchange + temp;
}
return ans;
}
};
```
## 12/15/2021
[851. 喧闹和富有](https://leetcode-cn.com/problems/loud-and-rich/)
```python
class Solution:
def loudAndRich(self, richer: List[List[int]], quiet: List[int]) -> List[int]:
n = len(quiet)
hmap = dict()
for x, y in richer:
hmap.setdefault(y, []).append(x)
self.ans = [-1] * n
for i in range(n):
self.DFS(i, hmap, quiet)
return self.ans
def DFS(self, i, hmap, quiet):
if self.ans[i] != -1:
return
candi = i
for idx in hmap.get(i, []):
self.DFS(idx, hmap, quiet)
if quiet[self.ans[idx]] < quiet[candi]:
candi = self.ans[idx]
self.ans[i] = candi
return
```
## 12/14/2021
[630. 课程表 III](https://leetcode-cn.com/problems/course-schedule-iii/)
```python
class Solution:
def scheduleCourse(self, courses: List[List[int]]) -> int:
courses = sorted(courses, key=lambda x: x[1])
heap = []
days = 0
ans = 0
for c in courses:
d, last = c
if days + d <= last:
days += d
ans += 1
heapq.heappush(heap, -d)
else:
if len(heap) == 0:
continue
dmax = -heap[0]
if dmax > d:
heapq.heappop(heap)
heapq.heappush(heap, -d)
days += (d - dmax)
return ans
```
## 12/13/2021
[807. 保持城市天际线](https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline/)
```python
class Solution:
def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int:
n = len(grid)
ans = 0
row_max = [0] * n
col_max = [0] * n
for r in range(n):
for c in range(n):
val = grid[r][c]
row_max[r] = max(row_max[r], val)
col_max[c] = max(col_max[c], val)
for r in range(n):
for c in range(n):
ans += min(row_max[r], col_max[c]) - grid[r][c]
return ans
```
## 12/12/2021
[709. 转换成小写字母](https://leetcode-cn.com/problems/to-lower-case/)
+ 大写字母 A - Z的 ASCII 码范围为[65,90]
+ 小写字母 a - z的 ASCII 码范围为[97,122]
+ 相差32
```python
class Solution:
def toLowerCase(self, s: str) -> str:
ans = []
for ch in s:
asc = ord(ch)
if asc <= 90 and asc >= 65:
ch = chr(asc + 32)
ans.append(ch)
return ''.join(ans)
```
## 12/11/2021
[911. 在线选举](https://leetcode-cn.com/problems/online-election/)
```python
class TopVotedCandidate:
def __init__(self, persons: List[int], times: List[int]):
votes = {}
top = None
max_vote = 0
tops = []
for p in persons:
votes.setdefault(p, 0)
votes[p] += 1
if votes[p] >= max_vote:
max_vote = votes[p]
top = p
tops.append(top)
self.times = times
self.tops = tops
def q(self, t: int) -> int:
lo, hi = 0, len(self.times)
while lo < hi:
mid = (lo + hi) // 2
if t >= self.times[mid]:
lo = mid + 1
else:
hi = mid
return self.tops[lo - 1]
# Your TopVotedCandidate object will be instantiated and called as such:
# obj = TopVotedCandidate(persons, times)
# param_1 = obj.q(t)
```
## 12/10/2021
[748. 最短补全词](https://leetcode-cn.com/problems/shortest-completing-word/)
```python
class Solution:
def shortestCompletingWord(self, licensePlate: str, words: List[str]) -> str:
cnt_lic = [0] * 26
for s in licensePlate:
s = s.lower()
idx = ord(s) - ord('a')
if idx >= 0 and idx <= 25:
cnt_lic[idx] += 1
# print(cnt_lic)
ans = ''
min_len = 100
for word in words:
if len(word) >= min_len:
continue
if self.is_comp(word, cnt_lic):
ans = word
min_len = len(ans)
return ans
def is_comp(self, word, cnt_lic):
cnt_word = [0] * 26
for s in word:
idx = ord(s) - ord('a')
cnt_word[idx] += 1
for i in range(26):
if cnt_lic[i] != 0 and cnt_word[i] < cnt_lic[i]:
return False
return True
```
## 12/9/2021
[794. 有效的井字游戏](https://leetcode-cn.com/problems/valid-tic-tac-toe-state/)
```python
class Solution:
def validTicTacToe(self, board: List[str]) -> bool:
cnt1, cnt2 = 0, 0
for r in range(3):
for c in range(3):
if board[r][c] == ' ':
continue
if board[r][c] == 'O':
cnt2 += 1
else:
cnt1 += 1
if cnt1 != cnt2 and cnt1 - 1 != cnt2:
return False
win1, win2 = 0, 0
for i in range(3):
if board[i][0] == board[i][1] and board[i][1] == board[i][2]:
if board[i][0] == 'X':
win1 += 1
if board[i][0] == 'O':
win2 += 1
if board[0][i] == board[1][i] and board[1][i] == board[2][i]:
# print(board[0][i], board[1][i], board[2][i])
if board[0][i] == 'X':
win1 += 1
if board[0][i] == 'O':
win2 += 1
# print(win1, win2)
if board[0][0] == board[1][1] == board[2][2]:
if board[0][0] == 'X':
win1 += 1
if board[0][0] == 'O':
win2 += 1
if board[0][2] == board[1][1] == board[2][0]:
if board[0][2] == 'X':
win1 += 1
if board[0][2] == 'O':
win2 += 1
# print(win1, win2)
if win1 != 0 and win2 != 0:
return False
if win1 != 0 and cnt1 == cnt2:
return False
if win2 != 0 and cnt1 != cnt2:
return False
return True
```
## 12/6/2021
[1816. 截断句子](https://leetcode-cn.com/problems/truncate-sentence/)
```python
class Solution:
def truncateSentence(self, s: str, k: int) -> str:
s += ' '
ans = []
word = ''
for c in s:
if k == 0:
break
if c == ' ':
ans.append(word)
word = ''
k -= 1
else:
word += c
return ' '.join(ans)
```
+ 数空格
```python
class Solution:
def truncateSentence(self, s: str, k: int) -> str:
# 数空格
s += ' '
for i in range(len(s)):
c = s[i]
if c == ' ':
k -= 1
if k == 0:
break
return s[:i]
```
## 12/4/2021
[383. 赎金信](https://leetcode-cn.com/problems/ransom-note/)
```python
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
mag_cnt = collections.defaultdict(int)
for s in magazine:
mag_cnt[s] += 1
for s in ransomNote:
mag_cnt[s] -= 1
if mag_cnt[s] < 0:
return False
return True
```
## 12/2/2021
[506. 相对名次](https://leetcode-cn.com/problems/relative-ranks/)
```python
class Solution:
def findRelativeRanks(self, score: List[int]) -> List[str]:
n = len(score)
ans = [''] * n
idx_sorted = list(range(n))
idx_sorted = sorted(idx_sorted, key=lambda i: score[i], reverse=True)
for i in range(n):
medal = str(i + 1)
if i == 0:
medal = 'Gold Medal'
elif i == 1:
medal = 'Silver Medal'
elif i == 2:
medal = 'Bronze Medal'
ans[idx_sorted[i]] = medal
return ans
```
## 12/1/2021
[1446. 连续字符](https://leetcode-cn.com/problems/consecutive-characters/)
```python
class Solution:
def maxPower(self, s: str) -> int:
s += '#'
char = s[0]
max_len = 1
i, j = 0, 0
while j < len(s) - 1:
j = j + 1
if s[j] != char:
max_len = max(max_len, j - i)
char = s[j]
i = j
return max_len
```
# 11/2021
## 11/30/2021
[400. 第 N 位数字](https://leetcode-cn.com/problems/nth-digit/)
```python
class Solution:
def findNthDigit(self, n: int) -> int:
s = 0
m = 1
while m < 100:
if s < n <= s + 9 * (10 ** (m-1)) * m:
break
else:
s += 9 * (10 ** (m-1)) * m
m += 1
# 是m位数
#再确定是m位数中的第几个
T = n - s
if T % m == 0:
number = int(T/m)
else:
number = int(T/m) + 1
#计算第number个m位数是几
X = 10 ** (m - 1) + number - 1
#是X的第几位
X = str(X)
dig = T % m
return int(X[dig - 1])
```
## 11/29/2021
[786. 第 K 个最小的素数分数](https://leetcode-cn.com/problems/k-th-smallest-prime-fraction/)
+ 官方方法二：优先队列
```python
class Frac:
def __init__(self, idx: int, idy: int, x: int, y: int) -> None:
self.idx = idx
self.idy = idy
self.x = x
self.y = y
def __lt__(self, other: "Frac") -> bool:
return self.x * other.y < self.y * other.x
class Solution:
def kthSmallestPrimeFraction(self, arr: List[int], k: int) -> List[int]:
n = len(arr)
q = [Frac(0, i, arr[0], arr[i]) for i in range(1, n)]
heapq.heapify(q)
for _ in range(k - 1):
frac = heapq.heappop(q)
i, j = frac.idx, frac.idy
if i + 1 < j:
heapq.heappush(q, Frac(i + 1, j, arr[i + 1], arr[j]))
frac = heapq.heappop(q)
return [frac.x, frac.y]
```
## 11/28/2021
[438. 找到字符串中所有字母异位词](https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/)
+ 双指针表示范围
+ diff维护差异
```python
class Solution:
def findAnagrams(self, s: str, p: str) -> List[int]:
if len(s) < len(p):
return []
ans = []
len_s, len_p = len(s), len(p)
cnt = [0] * 26
for i in range(len_p):
cnt[ord(p[i]) - ord('a')] += 1
cnt[ord(s[i]) - ord('a')] -= 1
diff = sum([1 for x in cnt if x != 0])
if diff == 0:
ans.append(0)
i = 0
j = len_p - 1
while j < len_s - 1:
# 去掉s[i]
i_idx = ord(s[i]) - ord('a')
if cnt[i_idx] == -1:
diff -= 1
if cnt[i_idx] == 0:
diff += 1
cnt[i_idx] += 1
# 增加s[j+1]
j_idx = ord(s[j+1]) - ord('a')
if cnt[j_idx] == 1:
diff -= 1
if cnt[j_idx] == 0:
diff += 1
cnt[j_idx] -= 1
i += 1
j += 1
# print(i, j, diff)
if diff == 0:
ans.append(i)
return ans
```
## 11/26/2021
[700. 二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/)
+ 递归
```python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def searchBST(self, root: TreeNode, val: int) -> TreeNode:
if root is None:
return None
if root.val == val:
return root
elif root.val > val:
return self.searchBST(root.left, val)
else:
return self.searchBST(root.right, val)
```
+ 迭代
```python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def searchBST(self, root: TreeNode, val: int) -> TreeNode:
while root:
if root.val == val:
return root
elif val < root.val:
root = root.left
else:
root = root.right
return None
```
## 11/23/2021
[859. 亲密字符串](https://leetcode-cn.com/problems/buddy-strings/)
**思路**
+ 长度要相同
+ 若两字符串完全相等，则要求有重复字符
+ 有两个位置不同，且错位相等
```python
class Solution:
def buddyStrings(self, s: str, goal: str) -> bool:
if len(s) != len(goal):
return False
idx = []
cnt = collections.defaultdict(int)
twosame = False
for i in range(len(s)):
if s[i] != goal[i]:
if len(idx) == 2:
return False
idx.append(i)
cnt[s[i]] += 1
if twosame is False and cnt[s[i]] >= 2:
twosame = True
if len(idx) == 1:
return False
if len(idx) == 0:
return twosame
i, j = idx
if s[i] != goal[j] or s[j] != goal[i]:
return False
return True
```
## 11/22/2021
[384. 打乱数组](https://leetcode-cn.com/problems/shuffle-an-array/)
**思路**
+ 从前往后填充 [0,n−1]
+ 对于下标 x 而言，我们从[x,n−1] 中随机出一个位置与 xxx 进行值交换
```python
class Solution:
def __init__(self, nums: List[int]):
self.original = nums.copy()
self.nums = nums
self.n = len(nums)
def reset(self) -> List[int]:
self.nums = self.original.copy()
return self.nums
def shuffle(self) -> List[int]:
for i in range(self.n - 1):
j = random.randint(i, self.n - 1)
self.nums[i], self.nums[j] = self.nums[j], self.nums[i]
return self.nums
```
## 11/21/2021
[559. N 叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/)
**思路**1
+ DFS
```python
"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def maxDepth(self, root: 'Node') -> int:
if root is None:
return 0
# if root.children is None:
# return 1
child_dep = 0
for child in root.children:
child_dep = max(child_dep, self.maxDepth(child))
return 1 + child_dep
```
**思路2**1
+ BFS
```python
"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def maxDepth(self, root: 'Node') -> int:
if root is None:
return 0
ans = 0
queue = collections.deque()
queue.append(root)
while queue:
ans += 1
for _ in range(len(queue)):
node = queue.popleft()
for child in node.children:
queue.append(child)
return ans
```
## 11/20/2021
[594. 最长和谐子序列](https://leetcode-cn.com/problems/longest-harmonious-subsequence/)
**思路**
+ 每个子序列中只有两个相邻的数
+ 用哈希表记录每个数字出现的次数
```python
class Solution:
def findLHS(self, nums: List[int]) -> int:
ans = 0
hashmap = dict()
for num in nums:
if num not in hashmap:
hashmap[num] = 0
hashmap[num] += 1
for fir in hashmap.keys():
sec_cnt = hashmap.get(fir + 1, 0)
if sec_cnt != 0:
ans = max(ans, hashmap[fir] + sec_cnt)
return ans
```
## 11/19/2021
[397. 整数替换](https://leetcode-cn.com/problems/integer-replacement/)
**思路1**
+ 直接递归
+ 偶数时， 计算 n // 2
+ 奇数时，计算min(n-1, n+1)
```python
class Solution:
def integerReplacement(self, n: int) -> int:
if n == 1:
return 0
if n % 2 == 0:
return 1 + self.integerReplacement(n // 2)
else:
return 2 + min(self.integerReplacement(n // 2), self.integerReplacement(n // 2 + 1)
return -1
```
**思路2**
+ 记忆化减低复杂度
```python
class Solution:
def __init__(self):
self.memo = dict()
def integerReplacement(self, n: int) -> int:
if n == 1:
return 0
if n in self.memo:
return self.memo[n]
steps = -1
if n % 2 == 0:
steps = 1 + self.integerReplacement(n // 2)
else:
steps = 2 + min(self.integerReplacement(n // 2), self.integerReplacement(n // 2 + 1))
self.memo[n] = steps
return steps
```
## 11/18/2021
[563. 二叉树的坡度](https://leetcode-cn.com/problems/binary-tree-tilt/)
**思路**
+ DFS递归，返回以该节点为root的所有结点的和，left + right + node.val
+ 并同时得到该结点的坡度
```python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def findTilt(self, root: TreeNode) -> int:
self.ans = 0
_ = self.DFS_sum(root)
return self.ans
# 计算root的结点和
def DFS_sum(self, root):
if root is None:
return 0
left_sum = self.DFS_sum(root.left)
right_sum = self.DFS_sum(root.right)
self.ans += abs(left_sum - right_sum)
return left_sum + right_sum + root.val
```
## 11/17/2021
[318. 最大单词长度乘积](https://leetcode-cn.com/problems/maximum-product-of-word-lengths/)
**思路**
+ 先用26位二进制表示每个word
+ 与为0则没有相同字符串
```python
class Solution:
def maxProduct(self, words: List[str]) -> int:
n = len(words)
bits = [0] * n
for i in range(n):
word = words[i]
for w in word:
# 或运算
bits[i] = bits[i] | (1 << (ord(w) - ord('a')))
ans = 0
for i in range(n):
for j in range(i+1, n):
if (bits[i] & bits[j]) == 0:
ans = max(ans, len(words[i]) * len(words[j]))
return ans
```
## 11/15/2021
[319. 灯泡开关](https://leetcode-cn.com/problems/bulb-switcher/)
**思路**
+ 只需要计算1-n有几个平方数！
+ 非平方数一定是暗的
+ 1-n 中平方数的个数为sqrt(n)向下取整
```python
class Solution:
def bulbSwitch(self, n: int) -> int:
i = 1
ans = 0
while i * i <= n:
ans += 1
i += 1
return ans
```
```python
class Solution:
def bulbSwitch(self, n: int) -> int:
return (int(math.sqrt(n)))
```
## 11/14/2021
[677. 键值映射](https://leetcode-cn.com/problems/map-sum-pairs/)
**思路**
+ Trie树的思路，每个结点存当前的sum
+ 如果重复insert，需要挑战该路径上的所有val，addi = val - pre
```python
class MapSum:
def __init__(self):
self.map = dict()
self.trie = Trie()
def insert(self, key: str, val: int) -> None:
pre = self.map.get(key, 0)
addi = val - pre
self.map[key] = val
node = self.trie
for ch in key:
idx = ord(ch) - ord('a')
if node.children[idx] is None:
node.children[idx] = Trie()
node.children[idx].val += addi
node = node.children[idx]
def sum(self, prefix: str) -> int:
node = self.trie
for ch in prefix:
idx = ord(ch) - ord('a')
if node.children[idx] is None:
return 0
node = node.children[idx]
return node.val
class Trie:
def __init__(self):
# 保存子节点，小写字母情况下最多26个，可以用数组模拟
self.children = [None] * 26
# 记录该节点 是否作为一个字符串的结束
self.val = 0
# Your MapSum object will be instantiated and called as such:
# obj = MapSum()
# obj.insert(key,val)
# param_2 = obj.sum(prefix)
```
## 11/13/2021
[520. 检测大写字母](https://leetcode-cn.com/problems/detect-capital/)
```python
class Solution:
def detectCapitalUse(self, word: str) -> bool:
if len(word) == 1:
return True
fir = self.is_up(word[0])
sec = self.is_up(word[1])
if fir is False and sec is True:
return False
rest = False
if fir is True and sec is True:
rest = True
for i in range(2, len(word)):
if self.is_up(word[i]) is not rest:
return False
return True
def is_up(self, s):
if s >= 'A' and s <= 'Z':
return True
return False
```
## 11/12/2021
[375. 猜数字大小 II](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/)
```python
class Solution:
def getMoneyAmount(self, n: int) -> int:
dp = [[0] * (n + 1) for _ in range(n + 1)]
for l in range(2, n + 1):
for i in range(1, n + 2 - l):
j = i + l - 1
mini = n * n
for k in range(i, j + 1):
mini = min(mini, k + max(self.get(dp, i, k-1), self.get(dp, k+1, j)))
dp[i][j] = mini
return dp[1][n]
def get(self, arr, i, j):
if i > j:
return 0
return arr[i][j]
```
## 11/10/2021
[495. 提莫攻击](https://leetcode-cn.com/problems/teemo-attacking/)
```python
class Solution:
def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
ans = duration
for i in range(len(timeSeries) - 1):
t1 = timeSeries[i]
t2 = timeSeries[i+1]
ans += min(t2 - t1, duration)
return ans
```
## 11/8/2021
[299. 猜数字游戏](https://leetcode-cn.com/problems/bulls-and-cows/)
**思路**
+ 相同的直接记录bu;ll
+ 不相同的用map记录，取min记录cow
```python
class Solution:
def getHint(self, secret: str, guess: str) -> str:
map1 = collections.defaultdict(int)
map2 = collections.defaultdict(int)
bull, cow = 0, 0
for s1, s2 in zip(secret, guess):
if s1 == s2:
bull += 1
else:
map1[s1] += 1
map2[s2] += 1
for s in map2:
cow += min(map1[s], map2[s])
return f'{bull}A{cow}B'
```
## 11/7/2021
[598. 范围求和 II](https://leetcode-cn.com/problems/range-addition-ii/)
```python
class Solution:
def maxCount(self, m: int, n: int, ops: List[List[int]]) -> int:
min_a = m
min_b = n
for a, b in ops:
min_a = min(min_a, a)
min_b = min(min_b, b)
return min_a * min_b
```
## 11/6/2021
[268. 丢失的数字](https://leetcode-cn.com/problems/missing-number/)
+ 异或
+ 先求[1,n] 的异或和 ans，然后用 anss 对各个 nums[i]nums[ii]进行异或
```python
class Solution:
def missingNumber(self, nums: List[int]) -> int:
xorsum = 0
n = len(nums)
for x in nums:
xorsum ^= x
for x in range(n + 1):
xorsum ^= x
return xorsum
```
## 11/5/2021
[1218. 最长定差子序列](https://leetcode-cn.com/problems/longest-arithmetic-subsequence-of-given-difference/)
```python
class Solution:
def longestSubsequence(self, arr: List[int], difference: int) -> int:
num_len = dict()
ans = 1
for num in arr:
l = num_len.get(num - difference, 0) + 1
ans = max(ans, l)
num_len[num] = l
return ans
```
## 11/4/2021
[367. 有效的完全平方数](https://leetcode-cn.com/problems/valid-perfect-square/)
```python
class Solution:
def isPerfectSquare(self, num: int) -> bool:
if num == 1:
return True
l = 2
r = num // 2
while l <= r:
mid = (l + r) // 2
sq = mid * mid
if sq == num:
return True
elif sq > num:
r = mid - 1
else:
l = mid + 1
return False
```
## 11/2/2021
[237. 删除链表中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/)
**思路**
+ 将需要删除的结点值设置为下一个结点的值
+ 删除下一个结点
+ 效果等同于删除node
```python
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def deleteNode(self, node):
"""
:type node: ListNode
:rtype: void Do not return anything, modify node in-place instead.
"""
node.val = node.next.val
node.next = node.next.next
```
## 11/1/2021
[575. 分糖果](https://leetcode-cn.com/problems/distribute-candies/)
```python
class Solution:
def distributeCandies(self, candyType: List[int]) -> int:
hset = set()
for c in candyType:
hset.add(c)
max_candy = len(candyType) // 2
return min(max_candy, len(hset))
```
# 10/2021
## 10/31/2021
[500. 键盘行](https://leetcode-cn.com/problems/keyboard-row/)
```python
class Solution:
def findWords(self, words: List[str]) -> List[str]:
hashmap = dict()
groups = ["qwertyuiop", "asdfghjkl", "zxcvbnm"]
lines = [0, 1, 2]
for w, l in zip(groups, lines):
for s in w:
hashmap[s] = l
ans = []
for word in words:
line = -1
valid = True
for s in word:
s = s.lower()
if line == -1:
line = hashmap[s]
continue
if hashmap[s] != line:
valid = False
break
if valid:
ans.append(word)
return ans
```
| 22.967397 | 120 | 0.456227 | eng_Latn | 0.274232 |
4f6db72b33824cecf2e7c113b8413096c473859c | 958 | md | Markdown | README.md | tkrzeminski/sampleVagrantProvisioning | 103baa0994b8a9927a964b2073000be9d9b06a6f | [
"Unlicense"
] | null | null | null | README.md | tkrzeminski/sampleVagrantProvisioning | 103baa0994b8a9927a964b2073000be9d9b06a6f | [
"Unlicense"
] | null | null | null | README.md | tkrzeminski/sampleVagrantProvisioning | 103baa0994b8a9927a964b2073000be9d9b06a6f | [
"Unlicense"
] | null | null | null | # sampleVagrantProvisioning
Sample vagrant based provisioning with simple app and monitoring.
# Steps
* Clone repository
```
git clone https://github.com/tkrzeminski/sampleVagrantProvisioning .
```
* Start vagrant
```
vagrant up
```
* wait
* Open browser on page [http://localhost:8080](http://localhost:8080) or [https://localhost:8443/](https://localhost:8443/)
* Checkout monitoring on page [http://localhost:8080/munin/](http://localhost:8080/munin/) or [https://localhost:8443/munin/](https://localhost:8443/munin/)
* Ping local simple java server requesting page [http://localhost:8080/ping](http://localhost:8080/ping) or [https://localhost:8443/ping](https://localhost:8443/ping) behind proxy
* Try to burn vagrant box requesting page [http://localhost:8080/stress](http://localhost:8080/stress) or [https://localhost:8443/stress](https://localhost:8443/stress) or use console ab command:
```
ab -n 100 -c 5 http://localhost:8080/stress
```
| 33.034483 | 195 | 0.73904 | por_Latn | 0.187218 |
4f6ed29590e9c02d9e9dd71a1b1ec300228932e7 | 229 | md | Markdown | README.md | stefano-onorati/DaCapo | 7db9f37ae85ccdf843ec20c9855d315a035b4384 | [
"MIT"
] | null | null | null | README.md | stefano-onorati/DaCapo | 7db9f37ae85ccdf843ec20c9855d315a035b4384 | [
"MIT"
] | null | null | null | README.md | stefano-onorati/DaCapo | 7db9f37ae85ccdf843ec20c9855d315a035b4384 | [
"MIT"
] | null | null | null | # Da Capo
Website designed for Da Capo Music Studio using Bootstrap. For more information, please visit <a href="http://dacapomusicstudio.com/" target="_blank">Da Capo</a> and <a href="http://startbootstrap.com/">Bootstrap</a>.
| 76.333333 | 218 | 0.746725 | kor_Hang | 0.311388 |
4f6eec9b9dc3f9ae991c90326222d17439578f24 | 7,688 | md | Markdown | _posts/2019-04-20-Download-1995-saturn-s-air-bag-removel.md | Ozie-Ottman/11 | 1005fa6184c08c4e1a3030e5423d26beae92c3c6 | [
"MIT"
] | null | null | null | _posts/2019-04-20-Download-1995-saturn-s-air-bag-removel.md | Ozie-Ottman/11 | 1005fa6184c08c4e1a3030e5423d26beae92c3c6 | [
"MIT"
] | null | null | null | _posts/2019-04-20-Download-1995-saturn-s-air-bag-removel.md | Ozie-Ottman/11 | 1005fa6184c08c4e1a3030e5423d26beae92c3c6 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download 1995 saturn s air bag removel book
silver, under any Doorkeeper. Mary's, 176 Half an hour later the curtains over the barred open window moved, was in fact the city, nodded once to the matron, they cross the state line into Idaho and continue north to the city of Twin Falls. She spooned the ice into Junior's mouth not with the businesslike Christmas Day, Mr, but I sort of walk in the idea of those worlds! An ordinary-looking middle-aged man stood there. This gave rise to the Then before them was a rushing and a rumbling and a rolling like thunder, watch it with his own eyes, and had followed them since. "So much trouble. She's really into the role," Leilani says unconditional love, to which Michelle replied (quite seriously) that unfortunately she 1995 saturn s air bag removel not wife! As far as I am aware, she shifted her attention to his eyes, simultaneously "In my estimation. followed seemed to be charged with some supernatural energy, and the beat of the great heart, down into another brief darkness, "and then she came back? I'm the one who patched that pipe later. And I wish you wouldn't go north. You may copy it, only thirty miles south of Spruce Hills, and whenas the night darkened behind him, and decorative little plush-toy bunnies and baby chicks, Story of, who in with him, maintaining surveillance of the gallery from his parked car, and all the time Early was looking and probing toward Endlane village! " During autumn and midwinter the sunshine was not of course strong detected pneumonia in every sniffle, as though mistaking its own whipping coils for those He opened his mouth but stood mute. " He put a ponderous minister: The concept of sin and consequences was perhaps less deeply cheesiest daytime soap opera, his only rock, even me, no matter what the She had disappeared into a short hall at the 1995 saturn s air bag removel of 1995 saturn s air bag removel diner. The magnetical observatory was along his shoulder. Hyde. Indeed, there being, and those black The nurse returned with fresh apple juice, am I?" which he shot and killed twelve people, after Agnes sent Edom back to his apartment. I know it, and when 1995 saturn s air bag removel go down into the garden, dropping the book he had been reading. It's only that agreeing on the Way-or the Rule, she could no more easily raise her voice than she could extend a hand to him. Start with the basics. Strange, in the midst of his intellectual 1995 saturn s air bag removel, ii, he stood dumb, boy?" along which a stooping-crouching-scuttling boy might be able to escape. "I made no mention of your wanting to save yourself physically? It ought to be observed, Vanadium felt along the return edge of the carved limestone casing to the right of the window until he located a quarter-inch-diameter steel pin that protruded an inch, _St, he canceled his German lessons. The rest fled, and a Holding 1995 saturn s air bag removel, a town girl, Version 1, made in all seriousness, Sinatra sang "It Was a Very Good Year. The man dropped out of sight. Why, but in a different spirit from when Amstelodamensium Historia_ (Amst, the natural history collections are examined _a, the brain too smart for her own good: "Here's that spit-in-the-eye-malefactor side of you what ain't a pretty thing to see, she stirred from 1995 saturn s air bag removel fretful dream Great House. " "Did he say I'd met him?" Jacob asked, and the sea froze so far out from the shore that the where the Russians have carried on hunting. Then he took up his abode with them and they loved him exceedingly. Indeed, and by the Stockholm Workman's Union to the crew, or to care, and to make himself acquainted with its more complicated the more precise an explanation I required, tossed in the ruby. If, Irtisch, sent for Sitt el Milah and acquainted her with that which had passed [between herself and the Khalif]; whereupon she kissed her hand and thanked her and called down blessings on her. have much to learn from the Europeans, not the headlamps of approaching traffic, and often led on far beyond boats, just slightly sickened, continued to "A good boy, right on a level with his own, 'When this cometh about. Fog enveloped him, Azver?" the Namer asked. Krascheninnikov (_loc! See, filling prescriptions, inner circles, who was none other than Selim's sister Selma. His throat had been cut. Because he failed They are too tired to discuss recent events with him now, reading the function of the equipment as a funeral were you attending?" Asia in the beginning of this century. ] Howard brought a hand up to his chin sad rubbed it dubiously for a few seconds. vertebrae had been used for 1995 saturn s air bag removel, of a merchant trying to drum up a few bucks' worth of business, enough clowning, still breathing but as good as dead. The Project, Hal, I wouldn't hesitate, and Song gave a high-pitched cheer, talking to and his cash. The moving platform made a turn, or whatever you want to call it, especially since I was also the better boxer, along with Master Hemlock. By the following day the word was beginning to Buckland, 'O king, and 1995 saturn s air bag removel deeper gloom was held off only by the central rattle. _ Wooden cup to place under the lamp distilled essence of cocoa butter-would be the first step on a slippery slope the West Reach, it seems pretty magical to me-that flipped-coin trick? "Come in, but I "Nice, two more weapons were trained on them from 1995 saturn s air bag removel, when he had shaken off "Not one of your stupid pigmen books. The 1995 saturn s air bag removel wanted teeth, "I can do what I need bed. here, Mandy. If you'll go. " Carrying the candlestick, Micky knew how useful alcohol could be when making a shadows didn't provide enough concealment, no," she says. It was As it became clear that this seasoned pump jockey wasn't sure where to service the big motor home, 509; "My aunt Lilly didn't think so, it doesn't matter. " Feeling betrayed and pissed-off, Curtis switches off the bedroom with my own ideas, in a large, the unicorn did the same. tenaciously to this existence, contemplated, Junior vowed never to kill again, though perhaps not Houses made settling noises all the time. I helped her birth babies. " dry fragments of different kinds of plants. Daines spoke with Celestina in the corridor, at the top of its jutting backbone. Well, king-duck wanted to meet at a showing of Doctor Dolittle or The Graduate. That was one reason why he couldn't wall. But Colman only half heard. "No," she said in a soft, so there is no need for you to feel any obligation to pretend that you misunderstood, Chironians pay it direct instead of indirectly through symbols. They destroyed us and we believed in Yeller because they can't turn back toward the Windchaser, as I understand it. "The fishing in the eastern lagoon takes place mainly in During the course of the winter Lieutenant Nordquist endeavoured to In other words, and tall 1995 saturn s air bag removel. "She?" a successful voyage, situated near the shuttle base on the outskirts of Franklin, Steve resented Don's basic schooling and was jealous when Don went to college to study engineering. I won't pretend otherwise. He felt sick. The wizard sometimes had him come with him to his work, following a channel with ten to good work anyway, and of various pieces of information collected during this Everyone else in the tavern came running outside too, howsoever a man be oppressed, Noah felt the stacks shudder under them. Eight days would entail wetted with brandy, drawn by V. As a rule, even though the food was soft and bland. | 854.222222 | 7,585 | 0.787331 | eng_Latn | 0.99992 |
4f6f70ca414a2210992f6a48f6f0ced68b5cd38a | 2,627 | md | Markdown | README.md | jvolkman/rules_python_cross | 7d6426a9c929c8a789d0edb502f29474ecf8a63c | [
"Apache-2.0"
] | 4 | 2022-03-29T13:58:58.000Z | 2022-03-31T11:10:28.000Z | README.md | jvolkman/rules_python_cross | 7d6426a9c929c8a789d0edb502f29474ecf8a63c | [
"Apache-2.0"
] | null | null | null | README.md | jvolkman/rules_python_cross | 7d6426a9c929c8a789d0edb502f29474ecf8a63c | [
"Apache-2.0"
] | null | null | null | # `rules_pycross` - Python + cross platform
A proof-of-concept ruleset to (hopefully) improve cross-platform Python builds with Bazel.
__Note:__ very much still experimental.
### Features:
- A single lock file for all target platforms, thanks to Poetry
- Builds that happen in build actions, not during WORKSPACE initialization
- Standard Bazel `http_file` rules used for fetching dependencies. `pip` is not a build-time dependency.
See the [example](example).
### Why?
The current Bazel [rules](https://github.com/bazelbuild/rules_python) for working with Python external dependencies
have a couple of issues that make cross-platform usage difficult (see https://github.com/bazelbuild/rules_python/issues/260):
- they're based on `pip` and `pip-compile` which do not generate cross-platform lock files. For example, IPython depends
on `appnope` only on MacOS. Lock files generated by `pip-compile` will differ based on whether they're created on Linux
or MacOS.
- They use `pip install` during the `WORKSPACE` phase to fetch and possibly build packages (including native libraries).
`WORKSPACE` operations lack many of the things that Bazel's build actions provide such as sandboxing and remote execution.
### How?
A `pip install` operation can be roughly broken down into these parts:
1. determine the environment (OS and Python version/implementation)
2. resolve the dependencies of the package to install, some of which may be platform-specific
(optionally constrained by a pre-compiled lock file)
3. figure out which files to download - either pre-built wheels matching the current platform or sdists to build locally
4. download sdists and wheels
5. build and install sdists; install wheels
`rules_pycross` attemps to deconstruct this operation into its constituent parts and glue them together with Bazel:
1. `pycross_target_environment` is used to specify target environments ahead of time provided with ABI, platform,
and implementation parameters (similar to pip's `--abi`, `--platform`, and `--implementation` flags). These
environments are selected using Bazel's own platform/constraint system.
2. `pycross_lock_file` generates a "lock" `.bzl` file from an input `poetry.lock`. This `.bzl` file contains a mix of
`http_file` repositories and `pycross_*` targets.
3. `pycross_wheel_build` builds `sdist.tar.gz` archives into Python wheels. This is a build action, not a `WORKSPACE`
operation.
5. `pycross_wheel_library` "installs" (extracts) a Python wheel - either downloaded or built from an sdist - and
provides it as a `py_library`.
See the [generated docs](docs/rules.md).
| 53.612245 | 125 | 0.775409 | eng_Latn | 0.997692 |
4f7019faf657db6b5419dd1906354d20dfadff31 | 674 | md | Markdown | misc/additional-ubuntu-repositories.md | sespaces/streamfarmers-progress | d02d6787933429a44257c78cdedde608fed06c14 | [
"MIT"
] | null | null | null | misc/additional-ubuntu-repositories.md | sespaces/streamfarmers-progress | d02d6787933429a44257c78cdedde608fed06c14 | [
"MIT"
] | null | null | null | misc/additional-ubuntu-repositories.md | sespaces/streamfarmers-progress | d02d6787933429a44257c78cdedde608fed06c14 | [
"MIT"
] | null | null | null | # Additional Ubuntu Repositories
Depending on your Ubuntu installation, you may need this to use the "add-apt-repository" command:
apt install software-properties-common
Certbot (Let's Encrypt)
add-apt-repository ppa:certbot/certbot
apt update && apt install -y certbot
Geth (Go Ethereum)
add-apt-repository ppa:ethereum/ethereum
apt update && apt install -y ethereum
Sublime-Text
wget -qO - https://download.sublimetext.com/sublimehq-pub.gpg | sudo apt-key add -
apt install apt-transport-https
echo "deb https://download.sublimetext.com/ apt/stable/" | sudo tee /etc/apt/sources.list.d/sublime-text.list
apt update && apt install -y sublime-text
| 24.071429 | 110 | 0.753709 | kor_Hang | 0.224363 |
4f702f33b116cc9a8b0904e044e105e0c5fc2352 | 33 | md | Markdown | README.md | HelveticaScenario/cubbyjs | 068b2b169754c68911b2c5db4c9a66f6470e637c | [
"MIT"
] | 1 | 2021-12-17T17:40:17.000Z | 2021-12-17T17:40:17.000Z | README.md | HelveticaScenario/cubbyjs | 068b2b169754c68911b2c5db4c9a66f6470e637c | [
"MIT"
] | 6 | 2021-05-24T19:07:55.000Z | 2021-08-31T23:05:24.000Z | README.md | HelveticaScenario/cubbyjs | 068b2b169754c68911b2c5db4c9a66f6470e637c | [
"MIT"
] | 1 | 2021-05-07T06:29:51.000Z | 2021-05-07T06:29:51.000Z | # cubbyjs
A micro-store library
| 8.25 | 21 | 0.757576 | eng_Latn | 0.325303 |
4f70b27899a2d578c056a53da7a6f506d7c03623 | 311 | md | Markdown | README.md | codesydney/censusplus_nsw_employmentrate | 882e6f0986c6456c16240e5af6f23c3025042710 | [
"CC-BY-4.0"
] | null | null | null | README.md | codesydney/censusplus_nsw_employmentrate | 882e6f0986c6456c16240e5af6f23c3025042710 | [
"CC-BY-4.0"
] | null | null | null | README.md | codesydney/censusplus_nsw_employmentrate | 882e6f0986c6456c16240e5af6f23c3025042710 | [
"CC-BY-4.0"
] | null | null | null | # censusplus_nsw_employmentrate
This is censusplus subproject deals with NSW Employment rate from different NSW suburbs. Data was obtained from https://data.nsw.gov.au/
This work is licensed under https://creativecommons.org/licenses/by/4.0/
"# censusplus_nsw_employmentrate"
"# NSW-Employment-Rate"
| 38.875 | 137 | 0.784566 | eng_Latn | 0.985808 |
4f71b5c70e10938e86462b929f7c12cc227fdb15 | 599 | md | Markdown | README.md | asannou/docker-docker-api-proxy | 7b986725e2bc024cc7e511f78b5cdc2d9100cff0 | [
"MIT"
] | null | null | null | README.md | asannou/docker-docker-api-proxy | 7b986725e2bc024cc7e511f78b5cdc2d9100cff0 | [
"MIT"
] | null | null | null | README.md | asannou/docker-docker-api-proxy | 7b986725e2bc024cc7e511f78b5cdc2d9100cff0 | [
"MIT"
] | null | null | null | # docker-api-proxy
Proxy for accessing Docker daemon's remote API. By default, the API proxy blocks all requests that can run containers and commands that are not covered by the stored images and their predefined commands. However, you can easily customize the filter logic by adapting the lib/filter.js file.
Tested against Docker Remote API v1.24 and Docker 1.12.
## Start a container
$ docker run -d --name docker-api-proxy -P -v /var/run/docker.sock:/docker.sock asannou/docker-api-proxy
## Connect to it using Docker CLI
$ docker -H $(docker port docker-api-proxy 2375/tcp) info
| 39.933333 | 290 | 0.75793 | eng_Latn | 0.980035 |
4f7228cb47ead602199ea04d04265bdf18041d03 | 4,325 | md | Markdown | tutorials/backend/hasura-advanced/tutorial-site-es/content/performance/1-caching.md | surendran82/learn-graphql | 0260fab2e73f3a04dfe14b5507c2566647b6e267 | [
"MIT"
] | 2 | 2022-01-20T08:06:13.000Z | 2022-02-23T18:35:18.000Z | tutorials/backend/hasura-advanced/tutorial-site-es/content/performance/1-caching.md | arjunyel/learn-graphql | 133352f15ad8b81200df292d606d9f44cb21f244 | [
"MIT"
] | null | null | null | tutorials/backend/hasura-advanced/tutorial-site-es/content/performance/1-caching.md | arjunyel/learn-graphql | 133352f15ad8b81200df292d606d9f44cb21f244 | [
"MIT"
] | 1 | 2022-02-25T15:16:00.000Z | 2022-02-25T15:16:00.000Z | ---
title: "Caché de respuestas de GraphQL"
metaTitle: "Caché de respuestas de GraphQL | Tutorial avanzado de Hasura GraphQL"
metaDescription: "El motor Hasura GraphQL (OSS) admite el almacenamiento en caché de consultas, donde se almacenará la representación interna del AST de GraphQL completamente cualificado."
---
El motor Hasura GraphQL (OSS) admite el almacenamiento en caché de consultas, donde se almacenará la representación interna del AST de GraphQL completamente cualificado. Cuando se realiza una consulta de GraphQL, el SQL generado es una instrucción preparada con las variables de sesión adecuadas para que estas lleguen a la base de datos. Estas instrucciones preparadas ayudan a realizar consultas rápidamente. Más información sobre [Almacenamiento de consultas en caché](https://hasura.io/docs/latest/graphql/core/databases/postgres/queries/performance/)
Ahora bien, algunas consultas son de acceso más frecuente que otras. Normalmente, podría darse una latencia o tiempos de respuesta lentos debido a
- El tamaño de la respuesta
- La ubicación del servidor
- El número de llamadas concurrentes en la API, etc.
Hasura Cloud ofrece soporte para el almacenamiento en caché de las respuestas a las consultas. Cuando la consulta se hace con la configuración de la caché, Hasura Cloud garantiza que los datos de respuesta se almacenan en la caché para mejorar los tiempos de respuesta.
**Nota**: el almacenamiento en caché de respuestas de GraphQL está habilitado para proyectos Cloud de nivel `Standard` con un tamaño de caché de hasta 100 MB.
## ¿Cómo funciona el almacenamiento en caché? {#how-does-caching-work}
Hasura cuenta con metadatos sobre los modelos de datos en todas las fuentes de datos, además de con reglas de autorización a nivel de aplicación. Esto ayuda a Hasura a proporcionar un almacenamiento en caché de aplicaciones de extremo a extremo.
La respuesta de una consulta GraphQL solo puede almacenarse en la caché cuando se cumplen las siguientes condiciones:
- La consulta no hace uso de esquemas ni uniones remotos
- La consulta y los permisos de usuario relacionados no utilizan variables de sesión
- La JSON de respuesta tiene un tamaño inferior a 100 KB
Las respuestas en caché se almacenan durante un tiempo en una caché LRU (menos utilizada recientemente) y se eliminan de la caché según sea necesario en función de su uso.
Por ejemplo, los registros `users` del modelo de slack serán de acceso frecuente. Podemos almacenarlos en la caché mediante la siguiente consulta:
```graphql
query slackUsersCached @cached {
users {
id
name
display_name
bio
}
}
```
Tenga en cuenta que en la consulta anterior hemos incluido una directiva `@cached` para especificar que esta consulta debe ser almacenada en la caché. Por `default` su respuesta se almacena en la caché durante `60 seconds`.
Ahora vamos a verificar si la respuesta ha sido almacenada en caché correctamente.
Lo ideal sería que la respuesta HTTP incluyese un encabezado `Cache-Control` para indicar el número máximo de segundos que la respuesta devuelta ha de permanecer en la caché. Pasado ese tiempo se eliminará de la LRU.
Puede consultar el valor del encabezado de la respuesta de Control de caché que indica cuánto tiempo más en segundos va a almacenarse esta respuesta en la caché.
## Vida útil de la caché {#cache-lifetime}
La duración máxima de una entrada en la memoria caché puede controlarse mediante el argumento ttl de la directiva de consulta @cached. El valor es un número entero de segundos:
```graphql
query usersCached @cached(ttl: 300) {
users {
id
name
display_name
bio
}
}
```
En la consulta anterior, hemos incluido un argumento `ttl` para la directiva @cached. Esto se utiliza para especificar cuánto tiempo debe permanecer la memoria caché en su sitio.
El valor máximo permitido es de 300 segundos (5 minutos) y eso es lo que hemos utilizado en la consulta anterior.
Ahora, al leer el encabezado `Cache-Control`, sabremos cuánto tiempo permanecerá la consulta en la memoria caché. Los clientes suelen utilizar este encabezado para llevar un registro de las respuestas almacenadas en la caché.
| 60.069444 | 555 | 0.793988 | spa_Latn | 0.997518 |
4f72aecd267eba9c40b30c2cec649a4811a3d9e8 | 28 | md | Markdown | README.md | herju26/learn | c2288a68031d1919c77934eb4ede4e5a54442e54 | [
"MIT"
] | null | null | null | README.md | herju26/learn | c2288a68031d1919c77934eb4ede4e5a54442e54 | [
"MIT"
] | null | null | null | README.md | herju26/learn | c2288a68031d1919c77934eb4ede4e5a54442e54 | [
"MIT"
] | null | null | null | # learn
try to learn github
| 9.333333 | 19 | 0.75 | eng_Latn | 0.982674 |
4f734085e758796ef76d1d03d944b9411db371d1 | 4,328 | md | Markdown | README.md | farrmt/Saunders_etal_2019_Ecol | a5a7a5645a77d704322a327a508481ba23f26eb7 | [
"MIT"
] | null | null | null | README.md | farrmt/Saunders_etal_2019_Ecol | a5a7a5645a77d704322a327a508481ba23f26eb7 | [
"MIT"
] | null | null | null | README.md | farrmt/Saunders_etal_2019_Ecol | a5a7a5645a77d704322a327a508481ba23f26eb7 | [
"MIT"
] | null | null | null | # Disentangling data discrepancies with integrated population models
### Sarah P. Saunders, Matthew T. Farr, Alexander D. Wright, Christie A. Bahlai, José W. Ribeiro Jr., Sam Rossman, Allison L. Sussman, Todd W. Arnold, & Elise F. Zipkin
### Ecology
### Please contact the first author for questions about the code or data: Sarah P. Saunders ([email protected])
__________________________________________________________________________________________________________________________________________
## Abstract:
A common challenge for studying wildlife populations occurs when different observation methods (e.g. mark-recapture, census, telemetry, occupancy) provide inconsistent or incomplete inference on the trend, dynamics, or viability of a population. A potential solution to the challenge of conflicting or piecemeal data (i.e. dataset discrepancies and deficiencies, respectively) relies on the integration of multiple data types into a unified modeling framework, such as integrated population models (IPMs). IPMs are a powerful approach for species that inhabit spatially and seasonally complex environments. In cases where data come from heterogeneous collection schemes, individual data sources are unlikely to contain all the information necessary to model large-scale population dynamics, and may fail to capture spatial and temporal variability across a species’ range or annual cycle. We review how data discrepancies can be modeled with IPMs and provide guidance on combining multiple data types when there are data deficiencies. We illustrate this issue with analysis of a migratory species, the American woodcock (Scolopax minor), in which individual monitoring programs suggest differing population trends. To address this discrepancy, we synthesized several long-term datasets (1963 – 2015) within an IPM to estimate continental-scale population trends, and link dynamic drivers across the full annual cycle and complete extent of the woodcock’s geographic range in eastern North America. Our analyses reveal the limiting portions of the life cycle by identifying time periods (i.e. seasons) and locations (i.e. population units) where survival rates are lowest and most variable, as well as which demographic parameters constitute the main drivers of population change. We provide recommendations for exploiting the capabilities of IPMs to account for incongruent datasets and discuss how strategies (e.g. data weighting, data thinning) from other disciplines can be incorporated into ecological analyses that combine multiple, disparate data types.
## Code
1. [Data_manip_AMWO_marray_Git.R](https://github.com/zipkinlab/timberdoodle/blob/master/Data_manip_AMWO_marray_Git.R): Data managment and manipulation code of Banding data to create m-arrays for band-recovery model component of the IPM.
2. [AMWO_harvest_Git.R](https://github.com/zipkinlab/timberdoodle/blob/master/AMWO_harvest_Git.R): Data manipulation of harvest data (Duck Stamp Survey, Harvest Information Program, and Parts-collection Surveys) and JAGS model file and R code for estimation of annual woodcock harvest throughought temporal and spatial range of the study.
3. [IPM_AMWO_modelfile_Git.R](https://github.com/zipkinlab/timberdoodle/blob/master/IPM_AMWO_modelfile_Git.R): JAGS model file and R code for bayesian implementation of the Integrated Population model to estimate population dynamics and trends of the Eastern and Central US woodcock populations from 1963-2015.
## Data
This project utilizes 3 datasets:
1) Banding-Recovery Data
Description: Bird banding is a universal technique for studying the movement, survival and behavior of birds. Recovery data is also useful for estimating survival rates of both young and adult birds.
Contact: USGS Bird Banding Lab
Website: https://www.pwrc.usgs.gov/bbl/
2) Hunter Harvest Data
Description: The U.S. Harvest Information Program (HIP) measures hunter effort and number of woodcocks harvested by hunters annually (1963-Present).
Contact: USFWS Migratory Bird Data Center
Website: https://migbirdapps.fws.gov/
3) Singing Ground Survey
Description: Survey of numerous routes throughout the range of woodcocks to survey singing males during the spring.
Contact: USFWS Migratory Bird Data Center
Website: https://migbirdapps.fws.gov/
| 123.657143 | 2,061 | 0.816081 | eng_Latn | 0.980226 |
4f737e7ea837b5c8b17219a9cd7cc32b98cdbf6d | 256 | md | Markdown | book-club/the-go-programming-language/ch1/capt.1.md | alinebalogh/go-ladies-br | b6c4cb84e719e8f462b9f85c54f339a67229a347 | [
"MIT"
] | 4 | 2022-01-31T11:48:08.000Z | 2022-02-04T13:53:57.000Z | book-club/the-go-programming-language/ch1/capt.1.md | alinebalogh/go-ladies-br | b6c4cb84e719e8f462b9f85c54f339a67229a347 | [
"MIT"
] | 1 | 2022-02-02T21:41:32.000Z | 2022-02-02T21:41:32.000Z | book-club/the-go-programming-language/ch1/capt.1.md | alinebalogh/GoLadies | b6c4cb84e719e8f462b9f85c54f339a67229a347 | [
"MIT"
] | null | null | null | ## O livro base deste grupo de estudos é: A linguagem de programação GO.
e o primeiro cap. do livro é um tutorial,
link para o source code do tutorial: https://github.com/adonovan/gopl.io/tree/master/ch1
### link para o livro: http://www.gopl.io/
| 42.666667 | 90 | 0.714844 | por_Latn | 0.999246 |
4f73d13fd421f9497e62b6b33a458edad04273ea | 4,793 | md | Markdown | README.md | elm-review-bot/elm-bits | 7fb5093cf2f2985b1e5e8b893e87ba785b970662 | [
"MIT"
] | null | null | null | README.md | elm-review-bot/elm-bits | 7fb5093cf2f2985b1e5e8b893e87ba785b970662 | [
"MIT"
] | null | null | null | README.md | elm-review-bot/elm-bits | 7fb5093cf2f2985b1e5e8b893e87ba785b970662 | [
"MIT"
] | null | null | null | ## bits
Bits are a good way of storing information. The goal of this package is to enable transporting information as bits in elm.
## Example: id
Current id packages have different ways of showing the contained information. This is for example how [danyx23's Uuid][danyx23/elm-uuid] does it:
```elm
module CurrentUuid exposing (CurrentUuid, toString, fromString)
type CurrentUuid =
CurrentUuid String
toString : CurrentUuid -> String
toString (CurrentUuid string) =
string
fromString : String -> Maybe CurrentUuid
fromString string =
if
Regex.contains
(Regex.fromString "^[0-9A-Fa-f]{8,8}-[0-9A-Fa-f]{4,4}-[1-5][0-9A-Fa-f]{3,3}-[8-9A-Ba-b][0-9A-Fa-f]{3,3}-[0-9A-Fa-f]{12,12}$"
|> Maybe.withDefault Regex.never
)
string
then
Just (CurrentUuid string)
else
Nothing
generate : Random.Generator CurrentUuid
generate =
Random.map
(\thirtyOneHexDigits ->
[ thirtyOneHexDigits |> List.take 8 |> List.map mapToHex |> String.fromList
, "-"
, thirtyOneHexDigits |> List.drop 8 |> List.take 4 |> List.map mapToHex |> String.fromList
, "-"
, "4"
, thirtyOneHexDigits |> List.drop 12 |> List.take 3 |> List.map mapToHex |> String.fromList
, "-"
, thirtyOneHexDigits |> List.drop 15 |> List.take 1 |> List.map limitDigitRange8ToB |> List.map mapToHex |> String.fromList
, thirtyOneHexDigits |> List.drop 16 |> List.take 3 |> List.map mapToHex |> String.fromList
, "-"
, thirtyOneHexDigits |> List.drop 19 |> List.take 12 |> List.map mapToHex |> String.fromList
]
|> String.concat
|> CurrentUuid
)
(Random.list 31 (Random.int 0 15))
```
With bits:
```elm
module Uuid exposing (Uuid, random)
-- from typesafe-array
import Arr
-- from bounded-nat
import Nats exposing (Nat128)
import Nat exposing (Only)
-- from typed-value
import Typed exposing (tag)
type alias Uuid =
Typed Tagged UuidTag
Public (Arr (Only Nat128) Bit)
type UuidTag = UuidTag Never
random : Random.Generator Uuid
random =
Bits.random nat128 |> Random.map tag
```
package links:
- **[typesafe-array](https://package.elm-lang.org/packages/lue-bird/elm-typesafe-array/latest/)**
- which uses [bounded-nat](https://package.elm-lang.org/packages/lue-bird/elm-bounded-nat/latest/)
- just an extra: [typed-value](https://package.elm-lang.org/packages/lue-bird/elm-typed-value/latest/)
→ type-safety & a cleaner way of storing information
Bits, as a universal way of representing information, could then be
- represented in a variety of ways (→ [in action](https://lue-bird.github.io/elm-bits/try/))
- different string formats (human readable (for example [michaelglass/proquint](https://package.elm-lang.org/packages/michaelglass/proquint/latest/), less character space, hexadecimal, ...)
- colors, shapes, identicons ([coinop-logan/phace][coinop-logan/phace] or forks of [pukkamustard/elm-identicon](pukkamustard/elm-identicon) (e.g. [dividat/elm-identicon][dividat/elm-identicon])), ...
- converted from multiple types of data
- from bits directly, from characters, from ints...
```elm
import Uuid exposing (Uuid)
import Lue.Bit exposing (Bit(..))
import Typed exposing (tag, val)
viewUuid : Uuid -> Html msg_
viewUuid uuid =
val uuid -- our bits in the id
|> bitsToReadableString
|> Html.text
uuidFromAllBits : Uuid
uuidFromAllBits =
-- raw bits
Arr.from16 O I O I I I I O I I I I I O O O
|> InArr.append nat16
(Arr.from16 I I I O O O O I O I I I I O I I)
-- ...
|> tag
uuidFromChars : Uuid
uuidFromChars =
let
c char =
InArr.append nat20 (charToBits char)
in
Arr.empty
-- the first 120 bits
|> c '骖' |> c '' |> c ''
|> c '' |> c '' |> c '𥩒'
-- the last 8 bits
|> InArr.append nat8
(Arr.from8 O I O I I I I O)
|> tag
-- from another package
charToBits : Char -> Arr (In Nat20 (Nat20Plus a_)) Bit
bitsToReadableString : Arr (In min_ max_) Bit -> String
```
Notice how all of these can build `Uuid`s _safely_ from _different sources of information_.
→ This package currently contains the building blocks in relation to bits. They can be generated, modified, read and serialized.
[coinop-logan/phace]: https://package.elm-lang.org/packages/coinop-logan/phace/latest/
[pukkamustard/elm-identicon]: https://github.com/pukkamustard/elm-identicon
[dividat/elm-identicon]: https://package.elm-lang.org/packages/dividat/elm-identicon/latest/
[danyx23/elm-uuid]: https://package.elm-lang.org/packages/danyx23/elm-uuid/latest/Uuid
| 32.385135 | 203 | 0.651367 | eng_Latn | 0.493821 |
4f749c2fc8d15b9475c2127b47aea29579a6fda4 | 976 | md | Markdown | TestCase_3_Get_Hash.md | anugushravya/broken-hash | d110b8d7d9e449eff19398e20efb842594bc3008 | [
"MIT"
] | null | null | null | TestCase_3_Get_Hash.md | anugushravya/broken-hash | d110b8d7d9e449eff19398e20efb842594bc3008 | [
"MIT"
] | 3 | 2020-01-19T19:02:24.000Z | 2020-01-19T19:48:29.000Z | TestCase_3_Get_Hash.md | anugushravya/broken-hash | d110b8d7d9e449eff19398e20efb842594bc3008 | [
"MIT"
] | null | null | null | # [3] : Get Hash Request
## Description
A GET to /hash should accept a job identifier. It should return the base64 encoded password hash for the corresponding POST request.
### Precondition
1. The hash application should be listening at PORT 8088 and ready to accept curl requests.
2. A POST submitted to the hash application, and it successfully returned a hash identifier.
### Assumptions
Hash application is running on a windows machine.
Curl installed on the machine for sending requests.
## Test Steps
1. Open Command Prompt
2. SET PORT=8088
3. Execute broken-hashserve_win.exe
4. Using curl application run the following command
curl -H "application/json" http://127.0.0.1:8088/hash/1
## Expected Result
The curl command should return the base64 encoded password has. For example, Password text "angrybirds" will return.
NN0PAKtieayiTY8/Qd53AeMzHkbvZDdwYYiDnwtDdv/FIWvcy1sKCb7qi7Nu8Q8Cd/MqjQeyCI0pWKDGp74A1g==
| 26.378378 | 133 | 0.780738 | eng_Latn | 0.936863 |
4f752c9dd00079ff5c36b4c2ad4b3eebb0824604 | 76 | md | Markdown | README.md | jdgwartney/meter-plugin-metrics | 9d388c79b32eb153033298239f0c8c58ade0a090 | [
"Apache-2.0"
] | null | null | null | README.md | jdgwartney/meter-plugin-metrics | 9d388c79b32eb153033298239f0c8c58ade0a090 | [
"Apache-2.0"
] | null | null | null | README.md | jdgwartney/meter-plugin-metrics | 9d388c79b32eb153033298239f0c8c58ade0a090 | [
"Apache-2.0"
] | null | null | null | # meter-plugin-metrics
Sample plugin to test loading of metrics definitions
| 25.333333 | 52 | 0.828947 | eng_Latn | 0.633068 |
4f76afbbd5fea5b603b59f24dfdd963e49d643ea | 338 | md | Markdown | sitescore/OfficeDevPnP.Core.Entities.WebPartEntity.ctor1.md | Laul0/PnP-Guidance | 81353471222abae26bc6459844bcde148dcf7752 | [
"MIT"
] | null | null | null | sitescore/OfficeDevPnP.Core.Entities.WebPartEntity.ctor1.md | Laul0/PnP-Guidance | 81353471222abae26bc6459844bcde148dcf7752 | [
"MIT"
] | null | null | null | sitescore/OfficeDevPnP.Core.Entities.WebPartEntity.ctor1.md | Laul0/PnP-Guidance | 81353471222abae26bc6459844bcde148dcf7752 | [
"MIT"
] | null | null | null | # WebPartEntity.WebPartEntity members
**Namespace:** [OfficeDevPnP.Core.Entities](OfficeDevPnP.Core.Entities.md)
**Assembly:** OfficeDevPnP.Core.dll
## Syntax
```C#
public WebPartEntity()
```
## See also
- [WebPartEntity](OfficeDevPnP.Core.Entities.WebPartEntity.md)
- [OfficeDevPnP.Core.Entities](OfficeDevPnP.Core.Entities.md)
| 26 | 76 | 0.751479 | yue_Hant | 0.966608 |
4f76f274f8cc5f3f23d6c5ee1d5cd1b545b05381 | 1,710 | md | Markdown | _posts/2017-02-10-aws-change-kernel.md | datacabinet/datacabinet-pixyll | 78f58fe41c7c659ad5d931e8b0be36099829d51a | [
"MIT"
] | null | null | null | _posts/2017-02-10-aws-change-kernel.md | datacabinet/datacabinet-pixyll | 78f58fe41c7c659ad5d931e8b0be36099829d51a | [
"MIT"
] | null | null | null | _posts/2017-02-10-aws-change-kernel.md | datacabinet/datacabinet-pixyll | 78f58fe41c7c659ad5d931e8b0be36099829d51a | [
"MIT"
] | null | null | null | ---
layout: post
title: Changing kernel of a AWS CentOS 7 instance
date: 2014-06-09 12:32:18
summary: Notes on C++
categories: jekyll pixyll
---
* spawn the base image of Centos 7 HVM :
aws ec2 run-instances --image-id ami-d2c924b2 \
--key-name pankaj-ec2-key --instance-type t2.micro\
--block-device-mapping '[{ "DeviceName" : "/dev/sda1","Ebs" : { "DeleteOnTermination": true, "VolumeSize" : 15 }}]'\
--placement AvailabilityZone=us-west-2b\
--security-groups DataCabinetSSHGroup default
* login to the VM and download the better kernel from epel repo
rpm --import https://www.elrepo.org/RPM-GPG-KEY-elrepo.org
rpm -Uvh http://www.elrepo.org/elrepo-release-7.0-2.el7.elrepo.noarch.rpm
yum remove kernel-headers kernel-tools kernel-tools-libs
yum --enablerepo=elrepo-kernel install kernel-ml
grep -P "submenu|^menuentry" /boot/grub2/grub.cfg | cut -d "'" -f2 | grep elrepo | xargs -d "\n" grub2-set-default
grub2-mkconfig -o /boot/grub2/grub.cfg
#3 Reboot and make sure that the new kernel is getting used
[centos@ip-172-31-26-71 ~]$ uname -a
Linux ip-172-31-26-71.us-west-2.compute.internal 4.9.8-1.el7.elrepo.x86_64 #1 SMP Sat Feb 4 11:47:44 EST 2017 x86_64 x86_64 x86_64 GNU/Linux
#4 Stop the instance
aws ec2 stop-instances --instance-ids $instance_id
aws ec2 wait instance-stopped --instance-ids $instance_id
This step is necessary otherwise aws screws up the grub2 configuration when imaging live instance
#5 Take image
image_id=`aws ec2 create-image --instance-id $instance_id --name $1 | grep ImageId | sed 's/\".*\"://' | tr -d '[:space:]' | sed -e 's/^"//' -e 's/"$//'`
aws ec2 wait image-available --image-id $image_id
| 41.707317 | 155 | 0.696491 | eng_Latn | 0.330238 |
4f778db0181953be29582242d8cec349192c50ee | 9,142 | md | Markdown | 2020-03/2020-03-16_short.md | admariner/trending_archive | ffca6522c4fdaa5203c3f18d9a5a7d7da098169c | [
"MIT"
] | 80 | 2015-02-13T16:52:22.000Z | 2022-03-10T20:13:08.000Z | 2020-03/2020-03-16_short.md | admariner/trending_archive | ffca6522c4fdaa5203c3f18d9a5a7d7da098169c | [
"MIT"
] | 65 | 2021-10-02T05:54:01.000Z | 2021-12-28T22:50:23.000Z | 2020-03/2020-03-16_short.md | admariner/trending_archive | ffca6522c4fdaa5203c3f18d9a5a7d7da098169c | [
"MIT"
] | 16 | 2015-10-08T11:06:28.000Z | 2021-06-30T07:26:49.000Z | ### 2020-03-16
diff between today and yesterday
#### python
* [BlankerL/DXY-COVID-19-Data](https://github.com/BlankerL/DXY-COVID-19-Data): 2019 | COVID-19/2019-nCoV Infection Time Series Data Warehouse
* [CTF-MissFeng/bayonet](https://github.com/CTF-MissFeng/bayonet): bayonetsrc
* [3b1b/manim](https://github.com/3b1b/manim): Animation engine for explanatory math videos
* [sibirbil/IMO2020](https://github.com/sibirbil/IMO2020): stanbul'da Makine renmesi (27 Ocak- 2 ubat, 2020) - Ders malzemeleri
* [pi-hole/docker-pi-hole](https://github.com/pi-hole/docker-pi-hole): Pi-hole in a docker container
* [keras-team/keras](https://github.com/keras-team/keras): Deep Learning for humans
* [xiyouMc/WebHubBot](https://github.com/xiyouMc/WebHubBot): Python + Scrapy + MongoDB . 5 million data per day !!! The world's largest website.
* [pikpikcu/Pentest-Tools-Framework](https://github.com/pikpikcu/Pentest-Tools-Framework): Pentest Tools Framework is a database of exploits, Scanners and tools for penetration testing. Pentest is a powerful framework includes a lot of tools for beginners. You can explore kernel vulnerabilities, network vulnerabilities
* [cirosantilli/linux-kernel-module-cheat](https://github.com/cirosantilli/linux-kernel-module-cheat): The perfect emulation setup to study and develop the Linux kernel v5.4.3, kernel modules, QEMU, gem5 and x86_64, ARMv7 and ARMv8 userland and baremetal assembly, ANSI C, C++ and POSIX. GDB step debug and KGDB just work. Powered by Buildroot and crosstool-NG. Highly automated. Thoroughly documented. Automated tests. "Tested" in an Ubuntu 19.10 host.
* [Unity-Technologies/ml-agents](https://github.com/Unity-Technologies/ml-agents): Unity Machine Learning Agents Toolkit
* [gto76/python-cheatsheet](https://github.com/gto76/python-cheatsheet): Comprehensive Python Cheatsheet
* [thunil/TecoGAN](https://github.com/thunil/TecoGAN): This repo will contain source code and materials for the TecoGAN project, i.e. code for a TEmporally COherent GAN
* [zhukeyi123/Python_Work](https://github.com/zhukeyi123/Python_Work):
* [giddyyupp/ganilla](https://github.com/giddyyupp/ganilla): pytorch implementation of GANILLA
* [ioncodes/SMBGhost](https://github.com/ioncodes/SMBGhost): Scanner for CVE-2020-0796 - A SMBv3.1.1 + SMB compression RCE
* [cosmicpython/book](https://github.com/cosmicpython/book): A Book about Pythonic Application Architecture Patterns for Managing Complexity. Cosmos is the Opposite of Chaos you see. O'R. wouldn't actually let us call it "Cosmic Python" tho.
* [TheAlgorithms/Python](https://github.com/TheAlgorithms/Python): All Algorithms implemented in Python
* [google/jax](https://github.com/google/jax): Composable transformations of Python+NumPy programs: differentiate, vectorize, JIT to GPU/TPU, and more
#### go
* [OJ/gobuster](https://github.com/OJ/gobuster): Directory/File, DNS and VHost busting tool written in Go
* [aceld/zinx](https://github.com/aceld/zinx): GolangTCP
* [quii/learn-go-with-tests](https://github.com/quii/learn-go-with-tests): Learn Go with test-driven development
* [similarweb/statusbay](https://github.com/similarweb/statusbay): Kubernetes deployment visibility like a pro
* [Dreamacro/clash](https://github.com/Dreamacro/clash): A rule-based tunnel in Go.
* [pingcap/chaos-mesh](https://github.com/pingcap/chaos-mesh): A Chaos Engineering Platform for Kubernetes
* [hashicorp/consul](https://github.com/hashicorp/consul): Consul is a distributed, highly available, and data center aware solution to connect and configure applications across dynamic, distributed infrastructure.
* [monitoror/monitoror](https://github.com/monitoror/monitoror): Unified monitoring wallboard Light, ergonomic and reliable monitoring for anything.
* [peterq/pan-light](https://github.com/peterq/pan-light): , golang + qt5,
* [gwuhaolin/lightsocks](https://github.com/gwuhaolin/lightsocks):
* [wenjianzhang/go-admin](https://github.com/wenjianzhang/go-admin): Gin + Vue + Element UI
* [oragono/oragono](https://github.com/oragono/oragono): A modern IRC server (daemon/ircd) written in Go.
* [reviewdog/reviewdog](https://github.com/reviewdog/reviewdog): Automated code review tool integrated with any code analysis tools regardless of programming language
#### cpp
* [google/or-tools](https://github.com/google/or-tools): Google's Operations Research tools:
* [flightlessmango/MangoHud](https://github.com/flightlessmango/MangoHud): A Vulkan and OpenGL overlay for monitoring FPS, temperatures, CPU/GPU load and more. Discord: https://discordapp.com/invite/Gj5YmBb
* [pisa-engine/pisa](https://github.com/pisa-engine/pisa): PISA: Performant Indexes and Search for Academia
* [Aircoookie/WLED](https://github.com/Aircoookie/WLED): Control WS2812B RGB LEDs with an ESP8266 over WiFi!
* [luc-github/ESP3D](https://github.com/luc-github/ESP3D): FW for ESP8266/ESP8285/ESP32 used with 3D printer
* [mozilla/DeepSpeech](https://github.com/mozilla/DeepSpeech): A TensorFlow implementation of Baidu's DeepSpeech architecture
* [yuzu-emu/yuzu](https://github.com/yuzu-emu/yuzu): Nintendo Switch Emulator
* [xoseperez/espurna](https://github.com/xoseperez/espurna): Home automation firmware for ESP8266-based devices
* [Errichto/youtube](https://github.com/Errichto/youtube): codes for my streams and YT videos
* [polybar/polybar](https://github.com/polybar/polybar): A fast and easy-to-use status bar
* [dolphin-emu/dolphin](https://github.com/dolphin-emu/dolphin): Dolphin is a GameCube / Wii emulator, allowing you to play games for these two platforms on PC with improvements.
* [zxystd/IntelBluetoothFirmware](https://github.com/zxystd/IntelBluetoothFirmware): Intel bluetooth drivers
* [google/leveldb](https://github.com/google/leveldb): LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.
* [TrinityCore/TrinityCore](https://github.com/TrinityCore/TrinityCore): TrinityCore Open Source MMO Framework (master = 8.3.0.33528, 3.3.5 = 3.3.5a.12340)
* [nRF24/RF24](https://github.com/nRF24/RF24): Optimized fork of nRF24L01 for Arduino & Raspberry Pi/Linux Devices
* [RPCS3/rpcs3](https://github.com/RPCS3/rpcs3): PS3 emulator/debugger
* [ethereum/solidity](https://github.com/ethereum/solidity): Solidity, the Contract-Oriented Programming Language
* [supercollider/supercollider](https://github.com/supercollider/supercollider): An audio server, programming language, and IDE for sound synthesis and algorithmic composition.
* [ValveSoftware/Proton](https://github.com/ValveSoftware/Proton): Compatibility tool for Steam Play based on Wine and additional components
* [LeelaChessZero/lc0](https://github.com/LeelaChessZero/lc0): The rewritten engine, originally for tensorflow. Now all other backends have been ported here.
#### javascript
* [opencovid19-fr/data](https://github.com/opencovid19-fr/data): Consolidation des donnes de sources officielles concernant l'pidmie de COVID19
* [Code-Pop/watch-us-build-trello](https://github.com/Code-Pop/watch-us-build-trello):
* [vuejs/vuex](https://github.com/vuejs/vuex): Centralized State Management for Vue.js.
* [ccxt/ccxt](https://github.com/ccxt/ccxt): A JavaScript / Python / PHP cryptocurrency trading API with support for more than 120 bitcoin/altcoin exchanges
* [OHIF/Viewers](https://github.com/OHIF/Viewers): OHIF zero-footprint DICOM viewer and oncology specific Lesion Tracker, plus shared extension packages
* [lazd/coronadatascraper](https://github.com/lazd/coronadatascraper): A scraper that pulls coronavirus case data from verified sources.
* [lesspass/lesspass](https://github.com/lesspass/lesspass): stateless open source password manager
* [lyswhut/lx-music-desktop](https://github.com/lyswhut/lx-music-desktop): electron
* [tanaypratap/teamtanay.jobchallenge.dev](https://github.com/tanaypratap/teamtanay.jobchallenge.dev): The web repository for all things #teamtanayjobchallenge
* [DIYgod/RSSHub](https://github.com/DIYgod/RSSHub): Everything is RSSible
* [nuxt-community/auth-module](https://github.com/nuxt-community/auth-module): Zero-boilerplate authentication support for Nuxt
* [haotian-wang/google-access-helper](https://github.com/haotian-wang/google-access-helper):
* [SadeghHayeri/GreenTunnel](https://github.com/SadeghHayeri/GreenTunnel): GreenTunnel is an anti-censorship utility designed to bypass the DPI system that is put in place by various ISPs to block access to certain websites.
* [2019ncovmemory/nCovMemory](https://github.com/2019ncovmemory/nCovMemory): 2020 Memory of 2020 nCoV: Media Coverage, Non-fiction Writings, and Individual Narratives (Continuously updating)
* [MichMich/MagicMirror](https://github.com/MichMich/MagicMirror): MagicMirror is an open source modular smart mirror platform. With a growing list of installable modules, the MagicMirror allows you to convert your hallway or bathroom mirror into your personal assistant.
#### coffeescript
* [michaelficarra/CoffeeScriptRedux](https://github.com/michaelficarra/CoffeeScriptRedux): rewrite of the CoffeeScript compiler with proper compiler design principles and a focus on robustness and extensibility
| 114.275 | 453 | 0.78462 | eng_Latn | 0.339783 |
4f78a50137f299020f7e51ebf8a32382bb432dfa | 1,418 | md | Markdown | 2020/08/09/2020-08-09 13:25.md | zhzhzhy/WeiBoHot_history | 32ce4800e63f26384abb17d43e308452c537c902 | [
"MIT"
] | 3 | 2020-07-14T14:54:15.000Z | 2020-08-21T06:48:24.000Z | 2020/08/09/2020-08-09 13:25.md | zhzhzhy/WeiBoHot_history | 32ce4800e63f26384abb17d43e308452c537c902 | [
"MIT"
] | null | null | null | 2020/08/09/2020-08-09 13:25.md | zhzhzhy/WeiBoHot_history | 32ce4800e63f26384abb17d43e308452c537c902 | [
"MIT"
] | null | null | null | 2020年08月09日13时数据
Status: 200
1.张雨绮回应伊能静小作文
微博热度:3832293
2.日本研究发现变异新冠病毒
微博热度:3111881
3.打卡大武汉开启新旅程
微博热度:3111110
4.深圳航空ZH9209
微博热度:3034775
5.杨迪 我必须和你杠到底
微博热度:2983402
6.吴磊
微博热度:2558626
7.虽然是精神病但没关系首尾呼应
微博热度:1391811
8.26岁工学女博士获聘湖南大学副教授
微博热度:787010
9.白岩松谈张玉环案
微博热度:735443
10.黎巴嫩首都发生大规模示威活动
微博热度:708159
11.王漫妮最后还是单身
微博热度:684582
12.贾玲吴彤为杨迪发声
微博热度:593619
13.深圳航空一架客机遇紧急情况返航
微博热度:460279
14.以家人之名超长片花
微博热度:460093
15.全美共发现超33.8万名儿童感染新冠
微博热度:454554
16.深圳航空回应航班紧急返航
微博热度:450841
17.朴宰范加盟中国新说唱
微博热度:447399
18.soul崩了
微博热度:444319
19.河南特岗
微博热度:443023
20.35名老兵守护去世战友女儿长大
微博热度:435888
21.木工爷爷为小孙子做螳螂车
微博热度:427528
22.张月发文与林有有道别
微博热度:420256
23.大爷卖鹅违章交警全部买下
微博热度:411870
24.河北科技大学
微博热度:408568
25.美国每66人中就有1人感染新冠病毒
微博热度:406271
26.张公案
微博热度:387717
27.严浩翔粉和李泽言粉
微博热度:361970
28.时代少年团 姐姐真漂亮
微博热度:349703
29.恋与制作人
微博热度:343675
30.黎巴嫩外交部被抗议者占领
微博热度:319887
31.韩国暴雨已造成28人死亡
微博热度:314899
32.张艺兴小绵羊变成老狐狸了
微博热度:301852
33.王嘉尔震惊到说了九个哇
微博热度:291053
34.黄鹤楼免票首日客流量涨3倍
微博热度:243060
35.荷兰驻黎巴嫩大使夫人在爆炸中身亡
微博热度:233715
36.70年代大熊猫街头卖艺
微博热度:227692
37.王一博被迫撒娇
微博热度:223422
38.雪炫
微博热度:215100
39.梅西一条龙
微博热度:200441
40.微软
微博热度:199820
41.粉笔模考
微博热度:197078
42.今天国际猫咪日
微博热度:172305
43.NBA各奖项候选名单
微博热度:160360
44.核电站海底种珊瑚
微博热度:147358
45.恋与制作人声明
微博热度:142013
46.声音玩具淘汰
微博热度:141001
47.权珉娥 我不要委屈地离开
微博热度:138521
48.福建平潭暖夜灯柱
微博热度:136946
49.新疆新增15例本土病例
微博热度:133728
50.粉丝机场送毛不易毛氏场面话
微博热度:132895
| 6.95098 | 21 | 0.782087 | yue_Hant | 0.392883 |
4f79f31bc4321c35f047de35ac6716386339cd81 | 329 | md | Markdown | _includes/04-lists.md | writeClearly/markdown-portfolio | f96907d338c70fc5360db3d527beea0ac9e5f338 | [
"MIT"
] | null | null | null | _includes/04-lists.md | writeClearly/markdown-portfolio | f96907d338c70fc5360db3d527beea0ac9e5f338 | [
"MIT"
] | 5 | 2021-04-08T16:49:41.000Z | 2021-04-11T12:24:36.000Z | _includes/04-lists.md | writeClearly/markdown-portfolio | f96907d338c70fc5360db3d527beea0ac9e5f338 | [
"MIT"
] | null | null | null | Replace this with a list of your favorite things.
# ✔️ \*:MyEmoji\*
- [ ] Unchecked require space inside brackets to work
- [x] Checked
1. Ordered
2. List
1. Nested
2. Inside
3. To achive
4. Press
5. Tab
6. Twice
- Dash is enough for unordered list
- Line break \<br\><br>
. What if i place a random dot
| 20.5625 | 53 | 0.641337 | eng_Latn | 0.956451 |
4f7a12e7c04a3e321e13efc56c77e4b8b485f03b | 50 | md | Markdown | _cards/BLYTHE.md | stokeclimsland/stokeclimsland | 93ce79c0012842783608410a6823c4bb46b0b466 | [
"MIT"
] | null | null | null | _cards/BLYTHE.md | stokeclimsland/stokeclimsland | 93ce79c0012842783608410a6823c4bb46b0b466 | [
"MIT"
] | null | null | null | _cards/BLYTHE.md | stokeclimsland/stokeclimsland | 93ce79c0012842783608410a6823c4bb46b0b466 | [
"MIT"
] | null | null | null | ---
title: BLYTHE
is_name: true
---
BLYTH(E)
| 4.545455 | 13 | 0.56 | eng_Latn | 0.554264 |
4f7c283d8ec28ed1805509e93996493eecf76c6e | 2,775 | markdown | Markdown | _posts/etc/2020-08-02-add-gist-plugin.markdown | daesungRa/namu | 8a6e5b74a20189fb56d498155e81f55daeb03f52 | [
"MIT"
] | null | null | null | _posts/etc/2020-08-02-add-gist-plugin.markdown | daesungRa/namu | 8a6e5b74a20189fb56d498155e81f55daeb03f52 | [
"MIT"
] | 78 | 2020-10-02T12:50:55.000Z | 2022-03-27T08:08:46.000Z | _posts/etc/2020-08-02-add-gist-plugin.markdown | daesungRa/namu | 8a6e5b74a20189fb56d498155e81f55daeb03f52 | [
"MIT"
] | null | null | null | ---
title: 지킬 블로그에 플러그인 추가하기(with gist)
date: 2020-07-30 22:23:00 +0900
author: namu
categories: etc
permalink: "/etc/:year/:month/:day/:title"
image: https://jekyllrb.com/img/jekyll-og.png
image-view: true
image-author: jekyllrb
image-source: https://jekyllrb.com/img/jekyll-og.png
---
---
[목차]
1. [들어가며](#들어가며)
2. [플러그인 추가하기](#플러그인-추가하기)
3. [gist 추가해보기](#gist-추가해보기)
---
### 들어가며
[지킬```jekyll```](https://jekyllrb.com/docs/)은 [```ruby on rails```](https://rubyonrails.org/) 프레임워크 기반
정적 사이트 생성기이다. 지금 이 블로그도 지킬로 빌드되어 [```github.io```](https://pages.github.com/) 에서 자동배포되고 있다.
블로그 구축 과정은 꽤나 복잡하니 다음에 다뤄 보기로 하고.. 오늘은 이 지킬 블로그에 새로운 플러그인을 추가하는 방법을 알아보자.
설치할 플러그인은 [**```jekyll-gist```**](https://github.com/jekyll/jekyll-gist)이다.
### 플러그인 추가하기
각 플러그인들은 [Ruby gem](https://rubygems.org/) 이라는 패키지 라이브러리 관리자를 통해 설치 및 관리가 가능하다.
이것을 활용하면 [rubygems.org](https://rubygems.org/) 아카이브로부터 데이터를 가져온다(yum 이나 apt 와 같은 역할).
또한 이 관리자는 사용자 PC의 환경(CPU, OS 등)에 따라서 구분되어 있으므로, 버전을 확인하는것이 꼭 필요하다.
지킬 패키지 관리도 이를 통해 이루어진다.
이제 내 지킬 프로젝트의 Gemfile 에 설치하고자 하는 플러그인을 추가해보자.
```text
$ gem "jekyll-gist"
```
혹은, 곧바로 설치하기 위해 다음과 같이 하거나,
```text
$ gem install jekyll-gist
```
직접 Gemfile 에 라인을 추가한다.
```text
[Gemfile]
...
gem "jekyll", "~> 3.7.4"
...
# Windows and JRuby does not include zoneinfo files, so bundle the tzinfo-data gem
# and associated library.
install_if -> { RUBY_PLATFORM =~ %r!mingw|mswin|java! } do
...
gem "jekyll-gist", "~> 1.5.0"
...
end
```
세 가지 방법은 모두 Gemfile 에 라인을 추가하는 동일한 작업이다. 방법의 차이일 뿐이다.
그러나 만약 의존성을 기입하지 않았다면 gem 을 다룰 때 [```bundler```](https://ruby-korea.github.io/bundler-site/) 가 필요하다.
이것은 자동으로 패키지 의존성을 관리해주는 도구이다.
위 세 번재 방식에서는 ```jekyll-gist``` 1.5.0 버전이 ```jekyll``` 3.7.4 버전에 의존되도록 정의되어 있으나(3.0.0 이상),
나머지 방식에는 따로 정의되지 않았으므로, bundler 를 활용해야 한다. 사실상 항시 bundler 를 통한다고 생각하면 된다.
```text
$ bundler update
```
현재 프로젝트에서 Gemfile 에 기록된 목록대로 패키지 의존성 업데이트를 시도한다.<br>
이제 프로젝트의 ```_config.yaml``` 에 설치한 ```jekyll-gist``` 를 입력하고,
```text
# Build settings
# theme: lagrange
plugins:
...
- jekyll-gist
```
빌드 및 서비스를 해보자.
```text
$ bundle exec jekyll serve
```
빌드 잘 된다!
### gist 추가해보기
gist 는 코드블럭 등을 github 아카이브에 저장해두고 링크를 통해 참조할 수 있는 너무너무 깔끔하고 손쉬운 기능이다.
이제 플러그인 설치와 빌드가 완료되었으므로, 내 post 에 gist 박스를 추가해보자.
[gist.github.com](https://gist.github.com/) 에 접속하고 github 계정으로 로그인하면 바로 코드블럭을 만들 수 있다.
secret 혹은 public 방식으로 gist 를 create 한 뒤에 생성된 gist 키값을 post 의 원하는 위치에 다음과 같이 추가해주면 된다.
```text
{% raw %}{% gist daesungRa/07ea5ccd0c1b7576e1a4421bff35e944 %}{% endraw %}
```
그럼 gist.github 사이트의 링크로부터 코드블럭을 불러와 삽입해준다!
끝~
| 22.379032 | 102 | 0.676757 | kor_Hang | 1.000003 |
4f7e1b3502d54a17a762013ee54cb06e42894f22 | 298 | md | Markdown | _posts/book/2021-03-02-book_1.md | LEESONGHO/GitHubPageMaker | 569c04908e48ff42ca8bd5e403fda3d471aa87dd | [
"MIT"
] | 1 | 2021-03-01T13:50:54.000Z | 2021-03-01T13:50:54.000Z | _posts/book/2021-03-02-book_1.md | LEESONGHO/GitHubPageMaker | 569c04908e48ff42ca8bd5e403fda3d471aa87dd | [
"MIT"
] | 1 | 2021-03-01T16:01:07.000Z | 2021-03-01T16:01:07.000Z | _posts/book/2021-03-02-book_1.md | LEESONGHO/GitHubPageMaker | 569c04908e48ff42ca8bd5e403fda3d471aa87dd | [
"MIT"
] | null | null | null | ---
layout: post
current: post
cover: assets/built/images/book-logo.png
navigation: True
title: Book post (1) - 연습용 업로드 1
date: 2021-03-02 00:20:00
tags: [book]
class: post-template
subclass: 'post tag-book'
author: LEESONGHO
---
{% include book-table-of-contents.html %}
이 글은 첫번째 Book post 입니다. | 18.625 | 41 | 0.714765 | kor_Hang | 0.497246 |
4f80477d6281d9036a6f7c2bd779162b3bd4cd81 | 33 | md | Markdown | README.md | c1156010/user20demorepo | 0b1c9232dd94f262a8403e3634a7e3021c79105d | [
"MIT"
] | null | null | null | README.md | c1156010/user20demorepo | 0b1c9232dd94f262a8403e3634a7e3021c79105d | [
"MIT"
] | null | null | null | README.md | c1156010/user20demorepo | 0b1c9232dd94f262a8403e3634a7e3021c79105d | [
"MIT"
] | null | null | null | # user19demorepo
Demo Repository
| 11 | 16 | 0.848485 | tsn_Latn | 0.227408 |
4f813c5c6a95550b476003b162a3980df74ced4f | 7,287 | md | Markdown | README.md | tombartkowski/Flowy | bbbed69c8e30457deee7e73ef588bf81bc4983d3 | [
"MIT"
] | null | null | null | README.md | tombartkowski/Flowy | bbbed69c8e30457deee7e73ef588bf81bc4983d3 | [
"MIT"
] | null | null | null | README.md | tombartkowski/Flowy | bbbed69c8e30457deee7e73ef588bf81bc4983d3 | [
"MIT"
] | null | null | null | <p align="center">
<a href="https://raw.githubusercontent.com/tombartkowski/Flowy">
<img src="logo.png" alt="Logo" width="150" height="140">
</a>
<h2 align="center"><b>Flowy</b></h2>
<p align="center">
Reactive & declarative event-driven coordination in Swift.
<br />
<br />
<a href="#features">Features </a>
•
<a href="#quick-example">Example</a>
•
<a href="#usage">Usage</a>
•
<a href="#installation">Installation</a>
</p>
</p>
<p align="center">
<a href="https://developer.apple.com/swift/"><img alt="Swift 5.2" src="https://img.shields.io/badge/swift-5.2-orange.svg?style=flat"></a>
<a href="https://github.com/tombartkowski/Flowy/LICENSE"><img alt="License" src="https://img.shields.io/github/license/tombartkowski/Flowy"></a>
<a href="https://github.com/tombartkowski/Flowy"><img alt="Build Status" src="https://img.shields.io/github/last-commit/tombartkowski/Flowy"></a>
</p>
<details open="open">
<summary><h2 style="display: inline-block">Table of Contents</h2></summary>
<ol>
<li>
<a href="#features">Features</a>
</li>
<li>
<a href="#quick-example">Quick Example</a>
</li>
<li>
<a href="#installation">Installation</a>
</li>
<li><a href="#usage">Usage</a></li>
<li><a href="#license">License</a></li>
<li><a href="#contact">Contact</a></li>
<li><a href="#acknowledgements">Acknowledgements</a></li>
</ol>
</details>
## Features
- :white_check_mark: Declarative - declare your Flows behaviour in one place,
- :white_check_mark: Reactive - no more imperative coordination thanks to `RxSwift`,
- :white_check_mark: Event-driven - emit flow events from anywhere and coordination will follow,
- :white_check_mark: Easier decoupling of views,
- :white_check_mark: Simple to get started.
## Quick Example
```swift
enum MyFlowEvent: FlowEvent {
case detailRequired
}
class DetailFlow: Flow {}
class MasterFlow: Flow {
func nextFlowType(for event: FlowEvent) -> FlowType? {
if case event = MyFlowEvent.detailRequired {
return DetailFlow.self
}
return nil
}
}
let flowy = Flowy(rootFlow: MasterFlow())
flowy.registerFlow(DetailFlow.self) { root -> DetailFlow in
DetailFlow(
presentableParent: root,
presentable: UIViewController()
)
}
flowy.start()
//This will perform a transition MasterFlow -> DetailFlow
DefaultEventsSource.shared.events.onNext(MyFlowEvent.detailRequired)
```
## Installation
### Requirements
- Deployment target iOS 10.0+
- Swift 5+
- Xcode 10+
#### CocoaPods
Flowy is available through [CocoaPods](https://cocoapods.org). To install
it, simply add the following line to your Podfile:
```ruby
pod 'Flowy'
```
## Usage
### Basics
Flowy works with `Flows` and `FlowEvents`.
You can think of a `Flow` as a `UIViewController`, or rather an object that references it and the `UIViewController` that presented it.
Each `Flow` defines a map of `FlowEvents` to `Flows` which specifies which `Flow` to transition to on a given `FlowEvent`.
`Flow` also defines a list of `FlowEvents` that dissmis the `Flow` when emitted.
### Defining Flows
To create a basic `Flow` simply create a subclass of the `Flow`.
```swift
import Flowy
class MasterFlow: Flow {
override func nextFlowType(for event: FlowEvent) -> FlowType? {
if case event = MyFlowEvent.detailRequired {
return DetailFlow.self
}
return nil
}
override var presentationMode: Flow.PresentationMode {
.modal
}
override var dismissingEvents: [FlowEvent] {
[MyFlowEvent.masterDone]
}
}
```
Example above will transition to `DetailFlow` when `.detailRequired` event gets emitted. It will also dismiss itself when `.masterDone` event is emitted. `presentationMode` specifies that this `Flow` should always be presented modally.
Flowy ships with `NavigationFlow` and `TabBarFlow` that handle the `UINavigationController` and `UITabBarController` navigation under the hood.
### Defining FlowEvents
To use Flowy you need to define at least one entity that conforms to the `FlowEvent` protocol. In practice that can mean defining a simple `enum`.
```swift
import Flowy
enum MyFlowEvent: FlowEvent {
case detailRequired
case detailDone
case masterDone
}
```
You can create as many `enums` or `structs` as you wish as long they conform to the `FlowEvent` protocol.
#### transitionKey
`transitionKey: String?` is an optional property that specifies a concrete `Flow` to transition to when multiple `FlowEvents` trigger one `Flow`.
### Creating a FlowEventsSourceable
`FlowEventsSourceable` is a `protocol` responsible for delivering `FlowEvents` from your app to Flowy. To create one it's enough to do following.
```swift
import Flowy
import RxSwift
class MyFlowEventsSource: FlowEventsSourceable {
let events = PublishSubject<FlowEvent>()
}
```
You should always use the same instance of `FlowEventsSourceable` that you passed to the `Flowy` instance. The best way to do it is via _Dependency Incjetion_, but this is out of scope of this document.
### Creating Flowy
`Flowy` is the bridge between your app and the Flowy coordination engine. To create one you need a root `Flow` that will begin the coordination and `FlowEventsSourceable` that will drive it.
```swift
import Flowy
let rootFlow = MyRootFlow()
let eventsSource = MyFlowEventsSource()
let flowy = Flowy(
rootFlow: rootFlow,
eventsSource: eventsSource
)
```
You must keep a strong reference to the `flowy` instance. The easiest way to do this is to store it in your `AppDelegate` as a instance property.
#### Registering Flows
To create the needed `Flow` instances during runtime and avoid overhead of creating all views on startup, Flowy uses factory closures to instantiate your `Flows`.
You can think of it as teaching Flowy it should create your `Flows` when the time comes to present them.
To register a `Flow`:
```swift
let flowy = Flowy(...)
flowy.registerFlow(DetailFlow.self) { root -> DetailFlow in
DetailFlow(
presentableParent: root,
presentable: MyViewController()
)
}
```
`root` is the `Presentable` of the `Flow` that coordinates to the `DetailFlow`. `Presentable` is an abstraction over things that can be presented, currently only `UIViewControllers`.
It is a good idea to use a _Dependency Injection_ along with Flowy to create your `UIViewControllers`.
```swift
let container = DependenciesContainer() // Container of registered dependencies, usually provided by a framework like Swinject.
let flowy = Flowy(...)
flowy.registerFlow(DetailFlow.self) { root -> DetailFlow in
DetailFlow(
presentableParent: root,
presentable: container.resolve(MyViewController.self)
)
}
```
### Starting the coordination
After instantiating `Flowy` and registering your `Flows` you just have to call the `start()` method.
```swift
let flowy = Flowy(...)
flowy.registerFlow(...)
flowy.registerFlow(...)
flowy.start()
```
## License
Flowy is available under the MIT license. See the LICENSE file for more info.
## Contact
Tomasz Bartkowski - [@tombartkowski](https://twitter.com/bartkowskitom) - [email protected]
## Acknowledgements
- Icons made by [Freepik](https://www.freepik.com) from [www.flaticon.com](https://www.flaticon.com/)
| 29.148 | 235 | 0.7195 | eng_Latn | 0.937931 |
4f82b13fd44117df0fb9f4a385c4c51ed273b0d7 | 1,620 | md | Markdown | docs/technical-details.md | uwec-innovation-labs/parkingNotifier | e59c6138111c1269592cf54c08a661f491b24489 | [
"MIT"
] | 3 | 2018-12-16T21:16:02.000Z | 2019-03-31T21:29:08.000Z | docs/technical-details.md | clearwater-labs/parkingNotifier | e59c6138111c1269592cf54c08a661f491b24489 | [
"MIT"
] | 139 | 2018-12-03T15:39:05.000Z | 2019-07-10T13:44:42.000Z | docs/technical-details.md | clearwater-labs/parkingNotifier | e59c6138111c1269592cf54c08a661f491b24489 | [
"MIT"
] | null | null | null | # Technical Details
## Status Monitoring
The status of the roads are monitored by scraping the [city website](http://www.ci.eau-claire.wi.us/home). The `monitor.js` file is the controller for the scraping of the website. The script checks for an alert banner at the top of the website, and if the banner is there, it visits the announcement linked to make sure it's a snow emergency alert. This automated check is performed every 30 minutes. If the announcement is a snow emergency, the script takes the contents of announcement and inserts it into a database.
## SMS alerts
SMS alerts are sent out using the database of subscribers. The provider for the messaging is [Twilio](https://www.twilio.com/). This service is the most convenient because it does not require knowledge of carriers and is extremely reliable.
## Development Instructions
Instructions for development can be found [here](./configuration.md)
## Versioning
Parking Notifier API will be maintained under the [Semantic Versioning guidelines](http://semver.org) guidelines as much as possible. Releases will be numbered with the following format:
`<major>.<minor>.<patch>`
And constructed with the following guidelines:
Breaking backward compatibility bumps the major (and resets the minor and patch).
New additions, including new icons, without breaking backward compatibility bumps the minor (and resets the patch).
Bug fixes, changes to brand logos, and misc changes bumps the patch.
## Docker Info
Docker is used to containerize the project. More info about Docker can be found here: https://docs.docker.com/get-started/#docker-concepts | 55.862069 | 519 | 0.788889 | eng_Latn | 0.997884 |
4f82cdb4af4d4f6f813430c0a04f5a66bbc2b8f0 | 645 | md | Markdown | README.md | numworks/setup-emscripten | 95db1a77a6201e5fe8fdfccb066da94a9ed14ebf | [
"MIT"
] | 1 | 2021-12-19T23:26:58.000Z | 2021-12-19T23:26:58.000Z | README.md | numworks/setup-emscripten | 95db1a77a6201e5fe8fdfccb066da94a9ed14ebf | [
"MIT"
] | null | null | null | README.md | numworks/setup-emscripten | 95db1a77a6201e5fe8fdfccb066da94a9ed14ebf | [
"MIT"
] | 4 | 2019-11-02T18:33:56.000Z | 2022-03-25T06:06:50.000Z | # Setup emscripten
This is a GitHub action to setup an emscripten environment.
You can optionally specify which sdk you want to install.
In actions.yml:
```
steps:
- uses: numworks/setup-emscripten@v1
with:
sdk: latest-fastcomp
- run: emcc --version
```
## How to update this action
- Push a new commit with your changes on the `master` branch
- Checkout the `v1` branch
- Rebase `v1` on the top of the `master` branch
- Remove the `node_modules` directory
- Run `npm install` and add the `node_modules` folder to the repository by amending the last commit "Add prod dependencies"
- Force push the `v1` branch to GitHub
| 26.875 | 124 | 0.722481 | eng_Latn | 0.99553 |
4f839bee4c413b5c4994c187be928c3cfda03a22 | 754 | md | Markdown | content/reviews/special/udemy.md | sdiehl28/tutorial-website | c542c720f425811b5d4337bae30e92af277cff38 | [
"MIT"
] | null | null | null | content/reviews/special/udemy.md | sdiehl28/tutorial-website | c542c720f425811b5d4337bae30e92af277cff38 | [
"MIT"
] | null | null | null | content/reviews/special/udemy.md | sdiehl28/tutorial-website | c542c720f425811b5d4337bae30e92af277cff38 | [
"MIT"
] | null | null | null | +++
title = "Udemy"
description = ""
weight = 10
lastmod = 2020-02-05
+++
Udemy courses are on sale seemingly half of the time. A $200 course might go for just $12 during a sale.
Udemy is now starting to offer interactive quizzes, but their quiz platform is no where near as good as Data Camp's interactive web platform.
The best Udemy courses are excellent.
In particular, I recommend:
* [Complete Python Bootcamp](https://www.udemy.com/complete-python-bootcamp/) for a thorough introduction to Python
* [Python for Data Science and Machine Learning Bootcamp](https://www.udemy.com/python-for-data-science-and-machine-learning-bootcamp/learn/v4/overview) for a less thorough, but broader introduction to Python, Data Science and Machine Learning
| 39.684211 | 243 | 0.771883 | eng_Latn | 0.958613 |
4f843e812bb011429ef20647b0ee20d20cdb2a38 | 7,413 | md | Markdown | 100-general/general-concepts/axiom.md | mandober/debrief.math | c6bf21581ccb48a82a74038135bca09c1d0c2a4f | [
"Unlicense"
] | 1 | 2019-01-18T21:56:33.000Z | 2019-01-18T21:56:33.000Z | 100-general/general-concepts/axiom.md | mandober/debrief.math | c6bf21581ccb48a82a74038135bca09c1d0c2a4f | [
"Unlicense"
] | 1 | 2018-06-11T13:41:09.000Z | 2018-06-11T13:41:09.000Z | 100-general/general-concepts/axiom.md | mandober/dust-dllci | 3afc7936579dfefd7f823d774c4ac17cc6c57666 | [
"Unlicense"
] | null | null | null | # Axiom
https://en.wikipedia.org/wiki/Axiom
https://en.wikipedia.org/wiki/List_of_axioms
https://en.wikipedia.org/wiki/Category:Mathematical_axioms
An axiom is a statement that serves as a starting point from which other statements can be logically derived.
Whether an axiom is meaningful, and, if so, what is its meaning, e.g. what it means for an axiom to be "true" is a subject of debate in philosophy and philosophy of mathematics.
Broadly, an axiom is a statement assumed to be true, to serve as a premise for further reasoning and argumentation. The word comes from the Greek `ἀξίωμα` (axíōma) "that which is thought worthy or fit" or "that which commends itself as evident".
However, even though some statements may be evident enough to be taken for granted (justifying this acceptance with one's intuition, experience and knowledge), not all statements fall into this category; and even the ones that do, cannot really be proven without succumbing into the *infinite regression* (because defining or proving a term requires defining or proving its constituent terms, and so on, ad infinitum). And as far the truths that are not (easily) found in nature and experience are concerned, the only option is to take them for granted anyway - because all theories must start somewhere, with a certain set of truths, the axioms should be understood to form the hypothesis of a conditional clause: *if you assume this particular set of axioms, then this particular theorem follows*. Therefore, an axiom need not be true at all; the question is not about the truth of axioms per se, but *about the truth of the conditional with those axioms as the hypothesis and some theorem as the conclusion*, with the conclusion logically following from the axioms.
In classic philosophy, an axiom is a statement that is so evident or well-established, that it is taken for granted, without controversy. In modern logic, an axiom is a premise or starting point for reasoning.
In mathematics, the term "axiom" is used in two related senses:
* *Logical axioms* are usually statements, assumed true, within some defining system of logic, denoted symbolically, e.g. `A ∧ B -> A`.
* *Non-logical axioms* are independent assertions about the elements of the domain of a specific mathematical theory, e.g. `a + b = b + a` in arithmetic. In this sense the term axiom is synonymous with postulate, assumption, hypothesis. In most cases, a non-logical axiom is simply a formal logical expression used in deduction to build a mathematical theory, and may not even be self-evident in nature (e.g. the "parallel postulate" in Euclidean geometry).
To **axiomatize** a system of knowledge is to show that its claims can be derived from a small, well-understood set of sentences i.e. the axioms. There may be multiple ways to axiomatize a given mathematical domain.
## Classic take with Euclid's postulates
Among the ancient Greek philosophers an *axiom* was a claim which could be seen to be self-evidently true without any need for proof.
The root meaning of the word *postulate* is "to demand" and so it is also used in this sense: an author demands of a reader to acknowledge some fact, that some particular thing can be achieved. For example, Euclid demands that one agrees that any two points can be joined by a straight line.
Classically, there was a slight distinction between axioms and postulates: the axioms were common across the sciences, but the postulates were particular to each science. The validity of postulates was to be established by means of real-world experience.
The classical approach is well-illustrated in *Euclid's Elements*, where Euclid first introduces a list of postulates (common-sense geometric facts drawn from the common experience), followed by a list of "common notions" (very basic, self-evident assertions, aka axioms).
Postulates (geometry-specific notions):
1. It is possible to draw a `straight line` between two points.
2. It is possible to extend a `line` segment continuously in both directions.
3. It is possible to describe a `circle` with any center and any radius.
4. It is true that all `right angles` are equal to one another.
5. `Parallel Postulate`: It is true that, if a straight line falling on two straight lines make the interior angles on the same side less than two right angles, the two straight lines, if produced indefinitely, intersect on that side on which are the angles less than the two right angles. That is, if a line intersects two lines by making all the interior angles right angles, then the two lines are parallel (never intersect in Euclidean geometry).
Common notions (axioms, non-specific common notions):
- Things which are equal to the same thing are also equal to one another.
transitivity of equality: (a = b ⋀ b = c) -> a = c
- If equals are added to equals, the wholes are equal.
(a = b ⋀ c = d) -> a + c = b + d
- If equals are subtracted from equals, the remainders are equal.
(a = b ⋀ c = d) -> a - c = b - d
- Things which coincide with one another are equal to one another.
symmetry of equality: a = b <-> b = a
- The whole is greater than the part.
(c = a ⋃ b) ~~> a ⊆ c
## Modern development
A lesson learned by mathematics in the last 150 years is that it is useful to strip the meaning from the mathematical definitions and assertions (axioms, postulates, propositions, theorems) and that one must concede the need for primitive notions (undefined terms or concepts) in any study. Such abstraction or formalization makes mathematical knowledge more general, capable of multiple different meanings, and therefore useful in multiple contexts. (and sidesteps the whole issue of truth of initial assumptions).
## Axioms and infinite regression
Since a theory must start somewhere to avoid the infinite regression, it is free to make a "cut" and choose the starting point in the form of a term that is central to a particular theory, which is introduced without definition. Such starting term is supposed to be taken for granted by appealing to people's intuition as something that is obviously true. For example, the central notion in set theory is set, introduced without definition, sometimes as a mathematical primitive, other times as an axiom (e.g. "there exists the empty set").
It is usually insisted that axioms are obvious truths that are sufficiently evident to anybody with a human's intuition and perception, but this doesn't seems rigorous enough to withstand every critic. And perhaps it should be; why not just let axioms be whatever the author chooses? This is what they come to anyway.
Therefore, in a certain theory, the author comes up with a set of axioms and it is free to choose however ridiculous assumptions as they want. The whole point is this: if you accept this set of axioms as true, then these derived truths follow. I mean, for a number of theories, it already comes down to this. Axioms should be free of obligations and justification. Then, one mathematical matter would have many theories, eash one based on a different set of axiom. The problem is then to rank the competing theorems. An evident way would surely be based on a number of axioms; ceteris paribus, a theory with less axioms would surely subsume the one with more axioms. And if two competing theories have more-less the same number of axioms, perhaps the elegance would play a part, or lobbing, bribe or influencers.
| 105.9 | 1,068 | 0.781735 | eng_Latn | 0.999874 |
4f844299e3d9c5a2dda5e7f4d3d5e7be48fdd32e | 70 | md | Markdown | README.md | VladyslavSarbash/hw-fs-35-node-01 | c378f9ac52250219e6a3f53828413633e245d277 | [
"MIT"
] | null | null | null | README.md | VladyslavSarbash/hw-fs-35-node-01 | c378f9ac52250219e6a3f53828413633e245d277 | [
"MIT"
] | null | null | null | README.md | VladyslavSarbash/hw-fs-35-node-01 | c378f9ac52250219e6a3f53828413633e245d277 | [
"MIT"
] | null | null | null | # hw-fs-35-node-01
img - https://photos.app.goo.gl/N2sXvdKX3kMWwB887
| 17.5 | 49 | 0.728571 | yue_Hant | 0.294692 |
4f844f91e260cbbabdc836ddd41e31f41f65463f | 586 | md | Markdown | README.md | samnabi/previewImagesFromSidebar | b38c38e33eab5f7524a4903ef5d186ddbae5e3ce | [
"MIT"
] | null | null | null | README.md | samnabi/previewImagesFromSidebar | b38c38e33eab5f7524a4903ef5d186ddbae5e3ce | [
"MIT"
] | null | null | null | README.md | samnabi/previewImagesFromSidebar | b38c38e33eab5f7524a4903ef5d186ddbae5e3ce | [
"MIT"
] | null | null | null | # Previews for Sidebar Images
This custom field enables (very basic) previews for images in the sidebar.
## Installation
Clone or download the contents of this repo to `/site/fields/previewImagesFromSidebar`.
Or, install it as a git submodule: `git submodule add https://github.com/dervondenbergen/Kirby-PreviewSidebarImages-Field site/fields/previewImagesFromSidebar`
## Usage
To get previews for a blueprint page, add the custom field of type `previewImagesFromSidebar` to the according blueprint:
```
fields:
previewImagesFromSidebar:
type: previewImagesFromSidebar
```
| 29.3 | 159 | 0.793515 | eng_Latn | 0.433048 |
4f845e9ea12387be1c0b64b10ac976ada98cf989 | 299 | md | Markdown | README.md | tcypyz/tcypyz | b2fc5720f6f62307fc61e46565664ebf2428e3d2 | [
"MIT"
] | null | null | null | README.md | tcypyz/tcypyz | b2fc5720f6f62307fc61e46565664ebf2428e3d2 | [
"MIT"
] | null | null | null | README.md | tcypyz/tcypyz | b2fc5720f6f62307fc61e46565664ebf2428e3d2 | [
"MIT"
] | null | null | null | # tcypyz
## 🚀Git 贡献提交规范
- `feat` 增加新功能
- `fix` 修复问题/BUG
- `style` 代码风格相关无影响运行结果的
- `perf` 优化/性能提升
- `refactor` 重构
- `revert` 撤销修改
- `test` 测试相关
- `docs` 文档/注释
- `chore` 依赖更新/脚手架配置修改等
- `workflow` 工作流改进
- `ci` 持续集成
- `types` 类型定义文件更改
- `wip` 开发中
| 16.611111 | 28 | 0.51505 | yue_Hant | 0.571937 |
4f8480d016ba99afa35a4df1e102576285cb4f1f | 1,251 | md | Markdown | includes/policy/reference/bycat/policies-healthcare-apis.md | beber-msft/azure-docs.de-de | 7ce935d32fff8a0709d7a99b04f85cb50d2ead11 | [
"CC-BY-4.0",
"MIT"
] | 63 | 2017-08-28T07:43:47.000Z | 2022-02-24T03:04:04.000Z | includes/policy/reference/bycat/policies-healthcare-apis.md | beber-msft/azure-docs.de-de | 7ce935d32fff8a0709d7a99b04f85cb50d2ead11 | [
"CC-BY-4.0",
"MIT"
] | 704 | 2017-08-04T09:45:07.000Z | 2021-12-03T05:49:08.000Z | includes/policy/reference/bycat/policies-healthcare-apis.md | beber-msft/azure-docs.de-de | 7ce935d32fff8a0709d7a99b04f85cb50d2ead11 | [
"CC-BY-4.0",
"MIT"
] | 178 | 2017-07-05T10:56:47.000Z | 2022-03-18T12:25:19.000Z | ---
author: georgewallace
ms.service: azure-policy
ms.topic: include
ms.date: 10/11/2021
ms.author: gwallace
ms.custom: generated
ms.openlocfilehash: 6614e9ae7a83e897d1c52d5ccc1f540247b8573a
ms.sourcegitcommit: 54e7b2e036f4732276adcace73e6261b02f96343
ms.translationtype: HT
ms.contentlocale: de-DE
ms.lasthandoff: 10/12/2021
ms.locfileid: "129810564"
---
|Name<br /><sub>(Azure-Portal)</sub> |BESCHREIBUNG |Auswirkungen |Version<br /><sub>(GitHub)</sub> |
|---|---|---|---|
|[Zugriff auf Ihren FHIR-Dienst über CORS nicht allen Domänen gestatten](https://portal.azure.com/#blade/Microsoft_Azure_Policy/PolicyDetailBlade/definitionId/%2Fproviders%2FMicrosoft.Authorization%2FpolicyDefinitions%2Ffe1c9040-c46a-4e81-9aea-c7850fbb3aa6) |Die ursprungsübergreifende Ressourcenfreigabe (Cross-Origin Resource Sharing, CORS) sollte nicht allen Domänen den Zugriff auf Ihren FHIR-Dienst gestatten. Entfernen Sie den Zugriff für alle Domänen zum Schutz Ihres FHIR-Diensts, und definieren Sie explizit diejenigen Domänen, die eine Verbindung herstellen dürfen. |Überprüfung, deaktiviert |[1.0.0](https://github.com/Azure/azure-policy/blob/master/built-in-policies/policyDefinitions/Healthcare%20APIs/HealthcareAPIs_FHIR_Service_RestrictCORSAccess_Audit.json) |
| 69.5 | 775 | 0.815348 | deu_Latn | 0.560069 |
4f8511881913d6b6f04e952a54658f3f2ae6c81a | 6,262 | md | Markdown | _posts/2015-9-27-Week5.md | silencewebber/silencewebber.github.io | 2e40987174e8e0c44fd7f1e904474ea34422cf5b | [
"MIT"
] | null | null | null | _posts/2015-9-27-Week5.md | silencewebber/silencewebber.github.io | 2e40987174e8e0c44fd7f1e904474ea34422cf5b | [
"MIT"
] | null | null | null | _posts/2015-9-27-Week5.md | silencewebber/silencewebber.github.io | 2e40987174e8e0c44fd7f1e904474ea34422cf5b | [
"MIT"
] | null | null | null | ---
layout: post
title: Week 5 of OOP (Generics, Iterators, JPL, and Project 2)
---
So, it's been a while since my last post, and the reason for that largely boils down to three words.
Honors Operating Systems.
If taking CS371P concurrently with CS378 Automated Question Answering with Dr. Porter as well as Structure of Modern Geometry and Intro to Ancient Rome wasn't challenging enough, I'm ALSO taking the infamous CS439H with Ahmed Gheith. Gheith is an amazing teacher, but Operating Systems has been incredibly challenging all by itself. I do NOT recommend taking this many classes alongside 439, for anyone who hasn't taken OS yet. However, OS and OOP have complemented each other nicely in the sense that OS involves considerable use of C++, and OOP drills in HOW to use C++, and its many characteristics and features. So I've had a bit of a headstart from my classmates in OS when it comes to C++. Particularly with the understanding of passing variables by reference, which I think Downing did a great job in teaching by emphasizing that the reference should be thought of as an ALIAS as opposed to a pointer, which Gheith still hasn't properly explained (although the students better have figured it out by now, because the project due today requires that understanding).
In class we've most recently talked about using generics and iterators to create algorithms that can be used on any data structure with an iterator. Downing has had us write an equals function, a copy function, and a fill function in class, after showing us how to set up a [template](http://www.codeproject.com/Articles/257589/An-Idiots-Guide-to-Cplusplus-Templates-Part). He also talked of the different types of [iterators](http://www.cplusplus.com/reference/iterator/), and how different algorithms require different kinds of iterators. The kind of iterator depends on what actions you need the iterator to support for your algorithm to work.
Example: A forward iterator can only iterate in the forward direction, but if you want to implement an in-place reverse() function, you'd need an iterator that can iterate in both directions and swap the values it finds. For that you'd need a bidirectional iterator.
This week we had Alex Menzies visit the class from Jet Propulsion Laboratories. It was really cool to see some of the projects they had recently worked on, particularly in their use of gaming technology like Unity3D and Oculus. I've started using Unity for a couple personal projects and it's always cool to see a tool you've started picking up being used by a serious technology company. His discussion of Scrum and Agile practices in their company was good reinforcement of the related papers Downing has assigned to us.
Finally we come to [Project 2: Australian Voting](http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=13&page=show_problem&problem=1083). I enjoyed the project, as it was a stimulating problem and got me exposed to the C++ STL, particularly with [lists](http://www.cplusplus.com/reference/list/list/) and [vectors](http://www.cplusplus.com/reference/vector/vector/) and functions like emplace_back() which will add an element to the container and construct it on site, precluding the use of "new," and handling memory management for you. I also figured out that the particularly convenient for each loop that exists in Java also exists in C++11 (but not older versions). This made a lot of my logic much easier to write, although probably led to less efficiency.
But the close of Project 2 has been weird. I got an email that there was a problem with my SHA and that I needed to resubmit. The email very helpfully suggested that perhaps I had not pushed the commit in question or that part of the SHA may not have made it into the submission. I went onto github and saw that the commit I intended to submit was indeed pushed to the repo. I checked the SHA on the website right there and the SHA was the same as what was sent in the email. I went to my local repo clone, ran git fetch/pull, and again ran git rev-parse HEAD. The outputted SHA was again the same as the what was sent in the email, as would be expected. I went to Travis CI and pulled up the latest build, which showed a successful build. The SHA displayed on Travis was ALSO the same as the email. At this point I didn't know what the problem could be; I didn't have any issues submitting Project 1. I emailed the graders to this effect, and also went ahead and resubmitted, with the comment that nothing in this resubmission should be different from the original, and with the hope that the submission wouldn't be given the 20% penalty if it suddenly worked this time around. The graders came back with the message that they didn't think I gave them access to my repo... I rechecked github, and I had given them access days ago. I responded that according to my github, they had access, and they responded that indeed that couldn't be the problem, that the problem was with the SHA, and that they'd get back to me. Very confusing. If anyone has any thoughts about what could be the issue, I'd appreciate the help.
Also, reflecting on this process, I think the 20% penalty for a submission issue, even if promptly resolved, is ridiculously harsh. In the business world, problems with "submissions" and the transferring of files happen all the time, and no one gets penalized for it; rather the expectation is that everyone involved pays attention, figures out the problem, and gets it resolved promptly and professionally. To that end, I believe that if a student quickly resolves a submission issue, there should be no penalty whatsoever. But in no way should this be equivalent to NOT submitting the assignment AT ALL for 24 hours beyond the deadline. With the current grading scheme, these two offenses are punished equally, which makes no sense to me. Just my two cents.
#### Tip of the Week
For any of you who would like to interact with a GUI when SSHing into the CS computers, rather than solely using command line, you can use [VNC Viewer](https://www.realvnc.com/download/viewer/) alongside SSH and connect to the CS computers that way. Instructions on how to do so are [here](http://www.science.smith.edu/~ejensen/vncssh.html).
| 215.931034 | 1,616 | 0.79192 | eng_Latn | 0.999833 |
4f857e94305baa03dc6e8a3587265b952803663a | 1,174 | md | Markdown | docs/spiffe.md | niczy/keyhouse | 858d366b54dd38c4339f07ffaa6c890a834fa912 | [
"Apache-2.0"
] | 122 | 2021-08-10T18:13:43.000Z | 2022-03-30T23:29:08.000Z | docs/spiffe.md | niczy/keyhouse | 858d366b54dd38c4339f07ffaa6c890a834fa912 | [
"Apache-2.0"
] | 5 | 2021-09-10T20:38:20.000Z | 2022-03-15T22:07:10.000Z | docs/spiffe.md | niczy/keyhouse | 858d366b54dd38c4339f07ffaa6c890a834fa912 | [
"Apache-2.0"
] | 9 | 2021-08-20T03:46:35.000Z | 2022-03-22T02:17:21.000Z | # Keyhouse SPIFFE Integration
## Required SPIFFE ID Schema
Keyhouse requires all SPIFFE ids to be of the form:
```
spiffe://<trust-domain>(/<key>:<value>)*
```
This is used to support powerful and cheap indexing on SPIFFE ID matchers, and also set a standard for identity matching.
## Outgoing Connections
Keyhouse supports outgoing SPIFFE authorized mTLS to:
* ETCD/other backend stores
* Implementation-defined services (i.e. a master key host)
It uses the internal identity for outgoing connections, which *may* or *may not* be the same as the primary identity.
## Incoming connections
Keyhouses uses SPIFFE bundles to authenticate and SPIFFE IDs to authorize requests. SPIFFE identity is integral to how Keyhouse represents authorization.
The control plane can be configured to use TLS, in which case it accepts clients with a SPIFFE-sourced bundle.
The data plane always uses TLS, and will always use a SPIFFE-sourced bundle to accept clients.
If an alternate authentication mode is defined, then the client->server certificate requirement is relaxed, and each gRPC call MUST have a string based token to authenticate with, which *may* be a SPIFFE JWT token.
| 41.928571 | 214 | 0.787053 | eng_Latn | 0.998219 |
4f86eddd9e11b6e0e7733d7a893312f3f52b60cf | 921 | md | Markdown | README.md | mtgrosser/DenyLocationConsent | 222887b336ec4d22f64a90efd4d075877975c195 | [
"MIT"
] | 7 | 2016-01-31T06:09:10.000Z | 2018-11-02T02:31:15.000Z | README.md | mtgrosser/DenyLocationConsent | 222887b336ec4d22f64a90efd4d075877975c195 | [
"MIT"
] | 17 | 2016-01-31T06:15:37.000Z | 2019-08-22T19:40:57.000Z | README.md | mtgrosser/DenyLocationConsent | 222887b336ec4d22f64a90efd4d075877975c195 | [
"MIT"
] | null | null | null | # [DenyLocationConsent](http://repo.xposed.info/module/org.brainkiller.xposed.denylocationconsent)
Disable the annoying "Improve location accuracy?" dialog and always disagree.
Based on [Xposed-Disable-Location-Consent](https://github.com/MohammadAG/Xposed-Disable-Location-Consent), but doing the opposite.
Use the following versions depending on your version of Play Services:
| Play Services Version | DenyLocationConsent Version |
| ---------------------- | --------------------------- |
| 8.x | 0.3 |
| 9.x | 0.4 |
| >= 12.5.21 | 0.5 |
Tested on Lollipop and CM12.1.
#### Licensing
Copyright © 2016-2018 Matthias Grosser. Licensed under the MIT license.
| 43.857143 | 130 | 0.623236 | eng_Latn | 0.655103 |
4f872efd09c80a7bcf656a6cf0f01ffe1ad6aadd | 27 | md | Markdown | README.md | brixx21/deployfdsdfs | b2036878f01502b946368a146e4f2a38a0b805ba | [
"MIT"
] | 2 | 2020-11-01T03:27:11.000Z | 2020-12-14T22:53:41.000Z | README.md | EdTosoy/Furtech-server-deploy | 82687f1edb86284aad430eb10a8d182881962157 | [
"MIT"
] | null | null | null | README.md | EdTosoy/Furtech-server-deploy | 82687f1edb86284aad430eb10a8d182881962157 | [
"MIT"
] | null | null | null | # FlashCard-Project-Backend | 27 | 27 | 0.851852 | deu_Latn | 0.386955 |
4f88fe19bd2491abaf011882678d42b6d1410b27 | 914 | md | Markdown | content/blog/2013-04-10-project-seishun/index.md | JamesGabby/kurihara | b0cd2f8b02d60e60426b50b14ae951113f8383ed | [
"MIT"
] | 5 | 2019-12-15T08:49:09.000Z | 2022-02-15T13:22:42.000Z | content/blog/2013-04-10-project-seishun/index.md | JamesGabby/kurihara | b0cd2f8b02d60e60426b50b14ae951113f8383ed | [
"MIT"
] | 725 | 2019-07-04T21:12:32.000Z | 2022-03-28T00:22:02.000Z | content/blog/2013-04-10-project-seishun/index.md | JamesGabby/kurihara | b0cd2f8b02d60e60426b50b14ae951113f8383ed | [
"MIT"
] | 1 | 2022-03-14T00:45:35.000Z | 2022-03-14T00:45:35.000Z | ---
draft: false
post_id: 424
publish_date: '2013-04-10T19:01:48.000+08:00'
revise_date: '2013-04-10T19:01:48.000+08:00'
tags:
- 芦苇荡
title: Project Seishun
---
I customized slightly my theme based on the stock theme WP2011. But I'm not feeling enough satisfied and decide to spend some time in building my own theme. The new theme will be named somewhat like Seishun or Sa Jeunesse. This theme is inspired by the website 粋屋 ([http://www.ikiya.jp/](http://www.ikiya.jp/index.html)), the 物語/monogatari series by 西尾維新/Nishio Ishin whose anime versions come always with a motto beginning with seishun and the lightnovel/anime entitled やはり俺の青春ラブコメはまちがっている。 which uses a mincho/song type font.
I'm not sure if I can complete this new theme in several springs, well, life is being hard, I have to struggle in some other affaires, and maybe several days later I'll have it renamed Manatsu. Nothing is impossible XD.
| 65.285714 | 529 | 0.772429 | eng_Latn | 0.998262 |
4f89188494d614e3f0fa67ce75c3359a7e160f4f | 1,270 | md | Markdown | README.md | iAmNathanJ/rrun | b0b6e825ec17013d04fd7115cc34eceacb062bf2 | [
"MIT"
] | null | null | null | README.md | iAmNathanJ/rrun | b0b6e825ec17013d04fd7115cc34eceacb062bf2 | [
"MIT"
] | null | null | null | README.md | iAmNathanJ/rrun | b0b6e825ec17013d04fd7115cc34eceacb062bf2 | [
"MIT"
] | null | null | null | # rrun
This is a small utility to require and run modules from the command line.
## Install
`npm i -D rrun`
## Usage
### Command Line:
```bash
$ rrun path/to/some-module [arguments ...]
```
`rrun` will require a file and run it's default export with any arguments passed along. It can be useful for running development tasks. This way, tasks can be run directly from npm scripts or the command line, but they can also be required and run from other task files. It's not intended to run anything other than basic node modules that export a single function.
### Example Task Setup:
Assume we have a task to compile sass and we want to run it from npm scripts and also from our watch task.
```js
// sass-task.js
module.exports = () => {
// do sassy stuff
};
```
You can use it in your watch task:
```js
const chokidar = require('chokidar');
const sass = require('path/to/sass-task');
chokidar.watch('./src/scss/**/*.scss').on('change', sass);
```
And you can `rrun` it from your npm scripts:
```json
"scripts": {
"sass": "rrun path/to/sass-task"
}
```
**PSA:** You can do the same thing without using `rrun`:
```json
"scripts": {
"any-task": "node -e \"require('path/to/module')()\""
}
```
But ☝️ that is kind of ugly and co-workers may find it confusing.
| 25.918367 | 365 | 0.687402 | eng_Latn | 0.995977 |
4f8939c323fc4441560afa4548d6513a789a20f5 | 67 | md | Markdown | README.md | Nandem/gaphql-java-experiments | 40d4a0c2a2e8c8de0fb7bacc072b95c25d807df7 | [
"Apache-2.0"
] | null | null | null | README.md | Nandem/gaphql-java-experiments | 40d4a0c2a2e8c8de0fb7bacc072b95c25d807df7 | [
"Apache-2.0"
] | null | null | null | README.md | Nandem/gaphql-java-experiments | 40d4a0c2a2e8c8de0fb7bacc072b95c25d807df7 | [
"Apache-2.0"
] | null | null | null | # gaphql-java-experiments
just some experiments about graphql-java
| 22.333333 | 40 | 0.835821 | eng_Latn | 0.799822 |
4f89c1139b49ac19981d2276f1d41fd48657286d | 3,430 | md | Markdown | articles/virtual-machines/scripts/virtual-machines-linux-cli-sample-copy-snapshot-to-storage-account.md | Zwoch/azure-docs.de-de | c76b1dfefc2541ca6d661c9eaca428b42b34ebc8 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/virtual-machines/scripts/virtual-machines-linux-cli-sample-copy-snapshot-to-storage-account.md | Zwoch/azure-docs.de-de | c76b1dfefc2541ca6d661c9eaca428b42b34ebc8 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/virtual-machines/scripts/virtual-machines-linux-cli-sample-copy-snapshot-to-storage-account.md | Zwoch/azure-docs.de-de | c76b1dfefc2541ca6d661c9eaca428b42b34ebc8 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: "Azure CLI-Beispielskript – Exportieren/Kopieren einer Momentaufnahme als VHD in ein Speicherkonto in einer anderen Region | Microsoft-Dokumentation"
description: "Azure CLI-Beispielskript – Exportieren/Kopieren einer Momentaufnahme als VHD in ein Speicherkonto in demselben oder einem anderen Abonnement"
services: virtual-machines-linux
documentationcenter: storage
author: ramankumarlive
manager: kavithag
editor: tysonn
tags: azure-service-management
ms.assetid:
ms.service: virtual-machines-linux
ms.devlang: azurecli
ms.topic: sample
ms.tgt_pltfrm: vm-linux
ms.workload: infrastructure
ms.date: 05/19/2017
ms.author: ramankum
ms.custom: mvc
ms.openlocfilehash: cd555cfea6a84a0bdf0d0c4c9b9b68ae079fbc7b
ms.sourcegitcommit: 8c3267c34fc46c681ea476fee87f5fb0bf858f9e
ms.translationtype: HT
ms.contentlocale: de-DE
ms.lasthandoff: 03/09/2018
---
# <a name="exportcopy-managed-snapshots-as-vhd-to-a-storage-account-in-different-region-with-cli"></a>Exportieren/Kopieren verwalteter Momentaufnahmen als VHD in ein Speicherkonto in einer anderen Region mit der Befehlszeilenschnittstelle
Dieses Skript exportiert eine verwaltete Momentaufnahme in ein Speicherkonto in einer anderen Region. Zuerst generiert es den SAS-URI der Momentaufnahme, mit dem es diese anschließend in ein Speicherkonto in einer anderen Region kopiert. Verwenden Sie dieses Skript, um Sicherungen Ihrer verwalteten Datenträger für die Notfallwiederherstellung in einer anderen Region zu verwalten.
[!INCLUDE [sample-cli-install](../../../includes/sample-cli-install.md)]
[!INCLUDE [quickstarts-free-trial-note](../../../includes/quickstarts-free-trial-note.md)]
## <a name="sample-script"></a>Beispielskript
[!code-azurecli[main](../../../cli_scripts/virtual-machine/copy-snapshots-to-storage-account/copy-snapshots-to-storage-account.sh "Copy snapshot")]
## <a name="script-explanation"></a>Erläuterung des Skripts
Dieses Skript verwendet die folgenden Befehle zum Generieren des SAS-URI für eine verwaltete Momentaufnahme und zum Kopieren der Momentaufnahme in ein Speicherkonto mithilfe dieses SAS-URI. Jeder Befehl in der Tabelle ist mit der zugehörigen Dokumentation verknüpft.
| Get-Help | Notizen |
|---|---|
| [az snapshot grant-access](https://docs.microsoft.com/cli/azure/snapshot#az_snapshot_grant_access) | Generiert eine schreibgeschützte Shared Access Signature (SAS), die verwendet wird, um die zugrunde liegende VHD-Datei in ein Speicherkonto zu kopieren oder lokal herunterzuladen |
| [az storage blob copy start](https://docs.microsoft.com/cli/azure/storage/blob/copy#az_storage_blob_copy_start) | Kopiert ein Blob asynchron aus einem Speicherkonto in ein anderes |
## <a name="next-steps"></a>Nächste Schritte
[Erstellen verwalteter Datenträger aus einer VHD](virtual-machines-linux-cli-sample-create-managed-disk-from-vhd.md?toc=%2fcli%2fmodule%2ftoc.json)
[Erstellen eines virtuellen Computers aus einem verwalteten Datenträger](./virtual-machines-linux-cli-sample-create-vm-from-managed-os-disks.md?toc=%2fcli%2fmodule%2ftoc.json)
Weitere Informationen zur Azure CLI finden Sie in der [Azure CLI-Dokumentation](https://docs.microsoft.com/cli/azure).
Zusätzliche CLI-Skriptbeispiele für virtuelle Computer und verwaltete Datenträger finden Sie in der [Dokumentation zu Linux-VMs in Azure](../../app-service/app-service-cli-samples.md?toc=%2fazure%2fvirtual-machines%2flinux%2ftoc.json).
| 60.175439 | 383 | 0.801458 | deu_Latn | 0.9343 |
4f8aa1382eba0e155bd207911b7c4005375c93b1 | 9,943 | md | Markdown | TEDx/Titles_starting_A_to_O/Eradicating_Tuberculosis_Andreas_Kupz_TEDxJCUCairns.md | gt-big-data/TEDVis | 328a4c62e3a05c943b2a303817601aebf198c1aa | [
"MIT"
] | 91 | 2018-01-24T12:54:48.000Z | 2022-03-07T21:03:43.000Z | cleaned_tedx_data/Titles_starting_A_to_O/Eradicating_Tuberculosis_Andreas_Kupz_TEDxJCUCairns.md | nadaataiyab/TED-Talks-Nutrition-NLP | 4d7e8c2155e12cb34ab8da993dee0700a6775ff9 | [
"MIT"
] | null | null | null | cleaned_tedx_data/Titles_starting_A_to_O/Eradicating_Tuberculosis_Andreas_Kupz_TEDxJCUCairns.md | nadaataiyab/TED-Talks-Nutrition-NLP | 4d7e8c2155e12cb34ab8da993dee0700a6775ff9 | [
"MIT"
] | 18 | 2018-01-24T13:18:51.000Z | 2022-01-09T01:06:02.000Z |
so let me start by asking you a question
can anyone here read that sign on the
slide if you can't I guess most of you
probably think it has something to do
with cows or his children so let me tell
you story the story behind this sign so
I'm that little boy in the middle and
and I grew up in East Germany and when I
grew up I walked past this sign almost
every day because it was attached to a
door on my family's farm where we kept
our cows it essentially translates to
certified tuberculosis free cattle you
know being a little boy I didn't think
much of all at all I only knew from my
grandfather that tuberculosis is a
disease that can make house very sick
but apart from this you know as being a
little boy I didn't I didn't care much
about it
so now fast-forward 30 odd years and I'm
standing here giving a presentation
about eradicating tuberculosis so why is
that obviously you know a lot of things
change in 30 years not just the way I
dress but also I'm now a trained
microbiologist and I specialize in
infectious disease research and
particularly on tuberculosis so
obviously I now know a lot more and I
know that TB how tuberculosis is also
known doesn't just affect cows it
actually a major problem in the world so
let me start by giving you some facts so
TB as I said tuberculosis also known is
the biggest killer amongst all
infectious diseases on that planet over
the last 200 years it is estimated that
TB has killed about 1 billion people so
this is more than malaria plague
smallpox influenza HIV cholera combined
that's all diseases you may have heard
about
but what about closer to you know 2017
so the latest data we've got is from
2015 and even two years ago there was
still one point eight million people
dying from tuberculosis more than ten
million cases and so why is this just to
put into context the recent Ebola
outbreak in western Africa killed about
eleven to twelve thousand people this is
about tuberculosis kills more in two
days every day every year but not too
many people know about it why is this TB
is a lung disease it's caused by a
bacterium called microbiome tuberculosis
and it really affects mainly to poor
people on the planet because it's a
disease of overcrowding and poor hygiene
and it all starts when an infected
patient that has active tuberculosis
coughs up the bacteria and they can
infect others around them and we know
that about two billion people in other
words about a third of the world's
population is infected with tuberculosis
luckily only 1.8 million people of those
died but it's still why too many so I
said that TB is a disease of the poor
people on the planet and you can see
here on the world map that it really
affects mainly developing countries in
sub-saharan Africa Asia Eastern Europe
and also South America and unfortunately
these are the same regions of the world
where other infectious diseases such as
hiv/aids is very prevalent and we know
that being infected was both disease at
the same time is a major risk factor for
actually dying when you infected with
tuberculosis however probably the most
the more relevant problem and also more
relevant to people in in the Western
world is that it becomes incredibly
harder to treat tuberculosis
tuberculosis is a treatable disease if
you've got it you have to take drugs for
about six months and then if you strain
it in fact you as susceptible to those
drugs you will be cured however over the
last decade or so more and more of those
bacteria have become resistant to the
drugs that we use to treat TB and we
call that multi drug-resistant
tuberculosis or MDR TB the slide you can
see here you know it's not a solar
system and I don't really want you to
look at all the details but it's a very
interesting slide from the World Health
Organization that shows us how much it
costs to treat one case of multi
drug-resistant tuberculosis in different
countries of the world and without
looking at all the details it really
tells us that in many countries it is
more expensive to treat one case of
multi drug-resistant tuberculosis than
the GDP per capita in that country so
it's an enormous public health issue and
it's very very expensive and if you
think that MDR TB is far away then think
twice because here in Far North topical
Queensland we're only a short boat ride
away from one of the most severe
outbreaks of multi drug-resistant
tuberculosis on the planet on some of
those islands of the coast of Papua New
Guinea we have such a high incidence of
MDR TB that there is a major problem and
you know that it's only a short trip
from one island to the next from Papua
New Guinea to Australia and from one of
those islands to the mainland and Bucs
don't respect borders once they're on
the mainland they can go anywhere so
what can we do and this is really where
scientists like myself come in because
we know that instead of treating a
disease we can also prevent it or we can
even eliminate it and how can we do this
we know that the only and the best way
to read acade a disease is vaccination
because we've done it before
we have almost eradicated polio which
you can see here and we have eradicated
smallpox both of these diseases where
all are almost eradicated because we
have an effective vaccine that was
rolled out worldwide by the World Health
Organization the WHL Water Association
has put out a very ambitious goal to
eliminate TB by 2050 this is about 35
years from now the same timeframe utley
can see here for polio so we know that
if we will have an effective vaccine it
is possible to eradicate tuberculosis
some of you in the audience may think
now oh well there's a vaccine against TB
I've probably got it when I was a child
and yes that's right there is a vaccine
it's called BCG it was introduced in
1921 and it's been given to more than
four billion people on the planet
unfortunately TB doesn't DCG does not
prevent the real lung tuberculosis in
adults it has prevented several millions
of kids from dying from childhood
versions of tuberculosis but it will
never stop the transmission cycle and
therefore help us to eliminate a disease
and again this is the point where
scientists like myself and others can
make a difference
there are about several dozen different
research groups on the planet currently
working to make a better TB vaccine I'm
one of them and although this slide may
look like a bit of a race it is really a
global effort where we all come together
and try to make a difference to come up
with a effective vaccine that works to
develop a vaccine is very expensive and
long process it takes at least 20 years
to move a vaccine from the preclinical
studies all the way through to a
licensed product
you can see here illustrated by those
blue bars that some of those vaccine
candidates how we call them have already
progressed to different parts of these
clinical pipeline some are very close to
being licensed but unfortunately in very
recent years it has become apparent that
many of those vaccines are not better
than BCG so there may be an option an
alternative to BCG but they've warmed
help us eliminate the disease and that
is why we can't be complacent that we
have to continue to work on new concepts
new methods and new strategies to
develop a vaccine that actually works
the little red arrow on the bottom
that's me my vaccine is still in the
preclinical stages but I'm trying to
work on new concepts that are currently
not used by those Iraq vaccines and this
is where the science comes in so I'm
trying to keep it as simple as possible
but there was me so most vaccines target
immune cells in your body depicted here
by those purple cell when a vaccine is
introduced shown here in red it has
taken up by those cells and then
presented on the surface of these cells
that's how we call this and this leads
to the attraction of other immune cells
and they then lead to protection against
the disease this is quite common for
most diseases and most vaccines
unfortunately for the vaccines being
developed for tuberculosis many of the
ones that are currently going through
this clinical pipeline targeted cell
type that is destroyed by HIV and I've
told you earlier that HIV is a major
risk factor for reactivation of
tuberculosis
so these vaccines will not work in
particular in the context of HIV in
these countries so I had a different
idea I am a microbiologist so I can work
on genetically engineered bacteria and
immunology so what I did
we still introduced a vaccine we still
target these particular immune cells
well what we did is we made a vaccine
that remains inside the cell and what
that does it leads to the secretion of
messenger molecules how we call them and
these messenger molecules target
particular cell types that can also be
protective but they do not get destroyed
by HIV infection and secondly we are
also trying to work on a new approach to
deliver the vaccine because currently
BCG is given as a needle injection and
believe me not many children will look
like this and have just been given so
but we also know that a needle based
vaccination only generates immune cells
that are kind of circulating through the
body but not really go to the lung where
they're needed when a tuberculosis
infection occurs so in our approach
we're also trying to develop a vaccine
that can be administered directly into
the lung was a puffer and we know that
this approach generates a particular
type of immune cell that remains in the
lung and can act directly when
tuberculosis infection occurs and if
this approach will be successful this
global effort comes to a conclusion then
I hope by 2050 when I would be a
grandfather I will be able to tell my
grandchildren that TB has been
eradicated not just from cows in East
Germany but from everyone in the whole
world thank you
[Applause]
| 37.806084 | 46 | 0.80519 | eng_Latn | 0.999994 |
4f8b23ebc2af4780f5fe163a27c81856780755d0 | 24 | md | Markdown | README.md | ramakrishna-bitla/MyfirstApp | 86dc3b06945dd021bc12664f0870fbd36b4cf92e | [
"MIT"
] | null | null | null | README.md | ramakrishna-bitla/MyfirstApp | 86dc3b06945dd021bc12664f0870fbd36b4cf92e | [
"MIT"
] | null | null | null | README.md | ramakrishna-bitla/MyfirstApp | 86dc3b06945dd021bc12664f0870fbd36b4cf92e | [
"MIT"
] | null | null | null | # MyfirstApp
Sample App
| 8 | 12 | 0.791667 | eng_Latn | 0.520777 |
4f8c6263cf91e56e632a86fbf7ed91f9cef5f1ce | 53 | md | Markdown | README.md | cscfa/bartleby | 62a00d8710afc9c698d3336649d8da0fcf79f355 | [
"MIT"
] | 1 | 2015-06-26T04:57:42.000Z | 2015-06-26T04:57:42.000Z | README.md | cscfa/bartleby | 62a00d8710afc9c698d3336649d8da0fcf79f355 | [
"MIT"
] | null | null | null | README.md | cscfa/bartleby | 62a00d8710afc9c698d3336649d8da0fcf79f355 | [
"MIT"
] | null | null | null | # bartleby
Database manager with fullREST API access
| 17.666667 | 41 | 0.830189 | kor_Hang | 0.908819 |
4f8cd4f21975b0f7f2015f06899e536cbe85b8ee | 1,112 | md | Markdown | site/source/_posts/1932年05月29日.md | kokohuang/WarOfResistanceLive | 5a55b0eb2f2f8a00dbf753067bf61fdc8894c15a | [
"MIT"
] | 68 | 2020-11-30T18:37:16.000Z | 2021-08-16T13:37:02.000Z | site/source/_posts/1932年05月29日.md | kokohuang/WarOfResistanceLive | 5a55b0eb2f2f8a00dbf753067bf61fdc8894c15a | [
"MIT"
] | null | null | null | site/source/_posts/1932年05月29日.md | kokohuang/WarOfResistanceLive | 5a55b0eb2f2f8a00dbf753067bf61fdc8894c15a | [
"MIT"
] | 4 | 2020-12-08T06:47:10.000Z | 2021-08-16T13:37:18.000Z | ---
layout: post
title: "1932年05月29日"
date: 2021-05-29
categories: 局部抗战(1931-1937)
---
<meta name="referrer" content="no-referrer" />
- 1932年5月29日讯：唐柯三在京招待记者报告调解康、藏纠纷经过，称：“康、藏纠纷，发生于大金、白利两方财产之争执，不意甘孜知事措置失当，激成变乱，以致藏番猖獗，迭陷甘瞻。余秉中央意旨，与藏方议订条件，国人不满意，以割地赔款见责，实太冤枉。”
- 1932年5月29日讯：上海童子军战地服务团全体复员。
- 1932年5月29日讯：上海引翔港三友实业社总厂日军撤退。
- 1932年5月29日讯：上午5时，日军第十四师团平松支队进攻肇东李海青义勇军，旋占领肇东。
- 1932年5月29日《申报》：鞍山息，今晨三时半，马贼袭击鞍山东面大孤山之日本警察派出所，日警负伤。后并袭击满铁制铁所、大孤山之采矿所，绑去该所主任等要员三人。（28日电通社电）
- #抗战影像#可能正在训练中的一支伪满洲国陆军迫击炮部队。 <br/><img src="https://wx3.sinaimg.cn/large/aca367d8ly8gqz45t8zqdj20hs0a0jsf.jpg" />
- 1932年5月29日《申报》：哈尔滨息，昨日正午有人在一面坡与乌吉密河间一零八三公里轨道中发现地雷一枚，即止将抵之日铁甲车前进。后由火车中日兵将地雷移去，复开车前发。一面坡与该站西十五里某地点间敌军甚为活动，故哈尔滨与西比利亚边界五站间之通车，现复停驶。据昨日开抵此间之汽船四艘报称，曾在距哈尔滨北二十里处受反满军来复枪猛烈之射击，但未伤一人。（28日路透社电）
- 1932年5月29日《申报》：淞沪之役，我19路军及第5军将士血战匝月，先后阵亡者数千人，政府及民众追念忠烈，昨日上午11时20分，在苏州公共体育场（即五卅公园）举行淞沪抗日阵亡将士追悼大会。中央、国府暨各军政机关各民众团体，多派代表参加，共计到会军民约五万余人。在风雨凄迷中，举行隆重之祭典，与祭人员，在此庄严悲哀之空气中，多有泣下者。<br/><img src="https://wx3.sinaimg.cn/large/aca367d8ly8gqz0p2s0shj20b408oq3l.jpg" />
- 1932年5月29日讯：汪精卫召罗文幹、蒋作宾及外交委员会委员商外交问题，决定外长仍由罗继任；郭泰祺担任驻英公使，日内赴英履任；驻日公使仍由蒋作宾回任。
| 39.714286 | 255 | 0.81205 | yue_Hant | 0.131786 |
4f8e4795ef695ba2419165e577bf99a3766e140d | 14,075 | md | Markdown | arrays_and_pointers/readme.md | jamesjallorina/cpp_exercises | 0e18511aad163510143dc66523a8111057694bff | [
"MIT"
] | 1 | 2019-07-08T14:35:57.000Z | 2019-07-08T14:35:57.000Z | arrays_and_pointers/readme.md | jamesjallorina/cpp_exercises | 0e18511aad163510143dc66523a8111057694bff | [
"MIT"
] | null | null | null | arrays_and_pointers/readme.md | jamesjallorina/cpp_exercises | 0e18511aad163510143dc66523a8111057694bff | [
"MIT"
] | null | null | null | ## Arrays And Pointers Exercises
1. Write a program in C to show the basic declaration of pointer. Go to the editor
Expected Output :
Pointer : Show the basic declaration of pointer :
Here is m=10, n and o are two integer variable and *z is an integer
z stores the address of m = 0x7ffd40630d44
*z stores the value of m = 10
&m is the address of m = 0x7ffd40630d44
&n stores the address of n = 0x7ffd40630d48
&o stores the address of o = 0x7ffd40630d4c
&z stores the address of z = 0x7ffd40630d50
2. Write a program in C to demonstrate how to handle the pointers in the program. Go to the editor
Expected Output :
Address of m : 0x7ffcc3ad291c
Value of m : 29
Now ab is assigned with the address of m.
Address of pointer ab : 0x7ffcc3ad291c
Content of pointer ab : 29
The value of m assigned to 34 now.
Address of pointer ab : 0x7ffcc3ad291c
Content of pointer ab : 34
The pointer variable ab is assigned with the value 7 now.
Address of m : 0x7ffcc3ad291c
Value of m : 7
3. Write a program in C to demonstrate the use of &(address of) and *(value at address) operator. Go to the editor
Expected Output :
Pointer : Demonstrate the use of & and * operator :
m = 300
fx = 300.600006
cht = z
Using & operator :
address of m = 0x7ffda2eeeec8
address of fx = 0x7ffda2eeeecc
address of cht = 0x7ffda2eeeec7
Using & and * operator :
value at address of m = 300
value at address of fx = 300.600006
value at address of cht = z
Using only pointer variable :
address of m = 0x7ffda2eeeec8
address of fx = 0x7ffda2eeeecc
address of cht = 0x7ffda2eeeec7
Using only pointer operator :
value at address of m = 300
value at address of fx= 300.600006
value at address of cht= z
4. Write a program in C to add two numbers using pointers. Go to the editor
Test Data :
Input the first number : 5
Input the second number : 6
Expected Output :
The sum of the entered numbers is : 11
5. Write a program in C to add numbers using call by reference. Go to the editor
Test Data :
Input the first number : 5
Input the second number : 6
Expected Output :
The sum of 5 and 6 is 11
6. Write a program in C to find the maximum number between two numbers using a pointer. Go to the editor
Test Data :
Input the first number : 5
Input the second number : 6
Expected Output :
6 is the maximum number.
7. Write a program in C to store n elements in an array and print the elements using pointer. Go to the editor
Test Data :
Input the number of elements to store in the array :5
Input 5 number of elements in the array :
element - 0 : 5
element - 1 : 7
element - 2 : 2
element - 3 : 9
element - 4 : 8
Expected Output :
The elements you entered are :
element - 0 : 5
element - 1 : 7
element - 2 : 2
element - 3 : 9
element - 4 : 8
8. Write a program in C to print all permutations of a given string using pointers. Go to the editor
Expected Output :
The permutations of the string are :
abcd abdc acbd acdb adcb adbc bacd badc bcad bcda bdca bdac cbad cbda cabd cadb cdab cdba db
ca dbac dcba dcab dacb dabc
9. Write a program in C to find the largest element using Dynamic Memory Allocation. Go to the editor
Test Data :
Input total number of elements(1 to 100): 5
Number 1: 5
Number 2: 7
Number 3: 2
Number 4: 9
Number 5: 8
Expected Output :
The Largest element is : 9.00
10. Write a program in C to Calculate the length of the string using a pointer. Go to the editor
Test Data :
Input a string : w3resource
Expected Output :
The length of the given string w3resource
is : 10
11. Write a program in C to swap elements using call by reference. Go to the editor
Test Data :
Input the value of 1st element : 5
Input the value of 2nd element : 6
Input the value of 3rd element : 7
Expected Output :
The value before swapping are :
element 1 = 5
element 2 = 6
element 3 = 7
The value after swapping are :
element 1 = 7
element 2 = 5
element 3 = 6
12. Write a program in C to find the factorial of a given number using pointers. Go to the editor
Test Data :
Input a number : 5
Expected Output :
The Factorial of 5 is : 120
13. Write a program in C to count the number of vowels and consonants in a string using a pointer. Go to the editor
Test Data :
Input a string: string
Expected Output :
Number of vowels : 1
Number of constant : 5
14. Write a program in C to sort an array using Pointer. Go to the editor
Test Data :
testdata
Expected Output :
Test Data :
Input the number of elements to store in the array : 5
Input 5 number of elements in the array :
element - 1 : 25
element - 2 : 45
element - 3 : 89
element - 4 : 15
element - 5 : 82
Expected Output :
The elements in the array after sorting :
element - 1 : 15
element - 2 : 25
element - 3 : 45
element - 4 : 82
element - 5 : 89
15. Write a program in C to show how a function returning pointer. Go to the editor
Test Data :
Input the first number : 5
Input the second number : 6
Expected Output :
The number 6 is larger.
16. Write a program in C to compute the sum of all elements in an array using pointers. Go to the editor
Test Data :
Input the number of elements to store in the array (max 10) : 5
Input 5 number of elements in the array :
element - 1 : 2
element - 2 : 3
element - 3 : 4
element - 4 : 5
element - 5 : 6
Expected Output :
The sum of array is : 20
17. Write a program in C to print the elements of an array in reverse order. Go to the editor
Test Data :
Input the number of elements to store in the array (max 15) : 5
Input 5 number of elements in the array :
element - 1 : 2
element - 2 : 3
element - 3 : 4
element - 4 : 5
element - 5 : 6
Expected Output :
The elements of array in reverse order are :
element - 5 : 6
element - 4 : 5
element - 3 : 4
element - 2 : 3
element - 1 : 2
18. Write a program in C to show the usage of pointer to structure. Go to the editor
Expected Output :
John Alter from Court Street
19. Write a program in C to show a pointer to union. Go to the editor
Expected Output :
Jhon Mc Jhon Mc
20. Write a program in C to show a pointer to an array which contents are pointer to structure. Go to the editor
Expected Output :
Exmployee Name : Alex
Employee ID : 1002
21. Write a program in C to print all the alphabets using a pointer. Go to the editor
Expected Output :
The Alphabets are :
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
22. Write a program in C to print a string in reverse using a pointer. Go to the editor
Test Data :
Input a string : w3resource
Expected Output :
Pointer : Print a string in reverse order :
Input a string : w3resource
Reverse of the string is : ecruoser3w
| 49.213287 | 164 | 0.339751 | eng_Latn | 0.992241 |
4f8e4bfc656266cba9801dab871b3637ab234777 | 31 | md | Markdown | README.md | EricBlack/AElfChain.SDK | 0884476eebdaec3720a8d7aa39646441337dec2e | [
"MIT"
] | null | null | null | README.md | EricBlack/AElfChain.SDK | 0884476eebdaec3720a8d7aa39646441337dec2e | [
"MIT"
] | null | null | null | README.md | EricBlack/AElfChain.SDK | 0884476eebdaec3720a8d7aa39646441337dec2e | [
"MIT"
] | null | null | null | # AElfChain.SDK
AElfChain sdk
| 10.333333 | 15 | 0.774194 | yue_Hant | 0.999408 |
4f8e696352b71122d50d734c38d2e71dabcb8cad | 526 | md | Markdown | notes/markdown/How to Take Smart Notes/Break down amorphous tasks into smaller tasks that can be finished in one go.md | juancoquet/personalwebsite | 3d9979ed6aa42ed031971a5e3c6e880f5642c33f | [
"MIT"
] | null | null | null | notes/markdown/How to Take Smart Notes/Break down amorphous tasks into smaller tasks that can be finished in one go.md | juancoquet/personalwebsite | 3d9979ed6aa42ed031971a5e3c6e880f5642c33f | [
"MIT"
] | null | null | null | notes/markdown/How to Take Smart Notes/Break down amorphous tasks into smaller tasks that can be finished in one go.md | juancoquet/personalwebsite | 3d9979ed6aa42ed031971a5e3c6e880f5642c33f | [
"MIT"
] | null | null | null | Note type: #litnote
Source: [[📖 How to Take Smart Notes]]
---
# Break down amorphous tasks into smaller tasks that can be finished in one go
In order to be able to focus and organise, large amorphous tasks should be divided into smaller sub-tasks which can be completed in one go. This means that the sub-tasks can be written down and scheduled, freeing up mental resources to focus on actually *doing*.
---
See also:
- [[A mind like water]]
- [[Circumventing and Leveraging the Ziegarnik effect]]
- [[The Ziegarnik Effect]] | 43.833333 | 262 | 0.752852 | eng_Latn | 0.999451 |
4f8f66cf9a5aad852b6faef387e5df931e94067f | 4,707 | md | Markdown | src/in/2020-03/05/06.md | PrJared/sabbath-school-lessons | 94a27f5bcba987a11a698e5e0d4279b81a68bc9a | [
"MIT"
] | 68 | 2016-10-30T23:17:56.000Z | 2022-03-27T11:58:16.000Z | src/in/2020-03/05/06.md | PrJared/sabbath-school-lessons | 94a27f5bcba987a11a698e5e0d4279b81a68bc9a | [
"MIT"
] | 367 | 2016-10-21T03:50:22.000Z | 2022-03-28T23:35:25.000Z | src/in/2020-03/05/06.md | PrJared/sabbath-school-lessons | 94a27f5bcba987a11a698e5e0d4279b81a68bc9a | [
"MIT"
] | 109 | 2016-08-02T14:32:13.000Z | 2022-03-31T10:18:41.000Z | ---
title: Kuasa Roh Kudus Yang Mengubah Hidup
date: 30/07/2020
---
Sebuah penelitian yang cermat terhadap kitab Kisah Para Rasul mengunkapkan Allah melalui Roh-Nya mengerjakan mukjizat dalam kehidupan mansia. Kisah Para Rasul adalah sebuah studi kasus tentang kemenangan Injil atas bias budaya, mengubah kebiasaan seumur hidup, kebiasaan yang mendarah daging, dan mengajarkan semua rahmat dan kebenaran Kristus kepada selruh umat manusia. Roh Kudus bertemu dengan orang-orang di tempat mereka berada, tetapi Ia tidak meninggalkan mereka di sana. Di hadirat-Nya, mereka diubahkan. Hidup mereka berubah.
`Bacalah Kisah Para Rasul 16: 11–15, 23–34; 17: 33, 34; 18: 8. Ini hnyalah beberapa kisah pertobatan dalam Alkitab. Apakah yang diajakan berbagai kisah ini kepada kita tentang kuasa Allah untuk mengubah kehidupan semua jenis orang dari berbagai latar belakang?`
Ada berbagai jenis orang. Lidia adalah seorang pengusaha Yahudi yang makmur, dan kepala penjara Filipi adalah pegawai negeri sipil kelas menengah di Roma. Roh Kudus dapat menjangkau semua spektrum masyarakat. Kekuaannya untuk mengubahkan mencapai baik laki-laki maupun perempuan, kaya dan miskin, berpendidikan dan tidak berpendidikan.
Dua karakter terakhir dalam daftar kita sama-sama luar biasa. Kisah Para Rasul 17: 34 merujuk pada pertobatan Dionisius, anggota majelis Aeropagus. Aeropagus di Atena adalah bagian dari penasihat hukum para hakim yang mengadili kasus-kasus pengadilan. Mereka adalah anggota masyarakat Yunani yang terkemuka dan dihormati.
Melalui kuasa Roh Kudus, pelayanan Rasul Paulus mencapai bahkan eselon atas masyarakat. Krispus (Kis. 18: 8) adalah penguasa sinagoge Yahudi. Dia adlah seorang pemimpin agama yang mendalami pemikiran Perjanjian Lama Yhudi, dan Roh Kudus menerobos dan mengubah hidupnya. Sejarah kisah-kisah ini mengungkapkan bahwa ketika kita bersaksi untuk Kristus dan membagkan Firman-Nya kepada orang lain, Roh Kudus akan melakukan hal-hal luar biasa dalam kehidupan semua jenis orang dari segala macam latar belakang, budaya, pendidikan, dan kepercayaan. Kita tidak bisa dan tidak boleh mebuat asumsi tentang siapa yang bisa atau tidak bisa dihubungi. Tugas kita adalah untuk bersaksi kepada siapa saja dan semua orang yang dibawa ke dalam hidup kita. Tuhan akan melakukan sisanya.
`Kematian Kristus adalah universal; yaitu untuk setiap umat manusia, selamanya. Apakah yang seharusnya diajarkan kebenaran penting ini kepada kita tentang bagaimana kita tidak boleh berasumsi bahwa ada orang yang berada di luar harapan keselamatan?`
#### Pembaca Tambahan: Petikan terpilih dari Ellen G. White
Siapa yang diampuni Kristus, Dialah yang pertama membuat menyesal, dan tugas Roh Kuduslah menyadarkan orang terhadap dosa. Mereka yang hatinya telah digerakkan oleh Roh Allah yang memberikan keyakinan melihat bahwa tidak ada kebaikan dalam diri mereka. Mereka lihat bahwa semua yang pernah mereka lakukan adalah bercampur dengan diri dan dosa. Seperti pemungut cukai yang malang itu, mereka berdiri jauhjauh, tidak berani menengadah ke langit, dan berseru, “Ya Allah, kasihanilah aku orang berdosa ini” (Lukas 18:13). Dan mereka diberkati. Ada pe-ngampunan bagi orang yang menyesal; karena Kristus adalah Anak Domba Allah yang menghapus dosa dunia” (Yohanes 1:29). Janji Allah adalah: “Sekalipun dosamu merah seperti kirmizi, akan menjadi putih seperti salju; sekalipun berwarna merah seperti kain kesumba, akan menjadi putih seperti bulu domba.” “Akan Kuberikan hati yang baru kepadamu— Roh-Ku akan Kuberikan diam di dalam batinmu” (Yesaya 1:18; Yehezkiel 36:26, 27). {KAB 17.1}
Ketika Kristus menjanjikan Roh kepada murid-murid-Nya, Ia sudah mendekati akhir pekerjaan-Nya di dunia ini. Ia sedang berdiri dalam bayang-bayang salib, dengan penuh kesadaran beban yang terletak atas-Nya sebagai Penanggung Dosa. Sebelum mempersembahkan diri-Nya sendiri sebagai korban sembelihan, Ia memberi petunjuk kepada murid-murid-Nya mengenai pemberian yang paling penting dan sempurna yang dikaruniakan-Nya kepada para pengikut-Nya—pemberian yang akan membawa di dalam jangkauan mereka sumber-sumber yang tidak ter-batas akan rahmat-Nya. “Aku akan minta kepada Bapa,” kata-Nya, “dan Ia akan memberikan kepadamu seorang Penolong yang lain, supaya Ia menyertai kamu, yaitu Roh Kebenaran. Dunia tidak dapat menerima Dia, sebab dunia tidak melihat Dia dan tidak mengenal Dia. Tetapi kamu mengenal Dia, sebab Ia menyertai kamu dan akan diam di dalam kamu.” Yohanes 14:16, 17. Juruselamat menunjuk kepada waktu bilamana Roh Kudus harus datang untuk melakukan pekerjaan yang besar sebagai utus-an-Nya. Kejahatan yang sudah tertimbun berabad-abad lamanya harus dikalahkan oleh kuasa Ilahi dari Roh Kudus. {KR 40.1} | 213.954545 | 1,114 | 0.820268 | ind_Latn | 0.970067 |
4f902c09e21c46190e17c6ddc1b0cc346c8cc57c | 2,081 | md | Markdown | _posts/java/R/ResultSetMetaData/2021-01-01-ResultSetMetaData.md | w3api/w3api | 681462ece7265723031a88bec5285209d0e125bf | [
"MIT"
] | 1 | 2021-09-15T20:32:10.000Z | 2021-09-15T20:32:10.000Z | _posts/java/R/ResultSetMetaData/2021-01-01-ResultSetMetaData.md | w3api/w3api | 681462ece7265723031a88bec5285209d0e125bf | [
"MIT"
] | 20 | 2021-01-17T01:13:46.000Z | 2021-06-20T21:16:02.000Z | _posts/java/R/ResultSetMetaData/2021-01-01-ResultSetMetaData.md | w3api/w3api | 681462ece7265723031a88bec5285209d0e125bf | [
"MIT"
] | 2 | 2021-09-15T20:32:08.000Z | 2022-02-20T16:57:46.000Z | ---
title: ResultSetMetaData
permalink: /Java/ResultSetMetaData/
date: 2021-01-11
key: Java.R.ResultSetMetaData
category: Java
tags: ['java se', 'java.sql', 'java.sql', 'interface java', 'Java 1.1']
sidebar:
nav: java
---
## Descripción
{{site.data.Java.R.ResultSetMetaData.description }}
## Sintaxis
~~~java
public interface ResultSetMetaData extends Wrapper
~~~
## Campos
* [columnNoNulls](/Java/ResultSetMetaData/columnNoNulls)
* [columnNullable](/Java/ResultSetMetaData/columnNullable)
* [columnNullableUnknown](/Java/ResultSetMetaData/columnNullableUnknown)
## Métodos
* [getCatalogName()](/Java/ResultSetMetaData/getCatalogName)
* [getColumnClassName()](/Java/ResultSetMetaData/getColumnClassName)
* [getColumnCount()](/Java/ResultSetMetaData/getColumnCount)
* [getColumnDisplaySize()](/Java/ResultSetMetaData/getColumnDisplaySize)
* [getColumnLabel()](/Java/ResultSetMetaData/getColumnLabel)
* [getColumnName()](/Java/ResultSetMetaData/getColumnName)
* [getColumnType()](/Java/ResultSetMetaData/getColumnType)
* [getColumnTypeName()](/Java/ResultSetMetaData/getColumnTypeName)
* [getPrecision()](/Java/ResultSetMetaData/getPrecision)
* [getScale()](/Java/ResultSetMetaData/getScale)
* [getSchemaName()](/Java/ResultSetMetaData/getSchemaName)
* [getTableName()](/Java/ResultSetMetaData/getTableName)
* [isAutoIncrement()](/Java/ResultSetMetaData/isAutoIncrement)
* [isCaseSensitive()](/Java/ResultSetMetaData/isCaseSensitive)
* [isCurrency()](/Java/ResultSetMetaData/isCurrency)
* [isDefinitelyWritable()](/Java/ResultSetMetaData/isDefinitelyWritable)
* [isNullable()](/Java/ResultSetMetaData/isNullable)
* [isReadOnly()](/Java/ResultSetMetaData/isReadOnly)
* [isSearchable()](/Java/ResultSetMetaData/isSearchable)
* [isSigned()](/Java/ResultSetMetaData/isSigned)
* [isWritable()](/Java/ResultSetMetaData/isWritable)
## Ejemplo
~~~java
{{ site.data.Java.R.ResultSetMetaData.code}}
~~~
## Líneas de Código
<ul>
{%- for _ldc in site.data.Java.R.ResultSetMetaData.ldc -%}
<li>
<a href="{{_ldc['url'] }}">{{ _ldc['nombre'] }}</a>
</li>
{%- endfor -%}
</ul>
| 34.114754 | 72 | 0.756848 | yue_Hant | 0.568994 |
4f908faa4a9658287fddea0a3d4301231c3a1fc4 | 22 | md | Markdown | README.md | MykosX/android-send-receive | d032712e96376ced0a041e97734654d487bc1890 | [
"MIT"
] | null | null | null | README.md | MykosX/android-send-receive | d032712e96376ced0a041e97734654d487bc1890 | [
"MIT"
] | null | null | null | README.md | MykosX/android-send-receive | d032712e96376ced0a041e97734654d487bc1890 | [
"MIT"
] | null | null | null | # android-send-receive | 22 | 22 | 0.818182 | eng_Latn | 0.292663 |
4f910c59aa22f04e3c8f45865179ce7c7b592ab8 | 1,406 | md | Markdown | content/authors/gonzalez-n/_index.md | matematicasco/academic-kickstart | 6d9e88af1141af56d3365710e650f221adb01057 | [
"MIT"
] | null | null | null | content/authors/gonzalez-n/_index.md | matematicasco/academic-kickstart | 6d9e88af1141af56d3365710e650f221adb01057 | [
"MIT"
] | null | null | null | content/authors/gonzalez-n/_index.md | matematicasco/academic-kickstart | 6d9e88af1141af56d3365710e650f221adb01057 | [
"MIT"
] | null | null | null | ---
name: Nelsy R. González Gutíerrez
authors:
- gonzalez-n
superuser: false
role: Associate Professor
organizations:
- name: Universidad Pedagógica y Tecnológica de Colombia
url: "http://www.uptc.edu.co"
# Short bio (displayed in user profile at end of posts)
bio:
interests:
- Commutative algebra
- Epistemiology and history of mathematics
education:
courses:
- course: PhD in Education
institution: Universidad Pedagógica y Tecnológica de Colombia
year: 2017
- course: MSc in Mathematics
institution: Universidad Nacional de Colombia
year: 2002
- course: Licenciatura en Matemáticas y Física
institution: Universidad Pedagógica y Tecnológica de Colombia
year: 1997
# Social/Academic Networking
social:
- icon: cv
icon_pack: ai
link: https://scienti.minciencias.gov.co/cvlac/visualizador/generarCurriculoCv.do?cod_rh=0000394556
- icon: google-scholar
icon_pack: ai
link: https://scholar.google.com/citations?user=-o286msAAAAJ&hl=es
- icon: orcid
icon_pack: ai
link: https://orcid.org/0000-0002-5710-6063
- icon: researchgate
icon_pack: ai
link: https://www.researchgate.net/profile/Nelsy-Gonzalez
# Enter email to display Gravatar (if Gravatar enabled in Config)
email: ""
# Organizational groups that you belong to (for People widget)
# Set this to `[]` or comment out if you are not using People widget.
user_groups:
- "Escuela"
- "giaa"
---
| 25.563636 | 101 | 0.748222 | eng_Latn | 0.358965 |
4f91a6991244bf64fe4291187a73f05e4dc3a87a | 3,607 | md | Markdown | README.md | tpaksu/xdebug-toggle | 7d0a4e2583d17fce9fdc3e1a65cd93e785c2e055 | [
"MIT"
] | 5 | 2020-07-13T19:32:24.000Z | 2020-09-29T23:29:13.000Z | README.md | tpaksu/xdebug-toggle | 7d0a4e2583d17fce9fdc3e1a65cd93e785c2e055 | [
"MIT"
] | null | null | null | README.md | tpaksu/xdebug-toggle | 7d0a4e2583d17fce9fdc3e1a65cd93e785c2e055 | [
"MIT"
] | null | null | null | # Laravel Valet XDebug Toggler Artisan Command
[](https://packagist.org/packages/tpaksu/xdebug-toggle)
[](https://travis-ci.org/tpaksu/xdebug-toggle)
[](https://scrutinizer-ci.com/g/tpaksu/xdebug-toggle)
[](https://packagist.org/packages/tpaksu/xdebug-toggle)
[](https://github.styleci.io/repos/271391496)
This package automates the XDebug extension activation/deactivation process by adding a console command to Laravel's artisan command. It does these things:
- Modifying the current INI file used by PHP, located with parsing the "php_info()" output containing the line "Loaded Configuration File: [path/to/php.ini]"
- Restarting the valet NGINX server with the command `valet restart nginx`
If you use something else than Laravel Valet, and want to automate your stuff, you can change the **XDEBUG_SERVICE_RESTART_COMMAND** in your environment file, or the `xdebugtoggle.service_restart_command` configuration in xdebug-toggle.php configuration file to suit your own.
## Installation
You can install the package as a development requirement via composer:
```bash
composer require tpaksu/xdebug-toggle --dev
```
## Usage
To enable XDebug in current environment:
``` bash
php artisan xdebug on
```
To disable it:
``` bash
php artisan xdebug off
```
### Configuration
You can export the configuration file by running the command:
``` bash
php artisan vendor:publish --provider="Tpaksu\XdebugToggle\XdebugToggleServiceProvider"
```
which includes:
**service_restart_command** : Gives you the option to run a script after you change the *php.ini* line with the new XDebug status. The default is
```bash
valet restart nginx
```
which applies the new php.ini configuration on the PHP running on valet's nginx server.
I tried and succeded with this command on Windows running Laragon with nginx:
```batch
c:/laragon/bin/nginx/nginx-1.12.0/nginx.exe -p c:/laragon/bin/nginx/nginx-1.12.0 -c conf/nginx.conf -s reload
```
which I changed with setting this environment variable on `.env` and ran `php artisan config:cache` to apply the environment changes:
```ini
XDEBUG_SERVICE_RESTART_COMMAND="c:/laragon/bin/nginx/nginx-1.12.0/nginx.exe -p c:/laragon/bin/nginx/nginx-1.12.0 -c conf/nginx.conf -s reload"
```
I could change the configuration setting on `config/xdebug-toggle.php` file too. This would also be a valid modification on the path.
**Note: Don't forget to run `php artisan config:cache` to apply new settings when you change any `.env` parameter or configuration setting. Not only for this package, for all changes inside Laravel.**
### Testing
Any tests written yet. But I suppose I should.
### Changelog
Please see [CHANGELOG](CHANGELOG.md) for more information what has changed recently.
## Contributing
Please see [CONTRIBUTING](CONTRIBUTING.md) for details. Any contributions are welcome.
### Security
If you discover any security related issues, please email [email protected] instead of using the issue tracker.
## Credits
- [Taha PAKSU](https://github.com/tpaksu)
- [All Contributors](../../contributors)
## License
The MIT License (MIT). Please see [License File](LICENSE.md) for more information. | 37.185567 | 276 | 0.768783 | eng_Latn | 0.903913 |
4f91f3052907d1c958b53730761b4d7dbcfb795f | 8,221 | md | Markdown | istio/kubernetes-istio-curso/02_execucao_istio.md | asantos2000/katacoda-scenarios | 53caf019a9ce2799452d0175c075b2962a51ad39 | [
"Apache-2.0"
] | null | null | null | istio/kubernetes-istio-curso/02_execucao_istio.md | asantos2000/katacoda-scenarios | 53caf019a9ce2799452d0175c075b2962a51ad39 | [
"Apache-2.0"
] | 1 | 2021-03-22T11:50:44.000Z | 2021-03-22T11:50:44.000Z | istio/kubernetes-istio-curso/02_execucao_istio.md | asantos2000/katacoda-scenarios | 53caf019a9ce2799452d0175c075b2962a51ad39 | [
"Apache-2.0"
] | null | null | null | ## Acessando o k8s
Primeiramente vamos verificar se estamos acessando o cluster de kubernetes.
Vamos verificar como estão os nós do nosso cluster:
`kubectl get nodes`{{execute}}
> [Opcional] Algumas instalações colocam o arquivo de configuração do kubernetes no caminho `~/.kube/config` e pode ser necessário configurar a variável de ambiente KUBECONFIG para apontar para este arquivo. Caso você obteve o arquivo de config de um cluster externo (AKS, EKS, GKE, etc), você deverá configurar esta variável `export KUBECONFIG=~/.kube/config`{{execute}}
No katacoda o ambiente já está configurado e não é necessário nenhuma configuração adicional.
> [Opcional] Se você tem mais de um cluster na configuração, verifique se está apontando para o correto. `kubectl config get-contexts`{{execute}}
## Instalando o Istio (linux ou mac)
Para instalar a última versão do Istio, neste momento 1.9.2, você pode ir até a página [Getting Started](https://istio.io/latest/docs/setup/getting-started/#download) ou seguir as instruções abaixo:
`curl -L https://istio.io/downloadIstio | sh -`{{execute}}
> Verifique qual foi a versão baixada e ajuste a variável ISTIO_VERSION, caso sejam diferentes.
> Se o download não iniciar, interrompa o comando com <kdb>ctrl</kbd>+<kdb>c</kbd> e execute novamente.
Para usar o comando `istioctl`, que está no diretório `bin` do download, coloque-o na variável `PATH` ou copie o arquivo `bin/istioctl` para um diretório no seu `PATH`
## Copiando o istioctl para o diretório de binários
`ISTIO_VERSION=1.9.2`{{execute}}
Verificar onde está o executável do Istio:
`ls istio-$ISTIO_VERSION/bin`{{execute}}
Copiar o arquivo para o diretório de binários:
`cp istio-$ISTIO_VERSION/bin/istioctl /usr/local/bin`{{execute}}
Teste
`istioctl version`{{execute}}
Ok, já temos o utilitário do Istio instalado no nosso sistema operacional, vamos seguir para instalação no cluster.
## Instalando o mínimo do Istio no k8s
Desde a versão 1.6 o Istio é composto de uma única entrega chamada `istiod` e ela pode ser instalada com o comando abaixo:
Isso deve demorar de 1 a 5 minutos, dependendo da capacidade do cluster.
`istioctl install --set profile=minimal --skip-confirmation`{{execute}}
Vamos verificar o que foi instalado
Obtendo os namespaces:
`kubectl get ns`{{execute}}
Um novo namespace foi criado, o istio-system, vamos ver o que foi instalado:
`kubectl get all -n istio-system`{{execute}}
Neste ponto já temos o Istio instalado.
## Istio CRDs
O Istio é uma aplicação que é executada no kubernetes e adiciona recursos personalizados ([CRD](https://kubernetes.io/docs/concepts/extend-kubernetes/api-extension/custom-resources/)) para sua configuração.
Você pode obter uma lista completa executando o comando abaixo:
`kubectl api-resources --api-group=networking.istio.io`{{execute}}
`kubectl api-resources --api-group=security.istio.io`{{execute}}
> Note que todos as configurações para recursos do Istio são aplicados para um _namespace_ (Namespaced=true), isso significa que a configuração terá efeito apenas em um _namespace_, porém, configurações que poderão ser aplicadas para toda a malha de serviços serão realizadas no _namespace_ do Istio, o `istio-system`.
Você verá muito disso no kubernetes, para uma lista completa de recursos e suas abreviações execute o mesmo comando acima, mas sem o filtro.
`kubectl api-resources`{{execute}}
Esses são os recursos adicionados e na segunda coluna o nome abreviado, você pode utilizar um ou outro, por exemplo:
Abreviado:
`kubectl get svc`{{execute}}
Que é equivalente a:
`kubectl get services`{{execute}}
## Ativando o Istio para um namespace
Um elemento chave do Istio é o _sidecar_ ou _proxy_, como veremos na discussão sobre arquitetura do Istio. Para que o Istio injete-o nos PODs da aplicação, é necessário marcar o _namespace_ da seguinte forma:
`kubectl label namespace default istio-injection=enabled`{{execute}}
Vamos verificar como ficou a configuração do namespace
`kubectl describe ns/default`{{execute}}
O `istiod` irá monitorar todos os _namespaces_ com o rótulo `istio-injection=enabled` e adicionar ao POD um _container_ de proxy, o _sidecar_.
Vamos fazer _deploy_ de uma aplicação exemplo para verificar esse comportamento.
## Criando uma aplicação demo
Vamos criar uma aplicação simples.
`mkdir -p simple-app`{{execute}}
Criando o arquivo de deployment:
```
cat <<EOT > simple-app/deployment.yaml
apiVersion: apps/v1
kind: Deployment
metadata:
name: simple-app
labels:
app: simple-app
version: v1
spec:
replicas: 1
selector:
matchLabels:
app: simple-app
version: v1
template:
metadata:
labels:
app: simple-app
version: v1
spec:
containers:
- name: simple-app
image: "nginx:stable"
imagePullPolicy: IfNotPresent
ports:
- name: http
containerPort: 80
protocol: TCP
EOT
```{{execute}}
E o serviço:
```
cat <<EOT > simple-app/service.yaml
apiVersion: v1
kind: Service
metadata:
name: simple-app
labels:
app: simple-app
version: v1
spec:
type: ClusterIP
ports:
- port: 80
targetPort: http
protocol: TCP
name: http
selector:
app: simple-app
version: v1
EOT
```{{execute}}
Listando os arquivos criados:
`ls -la simple-app`{{execute}}
Criamos dois arquivos, o `simple-app/deployment.yaml`{{open}} e o `simple-app/service.yaml`{{open}} no diretório `simple-app`, agora vamos instala-la no _namespace_ default (quando omitido é onde os recursos serão criados).
Inspecione os arquivos e tente descobrir o que será instalado no cluster, uma dica, procure a pela imagem.
`kubectl apply -f simple-app`{{execute}}
Verificando a situação do POD.
`kubectl get pods`{{execute}}
> Repita o comando algumas vezes até que o POD esteja 2/2 _Running_.
> Para instalar a aplicação em um _namespace_ diferente adicione `--namesapce` ou `-n`ao comando. Exemplo: `kubectl apply -f assets/exemplos/simple-app -n test-app`
Vamos acessar nossa aplicação, ela foi configurada para o tipo de serviço `ClusterIP`, o que significa que o acesso é interno, apenas entre os PODs do cluster, mas podemos acessá-la utilizando o comando `kubectl port-forward`.
`kubectl port-forward svc/simple-app 8000:80 --address 0.0.0.0`{{execute T1}}
Vamos testar em um segundo terminal `curl localhost:8000`{{execute T2}}
Você também pode usar o link Apps na parte superior do terminal.
> Se o terminal for aberto pela primeira vez o comando pode ser ignorado, tente novamente com o terminal aberto.
Pronto, você tem acesso à sua aplicação como se estivesse sendo executada na sua máquina. Claro que o kubernetes pode estar na sua máquina, mas isso funcionará em qualquer kubernetes, local ou remoto.
Para interromper, no terminal tecle <kbd>CTRL</kbd>+<kbd>C</kbd>. Ou click em `echo " Pronto para ir. "`{{Execute interrupt T1}}
Verificando o que foi instalado.
`kubectl get --show-labels all`{{execute}}
Note que o pod/simple-app tem 2/2 na coluna pronto (Ready), isso significa que dois containers de dois estão ok, vamos verificar quem é o segundo container.
Usaremos um dos labels do pod para encontra-lo
`kubectl describe pod -l app=simple-app`{{execute}}
É uma grande quantidade de informação, vamos procurar uma seção chamada `Containers` e nela a nossa aplicação `simple-app`.
Como você pode ver, a imagem desse container é `nginx`, com a tag `stable`, mais abaixo tem um segundo container `istio-proxy`, com a imagem `docker.io/istio/proxyv2` e a _tag_ para a versão `1.9.2`.
Esse container não faz parte do `simple-app/deployment.yaml`{{open}}, ele foi adicionado ao seu pod pelo `istiod`.
Caso você precise saber todos os _namespaces_ que tem a injeção do _envoy_ do Istio ativado, basta executar o comando:
`kubectl get ns -l istio-injection=enabled`{{execute}}
Até o momento, somente o namespace `default`, onde configuramos a marcação, foi encontrado.
## Conclusão
Neste ponto temos o mínimo do Istio em execução no nosso cluster, mas com exceção de um container extra isso não significa muito.
Na próxima parte iremos explorar os recursos que esta instalação mínima do Istio pode oferecer.
| 36.376106 | 371 | 0.751247 | por_Latn | 0.998306 |
4f921ff5ddbbfa4f9dbd5939a82265f471e4a193 | 692 | md | Markdown | v/vollstrvtr_tun/index.md | nnworkspace/gesetze | 1d9a25fdfdd9468952f739736066c1ef76069051 | [
"Unlicense"
] | 1 | 2020-06-20T11:34:20.000Z | 2020-06-20T11:34:20.000Z | v/vollstrvtr_tun/index.md | nagy/gesetze | 77abca2ceea3b7b89ea70afb13b5dd55415eb124 | [
"Unlicense"
] | null | null | null | v/vollstrvtr_tun/index.md | nagy/gesetze | 77abca2ceea3b7b89ea70afb13b5dd55415eb124 | [
"Unlicense"
] | null | null | null | ---
Title: Vertrag zwischen der Bundesrepublik Deutschland und der Tunesischen Republik
über Rechtsschutz und Rechtshilfe, die Anerkennung und Vollstreckung gerichtlicher
Entscheidungen in Zivil- und Handelssachen sowie über die Handelsschiedsgerichtsbarkeit
jurabk: VollstrVtr TUN
layout: default
origslug: vollstrvtr_tun
slug: vollstrvtr_tun
---
# Vertrag zwischen der Bundesrepublik Deutschland und der Tunesischen Republik über Rechtsschutz und Rechtshilfe, die Anerkennung und Vollstreckung gerichtlicher Entscheidungen in Zivil- und Handelssachen sowie über die Handelsschiedsgerichtsbarkeit (VollstrVtr TUN)
Ausfertigungsdatum
: 1966-07-19
Fundstelle
: BGBl II: 1969, 890
| 34.6 | 266 | 0.833815 | deu_Latn | 0.996816 |
4f92805eaf7819bac957409b2738adcdf6764d79 | 6,626 | md | Markdown | _posts/2018-09-30-Download-oxford-a-z-of-grammar-and-punctuation.md | Luanna-Lynde/28 | 1649d0fcde5c5a34b3079f46e73d5983a1bfce8c | [
"MIT"
] | null | null | null | _posts/2018-09-30-Download-oxford-a-z-of-grammar-and-punctuation.md | Luanna-Lynde/28 | 1649d0fcde5c5a34b3079f46e73d5983a1bfce8c | [
"MIT"
] | null | null | null | _posts/2018-09-30-Download-oxford-a-z-of-grammar-and-punctuation.md | Luanna-Lynde/28 | 1649d0fcde5c5a34b3079f46e73d5983a1bfce8c | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Oxford a z of grammar and punctuation book
" I turned to him. I was standing right beside you!" freedom is a thing we study. That block of ice was the coldest and "Nay, Junior parked two blocks past the target house? 456, so you'll catch up with them easy enough, it would have been SO simple that Sinsemilla second voyage, was covered with newly formed ice, as you called it. " and people of the region. " Then he recounted to him the story of the merchant and the manner of the buying of the house, in which August the mainmast of the _Vega_ was struck by lightning, Mr, as they say. Each was a different color. "They good for something else?" Crow, but only on the future, and then climbed out with Oxford a z of grammar and punctuation and Fuller; Stanislau stayed inside to help in the unloading? " She oxford a z of grammar and punctuation, visible beyond shimmering oxford a z of grammar and punctuation of fire. 195 The Oxford a z of grammar and punctuation bear and the reindeer are found oxford a z of grammar and punctuation in hundreds, still at a loss. Yet they are still becoming what they eventually will be to each other, 'Get you gone oxford a z of grammar and punctuation flee for your lives and save yourselves, but I checked out not before seen on the Chukch Peninsula, silver with emerald consoles (I was getting tired of these colors). A very full and exceedingly Robert Bloch of the state of the ice on the coast of Chukch Land-- then guests as soon as they indicated, Mrs? First, outside. ] Looking down at Barty, and I affrighted him not neither troubled him, or covered with a cap the picture of Celestina White in the other, perhaps! Indented anything you tell me. The bonesetter did what he could about his broken arm and his horizon. " Helen Greenbaum's sales report, glued to the spot, aside from cancer. He got drunk periodically, 244. But why does a race of millionaires need leaden if it already has all the material wealth it needs, and Selim paid the cook the price of his wares. They'd repopulate and there on other parts of the island, he wiped at the back of his neck or reached down to rub Sparky Vox-with less training in theology and philosophy than his guest? Gooseland is a low stretch of coast, peace came, when Agnes returned from church. From the sea this village has the look of a the taste of that admission from her mouth. But then something caught his eye at the very bottom of the seven-foot-diameter face painted on the ceiling of the lounge, not only saw but landed on Wrangel His previous plan to create a tableau-butter on the floor, long before Tanning reindeer hides hides, Dr, I must stay, and the older ones were never heard to utter an grizzly bears to Buicks, O damsel. The size of, he simply shook his head. She crawled from her bedroom, and he gave her the answer that he knew she hoped to hear, twisty little, Programming Services! Chevy to its limits. The object fell, and usually it can be treated successfully, and had no vinegar, and two fox-traps set on the Licky was his master. He lost his balance and toppled over. when she came out of the shelter of the woods and saw the open sky. In the faint reddish glow of the which the twins engage each night. rivularis_ L. " inhabited, O Meimoun. Emer stood at the big sink, you know, because this, Captain, and where a thin black have an identical twin who stands now before him. During a preceding voyage to the Polar him on Kereneia. Would you like to come with me?" black butterflies glistened. Wall of water seventy feet high _Vega_. " ee. "Good thing I was shot in the head eighteen years ago. These were She tried to shield her journal against her body, and not least in that of art. von, "You should either go to Roke or find a wizard to teach you what you need. 243; until in the evening I found myself lodged at a Bernard's concern changed to a deep, and as he senses and then feels unseen masses "Sit down, the fossil plants which I "Yes. There seemed to be silver wrapped around the edges of my vision, and he believed that he "But she sure does give the man major class and respectability. "So does vitamin D deficiency. form. ' Then all the Jinn went away, of my knowledge that he coveteth the folk's good, 'By the virtue of the Apostle of God (whom may He bless and preserve!) except thou suffer me go down to them and look on them and sit with them awhile. The easiest way to check it out would probably be to ask any Chironian computer, and he knew he could have her if he wanted. "You help me. I could not observe any dislike on the part of the priests oxford a z of grammar and punctuation Master Welden and Stephen Bennet, with a long sigh, saw Maurice dead, an untapped bottle seemed to be a CHARLES CLARKE, Tom Vanadium must simplify and condense misguided willingness to trust in divine justice. The For all her virtues, the initial phase. Her sense of play was delicious. " And he answered, who took us great skill as a card mechanic must be forever his secret, motionless. "A dangerous thing to do. After a while, he had turned the final page. With its Y chromosome changed to X; rapidly behind. She Birds like black arrows, who had been afflicted alike, bands, "O bountiful lord. By Allah, some of which approximated in appearance and behavior examples of terrestrial flora and fauna. The dog is a Meyer_ thus lay at Serdze Kamen two days after we anchored in our "It won't work. A wide street natives however were frightened by some gunshots fired as a signal Silence nodded, each step into the dark. They managed to worry up tuition for art school, huh?" There was a little noise! Moreover, later in North Africa, in comparison with its predecessors, Tuhfeh heard the noise of steps and laying the lute from her hand, if this was for real, and appointed her for a day. Crude, Maria passed from the narthex into the nave She dipped two fingers oxford a z of grammar and punctuation the holy water that glimmered in the marble font, the master bedroom, in ancient pyramids, doomed look that Byron must have had, he set the meat before him. Her fingers fought to hold on to the knife, she sees only what anyone can seeвwhich strikes her as plenty strange enough. I'll destroy him. Indeed, "multegroet" (preserved file:D|Documents20and20SettingsharryDesktopUrsula20K, stroked her hair. The diner smelled of sizzling hamburger patties. By dawn, slow deep breaths, but they didn't want me, in part because he had ducked out of sight in the trees and brush each time that he heard traffic approaching. | 736.222222 | 6,515 | 0.782071 | eng_Latn | 0.999946 |
4f928758e8739873bd8aa852da317c031c436958 | 1,683 | md | Markdown | README.md | itaimal/bz-ng2-webpack | d1974a0fb704da8c3dce8b1640f31cb96ca035d5 | [
"Apache-2.0"
] | 3 | 2019-08-27T09:03:10.000Z | 2020-12-12T00:23:04.000Z | README.md | itaimal/bz-ng2-webpack | d1974a0fb704da8c3dce8b1640f31cb96ca035d5 | [
"Apache-2.0"
] | null | null | null | README.md | itaimal/bz-ng2-webpack | d1974a0fb704da8c3dce8b1640f31cb96ca035d5 | [
"Apache-2.0"
] | 1 | 2020-04-05T07:22:56.000Z | 2020-04-05T07:22:56.000Z | # generator-bz-ng2-webpack
Template to generate a basic project with the necessary structure of folders and code with angular 2 and webpack.
## Available templates:
1. Project template
2. Component template
## Designed for:
@angular 2.0.0-rc.4
## Installing templates generator
### Prerequisites:
You need node.js tools to initialize tests and webpack compilation.
Make sure you have Node version >= 4.0 and NPM >= 3
You must have node.js and its package manager (npm) installed in your project (You can obtain it from node).
### Instalation:
Using a terminal, place yourself on the folder where the project will be hosted and then execute the following commands.
```bash
\anyfolder> npm install -g yo
\anyfolder> npm install -g generator-bz-ng2-webpack
```
Create projectFolder
```bash
\anyfolder> mkdir projectFolder
\anyfolder> cd projectFolder
```
### Using the template project
Making use of a terminal, go to the folder where the template project will be hosted and then execute the following commands.
```bash
\projectFolder> yo bz-ng2-webpack
\projectFolder> cd WebContent
```
```bash
# change directory to our repo
cd {projectFolder}/WebContent
# Step 1: Add required global libraries
npm install typings webpack-dev-server rimraf webpack -g
# Step 2: Install the repo with npm
npm install
# Step 3: Start the server
npm start
```
Now that you have the template project installed, you are ready to browse on it http://localhost:3000
### Creating a component template
On the folder where the component template will be installed execute the following line :
```bash
\projectFolder\WebContent\app> yo bz-ng2-webpack:component
```
[Ivan Taimal]
| 22.44 | 125 | 0.758764 | eng_Latn | 0.985917 |
4f92e79f847e173b5c7321f283aa81713dd9ed33 | 4,969 | md | Markdown | index.md | mkachuee/mkachuee.github.io | 46b73214564d2e443a89d9bdb20a74923fa2d6bb | [
"CC0-1.0"
] | null | null | null | index.md | mkachuee/mkachuee.github.io | 46b73214564d2e443a89d9bdb20a74923fa2d6bb | [
"CC0-1.0"
] | null | null | null | index.md | mkachuee/mkachuee.github.io | 46b73214564d2e443a89d9bdb20a74923fa2d6bb | [
"CC0-1.0"
] | null | null | null | ---
redirect_to: "https://sites.google.com/view/mkachuee/home"
---
---
layout: default
---
---
## About
My name is Mohammad Kachuee. I am a PhD student at the [University of California Los Angeles (UCLA)](http://www.ucla.edu/) [Computer Science Department](http://www.cs.ucla.edu/). I have received my BS and MS degrees from [Sharif University of Technology](http://sharif.edu/) in [Electrical Engineering](http://ee.sharif.edu/). My current research interests include mobile health, data mining, health analytics, and designing machine learning algorithms for health-care applications.
---
## Research Interests
- Machine Learning
- Health Analytics
- Wearable and Mobile Computing
---
## Publications
* **M. Kachuee**, O. Goldstein, K. Kärkkäinen, S. Darabi, M. Sarrafzadeh, Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams, International Conference on Learning Representations (ICLR), 2019. [Paper](https://openreview.net/forum?id=S1eOHo09KX)
* **M. Kachuee**, S. Darabi, B. Moatamed, M. Sarrafzadeh, Dynamic Feature Acquisition Using Denoising Autoencoders, IEEE Transactions on Neural Networks and Learning Systems (TNNLS), 2018. [Paper](https://arxiv.org/pdf/1811.01249.pdf)
* **M. Kachuee**, S. Fazeli, M. Sarrafzadeh, ECG Heartbeat Classification: A Deep Transferable Representation, IEEE International Conference on Healthcare Informatics (ICHI), 2018. [IEEExplore](https://doi.org/10.1109/ICHI.2018.00092), [Dataset](https://www.kaggle.com/shayanfazeli/heartbeat)
* **M. Kachuee**, A. Hosseini, B. Moatamed, S. Darabi, M. Sarrafzadeh, Context-Aware Feature Query to Improve the Prediction Performance, IEEE GlobalSIP Symposium on Signal and Information Processing (GlobalSIP), 2017. [IEEExplore](https://doi.org/10.1109/GlobalSIP.2017.8309078)
* B. Moatamed, S. Darabi, M. Gwak, **M. Kachuee**, C. Metoyer, M. Linn, M. Sarrafzadeh
Sport Analytics Platform for Athletic Readiness Assessment, IEEE-NIH 2017 Special Topics Conference on Healthcare Innovations and Point-of-Care Technologies (HI-POCT), 2017. [IEEExplore](https://doi.org/10.1109/HIC.2017.8227608)
* A. Esmaili, **M. Kachuee**, M. Shabany, Nonlinear Cuff-less Blood Pressure Estimation of Healthy Subjects Using Pulse Transit Time and Arrival Time, IEEE Transactions on Instrumentation & Measurement (TIM), 2017. [IEEEexplore](https://doi.org/10.1109/TIM.2017.2745081), [Dataset](https://www.kaggle.com/mkachuee/noninvasivebp)
* **M. Kachuee**, L. Moore, T. Homsey, H. G. Damavandi, B. Moatamed, A. Hosseini, R. Huang, J. Leiter, D. Lu, M. Sarrafzadeh, An Active Learning Based Prediction of Epidural Stimulation Outcome in Spinal Cord Injury Patients Using Dynamic Sample weighting, IEEE International Conference on Healthcare Informatics (ICHI), 2017. [IEEExplore](https://doi.org/10.1109/ICHI.2017.38), [Poster](https://github.com/mkachuee/mkachuee.github.io/raw/master/papers/Poster_SCI.pdf)
* A. Esmaili, **M. Kachuee**, M. Shabany, Non-Invasive Blood Pressure Estimation Using Phonocardiogram, IEEE International Symposium on Circuits and Systems (ISCAS), 2017. [IEEEexplore](https://doi.org/10.1109/ISCAS.2017.8050240)
* **M. Kachuee**, M. M. Kiani, H. Mohammadzade, M. Shabany, Cuff-Less Blood Pressure Estimation Algorithms for Continuous Health-Care Monitoring, IEEE Transactions on Biomedical Engineering (TBME), 2016. [IEEEexplore](http://dx.doi.org/10.1109/TBME.2016.2580904), [Paper](https://github.com/mkachuee/mkachuee.github.io/blob/master/papers/Paper_TBME2016.pdf), [Presentation](https://github.com/mkachuee/mkachuee.github.io/blob/master/papers/Presentation_TBME2016.pdf)
* S. Latifi, H. Golestani, **M. Kachuee**, H. Mohammadzade, M. Hashemi, GPU-based Acceleration of Deep Convolutional Neural Networks on Mobile Platforms, arXiv:1511.07376, 2015. [arXiv](http://arxiv.org/abs/1511.07376)
* **M. Kachuee**, M. M. Kiani, H. Mohammadzade, M. Shabany, Cuff-Less High-Accuracy Calibration-Free Blood Pressure Estimation Using Pulse Transit Time, IEEE International Symposium on Circuits and Systems (ISCAS), 2015. [IEEEexplore](http://dx.doi.org/10.1109/TBME.2016.2580904), [Presentation](https://github.com/mkachuee/mkachuee.github.io/blob/master/papers/Presentation_ISCAS2015.pdf), [Dataset](https://archive.ics.uci.edu/ml/datasets/Cuff-Less+Blood+Pressure+Estimation)
---
## Other Activities
* I have served as a reviewer for IEEE Journal of Biomedical Health Informatics (JBHI) and IEEE Transactions on Biomedical Engineering (TBME).
* I had the honor to present a lecture about deep learning and neural networks at the UCLA CS161 course: Introduction to Artificial Intelligence by Prof. Adnan Darwiche, Fall 2017. [Presentation](https://github.com/mkachuee/mkachuee.github.io/raw/master/presentations/Lec_161_NN.pdf)
* I was teaching assistant for UCLA CS152 (Introductory Digital Design Laboratory) during Winter 2018.
* I was teaching assistant for UCLA CS161 (Introduction to Artificial Intelligence) during Fall 2017.
| 82.816667 | 482 | 0.768163 | yue_Hant | 0.548386 |
4f930fe7bba7e5dcf2393720da107f8fdef24c9e | 7,485 | md | Markdown | 006 FilterningAndConditionalOperators/FilterningAndConditionalOperators.md | codepgq/RxSwiftStudy | 7dfce8cd9957f20ff1f43fb4e603eac35243caf9 | [
"Apache-2.0"
] | null | null | null | 006 FilterningAndConditionalOperators/FilterningAndConditionalOperators.md | codepgq/RxSwiftStudy | 7dfce8cd9957f20ff1f43fb4e603eac35243caf9 | [
"Apache-2.0"
] | null | null | null | 006 FilterningAndConditionalOperators/FilterningAndConditionalOperators.md | codepgq/RxSwiftStudy | 7dfce8cd9957f20ff1f43fb4e603eac35243caf9 | [
"Apache-2.0"
] | null | null | null | ### RxSwift filterning and conditional operators
<br>
上一节了解了一下**[Transforming Operators](https://www.jianshu.com/p/eabc12be8a57)**,现在我们进行看看还有哪些常用的**过滤 Operators**
### filter
> 根据条件，过滤掉事件
```swift
example("filter") {
let bag = DisposeBag()
Observable.of(
"🐱", "🐰", "🐶",
"🐸", "🐱", "🐰",
"🐹", "🐸", "🐱")
.filter {
$0 == "🐱"
}
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### distinctUntilChanged
> 当前的事件值不等于上一次的事件值的时候才会发送，可以用来过滤重复请求
```swift
example("distinctUntilChanged") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.distinctUntilChanged()
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### elementAt
> 取指定下标的事件，下标从0开始
```swift
example("elementAt") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.elementAt(3)
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### single 和 single { 条件 }
> 取第一次事件
```swift
example("single") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.single()
.subscribe(
onNext: { print($0) },
onError: { print($0) }
).disposed(by: bag)
}
example("single with conditions") {
let bag = DisposeBag()
Observable.of("🐱", "🐰", "🐶", "🐸", "🐷", "🐵")
.single { $0 == "🐸" }
.subscribe { print($0) }
.disposed(by: bag)
Observable.of("🐱", "🐰", "🐶", "🐱", "🐰", "🐶")
.single { $0 == "🐰" }
.subscribe { print($0) }
.disposed(by: bag)
Observable.of("🐱", "🐰", "🐶", "🐸", "🐷", "🐵")
.single { $0 == "🔵" }
.subscribe { print($0) }
.disposed(by: bag)
}
```
<br>
### take
> 取前N次的事件，N由用户输入
```swift
example("take") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.take(3)
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### takeLast
> 取后N次的事件，N由用户输入
```swift
example("takeLast") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.takeLast(3)
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### takeWhile
> `closure`中编写条件，取满足掉件的值，当遇到不满足的时候，**Observable**会调用`completed`方法结束
```swift
example("takeWhile") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.takeWhile { $0 < 3 }
.subscribe(onNext: { print($0) },
onError: { print($0) },
onCompleted: { print("completed") })
.disposed(by: bag)
}
```
<br>
### takeUntil
> 参数是一个**Observable**，之后参数中的**Observable**发送了`onNext`事件才会监听到自己的`onNext`事件,如果参数中的**Observable**发生了`onError`事件，则会释放资源`disposed`
```swift
example("takeUntil") {
let bag = DisposeBag()
let sourceSequence = PublishSubject<String>()
let referenceSequence = PublishSubject<String>()
sourceSequence
.takeUntil(referenceSequence)
.subscribe { print($0) }
.disposed(by: bag)
sourceSequence.onNext("1")
sourceSequence.onNext("2")
sourceSequence.onNext("2")
referenceSequence.onNext("3")
sourceSequence.onNext("1")
sourceSequence.onNext("4")
sourceSequence.onNext("2")
}
```
<br>
### Skip
> 跳过N次事件，N由用户输入
```swift
example("skip") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.skip(3)
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### skipWhile
> 跳过事件，通过`closure`的返回值(`bool`)决定忽略哪些事件
```swift
example("skipWhile") {
let disposeBag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.skipWhile { $0 < 3 }
.subscribe(onNext: { print($0) })
.disposed(by: disposeBag)
}
```
<br>
### skipWhileWithIndex
> 和`skipWhile`类似，只是在closure中多了`index`，但是此方法被标记为过期
```swift
example("skipWhileWithIndex") {
let bag = DisposeBag()
Observable.of(1, 2, 2, 3, 1, 4, 2)
.skipWhileWithIndex { element, index in
index < 3
}
.subscribe(onNext: { print($0) })
.disposed(by: bag)
}
```
<br>
### skipUntil
> 和`takeUntil`类似，表示一直忽略，知道参数中的**Observable**发送了`onNext`事件
```swift
example("skipUntil") {
let disposeBag = DisposeBag()
let sourceSequence = PublishSubject<String>()
let referenceSequence = PublishSubject<String>()
sourceSequence
.skipUntil(referenceSequence)
.subscribe(onNext: { print($0) })
.disposed(by: disposeBag)
sourceSequence.onNext("1")
sourceSequence.onNext("2")
sourceSequence.onNext("2")
referenceSequence.onNext("3")
sourceSequence.onNext("1")
sourceSequence.onNext("4")
sourceSequence.onNext("2")
}
```
### throttle
>当发送很多事件时，每隔多少ms取一次事件值
**使用场景：滑动Slider的时候回产生很多值，当我们并不想处理每次的值，只想在值的变化过程中取一些值**
```swift
progressSlider.rx
.value.asObservable()
.throttle(0.4, scheduler: MainScheduler.instance)
.map(progress)
.bind(to: progressLabel.rx.text)
.disposed(by: bag)
```
### debounce
> 当上一次的值和下一次的值超出时间间隔之后，就把事件的值发送出来
**使用场景：避免用户多次点击按钮导致多次请求等类似情况**
```swift
button.rx
.tap.asObservable()
.debounce(0.3, scheduler:MainScheduler.instance)
.map(btnTapCount)
.bind(to: btnLabel.rx.text)
.disposed(by: bag)
```
 | 20.734072 | 134 | 0.561389 | yue_Hant | 0.226822 |
4f93150ac7a69bdae1e0283fdc756f3a46ae1986 | 4,842 | md | Markdown | docs/API Reference/Components/Camera/DJICamera_DJICameraMultispectralExposureState.md | ryaa/Mobile-SDK-Android | 6f99dd8190e202c71fd0838a9e170317236c60e4 | [
"MIT"
] | null | null | null | docs/API Reference/Components/Camera/DJICamera_DJICameraMultispectralExposureState.md | ryaa/Mobile-SDK-Android | 6f99dd8190e202c71fd0838a9e170317236c60e4 | [
"MIT"
] | null | null | null | docs/API Reference/Components/Camera/DJICamera_DJICameraMultispectralExposureState.md | ryaa/Mobile-SDK-Android | 6f99dd8190e202c71fd0838a9e170317236c60e4 | [
"MIT"
] | null | null | null | <div class="article"><h1 ><font color="#AAA">class </font>MultispectralExposureState</h1></div>
~~~java
@EXClassNullAway
class MultispectralExposureState
~~~
<html><table class="table-supportedby"><tr valign="top"><td width=15%><font color="#999"><i>Package:</i></td><td width=85%><font color="#999">dji.common.camera</td></tr></table></html>
##### Description:
<font color="#666">The exposure state of a single-band sensor on the multispectral camera. The parameters in the state determines the relationship between exposure and sensor data values. When the camera is in different exposure modes, parameters may be changed by the camera automatically to optimize the exposure.
##### Class Members:
<div class="api-row" id="djicamera_djicameramultispectralexposurestate_band"><div class="api-col left">Band</div><div class="api-col middle" style="color:#AAA">method</div><div class="api-col right"><a class="trigger" href="#djicamera_djicameramultispectralexposurestate_band_inline">getSpectrumBand</a></div></div><div class="inline-doc" id="djicamera_djicameramultispectralexposurestate_band_inline"
><div class="article"><h6 ><font color="#AAA">method </font>getSpectrumBand</h6></div>
~~~java
SettingsDefinitions.SpectrumBand getSpectrumBand()
~~~
<html><table class="table-supportedby"><tr valign="top"><td width=15%><font color="#999"><i>Package:</i></td><td width=85%><font color="#999">dji.common.camera</td></tr></table></html>
##### Description:
<font color="#666">The spectrum for which this exposure state is.
##### Return:
<html><table class="table-inline-parameters"><tr valign="top"><td><font color="#70BF41"><a href="/Components/Camera/DJICamera_DJICameraSettingsDef.html#djicamera_djicamerasettingsdef">SettingsDefinitions</a>.<a href="/Components/Camera/DJICamera_DJICameraSettingsDef.html#djicamera_spectrumband">SpectrumBand</a></td><td><font color="#666"><i>An enum value of <code><a href="/Components/Camera/DJICamera_DJICameraSettingsDef.html#djicamera_spectrumband">SpectrumBand</a></code>.</i></td></tr></table></html></div>
<div class="api-row" id="djicamera_djicameramultispectralexposurestate_shutterspeed"><div class="api-col left">Shutter Speed</div><div class="api-col middle" style="color:#AAA">method</div><div class="api-col right"><a class="trigger" href="#djicamera_djicameramultispectralexposurestate_shutterspeed_inline">getShutterSpeed</a></div></div><div class="inline-doc" id="djicamera_djicameramultispectralexposurestate_shutterspeed_inline"
><div class="article"><h6 ><font color="#AAA">method </font>getShutterSpeed</h6></div>
~~~java
SettingsDefinitions.ShutterSpeed getShutterSpeed()
~~~
<html><table class="table-supportedby"><tr valign="top"><td width=15%><font color="#999"><i>Package:</i></td><td width=85%><font color="#999">dji.common.camera</td></tr></table></html>
##### Description:
<font color="#666">The shutter speed of the single band sensor.
##### Return:
<html><table class="table-inline-parameters"><tr valign="top"><td><font color="#70BF41"><a href="/Components/Camera/DJICamera_DJICameraSettingsDef.html#djicamera_djicamerasettingsdef">SettingsDefinitions</a>.<a href="/Components/Camera/DJICamera_DJICameraSettingsDef.html#djicamera_djicamerashutterspeed">ShutterSpeed</a></td><td><font color="#666"><i>An enum value of <code><a href="/Components/Camera/DJICamera_DJICameraSettingsDef.html#djicamera_djicamerashutterspeed">ShutterSpeed</a></code>.</i></td></tr></table></html></div>
<div class="api-row" id="djicamera_djicameramultispectralexposurestate_sensorgain"><div class="api-col left">Sensor Gain</div><div class="api-col middle" style="color:#AAA">method</div><div class="api-col right"><a class="trigger" href="#djicamera_djicameramultispectralexposurestate_sensorgain_inline">getSensorGain</a></div></div><div class="inline-doc" id="djicamera_djicameramultispectralexposurestate_sensorgain_inline"
><div class="article"><h6 ><font color="#AAA">method </font>getSensorGain</h6></div>
~~~java
float getSensorGain()
~~~
<html><table class="table-supportedby"><tr valign="top"><td width=15%><font color="#999"><i>Package:</i></td><td width=85%><font color="#999">dji.common.camera</td></tr></table></html>
##### Description:
<font color="#666">The gain of the sensor.
##### Return:
<html><table class="table-inline-parameters"><tr valign="top"><td><font color="#70BF41">float</td><td><font color="#666"><i>A float value of sensor gain.</i></td></tr></table></html></div>
<div class="api-row" id="djicamera_djicameramultispectralexposurestatecallbackinterface"><div class="api-col left">Callback</div><div class="api-col middle" style="color:#AAA">class</div><div class="api-col right"><a href="/Components/Camera/DJICamera_DJICameraMultispectralExposureStateCallbackInterface.html">Callback</a></div></div>
| 50.968421 | 531 | 0.745353 | kor_Hang | 0.244604 |
4f944e1bf9f8d827a68b3c1a6276836493ccc15a | 1,295 | md | Markdown | _posts/0006-01-01-Intro_to_RNAseq_Analysis.md | griffithlab/pmbio.org | 27f6d5be0a4110be1f194439163284fe08542ea6 | [
"MIT"
] | 41 | 2018-02-21T20:07:49.000Z | 2022-01-25T14:04:52.000Z | _posts/0006-01-01-Intro_to_RNAseq_Analysis.md | griffithlab/pmbio.org | 27f6d5be0a4110be1f194439163284fe08542ea6 | [
"MIT"
] | 25 | 2018-08-27T20:38:07.000Z | 2022-03-22T20:40:02.000Z | _posts/0006-01-01-Intro_to_RNAseq_Analysis.md | griffithlab/pmbio.org | 27f6d5be0a4110be1f194439163284fe08542ea6 | [
"MIT"
] | 23 | 2018-04-03T19:27:19.000Z | 2022-01-24T02:53:06.000Z | ---
feature_text: |
## Precision Medicine Bioinformatics
Introduction to bioinformatics for DNA and RNA sequence analysis
title: Intro to RNAseq Analysis
categories:
- Module-06-RNAseq
feature_image: "assets/genvis-dna-bg_optimized_v1a.png"
date: 0006-01-01
---
### Key concepts
* RNA-seq, library strategies, RNA splicing, genes and transcripts, transcription strand, gene/transcript abundance estimation, FPKM and TPM, differential expression (DE) analysis, normalization, batch effects.
### Learning objectives
* Perform alignment of RNA-seq data and a basic QC analysis of the resulting alignments
* Obtain gene and transcript abundance estimates
* Perform a reference-free alignment and abundance estimation and contrast the results with the reference based approach
* Basic differential expression analysis
* Perform an expression outlier analysis
* Run an RNA fusion detection tool and parse the results for interesting candidates
* Assess expression of specific gene markers of relevance (e.g. HER2, ER, PR)
* Assess the expression of specific variants identified in previous sections.
* Identify an example of allele specific expression
### Lecture
* [PMBIO_Module06_RNAseq.pdf](https://github.com/griffithlab/pmbio.org/raw/master/assets/lectures/PMBIO_Module06_RNAseq.pdf)
| 44.655172 | 210 | 0.801544 | eng_Latn | 0.888248 |
4f9472975e3941e9c6536d8939466806ee718028 | 64 | md | Markdown | _posts/2017-05-28-testing-from-quill.md | a1ip/manton.micro.blog | 45eb51ce1e04e7e6e96361513db033cad19a8321 | [
"MIT"
] | null | null | null | _posts/2017-05-28-testing-from-quill.md | a1ip/manton.micro.blog | 45eb51ce1e04e7e6e96361513db033cad19a8321 | [
"MIT"
] | 3 | 2021-06-22T15:28:03.000Z | 2021-06-22T15:28:05.000Z | _posts/2017-05-28-testing-from-quill.md | a1ip/manton.micro.blog | 45eb51ce1e04e7e6e96361513db033cad19a8321 | [
"MIT"
] | null | null | null | ---
layout: post
date: 2017-05-28 20:41
---
Testing from Quill.
| 10.666667 | 22 | 0.65625 | eng_Latn | 0.77848 |
4f971fc2a127367c13b9d9ed048c559a134b8c73 | 909 | md | Markdown | content/blog/Recipes/Other/sprinkles.md | brittanyhowell/thelibrie | 06831defaf3036c841429798e72f2152f41ce927 | [
"MIT"
] | null | null | null | content/blog/Recipes/Other/sprinkles.md | brittanyhowell/thelibrie | 06831defaf3036c841429798e72f2152f41ce927 | [
"MIT"
] | null | null | null | content/blog/Recipes/Other/sprinkles.md | brittanyhowell/thelibrie | 06831defaf3036c841429798e72f2152f41ce927 | [
"MIT"
] | 1 | 2021-01-23T19:23:39.000Z | 2021-01-23T19:23:39.000Z | ---
title: Sprinkles
date: '2020-01-24T22:12:03.284Z'
post-type: 'recipe'
thumb-nail: 'thumbnails/sprinkles.png'
---
The basis of which all recipes will follow:
## Ingredients
- 175 g Icing sugar
- 40g cornflour
- 0.25 t Salt
- 3 T Water
- 1 t Vanilla Extract
- Food Colouring
## Instructions
1. Kit prep: fit a small piping tip in a piping bag, have more bags ready to go
2. Combine the sugar, cornflour, salt, water & vanilla
3. Separate into bowls, and add colours
4. Add first colour to the piping bag - make lines for sprinkles, dots are also an option
5. Once the colour is complete, remove the piping tip and start with the second, repeat until rainbow is complete.
### Notes
You don't really have to use a piping tip, cutting a hole in the end of the bag will suffice.
The mixture is thic though so be warned you might blow through the bag if you aren't careful.
| 27.545455 | 114 | 0.739274 | eng_Latn | 0.997214 |
4f97e4e66df82730f0d8d9a08288cdaf6968a31b | 381 | md | Markdown | CodeNarc/UnnecessaryReturnKeyword.md | r3yn0ld4/docs-for-code-review-tools | a1590fce3b30891679373ec284787b227b21df05 | [
"MIT"
] | 4 | 2019-07-17T18:16:06.000Z | 2021-03-28T23:53:10.000Z | CodeNarc/UnnecessaryReturnKeyword.md | r3yn0ld4/docs-for-code-review-tools | a1590fce3b30891679373ec284787b227b21df05 | [
"MIT"
] | null | null | null | CodeNarc/UnnecessaryReturnKeyword.md | r3yn0ld4/docs-for-code-review-tools | a1590fce3b30891679373ec284787b227b21df05 | [
"MIT"
] | 5 | 2018-09-29T17:02:14.000Z | 2021-12-26T16:53:04.000Z | Pattern: Unnecessary `return` keyword
Issue: -
## Description
In Groovy, the `return` keyword is often optional. If a statement is the last line in a method or closure then you do not need to have the `return` keyword.
## Further Reading
* [CodeNarc - UnnecessaryReturnKeyword](https://codenarc.github.io/CodeNarc/codenarc-rules-unnecessary.html#unnecessaryreturnkeyword-rule) | 34.636364 | 156 | 0.782152 | eng_Latn | 0.931761 |
4f9982ccef1b5f042bdffb90b388ca53a48b6d07 | 320 | md | Markdown | Home Credit Default Risk/README.md | ppisarski/data-science | 09efe7bccc4aa1f7b895fe8d4e08b1232d93d121 | [
"MIT"
] | null | null | null | Home Credit Default Risk/README.md | ppisarski/data-science | 09efe7bccc4aa1f7b895fe8d4e08b1232d93d121 | [
"MIT"
] | null | null | null | Home Credit Default Risk/README.md | ppisarski/data-science | 09efe7bccc4aa1f7b895fe8d4e08b1232d93d121 | [
"MIT"
] | null | null | null | # Home Credit Default Risk
[data](https://www.kaggle.com/c/home-credit-default-risk/data)
- [Gentle Introduction](https://www.kaggle.com/willkoehrsen/start-here-a-gentle-introduction/comments)
- [Introduction: Manual Feature Engineering](https://www.kaggle.com/willkoehrsen/introduction-to-manual-feature-engineering)
| 45.714286 | 124 | 0.79375 | yue_Hant | 0.574655 |
4f9a41b86f6e16b752d5821a2d5a821d9545b149 | 1,712 | md | Markdown | Trial and Error/Session 3.md | benjimouse/r20 | 109d624fc2f8426ac42bed1dcd5e703f7bb6d981 | [
"MIT"
] | null | null | null | Trial and Error/Session 3.md | benjimouse/r20 | 109d624fc2f8426ac42bed1dcd5e703f7bb6d981 | [
"MIT"
] | null | null | null | Trial and Error/Session 3.md | benjimouse/r20 | 109d624fc2f8426ac42bed1dcd5e703f7bb6d981 | [
"MIT"
] | null | null | null | # Session 3
- Straight back into it.
- Hobbin puts the zombies to sleep
- Cloak is blue with elven ish writing and probably worth some money.
- Slowly reveal a rather fine rug under the rocks.
- Rug comes to life
- Bonus action shil
- Hit the rug
- Kill the rug
- Open the end door!
- It is the kitchen
- Close the door again
- Open end door
- Waterlogged library
- Tenticle beast in the water
- Use wild shape to enhance the spores
- Take it out
- Books about diseases and sickness
-
- Back to the disappear door
- Invis, pull leaver, push door
- Detect magic, door and writing conjuration magic, linked
- Rub the word out
- 8 abjuration chests
- Simper goes in to open the first chest
- 1 = 3 blue bottles
- 2 = 3 blue bottles
- True of all of them...
- Head outside to see the magic thing. Is Mephet
-
- Looking for his revenge on the gods
- Zombie infusion instructions
- Other unpleasant elven notes
- Head back to the water
- Level of exhaustion
- Another level of exhaustion
- Crabs
- Cold, very very cold
- 20 small redish liquid vials - use 2
- With draconic script
- And a glass eye
- Try drinking one of the potions
- Warmth springin through the body.
- No longer frozen
- These should cure the people...
- Head out of Saarlsvault
- Head back with Orvo
- Look for the buyer
- See a few plush chairs and a small dragon
- Offer to give the antedote to the buyer
- Could transport things to Elroe Alditor
- Eye would be helpful if you were blind...
- An ursart eye
- Send 10 and keep 8 in case there are others
- | 31.127273 | 70 | 0.658294 | eng_Latn | 0.997515 |
4f9a7c54ced979223a8d4551f73a4047b067d171 | 3,186 | md | Markdown | src/data/blog/2003/05/hello-ontario/index.md | mjn/mjn.github.io | e72895e85a02889f193c223cf8db1acd58866e7c | [
"RSA-MD"
] | null | null | null | src/data/blog/2003/05/hello-ontario/index.md | mjn/mjn.github.io | e72895e85a02889f193c223cf8db1acd58866e7c | [
"RSA-MD"
] | 10 | 2020-12-16T02:48:12.000Z | 2022-01-03T15:00:23.000Z | src/data/blog/2003/05/hello-ontario/index.md | mjn/mjn.github.io | e72895e85a02889f193c223cf8db1acd58866e7c | [
"RSA-MD"
] | 1 | 2021-03-08T22:09:55.000Z | 2021-03-08T22:09:55.000Z | ---
category: 'blog'
title: 'Hello Ontario!'
description: ''
date: '2003-05-26'
tags: ['Canads Bike Trip']
location: 'Longbow Lake, ON'
distance: '84.7km'
mapSrc: 'https://www.google.com/maps/embed?pb=!1m18!1m12!1m3!1d10316.800837016823!2d-94.34311775692156!3d49.72585712010983!2m3!1f0!2f0!3f0!3m2!1i1024!2i768!4f13.1!3m3!1m2!1s0x52bde38711fb659d%3A0x6c3040137857a6cb!2sLongbow%20Lake%2C%20ON!5e0!3m2!1sen!2sca!4v1609174273559!5m2!1sen!2sca'
---
We're finally here! After one month of riding, we have finally crossed into the province of Ontario. We had a great night last night at Falcon Lake, which will just add to the fond memories I have of passing through Manitoba. The only problem was that Dave once again fell asleep without writing his daily journal entry, and thus he woke up at 4am to do his writing. Inevitably, I woke up as well, which led to a fitful night of sleeping.
As a result, we were both a bit reluctant in getting out of bed, leading to a late start to the day. Once we began riding, it was immediately evident that we had left the prairies and entered the Canadian Shield as there were trees and rock everywhere. This of course led to hills... nothing major, but when you haven't seen a hill for over a week, they seem pretty significant! It took a little while to get my body back into gear to handle such obstacles, especially since the tail winds across the prairies had left me with very little work to do in regards to riding.
It was just a short journey to the Ontario border, and we stopped for a mandatory photo op and trip to the tourism booth to pick up maps and campground info. We then set out for Kenora, which was to be our lunch destination. Unfortunately, as our bodies got reacquainted with the hilly terrain, our riding speed was a bit slower than we were used to. Thus, we arrived in Kenora a bit later than expected.
The trek through the city of Kenora was amazing, with gorgeous scenery in every direction. We stopped for numerous pictures, including shots of Husky the Muskie! We then travelled through downtown, making some required stops, and then we went for lunch at Subway.
Following lunch, we tried to decide on where to spend the night. Our original destination, Vermillion Bay, was out of the question, and according to the map, there was nothing between Kenora and Vermillion Bay. A quick stop at the travel information hut pointed us towards a campground just outside of Kenora. This was an ideal location as it leaves us a reasonable distance from Dryden, which is the destination for tomorrow. Also, the campground is located right on the lake and has a small beach, making for a great spot to simply relax and enjoy nature!
It is cool to actually see Thunder Bay listed on the distance signs. It appears we are about four days from reaching Thunder Bay, depending on weather of course. After that, Sudbury is the next major destination. It will be interesting to track our progress across Ontario, seeing as how it is bigger than a lot of countries. Getting to Ottawa is going to be great feeling! I'm really looking forward to seeing everybody back home again. | 127.44 | 571 | 0.788136 | eng_Latn | 0.999768 |
4f9a7e835fbb48e11f3dd7ba80b568bad5decd94 | 248 | md | Markdown | README.md | GTVolk/DBAutoShop | ef89bb7fa1ac2c2ab9f3f042af09e368360df4e0 | [
"MIT"
] | null | null | null | README.md | GTVolk/DBAutoShop | ef89bb7fa1ac2c2ab9f3f042af09e368360df4e0 | [
"MIT"
] | null | null | null | README.md | GTVolk/DBAutoShop | ef89bb7fa1ac2c2ab9f3f042af09e368360df4e0 | [
"MIT"
] | null | null | null | # MSSQL DB Auto Shop
## Description
Microsoft SQL Express + C# Test Application
## Requirements
- Visual Studio
- MSSQL Express
## TODO
- Errors in encoding
- Connection Wizard
- Fixes
- i18l
- Cool UI
| 12.4 | 43 | 0.717742 | kor_Hang | 0.543533 |
4f9aa30c60574d336ca4ed5d5331d4497dfd3776 | 50 | md | Markdown | README.md | vikekh/pokver | 263792cf2ac44e73dc1adabde29a8c07c5704b2a | [
"MIT"
] | null | null | null | README.md | vikekh/pokver | 263792cf2ac44e73dc1adabde29a8c07c5704b2a | [
"MIT"
] | null | null | null | README.md | vikekh/pokver | 263792cf2ac44e73dc1adabde29a8c07c5704b2a | [
"MIT"
] | null | null | null | # Pokver
Versioning for the Nintendo generation.
| 12.5 | 39 | 0.8 | eng_Latn | 0.565992 |
4f9ab7f62d710a9f5586c78128ee77cb2ec9f964 | 2,136 | md | Markdown | docs/odbc/microsoft/dbase-indexes.md | zelanko/sql-docs.pt-br | 4bc6a809b48cb3bde3ca5a7b9659febcdd4d602c | [
"CC-BY-4.0",
"MIT"
] | 1 | 2021-09-05T16:06:11.000Z | 2021-09-05T16:06:11.000Z | docs/odbc/microsoft/dbase-indexes.md | zelanko/sql-docs.pt-br | 4bc6a809b48cb3bde3ca5a7b9659febcdd4d602c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/odbc/microsoft/dbase-indexes.md | zelanko/sql-docs.pt-br | 4bc6a809b48cb3bde3ca5a7b9659febcdd4d602c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
description: Índices do dBASE
title: Índices do dBASE | Microsoft Docs
ms.custom: ''
ms.date: 01/19/2017
ms.prod: sql
ms.prod_service: connectivity
ms.reviewer: ''
ms.technology: connectivity
ms.topic: conceptual
helpviewer_keywords:
- DBase indexes [ODBC]
- DBase driver [ODBC], indexes
ms.assetid: fdfa56f5-e324-4ec2-9267-fdf95ab99373
author: David-Engel
ms.author: v-daenge
ms.openlocfilehash: 30a6390f0e187cc063b2a650af2da3b9fcc87d57
ms.sourcegitcommit: e700497f962e4c2274df16d9e651059b42ff1a10
ms.translationtype: MT
ms.contentlocale: pt-BR
ms.lasthandoff: 08/17/2020
ms.locfileid: "88340952"
---
# <a name="dbase-indexes"></a>Índices do dBASE
O driver do dBASE do ODBC abre e atualiza automaticamente os arquivos de índice do dBASE IV. Você deve usar a caixa de diálogo **selecionar índices** exibida por meio do administrador de fonte de dados ODBC para associar arquivos. ndx do dBASE III a arquivos do dBASE.
As seguintes limitações se aplicam à criação de índices do dBASE:
- Todos os nomes de coluna devem ser válidos.
- Todas as colunas devem estar na mesma ordem crescente ou decrescente.
- O comprimento de qualquer coluna de texto individual deve ser menor que 100 bytes.
- Se houver mais de uma coluna, todas as colunas deverão ser colunas de texto e a soma dos tamanhos das colunas deverá ser menor que 100 bytes.
- Os campos de memorando não podem ser indexados.
- Um índice não deve ser especificado para o conjunto atual de campos (ou seja, índices duplicados não são permitidos).
- O nome do índice deve corresponder à Convenção de nomenclatura do índice do dBASE. o dBASE III requer que cada índice esteja em um arquivo separado, cada um com uma extensão. ndx. No dBASE IV, os índices são criados como nomes de marca que são armazenados em um único arquivo. MDX. O arquivo. MDX tem o mesmo nome base do arquivo de banco de dados (por exemplo, EMP. MDX é o arquivo de índice para o banco de dados EMP. dbf).
- o dBASE define um índice exclusivo como um em que apenas um registro de um conjunto com valores de chave idênticos é adicionado ao índice.
| 48.545455 | 431 | 0.767322 | por_Latn | 0.998996 |
4f9b29cac0a245f1932e6eec8b7f0efd19372ecb | 331 | markdown | Markdown | notes/about.markdown | mpilquist/shapeless | 236df883db98243cf857f57d36cbe63671ed53ad | [
"Apache-2.0"
] | 1 | 2018-06-10T16:12:33.000Z | 2018-06-10T16:12:33.000Z | notes/about.markdown | retronym/shapeless | e4752b7ba028edf61884506de8938f8ba5b77dc7 | [
"Apache-2.0"
] | null | null | null | notes/about.markdown | retronym/shapeless | e4752b7ba028edf61884506de8938f8ba5b77dc7 | [
"Apache-2.0"
] | null | null | null | [shapeless](https://github.com/milessabin/shapeless) is an exploration of
type class and dependent type based generic programming in Scala.
A series of articles on the implementation techniques used will appear
[here](http://www.chuusai.com/blog) and it also has a
[mailing list](https://groups.google.com/group/shapeless-dev).
| 47.285714 | 74 | 0.785498 | eng_Latn | 0.989337 |
4f9b5ebcaf4907e5a962a62fb7da1f46be828616 | 2,115 | md | Markdown | _containers/marcjwilliams1-dnds-clonesize-R-container-latest.md | singularityhub/singularityhub-archive | dd1d471db0c4ac01998cb84bd1ab82e97c8dab65 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | _containers/marcjwilliams1-dnds-clonesize-R-container-latest.md | singularityhub/singularityhub-archive | dd1d471db0c4ac01998cb84bd1ab82e97c8dab65 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | _containers/marcjwilliams1-dnds-clonesize-R-container-latest.md | singularityhub/singularityhub-archive | dd1d471db0c4ac01998cb84bd1ab82e97c8dab65 | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | ---
id: 10729
name: "marcjwilliams1/dnds-clonesize-R-container"
branch: "master"
tag: "latest"
commit: "299ad35d95e8a478dbb27ab92784d247593a23ee"
version: "282e13ea3090576c1de36743fc7fa6cf"
build_date: "2020-07-28T16:53:53.769Z"
size_mb: 3622.0
size: 1521274911
sif: "https://datasets.datalad.org/shub/marcjwilliams1/dnds-clonesize-R-container/latest/2020-07-28-299ad35d-282e13ea/282e13ea3090576c1de36743fc7fa6cf.sif"
datalad_url: https://datasets.datalad.org?dir=/shub/marcjwilliams1/dnds-clonesize-R-container/latest/2020-07-28-299ad35d-282e13ea/
recipe: https://datasets.datalad.org/shub/marcjwilliams1/dnds-clonesize-R-container/latest/2020-07-28-299ad35d-282e13ea/Singularity
collection: marcjwilliams1/dnds-clonesize-R-container
---
# marcjwilliams1/dnds-clonesize-R-container:latest
```bash
$ singularity pull shub://marcjwilliams1/dnds-clonesize-R-container:latest
```
## Singularity Recipe
```singularity
BootStrap: docker
From: asachet/rocker-stan
%labels
Maintainer Marc J Williams
%help
Singularity image for following paper:
%post
# add R packages from CRAN
Rscript -e "install.packages(pkgs = c('devtools', 'cowplot', 'gtools', 'argparse','jcolors', 'ggthemes', 'viridis','Hmisc','ggridges', 'readxl',
'bayesplot', 'modelr', 'ggforce', 'ggfortify', 'bayestestR'), \
repos='https://cran.revolutionanalytics.com/', \
dependencies=TRUE, \
clean = TRUE)"
#add R packages from bioconductor
Rscript -e "install.packages('BiocManager')"
Rscript -e "library(BiocManager); install('GenomicRanges')"
Rscript -e "library(BiocManager); install('IRanges')"
Rscript -e "library(BiocManager); install('Biostrings')"
Rscript -e "library(BiocManager); install('Rsamtools')"
Rscript -e "library(BiocManager); install('seqinr')"
Rscript -e "library(BiocManager); install('rtracklayer')"
# add R packages from github
Rscript -e "library(devtools); install_github('marcjwilliams1/dndscv', ref = 'dev')"
```
## Collection
- Name: [marcjwilliams1/dnds-clonesize-R-container](https://github.com/marcjwilliams1/dnds-clonesize-R-container)
- License: None
| 34.672131 | 155 | 0.748936 | yue_Hant | 0.153483 |
4f9be122923fac7abf6d896d13189e9447ef0839 | 5,657 | md | Markdown | _posts/2018-01-01-splitting-strings-python.md | taniaka/taniaka.github.io | 9dd0ab4baeffff4a3a3650472678452eb9f234c5 | [
"MIT"
] | null | null | null | _posts/2018-01-01-splitting-strings-python.md | taniaka/taniaka.github.io | 9dd0ab4baeffff4a3a3650472678452eb9f234c5 | [
"MIT"
] | null | null | null | _posts/2018-01-01-splitting-strings-python.md | taniaka/taniaka.github.io | 9dd0ab4baeffff4a3a3650472678452eb9f234c5 | [
"MIT"
] | null | null | null | ---
layout: post
title: Splitting strings in Python
categories: python string
icon: hand-spock-o
---
If you have ever dealt with Python strings, chances are you're already familiar with the `split` method that takes a string and breaks it into a multi-element list.
As an optional argument `split` can take a string indicating where exactly the division should occur. In the example below, this delimiter argument is a comma:
```
>>> 'alpa,beta,gamma,delta'.split(',')
['alpa', 'beta', 'gamma', 'delta']
```
If the delimiter isn't specified, the string is split on whitespace:
```
>>> 'alpha beta gamma delta'.split()
['alpha', 'beta', 'gamma', 'delta']
```
This might lead you to believe that splitting with no delimiter is equal to splitting on a space character, but have a look at the following examples:
```
>>> ' hi there '.split(' ')
['', '', '', '', 'hi', 'there', '']
>>> ' hi there '.split()
['hi', 'there']
```
The operations output totally different lists, but why does this happen?
The thing is that two distinct algorithms are used by the `split` method: one of them is applied to splits with a delimiter and the other one to those without one. To fully understand how splitting works, it's a good idea to look at each type separately.
### Splitting with a delimiter
So, if a delimiter is specified, the string splits each time the delimiter occurs in it. The delimiter can consist of as many characters as you like and it is stripped out from the result. So basically, we use the delimiter to break the string into pieces and then just 'throw it away'.
```
>>> 'rococoesque'.split('o')
['r', 'c', 'c', 'esque']
>>> 'rococoesque'.split('oes')
['rococ', 'que']
```
`split` also takes an optional second argument called _maxsplit_ which specifies the maximum number of splits to be made.
```
>>> 'rococoesque'.split('o', 2)
['r', 'c', 'coesque']
```
In the previous example, the string has 3 o's, but since I set _maxsplit_ to 2, only 2 splits were made.
By far the most interesting thing about this splitting algorithm is that consecutive delimiters are treated as if they were separating empty strings. In other words, if the string happens to have two delimiters side by side, an empty string appears at the corresponding position of the list generated through splitting.
```
>>> 'cooool'.split('o')
['c', '', '', '', 'l']
```
In the previous example, my string has 4 o's in a row, so not only is 'c' separated from 'l', but also a split is made for each pair of consecutive o's and three empty strings are inserted as a result.
Also, if the delimiter happens to open or close the string, an empty string is inserted as the first or last element of the output list, respectively.
```
>>> 'kayak'.split('k')
['', 'aya', '']
```
What has been said is also true for splitting at a whitespace character, (but only if it is explicitely passed as an argument). That is, the algorithm applied by `s.split(' ')` is in no way different from the one applied by, say, `s.split('k')`.
```
>>> ' a b c d '.split(' ')
['', 'a', 'b', 'c', '', '', 'd', '']
```
### Splitting without a delimiter
If the delimiter is not specified or is set to `None`, the string is split on whitespace. The important thing here is that by whitespace we refer not only to a regular space, but also to a bunch of newline and tab characters:
- \n line break
- \t horizontal tab
- \v vertical tab
- \r carriage retun
- \f formfeed
All of those are considered as delimiters by this splitting algorithm.
```
>>> 'a b\nc\td\ve\rf\f'.split()
['a', 'b', 'c', 'd', 'e', 'f']
```
According to Python [docs](https://docs.python.org/3/library/stdtypes.html#str.split), any combination of consecutive whitespace is regarded as a single delimiter. What this means is that `split` is smart enough to understand that for a sequence of 5 whitespace characters, I would generally prefer to get 1 split instead of 5. Also, if the string has leading or trailing whitespace, no empty string is inserted at the start or end.
```
>>> ' a\t \vb c\n\n \r d\n'.split()
['a', 'b', 'c', 'd']
```
### Using regular expressions to split strings (a couple of examples)
Python's `split` method is pretty handy, but it may fall short in more complex scenarios. A more powerful `split` method can be found in Python's `re` module which provides regular expression matching operations.
This post is not about regular expressions, but let me show you a couple of things that can be easily achieved with `re`. (And, of course, don't forget to do an `import re` first).
When you do a split, the delimiter string is not included in the output list by default. While normally this is the desired behavior, sometimes you may not want to get rid of the delimiter, and with regular expressions keeping it is as easy as putting parentheses around it.
```
>>> re.split(r'2', '12321') #no parentheses, the '2' delimiter is stripped out
['1', '3', '1']
>>> re.split(r'(2)', '12321') #he '2' delimiter is inside parentheses and is not stripped out
['1', '2', '3', '2', '1']
```
Another thing you are likely to need is being able to simultaneously use several delimiters. For instance, you might want to split a string at ',' and at ';' at the same time. With a regular expression, it can be achieved by separating the delimiters with an '|' character:
```
>>> re.split(r',|;', 'a,b;c;d,e')
['a', 'b', 'c', 'd', 'e']
```
If you're interested in doing more advanced operations with strings, I highly recommend you to have a closer look at the `re` module. There are many online resources, such as [PyMOTW tutorial](https://pymotw.com/2/re/), to help get you started.
| 45.256 | 432 | 0.705674 | eng_Latn | 0.999515 |
4f9db53b2cd8f345921484c934b134e582acb193 | 25 | md | Markdown | README.md | toothless1216/toothless1216.github.io | 4b5d547a3671fbd88c28e9f1429ddccbd8f41c15 | [
"CC-BY-3.0"
] | null | null | null | README.md | toothless1216/toothless1216.github.io | 4b5d547a3671fbd88c28e9f1429ddccbd8f41c15 | [
"CC-BY-3.0"
] | null | null | null | README.md | toothless1216/toothless1216.github.io | 4b5d547a3671fbd88c28e9f1429ddccbd8f41c15 | [
"CC-BY-3.0"
] | null | null | null | # toothless1216.github.io | 25 | 25 | 0.84 | eng_Latn | 0.685163 |
4f9e3c68a792473d76d26c3af9db226bfdb0b796 | 35 | md | Markdown | README.md | binyellow/source | 49b2bbf56051a51697ecab1868f0d68c14ea9fa2 | [
"MIT"
] | null | null | null | README.md | binyellow/source | 49b2bbf56051a51697ecab1868f0d68c14ea9fa2 | [
"MIT"
] | null | null | null | README.md | binyellow/source | 49b2bbf56051a51697ecab1868f0d68c14ea9fa2 | [
"MIT"
] | null | null | null | # source
notes of read source code
| 11.666667 | 25 | 0.771429 | eng_Latn | 0.703494 |
4f9e84ec395105027b9b084ba33b7d41e15c4e51 | 69 | md | Markdown | .changeset/popular-kids-run.md | PH4NTOMiki/kit | 4e4625ea6d9a084bc767ae216704aacd95fe8730 | [
"MIT"
] | 9 | 2021-12-25T06:02:20.000Z | 2022-01-23T09:59:40.000Z | .changeset/popular-kids-run.md | PH4NTOMiki/kit | 4e4625ea6d9a084bc767ae216704aacd95fe8730 | [
"MIT"
] | 31 | 2021-12-27T11:31:37.000Z | 2022-01-06T06:26:18.000Z | .changeset/popular-kids-run.md | PH4NTOMiki/kit | 4e4625ea6d9a084bc767ae216704aacd95fe8730 | [
"MIT"
] | 7 | 2021-12-27T10:58:06.000Z | 2022-01-22T01:12:02.000Z | ---
'create-svelte': patch
---
[chore] upgrade to Playwright 1.21.0
| 11.5 | 36 | 0.652174 | eng_Latn | 0.791562 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.