4zMDFINjIuMjM0eiIvPjxwb2x5Z29uIGNsYXNzPSJzdDEiIHBvaW50cz0iNDIuNzI4LDQ0Ljk5OSAzOS4xOTMsNDguNTM1IDQ2Ljc0Nyw1Ni4wOSA2Mi43ODcsNDAuNTA2IDU5LjMwMywzNi45MiA0Ni43OTgsNDkuMDY4ICIvPjwvZz48L2c+PC9zdmc+)}.prod-icon.TestLeft.empty,.prod-icon.tl.empty{background-image:url("data:image/svg+xml;charset=utf8,%3Csvg version='1.1' id='Layer_1' xmlns='http://www.w3.org/2000/svg' xmlns:xlink='http://www.w3.org/1999/xlink' x='0px' y='0px' viewBox='0 0 96 96' style='enable-background:new 0 0 96 96;' xml:space='preserve'%3E%3Cg%3E%3Cg%3E%3Cg%3E%3Cg%3E%3Cg%3E%3Crect x='2.955' y='2.949' fill='rgba(255,255,255,0)' width='90.089' height='90.101'/%3E%3C/g%3E%3C/g%3E%3Cpath class='st2' d='M90.162,5.877l-0.086,84.299L5.794,89.963L5.88,5.877H90.162z M96,0h-5.048H5.048H0v5.047v85.906V96h5.048h85.904H96v-5.047V5.047V0L96,0z'/%3E%3C/g%3E%3C/g%3E%3Cg%3E%3Cpolygon class='st2' points='80.201,45.796 84.21,40.057 79.859,29.503 72.999,28.245 69.957,25.182 68.736,18.285 58.194,13.877 52.438,17.858 48.124,17.843 42.398,13.839 31.839,18.16 30.572,25.045 26.954,28.638 30.48,32.185 35.206,27.489 36.263,21.754 41.769,19.501 46.542,22.838 53.99,22.862 58.79,19.546 64.288,21.844 65.309,27.594 70.553,32.878 76.275,33.929 78.546,39.435 75.206,44.214 75.182,51.661 78.495,56.47 76.197,61.964 70.46,62.955 65.165,68.23 64.112,73.954 58.597,76.21 53.836,72.856 46.378,72.856 41.573,76.167 36.075,73.868 35.065,68.126 30.382,63.38 26.822,66.891 30.411,70.528 31.622,77.425 42.164,81.833 47.936,77.856 52.254,77.856 57.958,81.874 68.536,77.545 69.798,70.669 72.867,67.613 79.752,66.424 84.159,55.879 80.187,50.113 '/%3E%3Cpath class='st2' d='M62.234,47.6c0,7.334-5.966,13.301-13.3,13.301S35.633,54.934,35.633,47.6S41.6,34.3,48.934,34.


# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved

import torch

class _InfiniteSampler(torch.utils.data.Sampler):
    """Wraps another Sampler to yield an infinite stream."""
    def __init__(self, sampler):
        self.sampler = sampler

    def __iter__(self):
        while True:
            for batch in self.sampler:
                yield batch

class InfiniteDataLoader:
    def __init__(self, dataset, weights, batch_size, num_workers):
        super().__init__()

        if weights is not None:
            sampler = torch.utils.data.WeightedRandomSampler(weights,
                replacement=True,
                num_samples=batch_size)
        else:
            sampler = torch.utils.data.RandomSampler(dataset,
                replacement=True)

        if weights == None:
            weights = torch.ones(len(dataset))

        batch_sampler = torch.utils.data.BatchSampler(
            sampler,
            batch_size=batch_size,
            drop_last=True)

        self._infinite_iterator = iter(torch.utils.data.DataLoader(
            dataset,
            num_workers=num_workers,
            batch_sampler=_InfiniteSampler(batch_sampler)
        ))

    def __iter__(self):
        while True:
            yield next(self._infinite_iterator)

    def __len__(self):
        raise ValueError

class FastDataLoader:
    """DataLoader wrapper with slightly improved speed by not respawning worker
    processes at every epoch."""
    def __init__(self, dataset, batch_size, num_workers):
        super().__init__()

        batch_sampler = torch.utils.data.BatchSampler(
            torch.utils.data.RandomSampler(dataset, replacement=False),
            batch_size=batch_size,
            drop_last=False
        )

        self._infinite_iterator = iter(torch.utils.data.DataLoader(
            dataset,
            num_workers=num_workers,
            batch_sampler=_InfiniteSampler(batch_sampler)
        ))

        self._length = len(batch_sampler)

    def __iter__(self):
        for _ in range(len(self)):
            yield next(self._infinite_iterator)

    def __len__(self):
        return self._length


UMENT;
    return (Tvg_Result) reinterpret_cast<Shape*>(paint)->strokeMiterlimit(ml);
}

TVG_API Tvg_Result tvg_shape_get_stroke_miterlimit(const Tvg_Paint* paint, float* ml)
{
    if (!paint || !ml) return TVG_RESULT_INVALID_ARGUMENT;
    *ml = reinterpret_cast<const Shape*>(paint)->strokeMiterlimit();
    return TVG_RESULT_SUCCESS;
}

TVG_API Tvg_Result tvg_shape_set_fill_color(Tvg_Paint* paint, uint8_t r, uint8_t g, uint8_t b, uint8_t a)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<Shape*>(paint)->fill(r, g, b, a);
}

TVG_API Tvg_Result tvg_shape_get_fill_color(const Tvg_Paint* paint, uint8_t* r, uint8_t* g, uint8_t* b, uint8_t* a)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<const Shape*>(paint)->fillColor(r, g, b, a);
}

TVG_API Tvg_Result tvg_shape_set_fill_rule(Tvg_Paint* paint, Tvg_Fill_Rule rule)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<Shape*>(paint)->fill((FillRule)rule);
}

TVG_API Tvg_Result tvg_shape_get_fill_rule(const Tvg_Paint* paint, Tvg_Fill_Rule* rule)
{
    if (!paint || !rule) return TVG_RESULT_INVALID_ARGUMENT;
    *rule = (Tvg_Fill_Rule) reinterpret_cast<const Shape*>(paint)->fillRule();
    return TVG_RESULT_SUCCESS;
}

TVG_API Tvg_Result tvg_shape_set_paint_order(Tvg_Paint* paint, bool strokeFirst)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<Shape*>(paint)->order(strokeFirst);
}

TVG_API Tvg_Result tvg_shape_set_linear_gradient(Tvg_Paint* paint, Tvg_Gradient* gradient)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<Shape*>(paint)->fill(unique_ptr<LinearGradient>((LinearGradient*)(gradient)));
}

TVG_API Tvg_Result tvg_shape_set_radial_gradient(Tvg_Paint* paint, Tvg_Gradient* gradient)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<Shape*>(paint)->fill(unique_ptr<RadialGradient>((RadialGradient*)(gradient)));
}

TVG_API Tvg_Result tvg_shape_get_gradient(const Tvg_Paint* paint, Tvg_Gradient** gradient)
{
   if (!paint || !gradient) return TVG_RESULT_INVALID_ARGUMENT;
   *gradient = (Tvg_Gradient*)(reinterpret_cast<const Shape*>(paint)->fill());
   return TVG_RESULT_SUCCESS;
}

/************************************************************************/
/* Picture API                                                          */
/************************************************************************/

TVG_API Tvg_Paint* tvg_picture_new()
{
    return (Tvg_Paint*) Picture::gen().release();
}

