discorpsee

# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and Webstorm
# Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839

# User-specific stuff:
.idea/**/workspace.xml
.idea/**/tasks.xml
.idea/dictionaries

# Sensitive or high-churn files:
.idea/**/dataSources/

discorpsee

function program(robot) {
    var scanner = robot.getScanner();
    var mem = robot.getMemory();
    var dest = scanner.getGold();
    if (dest.length === 0 || scanner.getLaserMachines().length > 0 || dest.length > 6) {
        dest = scanner.getExit();
    }
    var finish = scanner.getShortestWay(dest[0]);
    if (!mem.has("gol")) {
        mem.save("gol", finish);

discorpsee

@WebFilter(filterName = "/LoginFilter", urlPatterns = "/Controller")
public class LogInFilter implements javax.servlet.Filter {
    public LogInFilter() {
    }
    public void destroy() {
    }

    public void doFilter(ServletRequest request, ServletResponse response, FilterChain chain)
            throws IOException, ServletException {
        String action = request.getParameter("command");

discorpsee

 /// <summary>
        /// Начало игры
        /// </summary>
        public void StartSteps()
        {
            _isRun = true;
            // Поток модели (для запуска в отдельном от вью потоке)
            // Стоит вынести в метод
            _modelThread = new Thread(new ThreadStart(delegate
            {

discorpsee

using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Diagnostics;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;

discorpsee

    public class DynamicArray<T>: IMyList<T>, IEnumerable<T>, IEnumerable
    {
        private static readonly Func<int, int> IncFunc = x => x * 2;
        private const int DefaultCapacity = 8;
        private T[] _items;
        private int _size;
        /// <summary>
        /// The number of times this list has been structurally modified.
        /// </summary>
        private int _modCount;

discorpsee

100x100 fillFactor = 0.15

Benchmark                                     Mode  Cnt   Score   Error   Units
SearcherBench.mergeSearcher                  thrpt   10   0,020 ? 0,001  ops/ms
SearcherBench.nonRecursiveSearcher           thrpt   10   1,549 ? 0,048  ops/ms
SearcherBench.nonRecursiveSearcherOptimised  thrpt   10   1,358 ? 0,043  ops/ms
SearcherBench.recursiveSearcher              thrpt   10   1,820 ? 0,046  ops/ms
SearcherBench.mergeSearcher                   avgt   10  39,331 ? 1,608   ms/op
SearcherBench.nonRecursiveSearcher            avgt   10   0,648 ? 0,018   ms/op
SearcherBench.nonRecursiveSearcherOptimised   avgt   10   0,752 ? 0,033   ms/op

discorpsee

public class GroupsSearcher implements Searcher {
    public GroupsSearcher() {
    }

    @Override
    public Group[] createGroups(ReviewSector reviewSector) {
        List<Group> groups = createListGroups(reviewSector);
        return groups.toArray(new Group[groups.size()]);
    }

discorpsee

package com.epam.learning;

import org.springframework.stereotype.Controller;
import org.springframework.ui.Model;
import org.springframework.web.bind.annotation.*;

@Controller
public class RestController {
    @GetMapping("/write")
    @ResponseBody

discorpsee

;Определить функцию, удаляющую из списка все элементы, входящие в список ровно один раз
;	а) для элементов верхнего уровня списка
;	b) для списка, содержащего подсписки.

(defun flat (Lsp &optional acc) 
  (cond ((null Lsp) acc) ; дошли до конца - возвращаем acc
        ((atom Lsp) (cons Lsp acc)) ; Lsp - атом -> acc + Lsp
        ((flat (car Lsp) (flat (cdr Lsp) acc))))) ; иначе вызываем flat где w = первый элемент Lsp, acc = (flat (cdr Lsp) acc)
 
(defun nonunique (Lsp &optional (v Lsp)) ; по умолчанию v = Lsp (исходный список)