replace this to pass.


great that you fixed it!


スプライト名を変更した時のイベントハンドラを行うためにこちらに移動しました。


Successfully aliased the URL <https://svgr-ejmqswkkuf.now.sh> to the following alias.

* https://svgr.now.sh


thanks i didn't know about XAQT project.


ok


Fuck, we fucked around for 15mins when it actually worked.


code need review


d


replace with bootstrap


deleted wrong code


tale div lahka je svoja react componenta


When i tried to submit patch its giving error ... Could you explain how we should submit this patch ?


Thank you. I'll prepare an alternative PR for [#168](https://github.com/gearman/gearmand/issues/168).

> Do we need a separate PR for this?

There is no way around it, because my and gearmand origin master branches are different at least in #8.


Thank you for updating. By the way, isn't the key `multiple_pages` aligned (on the same level) with `single_page`?


@Rotonen Jenkins CI reporting about code analysis
See the full report here: https://jenkins.plone.org/job/package-plone.testing/104/violations
```
src/plone/testing/z2.py:98:1: C901 'uninstallProduct' is too complex (15)
src/plone/testing/z2.py:138:19: T000 Todo note found.
src/plone/testing/z2.py:414:5: C901 'Startup.setUpPatches' is too complex (11)
src/plone/testing/z2.py:829:11: T000 Todo note found.
```
Follow [these instructions](https://github.com/plone/jenkins.plone.org/blob/master/docs/source/run-qa-on-package.rst) to reproduce it locally.


ddd


intel


Then, fine! :wink:


@Rotonen Jenkins CI reporting about code analysis
See the full report here: https://jenkins.plone.org/job/package-plone.testing/105/violations
```
src/plone/testing/z2.py:98:1: C901 'uninstallProduct' is too complex (15)
src/plone/testing/z2.py:138:19: T000 Todo note found.
src/plone/testing/z2.py:414:5: C901 'Startup.setUpPatches' is too complex (11)
src/plone/testing/z2.py:829:11: T000 Todo note found.
```
Follow [these instructions](https://github.com/plone/jenkins.plone.org/blob/master/docs/source/run-qa-on-package.rst) to reproduce it locally.


I didn't make this path up when introducing it :) -- Ubuntu has the engines in `/usr/lib/x86_64-linux-gnu/engines-1.1/`. Please consider re-adding it. On entry less or more shouldn't harm here.


This should probably be added to the [security-checker](https://github.com/sensiolabs/security-checker), so people are more pressed to update, as this can be quite troublesome.


Interesting idea. I've logged https://issues.jboss.org/browse/DBZ-933 for
tracking it. IMO not super-high prio right now, but definitely a
nice-to-have feature at some point.


aren't we going to use jest for testing? it also has coverage built-in


`axios` supports promises, I much prefer it than `request` as you have to install 2 different packages


第一次建立github.io博客


Basic data analysis and visualisation


I think its not necessary to use `mx.ui.info` instead use `mx.ui.progress`


Suggest adding a value to Settings.cpp:settingsReset()
```
    sysSettings.maxChainReachBeyondSprocketTop = 3360; // Formerly chainLength but the starting point and the fact that it is a machine property more than a chain position makes it clearer

```
See PR#465 in MaslowCNC/Firmware (https://github.com/MaslowCNC/Firmware/pull/465).


测试


http://tests.stockfishchess.org/tests/view/5b8cb6a10ebc592cf274bd0a
and some tests near it


Which script is passing this argument? I don't see a change in the `CMakeLists.txt` or any other file.


Exact, nikel
Merci


"""

Bir sayının ona bir basamın, sayının basamakına kadar kuvvetinin
alınıp toplanmasıyla elde edilen sonuç buna eşitse bu sayı bir Armstrong Sayısıdır.
abc = a ^ 3 + b ^ 3 + c ^ 3
abcd = a ^ 4 + b ^ 4 + c ^ 4 + d ^ 4
1634 = 1^4 + 6^4 + 3^4 + 4^4 = 1634
"""

sayı = int(input("Bir sayı girin:"))
sayıstr = str(sayı)
toplam = 0
for i in sayıstr:
    işlem = int(i) ** len(sayıstr)
    toplam+=işlem
if toplam==sayı:
    print(sayı,"amstrong sayısıdır")
else:
    print(sayı,"amstrong sayısı değildir.")


@Sanne So calling the `toString()` method is better than this?


yeah


@Sanne maybe we should use `StringHelper#isEmptyOrWhiteSpace()`?


Nothing breaking but having this change before the git-tag `35` is a bit awkward. It makes forking based on the `35` tag a bit strange. The forked cromwell version would misleadingly build as version 36.


Используй строковые литералы из ES6. Код будет читабельнее:
song.src = `playlist/${ songs[currentSong + 1] }`;


Можно заменить на currentSong++;


Тоже самое: можно заменить на currentSong--;


Тут тоже замени на строковый литерал (https://developer.mozilla.org/ru/docs/Web/JavaScript/Reference/template_strings)


On line 115, you should unsubscribe or unlisten. `this.props.mxform.unlisten(this.formHandle);`


Committed to doing all I have committed


в 37 строчке  '-', у вас стоит знак тире, нужен знак минус '-'
в 39 и 38 строке лишняя скоба ...math.sqrt(D), у вас две скобки там стоят, посмотрите по своему коду
в 41 строчке оператор ветвления пишется elif, а не eslif и в конце инструкции ставится знак ':'
в 41 строчке D = 0, вы уверены?
в 42 строке не хватает скобки в конце строчки
в 43 строчке оператор ветвления elif


ok


[R/mbd_loglik_utils.R:173:75:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L173) *style:* **Trailing whitespace is superfluous.**
```r
#' between two consecutive nodes. So, defined the set in the time interval
                                                                          ^
```
[R/mbd_loglik_utils.R:175:3:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L175) *style:* **Trailing whitespace is superfluous.**
```r
#'
  ^
```
[R/mbd_loglik_utils.R:176:5:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L176) *style:* **Trailing whitespace is superfluous.**
```r
#' d
    ^~
```
[R/mbd_loglik_utils.R:177:41:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L177) *style:* **Trailing whitespace is superfluous.**
```r
#' --Q^k_m(t) = SUM_n(M^k_m,n * Q^k_n(t)
                                        ^
```
[R/mbd_loglik_utils.R:178:6:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L178) *style:* **Trailing whitespace is superfluous.**
```r
#' dt
     ^~
```
[R/mbd_loglik_utils.R:179:3:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L179) *style:* **Trailing whitespace is superfluous.**
```r
#'
  ^
```
[R/mbd_loglik_utils.R:182:3:](https://github.com/Giappo/mbd/blob/9ad8f0a9d759af9babd6e7b7ba198aadd71f1d36/R/mbd_loglik_utils.R#L182) *style:* **Trailing whitespace is superfluous.**
```r
#'
  ^
```


Hi Nick,

Working on it few hours a day. Will push in a day or two.

Regards,
Shashi

On Tue, Oct 2, 2018 at 3:18 AM Nick Walsh <notifications@github.com> wrote:

> When can you finish index page please?
>
> —
> You are receiving this because you authored the thread.
> Reply to this email directly, view it on GitHub
> <https://github.com/nickgwalia/BLOCKCHAIN-CABS-CROWDSALE-WEBSITE/commit/7f28adb67d451dbb4b4c66f873d5eab1e3f5293e#commitcomment-30724984>,
> or mute the thread
> <https://github.com/notifications/unsubscribe-auth/AAtDZg2GqLKpX7KGGfXCO_5P8dnlZSnxks5ugo2ygaJpZM4XAKUb>
> .
>


[Jahou] (https://github.com/JahouNyan/)


I would put all matrix validator functions into a separate file so it is easier to understand what happens in this endpoint.
So eg. create a `matrixValidator.js` file and put:
```
function areNumbers (input) { ...}
function createMatrix (input) { ...}
function isSquare (matrix) {...}
function isIncreasing (matrix) {...}

exports.areNumbers = areNumbers;
exports.createMatrix = createMatrix;
......//etc
```

and then in `app.js` you could use:
```
const matrixValidator = require('./matrixValidator');

....
matrixValidator.createMatrix(..);
....
```


if these are fix messages, create them as `const` globally (like you did with the variable `PORT`)


ขอบคุณมากครับสำหรับความรู้ เป็นประโยชน์ มากๆ เลย  พนันบอลufabet http://www.ufa007.com/ufabet:AO


[R/mbd_loglik_utils.R:173:75:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L173) *style:* **Trailing whitespace is superfluous.**
```r
#' between two consecutive nodes. So, defined the set in the time interval
                                                                          ^
```
[R/mbd_loglik_utils.R:175:3:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L175) *style:* **Trailing whitespace is superfluous.**
```r
#'
  ^
```
[R/mbd_loglik_utils.R:176:5:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L176) *style:* **Trailing whitespace is superfluous.**
```r
#' d
    ^~
```
[R/mbd_loglik_utils.R:177:41:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L177) *style:* **Trailing whitespace is superfluous.**
```r
#' --Q^k_m(t) = SUM_n(M^k_m,n * Q^k_n(t)
                                        ^
```
[R/mbd_loglik_utils.R:178:6:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L178) *style:* **Trailing whitespace is superfluous.**
```r
#' dt
     ^~
```
[R/mbd_loglik_utils.R:179:3:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L179) *style:* **Trailing whitespace is superfluous.**
```r
#'
  ^
```
[R/mbd_loglik_utils.R:182:3:](https://github.com/Giappo/mbd/blob/188433e052f715de528e4f5f43a5fe88dec5dc54/R/mbd_loglik_utils.R#L182) *style:* **Trailing whitespace is superfluous.**
```r
#'
  ^
```


Thank you, considering the peculiar way to access the display, this is a relevant step forward.
There is plenty of possible improvements, though:  as you can see the vertical coordinate (probably byte shifting) is reversed.
![mandel g850](https://user-images.githubusercontent.com/10224992/46334840-d7b73d80-c625-11e8-9afa-de32d051b2a0.png)

I'm really looking forward to receiving the next improvements, as soon as the pixel addressing code is fixed (or confirmed), I'll be glad to contribute.


what about other characters which are not letters but not numbers?
You could use a regex pattern which checks that only numbers are present


if you use this approach, the following 5 lines could be replaced with:
`return letters === null;`


test


Updated Y.txt


seemed fine here,


您太强辣


週をまたいでなにを修正したかわからなくなってしまったので、問題なく動作することを確認した上で一旦pushした。

したこと
・コメントの編集
・ヘッダー文言の編集
・ルートの編集
・doctrine/dbalの追加


Great catch!
Autofocus in HTML has it made to be initiated as focused.

Thank you!


Starting


求原来banner2的jpg图片，那个可以流动的星空，感谢哈。祝国庆愉快！


[R/berekenLSVIbasis.R:120:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L120) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>        "Aggregatiemethode moet een van de volgende waarden zijn: 'RapportageHR' of '1-out-all-out'",
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:433:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L433) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:433:123:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L433) *style:* **Put spaces around all infix operators.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ~^~
```
[R/berekenLSVIbasis.R:433:136:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L433) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ^
```
[R/berekenLSVIbasis.R:440:16:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L440) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Verschilscore + 1) / 2) ^ -1,
               ^
```
[R/berekenLSVIbasis.R:440:17:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L440) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Verschilscore + 1) / 2) ^ -1,
                ^
```
[R/berekenLSVIbasis.R:456:31:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L456) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>        Index_min_harm = mean(((.data$Index_min_criterium + 1) / 2) ^ -1,
                              ^
```
[R/berekenLSVIbasis.R:456:32:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L456) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>        Index_min_harm = mean(((.data$Index_min_criterium + 1) / 2) ^ -1,
                               ^
```
[R/berekenLSVIbasis.R:460:16:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L460) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Index_harm_criterium + 1) / 2) ^ -1,
               ^
```
[R/berekenLSVIbasis.R:460:17:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L460) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Index_harm_criterium + 1) / 2) ^ -1,
                ^
```
[R/berekenLSVIbasis.R:478:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L478) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:478:123:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L478) *style:* **Put spaces around all infix operators.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ~^~
```
[R/berekenLSVIbasis.R:478:136:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/berekenLSVIbasis.R#L478) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ^
```
[R/combinerenVerschilscore.R:35:6:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/combinerenVerschilscore.R#L35) *warning:* **local variable '%max%' assigned but may not be used**
```r
<U+200B>    `%max%` <- function(a, b) max(a, b)
     ^~~~~
```
[R/combinerenVerschilscore.R:36:6:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/combinerenVerschilscore.R#L36) *warning:* **local variable '%min%' assigned but may not be used**
```r
<U+200B>    `%min%` <- function(a, b) min(a, b)
     ^~~~~
```
[R/combinerenVoorwaarden.R:31:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/combinerenVoorwaarden.R#L31) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>    #nog testen of Formule bestaat uit EN, OF, haakjes en VoorwaardeID's (en evt. andere tekens die logische berekening toelaten)
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/invoercontroleData_voorwaarden.R:66:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/invoercontroleData_voorwaarden.R#L66) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>    #misschien best ook testen dat die indicator-criterium-voorwaarde-combinatie in de databank voorkomt?  En of deze voor dat habitattype voorkomt, maar dat best verderop doen
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/zzz.R:31:13:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/R/zzz.R#L31) *warning:* **no visible binding for global variable 'ConnectiePool'**
```r
<U+200B>  poolClose(ConnectiePool)
            ^~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R:24:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R#L24) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>      mutate(  #idee is om onderstaande code te wissen zodra de databank/rekenmodule hiervoor aangepast is
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R:190:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R#L190) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>      mutate(  #idee is om onderstaande code te wissen zodra de databank/rekenmodule hiervoor aangepast is
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenStatus_RapportageHR.R:25:9:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/inst/tests/testthat/test_berekenStatus_RapportageHR.R#L25) *style:* **Commented code should be removed.**
```r
<U+200B>#       Aggregatiemethode = "RapportageHR"
        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenStatus_RapportageHR.R:53:4:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/inst/tests/testthat/test_berekenStatus_RapportageHR.R#L53) *error:* **unexpected end of input**
```r
<U+200B>  })
   ^
```
[inst/tests/testthat/test_s4_Aantal.R:199:1:](https://github.com/inbo/LSVI/blob/6a0846da40c3052d57352afef6f5f2b0e81084f3/inst/tests/testthat/test_s4_Aantal.R#L199) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>  #nog toevoegen als het opzoeken van soorten in subniveaus opgelost is: de aggregatie van bedekkingen gebeurt correct
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```


[blog database.zip](https://github.com/CurlyDev07/blog/files/2436996/blog.database.zip)


　刚开始吧，以为kruskal很难,也就没碰,但这终究还是躲不过去的，好吧，于是乎就去看了一下kruskal的用法,发现居然用到了并查集,这不是我刚学会而且很简单的算法吗,不行,那这到kruskal也得过掉,于是看看大佬写的,我就开悟了（还是有点蒙）.

　　firstly,we need to sort(),把每条边按权值大小从小到大排序。

　　secondly,已经拍好序了,就从最小的边开始,判断第一个点和与之相连的点是否位于同一个并查集,如果不是,就统计这条边的权值，再把这个点合并到同一个并查集。恩，不用想，这个过程肯定要循环。

　　last but not least,我们知道(之前不知道)。最小生成树的的边数一定等于点数减一(不信的话你数一下)，如果多了一条边就连成一个环了，少了一条边，它就不是最小生成树了。所以看,终止条件可以 边数==点数-1(可能是洛谷那道题的数据太水了吧，我没加都过了)。

就这道题，我感觉自己写的还是有问题，之后还得改改。
```
#include<bits/stdc++.h>
using namespace std;
const int maxn=200003;
long long n,m,ans=0,fa[maxn];
int a,b,c;
struct node{
    int u,v,w;
}e[maxn];
int com(node x,node y){
    return x.w<y.w;
}
int find(int x){
    if(x!=fa[x]) fa[x]=find(fa[x]);
        return fa[x];
    }
int main(){
    int t=0; //边数，当t=n-1时退出
    cin>>n>>m;
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=1;i<=m;i++){
        cin>>a>>b>>c;
    e[i].u=a;
    e[i].v=b;
    e[i].w=c;
    }
    sort(e+1,e+m+1,com);
   for(int i=1;i<=m;i++){
       int x=find(e[i].u),y=find(e[i].v);
       if(x!=y){
           ans+=e[i].w; fa[y]=x;t++;
       }
        if(t==n-1) break;　//反正这一步没写也过了
   }
   cout<<ans;

    return 0;
}```


A leftover, will fix.


I did like you but with the Iphone app, and detecting network traffic with Wireshark. I do not know if it works with the latest firmware.

Here is the error message when I run cxn.py and maybe you will see better the cause of the error (maybe the term "RecivaRadio" is not suitable ???). I'm looking for my side, but I did not necessarily read sufficient level in programming for that.

C: \ Users \ jklm \ AppData \ Local \ Programs \ Python \ Python36 \ Scripts> py
there
<? xml version = "1.0"?>
<s: Envelope xmlns: s = "http://schemas.xmlsoap.org/soap/envelope/" s: in
"http://schemas.xmlsoap.org/soap/encoding/"><s:Body><r:GetToneCtrlBass
mln r = "urn: UuVol-com: service: UuVolControl 5"> <RetToneCtrlBass> 0 </ RETT
s>
</ R: GetToneCtrlBassResponse>
</ S: Body>
</ S: Envelope>

Traceback (most recent call last):
  File "cxn.py", line 227, in <module>
    hand()
  File "cxn.py", line 217, in main
    print (client.set_treble_test ())
  File "cxn.py", line 189, in set_treble_test
    data = self._post (data, soap_action)
  File "cxn.py", line 202, in _post
    res.raise_for_status ()
  File "C: \ Users \ cardioroyan \ AppData \ Local \ Programs \ Python \ Python36 \ li
kages \ requests \ models.py ", line 909, in raise_for_status
    raise HTTPError (http_error_msg, response = self)
requests.exceptions.HTTPError: 500 Error Server: SOAP Error for url: h
168.1.60: 8050 / 4303ebc1-8e7d-454a-xxxx-xxxxxxxxxxxx / RecivaRadio / invoke

cordially


@elswenson thanks. fixed on latest commit


@m-stein I removed this and 3cc9ca0e7c12c1dafb4de19d087f204236b57b54 from staging again for two reasons: First, we now have unexpected resource requests in scenarios with usb_drv. Second, @nfeske voiced concerns with the current implementation. Therefore, I'd like you to open a separate issue for discussion of the allocator improvements.


Esta dependencia está duplicada


freecodeCamp


Yep, I'm a newbie. 👍


First version, now able to get a train number from https://rata.digitraffic.fi/api/v1.


:tada:


Hello @agvillo, no I don't know how to calculate that checksum (if it really is).

I'm curious now, why would you want this checksum anyway?


прова


[R/berekenLSVIbasis.R:121:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L121) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>        "Aggregatiemethode moet een van de volgende waarden zijn: 'RapportageHR' of '1-out-all-out'",
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:434:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L434) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:434:123:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L434) *style:* **Put spaces around all infix operators.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ~^~
```
[R/berekenLSVIbasis.R:434:136:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L434) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ^
```
[R/berekenLSVIbasis.R:441:16:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L441) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Verschilscore + 1) / 2) ^ -1,
               ^
```
[R/berekenLSVIbasis.R:441:17:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L441) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Verschilscore + 1) / 2) ^ -1,
                ^
```
[R/berekenLSVIbasis.R:457:31:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L457) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>        Index_min_harm = mean(((.data$Index_min_criterium + 1) / 2) ^ -1,
                              ^
```
[R/berekenLSVIbasis.R:457:32:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L457) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>        Index_min_harm = mean(((.data$Index_min_criterium + 1) / 2) ^ -1,
                               ^
```
[R/berekenLSVIbasis.R:461:16:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L461) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Index_harm_criterium + 1) / 2) ^ -1,
               ^
```
[R/berekenLSVIbasis.R:461:17:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L461) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Index_harm_criterium + 1) / 2) ^ -1,
                ^
```
[R/berekenLSVIbasis.R:479:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L479) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:479:123:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L479) *style:* **Put spaces around all infix operators.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ~^~
```
[R/berekenLSVIbasis.R:479:136:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/berekenLSVIbasis.R#L479) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ^
```
[R/combinerenVerschilscore.R:35:6:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/combinerenVerschilscore.R#L35) *warning:* **local variable '%max%' assigned but may not be used**
```r
<U+200B>    `%max%` <- function(a, b) max(a, b)
     ^~~~~
```
[R/combinerenVerschilscore.R:36:6:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/combinerenVerschilscore.R#L36) *warning:* **local variable '%min%' assigned but may not be used**
```r
<U+200B>    `%min%` <- function(a, b) min(a, b)
     ^~~~~
```
[R/combinerenVoorwaarden.R:31:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/combinerenVoorwaarden.R#L31) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>    #nog testen of Formule bestaat uit EN, OF, haakjes en VoorwaardeID's (en evt. andere tekens die logische berekening toelaten)
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/invoercontroleData_voorwaarden.R:66:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/invoercontroleData_voorwaarden.R#L66) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>    #misschien best ook testen dat die indicator-criterium-voorwaarde-combinatie in de databank voorkomt?  En of deze voor dat habitattype voorkomt, maar dat best verderop doen
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/zzz.R:31:13:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/R/zzz.R#L31) *warning:* **no visible binding for global variable 'ConnectiePool'**
```r
<U+200B>  poolClose(ConnectiePool)
            ^~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R:24:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R#L24) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>      mutate(  #idee is om onderstaande code te wissen zodra de databank/rekenmodule hiervoor aangepast is
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R:190:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R#L190) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>      mutate(  #idee is om onderstaande code te wissen zodra de databank/rekenmodule hiervoor aangepast is
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenStatus_RapportageHR.R:25:9:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/inst/tests/testthat/test_berekenStatus_RapportageHR.R#L25) *style:* **Commented code should be removed.**
```r
<U+200B>#       Aggregatiemethode = "RapportageHR"
        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenStatus_RapportageHR.R:53:4:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/inst/tests/testthat/test_berekenStatus_RapportageHR.R#L53) *error:* **unexpected end of input**
```r
<U+200B>  })
   ^
```
[inst/tests/testthat/test_s4_Aantal.R:199:1:](https://github.com/inbo/LSVI/blob/b738692fbcc4527c559ebbc92438a07fa89890e7/inst/tests/testthat/test_s4_Aantal.R#L199) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>  #nog toevoegen als het opzoeken van soorten in subniveaus opgelost is: de aggregatie van bedekkingen gebeurt correct
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```


[R/berekenLSVIbasis.R:121:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L121) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>        "Aggregatiemethode moet een van de volgende waarden zijn: 'RapportageHR' of '1-out-all-out'",
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:434:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L434) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:434:123:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L434) *style:* **Put spaces around all infix operators.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ~^~
```
[R/berekenLSVIbasis.R:434:136:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L434) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ^
```
[R/berekenLSVIbasis.R:441:16:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L441) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Verschilscore + 1) / 2) ^ -1,
               ^