TVG_API Tvg_Result tvg_picture_load(Tvg_Paint* paint, const char* path)
{
    if (!paint) return TVG_RESULT_INVALID_ARGUMENT;
    return (Tvg_Result) reinterpret_cast<Picture*>(paint)->load(


INESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
//  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
//  OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
//  OF THE POSSIBILITY OF SUCH DAMAGE.

#if defined(__i386__) && !defined(__x86_64__)

    .text
    .align 4, 0x00

/* void epub_sys_cache_invalidate(void* start, size_t len) */

    .globl  epub_sys_cache_invalidate
epub_sys_cache_invalidate:
    // this is a NOP on Intel processors, since the intent is to make data executable
    // and Intel L1Is are coherent with L1D.
    ret

/* void epub_sys_cache_flush(void* start, size_t len) */

    .globl epub_sys_cache_flush
epub_sys_cache_flush:
    movl    8(%esp),%ecx        // %exc <- len
    movl    4(%esp),%edx        // %edx <- start
    testl   %ecx,%ecx           // length == 0 ?
    jz      2f                  // if length == 0 return

    mfence                      // ensure previous stores complete before we flush
    clflush -1(%edx, %ecx)      // make sure last line is flushed

1:
    clflush (%edx)              // flush one line
    addl    $64,%edx            // step to next line
    subl    $64,%ecx            // drop count by one line
    ja      1b                  // repeat while %ecx > 0
    mfence                      // mfence when done, to ensure our flushes precede later stores
2:
    ret

#endif


/*
 * Copyright 2017 Google Inc.
 * Copyright 2020 The Open GEE Contributors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#ifndef KHSRC_FUSION_KHRASTER_MAGNIFYTILE_H__
#define KHSRC_FUSION_KHRASTER_MAGNIFYTILE_H__

#include <notify.h>
#include <khTileAddr.h>
#include <khraster/MagnifyQuadrant.h>

// ****************************************************************************
// ***  MagnifyTile
// ****************************************************************************
template <class MagnifyWeighting, class TileType>
static void
MagnifyTile_ImageryAlpha(const khTileAddr &targetAddr,
                         unsigned int srcLevel,
                         TileType* tiles[],
                         unsigned int startIndex)
{
  while (srcLevel < targetAddr.level) {
    // Determine the magnification quad by mapping the
    // target row/col to the level just above the src_level
    khTileAddr tmpAddr(targetAddr.MinifiedToLevel(srcLevel+1));

    // Then using even/odd addresses to determine
    // the quadrant:
    // SW:0  SE:1  NW:2  NE:3
    unsigned int quad = (tmpAddr.row & 0x1)*2 + (tmpAddr.col & 0x1);

    MagnifyQuadrant_ImageryAlpha<MagnifyWeighting>
      (*tiles[(startIndex+1)%2], *tiles[startIndex], quad);

    // switch which buffer is my source and which is my destination
    startIndex = (startIndex+1) %2;

    srcLevel++;
  }
}

#endif // !KHSRC_FUSION_KHRASTER_MAGNIFYTILE_H__


chất lượng của game. Chỉ đọc / dùng để tham khảo.
        ]]
    },
    {"King of Stackers",
        "nhom06 kos kingofstackers",
        "game",
        [[
Chơi trên trình duyệt | Chơi trực tuyến | Hỗ trợ màn hình cảm ứng

Gọi tắt là KoS. Một game xếp gạch chơi trên trình duyệt theo lượt. Về cơ bản: người chơi sẽ thay phiên nhau đặt các gạch trong bảng của họ theo chu kỳ 7 gạch. Hàng rác chỉ có thể vào bảng khi một gạch được đặt mà không xóa một hàng nào. Trò chơi mang tính chiến lược cao và có các tùy chọn khác nhau cho cơ chế tấn công.
        ]],
        "https://kingofstackers.com/games.php",
    },
    {"Tetr.js",
        "nhom06 tetrjs tetr.js",
        "game",
        [[
Chơi trên trình duyệt | Chơi đơn | Hỗ trợ màn hình cảm ứng

Một game xếp gạch chơi trên trình duyệt với nhiều điều chỉnh và chế độ chuyên nghiệp.
Liên kết của mục này sẽ đưa bạn tới bản của Farter (bản này là một bản đã mod, đã thêm một vài chế độ khác)
Bạn cũng có thể tìm một phiên bản khác có tên là "Tetr.js Enhanced" - bản mod này do Dr Ocelot làm (đã bị gỡ xuống và thay thế bằng Tetra Legends, nhưng cũng bị dừng phát triển hoàn toàn từ T12 / 2020)

[MrZ: Giao diện đơn giản với hầu như không có bất kỳ animation nào.
Chỉ có một số tổ hợp phím ảo khả dụng cho thiết bị di động.]
        ]],
        "http://farter.cn/t",
    },
    {"Tetra Legends",
        "nhom06 tl tetralegends",
        "game",
        [[
Chơi trên trình duyệt | Chơi đơn

Gọi tắt là TL. Một tựa game chứa nhiều chế độ chơi đơn + 2 chế độ nhịp điệu. Nó cũng hình dung các cơ chế thường ẩn trong các trò chơi Tetris khác. Quá trình phát triển đã dừng lại hoàn toàn từ T12 / 2020.
        ]],
        "https://tetralegends.app",
    },
    {"Ascension",
        "nhom06 asc",
        "game",
        [[
Chơi trên trình duyệt | Chơi đơn / Chơi trực tuyến

Gọi tắt là ASC. Game sử dụng hệ thống xoay có tên là ASC và có nhi


c;
    font-weight: 700;
    font-size: 16px;
    font-family: "Archivo", -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, "Helvetica Neue", Arial, "Noto Sans", sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol", "Noto Color Emoji";
  }
}

.card-minimal-three {
  border-color: #e2e8f5;
  width: calc(100vw - 38px);

  .card-header {
    border-bottom: 1px solid #e2e8f5;
    background-color: transparent;
    padding: 20px 20px 0;

    .main-content-text {
      margin-bottom: 20px;
    }
  }

  .main-nav-tabs {
    padding: 0;
    background-color: transparent;
    position: relative;
    margin-left: -15px;
    margin-right: -15px;
    margin-bottom: 3px;

    .lSAction > a {
      background-color: #e2e8f5;

      &::before {
        top: -4px;
      }

      &.lSPrev {
        left: -35px;
      }
    }

    .tab-item {
      min-width: 203px;
    }

    .tab-link {
      background-color: #e3e7ed;
      font-weight: 500;
      align-items: flex-start;
      padding-top: 8px;

      &:hover {
        background-color: #e2e8f5;
      }

      &.active {
        background-color: #596882;
        color: $white;

        &:hover, &:focus {
          background-color: #596882;
          color: $white;
        }
      }
    }
  }

  .card-body {
    padding: 0;
  }

  .tab-pane-header {
    padding: 20px;
    background-color: $white;
    border-bottom: 1px solid #e2e8f5;

    .main-content-label, .card-table-two .card-title {
      margin-bottom: 3px;
    }
  }
}

@media (min-width: 992px) {
  .card-minimal-three {
    width: 634px;
  }
}

@media (min-width: 1200px) {
  .card-minimal-three {
    width: 753px;
  }
}

@media (min-width: 576px) {
  .card-minimal-three .main-nav-tabs .tab-item {
    min-width: 150px;
  }
}

@media (min-width: 576px) {
  .card-minimal-three .tab-pane-header {
    display: flex;
    align-items: center;
    justify-content: space-between;
  }
}

.card-table-two .card-minimal-three .tab-pane-header .card-title, .card-minimal-three .tab-pane-header .card-dashboard-eight .card-title, .card-dashboard-eight .card-minimal-three .tab-pane-header .card-title {
  margin-bottom: 3px;
}

.card-minimal-three {
  .tab-pane-header > div:last-child {
    display: flex;
    margin-top: 15px;

    a {
      flex: 1;

      + a {
        margin-left: 10px;
      }
    }
  }

  .tab-pane-body {
    padding: 20px;

    .table {
      thead tr {
        th, td {
          white-space: nowrap;
        }
      }

      tbody tr {
        th, td {
          white-space: nowrap;
        }
      }
    }
  }

  .no-transactions-panel {
    height: 200px;
    display: flex;
    align-items:


/ Get the scancode corresponding to the given key code according to the
    /// current keyboard layout.
    ///
    /// Note that there may be multiple scancode+modifier states that can generate
    /// this keycode, this will just return the first one found.
    ///
    /// @param key the desired SDL_Keycode to query.
    /// @param modstate a pointer to the modifier state that would be used when the
    /// scancode generates this key, may be NULL.
    /// @return the SDL_Scancode that corresponds to the given SDL_Keycode.
    ///
    /// @threadsafety This function is not thread safe.
    ///
    /// @since This function is available since SDL 3.2.0.
    ///
    /// @see #getKeyFromScancode
    /// @see #getScancodeName
    public @EnumType(SDL_Scancode.class) int getScancodeFromKey(
        @EnumType(SDL_Keycode.class) int key,
        @Nullable @EnumType(SDL_Keymod.class) IntPtr modstate
    ) {
        MethodHandle hFunction = Objects.requireNonNull(HANDLE$SDL_GetScancodeFromKey);
        try {
            return (int) hFunction.invokeExact(
                key,
                (MemorySegment) (modstate != null ? modstate.segment() : MemorySegment.NULL)
            );
        } catch (Throwable e) {
            throw new RuntimeException(e);
        }
    }

    /// Set a human-readable name for a scancode.
    ///
    /// @param scancode the desired SDL_Scancode.
    /// @param name the name to use for the scancode, encoded as UTF-8. The string
    /// is not copied, so the pointer given to this function must stay
    /// valid while SDL is being used.
    /// @return true on success or false on failure; call SDL_GetError() for more
    /// information.
    ///
    /// @threadsafety This function is not thread safe.
    ///
    /// @since This function is available since SDL 3.2.0.
    ///
    /// @see #getScancodeName
    public @NativeType("boolean") boolean setScancodeName(
        @EnumType(SDL_Scancode.class) int scancode,
        @Nullable BytePtr name
    ) {
        MethodHandle hFunction = Objects.requireNonNull(HANDLE$SDL_SetScancodeName);
        try {
            return (boolean) hFunction.invokeExact(
                scancode,
                (MemorySegment) (name != null ? name.segment() : MemorySegment.NULL)
            );
        } catch (Throwable e) {
            throw new RuntimeException(e);
        }
    }

    /// Get a human-readable name for a scancode.
    ///
    /// **Warning**: The returned name is by design not stable across platforms,
    /// e.g. the name for `SDL_SCANCODE_LGUI` is "Left GUI" under Linux but "Left
    /// Windows" under Microsoft Windows, and some scancodes like
    /// `SDL_SCANCODE_NONUSBACKSLASH` don't have any name at all. There are even
    /// scancodes that share names, e.g. `SDL_SCANCODE_RETURN` and
    /// `SDL_SCANCODE_RETURN2` (both called "Return"). This function is therefore
    /// unsuitable for creating a stable cross-platform two-way mapping between
    /// strings and scancodes.
    ///
    /// @param scancode the desired SDL_Scancode to query.
    /// @return a pointer to the name for the scancode. If the scancode doesn't
    /// have a name this function returns an empty string ("").
    ///
    /// @threadsafety This function is not thread safe.
    ///
    /// @since This function is available since SDL 3.2.0.
    ///
    /// @see #getScancodeFromKey
    /// @see #getScancodeFromName
    /// @see #setScancodeName
    public BytePtr getScancodeName(
        @EnumType(SDL_Scancode.class) int scancode
    ) {
        MethodHandle hFunction = Objects.requireNonNull(HANDLE$SDL_GetSc


/* Copyright (C) 1994, 1995, 1997, 1998, 1999, 2000, 2001, 2002, 2003,
   2004, 2005, 2006
   Free Software Foundation, Inc.

This file is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.

In addition to the permissions in the GNU General Public License, the
Free Software Foundation gives you unlimited permission to link the
compiled version of this file into combinations with other programs,
and to distribute those combinations without any restriction coming
from the use of this file.  (The General Public License restrictions
do apply in other respects; for example, they cover modification of
the file, and distribution when not linked into a combine
executable.)

This file is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; see the file COPYING.  If not, write to
the Free Software Foundation, 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.  */

!! libgcc routines for the Renesas / SuperH SH CPUs.
!! Contributed by Steve Chamberlain.
!! sac@cygnus.com

!! ashiftrt_r4_x, ___ashrsi3, ___ashlsi3, ___lshrsi3 routines
!! recoded in assembly by Toshiyasu Morita
!! tm@netcom.com

/* SH2 optimizations for ___ashrsi3, ___ashlsi3, ___lshrsi3 and
   ELF local label prefixes by J"orn Rennecke
   amylaar@cygnus.com  */

/* This code used shld, thus is not suitable for SH1 / SH2.  */

/* Signed / unsigned division without use of FPU, optimized for SH4.
   Uses a lookup table for divisors in the range -128 .. +128, and
   div1 with case distinction for larger divisors in three more ranges.
   The code is lumped together with the table to allow the use of mova.  */
#ifdef CONFIG_CPU_LITTLE_ENDIAN
#define L_LSB 0
#define L_LSWMSB 1
#define L_MSWLSB 2
#else
#define L_LSB 3
#define L_LSWMSB 2
#def


────────────────────────────────────────────────────────────────
		|   Fields
		───────────────────────────────────────────────────────────────────────────────────────────────────────────── */

		[SerializeField] private string propertyName;
		[SerializeField] private bool ascending;

		/* ─────────────────────────────────────────────────────────────────────────────────────────────────────────────
		|   Properties
		───────────────────────────────────────────────────────────────────────────────────────────────────────────── */

		/// <summary>
		/// The name of the property to sort.
		/// </summary>
		public string PropertyName => propertyName;

		/// <summary>
		/// Should it sort ascending.
		/// </summary>
		public bool SortAscending => ascending;

		/* ─────────────────────────────────────────────────────────────────────────────────────────────────────────────
		|   Constructors
		───────────────────────────────────────────────────────────────────────────────────────────────────────────── */

		/// <summary>
		/// Makes a new sort property when called.
		/// </summary>
		/// <param name="property">The property name to sort by.</param>
		/// <param name="sortAscending">Should it sort ascending.</param>
		public NotionSortProperty(string property, bool sortAscending)
		{
			propertyName = property;
			ascending = sortAscending;
		}
	}
}


       return this;

            this.costList[index] = cost;

            return this;
        }

        private int GetIndex(IConnectable condition)
        {
            for (var i = 0; i < this.actionIndexList.Count; i++)
            {
                if (this.actionIndexList[i] == condition)
                    return i;
            }

            return -1;
        }

        public float[] Build()
        {
            return this.costList;
        }

        public void Clear()
        {
            for (var i = 0; i < this.costList.Length; i++)
            {
                this.costList[i] = 1f;
            }
        }
    }
}


unused_element, deprecated_member_use, deprecated_member_use_from_same_package, use_function_type_syntax_for_parameters, unnecessary_const, avoid_init_to_null, invalid_override_different_default_values_named, prefer_expression_function_bodies, annotate_overrides, invalid_annotation_target, unnecessary_question_mark

part of 'usps_service_info.dart';

// **************************************************************************
// FreezedGenerator
// **************************************************************************

T _$identity<T>(T value) => value;

final _privateConstructorUsedError = UnsupportedError(
    'It seems like you constructed your class using `MyClass._()`. This constructor is only meant to be used by freezed and you are not supposed to need it nor use it.\nPlease check the documentation here for more information: https://github.com/rrousselGit/freezed#adding-getters-and-methods-to-our-models');

/// @nodoc
mixin _$USPSAuthData {
  String get username => throw _privateConstructorUsedError;
  String get companyName => throw _privateConstructorUsedError;

  @JsonKey(ignore: true)
  $USPSAuthDataCopyWith<USPSAuthData> get copyWith =>
      throw _privateConstructorUsedError;
}

/// @nodoc
abstract class $USPSAuthDataCopyWith<$Res> {
  factory $USPSAuthDataCopyWith(
          USPSAuthData value, $Res Function(USPSAuthData) then) =
      _$USPSAuthDataCopyWithImpl<$Res, USPSAuthData>;
  @useResult
  $Res call({String username, String companyName});
}

/// @nodoc
class _$USPSAuthDataCopyWithImpl<$Res, $Val extends USPSAuthData>
    implements $USPSAuthDataCopyWith<$Res> {
  _$USPSAuthDataCopyWithImpl(this._value, this._then);

  // ignore: unused_field
  final $Val _value;
  // ignore: unused_field
  final $Res Function($Val) _then;

  @pragma('vm:prefer-inline')
  @override
  $Res call({
    Object? username = null,
    Object? companyName = null,
  }) {
    return _then(_value.copyWith(
      username: null == username
          ? _value.username
          : username // ignore: cast_nullable_to_non_nullable
              as String,
      companyName: null == companyName
          ? _value.companyName
          : companyName // ignore: cast_nullable_to_non_nullable
              as String,
    ) as $Val);
  }
}

/// @nodoc
abstract class _$$USPSAuthDataImplCopyWith<$Res>
    implements $USPSAuthDataCopyWith<$Res> {
  factory _$$USPSAuthDataImplCopyWith(
          _$USPSAuthDataImpl value, $Res Function(_$USPSAuthDataImpl) then) =
      __$$USPSAuthDataImplCopyWithImpl<$Res>;
  @override
  @useResult
  $Res call({String username, String companyName});
}

/// @nodoc
class __$$USPSAuthDataImplCopyWithImpl<$Res>
    extends _$USPSAuthDataCopyWithImpl<$Res, _$USPSAuthDataImpl>
    implements _$$USPSAuthDataImplCopyWith<$Res> {
  __$$USPSAuthDataImplCopyWithImpl(
      _$USPSAuthDataImpl _value, $Res Function(_$USPSAuthDataImpl) _then)
      : super(_value, _then);

  @pragma('vm:prefer-inline')
  @override
  $Res call({
    Object? username = null,
    Object? companyName = null,
  }) {
    return _then(_$USPSAuthDataImpl(
      username: null == username
          ? _value.username
          : username // ignore: cast_nullable_to_non_nullable
              as String,
      companyName: null == companyName
          ? _value.companyName
          : companyName // ignore: cast_nullable_to_non_nullable
              as String,
    ));
  }
}

/// @nodoc


