max_stars_count
int64 301
224k
| text
stringlengths 6
1.05M
| token_count
int64 3
727k
|
|---|---|---|
359 | /*
* Copyright (C) 2020-2021, Xilinx Inc - All rights reserved
* Xilinx Runtime (XRT) Experimental APIs
*
* Licensed under the Apache License, Version 2.0 (the "License"). You may
* not use this file except in compliance with the License. A copy of the
* License is located 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 XRT_XCLBIN_H_
#define XRT_XCLBIN_H_
#include "xrt.h"
#include "xclbin.h"
#include "xrt/xrt_uuid.h"
#include "xrt/detail/pimpl.h"
#ifdef __cplusplus
# include <utility>
# include <vector>
# include <string>
#endif
/**
* typedef xrtXclbinHandle - opaque xclbin handle
*/
typedef void* xrtXclbinHandle; // NOLINT
#ifdef __cplusplus
namespace xrt {
/*!
* @class xclbin
*
* @brief
* xrt::xclbin represents an xclbin and provides APIs to access meta data.
*
* @details
* The xclbin object is constructed by the user from a file.
*
* When the xclbin object is constructed from a complete xclbin, then it
* can be used by xrt::device to program the xclbin onto the device.
*
* **First-class objects and class navigation**
*
* All meta data is rooted at xrt::xclbin.
*
* \image{inline} html xclbin_navigation.png "xclbin navigation"
*
* From the xclbin object
* xrt::xclbin::kernel or xrt::xclbin::ip objects can be constructed.
*
* The xrt:xclbin::kernel is a concept modelled only in the xclbin XML
* metadata, it corresponds to a function that can be executed by one
* or more compute units modelled by xrt::xclbin::ip objects. An
* xrt::xclbin::ip object corresponds to an entry in the xclbin
* IP_LAYOUT section, so the xrt::xclbin::kernel object is just a
* grouping of one or more of these.
*
* In some cases the kernel concept is not needed, thus
* xrt::xclbin::ip objects corresponding to entries in the xclbin
* IP_LAYOUT sections can be accessed directly.
*
* An xrt::xclbin::arg object corresponds to one or more entries in
* the xclbin CONNECTIVITY section decorated with additional meta data
* (offset, size, type, etc) from the XML section if available. An
* argument object represents a specific kernel or ip argument. If
* the argument is a global buffer, then it may connect to one or more
* memory objects.
*
* Finally the xrt::xclbin::mem object corresponds to an entry in the
* MEM_TOPOLOGY section of the xclbin.
*/
class xclbin_impl;
class xclbin : public detail::pimpl<xclbin_impl>
{
public:
/**
* @enum taget_type - type of xclbin
*
* @details
* See `xclbin.h`
*/
enum class target_type { hw, sw_emu, hw_emu };
public:
/*!
* @class mem
*
* @brief
* xrt::xclbin::mem represents a physical device memory bank
*
* @details
* A memory object is constructed from an entry in the MEM_TOPOLOGY
* section of an xclbin.
*/
class mem_impl;
class mem : public detail::pimpl<mem_impl>
{
public:
/**
* @enum memory_type - type of memory
*
* @details
* See `xclbin.h`
*/
enum class memory_type : uint8_t {
ddr3 = MEM_DDR3,
ddr4 = MEM_DDR4,
dram = MEM_DRAM,
streaming = MEM_STREAMING,
preallocated_global = MEM_PREALLOCATED_GLOB,
are = MEM_ARE, //Aurora
hbm = MEM_HBM,
bram = MEM_BRAM,
uram = MEM_URAM,
streaming_connection = MEM_STREAMING_CONNECTION,
host = MEM_HOST
};
public:
mem() = default;
explicit
mem(std::shared_ptr<mem_impl> handle)
: detail::pimpl<mem_impl>(std::move(handle))
{}
/**
* get_name() - Get tag name
*
* @return
* Memory tag name
*/
XCL_DRIVER_DLLESPEC
std::string
get_tag() const;
/**
* get_base_address() - Get the base address of the memory bank
*
* @return
* Base address of the memory bank, or -1 for invalid base address
*/
XCL_DRIVER_DLLESPEC
uint64_t
get_base_address() const;
/**
* get_size() - Get the size of the memory in KB
*
* @return
* Size of memory in KB, or -1 for invalid size
*/
XCL_DRIVER_DLLESPEC
uint64_t
get_size_kb() const;
/**
* get_used() - Get used status of the memory
*
* @return
* True of this memory bank is used by kernels in the xclbin
* or false otherwise.
*
* A value of false indicates that no buffer can be allocated
* in this memory bank.
*/
XCL_DRIVER_DLLESPEC
bool
get_used() const;
/**
* get_type() - Get the type of the memory
*
* @return
* Memory type
*
*/
XCL_DRIVER_DLLESPEC
memory_type
get_type() const;
/**
* get_index() - Get the index of the memory
*
* @return
* Index of the memory within the memory topology
*
* The returned index can be used when allocating buffers using
* \ref xrt::bo provided the memory bank is connected / used.
*/
XCL_DRIVER_DLLESPEC
int32_t
get_index() const;
};
/*!
* @class arg
*
* @brief
* class arg - xrt::xclbin::arg represents a compute unit argument
*
* @details
* The argument object constructed from the xclbin connectivity
* section. An argument is connected to a memory bank or a memory
* group, which dictates where in device memory a global buffer
* used with this kernel argument must be allocated.
*/
class arg_impl;
class arg : public detail::pimpl<arg_impl>
{
public:
arg() = default;
explicit
arg(std::shared_ptr<arg_impl> handle)
: detail::pimpl<arg_impl>(std::move(handle))
{}
/**
* get_name() - Get argument name
*
* @return
* Name of argument.
*
*/
XCL_DRIVER_DLLESPEC
std::string
get_name() const;
/**
* get_mems() - Get list of device memories from xclbin.
*
* @return
* A list of xrt::xclbin::mem objects to which this argument
* is connected.
*/
XCL_DRIVER_DLLESPEC
std::vector<mem>
get_mems() const;
/**
* get_port() - Get port name of this argument
*
* @return
* Port name
*/
XCL_DRIVER_DLLESPEC
std::string
get_port() const;
/**
* get_size() - Argument size in bytes
*
* @return
* Argument size
*/
XCL_DRIVER_DLLESPEC
uint64_t
get_size() const;
/**
* get_offset() - Argument offset
*
* @return
* Argument offset
*/
XCL_DRIVER_DLLESPEC
uint64_t
get_offset() const;
/**
* get_host_type() - Get the argument host type
*
* @return
* Argument host type
*/
XCL_DRIVER_DLLESPEC
std::string
get_host_type() const;
/**
* get_index() - Get the index of this argument
*
* @return
* Argument index
*/
XCL_DRIVER_DLLESPEC
size_t
get_index() const;
};
/*!
* @class ip
*
* @brief
* xrt::xclbin::ip represents a IP in an xclbin.
*
* @details
* The ip corresponds to an entry in the IP_LAYOUT section of the
* xclbin.
*/
class ip_impl;
class ip : public detail::pimpl<ip_impl>
{
public:
/**
* @enum control_type -
*
* @details
* See `xclbin.h`
*/
enum class control_type : uint8_t { hs = 0, chain = 1, none = 2, fa = 5 };
public:
ip() = default;
explicit
ip(std::shared_ptr<ip_impl> handle)
: detail::pimpl<ip_impl>(std::move(handle))
{}
/**
* get_name() - Get name of IP
*
* @return
* IP name.
*/
XCL_DRIVER_DLLESPEC
std::string
get_name() const;
/**
* get_control_type() - Get the IP control protocol
*
* @return
* Control type
*/
XCL_DRIVER_DLLESPEC
control_type
get_control_type() const;
/**
* get_num_args() - Number of arguments
*
* @return
* Number of arguments for this IP per CONNECTIVITY section
*/
XCL_DRIVER_DLLESPEC
size_t
get_num_args() const;
/**
* get_args() - Get list of IP arguments
*
* @return
* A list sorted of xclbin::arg sorted by argument indices
*
* An argument may have multiple memory connections
*/
XCL_DRIVER_DLLESPEC
std::vector<arg>
get_args() const;
/**
* get_arg() - Get argument at index.
*
* @return
* The argument a specified index
*
* The argument may have multiple memory connections
*/
XCL_DRIVER_DLLESPEC
arg
get_arg(int32_t index) const;
/**
* get_base_address() - Get the base address of the cu
*
* @return
* The base address of the IP
*/
XCL_DRIVER_DLLESPEC
uint64_t
get_base_address() const;
/**
* get_size() - Get the address range size of this IP.
*
* @return
* The size of this IP
*
* The address range is a property of the kernel and
* as such only valid for for kernel compute units.
*
* For IPs that are not associated with a kernel, the
* size return is 0.
*/
XCL_DRIVER_DLLESPEC
size_t
get_size() const;
};
/*!
* class kernel
*
* @brief
* xrt::xclbin::kernel represents a kernel in an xclbin.
*
* @details
* The kernel corresponds to an entry in the XML meta data section
* of the xclbin combined with meta data from other xclbin sections.
* The kernel object is implicitly constructed from the xclbin
* object via APIs.
*/
class kernel_impl;
class kernel : public detail::pimpl<kernel_impl>
{
public:
kernel() = default;
explicit
kernel(std::shared_ptr<kernel_impl> handle)
: detail::pimpl<kernel_impl>(std::move(handle))
{}
/**
* get_name() - Get kernel name
*
* @return
* The name of the kernel
*/
XCL_DRIVER_DLLESPEC
std::string
get_name() const;
/**
* get_cus() - Get list of cu from kernel.
*
* @return
* A list of xrt::xclbin::ip objects corresponding the compute units
* for this kernel object.
*/
XCL_DRIVER_DLLESPEC
std::vector<ip>
get_cus() const;
/**
* get_cus() - Get list of compute units that matches name
*
* @param name
* Name to match against, prefixed with kernel name
* @return
* A list of xrt::xclbin::ip objects that are compute units
* of this kernel object and matches the specified name.
*
* The kernel name can optionally specify which kernel instance(s) to
* match "kernel:{cu1,cu2,...} syntax.
*/
XCL_DRIVER_DLLESPEC
std::vector<ip>
get_cus(const std::string& kname) const;
/**
* get_cu() - Get compute unit by name
*
* @return
* The xct::xclbin::ip object matching the specified name, or error if
* not present.
*/
XCL_DRIVER_DLLESPEC
ip
get_cu(const std::string& name) const;
/**
* get_num_args() - Number of arguments
*
* @return
* Number of arguments for this kernel.
*/
XCL_DRIVER_DLLESPEC
size_t
get_num_args() const;
/**
* get_args() - Get list of kernel arguments
*
* @return
* A list sorted of xclbin::arg sorted by argument indices
*
* An argument may have multiple memory connections
*/
XCL_DRIVER_DLLESPEC
std::vector<arg>
get_args() const;
/**
* get_arg() - Get kernel argument at index.
*
* @return
* The xrt::xclbin::arg object at specified argument index.
*
* The memory connections of an argument is the union of the
* connections for each compute unit for that particular argument.
* In other words, for each connection of the argument returned
* by ``get_arg()`` there is at least one compute unit that has
* that connection.
*/
XCL_DRIVER_DLLESPEC
arg
get_arg(int32_t index) const;
};
public:
/**
* xclbin() - Construct empty xclbin object
*/
xclbin() = default;
/// @cond
/**
* xclbin() - Construct from handle
*/
explicit
xclbin(std::shared_ptr<xclbin_impl> handle)
: detail::pimpl<xclbin_impl>(handle)
{}
/// @endcond
/**
* xclbin() - Constructor from an xclbin filename
*
* @param filename
* Path to the xclbin file
*
* Throws if file not found.
*/
XCL_DRIVER_DLLESPEC
explicit
xclbin(const std::string& filename);
/**
* xclbin() - Constructor from raw data
*
* @param data
* Raw data of xclbin
*
* The raw data of the xclbin can be deleted after calling the
* constructor.
*/
XCL_DRIVER_DLLESPEC
explicit
xclbin(const std::vector<char>& data);
/**
* xclbin() - Constructor from raw data
*
* @param top
* Raw data of xclbin file as axlf*
*
* The argument axlf is copied by the constructor.
*/
XCL_DRIVER_DLLESPEC
explicit
xclbin(const axlf* top);
/**
* get_kernels() - Get list of kernels from xclbin.
*
* @return
* A list of xrt::xclbin::kernel from xclbin.
*
* Kernels are extracted from embedded XML metadata in the xclbin.
* A kernel groups one or more compute units. A kernel has arguments
* from which offset, type, etc can be retrived.
*/
XCL_DRIVER_DLLESPEC
std::vector<kernel>
get_kernels() const;
/**
* get_kernel() - Get a kernel by name from xclbin
*
* @param name
* Name of kernel to get.
* @return
* The matching kernel from the xclbin or error
* if no matching kernel is found.
*
* A matching kernel is extracted from embedded XML metadata in the
* xclbin. A kernel groups one or more compute units. A kernel has
* arguments from which offset, type, etc can be retrived.
*/
XCL_DRIVER_DLLESPEC
kernel
get_kernel(const std::string& name) const;
/**
* get_ips() - Get a list of IPs from the xclbin
*
* @return
* A list of xrt::xclbin::ip objects from xclbin.
*
* The returned xrt::xclbin::ip objects are extracted from the
* IP_LAYOUT section of the xclbin.
*/
XCL_DRIVER_DLLESPEC
std::vector<ip>
get_ips() const;
/**
* get_ip() - Get a specific IP from the xclbin
*
* @return
* A list of xrt::xclbin::ip objects from xclbin.
*
* The returned xrt::xclbin::ip object is extracted from the
* IP_LAYOUT section of the xclbin.
*/
XCL_DRIVER_DLLESPEC
ip
get_ip(const std::string& name) const;
/**
* get_mems() - Get list of memory objects
*
* @return
* A list of xrt::xclbin::mem objects from xclbin
*
* The returned xrt::xclbin::mem objects are extracted from
* the xclbin.
*/
XCL_DRIVER_DLLESPEC
std::vector<mem>
get_mems() const;
/**
* get_xsa_name() - Get Xilinx Support Archive (XSA) name of xclbin
*
* @return
* Name of XSA (vbnv name).
*
* An exception is thrown if the data is missing.
*/
XCL_DRIVER_DLLESPEC
std::string
get_xsa_name() const;
/**
* get_uuid() - Get the uuid of the xclbin
*
* @return
* UUID of xclbin
*
* An exception is thrown if the data is missing.
*/
XCL_DRIVER_DLLESPEC
uuid
get_uuid() const;
/**
* get_target_type() - Get the type of this xclbin
*
* @return
* Target type, which can be hw, sw_emu, or hw_emu
*/
XCL_DRIVER_DLLESPEC
target_type
get_target_type() const;
/// @cond
/**
* get_axlf() - Get the axlf data of the xclbin
*
* @return
* The axlf data of the xclbin object
*
* An exception is thrown if the data is missing.
*/
XCL_DRIVER_DLLESPEC
const axlf*
get_axlf() const;
/**
* get_axlf_section() - Retrieve specified xclbin section
*
* @param section
* The section to retrieve
* @return
* The specified section if available cast to specified type.
* Note, that this is an unsafe cast, behavior is undefined if the
* specified SectionType is invalid.
*
* The SectionType template parameter is an axlf type from xclbin.h
* and it much match the type of the section data retrieved.
*
* Throws if requested section does not exist in the xclbin.
*/
template <typename SectionType>
SectionType
get_axlf_section(axlf_section_kind section) const
{
return reinterpret_cast<SectionType>(get_axlf_section(section).first);
}
/// @endcond
private:
XCL_DRIVER_DLLESPEC
std::pair<const char*, size_t>
get_axlf_section(axlf_section_kind section) const;
};
} // namespace xrt
/// @cond
extern "C" {
#endif
/**
* xrtXclbinAllocFilename() - Allocate a xclbin using xclbin filename
*
* @filename: path to the xclbin file
* Return: xrtXclbinHandle on success or NULL with errno set
*/
XCL_DRIVER_DLLESPEC
xrtXclbinHandle
xrtXclbinAllocFilename(const char* filename);
/**
* xrtXclbinAllocAxlf() - Allocate a xclbin using an axlf
*
* @top_axlf: an axlf
* Return: xrtXclbinHandle on success or NULL with errno set
*/
XCL_DRIVER_DLLESPEC
xrtXclbinHandle
xrtXclbinAllocAxlf(const struct axlf* top_axlf);
/**
* xrtXclbinAllocRawData() - Allocate a xclbin using raw data
*
* @data: raw data buffer of xclbin
* @size: size (in bytes) of raw data buffer of xclbin
* Return: xrtXclbinHandle on success or NULL with errno set
*/
XCL_DRIVER_DLLESPEC
xrtXclbinHandle
xrtXclbinAllocRawData(const char* data, int size);
/**
* xrtXclbinFreeHandle() - Deallocate the xclbin handle
*
* @xhdl: xclbin handle
* Return: 0 on success, -1 on error
*/
XCL_DRIVER_DLLESPEC
int
xrtXclbinFreeHandle(xrtXclbinHandle xhdl);
/**
* xrtXclbinGetXSAName() - Get Xilinx Support Archive (XSA) Name of xclbin handle
*
* @xhdl: Xclbin handle
* @name: Return name of XSA.
* If the value is nullptr, the content of this value will not be populated.
* Otherwise, the the content of this value will be populated.
* @size: size (in bytes) of @name.
* @ret_size: Return size (in bytes) of XSA name.
* If the value is nullptr, the content of this value will not be populated.
* Otherwise, the the content of this value will be populated.
* Return: 0 on success or appropriate error number
*/
XCL_DRIVER_DLLESPEC
int
xrtXclbinGetXSAName(xrtXclbinHandle xhdl, char* name, int size, int* ret_size);
/**
* xrtXclbinGetUUID() - Get UUID of xclbin handle
*
* @xhdl: Xclbin handle
* @ret_uuid: Return xclbin id in this uuid_t struct
* Return: 0 on success or appropriate error number
*/
XCL_DRIVER_DLLESPEC
int
xrtXclbinGetUUID(xrtXclbinHandle xhdl, xuid_t ret_uuid);
/**
* xrtXclbinGetNumKernels() - Get number of PL kernels in xclbin
*
* @param xhdl
* Xclbin handle obtained from an xrtXclbinAlloc function
* @return
* The number of PL kernels in the xclbin
*
* Kernels are extracted from embedded XML metadata in the xclbin.
* A kernel groups one or more compute units. A kernel has arguments
* from which offset, type, etc can be retrived.
*/
XCL_DRIVER_DLLESPEC
size_t
xrtXclbinGetNumKernels(xrtXclbinHandle xhdl);
/**
* xrtXclbinGetNumKernelComputeUnits() - Get number of CUs in xclbin
*
* @param xhdl
* Xclbin handle obtained from an xrtXclbinAlloc function
* @return
* The number of compute units
*
* Compute units are associated with kernels. This function returns
* the total number of compute units as the sum of compute units over
* all kernels.
*/
XCL_DRIVER_DLLESPEC
size_t
xrtXclbinGetNumKernelComputeUnits(xrtXclbinHandle xhdl);
/**
* xrtXclbinGetData() - Get the raw data of the xclbin handle
*
* @xhdl: Xclbin handle
* @data: Return raw data.
* If the value is nullptr, the content of this value will not be populated.
* Otherwise, the the content of this value will be populated.
* @size: Size (in bytes) of @data
* @ret_size: Return size (in bytes) of XSA name.
* If the value is nullptr, the content of this value will not be populated.
* Otherwise, the the content of this value will be populated.
* Return: 0 on success or appropriate error number
*/
XCL_DRIVER_DLLESPEC
int
xrtXclbinGetData(xrtXclbinHandle xhdl, char* data, int size, int* ret_size);
/*
* xrtGetXclbinUUID() - Get UUID of xclbin image running on device
*
* @dhdl: Device handle
* @out: Return xclbin id in this uuid_t struct
* Return: 0 on success or appropriate error number
*/
XCL_DRIVER_DLLESPEC
int
xrtXclbinUUID(xclDeviceHandle dhdl, xuid_t out);
/// @endcond
#ifdef __cplusplus
}
#endif
#endif
| 8,402 |
319 | <reponame>ajmadsen/magnum<filename>magnum/common/nova.py
# Copyright 2019 Catalyst Cloud Ltd.
#
# 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.
from oslo_config import cfg
from oslo_log import log as logging
from magnum.common import clients
from novaclient import exceptions as nova_exception
LOG = logging.getLogger(__name__)
CONF = cfg.CONF
def get_ssh_key(context, keypair_ident):
try:
n_client = clients.OpenStackClients(context).nova()
keypair = n_client.keypairs.get(keypair_ident)
# no spaces or break lines at the end, single line string
return keypair.public_key.strip()
except nova_exception.NotFound:
# we don't have a way to tell if the keypair doesn't
# exist or the cluster is already creted
return ""
| 443 |
494 | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
package org.apache.commons.math4.legacy.linear;
import java.math.BigDecimal;
import org.apache.commons.math4.legacy.TestUtils;
import org.apache.commons.math4.legacy.exception.MathIllegalArgumentException;
import org.apache.commons.math4.legacy.exception.NotStrictlyPositiveException;
import org.apache.commons.math4.legacy.exception.NullArgumentException;
import org.apache.commons.math4.legacy.exception.OutOfRangeException;
import org.apache.commons.math4.legacy.core.dfp.Dfp;
import org.junit.Assert;
import org.junit.Test;
/**
* Test cases for the {@link MatrixUtils} class.
*
*/
public final class MatrixUtilsTest {
protected double[][] testData = { {1d,2d,3d}, {2d,5d,3d}, {1d,0d,8d} };
protected double[][] testData3x3Singular = { { 1, 4, 7, }, { 2, 5, 8, }, { 3, 6, 9, } };
protected double[][] testData3x4 = { { 12, -51, 4, 1 }, { 6, 167, -68, 2 }, { -4, 24, -41, 3 } };
protected double[][] nullMatrix = null;
protected double[] row = {1,2,3};
protected BigDecimal[] bigRow =
{new BigDecimal(1),new BigDecimal(2),new BigDecimal(3)};
protected String[] stringRow = {"1", "2", "3"};
protected Dfp[] fractionRow =
{Dfp25.of(1),Dfp25.of(2),Dfp25.of(3)};
protected double[][] rowMatrix = {{1,2,3}};
protected BigDecimal[][] bigRowMatrix =
{{new BigDecimal(1), new BigDecimal(2), new BigDecimal(3)}};
protected String[][] stringRowMatrix = {{"1", "2", "3"}};
protected Dfp[][] fractionRowMatrix =
{{Dfp25.of(1), Dfp25.of(2), Dfp25.of(3)}};
protected double[] col = {0,4,6};
protected BigDecimal[] bigCol =
{new BigDecimal(0),new BigDecimal(4),new BigDecimal(6)};
protected String[] stringCol = {"0","4","6"};
protected Dfp[] fractionCol =
{Dfp25.of(0),Dfp25.of(4),Dfp25.of(6)};
protected double[] nullDoubleArray = null;
protected double[][] colMatrix = {{0},{4},{6}};
protected BigDecimal[][] bigColMatrix =
{{new BigDecimal(0)},{new BigDecimal(4)},{new BigDecimal(6)}};
protected String[][] stringColMatrix = {{"0"}, {"4"}, {"6"}};
protected Dfp[][] fractionColMatrix =
{{Dfp25.of(0)},{Dfp25.of(4)},{Dfp25.of(6)}};
@Test
public void testCreateRealMatrix() {
Assert.assertEquals(new BlockRealMatrix(testData),
MatrixUtils.createRealMatrix(testData));
try {
MatrixUtils.createRealMatrix(new double[][] {{1}, {1,2}}); // ragged
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createRealMatrix(new double[][] {{}, {}}); // no columns
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createRealMatrix(null); // null
Assert.fail("Expecting NullArgumentException");
} catch (NullArgumentException ex) {
// expected
}
}
@Test
public void testcreateFieldMatrix() {
Assert.assertEquals(new Array2DRowFieldMatrix<>(asDfp(testData)),
MatrixUtils.createFieldMatrix(asDfp(testData)));
Assert.assertEquals(new Array2DRowFieldMatrix<>(Dfp25.getField(), fractionColMatrix),
MatrixUtils.createFieldMatrix(fractionColMatrix));
try {
MatrixUtils.createFieldMatrix(asDfp(new double[][] {{1}, {1,2}})); // ragged
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createFieldMatrix(asDfp(new double[][] {{}, {}})); // no columns
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createFieldMatrix((Dfp[][])null); // null
Assert.fail("Expecting NullArgumentException");
} catch (NullArgumentException ex) {
// expected
}
}
@Test
public void testCreateRowRealMatrix() {
Assert.assertEquals(MatrixUtils.createRowRealMatrix(row),
new BlockRealMatrix(rowMatrix));
try {
MatrixUtils.createRowRealMatrix(new double[] {}); // empty
Assert.fail("Expecting NotStrictlyPositiveException");
} catch (NotStrictlyPositiveException ex) {
// expected
}
try {
MatrixUtils.createRowRealMatrix(null); // null
Assert.fail("Expecting NullArgumentException");
} catch (NullArgumentException ex) {
// expected
}
}
@Test
public void testCreateRowFieldMatrix() {
Assert.assertEquals(MatrixUtils.createRowFieldMatrix(asDfp(row)),
new Array2DRowFieldMatrix<>(asDfp(rowMatrix)));
Assert.assertEquals(MatrixUtils.createRowFieldMatrix(fractionRow),
new Array2DRowFieldMatrix<>(fractionRowMatrix));
try {
MatrixUtils.createRowFieldMatrix(new Dfp[] {}); // empty
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createRowFieldMatrix((Dfp[]) null); // null
Assert.fail("Expecting NullArgumentException");
} catch (NullArgumentException ex) {
// expected
}
}
@Test
public void testCreateColumnRealMatrix() {
Assert.assertEquals(MatrixUtils.createColumnRealMatrix(col),
new BlockRealMatrix(colMatrix));
try {
MatrixUtils.createColumnRealMatrix(new double[] {}); // empty
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createColumnRealMatrix(null); // null
Assert.fail("Expecting NullArgumentException");
} catch (NullArgumentException ex) {
// expected
}
}
@Test
public void testCreateColumnFieldMatrix() {
Assert.assertEquals(MatrixUtils.createColumnFieldMatrix(asDfp(col)),
new Array2DRowFieldMatrix<>(asDfp(colMatrix)));
Assert.assertEquals(MatrixUtils.createColumnFieldMatrix(fractionCol),
new Array2DRowFieldMatrix<>(fractionColMatrix));
try {
MatrixUtils.createColumnFieldMatrix(new Dfp[] {}); // empty
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
try {
MatrixUtils.createColumnFieldMatrix((Dfp[]) null); // null
Assert.fail("Expecting NullArgumentException");
} catch (NullArgumentException ex) {
// expected
}
}
/**
* Verifies that the matrix is an identity matrix
*/
protected void checkIdentityMatrix(RealMatrix m) {
for (int i = 0; i < m.getRowDimension(); i++) {
for (int j =0; j < m.getColumnDimension(); j++) {
if (i == j) {
Assert.assertEquals(m.getEntry(i, j), 1d, 0);
} else {
Assert.assertEquals(m.getEntry(i, j), 0d, 0);
}
}
}
}
@Test
public void testCreateIdentityMatrix() {
checkIdentityMatrix(MatrixUtils.createRealIdentityMatrix(3));
checkIdentityMatrix(MatrixUtils.createRealIdentityMatrix(2));
checkIdentityMatrix(MatrixUtils.createRealIdentityMatrix(1));
try {
MatrixUtils.createRealIdentityMatrix(0);
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
}
/**
* Verifies that the matrix is an identity matrix
*/
protected void checkIdentityFieldMatrix(FieldMatrix<Dfp> m) {
for (int i = 0; i < m.getRowDimension(); i++) {
for (int j =0; j < m.getColumnDimension(); j++) {
if (i == j) {
Assert.assertEquals(m.getEntry(i, j), Dfp25.ONE);
} else {
Assert.assertEquals(m.getEntry(i, j), Dfp25.ZERO);
}
}
}
}
@Test
public void testcreateFieldIdentityMatrix() {
checkIdentityFieldMatrix(MatrixUtils.createFieldIdentityMatrix(Dfp25.getField(), 3));
checkIdentityFieldMatrix(MatrixUtils.createFieldIdentityMatrix(Dfp25.getField(), 2));
checkIdentityFieldMatrix(MatrixUtils.createFieldIdentityMatrix(Dfp25.getField(), 1));
try {
MatrixUtils.createRealIdentityMatrix(0);
Assert.fail("Expecting MathIllegalArgumentException");
} catch (MathIllegalArgumentException ex) {
// expected
}
}
public static Dfp[][] asDfp(double[][] data) {
Dfp d[][] = new Dfp[data.length][];
for (int i = 0; i < data.length; ++i) {
double[] dataI = data[i];
Dfp[] dI = new Dfp[dataI.length];
for (int j = 0; j < dataI.length; ++j) {
dI[j] = Dfp25.of(dataI[j]);
}
d[i] = dI;
}
return d;
}
public static Dfp[] asDfp(double[] data) {
Dfp d[] = new Dfp[data.length];
for (int i = 0; i < data.length; ++i) {
d[i] = Dfp25.of(data[i]);
}
return d;
}
@Test
public void testSolveLowerTriangularSystem(){
RealMatrix rm = new Array2DRowRealMatrix(
new double[][] { {2,0,0,0 }, { 1,1,0,0 }, { 3,3,3,0 }, { 3,3,3,4 } },
false);
RealVector b = new ArrayRealVector(new double[] { 2,3,4,8 }, false);
MatrixUtils.solveLowerTriangularSystem(rm, b);
TestUtils.assertEquals( new double[]{1,2,-1.66666666666667, 1.0} , b.toArray() , 1.0e-12);
}
/*
* Taken from R manual http://stat.ethz.ch/R-manual/R-patched/library/base/html/backsolve.html
*/
@Test
public void testSolveUpperTriangularSystem(){
RealMatrix rm = new Array2DRowRealMatrix(
new double[][] { {1,2,3 }, { 0,1,1 }, { 0,0,2 } },
false);
RealVector b = new ArrayRealVector(new double[] { 8,4,2 }, false);
MatrixUtils.solveUpperTriangularSystem(rm, b);
TestUtils.assertEquals( new double[]{-1,3,1} , b.toArray() , 1.0e-12);
}
/**
* This test should probably be replaced by one that could show
* whether this algorithm can sometimes perform better (precision- or
* performance-wise) than the direct inversion of the whole matrix.
*/
@Test
public void testBlockInverse() {
final double[][] data = {
{ -1, 0, 123, 4 },
{ -56, 78.9, -0.1, -23.4 },
{ 5.67, 8, -9, 1011 },
{ 12, 345, -67.8, 9 },
};
final RealMatrix m = new Array2DRowRealMatrix(data);
final int len = data.length;
final double tol = 1e-14;
for (int splitIndex = 0; splitIndex < 3; splitIndex++) {
final RealMatrix mInv = MatrixUtils.blockInverse(m, splitIndex);
final RealMatrix id = m.multiply(mInv);
// Check that we recovered the identity matrix.
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
final double entry = id.getEntry(i, j);
if (i == j) {
Assert.assertEquals("[" + i + "][" + j + "]",
1, entry, tol);
} else {
Assert.assertEquals("[" + i + "][" + j + "]",
0, entry, tol);
}
}
}
}
}
@Test(expected=SingularMatrixException.class)
public void testBlockInverseNonInvertible() {
final double[][] data = {
{ -1, 0, 123, 4 },
{ -56, 78.9, -0.1, -23.4 },
{ 5.67, 8, -9, 1011 },
{ 5.67, 8, -9, 1011 },
};
MatrixUtils.blockInverse(new Array2DRowRealMatrix(data), 2);
}
@Test
public void testIsSymmetric() {
final double eps = Math.ulp(1d);
final double[][] dataSym = {
{ 1, 2, 3 },
{ 2, 2, 5 },
{ 3, 5, 6 },
};
Assert.assertTrue(MatrixUtils.isSymmetric(MatrixUtils.createRealMatrix(dataSym), eps));
final double[][] dataNonSym = {
{ 1, 2, -3 },
{ 2, 2, 5 },
{ 3, 5, 6 },
};
Assert.assertFalse(MatrixUtils.isSymmetric(MatrixUtils.createRealMatrix(dataNonSym), eps));
}
@Test
public void testIsSymmetricTolerance() {
final double eps = 1e-4;
final double[][] dataSym1 = {
{ 1, 1, 1.00009 },
{ 1, 1, 1 },
{ 1.0, 1, 1 },
};
Assert.assertTrue(MatrixUtils.isSymmetric(MatrixUtils.createRealMatrix(dataSym1), eps));
final double[][] dataSym2 = {
{ 1, 1, 0.99990 },
{ 1, 1, 1 },
{ 1.0, 1, 1 },
};
Assert.assertTrue(MatrixUtils.isSymmetric(MatrixUtils.createRealMatrix(dataSym2), eps));
final double[][] dataNonSym1 = {
{ 1, 1, 1.00011 },
{ 1, 1, 1 },
{ 1.0, 1, 1 },
};
Assert.assertFalse(MatrixUtils.isSymmetric(MatrixUtils.createRealMatrix(dataNonSym1), eps));
final double[][] dataNonSym2 = {
{ 1, 1, 0.99989 },
{ 1, 1, 1 },
{ 1.0, 1, 1 },
};
Assert.assertFalse(MatrixUtils.isSymmetric(MatrixUtils.createRealMatrix(dataNonSym2), eps));
}
@Test
public void testCheckSymmetric1() {
final double[][] dataSym = {
{ 1, 2, 3 },
{ 2, 2, 5 },
{ 3, 5, 6 },
};
MatrixUtils.checkSymmetric(MatrixUtils.createRealMatrix(dataSym), Math.ulp(1d));
}
@Test(expected=NonSymmetricMatrixException.class)
public void testCheckSymmetric2() {
final double[][] dataNonSym = {
{ 1, 2, -3 },
{ 2, 2, 5 },
{ 3, 5, 6 },
};
MatrixUtils.checkSymmetric(MatrixUtils.createRealMatrix(dataNonSym), Math.ulp(1d));
}
@Test(expected=SingularMatrixException.class)
public void testInverseSingular() {
RealMatrix m = MatrixUtils.createRealMatrix(testData3x3Singular);
MatrixUtils.inverse(m);
}
@Test(expected=NonSquareMatrixException.class)
public void testInverseNonSquare() {
RealMatrix m = MatrixUtils.createRealMatrix(testData3x4);
MatrixUtils.inverse(m);
}
@Test
public void testInverseDiagonalMatrix() {
final double[] data = { 1, 2, 3 };
final RealMatrix m = new DiagonalMatrix(data);
final RealMatrix inverse = MatrixUtils.inverse(m);
final RealMatrix result = m.multiply(inverse);
TestUtils.assertEquals("MatrixUtils.inverse() returns wrong result",
MatrixUtils.createRealIdentityMatrix(data.length), result, Math.ulp(1d));
}
@Test
public void testInverseRealMatrix() {
RealMatrix m = MatrixUtils.createRealMatrix(testData);
final RealMatrix inverse = MatrixUtils.inverse(m);
final RealMatrix result = m.multiply(inverse);
TestUtils.assertEquals("MatrixUtils.inverse() returns wrong result",
MatrixUtils.createRealIdentityMatrix(testData.length), result, 1e-12);
}
@Test
public void testCheckMatrixRowIndexError() {
try {
AnyMatrix m = MatrixUtils.createRealMatrix(new double[][] {{9,9}, {9,9}, {9,9}});
MatrixUtils.checkRowIndex(m, 4);
Assert.fail("expected an OutOfRangeException");
} catch (OutOfRangeException e) {
String s = e.getMessage();
int topIx = s.indexOf('2');
int botIx = s.indexOf('0');
int rowIx = s.indexOf('4');
if (topIx < 0 || botIx < 0 || rowIx < 0) {
Assert.fail("expected a message like index 4 is not in 0..3, not: " + s);
}
} catch (Exception e) {
Assert.fail("expected an OutOfRange exception, not: " +
e.getClass().getName() + ": " + e.getMessage());
}
}
@Test
public void testCheckMatrixColIndexError() {
try {
AnyMatrix m = MatrixUtils.createRealMatrix(new double[][] {{9,9}, {9,9}, {9,9}});
MatrixUtils.checkColumnIndex(m, 4);
Assert.fail("expected an OutOfRangeException");
} catch (OutOfRangeException e) {
String s = e.getMessage();
int topIx = s.indexOf('1');
int botIx = s.indexOf('0');
int rowIx = s.indexOf('4');
if (topIx < 0 || botIx < 0 || rowIx < 0) {
Assert.fail("expected a message like index 4 is not in 0..3, not: " + s);
}
} catch (Exception e) {
Assert.fail("expected an OutOfRange exception, not: " +
e.getClass().getName() + ": " + e.getMessage());
}
}
}
| 8,646 |
521 | /* $Id: getrawsock.c $ */
/** @file
* Obtain raw-sockets from a server when debugging unprivileged.
*/
/*
* Copyright (C) 2013-2017 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modify it under the terms of the GNU
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <netinet/in.h>
#include <errno.h>
#include <pwd.h>
#include <signal.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
/* XXX: this should be in a header, but isn't. naughty me. :( */
int getrawsock(int type);
int
getrawsock(int type)
{
struct sockaddr_un sux; /* because solaris */
struct passwd *pw;
size_t pathlen;
int rawsock, server;
struct msghdr mh;
struct iovec iov[1];
char buf[1];
struct cmsghdr *cmh;
char cmsg[CMSG_SPACE(sizeof(int))];
ssize_t nread, nsent;
int status;
server = -1;
rawsock = -1;
memset(&sux, 0, sizeof(sux));
sux.sun_family = AF_UNIX;
if (geteuid() == 0) {
return -1;
}
if (type == AF_INET) {
buf[0] = '4';
}
else if (type == AF_INET6) {
buf[0] = '6';
}
else {
return -1;
}
errno = 0;
pw = getpwuid(getuid());
if (pw == NULL) {
perror("getpwuid");
return -1;
}
pathlen = snprintf(sux.sun_path, sizeof(sux.sun_path),
"/tmp/.vbox-%s-aux/mkrawsock", pw->pw_name);
if (pathlen > sizeof(sux.sun_path)) {
fprintf(stderr, "socket pathname truncated\n");
return -1;
}
server = socket(PF_UNIX, SOCK_STREAM, 0);
if (server < 0) {
perror("socket");
return -1;
}
status = connect(server, (struct sockaddr *)&sux,
(sizeof(sux) - sizeof(sux.sun_path)
+ strlen(sux.sun_path) + 1));
if (status < 0) {
perror(sux.sun_path);
goto out;
}
nsent = send(server, buf, 1, 0);
if (nsent != 1) {
if (nsent < 0) {
perror("send");
}
else {
fprintf(stderr, "failed to contact mkrawsock\n");
}
goto out;
}
buf[0] = '\0';
iov[0].iov_base = buf;
iov[0].iov_len = 1;
memset(&mh, 0, sizeof(mh));
mh.msg_iov = iov;
mh.msg_iovlen = 1;
mh.msg_control = cmsg;
mh.msg_controllen = sizeof(cmsg);
nread = recvmsg(server, &mh, 0);
if (nread != 1) {
if (nread < 0) {
perror("recvmsg");
}
else {
fprintf(stderr, "EOF from mkrawsock\n");
}
goto out;
}
if ((type == AF_INET && buf[0] != '4')
|| (type == AF_INET6 && buf[0] != '6')
|| mh.msg_controllen == 0)
{
goto out;
}
for (cmh = CMSG_FIRSTHDR(&mh); cmh != NULL; cmh = CMSG_NXTHDR(&mh, cmh)) {
if ((cmh->cmsg_level == SOL_SOCKET)
&& (cmh->cmsg_type == SCM_RIGHTS)
&& (cmh->cmsg_len == CMSG_LEN(sizeof(rawsock))))
{
rawsock = *((int *)CMSG_DATA(cmh));
break;
}
}
out:
if (server != -1) {
close(server);
}
if (rawsock != -1) {
printf("%s: got ICMPv%c socket %d\n",
__func__, type == AF_INET ? '4' : '6', rawsock);
}
return rawsock;
}
| 1,845 |
930 | <reponame>ansi88/weixin4j<gh_stars>100-1000
package com.foxinmy.weixin4j.mp.test;
import java.util.List;
import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;
import com.foxinmy.weixin4j.exception.WeixinException;
import com.foxinmy.weixin4j.http.weixin.ApiResult;
import com.foxinmy.weixin4j.mp.api.TagApi;
import com.foxinmy.weixin4j.mp.model.Tag;
import com.foxinmy.weixin4j.mp.model.User;
/**
* 标签单元测试
*
* @className TagTest
* @author jinyu(<EMAIL>)
* @date 2016年5月2日
* @since JDK 1.6
* @see
*/
public class TagTest extends TokenTest {
private TagApi tagApi;
@Before
public void init() {
tagApi = new TagApi(tokenManager);
}
@Test
public void create() throws WeixinException {
Tag tag = tagApi.createTag("测试三");
Assert.assertNotNull(tag);
System.out.println(tag);
}
@Test
public void list() throws WeixinException {
List<Tag> tags = tagApi.listTags();
Assert.assertFalse(tags.isEmpty());
}
@Test
public void update() throws WeixinException {
ApiResult result = tagApi.updateTag(new Tag(120, "测试12"));
System.err.println(result);
}
@Test
public void remove() throws WeixinException {
ApiResult result = tagApi.deleteTag(134);
System.err.print(result);
}
@Test
public void batchtagging() throws WeixinException {
ApiResult result = tagApi.taggingUsers(120,
"owGBft-GyGJuKXBzpkzrfl-RG8TI", "owGBfty5TYNwh-3iUTGtxAHcD310",
"owGBftzXEfBml_bYvbrYxE5lE5U8");
System.err.println(result);
}
@Test
public void batchuntagging() throws WeixinException {
ApiResult result = tagApi.taggingUsers(120,
"owGBftwS5Yr6xKH_Hb9mGv1nbd3o");
System.err.println(result);
}
@Test
public void getidlist() throws WeixinException {
Integer[] tagIds = tagApi.getUserTags("owGBft-GyGJuKXBzpkzrfl-RG8TI");
Assert.assertNotNull(tagIds);
System.out.println(tagIds[0]);
}
@Test
public void getAllTagFollowing() throws WeixinException {
List<User> users = tagApi.getAllTagFollowing(120);
Assert.assertNotNull(users);
System.out.println(users);
}
@Test
public void getAllTagFollowingOpenIds() throws WeixinException {
List<String> tags = tagApi.getAllTagFollowingOpenIds(120);
Assert.assertNotNull(tags);
System.out.println(tags);
}
}
| 953 |
466 | #pragma once
#include <glad/glad.h>
#include <GLFW/glfw3.h>
#include <camera.h>
#include <iostream>
class Window
{
public:
//initializer
Window(int& success, unsigned int SCR_WIDTH = 1600, unsigned int SCR_HEIGHT = 900, std::string name = "TerrainEngine OpenGL");
~Window();
GLFWwindow * w;
GLFWwindow * getWindow() const { return w; }
void processInput(float frameTime); //input handler
// screen settings
static unsigned int SCR_WIDTH;
static unsigned int SCR_HEIGHT;
void terminate() {
glfwTerminate();
}
bool isWireframeActive() {
return Window::wireframe;
}
// return if the main loop must continue
bool continueLoop() {
return !glfwWindowShouldClose(this->w);
}
//put this at the end of the main
void swapBuffersAndPollEvents() {
glfwSwapBuffers(this->w);
glfwPollEvents();
}
static Camera * camera;
private:
int oldState, newState;
int gladLoader(); // set mouse input and load opengl functions
static void framebuffer_size_callback(GLFWwindow* window, int width, int height);
static void mouse_callback(GLFWwindow* window, double xpos, double ypos);
static void scroll_callback(GLFWwindow* window, double xoffset, double yoffset);
// avoid infinite key press
static bool keyBools[10];
static bool mouseCursorDisabled;
// wireframe mode
static bool wireframe;
//avoid to make the mouse to jump at the start of the program
static bool firstMouse;// = true;
static float lastX;
static float lastY;
std::string name;
};
| 491 |
1,279 | import json
def get_queue_policy(queue_url, sqs_client):
result = sqs_client.get_queue_attributes(QueueUrl=queue_url, AttributeNames=["Policy"])
policy_document = result["Attributes"]["Policy"]
policy = json.loads(policy_document)
return policy["Statement"]
def get_function_versions(function_name, lambda_client):
versions = lambda_client.list_versions_by_function(FunctionName=function_name)["Versions"]
# Exclude $LATEST from the list and simply return all the version numbers.
return [version["Version"] for version in versions if version["Version"] != "$LATEST"]
def get_policy_statements(role_name, policy_name, iam_client):
role_policy_result = iam_client.get_role_policy(RoleName=role_name, PolicyName=policy_name)
policy = role_policy_result["PolicyDocument"]
return policy["Statement"]
| 267 |
6,044 | <reponame>hantwister/CrackMapExec<gh_stars>1000+
from impacket.smb3structs import FILE_READ_DATA, FILE_WRITE_DATA
class RemoteFile:
def __init__(self, smbConnection, fileName, share='ADMIN$', access = FILE_READ_DATA | FILE_WRITE_DATA ):
self.__smbConnection = smbConnection
self.__share = share
self.__access = access
self.__fileName = fileName
self.__tid = self.__smbConnection.connectTree(share)
self.__fid = None
self.__currentOffset = 0
def open(self):
self.__fid = self.__smbConnection.openFile(self.__tid, self.__fileName, desiredAccess= self.__access)
def seek(self, offset, whence):
# Implement whence, for now it's always from the beginning of the file
if whence == 0:
self.__currentOffset = offset
def read(self, bytesToRead):
if bytesToRead > 0:
data = self.__smbConnection.readFile(self.__tid, self.__fid, self.__currentOffset, bytesToRead)
self.__currentOffset += len(data)
return data
return ''
def close(self):
if self.__fid is not None:
self.__smbConnection.closeFile(self.__tid, self.__fid)
self.__fid = None
def delete(self):
self.__smbConnection.deleteFile(self.__share, self.__fileName)
def tell(self):
return self.__currentOffset
def __str__(self):
return "\\\\{}\\{}\\{}".format(self.__smbConnection.getRemoteHost(), self.__share, self.__fileName) | 645 |
12,718 | #include "stdio_impl.h"
#include <stdio_ext.h>
size_t __freadahead(FILE *f)
{
return f->rend ? f->rend - f->rpos : 0;
}
const char *__freadptr(FILE *f, size_t *sizep)
{
if (f->rpos == f->rend) return 0;
*sizep = f->rend - f->rpos;
return (const char *)f->rpos;
}
void __freadptrinc(FILE *f, size_t inc)
{
f->rpos += inc;
}
void __fseterr(FILE *f)
{
f->flags |= F_ERR;
}
| 187 |
448 | <filename>src/server/src/main/java/io/cassandrareaper/storage/cassandra/MultiIpPerNodeAddressTranslator.java<gh_stars>100-1000
/*
* Copyright 2019-2019 The Last Pickle Ltd
*
*
* 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.
*/
package io.cassandrareaper.storage.cassandra;
import java.net.InetSocketAddress;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import com.datastax.driver.core.Cluster;
import com.datastax.driver.core.policies.AddressTranslator;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
/**
* Maps broadcast addresses (as advertised by the cassandra cluster) to effective addresses using a hard-coded mapping
*/
public final class MultiIpPerNodeAddressTranslator implements AddressTranslator {
private static final Logger LOGGER = LoggerFactory.getLogger(MultiIpPerNodeAddressTranslator.class);
private Map<String, String> addressTranslation = new HashMap<>();
public MultiIpPerNodeAddressTranslator(
final List<MultiIpPerNodeAddressTranslatorFactory.AddressTranslation> translations) {
if (!translations.isEmpty()) {
addressTranslation = new HashMap<>(translations.size());
translations.forEach(i -> addressTranslation.put(i.getFrom(), i.getTo()));
if (translations.size() != addressTranslation.size()) {
throw new IllegalArgumentException("Invalid mapping specified - some mappings are defined multiple times");
}
LOGGER.info("Initialised cassandra address translator {}", addressTranslation);
}
}
@Override
public void init(Cluster cluster) {
// nothing to do
}
@Override
public InetSocketAddress translate(final InetSocketAddress broadcastAddress) {
final String from = broadcastAddress.getAddress().getHostAddress();
final String to = addressTranslation.get(from);
if (to != null) {
final InetSocketAddress result = new InetSocketAddress(to, broadcastAddress.getPort());
LOGGER.debug("Performed cassandra address translation from {} to {}", from, result);
return result;
} else {
return broadcastAddress;
}
}
@Override
public void close() {
//do nothing
}
}
| 796 |
1,831 | <filename>logdevice/common/ThriftCommonStructConverter.h<gh_stars>1000+
/**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#pragma once
#include "logdevice/common/configuration/Node.h"
#include "logdevice/common/configuration/nodes/NodeRole.h"
#include "logdevice/common/if/gen-cpp2/common_types.h"
#include "logdevice/include/NodeLocationScope.h"
namespace facebook { namespace logdevice {
// Templated thrift <-> LogDevice type converter. This interface can be used if
// there is 1:1 mapping between the types.
template <typename ThriftType, typename LDType>
ThriftType toThrift(const LDType& input);
template <>
thrift::LocationScope toThrift(const NodeLocationScope& input);
template <>
thrift::Role toThrift(const configuration::NodeRole& role);
template <>
thrift::ShardID toThrift(const ShardID& shard);
template <>
thrift::Location toThrift(const folly::Optional<NodeLocation>& input);
template <>
thrift::ReplicationProperty toThrift(const ReplicationProperty& replication);
template <typename LDType, typename ThriftType>
LDType toLogDevice(const ThriftType& input);
template <>
NodeLocationScope toLogDevice(const thrift::LocationScope& input);
template <>
ReplicationProperty toLogDevice(const thrift::ReplicationProperty& input);
template <>
configuration::nodes::NodeRole toLogDevice(const thrift::Role& role);
// If we can convert Type A => B then we should be able to convert
// std::vector<A> to std::vector<B>
template <typename ThriftType, typename LDType>
std::vector<ThriftType> toThrift(const std::vector<LDType>& input) {
std::vector<ThriftType> output;
for (const auto& it : input) {
output.push_back(toThrift<ThriftType>(it));
}
return output;
}
}} // namespace facebook::logdevice
| 589 |
2,151 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "brl_checks.h"
int
main(int argc, char **argv)
{
int result = 0;
const char* txt = "Fussball-Vereinigung";
const char* table = "inpos_match_replace.ctb";
const char* brl = "FUSSBALL-V7EINIGUNG";
const int inpos[] = {0,1,2,3,4,5,6,7,8,9,9,12,13,14,15,16,17,18,19};
result |= check_translation(table, txt, NULL, brl);
result |= check_inpos(table, txt, inpos);
return result;
}
| 212 |
879 | package com.bookstore.dto;
public record AuthorDto(String name, int age) {}
| 25 |
575 | <reponame>jason-fox/Fast-RTPS
// Copyright 2020 Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// 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 _FASTDDS_DDS_LOG_STDOUTERRCONSUMER_HPP_
#define _FASTDDS_DDS_LOG_STDOUTERRCONSUMER_HPP_
#include <gmock/gmock.h>
#include <fastdds/dds/log/Log.hpp>
#include <fastdds/dds/log/OStreamConsumer.hpp>
namespace eprosima {
namespace fastdds {
namespace dds {
class StdoutErrConsumer : public OStreamConsumer
{
public:
StdoutErrConsumer() = default;
virtual ~StdoutErrConsumer() = default;
void stderr_threshold(
const Log::Kind& kind)
{
(void)kind;
}
static const Log::Kind STDERR_THRESHOLD_DEFAULT = Log::Kind::Warning;
};
MATCHER(IsStdoutErrConsumer, "Argument is a StdoutErrConsumer object?")
{
*result_listener << (typeid(*arg.get()) == typeid(StdoutErrConsumer));
return typeid(*arg.get()) == typeid(StdoutErrConsumer);
}
} // namespace dds
} // namespace fastdds
} // namespace eprosima
#endif // _FASTDDS_DDS_LOG_STDOUTERRCONSUMER_HPP_
| 567 |
5,169 | {
"name": "C0T0",
"version": "0.2.1",
"summary": "HTTP networking library.",
"description": "HTTP networking library written in Swift.",
"homepage": "https://github.com/tooploox/C0T0",
"license": "MIT",
"authors": {
"TPLX iOS team": "<EMAIL>"
},
"platforms": {
"ios": "10.0"
},
"source": {
"git": "https://github.com/tooploox/C0T0.git",
"tag": "v0.2.1"
},
"source_files": "C0T0/**/*.swift",
"swift_version": "4.1"
}
| 208 |
922 | <filename>reports/graphs/__init__.py<gh_stars>100-1000
from .bmi_change import bmi_change # NOQA
from .diaperchange_amounts import diaperchange_amounts # NOQA
from .diaperchange_lifetimes import diaperchange_lifetimes # NOQA
from .diaperchange_types import diaperchange_types # NOQA
from .feeding_amounts import feeding_amounts # NOQA
from .feeding_duration import feeding_duration # NOQA
from .head_circumference_change import head_circumference_change # NOQA
from .height_change import height_change # NOQA
from .pumping_amounts import pumping_amounts # NOQA
from .sleep_pattern import sleep_pattern # NOQA
from .sleep_totals import sleep_totals # NOQA
from .tummytime_duration import tummytime_duration # NOQA
from .weight_change import weight_change # NOQA
| 253 |
655 | <reponame>lookingatstarts/bulbasaur<gh_stars>100-1000
package com.tmall.pokemon.bulbasaur.persist.domain;
import java.util.ArrayList;
import java.util.Date;
import java.util.List;
public class ParticipationDOExample {
protected String orderByClause;
protected boolean distinct;
protected List<Criteria> oredCriteria;
private Integer limit;
private Integer offset;
public ParticipationDOExample() {
oredCriteria = new ArrayList<Criteria>();
}
public void setOrderByClause(String orderByClause) {
this.orderByClause = orderByClause;
}
public String getOrderByClause() {
return orderByClause;
}
public void setDistinct(boolean distinct) {
this.distinct = distinct;
}
public boolean isDistinct() {
return distinct;
}
public List<Criteria> getOredCriteria() {
return oredCriteria;
}
public void or(Criteria criteria) {
oredCriteria.add(criteria);
}
public Criteria or() {
Criteria criteria = createCriteriaInternal();
oredCriteria.add(criteria);
return criteria;
}
public Criteria createCriteria() {
Criteria criteria = createCriteriaInternal();
if (oredCriteria.size() == 0) {
oredCriteria.add(criteria);
}
return criteria;
}
protected Criteria createCriteriaInternal() {
Criteria criteria = new Criteria();
return criteria;
}
public void clear() {
oredCriteria.clear();
orderByClause = null;
distinct = false;
}
public void setLimit(Integer limit) {
this.limit = limit;
}
public Integer getLimit() {
return limit;
}
public void setOffset(Integer offset) {
this.offset = offset;
}
public Integer getOffset() {
return offset;
}
protected abstract static class GeneratedCriteria {
protected List<Criterion> criteria;
protected GeneratedCriteria() {
super();
criteria = new ArrayList<Criterion>();
}
public boolean isValid() {
return criteria.size() > 0;
}
public List<Criterion> getAllCriteria() {
return criteria;
}
public List<Criterion> getCriteria() {
return criteria;
}
protected void addCriterion(String condition) {
if (condition == null) {
throw new RuntimeException("Value for condition cannot be null");
}
criteria.add(new Criterion(condition));
}
protected void addCriterion(String condition, Object value, String property) {
if (value == null) {
throw new RuntimeException("Value for " + property + " cannot be null");
}
criteria.add(new Criterion(condition, value));
}
protected void addCriterion(String condition, Object value1, Object value2, String property) {
if (value1 == null || value2 == null) {
throw new RuntimeException("Between values for " + property + " cannot be null");
}
criteria.add(new Criterion(condition, value1, value2));
}
public Criteria andIdIsNull() {
addCriterion("id is null");
return (Criteria) this;
}
public Criteria andIdIsNotNull() {
addCriterion("id is not null");
return (Criteria) this;
}
public Criteria andIdEqualTo(Long value) {
addCriterion("id =", value, "id");
return (Criteria) this;
}
public Criteria andIdNotEqualTo(Long value) {
addCriterion("id <>", value, "id");
return (Criteria) this;
}
public Criteria andIdGreaterThan(Long value) {
addCriterion("id >", value, "id");
return (Criteria) this;
}
public Criteria andIdGreaterThanOrEqualTo(Long value) {
addCriterion("id >=", value, "id");
return (Criteria) this;
}
public Criteria andIdLessThan(Long value) {
addCriterion("id <", value, "id");
return (Criteria) this;
}
public Criteria andIdLessThanOrEqualTo(Long value) {
addCriterion("id <=", value, "id");
return (Criteria) this;
}
public Criteria andIdIn(List<Long> values) {
addCriterion("id in", values, "id");
return (Criteria) this;
}
public Criteria andIdNotIn(List<Long> values) {
addCriterion("id not in", values, "id");
return (Criteria) this;
}
public Criteria andIdBetween(Long value1, Long value2) {
addCriterion("id between", value1, value2, "id");
return (Criteria) this;
}
public Criteria andIdNotBetween(Long value1, Long value2) {
addCriterion("id not between", value1, value2, "id");
return (Criteria) this;
}
public Criteria andGmtCreateIsNull() {
addCriterion("gmt_create is null");
return (Criteria) this;
}
public Criteria andGmtCreateIsNotNull() {
addCriterion("gmt_create is not null");
return (Criteria) this;
}
public Criteria andGmtCreateEqualTo(Date value) {
addCriterion("gmt_create =", value, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateNotEqualTo(Date value) {
addCriterion("gmt_create <>", value, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateGreaterThan(Date value) {
addCriterion("gmt_create >", value, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateGreaterThanOrEqualTo(Date value) {
addCriterion("gmt_create >=", value, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateLessThan(Date value) {
addCriterion("gmt_create <", value, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateLessThanOrEqualTo(Date value) {
addCriterion("gmt_create <=", value, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateIn(List<Date> values) {
addCriterion("gmt_create in", values, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateNotIn(List<Date> values) {
addCriterion("gmt_create not in", values, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateBetween(Date value1, Date value2) {
addCriterion("gmt_create between", value1, value2, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtCreateNotBetween(Date value1, Date value2) {
addCriterion("gmt_create not between", value1, value2, "gmtCreate");
return (Criteria) this;
}
public Criteria andGmtModifiedIsNull() {
addCriterion("gmt_modified is null");
return (Criteria) this;
}
public Criteria andGmtModifiedIsNotNull() {
addCriterion("gmt_modified is not null");
return (Criteria) this;
}
public Criteria andGmtModifiedEqualTo(Date value) {
addCriterion("gmt_modified =", value, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedNotEqualTo(Date value) {
addCriterion("gmt_modified <>", value, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedGreaterThan(Date value) {
addCriterion("gmt_modified >", value, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedGreaterThanOrEqualTo(Date value) {
addCriterion("gmt_modified >=", value, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedLessThan(Date value) {
addCriterion("gmt_modified <", value, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedLessThanOrEqualTo(Date value) {
addCriterion("gmt_modified <=", value, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedIn(List<Date> values) {
addCriterion("gmt_modified in", values, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedNotIn(List<Date> values) {
addCriterion("gmt_modified not in", values, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedBetween(Date value1, Date value2) {
addCriterion("gmt_modified between", value1, value2, "gmtModified");
return (Criteria) this;
}
public Criteria andGmtModifiedNotBetween(Date value1, Date value2) {
addCriterion("gmt_modified not between", value1, value2, "gmtModified");
return (Criteria) this;
}
public Criteria andUserIdIsNull() {
addCriterion("user_id is null");
return (Criteria) this;
}
public Criteria andUserIdIsNotNull() {
addCriterion("user_id is not null");
return (Criteria) this;
}
public Criteria andUserIdEqualTo(Long value) {
addCriterion("user_id =", value, "userId");
return (Criteria) this;
}
public Criteria andUserIdNotEqualTo(Long value) {
addCriterion("user_id <>", value, "userId");
return (Criteria) this;
}
public Criteria andUserIdGreaterThan(Long value) {
addCriterion("user_id >", value, "userId");
return (Criteria) this;
}
public Criteria andUserIdGreaterThanOrEqualTo(Long value) {
addCriterion("user_id >=", value, "userId");
return (Criteria) this;
}
public Criteria andUserIdLessThan(Long value) {
addCriterion("user_id <", value, "userId");
return (Criteria) this;
}
public Criteria andUserIdLessThanOrEqualTo(Long value) {
addCriterion("user_id <=", value, "userId");
return (Criteria) this;
}
public Criteria andUserIdIn(List<Long> values) {
addCriterion("user_id in", values, "userId");
return (Criteria) this;
}
public Criteria andUserIdNotIn(List<Long> values) {
addCriterion("user_id not in", values, "userId");
return (Criteria) this;
}
public Criteria andUserIdBetween(Long value1, Long value2) {
addCriterion("user_id between", value1, value2, "userId");
return (Criteria) this;
}
public Criteria andUserIdNotBetween(Long value1, Long value2) {
addCriterion("user_id not between", value1, value2, "userId");
return (Criteria) this;
}
public Criteria andUserNameIsNull() {
addCriterion("user_name is null");
return (Criteria) this;
}
public Criteria andUserNameIsNotNull() {
addCriterion("user_name is not null");
return (Criteria) this;
}
public Criteria andUserNameEqualTo(String value) {
addCriterion("user_name =", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameNotEqualTo(String value) {
addCriterion("user_name <>", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameGreaterThan(String value) {
addCriterion("user_name >", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameGreaterThanOrEqualTo(String value) {
addCriterion("user_name >=", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameLessThan(String value) {
addCriterion("user_name <", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameLessThanOrEqualTo(String value) {
addCriterion("user_name <=", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameLike(String value) {
addCriterion("user_name like", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameNotLike(String value) {
addCriterion("user_name not like", value, "userName");
return (Criteria) this;
}
public Criteria andUserNameIn(List<String> values) {
addCriterion("user_name in", values, "userName");
return (Criteria) this;
}
public Criteria andUserNameNotIn(List<String> values) {
addCriterion("user_name not in", values, "userName");
return (Criteria) this;
}
public Criteria andUserNameBetween(String value1, String value2) {
addCriterion("user_name between", value1, value2, "userName");
return (Criteria) this;
}
public Criteria andUserNameNotBetween(String value1, String value2) {
addCriterion("user_name not between", value1, value2, "userName");
return (Criteria) this;
}
public Criteria andTypeIsNull() {
addCriterion("type is null");
return (Criteria) this;
}
public Criteria andTypeIsNotNull() {
addCriterion("type is not null");
return (Criteria) this;
}
public Criteria andTypeEqualTo(String value) {
addCriterion("type =", value, "type");
return (Criteria) this;
}
public Criteria andTypeNotEqualTo(String value) {
addCriterion("type <>", value, "type");
return (Criteria) this;
}
public Criteria andTypeGreaterThan(String value) {
addCriterion("type >", value, "type");
return (Criteria) this;
}
public Criteria andTypeGreaterThanOrEqualTo(String value) {
addCriterion("type >=", value, "type");
return (Criteria) this;
}
public Criteria andTypeLessThan(String value) {
addCriterion("type <", value, "type");
return (Criteria) this;
}
public Criteria andTypeLessThanOrEqualTo(String value) {
addCriterion("type <=", value, "type");
return (Criteria) this;
}
public Criteria andTypeLike(String value) {
addCriterion("type like", value, "type");
return (Criteria) this;
}
public Criteria andTypeNotLike(String value) {
addCriterion("type not like", value, "type");
return (Criteria) this;
}
public Criteria andTypeIn(List<String> values) {
addCriterion("type in", values, "type");
return (Criteria) this;
}
public Criteria andTypeNotIn(List<String> values) {
addCriterion("type not in", values, "type");
return (Criteria) this;
}
public Criteria andTypeBetween(String value1, String value2) {
addCriterion("type between", value1, value2, "type");
return (Criteria) this;
}
public Criteria andTypeNotBetween(String value1, String value2) {
addCriterion("type not between", value1, value2, "type");
return (Criteria) this;
}
public Criteria andTaskIdIsNull() {
addCriterion("task_id is null");
return (Criteria) this;
}
public Criteria andTaskIdIsNotNull() {
addCriterion("task_id is not null");
return (Criteria) this;
}
public Criteria andTaskIdEqualTo(Long value) {
addCriterion("task_id =", value, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdNotEqualTo(Long value) {
addCriterion("task_id <>", value, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdGreaterThan(Long value) {
addCriterion("task_id >", value, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdGreaterThanOrEqualTo(Long value) {
addCriterion("task_id >=", value, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdLessThan(Long value) {
addCriterion("task_id <", value, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdLessThanOrEqualTo(Long value) {
addCriterion("task_id <=", value, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdIn(List<Long> values) {
addCriterion("task_id in", values, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdNotIn(List<Long> values) {
addCriterion("task_id not in", values, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdBetween(Long value1, Long value2) {
addCriterion("task_id between", value1, value2, "taskId");
return (Criteria) this;
}
public Criteria andTaskIdNotBetween(Long value1, Long value2) {
addCriterion("task_id not between", value1, value2, "taskId");
return (Criteria) this;
}
public Criteria andStatusIsNull() {
addCriterion("status is null");
return (Criteria) this;
}
public Criteria andStatusIsNotNull() {
addCriterion("status is not null");
return (Criteria) this;
}
public Criteria andStatusEqualTo(Boolean value) {
addCriterion("status =", value, "status");
return (Criteria) this;
}
public Criteria andStatusNotEqualTo(Boolean value) {
addCriterion("status <>", value, "status");
return (Criteria) this;
}
public Criteria andStatusGreaterThan(Boolean value) {
addCriterion("status >", value, "status");
return (Criteria) this;
}
public Criteria andStatusGreaterThanOrEqualTo(Boolean value) {
addCriterion("status >=", value, "status");
return (Criteria) this;
}
public Criteria andStatusLessThan(Boolean value) {
addCriterion("status <", value, "status");
return (Criteria) this;
}
public Criteria andStatusLessThanOrEqualTo(Boolean value) {
addCriterion("status <=", value, "status");
return (Criteria) this;
}
public Criteria andStatusIn(List<Boolean> values) {
addCriterion("status in", values, "status");
return (Criteria) this;
}
public Criteria andStatusNotIn(List<Boolean> values) {
addCriterion("status not in", values, "status");
return (Criteria) this;
}
public Criteria andStatusBetween(Boolean value1, Boolean value2) {
addCriterion("status between", value1, value2, "status");
return (Criteria) this;
}
public Criteria andStatusNotBetween(Boolean value1, Boolean value2) {
addCriterion("status not between", value1, value2, "status");
return (Criteria) this;
}
public Criteria andDefinitionNameIsNull() {
addCriterion("definition_name is null");
return (Criteria) this;
}
public Criteria andDefinitionNameIsNotNull() {
addCriterion("definition_name is not null");
return (Criteria) this;
}
public Criteria andDefinitionNameEqualTo(String value) {
addCriterion("definition_name =", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameNotEqualTo(String value) {
addCriterion("definition_name <>", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameGreaterThan(String value) {
addCriterion("definition_name >", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameGreaterThanOrEqualTo(String value) {
addCriterion("definition_name >=", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameLessThan(String value) {
addCriterion("definition_name <", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameLessThanOrEqualTo(String value) {
addCriterion("definition_name <=", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameLike(String value) {
addCriterion("definition_name like", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameNotLike(String value) {
addCriterion("definition_name not like", value, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameIn(List<String> values) {
addCriterion("definition_name in", values, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameNotIn(List<String> values) {
addCriterion("definition_name not in", values, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameBetween(String value1, String value2) {
addCriterion("definition_name between", value1, value2, "definitionName");
return (Criteria) this;
}
public Criteria andDefinitionNameNotBetween(String value1, String value2) {
addCriterion("definition_name not between", value1, value2, "definitionName");
return (Criteria) this;
}
}
public static class Criteria extends GeneratedCriteria {
protected Criteria() {
super();
}
}
public static class Criterion {
private String condition;
private Object value;
private Object secondValue;
private boolean noValue;
private boolean singleValue;
private boolean betweenValue;
private boolean listValue;
private String typeHandler;
public String getCondition() {
return condition;
}
public Object getValue() {
return value;
}
public Object getSecondValue() {
return secondValue;
}
public boolean isNoValue() {
return noValue;
}
public boolean isSingleValue() {
return singleValue;
}
public boolean isBetweenValue() {
return betweenValue;
}
public boolean isListValue() {
return listValue;
}
public String getTypeHandler() {
return typeHandler;
}
protected Criterion(String condition) {
super();
this.condition = condition;
this.typeHandler = null;
this.noValue = true;
}
protected Criterion(String condition, Object value, String typeHandler) {
super();
this.condition = condition;
this.value = value;
this.typeHandler = typeHandler;
if (value instanceof List<?>) {
this.listValue = true;
} else {
this.singleValue = true;
}
}
protected Criterion(String condition, Object value) {
this(condition, value, null);
}
protected Criterion(String condition, Object value, Object secondValue, String typeHandler) {
super();
this.condition = condition;
this.value = value;
this.secondValue = secondValue;
this.typeHandler = typeHandler;
this.betweenValue = true;
}
protected Criterion(String condition, Object value, Object secondValue) {
this(condition, value, secondValue, null);
}
}
} | 11,236 |
632 | /************************************************************************
Modifications Copyright 2017-2019 eBay Inc.
Author/Developer(s): <NAME>
Original Copyright:
See URL: https://github.com/datatechnology/cornerstone
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
https://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 _STRING_FORMATTER_HXX_
#define _STRING_FORMATTER_HXX_
namespace nuraft {
template<int N>
class strfmt {
public:
strfmt(const char* fmt)
: fmt_(fmt) {
}
template<typename ... TArgs>
const char* fmt(TArgs... args) {
::snprintf(buf_, N, fmt_, args...);
return buf_;
}
__nocopy__(strfmt);
private:
char buf_[N];
const char* fmt_;
};
typedef strfmt<100> sstrfmt;
typedef strfmt<200> lstrfmt;
}
#endif //_STRING_FORMATTER_HXX_
| 429 |
2,542 | <gh_stars>1000+
// ------------------------------------------------------------
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License (MIT). See License.txt in the repo root for license information.
// ------------------------------------------------------------
#include "Common.Stdafx.h"
using namespace Common;
using namespace Reliability;
Reliability::PlbMovementIgnoredReasons::PlbMovementIgnoredReasons() : reason_(Invalid)
{
}
Reliability::PlbMovementIgnoredReasons::PlbMovementIgnoredReasons(Enum reason) : reason_(reason)
{
}
Reliability::PlbMovementIgnoredReasons::PlbMovementIgnoredReasons(const PlbMovementIgnoredReasons & other) : reason_(other.Reason)
{
}
Reliability::PlbMovementIgnoredReasons & Reliability::PlbMovementIgnoredReasons::operator=(PlbMovementIgnoredReasons const & other)
{
reason_ = other.Reason;
return *this;
}
std::wstring Reliability::PlbMovementIgnoredReasons::ToString(Enum const & val) const
{
switch (val)
{
case Invalid:
return L"None";
case ClusterPaused:
return L"Cluster paused";
case DropAllPLBMovementsConfigTrue:
return L"DropAllPLBMovements configuration set to True";
case FailoverUnitNotFound:
return L"FailoverUnit not found";
case FailoverUnitIsToBeDeleted:
return L"FailoverUnit to be deleted";
case VersionMismatch:
return L"Version mismatch";
case FailoverUnitIsChanging:
return L"FailoverUnit is changing";
case NodePendingClose:
return L"Node pending close";
case NodeIsUploadingReplicas:
return L"Node is uploading replicas";
case ReplicaNotDeleted:
return L"Replica not deleted";
case NodePendingDeactivate:
return L"Node pending deactivate";
case InvalidReplicaState:
return L"Invalid replica state";
case CurrentConfigurationEmpty:
return L"Current configuration is empty";
case ReplicaConfigurationChanging:
return L"Replica configuration is changing";
case ToBePromotedReplicaAlreadyExists:
return L"To be promoted replica already exists";
case ReplicaToBeDropped:
return L"Replica to be dropped";
case ReplicaNotFound:
return L"Replica not found";
case PrimaryNotFound:
return L"Primary not found";
default:
return L"PlbMovementIgnoredReasons(" + static_cast<uint>(val) + ')';
}
}
std::string Reliability::PlbMovementIgnoredReasons::AddField(Common::TraceEvent & traceEvent, std::string const & name)
{
return traceEvent.AddMapField(name, "PlbMovementIgnoredReasons");
}
void Reliability::PlbMovementIgnoredReasons::FillEventData(Common::TraceEventContext & context) const
{
context.WriteCopy<uint>(static_cast<uint>(reason_));
}
void Reliability::PlbMovementIgnoredReasons::WriteTo(Common::TextWriter & w, Common::FormatOptions const &) const
{
w << ToString(this->reason_);
}
Common::Global<PlbMovementIgnoredReasons::Initializer> PlbMovementIgnoredReasons::GlobalInitializer = Common::make_global<PlbMovementIgnoredReasons::Initializer>();
PlbMovementIgnoredReasons::Initializer::Initializer()
{
for (int i = PlbMovementIgnoredReasons::Invalid; i != PlbMovementIgnoredReasons::LastValidEnum; i++)
{
PlbMovementIgnoredReasons e = static_cast<PlbMovementIgnoredReasons::Enum>(i);
std::string tmp;
Common::StringWriterA(tmp).Write("{0}", e);
Common::TraceProvider::StaticInit_Singleton()->AddMapValue("PlbMovementIgnoredReasons", i, tmp);
}
}
| 1,232 |
1,133 | <filename>components/isceobj/IsceProc/runUnwrapSnaphu.py
#~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Copyright 2014 California Institute of Technology. ALL RIGHTS RESERVED.
#
# 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.
#
# United States Government Sponsorship acknowledged. This software is subject to
# U.S. export control laws and regulations and has been classified as 'EAR99 NLR'
# (No [Export] License Required except when exporting to an embargoed country,
# end user, or in support of a prohibited end use). By downloading this software,
# the user agrees to comply with all applicable U.S. export laws and regulations.
# The user has the responsibility to obtain export licenses, or other export
# authority as may be required before exporting this software to any 'EAR99'
# embargoed foreign country or citizen of those countries.
#
# Authors: <NAME>, <NAME>
#~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Comment: Adapted from InsarProc/runUnwrappSnaphu.py
# giangi: taken Piyush code for snaphu and adapted
import logging
import isceobj
from contrib.Snaphu.Snaphu import Snaphu
from isceobj.Constants import SPEED_OF_LIGHT
import os
logger = logging.getLogger('isce.isceProc.runUnwrap')
def runUnwrap(self, costMode='DEFO', initMethod='MST', defomax=4.0, initOnly=False):
infos = {}
for attribute in ['topophaseFlatFilename', 'unwrappedIntFilename', 'coherenceFilename', 'averageHeight', 'topo', 'peg']:
infos[attribute] = getattr(self._isce, attribute)
for sceneid1, sceneid2 in self._isce.selectedPairs:
pair = (sceneid1, sceneid2)
for pol in self._isce.selectedPols:
frame1 = self._isce.frames[sceneid1][pol]
intImage = self._isce.resampIntImages[pair][pol]
width = intImage.width
sid = self._isce.formatname(pair, pol)
infos['outputPath'] = os.path.join(self.getoutputdir(sceneid1, sceneid2), sid)
run(frame1, width, costMode, initMethod, defomax, initOnly, infos, sceneid=sid)
def run(frame1, width, costMode, initMethod, defomax, initOnly, infos, sceneid='NO_ID'):
logger.info("Unwrapping interferogram using Snaphu %s: %s" % (initMethod, sceneid))
topo = infos['topo']
wrapName = infos['outputPath'] + '.' + infos['topophaseFlatFilename']
unwrapName = infos['outputPath'] + '.' + infos['unwrappedIntFilename']
corrfile = infos['outputPath'] + '.' + infos['coherenceFilename']
altitude = infos['averageHeight']
wavelength = frame1.getInstrument().getRadarWavelength()
earthRadius = infos['peg'].radiusOfCurvature
rangeLooks = topo.numberRangeLooks
azimuthLooks = topo.numberAzimuthLooks
azres = frame1.platform.antennaLength/2.0
azfact = topo.numberAzimuthLooks *azres / topo.azimuthSpacing
rBW = frame1.instrument.pulseLength * frame1.instrument.chirpSlope
rgres = abs(SPEED_OF_LIGHT / (2.0 * rBW))
rngfact = rgres/topo.slantRangePixelSpacing
corrLooks = topo.numberRangeLooks * topo.numberAzimuthLooks/(azfact*rngfact)
maxComponents = 20
snp = Snaphu()
snp.setInitOnly(initOnly)
snp.setInput(wrapName)
snp.setOutput(unwrapName)
snp.setWidth(width)
snp.setCostMode(costMode)
snp.setEarthRadius(earthRadius)
snp.setWavelength(wavelength)
snp.setAltitude(altitude)
snp.setCorrfile(corrfile)
snp.setInitMethod(initMethod)
snp.setCorrLooks(corrLooks)
snp.setMaxComponents(maxComponents)
snp.setDefoMaxCycles(defomax)
snp.setRangeLooks(rangeLooks)
snp.setAzimuthLooks(azimuthLooks)
snp.prepare()
snp.unwrap()
######Render XML
outImage = isceobj.Image.createUnwImage()
outImage.setFilename(unwrapName)
outImage.setWidth(width)
outImage.setAccessMode('read')
outImage.imageType = 'unw'
outImage.bands = 2
outImage.scheme = 'BIL'
outImage.dataType = 'FLOAT'
outImage.finalizeImage()
outImage.renderHdr()
#####Check if connected components was created
if snp.dumpConnectedComponents:
connImage = isceobj.Image.createImage()
connImage.setFilename(unwrapName+'.conncomp')
connImage.setWidth(width)
connImage.setAccessMode('read')
connImage.setDataType('BYTE')
connImage.finalizeImage()
connImage.renderHdr()
def runUnwrapMcf(self):
runUnwrap(self, costMode='SMOOTH', initMethod='MCF', defomax=2, initOnly=True)
| 1,792 |
623 | <filename>java/com/google/gerrit/acceptance/testsuite/change/FileContentBuilder.java
// Copyright (C) 2020 The Android Open Source Project
//
// 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.
package com.google.gerrit.acceptance.testsuite.change;
import static com.google.common.base.Preconditions.checkNotNull;
import com.google.common.base.Strings;
import com.google.gerrit.common.RawInputUtil;
import com.google.gerrit.server.edit.tree.ChangeFileContentModification;
import com.google.gerrit.server.edit.tree.DeleteFileModification;
import com.google.gerrit.server.edit.tree.RenameFileModification;
import com.google.gerrit.server.edit.tree.TreeModification;
import java.util.function.Consumer;
/** Builder to simplify file content specification. */
public class FileContentBuilder<T> {
private final T builder;
private final String filePath;
private final Consumer<TreeModification> modificationToBuilderAdder;
FileContentBuilder(
T builder, String filePath, Consumer<TreeModification> modificationToBuilderAdder) {
checkNotNull(Strings.emptyToNull(filePath), "File path must not be null or empty.");
this.builder = builder;
this.filePath = filePath;
this.modificationToBuilderAdder = modificationToBuilderAdder;
}
/** Content of the file. Must not be empty. */
public T content(String content) {
checkNotNull(
Strings.emptyToNull(content),
"Empty file content is not supported. Adjust test API if necessary.");
modificationToBuilderAdder.accept(
new ChangeFileContentModification(filePath, RawInputUtil.create(content)));
return builder;
}
/** Deletes the file. */
public T delete() {
modificationToBuilderAdder.accept(new DeleteFileModification(filePath));
return builder;
}
/**
* Renames the file while keeping its content.
*
* <p>If you want to both rename the file and adjust its content, delete the old path via {@link
* #delete()} and provide the desired content for the new path via {@link #content(String)}. If
* you use that approach, make sure to use a new content which is similar enough to the old (at
* least 60% line similarity) as otherwise Gerrit/Git won't identify it as a rename.
*
* <p>To create copied files, you need to go even one step further. Also rename the file you copy
* at the same time (-> delete old path + add two paths with the old content)! If you also want to
* adjust the content of the copy, you need to also slightly modify the content of the renamed
* file. Adjust the content of the copy slightly more if you want to control which file ends up as
* copy and which as rename (but keep the 60% line similarity threshold in mind).
*
* @param newFilePath new path of the file
*/
public T renameTo(String newFilePath) {
modificationToBuilderAdder.accept(new RenameFileModification(filePath, newFilePath));
return builder;
}
}
| 987 |
4,054 | // Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/eval/eval/function.h>
#include <vespa/searchlib/features/max_reduce_prod_join_replacer.h>
#include <vespa/searchlib/features/rankingexpression/feature_name_extractor.h>
#include <vespa/searchlib/fef/test/indexenvironment.h>
#include <vespa/searchlib/fef/blueprint.h>
#include <vespa/log/log.h>
LOG_SETUP("max_reduce_prod_join_replacer_test");
using search::features::MaxReduceProdJoinReplacer;
using search::features::rankingexpression::ExpressionReplacer;
using search::features::rankingexpression::FeatureNameExtractor;
using search::fef::Blueprint;
using search::fef::FeatureExecutor;
using search::fef::FeatureType;
using search::fef::IDumpFeatureVisitor;
using search::fef::IIndexEnvironment;
using search::fef::IQueryEnvironment;
using search::fef::test::IndexEnvironment;
using vespalib::Stash;
using vespalib::eval::Function;
struct MyBlueprint : Blueprint {
bool &was_used;
MyBlueprint(bool &was_used_out) : Blueprint("my_bp"), was_used(was_used_out) {}
void visitDumpFeatures(const IIndexEnvironment &, IDumpFeatureVisitor &) const override {}
Blueprint::UP createInstance() const override { return std::make_unique<MyBlueprint>(was_used); }
bool setup(const IIndexEnvironment &, const std::vector<vespalib::string> ¶ms) override {
EXPECT_EQUAL(getName(), "my_bp(foo,bar)");
ASSERT_TRUE(params.size() == 2);
EXPECT_EQUAL(params[0], "foo");
EXPECT_EQUAL(params[1], "bar");
describeOutput("out", "my output", FeatureType::number());
was_used = true;
return true;
}
FeatureExecutor &createExecutor(const IQueryEnvironment &, vespalib::Stash &) const override {
LOG_ABORT("should not be reached");
}
};
bool replaced(const vespalib::string &expr) {
bool was_used = false;
ExpressionReplacer::UP replacer = MaxReduceProdJoinReplacer::create(std::make_unique<MyBlueprint>(was_used));
auto rank_function = Function::parse(expr, FeatureNameExtractor());
if (!EXPECT_TRUE(!rank_function->has_error())) {
fprintf(stderr, "parse error: %s\n", rank_function->dump().c_str());
}
auto result = replacer->maybe_replace(*rank_function, IndexEnvironment());
EXPECT_EQUAL(bool(result), was_used);
return was_used;
}
TEST("require that matching expression with appropriate inputs is replaced") {
EXPECT_TRUE(replaced("reduce(tensorFromLabels(attribute(foo),dim)*tensorFromWeightedSet(query(bar),dim),max)"));
}
TEST("require that matching expression with unrelated inputs is not replaced") {
EXPECT_TRUE(!replaced("reduce(foo*bar,max)"));
}
TEST("require that input feature parameter lists have flexible matching") {
EXPECT_TRUE(replaced("reduce(tensorFromLabels( attribute ( foo ) , dim )*tensorFromWeightedSet( query ( bar ) , dim ),max)"));
}
TEST("require that reduce dimension can be specified explicitly") {
EXPECT_TRUE(replaced("reduce(tensorFromLabels(attribute(foo),dim)*tensorFromWeightedSet(query(bar),dim),max,dim)"));
}
TEST("require that expression using tensor join with lambda can also be replaced") {
EXPECT_TRUE(replaced("reduce(join(tensorFromLabels(attribute(foo),dim),tensorFromWeightedSet(query(bar),dim),f(x,y)(x*y)),max)"));
}
TEST("require that parameter ordering does not matter") {
EXPECT_TRUE(replaced("reduce(tensorFromWeightedSet(query(bar),dim)*tensorFromLabels(attribute(foo),dim),max)"));
EXPECT_TRUE(replaced("reduce(join(tensorFromWeightedSet(query(bar),dim),tensorFromLabels(attribute(foo),dim),f(x,y)(x*y)),max)"));
EXPECT_TRUE(replaced("reduce(join(tensorFromLabels(attribute(foo),dim),tensorFromWeightedSet(query(bar),dim),f(x,y)(y*x)),max)"));
}
TEST("require that source specifiers must match") {
EXPECT_TRUE(!replaced("reduce(tensorFromLabels(query(foo),dim)*tensorFromWeightedSet(attribute(bar),dim),max)"));
}
TEST("require that reduce operation must match") {
EXPECT_TRUE(!replaced("reduce(tensorFromLabels(attribute(foo),dim)*tensorFromWeightedSet(query(bar),dim),min)"));
}
TEST("require that join operation must match") {
EXPECT_TRUE(!replaced("reduce(tensorFromLabels(attribute(foo),dim)+tensorFromWeightedSet(query(bar),dim),max)"));
EXPECT_TRUE(!replaced("reduce(join(tensorFromLabels(attribute(foo),dim),tensorFromWeightedSet(query(bar),dim),f(x,y)(x+y)),max)"));
EXPECT_TRUE(!replaced("reduce(join(tensorFromLabels(attribute(foo),dim),tensorFromWeightedSet(query(bar),dim),f(x,y)(x*x)),max)"));
EXPECT_TRUE(!replaced("reduce(join(tensorFromLabels(attribute(foo),dim),tensorFromWeightedSet(query(bar),dim),f(x,y)(y*y)),max)"));
EXPECT_TRUE(!replaced("reduce(join(tensorFromLabels(attribute(foo),dim),tensorFromWeightedSet(query(bar),dim),f(x,y)(x*y*1)),max)"));
}
TEST("require that reduce dimension must match") {
EXPECT_TRUE(!replaced("reduce(tensorFromLabels(attribute(foo),x)*tensorFromWeightedSet(query(bar),x),max,y)"));
EXPECT_TRUE(!replaced("reduce(tensorFromLabels(attribute(foo),x)*tensorFromWeightedSet(query(bar),y),max)"));
EXPECT_TRUE(!replaced("reduce(tensorFromLabels(attribute(foo),x)*tensorFromWeightedSet(query(bar),x),max,x,y)"));
}
TEST_MAIN() { TEST_RUN_ALL(); }
| 1,955 |
348 | <reponame>chamberone/Leaflet.PixiOverlay<gh_stars>100-1000
{"nom":"Vauchoux","circ":"1ère circonscription","dpt":"Haute-Saône","inscrits":91,"abs":42,"votants":49,"blancs":7,"nuls":8,"exp":34,"res":[{"nuance":"REM","nom":"Mme <NAME>","voix":22},{"nuance":"FN","nom":"Mme <NAME>","voix":12}]} | 123 |
335 | <reponame>Safal08/Hacktoberfest-1
{
"word": "Oversupply",
"definitions": [
"Supply with too much or too many."
],
"parts-of-speech": "Verb"
} | 80 |
4,339 | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
package org.apache.ignite.internal.processors.segmentation;
import org.apache.ignite.internal.processors.GridProcessor;
/**
* Kernal processor responsible for checking network segmentation issues.
* <p>
* Segment checks are performed by segmentation resolvers
* Each segmentation resolver checks segment for validity, using its inner logic.
* Typically, resolver should run light-weight single check (i.e. one IP address or
* one shared folder). Compound segment checks may be performed using several
* resolvers.
* @see org.apache.ignite.configuration.IgniteConfiguration#getSegmentationResolvers()
* @see org.apache.ignite.configuration.IgniteConfiguration#getSegmentationPolicy()
* @see org.apache.ignite.configuration.IgniteConfiguration#getSegmentCheckFrequency()
* @see org.apache.ignite.configuration.IgniteConfiguration#isAllSegmentationResolversPassRequired()
* @see org.apache.ignite.configuration.IgniteConfiguration#isWaitForSegmentOnStart()
*/
public interface GridSegmentationProcessor extends GridProcessor {
/**
* Performs network segment check.
* <p>
* This method is called by discovery manager in the following cases:
* <ol>
* <li>Before discovery SPI start.</li>
* <li>When other node leaves topology.</li>
* <li>When other node in topology fails.</li>
* <li>Periodically (see {@link org.apache.ignite.configuration.IgniteConfiguration#getSegmentCheckFrequency()}).</li>
* </ol>
*
* @return {@code True} if segment is correct.
*/
public boolean isValidSegment();
}
| 684 |
852 | <gh_stars>100-1000
// -*- C++ -*-
//
// Package: Core
// Class : FWModelExpressionSelector
//
// Implementation:
// <Notes on implementation>
//
// Original Author: <NAME>
// Created: Wed Jan 23 10:37:22 EST 2008
//
// system include files
#include <sstream>
#include "TClass.h"
#include "FWCore/Reflection/interface/ObjectWithDict.h"
#include "FWCore/Reflection/interface/TypeWithDict.h"
#include "CommonTools/Utils/interface/Grammar.h"
#include "CommonTools/Utils/interface/Exception.h"
// user include files
#include "Fireworks/Core/interface/FWModelExpressionSelector.h"
#include "Fireworks/Core/interface/FWEventItem.h"
#include "Fireworks/Core/interface/FWModelChangeManager.h"
#include "Fireworks/Core/interface/FWExpressionException.h"
#include "Fireworks/Core/src/expressionFormatHelpers.h"
//
// constants, enums and typedefs
//
//
// static data member definitions
//
//
// constructors and destructor
//
/*
FWModelExpressionSelector::FWModelExpressionSelector()
{
}
*/
// FWModelExpressionSelector::FWModelExpressionSelector(const FWModelExpressionSelector& rhs)
// {
// // do actual copying here;
// }
/*FWModelExpressionSelector::~FWModelExpressionSelector()
{
}
*/
//
// assignment operators
//
// const FWModelExpressionSelector& FWModelExpressionSelector::operator=(const FWModelExpressionSelector& rhs)
// {
// //An exception safe implementation is
// FWModelExpressionSelector temp(rhs);
// swap(rhs);
//
// return *this;
// }
//
// member functions
//
//
// const member functions
//
void FWModelExpressionSelector::select(FWEventItem* iItem, const std::string& iExpression, Color_t iColor) const {
using namespace fireworks::expression;
edm::TypeWithDict type(edm::TypeWithDict::byName(iItem->modelType()->GetName()));
assert(type != edm::TypeWithDict());
//Backwards compatibility with old format
std::string temp = oldToNewFormat(iExpression);
//now setup the parser
using namespace boost::spirit::classic;
reco::parser::SelectorPtr selectorPtr;
reco::parser::Grammar grammar(selectorPtr, type);
try {
if (!parse(temp.c_str(), grammar.use_parser<0>() >> end_p, space_p).full) {
throw FWExpressionException("syntax error", -1);
//std::cout <<"failed to parse "<<iExpression<<" because of syntax error"<<std::endl;
}
} catch (const reco::parser::BaseException& e) {
//NOTE: need to calculate actual position before doing the regex
throw FWExpressionException(reco::parser::baseExceptionWhat(e),
indexFromNewFormatToOldFormat(temp, e.where - temp.c_str(), iExpression));
//std::cout <<"failed to parse "<<iExpression<<" because "<<reco::parser::baseExceptionWhat(e)<<std::endl;
}
FWChangeSentry sentry(*(iItem->changeManager()));
for (unsigned int index = 0; index < iItem->size(); ++index) {
edm::ObjectWithDict o(type, const_cast<void*>(iItem->modelData(index)));
if ((*selectorPtr)(o)) {
iItem->select(index);
if (iColor > 0) {
FWDisplayProperties props = iItem->modelInfo(index).displayProperties();
props.setColor(iColor);
iItem->setDisplayProperties(index, props);
}
}
}
}
//
// static member functions
//
| 1,150 |
1,780 | //
// REDateTimeItem.h
// RETableViewManager
//
// Copyright (c) 2013 <NAME> (https://github.com/romaonthego)
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//
#import "RETableViewItem.h"
#import "REInlineDatePickerItem.h"
@interface REDateTimeItem : RETableViewItem
@property (strong, readwrite, nonatomic) NSDate *value;
@property (strong, readwrite, nonatomic) NSDate *pickerStartDate; // date to be used for the picker when the value is not set; defaults to current date when not specified
@property (copy, readwrite, nonatomic) NSString *placeholder;
@property (strong, readwrite, nonatomic) NSString *format;
@property (assign, readwrite, nonatomic) UIDatePickerMode datePickerMode; // default is UIDatePickerModeDateAndTime
@property (strong, readwrite, nonatomic) NSLocale *locale; // default is [NSLocale currentLocale]. setting nil returns to default
@property (copy, readwrite, nonatomic) NSCalendar *calendar; // default is [NSCalendar currentCalendar]. setting nil returns to default
@property (strong, readwrite, nonatomic) NSTimeZone *timeZone; // default is nil. use current time zone or time zone from calendar
@property (strong, readwrite, nonatomic) NSDate *minimumDate; // specify min/max date range. default is nil. When min > max, the values are ignored. Ignored in countdown timer mode
@property (strong, readwrite, nonatomic) NSDate *maximumDate; // default is nil
@property (assign, readwrite, nonatomic) NSInteger minuteInterval; // display minutes wheel with interval. interval must be evenly divided into 60. default is 1. min is 1, max is 30
@property (copy, readwrite, nonatomic) void (^onChange)(REDateTimeItem *item);
@property (assign, readwrite, nonatomic) BOOL inlineDatePicker;
@property (strong, readwrite, nonatomic) REInlineDatePickerItem *inlinePickerItem;
+ (instancetype)itemWithTitle:(NSString *)title value:(NSDate *)value placeholder:(NSString *)placeholder format:(NSString *)format datePickerMode:(UIDatePickerMode)datePickerMode;
- (id)initWithTitle:(NSString *)title value:(NSDate *)value placeholder:(NSString *)placeholder format:(NSString *)format datePickerMode:(UIDatePickerMode)datePickerMode;
@end
| 959 |
542 | from decimal import Decimal
from hummingbot.connector.in_flight_order_base import InFlightOrderBase
from hummingbot.core.data_type.common import OrderType, TradeType
class MexcInFlightOrder(InFlightOrderBase):
def __init__(self,
client_order_id: str,
exchange_order_id: str,
trading_pair: str,
order_type: OrderType,
trade_type: TradeType,
price: Decimal,
amount: Decimal,
creation_timestamp: float,
initial_state: str = "NEW"):
super().__init__(
client_order_id,
exchange_order_id,
trading_pair,
order_type,
trade_type,
price,
amount,
creation_timestamp,
initial_state, # submitted, partial-filled, cancelling, filled, canceled, partial-canceled
)
self.fee_asset = self.quote_asset
@property
def is_done(self) -> bool:
return self.last_state in {"FILLED", "CANCELED", "PARTIALLY_CANCELED"}
@property
def is_cancelled(self) -> bool:
return self.last_state in {"CANCELED", "PARTIALLY_CANCELED"}
@property
def is_failure(self) -> bool:
return self.last_state in {"CANCELED", "PARTIALLY_CANCELED"}
@property
def is_open(self) -> bool:
return self.last_state in {"NEW", "PARTIALLY_FILLED"}
def mark_as_filled(self):
self.last_state = "FILLED"
| 735 |
476 | /*
* 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.
*/
package io.prestosql.operator;
import com.google.common.annotations.VisibleForTesting;
import io.prestosql.spi.Page;
import io.prestosql.spi.PageBuilder;
import io.prestosql.spi.block.Block;
import io.prestosql.spi.snapshot.Restorable;
import io.prestosql.spi.type.Type;
import java.util.List;
public interface GroupBy
extends Restorable
{
List<Type> getTypes();
long getEstimatedSize();
default long getHashCollisions()
{
return 0;
}
default double getExpectedHashCollisions()
{
return 0;
}
int getGroupCount();
void appendValuesTo(int groupId, PageBuilder pageBuilder, int outputChannelOffset);
Work<?> addPage(Page page);
Work<GroupByIdBlock> getGroupIds(Page page);
boolean contains(int position, Page page, int[] hashChannels);
default boolean contains(int position, Page page, int[] hashChannels, long rawHash)
{
return contains(position, page, hashChannels);
}
default long getRawHash(int groupyId)
{
throw new UnsupportedOperationException();
}
@VisibleForTesting
default int getCapacity()
{
throw new UnsupportedOperationException();
}
default boolean needMoreCapacity()
{
throw new UnsupportedOperationException();
}
default boolean tryToIncreaseCapacity()
{
throw new UnsupportedOperationException();
}
default int putIfAbsent(int position, Block block)
{
throw new UnsupportedOperationException("does not support putIfAbsent");
}
default int putIfAbsent(int position, Page page)
{
throw new UnsupportedOperationException("does not support putIfAbsent");
}
default int putIfAbsent(int position, Page page, long rawHash)
{
throw new UnsupportedOperationException("does not support putIfAbsent");
}
}
| 814 |
367 | <reponame>Ryan-rsm-McKenzie/m.css
/// @file
/// A file
/// A typedef
typedef int Typedef;
//! An enum
enum Enum {
Value, //!< A brief description
Another, /**< A detailed description */
/**
* @brief A brief description
*
* And a detailed one as well.
*/
Last
};
| 133 |
348 | {"nom":"Saint-Paul-et-Valmalle","circ":"4ème circonscription","dpt":"Hérault","inscrits":871,"abs":541,"votants":330,"blancs":35,"nuls":11,"exp":284,"res":[{"nuance":"REM","nom":"<NAME>","voix":181},{"nuance":"FN","nom":"<NAME>","voix":103}]} | 98 |
348 | <reponame>chamberone/Leaflet.PixiOverlay<filename>docs/data/leg-t2/029/02905075.json
{"nom":"Guipavas","circ":"5ème circonscription","dpt":"Finistère","inscrits":10793,"abs":5781,"votants":5012,"blancs":386,"nuls":118,"exp":4508,"res":[{"nuance":"REM","nom":"<NAME>","voix":2676},{"nuance":"DVD","nom":"M. <NAME>","voix":1832}]} | 137 |
686 | /* BSD 3-Clause License
*
* Copyright © 2008-2021, Jice and the libtcod contributors.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* 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.
*/
#include "button.hpp"
#include <string.h>
#include <algorithm>
Button::Button(const char* label, const char* tip, widget_callback_t cbk, void* userData)
: pressed(false), label(NULL) {
if (label) {
setLabel(label);
}
if (tip) {
setTip(tip);
}
this->x = 0;
this->y = 0;
this->userData = userData;
this->cbk = cbk;
}
Button::Button(
int x, int y, int width, int height, const char* label, const char* tip, widget_callback_t cbk, void* userData)
: pressed(false), label(NULL) {
if (label) {
setLabel(label);
}
if (tip) {
setTip(tip);
}
w = width;
h = height;
this->x = x;
this->y = y;
this->userData = userData;
this->cbk = cbk;
}
Button::~Button() {
if (label) {
free(label);
}
}
void Button::setLabel(const char* newLabel) {
if (label) {
free(label);
}
label = TCOD_strdup(newLabel);
}
void Button::render() {
const auto fg = TCOD_ColorRGB(mouseIn ? foreFocus : fore);
const auto bg = TCOD_ColorRGB(mouseIn ? backFocus : back);
auto& console = static_cast<TCOD_Console&>(*con);
if (w > 0 && h > 0) {
tcod::draw_rect(console, {x, y, w, h}, ' ', &fg, &bg);
}
if (label) {
if (pressed && mouseIn) {
tcod::print(console, {x + w / 2, y}, tcod::stringf("-%s-", label), &fg, nullptr, TCOD_BKGND_SET, TCOD_CENTER);
} else {
tcod::print(console, {x + w / 2, y}, label, &fg, nullptr, TCOD_BKGND_SET, TCOD_CENTER);
}
}
}
void Button::computeSize() {
w = label ? static_cast<int>(strlen(label) + 2) : 4;
h = 1;
}
void Button::expand(int width, int) { w = std::max(w, width); }
void Button::onButtonPress() { pressed = true; }
void Button::onButtonRelease() { pressed = false; }
void Button::onButtonClick() {
if (cbk) {
cbk(this, userData);
}
}
| 1,204 |
455 | // Copyright (c) 2020-2021 HexHacking Team
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
// Created by caikelun on 2020-10-04.
#include "xdl_util.h"
#include <android/api-level.h>
#include <ctype.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
bool xdl_util_starts_with(const char *str, const char *start) {
while (*str && *str == *start) {
str++;
start++;
}
return '\0' == *start;
}
bool xdl_util_ends_with(const char *str, const char *ending) {
size_t str_len = strlen(str);
size_t ending_len = strlen(ending);
if (ending_len > str_len) return false;
return 0 == strcmp(str + (str_len - ending_len), ending);
}
size_t xdl_util_trim_ending(char *start) {
char *end = start + strlen(start);
while (start < end && isspace((int)(*(end - 1)))) {
end--;
*end = '\0';
}
return (size_t)(end - start);
}
static int xdl_util_get_api_level_from_build_prop(void) {
char buf[128];
int api_level = -1;
FILE *fp = fopen("/system/build.prop", "r");
if (NULL == fp) goto end;
while (fgets(buf, sizeof(buf), fp)) {
if (xdl_util_starts_with(buf, "ro.build.version.sdk=")) {
api_level = atoi(buf + 21);
break;
}
}
fclose(fp);
end:
return (api_level > 0) ? api_level : -1;
}
int xdl_util_get_api_level(void) {
static int xdl_util_api_level = -1;
if (xdl_util_api_level < 0) {
int api_level = android_get_device_api_level();
if (api_level < 0)
api_level = xdl_util_get_api_level_from_build_prop(); // compatible with unusual models
if (api_level < __ANDROID_API_J__) api_level = __ANDROID_API_J__;
__atomic_store_n(&xdl_util_api_level, api_level, __ATOMIC_SEQ_CST);
}
return xdl_util_api_level;
}
| 1,026 |
372 | <filename>lwadtool/libadtool/set.c
/*
* Copyright © BeyondTrust Software 2004 - 2019
* All rights reserved.
*
* 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.
*
* BEYONDTRUST MAKES THIS SOFTWARE AVAILABLE UNDER OTHER LICENSING TERMS AS
* WELL. IF YOU HAVE ENTERED INTO A SEPARATE LICENSE AGREEMENT WITH
* BEYONDTRUST, THEN YOU MAY ELECT TO USE THE SOFTWARE UNDER THE TERMS OF THAT
* SOFTWARE LICENSE AGREEMENT INSTEAD OF THE TERMS OF THE APACHE LICENSE,
* NOTWITHSTANDING THE ABOVE NOTICE. IF YOU HAVE QUESTIONS, OR WISH TO REQUEST
* A COPY OF THE ALTERNATE LICENSING TERMS OFFERED BY BEYONDTRUST, PLEASE CONTACT
* BEYONDTRUST AT beyondtrust.com/contact
*/
/*
* Module Name:
*
* set.c
*
* Abstract:
*
* Methods for setting attributes of directory objects.
*
* Authors: Author: CORP\rali
*
* Created on: Sep 6, 2016
*
*/
#include "includes.h"
DWORD InitAdtSetAttrAction(IN AdtActionTP action)
{
return InitBaseAction(action);
}
DWORD ValidateAdtSetAttrAction(IN AdtActionTP action)
{
DWORD dwError = 0;
AppContextTP appContext = (AppContextTP) ((AdtActionBaseTP) action)->opaque;
PSTR dn = NULL;
dwError = OpenADSearchConnectionDN(action, &(action->setAttribute.dn));
ADT_BAIL_ON_ERROR_NP(dwError);
SwitchToSearchConnection(action);
if (!action->setAttribute.dn) {
dwError = ADT_ERR_ARG_MISSING_DN;
ADT_BAIL_ON_ERROR_NP(dwError);
}
if (!action->setAttribute.attrName)
{
dwError = ADT_ERR_ARG_MISSING_NAME;
ADT_BAIL_ON_ERROR_NP(dwError);
}
dwError = ProcessDash(&(action->setAttribute.dn));
ADT_BAIL_ON_ERROR_NP(dwError);
dwError = ResolveDN(appContext, ObjectClassAny, action->setAttribute.dn, &dn);
ADT_BAIL_ON_ERROR_NP(dwError);
LW_SAFE_FREE_MEMORY(action->setAttribute.dn);
action->setAttribute.dn = dn;
cleanup:
return dwError;
error:
LW_SAFE_FREE_MEMORY(dn);
goto cleanup;
}
DWORD ExecuteAdtSetAttrAction(IN AdtActionTP action)
{
DWORD dwError = 0;
DWORD i, j = 0;
DWORD dwMaxValues = 100;
AttrValsT *avp = NULL;
AppContextTP appContext = (AppContextTP) ((AdtActionBaseTP) action)->opaque;
PSTR aStr = NULL;
PSTR saveStrPtr = NULL;
PSTR tmpStr = NULL;
dwError = LwAllocateMemory(2 * sizeof(AttrValsT), OUT_PPVOID(&avp));
ADT_BAIL_ON_ALLOC_FAILURE(!dwError);
avp[0].attr = action->setAttribute.attrName;
dwError = LwAllocateMemory(dwMaxValues * sizeof(PSTR), OUT_PPVOID(&(avp[0].vals)));
ADT_BAIL_ON_ALLOC_FAILURE(!dwError);
for (i = 0; i < dwMaxValues; i++)
avp[0].vals[i] = NULL;
if (action->setAttribute.attrValue)
{
dwError = LwStrDupOrNull(action->setAttribute.attrValue, &tmpStr);
ADT_BAIL_ON_ALLOC_FAILURE_NP(!dwError);
// Use semi-colon to delimit a multi-value attribute.
aStr = strtok_r(tmpStr, ADT_LIST_DELIMITER, &saveStrPtr);
i = 0;
while ((aStr != NULL) && (i < dwMaxValues))
{
dwError = LwStrDupOrNull((PCSTR) aStr, &(avp[0].vals[i]));
ADT_BAIL_ON_ALLOC_FAILURE_NP(!dwError);
aStr = strtok_r(NULL, ADT_LIST_DELIMITER, &saveStrPtr);
i++;
}
}
dwError = ModifyADObject(appContext, action->setAttribute.dn, avp, 2);
ADT_BAIL_ON_ERROR_NP(dwError);
if (action->setAttribute.attrValue)
PrintResult(appContext, LogLevelNone, "Successfully updated \"%s\" with: %s\n",
action->setAttribute.attrName,
action->setAttribute.attrValue);
else
PrintResult(appContext, LogLevelNone, "Cleared \"%s\" attribute\n", action->setAttribute.attrName);
cleanup:
if (avp)
{
for (i = 0; avp[i].vals; ++i)
{
for (j = 0; avp[i].vals[j]; ++j)
{
LW_SAFE_FREE_MEMORY(avp[i].vals[j]);
}
LW_SAFE_FREE_MEMORY(avp[i].vals);
}
LW_SAFE_FREE_MEMORY(avp);
}
if (tmpStr)
LW_SAFE_FREE_STRING(tmpStr);
return dwError;
error:
goto cleanup;
}
DWORD CleanUpAdtSetAttrAction(IN AdtActionTP action)
{
return CleanUpBaseAction(action);
}
| 2,049 |
4,526 |
#include <cstring>
#include <stdexcept>
#include "common.hpp"
class TestHandler114 : public osmium::handler::Handler {
public:
TestHandler114() :
osmium::handler::Handler() {
}
void way(const osmium::Way& way) const {
if (way.id() == 114800) {
REQUIRE(way.version() == 1);
REQUIRE(way.nodes().size() == 2);
REQUIRE_FALSE(way.is_closed());
REQUIRE(way.nodes()[0].ref() == 114000);
REQUIRE(way.nodes()[1].ref() == 114001);
} else if (way.id() == 114801) {
REQUIRE(way.version() == 1);
REQUIRE(way.nodes().size() == 2);
REQUIRE_FALSE(way.is_closed());
REQUIRE(way.nodes()[0].ref() == 114001);
REQUIRE(way.nodes()[1].ref() == 114002);
} else {
throw std::runtime_error{"Unknown ID"};
}
}
}; // class TestHandler114
TEST_CASE("114") {
osmium::io::Reader reader{dirname + "/1/114/data.osm"};
index_pos_type index_pos;
index_neg_type index_neg;
location_handler_type location_handler{index_pos, index_neg};
location_handler.ignore_errors();
CheckBasicsHandler check_basics_handler{114, 3, 2, 0};
CheckWKTHandler check_wkt_handler{dirname, 114};
TestHandler114 test_handler;
osmium::apply(reader, location_handler, check_basics_handler, check_wkt_handler, test_handler);
}
| 642 |
476 | // Copyright 2013 <NAME>
// Distributed under Boost license
#ifdef __linux__
#define BOOST_TEST_DYN_LINK
#endif
#include <boost/test/unit_test.hpp>
#include <sstream>
#include <vector>
#include <utility>
#include <ctime>
#include <jsoncons/json.hpp>
#include <jsoncons/detail/heap_only_string.hpp>
using namespace jsoncons;
BOOST_AUTO_TEST_SUITE(heap_only_string_tests)
BOOST_AUTO_TEST_CASE(test_heap_only_string)
{
std::string input = "Hello World";
auto s = detail::heap_only_string_factory<char, std::allocator<char>>::create(input.data(), input.size());
//std::cout << s->c_str() << std::endl;
BOOST_CHECK(input == std::string(s->c_str()));
detail::heap_only_string_factory<char,std::allocator<char>>::destroy(s);
}
BOOST_AUTO_TEST_CASE(test_heap_only_string_wchar_t)
{
std::wstring input = L"Hello World";
auto s = detail::heap_only_string_factory<wchar_t, std::allocator<wchar_t>>::create(input.data(), input.size());
//std::wcout << s->c_str() << std::endl;
BOOST_CHECK(input == std::wstring(s->c_str()));
detail::heap_only_string_factory<wchar_t,std::allocator<wchar_t>>::destroy(s);
}
BOOST_AUTO_TEST_SUITE_END()
| 494 |
348 | {"nom":"Marles-sur-Canche","circ":"4ème circonscription","dpt":"Pas-de-Calais","inscrits":238,"abs":102,"votants":136,"blancs":8,"nuls":4,"exp":124,"res":[{"nuance":"REM","nom":"<NAME>","voix":65},{"nuance":"LR","nom":"<NAME>","voix":59}]} | 98 |
14,668 | // Copyright 2021 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
package org.chromium.components.content_capture;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import static org.mockito.Mockito.doReturn;
import android.annotation.TargetApi;
import android.content.ComponentName;
import android.content.Context;
import android.content.LocusId;
import android.os.Build;
import android.view.contentcapture.ContentCaptureCondition;
import android.view.contentcapture.ContentCaptureManager;
import org.junit.Before;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.mockito.Mockito;
import org.mockito.MockitoAnnotations;
import org.robolectric.annotation.Config;
import org.chromium.base.test.BaseRobolectricTestRunner;
import java.util.HashSet;
/**
* Unit test for PlatformContentCaptureController.
*/
@RunWith(BaseRobolectricTestRunner.class)
@Config(manifest = Config.NONE)
@TargetApi(Build.VERSION_CODES.Q)
public class PlatformContentCaptureControllerTest {
private ContentCaptureManager mContentCaptureManager;
private Context mContext;
private ComponentName mComponentName;
@Before
public void setUp() {
MockitoAnnotations.initMocks(this);
mContext = Mockito.mock(Context.class);
mContentCaptureManager = Mockito.mock(ContentCaptureManager.class);
mComponentName = Mockito.mock(ComponentName.class);
doReturn(mContentCaptureManager)
.when(mContext)
.getSystemService(ContentCaptureManager.class);
doReturn(mComponentName).when(mContentCaptureManager).getServiceComponentName();
doReturn(true).when(mContentCaptureManager).isContentCaptureEnabled();
doReturn("com.google.android.as").when(mComponentName).getPackageName();
doReturn(null).when(mContentCaptureManager).getContentCaptureConditions();
}
@Test
public void testEverythingAllowed() throws Throwable {
PlatformContentCaptureController controller =
new PlatformContentCaptureController(mContext);
assertTrue(controller.isAiai());
assertTrue(controller.shouldStartCapture());
assertTrue(controller.shouldCapture(new String[] {"http://www.chromium.org"}));
}
@Test
public void testEverythingDisallowed() throws Throwable {
doReturn(new HashSet<ContentCaptureCondition>())
.when(mContentCaptureManager)
.getContentCaptureConditions();
PlatformContentCaptureController controller =
new PlatformContentCaptureController(mContext);
assertTrue(controller.isAiai());
assertTrue(controller.shouldStartCapture());
assertFalse(controller.shouldCapture(new String[] {"http://www.chromium.org"}));
}
@Test
public void testContentCaptureConditions() throws Throwable {
HashSet<ContentCaptureCondition> conditions = new HashSet<ContentCaptureCondition>();
conditions.add(new ContentCaptureCondition(
new LocusId(".*chromium.org"), ContentCaptureCondition.FLAG_IS_REGEX));
conditions.add(new ContentCaptureCondition(new LocusId("www.abc.org"), 0));
doReturn(conditions).when(mContentCaptureManager).getContentCaptureConditions();
PlatformContentCaptureController controller =
new PlatformContentCaptureController(mContext);
assertTrue(controller.isAiai());
assertTrue(controller.shouldStartCapture());
assertTrue(controller.shouldCapture(new String[] {"http://www.chromium.org"}));
assertTrue(controller.shouldCapture(new String[] {"http://www.abc.org"}));
assertFalse(controller.shouldCapture(new String[] {"http://abc.org"}));
}
@Test
public void testNoAndroidAs() throws Throwable {
doReturn("org.abc").when(mComponentName).getPackageName();
PlatformContentCaptureController controller =
new PlatformContentCaptureController(mContext);
assertFalse(controller.isAiai());
}
@Test
public void testShouldNotStartCapture() throws Throwable {
doReturn(false).when(mContentCaptureManager).isContentCaptureEnabled();
PlatformContentCaptureController controller =
new PlatformContentCaptureController(mContext);
assertFalse(controller.shouldStartCapture());
}
}
| 1,530 |
392 | /*******************************************************************************
* Copyright (c) 2015
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*******************************************************************************/
package go.graphics.region;
import go.graphics.UIPoint;
/**
* This is the position of a region inside an area.
*
* @author michael
*/
public class PositionedRegion {
private final int top;
private final int bottom;
private final int left;
private final int right;
private final Region region;
public PositionedRegion(Region region, int top, int bottom, int left,
int right) {
this.region = region;
this.top = top;
this.bottom = bottom;
this.left = left;
this.right = right;
}
public int getTop() {
return top;
}
public int getBottom() {
return bottom;
}
public int getLeft() {
return left;
}
public int getRight() {
return right;
}
public Region getRegion() {
return region;
}
public boolean contentContains(UIPoint point) {
return getLeft() <= point.getX() && getRight() > point.getX()
&& getTop() > point.getY() && getBottom() <= point.getY();
}
}
| 594 |
1,615 | <filename>MLN-Android/mlnservics/src/main/java/com/immomo/mls/global/LVConfig.java<gh_stars>1000+
/**
* Created by MomoLuaNative.
* Copyright (c) 2019, Momo Group. All rights reserved.
*
* This source code is licensed under the MIT.
* For the full copyright and license information,please view the LICENSE file in the root directory of this source tree.
*/
package com.immomo.mls.global;
import android.content.Context;
import java.io.File;
/**
* Created by XiongFangyu on 2018/6/19.
*/
public class LVConfig {
Context context;
File sdcardDir;
File rootDir;
File cacheDir;
File imageDir;
String globalResourceDir;
LVConfig() {
}
public Context getContext() {
return context;
}
public File getSdcardDir() {
return sdcardDir;
}
public File getRootDir() {
return rootDir;
}
public File getCacheDir() {
return cacheDir;
}
public File getImageDir() {
return imageDir;
}
public String getGlobalResourceDir() {
return globalResourceDir;
}
public boolean isValid() {
return context != null && rootDir != null && cacheDir != null && imageDir != null && globalResourceDir != null;
}
} | 456 |
418 | <reponame>UnifiQ/FEMFX<filename>amd_femfx/inc/FEMFXRigidBodyState.h
/*
MIT License
Copyright (c) 2019 Advanced Micro Devices, Inc.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
//---------------------------------------------------------------------------------------
// Dynamic state of rigid bodies
//---------------------------------------------------------------------------------------
#pragma once
#include "FEMFXVectormath.h"
namespace AMD
{
struct FmRigidBodyState
{
FmVector3 pos;
FmQuat quat;
FmVector3 vel;
FmVector3 angVel;
FmRigidBodyState()
{
pos = FmInitVector3(0.0f);
quat = FmInitQuat(0.0f, 0.0f, 0.0f, 1.0f);
vel = FmInitVector3(0.0f);
angVel = FmInitVector3(0.0f);
}
};
// Set mass and body-relative inertial tensor for uniform density box
static inline FmMatrix3 FmComputeBodyInertiaTensorForBox(float hx, float hy, float hz, float inMass)
{
FmMatrix3 bodyInertiaTensor;
float massDiv12 = inMass / 12.0f;
float dx = hx * 2.0f;
float dy = hy * 2.0f;
float dz = hz * 2.0f;
float dxSqr = dx * dx;
float dySqr = dy * dy;
float dzSqr = dz * dz;
bodyInertiaTensor.col0 = FmInitVector3(massDiv12 * (dySqr + dzSqr), 0.0f, 0.0f);
bodyInertiaTensor.col1 = FmInitVector3(0.0f, massDiv12 * (dzSqr + dxSqr), 0.0f);
bodyInertiaTensor.col2 = FmInitVector3(0.0f, 0.0f, massDiv12 * (dxSqr + dySqr));
return bodyInertiaTensor;
}
}
| 982 |
336 | <gh_stars>100-1000
#include "Ext_Flash.c"
#include <stdint.h>
#include <stdbool.h>
#include "library/STM32F10x_StdPeriph_Driver/inc/misc.h"
#include "lcd.h"
#ifdef DISABLE_USB
void __USB_Istr(void) {}
void __CTR_HP(void) {}
#endif
extern void (* g_pfnVectors[76])(void);
extern uint32_t gGpioStatusCode;
extern uint32_t gGpioI2cSpeed;
extern unsigned long _estack;
extern unsigned long _addressRamBegin;
extern unsigned long _addressRamEnd;
extern unsigned long _addressRomBegin;
extern unsigned long _addressRomEnd;
__attribute__ ((section(".biosfunc"), optimize("O0")))
uint32_t __Bios(uint8_t Item, uint32_t Var) { return 0; }
enum
{
SYSINFO, // ???????? Var: PRDT_SN ??????? Rtn: (u16)???????
// Var: PRODUCT ?????? Rtn: ?????????
// Var: PRDTNUM ??????? Rtn: (u16)???????
// Var: SCH_VER ????? Rtn: ????????
// Var: MCU_TYP MCU ??? Rtn: ?????????
// Var: DFU_VER DFU ?? Rtn: ????????
// Var: OEM_NUM OEM ???? Rtn: ??????????
// Var: MANUFAC ???????? Rtn: ?????????
// Var: LICENCE ??????? Rtn: SUCC/FAIL
// ????????
NIVCPTR, // ????????????? Var: (u16) ?????? Rtn: SUCC/FAIL
SYSTICK, // ????????????? Var: (u16)uS ?????? Rtn: SUCC/FAIL
AF_RMAP, // ?? IO ???
PWRCTRL, // ??????? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: VIN_ST ?????? Rtn: ENBL/DSBL
// Var: VBAT ?????? Rtn: (u16)mV
// Var: DSBL ?????? Rtn: SUCC/FAIL
BUZZDEV, // ????????? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: (MUTE~100) ???? Rtn: SUCC/FAIL
KEYnDEV, // ???????????? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: BITMAP ?????? Rtn: (u16)?????
DELAYuS, // ?????? Var: (u32)uS ?????? Rtn: SUCC/FAIL
// ?????????
DISPDEV, // LCD ????? Var: STRING g????? Rtn: ?????????
// Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: VALUE ??L???? Rtn: (MaxX<<16+MaxY)
// Var: (0~100) ???????? Rtn: SUCC/FAIL
// Var: (MCU/FPGA)????? Rtn: SUCC/FAIL
BLOCK_X, // ????? x ?????? Var: (x1 << 16)+x2) Rtn: SUCC/FAIL
BLOCK_Y, // ????? y ?????? Var: (y1 << 16)+y2) Rtn: SUCC/FAIL
PIXEL_X, // ???? x ??? Var: (u16)??? Rtn: SUCC/FAIL
PIXEL_Y, // ???? y ??? Var: (u16)??? Rtn: SUCC/FAIL
WrPIXEL, // ???????? Var: (u16)??????? Rtn: SUCC/FAIL
RdPIXEL, // ?????L???? Var: Rtn: (u16)???????
FONTPTR, // Var: ASCII Code Rtn: ptr ??????
// FPGA ??????
FPGADEV, // FPGA ?????? Var: STRING Rtn: ?????????
// Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: CNFG ??????? Rtn: SUCC/FAIL
// Var: COMM ???g? Rtn: SUCC/FAIL
// Var: ENBL ????? Rtn: SUCC/FAIL
// Var: (SPI_ParamDef*) Rtn: SUCC/FAIL
// ??????????????
IN_PORT, // ??????????? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: VREF ????????? Rtn: SUCC/FAIL
// U ???????
USBDEV, // USB ??'??
U_DISK, // USB DISK ?? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: STRING U ????? Rtn: U ???????????
// Var: PAGE ?????? Rtn: SUCC/FAIL
// Var: SECTOR ???????? Rtn: (u16)????????
// Var: AMOUNT ???????? Rtn: (u16)????????
// Var: (SPI_ParamDef*) Rtn: SUCC/FAIL
// SPI ??????
SPI_DEV, // SPI ????? Var: (SPI_ParamDef*) Rtn: SUCC/FAIL
FLSHDEV, // Flash SPI
// ??????????????
EXT_INP, // ??? PIO ??? Var: PIOCFG+PinDef Rtn: SUCC
EXT_OUT, // ??? PIO ??? Var: PIOCFG+PinDef Rtn: SUCC
// Var: PINS_OUT+Status0~3 Rtn: SUCC
// Var: PINS_IN+BitMask0~3 Rtn: PinStatus 0~3
EXT_PWM, // ??? PWM ??? Var: PWM_PSC+Var[0~15] Rtn: SUCC
// Var: PWM_ARR+Var[0~15] Rtn: SUCC
// Var: CH1_CCR+Var[0~15] Rtn: SUCC
// Var: CH2_CCR+Var[0~15] Rtn: SUCC
// Var: CH1_CTRL+ENBL/DSBL Rtn: SUCC
// Var: CH2_CTRL+ENBL/DSBL Rtn: SUCC
EXT_INF, // ??? PIO ??? Var: INIT ??'?????? ?????????????
EXT_SPI, // ??? PIO ??? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: (SPI_ParamDef*) Rtn: SUCC/FAIL
EXT_UART,// ??? PIO ??? Var: INIT ??'?????? Rtn: SUCC/FAIL
// Var: u8 Data Rtn: SUCC/FAIL
EXT_I2C, // ??? PIO ???
// Var: 0x00&ID®&DATA Rtn: SUCC/FAIL
EXT_RXD, // ??? PIO ??? Var: PIOCFG+PinDef Rtn: SUCC
EXT_TXD, // ??? PIO ??? Var: PIOCFG+PinDef Rtn: SUCC
};
enum
{
PRDT_SN, // 8c33b088
PRODUCT, // LA104
PRDTNUM, // 0104
HDW_VER, // 1.5B
MCU_TYP, // STM32F103VC
DFU_VER, // V3.61D
OEM_NUM, // X
MANUFAC, // e-Design
LICENCE, // 1
};
#define VIN_ST 0xFFFC0000
#define VBTYmV 0xFFFB0000
#define INIT 0xFFFF0000
#define ENBL 1
#define DSBL 0
void ExtFlash_CS_LOW(void)
{
__Bios(FLSHDEV, DSBL);
// GPIO_ResetBits(DISK_nSS1_PORT, DISK_nSS1_PIN);
}
void ExtFlash_CS_HIGH(void)
{
__Bios(FLSHDEV, ENBL);
// GPIO_SetBits(DISK_nSS1_PORT, DISK_nSS1_PIN);
}
void xBeep(bool b)
{
if (b)
{
__Bios(BUZZDEV, ENBL);
__Bios(BUZZDEV, 50);
} else
{
__Bios(BUZZDEV, DSBL);
}
}
void EnableUsb(bool enable)
{
if (enable)
{
__Bios(USBDEV, INIT);
} else
{
__Bios(USBDEV, DSBL);
}
}
void HardwareInit()
{
__Bios(PWRCTRL, INIT); //
__Bios(KEYnDEV, INIT); //
NVIC_SetVectorTable(NVIC_VectTab_FLASH, (uint32_t)g_pfnVectors - NVIC_VectTab_FLASH);
// __Bios(NIVCPTR, 0x8000); //
SysTick_Config(SystemCoreClock / 1000);
__Bios(BUZZDEV, INIT); //
__Bios(BUZZDEV, 50);
//Beep_mS(200);
__Bios(FLSHDEV, INIT); // SPI
__Bios(IN_PORT, INIT); // DAC
}
uint32_t GetKeys()
{
const uint32_t KEYnDEV = 6;
const uint32_t BITMAP = 0xFFFC0000;
uint32_t keysReg = ~__Bios(KEYnDEV, BITMAP);
uint32_t keysMask = 0;
// yYxX 1111 1111 DCBA
uint8_t encX = (keysReg >> 12) & 3;
uint8_t encY = (keysReg >> 14) & 3;
uint8_t keys = keysReg & 0x0f;
static uint8_t encXold = -1, encYold = -1;
if (encXold == -1)
{
encXold = encX;
encYold = encY;
}
static int8_t encTable[16] = {
// [0b0001] = 1, // 11 -> 10
[0b0111] = 1, // 10 -> 00
[0b1100] = 1, // 00 -> 11
[0b0011] = -1, // 10 -> 11
// [0b1101] = -1, // 00 -> 10
[0b0100] = -1, // 11 -> 00
};
if (encX != encXold)
{
int8_t diff = encTable[(encXold << 2) | encX];
if (diff>0)
keysMask |= KeyRight;
else if (diff<0)
keysMask |= KeyLeft;
encXold = encX;
}
if (encY != encYold)
{
int8_t diff = encTable[(encYold << 2) | encY];
if (diff>0)
keysMask |= KeyUp;
else if (diff<0)
keysMask |= KeyDown;
encYold = encY;
}
keysMask |= keys & 0b1111; // F1..F4
return keysMask;
}
// FPGA
typedef struct
{
uint16_t n;
uint8_t *pBuf;
} TFpgaRequest;
uint32_t FPGA32(uint8_t Cmd, uint16_t Cnt, uint32_t Data)
{
uint8_t Buffer[10];
uint8_t *SpiCmd = (uint8_t *)&Buffer[0];
uint8_t *SpiInfo = (uint8_t *)&Buffer[0];
uint32_t *SpiRecord = (uint32_t *)&Buffer[1]; // WTF? ALIASING?
TFpgaRequest Param;
uint32_t Temp = 0;
Param.pBuf = SpiCmd;
Param.n = Cnt;
*SpiCmd = Cmd;
*SpiRecord = Data;
__Bios(FPGADEV, (uint32_t)&Param);
Temp = *SpiInfo;
Temp |= *SpiRecord << 8;
return Temp;
}
uint16_t FPGA16(uint8_t Cmd, uint16_t Cnt, uint16_t Data)
{
uint8_t Buffer[10];
uint8_t *SpiCmd = (uint8_t *)&Buffer[0];
uint8_t *SpiInfo = (uint8_t *)&Buffer[0];
uint8_t *SpiByte = (uint8_t *)&Buffer[1];
uint16_t *SpiData = (uint16_t *)&Buffer[1]; // WTF? ALIASING?
TFpgaRequest Param;
uint16_t Temp = 0;
Param.pBuf = SpiCmd;
Param.n = Cnt;
*SpiCmd = Cmd;
*SpiData = Data;
__Bios(FPGADEV, (uint32_t)&Param);
Temp |= (*SpiInfo) << 8;
Temp |= *SpiByte;
return Temp;
}
uintptr_t GetAttribute(enum EAttribute attribute)
{
switch (attribute)
{
case DeviceType: return (uintptr_t)"LA104";
case VersionDfu: return (uintptr_t)(char*)__Bios(SYSINFO, DFU_VER);
case VersionHardware: return (uintptr_t)(char*)__Bios(SYSINFO, HDW_VER);
case VersionSystem: return (uintptr_t)(char*)__Bios(SYSINFO, PRODUCT);
case VersionFpga: return (uintptr_t)(char*)0;
case SerialNumber: return (uintptr_t)(uint32_t)__Bios(SYSINFO, PRDT_SN);
case LicenseNumber: return (uintptr_t)0;
case LicenseValid: return (uintptr_t)(uint32_t)__Bios(SYSINFO, LICENCE);
case DisplayType: return (uintptr_t)(char*)"ili9341";
case DiskType: return (uintptr_t)0;
case BatteryVoltage: return (uintptr_t)__Bios(PWRCTRL, VBTYmV);
// voltage in millivolts
// 2954 - empty, device unable to start, 3956 - fully charged
// 4000..4680 - charging
case Charging: return (uintptr_t)__Bios(PWRCTRL, VIN_ST);
case GpioStatus: return (uintptr_t)&gGpioStatusCode;
case GpioI2cSpeed: return (uintptr_t)&gGpioI2cSpeed;
case FlashReadRange: return (uintptr_t)gFlashReadRange;
case FlashWriteRange: return (uintptr_t)gFlashWriteRange;
case FlashAlertRange: return (uintptr_t)gFlashAlertRange;
case SystemRamBegin: return (uintptr_t)_addressRamBegin;
case SystemRamEnd: return (uintptr_t)_addressRamEnd;
case SystemRomBegin: return (uintptr_t)_addressRomBegin;
case SystemRomEnd: return (uintptr_t)_addressRamEnd;
case EndStack: return (uintptr_t)_estack;
default: return 0;
}
}
| 5,787 |
3,269 | # Time: O(n)
# Space: O(h)
class Node(object):
def __init__(self, val, children):
self.val = val
self.children = children
class Solution(object):
def maxDepth(self, root):
"""
:type root: Node
:rtype: int
"""
if not root:
return 0
depth = 0
for child in root.children:
depth = max(depth, self.maxDepth(child))
return 1+depth
| 217 |
831 | <reponame>qq1056779951/android<gh_stars>100-1000
/*
* Copyright (C) 2017 The Android Open Source Project
*
* 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.
*/
package com.android.tools.idea.actions;
import static com.intellij.openapi.actionSystem.LangDataKeys.MODULE;
import static com.intellij.openapi.actionSystem.LangDataKeys.MODULE_CONTEXT_ARRAY;
import com.android.ide.common.util.PathString;
import com.android.tools.idea.projectsystem.ProjectSystemUtil;
import com.android.tools.idea.util.FileExtensions;
import com.intellij.openapi.actionSystem.AnAction;
import com.intellij.openapi.actionSystem.AnActionEvent;
import com.intellij.openapi.actionSystem.DataContext;
import com.intellij.openapi.application.WriteAction;
import com.intellij.openapi.diagnostic.Logger;
import com.intellij.openapi.module.Module;
import com.intellij.openapi.vfs.VirtualFile;
import com.intellij.util.PlatformIcons;
import java.io.IOException;
import org.jetbrains.android.util.AndroidBundle;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
/**
* Action to create the main Sample Data directory
*/
public class CreateSampleDataDirectory extends AnAction {
private static final Logger LOG = Logger.getInstance(CreateSampleDataDirectory.class);
public CreateSampleDataDirectory() {
super(AndroidBundle.messagePointer("new.sampledata.dir.action.title"),
AndroidBundle.messagePointer("new.sampledata.dir.action.description"), PlatformIcons.FOLDER_ICON);
}
@Nullable
private static Module getModuleFromSelection(@NotNull DataContext dataContext) {
Module[] modules = MODULE_CONTEXT_ARRAY.getData(dataContext);
if (modules != null && modules.length > 0) {
return modules[0];
} else {
return MODULE.getData(dataContext);
}
}
private static boolean isActionVisibleForModule(@Nullable Module module) {
if (module == null) return false;
PathString sampleDataDirPath = ProjectSystemUtil.getModuleSystem(module).getSampleDataDirectory();
if (sampleDataDirPath == null) return false;
// Only display if the directory doesn't exist already
VirtualFile sampleDataDir = FileExtensions.toVirtualFile(sampleDataDirPath);
return sampleDataDir == null || !sampleDataDir.exists();
}
@Override
public void update(@NotNull AnActionEvent e) {
Module module = getModuleFromSelection(e.getDataContext());
e.getPresentation().setEnabledAndVisible(isActionVisibleForModule(module));
}
@Override
public void actionPerformed(@NotNull AnActionEvent e) {
Module module = getModuleFromSelection(e.getDataContext());
assert module != null; // Needs to exist or the action wouldn't be visible
try {
WriteAction.run(() -> ProjectSystemUtil.getModuleSystem(module).getOrCreateSampleDataDirectory());
} catch (IOException ex) {
LOG.warn("Unable to create sample data directory for module " + module.getName(), ex);
}
}
}
| 1,062 |
337 | <gh_stars>100-1000
//file
package demo;
class Test {
Test(int i) {
}
void test() {
byte b = 10;
new Test(b);
}
} | 60 |
393 | <filename>diffusion/models/models.py
from . import cc12m_1, danbooru_128, imagenet_128, wikiart_128, wikiart_256, yfcc_1, yfcc_2
models = {
'cc12m_1': cc12m_1.CC12M1Model,
'cc12m_1_cfg': cc12m_1.CC12M1Model,
'danbooru_128': danbooru_128.Danbooru128Model,
'imagenet_128': imagenet_128.ImageNet128Model,
'wikiart_128': wikiart_128.WikiArt128Model,
'wikiart_256': wikiart_256.WikiArt256Model,
'yfcc_1': yfcc_1.YFCC1Model,
'yfcc_2': yfcc_2.YFCC2Model,
}
def get_model(model):
return models[model]
def get_models():
return list(models.keys())
| 277 |
10,225 | <filename>extensions/vault/runtime/src/main/java/io/quarkus/vault/pki/CRLData.java
package io.quarkus.vault.pki;
import java.security.cert.CRLException;
import java.security.cert.X509CRL;
public interface CRLData {
/**
* Format of {@link #getData()} property.
*/
DataFormat getFormat();
/**
* Data in {@link DataFormat#PEM} or {@link DataFormat#DER} format.
*
* @see #getFormat()
*/
Object getData();
/**
* Parse and generate {@link java.security.cert.X509CRL} from {@link #getData()}.
*/
X509CRL getCRL() throws CRLException;
/**
* {@link DataFormat#DER} implementation of {@link CRLData}
*/
class DER implements CRLData {
private final byte[] derData;
public DER(byte[] derData) {
this.derData = derData;
}
@Override
public DataFormat getFormat() {
return DataFormat.DER;
}
@Override
public byte[] getData() {
return derData;
}
@Override
public X509CRL getCRL() throws CRLException {
return X509Parsing.parseDERCRL(derData);
}
}
/**
* {@link DataFormat#PEM} implementation of {@link CRLData}
*/
class PEM implements CRLData {
private final String pemData;
public PEM(String pemData) {
this.pemData = pemData;
}
@Override
public DataFormat getFormat() {
return DataFormat.PEM;
}
@Override
public String getData() {
return pemData;
}
@Override
public X509CRL getCRL() throws CRLException {
return X509Parsing.parsePEMCRL(pemData);
}
}
}
| 826 |
1,148 | #include<stdio.h>
#include<conio.h>
void main()
{
int a,b;
clrscr();
printf("Enter the first element: ");
scanf("%d",&a);
printf("Enter the second element: ");
scanf("%d",&b);
a=a+b;
b=a-b;
a=a-b;
printf("Element after swapping: \n");
printf("First element is %d",a);
printf("Second element is %d",b);
}
/*Swapping of element without third variable
I/O
Input:enter the first and second element
Output:Element are swapped are shown
Example:first element is:5
second element is:6
output=> first is 6
second is 5
Time Complexity:O(1);
Space Complexity:O(1);
*/
| 241 |
2,216 | <gh_stars>1000+
# Copyright (c) OpenMMLab. All rights reserved.
import mmcv
import numpy as np
import torch
from os import path as osp
from mmdet3d.core.bbox import DepthInstance3DBoxes
from mmdet3d.datasets.pipelines import Compose
def test_scannet_pipeline():
class_names = ('cabinet', 'bed', 'chair', 'sofa', 'table', 'door',
'window', 'bookshelf', 'picture', 'counter', 'desk',
'curtain', 'refrigerator', 'showercurtrain', 'toilet',
'sink', 'bathtub', 'garbagebin')
np.random.seed(0)
pipelines = [
dict(
type='LoadPointsFromFile',
coord_type='DEPTH',
shift_height=True,
load_dim=6,
use_dim=[0, 1, 2]),
dict(
type='LoadAnnotations3D',
with_bbox_3d=True,
with_label_3d=True,
with_mask_3d=True,
with_seg_3d=True),
dict(type='GlobalAlignment', rotation_axis=2),
dict(
type='PointSegClassMapping',
valid_cat_ids=(3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 24, 28, 33,
34, 36, 39)),
dict(type='PointSample', num_points=5),
dict(
type='RandomFlip3D',
sync_2d=False,
flip_ratio_bev_horizontal=1.0,
flip_ratio_bev_vertical=1.0),
dict(
type='GlobalRotScaleTrans',
rot_range=[-0.087266, 0.087266],
scale_ratio_range=[1.0, 1.0],
shift_height=True),
dict(type='DefaultFormatBundle3D', class_names=class_names),
dict(
type='Collect3D',
keys=[
'points', 'gt_bboxes_3d', 'gt_labels_3d', 'pts_semantic_mask',
'pts_instance_mask'
]),
]
pipeline = Compose(pipelines)
info = mmcv.load('./tests/data/scannet/scannet_infos.pkl')[0]
results = dict()
data_path = './tests/data/scannet'
results['pts_filename'] = osp.join(data_path, info['pts_path'])
if info['annos']['gt_num'] != 0:
scannet_gt_bboxes_3d = info['annos']['gt_boxes_upright_depth'].astype(
np.float32)
scannet_gt_labels_3d = info['annos']['class'].astype(np.long)
else:
scannet_gt_bboxes_3d = np.zeros((1, 6), dtype=np.float32)
scannet_gt_labels_3d = np.zeros((1, ), dtype=np.long)
results['ann_info'] = dict()
results['ann_info']['pts_instance_mask_path'] = osp.join(
data_path, info['pts_instance_mask_path'])
results['ann_info']['pts_semantic_mask_path'] = osp.join(
data_path, info['pts_semantic_mask_path'])
results['ann_info']['gt_bboxes_3d'] = DepthInstance3DBoxes(
scannet_gt_bboxes_3d, box_dim=6, with_yaw=False)
results['ann_info']['gt_labels_3d'] = scannet_gt_labels_3d
results['ann_info']['axis_align_matrix'] = \
info['annos']['axis_align_matrix']
results['img_fields'] = []
results['bbox3d_fields'] = []
results['pts_mask_fields'] = []
results['pts_seg_fields'] = []
results = pipeline(results)
points = results['points']._data
gt_bboxes_3d = results['gt_bboxes_3d']._data
gt_labels_3d = results['gt_labels_3d']._data
pts_semantic_mask = results['pts_semantic_mask']._data
pts_instance_mask = results['pts_instance_mask']._data
expected_points = torch.tensor(
[[1.8339e+00, 2.1093e+00, 2.2900e+00, 2.3895e+00],
[3.6079e+00, 1.4592e-01, 2.0687e+00, 2.1682e+00],
[4.1886e+00, 5.0614e+00, -1.0841e-01, -8.8736e-03],
[6.8790e+00, 1.5086e+00, -9.3154e-02, 6.3816e-03],
[4.8253e+00, 2.6668e-01, 1.4917e+00, 1.5912e+00]])
expected_gt_bboxes_3d = torch.tensor(
[[-1.1835, -3.6317, 1.8565, 1.7577, 0.3761, 0.5724, 0.0000],
[-3.1832, 3.2269, 1.5268, 0.6727, 0.2251, 0.6715, 0.0000],
[-0.9598, -2.2864, 0.6165, 0.7506, 2.5709, 1.2145, 0.0000],
[-2.6988, -2.7354, 0.9722, 0.7680, 1.8877, 0.2870, 0.0000],
[3.2989, 0.2885, 1.0712, 0.7600, 3.8814, 2.1603, 0.0000]])
expected_gt_labels_3d = np.array([
6, 6, 4, 9, 11, 11, 10, 0, 15, 17, 17, 17, 3, 12, 4, 4, 14, 1, 0, 0, 0,
0, 0, 0, 5, 5, 5
])
expected_pts_semantic_mask = np.array([0, 18, 18, 18, 18])
expected_pts_instance_mask = np.array([44, 22, 10, 10, 57])
assert torch.allclose(points, expected_points, 1e-2)
assert torch.allclose(gt_bboxes_3d.tensor[:5, :], expected_gt_bboxes_3d,
1e-2)
assert np.all(gt_labels_3d.numpy() == expected_gt_labels_3d)
assert np.all(pts_semantic_mask.numpy() == expected_pts_semantic_mask)
assert np.all(pts_instance_mask.numpy() == expected_pts_instance_mask)
def test_scannet_seg_pipeline():
class_names = ('wall', 'floor', 'cabinet', 'bed', 'chair', 'sofa', 'table',
'door', 'window', 'bookshelf', 'picture', 'counter', 'desk',
'curtain', 'refrigerator', 'showercurtrain', 'toilet',
'sink', 'bathtub', 'otherfurniture')
np.random.seed(0)
pipelines = [
dict(
type='LoadPointsFromFile',
coord_type='DEPTH',
shift_height=False,
use_color=True,
load_dim=6,
use_dim=[0, 1, 2, 3, 4, 5]),
dict(
type='LoadAnnotations3D',
with_bbox_3d=False,
with_label_3d=False,
with_mask_3d=False,
with_seg_3d=True),
dict(
type='PointSegClassMapping',
valid_cat_ids=(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 24,
28, 33, 34, 36, 39),
max_cat_id=40),
dict(
type='IndoorPatchPointSample',
num_points=5,
block_size=1.5,
ignore_index=len(class_names),
use_normalized_coord=True,
enlarge_size=0.2,
min_unique_num=None),
dict(type='NormalizePointsColor', color_mean=None),
dict(type='DefaultFormatBundle3D', class_names=class_names),
dict(type='Collect3D', keys=['points', 'pts_semantic_mask'])
]
pipeline = Compose(pipelines)
info = mmcv.load('./tests/data/scannet/scannet_infos.pkl')[0]
results = dict()
data_path = './tests/data/scannet'
results['pts_filename'] = osp.join(data_path, info['pts_path'])
results['ann_info'] = dict()
results['ann_info']['pts_semantic_mask_path'] = osp.join(
data_path, info['pts_semantic_mask_path'])
results['pts_seg_fields'] = []
results = pipeline(results)
points = results['points']._data
pts_semantic_mask = results['pts_semantic_mask']._data
# build sampled points
scannet_points = np.fromfile(
osp.join(data_path, info['pts_path']), dtype=np.float32).reshape(
(-1, 6))
scannet_choices = np.array([87, 34, 58, 9, 18])
scannet_center = np.array([-2.1772466, -3.4789145, 1.242711])
scannet_center[2] = 0.0
scannet_coord_max = np.amax(scannet_points[:, :3], axis=0)
expected_points = np.concatenate([
scannet_points[scannet_choices, :3] - scannet_center,
scannet_points[scannet_choices, 3:] / 255.,
scannet_points[scannet_choices, :3] / scannet_coord_max
],
axis=1)
expected_pts_semantic_mask = np.array([13, 13, 12, 2, 0])
assert np.allclose(points.numpy(), expected_points, atol=1e-6)
assert np.all(pts_semantic_mask.numpy() == expected_pts_semantic_mask)
def test_s3dis_seg_pipeline():
class_names = ('ceiling', 'floor', 'wall', 'beam', 'column', 'window',
'door', 'table', 'chair', 'sofa', 'bookcase', 'board',
'clutter')
np.random.seed(0)
pipelines = [
dict(
type='LoadPointsFromFile',
coord_type='DEPTH',
shift_height=False,
use_color=True,
load_dim=6,
use_dim=[0, 1, 2, 3, 4, 5]),
dict(
type='LoadAnnotations3D',
with_bbox_3d=False,
with_label_3d=False,
with_mask_3d=False,
with_seg_3d=True),
dict(
type='PointSegClassMapping',
valid_cat_ids=tuple(range(len(class_names))),
max_cat_id=13),
dict(
type='IndoorPatchPointSample',
num_points=5,
block_size=1.0,
ignore_index=len(class_names),
use_normalized_coord=True,
enlarge_size=0.2,
min_unique_num=None),
dict(type='NormalizePointsColor', color_mean=None),
dict(type='DefaultFormatBundle3D', class_names=class_names),
dict(type='Collect3D', keys=['points', 'pts_semantic_mask'])
]
pipeline = Compose(pipelines)
info = mmcv.load('./tests/data/s3dis/s3dis_infos.pkl')[0]
results = dict()
data_path = './tests/data/s3dis'
results['pts_filename'] = osp.join(data_path, info['pts_path'])
results['ann_info'] = dict()
results['ann_info']['pts_semantic_mask_path'] = osp.join(
data_path, info['pts_semantic_mask_path'])
results['pts_seg_fields'] = []
results = pipeline(results)
points = results['points']._data
pts_semantic_mask = results['pts_semantic_mask']._data
# build sampled points
s3dis_points = np.fromfile(
osp.join(data_path, info['pts_path']), dtype=np.float32).reshape(
(-1, 6))
s3dis_choices = np.array([87, 37, 60, 18, 31])
s3dis_center = np.array([2.691, 2.231, 3.172])
s3dis_center[2] = 0.0
s3dis_coord_max = np.amax(s3dis_points[:, :3], axis=0)
expected_points = np.concatenate([
s3dis_points[s3dis_choices, :3] - s3dis_center,
s3dis_points[s3dis_choices, 3:] / 255.,
s3dis_points[s3dis_choices, :3] / s3dis_coord_max
],
axis=1)
expected_pts_semantic_mask = np.array([0, 1, 0, 8, 0])
assert np.allclose(points.numpy(), expected_points, atol=1e-6)
assert np.all(pts_semantic_mask.numpy() == expected_pts_semantic_mask)
def test_sunrgbd_pipeline():
class_names = ('bed', 'table', 'sofa', 'chair', 'toilet', 'desk',
'dresser', 'night_stand', 'bookshelf', 'bathtub')
np.random.seed(0)
pipelines = [
dict(
type='LoadPointsFromFile',
coord_type='DEPTH',
shift_height=True,
load_dim=6,
use_dim=[0, 1, 2]),
dict(type='LoadAnnotations3D'),
dict(
type='RandomFlip3D',
sync_2d=False,
flip_ratio_bev_horizontal=1.0,
),
dict(
type='GlobalRotScaleTrans',
rot_range=[-0.523599, 0.523599],
scale_ratio_range=[0.85, 1.15],
shift_height=True),
dict(type='PointSample', num_points=5),
dict(type='DefaultFormatBundle3D', class_names=class_names),
dict(
type='Collect3D', keys=['points', 'gt_bboxes_3d', 'gt_labels_3d']),
]
pipeline = Compose(pipelines)
results = dict()
info = mmcv.load('./tests/data/sunrgbd/sunrgbd_infos.pkl')[0]
data_path = './tests/data/sunrgbd'
results['pts_filename'] = osp.join(data_path, info['pts_path'])
if info['annos']['gt_num'] != 0:
gt_bboxes_3d = info['annos']['gt_boxes_upright_depth'].astype(
np.float32)
gt_labels_3d = info['annos']['class'].astype(np.long)
else:
gt_bboxes_3d = np.zeros((1, 7), dtype=np.float32)
gt_labels_3d = np.zeros((1, ), dtype=np.long)
# prepare input of pipeline
results['ann_info'] = dict()
results['ann_info']['gt_bboxes_3d'] = DepthInstance3DBoxes(gt_bboxes_3d)
results['ann_info']['gt_labels_3d'] = gt_labels_3d
results['img_fields'] = []
results['bbox3d_fields'] = []
results['pts_mask_fields'] = []
results['pts_seg_fields'] = []
results = pipeline(results)
points = results['points']._data
gt_bboxes_3d = results['gt_bboxes_3d']._data
gt_labels_3d = results['gt_labels_3d']._data
expected_points = torch.tensor([[0.8678, 1.3470, 0.1105, 0.0905],
[0.8707, 1.3635, 0.0437, 0.0238],
[0.8636, 1.3511, 0.0504, 0.0304],
[0.8690, 1.3461, 0.1265, 0.1065],
[0.8668, 1.3434, 0.1216, 0.1017]])
expected_gt_bboxes_3d = torch.tensor(
[[-1.2136, 4.0206, -0.2412, 2.2493, 1.8444, 1.9245, 1.3989],
[-2.7420, 4.5777, -0.7686, 0.5718, 0.8629, 0.9510, 1.4446],
[0.9729, 1.9087, -0.1443, 0.6965, 1.5273, 2.0563, 2.9924]])
expected_gt_labels_3d = np.array([0, 7, 6])
assert torch.allclose(gt_bboxes_3d.tensor, expected_gt_bboxes_3d, 1e-3)
assert np.allclose(gt_labels_3d.flatten(), expected_gt_labels_3d)
assert torch.allclose(points, expected_points, 1e-2)
| 6,831 |
471 | from django.core.management import BaseCommand
class Command(BaseCommand):
"""
Set cleanliness flags for a domain, or for all domains
"""
def add_arguments(self, parser):
parser.add_argument(
'domain',
nargs='?',
)
parser.add_argument(
'--force',
action='store_true',
dest='force',
default=False,
help="Force rebuild on top of existing flags/hints.",
)
def handle(self, domain, **options):
from casexml.apps.phone.cleanliness import (
set_cleanliness_flags_for_domain, set_cleanliness_flags_for_all_domains)
force_full = options['force']
if domain:
set_cleanliness_flags_for_domain(domain, force_full=force_full)
else:
set_cleanliness_flags_for_all_domains(force_full=force_full)
| 403 |
3,102 | <filename>clang/test/Analysis/diagnostics/dtors.cpp
// RUN: %clang_analyze_cc1 -std=c++14 -w -analyzer-checker=core,cplusplus -analyzer-output=text -verify %s
namespace no_crash_on_delete_dtor {
// We were crashing when producing diagnostics for this code, but not for the
// report that it currently emits. Instead, Static Analyzer was thinking that
// p.get()->foo() is a null dereference because it was dropping
// constraints over x too early and took a different branch next time
// we call .get().
struct S {
void foo();
~S();
};
struct smart_ptr {
int x;
S *s;
smart_ptr(S *);
S *get() {
return (x || 0) ? nullptr : s; // expected-note{{Field 'x' is 0}}
// expected-note@-1{{Left side of '||' is false}}
// expected-note@-2{{'?' condition is false}}
// expected-warning@-3{{Use of memory after it is freed}}
// expected-note@-4{{Use of memory after it is freed}}
}
};
void bar(smart_ptr p) {
delete p.get(); // expected-note{{Memory is released}}
p.get()->foo(); // expected-note{{Calling 'smart_ptr::get'}}
}
} // namespace no_crash_on_delete_dtor
| 504 |
1,738 | /*
* All or portions of this file Copyright (c) Amazon.com, Inc. or its affiliates or
* its licensors.
*
* For complete copyright and license terms please see the LICENSE at the root of this
* distribution (the "License"). All use of this software is governed by the License,
* or, if provided, by the license below or the license accompanying this file. Do not
* remove or modify any license notices. This file is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
*/
#ifndef DRILLER_CUSTOMIZECSVEXPORTWIDGET_H
#define DRILLER_CUSTOMIZECSVEXPORTWIDGET_H
#include <AzCore/base.h>
#include <AzCore/Memory/SystemAllocator.h>
#pragma once
#include <QtWidgets/QWidget>
namespace Driller
{
class CSVExportSettings;
class CustomizeCSVExportWidget : public QWidget
{
Q_OBJECT
public:
CustomizeCSVExportWidget(CSVExportSettings& customSettings, QWidget* parent);
virtual ~CustomizeCSVExportWidget();
virtual void FinalizeSettings() = 0;
CSVExportSettings* GetExportSettings() const;
public slots:
void OnShouldExportStateDescriptorChecked(int);
protected:
CSVExportSettings& m_exportSettings;
};
}
#endif | 426 |
488 | #ifndef MRSH_GETOPT_H
#define MRSH_GETOPT_H
extern char *_mrsh_optarg;
extern int _mrsh_opterr, _mrsh_optind, _mrsh_optopt;
int _mrsh_getopt(int argc, char * const argv[], const char *optstring);
#endif
| 96 |
675 | #include "box2d_shape_circle.h"
#include "box2d_module.h"
namespace Echo
{
Box2DShapeCircle::Box2DShapeCircle()
{
}
Box2DShapeCircle::~Box2DShapeCircle()
{
}
void Box2DShapeCircle::bindMethods()
{
CLASS_BIND_METHOD(Box2DShapeCircle, getRadius);
CLASS_BIND_METHOD(Box2DShapeCircle, setRadius);
CLASS_REGISTER_PROPERTY(Box2DShapeCircle, "Radius", Variant::Type::Real, getRadius, setRadius);
}
float Box2DShapeCircle::getRadius() const
{
return m_radius;
}
void Box2DShapeCircle::setRadius(float radius)
{
m_radius = radius;
b2CircleShape* shape = getb2Shape<b2CircleShape*>();
if (shape)
{
shape->m_radius = radius / Box2DModule::instance()->getPixelsPerMeter();
}
}
b2Shape* Box2DShapeCircle::createb2Shape()
{
float pixelsPerUnit = Box2DModule::instance()->getPixelsPerMeter();
b2CircleShape* shape = EchoNew(b2CircleShape);
shape->m_radius = m_radius / pixelsPerUnit;
//shape->m_p = b2Vec2(getWorldPosition().x / pixelsPerUnit, getWorldPosition().y / pixelsPerUnit);
return shape;
}
}
| 452 |
5,168 | /**
* \file src/core/include/megbrain/utils/json.h
* MegEngine is Licensed under the Apache License, Version 2.0 (the "License")
*
* Copyright (c) 2014-2021 Megvii Inc. All rights reserved.
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT ARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#pragma once
#include "megbrain/common.h"
#include "megbrain/utils/hash.h"
#include "megbrain/utils/metahelper.h"
#if MGB_ENABLE_JSON
#include <memory>
#include <unordered_map>
#include <vector>
namespace mgb {
namespace json {
class Value : public std::enable_shared_from_this<Value>, public DynTypeObj {
public:
virtual void writeto(std::string& fout, int indent = 0) const = 0;
void writeto_fpath(const std::string& fout_path, int indent = 0) const {
writeto_fpath(fout_path.c_str(), indent);
}
void writeto_fpath(const char* fout_path, int indent = 0) const;
virtual std::string to_string(int indent = 0) const final;
virtual ~Value() = default;
};
class Number final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
double m_val;
public:
Number(double v) : m_val(v) {}
static std::shared_ptr<Number> make(double v) {
return std::make_shared<Number>(v);
}
void writeto(std::string& fout, int indent = 0) const override;
auto&& get_impl() { return m_val; }
auto&& get_impl() const { return m_val; }
};
class NumberInt final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
int64_t m_val;
public:
NumberInt(int64_t v) : m_val(v) {}
static std::shared_ptr<NumberInt> make(int64_t v) {
return std::make_shared<NumberInt>(v);
}
void writeto(std::string& fout, int indent = 0) const override;
auto&& get_impl() { return m_val; }
auto&& get_impl() const { return m_val; }
};
class Bool final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
bool m_val;
public:
Bool(bool v) : m_val(v) {}
static std::shared_ptr<Bool> make(bool v);
void writeto(std::string& fout, int indent = 0) const override;
auto&& get_impl() { return m_val; }
auto&& get_impl() const { return m_val; }
};
class String final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
std::string m_val;
public:
String(const std::string& v) : m_val(v) {}
String(char const* v) : m_val(v) {}
static std::shared_ptr<String> make(const std::string& v) {
return std::make_shared<String>(v);
}
bool operator==(const String& rhs) const { return m_val == rhs.m_val; }
void writeto(std::string& fout, int indent = 0) const override;
auto&& get_impl() { return m_val; }
auto&& get_impl() const { return m_val; }
};
class Object final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
std::unordered_map<String, std::shared_ptr<Value>, StdHashAdaptor<String>> m_val;
public:
static std::shared_ptr<Object> make() { return std::make_shared<Object>(); }
static std::shared_ptr<Object> make(
const std::vector<std::pair<String, std::shared_ptr<Value>>>& val) {
for (auto&& i : val)
mgb_assert(i.second);
auto rst = make();
rst->m_val.insert(val.begin(), val.end());
return rst;
}
std::shared_ptr<Value>& operator[](const String& s) { return m_val[s]; }
std::shared_ptr<Value>& operator[](const std::string& s) { return m_val[s]; }
std::shared_ptr<Value>& operator[](const char* s) { return m_val[std::string(s)]; }
void writeto(std::string& fout, int indent = 0) const override;
auto&& get_impl() { return m_val; }
auto&& get_impl() const { return m_val; }
};
class Array final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
std::vector<std::shared_ptr<Value>> m_val;
public:
static std::shared_ptr<Array> make() { return std::make_shared<Array>(); }
void add(std::shared_ptr<Value> val) {
mgb_assert(val);
m_val.emplace_back(std::move(val));
}
std::shared_ptr<Value>& operator[](size_t idx) { return m_val.at(idx); }
void writeto(std::string& fout, int indent = 0) const override;
auto&& get_impl() { return m_val; }
auto&& get_impl() const { return m_val; }
};
class Null final : public Value {
MGB_DYN_TYPE_OBJ_FINAL_DECL;
public:
static std::shared_ptr<Value> make() {
static std::shared_ptr<Null> v(new Null);
return v;
}
void writeto(std::string& fout, int /*indent*/) const override;
};
class Serializable {
public:
/*!
* \brief dump internal state as json value
*/
virtual std::shared_ptr<Value> to_json() const = 0;
virtual ~Serializable() = default;
};
} // namespace json
template <>
struct HashTrait<json::String> {
static size_t eval(const json::String& s) { return hash(s.get_impl()); }
};
} // namespace mgb
#else
namespace mgb {
namespace json {
class Serializable {};
} // namespace json
} // namespace mgb
#endif // MGB_ENABLE_JSON
// vim: syntax=cpp.doxygen foldmethod=marker foldmarker=f{{{,f}}}
| 2,030 |
348 | {"nom":"Saint-Eloi","circ":"1ère circonscription","dpt":"Creuse","inscrits":167,"abs":72,"votants":95,"blancs":19,"nuls":4,"exp":72,"res":[{"nuance":"REM","nom":"<NAME>","voix":52},{"nuance":"LR","nom":"<NAME>","voix":20}]} | 89 |
434 | <reponame>HungMingWu/librf<gh_stars>100-1000
#pragma once
#if ASIO_VERSION >= 101200
#include "asio_task_1.12.0.inl"
#else
#include "asio_task_1.10.0.inl"
#endif
| 83 |
724 | /* register invoke and init handler.
*/
#include "echo_handler.h"
#include "entrypoint.h"
using namespace Aliyun::FC::Handlers;
void SetInvokeAndInitHander()
{
CustomRuntimeHandler::httpHandler = new EchoHttpHandler();
} | 70 |
1,831 | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#pragma once
#include "logdevice/common/Request.h"
#include "logdevice/common/protocol/FixedSizeMessage.h"
#include "logdevice/common/protocol/MessageType.h"
namespace facebook { namespace logdevice {
/**
* @file Message sent by a client to a node of the cluster to get its view of
* the cluster state, such as the list of dead nodes.
*/
struct GET_CLUSTER_STATE_Header {
request_id_t client_rqid;
} __attribute__((__packed__));
using GET_CLUSTER_STATE_Message =
FixedSizeMessage<GET_CLUSTER_STATE_Header,
MessageType::GET_CLUSTER_STATE,
TrafficClass::FAILURE_DETECTOR>;
}} // namespace facebook::logdevice
| 312 |
311 | package org.thunlp.tagsuggest.dataset;
import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Random;
import java.util.logging.Logger;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.io.Text;
import org.apache.hadoop.mapred.JobClient;
import org.apache.hadoop.mapred.JobConf;
import org.apache.hadoop.mapred.Mapper;
import org.apache.hadoop.mapred.OutputCollector;
import org.apache.hadoop.mapred.Reducer;
import org.apache.hadoop.mapred.Reporter;
import org.thunlp.hadoop.MapReduceHelper;
import org.thunlp.html.HtmlReformatter;
import org.thunlp.io.JsonUtil;
import org.thunlp.language.chinese.ForwardMaxWordSegment;
import org.thunlp.language.chinese.LangUtils;
import org.thunlp.language.chinese.WordSegment;
import org.thunlp.misc.Flags;
import org.thunlp.misc.StringUtil;
import org.thunlp.tagsuggest.common.Post;
import org.thunlp.text.Lexicon;
import org.thunlp.tool.GenericTool;
/**
* Make training data for tag LDA model.
* This tool runs as a Hadoop MapReduce program.
* @author sixiance
*
*/
public class MakeDistTagLDAInput implements GenericTool {
private static Logger LOG = Logger.getAnonymousLogger();
Flags flags = new Flags();
@Override
public void run(String[] args) throws Exception {
parseFlags(args);
convert();
}
private void parseFlags(String[] args) {
flags.add("input");
flags.add("output");
flags.add("lexicon_dir", "This should on a shared volume, such as /global");
flags.addWithDefaultValue("min_freq", "100");
flags.addWithDefaultValue("sample_rate", "0.2");
flags.parseAndCheck(args);
}
private void convert() throws IOException {
JobConf job = new JobConf(this.getClass());
job.setJobName("make-dist-taglda-input");
MapReduceHelper.setAllOutputTypes(job, Text.class);
MapReduceHelper.SetSeqFileInputOutput(
job, flags.getString("input"), new Path(flags.getString("output")));
MapReduceHelper.setMR(job, MakeInputMapper.class, MakeInputReducer.class);
flags.saveToJobConf(job);
JobClient.runJob(job);
}
public static class MakeInputMapper
implements Mapper<Text, Text, Text, Text> {
Text outkey = new Text();
Text outvalue = new Text();
Lexicon l = null;
Flags flags = new Flags();
WordSegment seg = null;
JsonUtil J = new JsonUtil();
Random random = new Random();
double sampleRate = 0;
public void configure(JobConf job) {
flags.loadFromJobConf(job);
l = new Lexicon();
try {
seg = new ForwardMaxWordSegment();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
sampleRate = flags.getDouble("sample_rate");
}
private String clean(String text) {
text = HtmlReformatter.getPlainText(text);
text = LangUtils.removePunctuationMarks(text);
text = LangUtils.removeLineEnds(text);
text = LangUtils.removeExtraSpaces(text);
text = LangUtils.T2S(text);
return text;
}
public void map(Text key, Text value,
OutputCollector<Text, Text> collector, Reporter r) throws IOException {
Post p = J.fromTextAsJson(value, Post.class);
List<String> tokens = new ArrayList<String>();
String [] words = null;
words = seg.segment(clean(p.getTitle()));
for (String word : words) {
if (org.thunlp.language.chinese.Stopwords.isStopword(word))
continue;
tokens.add(word);
}
words = seg.segment(clean(p.getContent()));
for (String word : words) {
if (org.thunlp.language.chinese.Stopwords.isStopword(word))
continue;
tokens.add(word);
}
for (String tag : p.getTags()) {
tokens.add("_" + tag);
}
l.addDocument(tokens.toArray(new String[tokens.size()]));
value.set(StringUtil.join(tokens, " "));
collector.collect(key, value);
}
public void close() {
l.saveToFile(new File(
flags.getString("lexicon_dir") + "/" + random.nextInt()));
LOG.info("Lexicon saved");
}
}
public static class MakeInputReducer
implements Reducer<Text, Text, Text, Text> {
Text outkey = new Text();
Text outvalue = new Text();
Flags flags = new Flags();
Lexicon l = null;
public void configure(JobConf job) {
flags.loadFromJobConf(job);
loadAndCombineLexicons(flags.getString("lexicon_dir"));
}
private void loadAndCombineLexicons(String lexiconDirPath) {
File lexiconDir = new File(lexiconDirPath);
if (!lexiconDir.isDirectory()) {
throw new RuntimeException(
"lexicon dir " + lexiconDirPath + " is not a directory");
}
File [] files = lexiconDir.listFiles();
l = new Lexicon();
for (File f : files) {
Lexicon tl = new Lexicon();
tl.loadFromFile(f);
l.mergeFrom(tl);
LOG.info("Merging from " + f);
}
LOG.info("Merged lexicon from " + files.length + " files");
LOG.info("BEFORE num_doc:" + l.getNumDocs() + " words:" + l.getSize());
l = l.removeLowDfWords(flags.getInt("min_freq"));
LOG.info("AFTER num_doc:" + l.getNumDocs() + " words:" + l.getSize());
}
public void reduce(Text key, Iterator<Text> values,
OutputCollector<Text, Text> collector, Reporter r) throws IOException {
List<String> selected = new ArrayList<String>();
while (values.hasNext()) {
Text value = values.next();
String [] tokens = value.toString().split(" ");
boolean hasTag = false;
selected.clear();
for (String token : tokens) {
if (l.getWord(token) != null) {
selected.add(token);
if (token.startsWith("_"))
hasTag = true;
}
}
if (hasTag) {
value.set(StringUtil.join(selected, " "));
collector.collect(key, value);
}
}
}
public void close() {
}
}
}
| 2,492 |
679 | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 DBAUI_CONNECTIONHELPER_HXX
#define DBAUI_CONNECTIONHELPER_HXX
#ifndef _DBAUI_ADMINPAGES_HXX_
#include "adminpages.hxx"
#endif
#ifndef _UCBHELPER_CONTENT_HXX
#include <ucbhelper/content.hxx>
#endif
#ifndef _DBAUI_CURLEDIT_HXX_
#include "curledit.hxx"
#endif
#ifndef _SFX_FILEDLGHELPER_HXX
#include <sfx2/filedlghelper.hxx>
#endif
#define FILL_STRING_ITEM(editcontrol, itemset, itemid, modifiedflag) \
if (editcontrol.GetText() != editcontrol.GetSavedValue()) \
{ \
itemset.Put(SfxStringItem(itemid, editcontrol.GetText())); \
modifiedflag = sal_True; \
}
//.........................................................................
namespace dbaui
{
//.........................................................................
// #106016# --------------
enum IS_PATH_EXIST
{
PATH_NOT_EXIST = 0,
PATH_EXIST,
PATH_NOT_KNOWN
};
class IDatabaseSettingsDialog;
class OConnectionHelper : public OGenericAdministrationPage
{
sal_Bool m_bUserGrabFocus : 1;
public:
OConnectionHelper( Window* pParent, const ResId& _rId, const SfxItemSet& _rCoreAttrs);
virtual ~OConnectionHelper();
FixedText m_aFT_Connection;
OConnectionURLEdit m_aConnectionURL;
PushButton m_aPB_Connection;
::rtl::OUString m_eType; // the type can't be changed in this class, so we hold it as member.
public:
// setting/retrieving the current connection URL
// necessary because for some types, the URL must be decoded for display purposes
::dbaccess::ODsnTypeCollection* m_pCollection; /// the DSN type collection instance
virtual long PreNotify( NotifyEvent& _rNEvt );
// <method>OGenericAdministrationPage::fillControls</method>
virtual void fillControls(::std::vector< ISaveValueWrapper* >& _rControlList);
// <method>OGenericAdministrationPage::fillWindows</method>
virtual void fillWindows(::std::vector< ISaveValueWrapper* >& _rControlList);
virtual void implInitControls(const SfxItemSet& _rSet, sal_Bool _bSaveValue);
// setting/retrieving the current connection URL
// necessary because for some types, the URL must be decoded for display purposes
//String getURL( OConnectionURLEdit* _m_pConnection ) const;
//void setURL( const String& _rURL, OConnectionURLEdit* _m_pConnection );
String getURLNoPrefix( ) const;
void setURLNoPrefix( const String& _rURL );
/** checks if the path is existence
@param _rURL
The URL to check.
*/
sal_Int32 checkPathExistence(const String& _rURL);
IS_PATH_EXIST pathExists(const ::rtl::OUString& _rURL, sal_Bool bIsFile) const;
sal_Bool createDirectoryDeep(const String& _rPathNormalized);
sal_Bool commitURL();
/** opens the FileOpen dialog and asks for a FileName
@param _aFileOpen
Executes the file open dialog, which must be filled from caller.
*/
void askForFileName(::sfx2::FileDialogHelper& _aFileOpen);
virtual void SetServiceFactory(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > _rxORB)
{
OGenericAdministrationPage::SetServiceFactory(_rxORB);
}
protected:
void setURL( const String& _rURL );
virtual bool checkTestConnection();
private:
DECL_LINK(OnBrowseConnections, PushButton*);
StringBag getInstalledAdabasDBDirs(const String &_rPath,const ::ucbhelper::ResultSetInclude& _reResultSetInclude);
StringBag getInstalledAdabasDBs(const String &_rConfigDir,const String &_rWorkDir);
String impl_getURL( sal_Bool _bPrefix ) const;
void impl_setURL( const String& _rURL, sal_Bool _bPrefix );
void implUpdateURLDependentStates() const;
};
//.........................................................................
} // namespace dbaui
//.........................................................................
#endif // DBAUI_CONNECTIONHELPER_HXX
| 1,694 |
1,118 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <traildb.h>
int main(int argc, char **argv)
{
const char *fields[] = {"username", "action"};
tdb_error err;
tdb_cons* cons = tdb_cons_init();
if ((err = tdb_cons_open(cons, "tiny", fields, 2))){
printf("Opening TrailDB constructor failed: %s\n", tdb_error_str(err));
exit(1);
}
static char username[6];
static uint8_t uuid[16];
const char *EVENTS[] = {"open", "save", "close"};
uint32_t i, j;
/* create three users */
for (i = 0; i < 3; i++){
memcpy(uuid, &i, 4);
sprintf(username, "user%d", i);
/* every user has three events */
for (j = 0; j < 3; j++){
const char *values[] = {username, EVENTS[j]};
uint64_t lengths[] = {strlen(username), strlen(EVENTS[j])};
/* generate a dummy timestamp */
uint64_t timestamp = i * 10 + j;
if ((err = tdb_cons_add(cons, uuid, timestamp, values, lengths))){
printf("Adding an event failed: %s\n", tdb_error_str(err));
exit(1);
}
}
}
/* finalize the TrailDB */
if ((err = tdb_cons_finalize(cons))){
printf("Closing TrailDB constructor failed: %s\n", tdb_error_str(err));
exit(1);
}
tdb_cons_close(cons);
/* open the newly created TrailDB and print out its contents */
tdb* db = tdb_init();
if ((err = tdb_open(db, "tiny"))){
printf("Opening TrailDB failed: %s\n", tdb_error_str(err));
exit(1);
}
tdb_cursor *cursor = tdb_cursor_new(db);
/* loop over all trails */
for (i = 0; i < tdb_num_trails(db); i++){
const tdb_event *event;
uint8_t hexuuid[32];
tdb_uuid_hex(tdb_get_uuid(db, i), hexuuid);
printf("%.32s ", hexuuid);
tdb_get_trail(cursor, i);
/* loop over all events of this trail */
while ((event = tdb_cursor_next(cursor))){
printf("[ timestamp=%llu", event->timestamp);
for (j = 0; j < event->num_items; j++){
uint64_t len;
const char *val = tdb_get_item_value(db, event->items[j], &len);
printf(" %s=%.*s", fields[j], len, val);
}
printf(" ] ");
}
printf("\n");
}
tdb_cursor_free(cursor);
tdb_close(db);
return 0;
}
| 1,185 |
684 | <gh_stars>100-1000
/* 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.
*/
package org.activiti.bpmn.converter.parser;
import javax.xml.stream.XMLStreamReader;
import org.activiti.bpmn.constants.BpmnXMLConstants;
import org.activiti.bpmn.converter.util.BpmnXMLUtil;
import org.activiti.bpmn.model.BpmnModel;
import org.activiti.bpmn.model.Message;
import org.apache.commons.lang3.StringUtils;
/**
* @author <NAME>
*/
public class MessageParser implements BpmnXMLConstants {
public void parse(XMLStreamReader xtr, BpmnModel model) throws Exception {
if (StringUtils.isNotEmpty(xtr.getAttributeValue(null, ATTRIBUTE_ID))) {
String messageId = xtr.getAttributeValue(null, ATTRIBUTE_ID);
String messageName = xtr.getAttributeValue(null, ATTRIBUTE_NAME);
String itemRef = parseItemRef(xtr.getAttributeValue(null, ATTRIBUTE_ITEM_REF), model);
Message message = new Message(messageId, messageName, itemRef);
BpmnXMLUtil.addXMLLocation(message, xtr);
BpmnXMLUtil.parseChildElements(ELEMENT_MESSAGE, message, xtr, model);
model.addMessage(message);
}
}
protected String parseItemRef(String itemRef, BpmnModel model) {
String result = null;
if (StringUtils.isNotEmpty(itemRef)) {
int indexOfP = itemRef.indexOf(':');
if (indexOfP != -1) {
String prefix = itemRef.substring(0, indexOfP);
String resolvedNamespace = model.getNamespace(prefix);
result = resolvedNamespace + ":" + itemRef.substring(indexOfP + 1);
} else {
result = itemRef;
}
}
return result;
}
}
| 764 |
461 | from scapy.all import arpcachepoison, conf
import ipaddress
conf.verb = 0
def arpoison(target1, target2, interval=5):
try:
ipaddress.ip_address(target1)
ipaddress.ip_address(target2)
except ValueError:
print("Bad IP address")
return 1
arpcachepoison(target1, target2, interval)
if __name__ == '__main__':
pass
| 151 |
411 | class Get {
int get(int a[], int j) {
for(int i = 0; i < 4; i++) a[i] = i;
return a[j];
}
}
| 67 |
3,978 | <filename>XCL-Charts-demo/src/com/demo/xclcharts/MainActivity.java
/**
* Copyright 2014 XCL-Charts
*
* 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.
*
* @Project XCL-Charts
* @Description Android图表基类库演示
* @author XiongChuanLiang<br/>(<EMAIL>)
* @license http://www.apache.org/licenses/ Apache v2 License
* @version 1.0
*/
package com.demo.xclcharts;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import android.app.Activity;
import android.content.Intent;
import android.net.Uri;
import android.os.Bundle;
import android.view.Menu;
import android.view.MenuItem;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.LinearLayout;
import android.widget.ListView;
import android.widget.SimpleAdapter;
/**
* @ClassName MainActivity
* @Description XCL-Charts图表库展示列表页
* @author XiongChuanLiang<br/>(<EMAIL>)
*/
public class MainActivity extends Activity {
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
ListView mListView = new ListView(this);
SimpleAdapter adapter = new SimpleAdapter(this, getData(),
android.R.layout.simple_list_item_2,
new String[] { "title","description" },
new int[] { android.R.id.text1, android.R.id.text2 });
mListView.setAdapter(adapter);
final LinearLayout layout =new LinearLayout(this);
layout.setOrientation(LinearLayout.VERTICAL);
layout.addView(mListView);
setContentView(layout);
setTitle("XCL-Charts demo");
OnItemClickListener listener = new OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> parent,
android.view.View view, int position, long id) {
// TODO Auto-generated method stub
String chartsTitleCurr[] = getResources().getStringArray(R.array.chartsTitle);
if(position > chartsTitleCurr.length - 1) return;
Bundle bundleSimple = new Bundle();
Intent intent = new Intent();
bundleSimple.putString("title", chartsTitleCurr[position]);
int id_desc_3_4 = chartsTitleCurr.length - 4;
if(position == chartsTitleCurr.length - 1) //倒数1 仪表盘
{
intent.setClass(MainActivity.this,GaugeChartActivity.class);
}else if(position == chartsTitleCurr.length - 2) //倒数2 圆/半圆图
{
intent.setClass(MainActivity.this,CircleChartActivity.class);
//}else if(position >= id_desc_1_2_3) //倒数1,2,3 seekbar图
//{
// position = chartsTitleCurr.length - 1 - position;
// intent.setClass(MainActivity.this,SeekBarActivity.class);
}else if(position >= id_desc_3_4) //倒数3,4 同源汇总图
{
position = chartsTitleCurr.length - 3 - position;
intent.setClass(MainActivity.this,SpinnerActivity.class);
}else if(position >= chartsTitleCurr.length - 5) //倒数5 scroll view line
{
intent.setClass(MainActivity.this,HLNScrollActivity.class);
}else if(position >= chartsTitleCurr.length - 6) //倒数6 scroll view bar
{
intent.setClass(MainActivity.this,HBARScrollActivity.class);
}else if(position >= chartsTitleCurr.length - 7) //倒数6 scroll view bar
{
position = chartsTitleCurr.length - 7 - position;
intent.setClass(MainActivity.this,ClickChartsActivity.class);
}else if(position >= chartsTitleCurr.length - 8) //倒数8 dial chart
{
position = chartsTitleCurr.length - 8 - position;
intent.setClass(MainActivity.this,DialChartActivity.class);
}else if(position >= chartsTitleCurr.length - 9) //倒数9 dial chart
{
position = chartsTitleCurr.length - 9 - position;
intent.setClass(MainActivity.this,DialChart2Activity.class);
}else if(position >= chartsTitleCurr.length - 10) //倒数9 dial chart
{
position = chartsTitleCurr.length - 10 - position;
intent.setClass(MainActivity.this,DialChart3Activity.class);
}else if(position >= chartsTitleCurr.length - 11) //倒数9 dial chart
{
position = chartsTitleCurr.length - 11 - position;
intent.setClass(MainActivity.this,DialChart4Activity.class);
}else if(position >= chartsTitleCurr.length - 12) //倒数9 dial chart
{
position = chartsTitleCurr.length - 12 - position;
intent.setClass(MainActivity.this,DySpActivity.class);
}else{
intent.setClass(MainActivity.this,ChartsActivity.class);
}
/*
if(position >= chartsTitleCurr.length - 3) //倒数1,2,3 seekbar图
{
position = chartsTitleCurr.length - 1 - position;
intent.setClass(MainActivity.this,SeekBarActivity.class);
}else if(position >= chartsTitleCurr.length - 5) ////倒数4,5 同源汇总图
{
position = chartsTitleCurr.length - 4 - position;
intent.setClass(MainActivity.this,SpinnerActivity.class);
}else{
intent.setClass(MainActivity.this,ChartsActivity.class);
}
*/
bundleSimple.putInt("selected", position);
intent.putExtras(bundleSimple);
startActivity(intent);
}
};
mListView.setOnItemClickListener(listener);
}
@Override
public boolean onCreateOptionsMenu(Menu menu) {
// Inflate the menu; this adds items to the action bar if it is present.
super.onCreateOptionsMenu(menu);
menu.add(Menu.NONE, Menu.FIRST + 1, 0, "帮助");
menu.add(Menu.NONE, Menu.FIRST + 2, 0, "关于XCL-Charts");
return true;
}
@Override
public boolean onOptionsItemSelected(MenuItem item) {
super.onOptionsItemSelected(item);
switch(item.getItemId())
{
case Menu.FIRST+1:
String URL = getResources().getString(R.string.helpurl);
Uri uri = Uri.parse(URL);
Intent intent2 = new Intent(Intent.ACTION_VIEW, uri);
startActivity(intent2);
finish();
//Intent intent2 = new Intent();
//intent2.setClass(MainActivity.this,GradientActivity.class);
//startActivity(intent2);
break;
case Menu.FIRST+2:
Intent intent = new Intent();
intent.setClass(MainActivity.this,AboutActivity.class);
startActivity(intent);
break;
default:
}
return true;
}
private List<Map<String, String>> getData() {
List<Map<String, String>> listData = new ArrayList<Map<String, String>>();
String chartsTitle[] = getResources().getStringArray(R.array.chartsTitle);
String chartsDesc[] = getResources().getStringArray(R.array.chartsDesc);
int count = chartsDesc.length < chartsTitle.length?
chartsDesc.length: chartsTitle.length;
for(int i = 0; i< count; i++) {
Map<String, String> map = new HashMap<String, String>();
map.put("title",chartsTitle[i]);
map.put("description",chartsDesc[i]);
listData.add(map);
}
return listData;
}
}
| 3,392 |
432 | /*
* Copyright 2019 <NAME>, <EMAIL>
*
* 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.
*
* @brief Stack trace buffer on hardware level.
*/
#ifndef __DEBUGGER_RIVERLIB_STACKTRBUF_H__
#define __DEBUGGER_RIVERLIB_STACKTRBUF_H__
#include <systemc.h>
#include "../river_cfg.h"
namespace debugger {
SC_MODULE(StackTraceBuffer) {
sc_in<bool> i_clk;
sc_in<sc_uint<CFG_LOG2_STACK_TRACE_ADDR>> i_raddr;
sc_out<sc_biguint<2*CFG_CPU_ADDR_BITS>> o_rdata;
sc_in<bool> i_we;
sc_in<sc_uint<CFG_LOG2_STACK_TRACE_ADDR>> i_waddr;
sc_in<sc_biguint<2*CFG_CPU_ADDR_BITS>> i_wdata;
void comb();
void registers();
SC_HAS_PROCESS(StackTraceBuffer);
StackTraceBuffer(sc_module_name name_);
void generateVCD(sc_trace_file *i_vcd, sc_trace_file *o_vcd);
private:
sc_signal<sc_uint<5>> raddr;
sc_signal<sc_biguint<2*CFG_CPU_ADDR_BITS>> stackbuf[STACK_TRACE_BUF_SIZE]; // [pc, npc]
};
} // namespace debugger
#endif // __DEBUGGER_RIVERLIB_STACKTRBUF_H__
| 603 |
384 | /*
* This file is part of the GROMACS molecular simulation package.
*
* Copyright (c) 2020,2021, by the GROMACS development team, led by
* <NAME>, <NAME>, <NAME>, and <NAME>,
* and including many others, as listed in the AUTHORS file in the
* top-level source directory and at http://www.gromacs.org.
*
* GROMACS is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation; either version 2.1
* of the License, or (at your option) any later version.
*
* GROMACS 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with GROMACS; if not, see
* http://www.gnu.org/licenses, or write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* If you want to redistribute modifications to GROMACS, please
* consider that scientific software is very special. Version
* control is crucial - bugs must be traceable. We will be happy to
* consider code for inclusion in the official distribution, but
* derived work must not be called official GROMACS. Details are found
* in the README & COPYING files - if they are missing, get the
* official version at http://www.gromacs.org.
*
* To help us fund GROMACS development, we humbly ask that you cite
* the research papers on the package. Check out http://www.gromacs.org.
*/
/*! \internal \file
* \brief Implements internal functionality for expanded ensemble
*
* \author <NAME> <<EMAIL>>
* \author <NAME> <<EMAIL>>
* \ingroup module_mdlib
*/
#include "gmxpre.h"
#include "expanded_internal.h"
#include <cmath>
#include "gromacs/mdtypes/md_enums.h"
#include "gromacs/utility/exceptions.h"
namespace gmx
{
real calculateAcceptanceWeight(LambdaWeightCalculation calculationMode, real lambdaEnergyDifference)
{
if (calculationMode == LambdaWeightCalculation::Barker
|| calculationMode == LambdaWeightCalculation::Minvar)
{
/* Barker acceptance rule forumula is used for accumulation of probability for
* both the Barker variant of the weight accumulation algorithm and the
* minimum variance variant of the weight accumulation algorithm.
*
* Barker acceptance rule for a jump from state i -> j is defined as
* exp(-E_i)/exp(-Ei)+exp(-Ej) = 1 / (1 + exp(dE_ij))
* where dE_ij is the potential energy difference between the two states
* plus a constant offset that can be removed at the end for numerical stability.
* dE_ij = FE_j - FE_i + offset
* Numerically, this computation can be unstable if dE gets large. (See #3304)
* To avoid numerical instability, we're calculating it as
* 1 / (1 + exp(dE_ij)) (if dE < 0)
* exp(-dE_ij) / (exp(-dE_ij) + 1) (if dE > 0)
*/
if (lambdaEnergyDifference < 0)
{
return 1.0 / (1.0 + std::exp(lambdaEnergyDifference));
}
else
{
return std::exp(-lambdaEnergyDifference) / (1.0 + std::exp(-lambdaEnergyDifference));
}
}
else if (calculationMode == LambdaWeightCalculation::Metropolis)
{
/* Metropolis acceptance rule for a jump from state i -> j is defined as
* 1 (if dE_ij < 0)
* exp(-dE_ij) (if dE_ij >= 0)
* where dE_ij is the potential energy difference between the two states
* plus a free energy offset that can be subtracted off later:
* dE_ij = FE_j - FE_i + offset
*/
if (lambdaEnergyDifference < 0)
{
return 1.0;
}
else
{
return std::exp(-lambdaEnergyDifference);
}
}
GMX_THROW(NotImplementedError("Unknown acceptance calculation mode"));
}
} // namespace gmx
| 1,486 |
868 | <gh_stars>100-1000
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
package org.apache.activemq.artemis.core.security;
import org.junit.Assert;
import org.junit.Test;
import static org.apache.activemq.artemis.core.security.CheckType.BROWSE;
import static org.apache.activemq.artemis.core.security.CheckType.CONSUME;
import static org.apache.activemq.artemis.core.security.CheckType.CREATE_ADDRESS;
import static org.apache.activemq.artemis.core.security.CheckType.CREATE_DURABLE_QUEUE;
import static org.apache.activemq.artemis.core.security.CheckType.CREATE_NON_DURABLE_QUEUE;
import static org.apache.activemq.artemis.core.security.CheckType.DELETE_DURABLE_QUEUE;
import static org.apache.activemq.artemis.core.security.CheckType.DELETE_NON_DURABLE_QUEUE;
import static org.apache.activemq.artemis.core.security.CheckType.MANAGE;
import static org.apache.activemq.artemis.core.security.CheckType.SEND;
public class RoleTest extends Assert {
// Constants -----------------------------------------------------
// Attributes ----------------------------------------------------
// Static --------------------------------------------------------
// Constructors --------------------------------------------------
// Public --------------------------------------------------------
@Test
public void testWriteRole() throws Exception {
Role role = new Role("testWriteRole", true, false, false, false, false, false, false, false, false, false);
Assert.assertTrue(SEND.hasRole(role));
Assert.assertFalse(CONSUME.hasRole(role));
Assert.assertFalse(CREATE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(CREATE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(MANAGE.hasRole(role));
Assert.assertFalse(BROWSE.hasRole(role));
Assert.assertFalse(CREATE_ADDRESS.hasRole(role));
}
@Test
public void testReadRole() throws Exception {
Role role = new Role("testReadRole", false, true, false, false, false, false, false, true, false, false);
Assert.assertFalse(SEND.hasRole(role));
Assert.assertTrue(CONSUME.hasRole(role));
Assert.assertFalse(CREATE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(CREATE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(MANAGE.hasRole(role));
Assert.assertTrue(BROWSE.hasRole(role));
Assert.assertFalse(CREATE_ADDRESS.hasRole(role));
}
@Test
public void testCreateRole() throws Exception {
Role role = new Role("testCreateRole", false, false, true, false, false, false, false, false, false, false);
Assert.assertFalse(SEND.hasRole(role));
Assert.assertFalse(CONSUME.hasRole(role));
Assert.assertTrue(CREATE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(CREATE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(MANAGE.hasRole(role));
Assert.assertFalse(BROWSE.hasRole(role));
Assert.assertFalse(CREATE_ADDRESS.hasRole(role));
}
@Test
public void testManageRole() throws Exception {
Role role = new Role("testManageRole", false, false, false, false, false, false, true, false, false, false);
Assert.assertFalse(SEND.hasRole(role));
Assert.assertFalse(CONSUME.hasRole(role));
Assert.assertFalse(CREATE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(CREATE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_DURABLE_QUEUE.hasRole(role));
Assert.assertFalse(DELETE_NON_DURABLE_QUEUE.hasRole(role));
Assert.assertTrue(MANAGE.hasRole(role));
Assert.assertFalse(BROWSE.hasRole(role));
Assert.assertFalse(CREATE_ADDRESS.hasRole(role));
}
@Test
public void testEqualsAndHashcode() throws Exception {
Role role = new Role("testEquals", true, true, true, false, false, false, false, false, false, false);
Role sameRole = new Role("testEquals", true, true, true, false, false, false, false, false, false, false);
Role roleWithDifferentName = new Role("notEquals", true, true, true, false, false, false, false, false, false, false);
Role roleWithDifferentRead = new Role("testEquals", false, true, true, false, false, false, false, false, false, false);
Role roleWithDifferentWrite = new Role("testEquals", true, false, true, false, false, false, false, false, false, false);
Role roleWithDifferentCreate = new Role("testEquals", true, true, false, false, false, false, false, false, false, false);
Assert.assertTrue(role.equals(role));
Assert.assertTrue(role.equals(sameRole));
Assert.assertTrue(role.hashCode() == sameRole.hashCode());
Assert.assertFalse(role.equals(roleWithDifferentName));
Assert.assertFalse(role.hashCode() == roleWithDifferentName.hashCode());
Assert.assertFalse(role.equals(roleWithDifferentRead));
Assert.assertFalse(role.hashCode() == roleWithDifferentRead.hashCode());
Assert.assertFalse(role.equals(roleWithDifferentWrite));
Assert.assertFalse(role.hashCode() == roleWithDifferentWrite.hashCode());
Assert.assertFalse(role.equals(roleWithDifferentCreate));
Assert.assertFalse(role.hashCode() == roleWithDifferentCreate.hashCode());
Assert.assertFalse(role.equals(null));
}
// Package protected ---------------------------------------------
// Protected -----------------------------------------------------
// Private -------------------------------------------------------
// Inner classes -------------------------------------------------
}
| 2,245 |
3,372 | /*
* Copyright 2016-2021 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License"). You may not use this file except in compliance with
* the License. A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file 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.
*/
package com.amazonaws.services.athena.model;
import java.io.Serializable;
import javax.annotation.Generated;
import com.amazonaws.protocol.StructuredPojo;
import com.amazonaws.protocol.ProtocolMarshaller;
/**
* <p>
* The name and last modified time of the prepared statement.
* </p>
*
* @see <a href="http://docs.aws.amazon.com/goto/WebAPI/athena-2017-05-18/PreparedStatementSummary" target="_top">AWS
* API Documentation</a>
*/
@Generated("com.amazonaws:aws-java-sdk-code-generator")
public class PreparedStatementSummary implements Serializable, Cloneable, StructuredPojo {
/**
* <p>
* The name of the prepared statement.
* </p>
*/
private String statementName;
/**
* <p>
* The last modified time of the prepared statement.
* </p>
*/
private java.util.Date lastModifiedTime;
/**
* <p>
* The name of the prepared statement.
* </p>
*
* @param statementName
* The name of the prepared statement.
*/
public void setStatementName(String statementName) {
this.statementName = statementName;
}
/**
* <p>
* The name of the prepared statement.
* </p>
*
* @return The name of the prepared statement.
*/
public String getStatementName() {
return this.statementName;
}
/**
* <p>
* The name of the prepared statement.
* </p>
*
* @param statementName
* The name of the prepared statement.
* @return Returns a reference to this object so that method calls can be chained together.
*/
public PreparedStatementSummary withStatementName(String statementName) {
setStatementName(statementName);
return this;
}
/**
* <p>
* The last modified time of the prepared statement.
* </p>
*
* @param lastModifiedTime
* The last modified time of the prepared statement.
*/
public void setLastModifiedTime(java.util.Date lastModifiedTime) {
this.lastModifiedTime = lastModifiedTime;
}
/**
* <p>
* The last modified time of the prepared statement.
* </p>
*
* @return The last modified time of the prepared statement.
*/
public java.util.Date getLastModifiedTime() {
return this.lastModifiedTime;
}
/**
* <p>
* The last modified time of the prepared statement.
* </p>
*
* @param lastModifiedTime
* The last modified time of the prepared statement.
* @return Returns a reference to this object so that method calls can be chained together.
*/
public PreparedStatementSummary withLastModifiedTime(java.util.Date lastModifiedTime) {
setLastModifiedTime(lastModifiedTime);
return this;
}
/**
* Returns a string representation of this object. This is useful for testing and debugging. Sensitive data will be
* redacted from this string using a placeholder value.
*
* @return A string representation of this object.
*
* @see java.lang.Object#toString()
*/
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("{");
if (getStatementName() != null)
sb.append("StatementName: ").append(getStatementName()).append(",");
if (getLastModifiedTime() != null)
sb.append("LastModifiedTime: ").append(getLastModifiedTime());
sb.append("}");
return sb.toString();
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (obj instanceof PreparedStatementSummary == false)
return false;
PreparedStatementSummary other = (PreparedStatementSummary) obj;
if (other.getStatementName() == null ^ this.getStatementName() == null)
return false;
if (other.getStatementName() != null && other.getStatementName().equals(this.getStatementName()) == false)
return false;
if (other.getLastModifiedTime() == null ^ this.getLastModifiedTime() == null)
return false;
if (other.getLastModifiedTime() != null && other.getLastModifiedTime().equals(this.getLastModifiedTime()) == false)
return false;
return true;
}
@Override
public int hashCode() {
final int prime = 31;
int hashCode = 1;
hashCode = prime * hashCode + ((getStatementName() == null) ? 0 : getStatementName().hashCode());
hashCode = prime * hashCode + ((getLastModifiedTime() == null) ? 0 : getLastModifiedTime().hashCode());
return hashCode;
}
@Override
public PreparedStatementSummary clone() {
try {
return (PreparedStatementSummary) super.clone();
} catch (CloneNotSupportedException e) {
throw new IllegalStateException("Got a CloneNotSupportedException from Object.clone() " + "even though we're Cloneable!", e);
}
}
@com.amazonaws.annotation.SdkInternalApi
@Override
public void marshall(ProtocolMarshaller protocolMarshaller) {
com.amazonaws.services.athena.model.transform.PreparedStatementSummaryMarshaller.getInstance().marshall(this, protocolMarshaller);
}
}
| 2,210 |
677 | package io.qyi.e5.github.entity;
import com.baomidou.mybatisplus.annotation.IdType;
import com.baomidou.mybatisplus.annotation.TableId;
import java.io.Serializable;
import lombok.Data;
import lombok.EqualsAndHashCode;
import lombok.experimental.Accessors;
/**
* <p>
*
* </p>
*
* @author 落叶
* @since 2020-02-24
*/
@Data
@EqualsAndHashCode(callSuper = false)
@Accessors(chain = true)
public class Github implements Serializable {
private static final long serialVersionUID = 1L;
@TableId(value = "id", type = IdType.AUTO)
private Integer id;
/**
* 用户id
*/
private Integer userId;
private String accessToken;
/**
* 登录名
*/
private String login;
/**
* github的用户名
*/
private String name;
/**
* 头像url
*/
private String avatarUrl;
/**
* id
*/
private Integer githubId;
}
| 379 |
348 | {"nom":"Sinnamary","circ":"2ème circonscription","dpt":"Guyane","inscrits":1951,"abs":1282,"votants":669,"blancs":20,"nuls":5,"exp":644,"res":[{"nuance":"REG","nom":"<NAME>","voix":513},{"nuance":"REM","nom":"<NAME>","voix":131}]} | 91 |
909 | <reponame>tanyeun/JavaCodeInterview
import org.junit.Test;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import static org.junit.Assert.assertEquals;
public class SearchMazeTest {
private final Boolean w = true;
private final Boolean b = false;
private List<Tuple> expected;
private List<List<Boolean>> maze;
private Tuple s;
private Tuple e;
@Test
public void searchMaze1() throws Exception {
expected = Collections.emptyList();
maze = Arrays.asList(
Arrays.asList(b,w,w,w,w,w,b,b,w,w),
Arrays.asList(w,w,b,w,w,w,b,w,w,w),
Arrays.asList(b,w,b,w,w,b,b,b,b,b),
Arrays.asList(w,w,w,b,b,b,w,w,b,w),
Arrays.asList(w,b,b,w,w,w,w,w,w,w),
Arrays.asList(w,b,b,w,w,b,w,b,b,w),
Arrays.asList(w,w,w,w,b,w,w,w,w,w),
Arrays.asList(b,w,b,w,b,w,b,w,w,w),
Arrays.asList(b,w,b,b,w,w,w,b,b,b),
Arrays.asList(w,w,w,w,w,w,w,b,b,w)
);
s = new Tuple(9,0);
e = new Tuple(0,9);
test(expected,maze,s,e);
}
@Test
public void searchMaze2() throws Exception {
expected = Arrays.asList(
new Tuple(9,0),
new Tuple(9,1),
new Tuple(9,2),
new Tuple(9,3),
new Tuple(9,4),
new Tuple(9,5),
new Tuple(8,5),
new Tuple(7,5),
new Tuple(6,5),
new Tuple(6,6),
new Tuple(5,6),
new Tuple(4,6),
new Tuple(4,7),
new Tuple(3,7),
new Tuple(2,7),
new Tuple(1,7),
new Tuple(1,8),
new Tuple(0,8),
new Tuple(0,9)
);
maze = Arrays.asList(
Arrays.asList(b,w,w,w,w,w,b,b,w,w),
Arrays.asList(w,w,b,w,w,w,w,w,w,w),
Arrays.asList(b,w,b,w,w,b,b,w,b,b),
Arrays.asList(w,w,w,b,b,b,w,w,b,w),
Arrays.asList(w,b,b,w,w,w,w,w,w,w),
Arrays.asList(w,b,b,w,w,b,w,b,b,w),
Arrays.asList(w,w,w,w,b,w,w,w,w,w),
Arrays.asList(b,w,b,w,b,w,b,w,w,w),
Arrays.asList(b,w,b,b,w,w,w,b,b,b),
Arrays.asList(w,w,w,w,w,w,w,b,b,w)
);
s = new Tuple(9,0);
e = new Tuple(0,9);
test(expected,maze,s,e);
}
private void test(List<Tuple> expected, List<List<Boolean>> maze, Tuple s, Tuple e) {
assertEquals(expected, SearchMaze.searchMaze(maze, s, e));
}
} | 1,756 |
1,056 | <filename>ide/editor.macros/src/org/netbeans/modules/editor/macros/storage/ui/MacrosPanelController.java
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
package org.netbeans.modules.editor.macros.storage.ui;
import java.beans.PropertyChangeListener;
import java.lang.ref.Reference;
import java.lang.ref.WeakReference;
import java.util.Map;
import java.util.WeakHashMap;
import javax.swing.JComponent;
import org.netbeans.api.options.OptionsDisplayer;
import org.netbeans.core.options.keymap.api.ShortcutsFinder;
import org.netbeans.spi.options.OptionsPanelController;
import org.openide.util.HelpCtx;
import org.openide.util.Lookup;
/**
* @author <NAME>
*/
@OptionsPanelController.SubRegistration(
location=OptionsDisplayer.EDITOR,
id="Macros",
displayName="#CTL_Macros_DisplayName",
keywords="#KW_Macros",
keywordsCategory="Editor/Macros",
position=700
// toolTip="#CTL_Macros_ToolTip"
)
public final class MacrosPanelController extends OptionsPanelController {
public void update() {
MacrosModel model = lastPanel.getModel();
if (!model.isLoaded()) {
model.load();
}
}
public void applyChanges() {
lastPanel.save();
}
public void cancel() {
lastPanel.getModel().load();
}
public boolean isValid() {
return true;
}
public boolean isChanged() {
if (lastPanel == null) {
return false;
}
return lastPanel.getModel().isChanged();
}
public HelpCtx getHelpCtx() {
return new HelpCtx("netbeans.optionsDialog.editor.macros"); //NOI18N
}
public JComponent getComponent(Lookup masterLookup) {
return getMacrosPanel(masterLookup);
}
public void addPropertyChangeListener(PropertyChangeListener l) {
lastPanel.getModel().addPropertyChangeListener(l);
}
public void removePropertyChangeListener(PropertyChangeListener l) {
lastPanel.getModel().removePropertyChangeListener(l);
}
private static final Map<Lookup, Reference<MacrosPanel>> PANELS = new WeakHashMap<Lookup, Reference<MacrosPanel>>();
private MacrosPanel lastPanel = null;
private MacrosPanel getMacrosPanel(Lookup masterLookup) {
Reference<MacrosPanel> ref = PANELS.get(masterLookup);
MacrosPanel panel = ref == null ? null : ref.get();
if (panel == null) {
panel = new MacrosPanel(masterLookup);
PANELS.put(masterLookup, new WeakReference<MacrosPanel>(panel));
}
this.lastPanel = panel;
return panel;
}
}
| 1,144 |
938 | <filename>rabbit-base/src/main/java/com/susion/rabbit/base/entities/RabbitReportInfo.java
package com.susion.rabbit.base.entities;
import com.google.gson.annotations.SerializedName;
import org.greenrobot.greendao.annotation.Entity;
import org.greenrobot.greendao.annotation.Id;
import java.util.Objects;
import org.greenrobot.greendao.annotation.Generated;
import org.greenrobot.greendao.annotation.Keep;
/**
* susionwang at 2019-12-05
*/
@Entity
public class RabbitReportInfo implements RabbitInfoProtocol{
@Id(autoincrement = true)
public Long id;
@SerializedName("info_str")
public String infoStr;
public Long time;
@SerializedName("device_info_str")
public String deviceInfoStr;
public String type;
@SerializedName("use_time")
public long useTime;
@Keep
public RabbitReportInfo(String infoStr, Long time,
String deviceInfoStr, String type, long appUseTime) {
this.infoStr = infoStr;
this.time = time;
this.deviceInfoStr = deviceInfoStr;
this.type = type;
this.useTime = appUseTime;
}
@Generated(hash = 1889523049)
public RabbitReportInfo(Long id, String infoStr, Long time,
String deviceInfoStr, String type, long useTime) {
this.id = id;
this.infoStr = infoStr;
this.time = time;
this.deviceInfoStr = deviceInfoStr;
this.type = type;
this.useTime = useTime;
}
@Generated(hash = 2125059637)
public RabbitReportInfo() {
}
/**
* 必须是这两个字段
*/
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
RabbitReportInfo that = (RabbitReportInfo) o;
return Objects.equals(time, that.time) &&
Objects.equals(type, that.type);
}
@Override
public int hashCode() {
return Objects.hash(time, type);
}
public Long getId() {
return this.id;
}
public void setId(Long id) {
this.id = id;
}
public String getInfoStr() {
return this.infoStr;
}
public void setInfoStr(String infoStr) {
this.infoStr = infoStr;
}
public Long getTime() {
return this.time;
}
@Override
public String getPageName() {
return "";
}
public void setTime(Long time) {
this.time = time;
}
public String getDeviceInfoStr() {
return this.deviceInfoStr;
}
public void setDeviceInfoStr(String deviceInfoStr) {
this.deviceInfoStr = deviceInfoStr;
}
public String getType() {
return this.type;
}
public void setType(String type) {
this.type = type;
}
public long getUseTime() {
return this.useTime;
}
public void setUseTime(long useTime) {
this.useTime = useTime;
}
}
| 1,262 |
1,217 | <reponame>lishaojiang/GameEngineFromScratch<filename>Framework/Interface/Interface.hpp
#pragma once
#define _Interface_ class
#define _inherits_ public
#define _implements_ public
| 59 |
312 | /*******************************************************************************
* Copyright (c) 2015 Eclipse RDF4J contributors, Aduna, and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Distribution License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/org/documents/edl-v10.php.
*******************************************************************************/
package org.eclipse.rdf4j.sail.solr;
import org.eclipse.rdf4j.model.IRI;
import org.eclipse.rdf4j.sail.lucene.DocumentDistance;
import org.eclipse.rdf4j.sail.lucene.util.GeoUnits;
public class SolrDocumentDistance extends SolrDocumentResult implements DocumentDistance {
private final IRI units;
public SolrDocumentDistance(SolrSearchDocument doc, IRI units) {
super(doc);
this.units = units;
}
@Override
public double getDistance() {
Number s = ((Number) doc.getDocument().get(SolrIndex.DISTANCE_FIELD));
return (s != null) ? GeoUnits.fromKilometres(s.doubleValue(), units) : Double.NaN;
}
}
| 319 |
679 | <filename>main/extensions/source/bibliography/bibcont.cxx
/**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*
*************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_extensions.hxx"
#include <osl/mutex.hxx>
#include <tools/urlobj.hxx>
#include <cppuhelper/weak.hxx>
#include <unotools/processfactory.hxx>
#include <toolkit/helper/vclunohelper.hxx>
#include <com/sun/star/awt/XWindow.hpp>
#include <com/sun/star/awt/XWindowPeer.hpp>
#include <com/sun/star/frame/XDispatchProvider.hpp>
#include <com/sun/star/frame/FrameSearchFlag.hpp>
#include <com/sun/star/util/XURLTransformer.hpp>
#include "bibconfig.hxx"
#include "datman.hxx"
#include "bibcont.hxx"
BibShortCutHandler::~BibShortCutHandler()
{
}
sal_Bool BibShortCutHandler::HandleShortCutKey( const KeyEvent& )
{
return sal_False;
}
BibWindow::BibWindow( Window* pParent, WinBits nStyle ) : Window( pParent, nStyle ), BibShortCutHandler( this )
{
}
BibWindow::~BibWindow()
{
}
BibSplitWindow::BibSplitWindow( Window* pParent, WinBits nStyle ) : SplitWindow( pParent, nStyle ), BibShortCutHandler( this )
{
}
BibSplitWindow::~BibSplitWindow()
{
}
BibTabPage::BibTabPage( Window* pParent, const ResId& rResId ) : TabPage( pParent, rResId ), BibShortCutHandler( this )
{
}
BibTabPage::~BibTabPage()
{
}
using namespace osl;
using namespace ::com::sun::star;
using namespace ::com::sun::star::uno;
using namespace ::com::sun::star::frame;
using namespace ::rtl;
#define C2U(cChar) OUString::createFromAscii(cChar)
#define PROPERTY_FRAME 1
//split window size is a percent value
#define WIN_MIN_HEIGHT 10
#define WIN_STEP_SIZE 5
BibWindowContainer::BibWindowContainer( Window* pParent, BibShortCutHandler* pChildWin, WinBits nStyle ) :
BibWindow( pParent, nStyle ),
pChild( pChildWin )
{
if(pChild!=NULL)
{
Window* pChildWindow = GetChild();
pChildWindow->SetParent(this);
pChildWindow->Show();
pChildWindow->SetPosPixel(Point(0,0));
}
}
BibWindowContainer::~BibWindowContainer()
{
if( pChild )
{
Window* pDel = GetChild();
pChild = NULL; // prevents GetFocus for child while deleting!
delete pDel;
}
}
void BibWindowContainer::Resize()
{
if( pChild )
GetChild()->SetSizePixel( GetOutputSizePixel() );
}
void BibWindowContainer::GetFocus()
{
if( pChild )
GetChild()->GrabFocus();
}
sal_Bool BibWindowContainer::HandleShortCutKey( const KeyEvent& rKeyEvent )
{
return pChild? pChild->HandleShortCutKey( rKeyEvent ) : sal_False;
}
BibBookContainer::BibBookContainer(Window* pParent,BibDataManager* pDtMn, WinBits nStyle):
BibSplitWindow(pParent,nStyle),
pDatMan(pDtMn),
pTopWin(NULL),
pBottomWin(NULL),
bFirstTime(sal_True)
{
pBibMod = OpenBibModul();
aTimer.SetTimeoutHdl(LINK( this, BibBookContainer, SplitHdl));
aTimer.SetTimeout(400);
}
BibBookContainer::~BibBookContainer()
{
if( xTopFrameRef.is() )
xTopFrameRef->dispose();
if( xBottomFrameRef.is() )
xBottomFrameRef->dispose();
if( pTopWin )
{
Window* pDel = pTopWin;
pTopWin = NULL; // prevents GetFocus for child while deleting!
delete pDel;
}
if( pBottomWin )
{
Window* pDel = pBottomWin;
pBottomWin = NULL; // prevents GetFocus for child while deleting!
delete pDel;
}
CloseBibModul( pBibMod );
}
void BibBookContainer::Split()
{
aTimer.Start();
}
IMPL_LINK( BibBookContainer, SplitHdl, Timer*,/*pT*/)
{
long nSize= GetItemSize( TOP_WINDOW);
BibConfig* pConfig = BibModul::GetConfig();
pConfig->setBeamerSize(nSize);
nSize = GetItemSize( BOTTOM_WINDOW);
pConfig->setViewSize(nSize);
return 0;
}
void BibBookContainer::createTopFrame( BibShortCutHandler* pWin )
{
if ( xTopFrameRef.is() ) xTopFrameRef->dispose();
if(pTopWin)
{
RemoveItem(TOP_WINDOW);
delete pTopWin;
}
pTopWin=new BibWindowContainer(this,pWin);
pTopWin->Show();
BibConfig* pConfig = BibModul::GetConfig();
long nSize = pConfig->getBeamerSize();
InsertItem(TOP_WINDOW, pTopWin, nSize, 1, 0, SWIB_PERCENTSIZE );
}
void BibBookContainer::createBottomFrame( BibShortCutHandler* pWin )
{
if ( xBottomFrameRef.is() ) xBottomFrameRef->dispose();
if(pBottomWin)
{
RemoveItem(BOTTOM_WINDOW);
delete pBottomWin;
}
pBottomWin=new BibWindowContainer(this,pWin);
BibConfig* pConfig = BibModul::GetConfig();
long nSize = pConfig->getViewSize();
InsertItem(BOTTOM_WINDOW, pBottomWin, nSize, 1, 0, SWIB_PERCENTSIZE );
}
void BibBookContainer::GetFocus()
{
if( pBottomWin )
pBottomWin->GrabFocus();
}
long BibBookContainer::PreNotify( NotifyEvent& rNEvt )
{
long nHandled = 0;
if( EVENT_KEYINPUT == rNEvt.GetType() )
{
const KeyEvent* pKEvt = rNEvt.GetKeyEvent();
const KeyCode aKeyCode = pKEvt->GetKeyCode();
sal_uInt16 nKey = aKeyCode.GetCode();
const sal_uInt16 nModifier = aKeyCode.GetModifier();
if( KEY_MOD2 == nModifier )
{
if( KEY_UP == nKey || KEY_DOWN == nKey )
{
if(pTopWin && pBottomWin)
{
sal_uInt16 nFirstWinId = KEY_UP == nKey ? TOP_WINDOW : BOTTOM_WINDOW;
sal_uInt16 nSecondWinId = KEY_UP == nKey ? BOTTOM_WINDOW : TOP_WINDOW;
long nHeight = GetItemSize( nFirstWinId );
nHeight -= WIN_STEP_SIZE;
if(nHeight < WIN_MIN_HEIGHT)
nHeight = WIN_MIN_HEIGHT;
SetItemSize( nFirstWinId, nHeight );
SetItemSize( nSecondWinId, 100 - nHeight );
}
nHandled = 1;
}
else if( pKEvt->GetCharCode() && HandleShortCutKey( *pKEvt ) )
nHandled = 1;
}
}
return nHandled;
}
sal_Bool BibBookContainer::HandleShortCutKey( const KeyEvent& rKeyEvent )
{
sal_Bool bRet = sal_False;
if( pTopWin )
bRet = pTopWin->HandleShortCutKey( rKeyEvent );
if( !bRet && pBottomWin )
bRet = pBottomWin->HandleShortCutKey( rKeyEvent );
return bRet;
}
| 2,503 |
1,450 | from pdb import set_trace as T
import numpy as np
import time
from kivy.uix.widget import Widget
from kivy.config import Config
rad = 80
sz = 500
pi = 3.14159265
class Transform(Widget):
def __init__(self, **kwargs):
super().__init__(**kwargs)
self.zoom = Zoom()
self.pan = Pan('left', self.zoom)
self.rotate = Rotate('right', self.pan)
self.t = 0
self.vInit = np.array([0, 0, 1])
self.add_widget(self.pan)
self.add_widget(self.zoom)
self.add_widget(self.rotate)
self.button = None
def update(self, dt):
self.t += dt
rot_xz, xz_vec, xz_norm, vec = self.rotate(self.vInit)
vec = self.zoom(vec)
pos, lookvec = self.pan(vec, rot_xz, xz_vec)
return lookvec, pos
class TouchWidget(Widget):
def __init__(self, button, **kwargs):
super().__init__(**kwargs)
self.x, self.y, self.xVol, self.yVol = 0, 0, 0, 0
self.button = button
self.reset = True
#Currently broken due to race condition?
#def on_touch_down(self, touch):
# if touch.button == self.button:
# self.xStart, self.yStart = touch.pos
def on_touch_up(self, touch):
if touch.button == self.button:
self.x += self.xVol
self.y += self.yVol
self.xVol, self.yVol= 0, 0
self.reset = True
def on_touch_move(self, touch):
if self.reset:
self.xStart, self.yStart = touch.pos
self.reset = False
if touch.button == self.button:
xEnd, yEnd = touch.pos
self.xVol = xEnd - self.xStart
self.yVol = yEnd - self.yStart
class Zoom(Widget):
def __init__(self, **kwargs):
super().__init__(**kwargs)
self.zoom, self.delta = 1, 0.2
def clip(self, zoom, exprange=2):
return np.clip(zoom, 0.5**exprange, 2**exprange)
def on_touch_down(self, touch):
if touch.button == 'scrollup':
self.zoom = self.clip(self.zoom + self.delta)
elif touch.button == 'scrolldown':
self.zoom = self.clip(self.zoom - self.delta)
def __call__(self, vec):
return vec * self.zoom
class Pan(TouchWidget):
def __init__(self, button, zoom, **kwargs):
super().__init__(button, **kwargs)
self.x, self.y, self.xVol, self.yVol = 0, 0, 0, 0
self.zoom = zoom
def on_touch_move(self, touch):
super().on_touch_move(touch)
self.xVol = int(self.xVol * self.zoom.zoom)
self.yVol = int(self.yVol * self.zoom.zoom)
def __call__(self, vec, rot_xz, xz_vec):
x = 10 * (self.x + self.xVol) / sz
z = -10 * (self.y + self.yVol) / sz
#Horizontal component
unit_y = np.array([0, 1, 0])
xx, _, zz = np.cross(rot_xz, unit_y)
norm = np.sqrt(xx**2 + zz**2)
xh, zh = x*xx/norm, x*zz/norm
#Depth component
xx, _, zz = -xz_vec
norm = np.sqrt(xx**2 + zz**2)
xd, zd = z*xx/norm, z*zz/norm
xx, yy, zz = vec
vec = [xx+xh+xd, yy, zz+zh+zd]
lookvec = [-xh-xd, 0, -zh-zd]
return vec, lookvec
class Rotate(TouchWidget):
def __init__(self, button, pan, **kwargs):
super().__init__(button, **kwargs)
self.pan = pan
def __call__(self, vec):
x = (self.x + self.xVol) / sz
y = (self.y + self.yVol) / sz
yclip = np.clip(y, -pi/2, 0)
xz_x = np.cos(x)
xz_z = np.sin(x)
yz_y = np.cos(yclip)
yz_z = np.sin(yclip)
xz = np.array([
[xz_x, 0, -xz_z],
[0 , 1, 0 ],
[xz_z, 0, xz_x]])
yz = np.array([
[1, 0, 0 ],
[0, yz_y, -yz_z],
[0, yz_z, yz_y]])
#Find cylindrical xz plane rotation
rot_xz = rad*np.dot(xz, vec)
xx, _, zz = rot_xz
xz_vec = np.array([xx, 0, zz])
#Find spherical yz plane rotation
_, yy, zn = np.dot(yz, vec)
xz_norm = zn
#For x, z: shrink to position of spherical rotation
#For y: use height from spherical rotation
vec = np.array([xx*xz_norm, -rad*yy, zz*xz_norm])
return rot_xz, xz_vec, xz_norm, vec
| 2,248 |
49,076 | <reponame>nicchagil/spring-framework<filename>spring-webmvc/src/main/java/org/springframework/web/servlet/mvc/method/annotation/ServletRequestDataBinderFactory.java
/*
* Copyright 2002-2017 the original author or authors.
*
* 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
*
* https://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.
*/
package org.springframework.web.servlet.mvc.method.annotation;
import java.util.List;
import org.springframework.lang.Nullable;
import org.springframework.web.bind.ServletRequestDataBinder;
import org.springframework.web.bind.support.WebBindingInitializer;
import org.springframework.web.context.request.NativeWebRequest;
import org.springframework.web.method.annotation.InitBinderDataBinderFactory;
import org.springframework.web.method.support.InvocableHandlerMethod;
/**
* Creates a {@code ServletRequestDataBinder}.
*
* @author <NAME>
* @since 3.1
*/
public class ServletRequestDataBinderFactory extends InitBinderDataBinderFactory {
/**
* Create a new instance.
* @param binderMethods one or more {@code @InitBinder} methods
* @param initializer provides global data binder initialization
*/
public ServletRequestDataBinderFactory(@Nullable List<InvocableHandlerMethod> binderMethods,
@Nullable WebBindingInitializer initializer) {
super(binderMethods, initializer);
}
/**
* Returns an instance of {@link ExtendedServletRequestDataBinder}.
*/
@Override
protected ServletRequestDataBinder createBinderInstance(
@Nullable Object target, String objectName, NativeWebRequest request) throws Exception {
return new ExtendedServletRequestDataBinder(target, objectName);
}
}
| 601 |
337 | from manga_py.provider import Provider
from .helpers.std import Std
class MangaHubIo(Provider, Std):
_api = 'https://api.mghubcdn.com/graphql'
_cdn = 'https://img.mghubcdn.com/file/imghub/'
def get_chapter_index(self) -> str:
chapter = self.chapter
return self.re.search(r'/chapter/[^/]+/\w+-([^/]+)', chapter).group(1)
def get_content(self):
return self._get_content('{}/manga/{}')
def get_manga_name(self) -> str:
return self._get_name('/(?:manga|chapter)/([^/]+)')
def get_chapters(self):
return self._elements('.list-group .list-group-item > a')
def get_files(self):
query = "{chapter(x:mh01,slug:\"%(name)s\",number:%(num)d)" \
"{id,title,mangaID,number,slug,date,pages,noAd,manga" \
"{id,title,slug,mainSlug,author,isWebtoon,isYaoi,isPorn,isSoftPorn,unauthFile,isLicensed" \
"}}}" % {'name': self.manga_name, 'num': self.chapter_id + 1}
with self.http_post(self._api, data={
"query": query
}) as resp:
content = resp.json()
pages = content.get('data', {}).get('chapter', {}).get('pages', '{}')
pages = self.json.loads(pages)
images = []
for p in pages:
images.append('{}{}'.format(self._cdn, pages[p]))
return images
def get_cover(self) -> str:
return self._cover_from_content('.row > div > img.img-responsive')
def book_meta(self) -> dict:
# todo meta
pass
main = MangaHubIo
| 726 |
4,047 | #!/usr/bin/env python3
# SPDX-License-Identifier: Apache-2.0
# Copyright © 2021 Intel Corproation
import argparse
import shutil
def main() -> None:
parser = argparse.ArgumentParser()
parser.add_argument('src')
parser.add_argument('dest')
args = parser.parse_args()
shutil.copy(args.src, args.dest)
if __name__ == "__main__":
main()
| 135 |
661 | f = 'apolonia.txt'
with open(f, 'r') as _f:
source = _f.read()
print(source.split('\n'))
| 46 |
404 | // Copyright (c) 2013-2019 K Team. All Rights Reserved.
package org.kframework.backend.java.kil;
import java.util.Iterator;
import java.util.List;
import java.util.stream.Stream;
import org.kframework.backend.java.symbolic.Transformer;
import org.kframework.backend.java.symbolic.Visitor;
import org.kframework.backend.java.util.Constants;
import com.google.common.base.Joiner;
import org.kframework.kore.K;
/**
* Represents either a {@link KList} or a {@link KSequence}.
*
* @author AndreiS
*/
@SuppressWarnings("serial")
public abstract class KCollection extends Collection implements Iterable<Term>, org.kframework.kore.KCollection {
protected KCollection(Variable frame, Kind kind) {
super(frame, kind);
}
/**
* Returns a view of the fragment of this {@code KCollection} that starts
* from the specified {@code fromIndex}.
*
* @param fromIndex
* the start index of the fragment
* @return a view of the specified fragment
*/
public abstract Term fragment(int fromIndex);
public final Term get(int index) {
return getContents().get(index);
}
public abstract String getSeparatorName();
public abstract String getIdentityName();
public abstract List<Term> getContents();
@Override
public final Iterator<Term> iterator() {
return getContents().iterator();
}
/**
* Returns the size of the contents of this {@code KCollection}.
*
* @see {@link KCollection#contents}
* @return the size of the contents
*/
@Override
public final int concreteSize() {
return getContents().size();
}
@Override
public final boolean isExactSort() {
if (concreteSize() == 1) {
return !hasFrame() && this.get(0).isExactSort();
} else {
/* 2 elements make a proper K collection */
return true;
}
}
@Override
protected final int computeHash() {
int hashCode = 1;
hashCode = hashCode * Constants.HASH_PRIME + (frame == null ? 0 : frame.hashCode());
hashCode = hashCode * Constants.HASH_PRIME + getContents().hashCode();
return hashCode;
}
@Override
public String toString() {
Joiner joiner = Joiner.on(getSeparatorName());
StringBuilder stringBuilder = new StringBuilder();
joiner.appendTo(stringBuilder, getContents());
if (super.frame != null) {
if (stringBuilder.length() != 0) {
stringBuilder.append(getSeparatorName());
}
stringBuilder.append(super.frame);
}
if (stringBuilder.length() == 0) {
stringBuilder.append(getIdentityName());
}
return stringBuilder.toString();
}
@Override
public void accept(Visitor visitor) {
visitor.visit(this);
}
@Override
public JavaSymbolicObject accept(Transformer transformer) {
return transformer.transform(this);
}
/**
* Promotes a given {@link Term} to a given {@link Kind}. The {@code Kind}s
* involved in this method can only be {@code Kind#KITEM}, {@code Kind#K},
* or {@code Kind#KLIST}. If the kind of the given {@code Term} is already
* above or equal to the target {@code Kind}, do nothing.
* <p>
* To be more specific, a {@code KItem} can be promoted to a single-element
* {@code KSequence} and, similarly, a {@code KSequence} can be promoted to
* a single-element {@code KList}.
*
* @param term
* the given term to be promoted
* @param kind
* the target kind that the term is to be promoted to
* @return the resulting term after kind promotion
*/
public static Term upKind(Term term, Kind kind) {
assert term.kind() == Kind.KITEM || term.kind() == Kind.K || term.kind() == Kind.KLIST : "Bad term not a k: " + term;
assert kind == Kind.KITEM || kind == Kind.K || kind == Kind.KLIST;
if (term.kind() == kind) {
return term;
}
/* promote KItem to K */
if (kind == Kind.K && term.kind() == Kind.KITEM) {
return KSequence.singleton(term);
}
/* promote KItem or K to KList */
if (kind == Kind.KLIST && (term.kind() == Kind.KITEM || term.kind() == Kind.K)) {
return KList.singleton(term);
}
return term;
}
/**
* Degrades a given {@link Term} to a given {@link Kind}. The {@code Kind}s
* involved in this method can only be {@code Kind#KITEM}, {@code Kind#K},
* or {@code Kind#KLIST}. If the kind of the given {@code Term} is already
* lower than or equal to the target {@code Kind}, do nothing.
* <p>
* To be more specific, a single-element {@code KList} can be degraded to a
* {@code KSequence} and, similarly, a single-element {@code KSequence} can
* be degraded to a {@code KItem}.
*
* @param term
* the given term to be degraded
* @return the resulting term after kind degradation
*/
public static Term downKind(Term term) {
assert term.kind() == Kind.KITEM || term.kind() == Kind.K || term.kind() == Kind.KLIST;
if (term instanceof KList && !((KList) term).hasFrame() && ((KList) term).concreteSize() == 1) {
term = ((KList) term).get(0);
}
if (term instanceof KSequence && !((KSequence) term).hasFrame() && ((KSequence) term).concreteSize() == 1) {
term = ((KSequence) term).get(0);
}
return term;
}
@Override
public List<K> items() {
return (List<K>) (Object) getContents();
}
@Override
public Stream<K> stream() {
return items().stream();
}
public int size() {
return items().size();
}
@Override
public Iterable<? extends K> asIterable() {
return this;
}
}
| 2,370 |
625 | package javatest.nio;
import com.jtransc.charset.ModifiedUtf8;
import java.io.IOException;
import java.util.Arrays;
import java.util.Objects;
public class ModifiedUtf8Test {
static public void main(String[] args) throws IOException {
System.out.println("ModifiedUtf8Test.main:");
expect(new byte[]{0, 5, 104, 101, 108, 108, 111}, "hello");
expect(new byte[]{0, 7, 104, 101, 108, 108, 111, -64, -128}, "hello\0");
//expect(new byte[]{0, 15, 104, 101, 108, 108, 111, -64, -128, -62, -128, -19, -81, -65, -19, -65, -65}, "hello\0\u0080\uDBFF\uDFFF"); // Surrogate pairs
idemp("hello");
idemp("hello\0");
//idemp("hello\0\u0080\uDBFF\uDFFF");
// C++ fails with surrogate pair literals!
}
static private void expect(final byte[] expect, final String str) throws IOException {
byte[] modifiedUtf8FromJTransc = ModifiedUtf8.encode(str);
System.out.println(Arrays.toString(expect));
System.out.println(Arrays.toString(modifiedUtf8FromJTransc));
System.out.println(Arrays.equals(expect, modifiedUtf8FromJTransc));
}
static private void idemp(final String str) throws IOException {
byte[] encoded = ModifiedUtf8.encode(str);
String decoded = ModifiedUtf8.decodeLen(encoded);
System.out.println(Objects.equals(decoded, str));
}
}
| 492 |
511 | //******************************************************************
//
// Copyright 2016 Samsung Electronics All Rights Reserved.
//
//-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
//
// 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.
//
//-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
#include "SceneListResourceRequestor.h"
#include "RemoteSceneUtils.h"
#include "OCPlatform.h"
namespace OIC
{
namespace Service
{
SceneListResourceRequestor::SceneListResourceRequestor(
RCSRemoteResourceObject::Ptr listResource)
: m_sceneListResource{ listResource }
{
SCENE_CLIENT_ASSERT_NOT_NULL(listResource);
}
void SceneListResourceRequestor::requestSceneCollectionCreation(
const std::string &name, InternalCreateSceneCollectionCallback internalCB)
{
RCSResourceAttributes attrs;
attrs[SCENE_KEY_NAME] = name;
RCSRemoteResourceObject::SetCallback setRequestCB
= std::bind(&SceneListResourceRequestor::onSceneCollectionCreated,
std::placeholders::_2, std::placeholders::_3,
name, std::move(internalCB),
SceneListResourceRequestor::wPtr(shared_from_this()));
RCSQueryParams queryParams;
queryParams.setResourceInterface(LINK_BATCH);
m_sceneListResource->set(queryParams, std::move(attrs), std::move(setRequestCB));
}
void SceneListResourceRequestor::requestSetName
(const std::string &name, InternalSetNameCallback internalCB)
{
RCSResourceAttributes attrs;
attrs[SCENE_KEY_NAME] = name;
RCSRemoteResourceObject::SetCallback setRequestCB
= std::bind(&SceneListResourceRequestor::onNameSet,
std::placeholders::_2, std::placeholders::_3, name, std::move(internalCB),
SceneListResourceRequestor::wPtr(shared_from_this()));
RCSQueryParams queryParams;
queryParams.setResourceInterface(SCENE_CLIENT_REQ_IF);
m_sceneListResource->set(queryParams, std::move(attrs), std::move(setRequestCB));
}
void SceneListResourceRequestor::requestGet(
const std::string &ifType, RCSRemoteResourceObject::GetCallback cb)
{
RCSQueryParams params;
params.setResourceInterface(ifType);
m_sceneListResource->get(params, cb);
}
RCSRemoteResourceObject::Ptr SceneListResourceRequestor::getRemoteResourceObject() const
{
return m_sceneListResource;
}
void SceneListResourceRequestor::onSceneCollectionCreated(
const RCSRepresentation &rep, int eCode,
const std::string &name, const InternalCreateSceneCollectionCallback &cb,
SceneListResourceRequestor::wPtr ptr)
{
SceneListResourceRequestor::Ptr listPtr = ptr.lock();
if (listPtr)
{
listPtr->onSceneCollectionCreated_impl(std::move(rep), eCode, name, std::move(cb));
}
}
void SceneListResourceRequestor::onSceneCollectionCreated_impl(
const RCSRepresentation &rep, int eCode,
const std::string &name, const InternalCreateSceneCollectionCallback &internalCB)
{
int result = SCENE_CLIENT_BADREQUEST;
std::string link, id;
if (eCode == OC_STACK_OK || eCode == OC_STACK_RESOURCE_CHANGED)
{
try
{
RCSResourceAttributes attrs = rep.getAttributes();
if (attrs.at(SCENE_KEY_NAME).get< std::string >().compare(name) == 0)
{
link = attrs.at(SCENE_KEY_PAYLOAD_LINK).get< std::string >();
id = attrs.at(SCENE_KEY_ID).get< std::string >();
result = SCENE_RESPONSE_SUCCESS;
}
}
catch (const std::exception &e)
{
SCENE_CLIENT_PRINT_LOG(e.what());
result = SCENE_SERVER_INTERNALSERVERERROR;
}
}
internalCB(link, id, name, result);
}
void SceneListResourceRequestor::onNameSet(const RCSRepresentation &rep, int eCode,
const std::string &name, const InternalSetNameCallback &internalCB,
SceneListResourceRequestor::wPtr ptr)
{
SceneListResourceRequestor::Ptr listPtr = ptr.lock();
if (listPtr)
{
listPtr->onNameSet_impl(std::move(rep), eCode, name, std::move(internalCB));
}
}
void SceneListResourceRequestor::onNameSet_impl(
const RCSRepresentation &rep, int eCode, const std::string &name,
const InternalSetNameCallback &internalCB)
{
int result = SCENE_CLIENT_BADREQUEST;
if (eCode == OC_STACK_OK || eCode == OC_STACK_RESOURCE_CHANGED)
{
if (rep.getAttributes().at(SCENE_KEY_NAME).get< std::string >() == name)
{
result = SCENE_RESPONSE_SUCCESS;
}
}
internalCB(result);
}
}
}
| 2,657 |
2,151 | <reponame>zipated/src
# Copyright 2015 The Chromium Authors. All rights reserved.
# Use of this source code is governed by a BSD-style license that can be
# found in the LICENSE file.
from code import Code
from model import PropertyType
from datetime import datetime
LICENSE = """// Copyright %s The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
"""
INFO = """// This file was generated by:
// %s.
"""
class JsUtil(object):
"""A helper class for generating JS Code.
"""
def GetLicense(self):
"""Returns the license text for JS extern and interface files.
"""
return (LICENSE % datetime.now().year)
def GetInfo(self, tool):
"""Returns text describing how the file was generated.
"""
return (INFO % tool)
def AppendObjectDefinition(self, c, namespace_name, properties,
new_line=True):
"""Given an OrderedDict of properties, returns a Code containing the
description of an object.
"""
if not properties: return
c.Sblock('{', new_line=new_line)
first = True
for field, prop in properties.items():
# Avoid trailing comma.
# TODO(devlin): This will be unneeded, if/when
# https://github.com/google/closure-compiler/issues/796 is fixed.
if not first:
c.Append(',', new_line=False)
first = False
js_type = self._TypeToJsType(namespace_name, prop.type_)
if prop.optional:
js_type = (Code().Append('(')
.Concat(js_type, new_line=False)
.Append('|undefined)', new_line=False))
c.Append('%s: ' % field, strip_right=False)
c.Concat(js_type, new_line=False)
c.Eblock('}')
def AppendFunctionJsDoc(self, c, namespace_name, function):
"""Appends the documentation for a function as a Code.
Returns an empty code object if the object has no documentation.
"""
c.Sblock(line='/**', line_prefix=' * ')
if function.description:
c.Comment(function.description, comment_prefix='')
def append_field(c, tag, js_type, name, optional, description):
c.Append('@%s {' % tag)
c.Concat(js_type, new_line=False)
if optional:
c.Append('=', new_line=False)
c.Append('}', new_line=False)
c.Comment(' %s' % name, comment_prefix='', wrap_indent=4, new_line=False)
if description:
c.Comment(' %s' % description, comment_prefix='',
wrap_indent=4, new_line=False)
for param in function.params:
append_field(c, 'param',
self._TypeToJsType(namespace_name, param.type_),
param.name, param.optional, param.description)
if function.callback:
append_field(c, 'param',
self._FunctionToJsFunction(namespace_name,
function.callback),
function.callback.name, function.callback.optional,
function.callback.description)
if function.returns:
append_field(c, 'return',
self._TypeToJsType(namespace_name, function.returns),
'', False, function.returns.description)
if function.deprecated:
c.Append('@deprecated %s' % function.deprecated)
c.Append(self.GetSeeLink(namespace_name, 'method', function.name))
c.Eblock(' */')
def AppendTypeJsDoc(self, c, namespace_name, js_type, optional):
"""Appends the documentation for a type as a Code.
"""
c.Append('@type {')
if optional:
c.Append('(', new_line=False)
c.Concat(self._TypeToJsType(namespace_name, js_type), new_line=False)
c.Append('|undefined)', new_line=False)
else:
c.Concat(self._TypeToJsType(namespace_name, js_type), new_line=False)
c.Append('}', new_line=False)
def _FunctionToJsFunction(self, namespace_name, function):
"""Converts a model.Function to a JS type (i.e., function([params])...)"""
c = Code()
c.Append('function(')
for i, param in enumerate(function.params):
t = self._TypeToJsType(namespace_name, param.type_)
if param.optional:
c.Append('(', new_line=False)
c.Concat(t, new_line=False)
c.Append('|undefined)', new_line=False)
else:
c.Concat(t, new_line = False)
if i is not len(function.params) - 1:
c.Append(', ', new_line=False, strip_right=False)
c.Append('):', new_line=False)
if function.returns:
c.Concat(self._TypeToJsType(namespace_name, function.returns),
new_line=False)
else:
c.Append('void', new_line=False)
return c
def _TypeToJsType(self, namespace_name, js_type):
"""Converts a model.Type to a JS type (number, Array, etc.)"""
if js_type.property_type in (PropertyType.INTEGER, PropertyType.DOUBLE):
return Code().Append('number')
if js_type.property_type is PropertyType.OBJECT:
if js_type.properties:
c = Code()
self.AppendObjectDefinition(c, namespace_name, js_type.properties)
return c
return Code().Append('Object')
if js_type.property_type is PropertyType.ARRAY:
return (Code().Append('!Array<').
Concat(self._TypeToJsType(namespace_name, js_type.item_type),
new_line=False).
Append('>', new_line=False))
if js_type.property_type is PropertyType.REF:
ref_type = '!chrome.%s.%s' % (namespace_name, js_type.ref_type)
return Code().Append(ref_type)
if js_type.property_type is PropertyType.CHOICES:
c = Code()
c.Append('(')
for i, choice in enumerate(js_type.choices):
c.Concat(self._TypeToJsType(namespace_name, choice), new_line=False)
if i is not len(js_type.choices) - 1:
c.Append('|', new_line=False)
c.Append(')', new_line=False)
return c
if js_type.property_type is PropertyType.FUNCTION:
return self._FunctionToJsFunction(namespace_name, js_type.function)
if js_type.property_type is PropertyType.BINARY:
return Code().Append('ArrayBuffer')
if js_type.property_type is PropertyType.ANY:
return Code().Append('*')
if js_type.property_type.is_fundamental:
return Code().Append(js_type.property_type.name)
return Code().Append('?') # TODO(tbreisacher): Make this more specific.
def GetSeeLink(self, namespace_name, object_type, object_name):
"""Returns a @see link for a given API 'object' (type, method, or event).
"""
# NOTE(devlin): This is kind of a hack. Some APIs will be hosted on
# developer.chrome.com/apps/ instead of /extensions/, and some APIs have
# '.'s in them (like app.window), which should resolve to 'app_window'.
# Luckily, the doc server has excellent url resolution, and knows exactly
# what we mean. This saves us from needing any complicated logic here.
return ('@see https://developer.chrome.com/extensions/%s#%s-%s' %
(namespace_name, object_type, object_name))
| 2,907 |
516 | <reponame>zzwlstarby/parity
/*
* Copyright 2014 Parity authors
*
* 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.
*/
package com.paritytrading.parity.fix;
import java.io.IOException;
import com.paritytrading.parity.util.Instruments;
import com.paritytrading.philadelphia.FIXConfig;
import com.paritytrading.philadelphia.FIXVersion;
import java.net.InetSocketAddress;
import java.net.StandardSocketOptions;
import java.nio.channels.ServerSocketChannel;
import java.nio.channels.SocketChannel;
class FIXAcceptor {
private final OrderEntryFactory orderEntry;
private final ServerSocketChannel serverChannel;
private final FIXConfig config;
private final Instruments instruments;
private FIXAcceptor(OrderEntryFactory orderEntry,
ServerSocketChannel serverChannel, String senderCompId,
Instruments instruments) {
this.orderEntry = orderEntry;
this.serverChannel = serverChannel;
this.config = new FIXConfig.Builder()
.setVersion(FIXVersion.FIX_4_4)
.setSenderCompID(senderCompId)
.build();
this.instruments = instruments;
}
static FIXAcceptor open(OrderEntryFactory orderEntry,
InetSocketAddress address, String senderCompId,
Instruments instruments) throws IOException {
ServerSocketChannel serverChannel = ServerSocketChannel.open();
serverChannel.bind(address);
serverChannel.configureBlocking(false);
return new FIXAcceptor(orderEntry, serverChannel, senderCompId, instruments);
}
ServerSocketChannel getServerChannel() {
return serverChannel;
}
Session accept() {
try {
SocketChannel fix = serverChannel.accept();
if (fix == null)
return null;
try {
fix.setOption(StandardSocketOptions.TCP_NODELAY, true);
fix.configureBlocking(false);
return new Session(orderEntry, fix, config, instruments);
} catch (IOException e1) {
fix.close();
return null;
}
} catch (IOException e2) {
return null;
}
}
}
| 998 |
2,663 | {
"topic": "Frequently Asked Questions",
"pageNumber": "2",
"type": "How does the system handle changes to trading system during live trading?",
"definition": {
"text": "You need to restart the Trading Session and sometimes the Task in order for the Bot to get the new definitions.",
"updated": 1622293227672
},
"paragraphs": [
{
"style": "Text",
"text": "Users cannot change the definitions and feed them to a running bot in real time. If the definitions are at the Trading System level, or the Session Parameters level, you can change them and they will be sent to the running Task the next time you stop and run the Trading Session again.",
"updated": 1622293262444
},
{
"style": "Text",
"text": "It the definitions are at the Task level or upwards, like a change of market, you will need to stop the Task and run it again in order to be recognized."
}
]
} | 341 |
455 | <reponame>openrefactory/cassandra
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
package org.apache.cassandra.db.compaction;
import java.util.concurrent.Future;
import java.util.concurrent.TimeUnit;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
import org.apache.cassandra.concurrent.DebuggableThreadPoolExecutor;
import org.apache.cassandra.config.DatabaseDescriptor;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertNotNull;
public class CompactionExecutorTest
{
static Throwable testTaskThrowable = null;
private static class TestTaskExecutor extends CompactionManager.CompactionExecutor
{
@Override
public void afterExecute(Runnable r, Throwable t)
{
if (t == null)
{
t = DebuggableThreadPoolExecutor.extractThrowable(r);
}
testTaskThrowable = t;
}
@Override
protected void beforeExecute(Thread t, Runnable r)
{
}
}
private CompactionManager.CompactionExecutor executor;
@Before
public void setup()
{
DatabaseDescriptor.daemonInitialization();
executor = new TestTaskExecutor();
}
@After
public void destroy() throws Exception
{
executor.shutdown();
executor.awaitTermination(1, TimeUnit.MINUTES);
}
@Test
public void testFailedRunnable() throws Exception
{
testTaskThrowable = null;
Future<?> tt = executor.submitIfRunning(
() -> { assert false : "testFailedRunnable"; }
, "compactionExecutorTest");
while (!tt.isDone())
Thread.sleep(10);
assertNotNull(testTaskThrowable);
assertEquals(testTaskThrowable.getMessage(), "testFailedRunnable");
}
@Test
public void testFailedCallable() throws Exception
{
testTaskThrowable = null;
Future<?> tt = executor.submitIfRunning(
() -> { assert false : "testFailedCallable"; return 1; }
, "compactionExecutorTest");
while (!tt.isDone())
Thread.sleep(10);
assertNotNull(testTaskThrowable);
assertEquals(testTaskThrowable.getMessage(), "testFailedCallable");
}
@Test
public void testExceptionRunnable() throws Exception
{
testTaskThrowable = null;
Future<?> tt = executor.submitIfRunning(
() -> { throw new RuntimeException("testExceptionRunnable"); }
, "compactionExecutorTest");
while (!tt.isDone())
Thread.sleep(10);
assertNotNull(testTaskThrowable);
assertEquals(testTaskThrowable.getMessage(), "testExceptionRunnable");
}
}
| 1,305 |
364 | <reponame>jasonfeihe/BitFunnel
// The MIT License (MIT)
// Copyright (c) 2016, Microsoft
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#include <iostream>
#include <random>
#include "BitFunnel/Index/IDocumentFrequencyTable.h"
#include "BitFunnel/Index/ITermToText.h"
#include "QueryGenerator.h"
namespace BitFunnel
{
QueryGenerator::QueryGenerator(
IDocumentFrequencyTable const & dft,
ITermToText const & terms)
: m_dft(dft),
m_terms(terms),
m_distribution(0.0, 1.0)
{
// Generate and store a large number of random values while tracking
// the maximum value.
m_maxValue = 0.0;
m_values.reserve(c_valueCount);
for (size_t i = 0; i < c_valueCount; ++i)
{
double value = m_distribution(m_generator);
if (value > m_maxValue)
{
m_maxValue = value;
}
m_values.push_back(value);
}
m_nextValue = 0;
}
std::string QueryGenerator::CreateOneQuery(size_t termCount)
{
std::string query;
query.reserve(200);
for (size_t i = 0; i < termCount; ++i)
{
if (i != 0)
{
query.push_back(' ');
}
AppendOneTerm(query);
}
return query;
}
void QueryGenerator::AppendOneTerm(std::string& query)
{
// Grab the next random number
double value = m_values[m_nextValue % m_values.size()];
m_nextValue++;
// Convert random value to an index into the document frequency table.
// double old_value = value;
value /= m_maxValue;
value *= m_dft.size() - 1;
size_t index = static_cast<size_t>(value);
auto entry = m_dft[index];
// std::cout << old_value << "," << value << "," << m_maxValue << "," << m_dft.size() << "," << index << "," << std::hex << entry.GetTerm().GetRawHash() << std::dec << std::endl;
query.append(m_terms.Lookup(entry.GetTerm().GetRawHash()));
}
}
| 1,226 |
14,668 | <reponame>chromium/chromium
// Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "media/fuchsia/cdm/service/fuchsia_cdm_manager.h"
#include <fuchsia/media/drm/cpp/fidl.h>
#include <lib/fidl/cpp/binding_set.h>
#include <lib/fpromise/promise.h>
#include "base/bind.h"
#include "base/callback.h"
#include "base/containers/flat_set.h"
#include "base/containers/unique_ptr_adapters.h"
#include "base/files/file_enumerator.h"
#include "base/files/file_path.h"
#include "base/files/file_util.h"
#include "base/fuchsia/file_utils.h"
#include "base/fuchsia/fuchsia_logging.h"
#include "base/hash/hash.h"
#include "base/logging.h"
#include "base/strings/string_number_conversions.h"
#include "base/task/task_traits.h"
#include "base/task/thread_pool.h"
#include "media/fuchsia/cdm/service/provisioning_fetcher_impl.h"
#include "third_party/abseil-cpp/absl/types/optional.h"
#include "url/origin.h"
namespace media {
namespace {
struct CdmDirectoryInfo {
base::FilePath path;
base::Time last_used;
uint64_t size_bytes;
};
// Enumerates all the files in the directory to determine its size and
// the most recent "last used" time.
// The implementation is based on base::ComputeDirectorySize(), with the
// addition of most-recently-modified calculation, and inclusion of directory
// node sizes toward the total.
CdmDirectoryInfo GetCdmDirectoryInfo(const base::FilePath& path) {
uint64_t directory_size = 0;
base::Time last_used;
base::FileEnumerator enumerator(
path, true /* recursive */,
base::FileEnumerator::DIRECTORIES | base::FileEnumerator::FILES);
while (!enumerator.Next().empty()) {
const base::FileEnumerator::FileInfo info = enumerator.GetInfo();
if (info.GetSize() > 0)
directory_size += info.GetSize();
last_used = std::max(last_used, info.GetLastModifiedTime());
}
return {
.path = path,
.last_used = last_used,
.size_bytes = directory_size,
};
}
void ApplyCdmStorageQuota(base::FilePath cdm_data_path,
uint64_t cdm_data_quota_bytes) {
// TODO(crbug.com/1148334): Migrate to using a platform-provided quota
// mechanism to manage CDM storage.
VLOG(2) << "Enumerating CDM data directories.";
uint64_t directories_size_bytes = 0;
std::vector<CdmDirectoryInfo> directories_info;
// CDM storage consistes of per-origin directories, each containing one or
// more per-key-system sub-directories. Each per-origin-per-key-system
// directory is assumed to be independent of other CDM data.
base::FileEnumerator by_origin(cdm_data_path, false /* recursive */,
base::FileEnumerator::DIRECTORIES);
for (;;) {
const base::FilePath origin_directory = by_origin.Next();
if (origin_directory.empty())
break;
base::FileEnumerator by_key_system(origin_directory, false /* recursive */,
base::FileEnumerator::DIRECTORIES);
for (;;) {
const base::FilePath key_system_directory = by_key_system.Next();
if (key_system_directory.empty())
break;
directories_info.push_back(GetCdmDirectoryInfo(key_system_directory));
directories_size_bytes += directories_info.back().size_bytes;
}
}
if (directories_size_bytes <= cdm_data_quota_bytes)
return;
VLOG(1) << "Removing least recently accessed CDM data.";
// Enumerate directories starting with the least most recently "used",
// deleting them until the the total amount of CDM data is within quota.
std::sort(directories_info.begin(), directories_info.end(),
[](const CdmDirectoryInfo& lhs, const CdmDirectoryInfo& rhs) {
return lhs.last_used < rhs.last_used;
});
base::flat_set<base::FilePath> affected_origin_directories;
for (const auto& directory_info : directories_info) {
if (directories_size_bytes <= cdm_data_quota_bytes)
break;
VLOG(1) << "Removing " << directory_info.path;
base::DeletePathRecursively(directory_info.path);
affected_origin_directories.insert(directory_info.path.DirName());
DCHECK_GE(directories_size_bytes, directory_info.size_bytes);
directories_size_bytes -= directory_info.size_bytes;
}
// Enumerate all the origin directories that had sub-directories deleted,
// and delete any that are now empty.
for (const auto& origin_directory : affected_origin_directories) {
if (base::IsDirectoryEmpty(origin_directory))
base::DeleteFile(origin_directory);
}
}
std::string HexEncodeHash(const std::string& name) {
uint32_t hash = base::PersistentHash(name);
return base::HexEncode(&hash, sizeof(uint32_t));
}
// Returns a nullopt if storage was created successfully.
absl::optional<base::File::Error> CreateStorageDirectory(base::FilePath path) {
base::File::Error error;
bool success = base::CreateDirectoryAndGetError(path, &error);
if (!success) {
return error;
}
return {};
}
} // namespace
// Manages individual KeySystem connections. Provides data stores and
// ProvisioningFetchers to the KeySystem server and associating CDM requests
// with the appropriate data store.
class FuchsiaCdmManager::KeySystemClient {
public:
// Construct an unbound KeySystemClient. The |name| field should be the EME
// name of the key system, such as org.w3.clearkey. It is only used for
// logging purposes.
explicit KeySystemClient(std::string name) : name_(std::move(name)) {}
~KeySystemClient() = default;
// Registers an error handler and binds the KeySystem handle. If Bind returns
// an error, the error handler will not be called.
zx_status_t Bind(
fidl::InterfaceHandle<fuchsia::media::drm::KeySystem> key_system_handle,
base::OnceClosure error_callback) {
key_system_.set_error_handler(
[name = name_, error_callback = std::move(error_callback)](
zx_status_t status) mutable {
ZX_LOG(ERROR, status) << "KeySystem " << name << " closed channel.";
std::move(error_callback).Run();
});
return key_system_.Bind(std::move(key_system_handle));
}
void CreateCdm(
base::FilePath storage_path,
CreateFetcherCB create_fetcher_callback,
fidl::InterfaceRequest<fuchsia::media::drm::ContentDecryptionModule>
request) {
absl::optional<DataStoreId> data_store_id = GetDataStoreIdForPath(
std::move(storage_path), std::move(create_fetcher_callback));
if (!data_store_id) {
request.Close(ZX_ERR_NO_RESOURCES);
return;
}
// If this request triggered an AddDataStore() request, then that will be
// processed before this call. If AddDataStore() fails, then the
// |data_store_id| will not be valid and the create call will close the
// |request| with a ZX_ERR_NOT_FOUND epitaph.
key_system_->CreateContentDecryptionModule2(data_store_id.value(),
std::move(request));
}
private:
using DataStoreId = uint32_t;
absl::optional<DataStoreId> GetDataStoreIdForPath(
base::FilePath storage_path,
CreateFetcherCB create_fetcher_callback) {
// If we have already added a data store id for that path, just use that
// one.
auto it = data_store_ids_by_path_.find(storage_path);
if (it != data_store_ids_by_path_.end()) {
return it->second;
}
fidl::InterfaceHandle<fuchsia::io::Directory> data_directory =
base::OpenDirectoryHandle(storage_path);
if (!data_directory.is_valid()) {
DLOG(ERROR) << "Unable to OpenDirectory " << storage_path;
return absl::nullopt;
}
auto provisioning_fetcher = std::make_unique<ProvisioningFetcherImpl>(
std::move(create_fetcher_callback));
DataStoreId data_store_id = next_data_store_id_++;
fuchsia::media::drm::DataStoreParams params;
params.set_data_directory(std::move(data_directory));
params.set_provisioning_fetcher(provisioning_fetcher->Bind(
base::BindOnce(&KeySystemClient::OnProvisioningFetcherError,
base::Unretained(this), provisioning_fetcher.get())));
key_system_->AddDataStore(
data_store_id, std::move(params),
[this, data_store_id, storage_path](
fpromise::result<void, fuchsia::media::drm::Error> result) {
if (result.is_error()) {
DLOG(ERROR) << "Failed to add data store " << data_store_id
<< ", path: " << storage_path;
data_store_ids_by_path_.erase(storage_path);
return;
}
});
provisioning_fetchers_.insert(std::move(provisioning_fetcher));
data_store_ids_by_path_.emplace(std::move(storage_path), data_store_id);
return data_store_id;
}
void OnProvisioningFetcherError(
ProvisioningFetcherImpl* provisioning_fetcher) {
provisioning_fetchers_.erase(provisioning_fetcher);
}
// The EME name of the key system, such as org.w3.clearkey
std::string name_;
// FIDL InterfacePtr to the platform provided KeySystem
fuchsia::media::drm::KeySystemPtr key_system_;
// A set of ProvisioningFetchers, one for each data store that gets added.
// The KeySystem might close the channel even if the data store remains in
// use.
base::flat_set<std::unique_ptr<ProvisioningFetcherImpl>,
base::UniquePtrComparator>
provisioning_fetchers_;
// The next data store id to use when registering data stores with the
// KeySystem. Data store ids are scoped to the KeySystem channel. Value starts
// at 1 because 0 is a reserved sentinel value for
// fuchsia::media::drm::NO_DATA_STORE. The value will be incremented each time
// we add a DataStore.
DataStoreId next_data_store_id_ = 1;
// A map of directory paths to data store ids that have been added to the
// KeySystem.
base::flat_map<base::FilePath, DataStoreId> data_store_ids_by_path_;
};
FuchsiaCdmManager::FuchsiaCdmManager(
CreateKeySystemCallbackMap create_key_system_callbacks_by_name,
base::FilePath cdm_data_path,
absl::optional<uint64_t> cdm_data_quota_bytes)
: create_key_system_callbacks_by_name_(
std::move(create_key_system_callbacks_by_name)),
cdm_data_path_(std::move(cdm_data_path)),
cdm_data_quota_bytes_(std::move(cdm_data_quota_bytes)),
storage_task_runner_(
base::ThreadPool::CreateSequencedTaskRunner({base::MayBlock()})) {
// To avoid potential for the CDM directory "cleanup" task removing
// CDM data directories that are in active use, the |storage_task_runner_| is
// sequenced, thereby ensuring cleanup completes before any CDM activities
// start.
if (cdm_data_quota_bytes_)
ApplyCdmStorageQuota(cdm_data_path_, *cdm_data_quota_bytes_);
}
FuchsiaCdmManager::~FuchsiaCdmManager() = default;
void FuchsiaCdmManager::CreateAndProvision(
const std::string& key_system,
const url::Origin& origin,
CreateFetcherCB create_fetcher_cb,
fidl::InterfaceRequest<fuchsia::media::drm::ContentDecryptionModule>
request) {
DCHECK_CALLED_ON_VALID_THREAD(thread_checker_);
base::FilePath storage_path = GetStoragePath(key_system, origin);
auto task = base::BindOnce(&CreateStorageDirectory, storage_path);
storage_task_runner_->PostTaskAndReplyWithResult(
FROM_HERE, std::move(task),
base::BindOnce(&FuchsiaCdmManager::CreateCdm, weak_factory_.GetWeakPtr(),
key_system, std::move(create_fetcher_cb),
std::move(request), std::move(storage_path)));
}
void FuchsiaCdmManager::set_on_key_system_disconnect_for_test_callback(
base::RepeatingCallback<void(const std::string&)> disconnect_callback) {
on_key_system_disconnect_for_test_callback_ = std::move(disconnect_callback);
}
FuchsiaCdmManager::KeySystemClient*
FuchsiaCdmManager::GetOrCreateKeySystemClient(
const std::string& key_system_name) {
auto client_it = active_key_system_clients_by_name_.find(key_system_name);
if (client_it == active_key_system_clients_by_name_.end()) {
// If there is no active one, attempt to create one.
return CreateKeySystemClient(key_system_name);
}
return client_it->second.get();
}
FuchsiaCdmManager::KeySystemClient* FuchsiaCdmManager::CreateKeySystemClient(
const std::string& key_system_name) {
const auto create_callback_it =
create_key_system_callbacks_by_name_.find(key_system_name);
if (create_callback_it == create_key_system_callbacks_by_name_.cend()) {
DLOG(ERROR) << "Key system is not supported: " << key_system_name;
return nullptr;
}
auto key_system_client = std::make_unique<KeySystemClient>(key_system_name);
zx_status_t status = key_system_client->Bind(
create_callback_it->second.Run(),
base::BindOnce(&FuchsiaCdmManager::OnKeySystemClientError,
base::Unretained(this), key_system_name));
if (status != ZX_OK) {
ZX_DLOG(ERROR, status) << "Unable to bind to KeySystem";
return nullptr;
}
KeySystemClient* key_system_client_ptr = key_system_client.get();
active_key_system_clients_by_name_.emplace(key_system_name,
std::move(key_system_client));
return key_system_client_ptr;
}
base::FilePath FuchsiaCdmManager::GetStoragePath(const std::string& key_system,
const url::Origin& origin) {
return cdm_data_path_.Append(HexEncodeHash(origin.Serialize()))
.Append(HexEncodeHash(key_system));
}
void FuchsiaCdmManager::CreateCdm(
const std::string& key_system_name,
CreateFetcherCB create_fetcher_cb,
fidl::InterfaceRequest<fuchsia::media::drm::ContentDecryptionModule>
request,
base::FilePath storage_path,
absl::optional<base::File::Error> storage_creation_error) {
DCHECK_CALLED_ON_VALID_THREAD(thread_checker_);
if (storage_creation_error) {
DLOG(ERROR) << "Failed to create directory: " << storage_path
<< ", error: " << *storage_creation_error;
request.Close(ZX_ERR_NO_RESOURCES);
return;
}
KeySystemClient* key_system_client =
GetOrCreateKeySystemClient(key_system_name);
if (!key_system_client) {
// GetOrCreateKeySystemClient will log the reason for failure.
request.Close(ZX_ERR_NOT_FOUND);
return;
}
key_system_client->CreateCdm(std::move(storage_path),
std::move(create_fetcher_cb),
std::move(request));
}
void FuchsiaCdmManager::OnKeySystemClientError(
const std::string& key_system_name) {
if (on_key_system_disconnect_for_test_callback_) {
on_key_system_disconnect_for_test_callback_.Run(key_system_name);
}
active_key_system_clients_by_name_.erase(key_system_name);
}
} // namespace media
| 5,609 |
1,418 | <reponame>ririripley/recipes<filename>java/pdf/com/chenshuo/pdf/PdfHack.java<gh_stars>1000+
package com.chenshuo.pdf;
import java.io.FileOutputStream;
import com.itextpdf.text.Document;
import com.itextpdf.text.PageSize;
import com.itextpdf.text.Rectangle;
import com.itextpdf.text.pdf.PdfContentByte;
import com.itextpdf.text.pdf.PdfDictionary;
import com.itextpdf.text.pdf.PdfImportedPage;
import com.itextpdf.text.pdf.PdfName;
import com.itextpdf.text.pdf.PdfReader;
import com.itextpdf.text.pdf.PdfRectangle;
import com.itextpdf.text.pdf.PdfStamper;
import com.itextpdf.text.pdf.PdfWriter;
public class PdfHack {
static final float kTextWidth = Float.parseFloat(System.getProperty("TextWidth", "370"));
static final float kTextHeight = Float.parseFloat(System.getProperty("TextWidth", "590"));
static final float kMargin = Float.parseFloat(System.getProperty("Margin", "10"));
static final float kOffset = Float.parseFloat(System.getProperty("Offset", "0"));
private static void help() {
System.out.println("Usage: PdfHack command input_pdf");
System.out.println("command is one of 'crop', 'twoup', 'booklet'");
}
private static void crop(String input) throws Exception {
String output = input.replace(".pdf", "-crop.pdf");
PdfReader reader = new PdfReader(input);
final int n = reader.getNumberOfPages();
Rectangle pageSize = reader.getPageSize(1);
System.out.println("Input page size: " + pageSize);
float left = (pageSize.getWidth() - kTextWidth) / 2 - kMargin;
float right = pageSize.getWidth() - left;
float bottom = (pageSize.getHeight() - kTextHeight) / 2;
float top = pageSize.getHeight() - bottom;
PdfRectangle rect = new PdfRectangle(left, bottom + kOffset, right, top + kOffset);
for (int i = 1; i <= n; i++) {
PdfDictionary pageDict = reader.getPageN(i);
pageDict.put(PdfName.CROPBOX, rect);
}
PdfStamper stamper = new PdfStamper(reader, new FileOutputStream(output));
stamper.close();
}
private static PdfImportedPage getPage(PdfWriter writer, PdfReader reader, int page) {
if (page > 0 && page <= reader.getNumberOfPages())
return writer.getImportedPage(reader, page);
else
return null;
}
private static void twoup(String input) throws Exception {
String output = input.replace(".pdf", "-twoup.pdf");
PdfReader reader = new PdfReader(input);
int n = reader.getNumberOfPages();
Rectangle pageSize = reader.getPageSize(1);
System.out.println("Input page size: " + pageSize);
Document doc = new Document(PageSize.A4.rotate(), 0, 0, 0, 0);
PdfWriter writer = PdfWriter.getInstance(doc, new FileOutputStream(output));
doc.open();
// splitLine(doc, writer);
PdfContentByte cb = writer.getDirectContent();
float bottom = (doc.top() - pageSize.getHeight()) / 2 + kOffset;
float left = doc.right() / 2 - (pageSize.getWidth() + kTextWidth) / 2 - kMargin;
float right = doc.right() / 2 - (pageSize.getWidth() - kTextWidth) / 2 + kMargin;
for (int i = 0; i <= n;) {
PdfImportedPage page = getPage(writer, reader, i++);
if (page != null)
cb.addTemplate(page, left, bottom);
page = getPage(writer, reader, i++);
if (page != null)
cb.addTemplate(page, right, bottom);
doc.newPage();
}
doc.close();
}
private static void splitLine(Document doc, PdfWriter writer) {
PdfContentByte cb = writer.getDirectContentUnder();
cb.moveTo(doc.right() / 2, doc.bottom());
cb.lineTo(doc.right() / 2, doc.top());
cb.stroke();
}
private static void booklet(String input) throws Exception {
String output = input.replace(".pdf", "-booklet.pdf");
PdfReader reader = new PdfReader(input);
int n = reader.getNumberOfPages();
Rectangle pageSize = reader.getPageSize(1);
System.out.println("Input page size: " + pageSize);
Document doc = new Document(PageSize.A4.rotate(), 0, 0, 0, 0);
PdfWriter writer = PdfWriter.getInstance(doc, new FileOutputStream(output));
doc.open();
splitLine(doc, writer);
int[] pages = new int[(n + 3) / 4 * 4];
int x = 1, y = pages.length;
for (int i = 0; i < pages.length;) {
pages[i++] = y--;
pages[i++] = x++;
pages[i++] = x++;
pages[i++] = y--;
}
PdfContentByte cb = writer.getDirectContent();
float bottom = (doc.top() - pageSize.getHeight()) / 2 + kOffset;
float left = doc.right() / 2 - (pageSize.getWidth() + kTextWidth) / 2 - kMargin;
float right = doc.right() / 2 - (pageSize.getWidth() - kTextWidth) / 2 + kMargin;
for (int i = 0; i < pages.length;) {
PdfImportedPage page = getPage(writer, reader, pages[i++]);
if (page != null)
cb.addTemplate(page, left, bottom);
page = getPage(writer, reader, pages[i++]);
if (page != null)
cb.addTemplate(page, right, bottom);
doc.newPage();
}
doc.close();
}
public static void main(String[] args) {
if (args.length >= 2) {
String cmd = args[0];
String input = args[1];
try {
if (cmd.equals("crop")) {
crop(input);
} else if (cmd.equals("twoup")) {
twoup(input);
} else if (cmd.equals("booklet")) {
booklet(input);
} else {
help();
}
} catch (Exception ex) {
ex.printStackTrace();
}
} else {
help();
}
}
}
| 2,668 |
5,169 | {
"name": "NetworkClient",
"version": "0.0.17",
"license": {
"type": "MIT",
"text": " MIT License\n\nCopyright (c) 2019 <NAME>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n"
},
"summary": "iOS Client Network Lib",
"homepage": "https://mcontigo.com/",
"authors": {
"<NAME>": "<EMAIL>"
},
"source": {
"git": "https://git.mcontigo.com/libs/ios-network-client.git",
"tag": "0.0.17"
},
"platforms": {
"ios": "10.0",
"osx": "10.12",
"tvos": "10.0"
},
"requires_arc": true,
"swift_versions": "5.0",
"source_files": "NetworkClient/NetworkClient/Sources/**/*.swift",
"frameworks": "Foundation",
"dependencies": {
"Alamofire": [
"~> 5.4.1"
],
"KeychainSwift": [
"~> 19.0"
]
},
"default_subspecs": "Client",
"subspecs": [
{
"name": "Client"
}
],
"swift_version": "5.0"
}
| 681 |
2,813 | <reponame>fernandes-natanael/jabref
package org.jabref.gui.maintable;
import java.util.HashMap;
import java.util.Map;
import javax.swing.undo.UndoManager;
import javafx.scene.Node;
import org.jabref.gui.externalfiletype.ExternalFileType;
import org.jabref.gui.externalfiletype.ExternalFileTypes;
import org.jabref.gui.icon.IconTheme;
import org.jabref.gui.icon.JabRefIcon;
import org.jabref.gui.specialfields.SpecialFieldViewModel;
import org.jabref.model.entry.field.Field;
import org.jabref.model.entry.field.SpecialField;
import org.jabref.model.entry.field.StandardField;
import org.jabref.model.entry.field.UnknownField;
import org.jabref.preferences.PreferencesService;
public class CellFactory {
private final Map<Field, JabRefIcon> TABLE_ICONS = new HashMap<>();
public CellFactory(ExternalFileTypes externalFileTypes, PreferencesService preferencesService, UndoManager undoManager) {
JabRefIcon icon;
icon = IconTheme.JabRefIcons.PDF_FILE;
// icon.setToo(Localization.lang("Open") + " PDF");
TABLE_ICONS.put(StandardField.PDF, icon);
icon = IconTheme.JabRefIcons.WWW;
// icon.setToolTipText(Localization.lang("Open") + " URL");
TABLE_ICONS.put(StandardField.URL, icon);
icon = IconTheme.JabRefIcons.WWW;
// icon.setToolTipText(Localization.lang("Open") + " CiteSeer URL");
TABLE_ICONS.put(new UnknownField("citeseerurl"), icon);
icon = IconTheme.JabRefIcons.WWW;
// icon.setToolTipText(Localization.lang("Open") + " ArXiv URL");
TABLE_ICONS.put(StandardField.EPRINT, icon);
icon = IconTheme.JabRefIcons.DOI;
// icon.setToolTipText(Localization.lang("Open") + " DOI " + Localization.lang("web link"));
TABLE_ICONS.put(StandardField.DOI, icon);
icon = IconTheme.JabRefIcons.FILE;
// icon.setToolTipText(Localization.lang("Open") + " PS");
TABLE_ICONS.put(StandardField.PS, icon);
icon = IconTheme.JabRefIcons.FOLDER;
// icon.setToolTipText(Localization.lang("Open folder"));
TABLE_ICONS.put(StandardField.FOLDER, icon);
icon = IconTheme.JabRefIcons.FILE;
// icon.setToolTipText(Localization.lang("Open file"));
TABLE_ICONS.put(StandardField.FILE, icon);
for (ExternalFileType fileType : externalFileTypes.getExternalFileTypeSelection()) {
icon = fileType.getIcon();
// icon.setToolTipText(Localization.lang("Open %0 file", fileType.getName()));
TABLE_ICONS.put(fileType.getField(), icon);
}
SpecialFieldViewModel relevanceViewModel = new SpecialFieldViewModel(SpecialField.RELEVANCE, preferencesService, undoManager);
icon = relevanceViewModel.getIcon();
// icon.setToolTipText(relevanceViewModel.getLocalization());
TABLE_ICONS.put(SpecialField.RELEVANCE, icon);
SpecialFieldViewModel qualityViewModel = new SpecialFieldViewModel(SpecialField.QUALITY, preferencesService, undoManager);
icon = qualityViewModel.getIcon();
// icon.setToolTipText(qualityViewModel.getLocalization());
TABLE_ICONS.put(SpecialField.QUALITY, icon);
// Ranking item in the menu uses one star
SpecialFieldViewModel rankViewModel = new SpecialFieldViewModel(SpecialField.RANKING, preferencesService, undoManager);
icon = rankViewModel.getIcon();
// icon.setToolTipText(rankViewModel.getLocalization());
TABLE_ICONS.put(SpecialField.RANKING, icon);
// Priority icon used for the menu
SpecialFieldViewModel priorityViewModel = new SpecialFieldViewModel(SpecialField.PRIORITY, preferencesService, undoManager);
icon = priorityViewModel.getIcon();
// icon.setToolTipText(priorityViewModel.getLocalization());
TABLE_ICONS.put(SpecialField.PRIORITY, icon);
// Read icon used for menu
SpecialFieldViewModel readViewModel = new SpecialFieldViewModel(SpecialField.READ_STATUS, preferencesService, undoManager);
icon = readViewModel.getIcon();
// icon.setToolTipText(readViewModel.getLocalization());
TABLE_ICONS.put(SpecialField.READ_STATUS, icon);
// Print icon used for menu
SpecialFieldViewModel printedViewModel = new SpecialFieldViewModel(SpecialField.PRINTED, preferencesService, undoManager);
icon = printedViewModel.getIcon();
// icon.setToolTipText(printedViewModel.getLocalization());
TABLE_ICONS.put(SpecialField.PRINTED, icon);
}
public Node getTableIcon(Field field) {
JabRefIcon icon = TABLE_ICONS.get(field);
if (icon == null) {
// LOGGER.info("Error: no table icon defined for type '" + field + "'.");
return null;
} else {
// node should be generated for each call, as nodes can be added to the scene graph only once
return icon.getGraphicNode();
}
}
}
| 1,869 |
3,680 | #!/pxrpythonsubst
#
# Copyright 2017 Pixar
#
# Licensed under the Apache License, Version 2.0 (the "Apache License")
# with the following modification; you may not use this file except in
# compliance with the Apache License and the following modification to it:
# Section 6. Trademarks. is deleted and replaced with:
#
# 6. Trademarks. This License does not grant permission to use the trade
# names, trademarks, service marks, or product names of the Licensor
# and its affiliates, except as required to comply with Section 4(c) of
# the License and to reproduce the content of the NOTICE file.
#
# You may obtain a copy of the Apache License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the Apache License with the above modification is
# distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied. See the Apache License for the specific
# language governing permissions and limitations under the Apache License.
# Regression test for bug 82180. The ultimate cause of that bug was
# PcpLayerStack erroneously blowing its relocations when an insignificant
# change to the layer stack was being processed.
from pxr import Sdf, Pcp
import unittest
class TestPcpRegressionBugs_bug82180(unittest.TestCase):
def test_Basic(self):
rootLayer = Sdf.Layer.FindOrOpen('bug82180/root.sdf')
sessionLayer = Sdf.Layer.CreateAnonymous()
pcpCache = Pcp.Cache(Pcp.LayerStackIdentifier(rootLayer, sessionLayer))
# Compute the cache's root layer stack and verify its contents.
(layerStack, errors) = \
pcpCache.ComputeLayerStack(pcpCache.GetLayerStackIdentifier())
self.assertTrue(layerStack)
self.assertEqual(layerStack.layers, [sessionLayer, rootLayer])
self.assertEqual(layerStack.relocatesSourceToTarget,
{ Sdf.Path('/ModelGroup/Model') : Sdf.Path('/ModelGroup/Model_1') })
self.assertEqual(layerStack.relocatesTargetToSource,
{ Sdf.Path('/ModelGroup/Model_1') : Sdf.Path('/ModelGroup/Model') })
self.assertEqual(len(errors), 0)
# Now add an empty sublayer to the session layer, which should be regarded
# as an insignificant layer stack change.
#
# Note that this bug isn't specific to the session layer; it occurred with
# any insignificant layer stack change. The test just uses the session layer
# since that's the repro steps from the bug report.
emptyLayer = Sdf.Layer.FindOrOpen('bug82180/empty.sdf')
with Pcp._TestChangeProcessor(pcpCache):
sessionLayer.subLayerPaths.insert(0, emptyLayer.identifier)
# Verify that the layer stack's contents are still as expect; in particular,
# the relocations should be unaffected.
(layerStack, errors) = \
pcpCache.ComputeLayerStack(pcpCache.GetLayerStackIdentifier())
self.assertTrue(layerStack)
self.assertEqual(layerStack.layers, [sessionLayer, emptyLayer, rootLayer])
self.assertEqual(layerStack.relocatesSourceToTarget,
{ Sdf.Path('/ModelGroup/Model') : Sdf.Path('/ModelGroup/Model_1') })
self.assertEqual(layerStack.relocatesTargetToSource,
{ Sdf.Path('/ModelGroup/Model_1') : Sdf.Path('/ModelGroup/Model') })
self.assertEqual(len(errors), 0)
if __name__ == "__main__":
unittest.main()
| 1,322 |
1,144 | {
"priceSystemName": "TestPriceSystem",
"priceListName": "TestPriceList",
"pricePrecision": "3",
"currency": "CHF",
"country": "Switzerland"
} | 66 |
9,959 | class WithOnStatic {
@lombok.With static boolean foo;
@lombok.With static int bar;
}
| 32 |
14,668 | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "device/bluetooth/test/mock_bluetooth_advertisement.h"
namespace device {
MockBluetoothAdvertisement::MockBluetoothAdvertisement() = default;
MockBluetoothAdvertisement::~MockBluetoothAdvertisement() = default;
void MockBluetoothAdvertisement::Unregister(SuccessCallback success_callback,
ErrorCallback error_callback) {
std::move(success_callback).Run();
}
} // namespace device
| 195 |
Subsets and Splits