```
[R/berekenLSVIbasis.R:441:17:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L441) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Verschilscore + 1) / 2) ^ -1,
                ^
```
[R/berekenLSVIbasis.R:457:31:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L457) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>        Index_min_harm = mean(((.data$Index_min_criterium + 1) / 2) ^ -1,
                              ^
```
[R/berekenLSVIbasis.R:457:32:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L457) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>        Index_min_harm = mean(((.data$Index_min_criterium + 1) / 2) ^ -1,
                               ^
```
[R/berekenLSVIbasis.R:461:16:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L461) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Index_harm_criterium + 1) / 2) ^ -1,
               ^
```
[R/berekenLSVIbasis.R:461:17:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L461) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>          mean(((.data$Index_harm_criterium + 1) / 2) ^ -1,
                ^
```
[R/berekenLSVIbasis.R:479:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L479) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/berekenLSVIbasis.R:479:123:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L479) *style:* **Put spaces around all infix operators.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ~^~
```
[R/berekenLSVIbasis.R:479:136:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/berekenLSVIbasis.R#L479) *style:* **Place a space before left parenthesis, except in a function call.**
```r
<U+200B>                                         (sum(.data$Status_indicator, na.rm = na.rm) > sum(!is.na(.data$Status_indicator))/2.0) & (sum((.data$Status_indicator == FALSE) * (.data$Belang == "zb"), na.rm = na.rm) == 0),
                                                                                ^