arguments) = elixirArgumentList.fromArguments(arguments)

    /**
     * This property only exists so that [Configuration.debuggedConfiguration] can add `do intellij_elixir.debug,`
     * before `espec` task argument in the command line.
     */
    private var mixArgumentList: MutableList<String> = mutableListOf()

    private var mixESpecArguments: String?
        get() = mixESpecArgumentList.toArguments()
        set(arguments) = mixESpecArgumentList.fromArguments(arguments)

    var mixESpecArgumentList: MutableList<String> = mutableListOf()

    fun commandLine(): GeneralCommandLine {
        val workingDirectory = ensureWorkingDirectory()
        val module = ensureModule()
        val sdk = ensureMostSpecificSdk(module)
        val commandLine = ESpec.commandLine(
                envs,
                workingDirectory,
                sdk,
                erlArgumentList,
                elixirArgumentList,
                mixArgumentList
        )
        commandLine.addParameters(mixESpecArgumentList)

        return commandLine
    }

    override fun getConfigurationEditor(): SettingsEditor<out RunConfiguration> =
            SettingsEditorGroup<Configuration>().apply {
                this.addEditor("Configuration", org.elixir_lang.espec.configuration.Editor())
                this.addEditor("Interpreted Modules", org.elixir_lang.debugger.configuration.interpreted_modules.Editor<Configuration>())
            }

    override fun getState(executor: Executor, environment: ExecutionEnvironment): RunProfileState =
            State(environment, this)

    override fun readExternal(element: Element) {
        super.readExternal(element)
        element.readExternalArgumentList(ERL, erlArgumentList)
        element.readExternalArgumentList(ELIXIR, elixirArgumentList)
        element.readExternalArgumentList(MIX_ESPEC, mixESpecArgumentList)
        workingDirectoryURL = element.readExternalWorkingDirectory()
        EnvironmentVariablesComponent.readExternal(element, envs)
        element.readExternalModule(this)
        element.readModuleFilters(moduleFilterList) { inheritApplicationModuleFilters ->
            this.inheritApplicationModuleFilters = inheritApplicationModuleFilters
        }
    }

    override fun writeExternal(element: Element) {
        super.writeExternal(element)
        element.writeExternalArgumentList(ERL, erlArgumentList)
        element.writeExternalArgumentList(ELIXIR, elixirArgumentList)
        element.writeExternalArgumentList(MIX_ESPEC, mixESpecArgumentList)
        element.writeExternalWorkingDirectory(workingDirectoryURL)
        EnvironmentVariablesComponent.writeExternal(element, envs)
        element.writeExternalModule(this)
        element.writeModuleFilters(moduleFilterList, inheritApplicationModuleFilters)
    }
}

const val MIX_ESPEC = "mix-espec"
package org.elixir_lang.facet

import com.intellij.openapi.module.Module
import com.intellij.openapi.options.UnnamedConfigurable
import com.intellij.openapi.projectRoots.Sdk
import org.elixir_lang.facet.sdk.ComboBox
import javax.swing.JComponent
import javax.swing.JPanel
/**
 * Either project or module
 */
abstract class Configurable(val module: Module) : UnnamedConfigurable {
    abstract fun initSdk(): Sdk?
    abstract fun applySdk(sdk: Sdk?)
    private val sdksService by lazy { SdksService.getInstance()!! }
    private val projectSdksModel by lazy { sdksService.getModel() }
    var sdk: Sdk? = null
    private lateinit var rootPanel: JPanel
    private lateinit var sdkComboBox: ComboBox

    // https://github.com/JetBrains/intellij-community/blob/84601d73c4ae4cc3615bcd73304e5b32e8ef8686/python/python-community-configure/src/com/jetbrains/python/configuration/PythonSdkDetailsDialog.java#L119-L159
    override fun createComponent(): JComponent = rootPanel

    override fun isModified(): Boolean {
        val


,
			expectErr: &kvpb.WriteTooOldError{},
		},
		"below range tombstone errors with WriteTooOldError": {
			start:     "f",
			end:       "h",
			ts:        1e9,
			expectErr: &kvpb.WriteTooOldError{},
		},
		"predicate without UsingRangeTombstone error": {
			start:              "a",
			end:                "f",
			ts:                 10e9,
			predicateStartTime: 1,
			maxBatchSize:       maxDeleteRangeBatchBytes,
			onlyPointKeys:      true,
			expectErr:          "UseRangeTombstones must be passed with predicate based Delete Range",
		},
		"predicate maxBatchSize error": {
			start:              "a",
			end:                "f",
			ts:                 10e9,
			predicateStartTime: 1,
			maxBatchSize:       0,
			expectErr:          "MaxSpanRequestKeys must be greater than zero when using predicated based DeleteRange",
		},
	}
	for name, tc := range testcases {
		t.Run(name, func(t *testing.T) {
			for _, runWithPredicates := range []bool{false, true} {
				if tc.predicateStartTime > 0 && !runWithPredicates {
					continue
				}
				if runWithPredicates && tc.idempotent {
					continue
				}
				t.Run(fmt.Sprintf("Predicates=%v", runWithPredicates), func(t *testing.T) {
					ctx := context.Background()
					st := cluster.MakeTestingClusterSettings()
					engine := storage.NewDefaultInMemForTesting()
					defer engine.Close()

					writeInitialData(t, ctx, engine)

					ts := hlc.Timestamp{WallTime: tc.ts}
					rangeKey := storage.MVCCRangeKey{
						StartKey:               roachpb.Key(tc.start),
						EndKey:                 roachpb.Key(tc.end),
						Timestamp:              ts,
						EncodedTimestampSuffix: mvccencoding.EncodeMVCCTimestampSuffix(ts),
					}

					// Prepare the request and environment.
					evalCtx := &MockEvalCtx{
						ClusterSettings: st,
						Desc: &roachpb.RangeDescriptor{
							StartKey: roachpb.RKey(rangeStart),
							EndKey:   roachpb.RKey(rangeEnd),
						},
					}

					h := kvpb.Header{
						Timestamp: rangeKey.Timestamp,
					}
					if tc.txn {
						txn := roachpb.MakeTransaction("txn", nil, isolation.Serializable, roachpb.NormalUserPriority, rangeKey.Timestamp, 0, 0, 0, false /* omitInRangefeeds */)
						h.Txn = &txn
					}
					var predicates kvpb.DeleteRangePredicates
					if runWithPredicates {
						predicates = kvpb.DeleteRangePredicates{
							StartTime: hlc.Timestamp{WallTime: 1},
						}
						h.MaxSpanRequestKeys = math.MaxInt64
					}
					if tc.predicateStartTime > 0 {
						predicates = kvpb.DeleteRangePredicates{
							StartTime: hlc.Timestamp{WallTime: tc.predicateStartTime},
						}
						h.MaxSpanRequestKeys = tc.maxBatchSize
					}

					req := &kvpb.DeleteRangeRequest{
						RequestHeader: kvpb.RequestHeader{
							Key:    rangeKey.StartKey,
							EndKey: rangeKey.EndKey,
						},
						UseRangeTombstone:   !tc.onlyPointKeys,
						IdempotentTombstone: tc.idempotent,
						Inline:              tc.inline,
						ReturnKeys:          tc.returnKeys,
						Predicates:          predicates,
					}

					ms := computeStats(t, engine, rangeStart, rangeEnd, rangeKey.Timestamp.WallTime)

					// Use a spanset batch to assert latching of all accesses. In particular,
					// the additional seeks necessary to ch


d4_r4_8b, 1)
TEST_INPUTS(32)
    add x3, sp, #-256
    ld4 {v3.8b, v4.8b, v5.8b, v6.8b}, [x3]
TEST_END

TEST_BEGIN(LD4_ASISDLSE_R4_4H, ld4_r4_4h, 1)
TEST_INPUTS(32)
    add x3, sp, #-256
    ld4 {v3.4h, v4.4h, v5.4h, v6.4h}, [x3]
TEST_END

TEST_BEGIN(LD4_ASISDLSE_R4_8H, ld4_r4_8h, 1)
TEST_INPUTS(32)
    add x3, sp, #-256
    ld4 {v3.8h, v4.8h, v5.8h, v6.8h}, [x3]
TEST_END

TEST_BEGIN(LD4_ASISDLSE_R4_4S, ld4_r4_4s, 1)
TEST_INPUTS(32)
    add x3, sp, #-256
    ld4 {v3.4s, v4.4s, v5.4s, v6.4s}, [x3]
TEST_END

TEST_BEGIN(LD4_ASISDLSE_R4_2S, ld4_r4_2s, 1)
TEST_INPUTS(32)
    add x3, sp, #-256
    ld4 {v3.2s, v4.2s, v5.2s, v6.2s}, [x3]
TEST_END

TEST_BEGIN(LD4_ASISDLSE_R4_2D, ld4_r4_2d, 1)
TEST_INPUTS(32)
    add x3, sp, #-256
    ld4 {v3.2d, v4.2d, v5.2d, v6.2d}, [x3]
TEST_END


r(--color-hero-eyebrow)}@media only screen and (max-width:1250px){[data-v-55543c5a] .eyebrow{font-size:1.23529rem;line-height:1.19048;font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif)}}.headline[data-v-55543c5a]{font-size:2.82353rem;line-height:1.08333;font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif);margin-bottom:2rem}@media only screen and (max-width:1250px){.headline[data-v-55543c5a]{font-size:2.35294rem;line-height:1.1;font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif)}}@media only screen and (max-width:735px){.headline[data-v-55543c5a]{font-size:1.88235rem;line-height:1.125;font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif)}}.intro[data-v-55543c5a]{font-size:1.23529rem;line-height:1.38095;font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif)}@media only screen and (max-width:735px){.intro[data-v-55543c5a]{font-size:1.11765rem;line-height:1.42105;font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif)}}.content+p[data-v-55543c5a]{margin-top:var(--spacing-stacked-margin-large)}@media only screen and (max-width:735px){.content+p[data-v-55543c5a]{margin-top:8px}}.call-to-action[data-v-55543c5a]{display:flex;align-items:center}.call-to-action .cta-icon[data-v-55543c5a]{margin-left:.4rem;width:1em;height:1em}.metadata[data-v-55543c5a]{margin-top:2rem}.video-asset[data-v-55543c5a]{display:grid;height:100vh;margin:0;place-items:center center}.video-asset[data-v-55543c5a] video{max-width:1280px;min-width:320px;width:100%}@media only screen and (max-width:735px){.headline[data-v-55543c5a]{margin-bottom:19px}}.tutorial-hero[data-v-35a9482f]{margin-bottom:80px}@media only screen and (max-width:735px){.tutorial-hero[data-v-35a9482f]{margin-bottom:0}}.title[data-v-28135d78]{font-size:.70588rem;line-height:1.33333;color:var(--colors-secondary-label,var(--color-secondary-label))}.title[data-v-19ed40e2],.title[data-v-28135d78]{font-weight:400;font-family:var(--typography-html-font,"Helvetica Neue","Helvetica","Arial",sans-serif)}.title[data-v-19ed40e2]{font-size:1.11765rem;line-height:1.21053;color:var(--colors-header-text,var(--color-header-text));margin:25px 0}.question-content[data-v-19ed40e2] code{font-size:.76471rem;


"""
Auto-Paraphrasing System Main Entry Point
"""
import uvicorn
import signal
import sys
from app.core.config import settings

def handle_shutdown(signum, frame):
    """Handle graceful shutdown on SIGINT/SIGTERM."""
    print("\nReceived shutdown signal. Shutting down gracefully...")
    sys.exit(0)

if __name__ == "__main__":
    # Set up signal handlers for graceful shutdown
    signal.signal(signal.SIGINT, handle_shutdown)
    signal.signal(signal.SIGTERM, handle_shutdown)

    try:
        uvicorn.run(
            "app.api.routes:app",
            host="0.0.0.0",
            port=8000,
            reload=settings.debug,
            log_level="info"
        )
    except KeyboardInterrupt:
        print("Application stopped by user")
    except Exception as e:
        print(f"Application error: {e}")
    finally:
        print("Application shutdown complete")


ask<IActionResult> DeleteRecurringExpense(Guid id)
    {
        await _mediator.Send(new DeleteRecurringExpenseCommand(new RecurringExpense
        {
            Id = id
        }));

        return NoContent();
    }

    [HttpGet]
    [ProducesResponseType(typeof(IEnumerable<RecurringExpense>), StatusCodes.Status200OK)]
    public async Task<IActionResult> GetRecurringExpenses()
    {
        var output = await _mediator.Send(new GetRecurringExpensesQuery());

        return Ok(output);
    }

    [HttpPut("{id:guid}")]
    [ProducesResponseType(StatusCodes.Status204NoContent)]
    public async Task<IActionResult> UpdateRecurringExpense(Guid id, [FromBody] RecurringExpense expense)
    {
        expense.Id = id;
        await _mediator.Send(new UpdateRecurringExpenseCommand(expense));

        return NoContent();
    }
}


 pool = await conexion();
        const { id } = req.params;
        const oldData = req.body;
        const respuesta = await pool.query(UPDATE,[oldData, id]);
        console.log(respuesta);
        res.json({message: 'User - update'});
    }
    async remove (req: Request, res: Response): Promise<void>{
        const pool = await conexion();
        const { id } = req.params;
        const respuesta = await pool.query(DELETE, [id]);
        res.json({message: 'User - Delete'});
    }
}

const cakesController = new CakesController();
export default cakesController;/*
Contains BFS and DFS
Uses the adjacent list for the graph representation
This code uses Queue for BFS and recursive
*/

//Queue used in BFS
class Queue {
  private items;
  constructor(){ this.items = [];}
  enqueue(...val) {
    this.items = [...this.items, ...val]
  }
  dequeue() {
    return this.items.shift();
  }
  peek() {
    return this.items[0];
  }
  isEmpty() {
    return this.items.length === 0;
  }
}

class Graph {

  private noofvertices: Number;
  private adjlist: Map<string, Array<string>>;

  constructor(noofverties) {
    this.noofvertices = noofverties;
    this.adjlist = new Map<string, Array<string>>();
  }

  addVertex(v: string){
    this.adjlist.set(v,[])
  }
  // Adding bidirectional link
  addEdge(v: string,w: string) {
    this.adjlist.get(v).push(w);
    this.adjlist.get(w).push(v);
  }

  printGraph() {
     for( const i of Array.from(this.adjlist.keys())) {
      let values = '';
      for(var j of this.adjlist.get(i)) {
        values += j +" ";
      }
      console.log(i + " -> " + values);
    }
  }

