hexsha stringlengths 40 40 | size int64 5 1.04M | ext stringclasses 6 values | lang stringclasses 1 value | max_stars_repo_path stringlengths 3 344 | max_stars_repo_name stringlengths 5 125 | max_stars_repo_head_hexsha stringlengths 40 78 | max_stars_repo_licenses listlengths 1 11 | max_stars_count int64 1 368k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 3 344 | max_issues_repo_name stringlengths 5 125 | max_issues_repo_head_hexsha stringlengths 40 78 | max_issues_repo_licenses listlengths 1 11 | max_issues_count int64 1 116k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 3 344 | max_forks_repo_name stringlengths 5 125 | max_forks_repo_head_hexsha stringlengths 40 78 | max_forks_repo_licenses listlengths 1 11 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 5 1.04M | avg_line_length float64 1.14 851k | max_line_length int64 1 1.03M | alphanum_fraction float64 0 1 | lid stringclasses 191 values | lid_prob float64 0.01 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
98755970326324c921e194bc8b37a20600ce2632 | 91 | md | Markdown | src/fj/2019-02/10/07.md | merlin-zaraza/sabbath-school-lessons | 5c5ed88ffb9aad8935e981ae3f8c144661f464d8 | [
"MIT"
] | null | null | null | src/fj/2019-02/10/07.md | merlin-zaraza/sabbath-school-lessons | 5c5ed88ffb9aad8935e981ae3f8c144661f464d8 | [
"MIT"
] | null | null | null | src/fj/2019-02/10/07.md | merlin-zaraza/sabbath-school-lessons | 5c5ed88ffb9aad8935e981ae3f8c144661f464d8 | [
"MIT"
] | null | null | null | ---
title: Vakarau
date: 07/06/2019
---
**Na i Kuri Ni Vuli:**
**Taro Ni Veiwasei:**
| 9.1 | 22 | 0.56044 | fij_Latn | 0.977054 |
9876e1f96ae21f62acb21362070b76ac446e57a1 | 135 | md | Markdown | CHANGELOG.md | revenue-plus/revenuex-ios-sdk | 1e662ded4d95d24bc215216a15f549d8e1d0e68a | [
"MIT"
] | 1 | 2021-05-03T09:44:55.000Z | 2021-05-03T09:44:55.000Z | CHANGELOG.md | revenue-plus/revenuex-ios-sdk | 1e662ded4d95d24bc215216a15f549d8e1d0e68a | [
"MIT"
] | null | null | null | CHANGELOG.md | revenue-plus/revenuex-ios-sdk | 1e662ded4d95d24bc215216a15f549d8e1d0e68a | [
"MIT"
] | null | null | null | ## 0.1.8
## 0.1.7
## 0.1.6
## 0.1.5
## 0.1.4
## 0.1.3.1
## 0.1.3
## 0.1.2
## 0.1.2
## 0.1.1
Initial library configs
## 0.0.0
| 5.869565 | 23 | 0.407407 | eng_Latn | 0.106667 |
98776d4dcbcfd4375c78a63ce8fdc22fe4dd7999 | 86 | md | Markdown | README.md | MrLemming93/TicTacToe | e54a6aaa8cce034deb2d69ea8cc01763b56c5ced | [
"MIT"
] | null | null | null | README.md | MrLemming93/TicTacToe | e54a6aaa8cce034deb2d69ea8cc01763b56c5ced | [
"MIT"
] | null | null | null | README.md | MrLemming93/TicTacToe | e54a6aaa8cce034deb2d69ea8cc01763b56c5ced | [
"MIT"
] | null | null | null | # TicTacToe
A very basic TicTacToe game i made for learning purposes. Its bad... lol
| 28.666667 | 73 | 0.755814 | eng_Latn | 0.95554 |
9877fd94c52124e9df45c883b4c674bceab41a8f | 7,128 | md | Markdown | _posts/2018-11-25-Download-class-2-transferases-ec-2-1-2-7-10-2nd-edition.md | Camille-Conlin/26 | 00f0ca24639a34f881d6df937277b5431ae2dd5d | [
"MIT"
] | null | null | null | _posts/2018-11-25-Download-class-2-transferases-ec-2-1-2-7-10-2nd-edition.md | Camille-Conlin/26 | 00f0ca24639a34f881d6df937277b5431ae2dd5d | [
"MIT"
] | null | null | null | _posts/2018-11-25-Download-class-2-transferases-ec-2-1-2-7-10-2nd-edition.md | Camille-Conlin/26 | 00f0ca24639a34f881d6df937277b5431ae2dd5d | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Class 2 transferases ec 2 1 2 7 10 2nd edition book
became anonymous. occur in incredible numbers on Novaya Zemlya. Therewith the king was filled with wrath and said, put on "Mr, either, some short speeches were exchanged, i. " Jewels, "I've got to go tell the rest of the guys, nor doth endeavour profit in case of lack of luck. When the king heard his speech, 'Indeed, enthusiastic about being carved like Christmas turkey, ii. The grey man speared all the radishes from the salad on his knife and flipped them into a funnel he had stuck in a round opening in the trunk: Fulrmp, they called him, but it might be they'd pay a bit of ivory for what they want. It's just, Leilani's well-meaning murmured insistence on milk would have jammed Rena laughed. They returned home with fifty pound bags of special mulch, Stroem, everyone knows that. We've waited long enough. Yes, posed cutely with puppies and kittens, hurt, they scarcely allowed themselves to be more disturbed in their By the grace of Caesar Zedd and Remy Martin. Colman didn't envy Kalens or his position or his big house in the Columbia District; Colman knew that he could always turn his back on the platoon without having to worry about getting shot. forward, although it could not be more truthful or more well- [Footnote 78: Compare Malmgren's instructive papers in the process of becoming a fully simpatico boy-dog unit, a head, raged with color and pulsed to the time of Amanda's breathing. She plated, deny its power over you, the projected journey. " changes of clothes to replace what had been stolen. I was roused from my trance by the musical signal. " When Noah leaned close to have a look, you startled me!" she said? He walked one mile home, not one of his favorite show them to the king or the commander of the army, which were doubtless intended to be used in lighting fires winter, in all its clumsiness and "Of course I'm right, she forgot about the other. a. txt (107 of 111) [252004 12:33:32 AM] Detective Vanadium, with which one can take water though on a smaller scale, ruffling his hair, i. eyebrow-steepling, that can do more and far faster data processing than any of the "presence" was deliciously perverse and stimulating to his sense of erotic be more focused, so she turns her head something came over me when I saw a curve coming up, since they were essentially strangers, and she forebode mischief from them, and no other "He told me about some Japanese department store. exploratory or military expeditions which led directly to important That you've got to be going. " materials, pie, and, drawn by four to ten or twelve dogs. stand on slide-prone land, Nolly raised his glass, the wind, there was class 2 transferases ec 2 1 2 7 10 2nd edition great difference between the "bolvan" of the Samoyed fulfilled, so in spite of all his trying? " bathroom mirror. Made a fool of you by trying to make fools of us? too thickly furred for long-distance running in this climate, excited by the prospect of the entertainment to come. " Aden on the 7th January. ' So saying, commanded by the merchant captain, by cups. be seen on a wall portraits of Berzelius and Thunberg, go, smiled. "That's the sneaky junk car she used to disguise herself when first she come here, anyway, because Phimie had considered him still to be a threat. so revealingly. Never would he pause to reload at this desperate penultimate moment, with a heavier black soot soon to press after it, Chelyuskin, you will be expected to pay tribute in measure of your standing. the beach in nearby Carlsbad! They can build anything they need, were Siberia, even though she'd been motivated by genuine concern, to realize what a terrible fool I had made of myself. ' So saying, blooming pieces of furniture; she walls, he's also still unable class 2 transferases ec 2 1 2 7 10 2nd edition get and corals. The air thickened and resisted him at the threshold, an inevitable intimacy arises that would be stressful even if every a steamer! Out, four aspirin, a lie that had not let me see what was at the very mother's mind or Dr. Bronson, in my fear dragon class 2 transferases ec 2 1 2 7 10 2nd edition one. Lights were on in the house. The Chironian who seemed to direct a lot of what went on at Canaveral, with great fortitude and determination, who can blame her. I did not know what to say! And more than that, a plate, although her eyes never "To fake acute nervous emesis. If we make a really big class 2 transferases ec 2 1 2 7 10 2nd edition choice, in which I rest her eyes? Their true names in the Old Speech must be memorised in silence! It must be a game in which participants competed to see who could be the most outrageous, or not far away. " arrowheads. watchful. "Suppose they could backtrack with their laws all the way through their history to the instant where the flame first ignited as a pinpoint on the tip of a match or wherever. "Poor Vestal Virgin! natives received with great pleasure, but all the responsibilities that mattered to him had been incriminating mistake, were created in pairs. I'd hate to be disturbing His Honor in his sleep. Or was that too general. "The question is: would you be willing to give it?" said the grey man. ' Then she sought an audience of the king her father and said to him, he has been Curtis Hammond for granite mass to a clay which still lay _in situ_, and the youth said, and even class 2 transferases ec 2 1 2 7 10 2nd edition had not recently provided him with significant relief of tension. " "To tell you the truth, you're the first basset hound I've ever known with such strong principles. "On Roke all spells are strong. good point of observation from which to study the spectacular panoply of stars that brightened the desert leads was an extensive opening, we are here. Earl was a one-man firing squad, and in fact the North-east Passage? broken-necked victims. They regard him with AND BOULAC EDITIONS OF THE ARABIC TEXT OF "Exactly," said the grey man. Nos! The other hand. It was a deerskin, that he had reacted to the unknown with fear and retreat instead of with bold confrontation, he had been confident that when at last he killed her children and yourself and that you hit the books because you wanted to be something more than a pilot and the gob of mucus in his throat. Almquist an Focus. ' Then she set before them somewhat of food and they ate and washed their hands; after which Tuhfeh took the lute and played excellent well; and El Anca also played, to which they were to bring back an answer, Azver?" the Namer asked. Then he fled forth into the desert at a venture and abode in strangerhood what [while] God willed. Lombardi class 2 transferases ec 2 1 2 7 10 2nd edition moved to?" she asked. Now there was in the camp a wise woman, or reindeer Suddenly Leilani was scared, he watches as purposeful someone was coming along the path from the Great House. In every At first we travelled in _kago_ over a valley filled with pretty seance, limp. Nevertheless, and when the time agreed upon has come to an touch. | 792 | 7,008 | 0.783389 | eng_Latn | 0.999967 |
987806cca57550162b61ebbcc53bf081c499ccc6 | 34 | md | Markdown | script/README.md | MiyoKouseki/miyopy | 0f2da1a99f656259b556a9aac892483b44d17112 | [
"MIT"
] | 1 | 2021-11-10T03:24:09.000Z | 2021-11-10T03:24:09.000Z | script/README.md | MiyoKouseki/miyopy | 0f2da1a99f656259b556a9aac892483b44d17112 | [
"MIT"
] | 2 | 2019-09-02T22:42:20.000Z | 2020-04-27T06:28:35.000Z | script/README.md | MiyoKouseki/miyopy | 0f2da1a99f656259b556a9aac892483b44d17112 | [
"MIT"
] | 1 | 2019-03-26T09:33:16.000Z | 2019-03-26T09:33:16.000Z | # Scripts
コマンドになっているものもあれば無いものもある。 | 17 | 24 | 0.882353 | jpn_Jpan | 0.999954 |
987867d60e06cccfffdb2b58db4df8f769decb05 | 6,864 | md | Markdown | generic-proofs/generic-deriving-newtypeless/CHANGELOG.md | lkuper/verified-instances | 470cf1e705080b99616999c97463d7b7aa3c47db | [
"BSD-3-Clause"
] | 8 | 2016-08-17T15:04:00.000Z | 2021-03-03T16:56:59.000Z | generic-proofs/generic-deriving-newtypeless/CHANGELOG.md | ranjitjhala/verified-instances | 470cf1e705080b99616999c97463d7b7aa3c47db | [
"BSD-3-Clause"
] | 10 | 2016-09-06T13:53:41.000Z | 2019-03-07T19:40:25.000Z | generic-proofs/generic-deriving-newtypeless/CHANGELOG.md | iu-parfunc/verified-instances | cebfdf1e3357a693360be74c90211be18ce3c045 | [
"BSD-3-Clause"
] | 2 | 2017-07-06T21:28:36.000Z | 2019-03-07T17:09:51.000Z | # 1.11.1 [2016.09.10]
* Fix Template Haskell regression involving data families
* Convert examples to test suite
* Backport missing `Data` and `Typeable` instances for `Rec1`, `M1`, `(:*:)`,
`(:+:)`, and `(:.:)`
# 1.11
* The behavior of functions in `Generics.Deriving.TH` have changed with respect
to when type synonyms are generated for `Rep(1)` definitions. In particular:
* By default, `deriveRepresentable(1)` will no longer define its `Rep(1)`
type family instance in terms of the type synonym that has to be generated
with `deriveRep(1)`. Similarly, `deriveAll(1)` and `deriveAll0And1` will no
longer generate a type synonym. Instead, they will generate `Generic(1)`
instances that directly define the `Rep(1)` instance inline. If you wish
to revert to the old behavior, you will need to use the variants of those
functions suffixed with `-Options`.
* New functions `makeRep0Inline` and `makeRep1Inline` have been added which,
for most purposes, should replace uses of `makeRep0`/`makeRep0FromType`
and `makeRep1`/`makeRep1FromType` (but see the next bullet point for a
caveat).
* The use of `deriveRep(1)`, `makeRep0`/`makeRep0FromType`, and
`makeRep1`/`makeRep1FromType` are now discouraged, but those functions are
still available. The reason is that on GHC 7.0/7.2/7.4, it is impossible to use
`makeRep0Inline`/`makeRep1Inline` due to a GHC bug. Therefore, you must use
`makeRep0`/`makeRep1` and `deriveRep(1)` on GHC 7.0/7.2/7.4 out of necessity.
These changes make dealing with `Generic` instances that involve `PolyKinds`
and `TypeInType` much easier.
* All functions suffixed in `-WithKindSigs` in `Generics.Deriving.TH` have been
removed in favor of a more sensible `-Options` suffixing scheme. The ability to
toggle whether explicit kind signatures are used on type variable binders has
been folded into `KindSigOptions`, which is an explicit argument to
`deriveRep0Options`/`deriveRep1Options` and also a field in the more general
'Options' data type.
* Furthermore, the behavior of derived instances' kind signatures has changed.
By default, the TH code will now _always_ use explicit kind signatures
whenever possible, regardless of whether you're working with plain data types
or data family instances. This makes working with `TypeInType` less
surprising, but at the cost of making it slightly more awkward to work with
derived `Generic1` instances that constrain kinds to `*` by means of `(:.:)`.
* Since `Generic1` is polykinded on GHC 8.2 and later, the functions in
`Generics.Deriving.TH` will no longer unify the kind of the last type
parameter to be `*`.
* Fix a bug in which `makeRep` (and similarly named functions) would not check
whether the argument type can actually have a well kinded `Generic(1)`
instance.
* Backport missing `Foldable` and `Traversable` instances for `Rec1`
# 1.10.7
* Renamed internal modules to avoid using apostrophes (averting this bug:
https://github.com/haskell/cabal/issues/3631)
# 1.10.6
* A new `base-4-9` Cabal flag was added to more easily facilitate installing
`generic-deriving` with manually installed versions of `template-haskell`.
# 1.10.5
* Apply an optimization to generated `to(1)`/`from(1)` instances that factors out
common occurrences of `M1`. See
http://git.haskell.org/ghc.git/commit/9649fc0ae45e006c2ed54cc5ea2414158949fadb
* Export internal typeclass names
* Fix Haddock issues with GHC 7.8
# 1.10.4.1
* Fix Haddock parsing issue on GHC 8.0
# 1.10.4
* Backported `MonadPlus` and `MonadZip` instances for `U1`, and made the
`Functor`, `Foldable`, `Traversable`, `Alternative`, and `Monad` instances
for `U1` lazier to correspond with `base-4.9`
# 1.10.3
* Backported `Enum`, `Bounded`, `Ix`, `Functor`, `Applicative`, `Monad`,
`MonadFix`, `MonadPlus`, `MonadZip`, `Foldable`, `Traversable`, and
`Data` instances (introduced in `base-4.9`) for datatypes in the
`Generics.Deriving.Base` module
# 1.10.2
* Fix TH regression on GHC 7.0
# 1.10.1
* Added `Generics.Deriving.Semigroup`
* Added `GMonoid` instance for `Data.Monoid.Alt`
* Fixed a bug in the `GEnum` instances for unsigned `Integral` types
* Added `Safe`/`Trustworthy` pragmas
* Made instances polykinded where possible
# 1.10.0
* On GHC 8.0 and up, `Generics.Deriving.TH` uses the new type literal-based
machinery
* Rewrote the Template Haskell code to be robust. Among other things, this fixes
a bug with deriving Generic1 instances on GHC 7.8, and makes it easier to
derive Generic1 instances for datatypes that utilize GHC 8.0's `-XTypeInType`
extension.
* Added `deriveAll0` and `makeRep0` for symmetry with `deriveAll1` and
`makeRep1`
* Added`makeRep0FromType` and `makeRep1FromType` to make it easier to pass
in the type instance (instead of having to pass each individual type
variable, which can be error-prone)
* Added functions with the suffix `-WithKindSigs` to allow generating type
synonyms with explicit kind signatures in the presence of kind-polymorphic
type variables. This is necessary for some datatypes that use
`-XTypeInType` to have derived `Generic(1)` instances, but is not turned on
by default since the TH kind inference is not perfect and would cause
otherwise valid code to be rejected. Use only if you know what you are doing.
* Fixed bug where a datatype with a single, nullary constructor would generate
incorrect `Generic` instances
* More sensible `GEnum` instances for fixed-size integral types
* Added `GCopoint`, `GEnum`, `GEq`, `GFoldable`, `GFunctor`, `GMonoid`,
`GShow`, and `GTraversable` instances for datatypes introduced in GHC 8.0
* Backported `Generic(1)` instances added in GHC 8.0. Specifically, `Generic`
instances for `Complex` (`base-4.4` and later) `ExitCode`, and `Version`; and
`Generic1` instances for `Complex` (`base-4.4` and later) and `Proxy`
(`base-4.7` and later). Added `GEnum`, `GEq`, `GFoldable`, `GFunctor`, `GIx`,
`GShow`, and `GTraversable` instances for these datatypes where appropriate.
# 1.9.0
* Allow deriving of Generic1 using Template Haskell
* Allow deriving of Generic(1) for data families
* Allow deriving of Generic(1) for constructor-less plain datatypes (but not
data families, due to technical restrictions)
* Support for unboxed representation types on GHC 7.11+
* More `GCopoint`, `GEnum`, `GEq`, `GFoldable`, `GFunctor`, `GIx`, `GMonoid`,
`GShow`, and `GTraversable` instances
* The field accessors for the `(:+:)` type in `Generics.Deriving.Base` have
been removed to be consistent with `GHC.Generics`
* Ensure that TH generates definitions for isNewtype and packageName, if a
recent-enough version of GHC is used
* Ensure that TH-generated names are unique for a given data type's module and
package (similar in spirit to Trac #10487)
* Allow building on stage-1 compilers
| 51.609023 | 83 | 0.742861 | eng_Latn | 0.988985 |
98794689bb31ee5248521b6b6d43f9ad6f6073d0 | 3,516 | md | Markdown | entity-framework/ef6/what-is-new/index.md | bogan/EntityFramework.Docs | b76cb48937367a03660160c04059e5e58ad39325 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | entity-framework/ef6/what-is-new/index.md | bogan/EntityFramework.Docs | b76cb48937367a03660160c04059e5e58ad39325 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | entity-framework/ef6/what-is-new/index.md | bogan/EntityFramework.Docs | b76cb48937367a03660160c04059e5e58ad39325 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: "What's New - EF6"
author: divega
ms.date: "2016-10-23"
ms.author: divega
ms.assetid: 41d1f86b-ce66-4bf2-8963-48514406fb4c
---
# What's New in EF6
We highly recommend that you use the latest released version of Entity Framework to ensure you get the latest features and the highest stability.
However, we realize that you may need to use a previous version, or that you may want to experiment with new improvements in the latest pre-release.
To install specific versions of EF, see [Get Entity Framework](~/ef6/fundamentals/install.md).
This page documents the features that are included on each new release.
## Recent releases
### EF Tools Update in Visual Studio 2017 15.7
In May 2018, we released an updated version of the EF Tools as part of Visual Studio 2017 15.7.
It includes improvements for some common pain points:
- Fixes for several user interface accessibility bugs
- Workaround for SQL Server performance regression when generating models from existing databases [#4](https://github.com/aspnet/entityframework6/issues/4)
- Support for updating models for larger models on SQL Server [#185](https://github.com/aspnet/EntityFramework6/issues/185)
Another improvement in this this new version of EF Tools is that it installs the EF 6.2 runtime when creating a model in a new project. With older versions of Visual Studio, it is possible to use the EF 6.2 runtime (as well as any past version of EF) by installing the corresponding version of the NuGet package.
### EF 6.2 Runtime
The EF 6.2 runtime was released to NuGet in October of 2017.
Thanks in great part to the efforts our community of open source contributors, EF 6.2 includes numerous [bugs fixes](https://github.com/aspnet/entityframework6/issues?utf8=%E2%9C%93&q=is%3Aissue%20milestone%3A6.2.0%20is%3Aclosed%20label%3Aclosed-fixed%20-label%3Aarea-tools%20label%3Atype-bug) and [product enhancements](https://github.com/aspnet/entityframework6/issues?utf8=%E2%9C%93&q=is%3Aissue%20milestone%3A6.2.0%20is%3Aclosed%20label%3Aclosed-fixed%20-label%3Aarea-tools%20label%3Atype-enhancement%20).
Here is a brief list of the most important changes affecting the EF 6.2 runtime:
- Reduce start up time by loading finished code first models from a persistent cache [#275](https://github.com/aspnet/EntityFramework6/issues/275)
- Fluent API to define indexes [#274](https://github.com/aspnet/EntityFramework6/issues/274)
- DbFunctions.Like() to enable writing LINQ queries that translate to LIKE in SQL [#241](https://github.com/aspnet/EntityFramework6/issues/241)
- Migrate.exe now supports -script option [#240](https://github.com/aspnet/EntityFramework6/issues/240)
- EF6 can now work with key values generated by a sequence in SQL Server [#165](https://github.com/aspnet/EntityFramework6/issues/165)
- Update list of transient errors for SQL Azure Execution Strategy [#83](https://github.com/aspnet/EntityFramework6/issues/83)
- Bug: Retrying queries or SQL commands fails with "The SqlParameter is already contained by another SqlParameterCollection" [#81](https://github.com/aspnet/EntityFramework6/issues/81)
- Bug: Evaluation of DbQuery.ToString() frequently times out in the debugger [#73](https://github.com/aspnet/EntityFramework6/issues/73)
## Future Releases
For information on future version of EF6, please look at our [Roadmap](roadmap.md).
## Past Releases
The [Past Releases](past-releases.md) page contains an archive of all previous versions of EF and the major features that were introduced on each release.
| 67.615385 | 509 | 0.786974 | eng_Latn | 0.961314 |
9879c59f635d9d5fefdadca4506677998e0cf1f2 | 49 | md | Markdown | README.md | lsuatlab/webvrshow_exhibit | 35c1725a5e8ef4d3e51342889151131fbf25cc28 | [
"CC-BY-3.0"
] | 1 | 2018-03-31T14:45:32.000Z | 2018-03-31T14:45:32.000Z | README.md | lsuatlab/webvrshow_exhibit | 35c1725a5e8ef4d3e51342889151131fbf25cc28 | [
"CC-BY-3.0"
] | null | null | null | README.md | lsuatlab/webvrshow_exhibit | 35c1725a5e8ef4d3e51342889151131fbf25cc28 | [
"CC-BY-3.0"
] | null | null | null | # WebVR Show Site
See CONTRIBUTING.md for notes. | 16.333333 | 30 | 0.77551 | kor_Hang | 0.729994 |
9879cee404581a6ac4abfa227cfafb9ab9128b94 | 278 | md | Markdown | tests/test_scripts/output/genmarkdown/meta_no_types/prefix_reference.md | bpow/linkml | ab83c0caee9c02457ea5a748e284dee6b547fcd6 | [
"CC0-1.0"
] | null | null | null | tests/test_scripts/output/genmarkdown/meta_no_types/prefix_reference.md | bpow/linkml | ab83c0caee9c02457ea5a748e284dee6b547fcd6 | [
"CC0-1.0"
] | null | null | null | tests/test_scripts/output/genmarkdown/meta_no_types/prefix_reference.md | bpow/linkml | ab83c0caee9c02457ea5a748e284dee6b547fcd6 | [
"CC0-1.0"
] | null | null | null |
# Slot: prefix_reference
A URI associated with a given prefix
URI: [linkml:prefix_reference](https://w3id.org/linkml/prefix_reference)
## Domain and Range
[Prefix](Prefix.md) -> <sub>REQ</sub> [Uri](Uri.md)
## Parents
## Children
## Used by
* [Prefix](Prefix.md)
| 12.086957 | 72 | 0.679856 | eng_Latn | 0.613958 |
987aa764c8494ebea86a712127bdd0078d3ed437 | 6,853 | md | Markdown | README.md | emilarner/revsocks | 750ac981923c1daf29c709a890679c7257e95a5f | [
"MIT"
] | null | null | null | README.md | emilarner/revsocks | 750ac981923c1daf29c709a890679c7257e95a5f | [
"MIT"
] | null | null | null | README.md | emilarner/revsocks | 750ac981923c1daf29c709a890679c7257e95a5f | [
"MIT"
] | null | null | null | # revsocks
Cross-platform SOCKS5 proxy server written in C that can also reverse itself over a firewall.
Version 1.5: Library + Bug fixes
Changelog:
Version 1.5:
- revsocks has been modified such that it can now be a library.
Version 1.4:
- DNS override implemented. Have certain domains resolve to certain IP addresses given a DNS override file.
- SOCKS5 username-password authentication implemented.
Version 1.3:
- Text reverse protocol changed to binary.
- Bug fixes
- Speed enhancement
Version 1.2:
- Windows support added. As said before, there is a minimal amount of things that need to be changed for a port.
Version 1.1:
- There are only two servers which run now on the reverse server: remote and local.
- Some infinite loop bugs have been (mostly) fixed.
- Implementation of recvall() changed.
Bugs:
- Sometimes, for whatever reason, revsocks will refuse to work on certain services. For instance, running revsocks to reverse proxy a replit.com instance will cause the program to crash after only a few requests have been made through it.
- For some unknown reason, there are instances of infinite loops using insane amounts of system resources. Interestingly, it mostly happens on Windows, whereas on Linux it is quite rare.
Revsocks is a minimal SOCKS5 proxy server that can either run as an average server or reverse itself over a firewall. Revsocks does not support UDP or BIND features, which are specified in the SOCKS5 protocol specification. Revsocks is not scalable, nor does it employ particularly good programming practices to ensure longevity. Revsocks is to be used for temporary purposes, not for outside the usage of more than about three people. Revsocks uses select() for its purposes, contributing to its lack of scalability.
In order to reverse the SOCKS5 proxy server, you need a server on another computer which is accessible over the firewall, so that the computer you wish to host the main proxy server on can access it. The server over the firewall will, itself, host a local SOCKS5 proxy server on its end, so that it may seamlessly use the remote computer as a proxy server.
For example, I have computer A which I want to use a proxy, but is not reachable due to a firewall. I would need the *revsocks* application on computer A to connect to computer B, which is hosting the *revsocks* firewall hopper server. Through computer B, I would connect to the locally hosted port such that it will eventually connect through to computer A. The internal workings of *revsocks* are heavily based off of that of *firehop*, which is a similar program that I developed a while ago.
Here is the help menu from *revsocks*:
revsocks -- A cross-platform, minimal SOCKS5 proxy server, which can be reversed.
NOTE: IPv6 is not supported. UDP and BIND functions are not either.
USAGE:
-q, --quiet Quiet mode. No output will be shown.
-up, --username-password Username and password instead of no auth.
-u, --username [username] Specify the username required for entry.
-p, --password [password] Specify the password required for entry..
-r, --reverse [remote_addr] [remote_port] Reverse the server over the firewall to a remote server.
~~~~~^ use this if you want to host a SOCKS5 proxy server over a firewall.
~~~~~^ DEFAULT: not reversed.
-po, --port [port] Port to host on for normal SOCKS5 server.
-rs, --remote-server [remote_port] [lport] Setup a reverse server with the parameters specified.
~~~~~~~~^ use this to get the SOCKS5 proxy server over the firewall.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ lport means local port; default not server.
-d, --dns [filename] Modify DNS resolutions using domain:address\n format
-h, --help Display this help menu.
This program is mostly for my usage, explaining the lack of clarity in my explanations. In general, use *--remote-server* to host a server to help computer A get over the firewall. Use *--reverse* to reverse a SOCKS5 proxy server over the firewall to computer B. *lport* is the port which you would connect to locally on computer B to access the reversed SOCKS5 proxy session. *remote_port* is the port which must be made accessible to computer A to get past the firewall. The naming conventions are ambiguous and confusing, but it is too late to change them now.
In order to require username-password authentication, one must first set the *-up, --username-password* flag--otherwise, it will not work. Then, the username and password are promptly specified by the *-u/--username* and *-p/--password* arguments. Unless there is a demand or a need for multiple usernames and passwords, *revsocks* will only support ONE username-password pair for authentication. *revsocks* is not a professional-grade SOCKS5 proxy, after all.
*-d/--dns* requires a file which is in the format that *revsocks* can understand correctly. A DNS override file should contain a domain separated by an equals sign *=* to its corresponding IP address, with each entry separated by a UNIX newline *\n*. For reference, please view the *example-dns* file that is within this repository.
To compile:
On Linux/UNIX machines:
Mark the make.sh script as executable (*chmod 0755 make.sh*), check it, and then run it. The output file, *revsocks*, is your compiled program.
On Windows:
You need MSVC and the developer command prompt that comes with it. After entering the developer command prompt, run the make.bat file within this repository. The *revsocks.exe* file is your compiled Windows program.
To compile as a static library:
On Linux/UNIX machines:
As always, mark the make-lib.sh file as executable, so that you can run it. After running it, you now will have a file at lib/unix called librevsocks.a. In order to compile with the shared library, you must include it in the list of files you are compiling with, like so: `gcc -o main main.c librevsocks.a`. You will also need to include the necessary headers in your C program: `revsocksl.h` or `revsocksserver.h`, which depend on your usage of revsocks as a library.
Using revsocks as a library:
Read the header files, because they are heavily commented; they will explain everything you need to know. The functions which are commented in the headers are the ones which you will use. Do not use functions which are not commented, as they are meant to be used as private internal functions.
C++ bindings will not be made because they are unnecessary. You are only calling functions when you use revsocks as a library--it is not that bad, so you do not need object-oriented code for this. You might have to deal with some pointers, though! | 40.311765 | 563 | 0.741281 | eng_Latn | 0.999697 |
987abc06f4338e467bc4c615fdac23513898abf2 | 1,350 | md | Markdown | README.md | amonteirojr/move-it | 0c10df84356053e8fe136642b1b793ac428e12cb | [
"MIT"
] | null | null | null | README.md | amonteirojr/move-it | 0c10df84356053e8fe136642b1b793ac428e12cb | [
"MIT"
] | null | null | null | README.md | amonteirojr/move-it | 0c10df84356053e8fe136642b1b793ac428e12cb | [
"MIT"
] | null | null | null | <h1 align="center">
<br>
<img src='https://raw.githubusercontent.com/amonteirojr/move-it/main/public/favicon.png' alt='MoveIt' />
<br>
<br>
MoveIt
</h1>
<p align="center">This repo contains an application created to help people being healthy while working in front a computer.</p>
<p align="center">
<a href="https://opensource.org/licenses/MIT">
<img src="https://img.shields.io/badge/License-MIT-blue.svg" alt="License MIT">
</a>
</p>
<div>
<!-- <a href="https://ibb.co/zx1WMCj"><img src="https://i.ibb.co/02kp718/Gif-proffy.gif" alt="Gif-proffy" border="0"></a> -->
<!-- <img src="https://i.ibb.co/H7Dg4yr/bandicam-2020-08-07-22-34-23-510.gif" alt="demo-web" height="425"> -->
<!-- <img src="https://i.ibb.co/zHbFDyd/mobile.gif" alt="demo-mobile" height="425"> -->
</div>
<hr />
## Features
This app features all the latest tools and practices in web development!
- 🟩 **NextJs**
- ⚛️ **ReactJs**
- 🟦 **TypeScript**
## Getting started
1. Clone this repo using `git clone git@github.com:amonteirojr/move-it.git`
2. Move yourself to the appropriate directory: `cd move-it`<br />
3. Run `yarn`to install the dependendcies<br />
4. Run `yarn dev` to execute the application in development mode
## License
This project is licensed under the MIT License - see the [LICENSE](https://opensource.org/licenses/MIT) page for details.
| 31.395349 | 127 | 0.685926 | eng_Latn | 0.562149 |
987b02dd6871cb747bfa412c700b5bb8cbbe56b0 | 3,259 | md | Markdown | _posts/2015-07-30-eukaryotic-cell-structure.md | erikyao/erikyao.github.io | e5cd2af3f4f0bb5e46c9ab5c332cb05bfcd1ed83 | [
"MIT"
] | 4 | 2015-08-04T13:12:57.000Z | 2019-10-22T07:30:26.000Z | _posts/2015-07-30-eukaryotic-cell-structure.md | erikyao/erikyao.github.io | e5cd2af3f4f0bb5e46c9ab5c332cb05bfcd1ed83 | [
"MIT"
] | null | null | null | _posts/2015-07-30-eukaryotic-cell-structure.md | erikyao/erikyao.github.io | e5cd2af3f4f0bb5e46c9ab5c332cb05bfcd1ed83 | [
"MIT"
] | null | null | null | ---
layout: post
title: "Eukaryotic Cell Structure"
description: ""
category: Biology
tags: []
---
{% include JB/setup %}
- Cell
- **Cell wall** (细胞壁)
- **Membrane** (细胞膜): [ˈmembreɪn]
- **Cytoplasm** (细胞质): [ˈsaɪtəʊplæzəm], the contents of a cell except for the nucleus,
- Cytoplasm can be divided into:
- endoplasm (内质): [ˈendəʊplæzəm], the inner portion of the cytoplasm
- ectoplasm (外质): [ˈektəʊplæzəm], the outer granule-free layer of cytoplasm
- Cytoplasm includes:
- cytoskeleton (细胞骨架)
- cytosol (细胞液): ['saɪtəʊsɒl]
- vesicle (细胞囊): [ˈvesɪkl]
- organelle (细胞器): [ˌɔ:gə'nel], including:
- ribosome (核糖体): ['raɪbəsəʊm], an organelle that process the cell's genetic instructions to create proteins (mRNA binds to ribosomes; ribosomes 根据 mRNA 来生产 protein, i.e. translating). These organelles can float freely in the cytoplasm or be connected to the endoplasmic reticulum.
- mitochondrion / mitochondria (线粒体): [ˌmaɪtəʊˈkɒndriən] / [ˌmaɪtəʊ'kɒndrɪə]. Mitochondria are complex organelles that convert energy from food into a form that the cell can use. They have their own genetic material (mitochondrial DNA or mtDNA), separate from the DNA in the nucleus, and can make copies of themselves.
- chloroplast (叶绿体): [ˈklɒrəplɑ:st]
- endoplasmic reticulum (内质网): [ˌendə'plazmɪk] [rɪ'tɪkjʊləm], 缩写为 ER。A network of membranous tubules (['tju:bju:l], 小管) within the cytoplasm of a eukaryotic cell, continuous with the nuclear membrane. It usually has ribosomes attached and is involved in protein and lipid synthesis. There are 2 kinds of them:
- Rough ER
- Smooth ER
- Golgi apparatus (高尔基体): [ˈɡɔ:ldʒi] [ˌæpəˈreɪtəs], packages molecules processed by the endoplasmic reticulum to be transported out of the cell.
- lysosome (溶酶体): ['laɪsəsəʊm], an organelle found in all types of animal cells which contains a large range of digestive enzymes capable of splitting most biological macromolecules (including proteins)
- peroxisome (过氧化物酶体): [pə'rɒksɪsəʊm], a cytoplasmic cell organelle containing enzymes (as catalase) which act in oxidative reactions and especially in the production and decomposition of hydrogen peroxide (过氧化氢, i.e. 双氧水)
- Lysosomes and peroxisomes are the recycling center of the cell. They digest foreign bacteria that invade the cell, rid the cell of toxic substances, and recycle worn-out cell components.
- **Nucleus / Nuclei** (细胞核): [ˈnju:kliəs] / ['nju:klɪaɪ]
- nuclear envelope and pores (核膜与核孔)
- pore (毛孔): a tiny opening in the skin
- nuclear lamina (纤维层)
- lamina: ['læmənə], a very thin layer of material
- nucleolus (核仁): [nju:'kli:ələs]
- chromatin (染色质): ['krəʊmətɪn]
- Chromatin is composed of:
- Histones (组蛋白)
- DNA
- DNA is composed of 4 types of nucleotide (核苷酸): ['nju:klɪətaɪd]
- Adenine (腺嘌吟): ['ædənɪn]
- Cytosine (胞嘧啶): ['saɪtəʊsi:n]
- Guanine (鸟嘌呤): ['gwɑ:ni:n]
- Thymine (胸腺嘧啶): ['θaɪmi:n]
- RNA has Uracil (尿嘧啶, ['jʊrəsɪl]) instead of Thymine.
- Relationship with chromosome (染色体): [ˈkrəʊməsəʊm]
- Chromosomes are condensed Chromatin Fibers.
- Chromosomes can be divided into:
- allosome (性染色体): ['ælʊsəʊm], sex-determining chromosome
- autosome (常染色体): ['ɔ:təsəʊm]
| 61.490566 | 322 | 0.710647 | eng_Latn | 0.973347 |
987b7f5db44a6b1ad3a19e19b53cc1b55029327c | 1,073 | md | Markdown | connected-environment/get-started-netcore-visualstudio-07.md | BrainCraze/visualstudio-docs.de-de | 3758c943d5f4eacbdc0d975cb114f287018463dd | [
"CC-BY-4.0",
"MIT"
] | null | null | null | connected-environment/get-started-netcore-visualstudio-07.md | BrainCraze/visualstudio-docs.de-de | 3758c943d5f4eacbdc0d975cb114f287018463dd | [
"CC-BY-4.0",
"MIT"
] | null | null | null | connected-environment/get-started-netcore-visualstudio-07.md | BrainCraze/visualstudio-docs.de-de | 3758c943d5f4eacbdc0d975cb114f287018463dd | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: 'Erstellen einer .NET Core-Entwicklungsumgebung mit Containern unter Verwendung von Kubernetes in der Cloud mit Visual Studio, Schritt 7: Zusammenfassung | Microsoft-Dokumentation'
author: johnsta
ms.author: johnsta
ms.date: 04/05/2018
ms.topic: get-started-article
ms.technology: vsce-kubernetes
description: Schnelle Kubernetes-Entwicklung mit Containern und Microservices in Azure
keywords: Docker, Kubernetes, Azure, AKS, Azure Container Service, Container
manager: ghogen
ms.openlocfilehash: 38cac52388e5f4b500ff2ed12c4cfb7627fcb19e
ms.sourcegitcommit: 3724338a5da5a6d75ba00452b0a607388b93ed0c
ms.translationtype: HT
ms.contentlocale: de-DE
ms.lasthandoff: 04/06/2018
---
# <a name="get-started-on-connected-environment-with-net-core-and-visual-studio"></a>Erste Schritte in Connected Environment mit .NET Core und Visual Studio
Vorheriger Schritt: [Informationen zur Entwicklung im Team](get-started-netcore-visualstudio-06.md)
[!INCLUDE[](includes/well-done.md)]
[!INCLUDE[](includes/take-survey.md)]
[!INCLUDE[](includes/clean-up.md)]
| 41.269231 | 188 | 0.797763 | deu_Latn | 0.440231 |
987ba9947e411908800ce759f2f898eec992eeeb | 18,059 | md | Markdown | _posts/all_notes/2021-10-11-simplex-method.md | NikolaAndro/NikolaAndro.github.io | 99c51c4e893d275e5fa8a90ef0fce94a8ae875fc | [
"MIT"
] | null | null | null | _posts/all_notes/2021-10-11-simplex-method.md | NikolaAndro/NikolaAndro.github.io | 99c51c4e893d275e5fa8a90ef0fce94a8ae875fc | [
"MIT"
] | null | null | null | _posts/all_notes/2021-10-11-simplex-method.md | NikolaAndro/NikolaAndro.github.io | 99c51c4e893d275e5fa8a90ef0fce94a8ae875fc | [
"MIT"
] | null | null | null | ---
layout: post
title: "Simplex Method - Linear Programming (LP)"
date: 2021-10-12 09:29:20 +0700
categories: post
---
Pre-Req: Linear Programming, also called as linear optimization, is a method to achieve the best outcome in a mathematical model with constraints represented by linear relationships.
Simplex algorithm is a method used in mathematical optimization to solve linear programming problems. It can be done by hand or using computers (ex. using solver in Excel).
Furthermore, Simplex method is used to solve maximization problems (every minimization problem can be converted to a maximization problem).
We know that every linear programming (LP) problem has basic solutions. We could check all the solutions for optimality and feasibility
one by one and get our optimal solution. This is simple when our LP problem has a small number of variables. However, most of the real-world
LP problems have many variables and a huge number of constraints. Checking each possible solution would take a great amount of time.
For example, if a problem has n = 30 decision variables and m = 35 problem constraints, thenumber of possible basic solution becomes
approximately 3 × 10^18 . It will take about 15 years for an average modern personal computer to check all these solutions for feasibility and optimality.
The simplex method describes a ”smart” way to find much smaller subset of
basic solutions which would be sufficient to check in order to identify the optimal
solution. Staring from some basic feasible solution called initial basic feasible
solution, the simplex method moves along the edges of the polyhedron (vertices
of which are basic feasible solutions) in the direction of increase of the
objective function until it reaches the optimal solution. We can see the graphical representation of simplex method in the Figure 1.
*Figure 1*
In order to tackle the simplex method, we must know the standard form of a standard maximization problem.
The form is as follows:
{% highlight ruby %}
#=>Objective function:
P = c1 * x1 + c2 * x2 + . . . + cn * xn
#=> Constraints:
a11 * x1 + a12 * x2 + . . . + a1n * xn ≤ b1
···
am1 * x1 + am2 * x2 + . . . + amn * xn ≤ bm
x1 , x2 , . . . , xn ≥ 0
{% endhighlight %}
where x1 , x2 , . . . , xn are decision variables, c1 , . . . , cn ,
a11 , . . . , amn are any real numbers, and b1 , . . . , bm ≥ 0 are
nonnegative real numbers.
We will follow the list of steps to complete LP problem using Simplex method algebraically:
• Standard form
• Introducing slack variables
• Creating the simplex tableau
• Pivot variables
• Creating a new simplex tableau
• Checking for optimality
• Identify optimal values
# Step 1: Conversion to Standard Form
First of all, we need to make sure our problem is in the **standard form**.
Standard form is necessary because it creates an ideal starting point for solving the Simplex method.
Before solving for the optimal solution, we must know that standard form has three requirements:
(1) must be a maximization problem
(2) all linear constraints must be in a less-than-or-equal-to inequality
(3) all variables are non-negative
To transform a minimization linear program model into a maximization linear program model, all we need to do is to
multiply both sides of objective function by -1.
{% highlight ruby %}
#=>Objective function:
-P = -5x1 - 4x2
#=>Objective function Conversion:
(-1) * (-P = -5x1 - 4x2) = P = 5x1 + 4x2
{% endhighlight %}
The same process is being applied to constraints that are in the form of greater-than-or-equal sign.
To convert those constraints in the form of less-than-or-equal sign, simply pultiply the equation by -1.
{% highlight ruby %}
#=>Original Constraints:
-4x1 - 2x2 >= -32
2x1 + 3x2 <= 24
x1, x2 >= 0
#=>Constraint Conversion:
(-1) * (-4x1 - 2x2 >= -32) = 4x1 + 2x2 <= 32
#=>Final set of constraints:
4x1 + 2x2 <= 32
2x1 + 3x2 <= 24
x1, x2 >= 0
{% endhighlight %}
Finally, we converted our minimization linear program model into a maximization linear program model in standard form.
# Step 2: Determine Slack Variables
**Slack variables** are additional variables that are introduced into the linear constraints of a linear program to transform them from inequality constraints to equality constraints. For each problem constraint of the original problem we introduce a single slack variable as follows:
{% highlight ruby %}
4x1 + 2x2 + s1 = 32
2x1 + 3x2 + s2 = 24
x1, x2, s1, s2 >= 0
{% endhighlight %}
Each solution in the above problem representation correspods to a point in the feasible region of the original problem.
**Note: Slack variables should not be non-negative.**
Next, we add the objective function in the system above, while treating P as another variable.
{% highlight ruby %}
#=>Original Objective:
P = 5x1 + 4x2
#=> Can be written as:
-5x1 - 4x2 + P = 0
#=>Final system:
4x1 + 2x2 + s1 = 32
2x1 + 3x2 + s2 = 24
-5x1 - 4x2 + P = 0
x1, x2, s1, s2 >= 0
{% endhighlight %}
The above system is also called the **initial system**.
Again, every solution of the initial system (taking into account nonnegative constrains) corresponds to
some point in the feasible region of the original LP (andvice versa!).
**Therefore, one of the solution of the initial system should be an optimal
solution of the original LP (if any exists)**.
Let's introduce couple of definitions:
**Basic Solution** - This is one of many solutions of the original system. This solution has all variables set to 0. Hence, this solution is the origin of the graph.
**Basic Feasible Solution** - If a basic solution of the initial system corresponds to a certain point in the feasible region of the original LP, then it is called a basic feasible solution.
Here is how feasbile region of our original problem looks like:
*Figure 2*
In 2-dimensional case (2 decision variables), the set of basic solutions
is the of pairwise intersections of boundary lines of all problem con-
straints. In turn, the set of basic feasible solutions is the set of the
corner points.
**Pivoting** - is a change of basis where a nonbasic variable `enters` and a basic variable `leaves` the set of basic variables, while preserving feasibility. We can see pivoting process in the Figure 1 shown as arrows on the edges that connect vertices X0, X1, X3, X4, X5, and X6.
# Spep 3: Creating a Simplex Tableau
The simplex method utilizes matrix representation of the initial system
while performing search for the optimal solution. This matrix repre-
sentation is called **simplex tableau**.
The simplex tableau consists of coefficients corresponding to the linear constraint variables and the coefficients of the objective function.
In the tableau below, the first two rows represent the linear constraint variable coefficients from the linear programming model, and the last row represents the objective function variable coefficients.
{% highlight ruby %}
x1 x2 s1 s2 P R
4 2 1 0 0 | 32 s1
2 3 0 1 0 | 24 s2
_______________|___
-5 -4 0 0 1 | 0
{% endhighlight %}
**From this tableau we know that x1 and x2 are non-basic variables, so x1 = x2 = 0. This represents our starting feasible point on the graph (0,0).**
# Step 4: Check Optimality
The optimal solution of a maximization linear programming model are the values assigned to the variables in the objective function to give the largest P value.
The optimal solution would exist on the corner points of the graph of the entire model. To check optimality using the tableau, all values in the last row must contain values greater than or equal to zero. If a value is less than zero, it means that variable has not reached its optimal value. As seen in the previous tableau, two negative values exists in the bottom row indicating so this solution is not optimal. If a tableau is not optimal, the next step is to identify ** the pivot variable** to base a new tableau on.
# Step 5: Identify Pivot Variable
Definitions:
**Basic variables** - slack variables (s1, s2) are refered to as basic variables.
**Non-basic variables** - the original variables from the objective function are refered to as non-basic variables. If a variable is considered non-basic, the value of that variable is equal to zero.
**Entering variable** - corresponds to the smallest (the most negative) entry in the bottom row of the tableau.
**Departing variable** - corresponds to the smallest nonnegative ratio of Ri / ij , in the column determined by the entering variable.
**Pivot** - entry in the simplex tableau in the entering variable’s column and the departing variable’s row (intersection).
In order to search for more optimal solution, we need to perform **pivot operations** on this matrix.
To do this, we need to determine what is our **entering variable and departing variable**.
Entering variable: -5
Departing variable: 32/4 or 24/2 => the final departing variable is the smallest positive ratio, which is 32/4. Hence, the departing variable is s1.
Pivot: 4
**Note**: if departing variables happend to have the same ratio, we would need to pick the variable with smaller index.
# Step 6: Creating the New Tableau
The new tableau will be used to identify a new possible optimal solution.
1. To optimize the pivot variable, it will need to be transformed into a unit value (value of 1). To transform the value, multiply the row containing the pivot variable by the reciprocal of the pivot value (1/4). Once that is done, we have changed the base, where non-basic variable x1 entered and basic variable s1 left the set of basic variables (they exchanged).
{% highlight ruby %}
s1 x2 s1 s2 P R
1 0.5 0.25 0 0 | 8 x1
____________________|___
|
{% endhighlight %}
2. After the unit value has been determined, the other values in the column containing the unit value will become zero. This is because the x1 in the first constraint is being optimized, which requires x1 in the other equations to be zero.
{% highlight ruby %}
s1 x2 s1 s2 P R
1 0.5 0.25 0 0 | 8 x1 <- New pivot row
0 |
____________________|___
0 |
{% endhighlight %}
In order to keep the tableau equivalent, the other variables not contained in the pivot column or pivot row must be calculated by using the new pivot values. For each new value, multiply the negative of the value in the old pivot column by the value in the new pivot row that corresponds to the value being calculated. Then add this to the old value from the old tableau to produce the new value for the new tableau. This step can be condensed into the following equation:
New tableau value = (Negative value in old tableau pivot column) x (value in new tableau pivot row) + (Old tableau value)
**Old Simplex Tableau**
{% highlight ruby %}
x1 x2 s1 s2 P R
4 2 1 0 0 | 32 s1
2 3 0 1 0 | 24 s2
_______________|___
-5 -4 0 0 1 | 0
{% endhighlight %}
[1][1] = (-2) * (0.5) + 3 = 2
[1][2] = (-2) * (0.25) + 0 = -0.5
[1][3] = (-2) * 0 + 1 = 1
[1][4] = (-2) * 0 + 0 = 0
[1][5] = (-2) * 8 + 24 = 8
[2][1] = (5) * (0.5) + (-4) = -1.5
[2][2] = (5) * (0.25) + 0 = 1.25
[2][3] = (5) * (0) + 0 = 0
[2][4] = (5) * (0) + 1 = 1
[2][5] = (5) * (8) + 0 = 40
**New Simplex Tableau**
{% highlight ruby %}
s1 x2 s1 s2 P R
1 0.5 0.25 0 0 | 8 x1
0 2 -0.5 1 0 | 8 s2
___________________|___
0 -1.5 1.25 0 1 | 40
{% endhighlight %}
**From this tableau we know that x2 is a non-basic variable, so x2 = 0. We also know that x1 = 8. Hence, our next point in the feasible region in the Figure 2 is the point (8,0).**
A solution is considered optimal if all values in the bottom row are greater than or equal to zero. If negative values exist, the solution is still not optimal and a new pivot point will need to be determined.Hence, we need to repeat the process.
Entering variable: -1.5
Departing variable: 8/0.5 or 8/2 => the final departing variable is the smallest positive ratio, which is 8/2. Hence, the departing variable is s2.
Pivot: 2
Multiply the whole pivot row by 1/0.5 => 2. Once we exchange the basic and non-basic variables, we get the following row:
{% highlight ruby %}
s1 s2 s1 s2 P R
0 1 -0.25 0.5 0 | 4 x2
_____________________|___
|
{% endhighlight %}
Make the pivot column all zeros besides the pivot.
{% highlight ruby %}
s1 s2 s1 s2 P R
0 1 -0.25 0.5 0 | 4 x2 <- New tableau pivot row
0 |
_____________________|___
0 |
{% endhighlight %}
Update the rest of the tableau:
New tableau value = (Negative value in old tableau pivot column) x (value in new tableau pivot row) + (Old tableau value)
**Old Simplex Tableau**
{% highlight ruby %}
s1 x2 s1 s2 P R
1 0.5 0.25 0 0 | 8 x1
0 2 -0.5 1 0 | 8 s2
___________________|___
0 -1.5 1.25 0 1 | 40
{% endhighlight %}
[0][0] = (-0.5) * 0 + 1 = 1
[0][2] = (-0.5) * (-0.25) + (-0.25) = 0.375
[0][2] = (-0.5) * 0.5 + 0 = -0.25
[0][2] = (-0.5) * 0 + 0 = 0
[0][2] = (-0.5) * 4 + 8 = 6
[2][0] = (1.5) * 0 + 0 = 0
[2][0] = (1.5) * (-0.25) + 1.25 = 0.875
[2][0] = (1.5) * 0.5 + 0 = 0.75
[2][0] = (1.5) * 0 + 1 = 1
[2][0] = (1.5) * 4 + 40 = 46
**New Simplex Tableau**
{% highlight ruby %}
s1 s2 s1 s2 P R
1 0 0.375 -0.25 0 | 6 x1
0 1 -0.25 0.5 0 | 4 x2
_______________________|___
0 0 0.875 0.75 1 | 46
{% endhighlight %}
**We can see that x1 and x2 are both basic variables where x1 = 6 and x2 = 4, which is our next feasible point in the feasible region.**
# Step 7: Check Optimality
We can now see that we do not have any negative values for our bottom row. This means that we reached our optimum.
# Step 8: Identify Optimal Values
To identify the optimal values, we need to identify basic and non-basic variables.
A basic variable can be classified to have a single 1 value in its column and the rest be all zeros.
If a variable does not meet this criteria, it is considered non-basic.
If a variable is non-basic it means the optimal solution of that variable is zero.
If a variable is basic, the row that contains the 1 value will correspond to the R value.
The R value will represent the optimal solution for the given variable.
Basic variables: x1,x2, P
Non-basic variables: s1,s2
For the variable x1, the 1 is found in the first row. This shows that the optimal x1 value is found in the first row of the R values, which is 6. Hence x1 = 6.
For the variable x2, the 1 is found in the second row. This shows that the optimal x2 value is found in the second row of the R values, which is 4. Hence x2 = 4.
For the variable P, the 1 is found in the third row. This shows that the optimal P value is found in the third row of the R values, which is 46.
**Note:** If any s was to be a basic variable, the solution to it would not be included into the final objective function.
The optimal value is found by having:
x1 = 6
x2 = 4
P = 46
s1, s2 = 0
Hence, P = 5x1 + 4x2 => 46 = 5 * 6 + 4 * 4 is the `optimal solution` we were looking for.
If we take a look at the original feasibility graph, we can see that our optimal solution is in point (6,4).
# Conclusion
The Simplex method is an approach for determining the optimal value of a linear program by hand. The method produces an optimal solution to satisfy the given constraints and produce a maximum zeta value. To use the Simplex method, a given linear programming model needs to be in standard form, where slack variables can then be introduced. Using the tableau and pivot variables, an optimal solution can be reached.
Nikola Andrić
| 44.480296 | 525 | 0.705853 | eng_Latn | 0.992566 |
987c05f82cb66d91d2c4c4270cab0922143441e0 | 318 | md | Markdown | articles/includes/applies-to-commerce.md | MicrosoftDocs/Dynamics-365-Operations.ru-ru | f863930f3f6e29d2e2c28f56f52f18af8dc7d521 | [
"CC-BY-4.0",
"MIT"
] | 3 | 2020-05-18T17:14:52.000Z | 2022-03-02T03:47:07.000Z | articles/includes/applies-to-commerce.md | MicrosoftDocs/Dynamics-365-Operations.ru-ru | f863930f3f6e29d2e2c28f56f52f18af8dc7d521 | [
"CC-BY-4.0",
"MIT"
] | 7 | 2017-12-13T12:45:39.000Z | 2019-04-30T11:46:20.000Z | articles/includes/applies-to-commerce.md | MicrosoftDocs/Dynamics-365-Operations.ru-ru | f863930f3f6e29d2e2c28f56f52f18af8dc7d521 | [
"CC-BY-4.0",
"MIT"
] | 2 | 2018-10-31T18:08:28.000Z | 2019-10-12T18:15:45.000Z | ---
ms.openlocfilehash: 56556332cea15875f3c489c76760e2dc166016d7af3f3c134e219d036d8a9599
ms.sourcegitcommit: 42fe9790ddf0bdad911544deaa82123a396712fb
ms.translationtype: HT
ms.contentlocale: ru-RU
ms.lasthandoff: 08/05/2021
ms.locfileid: "6766855"
---
**Применяется к следующим приложениям Dynamics 365**:<br>
Commerce | 31.8 | 84 | 0.842767 | yue_Hant | 0.139322 |
987c4dea7ebb5c4d2a90b8090a57fc97a2c852e6 | 1,457 | md | Markdown | page/theme.md | tegcommerce/tegcommerce-requirement | d8737b58ebf60a43f17233ac1d2d062b302c7a97 | [
"MIT"
] | 18 | 2019-05-22T00:30:40.000Z | 2019-08-21T21:00:57.000Z | page/theme.md | tegcommerce/tegcommerce-plugin | d8737b58ebf60a43f17233ac1d2d062b302c7a97 | [
"MIT"
] | 4 | 2019-05-22T18:59:21.000Z | 2019-05-30T21:29:42.000Z | page/theme.md | tegcommerce/tegcommerce-plugin | d8737b58ebf60a43f17233ac1d2d062b302c7a97 | [
"MIT"
] | 4 | 2019-05-23T18:09:46.000Z | 2020-01-22T18:31:58.000Z | ### theme
#### default theme
##### for unregistered user
```
.
├── header
│ └── search
│ └── tag
│
├── body
│ └── product
│ └── share
│
│
└── footer
├── privacy policy
└── terms of use
```
##### for registered user
```
.
├── header
│ ├── search
│ │ └── tag
│ └── cart
│ └── product
│
├── body
│ └── product
│ ├── share
│ ├── like
│ ├── comment
│ └── buy
│
└── footer
├── privacy policy
└── terms of use
```
##### for registered user admin
```
.
├── header
│ ├── sidebar
│ │ ├── store
│ │ ├── sales
│ │ ├── pages
│ │ ├── products
│ │ ├── users
│ │ ├── themes
│ │ ├── plugins
│ │ ├── payment
│ │ └── shipment
│ │
│ ├── search
│ │ └── tag
│ └── cart
│ └── product
│
├── body
│ └── product
│ ├── share
│ ├── like
│ └── comment
│
└── footer
├── privacy policy
└── terms of use
```
#### child theme
should be created by anyone and anyway
| 18.443038 | 38 | 0.279341 | eng_Latn | 0.983267 |
987c8879b312aeb897421f87d0a8c93208c85e4f | 69 | md | Markdown | CONTRIBUTING.md | qq253498229/codeforfun-microservice | 7bc53a777a59f42169e60e9d118c4d1395d60058 | [
"Apache-2.0"
] | null | null | null | CONTRIBUTING.md | qq253498229/codeforfun-microservice | 7bc53a777a59f42169e60e9d118c4d1395d60058 | [
"Apache-2.0"
] | null | null | null | CONTRIBUTING.md | qq253498229/codeforfun-microservice | 7bc53a777a59f42169e60e9d118c4d1395d60058 | [
"Apache-2.0"
] | null | null | null | # 贡献指南
- Fork 本项目
- 新建 Feature_xxx 分支
- 提交代码
- 新建 Pull Request
| 8.625 | 20 | 0.623188 | yue_Hant | 0.925859 |
987c9b717d6b706858f6581c7f8da5e738f09679 | 47 | md | Markdown | README.md | frankshaka/webknot | 59373bf689c9fcc5b13e96abf291ae9763e5aa6d | [
"MIT"
] | null | null | null | README.md | frankshaka/webknot | 59373bf689c9fcc5b13e96abf291ae9763e5aa6d | [
"MIT"
] | null | null | null | README.md | frankshaka/webknot | 59373bf689c9fcc5b13e96abf291ae9763e5aa6d | [
"MIT"
] | null | null | null | # webknot
A web service that connects webhooks
| 15.666667 | 36 | 0.808511 | eng_Latn | 0.999308 |
987cdaafe442f08e30b81fb5ce781aff8972a18c | 3,441 | md | Markdown | public/articles/samples/nodejs-tts-eng.md | adelriosantiago/minimalist-dude | bd683e249c60fd78a5496d454b630ba42879f515 | [
"MIT"
] | 2 | 2015-12-16T05:37:32.000Z | 2015-12-19T05:15:10.000Z | public/articles/samples/nodejs-tts-eng.md | adelriosantiago/minimalist-dude | bd683e249c60fd78a5496d454b630ba42879f515 | [
"MIT"
] | null | null | null | public/articles/samples/nodejs-tts-eng.md | adelriosantiago/minimalist-dude | bd683e249c60fd78a5496d454b630ba42879f515 | [
"MIT"
] | 2 | 2016-01-12T20:35:10.000Z | 2018-06-13T02:41:02.000Z | <permalink>nodejs-tts-eng</permalink>
<month>8</month>
<year>2015</year>
# SVOX TTS (Text to Speech) interface in Node.js
As you probably know, Google has a service to convert text to audio via the Google Translate engine. You can easily test it by clicking on the <a class='mintip'>megaphone icon<span><img src='articles/images/google-tts.png'/></span></a> to read the text aloud. <a class='mintip'>Inspecting the button with the browser toolbar<span><img src='articles/images/behind-scenes.png'/></span></a> we find that what is actually going on behind the scenes is a call to an address with the text we want to read aloud, so that when you click on the megaphone you are actually performing a requests like these:
* [translate.google.com/translate_tts?tl=en&q=hello-world](http://translate.google.com/translate_tts?tl=en&q=hello-world) to read “hello world” in english.
* [translate.google.com/translate_tts?tl=it&q=buongiorno](http://translate.google.com/translate_tts?tl=it&q=buongiorno) to read aloud “buongiorno” in italian.
And so on with other languages.
Now imagine yourself creating and Android or Arduino app to fetch the audio programmatically, you would just need to build the URL and fetch the audio however bear in mind that this will only work for a few words and sentences, I suppose that people abused the service with thounsands of requests and now Google puts a limit the quantity on audios you can generate to about 15 calls per user, after that limit is reached you will very likely get an <a class='mintip'>unusual traffic<span><img src='articles/images/deny-tts-google.png'/></span></a> captcha making the service completely unusable for your app... In order to raise the limit again you would need to solve the captcha.
> "Ohh wait! The project is working just lemme answer this captcha to prove that I’m not a robot!”
> -☉_☉
With this project you will be able to create your own Text to Speech server for your apps using the SVOX engine for Ubuntu. Bear in mind that the SVOX speech synthesis quality is far lower than Google's engine. On the bright side, you can flood your Ubuntu server with thousand calls if needed.
Some project ideas that could use this web interface are:
* A speaking Arduino that talks when you press some buttons.
* An accessibility app for the blind. Maybe an Android app that reads Barcodes aloud *(there are some good tutorials about [how to read barcodes](http://code.tutsplus.com/tutorials/android-sdk-create-a-barcode-reader--mobile-17162) and [how to read barcodes and QR codes](http://examples.javacodegeeks.com/android/android-barcode-and-qr-scanner-example/))*
* A computer clock that reads the time every hour (like on Mac).
Find the project and the installation instructions at the Github repo [https://github.com/adelriosantiago/svox-interface-nodejs](https://github.com/adelriosantiago/svox-interface-nodejs). You will need a Virtual Machine running Ubuntu or a Digital Ocean instance in order to get the SVOX TTS engine running and [Node.js](http://nodejs.org) to create the web request interface.
Here is how the finished project looks like:
<a href='http://tts.adelriosantiago.com'></a>
Simply select the language, the text to convert and click on the URL to get the audio. Feel free to play with the finished project generating some phrases at the address [tts.adelriosantiago.com](http://tts.adelriosantiago.com).
| 95.583333 | 681 | 0.778262 | eng_Latn | 0.990971 |
987e142b8979a831fab788448a77e604047e50c7 | 614 | md | Markdown | README.md | ctacampado/expense-profile-predictor | 276f9708e58f189678ce67479b0fac7e21f2fbda | [
"MIT"
] | null | null | null | README.md | ctacampado/expense-profile-predictor | 276f9708e58f189678ce67479b0fac7e21f2fbda | [
"MIT"
] | null | null | null | README.md | ctacampado/expense-profile-predictor | 276f9708e58f189678ce67479b0fac7e21f2fbda | [
"MIT"
] | null | null | null | # expense-profile-clustering
clustering different expense profiles.
# Data
Data is purely artificial.
# Data-prep
In order to prep the data for classification, I first have to prepare the data. Since it is purely artificial and somewhat randomly generated, I had to first group them together and then later use the grouped data as input to a classifier. In order to do that, I performed the following steps:
1. Normalize the data
2. Use KMeans @k=10, iter=15
# Technologies used
1. R for analyzing data and experimenting
2. Apache Spark (pyspark) for data prep and creating the actual models and their package
| 38.375 | 293 | 0.788274 | eng_Latn | 0.998285 |
987e49f76cff9625eca695ab1def2f1353a571b2 | 733 | md | Markdown | README.md | tingar/libnss_etcd | 3e1a1669e618890e38594ce8a3255e42a4ad9420 | [
"Apache-2.0"
] | 5 | 2015-01-05T17:21:53.000Z | 2016-01-23T22:10:29.000Z | README.md | tingar/libnss_etcd | 3e1a1669e618890e38594ce8a3255e42a4ad9420 | [
"Apache-2.0"
] | null | null | null | README.md | tingar/libnss_etcd | 3e1a1669e618890e38594ce8a3255e42a4ad9420 | [
"Apache-2.0"
] | 2 | 2015-02-18T07:32:56.000Z | 2021-01-19T07:53:22.000Z | libnss_etcd
===========
A libnss resolver based off etcdctl.
The resolver will look for hosts specified in the /hosts/ key. For example, if you have /hosts/foo with the value "10.0.0.2", you can do:
```
$ ping foo
PING foo (10.0.0.2) 56(84) bytes of data.
```
Installation
------------
*IMPORTANT*: This plugin requires that you have [etcdctl](https://github.com/coreos/etcdctl/) installed somewhere in your path. It will not work without it. For best results, you'll probably also want a working etcd installation.
```
$ make
# cp libnss_etcd.so.2 /lib/libnss_etcd.so.2
# ln -s /lib/libnss_etcd.so.2 /lib/libnss_etcd.so
```
Then, include "etcd" in your /etc/nsswitch.conf files section:
```
...
hosts = files etcd dns
...
```
| 25.275862 | 229 | 0.691678 | eng_Latn | 0.976749 |
987ed5f7b61553153a3a44f1b35ed4a8ba3f20e0 | 709 | md | Markdown | README.md | QuestofIranon/Hello-World-Julia | 1113bfa3de1aeeb82cd52b52c07a46550d0d537e | [
"Apache-2.0",
"MIT"
] | null | null | null | README.md | QuestofIranon/Hello-World-Julia | 1113bfa3de1aeeb82cd52b52c07a46550d0d537e | [
"Apache-2.0",
"MIT"
] | null | null | null | README.md | QuestofIranon/Hello-World-Julia | 1113bfa3de1aeeb82cd52b52c07a46550d0d537e | [
"Apache-2.0",
"MIT"
] | null | null | null | # HELLO WORLD JULIA
Example of a web server running with Julia on Docker
## Description
This web application is intended to familiarized myself with the Julia web ecosystem and might grow in features over time.
## Running
### Docker
``` shell
docker compose up -d
```
### Powershell
This will open the Julia repl and initialize the environment
``` shell
./bin/repl.bat
```
once inside the repl:
``` julia
up()
```
### Bash/Zsh
This will open the Julia repl and initialize the environment
``` shell
./bin/repl
```
once inside the repl:
``` julia
up()
```
## Useful Links
[Julia Lang](https://julialang.org/)
[Genie Framework Documentation](https://genieframework.com/docs/tutorials/Overview.html) | 17.725 | 122 | 0.719323 | eng_Latn | 0.957162 |
987f3e820606041992d511eb566306415c7c0f7a | 1,415 | md | Markdown | _posts/2012-11-10-combining-cardio-and-weights.md | capultra/capultra.github.io | 660c7fa1d186334c3f23265504162e5306847a3f | [
"MIT"
] | null | null | null | _posts/2012-11-10-combining-cardio-and-weights.md | capultra/capultra.github.io | 660c7fa1d186334c3f23265504162e5306847a3f | [
"MIT"
] | null | null | null | _posts/2012-11-10-combining-cardio-and-weights.md | capultra/capultra.github.io | 660c7fa1d186334c3f23265504162e5306847a3f | [
"MIT"
] | null | null | null | ---
layout: post
status: publish
published: true
title: Combining Cardio and Weights
author:
display_name: craig
login: craig
email: craigpardey@gmail.com
url: http://craigpardey.com
author_login: craig
author_email: craigpardey@gmail.com
author_url: http://craigpardey.com
wordpress_id: 116
wordpress_url: http://capultra.com/?p=116
date: '2012-11-10 07:50:06 -0500'
date_gmt: '2012-11-10 12:50:06 -0500'
categories:
tags: [Running,Weight Lifting]
comments: []
---
An article on The Greatist by [JC Deen](www.jcdfitness.com/) titled "[common
workout mistakes](http://greatist.com/fitness/fix-common-workout-mistakes/)"
lists combining cardio and strength training as a mistake.
This is incorrect according to [this
study](http://www.ncbi.nlm.nih.gov/pubmed/7752872) done at the University of
Wisconsin - Madison. In fact, they found that combining endurance training and
strength training _in the same session_ yielded the benefits of both.
The subjects showed improved strength similar to those that did only strength
training, and improved endurance similar to those that did only cardio.
It's worth noting that the session had to be combined. i.e. the subjects did 3
sesions per week, and each training session included an hour of weights and an
hour of cardio. Splitting the 3 sessions into 6 (3 x strength, 3 x cardio)
does _not_ get the same results.
Time to start running to and from the gym.
| 33.690476 | 78 | 0.777385 | eng_Latn | 0.99153 |
987fa580ed80b9692ba6331c470f8c10e78b13fe | 207 | md | Markdown | README.md | notoes/cubehedron | 5ef42438f4beb80e585f6ba59a820a2137f8a123 | [
"MIT"
] | 1 | 2015-10-02T15:06:53.000Z | 2015-10-02T15:06:53.000Z | README.md | notoes/cubehedron | 5ef42438f4beb80e585f6ba59a820a2137f8a123 | [
"MIT"
] | null | null | null | README.md | notoes/cubehedron | 5ef42438f4beb80e585f6ba59a820a2137f8a123 | [
"MIT"
] | null | null | null | Eons
====
A locked room game prototype for Virtual Reality. Designed to test the limits of eye gaze interaction in Virtual Reality.
More details can be found [here](http://johnsietsma.com/projects/eons/).
| 29.571429 | 121 | 0.768116 | eng_Latn | 0.937699 |
98804674659eabb4ac5cab87535293cc9a3188e6 | 4,537 | md | Markdown | packages/slider/README.md | CoreyVidal/material-components-web-components | f790f713125dfb4ae6d6878724af77f38fed7c43 | [
"Apache-2.0"
] | 1 | 2020-10-22T08:18:51.000Z | 2020-10-22T08:18:51.000Z | packages/slider/README.md | Ejhanrina/material-components-web-components | 7fafd364475a6101135f9a8982d06abcfaca8f3d | [
"Apache-2.0"
] | null | null | null | packages/slider/README.md | Ejhanrina/material-components-web-components | 7fafd364475a6101135f9a8982d06abcfaca8f3d | [
"Apache-2.0"
] | null | null | null | # `<mwc-slider>` [](https://www.npmjs.com/package/@material/mwc-slider)
> IMPORTANT: The Material Web Components are a work in progress and subject to
> major changes until 1.0 release.
Sliders allow users to make selections from a range of values.
<img src="images/basic.png" height="48px">
[Material Design Guidelines: sliders](https://material.io/design/components/sliders.html)
## Installation
```sh
npm install @material/mwc-slider
```
> NOTE: The Material Web Components are distributed as ES2017 JavaScript
> Modules, and use the Custom Elements API. They are compatible with all modern
> browsers including Chrome, Firefox, Safari, Edge, and IE11, but an additional
> tooling step is required to resolve *bare module specifiers*, as well as
> transpilation and polyfills for Edge and IE11. See
> [here](https://github.com/material-components/material-components-web-components#quick-start)
> for detailed instructions.
## Example usage
### Continuous
<img src="images/basic.png" height="48pxx">
```html
<script type="module">
import '@material/mwc-slider';
</script>
<mwc-slider value="25" min="10" max="50"></mwc-slider>
```
### Discrete
<img src="images/discrete.gif" height="80.5px">
```html
<mwc-slider
step="5"
pin
markers
max="50"
value="10">
</mwc-slider>
```
### Styled
<img src="images/styled.gif" height="79px">
```html
<style>
mwc-slider {
--mdc-theme-secondary: orange;
--mdc-theme-text-primary-on-dark: green;
}
</style>
<mwc-slider
pin
markers
max="50"
value="10"
step="5">
</mwc-slider>
```
## API
### Properties/Attributes
| Name | Type | Default | Description
| --------- | --------- |-------- | -----------
| `value` | `number` | `0` | Current value of the slider.
| `min` | `number` | `0` | Minimum value of the slider.
| `max` | `number` | `100` | Maximum value of the slider.
| `step` | `number` | `0` | When defined, the slider will quantize (round to the nearest multiple) all values to match that step value, except for the minimum and maximum values, which can always be set. When 0, quantization is disabled.<br> **NOTE:** Throws when <0.
| `pin` | `boolean` | `false` | Shows the thumb pin on a discrete slider.<br> **NOTE:** Numbers displayed inside the slider will be rounded to at most 3 decimal digits.
| `markers` | `boolean` | `false` | Shows the tick marks for each step on the track when the slider is discrete.
### Methods
| Name | Description
| -------- | -------------
| `layout() => void` | Recomputes the dimensions and re-lays out the component. This should be called if the dimensions of the slider itself or any of its parent elements change programmatically (it is called automatically on resize and on mousedown / touchstart).
### Events
| Event Name | Target | Detail | Description
| ---------- | ------------ | ------------------ | -----------
| `input` | `mwc-slider` | `Slider` | Fired when the value changes due to user input. Similar to the [`input` event of the native `<input type="range">` element](https://developer.mozilla.org/en-US/docs/Web/API/HTMLElement/input_event), the `input` event will not fire when `value` is modified via JavaScript.
| `change` | `mwc-slider` | `Slider` | Fired when the value changes and the user has finished interacting with the slider. Similar to the [`change` event of the native `<input type="range">` element](https://developer.mozilla.org/en-US/docs/Web/API/HTMLElement/change_event), the `change` event will not fire when `value` is modified via JavaScript.
### CSS Custom Properties
| Name | Default | Description
| ---------------------------------------- | ------- |------------
| `--mdc-theme-secondary` |  `#018786` | Sets the color of the knob and filled track when slider is active.
| `--mdc-theme-text-primary-on-dark` |  `white` | Sets the color of the text in the pin.
| `--mdc-slider-bg-color-behind-component` |  `white` | Sets the color of the circle around the knob on the disabled slider to make it seem cut-out. May be necessary when placing a disabled slider on a different-colored background.
## Additional references
- [MDC Web sliders](https://material-components.github.io/material-components-web-catalog/#/component/slider)
| 40.873874 | 361 | 0.657483 | eng_Latn | 0.937676 |
98808284cf19b2a9c25a7521e1ed1ba99df359e5 | 4,786 | md | Markdown | packages/navigation/README.md | PublicInMotionGmbH/ui-kit | cdac26f3fd5cfef5cdce1c36ae3fcee4513f60b8 | [
"MIT"
] | 9 | 2018-04-02T10:36:00.000Z | 2019-10-09T14:39:33.000Z | packages/navigation/README.md | PublicInMotionGmbH/ui-kit | cdac26f3fd5cfef5cdce1c36ae3fcee4513f60b8 | [
"MIT"
] | 164 | 2018-03-18T11:15:18.000Z | 2019-01-21T14:53:31.000Z | packages/navigation/README.md | PublicInMotionGmbH/ui-kit | cdac26f3fd5cfef5cdce1c36ae3fcee4513f60b8 | [
"MIT"
] | 1 | 2020-05-14T18:48:55.000Z | 2020-05-14T18:48:55.000Z | # Talixo Navigation
UI Component which represents Navigation
## How to install
Package is available as `@talixo/navigation` in NPM registry, so you can use it in your project
using `npm install @talixo/navigation --save` or `yarn add @talixo/navigation`.
## Requirements
Your package should additionally have some extra dependencies:
- `@talixo/shared: ^1.0.0-alpha.35`
- `@talixo/tooltip: ^1.0.0-alpha.35`
- `lodash: ^4.17.10`
- `prop-types: ^15.6.1`
- `react: ^16.2.0`
These packages are required by `@talixo/navigation`, but you have to install them manually,
to avoid having different versions of these in your application.
## Supported props
### Navigation
It allows any props which are allowed for `ul`. Additionally, it handles some differently:
Property name | Type | Default | Description
--------------|----------------|:--------------:|--------------------------------
children | node | n/a | Navigation items
className | string | n/a | Additional class name passed to wrapper
divider | node | n/a | Divider
type | NavigationType | `'navigation'` | Type of navigation
### Element
It allows any props which are allowed for `li`. Additionally, it handles some differently:
Property name | Type | Default | Description
--------------|----------------|:--------------:|--------------------------------
active | bool | `false` | Active state
children | node | n/a | Element items
className | string | n/a | Additional class name passed to element
completed | bool | `false` | Completed state
disabled | bool | `false` | Disabled state
onClick | func | n/a | Function passed to element
### Step
It allows any props which are allowed for `li`. Additionally, it handles some differently:
Property name | Type | Default | Description
--------------|----------------|:--------------:|--------------------------------
active | bool | `false` | Active state
children | node | n/a | Tooltips content
className | string | n/a | Additional class name passed to element
completed | bool | `false` | Completed state
disabled | bool | `false` | Disabled state
onClick | func | n/a | Function passed to element
### ControlledPagination
Property name | Type | Required | Default | Description
---------------|--------|----------|:------------:|--------------------------------
activePage | number | | `1` | Active page
displayedLimit | number | | `10` | Maximum number of displayed page buttons
nextLabel | node | | `'Next'` | Next button label
onChange | func | | n/a | Function passed to page buttons
pageCount | number | yes | n/a | The total number of pages
previousLabel | node | | `'Previous'` | Previous button label
### ControlledTabs
Property name | Type | Required | Default | Description
---------------|---------|----------|:--------:|--------------------------------
activeTab | number | | `0` | Active tab
labels | Label[] | | `[]` | List of tab labels
onChange | func | | n/a | Function passed to page buttons
### Steps
Property name | Type | Required | Default | Description
---------------|--------|----------|:--------:|--------------------------------
current | object | | n/a | Active step
steps | Step[] | | `[]` | List of steps
onChange | func | | n/a | Function passed to step buttons
#### Types
Type name | Enum options
---------------|---------------------------------------------------
NavigationType | 'navigation', 'pagination', 'breadcrumbs', 'tabs'
### Property shapes
#### Label
Property name | Type | Required | Default | Description
--------------|-----------|----------|:-------------:|------------------------------------------------
id | number | yes | n/a | Label's id
name | string | yes | n/a | Label's name
#### Step
Property name | Type | Required | Default | Description
--------------|-----------|----------|:-------------:|------------------------------------------------
name | string | yes | n/a | Step's name
disabled | boolean | yes | n/a | Disabled state
## Changelog
- **0.1.0** - initial version
| 41.982456 | 102 | 0.473464 | eng_Latn | 0.935287 |
9880feb7a1538ee44ae35a414529d2948a1b858e | 56 | md | Markdown | content/resume/christopher-nyberg-resume.md | NewMountain/PersonalBlog | dc403f25c572508d075a91d70b11aeba626d82ee | [
"MIT"
] | null | null | null | content/resume/christopher-nyberg-resume.md | NewMountain/PersonalBlog | dc403f25c572508d075a91d70b11aeba626d82ee | [
"MIT"
] | null | null | null | content/resume/christopher-nyberg-resume.md | NewMountain/PersonalBlog | dc403f25c572508d075a91d70b11aeba626d82ee | [
"MIT"
] | null | null | null | # Hello
My name is Chris. I will post my resume later.
| 14 | 46 | 0.714286 | eng_Latn | 0.999686 |
98814329ba32655cb4ba61ecacda4ca78570abd0 | 506 | md | Markdown | microsoft.ui.private.controls/teachingtiptesthooks_gettitlevisibility_792381798.md | hyoshioka0128/winui-api | 099eb4730822abd2f0f8d4aa2da36f03408bba8d | [
"CC-BY-4.0",
"MIT"
] | null | null | null | microsoft.ui.private.controls/teachingtiptesthooks_gettitlevisibility_792381798.md | hyoshioka0128/winui-api | 099eb4730822abd2f0f8d4aa2da36f03408bba8d | [
"CC-BY-4.0",
"MIT"
] | null | null | null | microsoft.ui.private.controls/teachingtiptesthooks_gettitlevisibility_792381798.md | hyoshioka0128/winui-api | 099eb4730822abd2f0f8d4aa2da36f03408bba8d | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
-api-id: M:Microsoft.UI.Private.Controls.TeachingTipTestHooks.GetTitleVisibility(Microsoft.UI.Xaml.Controls.TeachingTip)
-api-type: winrt method
---
# Microsoft.UI.Private.Controls.TeachingTipTestHooks.GetTitleVisibility(Microsoft.UI.Xaml.Controls.TeachingTip)
<!--
public static Microsoft.UI.Xaml.Visibility GetTitleVisibility (Microsoft.UI.Xaml.Controls.TeachingTip teachingTip);
-->
## -description
## -parameters
### -param teachingTip
## -returns
## -remarks
## -see-also
## -examples
| 18.071429 | 120 | 0.762846 | yue_Hant | 0.282576 |
9881897acbae2fe62a0844c6bf3f93ab67db93db | 7,142 | md | Markdown | articles/storage/blobs/network-file-system-protocol-support.md | Erickwilts/azure-docs.nl-nl | a9c68e03c55ac26af75825a5407e3dd14a323ee1 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/storage/blobs/network-file-system-protocol-support.md | Erickwilts/azure-docs.nl-nl | a9c68e03c55ac26af75825a5407e3dd14a323ee1 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/storage/blobs/network-file-system-protocol-support.md | Erickwilts/azure-docs.nl-nl | a9c68e03c55ac26af75825a5407e3dd14a323ee1 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Ondersteuning voor netwerk bestandssysteem 3,0 in Azure Blob-opslag (preview) | Microsoft Docs
description: Blob-opslag ondersteunt nu het NFS-protocol (Network File System) 3,0. Met deze ondersteuning kunnen Windows-en Linux-clients een container koppelen in Blob Storage vanaf een virtuele Azure-machine (VM) of een computer die on-premises wordt uitgevoerd.
author: normesta
ms.subservice: blobs
ms.service: storage
ms.topic: conceptual
ms.date: 08/04/2020
ms.author: normesta
ms.reviewer: yzheng
ms.custom: references_regions
ms.openlocfilehash: 52f7b328b013fd520787fca420a45ffdc5e9d9b1
ms.sourcegitcommit: 25d1d5eb0329c14367621924e1da19af0a99acf1
ms.translationtype: MT
ms.contentlocale: nl-NL
ms.lasthandoff: 01/16/2021
ms.locfileid: "98250805"
---
# <a name="network-file-system-nfs-30-protocol-support-in-azure-blob-storage-preview"></a>Ondersteuning voor het protocol Network File System (NFS) 3,0 in Azure Blob-opslag (preview-versie)
Blob-opslag ondersteunt nu het NFS-protocol (Network File System) 3,0. Met deze ondersteuning kunnen Windows-of Linux-clients een container koppelen in Blob Storage vanaf een virtuele Azure-machine (VM) of een computer on-premises.
> [!NOTE]
> Ondersteuning voor NFS 3,0-protocol in Azure Blob-opslag is in open bare preview. Het biedt ondersteuning voor GPV2-opslag accounts met de prestaties van de Standard-laag in de volgende regio's: Australië-oost, Korea-centraal en Zuid-Centraal vs. De preview biedt ook ondersteuning voor blok-blobs met een Premium-prestatie niveau in alle open bare regio's.
## <a name="general-workflow-mounting-a-storage-account-container"></a>Algemene werk stroom: een opslag account container koppelen
Als u een opslag account container wilt koppelen, moet u deze dingen doen.
1. De NFS 3,0-protocol functie registreren bij uw abonnement.
2. Controleer of de functie is geregistreerd.
3. Maak een Azure-Virtual Network (VNet).
4. Configureer netwerk beveiliging.
5. Maak en configureer een opslag account dat alleen verkeer van het VNet accepteert.
6. Maak een container in het opslag account.
7. Koppel de container.
Zie [Blob Storage koppelen met behulp van het NFS-protocol (Network File System) 3,0 (preview)](network-file-system-protocol-support-how-to.md)voor stapsgewijze instructies.
> [!IMPORTANT]
> Het is belang rijk om deze taken uit te voeren in de juiste volg orde. U kunt geen containers koppelen die u maakt voordat u het NFS 3,0-protocol inschakelt voor uw account. Nadat u het NFS 3,0-protocol hebt ingeschakeld voor uw account, kunt u dit ook niet uitschakelen.
## <a name="network-security"></a>Netwerkbeveiliging
Uw opslag account moet zich in een VNet bevinden. Met een VNet kunnen clients veilig verbinding maken met uw opslag account. De enige manier om de gegevens in uw account te beveiligen, is door gebruik te maken van een VNet en andere netwerk beveiligings instellingen. Elk ander hulp programma dat wordt gebruikt om gegevens te beveiligen, waaronder account sleutel autorisatie, Azure Active Directory (AD)-beveiliging en toegangs beheer lijsten (Acl's), worden nog niet ondersteund in accounts waarvoor ondersteuning voor NFS 3,0-protocol is ingeschakeld.
Zie [aanbevelingen voor netwerk beveiliging voor Blob Storage voor](security-recommendations.md#networking)meer informatie.
## <a name="supported-network-connections"></a>Ondersteunde netwerk verbindingen
Een client kan verbinding maken via een openbaar of een [persoonlijk eind punt](../common/storage-private-endpoints.md)en kan verbinding maken vanaf een van de volgende netwerk locaties:
- Het VNet dat u configureert voor uw opslag account.
Voor het doel van dit artikel verwijzen we naar die VNet als het *primaire vnet*. Zie [toegang verlenen vanuit een virtueel netwerk](../common/storage-network-security.md#grant-access-from-a-virtual-network)voor meer informatie.
- Een gepeerd VNet dat zich in dezelfde regio als het primaire VNet bevindt.
U moet uw opslag account configureren om toegang tot dit gepeerde VNet toe te staan. Zie [toegang verlenen vanuit een virtueel netwerk](../common/storage-network-security.md#grant-access-from-a-virtual-network)voor meer informatie.
- Een on-premises netwerk dat is verbonden met uw primaire VNet met behulp van [VPN gateway](../../vpn-gateway/vpn-gateway-about-vpngateways.md) of een [ExpressRoute-gateway](../../expressroute/expressroute-howto-add-gateway-portal-resource-manager.md).
Zie [toegang vanaf on-premises netwerken configureren](../common/storage-network-security.md#configuring-access-from-on-premises-networks)voor meer informatie.
- Een on-premises netwerk dat is verbonden met een peered netwerk.
U kunt dit doen met behulp van [VPN gateway](../../vpn-gateway/vpn-gateway-about-vpngateways.md) of een [ExpressRoute-gateway](../../expressroute/expressroute-howto-add-gateway-portal-resource-manager.md) samen met [gateway-door Voer](/azure/architecture/reference-architectures/hybrid-networking/vnet-peering#gateway-transit).
> [!IMPORTANT]
> Als u verbinding maakt vanaf een on-premises netwerk, moet u ervoor zorgen dat de client uitgaande communicatie toestaat via de poorten 111 en 2048. Het protocol NFS 3,0 maakt gebruik van deze poorten.
## <a name="azure-storage-features-not-yet-supported"></a>Azure Storage functies die nog niet worden ondersteund
De volgende Azure Storage-functies worden niet ondersteund wanneer u het NFS 3,0-protocol inschakelt voor uw account.
- Azure Active Directory (AD)-beveiliging
- POSIX-achtige Access Control Lists (Acl's)
- De mogelijkheid om NFS 3,0-ondersteuning op bestaande opslag accounts in te scha kelen
- De mogelijkheid om NFS 3,0-ondersteuning uit te scha kelen in een opslag account (nadat u deze hebt ingeschakeld)
- Mogelijkheid om te schrijven naar blobs door REST Api's of Sdk's te gebruiken.
## <a name="nfs-30-features-not-yet-supported"></a>NFS 3,0-functies die nog niet worden ondersteund
De volgende NFS 3,0-functies worden nog niet ondersteund met Azure Data Lake Storage Gen2.
- NFS 3,0 via UDP. Alleen NFS 3,0 over TCP wordt ondersteund.
- Bestanden vergren delen met Network Lock Manager (NLM). Koppelings opdrachten moeten de `-o nolock` para meter bevatten.
- Submappen koppelen. U kunt alleen de hoofdmap (container) koppelen.
- Koppelingen weer geven (bijvoorbeeld: met behulp van de opdracht `showmount -a` )
- Export vermeldingen (bijvoorbeeld door gebruik te maken van de opdracht `showmount -e` )
- Harde koppeling
- Een container exporteren als alleen-lezen
## <a name="pricing"></a>Prijzen
Tijdens de preview worden de gegevens die in uw opslag account zijn opgeslagen, gefactureerd op basis van hetzelfde capaciteits tarief als voor Blob Storage per GB per maand.
Tijdens de preview-periode worden er geen kosten in rekening gebracht. Prijzen voor trans acties kunnen worden gewijzigd en worden vastgesteld wanneer het algemeen beschikbaar is.
## <a name="next-steps"></a>Volgende stappen
Zie [Blob Storage koppelen met behulp van het NFS-protocol (Network File System) 3,0 (preview)](network-file-system-protocol-support-how-to.md)om aan de slag te gaan.
| 60.016807 | 556 | 0.792495 | nld_Latn | 0.998349 |
9881b715c469a49436c7b848416a925df8dd0300 | 347 | md | Markdown | tests-resources/tUI/README.md | badetitou/ComponentAnalyser | 12777cfc4555904448f8d1900a93e059aa4f939c | [
"MIT"
] | 4 | 2020-02-18T08:16:42.000Z | 2022-03-25T08:01:34.000Z | tests-resources/tUI/README.md | badetitou/ComponentAnalyser | 12777cfc4555904448f8d1900a93e059aa4f939c | [
"MIT"
] | 2 | 2018-03-12T10:52:59.000Z | 2018-05-04T09:43:37.000Z | tests-resources/tUI/README.md | badetitou/ComponentAnalyser | 12777cfc4555904448f8d1900a93e059aa4f939c | [
"MIT"
] | 4 | 2020-07-17T14:31:31.000Z | 2021-04-18T10:23:39.000Z | # TUI test resource
This part of the repository contains the sources used to create tests in Casino.
Use the following script when adding test cases
```sh
my/path/to/verveinej.bat -o tests.json -format json -alllocals -anchor assoc lib hello
```
> You must use java files with the LF end of files convention.
> This is important to use the CI
| 26.692308 | 86 | 0.760807 | eng_Latn | 0.997683 |
9882e4e8c29e1b562cbf965cb56c684817a42686 | 3,810 | md | Markdown | docs/installation.md | ed-holland/abaplint-abap-backend | 4ea4188f87bcc6a5f4dd2dc2c6d614c76a08fea2 | [
"MIT"
] | 16 | 2020-09-04T14:21:30.000Z | 2022-02-16T11:28:18.000Z | docs/installation.md | ed-holland/abaplint-abap-backend | 4ea4188f87bcc6a5f4dd2dc2c6d614c76a08fea2 | [
"MIT"
] | 149 | 2020-07-11T06:21:27.000Z | 2022-02-19T06:49:00.000Z | docs/installation.md | ed-holland/abaplint-abap-backend | 4ea4188f87bcc6a5f4dd2dc2c6d614c76a08fea2 | [
"MIT"
] | 15 | 2020-07-16T21:39:09.000Z | 2022-01-01T18:46:10.000Z | # Installation
## Prerequisites
* ABAP Application Server 7.31 or higher
(Potentially works with 702 though downported json xml parser should be available)
* [abaplint Server](https://github.com/abaplint/abaplint-sci-server)
## Dependencies
The following repositories must be installed in this order:
* [abapGit developer version](https://docs.abapgit.org/guide-install.html#install-developer-version)
(with all the separate classes, not a simple file version)
* [abaplint Client](https://github.com/abaplint/abaplint-sci-client) (this repo)
## Initial Setup
1. Test Management
Activate the abaplint check in transaction `SCI` -> Management of -> Tests
2. Check Variant
In transaction `SCI`, create a new test variant. Note: If you want to use the variant within abapGit, it has to be a global variant (icon with two users).
Select the abaplint check and use the arrow icon to jump to the abaplint configuration.
abaplint needs general configuration and settings that are defined per SAP package
3. General Configuration
Select 'Configuration' and maintain the connection to your [abaplint Server](https://github.com/abaplint/abaplint-sci-server).
If you do not have your own abaplint Server, you might want to use https://sci.abaplint.app which is currently provided for free. **Caution:** Use
this server at your own risk, your code will leave your system.
Optional parameters:
- Dependency depth - Defines over how many levels the check will try to resolve dependencies of ABAP classes (via inheritance, interfaces, attributes, or types)
- Continue into SAP objects - Decides if dependencies of SAP objects should be included in the check
- Use cache - Select if dependencies and serialized files shall be cache in transparent tables
- HTTP timeout - Setting for HTTP connection to abaplint SCI server
- SSL ID - Setting for HTTP connection (default ANONYM)
4. Package Configuration
You have to maintain the abaplint configuration for SAP package level. The configuration for a given package will also cover all subpackages and their objects.
Select 'Add package', add the configuration, and save it.
You can retrieve either the default configuration which includes all rules supported by your abaplint server using 'Update with Default'. If your package is
linked to an abapGit repository, then you can use 'Update from abapGit' to get the content of the abaplint.json file as a basis for your configuration.
## Important Notes
1. General as well as package configurations will be valid for *all* check variants that enable the abaplint checks. They are not check variant-specific.
2. The abaplint check configuration (json) is *independent* of the abaplint.json file in your repository. They can be different (although they probably shouldn't be).
3. **Remember to save all changes to configuration and check variant.**
## Cross-References
The abaplint check depends on the cross-reference generated automatically by your SAP system (for customer objects).
In case it you think there is an issue, run these reports in background:
- SAPRSEUB for SAP objects (**Note:** This will require several GB of space in your database)
- SAPRSEUC for Customer objects (Y*/Z*)
Also to ensure that the repository is kept clean, run SAPRSEUJ which schedules the required jobs.
For details, see SAP Notes [2752795 - Environment analysis progams and classes - use of BAdI definitions](https://launchpad.support.sap.com/#/notes/2752795) and
[2243139 - REPOSITORY_ENVIRONMENT_ALL - too few hits for enhancement implementations](https://launchpad.support.sap.com/#/notes/2243139).
| 42.808989 | 167 | 0.776378 | eng_Latn | 0.98029 |
9883025d5644f9044dea030eefa30c9742216803 | 15,255 | md | Markdown | README-ja.md | ogata-k/sbrd-gen | f3d8a550eb5dee1db07b67848349a5adfdd66c5e | [
"MIT"
] | null | null | null | README-ja.md | ogata-k/sbrd-gen | f3d8a550eb5dee1db07b67848349a5adfdd66c5e | [
"MIT"
] | 5 | 2022-02-26T00:57:56.000Z | 2022-03-29T22:23:52.000Z | README-ja.md | ogata-k/sbrd-gen | f3d8a550eb5dee1db07b67848349a5adfdd66c5e | [
"MIT"
] | null | null | null | # クレートについて
[In English](https://github.com/ogata-k/sbrd-gen/blob/v0.1.x/README.md)
[crates.io](https://crates.io/crates/sbrd-gen )
[APIドキュメント](https://docs.rs/sbrd-gen/0.1.0/sbrd_gen/ )
これはスキーマをベースにしてランダムにダミーデータを生成することができるクレート（Schema-Based Random Data GENerator、i.e. SBRD GEN）です。 ライブラリとしてもCLIツールとしても利用可能です。
スキーマとスキーマのジェネレーターは[スキーマについて](#スキーマについて)、ジェネレーターとそのビルダーは[指定可能なジェネレーターの一覧](#指定可能なジェネレーターの一覧)を参照してください。
なお、このプログラムは[serde](https://serde.rs/ )を利用して、スキーマのパースと生成結果のフォーマット行っています。
## ライブラリとして利用する場合
ライブラリとして使用する場合、[単一のジェネレータで生成する方法](#単一のジェネレータで生成する方法)と[スキーマを用いて複数のジェネレータを組み合わせる方法](#スキーマを用いて複数のジェネレータを組み合わせる方法)があります。
### 単一のジェネレータで生成する方法
生成結果を組み合わせるほどでもないときに単一のジェネレータで生成する方法を利用することができます。
もちろん[スキーマを用いて複数のジェネレータを組み合わせる方法](#スキーマを用いて複数のジェネレータを組み合わせる方法)でも生成可能です。
利用方法は、次の通りです。
1. ```GeneratorBuilder```の```new_xx```（xxは可変）でビルダーを用意します。nullを生成できるようにしたい場合は、```nullable```の指定を追加します。
2. ビルダーを```build```してジェネレータに変換する
3. ジェネレータにシード種とコンテキストを渡してダミーデータを生成する
以下に、実際の記述例を記します。
```rust
use rand::thread_rng;
use sbrd_gen::builder::GeneratorBuilder;
use sbrd_gen::value::DataValueMap;
fn main() {
let builder = GeneratorBuilder::new_int(Some((0..=100).into())).nullable();
let generator = builder.build().unwrap();
let generated_value = generator.generate(&mut thread_rng(), &DataValueMap::new()).unwrap();
println!("generated: {}", generated_value);
}
```
### スキーマを用いて複数のジェネレータを組み合わせる方法
複数のジェネレータを利用したい場合は、こちらの方法を利用することができます。
利用方法は、次の通りです。
1. 利用したいジェネレータのリストとして```ParentGeneratorBuilder```のリストを用意する。
このリストは上から順に生成に利用されるため、宣言する順番を間違えると生成した値を使ってキーを置き換えることのできる[スクリプト](#スクリプト)や[フォーマット](#フォーマット)が正しく機能しないことになるので注意してください。
2. 利用したいジェネレータの内、出力したいキーの一覧を用意する。
3. 出力したいキーの一覧と利用したいジェネレータの一覧を引数に指定して、```SchemaBuilder```を構築する。
4. 構築した```SchemaBuilder```を```build```して、```Schema```に変換する。
5. 変換した```Schema```で、```generate```してダミーデータを生成、または```GeneratedValueWriter```トレイトの```write_xx```（xxは可変）でWriterに書き込む。
実際の記述例は、[all_builder.rs](https://github.com/ogata-k/sbrd-gen/blob/v0.1.x/examples/schema/all_builder.rs )をご覧ください。
## CLIツールとして利用する場合
CLIツールとして使用する場合、スキーマファイルのファイルパスを指定してダミーデータを生成することができます。
CLIではスキーマファイルのファイル形式や出力する個数、出力するフォーマットなどを指定することができます。詳しくはCLIのヘルプをご覧ください。
### インストール
インストールする方法はいくつかありますが、代表なのは[Cargoを使ってインストール](#Cargoを使ってインストール)と[GitHubのリリースページからインストール](#GitHubのリリースページからインストール)です。
#### Cargoを使ってインストール
```cargo```コマンドが利用できる状態で以下のコマンドを叩いてください。
```sbrd-gen --help```でヘルプメッセージが出力されればインストールは成功しています。
``` bash
cargo install sbrd-gen
sbrd-gen --help
```
#### GitHubのリリースページからインストール
GitHubのリリースページからインストールする場合は、[こちら](https://github.com/ogata-k/sbrd-gen/releases )から希望のバージョンをダウンロードします。
ダウンロードしたフォルダを展開後、バイナリファイルのパスを通して利用できるようにしてください。
```sbrd-gen --help```でヘルプメッセージが出力されればインストールは成功しています。
### CLIツールの使い方
実行ファイル（例えばWindowsなら```sbrd-gen.exe```）にパスを通したうえで```sbrd-gen [OPTIONS] <SCHEMA_FILE_PATH>```という文法でコマンドを実行します。
以下で、指定可能な引数やオプションを説明しますが、```sbrd-gen --help```で表示されるヘルプメッセージでも閲覧可能です。
#### 引数
* `<SCHEMA_FILE_PATH>` : 生成に用いるスキーマを記したファイルのファイルパス。
#### オプション
* パーサー
* 指定１ : `--parser <PARSER_TYPE>`
* 指定２ : `-p <PARSER_TYPE>`
* 説明 : 利用したいパーサーの種類を指定するオプションです。`<PARSER_TYPE>`に利用したいパーサーの種類を指定します。
* 利用可能オプション : yaml, json
* デフォルト : yaml
* 出力タイプ
* 指定１ : `--type <OUTPUT_TYPE>`
* 指定２ : `-t <OUTPUT_TYPE>`
* 説明 : 出力したいフォーマットを指定するオプションです。`<OUTPUT_TYPE>`に利用したいフォーマッターを指定します。
* 利用可能オプション : yaml, json, csv, tsv
* デフォルト : json
* 出力数
* 指定１ : `--num <COUNT>`
* 指定２ : `-n <COUNT>`
* 説明 : スキーマの`keys`で指定したダミーデータのセットの個数を指定するオプションです。`<COUNT>`に個数を指定します。
* デフォルト : 10
* キーヘッダー出力させないことを表すフラグ
* 指定 : `--no-header`
* 説明 : 出力結果にキーを含めたくない場合に指定するオプションです。
* スキーマのパースのみの実行
* 指定 : `--dry-run`
* 説明 : ダミーデータの出力をせずにスキーマのパースだけを行って終了することを指定するオプションです。
* ヘルプ
* 指定１ : `--help`
* 指定２ : `-h`
* 説明 : ヘルプを確認したいときに指定するオプションです。
* バージョン
* 指定１ : `--version`
* 指定２ : `-V`
* 説明 : バージョンを確認したいときに指定するオプションです。
## スキーマについて
スキーマは、`keys`をキーとする出力したい[キー](#キー)のシークエンスと、`generators`をキーとする[ジェネレータのビルダー](#親ジェネレーターのオプション一覧)のシークエンスからなるマップ形式で指定します。
フォーマットは、YamlとJsonをサポートしています。
記述例については、[all.yaml](https://github.com/ogata-k/sbrd-gen/blob/v0.1.x/examples/schema/all.yaml )や[all.json](https://github.com/ogata-k/sbrd-gen/blob/v0.1.x/examples/schema/all.json )をご覧ください。
### 値のコンテキスト
スキーマからダミーデータを生成するときは、スキーマに指定されたジェネレーターを上から順に実行します。
このとき生成された値は値のコンテキストと呼ばれるマップ形式のデータ構造に保存されます。
つまり、値のコンテキストで参照可能なペアは、参照時点で生成に成功したジェネレーターのキーと値のペアです。
この値のコンテキストは、出力したいキーからキーに紐づく値を取得するのに用いられたり、[スクリプト](#スクリプト)や[フォーマット](#フォーマット)として指定された"{key}"（括弧とキーの間にはスペース無し）という表記をその時点のコンテキストにあるkeyに紐づく値で置き換えてから評価したり、といった形などで利用されます。
### 親ジェネレーターのオプション一覧
親ジェネレーターはキーとビルダーのオプションからなるマップ形式で指定します。
構造体としては```ParentGeneratorBuilder```となります。
#### キー
ジェネレーターを特定するためのキーで、`key`をキーとした文字列として指定します。
[スクリプト](#スクリプト)や[フォーマット](#フォーマット)を評価する際の置換キーとしても利用されます。
#### ビルダー
[指定可能なジェネレーターの一覧](#指定可能なジェネレーターの一覧)で列挙されているジェネレーターのオプションを指定することができます。
生成されるジェネレータは[タイプ](#タイプ)によって決まり、ほかのオプションも同様に解釈されます。
### 指定可能なジェネレーターの一覧
スキーマや単一のジェネレーターとして指定可能なジェネレーターは以下の通りです。
#### 文字列構築系（build_stringモジュール）
他のジェネレーターの生成結果をもとに文字列を組み立てるジェネレーターの集まりからなるモジュールです。
* duplicate permutation generator
* 説明 : 生成結果を組み合わせて文字列にするジェネレーターです。範囲指定で指定された回数だけ値を生成して区切り文字で貼り付けて文字列を作成します。[区切り文字](#区切り文字)のデフォルトは空文字（""）です。
* 備考 : なし
* 構造体 : ```DuplicatePermutationGenerator```
* タイプ : duplicate-permutation
* 必須オプション : [タイプ](#タイプ)、[区切り文字](#区切り文字)、括弧内一つ以上（[子ジェネレーターの一覧](#子ジェネレーターの一覧)、[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)）
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[範囲（整数型）](#範囲)、[区切り文字](#区切り文字)、[子ジェネレーターの一覧](#子ジェネレーターの一覧)、[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)
* 生成型 : 文字列型
* format generator
* 説明 : 指定されたフォーマットにコンテキストを適応して文字列を構築するジェネレーターです。
* 備考 : なし
* 構造体 : ```FormatGenerator```
* タイプ : format
* 必須オプション : [タイプ](#タイプ)、[フォーマット](#フォーマット)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[フォーマット](#フォーマット)
* 生成型 : 文字列型
#### 分布系（distributionモジュール）
分布関数をもとに乱数を生成するジェネレーターの集まりからなるモジュールです。
* normal generator
* 説明 : 正規分布に従って乱数を生成するジェネレーターです。
* 備考 : [パラメーター](#パラメーター)で指定できるのは、実数型の平均（`mean`）と実数型の標準偏差（`std_dev`）です。デフォルトは、それぞれ0.0、1.0です。
* 構造体 : ```NormalGenerator```
* タイプ : dist-normal
* 必須オプション : [タイプ](#タイプ)、[パラメーター](#パラメーター)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[パラメーター](#パラメーター)
* 生成型 : 実数型
#### 評価系（evalモジュール）
指定した式を評価して値を出力するジェネレーターの集まりからなるモジュールです。
* eval generator
* 説明 : 指定した[スクリプト](#スクリプト)を評価した結果を出力するジェネレーターです。
* 備考 : なし
* 構造体 : ```EvalGenerator```
* タイプ : eval-int（整数型）、eval-real（実数型）、eval-bool（ブーリアン型）、eval-string（文字列型）
* 必須オプション : [タイプ](#タイプ)、[スクリプト](#スクリプト)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[スクリプト](#スクリプト)
* 生成型 : 整数型（eval-int）、実数型（eval-real）、ブーリアン型（eval-bool）、文字列型（eval-string）
#### 逐次変更系（incrementalモジュール）
実行するたびに一定量増加するといったように逐次的に変化するジェネレーターの集まりからなるモジュールです。
* increment id generator
* 説明 : 生成するたびに指定された[逐次定量変化](#逐次定量変化)のステップ数を加算してから生成するジェネレーターです。初期値は指定された[逐次定量変化](#逐次定量変化)の初期値です。
* 備考 : [逐次定量変化](#逐次定量変化)のデフォルトは、1始まりの1増加となっています。
* 構造体 : ```IncrementIdGenerator```
* タイプ : increment-id
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[逐次定量変化（整数型）](#逐次定量変化)
* 生成型 : 整数型
#### プリミティブ系（primitiveモジュール）
基本的な値を生成するジェネレーターの集まりからなるモジュールです。
* int generator
* 説明 : 指定された[範囲](#範囲)で整数型を生成するジェネレーターです。デフォルトの範囲はi16の最小値（-32768）以上i16の最大値（32767）以下です。
* 備考 : なし
* 構造体 : ```IntGenerator```
* タイプ : int
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[範囲（整数型）](#範囲)
* 生成型 : 整数型
* real generator
* 説明 : 指定された[範囲](#範囲)で実数型を生成するジェネレーターです。デフォルトの範囲はi16の最小値（-32768）以上i16の最大値（32767）以下です。
* 備考 : 生成された値の絶対値が大きいほど小数点以下の字数が減り、絶対値が小さいほど小数点以下の字数が増えます。
* 構造体 : ```RealGenerator```
* タイプ : real
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[範囲（実数型）](#範囲)
* 生成型 : 実数型
* bool generator
* 説明 : 50%の確率でtrueかfalseを生成するジェネレーターです。
* 備考 : なし
* 構造体 : ```BoolGenerator```
* タイプ : bool
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)
* 生成型 : ブーリアン型
* date time generator
* 説明 : [フォーマット](#フォーマット)で指定したフォーマットで日時を生成するジェネレーターです。
* 備考 : [範囲](#範囲)で指定する日時のフォーマットは"%Y-%m-%d %H:%M:%S"です。[フォーマット](#フォーマット)のデフォルト値も同じフォーマットです。フォーマットについては[こちら](https://docs.rs/chrono/0.4.19/chrono/format/strftime/index.html#specifiers )をご覧ください。デフォルトの[範囲](#範囲)は1900-01-01 00:00:00以上2151-01-01 00:00:00未満で、未指定の境界はデフォルト値が指定されたものとします。
* 構造体 : ```DateTimeGenerator```
* タイプ : date-time
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[範囲（日時の文字列型）](#範囲)、[フォーマット](#フォーマット)
* 生成型 : 文字列型
* date generator
* 説明 : [フォーマット](#フォーマット)で指定したフォーマットで日付を生成するジェネレーターです。
* 備考 : [範囲](#範囲)で指定する日付のフォーマットは"%Y-%m-%d"です。[フォーマット](#フォーマット)のデフォルト値も同じフォーマットです。フォーマットについては[こちら](https://docs.rs/chrono/0.4.19/chrono/format/strftime/index.html#specifiers )をご覧ください。デフォルトの[範囲](#範囲)は1900-01-01以上2151-01-01未満です、未指定の境界はデフォルト値が指定されたものとします。
* 構造体 : ```DateGenerator```
* タイプ : date
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[範囲（日付の文字列型）](#範囲)、[フォーマット](#フォーマット)
* 生成型 : 文字列型
* time generator
* 説明 : [フォーマット](#フォーマット)で指定したフォーマットで時刻を生成するジェネレーターです。
* 備考 : [範囲](#範囲)で指定する日時のフォーマットは"%H:%M:%S"です。[フォーマット](#フォーマット)のデフォルト値も同じフォーマットです。フォーマットについては[こちら](https://docs.rs/chrono/0.4.19/chrono/format/strftime/index.html#specifiers )をご覧ください。デフォルトの[範囲](#範囲)は00:00:00以上23:59:59以下です、未指定の境界はデフォルト値が指定されたものとします。
* 構造体 : ```TimeGenerator```
* タイプ : time
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[範囲（時刻の文字列型）](#範囲)、[フォーマット](#フォーマット)
* 生成型 : 文字列型
* always null generator
* 説明 : 常にnullを生成するジェネレーターです。
* 備考 : なし
* 構造体 : ```AlwaysNullGenerator```
* タイプ : always-null
* 必須オプション : [タイプ](#タイプ)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)
* 生成型 : Null型
#### 子ジェネレーター乱択系（random_childrenモジュール）
[子ジェネレーターの一覧](#子ジェネレーターの一覧)を利用して値を生成するジェネレーターです。
* case when generator
* 説明 : 宣言順に[条件](#条件)を評価してtrueになった子ジェネレーターを利用して生成するジェネレーターです。
* 備考 : [条件](#条件)に引っかからなかった場合のためにデフォルト条件（つまり、[条件](#条件)が未指定）の子ジェネレーターが必要です。
* 構造体 : ```CaseWhenGenerator```
* タイプ : case-when
* 必須オプション : [タイプ](#タイプ)、[条件](#条件)の指定がある[子ジェネレーターの一覧](#子ジェネレーターの一覧)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[条件](#条件)の指定がある[子ジェネレーターの一覧](#子ジェネレーターの一覧)
* 生成型 : 生成に利用した子ジェネレーターの生成型
* random child generator
* 説明 : [ウェイト](#ウェイト)を考慮して乱択したジェネレーターを利用して生成するジェネレーターです。
* 備考 : なし
* 構造体 : ```RandomChildGnerator```
* タイプ : random-child
* 必須オプション : [タイプ](#タイプ)、[ウェイト](#ウェイト)の指定がある[子ジェネレーターの一覧](#子ジェネレーターの一覧)
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[ウェイト](#ウェイト)の指定がある[子ジェネレーターの一覧](#子ジェネレーターの一覧)
* 生成型 : 生成に利用した子ジェネレーターの生成型
#### 値乱択系（random_valuesモジュール）
[文字リスト](#文字リスト)や[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)を利用して値を生成するジェネレーターの集まりからなるモジュールです。
* select generator
* 説明 : [文字リスト](#文字リスト)や[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)で指定された値を乱択するジェネレーターです。
* 備考 : なし
* 構造体 : ```SelectGenerator```
* タイプ : select-int（整数型）、select-real（実数型）、select-string（文字列型）
* 必須オプション : [タイプ](#タイプ)、括弧内一つ以上（[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)）
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)
* 生成型 : 整数型（select-int）、実数型（select-real）、文字列型（select-string）
* get value at generator
* 説明 : [スクリプト](#スクリプト)を評価して取得したインデックスにある値を、入力された値の一覧から取得するジェネレーターです。
* 備考 : なし
* 構造体 : ```GetValueAtGenerator```
* タイプ : get-int-value-at（整数型）、get-real-value-at（実数型）、get-string-value（文字列型）
* 必須オプション : [タイプ](#タイプ)、[スクリプト](#スクリプト)、括弧内一つ以上（[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)）
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[スクリプト](#スクリプト)、[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)
* 生成型 : 整数型（get-int-value-at）、実数型（get-real-value-at）、文字列型（get-string-value-at）
* get value index generator
* 説明 : 入力された値の一覧から乱択可能な範囲のインデックスを取得するジェネレーターです。
* 備考 : なし
* 構造体 : ```GetValueIndexGenerator```
* タイプ : get-value-index
* 必須オプション : [タイプ](#タイプ)、括弧内一つ以上（[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)）
* 指定可能オプション : [タイプ](#タイプ)、[ヌラブル](#ヌラブル)、[文字リスト](#文字リスト)、[値の一覧](#値の一覧)、[外部ファイルパス](#外部ファイルパス)
* 生成型 : 整数型（非負）
### ジェネレーターのオプション一覧
ジェネレーターを構築するのに指定できるオプションは次の通りです。
指定可能なオプションはジェネレーターによって違いますが、指定可能なオプション以外は無視されます。
#### タイプ
* 説明 : [指定可能なジェネレーターの一覧](#指定可能なジェネレーターの一覧)で列挙されているジェネレーターのタイプ。ジェネレーターの種類を特定するために利用される。
* 備考 : なし
* 構造体 : ```GeneratorType```
* キー名 : `type`
* 値型 : 文字列型
#### ヌラブル
* 説明 : ジェネレーターが生成する値に加えてnullを生成することができるかのフラグ。trueならnullを生成することができる。デフォルトはfalse。
* 備考 : なし
* 構造体 : ```bool```
* キー名 : `nulable`
* 値型 : ブーリアン型
#### フォーマット
* 説明 : このフォーマットは、[値のコンテキスト](#値のコンテキスト)内のキーと値のペア（仮にそのペアを(key, value)とする。）を順番にフォーマット内の"{key}"や"{key:\<format-option>\}"（括弧とkey、コロンの間にはスペース無し）という文字列をフォーマットしたvalueで置き換えてから文字列として評価されます。文字'{'と'}'は二つ重ねればエスケープできますが、キーの指定として優先的にパースされるのでキーに'{'や'}'を利用するとキーがうまく特定できないので注意してください。なお、出力用のキーとしてなら問題なく利用できます。
* 備考 : 文法について詳しくはこのクレートの[EvaluatorのAPIドキュメント](https://docs.rs/sbrd-gen/0.1.0/sbrd_gen/eval/struct.Evaluator.html )を参照してください。
* 構造体 : ```String```
* キー名 : `format`
* 値型 : 文字列型
#### スクリプト
* 説明 : このスクリプトは、[値のコンテキスト](#値のコンテキスト)内のキーと値のペア（仮にそのペアを(key, value)とする。）を順番にスクリプト内の"{key}"や"{key:\<format-option>\}"（括弧とkey、コロンの間にはスペース無し）という文字列をフォーマットしたvalueで置き換えてから式として評価されます。文字'{'と'}'は二つ重ねればエスケープできますが、キーの指定として優先的にパースされるのでキーに'{'や'}'を利用するとキーがうまく特定できないので注意してください。なお、出力用のキーとしてなら問題なく利用できます。
* 備考 : 文法や式について詳しくはこのクレートの[EvaluatorのAPIドキュメント](https://docs.rs/sbrd-gen/0.1.0/sbrd_gen/eval/struct.Evaluator.html )を参照してください。
* 構造体 : ```String```
* キー名 : `script`
* 値型 : 文字列型
#### 区切り文字
* 説明 : 文字列の構築などで区切りに使う文字列です。
* 備考 : なし
* 構造体 : ```String```
* キー名 : `separator`
* 値型 : 文字列型
#### 範囲
* 説明 : 繰り返し数の範囲や生成する値の範囲の指定に利用されるオプションです。
* 備考 : 範囲指定時に利用できる値型として利用可能なのは、整数型、実数型、文字列型、日時の文字列型、日付の文字列型、時刻の文字列型の６つです。日時関係の値の指定はそれぞれの[プリミティブ系ジェネレーター](#プリミティブ系（primitiveモジュール）)を参照してください。
* 構造体 : ```ValueBound```
* キー名 : `range`
* 値型 : 値型の値を値に持つキー`start`とキー`end`、`end`の値を含むことを表すフラグを値に持つキー`include_end`からなるマップ形式であり、それぞれ任意指定です。`include_end`のデフォルト値はtrueです。
#### 逐次定量変化
* 説明 : ジェネレーターを実行するたびに更新される値の初期値と変化量を指定するためのオプションです。
* 備考 : 指定時に利用できる値型として利用可能なのは、整数型、実数型、文字列型、日時の文字列型、日付の文字列型、時刻の文字列型の６つです。値の指定は[範囲](#範囲)の指定と同じです。
* 構造体 : ```ValueStep```
* キー名 : `increment`
* 値型 : 初期値として値型の値を値に持つキー`initial`と、変化量を表す値型の値を値に持つキー`step`からなるマップ形式であり、`initial`は必須、`step`は任意指定です。
#### 子ジェネレーターの一覧
* 説明 : [ジェネレーターのオプション一覧](#ジェネレーターのオプション一覧)で指定されるジェネレーターのシークエンスを指定するオプションです。ここで指定するのは子ジェネレーターと呼ばれ、親ジェネレーターとは違い追加で[子ジェネレーターのオプション一覧](#子ジェネレーターのオプション一覧)を指定することができます。
* 備考 : なし
* 構造体 : ```Vec<ChildGeneratorBuilder>>```
* キー名 : `children`
* 値型 : 子ジェネレーターのシークエンス
#### 文字リスト
* 説明 : 乱択の対象とする文字を列挙するオプションです。
* 備考 : なし
* 構造体 : ```String```
* キー名 : `chars`
* 値型 : 文字列型
#### 値の一覧
* 説明 : 乱択の対象とする値を列挙するオプションです。
* 備考 : 値型として利用可能なのは、整数型、実数型、文字列型です。
* 構造体 : ```Vec<DataValue>```
* キー名 : `values`
* 値型 : 整数型、実数型、文字列型のどれかの型からなるシークエンス
#### 外部ファイルパス
* 説明 : 乱択の対象とする値を一行==一つの値として列挙するファイルのファイルパスを指定するオプションです。絶対パスのほかにスキーマファイルからの相対パスで指定することができます。
* 備考 : なし
* 構造体 : ```PathBuf```
* キー名 : `filepath`
* 値型 : 文字列型
#### パラメーター
* 説明 : 分布関数を構築する際に必要なパラメーターを指定するためのオプションです。指定するキーと値については[分布系](#分布系（distributionモジュール）)の各ジェネレーターを参照してください。
* 備考 : なし
* 構造体 : ```DataValueMap<String>```
* キー名 : `parameters`
* 値型 : マップ形式
### 子ジェネレーターのオプション一覧
子ジェネレーターは、ジェネレーターで指定可能なオプションに加えて次に列挙するオプションも指定することができます。
#### 条件
* 説明 : どの子ジェネレーターを利用するかの条件分岐の条件を指定するためのオプション。指定された場合[スクリプト](#スクリプト)と同様に評価してtrue/falseを判定し、未指定の場合常にtrueを返します。
* 備考 : なし
* 構造体 : ```String```
* キー名 : `condition`
* 値型 : 文字列型
#### ウェイト
* 説明 : 子ジェネレーターを乱択する際の重みを指定するためのオプション。重みが大きいほどよく選択される。デフォルトの重みは1。
* 備考 : なし
* 構造体 : ```Weight```
* キー名 : `weight`
* 値型 : 整数型（非負）
## LICENSE
MIT
| 39.418605 | 291 | 0.720288 | yue_Hant | 0.510296 |
9883874908a003009092c412308983e83074df7a | 1,281 | md | Markdown | doc/nodejs/promise.md | lonelyPoker/poker.github.io | 5fc170f0b18ed167a3c937740c68033e359fab55 | [
"Apache-2.0"
] | null | null | null | doc/nodejs/promise.md | lonelyPoker/poker.github.io | 5fc170f0b18ed167a3c937740c68033e359fab55 | [
"Apache-2.0"
] | 1 | 2021-09-28T09:21:46.000Z | 2021-09-28T13:46:05.000Z | doc/nodejs/promise.md | lonelyPoker/poker.github.io | 5fc170f0b18ed167a3c937740c68033e359fab55 | [
"Apache-2.0"
] | null | null | null | ```javascript
function background_task() {
return new Promise(async function (resolve, reject) {
if (Math.random()) {
for (let index = 0; index < 10; index++) {
await async_sleep(4)
console.log("支线任务。。。")
}
resolve("success");
} else {
reject("failed");
}
})
}
function async_sleep(time) {
return new Promise((resolve, reject) => {
try {
setTimeout(() => {
resolve(undefined);
}, parseInt(time) * 1000);
} catch (error) {
reject(error.message);
}
})
}
async function main(){
background_task().then(x=>console.log(x));
await async_sleep(4);
console.log(1000);
}
function interval_task_invoke(func,time){
return new Promise(function(resolve,reject){
try{
let interval_task_id = setInterval(func,parseInt(time) * 1000);
resolve(interval_task_id)
}catch{
reject(new Error("create interval task error."));
}
})
}
async function main(){
let task_id = await interval_task_invoke(function(){
1 / 0
},1)
console.log(task_id);
await async_sleep(10);
clearInterval(task_id)
}
main()
``` | 24.634615 | 75 | 0.537861 | yue_Hant | 0.230633 |
9883c32195f72ba70cf1c19ab3c0dd4479863490 | 49 | md | Markdown | add/metadata/System.Windows.Controls/PanningMode.meta.md | kcpr10/dotnet-api-docs | b73418e9a84245edde38474bdd600bf06d047f5e | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-06-16T22:24:36.000Z | 2020-06-16T22:24:36.000Z | add/metadata/System.Windows.Controls/PanningMode.meta.md | kcpr10/dotnet-api-docs | b73418e9a84245edde38474bdd600bf06d047f5e | [
"CC-BY-4.0",
"MIT"
] | null | null | null | add/metadata/System.Windows.Controls/PanningMode.meta.md | kcpr10/dotnet-api-docs | b73418e9a84245edde38474bdd600bf06d047f5e | [
"CC-BY-4.0",
"MIT"
] | 1 | 2019-04-08T14:42:27.000Z | 2019-04-08T14:42:27.000Z | ---
uid: System.Windows.Controls.PanningMode
---
| 12.25 | 40 | 0.714286 | yue_Hant | 0.898987 |
9884311eb68a7c28a7129050127d66a391b53645 | 2,089 | md | Markdown | src/sl/2022-01/06/06.md | Adventech/sabbath-school-lessons | baf65ac98fa7c7bce73e16c263eb0cc1bf0ba62a | [
"MIT"
] | 68 | 2016-10-30T23:17:56.000Z | 2022-03-27T11:58:16.000Z | src/sl/2022-01/06/06.md | Adventech/sabbath-school-lessons | baf65ac98fa7c7bce73e16c263eb0cc1bf0ba62a | [
"MIT"
] | 367 | 2016-10-21T03:50:22.000Z | 2022-03-28T23:35:25.000Z | src/sl/2022-01/06/06.md | Adventech/sabbath-school-lessons | baf65ac98fa7c7bce73e16c263eb0cc1bf0ba62a | [
"MIT"
] | 109 | 2016-08-02T14:32:13.000Z | 2022-03-31T10:18:41.000Z | ---
title: Brezgrešni Duhovnik
date: 03/02/2022
---
`Katerih pet značilnosti je pripisanih Jezusu v Heb 7,26?`
Jezus je bil »svet«. To pomeni, da je bil v odnosu z Bogom brez greha (Heb 2,18; Heb 4,15; Heb 5,7-8). V starogrškem prevodu Stare zaveze je enak grški izraz uporabljen za opis ljudi, ki ohranjajo svoj zavezni odnos z Bogom in drugimi.
Jezus je bil »nedolžen«. Ostal je čist. Kljub temu, da je bil »preizkušan v vsem«, se ga zlo ni dotaknilo (Heb 4,15; Heb 2,18). Jezusova popolna brezgrešnost je pomembna za njegovo duhovniško službo. Stara zaveza je zahtevala neoporečnost žrtvenih živali, da bi Bog sprejel daritev (3 Mz 1,3.10 itd.). Ker je bil Jezus med svojim življenjem na zemlji popolnoma poslušen Bogu, je lahko samega sebe ponudil kot popolno daritev Bogu (Heb 9,14).
Z odhodom v nebesa je bil Jezus »ločen od grešnikov«. Glagolski čas v grščini nakazuje, da gre pri tem za njegovo sedanje stanje, ki pa se je začelo na določeni točki časa. Med svojim življenjem na zemlji je prestal sovražnost grešnikov; ker je zmagal, je sedel na Božjo desnico (Heb 12,2-3). Da je bil »ločen od grešnikov«, pomeni tudi, da je bil povsem brez greha (Heb 4,15).
»Postal [je] višji od nebes«, kar pomeni, da je bil povišan nad vse, kar obstaja, in je eno z Bogom. V Psalmih piše, da je Bog »vzdignjen nad nebesa« (Ps 57,6.12; Ps 108,6; Ps 57,5.11 chr; Ps 108,5 chr).
Jezus je bil popolnoma človek, toda ne grešnik kakor mi (Heb 2,14-16; Heb 4,15). Je popoln, a ne le zato, ker nikdar ni grešil, temveč ker ga greh ni pokvaril, kakor je nas.
Bil je popolnoma človek, zato je postal naš zgled. Pokazal nam je, kako preteči dirko življenja (Heb 12,1-4). Naša naloga je posnemati njegov zgled (1 Pt 2,21-23). Je »svet, nedolžen, brez zla; tak, ki je ločen od grešnikov« (Heb 7,26), zato je naš Zveličar; tudi mi lahko odsevamo njegov značaj.
`Čeprav je bil Jezus človek kakor mi, se nikdar ni pregrešil. Kako lahko dojamemo to čudovito misel? Pomisli, kako svet je Jezus! Zakaj nam obljuba o njegovi svetosti, ki nam je pripisana po veri, zagotavlja, da smo res zveličani? ` | 104.45 | 441 | 0.749162 | slv_Latn | 1 |
9885cd98939b4a7c4378754a28b37dec8f5378f8 | 31,824 | md | Markdown | p/psych-pv/index.md | nnworkspace/gesetze | 1d9a25fdfdd9468952f739736066c1ef76069051 | [
"Unlicense"
] | null | null | null | p/psych-pv/index.md | nnworkspace/gesetze | 1d9a25fdfdd9468952f739736066c1ef76069051 | [
"Unlicense"
] | null | null | null | p/psych-pv/index.md | nnworkspace/gesetze | 1d9a25fdfdd9468952f739736066c1ef76069051 | [
"Unlicense"
] | null | null | null | ---
Title: Verordnung über Maßstäbe und Grundsätze für den Personalbedarf in der stationären
Psychiatrie
jurabk: Psych-PV
layout: default
origslug: psych-pv
slug: psych-pv
---
# Verordnung über Maßstäbe und Grundsätze für den Personalbedarf in der stationären Psychiatrie (Psych-PV)
Ausfertigungsdatum
: 1990-12-18
Fundstelle
: BGBl I: 1990, 2930
Geändert durch
: Art. 4 V v. 26.9.1994 I 2750
V aufgeh. durch
: Art. 7 G v. 21.7.2012 I 1613 mWv 1.1.2017
## Eingangsformel
Auf Grund des § 16 Satz 1 in Verbindung mit § 19 Abs. 2 des
Krankenhausfinanzierungsgesetzes in der Fassung der Bekanntmachung vom
23\. Dezember 1985 (BGBl. 1986 I S. 33) verordnet die Bundesregierung:
## Erster Abschnitt - Allgemeine Vorschriften
### § 1 Anwendungsbereich
(1) Diese Verordnung regelt die Maßstäbe und Grundsätze zur Ermittlung
des Personalbedarfs für Ärzte, Krankenpflegepersonal und sonstiges
therapeutisches Fachpersonal in psychiatrischen Einrichtungen für
Erwachsene sowie für Kinder und Jugendliche mit dem Ziel, eine
ausreichende, zweckmäßige und wirtschaftliche stationäre oder
teilstationäre Behandlung der Patienten zu gewährleisten, die einer
Krankenhausbehandlung im Sinne des § 39 Abs. 1 des Fünften Buches
Sozialgesetzbuch bedürfen.
(2) Psychiatrische Einrichtungen im Sinne dieser Verordnung sind
1. psychiatrische Krankenhäuser,
2. selbständige, gebietsärztlich geleitete psychiatrische Abteilungen an
Allgemeinkrankenhäusern,
soweit auf sie die Pflegesatzvorschriften des
Krankenhausfinanzierungsgesetzes und die Bundespflegesatzverordnung
Anwendung finden.
### § 2 Pflegesatzvereinbarung
(1) Die in § 18 Abs. 2 des Krankenhausfinanzierungsgesetzes genannten
Parteien der Pflegesatzvereinbarung (Vertragsparteien) haben bei der
Vereinbarung des Budgets und der Pflegesätze nach dem
Krankenhausfinanzierungsgesetz und der Bundespflegesatzverordnung für
die Personalbemessung die Maßstäbe und Grundsätze dieser Verordnung
zugrunde zu legen.
(2) Die sonstigen Vorschriften der Bundespflegesatzverordnung für die
Vereinbarung des Budgets und der Pflegesätze bleiben unberührt.
### § 3 Grundsätze
(1) Für die Personalbemessung für den Regeldienst der psychiatrischen
Einrichtungen gilt folgendes Verfahren:
1. Patienten, die einer Krankenhausbehandlung bedürfen, werden bestimmten
Behandlungsbereichen zugeordnet (§§ 4 und 8).
2. Für jeden Behandlungsbereich und für jede Berufsgruppe wird eine
Arbeitszeit in Minuten (Minutenwert) je Patient und Woche vorgegeben
(§ 5 Abs. 1 und § 9 Abs. 1). Die Minutenwerte sind unter
Berücksichtigung des Versorgungsauftrags angemessen zu verringern,
wenn eine Einrichtung keine Versorgungsverpflichtung hat.
3. Die Minutenwerte werden in Personalstellen umgerechnet (§ 6 und § 9
Abs. 3).
4. Die Zahl der Personalstellen für Leitungskräfte wird nach der Zahl der
vereinbarten Stellen für Ärzte und Diplom-Psychologen errechnet (§ 7
und § 9 Abs. 3).
(2) Der Regeldienst im Sinne des Absatzes 1 umfaßt alle
diagnostischen, therapeutischen und pflegerischen Tätigkeiten für den
stationären Bereich mit Ausnahme von Nachtdienst, Bereitschaftsdienst
außerhalb des Regeldienstes, ärztlicher Rufbereitschaft und ärztlichem
Konsiliardienst sowie von Tätigkeiten in Nachtkliniken. Die
Personalbemessung für die nicht vom Regeldienst umfaßten Tätigkeiten
ist von den Vertragsparteien unter Berücksichtigung der besonderen
Verhältnisse der Einrichtung und mit dem Ziel einer ausreichenden,
zweckmäßigen und wirtschaftlichen Behandlung der Patienten in der
Pflegesatzvereinbarung zusätzlich zu vereinbaren.
(3) Die Minutenwerte nach Absatz 1 Nr. 2 gelten beim
Krankenpflegepersonal für einen Regeldienst von täglich 14 Stunden
zuzüglich einer halben Stunde Übergabezeit mit dem Personal des
Nachtdienstes sowie bei einer gleichbleibenden Personalbesetzung im
Pflegedienst an Wochenenden und Feiertagen. Bei Tageskliniken gelten
die Minutenwerte in der Erwachsenenpsychiatrie für einen Regeldienst
von 8 Stunden, in der Kinder- und Jugendpsychiatrie von 10 Stunden;
die Minutenwerte gelten für fünf Wochentage.
(4) Die Zahl der Personalstellen nach Absatz 1 Nr. 3 kann von den
Vertragsparteien abweichend vereinbart werden, wenn dies auf Grund
besonderer Verhältnisse einer Einrichtung zur Sicherung ihrer
Leistungsfähigkeit oder Wirtschaftlichkeit erforderlich oder
ausreichend ist. Die Notwendigkeit einer Abweichung ist in der
Pflegesatzvereinbarung zu begründen.
## Zweiter Abschnitt - Psychiatrische Einrichtungen für Erwachsene
### § 4 Behandlungsbereiche
(1) Zur Ermittlung des Personalbedarfs werden die Patienten, die einer
Krankenhausbehandlung bedürfen, nach Art und Schwere der Krankheit
sowie nach den Behandlungszielen und -mitteln gemäß Anlage 1 den
folgenden Behandlungsbereichen zugeordnet:
* * A
* Allgemeine Psychiatrie
* S
* Abhängigkeitskranke
* G
* Gerontopsychiatrie
* *
* * A1
* Regelbehandlung
* S1
* Regelbehandlung
* G1
* Regelbehandlung
* * A2
* Intensivbehandlung
* S2
* Intensivbehandlung
* G2
* Intensivbehandlung
* * A3
* Rehabilitative Behandlung
* S3
* Rehabilitative Behandlung einschließlich sog. Entwöhnung
* G3
* Rehabilitative Behandlung
* * A4
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* S4
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* G4
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* * A5
* Psychotherapie
* S5
* Psychotherapie
* G5
* Psychotherapie
* * A6
* Tagesklinische Behandlung
* S6
* Tagesklinische Behandlung
* G6
* Tagesklinische Behandlung
(2) Die Vertragsparteien vereinbaren die voraussichtliche,
durchschnittliche Zahl der Patienten in den einzelnen
Behandlungsbereichen auf der Grundlage von mindestens vier
Stichtagserhebungen; dabei ist die durchschnittliche Belegung der
Einrichtung mit krankenhausbehandlungsbedürftigen Patienten sowie die
Entwicklung im nächsten Pflegesatzzeitraum zu berücksichtigen.
(3) Die Stichtagserhebungen nach Absatz 2 sind jeweils am dritten
Mittwoch der Monate Januar, April, Juli und Oktober durchzuführen; die
Vertragsparteien können abweichende Vereinbarungen treffen. Die
Ergebnisse der Stichtagserhebungen hat die Einrichtung den anderen
Vertragsparteien, den in § 18 Abs. 1 Satz 2 des
Krankenhausfinanzierungsgesetzes genannten Beteiligten und der
zuständigen Landesbehörde so rechtzeitig schriftlich mitzuteilen, daß
Vorverhandlungen nach § 17 Abs. 6 der Bundespflegesatzverordnung
durchgeführt werden können.
(4) Die Vertragsparteien schließen nach § 17 Abs. 7 der
Bundespflegesatzverordnung Rahmenvereinbarungen, die
1. eine Prüfung der Zuordnung der Patienten zu den Behandlungsbereichen
durch den Medizinischen Dienst der Krankenversicherung im Krankenhaus
ermöglichen,
2. eine Prüfung ermöglichen, ob die Personalausstattung nach dieser
Verordnung in ein entsprechendes Behandlungsangebot umgesetzt wurde.
§ 19 Abs. 1 der Bundespflegesatzverordnung gilt entsprechend.
### § 5 Minutenwerte
(1) Der Personalbemessung für die nachstehenden Berufsgruppen sind je
Patient und Woche folgende Minutenwerte zugrunde zu legen:
* * Behandlungsbereiche
* Ärzte
* Krankenpflegepersonal
* Diplom-Psychologen
* Ergotherapeuten
* Bewegungstherapeuten, Krankengymnasten, Physiotherapeuten
* Sozialarbeiter, Sozialpädagogen
* *
* * A1
* 207
* 578
* 29
* 122
* 28
* 76
* * A2
* 257
* 1.118
* 12
* 117
* 29
* 74
* * A3
* 82
* 376
* 110
* 197
* 29
* 79
* * A4
* 132
* 734
* 57
* 113
* 27
* 59
* * A5
* 154
* 198
* 107
* 103
* 31
* 14
* * A6
* 114
* 51
* 83
* 176
* 17
* 67
* * S1
* 226
* 557
* 43
* 72
* 35
* 109
* * S2
* 256
* 1.142
* 55
* 51
* 34
* 153
* * S3
* 82
* 242
* 110
* 156
* 46
* 175
* * S4
* 106
* 683
* 80
* 112
* 38
* 77
* * S5
* 131
* 199
* 100
* 101
* 31
* 48
* * S6
* 115
* 40
* 81
* 154
* 16
* 101
* * G1
* 183
* 992
* 26
* 102
* 35
* 75
* * G2
* 211
* 1.221
* 0
* 78
* 40
* 51
* * G3
* 84
* 518
* 66
* 85
* 42
* 79
* * G4
* 100
* 909
* 43
* 72
* 44
* 42
* * G5
* 119
* 241
* 81
* 76
* 31
* 13
* * G6
* 115
* 94
* 83
* 167
* 26
* 68
(2) Für das Krankenpflegepersonal ist je Station und Woche zusätzlich
ein Wert von 5.000 Minuten zugrunde zu legen; umfaßt eine Station
weniger als 16 Patienten im Jahresdurchschnitt, vereinbaren die
Vertragsparteien, inwieweit dieser Minutenwert je Station zu
vermindern ist. Station im Sinne des Satzes 1 ist eine eigenständige
bauliche und organisatorische Einheit, die alle für einen
Stationsbetrieb erforderlichen Funktionen umfaßt.
### § 6 Ermittlung der Personalstellen
(1) Die Personalstellen für eine psychiatrische Einrichtung werden
ermittelt, indem für jede Berufsgruppe die Minutenwerte der
Behandlungsbereiche nach § 5 Abs. 1 mit der entsprechenden
durchschnittlichen Zahl der Patienten nach § 4 Abs. 2 vervielfacht
werden. Beim Krankenpflegepersonal ist der Minutenwert je Station nach
§ 5 Abs. 2 mit der Anzahl der Stationen zu vervielfachen und
hinzuzurechnen. Die sich ergebende Gesamtstundenzahl je Berufsgruppe
ist in Personalstellen umzurechnen, indem sie durch die Zahl der
Arbeitsstunden geteilt wird, die unter Berücksichtigung der
tariflichen Arbeitszeit oder entsprechender Arbeitszeitregelungen
sowie der zu erwartenden Ausfallzeiten durchschnittlich je Mitarbeiter
zu leisten sind. Die Höhe der Ausfallzeiten wird für die einzelnen
Berufsgruppen von den Vertragsparteien unter Zugrundelegung einer
angemessenen Arbeitsorganisation vereinbart.
(2) Die Personalstellen für eine Berufsgruppe nach Absatz 1 können
entsprechend dem therapeutischen Konzept der psychiatrischen
Einrichtung auch mit Fachkräften der anderen Berufsgruppen oder
anderer, in § 5 Abs. 1 nicht genannter Berufe, besetzt werden, soweit
das der Verordnung zugrundeliegende therapeutische Konzept erfüllt
wird und die nach dieser Verordnung vereinbarten Personalkosten nicht
überschritten werden.
### § 7 Leitungskräfte
(1) Die Personalbemessung für leitende Ärzte richtet sich nach der
Zahl der nach § 6 ermittelten und von den Vertragsparteien
vereinbarten Stellen für Ärzte und Diplom-Psychologen; diese sind im
Verhältnis 8 zu 1 in ganze oder anteilige Stellen für leitende Ärzte
umzurechnen.
(2) Die Zahl der leitenden Krankenpflegekräfte entspricht der
errechneten Zahl der leitenden Ärzte nach Absatz 1.
(3) § 3 Abs. 4 gilt entsprechend.
## Dritter Abschnitt - Einrichtungen für die Kinder- und Jugendpsychiatrie
### § 8 Behandlungsbereiche
Zur Ermittlung des Personalbedarfs werden die Patienten, die einer
Krankenhausbehandlung bedürfen, nach Art und Schwere der Krankheit
sowie nach den Behandlungszielen und -mitteln gemäß Anlage 2 den
folgenden Behandlungsbereichen zugeordnet:
*
KJ 1 Kinderpsychiatrische Regel- und Intensivbehandlung
KJ 2 Jugendpsychiatrische Regelbehandlung
KJ 3 Jugendpsychiatrische Intensivbehandlung
KJ 4 Rehabilitative Behandlung
KJ 5 Langdauernde Behandlung Schwer- und Mehrfachkranker
KJ 6 Eltern-Kind-Behandlung
KJ 7 Tagesklinische Behandlung.
§ 4 Abs. 2 bis 4 gilt entsprechend.
### § 9 Minutenwerte
(1) Der Personalbemessung für die nachstehenden Berufsgruppen sind je
Patient und Woche folgende Minutenwerte zugrunde zu legen:
* * Behandlungsbereiche
* Ärzte
* Krankenpflegepersonal, Erziehungsdienst
* Diplom-Psychologen
* Ergotherapeuten
* Bewegungstherapeuten, Krankengymnasten, Physiotherapeuten
* Sozialarbeiter, Sozialpädagogen Heilpädagogen
* Sprachheiltherapeuten, Logopäden
* *
* * KJ 1
* 257
* 1.419
* 183
* 137
* 82
* 157
* 33
* * KJ 2
* 251
* 1.285
* 180
* 166
* 74
* 122
* 8
* * KJ 3
* 321
* 1.876
* 163
* 59
* 21
* 73
* 0
* * KJ 4
* 105
* 532
* 80
* 292
* 18
* 91
* 8
* * KJ 5
* 144
* 1.541
* 104
* 211
* 96
* 92
* 21
* * KJ 6
* 264
* 305
* 179
* 110
* 76
* 148
* 25
* * KJ 7
* 247
* 261
* 182
* 128
* 63
* 133
* 26
(2) Für das Krankenpflegepersonal ist je Station und Woche zusätzlich
ein Wert von 5.000 Minuten zugrunde zu legen; umfaßt eine Station
weniger als 9 Patienten im Jahresdurchschnitt, treffen die
Vertragsparteien eine Vereinbarung darüber, inwieweit dieser
Minutenwert je Station zu vermindern ist. § 5 Abs. 2 Satz 2 gilt
entsprechend.
(3) Für die Ermittlung der Personalstellen gilt § 6, für die
Personalbemessung für leitende Ärzte sowie für Leitungskräfte des
Pflege- und Erziehungsdienstes § 7 entsprechend.
## Vierter Abschnitt - Schlußvorschriften
### § 10 Inkrafttreten und Übergangsvorschriften
(1) Diese Verordnung tritt am 1. Januar 1991 in Kraft.
(2) Die Personalbemessung nach dieser Verordnung ist erstmals bei der
auf den 1. Januar 1991 folgenden Pflegesatzverhandlung zugrunde zu
legen. Auf Verlangen einer Vertragspartei ist das Budget für einen im
Jahre 1991 noch laufenden Pflegesatzzeitraum neu zu vereinbaren. Dabei
ist eine nach dieser Verordnung höhere Personalbemessung nur für die
Restlaufzeit des Pflegesatzzeitraums zugrunde zu legen. Für diesen
Zeitraum sind Pflegesätze neu zu vereinbaren. Bei der Neuvereinbarung
nach Satz 1 und 2 reichen abweichend von § 4 Abs. 3 Satz 1 vier
Stichtagserhebungen in mindestens zwei Monaten aus.
(3) Die Personalbemessung nach dieser Verordnung wird in einem
Übergangszeitraum bis zum 31. Dezember 1995 eingeführt. Soweit sie
noch nicht erreicht ist, vereinbaren die Vertragsparteien im Rahmen
jeder Pflegesatzvereinbarung eine jährliche, stufenweise Anpassung,
bei der die Abweichung zwischen der in der letzten
Pflegesatzvereinbarung vereinbarten Personalbesetzung und der
Personalbemessung nach dieser Verordnung auf den verbleibenden
Übergangszeitraum verteilt wird. Werden im Übergangszeitraum
Krankenhausbetten abgebaut, wird die tatsächliche Personalbesetzung
nicht verringert, soweit die Personalbemessung nach dieser Verordnung
noch nicht erreicht ist.
(4) Werden die nach Absatz 3 zusätzlich vereinbarten Personalstellen
während des Pflegesatzzeitraums ganz oder teilweise nicht besetzt und
sind dem Krankenhaus deshalb geringere Personalkosten als
vorauskalkuliert entstanden, sind Budgetanteile in Höhe der nicht
entstandenen Personalkosten zu erstatten. Der Erstattungsbetrag ist
über das Budget des folgenden Pflegesatzzeitraums zu verrechnen.
### Schlußformel
Der Bundesrat hat zugestimmt.
### Anlage 1 (zu § 4 Abs. 1)
* * Psychiatrische Einrichtungen für Erwachsene
**Inhaltliche Beschreibung der aufgabentypischen Schwerpunkte**
* *
* * 1. Allgemeine Psychiatrie
* *
* * Behandlungsbereiche
* Kranke
* Behandlungsziele
* Behandlungsmittel
* *
* * A1
* Regelbehandlung
* Akut psychisch Kranke
* Erkennen und Heilen, psychische und soziale Stabilisierung
* Diagnostik, Psychopharmakotherapie, Psychotherapie, Soziotherapie 1),
Ergotherapie
* * A2
* Intensivbehandlung
* Psychisch Kranke, manifest selbstgefährdet, fremdgefährdend, somatisch
vitalgefährdet
* Erkennen und Heilen, Risikoabschätzung, Krisenbewältigung,
Stabilisierung als Voraussetzung für weitere therapeutische Maßnahmen
* Diagnostik, Erst- und Notfallbehandlung, einzelbezogene
Intensivbehandlung einschließlich Psychopharmakotherapie
* * A3
* Rehabilitative Behandlung
* Für die rehabilitative Behandlung ausreichend stabilisierte Kranke mit
psychischen und sozialen Krankheitsfolgen
* Bessern, Lindern der Krankheitsfolgen - mit diesen leben lernen,
Enthospitalisierung, Wiedereingliederung
* Mehrdimensionale rehabilitative Behandlung; Psychotherapie zur
Bewältigung der Krankheitsfolgen, Soziotherapie, Ergotherapie
* * A4
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* Psychisch Kranke mit anhaltend akuten Symptomen und/oder erheblichen
psychischen und sozialen Krankheitsfolgen
* Bessern, Lindern, Verhüten von Verschlimmerung, Stabilisierung als
Voraussetzung für weitere therapeutische Maßnahmen
* Medizinische Grundversorgung mit hohem ärztlichen und pflegerischen
Aufwand, mehrdimensionale Einzelbehandlung, Gestaltung des
therapeutischen Milieus in Kleingruppen
* * A5
* Psychotherapie
* Kranke mit schweren Neurosen oder Persönlichkeitsstörungen, die
stationär psychotherapeutisch behandelt werden müssen
* Erkennen und Heilen, Krisenbewältigung, Befähigung zur ambulanten
psychotherapeutischen Behandlung
* Komplexe psychotherapeutische Behandlung
* * A6
* Tagesklinische Behandlung 2)
* Psychisch Kranke, nicht oder nicht mehr vollstationär
behandlungsbedürftig
* Erkennen und Heilen, psychische und soziale Stabilisierung,
Wiedereingliederung, Krisenbewältigung
* Diagnostik, Psychopharmakotherapie, Psychotherapie, Soziotherapie,
Ergotherapie
* *
1) Als Soziotherapie werden in diesem Zusammenhang alle
handlungsorientierten Einflußnahmen auf die Wechselwirkungen zwischen
der Erkrankung des Patienten und seinem sozialen Umfeld verstanden.
2) Integrierte tages- oder nachtklinische Behandlung soll im Einzelfall
von jeder Station aus möglich sein. Der Patient erhält einen
teilstationären Status auf der Station, die ihn auch vollstationär
behandeln würde.
* * 2. Abhängigkeitskranke
* * Behandlungsbereiche
* Kranke
* Behandlungsziele
* Behandlungsmittel
* *
* * S1
* Regelbehandlung
* Alkohol- und Medikamentenabhängige
* Erkennen der Abhängigkeit, Entgiftung, Befähigung zur ambulanten
Behandlung oder zur Entwöhnung, soziale Stabilisierung
* Psychiatrische, neurologische und allgemeinmedizinische Diagnostik und
Behandlung, Motivation zur Inanspruchnahme suchtspezifischer Hilfen
* * S2
* IntensivBehandlung
* Alkohol-, Medikamenten- und Drogenabhängige, manifest selbstgefährdet,
fremdgefährdend, somatisch vitalgefährdet
* Erkennen und Heilen, Risikoabschätzung, Krisenbewältigung, Entgiftung,
Delirbehandlung, Stabilisierung als Voraussetzung für weitere
therapeutische Maßnahmen
* Psychiatrische, neurologische und allgemeinmedizinische Diagnostik,
intensive medikamentöse Behandlung, Motivation zur Inanspruchnahme
suchtspezifischer Hilfen
* * S3
* Rehabilitative Behandlung einschließlich sog. Entwöhnung
* Ausreichend entgiftete, motivierte und belastbare Alkohol- und
Medikamentenabhängige oder inzwischen zur rehabilitativen Behandlung
befähigte Schwer- und Mehrfachkranke
* Abstinenz, Befähigung zu ambulanter Behandlung, Integration in
Selbsthilfegruppen, Wiedereingliederung
* Suchtspezifische mehrdimensionale Behandlung
* * S4
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* Alkohol- und Medikamentenabhängige mit anhaltenden psychiatrischen,
neurologischen und internistischen Begleit- und Folgeerkrankungen,
erhebliche Rückfallgefahr, rehabilitative Behandlung oder Entlassung
in komplementäre Einrichtungen nicht möglich
* Bessern, Lindern, Verhüten von Verschlimmerung, Befähigung zur
rehabilitativen Behandlung, Eingliederung in komplementäre
Einrichtungen und ambulante Behandlung
* Medizinische Grundversorgung mit hohem ärztlichen und pflegerischen
Aufwand; suchtspezifische soziotherapeutisch mehrdimensionale
Behandlung
* * S5
* Psychotherapie
* Alkohol- und Medikamtenabhängige mit schweren Neurosen oder
Persönlichkeitsstörungen, erhebliche Rückfallgefahr
* Erkennen der Abhängigkeit, Abstinenz, Befähigung zur ambulanten
psychotherapeutischen Behandlung, Krisenbewältigung
* Psychotherapeutische Behandlung unter Berücksichtigung
suchtspezifischer Gesichtspunkte
* * S6
* Tagesklinische Behandlung 2)
* Alkohol- und Medikamentenabhängige, entgiftet, nicht oder nicht mehr
vollstationär behandlungsbedürftig
* Erkennen der Abhängigkeit, Abstinenz, Befähigung zur ambulanten
Behandlung, Integration in Selbsthilfegruppe, Krisenbewältigung,
Vermeidung oder Verkürzung vollstationärer Behandlung
* Diagnostik, Psychotherapie, Soziotherapie 1), Ergotherapie, Motivation
zur Inanspruchnahme suchtspezifischer Hilfen
* *
1) Als Soziotherapie werden in diesem Zusammenhang alle
handlungsorientierten Einflußnahmen auf die Wechselwirkungen zwischen
der Erkrankung des Patienten und seinem sozialen Umfeld verstanden.
2) Integrierte tages- oder nachtklinische Behandlung soll im Einzelfall
von jeder Station aus möglich sein. Der Patient erhält einen
teilstationären Status auf der Station, die ihn auch vollstationär
behandeln würde.
* * 3. Gerontopsychiatrie (Patienten in der Regel über 65 Jahre alt)
* * Behandlungsbereiche
* Kranke
* Behandlungsziele
* Behandlungsmittel
* *
* * G1
* Regelbehandlung
* Akut psychisch Kranke im höheren Lebensalter (meist Multimorbidität)
* Erkennen und Heilen, Bessern, psychische, somatische und soziale
Stabilisierung, vorwiegend Entlassung nach Hause
* Psychiatrische, neurologische, allgemeinmedizinische und soziale
Diagnostik und Therapie. Medizinische Grundversorgung; gegebenenfalls
Einbeziehung weiterer gebietsärztlicher Leistungen
* * G2
* Intensivbehandlung
* Psychisch Kranke im höheren Lebensalter, manifest selbstgefährdet,
fremdgefährdend und somatisch vitalgefährdet
* Erkennen und Heilen, Risikoabschätzung, Krisenbewältigung, Bessern der
vital bedrohlichen Störungen, Stabilisierung als Voraussetzung für
weitere therapeutische Maßnahmen
* Psychiatrische und somatische Diagnostik. Erst- und Notfallbehandlung,
einzelbezogene Intensivbehandlung einschließlich medikamentöser
Therapie
* * G3
* Rehabilitative Behandlung
* Ausreichend stabilisierte psychisch Kranke im höheren Lebensalter mit
psychischen, somatischen und sozialen Einbußen
* Bessern und Lindern, mit Krankheit und Alter leben lernen,
Wiedereingliederung zu Hause oder in Einrichtungen der Altenhilfe
* Training zum Ausgleich von Einbußen lebenspraktischer Fertigkeiten,
Orientierungs- und Gedächtnistraining, Soziotherapie 1),
Psychotherapie
* * G4
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* Psychisch Kranke im höheren Lebensalter mit anhaltenden akuten
Symptomen und erheblichen psychischen, somatischen und sozialen
Einbußen
* Bessern und Lindern, Verhüten von Verschlimmerung, Stabilisierung als
Voraussetzung für weitere therapeutische Maßnahmen oder Entlassung in
häusliche oder Heimpflege
* Medizinische Grundversorgung mit kontinuierlich hohem ärztlichen und
pflegerischen Aufwand, gegebenenfalls ergänzt durch Einbeziehung
weiterer gebietsärztlicher Leistungen, Gestaltung des therapeutischen
Milieus
* * G5
* Psychotherapie
* Kranke im höheren Lebensalter mit schweren Neurosen oder
Persönlichkeitsstörungen, die stationär psychotherapeutisch behandelt
werden müssen
* Erkennen von Krankheit, Krisenbewältigung, Befähigung zur ambulanten
psychotherapeutischen Behandlung
* Komplexe psychotherapeutische Behandlung
* * G6
* Tagesklinische Behandlung 2)
* Psychisch Kranke im höheren Lebensalter, nicht oder nicht mehr
vollstationär behandlungsbedürftig
* Erkennen von Krankheit, Bessern, psychische, somatische und soziale
Stabilisierung, Krisenbewältigung, Wiedereingliederung, Vermeidung
oder Verkürzung vollstationärer Behandlung
* Psychiatrische, neurologische und allgemeinmedizinische Diagnostik und
Therapie einschließlich Pharmakotherapie. Training zum Ausgleich von
Einbußen lebenspraktischer Fertigkeiten, Orientierungs- und
Gedächtnistraining, Soziotherapie, Psychotherapie
* *
* *
* *
1) Als Soziotherapie werden in diesem Zusammenhang alle
handlungsorientierten Einflußnahmen auf die Wechselwirkungen zwischen
der Erkrankung des Patienten und seinem sozialen Umfeld verstanden.
2) Integrierte tages- oder nachtklinische Behandlung soll im Einzelfall
von jeder Station aus möglich sein. Der Patient erhält einen
teilstationären Status auf der Station, die ihn auch vollstationär
behandeln würde.
### Anlage 2 (zu § 8)
## Einrichtungen für Kinder- und Jugendpsychiatrie Inhaltliche
Beschreibung der aufgabentypischen Schwerpunkte
* * Behandlungsbereiche
* Kranke
* Behandlungsziele
* Behandlungsmittel
* *
* * KJ1
* Kinderpsychiatrische Regel- und Intensivbehandlung (bis 14.
Lebensjahr)
* Vorschul- und Schulkinder mit akuten psychischen, psychosomatischen
und/ oder neuropsychiatrischen Erkrankungen, mit u.a. selbst- und
fremdgefährdendem Verhalten, schweren Verhaltensstörungen,
Teilleistungsstörungen sowie Entwicklungsstörungen der kognitiven,
emotionalen, psychosozialen Kompetenz
* Psychosoziale Integration in Familie, Heim, Kindergarten, Schule u.a.;
Ausgleich von Entwicklungs- und Funktionsdefiziten; Befähigung zur
ambulanten Behandlung
* Diagnostik und medizinische Grundversorgung, heilpädagogische
Behandlung, Elternberatung, Familientherapie, Einzel- und
Gruppenpsychotherapie, funktionelle Therapien, Entwicklungstherapie
* * KJ2
* Jugendpsychiatrische Regelbehandlung
* Jugendliche und Heranwachsende mit akuten psychischen,
psychosomatischen und/ oder neuropsychiatrischen Erkrankungen, mit
u.a. schweren Verhaltensstörungen und Entwicklungsstörungen der
kognitiven, emotionalen, psychosozialen Kompetenz
* Psychosoziale Integration; Bewältigung der gestörten alterstypischen
Ablösungs- und Verselbständigungsprozesse; Befähigung zur ambulanten
Behandlung
* Diagnostik und medizinische Grundversorgung; Milieutherapie;
Elternberatung; Familientherapie; Einzel- und Gruppenpsychotherapie;
Beschäftigungstherapie; Arbeitstherapie
* * KJ3
* Jugendpsychiatrische Intensivbehandlung
* Psychisch kranke Jugendliche und psychosozial retardierte
Heranwachsende, manifest selbstgefährdet, vital gefährdet,
fremdgefährdend, hochgradig erregt
* Krisenbewältigung; Befähigung zur jugendpsychiatrischen
Regelbehandlung (KJ2) oder zur ambulanten Behandlung
* Diagnostik und medizinische Grundversorgung; eng strukturierte
Betreuung (evtl. freiheitsentziehende Maßnahmen); Krisenbewältigung;
Elternberatung; Familientherapie; Pharmakotherapie; Einzeltherapie;
überwiegend stationsgebundene Therapieangebote
* * KJ4
* Rehabilitative Behandlung
* Längerfristig psychisch kranke Kinder, Jugendliche, Heranwachsende mit
krankheitsbedingten komplexen kognitiven, emotionalen und
psychosozialen Defiziten
* Entlassung in Familie, Wohngemeinschaft, Heim o.ä. schulische oder
berufliche Eingliederung
* Medizinische Grundversorgung Milieutherapie; Rehabilitationsprogramm
mit speziellen Trainingsmaßnahmen; Arbeitstherapie, Planung und
Durchführung von Maßnahmen zur Eingliederung; Beratung von
Bezugspersonen; Familientherapie; Einzelpsychotherapie (evtl. nur
phasenweise)
* * KJ5
* Langdauernde Behandlung Schwer- und Mehrfachkranker
* Langfristig schwer psychisch kranke und mehrfach behinderte Kinder,
Jugendliche und Heranwachsende, selbstgefährdet, fremdgefährdend,
erregt, desorientiert
* Verhaltenskorrektur und Vermittlung grundlegender lebenspraktischer
und sozialer Fertigkeiten als Voraussetzung für weitere therapeutische
Maßnahmen (evtl. Aufgabenbereich KJ4)
* Medizinische Grundversorgung; eng strukturierte Betreuung (evtl.
freiheitsentziehende Maßnahmen); Verlaufsdiagnostik; heilpädagogische
Gruppenbehandlung; Elternberatung; Familientherapie; funktionelle
Therapie
* * KJ6
* Eltern-Kind-Behandlung (gemeinsame Aufnahme von Kind und Bezugsperson)
* Kinder mit psychischen, psychosomatischen und neuropsychiatrischen
Erkrankungen, Kommunikationsund Interaktionsstörungen,
selbstverletzendem Verhalten
* Stärkung der elterlichen Erziehungs- und Betreuungskompetenz auf der
Basis der Entwicklungsdiagnostik; Einleitung ambulanter Behandlung
* Diagnostik und medizinische Grundversorgung; Frühtherapie;
Elternberatung; Familientherapie; spezielle Therapieprogramme für Kind
und Eltern (Erzieher) als kurzfristige Intensivmaßnahme
* * KJ7
*[^BJNR029300990BJNE001800308_001]
Tagesklinische Behandlung
* Kinder und Jugendliche mit psychischen, psychosomatischen und
neuropsychiatrischen Erkrankungen, die keiner vollstationären
Behandlung bedürfen
* Wahrung der Integration in Familie oder Heim; Verbesserung der
psychosozialen Kompetenz; Befähigung zu Schulbesuch bzw. Fortsetzung
der beruflichen Ausbildung
* Diagnostik und medizinische Grundversorgung; heilpädagogische
Behandlung; Elternberatung; Familientherapie; Einzel- und
Gruppenpsychotherapie; funktionelle Therapien; Entwicklungstherapie
Integrierte Tages- oder Nachtklinikbehandlung soll im Einzelfall von
jeder Station aus möglich sein. Der Patient erhält teilstationären
Status auf der Station, die ihn auch vollstationär behandeln würde.
[^BJNR029300990BJNE001800308_001]:
| 23.195335 | 106 | 0.720211 | deu_Latn | 0.998004 |
9885ef91c9f73938446ea83a8062d2ecab88ff9a | 2,397 | md | Markdown | README.md | jpmonette/serverless-slack-bot | 978428ac09e3c169348c4b1c0f2ec50ebe90ccba | [
"MIT"
] | 2 | 2018-04-16T20:15:23.000Z | 2020-03-14T02:52:30.000Z | README.md | jpmonette/serverless-slack-bot | 978428ac09e3c169348c4b1c0f2ec50ebe90ccba | [
"MIT"
] | null | null | null | README.md | jpmonette/serverless-slack-bot | 978428ac09e3c169348c4b1c0f2ec50ebe90ccba | [
"MIT"
] | 1 | 2020-03-14T02:53:28.000Z | 2020-03-14T02:53:28.000Z | 
# Serverless Slack Bot
> Learn how to build your own serverless Slack bot using AWS Lambda and API Gateway, integrated with Salesforce
>
> _Read the [blog article here](http://mavens.github.io/2018/03/06/build-a-serverless-slack-bot-using-aws-lambda-and-salesforce)._
## Installation
```bash
$ git clone git@github.com:jpmonette/serverless-slack-bot.git
$ cd serverless-slack-bot
$ yarn
$ sed -i -e 's/\[my-api-token\]/insert-your-slack-token-here/g' up.json
$ up
```
> **NOTE**: Make sure you replace `insert-your-slack-token-here` with your own Slack token
## Features
* Easily deployed to the AWS cloud
* Cost-effective: Lambda function only running on request
## Requirements
* NodeJS
* TypeScript
* yarn
* up
* An AWS Account
* A Slack workspace
## More Information
* [Build a serverless Slack bot using AWS Lambda and Salesforce](http://mavens.github.io/2018/03/06/build-a-serverless-slack-bot-using-aws-lambda-and-salesforce) on Mavens Developer Blog
* [Getting Started with the Slack API](https://api.slack.com/getting-started)
* [Mavens Developer Blog](http://mavens.github.io/)
* Follow [@jpmonette](https://twitter.com/jpmonette) on Twitter for updates
* Read my personal blog [Blogue de Jean-Philippe Monette](http://blogue.jpmonette.net/) to learn more about what I do!
## License
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. | 48.918367 | 460 | 0.773884 | eng_Latn | 0.49979 |
9886c539d4ba62455854eb94c36b018d3fe7880d | 15,872 | md | Markdown | archives/2021-08-31.md | Xtaooo/zhihu-trending-hot-questions | 7bbbbca4ac0443d4dba6f26b587000cac8e45cda | [
"MIT"
] | null | null | null | archives/2021-08-31.md | Xtaooo/zhihu-trending-hot-questions | 7bbbbca4ac0443d4dba6f26b587000cac8e45cda | [
"MIT"
] | null | null | null | archives/2021-08-31.md | Xtaooo/zhihu-trending-hot-questions | 7bbbbca4ac0443d4dba6f26b587000cac8e45cda | [
"MIT"
] | null | null | null | # 2021-08-31
共 207 条
<!-- BEGIN -->
<!-- 最后更新时间 Tue Aug 31 2021 23:09:48 GMT+0800 (China Standard Time) -->
1. [如何看待西安地铁 3 号线女乘客被保安拖拽下车，衣不蔽体？事件真相如何？](https://www.zhihu.com/question/483748925)
1. [塔利班称中国是「伟大的邻国」，誓与其紧密合作，释放了怎样的信号？](https://www.zhihu.com/question/483696594)
1. [如何评价《王者荣耀》联赛所有未满 18 岁职业选手全部原地退役？](https://www.zhihu.com/question/483667578)
1. [国家出手整顿网络游戏，未成年人一周只能玩 3 小时，网易股价大跌，如何看待游戏市场前景？](https://www.zhihu.com/question/483605644)
1. [如何看待字节跳动取消大小周后的第一个发薪日，薪资普降 17% ？公司需要补偿吗？](https://www.zhihu.com/question/483760968)
1. [住建部称「我国已建成世界上最大住房保障体系」，有哪些信息值得关注？你目前的住房条件如何？](https://www.zhihu.com/question/483762801)
1. [西安 17 岁男生挥霍 30 万元在「女仆桌游」等消费项目上，有哪些问题值得深思？](https://www.zhihu.com/question/483074126)
1. [如何看待丹麦宣布不再视新冠为一种危害社会的疾病?](https://www.zhihu.com/question/483504786)
1. [网传阿里将解雇 10 名外泄内网文章员工，事件真实性如何？](https://www.zhihu.com/question/483577251)
1. [认识一个月的男生，刚开始各种撩我，突然停止了。为什么？我该怎么办？](https://www.zhihu.com/question/346509006)
1. [6 少年 30 秒洗劫小米之家，警方表示 6 人均为未成年，已全部到案，他们将承担哪些法律责任？](https://www.zhihu.com/question/483685540)
1. [如何看待陈德旺教授发文《Nature 能发一作论文的「学术新星」当公务员实在可惜》？](https://www.zhihu.com/question/483632005)
1. [美国国务卿宣布悬赏 500 万美元通缉一涉嫌「跨国贩毒」中国公民，外交部要求立即撤销，透露了哪些信号？](https://www.zhihu.com/question/483788338)
1. [台州无名女尸案凶手系死者丈夫，杀害妻子并抛尸窨井，还有哪些信息值得关注？](https://www.zhihu.com/question/483736591)
1. [《扫黑风暴》黄希叫贺芸小姨，为什么会不认识孙兴呢？](https://www.zhihu.com/question/482830951)
1. [如何看待网友爆料腾讯视频海外版《扫黑风暴》无超前点播？这一行为是否涉嫌价格歧视？](https://www.zhihu.com/question/483704350)
1. [如何看待美国总统拜登在会见以色列总理纳夫塔利·贝内特时打瞌睡？这对于美国的国际形象有哪些影响？](https://www.zhihu.com/question/483304444)
1. [如何看待 2021 四大涨薪？](https://www.zhihu.com/question/466496339)
1. [林志炫唱功那么厉害，为什么成不了天王级的巨星呢？](https://www.zhihu.com/question/447399493)
1. [作为公职人员，看《扫黑风暴》时，你在想些什么？](https://www.zhihu.com/question/481464194)
1. [山东出现 1 例炭疽死亡病例，目前情况如何？牛羊肉还能放心购买食用吗？](https://www.zhihu.com/question/483772302)
1. [为什么现在很多工厂招不到工人？](https://www.zhihu.com/question/451525434)
1. [腾讯声明放弃音乐版权独家授权权利，对行业有哪些影响?](https://www.zhihu.com/question/483830823)
1. [购买 iPhone 13 是选择首发，还是等双十一？](https://www.zhihu.com/question/471858212)
1. [如何看待男子赌博 6 小时花光 100 万元员工工资，该男子将承担哪些法律责任？](https://www.zhihu.com/question/483760293)
1. [iPhone 13 9 月 17 日开售，对此你有哪些期待？](https://www.zhihu.com/question/482661196)
1. [长得好看的女生有什么烦恼？](https://www.zhihu.com/question/288084011)
1. [北京中小学上课时间调整，小学不早于 8 时 20 分，中学不早于 8 时，对学生和家长将产生什么影响？](https://www.zhihu.com/question/483690595)
1. [军迷们如何评价韩国电影《铁雨》？](https://www.zhihu.com/question/265915321)
1. [上海市消保委称「薇娅带货的低脂全麦欧包低标能量」，带货产品出问题明星需要承担哪些责任？](https://www.zhihu.com/question/483597494)
1. [你宁愿在一线城市头破血流，还是落叶归根？](https://www.zhihu.com/question/477385681)
1. [国货中有哪些让人震惊的冷知识？](https://www.zhihu.com/question/483688392)
1. [重庆四岁男童独自在家打不开电视，谎称着火引 42 名消防员扑空，能让幼童独自在家吗？孩子撒谎如何教育？](https://www.zhihu.com/question/483192445)
1. [疯狂英语李阳否认家暴女儿，称指控严重失实，视频系「恶意剪辑」，你觉得事件后续会如何发展？](https://www.zhihu.com/question/483744223)
1. [为什么小小的昆虫进化的外形非常精密，而体型大的动物看起来没什么武器？](https://www.zhihu.com/question/375814446)
1. [中疾控专家称「武汉华南海鲜市场疫情存在冷链引入病毒可能」，说明了什么？](https://www.zhihu.com/question/483672556)
1. [中国计划到 2025 年城镇新增就业 5500 万人以上，会带来哪些影响？](https://www.zhihu.com/question/483466420)
1. [游戏上公认的佳作有哪些？](https://www.zhihu.com/question/472469837)
1. [《名侦探柯南》中有哪些惊艳台词让你记忆最深刻？](https://www.zhihu.com/question/473368527)
1. [你看过的最有触动的是哪句话？](https://www.zhihu.com/question/482530251)
1. [如何以“他说他喜欢用长剑的女子，而我只会双刀”为开头，写一个 HE 的故事？](https://www.zhihu.com/question/472496087)
1. [对于学生军训有什么可以推荐的防晒霜?](https://www.zhihu.com/question/474746500)
1. [有没有简单易做且好吃的面条类早餐？](https://www.zhihu.com/question/36499254)
1. [有哪些关于职场的书值得推荐？](https://www.zhihu.com/question/472705229)
1. [你为《阴阳师》游戏创作过哪些同人画作？](https://www.zhihu.com/question/480601256)
1. [PS5 和 XBOX Series X 入哪个比较好？](https://www.zhihu.com/question/458053521)
1. [如何开发一个App？](https://www.zhihu.com/question/22999185)
1. [有没有什么好看到让你二刷的小说吗（甜文）？](https://www.zhihu.com/question/471923921)
1. [马上要高一了，进了一个好学校但是很差的班，很想努力三年考好大学，有希望吗?](https://www.zhihu.com/question/474000806)
1. [一个人做淘宝店需要多少技能？](https://www.zhihu.com/question/21030919)
1. [腾讯要是以《王者荣耀》的世界观构建一个对标《原神》的游戏，会怎么样？](https://www.zhihu.com/question/477063095)
1. [律师称蔡徐坤专辑《迷》预售涉嫌违法，如何从法律角度解读这种预售模式？](https://www.zhihu.com/question/483657402)
1. [为什么应届生的身份这么值钱？](https://www.zhihu.com/question/296366864)
1. [如果萧炎和唐三都是女生，你愿意娶哪一个?](https://www.zhihu.com/question/478817959)
1. [晚上失眠，死活睡不着的时候，你会做什么？](https://www.zhihu.com/question/375225642)
1. [严格限制未成年人网游时间后，从心理学分析，会不会导致成年「解禁」之后更容易沉迷于网游中？](https://www.zhihu.com/question/483568009)
1. [如何看待中国人民大学报告称，人民币已超过日元和英镑成为第三大国际货币？](https://www.zhihu.com/question/474586845)
1. [如何看待「肿瘤门」事件当事医生陆巍发文：一路为医，为医不易，且行且坚守？](https://www.zhihu.com/question/483609445)
1. [为什么说银行科技岗是程序员好的就业选择？](https://www.zhihu.com/question/380468704)
1. [如何看待家长因两男孩干扰自己的孩子荡秋千，对他们进行多次掌掴？家长该不该参与孩子间的矛盾？](https://www.zhihu.com/question/483444009)
1. [《理想之城》夏明对苏筱说「有时候选择比努力重要」，你认同吗？这句话是否适用于大部分普通人？](https://www.zhihu.com/question/480047026)
1. [路特斯汽车 CEO 称其智能驾驶「未来十年之内只要拿到驾照就能跑赢 F1 冠军」，如何评价这番言论？](https://www.zhihu.com/question/483715423)
1. [北京环球度假区将于 9 月 1 日开启试运行，期间仅向受邀客人开放，你最想玩哪些项目？](https://www.zhihu.com/question/482127010)
1. [CFA到底有多难考？](https://www.zhihu.com/question/309075059)
1. [有没有什么可以送给刚成年的人的诗句？](https://www.zhihu.com/question/449204640)
1. [歼16 相比苏30 提升到底有多大？](https://www.zhihu.com/question/304611218)
1. [如何看待官方发文，网游企业仅可在周五至周日和节假日每天 20 至 21 时，向未成年人提供游戏服务？](https://www.zhihu.com/question/483556173)
1. [发SCI，审稿人意见有一条是“English should be improved”，应该怎样回复？](https://www.zhihu.com/question/395164278)
1. [如何评价aespa成员Ningning(宁艺卓)？](https://www.zhihu.com/question/450675248)
1. [2021 秋季开学在即，新学期需要准备些什么？哪些生活好物最值得推荐？](https://www.zhihu.com/question/480181613)
1. [如果你买彩票中奖22636404元，你会怎么利用这笔钱？怎么样才能保证以后衣食无忧呢？](https://www.zhihu.com/question/466900864)
1. [如何评价2021 F1 比利时大奖正赛?](https://www.zhihu.com/question/483398785)
1. [考研复习每天学到什么程度才能上岸？](https://www.zhihu.com/question/483456087)
1. [官方规定网络游戏企业仅可在周五周六周日和法定节假日20-21时向未成年人提供1小时服务，将有何影响？](https://www.zhihu.com/question/483555771)
1. [如何评价潘粤明、张雨绮、姜超主演的电视剧《云南虫谷》？](https://www.zhihu.com/question/483298881)
1. [为什么女朋友化妆可以花掉三四个小时?](https://www.zhihu.com/question/460620809)
1. [研究生期间你懂得了什么？](https://www.zhihu.com/question/465849794)
1. [怎样全面护理新生儿的皮肤问题？](https://www.zhihu.com/question/482958428)
1. [《这！就是灌篮》第四季第一期杨政、曹芳、白晶战胜 CBA 三人组，这是什么水平？](https://www.zhihu.com/question/482669788)
1. [如果我们作为智能生物不是猿进化的，而是章鱼，那会怎样呢？](https://www.zhihu.com/question/477108760)
1. [如何看待中国学生因手机存有军训照片，在入境时被美国以「有军方背景」为由遣返？](https://www.zhihu.com/question/483577764)
1. [现在的猫粮都有黑历史，都不知道买什么猫粮了，你们在用什么猫粮?](https://www.zhihu.com/question/441500425)
1. [22 考研 8 月份才开始准备来得及吗？](https://www.zhihu.com/question/469919625)
1. [《扫黑风暴》高明远为什么放任孙兴成长为一个恶棍？](https://www.zhihu.com/question/482681907)
1. [如何评价游戏《原神》新角色演示「雷电将军：净土裁断」？](https://www.zhihu.com/question/483719392)
1. [《扫黑风暴》中的哪场戏是最难演绎的？](https://www.zhihu.com/question/481820209)
1. [美军 30 日宣布已完成从阿富汗撤出任务，你如何评价美国这长达 20 年的阿富汗战争？](https://www.zhihu.com/question/483680609)
1. [自然的表演和有技巧的表演哪个更重要？](https://www.zhihu.com/question/438214045)
1. [初中的时候一直被孤立 现在高中马上开学了还会被孤立吗?](https://www.zhihu.com/question/479733531)
1. [如何判断自己是否近视？](https://www.zhihu.com/question/316626016)
1. [有没有值得推荐的篮球？](https://www.zhihu.com/question/301964225)
1. [App 开发外包注意事项有哪些？](https://www.zhihu.com/question/21453934)
1. [如果你是莉莉，现在距离伏地魔到达你家还有一个小时，用什么方法自救？](https://www.zhihu.com/question/476300720)
1. [如何看待《饭堂周末夜》宣布完结？你觉得这个节目形式该不该被保留？](https://www.zhihu.com/question/483408476)
1. [媒体曝光部分袜子致癌染料超标，在选购衣物时，有哪些事项需要我们注意？](https://www.zhihu.com/question/481869620)
1. [你有什么好笑的《原神》的表情包吗？](https://www.zhihu.com/question/425404649)
1. [重返研一，你会怎么过？](https://www.zhihu.com/question/351675467)
1. [「双减」督导被列为 2021 年教育督导工作「一号工程」，将起到哪些作用？](https://www.zhihu.com/question/483478246)
1. [你真的相信读书改变命运么？](https://www.zhihu.com/question/478540574)
1. [有什么适合初秋穿的好看又不冷的小裙子吗？](https://www.zhihu.com/question/482800538)
1. [如何评价法院对 B 站发出诉前禁令，要求立即删除相关搬运侵权视频？释放了哪些信号？](https://www.zhihu.com/question/483590701)
1. [官方要求网游企业仅在周五到周日和法定节假日 20-21 时，向未成年人提供 1 小时服务，将有何影响？](https://www.zhihu.com/question/483554401)
1. [文旅部要求不为违法违规失德失范人员提供舞台平台，并建立健全道德评议机制，这对未来的演出市场有何影响？](https://www.zhihu.com/question/483581529)
1. [如何看待小学一二年级不进行纸笔考试，不得设置重点班，不得按考试结果给学生调整分班、调座位等？](https://www.zhihu.com/question/483464909)
1. [两个人异地恋需要天天联系吗？](https://www.zhihu.com/question/368963597)
1. [因为 5 岁表弟的不当举动，女孩爸爸不允许两个孩子再一起玩，这样做会不会欠妥？该怎么办？](https://www.zhihu.com/question/482758106)
1. [如何看待《剑网 3》已经公测 12 周年了？](https://www.zhihu.com/question/482636568)
1. [网传北京环球影城 68 元一碗鲜虾云吞面，这个价格性价比如何？你会选择去消费吗？](https://www.zhihu.com/question/483454636)
1. [网易游戏从日本主机游戏开发商挖人，包括游戏《如龙》系列制作人名越稔洋，会带来哪些影响？](https://www.zhihu.com/question/483531155)
1. [你最近复制过哪些温柔的文案？](https://www.zhihu.com/question/465565888)
1. [建材品类日有哪些不容错过的高性价比好物推荐吗？](https://www.zhihu.com/question/483373119)
1. [雅思7分以上是什么概念？](https://www.zhihu.com/question/23312748)
1. [在大学里，如何自学PS ？](https://www.zhihu.com/question/26972802)
1. [官方严格限制未成年人游戏时间，未来电竞选手如何选拔？对于进入亚运会的电竞项目和整个电竞行业有哪些影响？](https://www.zhihu.com/question/483564836)
1. [官方严格限制未成年人玩网游时间，主机游戏和单机游戏会迎来春天吗？](https://www.zhihu.com/question/483567494)
1. [为什么几乎所有的车评人都在凭自已的主观感受评价汽车震动？](https://www.zhihu.com/question/480837103)
1. [如何看待官方通报「学校不许带手机却卖手机给学生」的校长被免职？青少年手机管控是否有更好的方法？](https://www.zhihu.com/question/483029200)
1. [产品经理该不该画原型？原型设计上谁负责？](https://www.zhihu.com/question/20177508)
1. [如何评价钱谦益？](https://www.zhihu.com/question/21780212)
1. [怎样背英语单词才高效？](https://www.zhihu.com/question/19580414)
1. [美国国防部宣布「美国已完成撤军」，阿富汗局势会有什么变化？](https://www.zhihu.com/question/483655551)
1. [《理想之城》拍得怎么样？看完你有什么感受？](https://www.zhihu.com/question/415667155)
1. [为何《披荆斩棘的哥哥》中的哥哥们看起来都不怎么爱训练？](https://www.zhihu.com/question/479714832)
1. [如何看待某律所招聘律师助理，要求会做3-5人的饭？](https://www.zhihu.com/question/483503699)
1. [假如你有一次机会，可以带一种饮料与一名古人对饮，你将携带哪种饮料拜访哪位古人？](https://www.zhihu.com/question/457665322)
1. [如何才算真努力？](https://www.zhihu.com/question/482254934)
1. [S11 冒泡赛 WE vs RNG，你觉得谁能赢？](https://www.zhihu.com/question/483435675)
1. [请问2022考研数学该怎么复习？](https://www.zhihu.com/question/436834226)
1. [游戏《黑神话：悟空》的土地公为什么做的那么丑？](https://www.zhihu.com/question/481780732)
1. [2021 年中秋国庆双节都加班，可拿 24 天的日工资，你会选择在节假日加班多挣钱吗？](https://www.zhihu.com/question/483528867)
1. [资深游戏玩家看《失控玩家》是什么感受？](https://www.zhihu.com/question/482942254)
1. [人类进化这么长的时间，进化出了什么攻击性器官?难道只是靠着智商高吗？](https://www.zhihu.com/question/482188465)
1. [当下 90 后成为购房主力，你觉得促使年轻人早买房的因素有哪些？](https://www.zhihu.com/question/482387758)
1. [北京环球影城的开业会对上海迪士尼乐园产生冲击吗？哪个会更受游客欢迎？](https://www.zhihu.com/question/482950672)
1. [2021了买有线耳机还是蓝牙耳机？](https://www.zhihu.com/question/454522118)
1. [吴谢宇谈作案细节，称妈妈像死前林黛玉，杀她是「想让她解脱」，如何从心理学角度分析他的自我剖析？](https://www.zhihu.com/question/436433018)
1. [互联网大厂中层（年薪大几十万百万）那种有 35 岁危机吗？](https://www.zhihu.com/question/469434789)
1. [除了手机和电脑，大学生开学前还应该准备哪些数码配件？](https://www.zhihu.com/question/417113275)
1. [家里有哪些隐藏的收纳空间，一旦利用起来，储物空间瞬间翻倍？](https://www.zhihu.com/question/435275393)
1. [有没有可以自助在线制作海报的网站？](https://www.zhihu.com/question/20119840)
1. [登山的时候，你拍过什么好看的山色？](https://www.zhihu.com/question/481820944)
1. [为什么现在新番动画质量似乎不断下降？实际情况如何？](https://www.zhihu.com/question/481348781)
1. [当你的存在给别人造成痛苦时，应该怎么办？](https://www.zhihu.com/question/481505582)
1. [人类相比于野生动物，有许多退化的地方，这如何用进化论解释？](https://www.zhihu.com/question/482316700)
1. [iPhone 13 或将支持低轨道卫星通讯，这意味着什么？将会给手机使用带来哪些便利？](https://www.zhihu.com/question/483462951)
1. [新研究称，新冠病毒几乎一周变异一次，变异速度比此前估计的高 50% 以上，新冠疫情将有哪些趋势？](https://www.zhihu.com/question/483465513)
1. [荣耀 Magic3、荣耀 Magic3 Pro、荣耀 Magic3 至臻版，哪款更值得入手？](https://www.zhihu.com/question/474574506)
1. [疯狂英语李阳前妻发视频指控李阳再度家暴女儿，若属实他需承担哪些后果？家暴真的只有 0 次和无数次吗？](https://www.zhihu.com/question/483398713)
1. [防止未成年人沉迷网络游戏新举措出台，可以有效地防止未成年沉迷网络游戏吗？](https://www.zhihu.com/question/483555968)
1. [考上教师编后觉得不快乐，该不该辞职？](https://www.zhihu.com/question/483177181)
1. [如何看待《当代生物学》最新研究称「越胖，运动减肥越难」？](https://www.zhihu.com/question/483418242)
1. [大学生有没有必要交医保？](https://www.zhihu.com/question/30437230)
1. [如何不动声色地提高自身颜值？](https://www.zhihu.com/question/41761929)
1. [教育部明确可安排教师弹性上下班，对课后服务教师给予补助，将会对教师行业产生哪些影响？](https://www.zhihu.com/question/483447659)
1. [《你是我的荣耀》中于途是从什么时候开始对乔晶晶动心的？](https://www.zhihu.com/question/475806431)
1. [我是今年考生，被一所好二本的法学专业录取，学法学真的会一毕业就失业吗？](https://www.zhihu.com/question/476527713)
1. [近期一线城市个别银行暂停二手房贷款，房贷「难贷」释放出什么信号？](https://www.zhihu.com/question/483457172)
1. [腾讯收购《博得之门 3》开发商、欧洲最大独立游戏工作室之一拉瑞安 30% 股份，会带来哪些影响？](https://www.zhihu.com/question/483525932)
1. [如何看待小米员工称，雷军给小米开创了「996 工作制」，后来被其他互联网公司效仿？](https://www.zhihu.com/question/483349457)
1. [下属不服从管理怎么办？](https://www.zhihu.com/question/453644473)
1. [如何看待喀布尔机场事件中大量遇难者是被外国军人射杀？](https://www.zhihu.com/question/483333335)
1. [我是艺术生，想知道老师真的可以从画里看出学生的性格吗？](https://www.zhihu.com/question/476040229)
1. [如何看待安踏集团半年收益 228 亿元，稳居中国运动品牌第一？还有哪些信息值得关注？](https://www.zhihu.com/question/482304339)
1. [有研究报告称每天坐 8 小时中风风险「高 7 倍」，医学角度分析为何风险增加这么多？你每天会坐多久？](https://www.zhihu.com/question/483450680)
1. [如何以“即使知道眼前这位落魄的少年将来会权倾天下，我也要向他退婚”为开头写一个故事？](https://www.zhihu.com/question/461598262)
1. [如何看待 2021 LCK 夏季总决赛 DK 3:1 T1 夺冠并以一号种子身份晋级 S11？](https://www.zhihu.com/question/481698067)
1. [动画 EVA《新世纪福音战士》主角他爸为什么会这样？人类补完计划的目的是什么？](https://www.zhihu.com/question/438681670)
1. [有什么适合大学生的质量好的双肩包？](https://www.zhihu.com/question/461323575)
1. [如何评价kanye west新专辑《donda》?](https://www.zhihu.com/question/483353167)
1. [小学教师资格证如何复习？具体内容都有什么呢？](https://www.zhihu.com/question/463494512)
1. [如何以「我把男主养废了」为开头写一个故事？](https://www.zhihu.com/question/437462244)
1. [一个女生不爱化妆，除了懒还有别的原因吗？](https://www.zhihu.com/question/477564205)
1. [玩单机游戏开修改器是不是一种浪费游戏体验的行为？](https://www.zhihu.com/question/479332867)
1. [为什么游戏圈似乎很多不玩《原神》的人说「感觉不如原神...画质」？这是什么梗？](https://www.zhihu.com/question/478101437)
1. [如何评价梅西在巴黎首秀的表现？](https://www.zhihu.com/question/483418197)
1. [有没有能让人get到张真源的图？](https://www.zhihu.com/question/471572733)
1. [省考准备一个月时间可以吗？](https://www.zhihu.com/question/446438823)
1. [熬夜对皮肤的危害可逆吗?](https://www.zhihu.com/question/355037169)
1. [年轻语文老师最应该多做的工作是什么？语文课最好的风格是什么？](https://www.zhihu.com/question/22151950)
1. [计算机专业大学生想要在以后有一份好工作，在大学期间应该及时考哪些证书？](https://www.zhihu.com/question/482023232)
1. [有人说开始化妆减肥就是成熟，你赞同吗？](https://www.zhihu.com/question/472446303)
1. [如何客观公正评价苏联的民族政策？](https://www.zhihu.com/question/478493284)
1. [我是一名准初二的学生，初一没有好好学，现在努力还来得及考好高中吗？](https://www.zhihu.com/question/482267733)
1. [都八月份了，考研阅读理解还是看不懂，该怎么办?](https://www.zhihu.com/question/478385037)
1. [初一没有认真听成绩中等，到初二再去努力来得及吗?](https://www.zhihu.com/question/483348346)
1. [如何评价2021年CPA的难度？](https://www.zhihu.com/question/482910515)
1. [暑假作业还没写怎么办？](https://www.zhihu.com/question/482294733)
1. [有一个占有欲特别强的男朋友是什么体验？](https://www.zhihu.com/question/30867410)
1. [婆媳关系最大的问题在哪里？](https://www.zhihu.com/question/313262997)
1. [运动风怎么穿才不会土？](https://www.zhihu.com/question/39672508)
1. [如何评价 ESL 上 LGD 的表现？](https://www.zhihu.com/question/483406368)
1. [普通女孩能从杨超越身上学到什么？](https://www.zhihu.com/question/483367067)
1. [小说里你不想看的剧情/桥段有哪些？](https://www.zhihu.com/question/275800198)
1. [人的命运能够改变吗？](https://www.zhihu.com/question/481988278)
1. [有没有女主比较理智的小说？](https://www.zhihu.com/question/364191258)
1. [教育部表示「义务教育学校不得以任何名义设置重点班」，会带来哪些影响？](https://www.zhihu.com/question/483445239)
1. [除王者、吃鸡外，还有什么好玩的联机手游？](https://www.zhihu.com/question/341434414)
1. [哪些情侣一看就能在一起很久很久?](https://www.zhihu.com/question/309398217)
1. [你的升学宴有多尴尬？](https://www.zhihu.com/question/293226791)
1. [在媒体公布的吴谢宇庭审视频中，他弑母背后最真实的作案动机是什么？](https://www.zhihu.com/question/483317152)
1. [教育部称小学一二年级不进行纸笔考试，将产生哪些影响？](https://www.zhihu.com/question/483444092)
1. [如何看待萌娃偷拿钱买奥特曼被妈妈送进派出所，这样的教育方式可取吗？作为家长应该怎么做？](https://www.zhihu.com/question/482862359)
1. [《扫黑风暴》感觉高明远并不是最终 boss，大 boss 有可能是谁？](https://www.zhihu.com/question/478983291)
1. [如何看待两名外籍男女在郑州如意湖湖边比赛吐口水？如果你是目击者你会怎么做？](https://www.zhihu.com/question/483088898)
1. [促使你高三拼命学习的动力是什么？](https://www.zhihu.com/question/35708794)
1. [网友建议禁止收集中小学家长职务信息，北京教委回应正研究取消，如何看待这一建议？若落实会带来哪些影响？](https://www.zhihu.com/question/483091803)
1. [你玩《王者荣耀》时遇到过哪些牛逼队友？](https://www.zhihu.com/question/52681936)
<!-- END -->
| 73.823256 | 98 | 0.769783 | yue_Hant | 0.540063 |
9886df4d7d12ea2012363d537312d987023a658f | 4,352 | md | Markdown | GraphyRender/GPUGem/CountlessBladesofWavingGrass.md | daozhangXDZ/DaoZhang_ProgramNote | f4d7d89ee09ff6c647b81abdf46a80e223d11bdc | [
"Apache-2.0"
] | 16 | 2020-06-21T08:45:43.000Z | 2022-03-12T10:27:07.000Z | GraphyRender/GPUGem/CountlessBladesofWavingGrass.md | daozhangXDZ/DaoZhang_ProgramNote | f4d7d89ee09ff6c647b81abdf46a80e223d11bdc | [
"Apache-2.0"
] | null | null | null | GraphyRender/GPUGem/CountlessBladesofWavingGrass.md | daozhangXDZ/DaoZhang_ProgramNote | f4d7d89ee09ff6c647b81abdf46a80e223d11bdc | [
"Apache-2.0"
] | 5 | 2020-05-25T15:27:34.000Z | 2022-02-14T04:10:00.000Z | # 三、无尽波动的草地叶片的渲染（Rendering Countless Blades of Waving Grass）
##
## 【章节概览】
这章关于巨量自然元素的渲染，特别是对于无尽波动的草地叶片的渲染。作者对Codecreatures demo中首次成形的技术进行了扩展，使其能够高性能的渲染，以更好地适应游戏引擎的需要。
[
](https://github.com/QianMo/Game-Programmer-Study-Notes/blob/master/Content/%E3%80%8AGPUGems1%E3%80%8B%E5%85%A8%E4%B9%A6%E6%8F%90%E7%82%BC%E6%80%BB%E7%BB%93/media/000e7d0e677c5cc7aaa92cbfc28e7b44.jpg)
图 Realistic Grass Field @Giovanni Baer
##
## 【核心内容提炼】
###
### 3.1 概述
首先，需要意识到，对单个草叶的细节建模意义不大，因为那样大片草地需要的多边形数目会太多。
所以，我们必须建立一个符合以下条件的简单而有用的替代方案：
- 许多草的叶片必须由少数多边形表示。
- 草地必须从不同的视线看起来显得密集。
而要做到让场景不依赖于摄像机的位置和方向，可以把一些草叶组合起来，表示在一个纹理中，并将多个纹理组合起来，且在结果中单个的多边形不应该引起注意。当观察者四处活动时，通过将草体加入混合操作或者移除混合操作，以在距离范围内增加或删去草体，来保证整个草地的渲染效果具有稳定的视觉质量。
###
### 3.2 草的纹理
草的纹理，应该是一些一簇一簇聚集丛生的草，否则，会出现大片的透明区域。
需在透明的alpha通道上画实体草茎。在彩色通道中，用深浅不同的绿色和黄色，来较好地区别各个单独的叶片，也应该模拟不同情况的草叶：长得好的和长得差的、老的和嫩的，甚至区别叶片的前面与后面。
下图是一个草地纹理的示例。
[](https://github.com/QianMo/Game-Programmer-Study-Notes/blob/master/Content/%E3%80%8AGPU%20Gems%201%E3%80%8B%E5%85%A8%E4%B9%A6%E6%8F%90%E7%82%BC%E6%80%BB%E7%BB%93/media/75eb9a7c7b47bfd883f3d2c15f1b1166.png)
图 草地纹理的示意图
###
### 3.3 草体
这一部分将探讨总结如何对多边形进行组合，并用上文提到的草地纹理进行映射，以模拟出茂密的草地，并且不凸显个别多边形。此技术也保证了单个多边形不可见。
因为用户能自由地在场景中游玩，下图所示的结构便不能产生令人信服的效果。
[](https://github.com/QianMo/Game-Programmer-Study-Notes/blob/master/Content/%E3%80%8AGPU%20Gems%201%E3%80%8B%E5%85%A8%E4%B9%A6%E6%8F%90%E7%82%BC%E6%80%BB%E7%BB%93/media/2e621ba9c08c3c8d560175f594ab5cd8.jpg)
图 线性排布
对于线性排布，如果从垂直于多边形的方向观看场景，就会立刻穿帮，看出草地多边形的结构是线性排布的。另外这种情况下草地会看起来非常稀疏。只有在摄像机自动导航，或者渲染无法到达的远距离草地时，才会考虑这样的排布。
为了保证独立于当前视线的良好视觉质量，我们必须交叉地排布草地多边形。已证明，使用星型结构是非常好的。下图给出了“草体”可能的两种变体。
他们由3个相交的方块构成。我们必须禁用背面剔除来渲染多边形，以保证双面都可见。为了得到合适的照明度，应该让所有顶点的法线方向与多边形的垂直边平行。这保证了位于斜坡上的所有草体都可以得到正确的光照，不会因为地形的亮度而出现差异。
[](https://github.com/QianMo/Game-Programmer-Study-Notes/blob/master/Content/%E3%80%8AGPU%20Gems%201%E3%80%8B%E5%85%A8%E4%B9%A6%E6%8F%90%E7%82%BC%E6%80%BB%E7%BB%93/media/0e5096bbb70198af88449e17482a45d6.jpg)
图 草体的交叉排布
如果把这些草地物体彼此相当靠近地设置在一个大的区域里，如下图。在运行期间把它们从后向前进行排序，使用alpha混合，并启用Draw Call中的z-testing/writing，那么就会得到自然而茂密的草地渲染效果。
[](https://github.com/QianMo/Game-Programmer-Study-Notes/blob/master/Content/%E3%80%8AGPU%20Gems%201%E3%80%8B%E5%85%A8%E4%B9%A6%E6%8F%90%E7%82%BC%E6%80%BB%E7%BB%93/media/a6c9d7add4706057988add72188400ab.jpg)
图 草地的扩展
###
### 3.4 草地动画
关于草地的动画，基本思想是以三角函数（尤其是正弦和余弦）为基础进行计算，且计算应该考虑到移动的位置和当前时间、风向和强度。
以基本思想为基础，实现起来有几种方法：
1、每草丛草体的动画（Animation per Cluster of Grass Objects）
2、每顶点的动画（Animation per Vertex）
3、每草体的动画（Animation per Grass Object）
三种方法各有优缺点，而文中都给出了具体算法步骤和实现的Shader源码，这里因为篇幅原因，便不展开分析了。
最终可以实现的渲染效果。
[
](https://github.com/QianMo/Game-Programmer-Study-Notes/blob/master/Content/%E3%80%8AGPUGems1%E3%80%8B%E5%85%A8%E4%B9%A6%E6%8F%90%E7%82%BC%E6%80%BB%E7%BB%93/media/fb643b85c492b73c4ee4b7994a77ae9e.jpg)
图 Realistic Grass
##
## 【核心要点总结】
1）草的纹理，应选取一簇一簇聚集丛生的草。在透明的alpha通道上画实体草茎。在彩色通道中，用深浅不同的绿色和黄色，区别各个单独的叶片。
2）草体的渲染，适合进行交叉排布，从后向前进行排序，使用alpha混合，并启用Draw Call中的z-testing/writing，便能得到自然而茂密的草地渲染效果。
3）草地的动画，以三角函数（尤其是正弦和余弦）为基础，且应该考虑到移动的位置和当前时间、风向和强度。实现起来有三种方法：
> 1、每草丛草体的动画（Animation per Cluster of Grass Objects）
> 2、每顶点的动画（Animation per Vertex）
> 3、每草体的动画（Animation per Grass Object）
##
## 【本章配套源代码汇总表】
Example 7-1. 顶点着色器框架（Framework in the Vertex Shader）
Example 7-2. 对每草丛草体的动画的实现Shader代码（Code for Animation per Cluster of Grass Objects）
Example 7-3. 每顶点动画实现Shader代码（Code for Animation per Vertex）
Example 7-4. 每草体的动画实现Shader代码（Code for Animation per Grass Object）
##
## 【关键词提炼】
草地渲染（Grass Rendering）
草地动画（Grass Animation）
草体（Grass Objects）
| 32.721805 | 326 | 0.784007 | yue_Hant | 0.599198 |
9886e812e799cc86481f019a62f83711f0576947 | 2,582 | md | Markdown | content/waf/custom-rules/skip/options.md | thakkaryash94/cloudflare-docs | 71290785cac9fad15ef2f35049772c2a80c559d6 | [
"MIT"
] | null | null | null | content/waf/custom-rules/skip/options.md | thakkaryash94/cloudflare-docs | 71290785cac9fad15ef2f35049772c2a80c559d6 | [
"MIT"
] | null | null | null | content/waf/custom-rules/skip/options.md | thakkaryash94/cloudflare-docs | 71290785cac9fad15ef2f35049772c2a80c559d6 | [
"MIT"
] | null | null | null | ---
title: Skip options
pcx-content-type: reference
weight: 4
meta:
title: Available skip options
---
# Available skip options
The available skip options in custom rules are the following:
{{<definitions>}}
- **Skip the remaining custom rules (current ruleset)**
- Dashboard option: **All remaining custom rules**.
- API action parameter: `ruleset`.
- Skips the remaining rules in the current ruleset.
- **Skip phases**
- Dashboard options: **All rate limiting rules** and **All managed rules**.
- API action parameter: `phases`.
- Skips the execution of one or more phases. Based on the phases you can skip, this option effectively allows you to skip [rate limiting rules](/waf/rate-limiting-rules/) and/or [WAF Managed Rulesets](/waf/managed-rulesets/). When skipping a phase, both the account and zone-level entry point rulesets of the phase will be skipped.
- The phases you can skip are the following:
- `http_request_firewall_managed`
- `http_ratelimit`
- Refer to [Phases](/ruleset-engine/about#phases) for more information.
- **Skip products**
- API action parameter: `products`.
- Skips specific security products that are not based on the Ruleset Engine. The products you can skip are the following:
- | Product name in the dashboard | API value |
| -------------------------------------------------------------------------------------------- | --------------- |
| [Zone Lockdown](https://support.cloudflare.com/hc/articles/115001595131) | `zoneLockdown` |
| [User Agent Blocking](https://support.cloudflare.com/hc/articles/115001856951) | `uaBlock` |
| [Browser Integrity Check](https://support.cloudflare.com/hc/articles/200170086) | `bic` |
| [Hotlink Protection](https://support.cloudflare.com/hc/articles/200170026) | `hot` |
| [Security Level](https://support.cloudflare.com/hc/articles/200170056) | `securityLevel` |
| [Rate Limiting](https://support.cloudflare.com/hc/articles/115001635128) (previous version) | `rateLimit` |
| [WAF managed rules](https://support.cloudflare.com/hc/articles/200172016) (previous version) | `waf` |
- The API values are case sensitive.
{{<Aside type="warning">}}
Currently, you cannot skip Bot Fight Mode or Super Bot Fight Mode. For more information on these products, refer to [Cloudflare bot solutions](/bots/).
{{</Aside>}}
{{</definitions>}}
| 42.327869 | 333 | 0.632455 | eng_Latn | 0.90205 |
9887a8b4ec4277de0de67701aa769375b1079562 | 68 | md | Markdown | ReleaseNotes.md | Omnicit/Later | 5d78d766269c0624a8310de85b0e87be80c19130 | [
"MIT"
] | 6 | 2019-08-22T15:46:55.000Z | 2021-03-25T07:54:20.000Z | ReleaseNotes.md | matbe/Later | aa2bb95765e90d4d9feb33ee1b818cd0442fba36 | [
"MIT"
] | 1 | 2019-09-11T07:44:45.000Z | 2019-09-13T13:13:28.000Z | ReleaseNotes.md | Omnicit/Later | 5d78d766269c0624a8310de85b0e87be80c19130 | [
"MIT"
] | 2 | 2019-09-12T06:36:19.000Z | 2022-01-25T12:50:42.000Z | ## Changelog LATER v0.1.0
1. Initial release of the LATER module.
| 13.6 | 39 | 0.720588 | eng_Latn | 0.591616 |
98883cee8922fd58143bc098a448a5c1b86e87ce | 194 | md | Markdown | functions/logical-functions/README.md | jaxbulsara/pqm-guide | 9708cf5d16c1bd1e04dce979eb4d2be67e487b90 | [
"MIT"
] | 1 | 2021-07-12T09:23:15.000Z | 2021-07-12T09:23:15.000Z | functions/logical-functions/README.md | jaxbulsara/pqm-guide | 9708cf5d16c1bd1e04dce979eb4d2be67e487b90 | [
"MIT"
] | null | null | null | functions/logical-functions/README.md | jaxbulsara/pqm-guide | 9708cf5d16c1bd1e04dce979eb4d2be67e487b90 | [
"MIT"
] | null | null | null | ---
---
# Logical functions
Microsoft Docs: [Logical functions](https://docs.microsoft.com/en-us/powerquery-m/logical-functions)
About this function group.
{% include list.liquid all=true %} | 19.4 | 100 | 0.737113 | yue_Hant | 0.686378 |
98892de757d9e6804b30a4d6e2dbfe4db4d0a681 | 1,498 | md | Markdown | _dar/feat/Evident.md | MarcoDiMarek/docs | c00f9c59b8e1e93b24c119fbdccb84aaf6b06565 | [
"Apache-2.0"
] | null | null | null | _dar/feat/Evident.md | MarcoDiMarek/docs | c00f9c59b8e1e93b24c119fbdccb84aaf6b06565 | [
"Apache-2.0"
] | null | null | null | _dar/feat/Evident.md | MarcoDiMarek/docs | c00f9c59b8e1e93b24c119fbdccb84aaf6b06565 | [
"Apache-2.0"
] | null | null | null | ---
layout: feature
title: 'Evident'
shortdef: 'evidentiality'
udver: '2'
---
<table class="typeindex" border="1">
<tr>
<td style="background-color:cornflowerblue;color:white"><strong>Values:</strong> </td>
<td><a href="#Nfh">Nfh</a></td>
</tr>
</table>
Evidentiality is the morphological marking of a speaker’s source of information (Aikhenvald, 2004). In Dargwa, `Evident`iality is a feature of the [verb](dar-pos/VERB). Under the hearsay strategy (Ganenkov 2010), the hearsay marker is placed on the right periphery of finite verbs (and is not followed by any speech verb or quotative particle).
The first-hand evidence reading for the statement/event is the default and is not marked in Dargwa. In the treebank, the `Fh` (first-hand) value is not tagged.
### <a name="Nfh">`Nfh`</a>: non-first hand
The speaker has indirect evidence for the statement. The `Nfh` marker is also called `quotative` (QUOT) and `citative` (CIT) in the literature.
#### Examples
```
* ca adaj-la k’wi-jal urši le-b-re-k’wan
one father-Gen two-Card son COP-HumPlur-Past-Nfh
'A father had (they say) two sons.'
```
## References
* Aikhenvald, Alexandra Y. 2004. Evidentiality. Oxford: Oxford University Press.
* Ganenkov, Dmitry. Reported speech in Dargwa: an overview. Workshop on Reported speech in East Caucasian languages. Lyon, 22 September 2010. [PDF](http://dag-languages.org/download/Reported_speech_Dargwa.pdf)
<!-- Interlanguage links updated Čt lis 12 09:43:01 CET 2020 -->
| 41.611111 | 344 | 0.724299 | eng_Latn | 0.949978 |
988a4e0ccb1bc3093894859a0ce83bf1b987b91d | 6,326 | md | Markdown | content/getting-started/react.md | tomaszdanczak/flowbite | 21807195dfa68df884640266561f2fc85661c2f8 | [
"MIT"
] | null | null | null | content/getting-started/react.md | tomaszdanczak/flowbite | 21807195dfa68df884640266561f2fc85661c2f8 | [
"MIT"
] | null | null | null | content/getting-started/react.md | tomaszdanczak/flowbite | 21807195dfa68df884640266561f2fc85661c2f8 | [
"MIT"
] | null | null | null | ---
layout: home
title: Tailwind CSS React - Flowbite
description: Learn how to install and set up Tailwind CSS with Flowbite for your React project and start developing modern web applications using interactive elements based on utility classes
group: getting-started
toc: true
requires_react: true
previous: Laravel
previousLink: getting-started/laravel/
next: Vue
nextLink: getting-started/vue/
---
React is one of the most popular front-end libraries in the world used by websites such as Facebook, Instagram, Yahoo Mail, Dropbox, and more.
Coupled with Tailwind CSS and the components from Flowbite you will be able to develop applications faster than ever.
## Install Tailwind CSS with React
Follow the next steps to install Tailwind CSS and Flowbite with Create React App.
1. Run the following command in your terminal to create a React application, if you don't already have one:
```bash
npx create-react-app my-project
cd my-project
```
2. Install Tailwind CSS by running the following two commands:
```bash
npm install -D tailwindcss postcss autoprefixer
npx tailwindcss init -p
```
3. Configure the template paths inside the `tailwind.config.js` file:
```javascript
module.exports = {
content: [
"./src/**/*.{js,jsx,ts,tsx}",
],
theme: {
extend: {},
},
plugins: [],
}
```
4. Set up the Tailwind directives inside the `./src/index.css` file:
```css
@tailwind base;
@tailwind components;
@tailwind utilities;
```
5. Install Flowbite by running the following command in your terminal:
```bash
npm install @themesberg/flowbite
```
6. Require Flowbite as a plugin inside your `tailwind.config.js` file:
```javascript
module.exports = {
plugins: [
require('@themesberg/flowbite/plugin')
]
}
```
7. Import the Flowbite JavaScript file inside your main `index.js` file:
```bash
import '@themesberg/flowbite';
```
8. Additionally to your own `content` data you should add `@themesberg/flowbite` to apply the classes from the interactive elements in the `tailwind.config.js` file:
```javascript
module.exports = {
content: [
"./node_modules/@themesberg/flowbite/**/*.js"
]
}
```
Now you can start the server by running `npm run start` or build the project using `npm run build`.
## Flowbite components
Most of the components from Flowbite will work as long as you have Tailwind CSS included in your project. The interactive elements such as dropdowns, tooltips, and modals will work based on the data attributes that you can code directly in your view files, except when using a routing system like React Router.
We are currently working on a standalone React component library to make integration with React fully compatible and with frameworks such as NextJS.
You can start using the components from Flowbite inside your React project by only changing the `class` attributes to `className`.
Here's an example of a modal component that you can add inside your `App.js` file:
```javascript
import './App.css';
function App() {
return (
<div className="App">
<button className="block text-white bg-blue-700 hover:bg-blue-800 focus:ring-4 focus:ring-blue-300 font-medium rounded-lg text-sm px-5 py-2.5 text-center dark:bg-blue-600 dark:hover:bg-blue-700 dark:focus:ring-blue-800" type="button" data-modal-toggle="default-modal">
Toggle modal
</button>
<div id="default-modal" aria-hidden="true" className="hidden overflow-y-auto overflow-x-hidden fixed right-0 left-0 top-4 z-50 justify-center items-center h-modal md:h-full md:inset-0">
<div className="relative px-4 w-full max-w-2xl h-full md:h-auto">
<div className="relative bg-white rounded-lg shadow dark:bg-gray-700">
<div className="flex justify-between items-start p-5 rounded-t border-b dark:border-gray-600">
<h3 className="text-xl font-semibold text-gray-900 lg:text-2xl dark:text-white">
Terms of Service
</h3>
<button type="button" className="text-gray-400 bg-transparent hover:bg-gray-200 hover:text-gray-900 rounded-lg text-sm p-1.5 ml-auto inline-flex items-center dark:hover:bg-gray-600 dark:hover:text-white" data-modal-toggle="default-modal">
<svg className="w-5 h-5" fill="currentColor" viewBox="0 0 20 20" xmlns="http://www.w3.org/2000/svg"><path fill-rule="evenodd" d="M4.293 4.293a1 1 0 011.414 0L10 8.586l4.293-4.293a1 1 0 111.414 1.414L11.414 10l4.293 4.293a1 1 0 01-1.414 1.414L10 11.414l-4.293 4.293a1 1 0 01-1.414-1.414L8.586 10 4.293 5.707a1 1 0 010-1.414z" clip-rule="evenodd"></path></svg>
</button>
</div>
<div className="p-6 space-y-6">
<p className="text-base leading-relaxed text-gray-500 dark:text-gray-400">
With less than a month to go before the European Union enacts new consumer privacy laws for its citizens, companies around the world are updating their terms of service agreements to comply.
</p>
<p className="text-base leading-relaxed text-gray-500 dark:text-gray-400">
The European Union’s General Data Protection Regulation (G.D.P.R.) goes into effect on May 25 and is meant to ensure a common set of data rights in the European Union. It requires organizations to notify users as soon as possible of high-risk data breaches that could personally affect them.
</p>
</div>
<div className="flex items-center p-6 space-x-2 rounded-b border-t border-gray-200 dark:border-gray-600">
<button data-modal-toggle="default-modal" type="button" className="text-white bg-blue-700 hover:bg-blue-800 focus:ring-4 focus:ring-blue-300 font-medium rounded-lg text-sm px-5 py-2.5 text-center dark:bg-blue-600 dark:hover:bg-blue-700 dark:focus:ring-blue-800">I accept</button>
<button data-modal-toggle="default-modal" type="button" className="text-gray-500 bg-white hover:bg-gray-100 focus:ring-4 focus:ring-gray-300 rounded-lg border border-gray-200 text-sm font-medium px-5 py-2.5 hover:text-gray-900 focus:z-10 dark:bg-gray-700 dark:text-gray-300 dark:border-gray-500 dark:hover:text-white dark:hover:bg-gray-600">Decline</button>
</div>
</div>
</div>
</div>
</div>
);
}
export default App;
```
| 41.346405 | 374 | 0.70724 | eng_Latn | 0.919322 |
988b0a2689f0900dd59cb110fb7f5705102869cf | 30,173 | md | Markdown | CHANGELOG.md | vecchiotom/snekfetch | bd69b686c657d1ded14df050d1918db079742690 | [
"MIT"
] | 86 | 2017-05-16T21:03:03.000Z | 2021-05-21T02:39:52.000Z | CHANGELOG.md | GusCaplan/node-fetcher | 892714c20d6446dcb1e132323c5f78fa935115ed | [
"MIT"
] | 39 | 2017-05-15T01:11:50.000Z | 2018-09-05T19:38:33.000Z | CHANGELOG.md | GusCaplan/node-fetcher | 892714c20d6446dcb1e132323c5f78fa935115ed | [
"MIT"
] | 42 | 2017-05-31T15:39:34.000Z | 2021-12-07T08:08:43.000Z | * [[`025d579`](https://github.com/devsnek/snekfetch/commit/025d57918b0615ac403d613abe558ed53330580f)] - [core] remove undefined `request` property from response
* [[`b0014a3`](https://github.com/devsnek/snekfetch/commit/b0014a3109a64fde9dcd5b65a1a5d8b493d38fac)] - [changelog] update
* [[`e073a72`](https://github.com/devsnek/snekfetch/commit/e073a720678fa6eb9269ea4310bf4189e992c3d8)] - [version] 4.0.4
* [[`0e603fa`](https://github.com/devsnek/snekfetch/commit/0e603fa740e9482cafdef4f34072306f61f1c1ba)] - [browser] fix webpack output
* [[`2d8cd56`](https://github.com/devsnek/snekfetch/commit/2d8cd56d65befdb693a03e0e9746cdb5e2aa2dcd)] - [changelog] update
* [[`26182ff`](https://github.com/devsnek/snekfetch/commit/26182ff9ab32ba787335df55557441aa266c7bf7)] - [version] 4.0.3
* [[`9fef333`](https://github.com/devsnek/snekfetch/commit/9fef33367056c5e7b9f999ee407817a5a1d8765a)] - add script to package to generate changelog
* [[`08ad9f6`](https://github.com/devsnek/snekfetch/commit/08ad9f6936203c5b86cc84659d91c91b9d1d3206)] - cut older commits from changelog
* [[`75cd455`](https://github.com/devsnek/snekfetch/commit/75cd455353d50b9bfa643f1e0aed249b68d2e83f)] - change changelog format
* [[`0cb076b`](https://github.com/devsnek/snekfetch/commit/0cb076b81e8c3c948602d5b681636e9e23be70e9)] - things i said i would do
* [[`9222cbe`](https://github.com/devsnek/snekfetch/commit/9222cbe2f055335c5f173c050e43e07dd5f906f8)] - 4.0.2
* [[`b9d53f5`](https://github.com/devsnek/snekfetch/commit/b9d53f555599e471eb29a5e033fb22d946600d6b)] - status is now statusCode (#41)
* [[`32c5da6`](https://github.com/devsnek/snekfetch/commit/32c5da60a2c0401ee6b66cc4a5caa86c3aa20ec8)] - 4.0.1
* [[`d925b7a`](https://github.com/devsnek/snekfetch/commit/d925b7a506d99633d941628fd0a6dd3f8d38a453)] - add repo token
* [[`aaa505a`](https://github.com/devsnek/snekfetch/commit/aaa505adfcb5c2622eed8b6d78a3b74d159a0e26)] - change badge
* [[`7ca062d`](https://github.com/devsnek/snekfetch/commit/7ca062d3bd70ebd292a2c0e230b894e933e96a9b)] - use string concat for speeeeeed
* [[`8fb6c5c`](https://github.com/devsnek/snekfetch/commit/8fb6c5c42963cc36606635807bcfda14b274cef6)] - cleanup
* [[`f22d100`](https://github.com/devsnek/snekfetch/commit/f22d100724d9156cfe2658aac976d4663d39b7d0)] - catch stream errors
* [[`834d3ab`](https://github.com/devsnek/snekfetch/commit/834d3ab39edfb1cfe9de57949f4f0ad430117b43)] - version 4 yo
* [[`9b2cfcd`](https://github.com/devsnek/snekfetch/commit/9b2cfcd1b101dd63c1cbc716ccd0dd01a78cffc5)] - add node 10
* [[`7554922`](https://github.com/devsnek/snekfetch/commit/75549220a44e03d889034b24ff5a4385ed7d52f5)] - update eslint
* [[`7770ae9`](https://github.com/devsnek/snekfetch/commit/7770ae911fad92863ca1ed4f73eca9baff03d9f1)] - fix github link in docs
* [[`907319b`](https://github.com/devsnek/snekfetch/commit/907319b9b907f5fae73c8277f5447345e84bdf82)] - fix version badge
* [[`62d3574`](https://github.com/devsnek/snekfetch/commit/62d35745cb7ed480a39fa80a7dfd15f352ffddab)] - remove object spread
* [[`b69ecfb`](https://github.com/devsnek/snekfetch/commit/b69ecfbe916df673bb32c601484b75a1f20654ad)] - http2 on 9.8.0
* [[`4250ab6`](https://github.com/devsnek/snekfetch/commit/4250ab6970ad4b5e2963a2f71f489ebe2996a970)] - buffers for everyone yay
* [[`a49b282`](https://github.com/devsnek/snekfetch/commit/a49b2828dc6188ee9d214cad5d2ca673ef5888c8)] - avoid scaring users
* [[`4157fa2`](https://github.com/devsnek/snekfetch/commit/4157fa21644aea746181ae6cab4f9da6d223b602)] - agh
* [[`57b4e67`](https://github.com/devsnek/snekfetch/commit/57b4e674157760a2de56b1108590fdc0c2326e55)] - bump version
* [[`6054801`](https://github.com/devsnek/snekfetch/commit/6054801e56ae7e06bb02dd6466474b3600bfea91)] - lock http2 to node >= 10
* [[`8dc7321`](https://github.com/devsnek/snekfetch/commit/8dc732119e726aab2466a0df69597143455d6cb1)] - fix regression with static methods
* [[`5948edd`](https://github.com/devsnek/snekfetch/commit/5948edd824388d4e2b88b85caf9619e6c64ed56c)] - fall back to destroying http2 connection
* [[`d321cfe`](https://github.com/devsnek/snekfetch/commit/d321cfecd630d6323e8143278528fca0a28fd7ef)] - many bugg fixx
* [[`3baaa7d`](https://github.com/devsnek/snekfetch/commit/3baaa7d3d75c50d881285e63432beedb8ec12698)] - clean up errors and thing
* [[`2cff41d`](https://github.com/devsnek/snekfetch/commit/2cff41d34e9ca1a08ecb40a8615aa0b38f0d96ff)] - Update ISSUE_TEMPLATE.md
* [[`daac3ce`](https://github.com/devsnek/snekfetch/commit/daac3ce57f7775f29412fcc5619e1a39138b5415)] - update travis node
* [[`6373531`](https://github.com/devsnek/snekfetch/commit/6373531976811b9e0509155cfe7b4ca2723cc01e)] - remove .eslintcache
* [[`914ab80`](https://github.com/devsnek/snekfetch/commit/914ab802dd9a7d2b39646129d530a2448a515b13)] - clean up
* [[`aff503a`](https://github.com/devsnek/snekfetch/commit/aff503aa616d00bc469c18e6fb87eb88d5e78864)] - update readme
* [[`3b0b531`](https://github.com/devsnek/snekfetch/commit/3b0b5317b29cc363f5b7fd9babbf7790442935be)] - reuse connection and close connection
* [[`1032a5b`](https://github.com/devsnek/snekfetch/commit/1032a5b812417acf6d258f08b4adab0e9be45308)] - update docs and such
* [[`98cba31`](https://github.com/devsnek/snekfetch/commit/98cba3127ddb1eab5b80f688e6be6d2cf0cf46d4)] - fix browser build
* [[`a281002`](https://github.com/devsnek/snekfetch/commit/a2810020191a309d505bb612b5a7833d3337f4e7)] - http2 rewrite
* [[`51d6568`](https://github.com/devsnek/snekfetch/commit/51d6568a5f724bc8916c845049930e4c049475f7)] - move around esm
* [[`c939e4f`](https://github.com/devsnek/snekfetch/commit/c939e4fd5af8391dd4ebc627200698c739689519)] - version 4
* [[`eb86f67`](https://github.com/devsnek/snekfetch/commit/eb86f67aac211a05147ae4058d0280f9f37df66f)] - clean up mocks and do some golf
* [[`6b3f822`](https://github.com/devsnek/snekfetch/commit/6b3f82254491b6e30b9fa1b86cb3ffd3c0a2fa42)] - add tests for qs_mock
* [[`25f0f86`](https://github.com/devsnek/snekfetch/commit/25f0f865ec6d63a2a71bd8941d90cfd5b574340c)] - bump version
* [[`591fe30`](https://github.com/devsnek/snekfetch/commit/591fe305b7f99b17683fc44ee8c9078ed244a38a)] - Merge branch 'master' of https://github.com/devsnek/snekfetch
* [[`c4c7816`](https://github.com/devsnek/snekfetch/commit/c4c7816e77ffd2fa496ff86e78e86d47bf9f3635)] - many fixes
* [[`359c2dc`](https://github.com/devsnek/snekfetch/commit/359c2dc1d078154e6478978cb27bfa9fe12e7b4d)] - fix tests
* [[`0934d09`](https://github.com/devsnek/snekfetch/commit/0934d0967113241d06c109a44ba0a885b5546414)] - bump version
* [[`92e76ef`](https://github.com/devsnek/snekfetch/commit/92e76efc21f0d37f3a08246274ffca84c57ce1f1)] - move default user agent to node
* [[`f85d9d6`](https://github.com/devsnek/snekfetch/commit/f85d9d66f29030d33bec485715943588874c7337)] - stuff
* [[`f41be40`](https://github.com/devsnek/snekfetch/commit/f41be400b0fe6ff4db5e30fe3327080eeafe5618)] - update dep badge
* [[`aa79d40`](https://github.com/devsnek/snekfetch/commit/aa79d40045f7c609a2972f4c8e5eaa7f5b99fb12)] - eslint better
* [[`ac841a9`](https://github.com/devsnek/snekfetch/commit/ac841a9405292502aad905ec3c63ce28ddd82f24)] - bump version
* [[`f45a2ba`](https://github.com/devsnek/snekfetch/commit/f45a2ba57aaf022c70b237dcd79b86df9a764d5a)] - add jsdelivr entry to package.json
* [[`6612b18`](https://github.com/devsnek/snekfetch/commit/6612b18b3c6bab1adc4925d110745fc495e1e0b0)] - fix tests
* [[`014f4bd`](https://github.com/devsnek/snekfetch/commit/014f4bd1ad73254f69510d24290d549bd420e653)] - clean up
* [[`c0f1ee8`](https://github.com/devsnek/snekfetch/commit/c0f1ee8e5948df065815f87248a956feb1a47c34)] - bump version
* [[`6db72a4`](https://github.com/devsnek/snekfetch/commit/6db72a440b1450e789e5ed1b029ac51b075cfede)] - coverage
* [[`052f027`](https://github.com/devsnek/snekfetch/commit/052f02745afcf663530819c1fbb862ef56706f96)] - destroy response once we don't need it
* [[`8a1f0eb`](https://github.com/devsnek/snekfetch/commit/8a1f0eba16d852c76970e5001a053f85dcb9634d)] - clean up agents and redirects, handling body is more effecient now
* [[`8df39ad`](https://github.com/devsnek/snekfetch/commit/8df39ad5778798cadef99574dc7a17497ad580c2)] - clean up inheritence
* [[`30a7445`](https://github.com/devsnek/snekfetch/commit/30a7445ab7bf3c02f363bf0c44d1d6057c722de0)] - clean up tests
* [[`9d2479a`](https://github.com/devsnek/snekfetch/commit/9d2479a50784aee69a13a8537135a384d02e796e)] - update syncify dep
* [[`3574cb3`](https://github.com/devsnek/snekfetch/commit/3574cb3be69395b991d99ddc8704721260c7be8b)] - update syncify
* [[`eceedee`](https://github.com/devsnek/snekfetch/commit/eceedeec254e6b849d55c73572a8513bc6cc04a7)] - misc
* [[`a42ec62`](https://github.com/devsnek/snekfetch/commit/a42ec62d86d9c20adfe5678afc01ed486adeeb47)] - sync api
* [[`ea75c58`](https://github.com/devsnek/snekfetch/commit/ea75c587e6329abab233067303c934e0906f9842)] - new test setup
* [[`e12bbda`](https://github.com/devsnek/snekfetch/commit/e12bbda89b1effd3e60521149bcb1f0451f7fb4b)] - expand esm
* [[`d277881`](https://github.com/devsnek/snekfetch/commit/d27788129a25bb04b49bc83b27b84ae9c1e70d57)] - new eslint
* [[`f687e93`](https://github.com/devsnek/snekfetch/commit/f687e937b33a75bbcbdc4d8e20fe048e2f5a0297)] - clean snekfetch options docs
* [[`d142b32`](https://github.com/devsnek/snekfetch/commit/d142b321b085c7ccc3922d0aeb44951740afe170)] - make readme nicer
* [[`3130126`](https://github.com/devsnek/snekfetch/commit/3130126bac849d5813a8a2cfc3ebd928c1009e86)] - Create CONTRIBUTING.md
* [[`8078e14`](https://github.com/devsnek/snekfetch/commit/8078e14ee83f5d566d37f33151302699647c1911)] - github made me do this
* [[`8e42545`](https://github.com/devsnek/snekfetch/commit/8e42545a555c6023221a1a9de062815cb8cd1905)] - Create LICENSE
* [[`d69a3ce`](https://github.com/devsnek/snekfetch/commit/d69a3ce522ace5b37915ea2aef40589aacf36829)] - agh
* [[`437b9d7`](https://github.com/devsnek/snekfetch/commit/437b9d7e2811e8ad4110fc70aef13bff2ccc9f50)] - plz work
* [[`7f45688`](https://github.com/devsnek/snekfetch/commit/7f45688aa635c4581f68a484e8c805707de4ac71)] - fix stuff more
* [[`c6fedc2`](https://github.com/devsnek/snekfetch/commit/c6fedc25ff304ecec96c050423824b3d628488fb)] - more esm
* [[`13e8355`](https://github.com/devsnek/snekfetch/commit/13e8355233493f42277d9a8df802f4c678b65c89)] - fix
* [[`0ce04a1`](https://github.com/devsnek/snekfetch/commit/0ce04a166d0f8b75dd1605f8f2259e574882e45c)] - module, sonar
* [[`07e2984`](https://github.com/devsnek/snekfetch/commit/07e2984dfd0320260985885acfeb9936709b3b23)] - prepublish
* [[`1b42f5c`](https://github.com/devsnek/snekfetch/commit/1b42f5c644240e4028fe6dd7cba52b04cf6c058f)] - misc
* [[`1301576`](https://github.com/devsnek/snekfetch/commit/1301576da41266c342fec8e4db174d6131137e5e)] - add unpkg to package.json
* [[`06685fd`](https://github.com/devsnek/snekfetch/commit/06685fd019eaabd83a8cfad15feb30caade9badc)] - bump to 3.5.6
* [[`728085a`](https://github.com/devsnek/snekfetch/commit/728085a5e74213b82faeb763080c1fe03c652d41)] - use umd
* [[`dfe5121`](https://github.com/devsnek/snekfetch/commit/dfe5121834eb2b806feb5496beb5fbf6c5fa01df)] - whoops
* [[`6a404b6`](https://github.com/devsnek/snekfetch/commit/6a404b64fb7518c2d69764ee2f02ed649883b742)] - bump version
* [[`a22772d`](https://github.com/devsnek/snekfetch/commit/a22772d05ce687119d6028ddb7a6f6d3ae16153e)] - fix issue with default params
* [[`5dcb17d`](https://github.com/devsnek/snekfetch/commit/5dcb17d5a666a850a84e74171a7863eec0ce7392)] - stuff
* [[`7da75cf`](https://github.com/devsnek/snekfetch/commit/7da75cf2d21454824cdf803880f94c582ccdc6a7)] - add supplemental stuff for packages that want benefits of my rules
* [[`38558b4`](https://github.com/devsnek/snekfetch/commit/38558b4fecb546caa0d48eaa49a647b1cf3de442)] - try release with browser
* [[`9cbbb57`](https://github.com/devsnek/snekfetch/commit/9cbbb5742ece337d0b2f3d068736cffe607e3bd4)] - bump to 3.5.2
* [[`f7b4e10`](https://github.com/devsnek/snekfetch/commit/f7b4e10b0a2a23b4da81b6e0bd960a09ea8c4620)] - encoding
* [[`897f596`](https://github.com/devsnek/snekfetch/commit/897f596e03a61b7a162681e40e610c782426a963)] - add gzip test
* [[`d799b52`](https://github.com/devsnek/snekfetch/commit/d799b524152257f3835d713c11d8417d453715b7)] - move more node things out of index.js
* [[`201cd36`](https://github.com/devsnek/snekfetch/commit/201cd368b64e689d365e291d5a71789e1fb8909a)] - move node specific method out of index.js
* [[`e9a40dc`](https://github.com/devsnek/snekfetch/commit/e9a40dcb8143c4a42663c5cc487ad3737366dfab)] - clean up redirect header building
* [[`59b7e1b`](https://github.com/devsnek/snekfetch/commit/59b7e1b6ccf4c048691c7c9bc98a74ae9e79d74c)] - pass resolver/rejector to promise in then call
* [[`6b88278`](https://github.com/devsnek/snekfetch/commit/6b88278cd61a46e76164c447465a702351e912af)] - clean up
* [[`4fbff07`](https://github.com/devsnek/snekfetch/commit/4fbff07175f7f644b53815859d4c01db2df48e93)] - fix enormous bug where requests were fetched n+1 times for each call
* [[`4f89c02`](https://github.com/devsnek/snekfetch/commit/4f89c020a38aeaed3ff85f9b865dcb3fea5baae6)] - fix up markdown rendering
* [[`242cfea`](https://github.com/devsnek/snekfetch/commit/242cfea0fe06b5b48c5370acd51d263e6c2b115a)] - more scoping of agent key
* [[`9429fac`](https://github.com/devsnek/snekfetch/commit/9429facbd590b6325eeb3b0280326040fc1846d2)] - more standardization of test object
* [[`a0661e3`](https://github.com/devsnek/snekfetch/commit/a0661e368d819431722a17300c2eff545487e2cc)] - standardize test objects
* [[`f28879f`](https://github.com/devsnek/snekfetch/commit/f28879f84c7224c49df68c09a5f4ea9377ee2695)] - fuck you js strings rot in hell
* [[`95fa2ab`](https://github.com/devsnek/snekfetch/commit/95fa2abcdebd1e2c8294d80df0a624c2d5cd1e8d)] - more golf
* [[`492a04e`](https://github.com/devsnek/snekfetch/commit/492a04e6aa9c3e75daa1248cc5931947d0e4c550)] - add build link
* [[`3f2008a`](https://github.com/devsnek/snekfetch/commit/3f2008aeda01fb4ebc2f883eac03422d3463f816)] - no idea why this is so high
* [[`39ab0a4`](https://github.com/devsnek/snekfetch/commit/39ab0a451cdf228d29480c9ef3288bae0223866e)] - bump version hype
* [[`ec20c02`](https://github.com/devsnek/snekfetch/commit/ec20c02c15999ef67fa956f44c04d6e3eade77c1)] - playing code golf
* [[`ee6ef49`](https://github.com/devsnek/snekfetch/commit/ee6ef49a91ed314d5859f8c53a9e4fd457e7027c)] - new qs mock for increased tinyness
* [[`1854e6a`](https://github.com/devsnek/snekfetch/commit/1854e6aaf651e196e6d41493b426b1cb19889883)] - entries bug is only in latest npm release
* [[`a07755e`](https://github.com/devsnek/snekfetch/commit/a07755e2133121b866b4d2504a29a65d3f499389)] - fix lint
* [[`ac69061`](https://github.com/devsnek/snekfetch/commit/ac6906171fd43b492a184c2d540f2113b28d2778)] - increase coverage
* [[`58ca5a4`](https://github.com/devsnek/snekfetch/commit/58ca5a49ee4465702704c33380eabf2114cc4d44)] - [wip] testing (#18)
* [[`c7465d7`](https://github.com/devsnek/snekfetch/commit/c7465d75fafa73710d9bb8067381388a2d99c1cf)] - update jsdoc-dynamic dep
* [[`7682983`](https://github.com/devsnek/snekfetch/commit/76829830b5cc58115935301bb1afd371734bed90)] - fix site
* [[`b66f988`](https://github.com/devsnek/snekfetch/commit/b66f988a40c7c21efdb565fe81de4630aa1c0218)] - clean up config
* [[`7672006`](https://github.com/devsnek/snekfetch/commit/76720066646502bd677759b9a667a74ed5146bb5)] - new docs
* [[`0f404fc`](https://github.com/devsnek/snekfetch/commit/0f404fc2f21e91be332843ef390f3834777035de)] - fix deps for http2 from npm
* [[`d66bdf2`](https://github.com/devsnek/snekfetch/commit/d66bdf21423d65b1b159ca2d24acabdd1016a2f0)] - remove M-SEARCH because method name doc issues and no one uses it
* [[`4d2f885`](https://github.com/devsnek/snekfetch/commit/4d2f885b1ee7d6ecaaf3418230728f412965d45a)] - update jsdoc-dynamic
* [[`76d9cbd`](https://github.com/devsnek/snekfetch/commit/76d9cbda468270b81c3306c9b490db5620054e59)] - Merge branch 'master' of https://github.com/devsnek/snekfetch
* [[`7aea2c8`](https://github.com/devsnek/snekfetch/commit/7aea2c82b19a99b97468321de1153fcbf6806564)] - update issue template
* [[`7372470`](https://github.com/devsnek/snekfetch/commit/73724709c7bcb732165f12503066ba86cd922198)] - fix content type bug
* [[`d089ab7`](https://github.com/devsnek/snekfetch/commit/d089ab751bfd447c7178081a9a8e92961c05b667)] - remove socket listeners
* [[`5081c2f`](https://github.com/devsnek/snekfetch/commit/5081c2f859baed1cc1cb56af7427c7116a0255ac)] - Release 3.4.3
* [[`fd610ec`](https://github.com/devsnek/snekfetch/commit/fd610ece2d8df60cf8bc1323c1b536cf1237d11e)] - handle socket errors in a way that only node could think of
* [[`e29c9f5`](https://github.com/devsnek/snekfetch/commit/e29c9f58cf6386c3e92c9a58597ac72260969efd)] - these are static
* [[`dad2b8d`](https://github.com/devsnek/snekfetch/commit/dad2b8d235f60ab785bdbdbb7665e623571a4cea)] - update jsdoc-dynamic dep
* [[`498fc92`](https://github.com/devsnek/snekfetch/commit/498fc92ba0c63370498bcd74e5fb6c4f609a122d)] - new doc stuff
* [[`328e9e6`](https://github.com/devsnek/snekfetch/commit/328e9e6bf148ed2198d70768a017bf528b16ce1f)] - update readme
* [[`9c8dd75`](https://github.com/devsnek/snekfetch/commit/9c8dd75f3c8bf8409b4781c99d5171e2075f7d77)] - damn gitignore oddities
* [[`5ee30b2`](https://github.com/devsnek/snekfetch/commit/5ee30b2242aa8e0fd0075bd148d94f0a078d00e1)] - switch theme
* [[`30695c7`](https://github.com/devsnek/snekfetch/commit/30695c74bc7732cb002e7e4e54b4b74426154e46)] - disable emails
* [[`1b969f8`](https://github.com/devsnek/snekfetch/commit/1b969f8b391aad7de6ddc7ccc5c7a10821d1cde8)] - Docsgen (#15)
* [[`7234c5a`](https://github.com/devsnek/snekfetch/commit/7234c5a446f53f4c93b8620822c5e3aa1dd6c5ff)] - remove unused file
* [[`f011cc0`](https://github.com/devsnek/snekfetch/commit/f011cc0d2236468ea9a61ba7f1a6fd9254d2ef0f)] - Release 3.4.2
* [[`9c2af2b`](https://github.com/devsnek/snekfetch/commit/9c2af2be6975d93c5015d5f29c1f7a53216234ec)] - Release 3.4.1
* [[`69a02ae`](https://github.com/devsnek/snekfetch/commit/69a02ae653f42e51b71334853df258e990a23894)] - http2 and form data fix
* [[`2aaae71`](https://github.com/devsnek/snekfetch/commit/2aaae71aef8064a7b5d1c254c0e4ae62b4f73348)] - http2 body works now
* [[`2bcc585`](https://github.com/devsnek/snekfetch/commit/2bcc585a7eaabfaa7f9a883796cfa92fe8f4ab1a)] - Merge branch 'master' of https://github.com/devsnek/snekfetch
* [[`3a99360`](https://github.com/devsnek/snekfetch/commit/3a99360357918b751f043266573450a421aee6eb)] - delete passthrough stream
* [[`e9addda`](https://github.com/devsnek/snekfetch/commit/e9addda1930529c112823a16dc90773df8756775)] - Update index.js
* [[`d625e43`](https://github.com/devsnek/snekfetch/commit/d625e4314ae7db6138cbbc5f37b7dfbeb8176986)] - bump version
* [[`c629c15`](https://github.com/devsnek/snekfetch/commit/c629c15fa0f0268b461cae137c2da7e90e3af956)] - don't allow agent if not following redirects
* [[`9e568db`](https://github.com/devsnek/snekfetch/commit/9e568db3a83e42f83ed9f9e19b0aac14b9e4e190)] - redirect stuff
* [[`68ee0f8`](https://github.com/devsnek/snekfetch/commit/68ee0f8774da5d55f23f231fc018c3836a343424)] - [fix/browser] redirect behavior
* [[`9b9c8d8`](https://github.com/devsnek/snekfetch/commit/9b9c8d84754f9c2867ce08b1a8cc43d4781b16c7)] - fix header object name
* [[`b555054`](https://github.com/devsnek/snekfetch/commit/b555054de419a8153f0450bfe31697df71edda25)] - fix version regression
* [[`ca8fd71`](https://github.com/devsnek/snekfetch/commit/ca8fd71bae0934b3e50637f7cdc4ddaf35522f37)] - change to rc for npm release
* [[`8eabe8f`](https://github.com/devsnek/snekfetch/commit/8eabe8f960736dca0dc4638562d02f3b947e13c1)] - clean up query handling
* [[`5438a11`](https://github.com/devsnek/snekfetch/commit/5438a11944112a14e7eed3819504dade13140d26)] - webpack magic half the build size
* [[`49b3bc7`](https://github.com/devsnek/snekfetch/commit/49b3bc728b6a4e4b04c3dd4ca8c83281e78834e3)] - finalize browser builds
* [[`b9081a5`](https://github.com/devsnek/snekfetch/commit/b9081a5933cb014eb067ff4e27935a9a1a9294b6)] - clean up
* [[`9c1d4b6`](https://github.com/devsnek/snekfetch/commit/9c1d4b6128dc37caa13fb20f3093e1bf4c5aa65b)] - fix up query and final headers
* [[`80f56f8`](https://github.com/devsnek/snekfetch/commit/80f56f86a7519d1ebed62161c796db2880c153f6)] - bump version
* [[`4c5cd25`](https://github.com/devsnek/snekfetch/commit/4c5cd25549bb36f00d12aef041f7167276fd54ee)] - update readme
* [[`6350e96`](https://github.com/devsnek/snekfetch/commit/6350e965b9a97659bd93f0a47eec65b6d224f359)] - remove dev build
* [[`97333e2`](https://github.com/devsnek/snekfetch/commit/97333e2354e977c23bd8b649bcafc1cbddff8e08)] - disable process shim in a hacky way
* [[`d4bf84a`](https://github.com/devsnek/snekfetch/commit/d4bf84a44e0f2cd7fd0da9c52ea692cdb552dd24)] - fix selector error
* [[`6296e7a`](https://github.com/devsnek/snekfetch/commit/6296e7a721c6a62ca67f1419b5de9e68b540f1c2)] - wow it works
* [[`568a1f3`](https://github.com/devsnek/snekfetch/commit/568a1f3206818862a2eea70b97192d93525fa2fd)] - begin rewrite
* [[`feba8ae`](https://github.com/devsnek/snekfetch/commit/feba8ae8ceed8a3bada13503e5a2cfd6a09ac4b4)] - begin rewrite
* [[`a7d2c68`](https://github.com/devsnek/snekfetch/commit/a7d2c68f09b873a0d663c1115de5b11d9d3273b7)] - fix stupid replace error
* [[`b379521`](https://github.com/devsnek/snekfetch/commit/b3795219bc3e67b94c30c072a84c381680e3416d)] - move exports around
* [[`13d6538`](https://github.com/devsnek/snekfetch/commit/13d65386217356e1da9a230233edf30f91011bab)] - remove FormData polyfill from webpack
* [[`a0b55c1`](https://github.com/devsnek/snekfetch/commit/a0b55c1fac15e333602b0fdc6b07fdf05e4e69c4)] - bump version
* [[`4307f7e`](https://github.com/devsnek/snekfetch/commit/4307f7ea7168c4b7f4f12bdf6114bb6cd89af2e2)] - fix webpack
* [[`9a67ea9`](https://github.com/devsnek/snekfetch/commit/9a67ea914a18f053a24a5a372df5690a5988a1b4)] - bump version
* [[`7b4fff6`](https://github.com/devsnek/snekfetch/commit/7b4fff64301580b46668d46e45a88fbd0330b055)] - Merge branch 'master' of https://github.com/devsnek/snekfetch
* [[`21549f7`](https://github.com/devsnek/snekfetch/commit/21549f7edb4a7ea8a6757a7e9322766fe0e5b131)] - fix more small bugs
* [[`434b096`](https://github.com/devsnek/snekfetch/commit/434b0964d75ad4f923e8a39219d5a41595226f99)] - Add license scan report and status (#7)
* [[`bca7b08`](https://github.com/devsnek/snekfetch/commit/bca7b089e562c2e5cdbd22fc62655e1fb5c3fa55)] - add intial http2 support
* [[`f27aa24`](https://github.com/devsnek/snekfetch/commit/f27aa2406a5eeeaec6aa12b478ed14c06e0081c2)] - bump version
* [[`a06e6f1`](https://github.com/devsnek/snekfetch/commit/a06e6f1b513f89ea34f06a4038077f5958abb25e)] - Fix Content-Length header (#6)
* [[`a02c170`](https://github.com/devsnek/snekfetch/commit/a02c170f3ba279d7962a7b0c63453648608bd0ae)] - fix mime buffer checking
* [[`050c91b`](https://github.com/devsnek/snekfetch/commit/050c91b0d170394789416a70b114ecafa247becd)] - fix form uploads
* [[`cf763fc`](https://github.com/devsnek/snekfetch/commit/cf763fcd64a30e4c8c63c84d8b28240119a62563)] - bump version
* [[`75b69ad`](https://github.com/devsnek/snekfetch/commit/75b69ad1f653c57d15d4cc4a68f4968a04e6c6f0)] - add handlers for buffers and streams
* [[`3501019`](https://github.com/devsnek/snekfetch/commit/35010194ea8824e075e96dd2b13e5b94c9b7ee0a)] - so much cool stuff
* [[`b0b160b`](https://github.com/devsnek/snekfetch/commit/b0b160bed114bcc9d71932eac8cbb741351e212c)] - add agent support
* [[`9143280`](https://github.com/devsnek/snekfetch/commit/9143280d1b5f504cf7e2fd4d7a38d359f3db3195)] - Delete .fileLoader.js.swp
* [[`139f09f`](https://github.com/devsnek/snekfetch/commit/139f09f32a670371f07cb78215eab9385d12f41e)] - fix stuff
* [[`5eeae29`](https://github.com/devsnek/snekfetch/commit/5eeae2934d5aeeabea18ef86729d534da696e392)] - Update index.js
* [[`038dada`](https://github.com/devsnek/snekfetch/commit/038dada4aba8ba74423faab20dc1b9768114a3a6)] - Disable Automatic Redirects (#5)
* [[`67f2366`](https://github.com/devsnek/snekfetch/commit/67f2366a6751585958e2a5ca58278edf5a7f21e6)] - help out rollup
* [[`eaf21ae`](https://github.com/devsnek/snekfetch/commit/eaf21ae15646177d7104e20d2b7902acb6e6fed2)] - fix mime bug
* [[`ae936f5`](https://github.com/devsnek/snekfetch/commit/ae936f50d748e77f82905f64ece925e00fdbbb3a)] - bump version
* [[`6f103c9`](https://github.com/devsnek/snekfetch/commit/6f103c9f5ad9037a412413687ddfb7f4557520c9)] - wowee 404s work now
* [[`6b6e8db`](https://github.com/devsnek/snekfetch/commit/6b6e8db679e63ca9f8db7d85202263977f48e922)] - development file read/write
* [[`adf8aa1`](https://github.com/devsnek/snekfetch/commit/adf8aa1b110336be981a2a6617b0469ac5705389)] - this should really be a buffer
* [[`df8d646`](https://github.com/devsnek/snekfetch/commit/df8d6468f608f5cdb5aac1b84a83ced3c1f5eeae)] - docs and lazy load res.body
* [[`f60812f`](https://github.com/devsnek/snekfetch/commit/f60812fe9de9cfa6e0329943e64e5166f926e19e)] - ugh
* [[`cd4bfd9`](https://github.com/devsnek/snekfetch/commit/cd4bfd91bae58076e7a2f210a1ff85d4295490b1)] - merge
* [[`befd0eb`](https://github.com/devsnek/snekfetch/commit/befd0ebaf97317ea888c5e62c7aa52b789d6a0c6)] - i dunno
* [[`1db6103`](https://github.com/devsnek/snekfetch/commit/1db6103ca263c5687ed318358fee863dbad5c2b7)] - fix a thing
* [[`35736c4`](https://github.com/devsnek/snekfetch/commit/35736c42c94fda9709401e31947e2c101fec1c0a)] - add docs
* [[`c5e03b1`](https://github.com/devsnek/snekfetch/commit/c5e03b1b0cf1c4434e82c3205f70ca24c26b5144)] - bump version
* [[`50400f5`](https://github.com/devsnek/snekfetch/commit/50400f50d15fed3f0373dfabecf0e31d4e5fef49)] - fix up checking if response is here
* [[`7c35045`](https://github.com/devsnek/snekfetch/commit/7c35045e9e9dd28bfc5e0a4ed55a3ba2e6d6ecd4)] - bump version
* [[`f47ae61`](https://github.com/devsnek/snekfetch/commit/f47ae6179addc843c76041a5b0a1013c67759729)] - fix stuff
* [[`498c722`](https://github.com/devsnek/snekfetch/commit/498c722dd86ac6428e92a8f490a2d5ad07542853)] - Update package.json
* [[`9830b16`](https://github.com/devsnek/snekfetch/commit/9830b165c395c17b055e0d2c45704209a09ed904)] - fix redirecting
* [[`b03a6bb`](https://github.com/devsnek/snekfetch/commit/b03a6bb7d3b73ac3a4b27c7cfffcfbaa87d38700)] - fix extname
* [[`9b5f0bc`](https://github.com/devsnek/snekfetch/commit/9b5f0bc9700e5d2fc03bc2cdae9e6494d45e6dcd)] - Create PULL_REQUEST_TEMPLATE.md
* [[`37f0341`](https://github.com/devsnek/snekfetch/commit/37f03415473ccc52436590d4741dce40fc49d526)] - Create ISSUE_TEMPLATE.md
* [[`6679e13`](https://github.com/devsnek/snekfetch/commit/6679e138e66f50b3843ba207fc5b0dda1bc76e95)] - friggin stupid issues https://github.com/jhiesey/stream-http/pull/77
* [[`8608de3`](https://github.com/devsnek/snekfetch/commit/8608de3d1af3e8eec3c9a36b710dca72e572a728)] - disable sync
* [[`43e2312`](https://github.com/devsnek/snekfetch/commit/43e23127bb29b5660e04c2431a5c5f3cfc8d9f24)] - this is so unprofessional
* [[`88a2f7e`](https://github.com/devsnek/snekfetch/commit/88a2f7e9d5b319136c92f91fc4e07fe248c91b5f)] - i really hate working with mock libs
* [[`a79f686`](https://github.com/devsnek/snekfetch/commit/a79f6867d21ca58ffe6fc59eb77b06f257f8ad29)] - Update package.json
* [[`8c881ca`](https://github.com/devsnek/snekfetch/commit/8c881ca030ccc67d3dd40c247a85971654279991)] - i hate myself
* [[`e4c9d25`](https://github.com/devsnek/snekfetch/commit/e4c9d25d7da9293f0800b833dc702e1b15ac072e)] - i really shouldn't use webeditor
* [[`e6a467d`](https://github.com/devsnek/snekfetch/commit/e6a467d6d0798873eb0312c0d586b88373dfd2c2)] - Change read() back to _read()
* [[`25647d1`](https://github.com/devsnek/snekfetch/commit/25647d1c4dfbc57198853d5ebc17a01bbea3dd09)] - Fix breaking .getHeader typo
* [[`8a8b2eb`](https://github.com/devsnek/snekfetch/commit/8a8b2eba604450363bf80e8e0caac97157f15820)] - Update package.json
* [[`d6d7364`](https://github.com/devsnek/snekfetch/commit/d6d7364438ce034040655a80e3edb6f0f20ea669)] - Update index.js
* [[`fa1566c`](https://github.com/devsnek/snekfetch/commit/fa1566c04831fa7272e01dff8936e1f5d467dc6b)] - Update index.js
* [[`89ee801`](https://github.com/devsnek/snekfetch/commit/89ee801ae233177b8cbca8e1fd02cd9915264e2b)] - bump version
* [[`0f2f25e`](https://github.com/devsnek/snekfetch/commit/0f2f25e2620de84e41b2ab0465a73af87b3471f2)] - make send smarter
* [[`24077d8`](https://github.com/devsnek/snekfetch/commit/24077d847f1ddf6149c8ae9ce1448f046c94946b)] - optimize
* [[`f94a195`](https://github.com/devsnek/snekfetch/commit/f94a195dc1048a249858a234b691073543172d3b)] - bump to 3.0.3
* [[`06a7a0e`](https://github.com/devsnek/snekfetch/commit/06a7a0ee1e994bae5947faef6730b5607f5e18b0)] - all sorts of cleanup
* [[`1eb5225`](https://github.com/devsnek/snekfetch/commit/1eb52253daa176a2391fc8aab329e7b095f46671)] - better query
* [[`a2dbe10`](https://github.com/devsnek/snekfetch/commit/a2dbe10b308f9d9ffad8debac3f83bab37c1de8a)] - query
* [[`224554f`](https://github.com/devsnek/snekfetch/commit/224554f658db6489deb253b327fbaa53d839c2ca)] - rip
* [[`ebf0c31`](https://github.com/devsnek/snekfetch/commit/ebf0c310c8e1d5c72ec1c1447b0b06b0c868de55)] - remove timeout
* [[`71fa23a`](https://github.com/devsnek/snekfetch/commit/71fa23aec96a4a40ce6acca2ed104db20308c8e6)] - add timeout
* [[`8a54efd`](https://github.com/devsnek/snekfetch/commit/8a54efdb43c46fddea69d83a7b0361f2f59fa7bb)] - fix extremely stupid mistake
* [[`572e34c`](https://github.com/devsnek/snekfetch/commit/572e34c14bd1b78a6287091cfc54784d49a90dc9)] - bump to 3.0.1
* [[`6073d6c`](https://github.com/devsnek/snekfetch/commit/6073d6cbc847dfc3e2f0667b9bd5dc4e1aba7348)] - standardize methods, properly emit errors when piping
* [[`63a0abb`](https://github.com/devsnek/snekfetch/commit/63a0abb0a5863e6cbb19919eb7f5438b8711e142)] - add sync requests for memes not real usage
* [[`390f8f4`](https://github.com/devsnek/snekfetch/commit/390f8f49f0300924fb12ada247c6ff8b1133df5d)] - add sync requests for memes not real usage
* [[`50ae37a`](https://github.com/devsnek/snekfetch/commit/50ae37a558c1dd1b8a345e299a5f23a8987bc9e4)] - add sync requests for memes not real usage
* [[`dd0c84b`](https://github.com/devsnek/snekfetch/commit/dd0c84becf244f4b5157c3874a1f8812ef714c78)] - v3 | 125.720833 | 172 | 0.801014 | yue_Hant | 0.136929 |
988c0f4e18acbcbc8933aa80cc80150ce7d3fd06 | 569 | md | Markdown | site/content/post/sign_up_for_github.md | yoocda-CentOS6/one-click-hugo-cms | 72a6fd00468647f10dff2a165c7311dea1fd7105 | [
"MIT"
] | null | null | null | site/content/post/sign_up_for_github.md | yoocda-CentOS6/one-click-hugo-cms | 72a6fd00468647f10dff2a165c7311dea1fd7105 | [
"MIT"
] | 2 | 2021-03-09T03:12:09.000Z | 2022-03-15T19:17:17.000Z | site/content/post/sign_up_for_github.md | yoocda-CentOS6/one-click-hugo-cms | 72a6fd00468647f10dff2a165c7311dea1fd7105 | [
"MIT"
] | null | null | null | ---
title: GitHubにアカウントを作る
date: '2018-10-15T22:59:22+09:00'
description: こんばんは、batapy88です。今日はGitHubにアカウントを作る方法をメモしておきます。
---
## GitHubアカウント作成手順
1. GitHub（[https://github.com](https://github.com)）を開きます
2. 「Username」、「Email」、「Password」を入力してから「Sign up for GitHub」をクリックします
3. 「Create an account」をクリックします
4. プランは「Free」にしておき、メールを受け取る場合はチェックボックスにチェックを入れ、その後「Continue」をクリックします
5. 「Submit」をクリックします
6. 先ほど登録したメールアドレスに、GitHubからメールが届いているので開きます
7. メール内のリンク「Verify email address」をクリックします
「Your email was verified.」が表示された状態のGitHubのWebページが表示されればOK！！
これでGitHubアカウントの作成完了です。
| 21.884615 | 69 | 0.790861 | jpn_Jpan | 0.330469 |
988c83d9c12e26ea38696ea6a7527d9ce6bb0f3e | 3,670 | md | Markdown | _posts/2018-06-29-algorithm-stack.md | greeksharifa/greeksharifa.github.io | a524900a4a45109a3b17d4729537352c15274ff8 | [
"MIT"
] | 6 | 2018-06-30T02:30:18.000Z | 2020-10-09T13:10:18.000Z | _posts/2018-06-29-algorithm-stack.md | greeksharifa/greeksharifa.github.io | a524900a4a45109a3b17d4729537352c15274ff8 | [
"MIT"
] | 2 | 2018-07-01T15:44:05.000Z | 2019-09-20T13:05:21.000Z | _posts/2018-06-29-algorithm-stack.md | greeksharifa/greeksharifa.github.io | a524900a4a45109a3b17d4729537352c15274ff8 | [
"MIT"
] | 4 | 2018-12-25T00:53:10.000Z | 2020-11-01T08:55:17.000Z | ---
layout: post
title: Stack(스택)
author: YouWon
categories: [Algorithm & Data Structure]
tags: [Stack]
---
## 참조
분류 | URL
-------- | --------
문제 | [스택](https://www.acmicpc.net/problem/10828), [괄호](https://www.acmicpc.net/problem/9012)
응용 문제 | [스포일러 문제](https://www.acmicpc.net/problem/6549)
이 글에서 설명하는 라이브러리 | [std::stack](http://www.cplusplus.com/reference/stack/stack/)
---
## 개요
### 시간복잡도: $ O(M) $
### 공간복잡도: $ O(N) $
- N은 원소의 수, M은 연산의 수이다.
- 스택 자체는 알고리즘이 아닌 자료구조이지만, 스택을 쓰는 경우 복잡도는 위와 같이 나온다.
이 글에서는 스택(stack)이라고 하는 자료구조와, 이를 활용한 문제들을 살펴볼 것이다.
스택은 간단하면서도 매우 유용한 자료구조이다. 여러분의 실생활에서도 자주 볼 수 있는 개념이다.
그리고 알고리즘으로 적용하기에도 쉽다. 그럼 스택은 무엇인가?
---
## Stack(스택)
스택([stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)))의 사전적 의미는 더미(무더기)이다.
스택은 다음 그림으로 설명된다.
책상 위에 책을 몇 권 쌓는 것과 같다. 1번 책을 쌓고, 2번 책을 쌓고, ... , 6번 책까지 쌓았다고 하자.
그리고 책을 한 권을 집는다고 치자. 그러면 여러분은 (정상적이라면) 몇 번 책을 집겠는가?
사서 고생하는 사람이 아니라면 굳이 아래쪽 책을 힘들게 빼진 않을 것이다. 즉, 6번 책을 뺄 것이다. 위의 그림과 갈다.
첫 번째 pop(책을 빼는 것) 연산은 가장 마지막에 들어온 6번부터 행해진다.
이것을 Last-In-First-Out이라 부른다. 즉 가장 나중에 들어온 것이 제일 먼저 나간다는 의미이다.
이것이 스택의 전부이다. 그리고 C++의 STL에는 이것이 친절히 구현되어 있다. 다음에서 살펴보자.
## std::stack 사용법
### Include
우선 include를 해야 한다. 특별히 큰 프로젝트에서 쓰는 것이 아니라면, `std::`를 매번 쓰기 귀찮으니 namespace도 써 주자.
```cpp
#include <stack>
using namespace std;
```
### 선언
stack은 generic으로 구현된 template이다. 즉, stack에 들어갈 데이터 타입을 정해야 한다.
보통 int나 char 등을 사용하게 될 것이다. 물론 기본형 뿐만 아니라 사용자 정의 타입도 가능하다.
```cpp
stack<int> st; // 현재 비어 있다.
// stack<char> st_c;
// stack<dot_2d> st_person; // dot_2d는 알아서 정의하시길...
```
### push(e)
스택에 무언가를 집어넣는(push) 연산이다. e는 집어넣을 원소이다.
```cpp
st.push(10); // 10
st.push(20); // 10 20
st.push(30); // 10 20 30
st.push(777); // 10 20 30 777
```
### size()
스택의 현재 size를 반환한다. 몇 개나 들어 있는지 알고 싶을 때 쓰면 된다.
```cpp
printf("size: %d\n", st.size()); // size: 4
st.push(999);
printf("size: %d\n", st.size()); // size: 5
```
### top()
스택의 맨 위 원소를 반환한다. 스택에서는 맨 위의 것만 빼낼 수 있다. 다른 원소에는 접근이 불가능하다.
물론 스택을 직접 구현한다면 접근 가능하게 할 수도 있지만, 스택을 쓰는 데 그렇게 할 이유가..?
```cpp
int e = st.top();
printf("top: %d\n", e); // top: 999
```
### pop()
스택의 맨 위 원소를 제거한다. 책을 하나 가져갔다고 생각하면 된다.
반환값이 `void`이므로 리턴값으로 top 값을 알아낼 수는 없다.
또, 비어 있는데 pop을 수행하려고 하면 런타임 에러를 발생시킨다.
```cpp
st.pop(); // 999가 제거됨
for (int i = 0; i < 3; i++)
st.pop();
// 777, 30, 20이 차례로 제거됨
```
### empty()
스택이 비었는지를 검사한다. `size() == 0` 구문으로 체크할 수도 있지만, 이쪽이 더 직관적이다. 그리고 생각보다 자주 쓰게 된다.
```cpp
if (st.empty())
printf("stack is empty, 1\n");
st.pop(); // 10이 제거됨
if (st.empty())
printf("stack is empty, 2\n");
// stack is empty, 2
```
### emplace(e)
STL에서 emplace는 생성자를 호출하면서 `push`(혹은 `push_back`)하는 것과 동일하다.
이 기능은 stack에 기본형 말고 `dot_2d`와 같은 사용자 정의 함수나 생성자 호출이 필요한 데이터 타입을 넣었을 때 필요하다.
int와 같은 기본형을 넣을 때는 별 차이가 없다.
```cpp
st.emplace(-3);
printf("top: %d\n", st.top()); // top: -3
```
### swap(another_stack)
같은 데이터 타입을 담고 있는 다른 스택과 원소 전체를 swap한다.
```cpp
stack<int> another_st;
st.swap(another_st);
if (st.empty())
printf("stack is empty, 3\n");
// stack is empty, 3
```
스택은 사실상 이게 전부이다. 그리고 생각보다 많은 문제를 풀 수 있다.
물론 대부분은 너무 뻔히 풀이가 스택이라는 것이 보이지만, 안 그런 것도 있다(스포일러 문제 참조)
## 문제 풀이
### BOJ 10828(스택)
문제: [스택](https://www.acmicpc.net/problem/10828)
풀이: [BOJ 10828(스택) 문제 풀이](https://greeksharifa.github.io/ps/2018/07/08/PS-10828/)
### BOJ 09012(괄호)
문제: [괄호](https://www.acmicpc.net/problem/9012)
풀이: [BOJ 09012(괄호) 문제 풀이](https://greeksharifa.github.io/ps/2018/07/08/PS-09012/)
### 스포일러 문제
문제: [스포일러 문제](https://www.acmicpc.net/problem/6549)
풀이: [스포일러 풀이 ](https://greeksharifa.github.io/ps/2018/07/07/PS-06549/)
| 20.388889 | 92 | 0.622071 | kor_Hang | 1.000009 |
988c96d92b9f4b7d1ad159c2ecb79b7eeb7df11e | 3,019 | md | Markdown | _posts/2017-01-22-regression-and-nn.md | logancyang/blog-learning-automata | ce54e1cfa0ddae83719369007aec8121160b461f | [
"Apache-2.0"
] | null | null | null | _posts/2017-01-22-regression-and-nn.md | logancyang/blog-learning-automata | ce54e1cfa0ddae83719369007aec8121160b461f | [
"Apache-2.0"
] | 1 | 2020-05-28T16:19:30.000Z | 2020-05-28T22:29:18.000Z | _posts/2017-01-22-regression-and-nn.md | logancyang/blog-learning-automata | ce54e1cfa0ddae83719369007aec8121160b461f | [
"Apache-2.0"
] | null | null | null | ---
toc: true
layout: post
description: Notes for Hinton's Neural Network course
categories: [note]
title: "Hinton Neural Network course"
comments: true
---
## Regression
The word regression comes from "regression to the mean" like the parent-children height example. Later it
actually means *using functional form to approximate a bunch of data points*.
**i.i.d.**: Independent and identically distributed, a fundamental assumption for the data.
- Linear Regression
- Polynomial Regression
- Cross Validation
- Split the training set into training and validation set. K-fold cross validation.
- To determine the complexity of the model (degree of polynomial in the case of polynomial regression), choose the complexity with the lowest validation error
<br>
## Neural Networks
- Perceptron: $ \mathbf{wx} = y $, threshold $ y $ to get $ \hat{y} $
- If linearly separable, it *will* find a solution
- If not, it won't stop. But there's no way to know when to stop and declare it's not linearly separable.
- Gradient Descent: $ \mathbf{wx} = a $, activation. There's no thresholding.
- Perceptron vs. Gradient descent
- Perceptron:
$$
\Delta w_i = \eta * (y - \hat y) x_i
$$
- Gradient descent:
$$
\Delta w_i = \eta * (y - a) x_i
$$
- Difference: activation with or without thresholding. Gradient descent is more robust, it needs a differentiable loss. The 1-0 loss of perceptron is not differentiable.
- To get a differentiable / softer thresholding function, we have sigmoid (literally means s-like).
- Sigmoid unit in NN is just a softer thresholding version of Perceptron.
- Back-propagation for error: computationally beneficial organization of the chain rule.
- Local optima: For a single sigmoid unit, the error looks like a parabola because its quadratic. For many sigmoid units as in NN, there will be a lot of local optima.
- Learning = optimization
- Note that a 1-layer NN with sigmoid activation is equivalent to Logistic Regression!
- NN complexity
- More nodes
- More layers
- Larger weights
- Restriction bias: what it is that you are able to represent, the restriction on possible hypotheses functions
- Started out with Perceptron, linear
- Then more perceptrons for more complex functions
- Then use sigmoids instead of 1-0 hard thresholding
- So NN doesn't have much restriction. It can represent any boolean function (more units), any continuous function (one hidden layer), and any arbitrary function with discontinuities (more hidden layers).
- Danger of overfitting: use certain network structures, and cross validation.
- Preference bias: given two algorithm representations, why we prefer one over the other
- Initialize weights at small random values
- Always prefer simpler models when the error is similar: Occam's Razor
- Summary
- Perceptrons: thresholding unit
- Networks can produce any Boolean function.
- Perceptron rule: finite time for linearly separable data
- General differentiable rule - back propagation & gradient descent
| 45.742424 | 206 | 0.758529 | eng_Latn | 0.995769 |
988d33e7bfc4993ac778dfe31037200891f1098a | 2,515 | md | Markdown | _posts/2019-07-06-Download-the-myth-of-junk-dna.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | 2 | 2019-02-28T03:47:33.000Z | 2020-04-06T07:49:53.000Z | _posts/2019-07-06-Download-the-myth-of-junk-dna.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | _posts/2019-07-06-Download-the-myth-of-junk-dna.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download The myth of junk dna book
Hal?" others. Or the kid might have the myth of junk dna placed for adoption through some baby brokerage in it strictly for the myth of junk dna money? Sacrificial Eminence on Vaygat's Island, a friend of Celestina's. driving Leilani to further evasion. Peterson, you know. Even the best implants don't look that natural. " hour before closing, after providing us with excellent "Neither one of the myth of junk dna facts is so incredible compared to some of the strange things in this world," said by the weight of all the hopes and dreams that people had allowed to die here over the years. So the queen sent after her and she came to her, my thoughts on other things; it had led us south-western headland of Vaygats Island. (180) Magic The seamstress held up the khakis and raised her eyebrows. Are you married, many shades darker than this infant. selfishness was the most misunderstood, ii, and I was the myth of junk dna to die of chagrin and impatience; [and indeed he returned not] and I passed my night on wake, with a long nose and sad eyes. "Good movie!" Curtis afford, and she was settled with her mending, "The congressman is them, I'm with you," he told them, they rejoiced with an exceeding joy and knew that the king's grief arose from regret for him. " it. Tamils, The myth of junk dna and St. " not, oblivious of the bite, they wore shorts and T-shirts, blue -- they could not have been have that within a single decade a number of vessels should sail that cavern was not on Roke. pleasing patterns is also employed. There were dozens of them lying motionless in the sand within a the innocent in the freight-train path of nature, foaming than he would otherwise have been-and a far better one. He and his comrades in misfortune was drifting in the sea," we may conclude that this haven was many single acts of violence, no, no prejudices against people of any nationality, and the floorboards creak under new weight, even when caked in her own vomit and reeking of urine and babbling "Where?" He looked around the restaurant. Now you will have a house, number-one ceremonial uniforms will be Worn, hah-hah "Good girl, and the neat, had served eleven years for second-degree murder and on the 2010th August they believed that they were off the mouth 55, till the king give you tidings of your lord El Abbas. He feels as though his head is going to explode or that Curtis shook his head. He prayed to it. | 279.444444 | 2,421 | 0.780517 | eng_Latn | 0.999968 |
988e6816df0ad07835db599ffe812c741bea8926 | 3,680 | md | Markdown | README.md | fusion-energy/dagmc_geometry_slice_plotter | c9caf2bde932d466d54404fd6cf558dd403da670 | [
"MIT"
] | null | null | null | README.md | fusion-energy/dagmc_geometry_slice_plotter | c9caf2bde932d466d54404fd6cf558dd403da670 | [
"MIT"
] | 12 | 2021-10-21T17:04:22.000Z | 2022-03-07T10:10:06.000Z | README.md | fusion-energy/dagmc_geometry_slice_plotter | c9caf2bde932d466d54404fd6cf558dd403da670 | [
"MIT"
] | 1 | 2021-12-03T12:24:20.000Z | 2021-12-03T12:24:20.000Z | [](https://www.python.org)
[](https://github.com/fusion-energy/dagmc_geometry_slice_plotter/actions/workflows/ci_with_install.yml)
[](https://pypi.org/project/dagmc-geometry-slice-plotter/)
[](https://codecov.io/gh/fusion-energy/dagmc_geometry_slice_plotter)
A minimal Python package that produces slice plots through h5m DAGMC geometry files
# Installation
```bash
pip install dagmc_geometry_slice_plotter
```
# Python API Usage
These examples assume you have a h5m file called ```dagmc.h5m``` in the same
folder that the Python script is being run from.
Create a plot of a slice through the geometry perpendicular to the Z axis and
default settings elsewhere. This will slice through the the center of the
geometry as plane_origin has not been specified.
```python
from dagmc_geometry_slice_plotter import plot_slice_of_dagmc_geometry
plot = plot_slice_of_dagmc_geometry(
dagmc_file_or_trimesh_object='dagmc.h5m',
plane_normal=[0, 0, 1],
)
plot.show()
```
Create a plot of a slice through the geometry perpendicular to the Z axis,
offset by 200cm and with default settings elsewhere.
```python
from dagmc_geometry_slice_plotter import plot_slice_of_dagmc_geometry
plot = plot_slice_of_dagmc_geometry(
dagmc_file_or_trimesh_object='dagmc.h5m',
plane_origin=[0, 0, 200],
plane_normal=[0, 0, 1],
)
plot.show()
```
Create a plot of a slice through the geometry perpendicular to the Y axis, with
a rotation of 45 degrees and with default settings elsewhere. Also saves the
plot with a high resolution (DPI)
```python
from dagmc_geometry_slice_plotter import plot_slice_of_dagmc_geometry
plot = plot_slice_of_dagmc_geometry(
dagmc_file_or_trimesh_object='dagmc.h5m',
plane_normal=[0, 1, 0],
rotate_plot=45,
)
plot.savefig('example_3_slice.png', dpi=600)
```
Saves a png image of a plot of a slice through the geometry perpendicular to
the X axis and with default settings elsewhere.
```python
from dagmc_geometry_slice_plotter import plot_slice_of_dagmc_geometry
plot = plot_slice_of_dagmc_geometry(
dagmc_file_or_trimesh_object='dagmc.h5m',
plane_normal = [1, 0, 0],
rotate_plot=270,
)
plot.savefig('example_4_slice.png')
```
# Related packages
This package is used by the [regular_mesh_plotter](https://github.com/fusion-energy/regular_mesh_plotter) Python package to combine slice plots with regular mesh tally results and produce images like below.
| 40 | 247 | 0.797011 | eng_Latn | 0.501218 |
988e9d4bce39fcd47e783e9508d4fcf1815226d7 | 110 | md | Markdown | README.md | sketch1900/Random-Scripts-and-code | a258d66cb538282f77d60b865c4ba82622da0f05 | [
"MIT"
] | null | null | null | README.md | sketch1900/Random-Scripts-and-code | a258d66cb538282f77d60b865c4ba82622da0f05 | [
"MIT"
] | null | null | null | README.md | sketch1900/Random-Scripts-and-code | a258d66cb538282f77d60b865c4ba82622da0f05 | [
"MIT"
] | null | null | null | # Random-Scripts-and-code
Just a general place to put activity too even if its random or for code challanges.
| 36.666667 | 83 | 0.790909 | eng_Latn | 0.979902 |
988eb700c61279275ad9a3635aa45c3ffd4a2897 | 1,865 | md | Markdown | content/post/operadores-binarios-em-golang.md | go-br/gopher.pro.br | 92d3f370737166f2b40012a02028f5863e300598 | [
"MIT"
] | 3 | 2018-06-02T06:43:20.000Z | 2019-04-05T00:34:07.000Z | content/post/operadores-binarios-em-golang.md | go-br/gopher.pro.br | 92d3f370737166f2b40012a02028f5863e300598 | [
"MIT"
] | 1 | 2019-12-24T14:48:23.000Z | 2022-02-28T00:52:37.000Z | content/post/operadores-binarios-em-golang.md | go-br/gopher.pro.br | 92d3f370737166f2b40012a02028f5863e300598 | [
"MIT"
] | 4 | 2018-07-06T17:19:02.000Z | 2020-04-14T01:21:54.000Z | +++
title = "Operadores binários em Golang"
date = "2020-10-28T22:48:34-03:00"
description = "Exemplos de operadores binários em Go"
tags = ["golang"]
+++
# Operadores binários em Golang
Exemplos de operadores binários em Go
É importante não confundir operadores binários com operadores lógicos, operadores lógicos tem os mesmos nomes mas usam símbolos diferentes e geralmente agem sobre bytes ou sobre a palavra básica da maquina, enquanto operadores binários agem bit a bit.
Para efeito de exemplo considere seguintes variáveis:
```golang
var v bin = 60 // 0011 1100
var b bin = 13 // 0000 1101
```
## AND
```golang
c := v & b
```
Equivalente a *0011-1100 & 0000-1101* e o resultado será *0000-1100*.
## OR
```golang
c = v | b
```
Equivalente a *0011-1100 | 0000-1101* e o resultado será *0011-1101*.
## NOT AND
```golang
c = v &^ b
```
Equivalente a *0011-1100 &^ 0000-1101* e o resultado será *0011-0000*. Uma curiosidade é que esse é o único operador que você realmente precisa, todos os outros operadores podem ser derivados de *NOT END*.
## LEFT SHIFT
```golang
c = v << 2
```
Equivalente a *0011-1100 << 0000-1101* e o resultado será *1111-0000*. Você também pode pensar no *LEFT SHIFT* como multiplicar por dois.
## RIGHT SHIFT
```golang
c = v >> 2
```
Equivalente a *0011-1100 >> 0000-1101* e o resultado será *0000-1111*. Você também pode pensar no *RIGHT SHIFT* como dividir por dois.
## XOR
```golang
c = v ^ b
```
Equivalente a *0011-1100 ^ 0000-1101* e o resultado será *0011-0001*. Eu sei que é tentador mas não use *XOR* para criptografia, pelo menos não sozinho.
### Arquivos desse post
- [operadores-binarios/README.md](https://github.com/go-br/estudos/blob/master/exemplos/operadores-binarios/README.md)
- [operadores-binarios/main.go](https://github.com/go-br/estudos/blob/master/exemplos/operadores-binarios/main.go)
| 25.547945 | 251 | 0.714745 | por_Latn | 0.990079 |
988ef1e5fb498abb12d8dc9dce54d7315df72498 | 3,195 | md | Markdown | README.md | craigolson/Optics-and-Systems | cf0bbcd2befd661795948c98b11bbb4c72a45e09 | [
"Unlicense"
] | 1 | 2021-12-27T05:20:52.000Z | 2021-12-27T05:20:52.000Z | README.md | craigolson/Optics-and-Systems | cf0bbcd2befd661795948c98b11bbb4c72a45e09 | [
"Unlicense"
] | null | null | null | README.md | craigolson/Optics-and-Systems | cf0bbcd2befd661795948c98b11bbb4c72a45e09 | [
"Unlicense"
] | 2 | 2020-02-14T22:41:27.000Z | 2021-04-26T20:12:20.000Z | # Optics-and-Systems
Class lineofsight.py
This class supports calculation of line-of-sight motion-induced modulation
transfer function (MTF) from either time-series or power spectrum data.
The basic object represents a time series from which a brute force histogram-
based point-spread function can be calculated for a given integration time.
The PSF is used to derive the MTF
For details and author contact information please see the following reference:
- S. Craig Olson, David Gaudiosi, Andrew Beard, Rich Gueler,
"Statistical evaluation of motion-based MTF for full-motion video using
the Python-based PyBSM image quality analysis toolbox", Proc. SPIE 10650,
Long-Range Imaging III, 106500L (11 May 2018); doi: 10.1117/12.2305406;
https://doi.org/10.1117/12.2305406
The class is intended to support the PyBSM imaging model outlined here:
- LeMaster, D. and Eismann, M., ìpyBSM: A Python package for modeling imaging
systems,î Proc. SPIE 10204; Long-Range Imaging II, 1020405 (2017),
doi: 10.1117/12.2262561
The calculation methods are based entirely on openly available formalism primarily
fromthe following two sources:
- Kopeika, N., [A System Approach to Imaging], SPIE Press, (1998).
- Youngworth, R., Gallagher, B.B., and Stamper, B.L., ìAn overview of power
spectral density (PSD) calculations,î Proc. SPIE 5869; Optical Manufacturing
and Testing VI, 58690U, (2005) doi: 10.117/12.618478
Note that in order to use this class with the existing PyBSM framework an auxiiliary
motion MTF helper function is required; this code will be posted in the near future to
reproduce the paper results in the first reference above.
An interesting follow-on exercise would be to implement the method of moments technique
outlined in Kopeika's text and paper for a potentially faster and analytically
tractable method of computing MTF
Currently the code only supports a 1-D MTF using single-dimension vectors (although X and y
components are demosntrated here). PyBSM can accomodate fully 2D MTF and PSF arrays.
This was not implemented in this version to maintain decent computational efficiency.
MIT License
Copyright (c) 2018 Stephen Craig Olson
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
| 47.686567 | 91 | 0.794992 | eng_Latn | 0.949376 |
988f095df1ae6f5777bf6d8fa174222dcde2f398 | 52,330 | md | Markdown | _posts/2022-03-04-11.md | nowgyung/nowgyung.github.io | 69d61cd73af10f0ca37baa035c4abc837b3365f9 | [
"MIT"
] | null | null | null | _posts/2022-03-04-11.md | nowgyung/nowgyung.github.io | 69d61cd73af10f0ca37baa035c4abc837b3365f9 | [
"MIT"
] | null | null | null | _posts/2022-03-04-11.md | nowgyung/nowgyung.github.io | 69d61cd73af10f0ca37baa035c4abc837b3365f9 | [
"MIT"
] | null | null | null | ---
layout: single
title: "jupyter_11. 누적 막대 그래프"
categories: jupyter_matplotlib
tag: [python, blog, jupyter, matplotlib]
toc: true
author_profile: false
---
<head>
<style>
table.dataframe {
white-space: normal;
width: 100%;
height: 240px;
display: block;
overflow: auto;
font-family: Arial, sans-serif;
font-size: 0.9rem;
line-height: 20px;
text-align: center;
border: 0px !important;
}
table.dataframe th {
text-align: center;
font-weight: bold;
padding: 8px;
}
table.dataframe td {
text-align: center;
padding: 8px;
}
table.dataframe tr:hover {
background: #b8d1f3;
}
.output_prompt {
overflow: auto;
font-size: 0.9rem;
line-height: 1.45;
border-radius: 0.3rem;
-webkit-overflow-scrolling: touch;
padding: 0.8rem;
margin-top: 0;
margin-bottom: 15px;
font: 1rem Consolas, "Liberation Mono", Menlo, Courier, monospace;
color: $code-text-color;
border: solid 1px $border-color;
border-radius: 0.3rem;
word-break: normal;
white-space: pre;
}
.dataframe tbody tr th:only-of-type {
vertical-align: middle;
}
.dataframe tbody tr th {
vertical-align: top;
}
.dataframe thead th {
text-align: center !important;
padding: 8px;
}
.page__content p {
margin: 0 0 0px !important;
}
.page__content p > strong {
font-size: 0.8rem !important;
}
</style>
</head>
# 11. 누적 막대 그래프
```python
import pandas as pd
```
```python
import matplotlib.pyplot as plt
import matplotlib
matplotlib.rcParams['font.family'] = 'Malgun Gothic' # Windows
# matplotlib.rcParams['font.family'] = 'AppleGothic' # Mac
matplotlib.rcParams['font.size'] = 15 # 글자 크기
matplotlib.rcParams['axes.unicode_minus'] = False # 한글 폰트 사용 시, 마이너스글자가 깨지는 현상을 해결
```
```python
df = pd.read_excel('../Pandas/score.xlsx') # 부모파일에 있는 Pandas에 있는 score 엑셀파일을 사용하겠다
df
```
<div>
<style scoped>
.dataframe tbody tr th:only-of-type {
vertical-align: middle;
}
.dataframe tbody tr th {
vertical-align: top;
}
.dataframe thead th {
text-align: right;
}
</style>
<table border="1" class="dataframe">
<thead>
<tr style="text-align: right;">
<th></th>
<th>지원번호</th>
<th>이름</th>
<th>학교</th>
<th>키</th>
<th>국어</th>
<th>영어</th>
<th>수학</th>
<th>과학</th>
<th>사회</th>
<th>SW특기</th>
</tr>
</thead>
<tbody>
<tr>
<th>0</th>
<td>1번</td>
<td>채치수</td>
<td>북산고</td>
<td>197</td>
<td>90</td>
<td>85</td>
<td>100</td>
<td>95</td>
<td>85</td>
<td>Python</td>
</tr>
<tr>
<th>1</th>
<td>2번</td>
<td>정대만</td>
<td>북산고</td>
<td>184</td>
<td>40</td>
<td>35</td>
<td>50</td>
<td>55</td>
<td>25</td>
<td>Java</td>
</tr>
<tr>
<th>2</th>
<td>3번</td>
<td>송태섭</td>
<td>북산고</td>
<td>168</td>
<td>80</td>
<td>75</td>
<td>70</td>
<td>80</td>
<td>75</td>
<td>Javascript</td>
</tr>
<tr>
<th>3</th>
<td>4번</td>
<td>서태웅</td>
<td>북산고</td>
<td>187</td>
<td>40</td>
<td>60</td>
<td>70</td>
<td>75</td>
<td>80</td>
<td>NaN</td>
</tr>
<tr>
<th>4</th>
<td>5번</td>
<td>강백호</td>
<td>북산고</td>
<td>188</td>
<td>15</td>
<td>20</td>
<td>10</td>
<td>35</td>
<td>10</td>
<td>NaN</td>
</tr>
<tr>
<th>5</th>
<td>6번</td>
<td>변덕규</td>
<td>능남고</td>
<td>202</td>
<td>80</td>
<td>100</td>
<td>95</td>
<td>85</td>
<td>80</td>
<td>C</td>
</tr>
<tr>
<th>6</th>
<td>7번</td>
<td>황태산</td>
<td>능남고</td>
<td>188</td>
<td>55</td>
<td>65</td>
<td>45</td>
<td>40</td>
<td>35</td>
<td>PYTHON</td>
</tr>
<tr>
<th>7</th>
<td>8번</td>
<td>윤대협</td>
<td>능남고</td>
<td>190</td>
<td>100</td>
<td>85</td>
<td>90</td>
<td>95</td>
<td>95</td>
<td>C#</td>
</tr>
</tbody>
</table>
</div>
```python
plt.bar(df['이름'], df['국어'])
plt.bar(df['이름'], df['영어'])
```
<pre>
<BarContainer object of 8 artists>
</pre>
<img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAXwAAAD+CAYAAAA56L6tAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjQuMywgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/MnkTPAAAACXBIWXMAAAsTAAALEwEAmpwYAAAcHUlEQVR4nO3deZhdVZ3u8e+bidCMgYRBSFEoAl6xpU1ACIi5dECUXC7YosADTQzXoCLKFZnEbkOriMpwAU0CjS2IA3ppkHQDUUkjXugAhkYGRbCFROESBpEYMkHg13+sfczOqXOqTp2zqyrWej/Pc56qs9fee606w7vXXnsoRQRmZjb8jRjqBpiZ2eBw4JuZZcKBb2aWCQe+mVkmHPhmZpkYNdQN6M348eOju7t7qJthZvZn5b777ns+IibUT9+oA7+7u5vFixcPdTPMzP6sSFraaLqHdMzMMuHANzPLhAPfzCwTDnwzs0w48M3MMtGvwJf0ekn/JunIuunTJT0kaY2kByUdXFe+u6SFklZJ+p2kT1TQdjMz64eWAl9Sl6QrgAeAKXVlk4BrgTOAccBcYL6kiUX5ZsBtwI+B8cBxwGxJ763qjzAzs7612sPfF9iCFPbL6srOBOZFxIKIWB0Rc4G7gZlF+d8CT0XEBRGxKiL+H3ARcGrnzTczs1a1FPgRcX1EHBcRDzUongbcWjftNtbvCTQr30+S+tNYMzNrX0dX2kraGtgGeLyuaCmwc/H7G4AbG5SPJQ3xPFe3zlnALICurq5OmmdmALO3GsK6lw9d3R3qPvvmIa1/yQWHV77OTs/S2bz4uapu+kpgk9I8jcopzfMnEXFlREyOiMkTJvS4FYSZmbWp08B/pfg5pm76WNaH/CtNyqHnhsDMzAZIp4H/PLAWmFg3vYv1wzxPNilfHhEvdFi/mZm1qKPAj4hXgUXAIXVF04CFxe939lFuZmaDoIorbS8BzpD0TkljJZ0M7AVcXZRfRToj56NF+YHAJ4EvV1C3mZm1qOPAj4j5wLmki69eBI4BDo2IFUX5U8B00pk3y4ErgQ9FxD2d1m1mZq3r92mZEdHdYNocYE4vy/wU2Lu/dZmZWXV88zQzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTHf1P243ZUP4/yoH4X5RmZp1yD9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTAzbWyssGXvcENa+fAjrNrMqDG2GwEDkiHv4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZqCTwJY2VdKmkZyStkPQTSZNL5dMlPSRpjaQHJR1cRb1mZta6qnr45wMHFY8dgQXADyVtIWkScC1wBjAOmAvMlzSxorrNzKwFVQX+JOAbEfFoRLwEfAnYHNgdOBOYFxELImJ1RMwF7gZmVlS3mZm1oKrA/zbwQUl7StocOBd4CHgQmAbcWjf/bcCUiuo2M7MWVHWl7T8C7wIeKZ7/kdTr3wzYBni8bv6lwM6NViRpFjALoKurq6LmWav8z9/Nhq+qevhfAHYC3kwK+C+RevFbFuWr6uZfCWzSaEURcWVETI6IyRMmTKioeWZm1nEPX9I2wOnAWyLisWLy+ZKmAh8sno+pW2wsPTcCZmY2gKro4e8GUAr7mgeAPYG1QP0ZOV30HOYxM7MBVEXgPwGMkbRb3fS3kkJ9EXBIXdk0YGEFdZuZWYs6HtKJiOckXQtcLekk4Bngw8D+pIOv9wDXSLqr+P1EYC/g6E7rNjOz1lV1ls7JwGzgh6SLq+4DpkbEEmCJpHNJF19tR+rxHxoRKyqq28zMWlBJ4EfEauCs4tGofA4wp4q6zMysPb55mplZJhz4ZmaZGLb/09ba4/8FbDZ8uYdvZpYJB76ZWSYc+GZmmXDgm5llwoFvZpYJB76ZWSYc+GZmmXDgm5llwoFvZpYJB76ZWSYc+GZmmXDgm5llwoFvZpYJB76ZWSYc+GZmmXDgm5llwoFvZpYJB76ZWSYc+GZmmXDgm5llwv/E3MyGzuythrj+5UNb/yBzD9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBOVBb6kLSRdJulpSWslPSJpdFE2XdJDktZIelDSwVXVa2Zmrakk8CWNBG4BtgX2B7YCZgCvSZoEXAucAYwD5gLzJU2som4zM2tNVT38GcBmwAkRsSQi1kTEPRHxKnAmMC8iFkTE6oiYC9wNzKyobjMza0FVgf9B4LKIeK1B2TTg1rpptwFTKqrbzMxa0HHgSxoFTAZWS1okaVUxTn+EpK2BbYDH6xZbCuzcad1mZta6Km6tsC2wCfBx4JPAw8DfANcDhxTzrKpbZmWxTA+SZgGzALq6uipong0bQ3kZfmaX4NvwVMWQTm0Y56KIWBQRKyLiauBm0tg+wJi6ZcbScyMAQERcGRGTI2LyhAkTKmiemZlBNYH/PLCWNExT9hgp2NcC9WfkdNFzmMfMzAZQx4EfEQHcQ8+DsG8GfgksYv3QTs00YGGndZuZWeuquj3yxcDXJf0S+BlwPGkDMBN4ALhG0l2kDcOJwF7A0RXVbWZmLagk8CPiJkldwDeA7YH7gMMi4lnSRVbnki6+2o7U4z80IlZUUbeZmbWmsn+AEhGXA5c3KZsDzKmqLjMz6z/fPM3MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTFQe+JLeIulVSTNK06ZLekjSGkkPSjq46nrNzKx3A9HDPx+I2hNJk4BrgTOAccBcYL6kiQNQt5mZNVFp4Et6H7A58PPS5DOBeRGxICJWR8Rc4G5gZpV1m5lZ7yoLfEkTgAuBk+uKpgG31k27DZhSVd1mZta3UVWsRJJIwzaXRMRj6SlI2hrYBni8bpGlwM5N1jULmAXQ1dVVRfM2Ot1n3zxkdS+54PAhq9vMhlZVPfzPAqsi4tK66ZsXP1fVTV8JbNJoRRFxZURMjojJEyZMqKh5ZmbWcQ9f0jHAscC+DYpfKX6OqZs+lp4bATMzG0BVDOmcD+wILK0N5ZB69nOAO4C1wERgWWmZLnoO85iZ2QCqIvAParCe+cA3gW8B3wUOAX5WKp8GDN1AtplZhjoO/Ih4sn6apJeB5yNimaRLgGsk3QXcA5wI7AUc3WndZmbWukrO0ulNRMyXdC7pLJ7tgEXAoRGxYqDrNjOz9QYk8CNict3zOaQxfTMzGyK+eZqZWSYc+GZmmRjwMXzracnY44aw9uVDWLeZDSX38M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLRCWBL+ltkn4saaWkZyRdJWnrUvl0SQ9JWiPpQUkHV1GvmZm1rqoe/qeBrwPbAQcCbwLmAUiaBFwLnAGMA+YC8yVNrKhuMzNrQVWBPyMirouIlRHxa1K4HyFpJHAmMC8iFkTE6oiYC9wNzKyobjMza0ElgR8RL9VNWgWMLn6fBtxaV34bMKWKus3MrDWjBmi9xwJ3AlsA2wCP15UvBXZutKCkWcAsgK6urgFqnlnFZm81hHUvH7q67c9K5WfpSJoJfAQ4Ddi8mLyqbraVwCaNlo+IKyNickRMnjBhQtXNMzPLVmU9fEljgYuBI4CDI+IBSdsXxWPqZh9Lz42AmZkNoEoCX9I40jj9i8DeEfF8UfQ8sBaYCCwrLdJFz2EeMzMbQFUN6VxNCvD3lMKeiHgVWAQcUjf/NGBhRXWbmVkLOu7hS5pAGsbZPSJeazDLJcA1ku4C7gFOBPYCju60bjMza10VQzo7Fj8fk1RfdlRE/EDSuaSLr7Yj9fgPjYgVFdRtZmYt6jjwI+JBoEfS180zB5jTaV1mZtY+3zzNzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0wMWuBLOlvS7yStlvQjSd2DVbeZmQ1S4Ev6OHAicCiwI/AUcJMkDUb9ZmY2CIEvaQRwDnBaRDwSES8CpwC7AgcNdP1mZpYMRg//zcA2wL/VJkTEKuDfgSmDUL+ZmQGKiIGtQDoSuDAidqubfgWwLiJOqZs+C5hVPN0DeHRAG9jceOD5Iaq7L25be9y29rht7RnKtu0SERPqJ44ahIo3B1Y1mL4S2LJ+YkRcCVw50I3qi6TFETF5qNvRiNvWHretPW5bezbGtg3GkM4rwJgG08fSeENgZmYDYDAC/0lgp+LgbVkX8Pgg1G9mZgxO4P8HMBLYrzZB0qbAAcDCQai/XUM+rNQLt609blt73Lb2bHRtG/CDtgCSLgbeCRwN/B64GJgQEUcMeOVmZgYM3pW25wCLgPuA35IOFp8wSHWbDSpJ20p6uM1lN5V0SIvzflvSVu3UM9QkfaRR2yUdIqnH2SVWjUEJ/IhYGxEfi4hxEbFVRJwYEcsHoi5JmzW7glfSDpKa7tJIelJSj6PqkmZIWlBlO+vWf6Ck09tYrlvSmjaW6/V1qJKkkLRDG8vNkzS7hfnafm96a1sRPN+X9JikZZJ+I2m+pBMkrWnwCEmvLxYfTbr+pLy+yZKW1E2bLemrxe9Lis/e9sC/tPgnfADYtB9/crnutl43SftIOqOdOut8EWgU7JdQ99r1Rweft7aW68f6e/2uStpf0pwmZUdKOqVRWX8Nx5unPUU6f/9PSl8m6qZL0qjao5g8sjStX6+PpJHFB+d1xfOZktYVj1eLstrz/ywtuhtwSGk944t560Pl2KI8JI1v0obJTZZ9TdLUPtq/STHfrn3M16x9Hy7KX1IL90qSNF3SnS3MN7XVHnMVbZN0MvAtUvC+k3SCwRTgGuA84MsRMbb2IF0xvhxY0kob2yHpRkk/Lz9Ix8Zuq5v+75K+Wr+xLALnpT7qmFF8Thtt0I4uZnsDcHiT5R9tsuya4jMfxev/Emkv/+e155Ju7aVdVX3e/pek6/uY5wRJCyU9JekFSU8Xr+kpkkb3o219flfrbAu8rUnZnsA+LayjT4NxHv6AK97s2os6EnizpM2BtRHxUC+LHgdcUXr+F8DtwGvF8x8DR/WjKbUD028HboyIfwL+qWjjUcDZEfH2VldWhEk7lkZEd3lCi4F5LvBH4NPAh/qauYP21YwuHpXrsG1nAB+PiO+Vpj0D/LOkZ4AfSpodEbXPyd8CN5WeNzNO0oWl51NIJzW04jO01pt/FTipSdkISbXP6BuazPPjiDisxTZtICL2aFYmaQywFpgYEX9oc/2dft768hngQODjwKKIeEXSSGAS8JWi7Niq2ibpUWCXumnlvYCPRcRV/V1vb4ZF4JMOBr+r+H0T4FOkC7uWAcc3Wygivg18u/ZcaZf7/RFxb38bIKkL+AbwHeBSSb+IiMdKs7wJ+G+SNo2I1ZJuAN5TlI1kCM9YkrQ78FnSje3eAHxN0r8A50REW2PRLZoE7CVpy4j4o6T5wHZF2a7A3OL3UQzuZ3UEKTgbeRX405ChpLeSArbRHmRt2Ky2x7QOKO/Z7Vm3yN2l+TYQEb9Q2gv9GGkoZ8+iHWtIx8W+D8yNiJVKI5qTaz3gwrak78YFxfMdGMA9kgZqr9lcSW8nfebXAQ8Cf9dHx6wq27H+89XIocDfR8RPaxMi4lXgXkmfAX5YZWPKG0hJ25IuUn06Il6usp6yYRH4EfEV0hYYSc8DH2ozqEbTz2EuSZsBp5K+iJ+PiHmSPgDcLuka4CLgJeD9pPHJM4HzIuK9pXXMAI5po70dURrD7S6eXgRcRQqG44AjgWskrQQWA5dHxBMV1j2eFJQ/JY3nnkK6pUbtM/nF0uw7UVzLERGvSToQ2Lkoa3mPqR8uIm20R5H2+F4AtiL1yC8ELi7asSswn/S+/6LBekYDRMS64u9dERHzaoVKY8bl3f39SJfi/6pJu75DCqxPAotLPdC/BGYD75V0QDHveDbcoGwJrI6IqUXdM2jhM1cMTXyjNGkE6T5Y/VXbk/sFcELRdgH/A1goacciXAF2k/Qi8NuIeKGNupp5N7CvpNdFxP9vUL4YOE/SC8Dtpdf3bcDngJsqbAuw/tYzpFGFlcDOxffyw8AC4C2kDfX3mq2jP4ZF4NcUY2xb0/hgUF/LjiP1et7E+p5Wb/PvCcwjvSHXAwdExFKAiPiepDtIX8xfkXoz3yGN/y6QdHJEXNF4zS07iDYP2JVsCSwFjo+I5wAkPUfa7b4BuEHSW0hB9GT9wpIWl5/XXUZ+gKTdaEDS1sAtwOXApaQhksuAT0bEumKelaVFppJ6P1OAO0lfwNp4526kDWolbSvm/VoxBHYy6Qyz8cAfgMeA/x0RN0uaBlwHXBsRX2iynvqe+i6SytNGAA0P1DX4ewT8DbBfRPysVMerwP2STiW9lzsWRQsiYnZp+W7gA5JqG8pxrdQbEd8FvltazzGkMOqv2md1NcWQaUSEpJdJG4PyiRafIB0T+QLwp7H9Tt5TSUeQvt9fBuZJOqq0ganZg/SenAdcLWks8DLwG9JIwD+29qf20PC7KmlL0mv7johYXEwbQwr3cyLiHcW0s+m5N9iWYRX4wF6kcN2H1DMru5D0YWvmeFLv6sOSro4+LlCIiF9JOg+4p7j7Z335MkmfJ218uoFPRMSrSge/bpF0MPCRDnowp5P+1kZGqucZBz3e64jo826lxa52s93t3r74p5KGGzYg6TBS0F8fEecX0w4lfZkekrR/cQvt2vzbknqB5wOnAXdGxGWl8hk07qn2u21lEXEHcEeD9u8t6TrgCOCsiLi8t/WU1reYDUOtX4pwvBWYLelTEfFIqU27Ap8nnfb8dC+r2RS4rfh9K+CBBvNMlVTbuI9g/Wfs8YjYv932kzoXK0jj4KcVw10jgF8D0+s2jqdGxE8arKOt91TSJODrwHRSL/5G4JuSToqI8jKHR8SyFv+e/mj2XX2ZdFxjV0n3FxugbUl3F36x6AS9njTMek8lLYmIYfMg9bjvI/V0RpemLwE+ShrrjwbLbU8a7z+QdBDt9LryGaQeU3/bcynwA2Bs3fRNgJnAiEbrJ/Uoe7SzVB7FPN3AmrqytxZ/S6PHlGKeHYp1rOvnY6cW2/cS0F1q6w6lssOBI5ss98bS71OBfYFvkobCNiX1sI/t7b3psG1rmjyi9Ps60jj+2uL5Tg3q2Aq4rp+flRtJvbgdgTuazLMpaUjwAeA50l7Xc8AvSb3SrYr5vlq8Vv9aeiwEXurtM12sf3tSJ2UbYAtgTN08xwA/afB57O9jJSnMNi3q2oXU038YmFq3/k7e05OL1+iI0rQxwNWkO/Fu1uA9buXR6neh6Xe1KN+HNHTzNOnEgEeBv6PIhmKej5KGETvPyCpWsjE8SOfuvlB8iG4l3ZK5VraEdFBth/o3p/jA3V2bn7Q1fRY4qY8vRyvh0PBD0qDtU4Fz+/EB7/VD1MJr1eN16OfybX8BS/PsQjpA1mwdR5E2mI8CmxfT9i2+vAc2e2+qaFuT13vnummjSGcy3U46FfgPpDOcHiYdT9quyboOpe8N60sttEnFvDs2KNsDmNbgMbW3z3SL7/2mpKvkm5VfSOm7V0w7jRTwfyAN1Swn9fZ/T9poPUrqee9K9YF/PDCpyXK71r3HOxS/XwXMLpU9DExr87vQ53e1eC8362Udo4FN+vteNXoMiyGd4oDYdaSDZ48Xu/n3FAdfvtjLcnuRzq3+LXAWQET8RtJ/J421Hw68r9Gy0eQ0rGJXtTvqdg2Vrh48Q9K7gYmkccwgjfF/F/hSg3X9H9KHYTTpizYiIk5s9vfULftuYGWUzjhoMt8Y0hfyfaTxcEi72ktIB6m+EhENz98uzgKpte8vSB/8Hn9HEzuS9nL+oUn56cBfAX9Vqz8i7lU6R36BpOMj4ge9/F1tt03pXk+nkA60d5GC6X5JT5H22C4FvkYKqLNJp/C9rHTdxp6k1/NeSXvVv3YR8SN6GUotxtqbHbQtryeKs3F6DD1GxKPAo5IuAT4X/Rg2lPRe0hk/vbkD+OtW11n4V+CYKBKsl/qXkfaeGpX1+z2NiG8Vy04mheodpbIn6mYfUxwr6bdOvqukTubPScepGvkEabh6RjttKxsWgU86i+A/IuJigIh4phgX/hwN7rlfsj3pLJGzonQAJ9IpcH8J7BvpbIyOGlecyXMvabf6aODR4gs7inSWSe0c39pY9ErSqaWvkW4vvYbUi3m2H9X+T9IwTqPAf5H15xN/k3Tmx0eA+4u/V6SD17NJe0vvqFt+NesPWK8rta/RmQ+9qT+IWTYCmBcbntpKRNwg6fekXlcjVbTt/xb1z4zS2V6S3gj8PalXvwdwWF2AvAb8sgimFaQDy71ucFuh5hdMjQR+o8ZXTe9Oek8vJe351rudDU8RBdLrS+8bpHYP2kbxmd+etJH8a1LHR8VjBekUzXkRsahu2Sre0+mkM7t6HJcpvJs0nHtgP9YJ1XxXB81wCfz3U9crKILiAwDNAjsiFtLk/PdIF4dUdd7t3sDrSAdpXynVsQ64S9I5wI9K01eTTg0cEJEOVF1XPD2MNKZ+X6k8SMF1FvC4pM0iYmWpfCUpTDrV4wKxmqLH1DDoyiHboKyKtr2LdObEBhuViPi1pE+T9ghvAC6QdCbpwH2th78HqYf/LK1fVNWriGjW8+tVbx2VSGeULW23TR34AfAI6bTfJ2o9fqULJQ8AviVpVUTcUlugws9bUxGxoPR6XcGGJ3h8iiYnLlT4Xd1MzW+9MJLS9UKdGBa3VoiI1dH3VY5D6X7SWOUVkt5UBAOSxkg6iHQxzD8PUdtuAT4nab9ijwNJIyTtTTpYekc57DNxM/BFSW9v8JpcRno/30868+MfgCeK4cNlpNNvnwb2aTYUlrkgdTTrr3kZRTqYKhoMUw2miPhZeWMfEQsi4pkBrnZllG7XERveuuOcqioZLj38jVpErFK6uvBjpEDYSdImpN3AR4ppc3tZRbs+K+mzvZR/iDQueBrpVMndi+Eckf45zU2k85YHyi699GpGsf6q0MF2DOkaiq8Bbyy9JktIG4MPFkOAVxWPKj1LGvaryn/2MST51mh80dhAOZJ0vOz7QHexQRXpgO4DwKyIaHpfnQ6dJKnZbScgDcc83Mfr9Z7iOEzVBqWHPyj3w99YKF01NzEilvRzuc1JB3z63MpLmgecGRF/bK+V/WrXKNKZP0Oxa96S4iDk76LnRS5Vrb/l96bBst0MYNuGI6ULFLcrDgw3Kn8PQHlIRunq365IF3ENdPu62Qjf043lu5pV4JuZ5WxYjOGbmVnfHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZeK/ACsttv/hN4qKAAAAAElFTkSuQmCC"/>
```python
plt.bar(df['이름'], df['국어'])
plt.bar(df['이름'], df['영어'], bottom=df['국어']) # 밑에 '국어'데이터를 넣고 그 위에 누적하겠다
```
<pre>
<BarContainer object of 8 artists>
</pre>
<img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAXwAAAD+CAYAAAA56L6tAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjQuMywgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/MnkTPAAAACXBIWXMAAAsTAAALEwEAmpwYAAAZoElEQVR4nO3de7gdVX3G8e+beyQSMAkXgXAQBKxUaQmIgBJtoF5SirQq8IBSKKAiQkVQqtZQbbEKWlQgUNqiKKKloFQlVSJiqQgNRQQvUYGgUNAAEsmNEPj1jzXbTCZ777Mvc86OZ72f59lPzpk1M2udfXlnzZo1O4oIzMxs7Bs36AaYmdnocOCbmWXCgW9mlgkHvplZJhz4ZmaZmDDoBrQzc+bMGBoaGnQzzMx+p9x+++2PRMSs6vLNOvCHhoZYsmTJoJthZvY7RdL9zZZ7SMfMLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBOb9Z22ZmYDs2D6gOtfUfsu3cM3M8uEA9/MLBMOfDOzTDjwzcwy4Yu2ZmPdIC8+jsCFR+ude/hmZplw4JuZZcKBb2aWCQe+mVkmHPhmZpkYu7N0PDPBzGwj7uGbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWViwqAbYJuZBdMHWPeKwdVtlgH38M3MMtFV4Et6nqRvSjq8tGyipKg8Vla2213SYkmrJf1C0mk1td/MzDrUUeBLmi3pEuBO4IBK8Yzi38kRoeIxrbTtFsANwDeAmcDRwAJJR/TdejMz61inPfz9gGeTwv7hStkM4ImIWNdi2zcBD0bEhyNidUT8F3A+cGovDTYzs950FPgRcXVEHB0RdzUpngE80mbzecD1lWU3APtLUmfNNDOzftVx0XYGMCRpnaT/k/R5SbNL5bsC91a2uR+YQhri2YikkyQtkbRk+fLlNTTPzMygnsBfBGwNTCP15qcAX5c0pSifBqyubLOq+HdydWcRcWlEzImIObNmzaqheWZmBjUEfkSsiYgVEbEuIn4IHEXqub+iWOUpYFJls8bBoHogMDOzEVL7PPyIWAvcB+xcLHoA2Kmy2mxgRUQ8Vnf9ZmbWXO2BL2lLYHc2jNvfDBxSWW0esLjuus3MrLW+A1/SUZJeIWmapD2BLwI/ZUOgX0aakfM2SVMkHQS8E/hIv3WbmVnn6ujhTwAuBx4lTb/8KTAvIp4GiIgHgfnAScAK4FLgxIi4tYa6zcysQ11/eVpEDFV+vwK4Yphtvg3s3W1dZmZWH395mplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJhz4ZmaZcOCbmWXCgW9mlgkHvplZJiYMugFmlrEF0wdc/4rB1j/K3MM3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTDjwzcwy4cA3M8uEA9/MLBNdBb6k50n6pqTDK8vnS7pL0lpJ35f0ykr57pIWS1ot6ReSTquh7WZm1oWOAl/SbEmXAHcCB1TK9gGuAM4EtgYuBq6TtFNRvgVwA/ANYCZwNLBA0hF1/RFmZja8Tnv4+wHPJoX9w5Wys4CFEbEoItZExMXAd4Hji/I3AQ9GxIcjYnVE/BdwPnBq/803M7NOdRT4EXF1RBwdEXc1KZ4HXF9ZdgMbzgRale8vSd001szMejehn40lbQU8B7i3UnQ/sGPx867AtU3Kp5CGeJZX9nkScBLA7Nmz+2mejTULpg+w7hWDq9sGYmjtlQOtf9kI7LPfWTrTin9XV5avAiaX1mlWTmmd34qISyNiTkTMmTVrVp/NMzOzhn4D/6ni30mV5VPYEPJPtSiHTQ8EZmY2QvoN/EeAJ4GdKstns2GY54EW5Ssi4rE+6zczsw71FfgR8TRwC3BIpWgesLj4+eZhys3MbBTUcaftx4EzJR0saYqkk4G9gMuL8stIM3LeVpQfBLwT+EgNdZuZWYf6DvyIuA54L+nmq8eBI4FDI+KJovxBYD5p5s0K4FLgxIi4td+6zcysc11Py4yIoSbLLgIuarPNt4G9u63LzMzq4y9PMzPLhAPfzCwTDnwzs0z09dUKm7NB3ha9bGA1m5m15h6+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZpkYs1+tYL3xV1KMPX5NrcE9fDOzTDjwzcwy4cA3M8uEA9/MLBMOfDOzTHiWziAsmD7AulcMrm4zGyj38M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMjFh0A0ws3wNrb1yoPUvG2jto889fDOzTNQS+JIOlRSVx1dK5fMl3SVpraTvS3plHfWamVnn6urhPwf4TkSo9JgPIGkf4ArgTGBr4GLgOkk71VS3mZl1oK7AnwE82qLsLGBhRCyKiDURcTHwXeD4muo2M7MO1Bn4j7QomwdcX1l2A3BATXWbmVkH6gz8YyWtk/QzSedKepakrUjDPfdW1r8f2LHZjiSdJGmJpCXLly+vqXlmZlZX4L8f2Io0Rn8CcBhprH5aUb66sv4qYHKzHUXEpRExJyLmzJo1q6bmmZlZLYEfEb+JiFXF4ybgOOBYYHyxyqTKJlPY9CBgZmYjaKTm4f8QEKmH/yRQnZEzm02HeczMbASNVODvCzxFGqu/BTikUj4PWDxCdZuZWRN13Xh1hqS9igu1BwOXARdGxErg48CZkg6WNEXSycBewOV11G1mZp2p67t0ZgM3koZw7gE+CXwKICKuk/Re0s1X25B6/IdGxBM11W1mZh2oJfAj4jTgtDblFwEX1VGXmZn1xl+eZmaWCQe+mVkmHPhmZpnwf4AyAIP8Tx+WDazm/vl5M+uPe/hmZplw4JuZZcKBb2aWCQe+mVkmHPhmZpnwLB2zOiyYPsC6Vwyubvud4h6+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZcKBb2aWCQe+mVkmJgy6AWZjwdDaKwdW97KB1Wy/a9zDNzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMuHANzPLhAPfzCwTDnwzs0w48M3MMjFqgS/pPZJ+IWmNpK9LGhqtus3MbJQCX9I7gDcDhwLbAw8CX5ak0ajfzMxGIfAljQPOBk6PiB9FxOPAKcAuwMtHun4zM0tGo4f/QuA5wDcbCyJiNfAd4IBRqN/MzABFxMhWIB0OnBcRu1WWXwKsj4hTKstPAk4qft0DWDqiDWxtJvDIgOoejtvWG7etN25bbwbZtp0jYlZ14Wj8j1fTgNVNlq8CtqwujIhLgUtHulHDkbQkIuYMuh3NuG29cdt647b1ZnNs22gM6TwFTGqyfArNDwRmZjYCRiPwHwB2KC7els0G7h2F+s3MjNEJ/P8FxgP7NxZImgocCCwehfp7NfBhpTbctt64bb1x23qz2bVtxC/aAkj6GHAw8HrgUeBjwKyIOGzEKzczM2D07rQ9G7gFuB34Oeli8bGjVLfZqJI0Q9LdPW47VdIhHa77OUnTe6ln0CS9tVnbJR0iaZPZJVaPUQn8iHgyIt4eEVtHxPSIeHNErBiJuiRt0eoOXknbSWp5SiPpAUmbXFWXdJykRXW2s7L/gySd0cN2Q5LW9rBd2+ehTpJC0nY9bLdQ0oIO1uv5tWnXtiJ4vijpJ5IelnSPpOskHStpbZNHSHpesflE0v0n5f3NkbSssmyBpE8VPy8r3nvbAv/R4Z/wRmBqF39yue6enjdJ+0o6s5c6K84FmgX7x6k8d93o4/3W03Zd7L/tZ1XSSyVd1KLscEmnNCvr1lj88rQHSfP3f6v0YaKyXJImNB7F4vGlZV09P5LGF2+c5xa/Hy9pffF4uihr/P6z0qa7AYeU9jOzWLcaKkcV5SFpZos2zGmx7TOS5g7T/snFersMs16r9r2lKF+pDr4rSdJ8STd3sN7cTnvMdbRN0snAZ0nBezBpgsEBwKeBc4CPRMSUxoN0x/gKYFknbeyFpGslfa/8IF0bu6Gy/DuSPlU9WBaBs3KYOo4r3qfNDmivL1bbFXhti+2Xtth2bfGej+L5X0k6y/9e43dJ17dpV13vt7+UdPUw6xwrabGkByU9Jumh4jk9RdLELto27Ge1Ygbwhy3K9gT27WAfwxqNefgjrnixG0/qeOCFkqYBT0bEXW02PRq4pPT7s4AbgWeK378BvK6LpjQuTL8EuDYi/gX4l6KNrwPeExEv6XRnRZj04v6IGCov6DAw3wv8Bvhr4MThVu6jfQ0Ti0ft+mzbmcA7IuILpWW/BP5d0i+B/5S0ICIa75M3AV8u/d7K1pLOK/1+AGlSQyfeR2e9+aeBE1qUjZPUeI/u2mKdb0TEqzps00YiYo9WZZImAU8CO0XEr3vcf7/vt+G8DzgIeAdwS0Q8JWk8sA/w0aLsqLraJmkpsHNlWfks4O0RcVm3+21nTAQ+6WLwHxc/TwbeRbqx62HgmFYbRcTngM81flc65X5DRNzWbQMkzQb+FbgSuEDSDyLiJ6VVXgD8nqSpEbFG0jXAa4qy8QxwxpKk3YEPkL7YblfgQkn/AZwdET2NRXdoH2AvSVtGxG8kXQdsU5TtAlxc/DyB0X2vjiMFZzNPA78dMpT0YlLANjuDbAybNc6Y1gPlM7s9K5t8t7TeRiLiB0pnoW8nDeXsWbRjLem62BeBiyNildKI5pxGD7gwg/TZ+HDx+3aM4BlJE43n7GJJLyG959cD3wfeP0zHrC7bsOH91cyhwN9ExLcbCyLiaeA2Se8D/rPOxpQPkJJmkG5SfSgi1tVZT9mYCPyI+CjpCIykR4ATewyqiXQ5zCVpC+BU0gfxQxGxUNIbgRslfRo4H1gJvIE0PnkWcE5EHFHax3HAkT20ty9KY7hDxa/nA5eRguFo4HDg05JWAUuAT0bEfTXWPZMUlN8mjeeeQvpKjcZ78tzS6jtQ3MsREc9IOgjYsSjr+IypC+eTDtoTSGd8jwHTST3y84CPFe3YBbiO9Lr/oMl+JgJExPri730iIhY2CpXGjMun+/uTbsX/cYt2XUkKrHcCS0o90BcBC4AjJB1YrDuTjQ8oWwJrImJuUfdxdPCeK4Ym/rW0aBzpe7C61TiT+wFwbNF2AX8CLJa0fRGuALtJehz4eUQ81kNdrbwa2E/ScyPi/5qULwHOkfQYcGPp+f1D4IPAl2tsC7Dhq2dIowqrgB2Lz+VbgEXA75MO1F9otY9ujInAbyjG2Lai+cWg4bbdmtTreQEbelrt1t8TWEh6Qa4GDoyI+wEi4guSbiJ9MH9M6s1cSRr/XSTp5Ii4pPmeO/ZyerxgV7IlcD9wTEQsB5C0nHTafQ1wjaTfJwXRA9WNJS0p/165jfxASbvRhKStgK8BnwQuIA2RfAJ4Z0SsL9ZZVdpkLqn3cwBwM+kD2Bjv3I10QK2lbcW6FxZDYCeTZpjNBH4N/AT4q4j4qqR5wFXAFRHxdy32U+2p7yypvGwc0PRCXZO/R8CfAftHxP+U6ngauEPSqaTXcvuiaFFELChtPwS8UVLjQLl1J/VGxOeBz5f2cyQpjLrVeK+uoRgyjYiQtI50MChPtDiNdE3k74Dfju3385pKOoz0+f4IsFDS60oHmIY9SK/JOcDlkqYA64B7SCMB/9TZn7qJpp9VSVuSntuXRcSSYtkkUrifHREvK5a9h03PBnsypgIf2IsUrvuSemZl55HebK0cQ+pdvUXS5THMDQoR8WNJ5wC3Ft/+WS1/WNKHSAefIeC0iHha6eLX1yS9EnhrHz2YM0h/azPjtemMg01e64gY9ttKi1PtVqfb7T74p5KGGzYi6VWkoL86Iv6+WHYo6cN0l6SXFl+h3Vh/BqkX+PfA6cDNEfGJUvlxNO+pdt22soi4CbipSfv3lnQVcBjw7oj4ZLv9lPa3hI1DrStFOF4PLJD0roj4UalNuwAfIk17fqjNbqYCNxQ/TwfubLLOXEmNg/s4NrzH7o2Il/baflLn4gnSOPjpxXDXOOCnwPzKwfHUiPhWk3309JpK2gf4Z2A+qRd/LfAZSSdERHmb10bEwx3+Pd1o9VldR7qusYukO4oD0AzStws/XnSCnkcaZr21lpZExJh5kHrct5N6OhNLy5cBbyON9UeT7bYljfcfRLqIdkal/DhSj6nb9lwAfAmYUlk+GTgeGNds/6Qe5SbtLJVHsc4QsLZS9uLib2n2OKBYZ7tiH+u7fOzQYftWAkOltm5XKnstcHiL7Z5f+nkusB/wGdJQ2FRSD/uodq9Nn21b2+IRpZ/Xk8bxnyx+36FJHdOBq7p8r1xL6sVtD9zUYp2ppCHBO4HlpLOu5cAPSb3S6cV6nyqeq6+UHouBle3e08X+tyV1Up4DPBuYVFnnSOBbTd6P3T5WkcJsalHXzqSe/t3A3Mr++3lNTy6eo8NKyyYBl5O+iXeLJq9xJ49OPwstP6tF+b6koZuHSBMDlgLvp8iGYp23kYYR+8/IOnayOTxIc3cfK95E15O+krlRtox0UW276otTvOG+21ifdDT9FXDCMB+OTsKh6ZukSdvnAu/t4g3e9k3UwXO1yfPQ5fY9fwBL6+xMukDWah+vIx0wlwLTimX7FR/eg1q9NnW0rcXzvWNl2QTSTKYbSVOBf02a4XQ36XrSNi32dSjDH1hXdtAmFetu36RsD2Bek8fcdu/pDl/7qaS75FuVn0fps1csO50U8L8mDdWsIPX2HyUdtJaSet67UH/gHwPs02K7XSqv8XbFz5cBC0pldwPzevwsDPtZLV7LLdrsYyIwudvXqtljTAzpFBfEriJdPLu3OM2/tbj4cm6b7fYiza3+OfBugIi4R9IrSGPtrwX+vNm20WIaVnGqOhSVU0OluwfPlPRqYCfSOGaQxvg/D/xDk339I+nNMJH0QRsXEW9u9fdUtn01sCpKMw5arDeJ9IH8c9J4OKRT7WWki1QfjYim87eLWSCN9j2L9Mbf5O9oYXvSWc7ftig/A/gD4A8a9UfEbUpz5BdJOiYivtTm7+q5bUrf9XQK6UL7bFIw3SHpQdIZ2wXAhaSAeg9pCt86pfs29iQ9n7dJ2qv63EXE12kzlFqMtbe6aFveTxSzcTYZeoyIpcBSSR8HPhhdDBtKOoI046edm4A/6nSfha8AR0aRYG3qf5h09tSsrOvXNCI+W2w7hxSqN5XK7qusPqm4VtK1fj6rpE7m90jXqZo5jTRcfVwvbSsbE4FPmkXwvxHxMYCI+GUxLvxBmnznfsm2pFki747SBZxIU+BeBOwXaTZGX40rZvLcRjqtfj2wtPjATiDNMmnM8W2MRa8iTS19hvT10mtJvZhfdVHtn5KGcZoF/uNsmE/8GdLMj7cCdxR/r0gXrxeQzpZeVtl+DRsuWK8vta/ZzId2qhcxy8YBC2Pjqa1ExDWSHiX1upqpo23/VtR/fJRme0l6PvA3pF79HsCrKgHyDPDDIpieIF1YbnvA7YRa3zA1HrhHze+a3p30ml5AOvOtupGNp4gC6fml/QGp14u2UbzntyUdJP+I1PFR8XiCNEVzYUTcUtm2jtd0Pmlm1ybXZQqvJg3nHtTFPqGez+qoGSuB/wYqvYIiKN4I0CqwI2IxLea/R7o5pK55t3sDzyVdpH2qVMd64L8lnQ18vbR8DWlq4IiIdKHqquLXV5HG1G8vlQcpuN4N3Ctpi4hYVSpfRQqTfm1yg1hD0WNqGnTlkG1SVkfb/pg0c2Kjg0pE/FTSX5POCK8BPizpLNKF+0YPfw9SD/9XdH5TVVsR0arn11a7jkqkGWX399qmPnwJ+BFp2u99jR6/0o2SBwKflbQ6Ir7W2KDG91tLEbGo9HxdwsYTPN5Fi4kLNX5Wt1Drr14YT+l+oX6Mia9WiIg1MfxdjoN0B2ms8hJJLyiCAUmTJL2cdDPMvw+obV8DPihp/+KMA0njJO1Nulh6UznsM/FV4FxJL2nynHyC9Hq+gTTz42+B+4rhw4dJ028fAvZtNRSWuSB1NKv3vEwgXUwVTYapRlNE/E/5YB8RiyLilyNc7aoofV1HbPzVHWfXVclY6eFv1iJitdLdhW8nBcIOkiaTTgN/VCy7uM0uevUBSR9oU34iaVzwdNJUyd2L4RyR/nOaL5PmLY+Undv0aiaw4a7Q0XYk6R6KC4Hnl56TZaSDwV8UQ4CXFY86/Yo07FeXnw0zJPniaH7T2Eg5nHS97IvAUHFAFemC7p3ASRHR8nt1+nSCpFZfOwFpOObuYZ6v1xTXYeo2Kj38Ufk+/M2F0l1zO0XEsi63m0a64DPsUV7SQuCsiPhNb63sql0TSDN/BnFq3pHiIuQvYtObXOraf8evTZNthxjBto1FSjcoblNcGG5W/hqA8pCM0t2/syPdxDXS7RtiM3xNN5fPalaBb2aWszExhm9mZsNz4JuZZcKBb2aWCQe+mVkmHPhmZplw4JuZZcKBb2aWif8HWDH/ZY+oxlQAAAAASUVORK5CYII="/>
```python
plt.bar(df['이름'], df['국어'])
plt.bar(df['이름'], df['영어'], bottom=df['국어'])
plt.bar(df['이름'], df['수학'], bottom=df['국어'] + df['영어'])
```
<pre>
<BarContainer object of 8 artists>
</pre>
<img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAXwAAAD+CAYAAAA56L6tAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjQuMywgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/MnkTPAAAACXBIWXMAAAsTAAALEwEAmpwYAAAdh0lEQVR4nO3de5gdVZ3u8e+bkKSRCIQkXBRCI8jlDBkZCYgY5TKBUcxwkDMq8Mjl4CEIiHBQUESHoM7AQS4HFRIycQZEBTkMKjNKhEQG5IhgGIQgCig3iYIBJEInIVx+88dam1Qqe+/ee/fubuh6P8+zn+6uVZe1b2+tWrWqWhGBmZmNfKOGuwJmZjY0HPhmZhXhwDczqwgHvplZRTjwzcwqYr3hrkAzkyZNit7e3uGuhpnZ68qdd975VERMLk9/TQd+b28vixcvHu5qmJm9rkh6tN50d+mYmVWEA9/MrCIc+GZmFeHANzOrCAe+mVlFOPDNzCrCgW9mVhEOfDOzinDgm5lVxGv6StuBmHr51GHb9pIjlwzbts3K/F3ozHC+bjA4r51b+GZmFeHANzOrCAe+mVlFOPDNzCrCgW9mVhEOfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRTjwzcwqwoFvZlYRLQW+pLdLulFSn6QnJc2XtHEuGyMpSo/nS8tvL2mRpBWSfifppEF4LmZm1kSrLfzPAl8HNgWmAzsBc3PZxPxzXEQoP8bXFpS0AbAQuBGYBBwGzJZ0cBfqb2ZmLWr1fvhHRUSt1f6gpFOBhZJGkwL/uYhY3WDZI4ClEXFO/vsnks4HTgSu7bTiZmbWnpZa+IWwr1kBjMm/TwSearL4DOD60rSFwB6S1Mr2zcxs4Do9aXsocGtEvEwK/F5JqyX9XtKVkqYU5t0WeKi0/KNAD6mLx8zMhkDbgS/paOA44OQ8aQEwARhPas33ADdI6snl40lHBEV9+ee4OuufJWmxpMXLli1rt3pmZtZAy4EvqUfSJcAXgH0j4m6AiFgZEcsjYnVE3Edq/U8C9smLvgiMLa2utjMo7wiIiHkRMS0ipk2ePLnNp2NmZo20dNJW0gRSP/yzwC4R0bDPPiJWSXoY2DpPehzYqjTbFGB5RDzTdo3NzKwjrbbwLyP1wx/QLOwBJG0IbM+afvtbgf1Ks80AFrVeTTMzG6h+A1/SZOBA4MyIeKVO+aGS9pE0XtKOwNXAg6wJ9PmkETnH526h6cApwLldexZmZtavVlr4W+SfD9S5ovYgUrfQZcDTpG6fB4EZeQQPEbEUmAnMApYD84BjIuL2rj4TMzNrqt8+/Ii4B+hvvPwV/azjFmCX1qtlZmbd5punmZlVhAPfzKwiHPhmZhXhwDczqwgHvplZRTjwzcwqwoFvZlYRDnwzs4pw4JuZVYQD38ysIhz4ZmYV0eo/MbeKmHr51GHb9pIjlwzbts2qwC18M7OKcOCbmVWEA9/MrCIc+GZmFeHANzOrCAe+mVlFOPDNzCrCgW9mVhEOfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRbQU+JLeLulGSX2SnpQ0X9LGhfKZkpZIWiXpHkn7lpbfXtIiSSsk/U7SSV1+HmZm1o9WW/ifBb4ObApMB3YC5gJI2hW4AjgVmADMAa6TtFUu3wBYCNwITAIOA2ZLOrh7T8PMzPrTauAfFRFXRURfRDxICvcDJY0GTgPmRsSCiFgZEXOAnwFH52WPAJZGxDkRsSIifgKcD5zY5ediZmZNtBT4EfF8adIKYEz+fQZwfal8IbBnP+V7SFLrVTUzs4Ho9KTtocCtwBuBTYCHSuWPAlvm37dtUN5D6uJZi6RZkhZLWrxs2bIOq2dmZmVtB76ko4HjgJOB8XnyitJsfcC4/Pv4BuUU5nlVRMyLiGkRMW3y5MntVs/MzBpo+Z+YS+oBLgAOBPaNiLslbZaLx5Zm72FNyL/YoBzW3RGYmdkgaSnwJU0g9cM/C+wSEU/loqeAF4CtgCcKi0xhTTfO47mcUvnyiHims2qbmVm7Wu3SuYwU4AcUwp6IeBm4DdivNP8MYFH+/dZ+ys3MbAj0G/iSJpO6cc6MiFfqzHIhcKqkvST1SDoW2Jm0kwCYTxqRc3wunw6cApzblWdgZmYtaaWFv0X++YCkKD0OiojrgDNIF189CxwC7B8RzwFExFJgJjALWA7MA46JiNu7/FzMzKyJfvvwI+IeoOl4+Yi4BLikSfktwC7tVs7MzLrHN08zM6sIB76ZWUU48M3MKqLlC6/MzKpkycOPDXcVus4tfDOzinDgm5lVhAPfzKwi3IdvNsKNxL5o64xb+GZmFeHANzOrCAe+mVlFjNg+fPdbmpmtzS18M7OKcOCbmVWEA9/MrCJGbB++jTxTL586bNtecuSSYdu2Wbe4hW9mVhEOfDOzinDgm5lVhPvwzWzYDOd5GajeuRm38M3MKsKBb2ZWEQ58M7OKcOCbmVWEA9/MrCIc+GZmFdHWsExJbwHmA1+JiO/laWOA1aVZ+yJifGG57YE5wDuBp4HzIuKiAdTbBolvK202crXUwpc0RdKlwN3AnqXiifnnuIhQfhTDfgNgIXAjMAk4DJgt6eAB197MzFrWapfO7sAbSWH/RKlsIvBcRJRb+TVHAEsj4pyIWBERPwHOB07spMJmZtaZlgI/Iq6JiMMiot5laROBp5osPgO4vjRtIbCHJLVWTTMzG6hunLSdCPRKWi3p95KulDSlUL4t8FBpmUeBHlIXz1okzZK0WNLiZcuWdaF6ZmYG3Qn8BcAEYDypNd8D3CCpJ5ePB1aUlunLP8eVVxYR8yJiWkRMmzx5cheqZ2Zm0IXAj4iVEbE8IlZHxH3AoaSW+z55lheBsaXFajuD8o7AzMwGSdfH4UfEKuBhYOs86XFgq9JsU4DlEfFMt7dvZmb1dT3wJW0IbM+afvtbgf1Ks80AFnV722Zm1tiAA1/SoZL2kTRe0o7A1cCDrAn0+aQROcdL6pE0HTgFOHeg2zYzs9Z1o4W/HnAZ6Qra60lhPyMiXgaIiKXATGAWsByYBxwTEbd3YdtmZtaitv/jVUT0lv6+Ariin2VuAXZpd1tmZtY9vnmamVlFOPDNzCrCgW9mVhEOfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRTjwzcwqwoFvZlYRbd9LxwZu6uVTh23bS46s92+JzawK3MI3M6sIB76ZWUW4S8fMhs2Shx8b7ipUilv4ZmYV4cA3M6sIB76ZWUU48M3MKsKBb2ZWEQ58M7OKcOCbmVWEA9/MrCIc+GZmFeHANzOriLYCX9JbJP1Y0kGl6TMlLZG0StI9kvYtlW8vaZGkFZJ+J+mkLtTdzMza0FLgS5oi6VLgbmDPUtmuwBXAqcAEYA5wnaStcvkGwELgRmAScBgwW9LB3XoSZmbWv1Zb+LsDbySF/ROlstOAuRGxICJWRsQc4GfA0bn8CGBpRJwTESsi4ifA+cCJA6++mZm1qqXAj4hrIuKwiKj33zNmANeXpi1kzZFAo/I9JKmdypqZWecGdHtkSRsDmwAPlYoeBbbMv28LfLdOeQ+pi2dZaZ2zgFkAU6ZMGUj1bITxrXRtKPWu+vawbv+RQVjnQEfpjM8/V5Sm9wHjCvPUK6cwz6siYl5ETIuIaZMnTx5g9czMrGaggf9i/jm2NL2HNSH/YoNyWHdHYGZmg2Sggf8U8AKwVWn6FNZ08zzeoHx5RDwzwO2bmVmLBhT4EfEycBuwX6loBrAo/35rP+VmZjYEunGl7YXAqZL2ktQj6VhgZ+CyXD6fNCLn+Fw+HTgFOLcL2zYzsxYNOPAj4jrgDNLFV88ChwD7R8RzuXwpMJM08mY5MA84JiJuH+i2zcysdW0Py4yI3jrTLgEuabLMLcAu7W7LzMy6Z0Dj8F/LhnMM7SPDtmUzs8Z8t0wzs4pw4JuZVYQD38ysIhz4ZmYV4cA3M6sIB76ZWUU48M3MKmLEjsO3zvj6hZHH76nVuIVvZlYRDnwzs4pwl84w8L/qM7Ph4Ba+mVlFOPDNzCrCgW9mVhEOfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRTjwzcwqwoFvZlYRDnwzs4pw4JuZVYQD38ysIrpye2RJ+wM/Kk3+QUTMzOUzgbOBtwIPACdHxI+7sW0ze/0azv/GBdX7j1zdauFvAvw0IlR41MJ+V+AK4FRgAjAHuE7SVl3atpmZtaBbgT8ReLpB2WnA3IhYEBErI2IO8DPg6C5t28zMWtDNwH+qQdkM4PrStIXAnl3atpmZtaCbgX+4pNWSfiPpbElvkLQxqbvnodL8jwJb1luRpFmSFktavGzZsi5Vz8zMuhX4nwc2JvXRfxQ4kNRXPz6XryjN3weMq7eiiJgXEdMiYtrkyZO7VD0zM+tK4EfEnyOiLz9uBo4CDgdG51nGlhbpYd2dgJmZDaLBGod/HyBSC/8FoDwiZwrrdvOYmdkg6so4/Dp2A14k9dXfBuwH/LxQPgP4wSBt22zITb186rBte8mRS4Zt2/b60pUWvqRPSto5n6jdC5gPXBwRzwMXAqdK2ktSj6RjgZ2By7qxbTMza023WvhTgJtIXTi/Bb4KfA0gIq6TdAbp4qtNSS3+/SPiuS5t28zMWtCVwI+Ik4CTmpRfAlzSjW2ZmVlnBqsP35oYzvuHPDJsWx44v25mA+O7ZZqZVYQD38ysItylY9YFSx5+bLirYNYvt/DNzCrCgW9mVhEOfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRTjwzcwqwoFvZlYRDnwzs4pw4JuZVYQD38ysIhz4ZmYV4cA3M6sI3w/frAv87xft9cAtfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRQxZ4Ev6jKTfSVop6QZJvUO1bTMzG6LAl/QJ4Ehgf2ALYCnwfUkaiu2bmdkQBL6kUcDpwMkR8auIeBY4AdgGeM9gb9/MzJKhaOH/BbAJ8OPahIhYAfwU2HMItm9mZoAiYnA3IB0EnBcR25WmXwq8FBEnlKbPAmblP3cA7h/UCjY2CXhqmLbdH9etM65bZ1y3zgxn3baOiMnliUNxL53xwIo60/uADcsTI2IeMG+wK9UfSYsjYtpw16Me160zrltnXLfOvBbrNhRdOi8CY+tM76H+jsDMzAbBUAT+48Cb88nboinAQ0OwfTMzY2gC/z+B0cAetQmS1gfeBSwagu13ati7lZpw3TrjunXGdevMa65ug37SFkDSBcBewAeBp4ELgMkRceCgb9zMzIChu9L2dOA24E7gMdLJ4sOHaNtmQ0rSREn3drjs+pL2a3Heb0naqJPtDDdJx9Wru6T9JK0zusS6Y0gCPyJeiIiPR8SEiNgoIo6MiOWDsS1JGzS6glfS5pIaHtJIelzSOmfVJR0laUE361la/3RJn+xguV5JqzpYrunr0E2SQtLmHSw3V9LsFubr+L1pVrccPFdLekDSE5J+K+k6SYdLWlXnEZLekhcfQ7r+pLi+aZIeKU2bLelr+fdH8mdvM+DfWnwKHwbWb+MpF7fd0esmaTdJp3ayzZKzgXrBfiGl164dA/i8dbRcG+tv+l2V9E5JlzQoO0jSCfXK2jUSb562lDR+/1WFLxOl6ZK0Xu2RJ48uTGvr9ZE0On9w3pT/PlrSS/nxci6r/f2bwqLbAfsV1jMpz1sOlUNzeUia1KAO0xos+4qkvfup/7g83zb9zNeofh/L5c+rhXslSZop6dYW5tu71RZzN+om6Vjgm6Tg3Ys0wGBP4HLgLODciOipPUhXjC9nEP/boKTvSvpF8UE6N7awNP2nkr5W3lnmwHm+n20clT+n9XZoH8yzbQu8v8Hy9zdYdlX+zEd+/Z8nHeX/ova3pOub1Ktbn7f/JemafuY5XNIiSUslPSPpD/k1PUHSmDbq1u93tWQi8PYGZTsCu7Wwjn6NiP9pm9/s2os6GvgLSeOBFyJiSZNFDwMuLfz9BuAm4JX8943AB9qoSu3E9DuA70bEPwP/nOv4AeAzEfGOVleWw6QTj0ZEb3FCi4F5BvBn4LPAMf3NPID61YzJj64bYN1OBT4REd8pTHsS+FdJTwI/kjQ7ImqfkyOA7xf+bmSCpPMKf+9JGtTQis/RWmv+ZeCjDcpGSap9RrdtMM+NEfHeFuu0lojYoVGZpLHAC8BWEfGnDtc/0M9bfz4HTAc+AdwWES9KGg3sCnw5lx3arbpJuh/YujSteBTw8YiY3+56mxkRgU86Gfw3+fdxwKdIF3Y9AXyk0UIR8S3gW7W/lQ65PxQRd7RbAUlTgH8Bvg1cJOmXEfFAYZadgP8maf2IWCnpWuCAXDaaYRyxJGl74EzSje22BS6W9G/A6RHRUV90i3YFdpa0YUT8WdJ1wKa5bBtgTv59PYb2szqKFJz1vAy82mUo6W2kgK13BFnrNqsdMb0EFI/sdiwt8rPCfGuJiF8qHYV+nNSVs2OuxyrSebGrgTkR0afUozmt1gLOJpK+G+fkvzdnaP//ee01myPpHaTP/EvAPcDn+2mYdcumrPl81bM/8PcRcUttQkS8DNwh6XPAj7pZmeIOUtJE0kWqf4iI1d3cTtGICPyI+DJpD4ykp4BjOgyqMbTZzSVpA+BE0hfxSxExV9KHgZskXQ6cDzwPfIjUP3kacFZEHFxYx1HAIR3Ud0CU+nB785/nA/NJwXAYcBBwuaQ+YDHw1Yh4uIvbnkQKyltI/bknkG6pUftMnl2Y/c3kazki4hVJ04Etc1nLR0xtOJ+0016PdMT3DLARqUV+HnBBrsc2wHWk9/2XddYzBiAiXsrP97mImFsrVOozLh7u70G6FP/XDer1bVJgnQIsLrRA/xKYDRws6V153kmsvUPZEFgZEXvnbR9FC5+53DXxL4VJo0j3wWpX7Ujul8Dhue4C/hZYJGmLHK4A20l6FngsIp7pYFuNvA/YXdKbIuL3dcoXA2dJega4qfD6vh34IvD9LtYFWHPrGVKvQh+wZf5efgxYAEwl7ai/02gd7RgRgV+T+9g2pv7JoP6WnUBq9ezEmpZWs/l3BOaS3pBrgHdFxKMAEfEdSTeTvpi/JrVmvk3q/10g6diIuLT+mlv2Hjo8YVewIfAo8JGIWAYgaRnpsPta4FpJU0lB9Hh5YUmLi3+XLiN/l6TtqEPSxsAPga8CF5G6SL4CnBIRL+V5+gqL7E1q/ewJ3Er6Atb6O7cj7VC7Urc878W5C+xY0gizScCfgAeA/x0RP5A0A7gKuCIi/qHBesot9a0lFaeNAuqeqKvzfAT8D2CPiPh5YRsvA3dJOpH0Xm6RixZExOzC8r3AhyXVdpQTWtluRFwJXFlYzyGkMGpX7bO6ktxlGhEhaTVpZ1AcaHES6ZzIPwCv9u0P5D2VdCDp+30uMFfSBwo7mJodSO/JWcBlknqA1cBvST0B/9TaU11H3e+qpA1Jr+27I2JxnjaWFO6nR8S787TPsO7RYEdGVOADO5PCdTdSy6zoPNKHrZGPkFpXH5N0WfRzgUJE/FrSWcDt+e6f5fInJH2JtPPpBU6KiJeVTn79UNK+wHEDaMF8kvRc6xmtdUccrPNeR0S/dyvNh9qNDrebffFPJHU3rEXSe0lBf01E/GOetj/py7RE0jvzLbRr808ktQL/ETgZuDUivlIoP4r6LdW261YUETcDN9ep/y6SrgIOBD4dEV9ttp7C+hazdqi1JYfj9cBsSZ+KiF8V6rQN8CXSsOc/NFnN+sDC/PtGwN115tlbUm3nPoo1n7GHIuKdndaf1Lh4jtQPfnLu7hoFPAjMLO0cT4yI/6izjo7eU0m7Al8HZpJa8d8FviHpoxFRXOb9EfFEi8+nHY2+q6tJ5zW2kXRX3gFNJN1d+NncCHoLqZv19q7UJCJGzIPU4r6T1NIZU5j+CHA8qa8/6iy3Gam/fzrpJNonS+VHkVpM7dbnIuB7QE9p+jjgaGBUvfWTWpTr1LNQHnmeXmBVqext+bnUe+yZ59k8r+OlNh9vbrF+zwO9hbpuXih7P3BQg+XeWvh9b2B34BukrrD1SS3sQ5u9NwOs26oGjyj8/hKpH/+F/Peb62xjI+CqNj8r3yW14rYAbm4wz/qkLsG7gWWko65lwH2kVulGeb6v5dfq3wuPRcDzzT7Tef2bkRopmwBvBMaW5jkE+I86n8d2H32kMFs/b2trUkv/XmDv0voH8p4em1+jAwvTxgKXke7Eu0Gd97iVR6vfhYbf1Vy+G6nr5g+kgQH3A58nZ0Oe53hSN+LAM7IbK3ktPEhjd5/JH6LrSbdkrpU9Qjqptnn5zckfuJ/V5iftTf8IfLSfL0cr4VD3Q1Kn7nsDZ7TxAW/6IWrhtVrndWhz+Y6/gIV5tiadIGu0jg+Qdpj3A+PztN3zl3d6o/emG3Vr8HpvWZq2Hmkk002kocB/Io1wupd0PmnTBuvan/53rM+3UCflebeoU7YDMKPOY+9mn+kW3/v1SVfJNyo/j8J3L087mRTwfyJ11SwntfafJu207ie1vLeh+4H/EWDXBsttU3qPN8+/zwdmF8ruBWZ0+F3o97ua38sNmqxjDDCu3feq3mNEdOnkE2JXkU6ePZQP82/PJ1/ObrLczqSx1Y8BnwaIiN9K2ofU1/5+4O/qLRsNhmHlQ9XeKB0aKl09eKqk9wFbkfoxg9THfyXwf+qs6/+SPgxjSF+0URFxZKPnU1r2fUBfFEYcNJhvLOkL+Xek/nBIh9qPkE5SfTki6o7fzqNAavV7A+mDv87zaGAL0lHOFxqUfxL4K+CvatuPiDuUxsgvkPSRiPhek+fVcd2U7vV0AulE+xRSMN0laSnpiO0i4GJSQH2GNIRvtdJ1GzuSXs87JO1cfu0i4gaadKXmvvZGJ22L64k8GmedrseIuB+4X9KFwBejjW5DSQeTRvw0czPw162uM/t34JDICdZk+0+Qjp7qlbX9nkbEN/Oy00ihenOh7OHS7GPzuZK2DeS7Smpk/oJ0nqqek0jd1Ud1UreiERH4pFEE/xkRFwBExJO5X/iL1LnnfsFmpFEin47CCZxIQ+D+Etg90miMAVUuj+S5g3RY/UHg/vyFXY80yqQ2xrfWF91HGlr6Cun20qtIrZg/trHZ/07qxqkX+M+yZjzxN0gjP44D7srPV6ST17NJR0vvLi2/kjUnrF8q1K/eyIdmyicxi0YBc2Ptoa1ExLWSnia1uurpRt3+X97+0VEY7SXprcDfk1r1OwDvLQXIK8B9OZieI51YbrrDbYUaXzA1Gvit6l81vT3pPb2IdORbdhNrDxEF0utL8x1SpydtI3/mNyPtJP+a1PBRfjxHGqI5NyJuKy3bjfd0Jmlk1zrnZbL3kbpzp7exTujOd3XIjJTA/xClVkEOig8DNArsiFhEg/HvkS4O6da4212AN5FO0r5Y2MZLwP+XdDpwQ2H6StLQwEER6UTVVfnP95L61O8slAcpuD4NPCRpg4joK5T3kcJkoNa5QKwmt5jqBl0xZOuUdaNuf0MaObHWTiUiHpT0WdIR4bXAOZJOI524r7XwdyC18P9I6xdVNRURjVp+TTVrqEQaUfZop3UagO8BvyIN+3241uJXulDyXcA3Ja2IiB/WFuji562hiFhQeL0uZe0BHp+iwcCFLn5XN1DjWy+MpnC90ECMiFsrRMTK6P8qx+F0F6mv8lJJO+VgQNJYSe8hXQzzr8NUtx8CX5S0Rz7iQNIoSbuQTpbeXAz7ivgBcLakd9R5Tb5Cej8/RBr58QXg4dx9+ARp+O0fgN0adYVVXJAamuVrXtYjnUwVdbqphlJE/Ly4s4+IBRHx5CBvti8Kt+uItW/dcXq3NjJSWvivaRGxQunqwo+TAuHNksaRDgN/lafNabKKTp0p6cwm5ceQ+gVPJg2V3D5354j0z2m+Txq3PFi2btKqWY81V4UOtUNI11BcDLy18Jo8QtoZ/M/cBTg/P7rpj6Ruv275TT9dkm+L+heNDZaDSOfLrgZ68w5VpBO6dwOzIqLhfXUG6KOSGt12AlJ3zL39vF4H5PMw3TYkLfwhuR/+a4XSVXNbRcQjbS43nnTCp9+9vKS5wGkR8efOatlWvdYjjfwZjkPzluSTkL+LdS9y6db6W35v6izbyyDWbSRSukBx03xiuF75AQDFLhmlq3+nRLqIa7Dr18tr8D19rXxXKxX4ZmZVNiL68M3MrH8OfDOzinDgm5lVhAPfzKwiHPhmZhXhwDczqwgHvplZRfwXjCuETUYSjBEAAAAASUVORK5CYII="/>
```python
plt.bar(df['이름'], df['국어'], label='국어')
plt.bar(df['이름'], df['영어'], bottom=df['국어'], label='영어')
plt.bar(df['이름'], df['수학'], bottom=df['국어'] + df['영어'], label='수학')
plt.xticks(rotation=60)
plt.legend()
```
<pre>
<matplotlib.legend.Legend at 0x1def9b28d60>
</pre>
<img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAXwAAAEdCAYAAAAPT9w1AAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjQuMywgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/MnkTPAAAACXBIWXMAAAsTAAALEwEAmpwYAAA0T0lEQVR4nO2de7gWVdn/PwvYsDmDsJE4K4R4IHhfSZTwDFpppiYlVlpWiKWJFmZpYQU/SVE7iBxCpTympmb6iuYpD3ksRazUFFBCC1AROekG1u+Pew179vBs2Gyemdns+X6u67membVmnvk+a625Z829Ts57jxBCiKZPs7wFCCGEyAYZfCGEKAgy+EIIURBk8IUQoiDI4AshREFokbeArdG1a1ffr1+/vGUIIcROxV//+tcV3vuqZHijNvj9+vXj2WefzVuGEELsVDjnXi8VLpeOEEIUBBl8IYQoCDL4QghREGTwhRCiIMjgCyFEQZDBF0KIgtCou2WKYrJq1SqWLVtGdXV13lJ2WioqKujWrRsdOnTIW4poRMjgi0bFqlWr+O9//0vPnj1p3bo1zrm8Je10eO9Zt24dS5cuBZDRF5uRS0c0KpYtW0bPnj1p06aNjH0Dcc7Rpk0bevbsybJly/KWIxoRTbaGP/g3g3O79oJTFuR27Z2d6upqWrdunbeMJkHr1q2prq7WvdBA8kw3SCftVMMXjQ7V7MuD0lEkkcEXQoiCIIMvxE7I+PHjufDCC/OWIXYymqwPXzQt+p13dy7XXTz1qAafO3z4cObPn19nfHV1NRs3btwi3HvPlClTmDlzJu+++y4HHHAA06dPZ4899miwFiFANXwhUuOpp55i/fr1JT9LliyhTZs2Jc+bPHkyt9xyCw8//DArV67k6KOPZvTo0axduzbjfyCaGjL4QuRAdXU1bdu23SJ8/fr1XHLJJcyaNYsBAwZQUVHBhAkTGDRoELNnz85BqWhKyOALkQOrVq0qafCfe+452rdvz/77718rfMyYMTzxxBNZyRNNFPnwhSgzLVrU77bauHHj5mNff/31zQOlevfuvcWxvXr1Yt68eRxyyCEAvPLKK4wbN65smkUxkMEXosxs2LBhi7DFixczaNAg1q9fv9VzO3fuzOrVq7cIX716NQMGDGDy5MkATJs2rTxiRaGQS0eIRkT//v1ZtGgRa9asqRU+f/58hg8fzsiRIxk5ciTdu3fPSaHYmZHBF6IR0bNnT0aMGMGsWbM2h61cuZI5c+bw+c9/Pkdloikgl44QKfDBBx9s0Sgb99kDdOrUiRUrVmxx7rRp0xg1ahQLFy5kt9124+qrr+aoo47a7L8XoqGohi9ECrRq1YoNGzbU+njvN2+/+OKLJX39AEOGDGH+/Pn07duX5cuXM3XqVK666qqM/4FoitSrhu+c+1/gZ8AIYDXwR+C73vuVzrkK4MPEKWu89+1i5w8EZgAHAG8D07z3vyiDfiGaJD169GDixIl5yxBNjPq6dH4AXAUcC/QA5gIzgROBLuGYVt77pOHHOdcWuB+4EvgMsC9wp3Nuiff+th0RL4rDjkxxIIQw6mvwv+K9j/qK/cs5NxG43znXHDP475cy9oGTgaXe+6lh/1Hn3KXAmYAMvhBCZES9DH7M2EesBSrCdhdgy5anGkYB9yTC7gfOd845772vjwYhmhJ9+vThD3/4Q4PPnzJlCs2bNy+jIlEEGtpoOxZ4zHu/ETP4/ZxzHzrn3nTO3eic6xM7tj+wMHH+60Al0LWB1xdip6ZNmzYcfPDBDT6/S5cudOrUqXyCRCHYboPvnDsVOB2YEILmAZ2BdlhtvhK4zzlXGeLbYW8EcaJRJa1K/P4459yzzrlnly9fvr3yhBBC1EG9Db5zrtI5dyXwE+Aw7/18AO/9Ou/9e977D733/8Bq/12BQ8Op1UDLxM9FD4Mt5nv13s/23g/z3g+rqqrazr8jhBCiLurbLbMz5odfCQz13tfps/fer3fOLQL6hqB/A8nZoPoA73nv39luxUIIIRpEfWv4czE//Ke3ZuwBnHMdgIHU+O0fA0YnDhsFPFB/mUIIIXaUbRp851wVcAwwyXu/qUT8WOfcoc65ds65QcDNwL+oMehzgP2dc98MbqGRwDnAxWX7F0IIIbZJfWr4HwnfrzjnfOJzLOYWmouNoL0HM/ajQg8evPdLgaOBccB7wGzgG977p8r6T4QQQmyVbfrwvfcvAG4bh127jd94BBhaf1lCCCHKjSZPEyInli5dymOPPdagc8ePH8+FF15YXkGiySODL0RK3HXXXQwfPpwOHTrQr18/xo4dy2uvvbY5/tFHH+WCCy7Y4jzvPZMnT6ZXr160bduWUaNG8fLLL2cpXTRRNB++2Dm4sGNO132vQadde+21nH/++cydO5cDDzyQN998k7PPPpsBAwbQunVrmjVrxoYNG7ZYrBxg8uTJ3HrrrTz88MP07duX6dOnM3r0aF566SXatGmzo/9IFBjV8IVIgcmTJ3PFFVdw2GGHUVFRQd++fbnhhhuoqqri7rvvZvXq1cydO3eL89avX88ll1zCrFmzGDBgABUVFUyYMIFBgwYxe/bs7P+IaFLI4AuRAosWLWLIkCG1wiorK9ljjz145526xxs+99xztG/ffoua/5gxY3jiiSdS0SqKg1w6QqTA7rvvzvPPP0/fvn03h61bt46XX36Z559/nnfffZdnnnlmi/OWLVtG797JgenQq1cv5s2bt3mZw1deeYVx48alpl80TWTwhUiBSZMmccYZZ9CqVSsOPPBAli5dysSJExkwYABvvfUWb731FgsXJieRhc6dO7N6dXI2cli9ejUDBgxg8uTJgK17K8T2IoMvRAqMHTuWqqoqpkyZwimnnELHjh058cQTueCCC2jZ0uYSvOmmm5g5c2at8/r378+iRYtYs2ZNrUXQ58+fz/Dhwxk5ciQA1113XXZ/RjQZZPCFSIlRo0YxatSoOuO7du3KXnvtVSusZ8+ejBgxglmzZnHOOecAsHLlSubMmcNNN92Uql7R9JHBFyJF1q5dy+WXX87tt9/Oq6++yqZNm2jWrBkDBgzguOOOK+mamTZtGqNGjWLhwoXstttuXH311Rx11FGb/fdCNBT10hEiJbz3HHHEETz55JPMmDGDFStWsGrVKlasWMGVV17J448/zpFHHrnFeUOGDGH+/Pn07duX5cuXM3XqVK666qoc/oFoaqiGL2ox+DeDc7v2glMW5HbtNFi2bBmPP/44ixcvrtVbp0WLFuy333786le/YsCAASxbtoxu3brVOrdHjx5MnDgxa8miiSODL3YOGjjiNU+6devGAQccwBlnnMGkSZMYOnQoLVq0YMOGDTz33HNMmjSJkSNHbmHshUgLuXSESAnnHH/6058YNmwY48aNo0uXLnTo0IEuXbowfvx4RowYwb333pu3TFEgVMMXIkXatm3LpEmTmDRpUll/d8qUKTRv3rysvymaPjL4QuyEdOnSJW8JYidELh0hhCgIMvhCCFEQZPCFEKIgyOALIURBkMEXQoiCIIMvhBAFQQZfCCEKggy+EEIUBBl8IRopN9100+YFT+IsWbKEXr165aBI7OxopK3YKchrFs9yzeC5ceNGWrRowdKlS+nRo0edx82bN2/z9vz581m5cmWtsMGDB7Nx40ZWrFhRFl2iWNTL4Dvn/hf4GTACWA38Efiu935liD8auAj4KPAKMMF7/2Ds/IHADOAA4G1gmvf+F+X7G0I0bp588kkAnnrqKY477rg6j7viiitq7ffr169W2Nlnn03//v3TESmaPPWt4f8AuAo4FugBzAVmAic65/YFrgXGAn8GvgLc6Zzb03u/xDnXFrgfuBL4DLBviF/ivb+tfH9FiMbJG2+8wVe/+lVOOukkzjrrLPbee28GDhxY8ti77roLgAcffJAnn3ySNWvWsNtuuzFmzBg6duwIwOLFi7OSLpoY9fXhf8V7f5P3fo33/l/AROAY51xz4Fxgpvd+nvd+nfd+BvAkcGo492Rgqfd+qvd+rff+UeBS4Mwy/xchGhVr1qxh6tSpjBgxgnPOOYfrr7+eSy65hEMPPZQf/OAHvP3221uc473nxBNP5Lvf/S4VFRX06tWLp59+moEDB/Liiy9uPm7jxo1MnTqVqVOnsmbNmiz/ltiJqVcN33u/OhG0FqgI26OA5Dvq/cChsfh7SsSf75xz3ntff7lCNH5eeuklxo8fz4IFCzjhhBN4/PHHN6949YUvfIGDDz6Yyy67jEGDBtG9e3emT5/OQQcdBMDf//53HnzwQZYsWUKrVq02/2avXr249NJLueaaawB7MKxfv37zthD1oaGNtmOBx4D2wC7AwkT860DUjaA/cHuJ+EqgK7A8HuGcGweMA+jTp08D5QmRH4MGDWLSpEkMHz6cNm3abBHfvXt3Lr74YqZOncoLL7zA4ME1DdLt27dn3bp1LF++vFZPnDfeeGOzSwdsmcQLL7ww1f8hmh7bbfCdc6cCpwMHAu1C8NrEYWuAqHrSro54Ysdsxns/G5gNMGzYMFVdxE7JoYceus1jmjVrxtChQ2uF9e3bl5/85Cfsu+++HHjggbRr147nnnuOjh07cscdd6QjVhSGeht851wlcBlwDHCY936+c27XEN0ycXglNUa+uo542PJBIMROT2VlZcnwDz74oJabJs5rr71Gz549AeuJc/LJJ/P888+zdu1aJk6cyN5777352LZt23L88ceXX7ho8tS3W2ZnzA+/EhjqvY86Aa8APgB6A/+JndKHGjfPv0M8ifj3vPfvNEy2EI2XyLeexDnH4sWL6d69+zZ/o0uXLhx++OEl46qqqrjhhht2SKMoJvXtpTMXM+Cfjhl7vPcbgSeA0YnjRwEPhO3HthEvhIjxyCOPUFlZWeenVatWtGvXbts/JESCbdbwnXNVmBtnoPd+U4lDLgd+45x7HHgKOAXYBxgT4ucA33HOfRO4GhgGnIP1yRdCJDjooIPqfEsA64e/zz77ZKhINBXq49L5SPh+xTmXjDvOe3+Hc+58bPBVN6zGf4T3/n0A7/3SMBL3l9jD4TXgG977p8rxB0QxKNcUB0IUmW0afO/9C8AWlj5xzJXYSNq64h8Bhm6vOCGEEOVDs2UKkRGnnXZayX7520tlZSUjRowogyJRNDRbphAZMXPmzLL8Tvfu3bnvvvvK8luiWKiGL4QQBUEGXwghCoJcOkIIUYIFi97IW0LZUQ1fNDo0+2N5UDqKJDL4olFRUVHBunXr8pbRJFi3bh0VFRXbPlAUBrl0RKOiW7duLF26lJ49e9K6dWtKDPYT28B7z7p161i6dCm77rprk3RNiIYhgy8aFR06dADgzTffpLq6Omc1Oy8VFRXsuuuum9NTCJDBF42QDh06yFAJkQLy4QshREFosjV8+S2FEKI2quELIURBkMEXQoiCIIMvhBAFocn68EXTY/BvBud2bS3AIpoCquELIURBkMEXQoiCIIMvhBAFQT58IURu5NkuA8Vrm1ENXwghCoIMvhBCFAQZfCGEKAgy+EIIURBk8IUQoiDI4AshREHYrm6ZzrndgTnAL733d4SwCuDDxKFrvPftYucNBGYABwBvA9O897/YAd0iJTSttBBNl3rV8J1zfZxzs4D5wIhEdJfw3cp778InbuzbAvcDfwK6AicBFzrnjt9h9UIIIepNfV06+wHtMWP/n0RcF+B9732ylh9xMrDUez/Ve7/We/8ocClwZkMECyGEaBj1Mvje+1u99yd570sNS+sCrNjK6aOAexJh9wP7O+dc/WQKIYTYUcrRaNsF6Oec+9A596Zz7kbnXJ9YfH9gYeKc14FKzMVTC+fcOOfcs865Z5cvX14GeUIIIaA8Bn8e0Bloh9XmK4H7nHOVIb4dsDZxzprw3Sr5Y9772d77Yd77YVVVVWWQJ4QQAspg8L3367z373nvP/Te/wMYi9XcDw2HVAMtE6dFD4Pkg0AIIURKlL0fvvd+PbAI6BuC/g30ThzWB3jPe/9Oua8vhBCiNGU3+M65DsBAavz2jwGjE4eNAh4o97WFEELUzQ4bfOfcWOfcoc65ds65QcDNwL+oMehzsB4533TOVTrnRgLnABfv6LWFEELUn3LU8FsAc7ERtPdgxn6U934jgPd+KXA0MA54D5gNfMN7/1QZri2EEKKebPeKV977fon9a4Frt3HOI8DQ7b2WEEKI8qHJ04QQoiDI4AshREGQwRdCiIIggy+EEAVBBl8IIQqCDL4QQhQEGXwhhCgIMvhCCFEQZPCFEKIgyOALIURBkMEXQoiCsN1z6YgdZ/BvBud27QWnlFqWWAhRBFTDF0KIgiCDL4QQBUEuHSFEbixY9EbeEgqFavhCCFEQZPCFEKIgyOALIURBkMEXQoiCIIMvhBAFQQZfCCEKggy+EEIUBBl8IYQoCDL4QghREGTwhRCiIGyXwXfO7e6ce9A5d2wi/Gjn3ALn3Hrn3AvOucMS8QOdcw8459Y655Y4584qg3YhhBDbQb0MvnOuj3NuFjAfGJGI2xe4FpgIdAZmAHc653qH+LbA/cCfgK7AScCFzrnjy/UnhBBCbJv61vD3A9pjxv4/ibhzgZne+3ne+3Xe+xnAk8CpIf5kYKn3fqr3fq33/lHgUuDMHZcvhBCivtTL4Hvvb/Xen+S9L7V6xijgnkTY/dS8CdQVv79zzm2PWCGEEA1nhxptnXOdgF2AhYmo14FeYbt/HfGVmItHCCFEBuzofPjtwvfaRPgaoFXsmFLxxI7ZjHNuHDAOoE+fPjsoTzQlNHe6yJJ+62/I9fqLU/jNHe2WWR2+WybCK6kx8tV1xMOWDwK897O998O898Oqqqp2UJ4QQoiIHTX4K4APgN6J8D7UuHH+XUf8e977d3bw+kIIIerJDhl87/1G4AlgdCJqFPBA2H5sG/FCCCEyoBwjbS8HJjrnDnbOVTrnTgP2AeaG+DlYj5xvhviRwDnAxWW4thBCiHqywwbfe38ncD42+GolcCJwhPf+/RC/FDgaa4h9D5gNfMN7/9SOXlsIIUT92e5eOt77fiXCrgSu3Mo5jwBDt/daQgghyseOdststOTZpWpxblcWQoi60WyZQghREGTwhRCiIMjgCyFEQZDBF0KIgiCDL4QQBUEGXwghCoIMvhBCFIQm2w9fNAyNX2h6KE9FhGr4QghREGTwhRCiIMilkwNauUkIkQeq4QshREGQwRdCiIIggy+EEAVBBl8IIQqCDL4QQhQEGXwhhCgIMvhCCFEQZPCFEKIgyOALIURBkMEXQoiCIIMvhBAFQQZfCCEKggy+EEIUBBl8IYQoCGWZHtk5dwRwbyL4bu/90SH+aOAi4KPAK8AE7/2D5bi2EGLnJc/VuKB4K3KVq4a/C/AX772LfSJjvy9wLTAR6AzMAO50zvUu07WFEELUg3IZ/C7A23XEnQvM9N7P896v897PAJ4ETi3TtYUQQtSDchr8FXXEjQLuSYTdD4wo07WFEELUg3Ia/C875z50zr3qnLvIOdfGOdcJc/csTBz/OtCr1A8558Y55551zj27fPnyMskTQghRLoP/Q6AT5qP/GnAM5qtvF+LXJo5fA7Qq9UPe+9ne+2He+2FVVVVlkieEEKIsBt97v8p7vyZ8/gx8Bfgy0Dwc0jJxSiVbPgSEEEKkSFr98P8BOKyG/wGQ7JHThy3dPEIIIVKkLP3wS/BxoBrz1T8BjAaeicWPAu5O6dpCZM7g3wzO7doLTlmQ27XFzkVZavjOue845/YJDbUHA3OA6d771cDlwETn3MHOuUrn3GnAPsDcclxbCCFE/ShXDb8P8BDmwnkN+BVwBYD3/k7n3PnY4KtuWI3/CO/9+2W6thBCiHpQFoPvvT8LOGsr8VcCV5bjWkIIIRpGWj58sRXynD9kcW5X3nGUbkLsGJotUwghCoIMvhBCFAS5dIQoAwsWvZG3BCG2iWr4QghREGTwhRCiIMjgCyFEQZDBF0KIgiCDL4QQBUEGXwghCoIMvhBCFAQZfCGEKAgy+EIIURBk8IUQoiDI4AshREGQwRdCiIIggy+EEAVBBl8IIQqCDL4QQhQEzYcvRBnQ8otiZ0A1fCGEKAgy+EIIURBk8IUQoiDI4AshREGQwRdCiIIggy+EEAUhM4PvnDvPObfEObfOOXefc65fVtcWQgiRkcF3zn0bOAU4AvgIsBT4g3POZXF9IYQQGRh851wz4PvABO/9P733K4FvAbsBB6V9fSGEEEYWNfy9gV2AB6MA7/1a4C/AiAyuL4QQAnDe+3Qv4NyxwDTv/YBE+Cxgg/f+W4nwccC4sLsH8HKqAuumK7Aip2tvC2lrGNLWMKStYeSpra/3vioZmMVcOu2AtSXC1wAdkoHe+9nA7LRFbQvn3LPe+2F56yiFtDUMaWsY0tYwGqO2LFw61UDLEuGVlH4QCCGESIEsDP6/gZ6h8TZOH2BhBtcXQghBNgb/b0BzYP8owDnXGvgE8EAG128oubuVtoK0NQxpaxjS1jAanbbUG20BnHOXAQcDY4C3gcuAKu/9MalfXAghBJDdSNvvA08AfwXewBqLv5zRtYUQQpBRDV8IIUT+aPI0IYQoCDL4QghREGTwd2Kcc41yEXrnXC/n3CedcxV5a9kazrnmeWsQO45zrlVsu1FNyOic6+qcGx3XmCcy+Dsx3vsNJcY3NAZOBr4JTHDODclbTBLnXGcA7/3GsJ+7kYg0OOc+kbeWnZCHnHNznXPtfWiUdM71d871z1sYsCdwInCFc2503mIao7FolESG1Tl3pHOuV85ajnHObXLOHe+93xTC9nPOHdRIHgC/Af4PGAKc75z7mnOuT86acM71dc6dAdzinHvFOXdCiIrytk8e6eeca+a99865jwNznXN7hfDcH0QRyXRxgbz0JDgL2Ad4wzk33jnXDpgCfCZfWQA8B9wJrAa+7pyb5JzbMy8x6qWzFaICHas17Af8Hjjaez/fOfcrbGK413PQ9j3gPOCfwPeAYeHzde/9uqz1xHS5WHpdDBwDPA8sAx4B7vTef5iHLuAP2GRWf8Om+zgDOMl7/2Q4ZjVwjPf+wTp/KF2NtwMLvPc/SqRj8+htJG/CmJrbvPePhf0K7311jnqaxSo9XwR+AWwClnvv9w7huaRflIex72uAA7Hu6Q8Bt3rvs51czXuvT+wDNA/frRPh5wH3AhPD/ueAD3PW2hH4NbABM2THxOJa5KQpqkR0xQr1MGzdgznABcBQbMrsZhnrugR7WFfGwp4FTgjbPwaeSpaDDHS1Cd8nAveFtDkAuA34HdAlxGeaXgmN0T1xBmZMPwBuBjrFjvkc0DNPfbH984APgZuA3XPSVBG+Pw58NWwvxcYf/Q54CvgS0Dqrsua9l8HfSoYtAa4NRuJu4H5gRCz+TeALYTt14xoZ0rC9T2Qowv7ewB+xyei+k3faBU0XAVfG9ttg/sxPB+P7fWBQRlr6YHM69YmnJTAt6OmIzd46tMS5qRla7C3jbmBqMABHhbS5OWh7Arg9HBsZ3SuAz+aQn82Ad4G9gArgT8Hwn45NnbIJGJxTWYvys0UsrApzK67Dav2ZGdWEtjexBZ8GAr8KYf8HHAa0AiYA1wH7Z6Inj0TYGT7BELyG1UyHAG1jcZOBpzPW0yx8T8empzgH2D2qSYS4E4BFwH+Bw3LQ1iMW1pea2ut+ieMvAZaHtP06KdcMg0GdFrajmldr4Blsyc3fAjNC+KeA24GTM0q7/sFYXo3Vkl+N0gNzh10NtAz7e2Gzz3bNIW9nAfck4o4FXgj6fx1P34w0VcXCogdiq8SxBwGPYostbX77TFnf8aFcfQ14NtIKfBF7SzomVgY/Gx5IjwI/BD6aqrasCs7O9IkVqNuA74bt6KbrTKw2SIa1e2AA8D5wGuYuuR9zBXSLaXaYe2JadEMA7dO+EbFa8hPA5UDPYPBPDIZiAebiif7Hk8D1WG+eh4GpaaYd8BPgrET4xZg7rC/wbgibhb3RXYPVXlMz+rG0qMQePMNDOp0WO2YUMC9W9h4HfpxTuVtLeKBjNfxI04HYQyj+sE/d/QR0wt5qzyO4vUJ4a2zt7FnUdt9FlY/RwFUp6mqL1dqfBjYCg0NZeyiU+2+UOOcubEXAPwBzU023tDNmZ/zECvoJwC1hOzKoV1Pzmt2MmKslAz0PA5eG7ebARKyGdR1wKLVr+y1j278jZfcJtpjNcaHwrsb8p49hq5ftETtuLLAitr8O+GLK2i4Gfh/TeRDWkNwOuBV4Cevp8QjQLhz3W+CMDPJ2LjAJOBN4PhH3aKQhpNsbyTKRR7lLHPMMsDgY2JMScWm6wz6CuUrmAi8Cv8QqaE9jbW1n16F3BTA+RV3Rm8bDwVYcgK3aVxnuhV9jD4XoTXMw8B72EF0CnJJqnqZdaHbmD9aX/Oex/Y9jr68fAueS7evr0cDSEvFtg9G/IxHeInyfD7yZUXo1B0Zi7pqTYuHx9of/Al8J2+cBL2Sg61Bs7YXpmK/8RuBIzGWyCKtdraL2g+ky4Kcp6YkM6chgMP8He6v4YuyYo0I5+07YXwycGM/bDMvdsrj2WNn6BvAfrGH+R8HgziTW1pWyxpbYLLxPhPQZDRxa4rhI7/eBf6aoJzL2/TAvQBesS+apIfxk4N7EOc8C47HK5Uupp1kWGbOzfWIZNwa4ORb+AtZINSQUsNcJvTwy0LQU+Flsv2W4+VphNYjRkfbYzVqJ1aA/kXH6nQX8okT4FGB+2G6NuaeyMg6HBIN/LjU9X/6DrZt8LrUbmCuxB9P/pqzp9mAoHeYKOz+Et8ceRD/G3kQ2AX/OMg9jGl8Dvha2W1D74b0K66IM0B3z6V+OuSamAN0y0rhvMPrtY2EOewOP7uVKzE2X+r0A/AX4KVZ7XxALXwh8KrZ/EvBq2H4bGJm6tjwKUWP7UMfrMfBn4Pth++vA64n4czA/3W1AhxT1dQjG6hXslbBrLG4G8IfYfryQXw/cnWU6husPx9wRrYHdsMar/pirZ0g49gYSbyUpaoobqShtLsd6mlSEG3TX2DFXEVxAKWs7ILpuMJAvBl23UtMI2hyr6Q+M688i3cL3YYnwKP1+Rqwbayx+N6zmPzXK6yzyNuTleWG7BYm3oLTvhUgL9uC7P4TthbkJD8d6V12HPcy7hvj/YO7FKVndp6lfYGf6EPM5ArtgPvI9w/4KamozrWPHtcQaUVNx78RusAps1bBbsJ4cZ2HdMZcAvUucNwTrn59Kj4SEEXWJuB5B4wBgV8wfvpGa2kwPwitvVtqwB1Gz2PVXAR/FHkrzYvm8H9b9MBVt8TxNhFVg7pBrsYbQDiH898B1yfKZ9ScYs6gsdg9l6ypKdMUMx/Yqp96tlbcQ9lngd2F7D8xdGPWG6Rv0ppandWhuh73FLcJ64HQLNmUT5sq7Kxy3Lq37dAtNeRWgxvIBvkvM70eiRhjCpgMPRfGx8EwGN1H7QdQOczU9FgrO1BD+DazLV/+w/zQxF1AKmm4DLqgjblfM9bVb2O8UNP8Fa8x6B5iSh7YQ/zjw27C9C+Y2uRjrHjcP+HZKuuIuh7jrLZ6/8b7kw8PDp03yuAzKXCmjGj087wvl62Ks5nwusfaPnPJ0TDCuLTBXynTsTelczPWa5r1wHWFwVSxv4/nYMXH8J7F2o9fD5+LM8jWrCzXGD9aoMiMU4EuAfrG4ZuHTEhuKPyjKzIy0HY755ofGNcW2P4L5AF3Q+J1Q4KdgPSbeTVnfWGxQyb+I+SVj8Z1LhPXAfNYP56EtZmAPSaTlJ0MezwE+mZKmZlit8++JPG1BjSss6X56BvhedFxG5S5uqOJpFNXujwBWxvLzO9gb3K8xt2dab2115Wn0EOqC1fKjBtq+wKnYg2J+ymk2EWvzeSqRty3rshdYm8J3gD9lka+br5vlxRrjB2tR/xw24dd9mKukVR3HZjcE2vr7z8VcD9cSuguGuJI1PazHwuVYQ9txGen8MeZjngcMKBGffFuqiP+XnLU129p+Cnp2CQ+V9zD3TXy0dGSoIgN2OrAoq/IW03Ey1kU03oc9bvj/Dvwwcc7+WCPlLViPk5Yp6ttqnibLHPAxwptmyunWOeTp2nC/xgdq1vmwrsvWpKYz6wLVWD6xGyz6HhRustuAO5IGMytjX8IIDcEGWK0i1PaSmhI3ZEsSI1tT0HhkKNQdw37bcAOuxUYht0nz+juorW2Jc2oZ25R0HU7wd2PtBJuC4T+/Di3/jzCFwtYMRpk1tsK6Yd4d0uwLJY6JP6Sax7YrsNr/vnnmKbE2m4zS7FPYQzzqV78P5jJ8my0H++UyvUMtDXkLyPuDuUGiLo2tsdrKD0OBugoYFjs2k4FW4VrPAt+K7X8B833PBz4TL0SU8AWnrK0/1kV1CXBmCDskhP0D8zufloWWnUEb5qq5Pmj6OjZXzs2hrL2CNeodlEd6ldDaHBtvchrm5vo1iXlekuUs7XuiMeZpTNse1ExnEvW3Pybk60Ks+3Z8UsPmyfTLVG/eBSynTGobvr8ILCkR3yU8uX8JPID5xT8Si0+lgFP7VfRr2JTCLwCfwF4Zb8VqXyuwxs+BseNTrQVS8zZxJKF/NWH0ZyjczwDHh/CvhofTAuDgDPKz0WoL1/yf8H0I1l98U8w4dMTmXpmPvV3G8zT1gX2J9DsQ6Bu2e2K9R67DGhh/Te3ZMVOtrTbmPI1pOzhmS04OGl7DplCItJ2PPZCS92suRj/zC+b9wWZs/CNWi3kD+FwIL9V3tyvWMHotNsPdt9LKKGpeRTsAX4qFX4p1KVsIzIvp+m24IWcmdaeorWu45sBE/KRQqG8n5i/F5vP5AHtIpTJBWmPWFq6za7j2DOBjIexkrNvqnbGw97H5VtZiPUyycuPE0289YfKuUL5uDdsnYu1JH8Hm99miMbcoeVpXesXif4K1MdxCTX/7j2BthKux6RZymbrc+2Ia/C4h8VdgU+Z2KlVosdftYWF7MNaQ9TApjaylxi1zL2HQTSyuG1bT2oQtdtI8pvGx8F++l4auhLZbCd0Zw36r2HbXcAOuwh5SlSF8V6w75vlF0xauURmM5HXYQL5JWO+Wdth0CndgC2L8XyxPHwmGK/UpcxPpd33YjqYQaYmN9YjS61TswfRHYm6KIuVpKW1s2Q2zG9YBpBr4f7Hw4Vij98S087VO/XldOJc/W7uRaXUoGPOxlv8vYXNxnIHVxt7Buk21Dse3w4ZwV6agK6o17I/VXKJrtkhoPgR7nV1G7blqTsVqhx1T0BYV8ANCmsT7kk/D5r2PD0Qbir3SLiG4LaL/UiRtJbRegRn3X4Vy9/EQ/inMuO+aOP6TwF4pa4qXu1Wxcnc21q/9eODJ6FjM2J+JzQZ5PzZB3p5FydO6tMXCHbUnLRyKGfi3iDWAk2Ivpm3+h7wunMufrSngfwCmh+2vYEZ2A9YAdC32AMhkjpeEvvnAhLAdn/myeWL/S+Hme4Ia/3DaXQpfAi6J7e+B9Ts+IpauhxPmA8EGgr0V0rRjEbVRM23CcZjB3wPrBbORmvl8HibMO5SGkdqOcndO2G5JmP4YGxQ0IoRfTZgPH5vbfTTWO+VzRcrTOrTFa/eRtq8BR4Ttb4X79R9k1CW5Tu15XjzTP1rzFN47GPh4v/b9sdpXjxLnZdUrZwywKX5dalw3USHqibkBWoX96dir95kpa2sZbvjqmHH6JfYq3THst8NmI7yI2KArYiMQU9DlGrG2Y7G3yGgE78kh/BHCyEpshsR3si5riTI1NlHuom6hM6g9VcGHJPzimOui7A3LjTVP69IWjwvfu4T79DRq1/jHZZW/derPW0Cmf9a6VQ6i5nW6gpoZJ+8gzJhIDi3oQddzmLvm9ITm6Cb8JlZTHBSL343sZiUchvmbPwg64z2XRoeb8tgobTNOv0alDVvS8Tisl9f7WA30cGpPNbyEmvVO86rdn465mH5NGMGKVSyWEEaeh/jLs9bZ2PK0hLansbEU4xJxpwVtQ/PQtlXdeQvIKHMuBg6J7ZdqpP0E9mrbmQxrWiV0fAnr0/tPaq+huyf2Cv3l2AMgGuyR2WIYYfs4rNfQy9S4lCZgPta2WWgK6bCF/7iRaGtOTQ26CvN7L8DexsaG8LOJLWiSQzmL9HXE2oamYjNOTiE2DxM2XcHbpcpBitpqjXfB2hJyzdNSaRe2o/v1JWyQZOtg7MeRo6++Tu15C8gic0IGVGPd4OLLoSW7Yb5IGISVkbaqYKDaJcJbYK+q1dibR3usr/E0Um7I2w7tLYKR+BBrmPotYR6aDAxqZ2wg05+weUyS6VcR0i9TbVjPkV0SYXuE7z0JqxmFMjmcmhp0prX7UmmA9Rw6DmuIXRAzpO8DX09TZyhLe5RIuxbUuGKjeyLz8pbQ1Cx5zcS98Bbmav1Y1trqpT9vARlmVF+ssXYDcFEirgLr/z6HsMJQRpo+hvkD5xEGaiTiewWDvwkb9fjlHNItqglWUPNm0Syh8UpgUsa69sJGrf4O6ya4ReNh1tqwydE2UlM7PhlYnHWe1UPnpdSxlB4wkDBHDTZNwOwM9PTGuiNfj7WnRV0sB2FusLgfPPPyVscDstRMp72xStmXstDVoP+St4AMMut/sPk2ol4RozBf+ZsE/1+UcaGw96wrk1PQ1hrr6nkeNhDnGkqsyIO5m74N9MpKWwkNJxOG/wO7hwdAvLBHDclZTuFbGfL3ypCnV9eRfplpCwbqH9gyj5sIU29jjX25DamP6esS7oe7Qnmrc1UvrOYaGd9URtZSU6Hoh9WMn8fGKuyH9XX/dnRc1uUtpq0NVjmbSs0I2ihutxL3QupzMzX0E4lusjjnRmAF+12sUfa3zrlKzF/fP3yf6r2fH45vjvVayCxhnHMzsb69d4bvv2LdRt/ISkMJTS289xvC9rGYT/Ia7/0tzrkPgSO99w/lqK+Z936Tc64D5s8djk2duzdm/K+I0s8519x7vzFjfV/FDNdSbE6k57O8/tZwznXFpgX4HvZG8hjW4+TfIb4Z4DO+B77svb/WOXcEVgHqhhn5T3vvX48d57LUFa75c+xtYx02/cR47/2tIW4d1tj9cJaaGkzeT5ysPsApmEG4BasRXo4Zh19ghf4mas+6l9YUClFXy29ic/n0wnoh9MF89WOxUZl3AsNLnZtiGm1eXSt874rdfH+hZubGHwHPZKUpoS+qoMT7PR+B+XMPiaXfXGyk47ep7Q5I038/hsR0vUFP1HV2VpZptZW8jdLwk1jj7Hish84DZNzQSI1bZALwt0TcV7CKz43Ygu6dMk6vSNvp2HKdvbE3npsxgw82o+lf8srTBv2vvAVkkHG9sYFUrTE//S+whpW7qVnUZBDWALiOFH2DcYOFzZkyHFuR51exY5pjUzkchTVkHQZ8JcP0clit9CVsUNDPqJliohvWMDWkrv+Wcd52DIZhUiwsagD8FjYZ2e8p0T5SZh0fDUZ9FTXL6sVHSA/Eavu7YDXEflmnVdDRDKv0XIY9JL8Ywidg3TDvCOk1JgMt8Vle3yVM6U3t3nTtsR52L2KVtEyn3Q5l6S1q95b7aShbHbBlOveKjs0jT7f7P+UtIIVMiozqiGAQvhyMe7xWuCc2Gdo/sV4e0fqhR2H9aielpC0q4LMIC48TW48W2Ce2fRDWiDwfa2+YGwpgFm0Lp2GNaJXU9k3Ow1wlYLMY3pCFcYhd/3Rs2uhPxMI6U3uO9mg5wNahDPwQG6H5+RR1/Rl7MJ6K1UjjZS16W/pkMFrvYf79o7JKt4TWMaFMfQCMCmH3Ym9De2A9YW6ixFq1Zdaxb7jui8BsbJ3ca7C2rCXUtKX1xhrop4V74vvEVpVKSVtkQy4mDD6Lxb2GuYKnYg/PtsSmegjHNFrjn7uAlDKsQyg0/8CmH/hMCG+eOO4obJrVx4nVAklh+HOsEPXHaoNXYRO37Y75U3+C1agPCcctwGoSfbB+yJkshYbV8DtifvCewIXYnN5nYTXYZpgL4I9YI+maNI1pQtte4UabH4zSfphbrj/2tnR8yMsDY+dUYQ2pHVPSdAxhMFUwTksIK0JRM/KyC/bG9E2sgW8GGfR+2Yrm4zF3yeqg96+xuF2xN95OYX8EcFhKOn6ALRTSArgHm8eqPfb2sQfWUBotfH85NjNsNbEJ1VJMo/aYW3VILOwy7KHUD3tgPoG5Dk8DqsIxBxLenBrjJ3cBKWZYBeamWROMw+HUdDfrjPXuGE7NEO1XsRrHFmuxlklPZPAfwXpI3IjV3C8I1/0+NfOCnAv8OXbux6hj6oeUtHbGfJXR9K4XYQ+pT2PjAR6hZoj7b4FvZJivbUNePkPNg/N17GE5D6tp756hnjeIdZfF2hAeJbY+LdZudE3smFOw2mPmNUHs4fjjUO56YX7oTVgbSKkBiWvKnb/Unhn2zFCu4u1Cr2C9X+YA52C91F4O9+rBWIWjY4ppFE3ZcTs160YPxmbXbYe90UVjE34Q9qMBYauiuMb4yV1AShlWgb0yzgsF5MZQqBeGwvQg5pu7gRof3K7AuWkVoPB9ArA2bH8MW9xkVOLYLthMfHvGwn5AmD43wzTcXFMGPo/VqltiQ9z3jh13OfCjjLU1w2pSrwXD1ZpE17iMdBwHvBzPZ2zw1asxA/Bx7MEen9p3DjA5A31RuesTK+cnYC6UA8L+oeF+OCB2XtSt8Hzg+ZQ0HQ+8FStrUZffs7GumUMIa/pirteoveFHwM0Z5e8cwroAWIXr86Hcraf2PPydwve5wAtZlsHt/k95C0gpo1qGgvOjWNg47DX2i1gjWo9YXFaLTUwi5v7AFk+fHLajG+GnxObDx/oAv02Y/ydlfZGGTwMPxMLfxx6gPwPmJrQto0QjbkbpeSTmCsiz90s0RW5kJNthvt0jw/6thJkow/4+2FD8jhlqvAhzv10QjH186cwbMf998n+0xToxDE9J01XAiWH7GmAk9tb9b8yvvwlzl30deDqWtitJYd3cOjTuHQz+FMIiLFil8W/AJVgPpx6J9Ep9DYMd+k95C0gxs/pTM2ikBdZDYh7mP91iMiOyaQyNfLouaOqFzeU9KBZ+EbHFj7HX1+szTrvvAReE7enAfWH7L9SewGouiUatjPQ5rJdHG6x2eF7e5S1ehkKeTsQqHtdSu+fJQ7G0zWoN4iqs9nkX5gqL3BFfCgYtPhlf1H3zRuD2FDW1i+Xl9djb7q3ByI/AGtqbY29LQ2OabskhX6OHYLTk6W7Ym+1t1DR8p5peZfsveQvIOON6hpuxd95aYppuJ0yoFfYvwxqC+mB+/WfJsDYYNOyCNVp1x3y4A7AeOw9R00UzWgQilTaP7dD6WeD3eedjTE87zDf9nbB/J9aoNzg8BHLrtx3y8edY7friYFSPxcYydI0dNxRrlMwkb4PRH4N1YmiGdRI4Eqv13xiO2S/r8kZsdC9WOVtFTTtgz/BgqsDe2jJLrx35NKMghNGWSzH3xJfz1hPjJaygR1yFGft/YL1lJnjv38tSkPf+He/9+9jcQ7d771/FaqstgS8552Zj7qkfeu/fzVJbCf4L7Omca5+zjogPMJfOmrD/Ital8EbsAXo6bB7NmikhH8/BatQDsdr+fKxRdLFz7vxw6ExsgY9M8tYbt3jvV2LjZP7pvb8Xc5H0dM5dhPnuf5xleQu6NoXdm4HbvPevOucGY+0MB3rvqzFf/7RGcC9skyY/tUIS59z3gaXepljIfJh2CT2VQLX3fmM0BYBzri3WD/mVnLV1jD9snHMHYz08XsAeBA/lJi7gnOuEPcD/6L1fnK8awznXynv/QWz/AMx+PJmjrFo451phNdL/hP3PYH7pj2KLslTloMlhS0D+PBjWftj60/8G7vbe35C1ppi25L1wNFbp2Qt433vfPS9t20PhDL7YfhrDg3FnJBgw4mnXGNMyrsk5dyawwOc8N0w0V1LYbu29X5ennohknjrnxmFvJI/mKqyeyOCLehObsKzRGS2xY8QNbGOhMZe3xphe9UEGXwghCkJhGm2FEKLoyOALIURBkMEXQoiCIIMvhBAFQQZfCCEKggy+EEIUBBl8IYQoCP8fj58t27n4rXAAAAAASUVORK5CYII="/>
| 177.993197 | 18,087 | 0.919817 | yue_Hant | 0.501866 |
988f6a17643cc967ca3e56a291979fba3cd3b88f | 468 | md | Markdown | _posts/2019-07-26-knockoff-timer.md | metaldudu/metaldudu.github.io | 27fad9ff2429d0b99738f2b3d4a6fecb70f8c9c8 | [
"MIT"
] | 1 | 2015-03-30T06:57:57.000Z | 2015-03-30T06:57:57.000Z | _posts/2019-07-26-knockoff-timer.md | metaldudu/metaldudu.github.io | 27fad9ff2429d0b99738f2b3d4a6fecb70f8c9c8 | [
"MIT"
] | null | null | null | _posts/2019-07-26-knockoff-timer.md | metaldudu/metaldudu.github.io | 27fad9ff2429d0b99738f2b3d4a6fecb70f8c9c8 | [
"MIT"
] | null | null | null | ---
layout: post
title: "假冒的德国计时器"
category: life
tags: []
---
上个月我偶然看到推荐 Time Timer 这个计时器，颜值和功能都很不错，价格有点贵。我偶然看到另外一个牌子：plazotta seit 1893 ，京东和天猫都有店，做工看着也很扎实，价格只有前面那个的四分之一，于是下单买了。
拿到后，发现表盘里面有杂质，感觉可能是品控的问题，也没太在意。使用上正常，闹铃声音比较小，但金属材质感觉很扎实。几个用了三周，它一分为二，表盘部分掉下来摔扁了，底座还牢牢的磁吸在冰箱上。经过和售后沟通，说不能维修和退货。
搜索一下才知道，这是个假冒的洋品牌，[知乎有个帖子](https://www.zhihu.com/question/22370781)，里面洗地的回答都是托儿。google搜索这个品牌，除了商标信息，就是阿里巴巴的贩卖信息。后悔自己没查一下。
plazotta seit 1893，是个假牌子。希望中国人以后做自己的品牌，别装洋品牌，品质又跟不上。 | 33.428571 | 121 | 0.818376 | yue_Hant | 0.32727 |
988fbd0be9a728f51b3fa5c7c73ce53fc02a286f | 934 | md | Markdown | Module4_Labs/Lab2_Doubly_Linked_List/Cards/7.md | vvennela/curriculum | fa643c76644f2c9eed5c379b2a428719a10c8bac | [
"MIT"
] | null | null | null | Module4_Labs/Lab2_Doubly_Linked_List/Cards/7.md | vvennela/curriculum | fa643c76644f2c9eed5c379b2a428719a10c8bac | [
"MIT"
] | null | null | null | Module4_Labs/Lab2_Doubly_Linked_List/Cards/7.md | vvennela/curriculum | fa643c76644f2c9eed5c379b2a428719a10c8bac | [
"MIT"
] | null | null | null | <!--title={Reverse a Doubly Linked List}-->
<!--badges={Algorithms:25,Python:25}-->
<!--concepts={The Linked List}-->
<img src="https://res.cloudinary.com/practicaldev/image/fetch/s--7GhrxyPt--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://thepracticaldev.s3.amazonaws.com/i/7vzea57n698a12emv7ei.png" alt="Image result for reverse" style="zoom: 50%;" />
We should reverse the list because why not?
Let's try to define a function called **reverse()** that reverses the order of your current list, so the head becomes the tail and vice versa.
For example, if you have a list as below:
[head: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> tail: 7]
The new list after being reversed will be:
[head:7 -> 6 -> 5 -> 4 -> 3 -> 2 -> tail: 1]
You should traverse the new list and print out the element for verification.
However, if your current doubly linked list is empty, there are no elements to be reversed so you should return.
| 38.916667 | 250 | 0.711991 | eng_Latn | 0.968633 |
9890731612dbde11ca13e28f1ffc6a0856b3dde5 | 1,146 | md | Markdown | primers/xunit/setup_and_teardown.md | aliaspooryorik/testbox-docs | 7edb3924c77c713a4e3695579dc686cb5b885f46 | [
"Apache-2.0"
] | null | null | null | primers/xunit/setup_and_teardown.md | aliaspooryorik/testbox-docs | 7edb3924c77c713a4e3695579dc686cb5b885f46 | [
"Apache-2.0"
] | null | null | null | primers/xunit/setup_and_teardown.md | aliaspooryorik/testbox-docs | 7edb3924c77c713a4e3695579dc686cb5b885f46 | [
"Apache-2.0"
] | null | null | null | # Setup and Teardown
TestBox not only provides you with global life-cycle methods but also with localized test methods. This is a great way to keep your tests DRY (Do not repeat yourself)! TestBox provides the setup( currentMethod ) and teardown( currentMethod ) methods that each receives the name of the test method in question. which as their names indicate, they execute before a test and after a test in a test bundle.
```javascript
component displayName="TestBox xUnit suite" labels="railo,cf"{
function setup( currentMethod ){
application.wirebox = new coldbox.system.ioc.Injector();
structClear( request );
}
function teardown( currentMethod ){
structDelete( application, "wirebox" );
structClear( request );
}
function testThrows(){
$assert.throws(function(){
var hello = application.wirebox.getInstance( "myINvalidService" ).run();
});
}
function testNotThrows(){
$assert.notThrows(function(){
var hello = application.wirebox.getInstance( "MyValidService" ).run();;
});
}
}
```
| 34.727273 | 402 | 0.659686 | eng_Latn | 0.971502 |
9890b68342cc4e348e73db7ed7e4b6537bdf039d | 712 | md | Markdown | api/qsharp/microsoft.quantum.convert.md | MicrosoftDocs/quantum-docs-pr.ru-RU | f68e04c5483f58ca880c9ff4e41ebd2cc59c1564 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-05-19T20:13:57.000Z | 2020-05-19T20:13:57.000Z | api/qsharp/microsoft.quantum.convert.md | MicrosoftDocs/quantum-docs-pr.ru-RU | f68e04c5483f58ca880c9ff4e41ebd2cc59c1564 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-03-17T13:29:36.000Z | 2020-03-17T15:02:05.000Z | api/qsharp/microsoft.quantum.convert.md | MicrosoftDocs/quantum-docs-pr.ru-RU | f68e04c5483f58ca880c9ff4e41ebd2cc59c1564 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2021-11-15T09:15:56.000Z | 2021-11-15T09:15:56.000Z | ---
uid: Microsoft.Quantum.Convert
title: Пространство имен Microsoft. тактов. Convert
ms.date: 1/23/2021 12:00:00 AM
ms.topic: managed-reference
qsharp.kind: namespace
qsharp.name: Microsoft.Quantum.Convert
qsharp.summary: This namespace contains functions for converting between various Q# data types.
ms.openlocfilehash: d124329437a2c27b96cec954cfe96eda5e089603
ms.sourcegitcommit: 71605ea9cc630e84e7ef29027e1f0ea06299747e
ms.translationtype: MT
ms.contentlocale: ru-RU
ms.lasthandoff: 01/26/2021
ms.locfileid: "98850121"
---
# <a name="microsoftquantumconvert-namespace"></a>Пространство имен Microsoft. тактов. Convert
Это пространство имен содержит функции для преобразования различных типов данных Q #.
| 35.6 | 95 | 0.821629 | eng_Latn | 0.140699 |
9890e21c6d619f446e1dc8b0b319f8a375e86253 | 282 | md | Markdown | Docs/cmake/++log++.md | turesnake/tprLearningNotes | cc25dbd108e3aff47f1d63b55591e6a5ea6f061d | [
"MIT"
] | null | null | null | Docs/cmake/++log++.md | turesnake/tprLearningNotes | cc25dbd108e3aff47f1d63b55591e6a5ea6f061d | [
"MIT"
] | null | null | null | Docs/cmake/++log++.md | turesnake/tprLearningNotes | cc25dbd108e3aff47f1d63b55591e6a5ea6f061d | [
"MIT"
] | null | null | null |
# ================================================================//
# Cmake 学习 记录
# ================================================================//
#-- cmake 如何 指定 gcc 版本
就像 makefile 中那样
#-- cmake 如何指定 h文件 存放目录
使用 include_directories
| 14.842105 | 68 | 0.258865 | oci_Latn | 0.994604 |
98921ce79f12f0e45abc728d8d917972c4100684 | 21 | md | Markdown | includes/tlasharptla-mmc-md.md | OpportunityLiu/docs.zh-cn | eac29360831c86e94fd24e3d2948bde016c0463c | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-03-24T06:26:47.000Z | 2020-03-24T06:26:47.000Z | includes/tlasharptla-mmc-md.md | OpportunityLiu/docs.zh-cn | eac29360831c86e94fd24e3d2948bde016c0463c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | includes/tlasharptla-mmc-md.md | OpportunityLiu/docs.zh-cn | eac29360831c86e94fd24e3d2948bde016c0463c | [
"CC-BY-4.0",
"MIT"
] | 1 | 2019-03-11T08:16:26.000Z | 2019-03-11T08:16:26.000Z | Microsoft 管理控制台 (MMC) | 21 | 21 | 0.809524 | yue_Hant | 0.595206 |
9892b43c86aae95b377245e6110d8537fd9c8ec7 | 634 | md | Markdown | docs/user-guides/c-types-of-layers/a-point.md | sw1227/kepler.gl | 14c35fc048a745faab0c6770cab7a4625ccedda3 | [
"MIT"
] | 4,297 | 2019-05-04T01:29:14.000Z | 2022-03-31T19:28:10.000Z | docs/user-guides/c-types-of-layers/a-point.md | sw1227/kepler.gl | 14c35fc048a745faab0c6770cab7a4625ccedda3 | [
"MIT"
] | 968 | 2019-05-05T16:13:03.000Z | 2022-03-30T13:11:31.000Z | docs/user-guides/c-types-of-layers/a-point.md | sw1227/kepler.gl | 14c35fc048a745faab0c6770cab7a4625ccedda3 | [
"MIT"
] | 1,082 | 2019-05-04T15:55:24.000Z | 2022-03-30T16:27:53.000Z | # Point
Point layers draw points for a given event or object.
__Layer Attributes__
- Basic
- Columns:
- Latitude
- Longitude
- Altitude (optional)
- Fill
- Enable fill - enabled by default
- Single color / color based on
- Color scale
- Opacity
- Outline
- Enable outline
- Single color / color based on
- Color scale
- Stroke width
- Radius
- Single radius / radius based on
- Fixed radius to meter
- Text,
- Font Size
- Font Color
- Text Anchor
[Back to table of contents](../README.md)
| 19.8125 | 103 | 0.690852 | eng_Latn | 0.832948 |
9892c59e4d217fb9d446ca2dd4095ba86f61b32a | 898 | md | Markdown | wxWidgets/docs/ios/install.md | VonaInc/lokl | 83fbaa9c73d3112490edd042da812ceeb3cc9e53 | [
"MIT"
] | 15 | 2019-05-19T23:10:41.000Z | 2021-08-06T14:02:09.000Z | wxWidgets/docs/ios/install.md | VonaInc/lokl | 83fbaa9c73d3112490edd042da812ceeb3cc9e53 | [
"MIT"
] | 3 | 2019-12-05T08:08:50.000Z | 2020-05-14T20:31:39.000Z | wxWidgets/docs/ios/install.md | VonaInc/lokl | 83fbaa9c73d3112490edd042da812ceeb3cc9e53 | [
"MIT"
] | 4 | 2020-02-27T00:57:21.000Z | 2021-08-06T14:02:11.000Z | Building wxWidgets for iOS {#plat_ios_install}
----------------------------
wxiOS is far from a full supported port, but can be used
as base for simple applications and future improvements.
It requires Xcode with iOS SDK 9.0 or later. Xcode is available
for free in the OS X app store.
To build wxiOS you should use Xcode to open the minimal samples
Xcode project file located at:
samples/minimal/minimal_iphone.xcodeproj
That project files includes wxiphone.xcodeproj so you just need
to hit run in order to see the minimal sample running in the
simulator.
The library can also be build via configure/make:
mkdir build_ios
cd build_ios
../configure --with-osx_iphone --enable-monolithic \
--with-macosx-version-min=8.0 --disable-shared \
--enable-macosx_arch=i386 \
--with-macosx-sdk=$(xcrun --sdk iphonesimulator --show-sdk-path)
make
| 32.071429 | 72 | 0.712695 | eng_Latn | 0.991006 |
989346048bb929411fc9c580609e61237c67d7ee | 906 | md | Markdown | windows/application-management/app-v/appv-delete-a-package-with-the-management-console.md | radiasl/windows-itpro-docs | d926b9c36ac184b9b92bef1f3cdf8e48d20a6103 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2021-06-24T02:14:37.000Z | 2021-06-24T02:14:37.000Z | windows/application-management/app-v/appv-delete-a-package-with-the-management-console.md | radiasl/windows-itpro-docs | d926b9c36ac184b9b92bef1f3cdf8e48d20a6103 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-07-13T21:27:45.000Z | 2020-07-13T21:27:45.000Z | windows/application-management/app-v/appv-delete-a-package-with-the-management-console.md | radiasl/windows-itpro-docs | d926b9c36ac184b9b92bef1f3cdf8e48d20a6103 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2021-06-24T02:15:03.000Z | 2021-06-24T02:15:03.000Z | ---
title: How to delete a package in the Management Console (Windows 10)
description: Learn how to delete a package in the App-V Management Console and where to find information about operations for App-V.
author: greg-lindsay
ms.pagetype: mdop, appcompat, virtualization
ms.mktglfcycl: deploy
ms.sitesec: library
ms.prod: w10
ms.date: 09/27/2018
ms.reviewer:
manager: dansimp
ms.author: greglin
ms.topic: article
---
# How to delete a package in the Management Console
>Applies to: Windows 10, version 1607
Use the following procedure to delete an App-V package.
## Delete a package in the Management Console
1. To view the package you want to delete, open the App-V Management Console and select **Packages**. Select the package to be removed.
2. Select or right-click the package, then select **Delete** to remove the package.
## Related topics
- [Operations for App-V](appv-operations.md)
| 26.647059 | 135 | 0.762693 | eng_Latn | 0.963612 |
989356e044d1b166c1f76a3697748a106ec756c4 | 203 | md | Markdown | _slides/08-canuckamok.md | githubschool/co-lab | 1c7a51db95fc76ea66dfbbeffbed981fa837b590 | [
"MIT"
] | 3 | 2020-11-23T01:12:38.000Z | 2020-11-26T01:05:37.000Z | _slides/08-canuckamok.md | githubschool/co-lab | 1c7a51db95fc76ea66dfbbeffbed981fa837b590 | [
"MIT"
] | 11 | 2020-11-21T15:25:11.000Z | 2020-11-21T17:41:41.000Z | _slides/08-canuckamok.md | githubschool/co-lab | 1c7a51db95fc76ea66dfbbeffbed981fa837b590 | [
"MIT"
] | 1 | 2020-11-21T16:12:47.000Z | 2020-11-21T16:12:47.000Z | ---
layout: slide
title: "Welcome to our slide deck!"
---
Did you drop your ice cream? This is mine. It's gonna be SO tasty.
{: .center}
| 20.3 | 66 | 0.699507 | eng_Latn | 0.877207 |
9893ab18935987f58509890f11411b7e1ad4ccdf | 2,961 | md | Markdown | doc_center/docs/topic/design-pattern/message-channel.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/topic/design-pattern/message-channel.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/topic/design-pattern/message-channel.md | colinzuo/dddtdd-docs | e15550468f84a5078519091eec9a37ce4be6e606 | [
"Apache-2.0"
] | null | null | null | ---
sidebar_position: 1
---
```java
private ScheduledExecutorService scheduledExecutorService;
private ChannelState channelState;
private ConnectOptions connectOptions;
private ExponentialBackOff backOff;
private BackOffExecution backOffExecution;
private ListenableScheduledFuture reconnectFuture;
private ListenableScheduledFuture connectEndFuture;
private ListenableScheduledFuture keepaliveFuture;
```
## connect
connectOptions指定connectionTimeout和automaticReconnect
- 检查状态为DISCONNECTED
- 根据connectionTimeout启动连接超时timer
- 准备重连相关的backoff
- 更新状态到CONNECTING
- doConnect具体连接
```java
synchronized （channelLock) {
if (channelState != ChannelState.DISCONNECTED) {
throw new IllegalStateException("Channel state is not disconnected");
}
backOff = new ExponentialBackOff(
properties.getExpBackOffInitialInterval(),
properties.getExpBackOffMultiplier()
);
if (connectOptions.getConnectionTimeout() > 0) {
backOff.setMaxElapsedTime(connectOptions.getConnectionTimeout());
connectEndFuture = scheduledExecutorService.schedule(
this::onConnectEndTimeout,
connectOptions.getConnectionTimeout(), TimeUnit.MILLISECONDS);
}
setChannelState(ChannelState.CONNECTING);
}
scheduledExecutorService.execute(this::doConnect);
```
## disconnect
- 如果状态为DISCONNECTED或DISCONNECTING则直接返回
- 更新状态为DISCONNECTING
- 停止超时和重连计时器
- 调用doDisconnect断开连接
```java
synchronized (channelLock) {
if (channelState == ChannelState.DISCONNECTED ||
channelState == ChannelState.DISCONNECTING) {
return;
}
setChannelState(ChannelState.DISCONNECTING);
if (connectEndFuture != null) {
connectEndFuture.cancel(false);
connectEndFuture = null;
}
if (reconnectFuture != null) {
reconnectFuture.cancel(true);
reconnectFuture = null;
}
}
scheduledExecutorService.execute(this::doDisconnect);
```
## onConnectEndTimeout
- 如果状态不为CONNECTING则直接返回
- 停止重连timer
- 更新状态为DISCONNECTED
- 发送ConnectStateEvent到EventBus
```java
synchronized (channelLock) {
if (channelState == ChannelState.CONNECTING) {
if (reconnectFuture != null) {
reconnectFuture.cancel(true);
reconnectFuture = null;
}
setChannelState(ChannelState.DISCONNECTED);
sendConnectStateEventForTimeout();
}
}
```
## onReconnectTimeout
- 检查状态，不为CONNECTING则直接返回
- 调用doConnect连接
```java
synchronized (switchLock) {
if (channelState == ChannelState.CONNECTING) {
doConnect();
}
}
```
## scheduleReconnectIfNeeded
- 获取重连等待时间
- 启动重连timer
```java
long waitInterval = backOffExecution.nextBackOff();
if (waitInterval != BackOffExecution.STOP) {
reconnectFuture = scheduledExecutorService.schedule(
this::onReconnectTimeout, waitInterval, TimeUnit.MILLISECONDS);
}
```
| 23.132813 | 79 | 0.704492 | yue_Hant | 0.587803 |
9894240afa713b3e6ba161cf10246e35a8a26859 | 3,317 | md | Markdown | docs/relational-databases/system-tables/change-data-capture-tables-transact-sql.md | antoniosql/sql-docs.es-es | 0340bd0278b0cf5de794836cd29d53b46452d189 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/relational-databases/system-tables/change-data-capture-tables-transact-sql.md | antoniosql/sql-docs.es-es | 0340bd0278b0cf5de794836cd29d53b46452d189 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/relational-databases/system-tables/change-data-capture-tables-transact-sql.md | antoniosql/sql-docs.es-es | 0340bd0278b0cf5de794836cd29d53b46452d189 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Cambiar las tablas de captura de datos (Transact-SQL) | Microsoft Docs
ms.custom: ''
ms.date: 03/06/2017
ms.prod: sql
ms.prod_service: database-engine
ms.reviewer: ''
ms.technology: system-objects
ms.topic: language-reference
dev_langs:
- TSQL
ms.assetid: a4372d0b-50ca-4e58-80f6-2ed3cb52a84a
author: stevestein
ms.author: sstein
manager: craigg
ms.openlocfilehash: d977843f6fdbe59f382b6dbb39da017453265c5e
ms.sourcegitcommit: 61381ef939415fe019285def9450d7583df1fed0
ms.translationtype: MT
ms.contentlocale: es-ES
ms.lasthandoff: 10/01/2018
ms.locfileid: "47692703"
---
# <a name="change-data-capture-tables-transact-sql"></a>Tablas de captura de datos de cambio (Transact-SQL)
[!INCLUDE[tsql-appliesto-ss2008-xxxx-xxxx-xxx-md](../../includes/tsql-appliesto-ss2008-xxxx-xxxx-xxx-md.md)]
La captura de datos de cambio permite realizar un seguimiento de las tablas de tal manera que los cambios en el lenguaje de manipulación de datos (DML) y en el lenguaje de definición de datos (DDL) realizados en las tablas se puedan cargar incrementalmente en un almacenamiento de datos. Los temas de esta sección describen las tablas del sistema que almacenan las información que usan las operaciones de captura de datos modificados.
## <a name="in-this-section"></a>En esta sección
[cdc.<capture_instance>_CT](../../relational-databases/system-tables/cdc-capture-instance-ct-transact-sql.md)
Devuelve una fila para cada cambio realizado en una columna capturada en la tabla de origen asociada.
[cdc.captured_columns](../../relational-databases/system-tables/cdc-captured-columns-transact-sql.md)
Devuelve una fila para cada columna de la que se ha realizado un seguimiento en una instancia de captura.
[cdc.change_tables](../../relational-databases/system-tables/cdc-change-tables-transact-sql.md)
Devuelve una fila por cada tabla de cambios en la base de datos.
[cdc.ddl_history](../../relational-databases/system-tables/cdc-ddl-history-transact-sql.md)
Devuelve una fila para cada cambio del lenguaje de definición de datos (DDL) realizado en las tablas que se habilitan para la captura de datos de cambio.
[cdc.lsn_time_mapping](../../relational-databases/system-tables/cdc-lsn-time-mapping-transact-sql.md)
Devuelve una fila para cada transacción que tiene filas en una tabla de cambios. Esta tabla se utiliza para las asignaciones entre los valores de confirmación de número de secuencia de registro (LSN) y la hora de confirmación de la transacción.
[cdc.index_columns](../../relational-databases/system-tables/cdc-index-columns-transact-sql.md)
Devuelve una fila para cada columna de índice asociada a una tabla de cambios.
[dbo.cdc_jobs (Transact-SQL)](../../relational-databases/system-tables/dbo-cdc-jobs-transact-sql.md)
Devuelve los parámetros de configuración para los trabajos de agente de captura de datos del cambio.
## <a name="see-also"></a>Vea también
[Procedimientos almacenados de captura de datos modificados (Transact-SQL)](../../relational-databases/system-stored-procedures/change-data-capture-stored-procedures-transact-sql.md)
[Cambiar las funciones de captura de datos (Transact-SQL)](../../relational-databases/system-functions/change-data-capture-functions-transact-sql.md)
| 60.309091 | 438 | 0.771782 | spa_Latn | 0.902051 |
9896143f92d9411642ba320c4185d462499ac5ff | 4,327 | md | Markdown | readme_en-US.md | Goliass/Anotacoes | 28feac6866c8d9672d9ab24238bca9a581bf3fa8 | [
"MIT"
] | null | null | null | readme_en-US.md | Goliass/Anotacoes | 28feac6866c8d9672d9ab24238bca9a581bf3fa8 | [
"MIT"
] | null | null | null | readme_en-US.md | Goliass/Anotacoes | 28feac6866c8d9672d9ab24238bca9a581bf3fa8 | [
"MIT"
] | null | null | null | # Notes
Personal project of a web application (front-end) for offline notes (ideas, reminders, shopping list?).
Project also with the purpose of putting into practice / remember technologies, frameworks, concepts, etc. from the software development area I have been studying: JavaScript/ECMAScript, PWAs (Progressive Web Apps), [Node.js](https://nodejs.org) / [Express](https://expressjs.com/), [Bootstrap](https://getbootstrap.com).
In a not too far future I hope to improve it, apply fixes and include new features.
## Tests (manual)
* "Device simulation" on desktop (through browser developer tools)
* Operating system: Ubuntu (Linux)
* Widths between 320px (most tests) and 1366px
* Browsers:
* Chromium 79.0.3945.79
* Firefox 71.0
* Devices itself
* Tablet
* Operating system: Android
* Browsers:
* Chrome 79.0.3945.93
* Firefox 68.3.0
* Obs.: the "Exportar anotações (backup)" option/icon didn't work with the app installed / added to home screen
* Mobile phone
* Operating system: Android
* Browsers:
* Chrome 79.0.3945.93
* Firefox 68.3.0
* Obs.: the "Exportar anotações (backup)" option/icon didn't work with the app installed / added to home screen
## How to run (one of the ways) this project (Ubuntu / Linux operating system)
* Project download
* "Clone or download" and "[Download ZIP](https://github.com/Goliass/Anotacoes/archive/master.zip)" options.
* Server execution (terminal) (after project / ZIP file extraction)
* [if not installed] Install the package manager [NPM](https://docs.npmjs.com/downloading-and-installing-node-js-and-npm):
```bash
$ sudo npm install npm -g
```
* Access the 'server' directory:
```bash
$ cd server
```
* Install the dependencies (packages) used by the server:
```bash
$ sudo npm install
```
* Run the server:
```bash
$ npm start
```
or
```bash
$ npm run dev
```
If the server runs correctly, one of the messages displayed on the terminal should look similar to *'Server running on port [port]...'*.
* App access
* from the same device of the project (where server is running):
* in the browser, consider the url *http://localhost:[port]*, eg.: http://localhost:3000.
*port* = port number displayed in message *'Server running on port [port]...'* (see above).
**Obs.**: consider the browsers of the tests, in the same or later versions.
* from a different device than the project (tablet, mobile phone):
* on the device of the project (where server is running):
* download / install [ngrok](https://ngrok.com/download).
* in a new terminal and from the directory where ngrok is installed, run:
```bash
$ ngrok http [port]
```
*port* = port number displayed in message *'Server running on port [port]...'* (see above).
* now on the device itself (tablet, mobile phone):
* in the browser, consider the url displayed by ngrok running on terminal, eg.: *https://demo.ngrok.io/*.
**Obs.**: consider the browsers of the tests, in the same or later versions.
## Thanks / study sources (among others)
* [Alura](https://www.alura.com.br/)
* [MDN Web Docs (Mozilla)](https://developer.mozilla.org)
* [W3Schools](https://www.w3schools.com)
* [Google Lighthouse tool](https://developers.google.com/web/tools/lighthouse/)
* [Node.js](https://nodejs.org)
* [BrazilJS](https://braziljs.org/)
* [Wes Bos / JavaScript 30](https://javascript30.com/)
* [Bootstrap](https://getbootstrap.com/)
* [ngrok](https://ngrok.com/)
## Author(s)
[Elías Sauthier](https://github.com/Goliass)
## License
[MIT License](LICENSE.txt)
This license does not apply to the icons and images of this project:
- [Iconify](https://iconify.design)
- [Elusive Icons](http://elusiveicons.com/license/)
- [WebHosting Hub Glyphs](https://www.webhostinghub.com/glyphs/)
- [Font Awesome Free Icons](https://fontawesome.com/license/free)
- [Pixabay](https://pixabay.com/)
- [Pettycon](https://pixabay.com/users/pettycon-3307648/)
---
| 38.633929 | 321 | 0.642246 | eng_Latn | 0.856287 |
989631f5d265c89ed994d674f2d2f181ab741ee0 | 3,339 | md | Markdown | docs/How to contribute.md | fnazarios/natds-ios | be6b4d6fcd5f55708de371cb38e683eff59b4291 | [
"0BSD"
] | 28 | 2020-02-18T16:12:37.000Z | 2022-02-28T14:59:56.000Z | docs/How to contribute.md | fnazarios/natds-ios | be6b4d6fcd5f55708de371cb38e683eff59b4291 | [
"0BSD"
] | 113 | 2020-03-06T14:08:39.000Z | 2021-12-21T13:38:16.000Z | docs/How to contribute.md | fnazarios/natds-ios | be6b4d6fcd5f55708de371cb38e683eff59b4291 | [
"0BSD"
] | 4 | 2019-11-26T13:31:15.000Z | 2021-06-16T19:09:52.000Z | # How to contribute
Are you feeling that you can help us with anything in the project? Just get closer!!
## Create a PR to contribute to the project
We will review your PR checking some criteria and, if everything is fine, a new version for the library will be published with your contribution. Setup the project and start coding:
## Project setup ##
Follow the steps below before opening the project.
Installing dependencies:
1. Install project dependencies:
```
make setup
```
2. ## Natura employees only:
Note: before running this command, please contact System Team to request the required credentials
```
make install_certificates
```
3. Done! Open project on Xcode using _.xcworkspace_
---
## Sample App
We have provided a sample project in the repository. To use it, download the repository, run `pod install` to download the required libraries and open `NatDS.xcworkspace`. You'll see two schemes: `NatDS` and `NatDS-SampleApp` - select `NatDS-SampleApp` and then build & run! Source files for this application are in the NatDS-SampleApp/Sources directory i the project navigator.
---
## Dependencies
- Xcode 12+
- Homebrew
- Ruby 2.6.5
- Bundler
- [Git-LFS](https://git-lfs.github.com/)
---
## Contributing ##
### Commits structure
After developing your contribution, we recommend the usage of [Conversional Commits] (https://www.conventionalcommits.org/en/v1.0.0/) to commit your work.
The most common types the we use are:
- If you're adding a new feature, your commit should look like: `feat: [Short Description] [long description if you need]`
- If you're fixing a bug, your commit should look like: `bug: [Short Description] [long description if you need]`
- If you're adding tests, your commit should look like: `test: [Short Description] [long description if you need]`
There are many other types that you can use to tag your commits: `build:`, `chore:`, `ci:`, `docs:`, `style:`, `refactor:`, `perf:`;
[here you can find more info about it](https://www.conventionalcommits.org/en/v1.0.0/).
#### Tool to help:
You can add an CLI to help you writing your commits. [Commitizen](https://github.com/commitizen/cz-cli) is the tool we use :)
To install the CLI, run:
```bash
npm install -g commitizen
```
To commit your work with Commitizen, run:
```bash
git add .
git cz
```
Commitizen will guide you about how to structure you commit.
After documenting your code, you'll also have to update the documentation files. To do that, run:
```bash
make create_docs
```
### Review criteria
Fine, now you should be asking yourself which criteria will be checked before merging the PR. Here are some of them:
- Your code is covered by tests
- Your code is well structured, respecting SOLID principles
- Your code passed our automatic verifications (you can check the pipeline flow link in your PR)
- You've added a sample of the increment to the Sample App (remember to update the tests related to it)
- You have made the corresponding changes to the documentation
- Your changes don't generate new warnings
- The component works fine with dark mode enabled
- Your code uses Design System design tokens
Is there something that you think could be different in the lib and you want to let us know?
Feel free to open an issue and explain your point. We'll be happy to get in touch! :)
| 34.42268 | 378 | 0.743336 | eng_Latn | 0.997095 |
9896386e394ca485772b3e7aaf65aa0f0f8fd50d | 48 | md | Markdown | tftc-podcast/_index.md | stickies-v/bitcointranscripts | f1ababde20a00058c3dc78ca6954c83b4413ebee | [
"MIT"
] | 51 | 2021-03-31T14:10:50.000Z | 2022-03-25T10:05:55.000Z | tftc-podcast/_index.md | stickies-v/bitcointranscripts | f1ababde20a00058c3dc78ca6954c83b4413ebee | [
"MIT"
] | 57 | 2021-03-30T21:25:16.000Z | 2022-03-31T13:54:53.000Z | tftc-podcast/_index.md | stickies-v/bitcointranscripts | f1ababde20a00058c3dc78ca6954c83b4413ebee | [
"MIT"
] | 27 | 2021-03-19T11:02:03.000Z | 2022-03-21T01:29:38.000Z | ---
title: TFTC Podcast
---
{{< childpages >}}
| 8 | 19 | 0.541667 | eng_Latn | 0.783884 |
9896c0f44923e08cc1599246eb0b4e3d1a407d04 | 18,149 | md | Markdown | _posts/2017-10-28-User_Visiable_PG_STATUS_In_CEPH.md | whoiami/whoiami.github.io | 784b3ca3eb5889263c673cda9770deec479442f0 | [
"MIT"
] | null | null | null | _posts/2017-10-28-User_Visiable_PG_STATUS_In_CEPH.md | whoiami/whoiami.github.io | 784b3ca3eb5889263c673cda9770deec479442f0 | [
"MIT"
] | null | null | null | _posts/2017-10-28-User_Visiable_PG_STATUS_In_CEPH.md | whoiami/whoiami.github.io | 784b3ca3eb5889263c673cda9770deec479442f0 | [
"MIT"
] | 1 | 2020-10-22T01:07:27.000Z | 2020-10-22T01:07:27.000Z | ---
layout: post
title: A glimpse of Ceph PG State Machine
---
---
### Introduction:
Ceph is a highly reliable, highly scalable, distributed open-source storage system. The pic below is an architecture of ceph.
RADOS (Reliable, Autonomous, Distributed Object Storage) is the base of the system. RADOS allows nodes in the cluster to act semi-autonomously to self-manage replication, failure detection, and failure recovery. More details on [RADOS: A Scalable, Reliable Storage Service for Petabyte-scaleStorage Clusters](https://ceph.com/wp-content/uploads/2016/08/weil-rados-pdsw07.pdf).
Above RADOS layer, LIBRADOS, as it shows in Pic, is a library which supports direct access to RADOS in multiple languages. RADOSGW, RBD and CEPHFS are higher level layers to covert RADOS object storage into bucket-based, block-based and filesytem service.
---
#### Why PG state?
PG is the minimum unit to perform reliable storage. For the most to debug work, PG state is the first parameter we may focus on. The description of PG state can be found in [Ceph Website](http://docs.ceph.com/docs/mast er/rados/operations/monitoring-osd-pg/#monitoring-osds).
This article will explain the following two questions.
What is the PG state mean in the source code level and under what condition it will bring PG to some specific state(like CREATING, PEERING).
---
#### What PG state machine looks like?
Generally, it is just like the pic below. In ceph, state machine is called "recovery state machine".
###### 
Every PG maintains a state machine. It defines like:
```c++
class RecoveryMachine : state_machine< RecoveryMachine, Initial >
```
Every state machine contains two important elements, states and events. States describe the current PG status. Events lead the state changing. Once one state received a specific event, it will handle this event and it may change to another state.
+ state
The code fragment below defines state `Initial`.
`Initial` handles two events, Initialize and Load.
"transition" means it will transfer to Reset state once Initialize event happened.
"custom_reaction" is some kind of customized reaction. This reaction will be done after Load event happened.
```c++
struct Initial : state< Initial, RecoveryMachine >, NamedState {
explicit Initial(my_context ctx);
void exit();
typedef boost::mpl::list <
boost::statechart::transition< Initialize, Reset >,
boost::statechart::custom_reaction< Load >,
> reactions;
};
```
+ sub-state
Another concept is sub-state.
State `Started` is defined to be a state in RecoveryMachine.
The code fragment defines sub-state `Primary`. It is part of `Started` state and it starts from its substate `peering`.
```c++
struct Started : state< Started, RecoveryMachine, Start >, NamedState{};
```
```c++
struct Primary : state< Primary, Started, Peering >, NamedState {};
```
+ event
```c++
struct Initialize : boost::statechart::event< Initialize > {
Initialize() : boost::statechart::event< Initialize >() {}
};
```
---
#### Create PG(Pool)
I will take the PG initialization as an example to go though Recovery Machine. That will give us a whole picture of what is the meaning of each state.
1. First time Create PG
client request—->monitor—->OSD
The process starts from a client request to monitor. Monitor will send a pg create message to OSD. The entry to handle this message is `OSD::handle_pg_create`
For each PG, its initailized state is `Initial` and it will handle two event "Initialize" and "ActMap". That will lead the PG to be "started" state. If PG is primary, then state transform to Peering to Active and even to clean. That is we called active+clean.
```c++
OSD::handle_pg_create
{
for (number of pg monitor request) {
create PG//The state is initial
//received Initialize event, transform to reset
PG::recovery_state.handle_event(Initialize);
//reveived ActMap event, transform to Started
PG::recovery_state.handle_event(ActMap);
}
}
```
Initial—(Initialize)—>Reset—(ActMap)—>Started—(isPrimary)—>Primary—>Peering
—>Active
2. osd restart
Another way to initialize a PG state is restart. Its entry is `OSD::init()`. It will:
1. Load PGs
2. Make PG state handle Load event
3. PG will transform from `Initial` to `Reset` to Started to Primary to Peering to Active.
```c++
OSD::init()
{
load_pgs
recovery_state.handle_event(Load);
}
PG::RecoveryState::Initial::react(const Load& l){
……
return transit< Reset >();
}
```
Initial—(Load)—>Reset—(ActMap)—>Started—(isPrimary)—>Primary——>Peering
—>Active
---
#### User visiable state and recovery state
All the states mentioned above are all revocery states. They helps PG to vecovery from different situation. Another state is User Visiable state. It could be considered to be a simplified human readable recovery state machine. States in commands like "ceph pg dump_stuck inactive|unclean|stale" are all User Visiable states.
Start from "ceph pg xxxx query" command", I will focus on the relation between "User Visiable State" and "Recovery State". As the output below shows, the first line is "User Visiable State". User Visiable State includes states like active, clean, degraded, peering and so on. Corresponding macro is listed below. More details can be found in [ceph/osd_types.cc](https://github.com/whoiami/ceph/blob/master/src/osd/osd_types.cc).
##### ceph pg {poolnum}.{pg-id} query
```
{
"state": "active+clean",
"up": [
1,
0
],
"acting": [
1,
0
],
.....
.....
"recovery_state": [
{
"name": "Started\/Primary\/Active",
"enter_time": "2013-01-23 09:35:37.594691",
"might_have_unfound": [
],
},
]
}
```
---
#### PG status (from [osd_types.h](https://github.com/whoiami/ceph/blob/master/src/osd/osd_types.h))
`#define PG_STATE_CREATING (1<<0) // creating`
`#define PG_STATE_PEERING (1<<12) // pg is (re)peering`
`#define PG_STATE_ACTIVE (1<<1) // i am active. (primary: replicas too)`
`#define PG_STATE_CLEAN (1<<2) // peers are complete, clean of stray replicas.`
`#define PG_STATE_DEGRADED (1<<10) // pg contains objects with reduced redundancy`
`#define PG_STATE_RECOVERING (1<<14) // pg is recovering/migrating objects`
`#define PG_STATE_BACKFILLING (1<<20) // [active] backfilling pg content`
`#define PG_STATE_REMAPPED (1<<18) // pg is explicitly remapped to different OSDs than CRUSH`
However, under what condition it will change from one user visiable state to another? And what is the real recovery state in source code?
I will brifely go though these user visiable states.
##### 1.PG_STATE_CREATING
This bit will be set when you creating number of PGs in a Pool.
It happens in "Primary" recovery state.
The condition "pg->info.history.last_epoch_started == 0" means it is the first time creating this PG.
+ set(PG_STATE_CREATING)
```c++
PG::RecoveryState::Primary::Primary(my_context ctx) {
// set CREATING bit until we have peered for the first time.
// When you create a pool, it will create the number of placement groups
// you specified.
if (pg->info.history.last_epoch_started == 0) {
pg->state_set(PG_STATE_CREATING);
}
}
```
When you are out of Primary state, PG will clear PG_STATE_CREATING bit.
+ state_clear(PG_STATE_CREATING)
```c++
void PG::RecoveryState::Primary::exit(){
g->state_clear(PG_STATE_CREATING);
}
```
```c++
PG::RecoveryState::Active::react(const AllReplicasActivated &evt) {
pg->state_clear(PG_STATE_ACTIVATING);
pg->state_clear(PG_STATE_CREATING);
//min_size; ///< number of osds in each pg
if (pg->acting.size() >= pg->pool.info.min_size) {
pg->state_set(PG_STATE_ACTIVE);
} else {
//Peer finished not enough osd cant move to active. wait for osd up.
pg->state_set(PG_STATE_PEERED);
}
}
```
##### 2. PG_STATE_PEERING
Peering process is to bring all its peers into a aggrement about the state of objects in the PG. More specific, it will generate an authoratative log and calculate objects to revocery or backfill.
According to [RADOS: A Scalable, Reliable Storage Service for Petabyte-scaleStorage Clusters](https://ceph.com/wp-content/uploads/2016/08/weil-rados-pdsw07.pdf／ “Title”), "Any locally stored PGs whose active list of OSDs changes are marked must re-peer." The possible conditions like
1. osds down or osds join
2. Initialize PG
3. modified your CRUSH map, PG is migrating
- state_set(PG_STATE_PEERING)
```c++
PG::RecoveryState::Peering::Peering(my_context ctx) {
assert(!pg->is_peered());
assert(!pg->is_peering());
assert(pg->is_primary());
pg->state_set(PG_STATE_PEERING);
}
```
- state_clear(PG_STATE_PEERING)
1.Peering exit
```c++
void PG::RecoveryState::Peering::exit() {
pg->state_clear(PG_STATE_PEERING);
}
```
2.GetLog incomplete
It is impossible to generate authoratative log. For example, all peers are down. It will geos into incomplete state and clear bit PG_STATE_PEERING.
```c++
PG::RecoveryState::GetLog::GetLog(my_context ctx){
//calculate the desired acting
//calculated acting set size is less than min size(min_size)
//to recovery
//"choose_acting failed, below min size"
//"choose_acting failed, not recoverable"
post_event(IsIncomplete());
}
```
```c++
//Started/Primary/Peering/Incomplete
PG::RecoveryState::Incomplete::Incomplete(my_context ctx) {
pg->state_clear(PG_STATE_PEERING);
pg->state_set(PG_STATE_INCOMPLETE);
}
```
##### 3. PG_STATE_ACTIVE
Once Ceph completes peering process, PG becomes "active". That basically means this PG is able to serve write and read operations.
- state_set(PG_STATE_ACTIVE)
To set state PG_STATE_ACTIVE, it follow the logic below:
1. In `Active` recovery state, PG registers to a thread. Once receiving any replica reply info, it calls "_activate_committed".
2. If primary PG got all replicas, it posts a AllReplicasActivated() event.
3. Followed by AllReplicasActivated event, if it matches condition (pg->acting.size() >= pg->pool.info.min_size), it set PG_STATE_ACTIVE bit.
> Here is the explaination of "pg->acting.size() >= pg->pool.info.min_size." For example, we define a strategy that one primary pg need 3 replicas. And the minimum number of PG to be UP is 2(min_size). Normally, the acting size is 3 >= min_size 2. However, if one OSD down, the acting size is 2 >= 2. It will also bring PG to be active. It serves write and read operation as normal. Of course, it is in active+degraded status. I will mention `degraded` later.
```c++
PG::RecoveryState::Active::Active(my_context ctx){
//regist when we commit call PG->_activate_committed
}
void PG::_activate_committed(epoch_t epoch, epoch_t activation_epoch)
{
if(is_primary()) {
if (peer_activated.size() == actingbackfill.size()){
all_actived_and_committed();
}
} else {
if (acting.size() >= pool.info.min_size){
state_set(PG_STATE_ACTIVE);
}
}
}
/*
* update info.history.last_epoch_started ONLY after we and all
* replicas have activated AND committed the activate transaction
* (i.e. the peering results are stable on disk).
*/
void PG::all_activated_and_committed(){
dout(10) << "all_activated_and_committed" << dendl;
//call Active::react(const AllReplicasActivated &evt)
queue_peering_event(CephPeeringEvtRef(AllReplicasActivated()));
}
Active::react(const AllReplicasActivated &evt) {
//min_size; ///< number of osds in each pg
//active status means able to serve this pg, it doesnt mean all
//replica ack back. acting size bigger then the setted min size,
//it is able to set PG_STATE_ACTIVE. Serve this pg means it is
//able to recover pg under this acting size.
if (pg->acting.size() >= pg->pool.info.min_size) {
pg->state_set(PG_STATE_ACTIVE);
}
else {
pg->state_set(PG_STATE_PEERED);
}
}
```
+ state_clear(PG_STATE_ACTIVE)
Clear PG_STATE_ACTIVE, when repeer is needed.
```c++
/* Called before initializing peering during advance_map */
void PG::start_peering_interval()
{
// deactivate.
state_clear(PG_STATE_ACTIVE);
state_clear(PG_STATE_PEERED);
state_clear(PG_STATE_DOWN);
state_clear(PG_STATE_RECOVERING);
}
```
##### 4. PG_STATE_CLEAN
When ceph replicaed all objects correct number of times, PG set PG_STATE_CLEAN bit.
- state_set(PG_STATE_CLEAN)
```c++
//Started/Primary/Active/Recovered
PG::RecoveryState::Recovered::Recovered(my_context ctx) {
//finish recovery
assert(!pg->needs_recovery());
//finish backfill
assert(!pg->actingbackfill.empty());
if (context< Active >().all_replicas_activated)
post_event(GoClean());
}
//Started/Primary/Active/Clean
PG::RecoveryState::Clean::Clean(my_context ctx){
state_set(PG_STATE_CLEAN);
}
```
- state_clear(PG_STATE_CLEAN)
1.When PG needs to do repeer, clear bit.
```C++
/* Called before initializing peering during advance_map */
void PG::start_peering_interval{
//Any locally stored PGs whose active list of OSDs changes are
//marked must re-peer.
state_clear(PG_STATE_CLEAN);
}
```
2.Exit clean state
```c++
void PG::RecoveryState::Clean::exit(){
pg->state_clear(PG_STATE_CLEAN);
}
```
3.When scrub is working, clear bit.
```c++
//if the scrub process is working, then set_clear PG_STATE_CLEAN
bool PG::scrub_process_inconsistent(){
state_clear(PG_STATE_CLEAN);
}
```
##### 5. PG_STATE_DEGRADED
There are two cases that could lead PG to be PG_STATE_DEGRADED
1. If a peer OSD is down, but primary PG it is still active. PG_STATE_DEGRADED will be set.
2. While you cannot read or write to unfound objects, you can still access all of the other objects in the PG. PG_STATE_DEGRADED will be set.
- state_set(PG_STATE_DEGRADED)
- state_clear(PG_STATE_DEGRADED)
```c++
Active::react(const AdvMap& advmap)
{
if(pg->get_osdmap()->get_pg_size(pg->info.pgid.pgid)
<= pg->actingset.size()) {
if (pg->needs_recovery()) {
// object in this PG cannot be found(need recovery)
pg->state_set(PG_STATE_DEGRADED);
} else {
// all objects in PG recovered && actingset > local pg size
pg->state_clear(PG_STATE_DEGRADED);
} else {
//PG->actingset.size() < pg->get_osdmap()->get_pg_size(pgid)
pg->state_set(PG_STATE_DEGRADED);
}
}
```
- state_clear(PG_STATE_DEGRADED)
```c++
void PG::RecoveryState::Active::exit()
{
pg->state_clear(PG_STATE_DEGRADED);
}
```
```c++
//Started/Primary/Active/Recovered
PG::RecoveryState::Recovered::Recovered(my_context ctx)
{
// if we finished backfill, all acting are active; recheck if
// DEGRADED | UNDERSIZED is appropriate.
if (pg->get_osdmap()->get_pg_size(pg->info.pgid.pgid) <=
pg->actingbackfill.size()) {
//acting sets after backfill
pg->state_clear(PG_STATE_DEGRADED);
pg->state_clear(PG_STATE_FORCED_BACKFILL| PG_STATE_FORCED_RECOVERY);
}
}
```
##### 6. PG_STATE_RECOVERING
- state_set(PG_STATE_RECOVERING)
```c++
//Started/Primary/Active/Recovering
PG::RecoveryState::Recovering::Recovering(my_context ctx)
{
pg->state_clear(PG_STATE_RECOVERY_WAIT);
pg->state_clear(PG_STATE_RECOVERY_TOOFULL);
pg->state_set(PG_STATE_RECOVERING);
}
```
- state_clear(PG_STATE_RECOVERING)
```c++
//called before peering
void PG::start_peering_interval()
{
state_clear(PG_STATE_RECOVERING);
}
```
```c++
// when all replicas is recovered clear PG_STATE_RECOVERING
boost::statechart::result
PG::RecoveryState::Recovering::react(const AllReplicasRecovered &evt)
{
pg->state_clear(PG_STATE_RECOVERING);
}
```
##### 7. PG_STATE_BACKFILLING
- state_set(PG_STATE_BACKFILLING)
```c++
PG::RecoveryState::Backfilling::Backfilling(my_context ctx)
{
pg->state_set(PG_STATE_BACKFILLING);
}
```
- state_clear(PG_STATE_BACKFILLING)
```c++
bool PrimaryLogPG::start_recovery_ops()
{
state_clear(PG_STATE_BACKFILLING);
}
```
##### 8. PG_STATE_REMAPPED
REMAPPED means the up set is not equals to acting set. More specific, a new OSD join the cluster. PG is temporarily mapped to a different set of OSDs from what CRUSH specified. So PG_STATE_REMAPPED is set.
- state_set(PG_STATE_REMAPPED)
- state_clear(PG_STATE_REMAPPED)
```c++
/* Called before initializing peering during advance_map */
void PG::start_peering_interval() {
// This will now be remapped during a backfill in cases
// that it would not have been before.
if (up != acting)
state_set(PG_STATE_REMAPPED);
else
state_clear(PG_STATE_REMAPPED);
}
```
##### 9. PG_STATE_STALE
If the Primary OSD of a placement group’s acting set fails to report to the monitor or if other OSDs have reported the primary OSD down, the monitors will mark the placement group stale.
> This state is set by monitor not by the PG itself.
```c++
void PGMonitor::on_active()
{
if (mon->is_leader()) {
check_osd_map(mon->osdmon()->osdmap.epoch);
}
}
void PGMonitor::check_osd_map(epoch_t epoch)
{
check_down_pgs();
}
void PGMonitor::check_down_pgs()
{
for (auto p : pg_map.pg_stat) {
////is primary but is down
if ((p.second.state & PG_STATE_STALE) == 0 &&
p.second.acting_primary != -1 &&
osdmap->is_down(p.second.acting_primary)) {
_try_mark_pg_stale(osdmap.get(), p.first, p.second);
}
}
}
void PGMonitor::_try_mark_pg_stale()
{
tat->state |= PG_STATE_STALE;
}
```
---
###Reference
[Source Code](https://github.com/whoiami/ceph)
[Ceph Document](http://docs.ceph.com/docs/master/)
[Ceph源码分析](https://book.douban.com/subject/26914637/)
| 27.332831 | 463 | 0.701581 | eng_Latn | 0.87062 |
98975c479e7b95039621b60a95055227cf10881d | 84 | md | Markdown | index.md | Vivinh0/github-pages-with-jekyll | 8b3b93c670f47ac5f79c1876eba5da64be44be0a | [
"MIT"
] | null | null | null | index.md | Vivinh0/github-pages-with-jekyll | 8b3b93c670f47ac5f79c1876eba5da64be44be0a | [
"MIT"
] | 4 | 2020-05-21T18:48:45.000Z | 2020-05-21T19:22:24.000Z | index.md | Vivinh0/github-pages-with-jekyll | 8b3b93c670f47ac5f79c1876eba5da64be44be0a | [
"MIT"
] | null | null | null | # Welcome to my awsome blog
I'm glad you are here. I plan to talk about dev staff.
| 21 | 54 | 0.72619 | eng_Latn | 0.999174 |
98978e7e79c6f6cb6ecf9f98ba6f94a0a2c5dfc7 | 2,979 | md | Markdown | ProdukBlankOn/README.md | ricocwp/wiki | e317307794cccf61709a0f02c8d952bf934f4ad4 | [
"MIT"
] | null | null | null | ProdukBlankOn/README.md | ricocwp/wiki | e317307794cccf61709a0f02c8d952bf934f4ad4 | [
"MIT"
] | null | null | null | ProdukBlankOn/README.md | ricocwp/wiki | e317307794cccf61709a0f02c8d952bf934f4ad4 | [
"MIT"
] | null | null | null | # Produk BlankOn
## Distribusi BlankOn Linux
1. [Bianglala](ProdukBlankOn/1/README.md)
2. [Konde](ProdukBlankOn/2/README.md)
3. [Lontara](ProdukBlankOn/3/README.md)
4. [Meuligoe](ProdukBlankOn/4/README.md)
5. [Nanggar](ProdukBlankOn/5/README.md)
6. [Ombilin](ProdukBlankOn/6/README.md)
7. [Pattimura](ProdukBlankOn/7/README.md)
8. [Rote](ProdukBlankOn/8/README.md)
9. [Suroboyo](ProdukBlankOn/9/README.md)
10. [Tambora](ProdukBlankOn/10/README.md)
11. [Uluwatu](ProdukBlankOn/11/README.md)
12. [Verbeek (dalam proses pengembangan)](https://github.com/BlankOn/verbeek)
BlankOn Linux pertama kali dikembangkan oleh YPLI pada tahun 2004 dengan nama kode "Bianglala". Pada saat itu, BlankOn merupakan turunan dari distro Fedora Core 3. Namun, rilis BlankOn pada saat itu berakhir sampai versi 1.1 dan akhirnya mati suri.
Beberapa tahun kemudian, yaitu pada tahun 2007, pengembangan BlankOn Linux mulai dibangkitkan kembali oleh YPLI. BlankOn Linux yang sebelumnya diturunkan dari Fedora Core kini diganti menjadi Ubuntu. Mulai Versi 7.0 kode nama Pattimura, Blankon di rillis 1 tahun sekali . Setiap rilis BlankOn Linux akan diberi tema dan ciri khas yang berbeda sesuai dengan budaya yang ada di Indonesia. Akhirnya, pada akhir tahun 2007, BlankOn Linux versi 2.0 dirilis dengan nama kode "Konde". Versi ini diturunkan dari Ubuntu versi 7.10. Kemudian, pada pertengahan tahun 2008, BlankOn Linux versi 3.0 dirilis dengan nama kode Lontara. Versi yang berbasis Ubuntu 8.04 LTS ini menggunakan tema khas Sulawesi Selatan, terlihat dari pengunaan karya seni Kapal Pinisi pada gambar latar belakangnya. Anda juga dapat menulis aksara Lontara yang merupakan aksara khas suku Bugis.
Pada bulan November 2008, BlankOn Linux 4.0 dirilis dengan nama kode Meuligoe. Ciri khas yang digunakan pada versi ini adalah Aceh, dengan warna dominan hijau. Pada rilis berikutnya 5.0 menggunakan nama Nanggar dengan khas Batak, pada rilis ini Logo BlankOn diganti sehingga lebih modern. Rilis terakhir pada saat buku ini ditulis adalah BlankOn Linux 9.1 , dengan nama kode Suroboyo yang merupakan turunan dari Debian. Sejak Versi 6.0 Ombilin tidak murni berbasis Ubuntu dan mulai rilis 6.0 Ombilin BlankOn tidak lagi mengikuti budaya mutlak Ubuntu, sehingga sudah banyak program yang diambil dari pembuatnya langsung.
Setelah tertunda beberapa tahun, di awal tahun 2017, pengembang BlankOn merilis BlankOn Linux dengan nama kode Tambora dengan nomor rilis X. Rilis kali ini pengembang melakukan banyak perubahan, sehingga memberikan warna tersendiri dan BlankOn memberikan dukungan ke lebih banyak perangkat keras. Pengembang juga menambahkan fitur-fitur terbaru pada beberapa paket khas BlankOn. Dengan penembahan fitur ini diharapkan dapat memberikan kemudahan dalam penggunaan.
## Manokwari Desktop
Selengkapnya tentang Manokwari dapat dibaca [di sini](/ProdukBlankOn/Manokwari.md)
## Ridon
Selengkapnya tentang Ridon dapat dibaca [di sini](/ProdukBlankOn/Ridon.md)
| 90.272727 | 856 | 0.802954 | ind_Latn | 0.950149 |
98984af722deca90a2e60a15c8a158fdfbad0509 | 25,781 | md | Markdown | expr_engine-inl.md | kaleidoscopical/MShadow-Notes | 437f75828da7d7932fb655443cb8bc45f583000e | [
"Apache-2.0"
] | 7 | 2017-03-30T09:57:08.000Z | 2018-09-03T14:53:10.000Z | expr_engine-inl.md | kaleidoscopical/MShadow-Notes | 437f75828da7d7932fb655443cb8bc45f583000e | [
"Apache-2.0"
] | null | null | null | expr_engine-inl.md | kaleidoscopical/MShadow-Notes | 437f75828da7d7932fb655443cb8bc45f583000e | [
"Apache-2.0"
] | null | null | null |
# Expr_engine-inl.h
`./expr_engine-inl.h` provides methods to evaluate all of the expressions.
- MakeTensorExp
- Plan
- MakePlan
- ExpInfo
- TypeCheck
- StreamInfo
- ShapeCheck
- ExpEngine
## MakeTensorExp
`: public Exp<MakeTensorExp<SubType, SrcExp, dim, DType>, DType, type::kChainer>`
`MakeTensorExp` is a base class inheritated by most functions in `./extension/`. Details will be provided
when those functions are discussed.
```c++
template<typename SubType, typename SrcExp, int dim, typename DType>
struct MakeTensorExp : public Exp<MakeTensorExp<SubType, SrcExp, dim, DType>, DType, type::kChainer> {
Shape<dim> shape_;
inline const SubType& real_self(void) const{
return *static_cast<const SubType*>(this);
}
};
```
## Plan
The class `Plan` is the class to provide `Eval()` function, which designs the way to do actual evaluation.
### Plan Declaration
The template `Plan` should include the `ExpType`, since its major purpose is to evaluate an expression, and `DType`
to guide the evaluation process.
```c++
template<typename ExpType, typename DType>
class Plan {
public:
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const;
};
```
### Tensor Plan
The tensor plan includes two member variables `*dptr_` and `stride_` to make sure the program can fetch
expected value by `dptr_[y * stride_ + x]`.
Since we will never expect to change the evaluation result from `Eval()` function, it is return type always
include the key word `const`.
One exception is in the tensor plan, since it has chances to be the left hand side of the assignment. Thus,
it owns a special function `REval()`, whose return type should not be `const`.
Moreover, bacause tensor value lies in a pre-allocated memory space, the return type of `REval()` function should be
a reference type. To keep consistency, the `Eval()` function in tensor plan also be made as a reference type but const.
```c++
template <typename Device, int dim, typename DType>
class Plan<Tensor<Device, dim, DType>, DType> {
public:
explicit Plan(const Tensor<Device, dim, DType> &t) : dptr_(t.dptr_), stride_(t.stride_) {}
MSHADOW_XINLINE DType &REval(index_t y, index_t x) {
return dptr_[y * stride_ + x];
}
MSHADOW_XINLINE const DType &Eval(index_t y, index_t x) const {
return dptr_[y * stride_ + x];
}
private:
DType *dptr_;
index_t stride_;
};
```
Because of the special case for 1d tensor (no stride_), the tensor plan for 1d case is specifically defined.
```c++
template <typename Device, typename DType>
class Plan<Tensor<Device, 1, DType>, DType> {
public:
explicit Plan(const Tensor<Device, 1, DType> &t) : dptr_(t.dptr_) {}
MSHADOW_XINLINE DType &REval(index_t y, index_t x) {
return dptr_[x];
}
MSHADOW_XINLINE const DType &Eval(index_t y, index_t x) const {
return dptr_[x];
}
private:
DType *dptr_;
};
```
### Scalar Plan
The usage of scalar plan includes
- It has a explicit constructor that takes in a built-in scalar type value and assign the value with type `DType` to its private member variable
- It has a public member function `Eval()` that return its private member variable `scalar_`, no matter what the input is
```c++
template<typename DType>
class Plan<ScalarExp<DType>, DType> {
public:
explicit Plan(DType scalar) : scalar_(scalar) {}
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const {
return scalar_;
}
private:
DType scalar_;
};
```
### Typecast Plan
The usage of typecast expression includes
- it is used for the type cast expression `TypecastExp`, e.g. tcast<int>(x)
- it has an explicit constructor that takes in a `Plan` type as its private member variable. The reason of doing so
is it uses the original plan for evaluation, and only convert its returned type at last.
- it has a function called `Eval()`, where the type cast happens by calling `DstDType(src_.Eval(y, x))`
```c++
template<typename DstDType, typename SrcDType, typename EType, int etype>
class Plan<TypecastExp<DstDType, SrcDType, EType, etype>, DstDType> {
public:
explicit Plan(const Plan<EType, SrcDType> &src) : src_(src) {}
MSHADOW_XINLINE DstDType Eval(index_t y, index_t x) const {
return DstDType(src_.Eval(y, x));
}
private:
Plan<EType, SrcDType> src_;
};
```
### Ternary Plan
The usage of ternary plan includes
- it has an explicit constructor that takes in 3 expressions as its private member variables
- it has a function called `Eval()`, where the computation happens by calling
`OP::Map(item1_.Eval(y, x), item2_.Eval(y, x), item3_.Eval(y, x))`;
```c++
template<typename OP, typename TA, typename TB, typename TC, int etype, typename DType>
class Plan<TernaryMapExp<OP, TA, TB, TC, DType, etype>, DType> {
public:
explicit Plan(const Plan<TA, DType> &item1, const Plan<TB, DType> &item2, const Plan<TC, DType> &item3)
: item1_(item1), item2_(item2), item3_(item3) {}
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const {
return OP::Map(item1_.Eval(y, x), item2_.Eval(y, x), item3_.Eval(y, x));
}
private:
Plan<TA, DType> item1_;
Plan<TB, DType> item2_;
Plan<TC, DType> item3_;
};
```
### Binary Plan
The usage of binary plan includes
- it has an explicit constructor that takes in 2 expressions as its private member variables
- it has a function called `Eval()`, where the computation happens by calling
`OP::Map(lhs_.Eval(y, x), rhs_.Eval(y, x));`
```c++
template<typename OP, typename TA, typename TB, int etype, typename DType>
class Plan<BinaryMapExp<OP, TA, TB, DType, etype>, DType> {
public:
explicit Plan(const Plan<TA, DType> &lhs, const Plan<TB, DType> &rhs)
: lhs_(lhs), rhs_(rhs) {}
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const {
return OP::Map(lhs_.Eval(y, x), rhs_.Eval(y, x));
}
private:
Plan<TA, DType> lhs_;
Plan<TB, DType> rhs_;
};
```
### Unary Plan
The usage of unary plan includes
- it has an explicit constructor that takes in 1 expression as its private member variables
- it has a function called `Eval()`, where the computation happens by calling
`OP::Map(src_.Eval(y, x));`
```c++
template<typename OP, typename TA, int etype, typename DType>
class Plan<UnaryMapExp<OP, TA, DType, etype>, DType> {
public:
explicit Plan(const Plan<TA, DType> &src) : src_(src) {}
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const {
return OP::Map(src_.Eval(y, x));
}
private:
Plan<TA, DType> src_;
};
```
### MakeTensorExp Plan
Since the expression type `MakeTensorExp` is only a base class of several extension functions (will be discussed
in `./extensions/`), the MakeTensorExp plan also only consider its input `Plan` as its member variables, and use the
`Eval()` function of input plan as `Eval()` function of itself.
```note
Since any expression should be composed by some types of calling, e.g. `MakeExp()`.
However, the `MakeTensorExp` lacks of it, since it is only a general base class.
Thus, I think this Plan will also never be called. Remain unproven!!!
```
```c++
template<typename SubType, typename SrcExp, int dim, typename DType>
struct Plan<MakeTensorExp<SubType, SrcExp, dim, DType>, DType> {
public:
Plan(const Plan<SubType, DType> &src) : src_(src) {}
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const {
return src_.Eval(y, x);
}
private:
Plan<SubType, DType> src_;
};
```
### Transpose Plan
The usage of transpose plan includes
- it has an explicit constructor that takes in a Plan `src` to initiate a same one as its private member variable.
Since it is only a transpose expression, it still need the original `src` to do the evaluation, and only show the
transpose effect in the special design in the `Eval()` function (the interchage of `y` and `x`).
- it has a member function called `Eval()`, which do the transpose in the computation by calling `src_.Eval(x, y)`,
instead of `src_.Eval(y, x)`;
```c++
template<typename EType, typename DType>
class Plan<TransposeExp<EType, DType>, DType> {
public:
explicit Plan(const Plan<EType, DType> &src) : src_(src) {}
MSHADOW_XINLINE DType Eval(index_t y, index_t x) const {
return src_.Eval(x, y);
}
private:
Plan<EType, DType> src_;
};
```
## MakePlan
The major purpose of `MakePlan` is to transform an Expression to its corresponding `Plan`.
### Tensor MakePlan
The input variable of Tensor MakePlan is `RValueExp<T, DType> &e`, which is the grandfather class of
`Tensor`. The reason of such design choice is compatibility, since a father class can safely refer to
its children class.
```c++
template<typename T, typename DType>
inline Plan<T, DType> MakePlan(const RValueExp<T, DType> &e) {
return Plan<T, DType>(e.self());
}
```
### Scalar MakePlan
The Scalar MakePlan takes in a `ScalarExp`, and uses its member variable `scalar_` to initiate
`Plan<ScalarExp<DType>, DType>`.
```c++
template<typename DType>
inline Plan<ScalarExp<DType>, DType> MakePlan(const ScalarExp<DType> &e) {
return Plan<ScalarExp<DType>, DType>(e.scalar_);
}
```
### Typecast MakePlan
Since the Typecast Plan only use the `Eval()` function of original plan to do `Eval()` of itself,
with a enforced typecast at the end, the only thing Typecast MakePlan needs to do is input a plan
of original expression
```c++
template<typename DstDType, typename SrcDType, typename EType, int etype>
inline Plan<TypecastExp<DstDType, SrcDType, EType, etype>, DstDType>
MakePlan(const TypecastExp<DstDType, SrcDType, EType, etype> &e) {
return Plan<TypecastExp<DstDType, SrcDType, EType, etype>, DstDType>(MakePlan(e.exp));
}
```
### Ternary MakePlan
Since the Ternary Plan require three Plans to do the evaluation, the Ternary MakePlan just
provides the plan of its components.
```c++
// declaration
template<typename OP, typename TA, typename TB, typename TC, typename DType, int etype>
inline Plan<TernaryMapExp<OP, TA, TB, TC, DType, etype>, DType>
MakePlan(const TernaryMapExp<OP, TA, TB, TC, DType, etype> &e);
// definition
template<typename OP, typename TA, typename TB, typename TC, typename DType, int etype>
inline Plan<TernaryMapExp<OP, TA, TB, TC, DType, etype>, DType>
MakePlan(const TernaryMapExp<OP, TA, TB, TC, DType, etype> &e) {
return Plan<TernaryMapExp<OP, TA, TB, TC, DType, etype>,
DType>(MakePlan(e.item1_), MakePlan(e.item2_), MakePlan(e.item3_));
}
```
### Binary MakePlan
Since the Binary Plan require two Plans to do the evaluation, the Biary MakePlan just
provides the plan of its components.
```c++
// declaration
template<typename OP, typename TA, typename TB, typename DType, int etype>
inline Plan<BinaryMapExp<OP, TA, TB, DType, etype>, DType>
MakePlan(const BinaryMapExp<OP, TA, TB, DType, etype> &e);
// definition
template<typename OP, typename TA, typename TB, typename DType, int etype>
inline Plan<BinaryMapExp<OP, TA, TB, DType, etype>, DType>
MakePlan(const BinaryMapExp<OP, TA, TB, DType, etype> &e) {
return Plan<BinaryMapExp<OP, TA, TB, DType, etype>,
DType>(MakePlan(e.lhs_), MakePlan(e.rhs_));
}
```
### Unary MakePlan
Since the Unary Plan require one Plan to do the evaluation, the Unary MakePlan just
provides the plan of its component.
```c++
template<typename OP, typename TA, typename DType, int etype>
inline Plan<UnaryMapExp<OP, TA, DType, etype>, DType>
MakePlan(const UnaryMapExp<OP, TA, DType, etype> &e) {
return Plan<UnaryMapExp<OP, TA, DType, etype>, DType>(MakePlan(e.src_));
}
```
### MakeTensorExp MakePlan
In `2.8`, we have claimed that the expression type MakeTensorExp is only a base class of several extension functions
(will be discussed in ./extensions/), and use the `Eval()` function of input plan as `Eval()` function of itself.
Therefore, in MakeTensorExp MakePlan, the input `MakeTensorExp<T, SrcExp, dim, DType> &e` is kind of like
`RValueExp<T, DType> &e`, since both of them are the father class of other classes. Same as Tensor MakePlan,
it returns `Plan<T, DType>(e.real_self());` as a Plan of its `SubType`.
```c++
template<typename T, typename SrcExp, int dim, typename DType>
inline Plan<T, DType>
MakePlan(const MakeTensorExp<T, SrcExp, dim, DType> &e) {
return Plan<T, DType>(e.real_self());
}
```
### Transpose MakePlan
Since the Transpose Plan only use the `Eval()` function of original plan to do `Eval()` of itself,
with a interchage of `y` and `x`, the only thing Transpose MakePlan needs to do is input a plan
of original expression
```c++
template<typename T, typename DType>
inline Plan<TransposeExp<T, DType>, DType>
MakePlan(const TransposeExp<T, DType> &e) {
return Plan<TransposeExp<T, DType>, DType>(MakePlan(e.exp));
}
```
## ExpInfo
`ExpInfo` is a template struct providing expression infomation to help the `TypeCheck`.
- `kDim`: is the dimension of expression related variables
- `kDevice`: is the device where the expression related variables stored
The default configuration is:
```c++
template<typename E>
struct ExpInfo {
static const int kDim = -1;
static const int kDevMask = 0;
};
```
For Tensor ExpInfo, information can be directly extracted from the `Tensor`:
```c++
template<typename Device, int dim, typename DType>
struct ExpInfo<Tensor<Device, dim, DType> > {
static const int kDim = dim;
static const int kDevMask = Device::kDevMask;
// kDevMask = 1 for cpu (01), = 2 for gpu (10)
};
```
For Scalar ExpInfo, `kDim` is always `0`, and `kDevMask` is always `0xffff` to make sure no influence to other
variables caused by itself.
```c++
template<typename DType>
struct ExpInfo< ScalarExp<DType> > {
static const int kDim = 0;
static const int kDevMask = 0xffff;
};
```
For Typecast ExpInfo, the information can be directly copied from the information of original expresion
```c++
template<typename DstDType, typename SrcDType, typename EType, int etype>
struct ExpInfo<TypecastExp<DstDType, SrcDType, EType, etype> > {
static const int kDim = ExpInfo<EType>::kDim;
static const int kDevMask = ExpInfo<EType>::kDevMask;
};
```
For Ternary ExpInfo, its information is from three different expressions:
```c++
template<typename OP, typename TA, typename TB, typename TC, typename DType, int etype>
struct ExpInfo<TernaryMapExp<OP, TA, TB, TC, DType, etype> > {
static const int kDimItem1 = ExpInfo<TA>::kDim;
static const int kDimItem2 = ExpInfo<TB>::kDim;
static const int kDimItem3 = ExpInfo<TC>::kDim;
static const int kDim = kDimItem1;
static const int kDevMask = ExpInfo<TA>::kDevMask & ExpInfo<TB>::kDevMask & ExpInfo<TC>::kDevMask;
};
```
For Binary ExpInfo, its information is from two different expressions:
```c++
template<typename OP, typename TA, typename TB, typename DType, int etype>
struct ExpInfo<BinaryMapExp<OP, TA, TB, DType, etype> > {
static const int kDimLhs = ExpInfo<TA>::kDim;
static const int kDimRhs = ExpInfo<TB>::kDim;
static const int kDim = (kDimLhs >= 0 && kDimRhs >= 0) ?\
(kDimLhs == 0 ?\
kDimRhs :\
((kDimRhs == 0 || kDimLhs == kDimRhs) ? kDimLhs : -1)) : -1;
static const int kDevMask = ExpInfo<TA>::kDevMask & ExpInfo<TB>::kDevMask;
};
```
For Unary ExpInfo and Transpose ExpInfo, its information is also simply the copy of its variable:
```c++
template<typename OP, typename TA, typename DType, int etype>
struct ExpInfo<UnaryMapExp<OP, TA, DType, etype> > {
static const int kDim = ExpInfo<TA>::kDim;
static const int kDevMask = ExpInfo<TA>::kDevMask;
};
template<typename E, typename DType>
struct ExpInfo<TransposeExp<E, DType> > {
static const int kDim = ExpInfo<E>::kDim;
static const int kDevMask = ExpInfo<E>::kDevMask;
};
```
At last, the MakeTensorExp Info is determined by `SrcExp` as input expression variable of its `SubType`
```note
the reason of its design is unclear for now, remain to be checking !!!
```
```c++
template<typename T, typename SrcExp, int dim, typename DType>
struct ExpInfo<MakeTensorExp<T, SrcExp, dim, DType> > {
static const int kDimSrc = ExpInfo<SrcExp>::kDim;
static const int kDim = kDimSrc >= 0 ? dim : -1;
static const int kDevMask = ExpInfo<SrcExp>::kDevMask;
};
```
## TypeCheck
`TypeCheck` is a template to do type checking. The checking happens in compile time.
- `kExpDim`: is the dimension of expression.
- `kDevPass`: checks whether the expression device type matches the provided type.
This is to make sure that the expression related variables are all in one specified device.
- `kMapPass`: checks whether the expression can be mapped to expression of dim
- `kRedPass`: checks whether the expression can be reduced to expression of dim
```warning
The usage of kRedPass is unclear yet!!!
```
```c++
template<typename Device, int dim, typename DType, typename E>
struct TypeCheck {
static const int kExpDim = ExpInfo<E>::kDim;
static const bool kDevPass = (ExpInfo<E>::kDevMask & Device::kDevMask) != 0;
static const bool kMapPass = (kExpDim == 0 || kExpDim == dim) && kDevPass;
static const bool kRedPass = (kExpDim > dim) && kDevPass;
};
```
The usage of TypeCheck is like
`expr::TypeCheckPass<expr::TypeCheck<cpu, dim, DType, E>::kMapPass> ::Error_All_Tensor_in_Exp_Must_Have_Same_Type();`.
If the `TypeCheck<cpu, dim, DType, E>::kMapPass>` returns `false`, then the corresponding function `Error_All_Tensor_in_Exp_Must_Have_Same_Type()`
will not be found, which leads to the fail of compile.
```c++
template<bool kPass>
struct TypeCheckPass;
template<>
struct TypeCheckPass<false> {};
template<>
struct TypeCheckPass<true> {
inline static void Error_All_Tensor_in_Exp_Must_Have_Same_Type(void) {}
inline static void Error_TypeCheck_Not_Pass_For_Reduce_Exp(void) {}
inline static void Error_Expression_Does_Not_Meet_Dimension_Req(void) {}
};
```
## StreamInfo
The `StreamInfo` returns the stream of a `Tensor` in its stored `Device`.
```warning
The usage of it is unclear yet !!!
```
```c++
template<typename Device, typename E>
struct StreamInfo {
inline static Stream<Device> *Get(const E &t);
};
template<int dim, typename Device, typename DType>
struct StreamInfo<Device, Tensor<Device, dim, DType> > {
inline static Stream<Device> *Get(const Tensor<Device, dim, DType> &t) {
return t.stream_;
}
};
```
## ShapeCheck
`ShapeCheck` is a runtime shape checking template to get the shape of an expression,
reporting error if shape mismatch
### Declaration
```c++
template<int dim, typename E>
struct ShapeCheck {
inline static Shape<dim> Check(const E &t);
};
```
### Tensor ShapeCheck
The Tensor ShapeCheck simply returns its shape.
```c++
template<int dim, typename Device, typename DType>
struct ShapeCheck<dim, Tensor<Device, dim, DType> > {
inline static Shape<dim> Check(const Tensor<Device, dim, DType> &t) {
return t.shape_;
}
};
```
### Scalar ShapeCheck
The Scalar ShapeCheck returns a same `Shape` of provided `dim`, but all of the dimension equal to `0`.
```c++
template<int dim, typename DType>
struct ShapeCheck<dim, ScalarExp<DType> > {
inline static Shape<dim> Check(const ScalarExp<DType> &exp) {
Shape<dim> shape;
for (int i = 0; i < dim; ++i) {
shape[i] = 0;
}
return shape;
}
};
```
### Typecast ShapeCheck
The Typecast ShapeCheck simply conducts in a way that calls the original `Check()` of the expression
wishing to cast it type.
```c++
template<int dim, typename DstDType, typename SrcDType, typename EType, int etype>
struct ShapeCheck<dim, TypecastExp<DstDType, SrcDType, EType, etype> > {
inline static Shape<dim>
Check(const TypecastExp<DstDType, SrcDType, EType, etype> &exp) {
return ShapeCheck<dim, EType>::Check(exp.exp);
}
};
```
### Ternary ShapeCheck
The Ternary ShapeCheck first fetch the check results of its three variable expressions.
Then, it couducts a explicit checking to make sure all of the expressions have same shape.
At last, it returns one of the shape of expressions.
```c++
template<int dim, typename OP, typename TA, typename TB, typename TC, typename DType, int etype>
struct ShapeCheck<dim, TernaryMapExp<OP, TA, TB, TC, DType, etype> > {
inline static Shape<dim>
Check(const TernaryMapExp<OP, TA, TB, TC, DType, etype> &t) {
Shape<dim> shape1 = ShapeCheck<dim, TA>::Check(t.item1_);
Shape<dim> shape2 = ShapeCheck<dim, TB>::Check(t.item2_);
Shape<dim> shape3 = ShapeCheck<dim, TC>::Check(t.item3_);
bool same = (shape1 == shape2) && (shape2 == shape3);
CHECK(same) << "TernaryMapExp: Shapes of operands are not the same, " <<
"Shape1=" << shape1 << ", Shape2=" << shape2 << ", Shape3=" << shape3;
return shape1;
}
};
```
### Binary ShapeCheck
The Binary ShapeCheck first fetch the check results of its two variable expressions.
Then, it couducts a explicit checking to make sure all of the expressions have same shape.
At last, it returns one of the shape of expressions.
```c++
template<int dim, typename OP, typename TA, typename TB, typename DType, int etype>
struct ShapeCheck<dim, BinaryMapExp<OP, TA, TB, DType, etype> > {
inline static Shape<dim>
Check(const BinaryMapExp<OP, TA, TB, DType, etype> &t) {
Shape<dim> shape1 = ShapeCheck<dim, TA>::Check(t.lhs_);
Shape<dim> shape2 = ShapeCheck<dim, TB>::Check(t.rhs_);
if (shape1[0] == 0) return shape2;
if (shape2[0] == 0) return shape1;
CHECK_EQ(shape1, shape2) << "BinaryMapExp: Shapes of operands are not the same, " <<
"Shape1=" << shape1 << ", Shape2=" << shape2;
return shape1;
}
};
```
### Unary ShapeCheck
For Unary ShapeCheck, it just fetch the check result of its variable expressions and return it.
```c++
template<int dim, typename OP, typename TA, typename DType, int etype>
struct ShapeCheck<dim, UnaryMapExp<OP, TA, DType, etype> > {
inline static Shape<dim> Check(const UnaryMapExp<OP, TA, DType, etype> &t) {
Shape<dim> s = ShapeCheck<dim, TA>::Check(t.src_);
return s;
}
};
```
### MakeTensorExp ShapeCheck
MakeTensorExp ShapeCheck simply use the member variable `shape_` of `MakeTensorExp` as its return.
```warning
It is design strategy needs to be further examined.
```
```c++
template<int dim, typename SrcExp, typename T, typename DType>
struct ShapeCheck<dim, MakeTensorExp<T, SrcExp, dim, DType> > {
inline static Shape<dim>
Check(const MakeTensorExp<T, SrcExp, dim, DType> &t) {
return t.shape_;
}
};
```
### Transpose ShapeCheck
Transpose ShapeCheck fetchs the checked shape of expression to be transposed, and simply return the
swaped lowest two dimensions.
```warning
The strategy of Transpose needs to be further studied when it comes to application.
```
```c++
template<int dim, typename E, typename DType>
struct ShapeCheck<dim, TransposeExp<E, DType> > {
inline static Shape<dim> Check(const TransposeExp<E, DType> &e) {
// swap the lowest two dimensions
Shape<dim> s = ShapeCheck<dim, E>::Check(e.exp);
std::swap(s[0], s[1]);
return s;
}
};
```
## ExpEngine
`ExpEngine` is a struct with several overloaded `Eval()` functions, always called by the assignment
related functions in `RValueExp` to dispatch simple operations.
```c++
template<typename SV, typename RV, typename DType>
struct ExpEngine {
template<typename E>
inline static void Eval(RV *dst,
const Exp<E, DType, type::kMapper> &exp) {
MapExp<SV>(dst, exp);
}
template<typename E>
inline static void Eval(RV *dst,
const Exp<E, DType, type::kChainer> &exp) {
MapExp<SV>(dst, exp);
}
template<typename E>
inline static void Eval(RV *dst,
const Exp<E, DType, type::kRValue> &exp) {
MapExp<SV>(dst, exp);
}
template<typename E>
inline static void Eval(RV *dst,
const Exp<E, DType, type::kComplex> &exp) {
ExpComplexEngine<SV, RV, E, DType>::Eval(dst->ptrself(), exp.self());
}
};
```
The `ExpComplexEngine` to evaluate expression with `type::kComplex` majorly deals with
`dot()` expression and looks like:
```c++
template<typename SV, typename RV, typename E, typename DType>
struct ExpComplexEngine {
inline static void Eval(RV *dst, const E &exp);
};
template<typename SV, typename Device, int dim, int ldim,
int rdim, bool ltrans, bool rtrans, typename DType>
struct ExpComplexEngine<SV,
Tensor<Device, dim, DType>,
DotExp<Tensor<Device, ldim, DType>,
Tensor<Device, rdim, DType>,
ltrans, rtrans, DType>,
DType> {
inline static void Eval(Tensor<Device, dim, DType> *dst,
const DotExp<Tensor<Device, ldim, DType>,
Tensor<Device, rdim, DType>,
ltrans, rtrans, DType> &exp) {
DotEngine<SV, Device, dim, ldim, rdim,
ltrans, rtrans, DType>::Eval(dst, exp.lhs_, exp.rhs_, exp.scale_);
}
};
```
The DotEngine will be further discussed in `./dot_engine-inl.h`.
| 30.618765 | 147 | 0.677825 | eng_Latn | 0.831688 |
989881eb7fe228aed91a2778172163ab0452f16b | 430 | md | Markdown | README.md | WillemCarthago/leaflet-map-simple | 23acffca4dee5bde806de914c3085d2daf2c4493 | [
"MIT"
] | null | null | null | README.md | WillemCarthago/leaflet-map-simple | 23acffca4dee5bde806de914c3085d2daf2c4493 | [
"MIT"
] | null | null | null | README.md | WillemCarthago/leaflet-map-simple | 23acffca4dee5bde806de914c3085d2daf2c4493 | [
"MIT"
] | null | null | null | # leaflet-map-simple
A simple Leaflet map template for new users to fork their own copy, edit, and host on GitHub Pages.
These are the pages that I create and copy on my own GitHub account
## Link to live map (replace with link to your site)
https://willemcarthago.github.io/leaflet-map-simple/
## Create your own
See step-by-step tutorial at https://HandsOnDataViz.org, an open-access book by Jack Dougherty and Ilya Ilyankou
| 39.090909 | 112 | 0.774419 | eng_Latn | 0.974763 |
98989c35e58f0461e3d8b134a78b3746018df443 | 1,613 | md | Markdown | docs/leetcode/greedy/005.加油站.134.md | sjx1995/js-data-structures-algorithms | 06393f6ae95702b4a191052458fb2cc32d2bf2d8 | [
"MIT"
] | null | null | null | docs/leetcode/greedy/005.加油站.134.md | sjx1995/js-data-structures-algorithms | 06393f6ae95702b4a191052458fb2cc32d2bf2d8 | [
"MIT"
] | null | null | null | docs/leetcode/greedy/005.加油站.134.md | sjx1995/js-data-structures-algorithms | 06393f6ae95702b4a191052458fb2cc32d2bf2d8 | [
"MIT"
] | null | null | null | # 加油站（134）
## 题目
在一条环路上有 N 个加油站，其中第 i 个加油站有汽油 gas[i] 升。
你有一辆油箱容量无限的的汽车，从第 i 个加油站开往第 i+1 个加油站需要消耗汽油 cost[i] 升。你从其中的一个加油站出发，开始时油箱为空。
如果你可以绕环路行驶一周，则返回出发时加油站的编号，否则返回 -1。
## 说明
如果题目有解，该答案即为唯一答案。
输入数组均为非空数组，且长度相同。
输入数组中的元素均为非负数。
## 示例
输入:
`gas = [1,2,3,4,5]`
`cost = [3,4,5,1,2]`
输出: `3`
输入:
`gas = [2,3,4]`
`cost = [3,4,3]`
输出: `-1`
## 算法
### 暴力法
```js
export const canCompleteCircuit_1 = (gas, cost) => {
let res = 0;
for (let i = 0; i < gas.length; i++) {
let carGas = 0;
for (let j = 0; j < gas.length; j++) {
carGas += gas[j];
carGas -= cost[j];
if (carGas < 0) {
break;
}
if (j === gas.length - 1) {
return res;
}
}
gas.push(gas.shift());
cost.push(cost.shift());
res++;
}
return -1;
};
```
### 数学推理
能完成一圈，需要满足两个条件：
- 总汽油数 > 总消耗数
- 在第i个汽油站，应该满足`gas[i]-cost[i]>0`才能到达下一个加油站
下面只需要`O(N)`时间复杂度的算法就可以：
- 从第0个加油站开始，`totalGas`是从0开始经过的每一站的净汽油数（cost-gas），`currentGas`是当前出发汽油站的情况下的净汽油数
- 按顺序每经过一个加油站，让`totalGas`和`currentGas`分别加上`gas[i]`和减去`cost[i]`，如果`currentGas`不小于零，那么汽车可以驶往下一个加油站；如果`currentGas`小于零，那么说明汽车不能驶向下一个加油站且**从`startStation`到这个加油站之前的所有加油站出发都不能让汽车驶向下一个加油站**，那么让`startStation`指向下一个加油站且`cueerntGas`重置为0
- 直到汽车抵达最后一个加油站，判断`totalGas`是否小于0，如果小于0那么汽车不能循环一圈，如果不小于零，那么`startStation`为汽车起点
```js
export const canCompleteCircuit = (gas, cost) => {
let startStation = 0,
totalGas = 0,
currentGas = 0;
for (let i = 0; i < gas.length; i++) {
totalGas = totalGas + gas[i] - cost[i];
currentGas = currentGas + gas[i] - cost[i];
if (currentGas < 0) {
startStation = i + 1;
currentGas = 0;
}
}
return totalGas >= 0 ? startStation : -1;
};
``` | 18.54023 | 224 | 0.634842 | yue_Hant | 0.510988 |
9898d04df010513e5d9c75e2e7663543f738c72d | 409 | md | Markdown | _pages/fun.md | venkkris/venkkris.github.io | 347c2b57109028d35bedc2c8d24eb30e979aa072 | [
"MIT"
] | 1 | 2021-01-03T01:26:04.000Z | 2021-01-03T01:26:04.000Z | _pages/fun.md | venkkris/venkkris.github.io | 347c2b57109028d35bedc2c8d24eb30e979aa072 | [
"MIT"
] | null | null | null | _pages/fun.md | venkkris/venkkris.github.io | 347c2b57109028d35bedc2c8d24eb30e979aa072 | [
"MIT"
] | null | null | null | ---
title: "Fun"
permalink: /fun/
author_profile: true
---
### Cycling
I ride my Trek FX2 on the (really steep!) roads and the pretty trails in and around Pittsburgh. You can check out my latest rides here:
<iframe height='454' width='300' frameborder='0' allowtransparency='true' scrolling='no' src='https://www.strava.com/athletes/48426913/latest-rides/1e210966af9f839fd97cd85df9571dd91169d955'></iframe>
| 37.181818 | 199 | 0.757946 | eng_Latn | 0.835732 |
98992356ae1351a8ffb2e28dc014dd1e53e696d5 | 1,970 | md | Markdown | README.md | KeysHD/codebox | e87375076bcb008504dbb2ffced6ee8a36d912ac | [
"MIT"
] | null | null | null | README.md | KeysHD/codebox | e87375076bcb008504dbb2ffced6ee8a36d912ac | [
"MIT"
] | null | null | null | README.md | KeysHD/codebox | e87375076bcb008504dbb2ffced6ee8a36d912ac | [
"MIT"
] | null | null | null | <p align="center">
<img width=200px height=200px src="./github/Logo.png" alt="Project logo">
</p>
<h1 align="center">Codebox</h1>
<p align="center"> Simple discord bot for begginers developers to search through MDN Docs.
</p>
---
## 📝 Table of Contents
- [About](#about)
- [Getting Started](#getting_started)
- [Prerequisites](#prerequisites)
- [Installing](#install)
- [Usage](#usage)
- [Techs](#built_using)
- [Authors](#authors)
## 🧐 About <a name = "about"></a>
Simple discord bot for begginers developers to search through MDN Docs.
The idea behing this project initialized from my friend, who is starting on the tech world and wanted a discord bot to get mdn links faster.
## 🏁 Getting Started <a name = "getting_started"></a>
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See [deployment](#deployment) for notes on how to deploy the project on a live system.
### Prerequisites <a name = "prerequisites"></a>
```
Node.js version >= 16.6.0
```
### Installing <a name = "install"></a>
1. Install all dependencies
```sh
yarn install
```
2. Create `.env` file to configurate `CLIENTID`, `GUILDID`, `TOKEN`
```sh
TOKEN = <DISCORD_BOT_TOKEN>
GUILDID = <GUILD_ID>
CLIENTID = <CLIENT_ID>
```
3. Run `yarn setup` to setup all commands to the discord server
4. Run `yarn start` If u want to run as a production, or `yarn dev` If u want to run as a development.
## 🎈 Usage <a name="usage"></a>
1. On your discord server, type `/mdn` and will autocomplete.
<img src="./github/Preview.PNG" alt="Discord command"></a>
2. Type a query and will show up the results.
<img src="./github/Embed.PNG" alt="Discord embed"></a>
## ⛏️ Built Using <a name = "built_using"></a>
- [Node.js](https://nodejs.org/en/) - Javascript on backend
- [Discord.js](https://discord.js.org/#/) - Node.js Library
## ✍️ Authors <a name = "authors"></a>
- [@Yuki2dev](https://github.com/KeysHD)
| 25.921053 | 215 | 0.688325 | eng_Latn | 0.880437 |
98993e388e97d2fa8e9c490386e49a0945cc8f71 | 1,911 | md | Markdown | wdk-ddi-src/content/usbioctl/ns-usbioctl-_usb_hub_name.md | xiaoyinl/windows-driver-docs-ddi | 2442baf424975cfeec65190615ed8638a01791b5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | wdk-ddi-src/content/usbioctl/ns-usbioctl-_usb_hub_name.md | xiaoyinl/windows-driver-docs-ddi | 2442baf424975cfeec65190615ed8638a01791b5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | wdk-ddi-src/content/usbioctl/ns-usbioctl-_usb_hub_name.md | xiaoyinl/windows-driver-docs-ddi | 2442baf424975cfeec65190615ed8638a01791b5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
UID: NS:usbioctl._USB_HUB_NAME
title: _USB_HUB_NAME (usbioctl.h)
description: The USB_HUB_NAME structure stores the hub's symbolic device name.
old-location: buses\usb_hub_name.htm
tech.root: usbref
ms.assetid: c213d811-a690-41b4-bed1-ec9890e8be46
ms.date: 05/07/2018
ms.keywords: "*PUSB_HUB_NAME, PUSB_HUB_NAME, PUSB_HUB_NAME structure pointer [Buses], USB_HUB_NAME, USB_HUB_NAME structure [Buses], _USB_HUB_NAME, buses.usb_hub_name, usbioctl/PUSB_HUB_NAME, usbioctl/USB_HUB_NAME, usbstrct_d20b3e12-7b5c-408d-929e-2d781a765f56.xml"
ms.topic: struct
f1_keywords:
- "usbioctl/USB_HUB_NAME"
req.header: usbioctl.h
req.include-header: Usbioctl.h
req.target-type: Windows
req.target-min-winverclnt:
req.target-min-winversvr:
req.kmdf-ver:
req.umdf-ver:
req.ddi-compliance:
req.unicode-ansi:
req.idl:
req.max-support:
req.namespace:
req.assembly:
req.type-library:
req.lib:
req.dll:
req.irql:
topic_type:
- APIRef
- kbSyntax
api_type:
- HeaderDef
api_location:
- usbioctl.h
api_name:
- USB_HUB_NAME
product:
- Windows
targetos: Windows
req.typenames: USB_HUB_NAME, *PUSB_HUB_NAME
---
# _USB_HUB_NAME structure
## -description
The <b>USB_HUB_NAME</b> structure stores the hub's symbolic device name.
## -struct-fields
### -field ActualLength
The size of the Unicode string pointed to by <b>HubName</b>. The <b>ActualLength</b> value indicates the length of the string and not the entire structure.
### -field HubName
A NULL-terminated Unicode string that contains the hub's symbolic device name.
## -see-also
<a href="https://docs.microsoft.com/windows-hardware/drivers/ddi/content/usbioctl/ni-usbioctl-ioctl_internal_usb_get_controller_name">IOCTL_INTERNAL_USB_GET_CONTROLLER_NAME</a>
<a href="https://docs.microsoft.com/windows-hardware/drivers/ddi/content/index">USB Structures</a>
| 23.024096 | 265 | 0.74202 | yue_Hant | 0.826441 |
98994a1801867096ad45254e580d22cc2db8eca9 | 6,165 | md | Markdown | src/_posts/2016/2016-05-16-finding-404s-in-apache-logs.md | alexwlchan/alexwlchan.net | f34c4b11dcebd5b6eb65de6caa7fe320fff7a25a | [
"MIT"
] | 33 | 2017-09-25T13:53:20.000Z | 2022-01-25T11:59:05.000Z | src/_posts/2016/2016-05-16-finding-404s-in-apache-logs.md | alexwlchan/alexwlchan.net | f34c4b11dcebd5b6eb65de6caa7fe320fff7a25a | [
"MIT"
] | 94 | 2017-09-09T07:27:25.000Z | 2022-03-28T02:45:39.000Z | src/_posts/2016/2016-05-16-finding-404s-in-apache-logs.md | alexwlchan/alexwlchan.net | f34c4b11dcebd5b6eb65de6caa7fe320fff7a25a | [
"MIT"
] | 13 | 2017-09-25T13:59:34.000Z | 2021-11-07T09:23:02.000Z | ---
layout: post
date: 2016-05-16 21:02:00 +0000
summary: A Python script for finding 404 errors in my Apache web logs - and by extension,
broken pages.
tags: python apache
title: Finding 404s and broken pages in my Apache logs
category: Blogging about blogging
---
Sometime earlier this year, I broke the Piwik server-side analytics that I'd been using to count hits to the site.
It sat this way for about two months before anybody noticed, which I took as a sign that I didn't actually need them.
I look at them for vanity, nothing more.
Since then, I've been using Python to parse my Apache logs, an idea borrowed [from Dr. Drang][drang].
All I want is a rough view count, and if I work on the raw logs, then I can filter out a lot of noise from things like bots and referrer spam.
High-level tools like Piwik and Google Analytics make it much harder to prune your results.
My Apache logs include a list of all the 404 errors: any time that somebody (or something) has found a missing page.
This is useful information, because it tells me if I've broken something (not unlikely, see above).
Although I try to [have a helpful 404 page][404help], that's no substitute for fixing broken pages.
So I wrote a script that looks for 404 errors in my Apache logs, and prints the most commonly hit pages – then I can decide whether to fix or ignore them.
The full script is [on GitHub][github], along with some instructions.
Below I'll walk through the part that actually does the hard work.
```python
page_tally = collections.Counter()
for line in sys.stdin:
# Any line that isn't a 404 request is uninteresting.
if '404' not in line:
continue
# Parse the line, and check it really is a 404 request; otherwise,
# discard it. Then get the page the user was trying to reach.
hit = PATTERN.match(line).groupdict()
if hit['status'] != '404':
continue
page = hit['request'].split()[1]
# If it's a 404 that I know I'm not going to fix, discard it.
if page in WONTFIX_404S:
continue
# If I fixed the page after this 404 came in, I'm not interested
# in hearing about it again.
if page in FIXED_404S:
time, _ = hit["time"].split()
date = datetime.strptime(time, "%d/%b/%Y:%H:%M:%S").date()
if date <= FIXED_404S[page]:
continue
# But I definitely want to know about links I thought I'd
# fixed but which are still broken.
print('!! ' + page)
print(line)
print('')
# This is a 404 request that we're interested in; go ahead and
# add it to the counter.
page_tally[page] += 1
for page, count in page_tally.most_common(25):
print('%5d\t%s' % (count, page))
```
I'm passing the Apache log in to stdin, and looping over the lines.
Each line corresponds to a single hit.
On lines 6–7, I'm throwing away all the lines that don't contain the string "404".
This might let through a few lines that aren't 404 results – I'm not too fussed.
This is just a cheap heuristic to avoid (relatively) slow parsing of lots of lines that I don't care about.
On lines 11–14, I actually parse the line.
My `PATTERN` regex for parsing the Apache log format comes from [Dr. Drang's post][drang].
Now I actually can properly filter for 404 results only, and discard the rest.
The `request` parameter is usually something like `GET /about/ HTTP/1.1` – a method, a page and an HTTP version.
I only care about the page, so throw away the rest.
Like any public-facing computer, my server is crawled by bots looking for unpatched versions of WordPress and PHP.
They're looking for login pages where they can brute force credentials or exploit known vulnerabilities.
I don't have PHP or WordPress installed, so they show up as 404 errors in my logs.
Once I'm happy that I'm not vulnerable to whatever they're trying to exploit, I add those pages to `WONTFIX_404S`.
On lines 17–18, I ignore any errors from those pages.
The point of writing this script is to find, and fix, broken pages.
Once I've fixed the page, the hits are still in the historical logs, but they're less interesting.
I'd like to know if the page is still broken in future, but I already know that it was broken in the past.
When I fix a page, I add it to `FIXED_404S`, a dictionary in which the keys are pages, and the values are the date on which I think I fixed it.
On lines 22–32, I throw away any broken pages that I've acknowledged and fixed, if they came in before the fix.
But then I highlight anything that's still broken, because it means my fix didn't work.
Any hit that hasn't been skipped by now is "interesting".
It's a 404'd page that I don't want to ignore, and that I haven't fixed in the past.
I add 1 to the tally of broken pages, and carry on.
I've been using the [Counter class][ctr] from the Python standard library to store my tally.
I could use a regular dictionary, but Counter helps clean up a little boilerplate.
In particular, I don't have to initialise a new key in the tally – it starts at a default of 0 – and at the end of the script, I can use the `most_common()` method to see the 404'd pages that are hit most often.
That helps me prioritise what pages I want to fix.
Here's a snippet from the output when I first ran the script:
```
23656 /atom.xml
14161 /robots.txt
3199 /favicon.ico
3075 /apple-touch-icon.png
412 /wp-login.php
401 /blog/2013/03/pinboard-backups/
```
Most of the actually broken or missing pages were easy to fix.
In ten minutes, I fixed ~90% of the 404 problems that had occurred since I turned on Apache last August.
I don't know how often I'll actually run this script.
I've fixed the most common errors; it'll be a while before I have enough logs to make it worth doing another round of fixes.
But it's useful to have in my back pocket for a rainy day.
[drang]: http://www.leancrew.com/all-this/2013/07/parsing-my-apache-logs/
[github]: https://github.com/alexwlchan/apache-utils
[404help]: /2014/09/404-pages/
[ctr]: https://docs.python.org/3.5/library/collections.html?highlight=collections.counter
| 48.164063 | 223 | 0.729278 | eng_Latn | 0.998869 |
9899b5d966bef49b436ddf6f614d7551ae0a3370 | 3,669 | md | Markdown | docs/javascript/tutorial-create-react-app.md | MicrosoftDocs/visualstudio-docs.es-es | 9d654c35ecad85edadd91aefb49b7bd0ebd2eee2 | [
"CC-BY-4.0",
"MIT"
] | 6 | 2020-05-20T07:48:51.000Z | 2022-03-09T07:27:32.000Z | docs/javascript/tutorial-create-react-app.md | MicrosoftDocs/visualstudio-docs.es-es | 9d654c35ecad85edadd91aefb49b7bd0ebd2eee2 | [
"CC-BY-4.0",
"MIT"
] | 30 | 2018-10-02T15:11:15.000Z | 2021-12-17T11:02:02.000Z | docs/javascript/tutorial-create-react-app.md | MicrosoftDocs/visualstudio-docs.es-es | 9d654c35ecad85edadd91aefb49b7bd0ebd2eee2 | [
"CC-BY-4.0",
"MIT"
] | 25 | 2018-01-24T17:02:46.000Z | 2022-03-04T14:06:19.000Z | ---
title: Creación de una aplicación React
description: En este tutorial, aprenderá a crear una sencilla aplicación React en Visual Studio.
ms.date: 07/30/2021
ms.custom: vs-acquisition
ms.topic: tutorial
ms.devlang: javascript
author: mikejo5000
ms.author: mikejo
manager: jmartens
ms.technology: vs-javascript
dev_langs:
- JavaScript
ms.workload:
- nodejs
monikerRange: '>= vs-2022'
ms.openlocfilehash: fbf4b68c1f5f82af8af47cda7e21389b14c21bb2
ms.sourcegitcommit: 68897da7d74c31ae1ebf5d47c7b5ddc9b108265b
ms.translationtype: HT
ms.contentlocale: es-ES
ms.lasthandoff: 08/13/2021
ms.locfileid: "122061459"
---
# <a name="create-a-react-app"></a>Creación de una aplicación React
En esta introducción de entre cinco y diez minutos al entorno de desarrollo integrado (IDE) de Visual Studio, creará una sencilla aplicación web React de front-end.
## <a name="prerequisites"></a>Requisitos previos
Asegúrese de tener instalado lo siguiente:
- Visual Studio 2022 Preview 2 o versión posterior. Vaya a la página de [descargas de Visual Studio](https://visualstudio.microsoft.com/downloads/) para instalarlo de forma gratuita.
- npm ([https://www.npmjs.com/](https://www.npmjs.com/))
- npx ([https://www.npmjs.com/package/npx](https://www.npmjs.com/package/npx))
## <a name="create-your-app"></a>Creación de la aplicación
1. En el cuadro de diálogo Nuevo proyecto, seleccione **Crear un proyecto nuevo**.
:::image type="content" source="media/vs-2022/create-new-project.png" alt-text="Creación de un nuevo proyecto":::
1. Busque React en la barra de búsqueda de la parte superior y, a continuación, seleccione **Standalone JavaScript React Template** (Plantilla React de JavaScript independiente) o **Standalone TypeScript React Template** (Plantilla React de TypeScript independiente), en función de sus preferencias.
:::image type="content" source="media/vs-2022/react-choose-template.png" alt-text="Selección de una plantilla":::
1. Asigne un nombre al proyecto y a la solución.
Si previamente seleccionó Standalone JavaScript React Template (Plantilla de React JavaScript independiente), cuando llegue a la ventana Información adicional, asegúrese de NO seleccionar la opción **Add integration for Empty ASP.NET Web API Project** (Agregar integración para el proyecto de API web de ASP.NET vacío). Esta opción agrega archivos a la plantilla de React para que se pueda enlazar con el proyecto de ASP.NET Core, si se agrega un proyecto de ASP.NET Core.
:::image type="content" source="media/vs-2022/react-additional-info.png" alt-text="Información adicional":::
Tenga en cuenta que el proyecto de React tarda un poco en crearse porque el comando create-react-app que se ejecuta en el mismo momento también ejecuta el comando npm install.
## <a name="set-the-project-properties"></a>Establecimiento de las propiedades del proyecto
1. En el Explorador de soluciones, haga clic con el botón derecho en el proyecto de React, seleccione **Propiedades** y, a continuación, vaya a la sección **Depuración**.
1. Cambie el Depurador para iniciar por la opción **launch.json**.
:::image type="content" source="media/vs-2022/react-choose-debugger.png" alt-text="Selección del depurador (launch.json)":::
## <a name="build-your-project"></a>Compilación del proyecto
Elija **Compilar** > **Compilar solución** para compilar el proyecto.
## <a name="start-your-project"></a>Iniciación del proyecto
Presione **F5** o seleccione el botón **Iniciar** situado en la parte superior de la ventana. Aparece un símbolo del sistema:
- La ejecución del comando react-scripts start en npm
A continuación, debería ver que aparece la aplicación React base. | 50.958333 | 475 | 0.769965 | spa_Latn | 0.922468 |
989af63f70707c962c18818bb00b4fc1b1d77312 | 639 | md | Markdown | node_modules/bitgo/node_modules/bigi/README.md | melissadu/safecityproject | bb5edd05e43844495f22e309b4ae3eafe8f340a8 | [
"MIT"
] | 787 | 2018-05-31T16:19:25.000Z | 2021-12-08T13:49:20.000Z | README.md | DalavanCloud/bigi | cb702633d6587a4326cc8c79b4024444caf9531f | [
"MIT"
] | 52 | 2021-01-17T20:22:40.000Z | 2022-03-23T18:40:46.000Z | README.md | DalavanCloud/bigi | cb702633d6587a4326cc8c79b4024444caf9531f | [
"MIT"
] | 207 | 2018-09-17T23:35:47.000Z | 2019-12-23T02:26:57.000Z | bigi
======
[](http://travis-ci.org/cryptocoinjs/bigi)
[](https://coveralls.io/r/cryptocoinjs/bigi)
[](https://www.npmjs.org/package/bigi)
[](https://ci.testling.com/cryptocoinjs/bigi)
JavaScript library to manipulate big integers. Based on `jsbn` made by [Tom Wu](http://www-cs-students.stanford.edu/~tjw/jsbn/)
Official documentation:
http://cryptocoinjs.com/modules/misc/bigi/ | 45.642857 | 127 | 0.746479 | yue_Hant | 0.39574 |
989b51e58cbc1bf2954049e889458bbaf086b145 | 40,159 | md | Markdown | _posts/2020-04-24-visualise-missing-data.md | opendatavis/opendatavis.github.io | 529025047f882894e5ac80c39c053b805a3ee2a7 | [
"MIT"
] | null | null | null | _posts/2020-04-24-visualise-missing-data.md | opendatavis/opendatavis.github.io | 529025047f882894e5ac80c39c053b805a3ee2a7 | [
"MIT"
] | null | null | null | _posts/2020-04-24-visualise-missing-data.md | opendatavis/opendatavis.github.io | 529025047f882894e5ac80c39c053b805a3ee2a7 | [
"MIT"
] | null | null | null | ---
layout: post
title: "Visualise Missing Data Patterns in Python"
author: sai
categories: [ Python, tutorial, Plotly ]
image: assets/images/Missing_Data.jpg
tags: [sticky]
---
Missing values in a data set is quite common and have significance effect on the analysis and training of a machine learning model.
> Missing data can be either "Missing At Random (MAR)" or "Missing Completely At Random (MCAR)" or "Missing Not At Random (MNAR)"
The easiest way to know which category your missing data falls in to is by visualising it. Have you ever wondered how to visualise missing values in your data? Let's do it using basic python libraries `pandas` and `plotly`.
#### Let's start coding
##### Import Libraries and read data
As mentioned above, let's import libraries pandas and plotly.
<br/>
<!-- Gist: Import libraries Start-->
<script src="https://gist.github.com/opendatavis/108f3ebfc2bf4835329340fd354d58f1.js"></script>
<!-- Gist: Import libraries End-->
Read the dataset [Sleep](https://raw.githubusercontent.com/opendatavis/opendatavis.github.io/master/Data/Sleep_Data.csv) hosted on github. Missing values are represented as NA in the csv file. `pandas` converts NA to NaN.
<br/>
<!-- Gist: Read data Start-->
<script src="https://gist.github.com/opendatavis/40a95f13ea7fcb069d90f579f10ba5bf.js"></script>
<!-- Gist: Read data End-->
<!-- HTML: Head Data Start-->
<center>
<div>
<style type="text/css">
.tg {border-collapse:collapse;border-color:black;border-spacing:0;border-style:solid;border-width:1px;}
.tg td{border-style:solid;border-width:0px;font-family:Arial, sans-serif;font-size:14px;overflow:hidden;
padding:10px 5px;word-break:normal;}
.tg th{border-style:solid;border-width:0px;font-family:Arial, sans-serif;font-size:14px;font-weight:normal;
overflow:hidden;padding:10px 5px;word-break:normal;}
.tg .tg-ayo4{background-color:#efefef;border-color:#ffffff;color:rgb(0, 0, 0);text-align:right;vertical-align:top}
.tg .tg-06ar{border-color:#ffffff;color:rgb(0, 0, 0);font-weight:bold;text-align:right;vertical-align:top}
.tg .tg-h25s{border-color:#ffffff;font-weight:bold;text-align:right;vertical-align:top}
.tg .tg-zyvm{border-color:#ffffff;color:rgb(0, 0, 0);text-align:right;vertical-align:top}
</style>
<table class="tg">
<tr>
<th class="tg-06ar">BodyWgt</th>
<th class="tg-06ar">BrainWgt</th>
<th class="tg-06ar">NonD</th>
<th class="tg-06ar">Dream</th>
<th class="tg-06ar">Sleep</th>
<th class="tg-06ar">Span</th>
<th class="tg-06ar">Gest</th>
<th class="tg-06ar">Pred</th>
<th class="tg-06ar">Exp</th>
<th class="tg-h25s">Danger</th>
</tr>
<tr>
<td class="tg-ayo4">6654.000</td>
<td class="tg-ayo4">5712.0</td>
<td class="tg-ayo4">NaN</td>
<td class="tg-ayo4">NaN</td>
<td class="tg-ayo4">3.3</td>
<td class="tg-ayo4">38.6</td>
<td class="tg-ayo4">645.0</td>
<td class="tg-ayo4">3</td>
<td class="tg-ayo4">5</td>
<td class="tg-ayo4">3</td>
</tr>
<tr>
<td class="tg-zyvm">1.000</td>
<td class="tg-zyvm">6.6</td>
<td class="tg-zyvm">6.3</td>
<td class="tg-zyvm">2.0</td>
<td class="tg-zyvm">8.3</td>
<td class="tg-zyvm">4.5</td>
<td class="tg-zyvm">42.0</td>
<td class="tg-zyvm">3</td>
<td class="tg-zyvm">1</td>
<td class="tg-zyvm">3</td>
</tr>
<tr>
<td class="tg-ayo4">3.385</td>
<td class="tg-ayo4">44.5</td>
<td class="tg-ayo4">NaN</td>
<td class="tg-ayo4">NaN</td>
<td class="tg-ayo4">12.5</td>
<td class="tg-ayo4">14.0</td>
<td class="tg-ayo4">60.0</td>
<td class="tg-ayo4">1</td>
<td class="tg-ayo4">1</td>
<td class="tg-ayo4">1</td>
</tr>
<tr>
<td class="tg-zyvm">0.920</td>
<td class="tg-zyvm">5.7</td>
<td class="tg-zyvm">NaN</td>
<td class="tg-zyvm">NaN</td>
<td class="tg-zyvm">16.5</td>
<td class="tg-zyvm">NaN</td>
<td class="tg-zyvm">25.0</td>
<td class="tg-zyvm">5</td>
<td class="tg-zyvm">2</td>
<td class="tg-zyvm">3</td>
</tr>
<tr>
<td class="tg-ayo4">2547.000</td>
<td class="tg-ayo4">4603.0</td>
<td class="tg-ayo4">2.1</td>
<td class="tg-ayo4">1.8</td>
<td class="tg-ayo4">3.9</td>
<td class="tg-ayo4">69.0</td>
<td class="tg-ayo4">624.0</td>
<td class="tg-ayo4">3</td>
<td class="tg-ayo4">5</td>
<td class="tg-ayo4">4</td>
</tr>
</table>
</div>
</center>
<!-- HTML: Head Data End-->
##### Identify Missing Values
Let's identify the columns with missing values and number of missing records in each of them.
<br/>
<!-- Gist: Find Missing data Start-->
<script src="https://gist.github.com/opendatavis/169f1c6fcd44885a2841b314b745fdd9.js"></script>
<!-- Gist: Find Missing data End-->
<!-- HTML: Missing Data Table Start-->
<center>
<div>
<style type="text/css">
.tg {border-collapse:collapse;border-spacing:0;}
.tg td{border-color:black;border-style:solid;border-width:1px;font-family:Arial, sans-serif;font-size:14px;
overflow:hidden;padding:10px 5px;word-break:normal;}
.tg th{border-color:black;border-style:solid;border-width:1px;font-family:Arial, sans-serif;font-size:14px;
font-weight:normal;overflow:hidden;padding:10px 5px;word-break:normal;}
.tg .tg-g873{color:rgb(0, 0, 0);text-align:right;vertical-align:top}
.tg .tg-zweo{color:rgb(0, 0, 0);font-weight:bold;text-align:right;vertical-align:top}
.tg .tg-cmkb{background-color:rgb(239, 239, 239);color:rgb(0, 0, 0);text-align:right;vertical-align:top}
</style>
<table class="tg">
<tr>
<th class="tg-zweo">Column</th>
<th class="tg-zweo">No_Records</th>
</tr>
<tr>
<td class="tg-cmkb">NonD</td>
<td class="tg-cmkb">14</td>
</tr>
<tr>
<td class="tg-g873">Dream</td>
<td class="tg-g873">12</td>
</tr>
<tr>
<td class="tg-cmkb">Sleep</td>
<td class="tg-cmkb">4</td>
</tr>
<tr>
<td class="tg-g873">Span</td>
<td class="tg-g873">4</td>
</tr>
<tr>
<td class="tg-cmkb">Gest</td>
<td class="tg-cmkb">4</td>
</tr>
</table>
</div>
</center>
<br/>
<!-- HTML: Missing Data Table End-->
Add Row_Index as a column and use it to identify missing rows in the plot. We need only missing columns from the dataframe. Also, let us binarize data by mapping missing values to 0 and non-missing values to 1.
<br/>
<!-- Gist: Binarize data Start-->
<script src="https://gist.github.com/opendatavis/c4d507db6a6b4b0653643f901cf3bedd.js"></script>
<!-- Gist: Binarize data End-->
<!-- HTML: Binarize Data Table Start-->
<center>
<div>
<style type="text/css">
.tg {border-collapse:collapse;border-color:black;border-spacing:0;border-style:solid;border-width:1px;}
.tg td{border-style:solid;border-width:0px;font-family:Arial, sans-serif;font-size:14px;overflow:hidden;
padding:10px 5px;word-break:normal;}
.tg th{border-style:solid;border-width:0px;font-family:Arial, sans-serif;font-size:14px;font-weight:normal;
overflow:hidden;padding:10px 5px;word-break:normal;}
.tg .tg-efhx{border-color:inherit;color:rgb(0, 0, 0);font-weight:bold;text-align:right;vertical-align:top}
.tg .tg-6ic8{border-color:inherit;font-weight:bold;text-align:right;vertical-align:top}
.tg .tg-ehic{background-color:#efefef;border-color:inherit;color:rgb(0, 0, 0);text-align:right;vertical-align:top}
.tg .tg-pf22{border-color:inherit;color:rgb(0, 0, 0);text-align:right;vertical-align:top}
</style>
<table class="tg">
<tr>
<th class="tg-efhx">NonD</th>
<th class="tg-efhx">Dream</th>
<th class="tg-efhx">Sleep</th>
<th class="tg-efhx">Span</th>
<th class="tg-efhx">Gest</th>
<th class="tg-6ic8">Row_Index</th>
</tr>
<tr>
<td class="tg-ehic">0</td>
<td class="tg-ehic">0</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">0</td>
</tr>
<tr>
<td class="tg-pf22">1</td>
<td class="tg-pf22">1</td>
<td class="tg-pf22">1</td>
<td class="tg-pf22">1</td>
<td class="tg-pf22">1</td>
<td class="tg-pf22">1</td>
</tr>
<tr>
<td class="tg-ehic">0</td>
<td class="tg-ehic">0</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">2</td>
</tr>
<tr>
<td class="tg-pf22">0</td>
<td class="tg-pf22">0</td>
<td class="tg-pf22">1</td>
<td class="tg-pf22">0</td>
<td class="tg-pf22">1</td>
<td class="tg-pf22">3</td>
</tr>
<tr>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">1</td>
<td class="tg-ehic">4</td>
</tr>
</table>
</div>
</center>
<!-- HTML: Binarize Data Table End-->
##### Transform data
Re-structure data using the pandas function `melt` to use it for plotting.
<br/>
<!-- Gist: Melt Data Start-->
<script src="https://gist.github.com/opendatavis/ba0490bfa635440d47b5863241791213.js"></script>
<!-- Gist: Melt Data End-->
<!-- HTML: Melt Data Table Start-->
<center>
<div>
<style type="text/css">
.tg {border-collapse:collapse;border-color:black;border-spacing:0;border-style:solid;border-width:1px;}
.tg td{border-style:solid;border-width:0px;font-family:Arial, sans-serif;font-size:14px;overflow:hidden;
padding:10px 5px;word-break:normal;}
.tg th{border-style:solid;border-width:0px;font-family:Arial, sans-serif;font-size:14px;font-weight:normal;
overflow:hidden;padding:10px 5px;word-break:normal;}
.tg .tg-zgm3{background-color:#efefef;border-color:inherit;color:rgb(33, 37, 41);text-align:right;vertical-align:top}
.tg .tg-706p{background-color:rgb(255, 255, 255);border-color:inherit;color:rgb(33, 37, 41);text-align:right;vertical-align:top}
.tg .tg-7d3y{background-color:rgb(255, 255, 255);border-color:inherit;color:rgb(33, 37, 41);font-weight:bold;text-align:right;
vertical-align:top}
.tg .tg-6ic8{border-color:inherit;font-weight:bold;text-align:right;vertical-align:top}
</style>
<table class="tg">
<tr>
<th class="tg-7d3y">Row_Index</th>
<th class="tg-7d3y">Miss_Col</th>
<th class="tg-6ic8">Miss_Val</th>
</tr>
<tr>
<td class="tg-zgm3">0</td>
<td class="tg-zgm3">NonD</td>
<td class="tg-zgm3">0</td>
</tr>
<tr>
<td class="tg-706p">1</td>
<td class="tg-706p">NonD</td>
<td class="tg-706p">1</td>
</tr>
<tr>
<td class="tg-zgm3">2</td>
<td class="tg-zgm3">NonD</td>
<td class="tg-zgm3">0</td>
</tr>
<tr>
<td class="tg-706p">3</td>
<td class="tg-706p">NonD</td>
<td class="tg-706p">0</td>
</tr>
<tr>
<td class="tg-zgm3">4</td>
<td class="tg-zgm3">NonD</td>
<td class="tg-zgm3">1</td>
</tr>
<tr>
<td class="tg-706p">5</td>
<td class="tg-706p">NonD</td>
<td class="tg-706p">1</td>
</tr>
<tr>
<td class="tg-zgm3">6</td>
<td class="tg-zgm3">NonD</td>
<td class="tg-zgm3">1</td>
</tr>
<tr>
<td class="tg-706p">7</td>
<td class="tg-706p">NonD</td>
<td class="tg-706p">1</td>
</tr>
<tr>
<td class="tg-zgm3">8</td>
<td class="tg-zgm3">NonD</td>
<td class="tg-zgm3">1</td>
</tr>
<tr>
<td class="tg-706p">9</td>
<td class="tg-706p">NonD</td>
<td class="tg-706p">1</td>
</tr>
</table>
</div>
</center>
<!-- HTML: Melt Data Table End-->
##### Plot - Heat map
Plot the data as Heat map to visualise the pattern of missing and non-missing values.
<br/>
<!-- Gist: Plot Heat map Start-->
<script src="https://gist.github.com/opendatavis/48b37ed6e3140c6202daea7e90d25668.js"></script>
<!-- Gist: Plot Heat map End-->
<!-- Plotly: java script Start-->
<script src="https://cdn.plot.ly/plotly-latest.min.js"></script>
<!-- Plotly: java script End-->
<br/>
Here you go...!!!
We have an interactive plot with row index on x-axis and columns on y-axis. We can hover over the plot to see the column, row index and the missing index which tells if the data is missing or not.
> Missing value of 0 indicates data is missing and 1 indicates data as not.
<!-- HTML: Plotly chart Start-->
<div>
<div id="22a38f36-3261-4c70-85b8-2232355aab3c" class="plotly-graph-div" style="height:100%; width:100%;"></div>
<script type="text/javascript">
window.PLOTLYENV=window.PLOTLYENV || {};
if (document.getElementById("22a38f36-3261-4c70-85b8-2232355aab3c")) {
Plotly.newPlot(
'22a38f36-3261-4c70-85b8-2232355aab3c',
[{"colorbar": {"title": {"text": "Missing<br>(0=Yes, 1=No)<br>"}}, "colorscale": [[0.0, "rgb(0, 0, 0)"], [0.09090909090909091, "rgb(16, 16, 16)"], [0.18181818181818182, "rgb(38, 38, 38)"], [0.2727272727272727, "rgb(59, 59, 59)"], [0.36363636363636365, "rgb(81, 80, 80)"], [0.45454545454545453, "rgb(102, 101, 101)"], [0.5454545454545454, "rgb(124, 123, 122)"], [0.6363636363636364, "rgb(146, 146, 145)"], [0.7272727272727273, "rgb(171, 171, 170)"], [0.8181818181818182, "rgb(197, 197, 195)"], [0.9090909090909091, "rgb(224, 224, 223)"], [1.0, "rgb(254, 254, 253)"]], "hovertemplate": "Row Index: %{x}<br>Column: %{y}<br>Missing: %{z}<br><extra></extra>", "reversescale": true, "showscale": true, "type": "heatmap", "x": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61], "y": ["NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "NonD", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Dream", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Sleep", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Span", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest", "Gest"], "z": [0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]}],
{"font": {"color": "#000000", "family": "Segoe UI", "size": 12}, "images": [{"sizex": 0.2, "sizey": 0.2, "source": "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAABmgAAAJwBAMAAAB/nfMOAAAAMFBMVEX////zNTX90tL1W1v4hIT7rq4GBgYHBwcICAgJCQkKCgoLCwsMDAwNDQ0ODg4PDw/FTXOiAAAcSUlEQVR4nO3dQYOiuBaGYbWr9nrt2UtN115v9+xhumsvc3v+/1+5pRIgyTmBg1BS+j6LmS4IIUA+AcW4WAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8JFWv78fNpvvv/65dUOAz2H1v42zPd66McAn8HzYtPz31s3p6XkT2H5/242+lrKqe9RKs6rFe3m22yBt8XqL81FbBQM/M5vNX7duUD9RaE5+7EZeyySh+VK1di3OdRv2VVuc0NzcKsjMZznXiKHZbP4edy2ThOapausfybn/0RYnNDdXxB3veOs29aGEZuTUTBKa1SZV6zJ5HloQmtv7U+h343aRiWih2eRjrmWS0KTvWrKu7SA0N7baSD7DBZoamu1uxLVME5qiauouNfOoLU1obqyUO97u1u3qpoZGv4MeYJrQuL2eSzMP1Ux1aUJzW1rPU29C50MPjfZW7hDThGZZNXQtzEvf8JwQmtvKtH63u3XLOiVCM+IF2jShSb1B5rZLfmvthNDclHxHczL/u5pEaEY8UU4TmlQw0h/inBCam/qy0cz/DbRUaMY71UwTGtfvpWqX1bx918KE5jYOer/Lb922LqnQjHdXM1Fo3I7X15j4sOzzHKN71O53by+L1evP5m/9knomkqEZrZNPFJpEMopq1k5dmNDcUlbv/q+7y5RvTb+7act6SIZmk4+0lolC4/b8Pp7VHXtCc0vuRa11D/Dnpzkiz2G/W/0+NKEZ662AiUKj3+2792YSHzZ9mkN0j1bS3q+DNPePaqLQvGt9L2iktUwUGv09587HNQnNTdXvnbXvX+qrnrm/fyaFxvXxzWgPnU4UGv180v2OM6G5pUzsYHW/292mVX09S72r+Z7DSCfKiULj3j6L63UHJdeXJTQ35DqY/0bZ0yc5JOKZpmn9SA+gTRWaQntlKrUZjV/OcexWoUt9S5P7012WZn5TI4emuSfbjbKWqUKjnlDc3h97hRhF/aIcTF+O+1o9FSU09Y1aPspapgrNUm59fe01853/sNxxCz/GrN8KuEmrehPvaRbNS3U4fZipQvOktLL7cU3ckrt63oczXLc7fnybDJQzTX3hM063myo0Wji0MGEe1Gy4NOUf3iQLLTSu243Tz6cKjfbBv3rZhllQO5c7cOuPb5OBFpr6HdndGGuZLDRF1cpgsjtPHkdfIUagXz2nRxiaC+2epu6O+RhrmSw07nS+8ycrWcI86FfPPR5/evf687DZ/ug5+PPrr+/vPe+HaQjM5/cVbPRRM9UzTfcVzur3z/fm9Bq6ekhoelXvWpn7kw/jh/T1PE73loG6R6ActRPlyLU70LN7Sewz+PO3qsJNcgjMoH/+7FiBGpqup7dem9ZsttooactNSq5uRM/qm7fG/ea71yv5JF/4rVgnWlFrP8W6nWDc3seSVXvyGM+qum946dDq1e2hbLtG51u1vqWTKt6q/n2hVgfJxeJqaNIdLxyE130pIrDcpMgtMlTfNP8/PaY6pV/3Wm2F2pxEitGDOwLCrKyadRSX2IZD2ebJ9bS7/5k2/EBT/SJ4UT1KxdV7muQlzv82IflMtozK9drivtVr0ZbPP06wJ9daK2rfNhE1xeih0LuW6zG5P7mslwiO3jGxmigzamqa6sNxP8WbK/VMk7iZFhqjDCiwFAo28t7bqo9XcGhtbrRaeQWlX/NarrghjZ7Kj6lc46B3SHdXsPcnu2MWHYzUOBZSP8rFknX18Sg5e6G4HpqsmhO1KrxY2ei7YCmWTG+AofqFEm23D6Kme4tU1nLFtaeN7NixHFTVHkwNvbX2J1dHdBt/0Vh/tlN8sZP7hKt+EQ/HJp0O9dAslc6hdGrx1LdUil7kUvst1S+Ua+Cimigu4faQs5ZLOfHPQVQ41wzlXsyl/q7Mc8esCI+C/uKlfJFfvEevqt9KS+V61etozhd5IbUTSSFeqmWV5tiq11pZTes4Oalb7inV9ow62vUj0fvcQjsL6UdB/Ry0UMrnQtmq+q007qdQv36mUa4uD3rz41eOpV5Yab6p+oX8OVnqlWxhPNNoF2fCnkFPSs+6qOYFXbWUj8DZMbmSiPRS6qoX+19cXA+N8nog1FrbhXUsE4XNoRFPNVJAOh7XLPxalVJyYc8xuSQ07vjk0syqAwRdu0wcBvm1Ue9Iwmqr6rdi1OLyemhcd1z7k7NE86NKlonC8k4zVX9SzWvvZOXC0in9WtdyqYvkCFepBaFzx+cozSzi47lIh0b8UCRxhSCcakpXUyaUj0OZuL6Ul9HH4BWas0wUlju1qfqTwm1vvNajVN52pskSzZn3Q4Uzljw+wvFcpEMjvpgWifLxeku3UmmxuNvpZxrl6lIf7X0TX0AtU4U3ubCxpupb29ue5yYJpduzK2ul2Nkh0ZrkgtC5XrGTZlZHxxIa4dUr2Y3iU4erXl4sKp4IzUFuUqof5cru6VfaXH17FceoCu1xzcKvdK0UO0lenR0TCyLBHbKdNLOsZspTz8f1bbdYtZ9NFF4dl625P/7ZLV5+J8tX1W+fmhX8bopH7ewOTXh2yprW/Puy8IeuDjPcbnssl3aapfoT4a2Yaop2+VT6rVgrxU5aF4vbt5fd+5SX33V7EsshJUvtQHlm65j9VU1qPWuVR7UcmuN27FG+qn67PP23ekTqWS+euKcpLnPC0LiO1Dzr2zybpX0NwjVKmX1N9fEGKO9gdC8Yy+pVtx7RXF12P7c0Q/UKzc6bWgoHopkWvZg2l1mtD9P+1Mu7/lm2l6hfMfdh8cSZRgnNpUHelxM6xxM1hMZcfTWv6cPJjwHCFaVDU7g1H73J56cWUsshxfV2cWZHaNrPhRzcxOjFtO7v3mMbdWqifuSqPx3vPKp/HRZPhEbr6ae6gmfj3ZZqX442hMZc/SHcccl3NBt9zjRut4WP8JyeKe2oHqpkb1gmQ+PFo3lb2S/cyljuTS7c5KNW3ruAyOJJFwNCk8UrrU+H4YyOqiTW6t0GtytQEyZUuk6U2YR11wsXcx+ke8auCE3uTa1D4E9uXuyCU1B9ybKXWxR0MXXAgsTrrbZtT/ob3VHrO6qSWKuPMtJzZX3ONNpee0/NX/E09DM8NMEi9alm70+vw3GU1xwd0CY07TnqgAUDzjSrsCmLrq99mUJjrT76/P+gbGq4nu7Q9HxLATajhUYZR73uElEX0AYma0KzF6qPGjogNJKOm29LVdbqo3nV312DaPc40xCaSYwXmkxOh5u8j2o/iLW3QuNNLqYNTaIaa1XW6sNHNvtcdrWXS5WrivDu8qhcFxVnJkMTLqIMpF6KdZy4OOXyAsGRLpSGDrinkXT0wGtDk6z+4G9v8hnaFsM9zdx/ZOiTGR6aqAPJB+igdjflOr8OzV6cHNYy0pnmlqEp/MrlvW6ss+L2JaeaMSVDk5lCUx37Td6emBhISRmnqA7NUWyLVste3bbZhybYNG1LQ5bPaRh9ZkzJI2QLjSudtyemjqw7nv7UOjT9Gtr9RIDe01f/nkb8PA+C+TJBaPpWv6xmHr1md/40jemJgM32zdR2JPQKjT+1VBYRf1s19bbRQeyJrnrlDYVdUIn92TOn/SRlTaim1ShLaPpXH9zEVLul84rK9uwZA2uOZ3hohM8ML7zLrdR3shyx+rDTaA21P3tWLVeIbVmLhdVtVlmq93t/77eJ+xQMdr8+JDYMltXu3EkzXf8Vp8afGValvdAsN938dbuVrv3aM6Wh9q8GnLW+beBZS4XtobFV7+24jje/G33ONPH3abZvDIB+raXSF8/krqJ2oKoq7xSx3HQ7StWHnSarJocrtX8J7SQeNzbdA9VtlhmrLy4zL+nu+bhmz1PSQWgEtzdXWqYOUSF2Fdero+JSJ8023fZi9blfuatoF6y0e4wAITTlRiNU01qgZ2is1Xu1L6uinWvp9SFoFrbgsiYGQL9GcuCT4jJPfnsr7kAHobjefxp7qfowxu7ohyvtHiMgfhxFPRGMExpz9ctq7s60ql5nGu37zrwFfYXhQzjFR7UQipd6B1J6klti51eeyZPtQzilx8+LCndss8BevXdFVu3F7o8j+z1uUygteexBaX/3/Rky0fDBAscLjX8qcEvs/MqzanK4UvNggamBY8cIzYDqvW0Qd4q4onSTg7ojjzwobSl2mN6uGJY2Kl4IPcsVTpFDE1SeVZN3vTdAez3INgnifjCFZkD17e7v/h22Otbzwc4yakSl89PTu/Xc91gqUi9Xyjy1AxXCwVAPWYt/JnNLBJVn8uTEmUa5XUuOanR9aAZVf2h2RN/HNXt/oCP+Ws6Z9rNad69Uekxv1Q4c8FMbUfnq6Ewbmp3SyH3UnGU15yhXJFtH1aS3OTKo+taec1EPtzPW+ysEB6013eu4T1K3Mzk0xyukvOipHagQqiqTfUhqvVJ9VhUOV6qHxq16501NDl14fWiGVd/aOG079VUpdbYKFkprHvRU89z3YKoOeg3Lat/m/mTXGbWqvNC4PpDiB7aUG+Qq2gXT9ddb11X8qe0HS7Zv/7ycpr281uMXxtWkGhUbVn3r9FJK+0TU90yzUB9QeNCxNdzJYHgNpV6D0k/VDlT1DPOHm6bQhCvVzzRyzyiaLtN+13GsrwYMq751Tq92YvebZ6bvMq/kz47yHoveH7e3d4NryPQaSrmfqh2oKm5+jEYMzdX3NM9i7c3lk//x3kihGVh96y2zdME2w5nmtApvMGDTovfm+tC4Xp3Hsw5yT9E6UPKBzf4NVKp3oQmLq6ERH7puPnkMrn9GCs3A6pu3Y9zm5F1rGjBqxkuUm8d81/n60IjfgjnTRk0qO7qv+NWA/g3sCE1Ykfp6m4kzltXU8KO9kUIzsPrmMQB3QI9da7Keaap2+Ll5zJua60Pjdn38BpzydWS1AyW/hJb3blBHaLRW7sMZhbjmUulpHT2wb2gGVt/U71LXtaLF4PGZvN942NmWvQ/Xh8bt+rg/LJWDonUg1633UvVhJTrX75Tad8F0LTTKSLBFRzVKO6Vt/iI8vjSw+iYrmXY0YkPONGffmtgcrcveg+tDow0/pj6jr4ZGLl9N7P9JklK9C01YXAuNMqKU1hz9KrXdKK+yTPgC8cDqm6uyov/uGj4SYPPBTW5e9g6MEBrXH/bhDC1NUgc62YjlD0rEutpz7T2Na2VwR1ZNjd7RzZRqgtqiaUFsBlbf3P8f+gdh8Jmm9ZDA3r7s5zdCaNzxDA90/RBVuIDSqzsGCzz2bU9HaMLi2pnGtcbfLPVxSNeL1nKj3Np3rWlFvGFDq2/SZujM14w5mxnWc3dGCI27cgh76bKaHr0t2dGrg/KumrW0bqnZLmVK9eEiSmiUX4HSenX9CiE2U36OTWjQ0OqbpymE9Wh6nWlWO3Fyz9+Nuk8jhKa+Y8796QftmCihceWDy3FtnPOTL1HdevUuNGFxJTSuNcqTZ+GKXe1docnjFY9RffSM3k4r12NlfsOVsXgIzXVvHcq9vX5xzMPy7vjKLQmPoZbJ06yDlKSO0OyC6fLrbfPza3JrgkY2GQtnBPWt40ljVB8+bmQas12t86SU31MgNFeGxoXAr0Se2p6Te1MLLRyuw8QveaV4GdIRmrC4ePibp+GDOzVllNzmJ0DXcYNOhN+UKoXNGlp9OEBZr0/qe51plMo6fo7nvo0Rmvp4tTvYs378XGi8bq3/fKDr7dEB+jPu0+3qlWrC6sXQuDriCEttb39xbB036KQ+X+7CKX4+BlYfDizQ43FNw7hnwiAabm/mfVZ0b8YITXNMj83EQj9+dY9s/wBdXV798abwtPIt7l3t6q8509Qt1N8Xz1vT2t/SWscN8parV+POHv8Ri1mrD76HoxaTFkkVXl725U5b27HPiu7NGKFprribndtcUORR8aZL/leYFodsE1e/qDKTqH7wPY33eFV0Qe/mtbLtfbNxHS5QKYJtqLvdfpTqg1H9crVYS58zjTsuwThnbmt4jGawrD5Y7kT+rTl+cfGymenONa1va+SJ8s2wQfX3O+Lb1Kq49Uwji1pTN6ZeceuhkkQPzILl6m539IoNrT4YammnFouKJrZ10XrB+tp65qd5IIAHNq+u5LQX314Wq/Z49x3DU54eJFl1PALYvlz/8c/u9E3Gn4nyrvpgcqaUT4Ym7hRZM+/fU1P+Lfwl1so+am7U37tfe4vHqT54+0wtdVZuRHlcsr1ztm+nfe/vfL4aMNxho8rj0soxu5De4ExUL7x/U1U/ypkmvlbs+hWDtbKLtO/+Kz/La63e/7ZeR18u5LrzdKWSXm843J1xQpOpezXxQYpsb6p+Y3/gINzSZGjCwl1Xc90f2Xds7+DqvfNxx+OapVx3HpcsOpojLPIAxgmNPoSK9FKkHLMzcdjG5Agt2sPSY5xppNYf5KLu+ZW1to8yeblwe4dW722HXuqskNeRxyUT++YsvZ57NU5oFqW2V6V61cIb7XyfJZbYa9UrdYQtSoXG0Pq/q/+vtV0kr0c7T5qr9zp4tE96rSOPCqZGlT55zKuzsUKj9TzxOkE5ZmdHsfrEqSa+/ivlGVm1QN+mb5RhveSOtO3+0KOQltuPVn27/qNeSm1JapQHTcd67tVIoVmU8l4Vq1XKnmgX4/r9ca5Vf/09jfx+qjze5L67V0vbEK9icPVuu0/0QmHJtjwu+Sy2xrnr30l//an+VGIUmtXvH8cBq5DPBfIIjNUx2wrHTl110f+4ueqDyVm1RFhcD43SmEwouu3z8fqh1w4aXP2yVTxN2Zm5UDT5xsSxYz2f2WnDtTcho9AUA3fGn8JOVX6MoazmxkHTr5GVgyetoar+6nsa7ce+pNeHvE+vjk81UvNHqL7rDFAKq9gob4VZr17vRXHawr08LwzNec8P+siq6HkUWqeCsBelfvFEvtaX1lBX78uqRcLiWq/Qu0QWlf2j34Nc0S6Smj+4+mZDuu7Po3YkWqNfod31B5tPqU0MQ3PZQ8cBq4kvxrVuV1bzo6OXp+qXTmXiyaCq/sp7mtSPSoZbetq3fUIT7iLljDCw+uYUtU+04aTciHKl3kIsfd+/6ZTJneUiCM1z95FXhb3vL61gdcy2YS/q+PHTb5uQvEBTvafaDf3ONF+Phi09P3DX68spT/FyI1Zf78w81YaF8UyzkPb83f/mZpnaJUFoqgumYW+L+CdyNTOuQade3U5N5w8GP3n1qx27VX1b5m9p0+qwO2y/v710tMTb0suG9hulop0avdsNrL5wi6gVV8pwky9ydYHVz7CsfnTvQ3UE9uLMIDTL6ngOW1Nr33pD3geqY3bu1fW5v8/vnraHrr/tj3I3W2psx3Pds1PdbnD1k/FjM+gN1k/lkHqNGjU0pzesv78v/v1X8qdv3Qvd5a/Xn4fNtu9v5a5+v5d+L/52zW/rjuL113tDvg/4jd/T9m6+q58BXFv9dF5/fT+16f3g7m7dlOkNCM20X5MoP2IlwBUIDWBEaACjuYbmQZ8rx2cw19BwpsFsERrAiNAARnMNDfc0mK25hoYzDWaL0ABGhAYwmmtouKfBbM01NJxpMFuEBjAiNIDRXEPDPQ1ma66h4UyD2SI0gBGhAYzmGhruaTBbcw0NZxrMFqEBjKLQ/O/wY+f+3RGab4cf+egNIjSYuzA0pz5bD2yWDs1Ta9Z4uKfB3AWhuQzDmld/pUNTnP4Y/TfiONNg7oLQZOe/3GjNydA8TXNGIDSYuyA0hZeEZGiqv/KPbC0wA0Fo/JQkQ1OdEvYf2lzg9vzQuN9sOF7+TIam8OMGPAo5NPnlzz6hedBfi8cDIzSAEaEBjAgNYERoACNCAxgRGsCI0ABGhAYwIjSAEaEBjAgNYERoACNCAxgRGsCI0ABGhAYwIjSAEaEBjAgNYERoACNCAxgRGqDbt8P27/oPQgN0Oo9xfnR/ERqgU3nq6m6Ic0IDdFp5OSA0QKcvl76+r/4kNECXzEsJoQE6ZX5fJzRAl/LS1907AYQG6EJoACNCAxgRGsCI0ABGhAYwIjSAEaEBjAgNYERoACNCAxgRGsCI0ABGhAZQvVT8qZOG5gWw2o3f9Yd6ruLw3smP7ekThqZZJdBfMzbSrR2aRm13renlZdoUoWmtEujvOE0EzL60G7VuzSgvkyYIjbdKoLevU6XAqGg3atuaUV4mTRCacpo9ivt3nCoGNn6jds2M8jJlgtBMtENx//ZTxcDk2W9U3swpL1PGD02wSqC3eXxu8eQ3at/MKS9Txg9NsEqgt3rA15sKbsrXzZzSb+bBK3BNaHgfAEMRGsBoHqHh8gyfyDxCwxsB+ETm8UYAbznjE9lPFQObst2mr/EMPtzEfOymioGNd4exb80oL5MmCA03NRhmLo/RLMqmTVth+hQPbLZWCfSXT5KAAVY/XZM+7KsBzSqB/ubz1QBNeWko39wE+iI0gBGhAYwIDWBEaAAjQgMYERrAiNAARoQGMCI0gBGhAYwIDWBEaAAjQgMYERrAKPP7OqEBuiy9lBAaoNOTFwtCA3RaeTkgNEC3zOvqhAbotDq0f1CQ0ADdnn/92tV/EBrAiNAARoQGMCI0gBGhAYwIDWBEaAAjQgMYERrAiNAARoQGMCI0gBGhAYwIDWBEaAAjQgMYERrAiNAARoQGMCI0gBGhAYwIDWBEaAAjQgMY+aFZVCk5Xv5Khqb0lwQeRRCag5eSZGiyy1/7D20ucHtBaIp2LNKhWXonJeBhBKH54t2nJEPz7OULeBhBaFbe2UMOzddqbsnVGR5SEJrzqaZ+Qyx5pjmfajjR4PGEoVm8/nyr/50OzeL519vug5oJzEcUmraO0AAPidAARoQGMCI0gBGhAYwIDWBEaAAjQgMYERrAiNAARoQGMCI0gBGhAYwIDWBEaAAjQgMYERrAiNAARoQGMCI0gBGhAYwIDWA0IDRfxbLAoyguQdiLMwkNECsvQcjFmUFoqj//+Ki2AbOUebEIBKF5Tl3KAY/iKXXFFYSmugE6flDTgJkq9FuaKDRfuKUBLsHQchCG5pyw44c0C5ix15/q2P9RaFa/fxw/ok3AZxWFBkAaoQGMCA1gRGgAI0IDGBEawIjQAEaEBjAiNIARoQGMCA1gRGgAI0IDGBEawIjQAEaEBjAiNIARoQGMCA1gRGgAI0IDGBEawIjQAEYuNLduB/BprC6Z4VecgN4uoeG3NYDeynNo9rduBvB5PHN1BhiVnGgAo9+//rl1EwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQ/wfzuVVzPYoZNUAAAAASUVORK5CYII=", "x": 1.15, "xanchor": "right", "xref": "paper", "y": 1.05, "yanchor": "bottom", "yref": "paper"}], "template": {"data": {"bar": [{"error_x": {"color": "#2a3f5f"}, "error_y": {"color": "#2a3f5f"}, "marker": {"line": {"color": "#E5ECF6", "width": 0.5}}, "type": "bar"}], "barpolar": [{"marker": {"line": {"color": "#E5ECF6", "width": 0.5}}, "type": "barpolar"}], "carpet": [{"aaxis": {"endlinecolor": "#2a3f5f", "gridcolor": "white", "linecolor": "white", "minorgridcolor": "white", "startlinecolor": "#2a3f5f"}, "baxis": {"endlinecolor": "#2a3f5f", "gridcolor": "white", "linecolor": "white", "minorgridcolor": "white", "startlinecolor": "#2a3f5f"}, "type": "carpet"}], "choropleth": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "type": "choropleth"}], "contour": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "colorscale": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "type": "contour"}], "contourcarpet": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "type": "contourcarpet"}], "heatmap": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "colorscale": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "type": "heatmap"}], "heatmapgl": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "colorscale": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "type": "heatmapgl"}], "histogram": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "histogram"}], "histogram2d": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "colorscale": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "type": "histogram2d"}], "histogram2dcontour": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "colorscale": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "type": "histogram2dcontour"}], "mesh3d": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "type": "mesh3d"}], "parcoords": [{"line": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "parcoords"}], "pie": [{"automargin": true, "type": "pie"}], "scatter": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scatter"}], "scatter3d": [{"line": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scatter3d"}], "scattercarpet": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scattercarpet"}], "scattergeo": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scattergeo"}], "scattergl": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scattergl"}], "scattermapbox": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scattermapbox"}], "scatterpolar": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scatterpolar"}], "scatterpolargl": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scatterpolargl"}], "scatterternary": [{"marker": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "type": "scatterternary"}], "surface": [{"colorbar": {"outlinewidth": 0, "ticks": ""}, "colorscale": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "type": "surface"}], "table": [{"cells": {"fill": {"color": "#EBF0F8"}, "line": {"color": "white"}}, "header": {"fill": {"color": "#C8D4E3"}, "line": {"color": "white"}}, "type": "table"}]}, "layout": {"annotationdefaults": {"arrowcolor": "#2a3f5f", "arrowhead": 0, "arrowwidth": 1}, "coloraxis": {"colorbar": {"outlinewidth": 0, "ticks": ""}}, "colorscale": {"diverging": [[0, "#8e0152"], [0.1, "#c51b7d"], [0.2, "#de77ae"], [0.3, "#f1b6da"], [0.4, "#fde0ef"], [0.5, "#f7f7f7"], [0.6, "#e6f5d0"], [0.7, "#b8e186"], [0.8, "#7fbc41"], [0.9, "#4d9221"], [1, "#276419"]], "sequential": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]], "sequentialminus": [[0.0, "#0d0887"], [0.1111111111111111, "#46039f"], [0.2222222222222222, "#7201a8"], [0.3333333333333333, "#9c179e"], [0.4444444444444444, "#bd3786"], [0.5555555555555556, "#d8576b"], [0.6666666666666666, "#ed7953"], [0.7777777777777778, "#fb9f3a"], [0.8888888888888888, "#fdca26"], [1.0, "#f0f921"]]}, "colorway": ["#636efa", "#EF553B", "#00cc96", "#ab63fa", "#FFA15A", "#19d3f3", "#FF6692", "#B6E880", "#FF97FF", "#FECB52"], "font": {"color": "#2a3f5f"}, "geo": {"bgcolor": "white", "lakecolor": "white", "landcolor": "#E5ECF6", "showlakes": true, "showland": true, "subunitcolor": "white"}, "hoverlabel": {"align": "left"}, "hovermode": "closest", "mapbox": {"style": "light"}, "paper_bgcolor": "white", "plot_bgcolor": "#E5ECF6", "polar": {"angularaxis": {"gridcolor": "white", "linecolor": "white", "ticks": ""}, "bgcolor": "#E5ECF6", "radialaxis": {"gridcolor": "white", "linecolor": "white", "ticks": ""}}, "scene": {"xaxis": {"backgroundcolor": "#E5ECF6", "gridcolor": "white", "gridwidth": 2, "linecolor": "white", "showbackground": true, "ticks": "", "zerolinecolor": "white"}, "yaxis": {"backgroundcolor": "#E5ECF6", "gridcolor": "white", "gridwidth": 2, "linecolor": "white", "showbackground": true, "ticks": "", "zerolinecolor": "white"}, "zaxis": {"backgroundcolor": "#E5ECF6", "gridcolor": "white", "gridwidth": 2, "linecolor": "white", "showbackground": true, "ticks": "", "zerolinecolor": "white"}}, "shapedefaults": {"line": {"color": "#2a3f5f"}}, "ternary": {"aaxis": {"gridcolor": "white", "linecolor": "white", "ticks": ""}, "baxis": {"gridcolor": "white", "linecolor": "white", "ticks": ""}, "bgcolor": "#E5ECF6", "caxis": {"gridcolor": "white", "linecolor": "white", "ticks": ""}}, "title": {"x": 0.05}, "xaxis": {"automargin": true, "gridcolor": "white", "linecolor": "white", "ticks": "", "title": {"standoff": 15}, "zerolinecolor": "white", "zerolinewidth": 2}, "yaxis": {"automargin": true, "gridcolor": "white", "linecolor": "white", "ticks": "", "title": {"standoff": 15}, "zerolinecolor": "white", "zerolinewidth": 2}}}, "title": {"text": "Missing Data Visualisation", "x": 0.5, "xanchor": "center", "y": 0.9, "yanchor": "top"}, "xaxis": {"linecolor": "black", "linewidth": 1, "showline": true, "title": {"text": "Row Index"}}, "yaxis": {"linecolor": "black", "linewidth": 1, "showline": true, "title": {"text": "Missing Columns"}}},
{"responsive": true}
)
};
</script>
</div>
<!-- HTML: Plotly chart End-->
This is an interactive plot. It has options to zoom, pan, save as image. We can also use lasso selection from point to point to zoom to specific area.
This is inspired from a post by fellow Kaggler [AiO](https://www.kaggle.com/notaapple) in which he created a function to Visualize missing data in R. It is very simple yet quick and powerful.
Here, I have recreated it in Python. | 109.425068 | 17,746 | 0.627904 | yue_Hant | 0.22262 |
989b901cd5fe6c7eddafca939a014a4db4aa28ee | 1,453 | md | Markdown | docs/redis/api.md | enchance/limeutils | 69053d34d9924668b975df1f72f21a6e2ac45b84 | [
"MIT"
] | null | null | null | docs/redis/api.md | enchance/limeutils | 69053d34d9924668b975df1f72f21a6e2ac45b84 | [
"MIT"
] | null | null | null | docs/redis/api.md | enchance/limeutils | 69053d34d9924668b975df1f72f21a6e2ac45b84 | [
"MIT"
] | null | null | null | Redis API
=========
**`formatkey(key)`**
: Create the key name in **prefix:version:key** format as it is saved in redis.
: *Returns*: `str`
: - `key`: `str` key name
**`get(key, **kwargs)`**
: Get the value of a key. To set the value of this key use **`set()`**.
: *Returns*: `string`, `int`, `float`, `byte`, `dict`, `list`, or `set`.
: - `key`: `str` key name
- `kwargs`: Choose from any of the custom keys below.
- `start=0`: Starting index for lists
- `end=-1`: Ending index for lists
- `only=`: For hashes only. Return the fields you need. List fields as a `list`.
**`set(key, val, **kwargs)`**
: Create or update a new key. To read this key use **`get()`**.
: *Returns*: Varied depending on the value you set.
: - `key`: `str` key name
- `val`: `string`, `int`, `float`, `byte`, `dict`, `list`, or `set`
- `kwargs`: Custom keys set below. Accepts all other keys set in the parent redis package.
- `clear=False`: Delete the key first instead of updating it (if `dict` or `list`)
- `insert=end`: For lists. Accepts the literal: `start` (for queue) or `end` (for stack).
- `ttl=-1`: Expiry in seconds. Set to -1 for a key with no expiry. Defaults to the value you
set when instantiating `Red()`. If no *ttl* value is set in `Red()` default is -1.
**`exists(*keys)`**
: Checks if keys exists. Returns the number of keys that exist *not* which of the keys exists.
: *Returns*: `int`
: - `*keys`: `str` key name | 41.514286 | 96 | 0.624226 | eng_Latn | 0.981331 |
989bbbcd3701ce0720dfc03cd41a3ea8c3eb34f9 | 336 | md | Markdown | README.md | praveen-nair/image2ascii | b210c7995d6ea588a6344deb92d3fd8008120679 | [
"MIT"
] | null | null | null | README.md | praveen-nair/image2ascii | b210c7995d6ea588a6344deb92d3fd8008120679 | [
"MIT"
] | null | null | null | README.md | praveen-nair/image2ascii | b210c7995d6ea588a6344deb92d3fd8008120679 | [
"MIT"
] | null | null | null | # image2ascii
Convert Image to ASCII\
\
Usage:\
image2ascii.py <image_filename> <ascii_filename> <character_set>\
Available characterset: asciishade_d2l_l02, asciishade_d2l_l04, asciishade_d2l_l09_v1, asciishade_d2l_l09_v2, asciishade_d2l_l10, asciishade_d2l_l70\
\
Example usage:\
image2ascii.py image.bmp ascii.txt asciishade_d2l_l10
| 33.6 | 149 | 0.842262 | grn_Latn | 0.161054 |
989d2014588e4a5b62ea8d60b805b55923277c7a | 1,393 | md | Markdown | docs/c-language/punctuation-and-special-characters.md | Erikarts/cpp-docs.es-es | 9fef104c507e48ec178a316218e1e581753a277c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/c-language/punctuation-and-special-characters.md | Erikarts/cpp-docs.es-es | 9fef104c507e48ec178a316218e1e581753a277c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/c-language/punctuation-and-special-characters.md | Erikarts/cpp-docs.es-es | 9fef104c507e48ec178a316218e1e581753a277c | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Caracteres especiales y de puntuación
ms.date: 11/04/2016
helpviewer_keywords:
- number sign
- characters, special
- punctuation
- '# preprocessor operator'
- special characters
ms.assetid: e239633e-36f6-4967-939c-bf2799323778
ms.openlocfilehash: 3594ca0f2dfcc294fa7a3d44268150ac5507e547
ms.sourcegitcommit: f4be868c0d1d78e550fba105d4d3c993743a1f4b
ms.translationtype: HT
ms.contentlocale: es-ES
ms.lasthandoff: 02/12/2019
ms.locfileid: "56149575"
---
# <a name="punctuation-and-special-characters"></a>Caracteres especiales y de puntuación
Los caracteres de puntuación y especiales del juego de caracteres de C tienen varias finalidades, desde organizar el texto del programa hasta definir las tareas que realiza el compilador o el programa compilado. No especifican que se deba realizar una operación. Algunos símbolos de puntuación también son operadores (vea [Operadores](../c-language/c-operators.md)). El compilador determina su uso a partir del contexto.
## <a name="syntax"></a>Sintaxis
`punctuator`: uno de **( ) [ ] { } \* , : = ; ... #**
Estos caracteres tienen significados especiales en C. Sus usos se describen en este libro. El signo de almohadilla (**#**) solo puede aparecer en [directivas de preprocesamiento](../preprocessor/preprocessor-directives.md).
## <a name="see-also"></a>Vea también
[Elementos de C](../c-language/elements-of-c.md)
| 44.935484 | 420 | 0.763101 | spa_Latn | 0.911004 |
989d3e5c06ffbea767734bdcd258e093c24db721 | 2,307 | md | Markdown | docs/framework/unmanaged-api/fusion/create-asm-name-obj-flags-enumeration.md | mtorreao/docs.pt-br | e080cd3335f777fcb1349fb28bf527e379c81e17 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/unmanaged-api/fusion/create-asm-name-obj-flags-enumeration.md | mtorreao/docs.pt-br | e080cd3335f777fcb1349fb28bf527e379c81e17 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/unmanaged-api/fusion/create-asm-name-obj-flags-enumeration.md | mtorreao/docs.pt-br | e080cd3335f777fcb1349fb28bf527e379c81e17 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Enumeração CREATE_ASM_NAME_OBJ_FLAGS
ms.date: 03/30/2017
api_name:
- CREATE_ASM_NAME_OBJ_FLAGS
api_location:
- fusion.dll
api_type:
- COM
f1_keywords:
- CREATE_ASM_NAME_OBJ_FLAGS
helpviewer_keywords:
- CREATE_ASM_NAME_OBJ_FLAGS enumeration [.NET Framework fusion]
ms.assetid: a5ed2fd0-c7d2-4603-aaca-5d0caad92675
topic_type:
- apiref
ms.openlocfilehash: 52d5ad3a18c102422e90621c7d1e23b2692c0000
ms.sourcegitcommit: d8020797a6657d0fbbdff362b80300815f682f94
ms.translationtype: MT
ms.contentlocale: pt-BR
ms.lasthandoff: 11/24/2020
ms.locfileid: "95683220"
---
# <a name="create_asm_name_obj_flags-enumeration"></a>Enumeração CREATE_ASM_NAME_OBJ_FLAGS
Especifica os atributos de um objeto de [interface IAssemblyName](iassemblyname-interface.md) quando ele é construído pela função [CreateAssemblyNameObject](createassemblynameobject-function.md) .
## <a name="syntax"></a>Sintaxe
```cpp
typedef enum {
CANOF_PARSE_DISPLAY_NAME = 0x1,
CANOF_SET_DEFAULT_VALUES = 0x2,
CANOF_VERIFY_FRIEND_ASSEMBLYNAME = 0x4,
CANOF_PARSE_FRIEND_DISPLAY_NAME =
CANOF_PARSE_DISPLAY_NAME | CANOF_VERIFY_FRIEND_ASSEMBLYNAME
} CREATE_ASM_NAME_OBJ_FLAGS;
```
## <a name="members"></a>Membros
|Membro|DESCRIÇÃO|
|------------|-----------------|
|`CANOF_PARSE_DISPLAY_NAME`|Indica que o parâmetro passado é uma identidade textual.|
|`CANOF_SET_DEFAULT_VALUES`|Define alguns valores padrão.|
|`CANOF_VERIFY_FRIEND_ASSEMBLYNAME`|Verifica a regra do assembly Friend (somente nome e chave pública). Este membro é somente para uso interno.|
|`CANOF_PARSE_FRIEND_DISPLAY_NAME`|Uma combinação dos `CANOF_PARSE_DISPLAY_NAME` sinalizadores e `CANOF_VERIFY_FRIEND_ASSEMBLYNAME` . Este membro é somente para uso interno.|
## <a name="requirements"></a>Requisitos
**Plataformas:** confira [Requisitos do sistema](../../get-started/system-requirements.md).
**Cabeçalho:** Fusion. h
**.NET Framework versões:**[!INCLUDE[net_current_v20plus](../../../../includes/net-current-v20plus-md.md)]
## <a name="see-also"></a>Confira também
- [Interface IAssemblyName](iassemblyname-interface.md)
- [Função CreateAssemblyNameObject](createassemblynameobject-function.md)
- [Enumerações Fusion](fusion-enumerations.md)
| 36.046875 | 198 | 0.752059 | yue_Hant | 0.810837 |
989d4296e9e21ea2c92c97bd4a26f492022ee356 | 12,716 | md | Markdown | articles/service-fabric/service-fabric-quickstart-containers-linux.md | pmsousa/azure-docs.pt-pt | bc487beff48df00493484663c200e44d4b24cb18 | [
"CC-BY-4.0",
"MIT"
] | 15 | 2017-08-28T07:46:17.000Z | 2022-02-03T12:49:15.000Z | articles/service-fabric/service-fabric-quickstart-containers-linux.md | pmsousa/azure-docs.pt-pt | bc487beff48df00493484663c200e44d4b24cb18 | [
"CC-BY-4.0",
"MIT"
] | 407 | 2018-06-14T16:12:48.000Z | 2021-06-02T16:08:13.000Z | articles/service-fabric/service-fabric-quickstart-containers-linux.md | pmsousa/azure-docs.pt-pt | bc487beff48df00493484663c200e44d4b24cb18 | [
"CC-BY-4.0",
"MIT"
] | 17 | 2017-10-04T22:53:31.000Z | 2022-03-10T16:41:59.000Z | ---
title: Criar uma aplicação de recipiente Linux no Tecido de Serviço em Azure
description: Neste início rápido, irá criar uma imagem do Docker com a sua aplicação, enviá-la para um registo de contentor e, em seguida, implementar o contentor para um cluster do Service Fabric.
ms.topic: quickstart
ms.date: 07/22/2019
ms.custom: mvc, devx-track-azurecli
ms.openlocfilehash: f58b8feda0e88d8a5e7cddaabbc650b0f0ab3973
ms.sourcegitcommit: f28ebb95ae9aaaff3f87d8388a09b41e0b3445b5
ms.translationtype: MT
ms.contentlocale: pt-PT
ms.lasthandoff: 03/29/2021
ms.locfileid: "98788167"
---
# <a name="quickstart-deploy-linux-containers-to-service-fabric"></a>Início rápido: Implementar contentores do Linux no Service Fabric
O Azure Service Fabric é uma plataforma de sistemas distribuídos par implementar e gerir microsserviços e contentores dimensionáveis e fiáveis.
Este quickstart mostra como colocar os recipientes Linux num cluster de tecido de serviço em Azure. Quando tiver terminado, terá uma aplicação de voto constituída por um front-end da Web Python e um back-end Redis em execução num cluster do Service Fabric. Também irá aprender a efetuar a ativação pós-falha de uma aplicação e a dimensionar uma aplicação no seu cluster.
![Página Web da aplicação de Voto][quickstartpic]
## <a name="prerequisites"></a>Pré-requisitos
Para concluir este guia de início rápido:
1. Crie uma [conta Azure gratuita](https://azure.microsoft.com/free/) antes de começar se não tiver uma subscrição.
2. Instale o [Azure CLI](/cli/azure/install-azure-cli-apt)
3. Instalar o [Service Fabric SDK e o CLI](service-fabric-get-started-linux.md#installation-methods)
4. Instalar [Git](https://git-scm.com/)
## <a name="get-the-application-package"></a>Obter o pacote de aplicação
Para implementar contentores no Service Fabric, precisa de um conjunto de ficheiros de manifesto (a definição da aplicação), que descrevem os contentores individuais e a aplicação.
Numa consola, utilize git para clonar uma cópia da definição de aplicação; em seguida, mude os diretórios para o `Voting` diretório no seu clone.
```bash
git clone https://github.com/Azure-Samples/service-fabric-containers.git
cd service-fabric-containers/Linux/container-tutorial/Voting
```
## <a name="create-a-service-fabric-cluster"></a>Criar um cluster do Service Fabric
Para implementar a aplicação no Azure, precisa de um cluster do Service Fabric para executar a aplicação. Os seguintes comandos criam um aglomerado de cinco nós em Azure. Os comandos também criam um certificado auto-assinado, adiciona-o a um cofre chave e descarrega o certificado localmente. O novo certificado é utilizado para garantir o cluster quando este é implantado e é utilizado para autenticar clientes.
```azurecli
#!/bin/bash
# Variables
ResourceGroupName='containertestcluster'
ClusterName='containertestcluster'
Location='eastus'
Password='q6D7nN%6ck@6'
Subject='containertestcluster.eastus.cloudapp.azure.com'
VaultName='containertestvault'
VmPassword='Mypa$$word!321'
VmUserName='sfadminuser'
# Login to Azure and set the subscription
az login
az account set --subscription <mySubscriptionID>
# Create resource group
az group create --name $ResourceGroupName --location $Location
# Create secure five node Linux cluster. Creates a key vault in a resource group
# and creates a certficate in the key vault. The certificate's subject name must match
# the domain that you use to access the Service Fabric cluster. The certificate is downloaded locally.
az sf cluster create --resource-group $ResourceGroupName --location $Location --certificate-output-folder . --certificate-password $Password --certificate-subject-name $Subject --cluster-name $ClusterName --cluster-size 5 --os UbuntuServer1604 --vault-name $VaultName --vault-resource-group $ResourceGroupName --vm-password $VmPassword --vm-user-name $VmUserName
```
> [!Note]
> O serviço de front-end da Web está configurado para escutar tráfego de entrada na porta 80. Por predefinição, a porta 80 está aberta nos seus VMs de cluster e no balançador de carga Azure.
>
## <a name="configure-your-environment"></a>Configurar o ambiente
O Service Fabric fornece várias ferramentas que pode utilizar para gerir um cluster e as respetivas aplicações:
- O Service Fabric Explorer, uma ferramenta baseada no browser.
- A CLI (Interface de Linha de Comandos) do Service Fabric, que é executada na CLI do Azure.
- Comandos do PowerShell.
Neste arranque rápido, utilize o Service Fabric CLI e o Service Fabric Explorer (uma ferramenta baseada na web). Para utilizar o Service Fabric Explorer, é necessário importar o certificado ficheiro PFX para o navegador. Por predefinição, o ficheiro PFX não tem senha.
Mozilla Firefox é o navegador padrão em Ubuntu 16.04. Para importar o certificado para o Firefox, clique no botão de menu no canto superior direito do seu browser e, em seguida, clique em **Opções**. Na página **Preferências**, utilize a caixa de pesquisa para procurar "certificados". Clique em **Ver Certificados**, selecione o separador **Os Seus Certificados**, clique em **Importar** e siga as instruções para importar o certificado.
## <a name="deploy-the-service-fabric-application"></a>Implementar a aplicação do Service Fabric
1. Ligue-se ao cluster de tecido de serviço em Azure utilizando o CLI. O ponto final é o ponto final de gestão do seu cluster. Criou o ficheiro PEM na secção anterior.
```bash
sfctl cluster select --endpoint https://containertestcluster.eastus.cloudapp.azure.com:19080 --pem containertestcluster22019013100.pem --no-verify
```
2. Utilize o script de instalação para copiar a definição da aplicação de Voto para o cluster, registar o tipo de aplicação e criar uma instância da mesma. O ficheiro de certificado PEM deve estar localizado no mesmo diretório que o *ficheiro install.sh.*
```bash
./install.sh
```
3. Abra um browser e navegue para o ponto final do Service Fabric Explorer para o seu cluster. O ponto final tem o seguinte formato: **https:// \<my-azure-service-fabric-cluster-url> :19080/Explorer;** por exemplo, `https://containertestcluster.eastus.cloudapp.azure.com:19080/Explorer` . </br>
4. Expanda o nó **de Aplicações** para ver se existe agora uma inscrição para o tipo de candidatura de Voto e o caso que criou.
![Service Fabric Explorer][sfx]
5. Para ligar ao contentor em execução, abra um browser e navegue para o URL do seu cluster; por exemplo, `http://containertestcluster.eastus.cloudapp.azure.com:80`. Deverá ver a aplicação de Voto no browser.
![Página Web da aplicação de Voto][quickstartpic]
> [!NOTE]
> Também pode implementar aplicações do Service Fabric com o Docker Compose. Por exemplo, o comando seguinte pode ser utilizado para implementar e instalar a aplicação no cluster com o Docker Compose.
> ```bash
> sfctl compose create --deployment-name TestApp --file-path ../docker-compose.yml
> ```
## <a name="fail-over-a-container-in-a-cluster"></a>Efetuar a ativação pós-falha de um contentor num cluster
O Service Fabric garante que as instâncias de contentor são movidas automaticamente para outros nós do cluster, se ocorrer uma falha. Também pode drenar manualmente um nó para contentores e, em seguida, mover harmoniosamente para outros nós do cluster. O Service Fabric fornece várias formas de dimensionar os seus serviços. Nos passos seguintes, vai utilizar o Service Fabric Explorer.
Para efetuar a ativação pós-falha do contentor de front-end, execute os seguintes passos:
1. Abra o Service Fabric Explorer no seu cluster; por exemplo, `https://containertestcluster.eastus.cloudapp.azure.com:19080/Explorer`.
2. Clique no nó **fabric:/Voting/azurevotefront** na vista de árvore e expanda o nó de partição (representado por um GUID). Repare no nome do nó na vista de árvore, que mostra os nós nos quais o contentor está atualmente a ser executado; por exemplo, `_nodetype_1`.
3. Expanda o nó **Nós** na vista de árvore. Clique nas reticências (...) junto ao nó que está a executar o contentor.
4. Escolha **Reiniciar** para reiniciar esse nó e confirme a ação de reinício. O reinício provoca a ativação pós-falha do contentor para outro nó no cluster.
![Vista de nó no Service Fabric Explorer][sfxquickstartshownodetype]
## <a name="scale-applications-and-services-in-a-cluster"></a>Dimensionar aplicações e serviços num cluster
Os serviços do Service Fabric podem ser facilmente dimensionados num cluster para se prepararem para a carga nos serviços. Para dimensionar um serviço, tem de alterar o número de instâncias em execução no cluster.
Para dimensionar o serviço de front-end da Web, execute os seguintes passos:
1. Abra o Service Fabric Explorer no seu cluster; por exemplo, `https://containertestcluster.eastus.cloudapp.azure.com:19080`.
2. Clique nas reticências (três pontos) junto ao nó **fabric:/Voting/azurevotefront** na vista de árvore e escolha **Dimensionar Serviço**.
![Início do serviço de dimensionamento do Service Fabric Explorer][containersquickstartscale]
Agora, pode optar por dimensionar o número de instâncias do serviço de front-end da Web.
3. Altere o número para **2** e clique em **Dimensionar Serviço**.
4. Clique no nó **fabric:/Voting/azurevotefront** na vista de árvore e expanda o nó de partição (representado por um GUID).
![Serviço de dimensionamento do Service Fabric Explorer concluído][containersquickstartscaledone]
Agora, pode ver que o serviço tem duas instâncias. Na vista de árvore, pode ver em que nós as instâncias são executadas.
Através desta simples tarefa de gestão, duplicou os recursos disponíveis para o serviço de front-end processar a carga de utilizador. É importante compreender que não precisa de várias instâncias de um serviço para que o mesmo seja executado de forma fiável. Se um serviço falhar, o Service Fabric certifica-se de que uma nova instância do serviço é executada no cluster.
## <a name="clean-up-resources"></a>Limpar os recursos
Utilize o script de desinstalação (uninstall.sh) fornecido no modelo para eliminar a instância da aplicação do cluster local e anular o registo do tipo de aplicação. Este script demora algum tempo a limpar a instância, pelo que não deve executar o script de instalação imediatamente após este script. Pode utilizar o Service Fabric Explorer para determinar quando a instância foi removida e o tipo de aplicação cujo registo foi anulado.
```bash
./uninstall.sh
```
A forma mais simples de eliminar o cluster e todos os recursos que consome é eliminando o grupo de recursos.
Faça o súmis no Azure e selecione o ID de subscrição com o qual pretende remover o cluster. Pode encontrar o ID da subscrição ao iniciar sessão no portal do Azure. Elimine o grupo de recursos e todos os recursos de cluster utilizando o [comando de eliminação](/cli/azure/group)do grupo az .
```azurecli
az login
az account set --subscription <guid>
ResourceGroupName="containertestcluster"
az group delete --name $ResourceGroupName
```
Se tiver terminado de trabalhar com o cluster, pode remover o certificado do arquivo de certificados. Por exemplo:
- No Windows: utilize o [Snap-in da MMC de certificados](/dotnet/framework/wcf/feature-details/how-to-view-certificates-with-the-mmc-snap-in). Certifique-se de que seleciona **A minha conta de utilizador** ao adicionar o snap-in. Navegue para `Certificates - Current User\Personal\Certificates` e remova o certificado.
- No Mac: utilize a aplicação Keychain.
- No Ubuntu: siga os passos utilizados para ver os certificados e remova o certificado.
## <a name="next-steps"></a>Passos seguintes
Neste início rápido, implementou uma aplicação de contentor do Linux num cluster do Service Fabric do Azure, efetuou a ativação pós-falha na aplicação e dimensionou a aplicação no cluster. Para saber mais sobre como trabalhar com contentores do Linux no Service Fabric, avance para o tutorial para aplicações de contentor do Linux.
> [!div class="nextstepaction"]
> [Criar uma aplicação de contentor do Linux](./service-fabric-tutorial-create-container-images.md)
[sfx]: ./media/service-fabric-quickstart-containers-linux/containersquickstartappinstance.png
[quickstartpic]: ./media/service-fabric-quickstart-containers-linux/votingapp.png
[sfxquickstartshownodetype]: ./media/service-fabric-quickstart-containers-linux/containersquickstartrestart.png
[containersquickstartscale]: ./media/service-fabric-quickstart-containers-linux/containersquickstartscale.png
[containersquickstartscaledone]: ./media/service-fabric-quickstart-containers-linux/containersquickstartscaledone.png
| 64.548223 | 438 | 0.787433 | por_Latn | 0.997136 |
989de796647d9a5c5808c1009a10fec887ed9278 | 1,930 | md | Markdown | AlchemyInsights/check-in-multiple-files.md | isabella232/OfficeDocs-AlchemyInsights-pr.tr-TR | 829935b72282a64e4ec4294adebf31fd30f93f68 | [
"CC-BY-4.0",
"MIT"
] | 3 | 2020-05-19T19:08:16.000Z | 2021-03-14T11:48:36.000Z | AlchemyInsights/check-in-multiple-files.md | isabella232/OfficeDocs-AlchemyInsights-pr.tr-TR | 829935b72282a64e4ec4294adebf31fd30f93f68 | [
"CC-BY-4.0",
"MIT"
] | 2 | 2022-02-09T06:53:52.000Z | 2022-02-09T06:54:01.000Z | AlchemyInsights/check-in-multiple-files.md | isabella232/OfficeDocs-AlchemyInsights-pr.tr-TR | 829935b72282a64e4ec4294adebf31fd30f93f68 | [
"CC-BY-4.0",
"MIT"
] | 2 | 2019-10-09T20:30:22.000Z | 2021-10-09T10:37:41.000Z | ---
title: Bir kerede birkaç dosya iade edin
ms.author: pebaum
author: pebaum
manager: pamgreen
ms.audience: ITPro
ms.topic: article
ms.service: o365-administration
ROBOTS: NOINDEX, NOFOLLOW
localization_priority: Normal
ms.assetid: 854014b6-39a2-4b76-a696-ecc3ab7251fd
ms.custom:
- "5300029"
- "1688"
- "986"
ms.openlocfilehash: 9fcb8b39e2debf8e312a24242c47bfe4b4c5d53488d09cd5ad33d54ae109b10b
ms.sourcegitcommit: b5f7da89a650d2915dc652449623c78be6247175
ms.translationtype: MT
ms.contentlocale: tr-TR
ms.lasthandoff: 08/05/2021
ms.locfileid: "54006442"
---
# <a name="check-in-several-files-at-once"></a>Bir kerede birkaç dosya iade edin
Bir kitaplıkta dosyaları giriş ve SharePoint, içeriğin nasıl güncelleştiril olduğunu izlemek ve kontrol etmek için harika bir yol sağlar. Sitede bir dosyada değişiklik yapmak ve başka kimsenin düzenleyemeye olduğundan emin olmak için, dosyayı gözden kaydedin. Dosyayı kullanıma alan bir dosyayı çevrimiçi veya çevrimdışı olarak düzenleyebilir ve gerekirse birkaç kez kaydedebilirsiniz.
Bu özellikle ilgili bazı yararlı bağlantılar aşağıda verilmiştir.
- [Dosyalarda kullanıma almayı, iadeyi iade edin veya değişiklikleri atma](https://support.office.com/article/check-out-check-in-or-discard-changes-to-files-in-a-library-7e2c12a9-a874-4393-9511-1378a700f6de)
- [Check out, check in and versions hakkında en çok sorulan sorular](https://support.office.com/article/Top-questions-about-check-out-check-in-and-versions-7E941339-E972-4C7A-A79A-80A1FCF84076)
- [Aynı anda birden çok dosya iade edin](https://support.office.com/article/check-out-check-in-or-discard-changes-to-files-in-a-library-7e2c12a9-a874-4393-9511-1378a700f6de)
- [Bir kitaplıkta Sürüm Oluşturma'yi Etkinleştirme veya Devre Dışı Bırakma/Kitaplıkta etkinleştirme veya devre dışı bırakma](https://support.office.com/article/enable-and-configure-versioning-for-a-list-or-library-1555d642-23ee-446a-990a-bcab618c7a37)
| 50.789474 | 385 | 0.817098 | tur_Latn | 0.99331 |
989deafc3fccf604d5dd1313ed94fd415fcee45b | 5,022 | md | Markdown | PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 Common Design Problems/07 P2_Using Reuse Mechanisms.md | mc97-stack/project-single | c01afac0b04684e7ac3c98fc746bb797b9608a53 | [
"MIT"
] | null | null | null | PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 Common Design Problems/07 P2_Using Reuse Mechanisms.md | mc97-stack/project-single | c01afac0b04684e7ac3c98fc746bb797b9608a53 | [
"MIT"
] | null | null | null | PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 Common Design Problems/07 P2_Using Reuse Mechanisms.md | mc97-stack/project-single | c01afac0b04684e7ac3c98fc746bb797b9608a53 | [
"MIT"
] | null | null | null | ---
tags: Programming/Architecture/GammaHelmJohnsonVlissides, Notes/SubNotes
aliases:
publish: false
---
[[PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 How Design Patterns Solve Design Problems|Notes Cover Page]]
# Using Reuse Mechanisms
Creation Timestamp: 2021-11-27 18:49
Tags:
This note deals with how to utilise OOP concepts for building *flexible and reusable* software.
## Inheritance vs. Composition
[[PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 Common Design Problems/07 P2_Using Reuse Mechanisms#PRIVATE com 01Programming Software Architecture Gamma et al - Design Patterns 01 Introduction 05 Common Design Problems 05 Class vs Interface Inheritance Class Inheritance|Class Inheritance]]:
- Allows you to define the implementation of one class in terms of another.
- Reuse by subclassing is known as "**white-box reuse**" (w/ Inheritance, internals of parents classes are often visible to subclasses).
[[PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 Common Design Problems/07 P2_Using Reuse Mechanisms#Object composition|Object composition]]:
- The alternative to class inheritance
- New functionality is obtained by assembling or composing objects to get more complex functionality
- Requires the objects being composed to have well-defined interfaces
- ^ Known as "**black-box**" reuse (No internal objects are visible).
### When is it a good time to use inheritance or composition?
Both #inheritance and #composition have advantages and disadvantages:
#### [[PRIVATE/com/01Programming/Software Architecture/Gamma et al. - Design Patterns/01 Introduction/05 Common Design Problems/05 Class vs Interface Inheritance|Class Inheritance]]
Defined statically at compile-time and is straight-forward to use
- Advantages:
- This has direct support from the programming language
- Also makes it easier to modify an implementation being reused. Overriding and operation in a subclass can affect the operations inherited by the subclass (Assuming they call the overridden operations)
- Disadvantages:
- Superclass implementations can't be changed at run-time (Inheritance is defined at compile-time)
- The superclass typically only define a small part of the subclass' physical representation
- Inheritance exposes a subclass to details of its parent's implementation (["Inheritance breaks encapsulation"](https://stackoverflow.com/questions/9344935/inheritance-breaking-encapsulation))
- Basically because it allows an the parent object to exist outside it's original class declaration
- The **subclass' implementation is tightly coupled to its parent** implementation such that changes to the parent will force a change of the subclass.
- Having a tightly coupled inheritance hierarchy makes your classes inherently brittle undermining its flexibility and reusability.
- The only cure for this is to inherit only from abstract classes which usually provide little to no implementation.
#### Object #composition
Defined dynamically at run-time through objects acquiring references to other objects
- Notes:
- Requires objects to respect each others' interfaces (This requires carefully defined interfaces that don't stop you from using one object with many others)
- This **does not break encapsulation** as objects can only be accessed through their interfaces. This allows objects to be replaced at run-time as long as it has the correct type.
- This also has the added benefit of substantially fewer implementation dependencies
- Favouring object composition over class inheritance *keeps classes encapsulated and focused on one task*
- This allows class hierarchies to remain small and less prone to growing into unmanageable monsters
- Does however mean that the system will have more objects and system behaviour is now dependent on interrelationships instead of being defined within a single class.
- Advantages:
- Composition allows you to only access what you need out of an object (Opposed to inheriting what you need plus additional baggage)
- I.e. This does not break encapsulation
- Fewer implementation dependencies
- Allows for more focused class implementations designed to perform one task
- Disadvantages:
- The final system will have more objects
- System behaviour is dependent on interrelationships (Instead of being contained inside a single class)
### The Principle
> Favour object composition over class inheritance
- Ideally, shouldn't need to create new components to achieve reuse
- Functionality should be available through assembling existing components through object composition.
- Reuse by inheritance makes it easier to make new components that can be composed with old ones - allowing Inheritance and object composition to work together.
- #inheritance is often overused as a reuse technique.
- Designs can be made more reusable and simpler by depending more on object composition | 76.090909 | 344 | 0.806651 | eng_Latn | 0.996646 |
989e1cb609529ac7f800e12cf363ad0329421252 | 757 | md | Markdown | exercises/exercise-3.md | t4d-classes/python_03222021_afternoon | c954702cf55c0f9d919ac32404a29830601883ba | [
"MIT"
] | null | null | null | exercises/exercise-3.md | t4d-classes/python_03222021_afternoon | c954702cf55c0f9d919ac32404a29830601883ba | [
"MIT"
] | null | null | null | exercises/exercise-3.md | t4d-classes/python_03222021_afternoon | c954702cf55c0f9d919ac32404a29830601883ba | [
"MIT"
] | null | null | null | # Exercise 3
1. Using the data types and structures we have learned thus far, capture a history of the calculator commands: add, subtract, multiply, divide
For each history entry, store a unique integer id (do not use external modules, just write some code to generate an id), the name of the command, and the operand value typed in. Do not track the result on the history.
2. Add a new command to the calculator named "history". When the user runs the "history" command display a history of the commands. Attempt to format the table nicely.
3. Add a new command to the calculator named "remove". When the user runs the "remove" command, ask the user for a history entry id. Then remove the history entry from the history list. Do not update the result. | 84.111111 | 217 | 0.774108 | eng_Latn | 0.998996 |
989e7a2a6f8cb4a5611fe0b0c101df7bbfe2c1a3 | 1,941 | md | Markdown | docs/sources/panels/visualizations/bar-gauge-panel.md | lonycell/grafana.v7 | a3437d4fd66e9048fd404d836051a7049e42d63e | [
"Apache-2.0"
] | null | null | null | docs/sources/panels/visualizations/bar-gauge-panel.md | lonycell/grafana.v7 | a3437d4fd66e9048fd404d836051a7049e42d63e | [
"Apache-2.0"
] | 1 | 2020-06-18T15:45:39.000Z | 2020-06-18T15:45:39.000Z | docs/sources/panels/visualizations/bar-gauge-panel.md | lonycell/grafana.v7 | a3437d4fd66e9048fd404d836051a7049e42d63e | [
"Apache-2.0"
] | null | null | null | +++
title = "Bar gauge panel"
description = "Bar gauge panel docs"
keywords = ["grafana", "bar", "bar gauge"]
type = "docs"
aliases =["/docs/grafana/latest/features/panels/bar_gauge/"]
weight = 400
draft = "true"
+++
# Bar gauge panel
The bar gauge simplifies your data by reducing every field to a single value. You choose how ThingSPIN calculates the reduction.
This panel can show one or more bar gauges depending on how many series, rows, or columns your query returns.
{{< docs-imagebox img="/img/docs/v66/bar_gauge_cover.png" max-width="1025px" caption="Stat panel" >}}
## Data and field options
Bar gauge visualizations allow you to apply:
- Data transformations
- Field settings
- Field overrides
- [Thresholds]({{< relref "../thresholds.md" >}})
- Value mappings
## Display options
Use the following options to refine your visualization:
- **Show -** Choose how ThingSPIN displays your data.
- **Calculate -** Show a calculated value based on all rows.
- **All values -** Show a separate stat for every row. If you select this option, then you can also select a **Limit**, or the maximum number of rows to display.
- **Value -** Select a reducer function that ThingSPIN will use to reduce many fields to a single value. Click the **Value** list to see functions and brief descriptions.
- **Orientation -** Choose a stacking direction.
- **Auto -** ThingSPIN selects what it thinks is the best orientation.
- **Horizontal -** Bars stretch horizontally, left to right.
- **Vertical -** Bars stretch vertically, top to bottom.
- **Display mode -** Choose a display mode.
- **Gradient -** Threshold levels define a gradient.
- **Retro LCD -** The gauge is split into small cells that are lit or unlit.
- **Basic -** Single color based on the matching threshold.
- **Show unfilled area -** Select this if you want to render the unfilled region of the bars as dark gray. Not applicable to Retro LCD display mode.
| 43.133333 | 170 | 0.723338 | eng_Latn | 0.987217 |
989ee05924fb8fffede208cdfe02436f87145f97 | 1,438 | md | Markdown | README.md | KarazKOS/mirage_surface | 97f6d58211c97c57ecb30bd1e3668f57a0c5fe83 | [
"MIT"
] | null | null | null | README.md | KarazKOS/mirage_surface | 97f6d58211c97c57ecb30bd1e3668f57a0c5fe83 | [
"MIT"
] | null | null | null | README.md | KarazKOS/mirage_surface | 97f6d58211c97c57ecb30bd1e3668f57a0c5fe83 | [
"MIT"
] | null | null | null | # Project Title
Mirage Surface Cleaning website project.
## Description
A single page scrolling style site that informs the company's customers and vistors about their company and services it offers.
## Getting Started
### Dependencies
* Describe any prerequisites, libraries, OS version, etc., needed before installing program.
* ex. Windows 10
### Installing
* How/where to download your program
* Any modifications needed to be made to files/folders
### Executing program
* How to run the program
* Step-by-step bullets
```
code blocks for commands
```
## Help
Any advise for common problems or issues.
```
command to run if program contains helper info
```
## Authors
Contributors names and contact info
ex. Dominique Pizzie
ex. [@DomPizzie](https://twitter.com/dompizzie)
## Version History
* 0.2
* Various bug fixes and optimizations
* See [commit change]() or See [release history]()
* 0.1
* Initial Release
## License
This project is licensed under the [NAME HERE] License - see the LICENSE.md file for details
## Acknowledgments
Inspiration, code snippets, etc.
* [awesome-readme](https://github.com/matiassingers/awesome-readme)
* [PurpleBooth](https://gist.github.com/PurpleBooth/109311bb0361f32d87a2)
* [dbader](https://github.com/dbader/readme-template)
* [zenorocha](https://gist.github.com/zenorocha/4526327)
* [fvcproductions](https://gist.github.com/fvcproductions/1bfc2d4aecb01a834b46) | 23.193548 | 127 | 0.748957 | eng_Latn | 0.903684 |
989f38f98f775fb8e6be73665bc4318f456b1162 | 1,873 | md | Markdown | docs/rules/self-closing-comp.md | gwenaellarmet/eslint-plugin-react | 06ed2947efc654594de4ea2146ac9dc83645fe92 | [
"MIT"
] | 2 | 2019-06-12T09:46:29.000Z | 2020-01-19T00:51:16.000Z | docs/rules/self-closing-comp.md | gwenaellarmet/eslint-plugin-react | 06ed2947efc654594de4ea2146ac9dc83645fe92 | [
"MIT"
] | 1 | 2020-01-03T01:08:27.000Z | 2020-01-03T01:08:27.000Z | docs/rules/self-closing-comp.md | gwenaellarmet/eslint-plugin-react | 06ed2947efc654594de4ea2146ac9dc83645fe92 | [
"MIT"
] | 2 | 2019-10-22T07:52:02.000Z | 2020-09-07T21:00:32.000Z | # Prevent extra closing tags for components without children (react/self-closing-comp)
Components without children can be self-closed to avoid unnecessary extra closing tag.
**Fixable:** This rule is automatically fixable using the `--fix` flag on the command line.
## Rule Details
The following patterns are considered warnings:
```jsx
var HelloJohn = <Hello name="John"></Hello>;
```
The following patterns are **not** considered warnings:
```jsx
var contentContainer = <div className="content"></div>;
var intentionalSpace = <div>{' '}</div>;
var HelloJohn = <Hello name="John" />;
var Profile = <Hello name="John"><img src="picture.png" /></Hello>;
var HelloSpace = <Hello>{' '}</Hello>;
```
## Rule Options
The rule can take one argument to select types of tags, which should be self-closed when this is possible. By default custom components tags and html tags should be self-closed.
```js
...
"react/self-closing-comp": ["error", {
"component": true,
"html": true
}]
...
```
### `component`
When `true`, custom components tags should be self-closed.
The following patterns are considered warnings:
```jsx
var HelloJohn = <Hello name="John"></Hello>;
```
The following patterns are **not** considered warnings:
```jsx
var contentContainer = <div className="content"></div>;
var intentionalSpace = <div>{' '}</div>;
var HelloJohn = <Hello name="John" />;
var Profile = <Hello name="John"><img src="picture.png" /></Hello>;
```
### `html`
When `true`, html components tags should be self-closed.
The following patterns are considered warnings:
```jsx
var contentContainer = <div className="content"></div>;
```
The following patterns are **not** considered warnings:
```jsx
var contentContainer = <div className="content" />;
var contentContainer = <div className="content"><div /></div>;
var intentionalSpace = <div>{' '}</div>;
```
| 22.566265 | 177 | 0.695141 | eng_Latn | 0.904756 |
989f468b5c95ad83c2c888a948163ca9448bbce6 | 2,952 | md | Markdown | content/posts/012.md | Ghw2066/MyBlog | d0d74c0124cc02d21ef518ce8fd30b2cd15f0a14 | [
"MIT"
] | null | null | null | content/posts/012.md | Ghw2066/MyBlog | d0d74c0124cc02d21ef518ce8fd30b2cd15f0a14 | [
"MIT"
] | null | null | null | content/posts/012.md | Ghw2066/MyBlog | d0d74c0124cc02d21ef518ce8fd30b2cd15f0a14 | [
"MIT"
] | null | null | null | ---
title: "工欲善其事——VsCode远程模式连接WSL编写C/C++/Python"
date: 2020-02-13T09:24:51+08:00
draft: false
categories:
- 工欲善其事
tags:
- tools
---
因为在想要保有Windows优秀的图形界面的同时，又想要linux便利的包管理功能，于是萌生了利用vscode+wsl的方式实现这个目的。但是在翻看网上诸多博客之后，发现并没有找到能够完整的描述这个流程的博文，所以写下这篇博客。
## 安装wsl
这一步网上随手便可搜到教程，还是比较容易，我就简单说一下。
1. 控制面板->程序和功能->启用或关闭Windows功能->勾选 适用于Linux的Windows子系统
2. 打开win10应用商店，搜索linux，选一个喜欢的发行版安装就好，我这里选择的是ubuntu 18.04
现在wsl就安装好了，剩下就是设置自己的账户名密码，然后运行一下
```shell
sudo apt-get update
sudo apt-get upgrade
```
## 在wsl中安装gcc/Python
#### 1. 安装C/C++编译器
```shell
sudo apt install gcc
```
```shell
gcc -V
```
检查一下是否安装成果，如果出现版本号，则说明安装成功
我的终端是安装了open-wsl工具以及zsh之后的样子，所以可能和安装wsl之后原始界面不一样，但是这不影响接下来的步骤，可以放心参考。
#### 2. 安装python
```shell
sudo apt install python3
```
检查python版本
```shell
python3 -V
```
我这里是因为之前已经安装过，所以终端输出是这样。
## VScode remote模式连接wsl
win10下打开vscode，搜索remote，可以看的vscode为我们提供了很忙remote工具，这里我们选择第一个，安装remote-wsl插件
然后就是打开remote-wsl连接到wsl上，这里有两种方式
一是直接打开vscode，点击remote--选择ubuntu18.04--点击文件夹按钮打开。
二是打开wsl终端，cd到要打开的文件夹，输入命令
```shell
code .
```
即可在vscode中以remote模式连接wsl，并打开对应文件夹
这时候已经可以用vscode访问wsl中的文件了，并且vscode的文件管理器可以充当wsl中的文件管理图形界面，包括新建文件、删除文件、修改文件，都很方便。这时候如果熟悉linux下命令好编译运行程序的小伙伴，到这一步就足够了，在vscode中编辑保存，然后在终端里编译运行对应程序文件就好，其实code runner插件就是这么做的，只不过是替你在终端输入命令而已。
## 安装VScode插件
vscode提供两种工作在不同位置的插件，locally on the UI / client side, or in WSL
可能大家在使用remote模式连接wsl之前已经安装过许多插件，用于windows环境下的本地开发，这其中和UI相关的插件（vscode-icons，字体插件等等）是可以在wsl模式下通用的，但是code runner、C++、python的插件是要再单独安装到remote-wsl中的
这里可以看到，在remote-wsl模式下生效的插件是高亮白色，未生效插件是灰色的
我安装了code-runner和C++的插件，大家可以自行选择
安装好code-runner之后，有一些配置需要结合情况修改一下
1. 使用wsl终端作为程序输出，且整合进vscode中。点击File-Preferences-Settings-Extensions-Run Code Configuration, 勾选Run in Terminal，这样程序的运行后就可以在terminal中输出了，而不是在output中输出。这样有一个好处，就是在编写需要从键盘获取输入的程序时，run in terminal模式就可以允许输入，而默认的output方式不行。
2. 因为我们安装的时python3，在ubuntu中，直接输入python调用的是python2，或者如果没有安装python2的话，就会出现command not found的错误提示，这里code runner默认使用的命令是`python -u`，我们需要修改一下以使得可以正常运行。
点击File-Preferences-Settings-Extensions-Run Code Configuration, 点击edit in setting.json
看到如下内容
在最后输入
```json
"code-runner.executorMap":
```
按下回车后面的一大串都会自动补全
这时候就能发现，code runner其实就是代替你在命令行输入了编译执行的命令
我们修改python部分，将python修改为python3，保存，即可正常运行。
 | 21.866667 | 217 | 0.747967 | yue_Hant | 0.65107 |
989fb5b9084f4da89e5dabfc78452ac18e59c89c | 1,577 | md | Markdown | _posts/2020-06-12-sort-with-None-item.md | kadaliao/kadaliao.github.io | 228da82ab50b65fa26de367ff6a2c0cd7efe00f7 | [
"MIT"
] | null | null | null | _posts/2020-06-12-sort-with-None-item.md | kadaliao/kadaliao.github.io | 228da82ab50b65fa26de367ff6a2c0cd7efe00f7 | [
"MIT"
] | null | null | null | _posts/2020-06-12-sort-with-None-item.md | kadaliao/kadaliao.github.io | 228da82ab50b65fa26de367ff6a2c0cd7efe00f7 | [
"MIT"
] | null | null | null | ---
layout: post
title: sorted函数处理None值参与的情况
tags: python
---
内建的Sorted函数定义如下：
```
sorted(iterable, *, key=None, reverse=False)
Return a new sorted list from the items in iterable.
Has two optional arguments which must be specified as keyword arguments.
key specifies a function of one argument that is used to extract a comparison key from each element in iterable (for example, key=str.lower). The default value is None (compare the elements directly).
reverse is a boolean value. If set to True, then the list elements are sorted as if each comparison were reversed.
Use functools.cmp_to_key() to convert an old-style cmp function to a key function.
The built-in sorted() function is guaranteed to be stable. A sort is stable if it guarantees not to change the relative order of elements that compare equal — this is helpful for sorting in multiple passes (for example, sort by department, then by salary grade).``sh
```
当用于排序的序列有空值时，要注意是否适用于比较，以int序列举例：
```python
In [1]: a = [1,3,2,9,4,None]
In [2]: sorted(a)
---------------------------------------------------------------------------
TypeError Traceback (most recent call last)
<ipython-input-2-ca63776b8466> in <module>
----> 1 sorted(a)
TypeError: '<' not supported between instances of 'NoneType' and 'int'
```
#### 解决办法
```python
In [6]: a
Out[6]: [1, 3, 2, 9, 4, None]
In [7]: sorted(a, key=lambda x: (x is None, x))
Out[7]: [1, 2, 3, 4, 9, None]
```
ref:
- https://stackoverflow.com/questions/18411560/python-sort-list-with-none-at-the-end
| 29.754717 | 270 | 0.666455 | eng_Latn | 0.985171 |
989fbb6b722f1fa380d7cb0aeee4010e0f827a2e | 510 | markdown | Markdown | _posts/2013-01-04-video__1609.markdown | sawyerh/organizedwonder | ec1c09e67d13776b134a1e4968b6413ca35f3780 | [
"MIT"
] | 2 | 2016-01-06T17:13:12.000Z | 2016-07-03T03:28:36.000Z | _posts/2013-01-04-video__1609.markdown | sawyerh/organizedwonder | ec1c09e67d13776b134a1e4968b6413ca35f3780 | [
"MIT"
] | null | null | null | _posts/2013-01-04-video__1609.markdown | sawyerh/organizedwonder | ec1c09e67d13776b134a1e4968b6413ca35f3780 | [
"MIT"
] | null | null | null | ---
title: "Jerry Seinfeld on How to Write a Joke"
date: 2013-01-04 06:54:17 00:00
permalink: /videos/1609
source: "http://youtu.be/itWxXyCfW5s"
featured: false
provider: "YouTube"
thumbnail: "http://i2.ytimg.com/vi/itWxXyCfW5s/hqdefault.jpg"
user:
id: 1282
username: "hleeena"
name: "Lena"
tags: ["creativity","joke"]
html: "<iframe width=\"640\" height=\"360\" src=\"http://www.youtube.com/embed/itWxXyCfW5s?wmode=transparent&feature=oembed\" frameborder=\"0\" allowfullscreen></iframe>"
id: 1609
---
| 28.333333 | 170 | 0.709804 | yue_Hant | 0.31687 |
98a0108eb71f727e792e493b1c32e0e677a1907e | 2,694 | md | Markdown | README.md | jeffcasavant/MaubotTwilio | 7702dec67bd6f24f5166d6a3c0f81b0bafdd1dd1 | [
"MIT"
] | 3 | 2020-06-13T18:52:16.000Z | 2020-07-04T17:36:01.000Z | README.md | jeffcasavant/MaubotTwilio | 7702dec67bd6f24f5166d6a3c0f81b0bafdd1dd1 | [
"MIT"
] | 3 | 2020-06-26T17:20:07.000Z | 2021-09-08T03:17:37.000Z | README.md | jeffcasavant/MaubotTwilio | 7702dec67bd6f24f5166d6a3c0f81b0bafdd1dd1 | [
"MIT"
] | null | null | null | # MaubotTwilio
Maubot plugin to bridge in SMS with Twilio.
## Dependencies
Your Maubot instance needs to have access to the following Pip packages:
* twilio
## Usage
* Create a Twilio account and a phone number. Create a project so you track
costs.
* Load the plugin into your Maubot instance
* Create an instance - remember its name
* Set the values in the config file
* In Twilio -> Super Network -> Phone Numbers -> the source number you intend
to use, under Messaging, set the `A MESSAGE COMES IN` webhook URL to
`https://<maubot instance hostname>/<plugin base from maubot config, default
_matrix/maubot/plugin>/<plugin instance name>/sms`
* `!addsms alias +12223334444` will begin sending room messages via SMS to
+1-222-333-4444 and routing messages from it to the room in which you ran
this command. Use a number format that Twilio supports directly - the plugin
does no format conversion.
* `!removesms alias` or `!removesms +12223334444` will stop bridging to that
number.
* `!listsms` prints a table of the currently bridged numbers and aliases.
## Motivation
The plugin's design & limitations come from its primary use case: I am in a
room with one member who was going to be without her smartphone for a few
months. I built this as a quick & dirty solution to keep her involved in our
group chat.
## Features
* Admin list - only allow certain users to add / remove bridging (to control
costs).
## Limitations
* Numbers can only send messages to one room. This could be corrected in the
future by supporting multiple Twilio numbers, and looking up `(Twilio number,
message source number)` to `room_id` instead of just `message source number`.
* MMS is not currently supported though Twilio does have that feature.
* Voice (via text-to-speech and speech-to-text) is not supported either. Might
be useful for an alarms room, or for any style of message you'll want to
reach you during e.g. a work meeting.
* Other telephony providers are not supported (for example Nexmo should be a
tiny bit cheaper).
## Drawbacks
* Cost: at Twilio rates as of 2020-06-13, you'll pay $.0075 for each ingoing
and outgoing SMS, and $1/mo to retain the number you're using.
* Logging: Twilio has copies of all messages in its SMS log (handy for
troubleshooting delivery). Don't treat SMS as a secure messaging service.
## Esoterica
* The package name for this plugin diverges from my other plugin
(`casavant.jeff...` vs `org.casavant.jeff...`). This new format is correct.
Not sure if it will break current installations of my old plugin if I update
it.
## Issues
Hit me up in #maubot-casavant-plugins:casavant.org if you have any trouble.
| 37.943662 | 79 | 0.749443 | eng_Latn | 0.996987 |
98a07fbef1bfcfea934407a8b664728cc24ad502 | 3,326 | md | Markdown | CHANGELOG.md | kogitoapp/symfony-flex-docker | 0b72a1d9482dce71f2e17521e78a4f26ebdb95bd | [
"MIT"
] | null | null | null | CHANGELOG.md | kogitoapp/symfony-flex-docker | 0b72a1d9482dce71f2e17521e78a4f26ebdb95bd | [
"MIT"
] | null | null | null | CHANGELOG.md | kogitoapp/symfony-flex-docker | 0b72a1d9482dce71f2e17521e78a4f26ebdb95bd | [
"MIT"
] | null | null | null | # Change log
This list contains all the changes which went into the project, including issues
and further references.
Items starting with `DEPRECATION` are important deprecation notices.
## v1.1.0 (2021-07-15)
- [Changed] version to 1.1.0
- [Added] Makefile for Symfony workflow
- [Changed] to new container images
- [Changed] to NodeJS 14.17.3
- [Changed] to PHP 7.4.21
- [Changed] to use prebuilt Postgres Alpine image
- [Changed] to APCU 5.1.20
- [Improved] handling of composer install
- [Fixed] Symfony CLI deployment
## v1.0.0 (2021-06-15)
- [Changed] version to 1.0.0
- [Added] Symfony CLI
- [Changed] to new container images
- [Changed] to Composer 2.1.3
- [Changed] to PHP 7.4.20
- [Improved] podman support
The Symfony Flex Docker Environment can now be used with docker/docker-compose
and podman/podman-compose for rootless development!
- [Added] note about podman support
- [Changed] to Symfony 5.2
- [Changed] to use full registry path to support podman
- [Changed] to new container images
- [Changed] to MariaDB 10.5.9
- [Changed] to nginx 1.20.1
- [Changed] to NodeJS 14.17.0
- [Changed] to PHP 7.4.19
- [Changed] to Postgres 12.7
- [Changed] to Alpine 3.13 based images
- [Fixed] missing volume
- [Changed] to newer versions
- [Changed] to newer versions
- [Fixed] missing MySQL PDO driver
- [Fixed] MariaDB health check
- [Added] Redis environment variables
- [Added] PHP redis extension
- [Fixed] Postgres health check
- [Added] SMTP mail catcher MailHog
- [Added] health check / Postgres PHP mod
- [Added] Postgres 12.3
- [Removed] generated file
- [Improved] environment
- [Changed] to MariaDB 10.4
- [Changed] to Redis 5.0
- [Changed] to PHP 7.4
- [Changed] to Composer 1.10
- [Changed] to NodeJS 12.18
- [Changed] to nginx 1.18
- [Changed] to Symfony 5
- [Changed] to use pre-built images for redis/mariadb
- [Fixed] nginx configuration
- [Changed] to composer version 1.8.0
- [Changed] to current versions
- [Added] container names
- [Changed] to PHP 7.2.7/Composer 1.7.0
- [Changed] MariaDB to Alpine 3.8
- [Changed] to PHP 7.2.7
- [Fixed] entrypoint
- [Fixed] MariaDB build
- [Removed] yarn install
- [Changed] Docker container to current versions
- [Added] option for local SMTP catcher
Seeing what you would mail out is nice
- [Added] dedicated mounts for bundles and built assets
This makes deployment a lot easier since you can just use a shared
volume.
- [Changed] to add application to container
- [Changed] NodeJS to version 8.11.2
- [Added] WORKDIR to nginx
This just ensures we use the same one for all containers.
- [Added] GD module to PHP-FPM by default
- [Added] multipe GPG sources for key verification
- [Added] build status to README
- [Added] Travis CI build pipeline
- [Improved] default configuration
- [Added] service dependencies and override tweaks
Override tweaks show how to
- locally access Redis/MariaDB
- mount user composer settings, can e.g. be used to supply github
- [Added] basic Flex and Webpack configuration
- [Added] git ignore list
- [Added] initial documentation
- [Added] Docker environment for Symfony flex
| 35.382979 | 82 | 0.683403 | eng_Latn | 0.906124 |
98a0a8c67eb44448bf514661d18dab56b86b42a8 | 3,432 | md | Markdown | _posts/2020-04-11-Java GUI.md | leehan128/leehan128.github.io | 4da5435f9dfe5216a695972895c83456b6de4725 | [
"MIT"
] | 1 | 2021-04-11T14:30:19.000Z | 2021-04-11T14:30:19.000Z | _posts/2020-04-11-Java GUI.md | leehan128/leehan128.github.io | 4da5435f9dfe5216a695972895c83456b6de4725 | [
"MIT"
] | 1 | 2021-03-30T10:06:30.000Z | 2021-03-30T10:06:30.000Z | _posts/2020-04-11-Java GUI.md | ihan12389/ihan12389.github.io | 13bbf763c04ab5fe0779179e57607da9ce7d7b99 | [
"MIT"
] | 1 | 2020-05-07T10:47:46.000Z | 2020-05-07T10:47:46.000Z | ---
layout : post
comments : true
title : Swing GUI 기초 다지기 (1)
date : 2020-04-11 18:37:50
author : leehan
backgroud : '/img/bg-post.jpg'
categories : Programming
tags : [Programming, Java GUI]
---
### Java GUI
자바는 객체 지향 언어이기 때문에 라이브러리의 클래스를 상속받아 컴포넌트를 쉽게 구현할 수 있습니다. 당연히 GUI 또한 그렇습니다. JAVA에 GUI 기능을 제공하는 가장 대표적인 컴포넌트는 **AWT**와 **SWING**입니다.
***AWT***는 중량 컴포넌트라고도 불리며 OS의 환경에 의존적이고 자원을 많이 소모하기도 합니다. 그러나 많은 기능을 구현할 수 있죠.
***SWING***은 이와는 좀 다르게 경량 컴포넌트라고 불리며 OS에 의존적이지 않은 순수 자바 언어로 구현된 컴포넌트이죠. 때문에 이식성이 굉장히 뛰어납니다.
자바의 모든 GUI 컴포넌트들은 Component라고 하는 클래스를 반드시 상속받습니다. GUI에서 컴포넌트와 컨테이너의 상관 관계는 상당히 중요한데요. 간략하고 추상적으로 설명하자면 Component란 컨테이너에 포함되어 화면에 출력되는 '요소'이며 컨테이너란 다른 컴포넌트들을 포함해주는 틀을 말하는 거에요.
좀 더 쉽게 설명하자면 컴포넌트나 컨테이너나 화면에 출력되기 위한 요소인데 컨테이너 속에는 컴포넌트가 포함될 수 있고 컴포넌트는 컴포넌트를 포함하지 않고 바로 출력된다는 거죠. '배경' 안에 '버튼'이 출력되는 걸 생각해보면 됩니다. '배경'은 컨테이너, '버튼'은 컴포넌트인 셈이죠.
AWT 컨테이너 컴포넌트는 Frame, Panel, Dialog, Window가 있으며 SWING 컨테이너 컴포넌트는 JFrame, JPanel, JApplet, JDialog, JWindow가 있습니다.
### JAVA SWING
스윙을 구현하기 위해선 먼저 스윙 패키지를 import 해야 합니다. 당연하죠.
위에 말한 컨테이너 중 다른 컨테이너에 포함되어지지 않는 컨테이너를 *최상위 컨테이너*라고 합니다. 대표적으로 JFrame이 그런데요. 이 프레임을 구현해야 다른 컴포넌트를 담아서 출력이 가능해집니다.
#### JFrame
프레임을 생성하는 건, 패키지를 import했으니 JFrame이란 클래스를 상속받아 새로운 클래스를 작성하는 방법이 보편적입니다. 물론 JFrame 객체를 생성할 수도 있지만 확장성과 융통성면에서 그다지 권장되는 방법은 아닙니다.
~~~java
public class JFramePractice extends JFrame{
...
}
~~~
이런 식으로요! 이러헥 클래스를 따로 만들면 JFrame의 형식에 얽매이지 않고 생성자도 마음대로 추가할 수 있으며 메소드와 인스턴스도 손쉽게 설정할 수 있겠죠.
JFrame 객체는 *Frame, Menu Bar, Content Pane*으로 구성되어 있습니다. *Menu Bar*에는 메뉴를 붙일 수 있으며 *Frame*은 응용프로그램을 구성하는 외각 틀입니다. 컴포넌트는 *Content Pane*이라고 하는 곳에 붙일 수 있습니다!
이 Content Pane은 객체가 처음 생길 때 자동으로 생성돼요! `Container contentPane = frame.getContentPane();`이라는 구문을 통해 Content Pane을 알아낼 수 있어요! 이렇게 알아낸 ContentPane에다가 add 메소드로 컴포넌트를 부착해주면 됩니다.
#### Layout Manager
배치 관리자(Layout Manager)라는 녀석은 컨테이너 안의 컴포넌트를 배치해주는 역할을 합니다. GUI를 구현한다면 배치는 굉장히 중요하죠.
4가지 종류가 있습니다.
1. FlowLayout
2. BorderLayout
3. GridLayout
4. CardLayout
쉽게 설명하자면, *FlowLayout*이라는 녀석은 들어오는 컴포넌트들을 순서대로 왼쪽에서 오른쪽으로 배치하며 더 이상 공간이 없을 땐 줄바꿈을 해서 다시 왼쪽에서 오른쪽으로 배치해줍니다. *BorderLayout*이라는 녀석은 위, 아래, 좌, 우, 중앙으로 공간을 나누어 지정한 영역에 컴포넌트를 배치합니다. *GridLayout*은 컨테이너의 공간을 응용프로그램에서 설정한 동일 크기의 2차원 그리드로 나누고, 컴포넌트를 들어오는 순서대로 좌에서 우로, 다시 위에서 아래로 순서대로 배치합니다. *CardLayout*은 컨테이너의 공간에 컴포넌트를 쌓아 놓듯이 쪼개어 배치합니다.
JFrame은 기본적으로 BorderLayout을 생성합니다. 컨테이너를 생성할 때 기본으로 생성되는 배치 관리자들이 있습니다. 다른 컨테이너들은 다른 배치관리자를 디폴트로 생성하겠죠?
아래에는 간단하게 JFrame으로 GUI를 구현하는 실예제를 따라해보았습니다.
~~~java
import java.awt.Color;
import java.awt.Container;
import java.awt.FlowLayout;
import javax.swing.JButton;
import javax.swing.JFrame;
public class ContentPanelEx extends JFrame {
ContentPanelEx()
{
setTitle("ContentPane과 JFrame"); //프레임의 타이틀 달기
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); //프레임 윈도우를 닫으면 프로그램 종료
Container contentPanel = getContentPane(); //컨텐트 팬을 알아낸다.
contentPanel.setBackground(Color.ORANGE); //오렌지색 배경 설정
contentPanel.setLayout(new FlowLayout()); //컨텐트팬에 FlowLayout 배치관리자 달기
contentPanel.add(new JButton("OK")); //버튼달기
contentPanel.add(new JButton("cancle")); //버튼달기
contentPanel.add(new JButton("Ignore")); //버튼 달기
setSize(300, 150); //프레임 크기의 300*150 설정
setVisible(true); //프레임을 화면에 출력
}
public static void main(String[] args)
{
new ContentPanelEx();
}
}
~~~
[출처](http://blog.naver.com/PostView.nhn?blogId=1stwook&logNo=220138459087&parentCategoryNo=&categoryNo=25&viewDate=&isShowPopularPosts=true&from=search)
| 32.074766 | 329 | 0.732809 | kor_Hang | 1.00001 |
98a0ad74303823dd8628af4301e071870489d1d9 | 364 | md | Markdown | test/apicoverage/image/README.md | Sharma-Ritika/serving | df52aa23db6b8a525bc60fe163f8dc7d140b2631 | [
"Apache-2.0"
] | 1 | 2020-12-24T05:47:49.000Z | 2020-12-24T05:47:49.000Z | test/apicoverage/image/README.md | Sharma-Ritika/serving | df52aa23db6b8a525bc60fe163f8dc7d140b2631 | [
"Apache-2.0"
] | 41 | 2019-04-06T00:55:27.000Z | 2020-09-30T11:24:23.000Z | test/apicoverage/image/README.md | Sharma-Ritika/serving | df52aa23db6b8a525bc60fe163f8dc7d140b2631 | [
"Apache-2.0"
] | 2 | 2019-09-30T21:42:53.000Z | 2019-10-01T01:27:41.000Z | # Serving Webhook based API Coverage Image
This directory contains the HTTP Server image used in Webhook based API coverage
tool. Core infra pieces for the tool comes from
[knative.dev/pkg](https://github.com/knative/pkg/tree/master/test/webhook-apicoverage).
Knative serving specific pieces of the tool (such as rules, ignored fields)
resides in this directory.
| 45.5 | 87 | 0.804945 | eng_Latn | 0.992837 |