```
[R/combinerenVerschilscore.R:35:6:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/combinerenVerschilscore.R#L35) *warning:* **local variable '%max%' assigned but may not be used**
```r
<U+200B>    `%max%` <- function(a, b) max(a, b)
     ^~~~~
```
[R/combinerenVerschilscore.R:36:6:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/combinerenVerschilscore.R#L36) *warning:* **local variable '%min%' assigned but may not be used**
```r
<U+200B>    `%min%` <- function(a, b) min(a, b)
     ^~~~~
```
[R/combinerenVoorwaarden.R:31:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/combinerenVoorwaarden.R#L31) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>    #nog testen of Formule bestaat uit EN, OF, haakjes en VoorwaardeID's (en evt. andere tekens die logische berekening toelaten)
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/invoercontroleData_voorwaarden.R:66:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/invoercontroleData_voorwaarden.R#L66) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>    #misschien best ook testen dat die indicator-criterium-voorwaarde-combinatie in de databank voorkomt?  En of deze voor dat habitattype voorkomt, maar dat best verderop doen
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[R/zzz.R:31:13:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/R/zzz.R#L31) *warning:* **no visible binding for global variable 'ConnectiePool'**
```r
<U+200B>  poolClose(ConnectiePool)
            ^~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R:24:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R#L24) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>      mutate(  #idee is om onderstaande code te wissen zodra de databank/rekenmodule hiervoor aangepast is
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R:190:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/inst/tests/testthat/test_berekenLSVIbasis_vegetatielaag.R#L190) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>      mutate(  #idee is om onderstaande code te wissen zodra de databank/rekenmodule hiervoor aangepast is
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenStatus_RapportageHR.R:25:9:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/inst/tests/testthat/test_berekenStatus_RapportageHR.R#L25) *style:* **Commented code should be removed.**
```r
<U+200B>#       Aggregatiemethode = "RapportageHR"
        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```