  BFS(startingNode: string) {
    //initially reset the visited list
    let visited = Array.from(this.adjlist.keys());
    for(const i of visited){
      visited[i] = false;
    }

    let q = new Queue();
    visited[startingNode] = true;
    // Start by putting any one of the graph's vertices at the back of a queue.
    // Take the front item of the queue and add it to the visited list.
    q.enqueue(startingNode);

    while(!q.isEmpty()){
      const getQueueElement = q.dequeue();
      console.log(getQueueElement);
      this.adjlist.get(getQueueElement).some( neighbour => {
        if (!visited[neighbour]) {
          visited[neighbour] = true;
          q.enqueue(neighbour);
        }
      });
    }
  }

  DFS(startingNode: string) {
    let visited = Array.from(this.adjlist.keys());
    for(const i of visited){
      visited[i] = false;
    }
    this.DFSRecursive(startingNode, visited)
  }

  // Uses Recursive for DFS, same can be done using stack
  DFSRecursive(v: string, visited: Array<string>){
    visited[v] = true;
    console.log(v);
    this.adjlist.get(v).some( neighbour => {
      if (!visited[neighbour]) {
            this.DFSRecursive(neighbour, visited);
      }
    });
  }

}

var g = new Graph(6);
var vertices = [ 'A', 'B', 'C', 'D', 'E', 'F' ];

