Skip to content

Instantly share code, notes, and snippets.

View flymio's full-sized avatar

Roman Borisoglebskyi flymio

4 followers · 3 following
View GitHub Profile
@flymio
flymio / gist:78c55b10e0a17b108101615b564f1d92
Created December 30, 2021 08:02
errors.txt
192.168.48.5 - 30/Dec/2021:10:53:36 +0300 "GET /index.php" 200
NOTICE: PHP message: PHP Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 16384 bytes) in /web/app/lib/base.php on line 2881
NOTICE: PHP message: PHP Stack trace:
NOTICE: PHP message: PHP 1. {main}() /web/public/index.php:0
NOTICE: PHP message: PHP 2. Base->run() /web/public/index.php:196
NOTICE: PHP message: PHP 3. Base->call($func = 'BackendController->orders', $args = [0 => class Base { private $hive = [...]; private $init = [...]; private $languages = [...]; private $locks = [...]; private $fallback = 'en' }, 1 => [0 => '/backend/plugins/orders', 'name' => 'orders'], 2 => 'BackendController->orders'], $hooks = 'underroute,beforeroute,afterroute') /web/app/lib/base.php:1727
NOTICE: PHP message: PHP 4. BackendController->orders(class Base { private $hive = ['HEADERS' => [...], 'LANGUAGE' => 'ru-RU,ru,en-US,en', 'AGENT' => 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) C
@flymio
flymio / basket.js
Last active October 8, 2021 14:31
sep = Brackets.templateLiteral;
// склонение числительных
function declOfNum(number, titles) {
cases = [2, 0, 1, 1, 1, 2];
return titles[ (number%100>4 && number%100<20)? 2 : cases[(number%10<5)?number%10:5] ];
}
// всякая херня типа расчета суммы заказа (товары+доставка) и пр. - макросы
Brackets.addFilter('priceQ', function (price, quantity) {
return (parseFloat(price) * parseFloat(quantity)).toFixed(2);
@flymio
flymio / longest-substring-without-repeating-characters.php
Created February 19, 2019 22:09
solution for https://leetcode.com/problems/longest-substring-without-repeating-characters/submissions/
<?
function lengthOfLongestSubstring($s) {
$a = str_split($s);
$max = '';
$cur = '';
$ch = '';
for($i=0;$i<sizeof($a);$i++){
$g = explode($a[$i],$cur);
@flymio
flymio / test_buttons_resize.html
Last active February 8, 2019 18:07
<body>
<style>
body, html {
background: white;
}
.resizable {
background: transparent;
position: absolute;
}
@flymio
flymio / divisible-sum-pairs.pl
Created January 21, 2019 15:57
solution for https://www.hackerrank.com/challenges/divisible-sum-pairs/
#!/usr/bin/perl
use Data::Dumper;
use strict;
use warnings;
# Complete the divisibleSumPairs function below.
sub divisibleSumPairs {
my $n = shift;
my $k = shift;
my $ar = shift;
@flymio
flymio / the-birthday-bar.php
Created January 21, 2019 15:31
solution for https://www.hackerrank.com/challenges/the-birthday-bar/
<?php
// Complete the birthday function below.
function birthday($s, $d, $m) {
$tot = 0;
for($i=0;$i<=sizeof($s)-1;$i++){
$cnt=1;$sum=$s[$i];$ok=0;
for($j=$i+1;$j<=sizeof($s)-1;$j++)
{
$cnt++;
@flymio
flymio / sock-merchant.php
Created January 3, 2019 18:02
solution for https://www.hackerrank.com/challenges/sock-merchant/
<?php
// Complete the sockMerchant function below.
function sockMerchant($n, $ar) {
$arnew = array();
$cnt=0;
foreach($ar as $val){
if (isset($arnew[$val])){
$cnt++;
unset($arnew[$val]);
@flymio
flymio / breaking-best-and-worst-records.php
Created January 2, 2019 14:33
solution for https://www.hackerrank.com/challenges/breaking-best-and-worst-records
<?php
// Complete the breakingRecords function below.
function breakingRecords($scores) {
$max = $scores[0]; $min = $scores[0];
$max_count=0;
$min_count=0;
foreach($scores as $value){
if ($value>$max){
$max=$value; $max_count++;
@flymio
flymio / between_two_sets.php
Created October 7, 2018 00:09
solution for https://www.hackerrank.com/challenges/between-two-sets/
<?php
/*
* Complete the getTotalX function below.
*/
function getTotalX($a, $b) {
$f = lcm($a);
$l = gcd($b);
$count = 0;
@flymio
flymio / kangaroo.php
Created October 6, 2018 23:20
https://www.hackerrank.com/challenges/kangaroo/
<?php
// Complete the kangaroo function below.
function kangaroo($x1, $v1, $x2, $v2) {
$xc1=$x1; $xc2=$x2;
for($i=$x1;$i<$x2;$i++){
$xc1+=$v1;
$xc2+=$v2;
if ($xc1==$xc2) return "YES";
}