[inst/tests/testthat/test_berekenStatus_RapportageHR.R:53:4:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/inst/tests/testthat/test_berekenStatus_RapportageHR.R#L53) *error:* **unexpected end of input**
```r
<U+200B>  })
   ^
```
[inst/tests/testthat/test_s4_Aantal.R:199:1:](https://github.com/inbo/LSVI/blob/9de85d62f8daaf45d8a279e3c73a64914a67714f/inst/tests/testthat/test_s4_Aantal.R#L199) *style:* **lines should not be more than 80 characters.**
```r
<U+200B>  #nog toevoegen als het opzoeken van soorten in subniveaus opgelost is: de aggregatie van bedekkingen gebeurt correct
^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
```


IBM Cloud [toolchain](https://console.ng.bluemix.net/devops/toolchains/c5f7f63f-d48f-453f-bbd5-7a2483397bb9?env_id=ibm%3Ayp%3Aus-south "piva-functions-toolchain"): [Delivery Pipeline](https://console.ng.bluemix.net/devops/pipelines/ff5026a5-843c-4924-82c1-1b27376d57a2?env_id=ibm%3Ayp%3Aus-south "piva-functions-pipline") deployed [Predictive-Industrial-Visual-Analysis](https://github.com/thomassuedbroecker/Predictive-Industrial-Visual-Analysis/releases/tag/deploy-ibm-yp-us-south-thomas.suedbroecker.2-de.ibm.com-workshop-20181002-082705 "deploy-ibm-yp-us-south-thomas.suedbroecker.2-de.ibm.com-workshop-20181002-082705") to [workshop](https://console.bluemix.net/apps/1ca13402-521a-4650-9704-10be3f7f4e74?env_id=ibm:yp:us-south "ibm:yp:us-south:thomas.suedbroecker.2@de.ibm.com:workshop"), including this commit


```
    "stylus:watch": "stylus --watch src/stylus/style.styl --out dist/style.css",
```


有点跟不上大神脚步了 跟新太快了


update: should change like this

```
   "stylus:compile": "stylus src/stylus/style.styl --out dist/style.css",
```


good


@sophokles73 IMHO it would be cleaner to keep the vertx-web based RoutingContext out of this class and rather do this
- in a helper/utility class
- or in the http adapter

Otherwise we introduce some http adapter specific (and quite simple) functionality into this generic class.
How about putting it into a static helper method of the http adapter e.g.?


This is working, I get YouTube player ,
![screenshot_2018-10-02-13-26-36-500_com android chrome](https://user-images.githubusercontent.com/10223927/46337457-fda10a00-c646-11e8-8440-5e19e0bc0dee.png)
]


IBM Cloud [toolchain](https://console.ng.bluemix.net/devops/toolchains/c5f7f63f-d48f-453f-bbd5-7a2483397bb9?env_id=ibm%3Ayp%3Aus-south "piva-functions-toolchain"): [Delivery Pipeline](https://console.ng.bluemix.net/devops/pipelines/ff5026a5-843c-4924-82c1-1b27376d57a2?env_id=ibm%3Ayp%3Aus-south "piva-functions-pipline") deployed [Predictive-Industrial-Visual-Analysis](https://github.com/thomassuedbroecker/Predictive-Industrial-Visual-Analysis/releases/tag/deploy-ibm-yp-us-south-thomas.suedbroecker.2-de.ibm.com-workshop-20181002-082941 "deploy-ibm-yp-us-south-thomas.suedbroecker.2-de.ibm.com-workshop-20181002-082941") to [workshop](https://console.bluemix.net/apps/1ca13402-521a-4650-9704-10be3f7f4e74?env_id=ibm:yp:us-south "ibm:yp:us-south:thomas.suedbroecker.2@de.ibm.com:workshop"), including this commit


Vratil som to. stale ten isty problem


1. имена методов принято писать с мальнеькой буквы
2. хорошее имя метода должно говорить о его назначении
3. в чем смысл возвращаемого значения?


Not that it matters much, but this was probably unintentional :)


Remark: this dependency was previously contained in the `Command` class already (thus not introduced by this commit).


Nice update but I must point out that the metadata and the filename part of artist wasn't the same before.
The id3 tag was joined by ", " but the filename contained only the first element of the array in the list. Is this behavior intentional?


Comment on 32876ddc73c71af07576e41acd1fde1dd24fe951.

There are 73 results for the section all.cpp. They have been shortened and will not be shown inline because they are more than 10.

| Message | File | Line |
|---|---|---|
| Missing space before {  [whitespace/braces] [5] | doubly_linked_list/c/doubly_linked_list.c | 4 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 11 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 12 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 16 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 17 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 18 |
| Using C-style cast.  Use reinterpret_cast<Node *>(...) instead  [readability/casting] [4] | doubly_linked_list/c/doubly_linked_list.c | 18 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 19 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 20 |
| Missing spaces around ==  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 21 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 21 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 22 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 23 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 24 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | doubly_linked_list/c/doubly_linked_list.c | 26 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 27 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 28 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 29 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 30 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 34 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 35 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 36 |
| Using C-style cast.  Use reinterpret_cast<Node *>(...) instead  [readability/casting] [4] | doubly_linked_list/c/doubly_linked_list.c | 36 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 37 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 38 |
| Missing spaces around ==  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 39 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 39 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 40 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 41 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 42 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | doubly_linked_list/c/doubly_linked_list.c | 44 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 45 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 46 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 48 |
| Missing space before ( in while(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 48 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 49 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 51 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 56 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 57 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 58 |
| Using C-style cast.  Use reinterpret_cast<Node *>(...) instead  [readability/casting] [4] | doubly_linked_list/c/doubly_linked_list.c | 58 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 59 |
| Missing spaces around ==  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 60 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 60 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 61 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 62 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 63 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 64 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | doubly_linked_list/c/doubly_linked_list.c | 67 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 68 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 69 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 71 |
| Missing space before ( in while(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 71 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 72 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 74 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 74 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 77 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 78 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 79 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 84 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 85 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 86 |
| Missing space before ( in while(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 86 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 87 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 88 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 89 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 97 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 100 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 101 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 102 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 104 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 105 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 107 |

Until GitMate provides an online UI to show a better overview, you can run [coala](https://coala.io/) locally for more details.


Never mind. I cleaned my cache and cookies and it works sweet now. Thanks a million!


thank you so much, guy!!!!


This is exciting news :)

I'd be glad to put it to the test, but currently it's missing a method of synchronizing threads (lock, mutex, message passing - if I may give a preference, then dequeues would be perfect).


Я бы сделал основной метод в виде
```
if (isPalindrome(string)) {
    System.out.println("his is a palindrome")
} else {
    System.out.println("his is NOT a palindrome")
}
```

ну а метод `palindrome()` должен просто вернуть `boolean`


This should also accept an array with mimetypes.


谢谢^_^！！！


small typo here  "lamba"


Asc Sxb cabdi aziz seetahay


вообще правильно писать `new Vector();`


多了个不认识的字符，请删除多余空行。


не надо тут это делать, у вас же есть конструктор для этого


Comment on 162a3ecdbbd42542e71f1463d4a52be4048b5344.

There are 73 results for the section all.cpp. They have been shortened and will not be shown inline because they are more than 10.

| Message | File | Line |
|---|---|---|
| Missing space before {  [whitespace/braces] [5] | doubly_linked_list/c/doubly_linked_list.c | 4 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 11 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 12 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 16 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 17 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 18 |
| Using C-style cast.  Use reinterpret_cast<Node *>(...) instead  [readability/casting] [4] | doubly_linked_list/c/doubly_linked_list.c | 18 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 19 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 20 |
| Missing spaces around ==  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 21 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 21 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 22 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 23 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 24 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | doubly_linked_list/c/doubly_linked_list.c | 26 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 27 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 28 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 29 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 30 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 34 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 35 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 36 |
| Using C-style cast.  Use reinterpret_cast<Node *>(...) instead  [readability/casting] [4] | doubly_linked_list/c/doubly_linked_list.c | 36 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 37 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 38 |
| Missing spaces around ==  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 39 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 39 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 40 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 41 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 42 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | doubly_linked_list/c/doubly_linked_list.c | 44 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 45 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 46 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 48 |
| Missing space before ( in while(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 48 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 49 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 51 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 56 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 57 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 58 |
| Using C-style cast.  Use reinterpret_cast<Node *>(...) instead  [readability/casting] [4] | doubly_linked_list/c/doubly_linked_list.c | 58 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 59 |
| Missing spaces around ==  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 60 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 60 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 61 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 62 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 63 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 64 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | doubly_linked_list/c/doubly_linked_list.c | 67 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 68 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 69 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 71 |
| Missing space before ( in while(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 71 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 72 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 74 |
| Missing space before ( in if(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 74 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 77 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 78 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 79 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 84 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 85 |
| Missing spaces around !=  [whitespace/operators] [3] | doubly_linked_list/c/doubly_linked_list.c | 86 |
| Missing space before ( in while(  [whitespace/parens] [5] | doubly_linked_list/c/doubly_linked_list.c | 86 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 87 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 88 |
| Missing spaces around =  [whitespace/operators] [4] | doubly_linked_list/c/doubly_linked_list.c | 89 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | doubly_linked_list/c/doubly_linked_list.c | 97 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 100 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 101 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 102 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 104 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 105 |
| Missing space after ,  [whitespace/comma] [3] | doubly_linked_list/c/doubly_linked_list.c | 107 |

Until GitMate provides an online UI to show a better overview, you can run [coala](https://coala.io/) locally for more details.


你这是上哪里找的例子，你要改一下sql语句啊。我然你查时间，你查表里面的数据干啥。


ну и переменная result станет лишней когда то что выше применится


тут те же проблемы, что и в `plus`


We used a speed variable to move the circles arcross the screen


good


кусочек про `|| actor === undefined` не нужен же


аналогично ` || obj === undefined` не нужен


If the description is something like `Tesco` then a lot of people may want to classify it as groceries. How can general rules like these be extracted so that lots of people get the benefit without duplicating the same rules over and over?


bug found by running unit tests


сомнительный нейминг - `obj`


давай заиспользуем `array.prototype.find`


![](https://github.trello.services/images/mini-trello-icon.png) [작업내역 1주](https://trello.com/c/BxIOyU2R/5-%EC%9E%91%EC%97%85%EB%82%B4%EC%97%AD-1%EC%A3%BC)


Older edits to MNIST digit identification notebook also in the commit. Specifically, visualization of digits.


не надо этого делать, это делается по умолчанию


String.toString returns "this" so it's redundant..  Remember the most inefficient code is typically branching. It's just redundant code, and a redundant branch.


Hi! This is the friendly automated conda-forge-webservice.

I updated the Github team because of this commit.

- @dbast was added to this feedstock maintenance team.

You should get push access to this feedstock and CI services.

Feel free to join the community [chat room](https://gitter.im/conda-forge/conda-forge.github.io).

NOTE: Please make sure to not push to the repository directly.
      Use branches in your fork for any changes and send a PR.
      More details [here](https://conda-forge.org/docs/conda-forge_gotchas.html#using-a-fork-vs-a-branch-when-updating-a-recipe)


выглядит странно. почему просто не найти сравнением `actor === ...`, что если кто-то случайно совпадет и будет нечаянно удален?


вроде бы не нужен тернарник же, и так undefined будет


Added theme


а


it's already trimmed, see the previous line.

Why would I need to add a method call when equality on a constant is all it takes? :)


не нужно


# Specs execution successful
:scroll: [View logs](http://bamboo.comnull)
### Plans updated

Bamboo specs have been successfully imported and the following plans have been updated.

Project | Plan | Build
---|---|---
[Test](http://bamboo.com/browse/TEST) | [Comment test](http://bamboo.com/browse/TEST-CTEST)  | :white_check_mark: [\#1](http://bamboo.com/browse/TEST-CTEST-1)
[New project](http://bamboo.com/browse/NEW) | [Disabled plan](http://bamboo.com/browse/NEW-DISABLED) **disabled** | :white_check_mark: [\#1](http://bamboo.com/browse/NEW-DISABLED-1)

### Deployments updated

Bamboo specs have been successfully imported and the following deployment projects have been updated.

|Deployment project |
----|
[Deployment test](http://bamboo.com/deploy/viewDeploymentProjectVersions.action?id=2162689)|


What's that?


ssr-server 能通用吗


Please use the queue data structure for solving this problem


Why do so


Successfully aliased the URL <https://nextjs-koa-styledcomponents-qsjgqqeeze.now.sh> to the following alias.

* https://nextjs-koa-styled-components.now.sh


![](https://github.trello.services/images/mini-trello-icon.png) [As User I can delete notification](https://trello.com/c/LK76eEpD/107-as-user-i-can-delete-notification)


Transforms a 3D vector from vehicle to world coordinates.


Would there be any way to pay to have this developed further?


we may need to settle the motor to spin in reverse direction, as the robot submerge or float.


Instead of these endless repeats of  `_this select 0` you could just do it once and store it in a variable.


Great - thanks a bunch!
Tom


阴阳师人物设计


actually It's Priority Heap


use more `params` and `private` (The keyword, not the array or string version)


Thanks for pointing out.
I know, but this is ok as it is now.
It shouldn't make a difference anyway, since Spotify never gave me more
than the first artist.

Soós Ferenc <notifications@github.com> schrieb am Di., 2. Okt. 2018, 10:35:

> Nice update but I must point out that the metadata and the filename part
> of artist wasn't the same before.
> The id3 tag was joined by ", " but the filename contained only the first
> element of the array in the list. Is this behavior intentional?
>
> —
> You are receiving this because you authored the thread.
> Reply to this email directly, view it on GitHub
> <https://github.com/Bleuzen/SpotRec/commit/59589951cc441bd2362654db2b73ea240d5e2ecf#commitcomment-30730289>,
> or mute the thread
> <https://github.com/notifications/unsubscribe-auth/AMScq8qUJ4IpW6ejJAv_xaPkIfLQ5b81ks5ugyU1gaJpZM4XDkQF>
> .
>


Not 100% working solution, if the most right-bottom cell is lesser then the previous cells this logic won't catch it.

Some advices:

1. **do not mix** basic `for loop` with `forEach` if you want to do the same things in them - choose which one you use, it is easier to understand later on your code

2. if you want to **break a loop and return a value** you **have to** use a basic `for loop` - return values in `forEach` won't make any effect (test this with a simple example to see)

3. you can use more **variables with meaningful names** so it is easier to read and understand your code. Eg. instead of `elem[i - 1]` you could use `let leftCell = elem[i - 1]`

4. if you have a more complex function it is OK to use **helper functions** so you can maintain the readability of your code

I created a sample solution using the previous advices.
I do not think it is the best solution but I believe it is a good starting point to write more maintainable and readable code:

```
function isIncreasing(matrix) {
  for (let rowIndex = 0; rowIndex < matrix.length; rowIndex++) {
    for (let colIndex = 0; colIndex < matrix.length; colIndex++) {
      if (!nextCellsOk(rowIndex, colIndex, matrix)) {
        return false;
      }
    };
  };
  return true;
};

function nextCellsOk(rowIndex, colIndex, matrix) {
  return rightCellIsOk(rowIndex, colIndex, matrix) && bottomCellIsOk(rowIndex, colIndex, matrix);
}

function rightCellIsOk(rowIndex, colIndex, matrix) {
  if (colIndex === matrix.length - 1) {
    return true;
  } else {
    let cell = matrix[rowIndex][colIndex];
    let rightCell = matrix[rowIndex][colIndex + 1];
    return rightCell > cell;
  }
}

function bottomCellIsOk(rowIndex, colIndex, matrix) {
  if (rowIndex === matrix.length - 1) {
    return true;
  } else {
    let cell = matrix[rowIndex][colIndex];
    let bottomCell = matrix[rowIndex + 1][colIndex];
    return bottomCell > cell;
  }
}
```


Naming of variables should reflect the content. x_host sounds like a position but it is a velocity.


try to include https://momentjs.com


In unicorn configs in habitat I have seen the $layer and $module variables that expand very neatly to let me use convention over configuration within the "base" configuration of unicorn - that way I don't need to specify a specific path in individual feature modules for code generation.

I would like to be able choose
<setting name="Synthesis.ModelOutputBasePath" value="$(sourceFolder)/$layer/$module" />

and then in /synthesis/providers/generatorParametersProvider
<ModelOutputPath>/code/models/Synthesis.Model.cs</ModelOutputPath>

In unicorn I have seen that a HelixConventionVariablesReplacer is utilized to do the expansion, but that does not seem to apply to synthesis.

Am I missing out on some basic features/configurations/best-practice here?


@mwjames Going to PHP 7.1 means that I will no longer be able to provide the sandbox on my server. I am following Debian as a major distribution and current stable comes with PHP 7.0. That's the way it is. Since I have no intention to upgrade to PHP 7.1 and Debian 10 is expected mid 2019 I will have to move the sandbox to the server which is also running s-mw.o.

@JeroenDeDauw FYI


ｖｇｖ


I suppose, vehicle_to_world is calculated three times with the same input. Better store the result in a variable before assigning it.


the name of the function should reflect that it only rotates vectors


this is a commit comment


... roll_host, pitch_host, yaw_host)...


Database created for storing transactions


remove comment


Comment on cbdb0878a9c0ed6e4e94ab06d87559eaacc8002d.

There are 125 results for the section all.cpp. They have been shortened and will not be shown inline because they are more than 10.

| Message | File | Line |
|---|---|---|
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 6 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 8 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 13 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 13 |
| Missing space after ,  [whitespace/comma] [3] | BinarySearchTree/C/bst.c | 22 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 25 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 25 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 27 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 27 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 29 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 31 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 31 |
| Missing space before ( in while(  [whitespace/parens] [5] | BinarySearchTree/C/bst.c | 39 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 40 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 44 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 45 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 48 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 51 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 54 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 57 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 60 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 62 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 64 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 68 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 68 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 71 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 73 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 75 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 76 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 78 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 78 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 81 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 83 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 83 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 90 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 90 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 93 |
| Lines should be <= 80 characters long  [whitespace/line_length] [2] | BinarySearchTree/C/bst.c | 94 |
| Lines should be <= 80 characters long  [whitespace/line_length] [2] | BinarySearchTree/C/bst.c | 98 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 103 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 103 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 106 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 108 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 112 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 115 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 118 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 118 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 121 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 123 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 123 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 125 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 135 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 135 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 138 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 140 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 145 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 147 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 150 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 150 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 153 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 155 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 159 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 161 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 165 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 165 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 168 |
| Missing spaces around >  [whitespace/operators] [3] | BinarySearchTree/C/bst.c | 169 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 170 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 174 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 175 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 179 |
| Missing spaces around ==  [whitespace/operators] [3] | BinarySearchTree/C/bst.c | 179 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 180 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 184 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 184 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 187 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 189 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 189 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 192 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 194 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 197 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 198 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 205 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 205 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 207 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 208 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 210 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 214 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 215 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 217 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 217 |
| Redundant blank line at the end of a code block should be deleted.  [whitespace/blank_line] [3] | BinarySearchTree/C/bst.c | 217 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 219 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 220 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 227 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 227 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 229 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 230 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 232 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 236 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 244 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 244 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 246 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 246 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 247 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 250 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 254 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 255 |
| Missing spaces around =  [whitespace/operators] [4] | BinarySearchTree/C/bst.c | 256 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 262 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 262 |
| Redundant blank line at the end of a code block should be deleted.  [whitespace/blank_line] [3] | BinarySearchTree/C/bst.c | 262 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 264 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 264 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 267 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 270 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 274 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 274 |
| Weird number of spaces at line-start.  Are you using a 2-space indent?  [whitespace/indent] [3] | BinarySearchTree/C/bst.c | 277 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 277 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 280 |
| { should almost always be at the end of the previous line  [whitespace/braces] [4] | BinarySearchTree/C/bst.c | 282 |
| Line ends in whitespace.  Consider deleting these extra spaces.  [whitespace/end_of_line] [4] | BinarySearchTree/C/bst.c | 286 |
| An else should appear on the same line as the preceding }  [whitespace/newline] [4] | BinarySearchTree/C/bst.c | 286 |
| Could not find a newline character at the end of the file.  [whitespace/ending_newline] [5] | BinarySearchTree/C/bst.c | 288 |

Until GitMate provides an online UI to show a better overview, you can run [coala](https://coala.io/) locally for more details.


By switching to an int you are restricting the seek to only half of the vectors potential size on 64bit arch.


We can make $allowedMimeType an array and then use in_array to check.Nice suggestions.


"OCFL ignores" -> "OCFL validators ignore"


typo


Pourquoi la vieille couleur et pas :red_circle:?


Is the player acceleration in vehicle coordinates (mostly only x != 0)? If yes, transform to world coordinates like the velocity.


We use %w for `Non-interpolated Array of words`. So should we use %w here?


wow


In 00b22bf, I added systems `cxml-{dom,klacks,test}` that provide the old names again, but load the new systems.


![](https://github.trello.services/images/mini-trello-icon.png) [As User I can delete notification](https://trello.com/c/LK76eEpD/107-as-user-i-can-delete-notification)


Is b_seconds the same as ground_truth.timestamp.seconds? If yes, you don't need b_seconds.


typo.


Not applicable for the new data model where we have no cache for flows.


Thanks, will incorporate.


Брал отпуск чтобы закончить проект. Жена из дому чуть не выгнала. На счет стилей если научишь как надо - исправлюсь...

>Среда, 19 сентября 2018, 8:18 +03:00 от DzianisMatveyenka <notifications@github.com>:
>
>ничего себе ты css балуешься)) оказывается, много времени имеешь)) А вообще, не очень хорошо использовать style атрибут на страничках))
>—
>You are receiving this because you authored the thread.
>Reply to this email directly,  view it on GitHub , or  mute the thread .

С уважением,
Alex Zhuk
vizuwi@mail.ru


name of variables should reflect content, e.g. velocity_x


See previous instruction


Correct snapshot repository url is https://oss.sonatype.org/content/repositories/snapshot


@wsnipex
Since I'm still banned from Github for trying to help (FOSS? :)) I permit to give here some more details about Webserver and this issue.

1) RemoteAccessAllowed does handle directory traversal via URIUtils::resolvePath the issue is that it's not called for the images handler for reason 2
2) Image handler is by nature a security issue from the start due to how images are returned from Kodi. Image paths can be:
- http(s)://XXXXXXXX with link to tmdb or anything
- any path supported by Kodi for artwork. (Could be fanart.jpg in movie directory from any supported VFS provider, or even worse any path selected from GUI when updating a media art)
- embedded art in media are handled with special cases as audio@XXXXX video@XXXX (such as embedded mp3 thumbs).
3) Webserver is also used to access the content of users sources for Chorus local play / Kore offline download, this is managed via a flag in the sources (See https://github.com/wsnipex/xbmc/blob/e5f01bceaeea3a1bed01158da74c5ac9f5fb87c7/xbmc/utils/FileUtils.cpp#L133)
And there's some other cases where access is needed.

Current implementation breaks all images for all webinterface + all remotes + break many functions for all those too.

A proper short term solution for V18 as discussed since 4 years is to fix the image:// handler by adding some security things there.

Adding a blacklist to RemoteAccessAllowed to remove access to files inside Kodi directories (as passwords/ sources) is also wanted, but blacklisting /etc from that is not needed as already handled.
(There was a CVE for that is fixed, so traversal is properly handled, just not for the image:// handler).

Since I wrote RemoteAccessAllowed and was part of the other CVE fix I have some background and information that may be needed to properly fix and understand current problem.

Blacklist is also unrelated to this CVE.

Proper solution for V18:
- Add blacklist to RemoteAccessAllowed for the password.xml and sources.xml and maybe other critical internal files to Kodi if wanted.
- Update image:// handler to check:
1) http(s) urls
2) Files from sources
3) Extension checks to limit to images?

Could still break for some images user manually set from GUI but way less problematic.

For v19 better image handling for remotes/webinterface with one major constraint.
The images values could be set to media but images not yet downloaded by Kodi. Currently via image:// handler the images are first downloaded then added to cache.
New solution needs to manage that and not rely only on cache at it may not yet be present or filled.


.vscode/launch.json
Jag vet inte vad detta är, du kan bortse detta program.


@jeremyckahn

> I think it's worth pointing out that, after scrolling through this long, long list of angry comments, seemingly all of the dissenting voices of folks who are willing to show their real face appear to present as _male_. There is no risk in being a male in open source, even less if you're white, straight, and cisgendered. The CoC isn't necessarily for folks like that; it's for the folks who don't feel safe in showing who they are online for fear of the abusive comments like the ones here.

Code has no gender, nobody cares about the gender or your hair colour, people care about work, why would you go contribute to a project and then show who you are, because you are proud of it?
Also there is a double standard here, the person who wrote the CoC says it's within her right to insult developers whatever way she wants in twitter, because it's not in the project discussion?!
Aren't people suppose to be safe from harassment even if they are cis white males?

Just saying this fells like if you a white male shut up, you should be ashamed to even have a job!


Correct snapshot url is: https://oss.sonatype.org/content/repositories/snapshots


Is this needed anymore?


Comment on c85ac30ef86e347e0363a5716ea893addc76e112.

There are 24 results for the section python spacing. They have been shortened and will not be shown inline because they are more than 10.

| Message | File | Line |
|---|---|---|
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 6 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 9 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 10 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 11 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 13 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 14 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 15 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 16 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 17 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 18 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 19 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 20 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 21 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 26 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 27 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 28 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 29 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 30 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 32 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | heap_sort/python/heap_sort.py | 33 |
| Line contains following spacing inconsistencies: - No newline at EOF. | heap_sort/python/heap_sort.py | 40 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | shell_sort/Python/shell_sort.py | 4 |
| Line contains following spacing inconsistencies: - Trailing whitespaces. | shell_sort/Python/shell_sort.py | 20 |
| Line contains following spacing inconsistencies: - No newline at EOF. | shell_sort/Python/shell_sort.py | 22 |

Until GitMate provides an online UI to show a better overview, you can run [coala](https://coala.io/) locally for more details.