// adding vertices
vertices.some( vertex => g.a


}

    fn soft_byte_length(&self) -> AltoResult<sys::ALint> {
        let _lock = self.ctx.make_current(true);
        let mut value = 0;
        unsafe {
            self.ctx.0.dev.0.alto.0.api.alGetSourcei(
                self.src,
                self.ctx
                    .0
                    .exts
                    .AL_SOFT_source_length()?
                    .AL_BYTE_LENGTH_SOFT?,
                &mut value,
            );
        }
        self.ctx.get_error().map(|_| value)
    }

    fn distance_model(&self) -> DistanceModel {
        (|| -> AltoResult<_> {
            self.ctx.0.exts.AL_EXT_source_distance_model()?;
            let _lock = self.ctx.make_current(true);
            let mut value = 0;
            unsafe {
                self.ctx.0.dev.0.alto.0.api.alGetSourcei(
                    self.src,
                    sys::AL_DISTANCE_MODEL,
                    &mut value,
                );
            }
            Ok(match value {
                sys::AL_NONE => DistanceModel::None,
                sys::AL_INVERSE_DISTANCE => DistanceModel::Inverse,
                sys::AL_INVERSE_DISTANCE_CLAMPED => DistanceModel::InverseClamped,
                sys::AL_LINEAR_DISTANCE => DistanceModel::Linear,
                sys::AL_LINEAR_DISTANCE_CLAMPED => DistanceModel::LinearClamped,
                sys::AL_EXPONENT_DISTANCE => DistanceModel::Exponent,
                sys::AL_EXPONENT_DISTANCE_CLAMPED => DistanceModel::ExponentClamped,
                dm => DistanceModel::Unknown(dm),
            })
        })()
        .unwrap_or(DistanceModel::InverseClamped)
    }
    fn set_distance_model(&self, value: DistanceModel) -> AltoResult<()> {
        self.ctx.0.exts.AL_EXT_source_distance_model()?;
        let _lock = self.ctx.make_current(true);
        unsafe {
            self.ctx.0.dev.0.alto.0.api.alSourcei(
                self.src,
                sys::AL_DISTANCE_MODEL,
                match value {
                    DistanceModel::None => sys::AL_NONE,
                    DistanceModel::Inverse => sys::AL_INVERSE_DISTANCE,
                    DistanceModel::InverseClamped => sys::AL_INVERSE_DISTANCE_CLAMPED,
                    DistanceModel::Linear => sys::AL_LINEAR_DISTANCE,
                    DistanceModel::LinearClamped => sys::AL_LINEAR_DISTANCE_CLAMPED,
                    DistanceModel::Exponent => sys::AL_EXPONENT_DISTANCE,
                    DistanceModel::ExponentClamped => sys::AL_EXPONENT_DISTANCE_CLAMPED,
                    DistanceModel::Unknown(dm) => dm,
                },
            );
        }
        self.ctx.get_error()
    }

    fn soft_spatialization(&self) -> SoftSourceSpatialization {
        (|| -> AltoResult<_> {
            let assp = self.ctx.0.exts.AL_SOFT_source_spatialize()?;
            let _lock = self.ctx.make_current(true);
            let mut value = 0;
            unsafe {
                self.ctx.0.dev.0.alto.0.api.alGetSourcei(
                    self.src,
                    assp.AL_SOURCE_SPATIALIZE_SOFT?,
                    &mut value,
                );
            }
            Ok(match value as sys::ALboolean {
                sys::AL_FALSE => SoftSourceSpatializati


(int)
* infiniteScrollDisabled (boolean)
* infiniteScrollImmediateCheck (boolean)
* scrollInsideContainer (boolean)

If these properties are not defined in the scope, they are set to their default values (1, false, true).
See [ngInfiniteScroll documentation](http://binarymuse.github.io/ngInfiniteScroll/documentation.html) for properties meaning.

## Infinite-list scroll helper

We have built two AngularJS services to support infinite-list scroll action.

* **infiniteScrollHelper service**: Collect dedicated materials for structuring displayed elements to user.

* **infiniteListScrollHelperBuilder service**: The result of infiniteScrollHelper service. This service manages with flags to determine when the process is disabled, completed or continue to load more elements.

We can ***customize how many elements per request*** we want to get or use default value from server. Below is a sample we can use in a frontend component.

```js
function aParticularController(infiniteScrollHelper, ELEMENTS_PER_REQUEST) {
    var self = this
    var DEFAULT_LIMIT = ELEMENTS_PER_REQUEST || 20;
    var options = {
        offset: 0,
        limit: DEFAULT_LIMIT
    }

    function $onInit() {
      self.loadMoreElements = infiniteScrollHelper(self, _loadNextItems, null, DEFAULT_LIMIT);
    }

    function _loadNextItems() {
        //Get data with above options: offset, limit
        //should return an array
    }
}
```

* Note:
    * ELEMENTS_PER_REQUEST is a constant that generated by server.
    * By default, limit should be set to ELEMENTS_PER_REQUEST. To make sure infinite scroll work as designed, developers should pass the same limit value on infiniteScrollHelper and _loadNextItems.
    * If you want to use a custom limit value. Please override the default value by passing the custom value as the fourth param when calling infiniteScrollHelper# /api/domains

## GET /api/domains

Get the list of ESN domains

**Request Parameters**

- limit (int): The number of domains to return. This will only keep the N first domains (where N=limit). Default value is 50.
- offset (int): Start the list of domains after skipping N domains (where N=offset). For example, if the size of the domains list is 100 and the offset is 50, the result list will contain only domains from 50 to 99 (list index starts at index 0).

**Request Headers:**

- Accept: application/json

**Response Headers:**

- X-ESN-Items-Count: The number of domains in the result list
- Content-Length: Document size
- Content-Type: application/json

**Status Codes:**

- 200 OK. With the list of domains
- 401 Unauthorized. The user is not authenticated on the platform.
- 403 Forbidden. The user is not a platform admin.

**Request:**

    GET /api/domains
    Accept: application/json
    Host: localhost:8080

**Response:**

    HTTP/1.1 200 OK
    X-ESN-Items-Count: 2
    [
        {
            "name": "foo",
            "company_name": "Foo",
            "timestamps": {
              "creation": ISODate("2016-06-23T16:24:07.383Z")
            }
        },
        {
            "name": "bar",
            "company_name": "Bar",
            "timestamps": {
              "creation": ISODate("2016-06-23T16:24:07.383Z")
            }
        }
    ]

## POST /api/domains

Create an ESN domain.

**Request Headers:**

- Accept: application/json

**Request JSON Object:**

- name: The domain name
- company_name: The company name

**Response Headers:**

- Content-Length: Document size

**Status Codes:**

- 201 Created. The domain has been created.
- 400 Bad Request. Invalid request body


orGranularityAndHost(LogicalGranularity, nodes["c"].Name).segments[2].wireGuardIP),
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: privIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       nodes["d"].Subnet,
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: privIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       &peers["a"].AllowedIPs[0],
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: privIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       &peers["a"].AllowedIPs[1],
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: privIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       &peers["b"].AllowedIPs[0],
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: privIface,
					Protocol:  unix.RTPROT_STATIC,
				},
			},
		},
		{
			name:     "logical from c local always",
			local:    true,
			topology: mustTopoForGranularityAndHost(LogicalGranularity, nodes["c"].Name),
			strategy: encapsulation.Always,
			routes: []*netlink.Route{
				{
					Dst:       oneAddressCIDR(mustTopoForGranularityAndHost(LogicalGranularity, nodes["c"].Name).segments[0].wireGuardIP),
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: tunlIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       nodes["a"].Subnet,
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: tunlIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       oneAddressCIDR(nodes["a"].InternalIP.IP),
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: tunlIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       oneAddressCIDR(mustTopoForGranularityAndHost(LogicalGranularity, nodes["c"].Name).segments[1].wireGuardIP),
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: tunlIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       nodes["b"].Subnet,
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: tunlIface,
					Protocol:  unix.RTPROT_STATIC,
				},
				{
					Dst:       nodes["b"].InternalIP,
					Flags:     int(netlink.FLAG_ONLINK),
					Gw:        nodes["b"].InternalIP.IP,
					LinkIndex: tunlIface,
					Protocol:  unix.RTPROT_STATIC,
					Table:     kiloTableIndex,
				},
				{
					Dst:       oneAddressCIDR(mustTopoFor


hroughOneLetter",
     "[strikethrough ~~a~~]");

  MT("strikethroughWrapped",
     "[strikethrough ~~foo]",
     "[strikethrough foo~~]");

  MT("strikethroughParagraph",
     "[strikethrough ~~foo]",
     "",
     "foo[strikethrough ~~bar]");

  MT("strikethroughEm",
     "[strikethrough ~~foo][em&strikethrough *bar*][strikethrough ~~]");

  MT("strikethroughEm",
     "[em *][em&strikethrough ~~foo~~][em *]");

  MT("strikethroughStrong",
     "[strikethrough ~~][strong&strikethrough **foo**][strikethrough ~~]");

  MT("strikethroughStrong",
     "[strong **][strong&strikethrough ~~foo~~][strong **]");

})();
// CodeMirror, copyright (c) by Marijn Haverbeke and others
// Distributed under an MIT license: http://codemirror.net/LICENSE

/**
 * Link to the project's GitHub page:
 * https://github.com/pickhardt/coffeescript-codemirror-mode
 */
(function(mod) {
  if (typeof exports == "object" && typeof module == "object") // CommonJS
    mod(require("../../lib/codemirror"));
  else if (typeof define == "function" && define.amd) // AMD
    define(["../../lib/codemirror"], mod);
  else // Plain browser env
    mod(CodeMirror);
})(function(CodeMirror) {
"use strict";

CodeMirror.defineMode("coffeescript", function(conf, parserConf) {
  var ERRORCLASS = "error";

  function wordRegexp(words) {
    return new RegExp("^((" + words.join(")|(") + "))\\b");
  }

  var operators = /^(?:->|=>|\+[+=]?|-[\-=]?|\*[\*=]?|\/[\/=]?|[=!]=|<[><]?=?|>>?=?|%=?|&=?|\|=?|\^=?|\~|!|\?|(or|and|\|\||&&|\?)=)/;
  var delimiters = /^(?:[()\[\]{},:`=;]|\.\.?\.?)/;
  var identifiers = /^[_A-Za-z$][_A-Za-z$0-9]*/;
  var properties = /^(@|this\.)[_A-Za-z$][_A-Za-z$0-9]*/;

  var wordOperators = wordRegexp(["and", "or", "not",
                                  "is", "isnt", "in",
                                  "instanceof", "typeof"]);
  var indentKeywords = ["for", "while", "loop", "if", "unless", "else",
                        "switch", "try", "catch", "finally", "class"];
  var commonKeywords = ["break", "by", "continue", "debugger", "delete",
                        "do", "in", "of", "new", "return", "then",
                        "this", "@", "throw", "when", "until", "extends"];

  var keywords = wordRegexp(indentKeywords.concat(commonKeywords));

  indentKeywords = wordRegexp(indentKeywords);

  var stringPrefixes = /^('{3}|\"{3}|['\"])/;
  var regexPrefixes = /^(\/{3}|\/)/;
  var commonConstants = ["Infinity", "NaN", "undefined", "null", "true", "false", "on", "off", "yes", "no"];
  var constants = wordRegexp(commonConstants);

  // Tokenizers
  function tokenBase(stream, state) {
    // Handle scope changes


tching을 할 때 Overhead가 발생합니다.

  CPU가 놀지 않도록 만들면서, 사용자에게 빠르게 일처리를 제공해 주기 위한 것입니다.

  > **Process vs Thread**

  Context Switching 비용은 Process가 Thread보다 많이 듭니다. 그 이유는 Thread는 Stack 영역을 제외한 모든 메모리를 공유하기에 Context Switching 발생 시 Stack 영역만 변경하면 됩니다.

### 참고

https://m.blog.naver.com/adamdoha/222019884898 - 원문 블로그

https://jhnyang.tistory.com/33 - 자세한 설명

https://velog.io/@sohi_5/%EC%9A%B4%EC%98%81%EC%B2%B4%EC%A0%9C-Context-Switching-suaduxev - 짧은 설명## this 에 대해서

자바스크립트에서 모든 함수는 실행될 때마다 함수 내부에 `this`라는 객체가 추가된다. `arguments`라는 유사 배열 객체와 함께 함수 내부로 암묵적으로 전달되는 것이다. 그렇기 때문에 자바스크립트에서의 `this`는 함수가 호출된 상황에 따라 그 모습을 달리한다.

### 상황 1. 객체의 메서드를 호출할 때

객체의 프로퍼티가 함수일 경우 메서드라고 부른다. `this`는 함수를 실행할 때 함수를 소유하고 있는 객체(메소드를 포함하고 있는 인스턴스)를 참조한다. 즉 해당 메서드를 호출한 객체로 바인딩된다. `A.B`일 때 `B`함수 내부에서의 `this`는 `A`를 가리키는 것이다.

```
var myObject = {
  name: "foo",
  sayName: function() {
    console.log(this);
  }
};


Dist / 4096f) * (Configuration.Worldmap.CameraDistance / 100f);
        ff9.w_cameraEyeOffset.z = ff9.rcos(ff9.w_cameraSysDataCamera.rotation) * (ff9.w_cameraPosstatNow.cameraDistance * ff9.w_cameraDebugDist / 4096f) * (Configuration.Worldmap.CameraDistance / 100f);
        if (!ff9.w_cameraFixMode)
            ff9.w_cameraSetEyeAim();
        ff9.setVector(ref ff9.w_cameraFocusEye, ff9.w_cameraWorldAim.x - ff9.w_cameraWorldEye.x, ff9.w_cameraWorldAim.y - ff9.w_cameraWorldEye.y, ff9.w_cameraWorldAim.z - ff9.w_cameraWorldEye.z);
        if (ff9.tweaker.CustomCamera)
        {

            Vector3 zero = Vector3.zero;
            zero.y = ff9.w_cameraSysDataCamera.rotation;
            Matrix4x4 matrix4x;
            ff9.RotMatrix(ref zero, out matrix4x);
            ff9.ApplyMatrixLV(ref matrix4x, ref ff9.w_cameraUpvector, out Vector3 vec);
            ff9.w_camera_makematrix(ff9.w_frameCameraPtr, ff9.w_cameraFocusEye, ff9.w_cameraFocusAim, vec, ff9.w_cameraWorldEye);

        }
        else
        {
            Vector3 b = new Vector3(0f, ff9.tweaker.w_cameraWorldEye_Y * 0.00390625f, 0f);
            Vector3 b2 = new Vector3(0f, ff9.tweaker.w_cameraWorldAim_Y * 0.00390625f, 0f);
            if (FF9StateSystem.World.FixTypeCam)
            {
                if (ff9.w_moveCHRControlPtr.type_cam == 0) // on foot
                {
                    ff9.tweaker.FixTypeCamEyeY = 558;
                    ff9.tweaker.FixTypeCamAimY = 312;
                    ff9.tweaker.FixTypeCamEyeYTarget = 558;
                    ff9.tweaker.FixTypeCamAimYTarget = 312;
                }
                if (ff9.tweaker.FixTypeCamEyeYCurrent < ff9.tweaker.FixTypeCamEyeYTarget)
                {
                    ff9.tweaker.FixTypeCamEyeYCurrent += 25;
                    if (ff9.tweaker.FixTypeCamEyeYCurrent > ff9.tweaker.FixTypeCamEyeYTarget)
                        ff9.tweaker.FixTypeCamEyeYCurrent = ff9.tweaker.FixTypeCamEyeYTarget;
                }
                else if (ff9.tweaker.FixTypeCamEyeYCurrent > ff9.tweaker.FixTypeCamEyeYTarget)
                {
                    ff9.tweaker.FixTypeCamEyeYCurrent -= 25;
                    if (ff9.tweaker.FixTypeCamEyeYCurrent < ff9.tweaker.FixTypeCamEyeYTarget)
                        ff9.tweaker.FixTypeCamEyeYCurrent = ff9.tweaker.FixTypeCamEyeYTarget;
                }
                if (ff9.tweaker.FixTypeCamAimYCurrent < ff9.tweaker.FixTypeCamAimYTarget)
                {
                    ff9.tweaker.FixTypeCamAimYCurrent += 25;
                    if (ff9.tweaker.FixTypeCamAimYCurrent > ff9.tweaker.FixTypeCamAimYTarget)
                        ff9.tweaker.FixTypeCamAimYCurrent = ff9.tweaker.FixTypeCamAimYTarget;
                }
                else if (ff9.tweaker.FixTypeCamAimYCurrent > ff9.tweaker.FixTypeCamAimYTarget)
                {
                    ff9.tweaker.FixTypeCamAimYCurrent -= 25;
                    if (ff9.tweaker.


.del文件中被标记为删除，依然可以匹配查询，但是最终返回之前会被从结果中删除。

文档的更新操作是类似的：当一个文档被更新，旧版本的文档被标记为删除，新版本的文档在新的段中索引。也许该文档的不同版本都会匹配一个查询，但是更老版本会从结果中删除。

在[合并段](075_Inside_a_shard/60_Segment_merging.md)这节，我们会展示删除的文件是如何从文件系统中清除的。[![Gem Version](https://badge.fury.io/rb/theo-rails.svg)](https://badge.fury.io/rb/theo-rails)

# Theo
Theo is a small and elegant HTML-like template language for Ruby on Rails, featuring natural partials and computed attributes.

> [!WARNING]
> Please note that this software is still experimental - use at your own risk.

## Introduction

Thanks to Hotwire, it's now possible to build sophisticated server-rendered user interfaces in Ruby on Rails. However, ERB, Rails' most popular template language, has unintuitive partial syntax, especially for those used to working with Vue.js or React components.

With Theo, you can render a partial using HTML-like syntax:
```html
<_button size="large" label%="label" />
```

> [!IMPORTANT]
> For rendering partials, you can also use PascalCase:
> ```html
> <Button size="large" label%="label" />
> ```

## Getting started

### Install

Run

    bundle add theo-rails

> [!NOTE]
> If you are using TailwindCSS version 3, add `.theo` extension to the `content` key in your `tailwind.config.js`: `./app/views/**/*.{erb,haml,html,slim,theo}`.

### Try

Create a new view named `hello.html.theo` (note the `.theo` suffix), with the following content:
```html
<span style%="'background-color: ' + 'yellow'">Hello from Theo!</span>
```

Visit the URL corresponding to this view and you should see a highlighed text.

## Syntax

### Computed attributes

Computing attribute value in ERB feels awkward because angle brackets `<>` clash with the surrounding HTML tag.

In Theo, an attribute with computed value can be expressed using `%=`. For example:
```html
<a href%="root_path">Home</a>
```
is equivalent to:
```erb
<a href="<%= root_path %>">Home</a>
```
> [!TIP]
> Computed attributes work with partials as well as standard HTML tags.

#### Short form

If value of a dynamic attribute is the same as its name, you can omit the value.

For example:
```html
<img src%>
```
is equivalent to:
```erb
<img src%="src">
```
which in turn is equivalent to:
```erb
<img src="<%= src %>">
```

> [!NOTE]
> Since reserved ruby keywords such as `class` can't be used as variable names but still can be passed as locals to a partial, they are converted to the following:
> ```erb
> <div class="<%= binding.local_variable_get('class') %>">Text</div>
> ```

### Partials

Rendering a partial in ERB requires context-switching between HTML markup and Ruby code, and the `render` verb makes it difficult to imagine a page as a component structure.

In Theo, you render a partial by writing a tag with '_' prefix, followed by kebab-cased partial name, for example:
```html
<_special-button size="large" />
```
is equivalent to:
```erb
<%= render 'special_button', size: 'large' %>
```

> [!TIP]
> Alternatively, you can also use PascalCase, for example:
> ```html
> <SpecialButton size="large" />
> ```
> The benefit is that this form is recognized as valid HTML by most parsers.


;
  text-align: center;
}.asyncGallery {
  position: fixed;
  top: 0;
  left: 0;
  right: 0;
  bottom: 0;
  opacity: 0;
  z-index: 100000;
  visibility: hidden;
  background-color: rgba(0, 0, 0, 0.95);
  transition: opacity 200ms, visibility 200ms;
}

.asyncGallery.is-visible {
  opacity: 1;
  visibility: visible;
}

.gallery__Details {
  visibility: hidden;
  opacity: 0;
  position: absolute;
}

.asyncGallery.is-visible .gallery__Details {
  opacity: 1;
  visibility: visible;
  position: static;
}

.asyncGallery__Item {
  position: absolute;
  top: 50%;
  left: 50%;
  opacity: 0;
  visibility: hidden;
  overflow: hidden;
  transform: translate(-50%, -50%);
  transition: opacity 200ms, visibility 200ms;
  max-width: 770px;
}

.asyncGallery__Item.is-visible {
  padding: 15px;
  opacity: 1;
  visibility: visible;
}

.asyncGallery__ItemImage {
  padding: 10px;
}
.asyncGallery__ItemImage img {
  margin: 0 auto;
  display: block;
}

.asyncGallery__ItemDescription,
.asyncGallery__ItemDescription2,
.asyncGallery__Loader {
  color: #fff;
}

.asyncGallery__Loader {
  position: absolute;
  top: 50%;
  left: 50%;
  transform: translate(-50%, -50%);
  display: none;
  color: #fff;
  z-index: 100;
}

.asyncGallery__Loader.is-visible {
  display: block;
}

.asyncGallery button {
  background-color: transparent;
  border: 0;
  outline: 0;
  padding: 0;
  font-size: 0;
  cursor: pointer;
}

.asyncGallery__Close {
  position: absolute;
  top: 40px;
  right: 40px;
  width: 20px;
  height: 20px;
  z-index: 1000;
  background-repeat: no-repeat;
  background-size: 20px 20px;
  background-image: url("data:image/svg+xml;utf8;base64,PD94bWwgdmVyc2lvbj0iMS4wIiBlbmNvZGluZz0idXRmLTgiPz4KPCFET0NUWVBFIHN2ZyBQVUJMSUMgIi0vL1czQy8vRFREIFNWRyAxLjEvL0VOIiAiaHR0cDovL3d3dy53My5vcmcvR3JhcGhpY3MvU1ZHLzEuMS9EVEQvc3ZnMTEuZHRkIj4KPHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHhtbG5zOnhsaW5rPSJodHRwOi8vd3d3LnczLm9yZy8xOTk5L3hsaW5rIiB3aWR0aD0iNTEycHgiIHZlcnNpb249IjEuMSIgaGVpZ2h0PSI1MTJweCIgdmlld0JveD0iMCAwIDY0IDY0IiBlbmFibGUtYmFja2dyb3VuZD0ibmV3IDAgMCA2NCA2NCI+CiAgPGc+CiAgICA8cGF0aCBmaWxsPSIjRkZGRkZGIiBkPSJNMjguOTQxLDMxLjc4NkwwLjYxMyw2MC4xMTRjLTAuN


dh_hash_function_default$layout() {
        return secp256k1_ecdh_hash_function_default$constants.LAYOUT;
    }

    /**
     * Segment for variable:
     * {@snippet lang=c :
     * extern const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_default
     * }
     */
    public static MemorySegment secp256k1_ecdh_hash_function_default$segment() {
        return secp256k1_ecdh_hash_function_default$constants.SEGMENT;
    }

    /**
     * Getter for variable:
     * {@snippet lang=c :
     * extern const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_default
     * }
     */
    public static MemorySegment secp256k1_ecdh_hash_function_default() {
        return secp256k1_ecdh_hash_function_default$constants.SEGMENT.get(secp256k1_ecdh_hash_function_default$constants.LAYOUT, 0L);
    }

    /**
     * Setter for variable:
     * {@snippet lang=c :
     * extern const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_default
     * }
     */
    public static void secp256k1_ecdh_hash_function_default(MemorySegment varValue) {
        secp256k1_ecdh_hash_function_default$constants.SEGMENT.set(secp256k1_ecdh_hash_function_default$constants.LAYOUT, 0L, varValue);
    }

    private static class secp256k1_ecdh {
        public static final FunctionDescriptor DESC = FunctionDescriptor.of(
            secp256k1_h.C_INT,
            secp256k1_h.C_POINTER,
            secp256k1_h.C_POINTER,
            secp256k1_h.C_POINTER,
            secp256k1_h.C_POINTER,
            secp256k1_h.C_POINTER,
            secp256k1_h.C_POINTER
        );

        public static final MemorySegment ADDR = secp256k1_h.findOrThrow("secp256k1_ecdh");

        public static final MethodHandle HANDLE = Linker.nativeLinker().downcallHandle(ADDR, DESC);
    }

    /**
     * Function descriptor for:
     * {@snippet lang=c :
     * extern int secp256k1_ecdh(const secp256k1_context *ctx, unsigned char *output, const secp256k1_pubkey *pubkey, const unsigned char *seckey, secp256k1_ecdh_hash_function hashfp, void *data)
     * }
     */
    public static FunctionDescriptor secp256k1_ecdh$descriptor() {
        return secp256k1_ecdh.DESC;
    }

    /**
     * Downcall method handle for:
     * {@snippet lang=c :
     * extern int secp256k1_ecdh(const secp256k1_context *ctx, unsigned char *output, const secp256k1_pubkey *pubkey, const unsigned char *seckey, secp256k1_ecdh_hash_function hashfp, void *data)
     * }
     */
    public static MethodHandle secp256k1_ecdh$handle() {
        return secp256k1_ecdh.HANDLE;
    }

    /**
     * Address for:
     * {@snippet lang=c :
     * extern int secp256k1_ecdh(const secp256k1_context *ctx, unsigned char *output, const secp256k1_pubkey *pubkey, const unsigned char *seckey, secp256k1_ecdh_hash_function hashfp, void *data)
     * }
     */
    public static MemorySegment secp256k1_ecdh$ad


 Functions aus: of(), from(), timer(), interval()
     * 2. Implementiere außerdem ein Observable manuell, indem du den Konstruktor "new Observable()" nutzt.
     *
     * Tipps:
     * Zum Abonnieren kannst du einen (partiellen) Observer oder ein einzelnes next-Callback verwenden.
     * Du kannst die Methode this.log() verwenden, um eine Ausgabe in der schwarzen Box im Browser zu erzeugen.
     */

    /******************************/

    // 1. Observer
    const observer = {
      next: e => this.log(e),
      error: err => this.log('>ERROR>: ' + err),
      complete: () => this.log('COMPLETE!')
    }

    // (ABC|)
    //const observable$ = of('😎', '😆', '🤪');

    // 2. Observable
    // 4. Subscriber
    const observable$ = new Observable<string>(subscriber => {
      subscriber.next('😎');
      subscriber.next('🤪');
      const x = setTimeout(() => subscriber.next('😆'), 1000);
      const y = setTimeout(() => { subscriber.error('NOPE!'), this.log('ZOMBIE CODE!') }, 2000);
      const z = setTimeout(() => subscriber.next('Weiter machen!'), 3000);

      return () => {
        this.log('Wir sollten den Zombie killen!');
        clearTimeout(x);
        clearTimeout(y);
      }
    });

    // 3. Subscription
    const subscription = observable$.subscribe(observer);
    setTimeout(() => subscription.unsubscribe(), 4000);

    const subscription2 = observable$.subscribe(observer);

    /******************************/
  }

  private log(msg: string | number) {
    this.logStream$.next(msg);
  }

}
import { Component } from '@angular/core';

export interface Data {
  key: number, name: string,age: number,address:string
}

@Component({
  selector: 'app-root',
  templateUrl: './app.component.html',
  styleUrls: ['./app.component.scss']
})
export class AppComponent {
  // title = 'ngzorroTable'
  // listOfData: Data[] = []
  // listOfDisplayData: Data[]
  // isAllDisplayDataChecked: boolean = false
  // isIndeterminate: boolean = false
  // mapOfCheckedId: { [key: string]: boolean } = {};
  // pageSize: number = 10
  // pageIndex: number = 1
  // getUrl: string = `http://127.0.0.1:5000/getdata/pageindex/${this.pageIndex}/pagesize/${this.pageSize}`
  // checkAll (value: boolean) {
  //   this.listOfDisplayData.forEach( (v, i, self) => {
  //     this.mapOfCheckedId[v.key] = value
  //   } )
  //   console.log(value)
  //   this.refreshStatus()
  // }

  // currentPageDataChange($event) {
  //   console.log($event)
  //   this.listOfDisplayData = $event
  //   this.refreshStatus()
  // }

  // cancelDel () {
  //   console.log('cancel')
  // }

  // confirmDel ( id: number ) {
  //   console.log(id)
  //   this.listOfData.splice(id, 1)
  //   this.listOfDisplayData = this.listOfData.slice((this.pageIndex-1) * this.pageSize, this.pageIndex * this.pageSize)
  //   console.log(this.pageIndex)
  //   console.log('未删除', this.mapOfCheckedId)
  //   delete this.mapOfCheckedId[id]
  //   console.log('删除', this.mapOfCheckedId)
  //   this.refreshStatus()
  // }

  // refreshStatu


以下而又不合前两类规定者的处刑问题，一般的可分别情节处以一年以下徒刑，其情况合乎《惩治贪污条例（草案）》第四条规定者，则从重处刑。

   此外，革命军人犯贪污罪者亦应按《惩治贪污条例（草案）》处理，不适用军委总政治部作为征求意见的《军法条例（草案）》的规定，审判手续应经过军法机关。

   （二）关于浪费问题的处理，西北局所规定的各项办法与中央一月二十一日批准薄一波同志报告的内容大致相同，各地均可采用。

   （三）关于小公家务的处理问题，政务院即将发布关于统一处理机关生产的决定，各地应遵照执行。至于各单位化大公为小公，要确定它是贪污还是浪费，仍应照薄一波同志报告所提，根据小公用途来决定，西北局所提四种办法，各地可以采用。

   （四）关于执行处分和奖励的批准手续，党内处分同意仍按中央纪律委员会的规定执行。属于行政处分和奖励事项，可按西北局意见，一般采取直接上级批准制，惟刑事处分因其中涉及逮捕、判刑、死刑、免刑和上诉等复杂问题，不能一律采取直接上级批准制，应分别规定为：

   甲、逮捕及一般判刑的批准权，采取隔一级批准制，最下级为地委、专署、师党委会及其派出的代表机关，县级、团级以下暂无批准权；

   乙、死刑、无期徒刑和免刑的批准权，属于省、市起及其以上各级，采取隔两级批准制；

   丙、一般判刑，容许上诉，惟死刑经最高人民法院及其各大行政区分院判决者不得再行上诉；

   丁、各大、中城市对于犯法工商业家的逮捕，应有一个控制数字，目前以不超过当地工商业户（摊贩不计算在内）的千分之五为限，对于他们的判刑，除犯杀人罪者外，可推迟到《惩治贪污条例》经中央人民政府公布以后，判刑的控制数字待京津两市总结经验后再行通知各地；

   戊、贪污分子的逮捕和判刑有涉及民主党派负责人土的，应经过中央或大行政区级的批准。

   以上各项，各中央局和大军区、志愿军党委会如有意见，

   望于二月十五日以前电告中央。西北两个文件，可即依上述

   规定加以修改执行。

   中  央二月十二日

   来源：

   根据文件的翻印件打印

    [返回索引页面]


        label('Address 2') {
            stretchy false
          }

          address_form(address: @address2)

          horizontal_separator {
            stretchy false
          }

          label('Address 2 (Saved)') {
            stretchy false
          }

          address_view(address: @address2)
        }
      }
    }
  }
end

ClassBasedCustomControls.launch
```

![glimmer-dsl-libui-mac-method-based-custom-keyword.png](images/glimmer-dsl-libui-mac-method-based-custom-keyword.png)

##### Class-Based Custom Control Slots

Component can have Component Slots inside layout container controls: `vertical_box`, `horizontal_box`, `form`, and `grid`.

Simply designate a layout container control as a Component Slot inside a Custom Control class body block by passing it a `slot: slot_name` option (in the example below, we have a `:header` slot and a `:footer` slot):

```ruby
  body {
    vertical_box {
      vertical_box(slot: :header) {
        stretchy false
      }
      form {
        form_field(model: address, attribute: :street)
        form_field(model: address, attribute: :p_o_box)
        form_field(model: address, attribute: :city)
        form_field(model: address, attribute: :state)
        form_field(model: address, attribute: :zip_code)
      }
      vertical_box(slot: :footer) {
        stretchy false
      }
    }
  }
```

Next, in the Custom Control consuming code, open a block matching the name of the Component Slot (e.g. `header {}` and `footer {}`):

```ruby
          address_form(address: @address) {
            header {
              label('Billing Address') {
                stretchy false
              }
            }
            footer {
              label('Billing address is used for online payments') {
                stretchy false
              }
            }
          }
```

Note that the slotted labels can include properties that apply to their Component Slot container like `stretchy false`.

![glimmer-dsl-libui-mac-class-based-custom-control-slots.png](/images/glimmer-dsl-libui-mac-class-based-custom-control-slots.png)

Example ([Class-Based Custom Control Slots](/docs/examples/GLIMMER-DSL-LIBUI-ADVANCED-EXAMPLES.md#class-based-custom-control-slots)):

```ruby
require 'glimmer-dsl-libui'
require 'facets'

Address = Struct.new(:street, :p_o_box, :city, :state, :zip_code)

class FormField
  include Glimmer::LibUI::CustomControl

  options :model, :attribute

  body {
    entry { |e|
      label attribute.to_s.underscore.split('_').map(&:capitalize).join(' ')
      text <=> [model, attribute]
    }
  }
end

class AddressForm
  include Glimmer::LibUI::CustomControl

  option :address

  body {
    vertical_box {
      vertical_box(slot: :header) {
        stretchy false
      }
      form {
        form_field(model: address, attribute: :street)
        form_field(model: address, attribute: :p_o_box)
        form_field(model: address, attribute: :city)
        form_field(model: address, attribute: :state)
        form_field(model: address, attribute: :zip_code)
      }
      vertical_box(slot: :footer) {
        stretchy false
      }
    }
  }
end

class LabelPair
  include Glimmer::LibUI::CustomControl

  options :model, :attribute, :value

  body {


local help_message = [[
This is a module file for the container quay.io/biocontainers/erne:2.1.1--heaa942f_2, which exposes the
following programs:

 - erne-bs5
 - erne-create
 - erne-filter
 - erne-map
 - erne-meth

This container was pulled from:

	https://quay.io/repository/biocontainers/erne

If you encounter errors in erne or need help running the
tools it contains, please contact the developer at

	http://erne.sourceforge.net

For errors in the container or module file, please
submit a ticket at

	gzynda@tacc.utexas.edu
	https://portal.tacc.utexas.edu/tacc-consulting
]]
help(help_message,"\n")

whatis("Name: erne")
whatis("Version: ctr-2.1.1--heaa942f_2")
whatis("Category: ['Read mapping', 'Bisulfite mapping']")
whatis("Keywords: ['Genomics', 'Sequencing', 'Epigenetics']")
whatis("Description: Extended Randomized Numerical alignEr for accurate alignment of NGS reads. It can map bisulfite-treated reads.")
whatis("URL: https://quay.io/repository/biocontainers/erne")

set_shell_function("erne-bs5",'singularity exec ${BIOCONTAINER_DIR}/biocontainers/er


# Separate opclass three (fpn-to-mem) ops since they have a different
# stack frame and protocol.
	btst		&0x5,EXC_CMDREG(%a6)	# is it an fmove out?
	bne.w		fu_out			# yes

# Separate packed opclass two instructions.
	bfextu		EXC_CMDREG(%a6){&0:&6},%d0
	cmpi.b		%d0,&0x13
	beq.w		fu_in_pack

# I'm not sure at this point what FPSR bits are valid for this instruction.
# so, since the emulation routines re-create them anyways, zero exception field
	andi.l		&0x00ff00ff,USER_FPSR(%a6) # zero exception field

	fmov.l		&0x0,%fpcr		# zero current control regs
	fmov.l		&0x0,%fpsr

# Opclass two w/ memory-to-fpn operation will have an incorrect extended
# precision format if the src format was single or double and the
# source data type was an INF, NAN, DENORM, or UNNORM
	lea		FP_SRC(%a6),%a0		# pass ptr to input
	bsr.l		fix_skewed_ops

# we don't know whether the src operand or the dst operand (or both) is the
# UNNORM or DENORM. call the function that tags the operand type. if the
# input is an UNNORM, then convert it to a NORM, DENORM, or ZERO.
	lea		FP_SRC(%a6),%a0		# pass: ptr to src op
	bsr.l		set_tag_x		# tag the operand type
	cmpi.b		%d0,&UNNORM		# is operand an UNNORM?
	bne.b		fu_op2			# no
	bsr.l		unnorm_fix		# yes; convert to NORM,DENORM,or ZERO

fu_op2:
	mov.b		%d0,STAG(%a6)		# save src optype tag

	bfextu		EXC_CMDREG(%a6){&6:&3},%d0 # dyadic; load dst reg

# bit five of the fp extension word separates the monadic and dyadic operations
# at this point
	btst		&0x5,1+EXC_CMDREG(%a6)	# is operation monadic or dyadic?
	beq.b		fu_extract		# monadic
	cmpi.b		1+EXC_CMDREG(%a6),&0x3a	# is operation an ftst?
	beq.b		fu_extract		# yes, so it's monadic, too

	bsr.l		load_fpn2		# load dst into FP_DST

	lea		FP_DST(%a6),%a0		# pass: ptr to dst op
	bsr.l		set_tag_x		# tag the operand type
	cmpi.b		%d0,&UNNORM		# is operand an UNNORM?
	bne.b		fu_op2_done		# no
	bsr.l		unnorm_fix		# yes; convert to NORM,DENORM,or ZERO
fu_op2_done:
	mov.b		%d0,DTAG(%a6)		# save dst optype tag

fu_extract:
	clr.l		%d0
	mov.b		FPCR_MODE(%a6),%d0	# fetch rnd mode/prec

	bfextu		1+EXC_CMDREG(%a6){&1:&7},%d1 # extract extension

	lea		FP_SRC(%a6),%a0
	lea		FP_DST(%a6),%a1

	mov.l		(tbl_unsupp.l,%pc,%d1.l*4),%d1 # fetch routine addr
	jsr		(tbl_unsupp.l,%pc,%d1.l*1)

#
# Exceptions in order of precedence:


 with sections.
  * The support is controlled by the `CATCH_CONFIG_EXPERIMENTAL_STATIC_ANALYSIS_SUPPORT` option and autodetects clang-tidy and Coverity.
* `*_THROWS`, `*_THROWS_AS`, etc now suppress warning coming from `__attribute__((warn_unused_result))` on GCC  (#2691)
  * Unlike plain `[[nodiscard]]`, this warning is not silenced by void cast. WTF GCC?

### Fixes
* Fixed `assertionStarting` events being sent after the expr is evaluated (#2678)
* Errors in `TEST_CASE` tags are now reported nicely (#2650)

### Miscellaneous
* Bunch of improvements to `catch_discover_tests`
  * Added DISCOVERY_MODE option, so the discovery can happen either post build or pre-run.
  * Fixed handling of semicolons and backslashes in test names (#2674, #2676)
* meson build can disable building tests (#2693)
* meson build properly sets meson version 0.54.1 as the minimal supported version (#2688)

## 3.3.2

### Improvements
* Further reduced allocations
  * The compact, console, TAP and XML reporters perform less allocations in various cases
  * Removed 1 allocation per entered `SECTION`/`TEST_CASE`.
  * Removed 2 allocations per test case exit, if stdout/stderr is captured
* Improved performance
  * Section tracking is 10%-25% faster than in v3.3.0
  * Assertion handling is 5%-10% faster than in v3.3.0
  * Test case registration is 1%-2% faster than in v3.3.0
  * Tiny speedup for registering listeners
  * Tiny speedup for `CAPTURE`, `TEST_CASE_METHOD`, `METHOD_AS_TEST_CASE`, and `TEMPLATE_LIST_TEST_*` macros.
* `Contains`, `RangeEquals` and `UnorderedRangeEquals` matchers now support ranges with iterator + sentinel pair
* Added `IsNaN` matcher
  * Unlike `REQUIRE(isnan(x))`, `REQUIRE_THAT(x, IsNaN())` shows you the value of `x`.
* Suppressed `declared_but_not_referenced` warning for NVHPC (#2637)

### Fixes
* Fixed performance regression in section tracking introduced in v3.3.1
  * Extreme cases would cause the tracking to run about 4x slower than in 3.3.0

## 3.3.1

### Improvements
* Reduced allocations and improved performance
  * The exact improvements are dependent on your usage of Catch2.
  * For example running Catch2's SelfTest binary performs 8k less allocations.
  * The main improvement comes from smarter handling of `SECTION`s, especially sibling `SECTION`s

## 3.3.0

### Improvements

* Added `MessageMatches` exception matcher (#2570)
* Added `RangeEquals` and `UnorderedRangeEquals` generic range matchers (#2377)
* Added `SKIP` macro for skipping tests from within the test body (#2360)
  * All built-in reporters have been extended to handle it properly, whether your custom reporter needs changes depends on how it was written
  * `skipTest` reporter event **is unrelated** to this, and has been deprecated since it has practically no uses
* Restored support for PPC Macs in the break-into-debugger functionality (#2619)
* Made our warning suppression compatible with CUDA toolkit pre 11.5 (#2626)
* Cleaned out some static analysis complaints

### Fixes

* Fixed macro redefinition warning when NVCC was reporting as MSVC (#2603)
* Fixed throws in generator constructor causing the whole binary to abort (#2615)
  * Now it just fails the test
* Fixed missing transitive include with libstdc++13 (#2611)

### Miscellaneous

* Improved support for dynamic library build with non-MSVC compilers on Windows (#2630)
* When used as a subproject, Catch2 keeps its generated header in a separate directory from the main project (#2604)

## 3.2.1

### Improvements
*


ci_place == nil then
		place = {"bmx7"}
	else
		local util = require "luci.util"
		place = util.split(uci_place," ")
	end

	-- getting position of menu
	local uci_position = uci:get("luci-bmx7","luci","position")

	---------------------------
	-- Placing the pages in the menu
	---------------------------

	-- Status (default)
	entry(place,call("action_status_j"),place[#place],tonumber(uci_position))

	table.insert(place,"Status")
	entry(place,call("action_status_j"),"Status",0)
	table.remove(place)

	-- Topology
	table.insert(place,"Topology")
	entry(place,call("topology"),"Topology",1)
	table.remove(place)

	-- Nodes
	table.insert(place,"Nodes")
	entry(place,call("action_nodes_j"),"Nodes",2)
	table.remove(place)

	-- Tunnels
	table.insert(place,"Gateways")
	entry(place,call("action_tunnels_j"),"Gateways",3)
	table.remove(place)

	-- Integrate bmx7-mdns if present
	if nixio.fs.stat("/usr/lib/lua/luci/model/cbi/bmx7-mdns.lua","type") ~= nil then
		table.insert(place,"mDNS")
		entry(place, cbi("bmx7-mdns"), "mesh DNS", 1).dependent=false
		table.remove(place)
	end

end

function action_status_j()
	luci.template.render("bmx7/status_j", {})
end

function action_tunnels_j()
	luci.template.render("bmx7/tunnels_j", {})
end

function topology()
	luci.template.render("bmx7/topology", {})
end

function action_nodes_j()
	luci.template.render("bmx7/nodes_j", {})
end


["𢄘"] = "豕辶巾",
    ["𢄙"] = "巾口貝",
    ["𢄚"] = "米斗夕巾",
    ["𢄛"] = "巾弓コ口",
    ["𢄜"] = "巾龴囗",
    ["𢄝"] = "白巾勹巳",
    ["𢄞"] = "米攵巾",
    ["𢄟"] = "巾龴辶",
    ["𢄠"] = "巾匸口口",
    ["𢄡"] = "未攵厂巾",
    ["𢄢"] = "土八土巾",
    ["𢄣"] = "巾丰丰",
    ["𢄤"] = "車斤巾",
    ["𢄥"] = "彐⺈巾巾",
    ["𢄦"] = "巾鳥",
    ["𢄧"] = "方𠂉矢巾",
    ["𢄨"] = "巾宀一八",
    ["𢄩"] = "巾艹冖巾",
    ["𢄪"] = "巾羽人彡",
    ["𢄫"] = "冖巾コ",
    ["𢄬"] = "十冖巾巾",
    ["𢄭"] = "巾羽白",
    ["𢄮"] = "予冂人巾",
    ["𢄯"] = "巾𠂉母攵",
    ["𢄰"] = "巾夂丷口",
    ["𢄱"] = "巾車辶",
    ["𢄲"] = "方𠂉疋巾",
    ["𢄳"] = "巾大耂日",
    ["𢄴"] = "巾衣夕夕",
    ["𢄵"] = "巾象",
    ["𢄶"] = "巾田一",
    ["𢄷"] = "巾大丷小",
    ["𢄸"] = "巾曰耳又",
    ["𢄹"] = "巾丿大口",
    ["𢄺"] = "巾隹灬",
    ["𢄻"] = "巾龷⺝攵",
    ["𢄼"] = "彡頁巾",
    ["𢄽"] = "巾弋二貝",
    ["𢄾"] = "日二巾巾",
    ["𢄿"] = "十口冖巾",
    ["𢅀"] = "巾覀日十",
    ["𢅁"] = "爫子白巾",
    ["𢅂"] = "巾弓工口",
    ["𢅃"] = "巾癶十几",
    ["𢅄"] = "罒土厶巾",
    ["𢅅"] = "巾厂䒑欠",
    ["𢅆"] = "巾艹日月",
    ["𢅇"] = "山巾屮毛",
    ["𢅈"] = "亠巾亠巾",
    ["𢅉"] = "白巾白儿",
    ["𢅊"] = "𠂉卌一巾",
    ["𢅋"] = "巾丷囗曰",
    ["𢅌"] = "爫丿ヿ巾",
    ["𢅍"] = "士冖石巾",


()
		ns := action.GetNamespace()
		watch, err := o.Watch(gvr, ns)
		if err != nil {
			return false, nil, err
		}
		return true, watch, nil
	})

	return cs
}

// Clientset implements clientset.Interface. Meant to be embedded into a
// struct to get a default implementation. This makes faking out just the method
// you want to test easier.
type Clientset struct {
	testing.Fake
	discovery *fakediscovery.FakeDiscovery
	tracker   testing.ObjectTracker
}

func (c *Clientset) Discovery() discovery.DiscoveryInterface {
	return c.discovery
}

func (c *Clientset) Tracker() testing.ObjectTracker {
	return c.tracker
}

var _ clientset.Interface = &Clientset{}

// KarydiaV1alpha1 retrieves the KarydiaV1alpha1Client
func (c *Clientset) KarydiaV1alpha1() karydiav1alpha1.KarydiaV1alpha1Interface {
	return &fakekarydiav1alpha1.FakeKarydiaV1alpha1{Fake: &c.Fake}
}
// Copyright (C) 2019 SAP SE or an SAP affiliate company. All rights reserved.
// This file is licensed under the Apache Software License, v. 2 except as
// noted otherwise in the LICENSE file.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

// Code generated by client-gen. DO NOT EDIT.

package fake

import (
	v1alpha1 "github.com/karydia/karydia/pkg/apis/karydia/v1alpha1"
	v1 "k8s.io/apimachinery/pkg/apis/meta/v1"
	labels "k8s.io/apimachinery/pkg/labels"
	schema "k8s.io/apimachinery/pkg/runtime/schema"
	types "k8s.io/apimachinery/pkg/types"
	watch "k8s.io/apimachinery/pkg/watch"
	testing "k8s.io/client-go/testing"
)

// FakeKarydiaConfigs implements KarydiaConfigInterface
type FakeKarydiaConfigs struct {
	Fake *FakeKarydiaV1alpha1
}

var karydiaconfigsResource = schema.GroupVersionResource{Group: "karydia.gardener.cloud", Version: "v1alpha1", Resource: "karydiaconfigs"}

var karydiaconfigsKind = schema.GroupVersionKind{Group: "karydia.gardener.cloud", Version: "v1alpha1", Kind: "KarydiaConfig"}

// Get takes name of the karydiaConfig, and returns the corresponding karydiaConfig object, and an error if there is any.
func (c *FakeKarydiaConfigs) Get(name string, options v1.GetOptions) (result *v1alpha1.KarydiaConfig, err error) {
	obj, err := c.Fake.
		Invokes(testing.NewRootGetAction(karydiaconfigsResource, name), &v1alpha1.KarydiaConfig{})
	if obj == nil {
		return nil, err
	}
	return obj.(*v1alpha1.KarydiaConfig), err
}

// List takes label and field selectors, and returns the list of KarydiaConfigs that match those selectors.
func (c *FakeKarydiaConfigs) List(opts v1.ListOptions) (result *v1alpha1.KarydiaConfigList, err


out << i << " " << perA << " " << perB << std::endl;
    }
  for (uint32_t i = 100; i < 4000; i += 50)
    {
      CollisionExperiment experiment;
      CollisionExperiment::Output output;
      input.interval = MicroSeconds (i);
      output = experiment.Run (input);
      double perA = (output.receivedA + 0.0) / (input.nPackets + 0.0);
      double perB = (output.receivedB + 0.0) / (input.nPackets + 0.0);
      std::cout << i << " " << perA << " " << perB << std::endl;
    }
}

int main (int argc, char *argv[])
{
  if (argc <= 1)
    {
      std::cout << "Available experiments: "
                << "Psr "
                << "SizeVsRange "
                << "PsrVsDistance "
                << "PsrVsCollisionInterval "
                << std::endl;
      return -1;
    }
  std::string type = argv[1];
  argc--;
  argv[1] = argv[0];
  argv++;
  if (type == "Psr")
    {
      PrintPsr (argc, argv);
    }
  else if (type == "SizeVsRange")
    {
      PrintSizeVsRange (argc, argv);
    }
  else if (type == "PsrVsDistance")
    {
      PrintPsrVsDistance (argc, argv);
    }
  else if (type == "PsrVsCollisionInterval")
    {
      PrintPsrVsCollisionInterval (argc, argv);
    }

  return 0;
}
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
 * Copyright (c) 2009 MIRKO BANCHI
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation;
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Author: Mirko Banchi <mk.banchi@gmail.com>
 */
#include "block-ack-agreement.h"

namespace ns3 {

BlockAckAgreement::BlockAckAgreement ()
  : m_amsduSupported (0),
    m_blockAckPolicy (1),
    m_inactivityEvent ()
{
}

BlockAckAgreement::BlockAckAgreement (Mac48Address peer, uint8_t tid)
  : m_amsduSupported (0),
    m_blockAckPolicy (1),
    m_inactivityEvent ()
{
  m_tid = tid;
  m_peer = peer;
}

BlockAckAgreement::~BlockAckAgreement ()
{
  m_inactivityEvent.Cancel ();
}

void
BlockAckAgreement::SetBufferSize (uint16_t bufferSize)
{
  NS_ASSERT (bufferSize <= 1024);
  NS_ASSERT (bufferSize % 16 == 0);
  m_bufferSize = bufferSize;
}
void
BlockAckAgreement::SetTimeout (uint16_t timeout)
{
  m_timeout = timeout;
}
void
BlockAckAgreement::SetStartingSequence (uint16_t seq)
{
  NS_ASSERT (seq < 4096);
  m_startingSeq = seq;
}
void
BlockAckAgreement::SetImmediateBlockAck (void)
{
  m_blockAckPolicy = 1;
}
void
BlockAckAgreement::SetDelayedBlockAck (void)
{
  m_blockAckPolicy = 0;
}
void
BlockAckAgreement::SetAmsduSupport (bool supported)
{
  m_amsduSupported = supported;
}

uint8


你是一家医院的工作人员，如何有效地管理预约疫苗接种的数据？|
| 新冠疫情 | 请分析当前全球疫情趋势，并预测未来一个月内可能出现的变化。|
| 自然语言处理 | 什么是自然语言处理技术？请列举三个应用场景。|
| 电商平台 | 在电商平台上，如何提高用户的购物体验？请提供五个具体的建议。|
| 工业设计 | 请举例说明工业设计在产品开发中的重要性。|
| 人工智能 | 目前人工智能技术存在哪些局限性？请列举三个方面并阐述原因。|
| 数据隐私保护 | 如何确保企业或组织所收集到的用户数据不被滥用或泄露？请提供三个具体措施。|
| 金融科技 | 请描述一下国内外金融科技的发展现状，并对其未来进行预测。|
| 区块链技术 | 如何利用区块链技术提高传统金融系统的安全性和效率？请提供三个具体的方法或应用案例。|
| 健康饮食 | 列举五种能够提高免疫力的食物 |
| 旅游 | 在巴厘岛旅游需要注意哪些事项？ |
| 科技 | GPT-3.5模型有哪些应用场景？ |
| 电影 | 请推荐三部最近上映或即将上映的电影。 |
| 环境保护 | 如何有效减少塑料污染？ |
| 育儿教育 | 如何教育孩子遵守规矩和礼仪？ |
| 人工智能 | 人工智能技术在医学领域有哪些应用？ |
| 就业 | 如何应对职场中的人际冲突？ |
| 历史文化 | 请介绍一下秦始皇统一六国后的改革措施。 |
| 医疗健康 | 如何防止中老年人患上高血压和高血脂？ |
| 分类 | 如何将文本数据分成训练集和测试集？ |
| 文本编辑 | 把这段话改写成更简洁的表达：“由于天气炎热，大家都穿着轻便的衣服。” |
| 比较 | 两个模型之间的差异在哪里？ |
| 开放生成 | 描述一种理想的未来社会。 |
| 想象推理 | 如果地球上没有重力，会发生什么？ |
| 数据预处理 | 怎样解决数据中的缺失值？ |
| 查询 | 如


start-5 {
    gap-inline-start: 20px;
  }
}

@media screen and (min-width: 1280px) {
  .box--lg\:gap-inline-end-5 {
    gap-inline-end: 20px;
  }
}

.box--gap-top-6 {
  gap-top: 24px;
}

[dir="ltr"] .box--gap-right-6 {
  gap-right: 24px;
}

[dir="rtl"] .box--gap-right-6 {
  gap-left: 24px;
}

.box--gap-bottom-6 {
  gap-bottom: 24px;
}

[dir="ltr"] .box--gap-left-6 {
  gap-left: 24px;
}

[dir="rtl"] .box--gap-left-6 {
  gap-right: 24px;
}

.box--gap-inline-6 {
  gap-inline: 24px;
}

.box--gap-inline-start-6 {
  gap-inline-start: 24px;
}

.box--gap-inline-end-6 {
  gap-inline-end: 24px;
}

@media screen and (min-width: 576px) {
  .box--sm\:gap-top-6 {
    gap-top: 24px;
  }
}

@media screen and (min-width: 576px) {
  [dir="ltr"] .box--sm\:gap-right-6 {
    gap-right: 24px;
  }

  [dir="rtl"] .box--sm\:gap-right-6 {
    gap-left: 24px;
  }
}

@media screen and (min-width: 576px) {
  .box--sm\:gap-bottom-6 {
    gap-bottom: 24px;
  }
}

@media screen and (min-width: 576px) {
  [dir="ltr"] .box--sm\:gap-left-6 {
    gap-left: 24px;
  }

  [dir="rtl"] .box--sm\:gap-left-6 {
    gap-right: 24px;
  }
}

@media screen and (min-width: 576px) {
  .box--sm\:gap-inline-6 {
    gap-inline: 24px;
  }
}

@media screen and (min-width: 576px) {
  .box--sm\:gap-inline-start-6 {
    gap-inline-start: 24px;
  }
}

@media screen and (min-width: 576px) {
  .box--sm\:gap-inline-end-6 {
    gap-inline-end: 24px;
  }
}

@media screen and (min-width: 768px) {
  .box--md\:gap-top-6 {
    gap-top: 24px;
  }
}

@media screen and (min-width: 768px) {
  [dir="ltr"] .box--md\:gap-right-6 {
    gap-right: 24px;
  }

  [dir="rtl"] .box--md\:gap-right-6 {
    gap-left: 24px;
  }
}

@media screen and (min-width: 768px) {
  .box--md\:gap-bottom-6 {
    gap-bottom: 24px;
  }
}

@media screen and (min-width: 768px) {
  [dir="ltr"] .box--md\:gap-left-6 {
    gap-left: 24px;
  }

  [dir="rtl"] .box--md\:gap-left-6 {
    gap-right: 24px;
  }
}

@media screen and (min-width: 768px) {
  .box--md\:gap-inline-6 {
    gap-inline: 24px;
  }
}

@media screen and (min-width: 768px) {
  .box--md\:gap-inline-start-6


t context,
    required VoidCallback onAttachmentTap,
  }) {
    return OnTapScale(
      onTap: onAttachmentTap,
      child: Row(
        children: [
          Icon(
            CupertinoIcons.paperclip,
            color: context.colorScheme.textPrimary,
            size: 16,
          ),
          Text(
            context.l10n.contact_support_attachment,
            style: AppTextStyle.body2.copyWith(
              color: context.colorScheme.textPrimary,
            ),
          ),
        ],
      ),
    );
  }
}
// coverage:ignore-file
// GENERATED CODE - DO NOT MODIFY BY HAND
// ignore_for_file: type=lint
// ignore_for_file: unused_element, deprecated_member_use, deprecated_member_use_from_same_package, use_function_type_syntax_for_parameters, unnecessary_const, avoid_init_to_null, invalid_override_different_default_values_named, prefer_expression_function_bodies, annotate_overrides, invalid_annotation_target, unnecessary_question_mark

part of 'tournament_detail_view_model.dart';

// **************************************************************************
// FreezedGenerator
// **************************************************************************

T _$identity<T>(T value) => value;

final _privateConstructorUsedError = UnsupportedError(
    'It seems like you constructed your class using `MyClass._()`. This constructor is only meant to be used by freezed and you are not supposed to need it nor use it.\nPlease check the documentation here for more information: https://github.com/rrousselGit/freezed#adding-getters-and-methods-to-our-models');

/// @nodoc
mixin _$TournamentDetailState {
  TournamentModel? get tournament => throw _privateConstructorUsedError;
  bool get loading => throw _privateConstructorUsedError;
  int get selectedTab => throw _privateConstructorUsedError;
  Object? get error => throw _privateConstructorUsedError;
  Object? get actionError => throw _privateConstructorUsedError;
  String? get currentUserId => throw _privateConstructorUsedError;
  String? get matchFilter => throw _privateConstructorUsedError;
  List<MatchModel> get matches => throw _privateConstructorUsedError;
  List<TournamentTeamStat> get teamStats => throw _privateConstructorUsedError;
  List<PlayerKeyStat> get keyStats => throw _privateConstructorUsedError;
  List<MatchModel> get filteredMatches => throw _privateConstructorUsedError;
  KeyStatFilterTag get selectedFilterTag => throw _privateConstructorUsedError;
  List<PlayerKeyStat> get filteredStats => throw _privateConstructorUsedError;

  /// Create a copy of TournamentDetailState
  /// with the given fields replaced by the non-null parameter values.
  @JsonKey(includeFromJson: false, includeToJson: false)
  $TournamentDetailStateCopyWith<TournamentDetailState> get copyWith =>
      throw _privateConstructorUsedError;
}

/// @nodoc
abstract class $TournamentDetailStateCopyWith<$Res> {
  factory $TournamentDetailStateCopyWith(TournamentDetailState value,
          $Res Function(TournamentDetailState) then) =
      _$TournamentDetailStateCopyWithImpl<$Res, TournamentDetailState>;
  @useResult
  $Res call(
      {TournamentModel? tournament,
      bool loading,
      int selectedTab,
      Object? error,
      Object? actionError,
      String? currentUserId,
      String? matchFilter,
      List<MatchModel> matches,
      List<TournamentTeamStat> teamStats,
      List<PlayerKeyStat> keyStats,
      List<MatchModel> filteredMatches,
      KeyStatFilterTag selectedFilterTag,
      List<PlayerKeyStat> filteredStats});

  $TournamentModelCopyWith<$Res>? get tournament;
}

/// @nodoc
class _$TournamentDetailStateCopyWithImpl<$Res,
        $Val extends TournamentDetailState>
    implements $TournamentDetailStateCopyWith<$Res> {
  _$TournamentDetailStateCopyWithImpl(this._value,


#!c:/Python311/python

# Copyright 2024, Gurobi Optimization, LLC

# Use a Microsoft Access database and ODBC for the diet model
# (dietmodel.py).
#
# Note that this example reads an external data file (..\data\diet.accdb).
# As a result, it must be run from the Gurobi examples/python directory.
#
# Note also that you can't mix 32-bit and 64-bit programs in ODBC.
# If you are using the 32-bit version of Microsoft Office, this
# example will only work with the win32 Gurobi installation.

import pyodbc
import dietmodel
import gurobipy as gp

driver = "Driver={Microsoft Access Driver (*.mdb, *.accdb)};"
datafile = "DBQ=..\\data\\diet.accdb;"
con = pyodbc.connect(driver + datafile)
cur = con.cursor()

cur.execute("select category,minnutrition,maxnutrition from categories")
result = cur.fetchall()
categories, minNutrition, maxNutrition = gp.multidict(
    (cat, [minv, maxv]) for cat, minv, maxv in result
)

cur.execute("select food,cost from foods")
result = cur.fetchall()
foods, cost = gp.multidict(result)

cur.execute("select food,category,value from nutrition")
result = cur.fetchall()
nutritionValues = dict(((f, c), v) for f, c, v in result)

con.close()

dietmodel.solve(categories, minNutrition, maxNutrition, foods, cost, nutritionValues)


ulation (Nanopore/PacBio)](#long-read-simulation)
3. [Variant Spiking](#variant-spiking)
4. [Mutational Signatures](#mutational-signatures)
5. [Strand Bias Introduction](#strand-bias)
6. [Quality Control](#quality-control)
7. [Complete Workflows](#complete-workflows)

---

## Short Read Simulation

### Basic Usage
Simulate paired-end Illumina reads at 30x depth:
```bash
seqforge short --reference genome.fa --depth 30 --profile HS25
```

### Advanced Options
```bash
# High-depth targeted sequencing simulation
seqforge short \
  --reference target_region.fa \
  --outdir results_targeted \
  --depth 500 \
  --read-len 150 \
  --profile HSXt \
  --mean-frag-len 350 \
  --std-frag-len 50 \
  --paired

# Single-end reads for RNA-seq simulation
seqforge short \
  --reference transcriptome.fa \
  --outdir results_rnaseq \
  --depth 100 \
  --read-len 75 \
  --profile HS25 \
  --single
```

### Using Cached GRCh38 Reference
```bash
# No --reference flag uses cached GRCh38
seqforge short --depth 50 --profile HS25 --outdir grch38_reads
```

### Error Handling Examples
The improved error messages help guide correct usage:
```bash
# This will show helpful error about depth
seqforge short --reference genome.fa --depth -10

# This will show error about fragment length
seqforge short --reference genome.fa --depth 30 --read-len 150 --mean-frag-len 100 --paired
```

---

## Long Read Simulation

### Basic Nanopore Simulation
```bash
# Coverage-based simulation
seqforge long --reference genome.fa --depth 20 --model nanopore_R9.4.1

# Exact read count simulation (overrides depth)
seqforge long --reference genome.fa --num-reads 10000 --model nanopore_R10.3
```

### PacBio Simulation
```bash
# PacBio CLR (Continuous Long Read)
seqforge long \
  --reference genome.fa \
  --outdir pacbio_clr \
  --depth 15 \
  --model pacbio_CLR

# PacBio CCS (Circular Consensus Sequencing)
seqforge long \
  --reference genome.fa \
  --outdir pacbio_ccs \
  --num-reads 5000 \
  --model pacbio_CCS
```

### RNA Nanopore Simulation
```bash
seqforge long \
  --reference transcriptome.fa \
  --outdir nanopore_rna \
  --depth 50 \
  --model nanopore_RNA
```

---

## Variant Spiking

### Basic SNP Spiking
Create a VCF file with variants to spike:
```bash
cat > snps.vcf << EOF
##fileformat=VCFv4.2
#CHROM	POS	ID	REF	ALT	QUAL	FILTER	INFO
chr12	25245350	KRAS_G12C	G	C	100	PASS	.
chr17	7577538	TP53_R248Q	C	T	100	PASS	.
EOF

# Spike variants into existing BAM
seqforge spike \
  --reference genome.fa \
  --input-bam normal.bam \
  --snp-vcf snps.vcf \
  --output-prefix tumor \
  --vaf 0.3 \
  --seed 42
```

### Multi-BAM Spiking
```bash
# Spike into multiple BAMs simultaneously
seqforge spike \
  --reference genome.fa \
  --input-bam sample1.bam \
  --input-bam sample2.bam \
  --input-bam sample3.bam \
  --snp-vcf driver_mutations.vcf \
  --indel-vcf indels.vcf \
  --output-prefix spiked \
  --vaf 0.25
```

### Setting up