blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 905
values | visit_date timestamp[us]date 2015-08-09 11:21:18 2023-09-06 10:45:07 | revision_date timestamp[us]date 1997-09-14 05:04:47 2023-09-17 19:19:19 | committer_date timestamp[us]date 1997-09-14 05:04:47 2023-09-06 06:22:19 | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 22
values | gha_event_created_at timestamp[us]date 2012-06-07 00:51:45 2023-09-14 21:58:39 ⌀ | gha_created_at timestamp[us]date 2008-03-27 23:40:48 2023-08-21 23:17:38 ⌀ | gha_language stringclasses 141
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 115
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e37751b71ed34a7f336bea4a09d8baf6b64ce692 | 3baeb74937a80b69795a65d22710d8f388c91af7 | /源代码/Project1/card.cpp | 9b0b00d34d959a102a2b47393595060540f8e68a | [] | no_license | lizhihong001/c---big-work | be384b9cadc0d9150d611a16008c2744ee1a6493 | e46f7ce80a5cdaba6b3d16bec64df79ad1c2c05f | refs/heads/master | 2021-01-23T20:13:25.109431 | 2017-09-08T11:12:48 | 2017-09-08T11:12:48 | 102,853,257 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 5,302 | cpp | #include "card.h"
#include <iostream>
#include <iomanip>
using namespace std;
double card::TicketIncome = 0;
card::card(string a, string b)
{
ID = a;
password = b;
money = 0;
freeze = 0;
discount = 1;
times = 0;
type = "NormalCard";
cout << "card created successfully!\n\n";
}
card::card(string a, string b, string c, double m, bool f, double d, int t)
{
ID = a;
password = b;
type = c;
money = m;
freeze = f;
discount = d;
times = t;
}
void card::rechargr(int x) //充值
{
money += x;
cout << "rechargr successfully!" << endl;
cout << "remind " << money << "yuan" << endl;
}
void card::BuyTicket(double ticketmoney, int amount) //买票
{
if (freeze)
{
cout << "this card has been freezen!";
return;
}
else
{
if (times >= 15)
{
discount = 0.6;
}
double cost = ticketmoney * discount * amount;
if (money - cost >= 0)
{
money -= cost;
cout << "unit price is " << setprecision(2) << std::fixed << ticketmoney << endl;
cout << "amount is " << amount << endl;
cout << "discount is " << setprecision(2) << std::fixed << discount << endl;
cout << "total price is " << setprecision(2) << std::fixed << cost << endl;
cout << "remind money is " << setprecision(2) << std::fixed << money << endl;
cout << "ticket has been bought!\n";
times++;
TicketIncome += cost;
}
else
{
cout << "not suffcient funds!\n";
return;
}
}
}
void card::consumer(double cost) //其他消费
{
if (freeze)
{
cout << "this card has been freezen!" << endl;
return;
}
else
{
if (money - cost >= 0)
{
money -= cost;
cout << "consumer successfully";
}
else
{
cout << "not suffcient funds!\n";
return;
}
}
}
bool card::CheckID(string id) //用户名检测
{
if (id == ID)
return 1;
else
return 0;
}
bool card::CheckPassword(string pw) //密码检测
{
if (pw == password)
return 1;
else
return 0;
}
void card::ShowMap() //查询地图
{
}
double card::Inquiremoney() //查询余额
{
return money;
}
void card::ReportTheLoss() //挂失
{
freeze = 1;
cout << "this card has been reported the lost" << endl;
}
void card::SeverFrozen() //解除挂失
{
freeze = 0;
cout << "This card has been serered frozen" << endl;
}
void card::RevisePassword(string newpassword) //修改密码
{
if (freeze)
{
cout << "this card has been freezen!\n";
return;
}
else
password = newpassword;
cout << "revise password successfully!" << endl;
}
void card::SetTicketMoney(double x) //设置票务收入
{
TicketIncome = x;
}
double card::GetTicketIncome()
{
return TicketIncome;
}
void card::ShowIncome() //查询收入
{
cout << "Income = " << TicketIncome << endl;
}
string card::GetID()
{
return ID;
}
string card::GetPW()
{
return password;
}
string card::GetType()
{
return type;
}
double card::GetMoney()
{
return money;
}
bool card::GetFreeze()
{
return freeze;
}
double card::GetDiscount()
{
return discount;
}
int card::GetTimes()
{
return times;
}
void card::showinfo() //展示信息
{
cout << "ID: " << ID << endl;
cout << "password: " << password << endl;
cout << "type: " << type << endl;
cout << "money: " << money << endl;
cout << "using times in this month is " << times << endl;
if (freeze)
{
cout << "condition: has been frozen" << endl;
}
else
{
cout << "condition: normally" << endl;
}
cout << endl;
}
StudentCard::StudentCard(string a, string b, string c, double m, bool f, double d, int t)
{
ID = a;
password = b;
type = c;
money = m;
freeze = f;
discount = d;
times = t;
}
void StudentCard::BuyTicket(double ticketmoney, int amount) //买票
{
if (freeze)
{
cout << "this card has been freezen!\n";
return;
}
else
{
double cost = ticketmoney * discount * amount;
if (money >= cost)
{
money -= cost;
cout << "unit price is " << setprecision(2) << std::fixed << ticketmoney << endl;
cout << "amount is " << amount << endl;
cout << "discount is " << setprecision(2) << std::fixed << discount << endl;
cout << "total price is " << setprecision(2) << std::fixed << cost << endl;
cout << "remind money is " << setprecision(2) << std::fixed << money << endl;
cout << "ticket has been bought!\n";
TicketIncome += cost;
times++;
return;
}
else
{
cout << "not suffcient funds\n";
return;
}
}
}
ElderCard::ElderCard(string a, string b, string c, double m, bool f, double d, int t)
{
ID = a;
password = b;
type = c;
money = m;
freeze = f;
discount = d;
times = t;
}
void ElderCard::BuyTicket(double ticketmoney, int amount) //买票
{
if (freeze)
{
cout << "this card has been freezen\n";
return;
}
else
{
double cost = ticketmoney * discount * amount;
if (money >= cost)
{
money -= cost;
cout << "unit price is " << setprecision(2) << std::fixed << ticketmoney << endl;
cout << "amount is " << amount << endl;
cout << "discount is " << setprecision(2) << std::fixed << discount << endl;
cout << "total price is " << setprecision(2) << std::fixed << cost << endl;
cout << "remind money is " << setprecision(2) << std::fixed << money << endl;
cout << "ticket has been bought!\n";
TicketIncome += cost;
times++;
return;
}
else
{
cout << "not suffcient funds\n";
return;
}
}
} | [
"lizhihong001@users.noreply.github.com"
] | lizhihong001@users.noreply.github.com |
0022c88e84b271c03052e0779f66f5df038ed9da | e61f5b7a23c3b1ca014e4809e487e95a65fc3e2c | /Source/BansheeCore/Include/BsHString.h | 822b377ee1f46dab3297db57490cfa8073e42a78 | [] | no_license | ketoo/BansheeEngine | 83568cb22f2997162905223013f3f6d73ae4227e | 1ce5ec1bb46329695dd7cc13c0556b5bf7278e39 | refs/heads/master | 2021-01-02T08:49:09.416072 | 2017-08-01T15:46:42 | 2017-08-01T15:46:42 | 99,069,699 | 1 | 0 | null | 2017-08-02T03:48:06 | 2017-08-02T03:48:06 | null | UTF-8 | C++ | false | false | 3,047 | h | //********************************** Banshee Engine (www.banshee3d.com) **************************************************//
//**************** Copyright (c) 2016 Marko Pintera (marko.pintera@gmail.com). All rights reserved. **********************//
#pragma once
namespace bs
{
/** @addtogroup Localization
* @{
*/
/**
* String handle. Provides a wrapper around an Unicode string, primarily for localization purposes.
*
* Actual value for this string is looked up in a global string table based on the provided identifier string and
* currently active language. If such value doesn't exist then the identifier is used as is.
*
* Use {0}, {1}, etc. in the string value for values that might change dynamically.
*/
class BS_CORE_EXPORT HString
{
public:
/**
* Creates a new localized string with the specified identifier. If the identifier doesn't previously exist in the
* string table, identifier value will also be used for initializing the default language version of the string.
*
* @param[in] identifier String you can use for later referencing the localized string.
* @param[in] stringTableId Unique identifier of the string table to retrieve the string from.
*/
explicit HString(const WString& identifier, UINT32 stringTableId = 0);
/**
* Creates a new localized string with the specified identifier and sets the default language version of the
* string. If a string with that identifier already exists default language string will be updated.
*
* @param[in] identifier String you can use for later referencing the localized string.
* @param[in] defaultString Default string to assign to the specified identifier. Language to which it will be
* assigned depends on the StringTable::DEFAULT_LANGUAGE value.
* @param[in] stringTableId Unique identifier of the string table to retrieve the string from.
*/
explicit HString(const WString& identifier, const WString& defaultString, UINT32 stringTableId = 0);
/**
* Creates a new empty localized string.
*
* @param[in] stringTableId Unique identifier of the string table to retrieve the string from.
*/
HString(UINT32 stringTableId = 0);
HString(const HString& copy);
~HString();
HString& operator=(const HString& rhs);
operator const WString& () const;
const WString& getValue() const;
/**
* Sets a value of a string parameter. Parameters are specified as bracketed values within the string itself
* (for example {0}, {1}) etc. Use ^ as an escape character.
*
* @note This is useful for strings that have dynamically changing values, like numbers, embedded in them.
*/
void setParameter(UINT32 idx, const WString& value);
/** Returns an empty string. */
static const HString& dummy();
private:
SPtr<LocalizedStringData> mStringData;
WString* mParameters;
mutable bool mIsDirty;
mutable WString mCachedString;
mutable WString* mStringPtr;
};
/** @} */
} | [
"bearishsun@gmail.com"
] | bearishsun@gmail.com |
d95f1aa4caaa6558f1930f0c5420e3b2d8420f9e | d0c721a82a2b533a27be84922f96ea16fa73c602 | /chapter8/grade.cpp | 05e2bba874b26cab68f1286eae89e8b59db1b89a | [] | no_license | FangYang970206/Accelerated-CPP | ac154d4bf6d2c66e57af3563e14c9fb66116e0e1 | 62b46ed00ca16c4d2bbce14862c9381e2ae8b3c3 | refs/heads/master | 2020-03-28T03:45:55.955482 | 2018-10-15T12:17:11 | 2018-10-15T12:17:11 | 147,669,597 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 828 | cpp | #include <stdexcept>
#include <vector>
#include "median.h"
#include "grade.h"
using std::domain_error;
using std::vector;
double grade(double midterm, double final, double homework)
{
return 0.2 * midterm + 0.4 * final + 0.4 * homework;
}
double grade(double midterm, double final, const std::vector<double>& hw)
{
if(hw.size()==0)
throw domain_error("student have done no homework");
return grade(midterm, final, median(hw));
}
double grade(const Student_info& s)
{
return grade(s.midterm, s.final, s.homework);
}
bool fgrade(Student_info& s)
{
return grade(s) < 60 ? true: false;
}
double grade_aux(const Student_info& s){
try{
return grade(s);
}catch (domain_error){
return grade(s.midterm, s.final, 0);
}
}
bool pgrade(Student_info& s){
return !fgrade(s);
} | [
"15270989505@163.com"
] | 15270989505@163.com |
3aaa0c781b88515f854f22825708faa4df6d65a0 | 362e121cd809d39d73a490c4255a4a1aa082f827 | /waveblocks/shape_enum_subset.hpp | c3f38b61cbdf2bfde4f703653c3acd1004dd56ec | [] | no_license | benedek93/libwaveblocks-old | 2bc2cb9f055cd79f8ceb76a2f41cd337fda2d89f | 5b5e8675e228e65555389d7a3734c7c31ac23f42 | refs/heads/master | 2020-12-03T09:19:14.605056 | 2015-10-12T08:57:10 | 2015-10-12T08:57:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,332 | hpp | #ifndef WAVEBLOCKS_SHAPE_ENUM_SUBSET_HPP
#define WAVEBLOCKS_SHAPE_ENUM_SUBSET_HPP
#include <memory>
#include <array>
#include <Eigen/Core>
#include "basic_types.hpp"
#include "shape_enum.hpp"
#include "hawp_evaluator.hpp"
namespace waveblocks {
namespace shape_enum {
template<dim_t D>
bool _copy_subset__fast_equals(const std::array<int,D>& lhs, const std::array<int,D>& rhs)
{
// multi-indices are lexically sorted therefore first entries will almost always be identical
// this function compares entries beginning on last entries
for (dim_t i = D; i > 0; i--) {
if (lhs[i-1] != rhs[i-1])
return false;
}
return true;
}
/**
* \attention This function shows \e undefined \e behaviour if \p subset_slice is not a subset of \p superset_slice.
*
* \tparam D dimension of multi-index
* \tparam T component data type of \p superset_data and return value
* \tparam N number of quadrature points or \e Eigen::Dynamic
* \param[in] superset_data (#nodes in superset, #quadrature points)-matrix
* \param[in] superset_slice nodes within superset slice
* \param[in] subset_slice nodes within subset slice
* \return (#nodes in subset, #quadrature points)-matrix
*/
template<dim_t D, class MultiIndex, int N>
void copy_subset(const HaWpBasisVector<N>& superset_data, std::size_t offset1,
HaWpBasisVector<N>& subset_data, std::size_t offset2,
const ShapeSlice<D,MultiIndex>& superset_slice,
const ShapeSlice<D,MultiIndex>& subset_slice)
{
auto superset_it = superset_slice.begin();
auto subset_it = subset_slice.begin();
while (superset_it != superset_slice.end() && subset_it != subset_slice.end()) {
if (*superset_it == *subset_it) {
std::size_t sub = offset2 + (subset_it - subset_slice.begin());
std::size_t super = offset1 + (superset_it - superset_slice.begin());
subset_data.row(sub) = superset_data.row(super);
++subset_it;
}
++superset_it;
}
}
template<dim_t D, class MultiIndex, int N>
HaWpBasisVector<N> copy_subset(const HaWpBasisVector<N>& superset_data,
const ShapeSlice<D,MultiIndex>& superset_slice,
const ShapeSlice<D,MultiIndex>& subset_slice)
{
HaWpBasisVector<N> subset_data(subset_slice.size(), superset_data.cols());
copy_subset(superset_data, 0, subset_data, 0, superset_slice, subset_slice);
return subset_data;
}
template<dim_t D, class MultiIndex, int N>
HaWpBasisVector<N> copy_subset(const HaWpBasisVector<N>& superset_data,
const ShapeEnum<D,MultiIndex>* superset_enum,
const ShapeEnum<D,MultiIndex>* subset_enum)
{
HaWpBasisVector<N> subset_data(subset_enum->n_entries(), superset_data.cols());
std::size_t i_off = 0;
std::size_t o_off = 0;
for (int islice = 0; islice < subset_enum->n_slices(); islice++) {
copy_subset(superset_data, i_off, subset_data, o_off, superset_enum->slice(islice), subset_enum->slice(islice));
i_off += superset_enum->slice(islice).size();
o_off += subset_enum->slice(islice).size();
}
return subset_data;
}
} // namespace shape_enum
} // namespace waveblocks
#endif | [
"boeschm@student.ethz.ch"
] | boeschm@student.ethz.ch |
fcde1863d0973aef30bc2be56dc97cfc9aab81c2 | bd1fea86d862456a2ec9f56d57f8948456d55ee6 | /000/103/130/CWE427_Uncontrolled_Search_Path_Element__wchar_t_connect_socket_62b.cpp | 338219823954c1701e2e332f7aac0caf14d0298d | [] | no_license | CU-0xff/juliet-cpp | d62b8485104d8a9160f29213368324c946f38274 | d8586a217bc94cbcfeeec5d39b12d02e9c6045a2 | refs/heads/master | 2021-03-07T15:44:19.446957 | 2020-03-10T12:45:40 | 2020-03-10T12:45:40 | 246,275,244 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,770 | cpp | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE427_Uncontrolled_Search_Path_Element__wchar_t_connect_socket_62b.cpp
Label Definition File: CWE427_Uncontrolled_Search_Path_Element.label.xml
Template File: sources-sink-62b.tmpl.cpp
*/
/*
* @description
* CWE: 427 Uncontrolled Search Path Element
* BadSource: connect_socket Read data using a connect socket (client side)
* GoodSource: Use a hardcoded path
* Sinks:
* BadSink : Set the environment variable
* Flow Variant: 62 Data flow: data flows using a C++ reference from one function to another in different source files
*
* */
#include "std_testcase.h"
#include <wchar.h>
#ifdef _WIN32
#define NEW_PATH L"%SystemRoot%\\system32"
#define PUTENV _wputenv
#else
#define NEW_PATH L"/bin"
#define PUTENV putenv
#endif
#ifdef _WIN32
#include <winsock2.h>
#include <windows.h>
#include <direct.h>
#pragma comment(lib, "ws2_32") /* include ws2_32.lib when linking */
#define CLOSE_SOCKET closesocket
#else /* NOT _WIN32 */
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>
#define INVALID_SOCKET -1
#define SOCKET_ERROR -1
#define CLOSE_SOCKET close
#define SOCKET int
#endif
#define TCP_PORT 27015
#define IP_ADDRESS "127.0.0.1"
namespace CWE427_Uncontrolled_Search_Path_Element__wchar_t_connect_socket_62
{
#ifndef OMITBAD
void badSource(wchar_t * &data)
{
{
#ifdef _WIN32
WSADATA wsaData;
int wsaDataInit = 0;
#endif
int recvResult;
struct sockaddr_in service;
wchar_t *replace;
SOCKET connectSocket = INVALID_SOCKET;
size_t dataLen = wcslen(data);
do
{
#ifdef _WIN32
if (WSAStartup(MAKEWORD(2,2), &wsaData) != NO_ERROR)
{
break;
}
wsaDataInit = 1;
#endif
/* POTENTIAL FLAW: Read data using a connect socket */
connectSocket = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (connectSocket == INVALID_SOCKET)
{
break;
}
memset(&service, 0, sizeof(service));
service.sin_family = AF_INET;
service.sin_addr.s_addr = inet_addr(IP_ADDRESS);
service.sin_port = htons(TCP_PORT);
if (connect(connectSocket, (struct sockaddr*)&service, sizeof(service)) == SOCKET_ERROR)
{
break;
}
/* Abort on error or the connection was closed, make sure to recv one
* less char than is in the recv_buf in order to append a terminator */
/* Abort on error or the connection was closed */
recvResult = recv(connectSocket, (char *)(data + dataLen), sizeof(wchar_t) * (250 - dataLen - 1), 0);
if (recvResult == SOCKET_ERROR || recvResult == 0)
{
break;
}
/* Append null terminator */
data[dataLen + recvResult / sizeof(wchar_t)] = L'\0';
/* Eliminate CRLF */
replace = wcschr(data, L'\r');
if (replace)
{
*replace = L'\0';
}
replace = wcschr(data, L'\n');
if (replace)
{
*replace = L'\0';
}
}
while (0);
if (connectSocket != INVALID_SOCKET)
{
CLOSE_SOCKET(connectSocket);
}
#ifdef _WIN32
if (wsaDataInit)
{
WSACleanup();
}
#endif
}
}
#endif /* OMITBAD */
#ifndef OMITGOOD
/* goodG2B() uses the GoodSource with the BadSink */
void goodG2BSource(wchar_t * &data)
{
/* FIX: Set the path as the "system" path */
wcscat(data, NEW_PATH);
}
#endif /* OMITGOOD */
} /* close namespace */
| [
"frank@fischer.com.mt"
] | frank@fischer.com.mt |
c2bd87056aad2d2b2985a35532a116a28bccadc2 | 6a58045edb2f056c8f37f4efb3ef7242964f47e7 | /BattleEngine.cpp | 9a38348babf67cbda26e6de30f5303cdb76e9b76 | [] | no_license | iam4k33m/Poke-Mario | ce33a06c871a8ce3984ac646d2c4e5edb0e0113c | 4426aacfaed599d053e46a22eac4207d9ac41636 | refs/heads/master | 2022-02-21T21:35:44.240575 | 2019-10-03T17:02:51 | 2019-10-03T17:02:51 | 212,289,985 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,535 | cpp | #include "BattleEngine.h"
#include "Fighter.h"
#include <vector>
#include <iostream>
#include <thread>
#include "PlayerMoveSelector.h"
#include "CPUMoveSelector.h"
#include "Goomba.h"
#include "Koopa.h"
static const uint32 IDcount = 2;
template <class T> T* _Derive()
{
return new T();
}
Fighter* Derive(uint32 classType)
{
Fighter* instance = nullptr;
switch(classType)
{
case 0:
instance = _Derive<Goomba>();
break;
case 1:
instance = _Derive<Koopa>();
break;
default:
instance = _Derive<Fighter>();
instance->SetName("MissingNo");
break;
}
return instance;
}
BattleEngine::BattleEngine()
{
a = b = nullptr;
aIsCPU = bIsCPU = false;
secondsTowait = 0.0f;
}
Fighter *BattleEngine::GetA() const
{
return a;
}
Fighter *BattleEngine::GetB() const
{
return b;
}
std::vector<PlayerMoveSelector *> &BattleEngine::GetPlayerInputs()
{
return playerInputs;
}
std::vector<CPUMoveSelector *> &BattleEngine::GetCpuInputs()
{
return cpuInputs;
}
void BattleEngine::SetA(Fighter *a)
{
BattleEngine::a = a;
RegisterA(a);
}
void BattleEngine::SetB(Fighter *b)
{
BattleEngine::b = b;
RegisterB(b);
}
void BattleEngine::ProcessTurn()
{
a->Update();
b->Update();
if (a->GetSpeed() >= b->GetSpeed())
{
ProcessA();
ProcessB();
firstBuffer = a->GetBufferLine();
secondBuffer = b->GetBufferLine();
}
else
{
ProcessB();
ProcessA();
firstBuffer = b->GetBufferLine();
secondBuffer = a->GetBufferLine();
}
}
void BattleEngine::OutputTurn()
{
for(uint32 i = 0; i < firstBuffer->size() || i < secondBuffer->size(); i++)
{
if (i < firstBuffer->size())
{
std::cout << firstBuffer->at(i) + '\n';
std::this_thread::sleep_for(std::chrono::milliseconds((uint32)(secondsTowait * 1000)));
}
if(i < secondBuffer->size())
{
std::cout << secondBuffer->at(i) + '\n';
std::this_thread::sleep_for(std::chrono::milliseconds((uint32)(secondsTowait * 1000)));
}
}
if (CheckWin() > 0)
{
if (CheckWin() == 1)
{
std::cout << b->GetName() + " Fainted!\n";
}
else
{
std::cout << a->GetName() + " Fainted!\n";
}
}
}
uint32 BattleEngine::CheckWin()
{
uint32 result = 0;
if(a->GetHealth() == 0)
{
result = 2;
}
if(b->GetHealth() == 0)
{
result = 1;
}
return result;
}
void BattleEngine::RandomGenB()
{
float randomValue = RandomFloat();
randomValue *= (IDcount - 1);
uint32 ID = static_cast<int>(roundf(randomValue));
b = Derive(ID);
RegisterB(b);
}
void BattleEngine::RandomGenA()
{
float randomValue = RandomFloat();
randomValue *= (IDcount - 1);
uint32 ID = static_cast<int>(randomValue);
a = Derive(ID);
RegisterA(a);
}
void BattleEngine::RegisterA(Fighter* fighter)
{
if (aIsCPU)
{
CPUMoveSelector* selector = new CPUMoveSelector();
selector->SetPlayer(a);
cpuInputs.push_back(selector);
}
else
{
PlayerMoveSelector* selector = new PlayerMoveSelector();
selector->SetPlayer(a);
playerInputs.push_back(selector);
}
}
void BattleEngine::RegisterB(Fighter* fighter)
{
if (bIsCPU)
{
CPUMoveSelector* selector = new CPUMoveSelector();
selector->SetPlayer(b);
cpuInputs.push_back(selector);
}
else
{
PlayerMoveSelector* selector = new PlayerMoveSelector();
selector->SetPlayer(b);
playerInputs.push_back(selector);
}
}
void BattleEngine::ProcessA()
{
if(playerInputs.size() >= 2)
{
//If both are player controlled, a is 0;
playerInputs[0]->PlayerAttack(b);
}
else if (cpuInputs.size() >= 2)
{
//If both are cpu controlled, a is 0;
cpuInputs[0]->PlayerAttack(b);
}
else if(cpuInputs.size() == 1)
{
if(aIsCPU)
{
cpuInputs[0]->PlayerAttack(b);
}
else
{
playerInputs[0]->PlayerAttack(b);
}
}
}
void BattleEngine::ProcessB()
{
if (playerInputs.size() >= 2)
{
//If both are player controlled, b is 1;
playerInputs[1]->PlayerAttack(a);
}
else if (cpuInputs.size() >= 2)
{
//If both are cpu controlled, b is 1;
cpuInputs[1]->PlayerAttack(a);
}
else if (cpuInputs.size() == 1)
{
if (bIsCPU)
{
cpuInputs[0]->PlayerAttack(a);
}
else
{
playerInputs[0]->PlayerAttack(a);
}
}
}
bool BattleEngine::GetAIsCpu() const
{
return aIsCPU;
}
void BattleEngine::SetAIsCpu(bool aIsCpu)
{
aIsCPU = aIsCpu;
}
bool BattleEngine::GetBIsCpu() const
{
return bIsCPU;
}
void BattleEngine::SetBIsCpu(bool bIsCpu)
{
bIsCPU = bIsCpu;
}
float BattleEngine::GetSecondsTowait() const {
return secondsTowait;
}
void BattleEngine::SetSecondsTowait(float secondsTowait) {
BattleEngine::secondsTowait = secondsTowait;
}
| [
"55737236+iam4k33m@users.noreply.github.com"
] | 55737236+iam4k33m@users.noreply.github.com |
bc0be5be1c6b3fe2ef214e0beba54caa913ffc1d | 6aeccfb60568a360d2d143e0271f0def40747d73 | /sandbox/SOC/2006/concurrency/tags/postfinal_untested/boost/act/common_act_models.hpp | 2fcf5aa30fd8264ca0375e66062b624b38561693 | [] | no_license | ttyang/sandbox | 1066b324a13813cb1113beca75cdaf518e952276 | e1d6fde18ced644bb63e231829b2fe0664e51fac | refs/heads/trunk | 2021-01-19T17:17:47.452557 | 2013-06-07T14:19:55 | 2013-06-07T14:19:55 | 13,488,698 | 1 | 3 | null | 2023-03-20T11:52:19 | 2013-10-11T03:08:51 | C++ | UTF-8 | C++ | false | false | 1,645 | hpp | // Copyright (c) 2006, Matthew Calabrese
//
// This code may be used under either of the following two licences:
//
// 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. OF SUCH DAMAGE.
//
// Or:
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_ACT_COMMON_ACT_MODELS_HPP
#define BOOST_ACT_COMMON_ACT_MODELS_HPP
#include "common_act_models/immediate_act_model.hpp"
#include "common_act_models/concurrent_act_model.hpp"
#endif
| [
"doug.gregor@gmail.com"
] | doug.gregor@gmail.com |
ada1a7a3fa9cc01a86727193cbbb894eb3496fd7 | 2e563827001008fb16fa2a3bd7414c11fb02f65b | /glava10/qu01/bank_ac.h | c0868a02f8521e1fd67f7837c4ac7169ad37fe20 | [] | no_license | bowman85/prata- | 62f67ed72263865a4354fad979a4a7d551534cc4 | 3e344cf11e7cd79a14587d10a720ba26f7546846 | refs/heads/master | 2021-09-08T20:51:11.172130 | 2018-03-12T06:13:06 | 2018-03-12T06:13:06 | 115,730,602 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 966 | h | #ifndef BANK_ACCOUNT_H_
#define BANK_ACCOUNT_H_
#include <iostream>
#include <string>
#define SIZE 100
enum ITOG { FAILURE , SUCCESS } ;
using namespace std ;
class Bank_account {
private:
char Name_[SIZE] ;
string bill_;
double balance_ ;
public:
Bank_account() ;
Bank_account( char *name ) ;
Bank_account( const char *name ) ;
Bank_account( char *name , string &bill) ;
Bank_account( const char *name , string &bill) ;
Bank_account( char *name , const string &bill) ;
Bank_account( const char *name , const string &bill) ;
Bank_account( char *name, string & bill , double balance = 0.0 );
Bank_account( const char *name, const string & bill , double balance = 0.0 );
~Bank_account();
void showName();
void showBill();
void showBalance();
void PutMoney( double money) ;
int TakeOffMoney ( double money) ;
};
#endif | [
"evgeniy.volkov85@gmail.com"
] | evgeniy.volkov85@gmail.com |
e1ccee18ba51f624f8d81cc7012192268f8b47d7 | 8bf096c857cde9c39398ff50b12ce6ecc0f69e68 | /PCM/PLYReader.cpp | 884b8c2a750d03880a5332b1ae9d62cc9edbddaf | [] | no_license | JackZhouSz/ebpd_vs2015 | 796a346907a5a6be6c02d82bf0aeaa92566ea44e | 190248cd9e66ecaadb7111e50a4c30e34ff52f31 | refs/heads/master | 2023-03-20T09:14:38.661344 | 2017-06-30T14:26:20 | 2017-06-30T14:26:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,773 | cpp | #include "PLYReader.h"
#include "file_io.h"
#include "basic_types.h"
#include "sample.h"
#include "Importer.h"
//STL
#include <fstream>
namespace PCM{
namespace IO {
//=== INSTANCIATE =============================================================
_PLYReader_ __PLYReaderInstance;
_PLYReader_& PLYReader() {
return __PLYReaderInstance;
}
//=== IMPLEMENTATION ==========================================================
_PLYReader_::_PLYReader_() {
// FileIO::register_module(this);
}
//naive check
bool _PLYReader_::read(const std::string& _filename, BaseImporter& _bi, Options& _opt)
{
std::fstream in(_filename.c_str(), ( _opt/*options_.is_binary()*/ ? std::ios_base::binary | std::ios_base::in
: std::ios_base::in));
if (!in.is_open() || !in.good()) {
//omerr() << "[PLYReader] : cannot not open file " << _filename << std::endl;
return false;
}
bool result = read(in, _bi, _opt);
in.close();
return result;
}
bool _PLYReader_::read(std::istream& _in, BaseImporter& _bi, Options& _opt)
{
if (!_in.good()) {
// omerr() << "[PLYReader] : cannot not use stream" << std::endl;
return false;
}
//// filter relevant options for reading
//bool swap = _opt.check(Options::Swap);
//userOptions_ = _opt;
//// build options to be returned
//_opt.clear();
//if (options_.vertex_has_normal() && userOptions_.vertex_has_normal()) {
// _opt += Options::VertexNormal;
//}
//if (options_.vertex_has_texcoord() && userOptions_.vertex_has_texcoord()) {
// _opt += Options::VertexTexCoord;
//}
//if (options_.vertex_has_color() && userOptions_.vertex_has_color()) {
// _opt += Options::VertexColor;
//}
//if (options_.face_has_color() && userOptions_.face_has_color()) {
// _opt += Options::FaceColor;
//}
//if (options_.is_binary()) {
// _opt += Options::Binary;
//}
// //force user-choice for the alpha value when reading binary
// if ( options_.is_binary() && userOptions_.color_has_alpha() )
// options_ += Options::ColorAlpha;
bool swap = false;
return ( 0/*options_.is_binary()*/ ? read_binary(_in, _bi, swap) : read_ascii(_in, _bi));
return true;
}
bool _PLYReader_::can_u_read(const std::string& _filename) const
{
std::ifstream ifs(_filename.c_str());
if (ifs.is_open() && can_u_read(ifs)) {
ifs.close();
return true;
}
return true;
}
//naive check
bool _PLYReader_::can_u_read(std::istream& _is) const
{
// read 1st line
std::string line;
std::getline(_is, line);
//Check if this file is really a ply format
if (line != "PLY" && line != "ply")
return false;
return true;
}
bool _PLYReader_::read_ascii(std::istream& _in, BaseImporter& _bi) const
{
//omlog() << "[PLYReader] : read ascii file\n";
// Reparse the header
if (!can_u_read(_in)) {
// omerr() << "[PLYReader] : Unable to parse header\n";
return false;
}
unsigned int i, j, k, l, idx;
unsigned int nV;
pcm::PointType v;//OpenMesh::Vec3f v;
std::string trash;
pcm::PointType t;//OpenMesh::Vec2f t;
pcm::ColorType c;//OpenMesh::Vec4i c;
float tmp;
BaseImporter::VHandles vhandles;
int vh;//VertexHandle vh;
_bi.reserve(vertexCount_, 3* vertexCount_ , faceCount_);
/* if (vertexDimension_ != 3) {
omerr() << "[PLYReader] : Only vertex dimension 3 is supported." << std::endl;
return false;
}*/
// read vertices:
for (i = 0; i < vertexCount_ && !_in.eof(); ++i) {
v[0] = 0.0;
v[1] = 0.0;
v[2] = 0.0;
t[0] = 0.0;
t[1] = 0.0;
c[0] = 0;
c[1] = 0;
c[2] = 0;
c[3] = 255;
for (uint propertyIndex = 0; propertyIndex < vertexPropertyCount_; ++propertyIndex) {
switch (vertexPropertyMap_[propertyIndex].first) {
case XCOORD:
_in >> v[0];
break;
case YCOORD:
_in >> v[1];
break;
case ZCOORD:
_in >> v[2];
break;
case TEXX:
_in >> t[0];
break;
case TEXY:
_in >> t[1];
break;
case COLORRED:
if (vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT32 ||
vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT) {
_in >> tmp;
c[0] = (ScalarType)(tmp * 255.0f);
} else
_in >> c[0];
break;
case COLORGREEN:
if (vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT32 ||
vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT) {
_in >> tmp;
c[1] = (ScalarType)(tmp * 255.0f);
} else
_in >> c[1];
break;
case COLORBLUE:
if (vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT32 ||
vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT) {
_in >> tmp;
c[2] = (ScalarType)(tmp * 255.0f);
} else
_in >> c[2];
break;
case COLORALPHA:
if (vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT32 ||
vertexPropertyMap_[propertyIndex].second == ValueTypeFLOAT) {
_in >> tmp;
c[3] = (ScalarType)(tmp * 255.0f);
} else
_in >> c[3];
break;
default:
_in >> trash;
break;
}
}
vh = _bi.add_vertex(v);
//_bi.set_texcoord(vh, t);
_bi.set_color(vh, pcm::ColorType(c));
}
// faces
// #N <v1> <v2> .. <v(n-1)> [color spec]
for (i = 0; i < faceCount_; ++i) {
// nV = number of Vertices for current face
_in >> nV;
if (nV == 3) {
vhandles.resize(3);
_in >> j;
_in >> k;
_in >> l;
vhandles[0] = VertexHandle(j);
vhandles[1] = VertexHandle(k);
vhandles[2] = VertexHandle(l);
} else {
vhandles.clear();
for (j = 0; j < nV; ++j) {
_in >> idx;
vhandles.push_back(VertexHandle(idx));
}
}
// FaceHandle fh = _bi.add_face(vhandles);
}
// File was successfully parsed.
return true;
}
bool _PLYReader_::read_binary(std::istream& _in, BaseImporter& _bi, bool swap) const
{
return true;
}
float _PLYReader_::readToFloatValue(ValueType _type , std::fstream& _in) const
{
return 0.0;
}
void _PLYReader_::readValue(ValueType _type , std::istream& _in, float& _value) const
{
}
void _PLYReader_::readValue(ValueType _type, std::istream& _in, double& _value) const
{
}
void _PLYReader_::readValue(ValueType _type , std::istream& _in, unsigned int& _value) const
{
}
void _PLYReader_::readValue(ValueType _type , std::istream& _in, int& _value) const
{
}
void _PLYReader_::readInteger(ValueType _type, std::istream& _in, int& _value) const
{
}
void _PLYReader_::readInteger(ValueType _type, std::istream& _in, unsigned int& _value) const
{
}
}
}
| [
"528450012@qq.com"
] | 528450012@qq.com |
59c04ebfda9932fd4f089a72e90574c24cd4597b | 993d84420b2e3005b1b59370db26c79d702e380a | /kernel/U-XNNPACK/bench/f16-igemm.cc | 68ed7fefec157ba85c231047989609626eae6c8b | [
"MIT",
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla"
] | permissive | SKKU-ESLAB/Auto-Compression | 25588c5e87a141049b5816940d157a7a1c478e04 | 614048140f00e977e53178ce0417caaf31a29bc4 | refs/heads/master | 2022-12-14T20:33:25.242853 | 2022-12-01T07:13:45 | 2022-12-01T07:13:45 | 224,101,851 | 16 | 13 | MIT | 2022-12-01T07:13:46 | 2019-11-26T04:25:02 | C | UTF-8 | C++ | false | false | 8,981 | cc | // Copyright 2019 Google LLC
//
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree.
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <functional>
#include <random>
#include <vector>
#include <cpuinfo.h>
#include <benchmark/benchmark.h>
#include <fp16/fp16.h>
#include "bench/conv.h"
#include "bench/utils.h"
#include <xnnpack/AlignedAllocator.h>
#include <xnnpack/common.h>
#include <xnnpack/igemm.h>
#include <xnnpack/indirection.h>
#include <xnnpack/operator.h>
#include <xnnpack/pack.h>
#include <xnnpack/params-init.h>
#include <xnnpack/params.h>
static void IGEMMBenchmark(benchmark::State& state,
xnn_f16_igemm_minmax_ukernel_function f16_igemm,
uint32_t mr, uint32_t nr, uint32_t kr, uint32_t sr)
{
if (!cpuinfo_initialize()) {
state.SkipWithError("cpuinfo initialization failed");
}
if (!benchmark::utils::CheckNEONFP16ARITH(state)) {
return;
}
const size_t input_height = state.range(0);
const size_t input_width = state.range(1);
const size_t kernel_height = state.range(2);
const size_t kernel_width = state.range(3);
const size_t kernel_size = kernel_height * kernel_width;
const size_t padding_height = state.range(4);
const size_t padding_width = state.range(5);
const size_t subsampling = state.range(6);
const size_t dilation = state.range(7);
const size_t group_input_channels = state.range(8);
const size_t group_output_channels = state.range(9);
std::random_device random_device;
auto rng = std::mt19937(random_device());
auto f32rng = std::bind(std::uniform_real_distribution<float>(), std::ref(rng));
auto f16rng = std::bind(fp16_ieee_from_fp32_value, f32rng);
const size_t output_pixel_stride = group_output_channels;
const size_t input_pixel_stride = group_input_channels;
const size_t effective_kernel_height = (kernel_height - 1) * dilation + 1;
const size_t effective_kernel_width = (kernel_width - 1) * dilation + 1;
const size_t padding_left = padding_width / 2;
const size_t padding_top = padding_height / 2;
const size_t output_height = (input_height + padding_height - effective_kernel_height) / subsampling + 1;
const size_t output_width = (input_width + padding_width - effective_kernel_width) / subsampling + 1;
const size_t output_size = output_height * output_width;
const size_t mc_stride = benchmark::utils::RoundUp<size_t>(output_size, mr);
const size_t nc_stride = benchmark::utils::RoundUp<size_t>(group_output_channels, nr);
const size_t kc_stride = benchmark::utils::RoundUp<size_t>(group_input_channels, kr);
std::vector<uint16_t> a(input_height * input_width * input_pixel_stride);
std::generate(a.begin(), a.end(), std::ref(f16rng));
std::vector<uint16_t> k(group_output_channels * kernel_height * kernel_width * group_input_channels);
std::generate(k.begin(), k.end(), std::ref(f16rng));
std::vector<uint16_t> b(group_output_channels);
std::generate(b.begin(), b.end(), std::ref(f16rng));
std::vector<uint16_t> z(group_input_channels);
const size_t w_elements = (kernel_size * kc_stride + 1) * nc_stride;
const size_t i_elements = mc_stride * kernel_size;
const size_t c_elements = output_height * output_width * output_pixel_stride;
const size_t num_buffers = 1 +
benchmark::utils::DivideRoundUp<size_t>(benchmark::utils::GetMaxCacheSize(),
sizeof(uint16_t) * (w_elements + c_elements) + sizeof(void*) * i_elements);
std::vector<uint16_t, AlignedAllocator<uint16_t, 64>> w(w_elements * num_buffers);
std::fill(w.begin(), w.end(), 0);
xnn_pack_f16_conv_goki_w(
1 /* groups */, group_output_channels, kernel_size, group_input_channels,
nr, kr, sr, k.data(), b.data(), w.data(), 0 /* extra bytes */, nullptr);
for (size_t n = 1; n < num_buffers; n++) {
std::copy(w.cbegin(), w.cbegin() + w_elements, w.begin() + n * w_elements);
}
std::vector<const uint16_t*> i(i_elements * num_buffers);
xnn_operator convolution_op = { };
convolution_op.indirection_buffer = reinterpret_cast<const void**>(i.data());
convolution_op.input = a.data();
convolution_op.input_pixel_stride = input_pixel_stride;
convolution_op.zero_buffer = z.data();
convolution_op.groups = 1;
convolution_op.group_input_channels = group_input_channels;
convolution_op.batch_size = 1;
convolution_op.input_height = input_height;
convolution_op.input_width = input_width;
convolution_op.output_height = output_height;
convolution_op.output_width = output_width;
convolution_op.kernel_height = kernel_height;
convolution_op.kernel_width = kernel_width;
convolution_op.stride_height = subsampling;
convolution_op.stride_width = subsampling;
convolution_op.dilation_height = dilation;
convolution_op.dilation_width = dilation;
convolution_op.padding_top = padding_top;
convolution_op.padding_left = padding_left;
xnn_indirection_init_conv2d(&convolution_op, mr, 1 /* log2(sizeof(uint16_t)) */);
for (size_t n = 1; n < num_buffers; n++) {
std::copy(i.cbegin(), i.cbegin() + i_elements, i.begin() + n * i_elements);
}
std::vector<uint16_t> c(c_elements * num_buffers);
std::fill(c.begin(), c.end(), std::nanf(""));
// Prepare minmax parameters.
xnn_f16_scaleminmax_params params;
xnn_init_f16_scaleminmax_params(
¶ms,
UINT16_C(0x3C00), /* 1.0 */
UINT16_C(0x7C00), /* inf */
UINT16_C(0xFC00)); /* -inf */
size_t buffer_index = 0;
for (auto _ : state) {
state.PauseTiming();
benchmark::utils::PrefetchToL1(a.data(), a.size() * sizeof(uint16_t));
buffer_index = (buffer_index + 1) % num_buffers;
state.ResumeTiming();
for (uint32_t m = 0; m < output_size; m += mr) {
const uint32_t mb = min(output_size - m, mr);
for (uint32_t n = 0; n < group_output_channels; n += nr) {
const uint32_t nb = min(group_output_channels - n, nr);
f16_igemm(
mb, nb, group_input_channels * sizeof(uint16_t), kernel_size * mr * sizeof(void*),
reinterpret_cast<const void**>(i.data()) + buffer_index * i_elements + m,
w.data() + buffer_index * w_elements + n * (kc_stride * kernel_size + 1),
c.data() + buffer_index * c_elements + m * group_output_channels + n, group_output_channels * sizeof(uint16_t), nr * sizeof(uint16_t),
0, z.data(), ¶ms);
}
}
}
const uint64_t cpu_frequency = benchmark::utils::GetCurrentCpuFrequency();
if (cpu_frequency != 0) {
state.counters["cpufreq"] = cpu_frequency;
}
state.counters["FLOPS"] = benchmark::Counter(
uint64_t(state.iterations()) * 2 *
output_height * output_width *
group_input_channels * group_output_channels *
kernel_height * kernel_width,
benchmark::Counter::kIsRate);
}
#if XNN_ARCH_ARM64
static void f16_igemm_1x8__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_1x8__neonfp16arith_ld64, 1, 8, 1, 1);
}
static void f16_igemm_4x8__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_4x8__neonfp16arith_ld64, 4, 8, 1, 1);
}
static void f16_igemm_6x8__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_6x8__neonfp16arith_ld64, 6, 8, 1, 1);
}
static void f16_igemm_8x8__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_8x8__neonfp16arith_ld64, 8, 8, 1, 1);
}
static void f16_igemm_1x16__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_1x16__neonfp16arith_ld64, 1, 16, 1, 1);
}
static void f16_igemm_4x16__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_4x16__neonfp16arith_ld64, 4, 16, 1, 1);
}
static void f16_igemm_6x16__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_6x16__neonfp16arith_ld64, 6, 16, 1, 1);
}
static void f16_igemm_8x16__neonfp16arith_ld64(benchmark::State& state, const char* net) {
IGEMMBenchmark(state, xnn_f16_igemm_minmax_ukernel_8x16__neonfp16arith_ld64, 8, 16, 1, 1);
}
BENCHMARK_CONV(f16_igemm_1x8__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_4x8__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_6x8__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_8x8__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_1x16__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_4x16__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_6x16__neonfp16arith_ld64)
BENCHMARK_CONV(f16_igemm_8x16__neonfp16arith_ld64)
#endif // XNN_ARCH_ARM64
#ifndef XNNPACK_BENCHMARK_NO_MAIN
BENCHMARK_MAIN();
#endif
| [
"lhy920806@gmail.com"
] | lhy920806@gmail.com |
e742c9047acf3eaf5cea67ee18d3c36b9956d668 | acb225bb5eb394f86dbe9f1f6a11fdfc5015d203 | /src/wrapper/mongodb/detail/lct_mongo_helper.inl | fd2b6808d9fbf3a73245777361a7f3231d392891 | [] | no_license | free2rhyme/lct_frame_obsolete | 8210d924da8dcea01496b7b8f1f225dac40078ef | dc257e20b2ec2c349c32003b964fe3c752d65a9d | refs/heads/master | 2021-01-23T10:34:34.600668 | 2017-12-08T08:56:43 | 2017-12-08T08:56:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,064 | inl | /**********************************************************************
* @copyright Copyright (C), 2017
* @file lct_mongo_client_helper.inl
* @version 1.0
* @date Jun 23, 2017 3:51:40 PM
* @author wlc2rhyme@gmail.com
* @brief TODO
*********************************************************************/
#ifndef SRC_WRAPPER_MONGODB_LCT_MONGO_HELPER_INL_
#define SRC_WRAPPER_MONGODB_LCT_MONGO_HELPER_INL_
inline LCT_ERR_CODE CLctMongoHelper::setConnCount(const int32_t connMaxCount)
{
m_connMaxCount = connMaxCount;
return LCT_SUCCESS;
}
inline bool CLctMongoHelper::CMongoDriverStamp::operator==(const CMongoDriverStamp& that) const
{
return ((Port == that.Port) && (Ip == that.Ip));
}
inline bool CLctMongoHelper::CMongoDriverStamp::operator<(const CMongoDriverStamp& that) const
{
if(Ip < that.Ip){
return true;
}
if(Ip > that.Ip){
return false;
}
if(Port < that.Port){
return true;
} else {
return false;
}
}
#endif /* SRC_WRAPPER_MONGODB_LCT_MONGO_HELPER_INL_ */
| [
"liuyang@sensetime.com"
] | liuyang@sensetime.com |
0dc69035dd63afd79c7fffac1046daca567fa58c | a4f9f6e21befa6d0ad9fc33041dda9adacef76a8 | /main.cpp | 8603fcc5689c9970963d601f21ff990798fb89c8 | [] | no_license | Abuenameh/Canonical-Transformation-Dynamical-Gutzwiller-Casadi-IPC-New | 554354bfc9d7aa5fdb82cf51cd4d292ef650c2f9 | 555c4a338efbb670d3c473f3450a10e3c6d0b417 | refs/heads/master | 2021-01-13T09:49:47.742095 | 2015-11-28T04:30:38 | 2015-11-28T04:30:38 | 46,931,615 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 27,898 | cpp | /*
* File: main.cpp
* Author: Abuenameh
*
* Created on 17 November 2014, 22:05
*/
#include <cstdlib>
#include <queue>
using namespace std;
#include <boost/lexical_cast.hpp>
#include <boost/thread.hpp>
#include <boost/progress.hpp>
#include <boost/random.hpp>
#include <boost/filesystem.hpp>
#include <boost/filesystem/fstream.hpp>
#include <boost/date_time.hpp>
#include <boost/interprocess/containers/vector.hpp>
#include <boost/interprocess/managed_shared_memory.hpp>
#include <boost/interprocess/containers/string.hpp>
#include <boost/interprocess/sync/interprocess_condition.hpp>
#include <boost/interprocess/sync/interprocess_mutex.hpp>
#include <boost/interprocess/sync/scoped_lock.hpp>
using namespace boost;
using namespace boost::random;
using namespace boost::filesystem;
using namespace boost::posix_time;
//using namespace boost::interprocess;
using boost::interprocess::shared_memory_object;
using boost::interprocess::managed_shared_memory;
using boost::interprocess::create_only;
using boost::interprocess::open_only;
//using boost::interprocess::allocator;
using boost::interprocess::basic_string;
using boost::interprocess::interprocess_mutex;
using boost::interprocess::interprocess_condition;
//using boost::interprocess::interprocess_;
#include <boost/process.hpp>
using namespace boost::process;
using namespace boost::process::initializers;
#include <nlopt.hpp>
using namespace nlopt;
#include "gutzwiller.hpp"
#include "mathematica.hpp"
#include "casadi.hpp"
#include "orderparameter.hpp"
#include <casadi/interfaces/sundials/cvodes_interface.hpp>
typedef managed_shared_memory::segment_manager segment_manager_t;
typedef interprocess::allocator<void, segment_manager_t> void_allocator;
typedef interprocess::allocator<double, segment_manager_t> double_allocator;
typedef interprocess::vector<double, double_allocator> double_vector;
typedef interprocess::allocator<complex<double>, segment_manager_t> complex_allocator;
typedef interprocess::vector<complex<double>, complex_allocator> complex_vector;
typedef interprocess::allocator<complex_vector, segment_manager_t> complex_vector_allocator;
typedef interprocess::vector<complex_vector, complex_vector_allocator> complex_vector_vector;
typedef interprocess::allocator<char, segment_manager_t> char_allocator;
typedef interprocess::basic_string<char, std::char_traits<char>, char_allocator> char_string;
struct worker_input {
double Wi;
double Wf;
double mu;
double scale;
double_vector xi;
double U0;
double_vector J0;
double_vector x0;
complex_vector_vector f0;
char_string integrator;
worker_input(const void_allocator& void_alloc) : xi(void_alloc), J0(void_alloc), x0(void_alloc), f0(void_alloc), integrator(void_alloc) {
}
};
struct worker_tau {
interprocess_mutex mutex;
interprocess_condition cond_empty;
interprocess_condition cond_full;
double tau;
bool full;
worker_tau() : full(false) {
}
};
struct worker_output {
double Ei;
double Ef;
double Q;
double p;
double_vector Es;
complex_vector b0;
complex_vector bf;
complex_vector_vector f0;
complex_vector_vector ff;
char_string runtime;
bool success;
interprocess_mutex mutex;
interprocess_condition cond_empty;
interprocess_condition cond_full;
bool full;
worker_output(const void_allocator& void_alloc) : Es(void_alloc), b0(void_alloc), bf(void_alloc), f0(void_alloc), ff(void_alloc), runtime(void_alloc), full(false) {
}
};
struct results {
double tau;
double Ei;
double Ef;
double Q;
double p;
double U0;
vector<double> Es;
vector<double> J0;
vector<complex<double>> b0;
vector<complex<double>> bf;
vector<vector<complex<double>>> f0;
vector<vector<complex<double>>> ff;
string runtime;
// results(const void_allocator& void_alloc) : Es(void_alloc), J0(void_alloc), b0(void_alloc), bf(void_alloc), f0(void_alloc), ff(void_alloc), runtime(void_alloc) {
// }
};
double UWi(double W) {
return -2 * (g24 * g24) / Delta * (Ng * Ng * W * W) / ((Ng * Ng + W * W) * (Ng * Ng + W * W));
}
struct input {
double tau;
};
boost::mutex progress_mutex;
boost::mutex inputs_mutex;
boost::mutex problem_mutex;
boost::random::mt19937 rng;
boost::random::uniform_real_distribution<> uni(-1, 1);
void threadfunc(std::string prog, double tauf, queue<input>& inputs, vector<results>& res, progress_display& progress, int thread, managed_shared_memory& segment) {
void_allocator void_alloc(segment.get_segment_manager());
std::string tau_name = "tau" + lexical_cast<std::string>(thread);
worker_tau* tau = segment.construct<worker_tau>(tau_name.c_str())();
std::string output_name = "output" + lexical_cast<std::string>(thread);
worker_output* output = segment.construct<worker_output>(output_name.c_str())(void_alloc);
std::vector<std::string> args;
args.push_back(prog);
args.push_back("-1");
args.push_back(tau_name);
args.push_back(output_name);
execute(set_args(args));
for (;;) {
input in;
{
boost::mutex::scoped_lock lock(inputs_mutex);
if (inputs.empty()) {
interprocess::scoped_lock<interprocess_mutex> lock(tau->mutex);
if (tau->full) {
tau->cond_full.wait(lock);
}
tau->tau = -1;
tau->cond_empty.notify_one();
tau->full = true;
break;
}
in = inputs.front();
inputs.pop();
}
{
interprocess::scoped_lock<interprocess_mutex> lock(tau->mutex);
if (tau->full) {
tau->cond_full.wait(lock);
}
tau->tau = in.tau;
tau->cond_empty.notify_one();
tau->full = true;
}
// results pointRes(void_alloc);
results pointRes;
pointRes.tau = in.tau;
{
interprocess::scoped_lock<interprocess_mutex> lock(output->mutex);
if (!output->full) {
output->cond_empty.wait(lock);
}
pointRes.Ei = output->Ei;
pointRes.Ef = output->Ef;
pointRes.Q = output->Q;
pointRes.p = output->p;
pointRes.Es = vector<double>(output->Es.begin(), output->Es.end());
pointRes.b0 = vector<complex<double>>(output->b0.begin(), output->b0.end());
pointRes.bf = vector<complex<double>>(output->bf.begin(), output->bf.end());
pointRes.runtime = string(output->runtime.begin(), output->runtime.end());
// pointRes.Es = output->Es;
// pointRes.b0 = output->b0;
// pointRes.bf = output->bf;
// pointRes.f0 = output->f0;
// pointRes.ff = output->ff;
// pointRes.runtime = output->runtime;
output->full = false;
output->cond_full.notify_one();
}
{
boost::mutex::scoped_lock lock(inputs_mutex);
res.push_back(pointRes);
}
{
boost::mutex::scoped_lock lock(progress_mutex);
++progress;
}
}
segment.destroy_ptr<worker_output>(output);
}
double energyfunc(const vector<double>& x, vector<double>& grad, void* data) {
SXFunction* Egrad = (SXFunction*)data;
vector<double> dummy;
vector<DMatrix> res = (*Egrad)(vector<DMatrix>{x, dummy});
// grad = res[0];
copy(res[0].begin(), res[0].end(), grad.begin());
return res[1].toScalar();
}
worker_input* initialize(double Wi, double Wf, double mu, double scale, vector<double>& xi, managed_shared_memory& segment) {
SX f = SX::sym("f", 2 * L * dim);
SX dU = SX::sym("dU", L);
SX J = SX::sym("J", L);
SX U0 = SX::sym("U0");
U0 = UW(Wi)/scale;
for (int i = 0; i < L; i++) {
J[i] = JWij(Wi * xi[i], Wi * xi[mod(i + 1)])/scale;
dU[i] = UW(Wi * xi[i])/scale - U0;
}
SX E = energy(f, J, U0, dU, mu/scale, true);
SX E2 = energy(f, J, U0, dU, mu/scale, false);
SX g = SX::sym("g", L);
for (int i = 0; i < L; i++) {
g[i] = 0;
for (int n = 0; n < dim; n++) {
g[i] += f[2*(i*dim+n)]*f[2*(i*dim+n)] + f[2*(i*dim+n)+1]*f[2*(i*dim+n)+1];
}
}
SXFunction nlp("nlp", nlpIn("x", f), nlpOut("f", E));
NlpSolver solver("solver", "ipopt", nlp, make_dict("hessian_approximation", "limited-memory", "linear_solver", "ma86", "print_level", 0, "print_time", false, "obj_scaling_factor", 1));
// NlpSolver solver("solver", "ipopt", nlp, make_dict("hessian_approximation", "limited-memory", "linear_solver", "ma86", "print_level", 0, "print_time", false));
SXFunction nlp2("nlp", nlpIn("x", f), nlpOut("f", E2, "g", g));
NlpSolver solver2("solver", "ipopt", nlp2, make_dict("hessian_approximation", "limited-memory", "linear_solver", "ma86", "print_level", 0, "print_time", false, "obj_scaling_factor", 1));
boost::random::mt19937 rng;
boost::random::uniform_real_distribution<> uni(-1, 1);
vector<double> xrand(2 * L*dim, 1);
rng.seed();
for (int i = 0; i < 2 * L * dim; i++) {
xrand[i] = uni(rng);
// xrand[i] = (i+1.)/(2*L*dim);
// int site = i/(2*dim);
// xrand[i] = site/(2.*L*dim);
}
// vector<double> asd;
// double qwe = nlp2(vector<DMatrix>{xrand, asd})[0].toScalar();
// cout << ::math(qwe) << endl;
// return nullptr;
// exit(0);
Function Egrad = nlp.gradient();
vector<double> x02(xrand.begin(), xrand.end());
opt lopt(LD_LBFGS, 2 * L * dim);
lopt.set_lower_bounds(-1);
lopt.set_upper_bounds(1);
lopt.set_min_objective(energyfunc, &Egrad);
double E0;
lopt.optimize(x02, E0);
cout << "nlopt E0 = " << ::math(E0) << endl;
map<string, DMatrix> arg;
arg["lbx"] = -1;
arg["ubx"] = 1;
arg["x0"] = xrand;
arg["lbg"] = 1;
arg["ubg"] = 1;
map<string, DMatrix> res = solver(arg);
vector<double> x0 = res["x"].nonzeros();
// vector<double> x0 = xrand;
// cout << "x0 = " << ::math(x0) << endl;
cout << "Ipopt E0 = " << ::math(res["f"].toScalar()) << endl;
exit(0);
vector<complex<double>> x0i(dim);
for (int i = 0; i < L; i++) {
for (int n = 0; n <= nmax; n++) {
x0i[n] = complex<double>(x0[2 * (i * dim + n)], x0[2 * (i * dim + n) + 1]);
}
double nrm = sqrt(abs(dot(x0i, x0i)));
for (int n = 0; n <= nmax; n++) {
x0[2 * (i * dim + n)] /= nrm;
x0[2 * (i * dim + n) + 1] /= nrm;
}
}
// cout << "nlp: " << ::math(nlp(vector<DMatrix>{x0, vector<double>()})[0].toScalar()) << endl;
void_allocator void_alloc(segment.get_segment_manager());
worker_input* input = segment.construct<worker_input>("input")(void_alloc);
input->U0 = UW(Wi);
for (int i = 0; i < L; i++) {
input->J0.push_back(JWij(Wi * xi[i], Wi * xi[mod(i + 1)]));
}
for (int i = 0; i < 2 * L * dim; i++) {
input->x0.push_back(x0[i]);
}
for (int i = 0; i < L; i++) {
complex_vector f0i(dim, void_alloc);
for (int n = 0; n <= nmax; n++) {
f0i[n] = complex<double>(x0[2 * (i * dim + n)], x0[2 * (i * dim + n) + 1]);
}
input->f0.push_back(f0i);
}
input->Wi = Wi;
input->Wf = Wf;
input->mu = mu;
input->scale = scale;
for (int i = 0; i < L; i++) {
input->xi.push_back(xi[i]);
}
return input;
}
complex<double> dot(complex_vector& v, complex_vector& w) {
complex<double> res = 0;
for (int i = 0; i < v.size(); i++) {
res += ~v[i] * w[i];
}
return res;
}
void evolve(SXFunction& E0, SXFunction& Et, Function& ode_func, vector<double>& p, worker_input* input, worker_output* output, managed_shared_memory& segment) {
double scale = input->scale;
double tau = p[L+4]*scale;
// double tauf = tau;//2e-6;
double dt = 0.9e-9*scale;
Integrator integrator_rk("integrator", "rk", ode_func, make_dict("t0", 0, "tf", 2 * tau, "number_of_finite_elements", ceil((2 * tau) / dt)));
Integrator integrator_cvodes("integrator", "cvodes", ode_func, make_dict("t0", 0, "tf", 2 * tau, "exact_jacobian", false, "max_num_steps", 100000));
Integrator integrator;
if (input->integrator == "rk") {
integrator = integrator_rk;
}
if (input->integrator == "cvodes") {
integrator = integrator_cvodes;
}
ptime start_time = microsec_clock::local_time();
std::vector<double> x0;
for (int i = 0; i < 2 * L * dim; i++) {
x0.push_back(input->x0[i]);
}
void_allocator void_alloc(segment.get_segment_manager());
// map<string, DMatrix> res = integrator(make_map("x0", DMatrix(x0), "p", {
// tau
// }));
// map<string, DMatrix> res = integrator(make_map("x0", DMatrix(x0), "p", p));
integrator.setInput(DMatrix(x0), "x0");
integrator.setInput(DMatrix(p), "p");
integrator.reset();
vector<double> xf;
// double_vector Es(void_alloc);
int nt = 50;
output->Es.clear();
for (int i = 0; i < nt; i++) {
integrator.integrate((i+1.)/nt * 2 * tau);
xf = integrator.getOutput("xf").nonzeros();
// cout << (i+1.)/nt * 2 * tau << endl;
output->Es.push_back(Et(vector<DMatrix>{xf, (i+1.)/nt * 2 * tau, tau/scale})[0].toScalar());
}
// vector<double> xf = res["xf"].nonzeros();
complex_vector_vector ff(void_alloc);
for (int i = 0; i < L; i++) {
complex_vector ffi(void_alloc);
for (int n = 0; n <= nmax; n++) {
ffi.push_back(complex<double>(xf[2 * (i * dim + n)], xf[2 * (i * dim + n) + 1]));
}
double nrm = sqrt(abs(dot(ffi, ffi)));
for (int n = 0; n <= nmax; n++) {
ffi[n] /= nrm;
}
ff.push_back(ffi);
}
output->ff = ff;
complex_vector_vector& f0 = input->f0;
output->b0.clear();
output->bf.clear();
for (int i = 0; i < L; i++) {
output->b0.push_back(b(f0, i, input->J0, input->U0));
output->bf.push_back(b(ff, i, input->J0, input->U0));
}
output->Ei = E0(vector<DMatrix>{x0})[0].toScalar();
output->Ef = E0(vector<DMatrix>{xf})[0].toScalar();
output->Q = output->Ef - output->Ei;
vector<double> pi(L);
output->p = 0;
for (int i = 0; i < L; i++) {
pi[i] = 1 - norm(dot(ff[i], f0[i]));
output->p += pi[i];
}
output->p /= L;
ptime stop_time = microsec_clock::local_time();
time_period period(start_time, stop_time);
output->runtime = to_simple_string(period.length()).c_str();
}
void fail(std::string error, worker_output* output, managed_shared_memory& segment) {
void_allocator void_alloc(segment.get_segment_manager());
output->Ei = numeric_limits<double>::quiet_NaN();
output->Ef = numeric_limits<double>::quiet_NaN();
output->Q = numeric_limits<double>::quiet_NaN();
output->p = numeric_limits<double>::quiet_NaN();
output->Es = double_vector(1, numeric_limits<double>::quiet_NaN(), void_alloc);
complex_vector nan_vector(L, numeric_limits<double>::quiet_NaN(), void_alloc);
output->b0 = nan_vector;
output->bf = nan_vector;
complex_vector_vector nan_vector_vector(L, complex_vector(dim, numeric_limits<double>::quiet_NaN(), void_alloc), void_alloc);
output->f0 = nan_vector_vector;
output->ff = nan_vector_vector;
output->runtime = error.c_str();
}
void worker(worker_input* input, worker_tau* tau_in, worker_output* output, managed_shared_memory& segment) {//std::string tau_name, std::string output_name, managed_shared_memory& segment) {
double Wi = input->Wi;
double Wf = input->Wf;
double mu = input->mu;
double scale = input->scale;
double_vector xi = input->xi;
vector<double> p(L+5);
for (int i = 0; i < L; i++) {
p[i] = xi[i];
}
p[L] = Wi;
p[L+1] = Wf;
p[L+2] = mu;
p[L+3] = scale;
SX f = SX::sym("f", 2 * L * dim);
SX dU = SX::sym("dU", L);
SX J = SX::sym("J", L);
SX U0 = SX::sym("U0");
SX t = SX::sym("t");
SX tau = SX::sym("tau");
// SX tau = p[L+3];
SX Wt = if_else(t < tau*scale, Wi + (Wf - Wi) * t / (tau*scale), Wf + (Wi - Wf) * (t - tau*scale) / (tau*scale));
U0 = UW(Wt)/scale;
for (int i = 0; i < L; i++) {
J[i] = JWij(Wt * xi[i], Wt * xi[mod(i + 1)])/scale;
dU[i] = UW(Wt * xi[i])/scale - U0;
}
SX E = energy(f, J, U0, dU, mu/scale, true);
SXFunction Ef = SXFunction("E",{f, t, tau},
{
E
});
SXFunction E0 = SXFunction("E0",{f}, Ef(vector<SX>{f, 0, 1}));
// SX S = canonical(f, J, U0, dU, mu);
// SXFunction St("St",{t},
// {
// S
// });
// SX Sdt = St.gradient()(vector<SX>{t})[0];
//
//
// SXFunction HSr("HSr",{f},
// {
// Sdt
// });
// SX HSrdf = HSr.gradient()(vector<SX>{f})[0];
// SXFunction HSi("HSi",{f},
// {
// -E
// });
// SX HSidf = HSi.gradient()(vector<SX>{f})[0];
//
// SX ode = SX::sym("ode", 2 * L * dim);
// for (int j = 0; j < L * dim; j++) {
// ode[2 * j] = 0;
// ode[2 * j + 1] = 0;
// try {
// ode[2 * j] += 0.5 * HSrdf[2 * j];
// }
// catch (CasadiException& e) {
// }
// try {
// ode[2 * j] -= 0.5 * HSidf[2 * j + 1];
// }
// catch (CasadiException& e) {
// }
// try {
// ode[2 * j + 1] += 0.5 * HSidf[2 * j];
// }
// catch (CasadiException& e) {
// }
// try {
// ode[2 * j + 1] += 0.5 * HSrdf[2 * j + 1];
// }
// catch (CasadiException& e) {
// }
// }
// SXFunction ode_func = SXFunction("ode", daeIn("t", t, "x", f, "p", /*tau*/p), daeOut("ode", ode));
ExternalFunction ode_func("ode");
double taui;
for (;;) {
{
interprocess::scoped_lock<interprocess_mutex> lock(tau_in->mutex);
if (!tau_in->full) {
tau_in->cond_empty.wait(lock);
}
taui = tau_in->tau;
tau_in->full = false;
tau_in->cond_full.notify_one();
if (taui < 0) {
break;
}
}
p[L+4] = taui;
try {
evolve(E0, Ef, ode_func, p, input, output, segment);
}
catch (std::exception& e) {
fail(e.what(), output, segment);
}
{
interprocess::scoped_lock<interprocess_mutex> lock(output->mutex);
if (output->full) {
output->cond_full.wait(lock);
}
output->cond_empty.notify_one();
output->full = true;
}
}
segment.destroy_ptr<worker_tau>(tau_in);
}
void build_ode() {
SX p = SX::sym("p", L+5);
SX Wi = p[L];
SX Wf = p[L+1];
SX mu = p[L+2];
SX scale = p[L+3];
SX tau = p[L+4];
SX f = SX::sym("f", 2 * L * dim);
SX dU = SX::sym("dU", L);
SX J = SX::sym("J", L);
SX U0 = SX::sym("U0");
SX t = SX::sym("t");
SX Wt = if_else(t < tau*scale, Wi + (Wf - Wi) * t / (tau*scale), Wf + (Wi - Wf) * (t - tau*scale) / (tau*scale));
U0 = UW(Wt)/scale;
for (int i = 0; i < L; i++) {
J[i] = JWij(Wt * p[i], Wt * p[mod(i + 1)])/scale;
dU[i] = UW(Wt * p[i])/scale - U0;
}
SX scaledmu = mu/scale;
SX E = energy(f, J, U0, dU, scaledmu, true);
SXFunction Ef = SXFunction("E",{f, t, tau},
{
E
});
SXFunction E0 = SXFunction("E0",{f}, Ef(vector<SX>{f, 0, 1}));
SX S = canonical(f, J, U0, dU, scaledmu);
SXFunction St("St",{t},
{
S
});
SX Sdt = St.gradient()(vector<SX>{t})[0];
SXFunction HSr("HSr",{f},
{
Sdt
});
SX HSrdf = HSr.gradient()(vector<SX>{f})[0];
SXFunction HSi("HSi",{f},
{
-E
});
SX HSidf = HSi.gradient()(vector<SX>{f})[0];
SX ode = SX::sym("ode", 2 * L * dim);
for (int j = 0; j < L * dim; j++) {
ode[2 * j] = 0;
ode[2 * j + 1] = 0;
try {
ode[2 * j] += 0.5 * HSrdf[2 * j];
}
catch (CasadiException& e) {
}
try {
ode[2 * j] -= 0.5 * HSidf[2 * j + 1];
}
catch (CasadiException& e) {
}
try {
ode[2 * j + 1] += 0.5 * HSidf[2 * j];
}
catch (CasadiException& e) {
}
try {
ode[2 * j + 1] += 0.5 * HSrdf[2 * j + 1];
}
catch (CasadiException& e) {
}
}
SXFunction ode_func = SXFunction("ode", daeIn("t", t, "x", f, "p", p), daeOut("ode", ode));
ode_func.generate("ode");
}
/*
*
*/
int main(int argc, char** argv) {
// build_ode();
// return 0;
ptime begin = microsec_clock::local_time();
random::mt19937 rng;
random::uniform_real_distribution<> uni(-1, 1);
int seed = lexical_cast<int>(argv[1]);
if (seed != -1) {
double Wi = lexical_cast<double>(argv[2]);
double Wf = lexical_cast<double>(argv[3]);
double mu = lexical_cast<double>(argv[4]);
double scale = lexical_cast<double>(argv[5]);
double Ui = UWi(Wi);
double D = lexical_cast<double>(argv[6]);
double taui = lexical_cast<double>(argv[7]);
double tauf = lexical_cast<double>(argv[8]);
int ntaus = lexical_cast<int>(argv[9]);
int numthreads = lexical_cast<int>(argv[10]);
int resi = lexical_cast<int>(argv[11]);
// int integrator = lexical_cast<int>(argv[11]);
std::string intg = argv[12];
#ifdef AMAZON
// path resdir("/home/ubuntu/Results/Canonical Transformation Dynamical Gutzwiller");
path resdir("/home/ubuntu/Dropbox/Amazon EC2/Simulation Results/Canonical Transformation Dynamical Gutzwiller 2");
#else
path resdir("/Users/Abuenameh/Documents/Simulation Results/Canonical Transformation Dynamical Gutzwiller 2");
// path resdir("/Users/Abuenameh/Documents/Simulation Results/Dynamical Gutzwiller Hartmann Comparison");
#endif
if (!exists(resdir)) {
cerr << "Results directory " << resdir << " does not exist!" << endl;
exit(1);
}
ostringstream oss;
oss << "res." << resi << ".txt";
path resfile = resdir / oss.str();
//#ifndef AMAZON
while (exists(resfile)) {
resi++;
oss.str("");
oss << "res." << resi << ".txt";
resfile = resdir / oss.str();
}
//#endif
if (seed < 0) {
resi = seed;
oss.str("");
oss << "res." << resi << ".txt";
resfile = resdir / oss.str();
}
vector<double> xi(L, 1);
rng.seed(seed);
if (seed > -1) {
for (int j = 0; j < L; j++) {
xi[j] = (1 + D * uni(rng));
}
}
// double Ui = UWi(Wi);
double mui = mu * Ui;
filesystem::ofstream os(resfile);
printMath(os, "int", resi, intg);
printMath(os, "seed", resi, seed);
printMath(os, "Delta", resi, D);
printMath(os, "scale", resi, scale);
printMath(os, "mures", resi, mui);
printMath(os, "Ures", resi, Ui);
printMath(os, "xires", resi, xi);
os << flush;
printMath(os, "Wires", resi, Wi);
printMath(os, "Wfres", resi, Wf);
os << flush;
cout << "Res: " << resi << endl;
struct shm_remove {
shm_remove() {
shared_memory_object::remove("SharedMemory");
}
~shm_remove() {
shared_memory_object::remove("SharedMemory");
}
} remover;
int size = 1000 * (sizeof (worker_input) + numthreads * (sizeof (worker_tau) + sizeof (worker_output))); //2 * (((2 * L * dim + L + 1) + numthreads * (4 * L * dim + 5 * L + 6)) * sizeof (double) +numthreads * 2 * sizeof (ptime)/*sizeof(time_period)*/);
managed_shared_memory segment(create_only, "SharedMemory", size);
worker_input* w_input = initialize(Wi, Wf, mui, scale, xi, segment);
// return 0;
void_allocator void_alloc(segment.get_segment_manager());
char_string integrator(intg.begin(), intg.end(), void_alloc);
w_input->integrator = integrator;
queue<input> inputs;
if (ntaus == 1) {
input in;
in.tau = taui;
inputs.push(in);
}
else {
for (int i = 0; i < ntaus; i++) {
input in;
double tau = taui + i * (tauf - taui) / (ntaus - 1);
in.tau = tau;
inputs.push(in);
}
}
vector<results> res;
progress_display progress(inputs.size());
thread_group threads;
for (int i = 0; i < numthreads; i++) {
threads.create_thread(bind(&threadfunc, argv[0], tauf, boost::ref(inputs), boost::ref(res), boost::ref(progress), i, boost::ref(segment)));
}
threads.join_all();
vector<double> taures;
vector<double> Eires;
vector<double> Efres;
vector<double> Qres;
vector<double> pres;
vector<vector<double>> Esres;
vector<vector<complex<double>>> b0res;
vector<vector<complex<double>>> bfres;
// vector<complex_vector_vector> f0res;
// vector<complex_vector_vector> ffres;
vector<std::string> runtimeres;
for (results& ires : res) {
taures.push_back(ires.tau);
Eires.push_back(ires.Ei);
Efres.push_back(ires.Ef);
Qres.push_back(ires.Q);
pres.push_back(ires.p);
Esres.push_back(ires.Es);
b0res.push_back(ires.b0);
bfres.push_back(ires.bf);
runtimeres.push_back(replace_all_copy(ires.runtime, "\"", "\\\""));
// vector<double> Es(ires.Es.begin(), ires.Es.end());
// Esres.push_back(Es);
// vector<complex<double>> b0(ires.b0.begin(), ires.b0.end());
// vector<complex<double>> bf(ires.bf.begin(), ires.bf.end());
// b0res.push_back(b0);
// bfres.push_back(bf);
// f0res.push_back(ires.f0);
// ffres.push_back(ires.ff);
// std::string runtime(ires.runtime.begin(), ires.runtime.end());
// runtimeres.push_back(replace_all_copy(runtime, "\"", "\\\""));
}
printMath(os, "taures", resi, taures);
printMath(os, "Eires", resi, Eires);
printMath(os, "Efres", resi, Efres);
printMath(os, "Qres", resi, Qres);
printMath(os, "pres", resi, pres);
printMath(os, "U0res", resi, w_input->U0);
printMath(os, "J0res", resi, w_input->J0);
printMath(os, "Esres", resi, Esres);
printMath(os, "b0res", resi, b0res);
printMath(os, "bfres", resi, bfres);
// printMath(os, "f0res", resi, f0res);
// printMath(os, "ffres", resi, ffres);
printMath(os, "runtime", resi, runtimeres);
ptime end = microsec_clock::local_time();
time_period period(begin, end);
cout << endl << period.length() << endl << endl;
os << "totalruntime[" << resi << "]=\"" << period.length() << "\";" << endl;
segment.destroy<worker_input>("input");
}
else {
managed_shared_memory segment(open_only, "SharedMemory");
worker_input* input = segment.find<worker_input>("input").first;
worker_tau* tau = segment.find<worker_tau>(argv[2]).first;
worker_output* output = segment.find<worker_output>(argv[3]).first;
worker(input, tau, output, segment);
}
return 0;
}
| [
"abuenameh@gmail.com"
] | abuenameh@gmail.com |
5529f570961d6c20c53e8c28c93e8128206dcba4 | d6e78cc56ea0d6bdb79b92cb3b9a7517854b6549 | /Dojo/PatternMatch/PatternMatch.cpp | fe8dcac4b8489de605b644d1e36d06ead2283aca | [
"Apache-2.0"
] | permissive | complexbear/tinkering | a6eb186cf7a68856a01852bfc61c5a37eb6eef4a | 6ad260f065aa9938a760051816d916347271974d | refs/heads/master | 2021-01-14T10:53:34.693367 | 2018-07-26T09:35:30 | 2018-07-26T09:35:30 | 48,329,276 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,388 | cpp | // PatternMatch.cpp : Defines the entry point for the console application.
//
#define CATCH_CONFIG_MAIN
#include <string>
#include <iostream>
#include <catch.hpp>
using namespace std;
const char WILDCARD = '*';
vector<string> tokenize(const string& pattern) {
vector<string> tokens;
size_t prevpos = 0,
pos = pattern.find_first_of(WILDCARD);
while (pos != string::npos) {
string token = pattern.substr(prevpos, (pos-prevpos));
// If * at front of pattern, token will be empty
if(token.size())
tokens.push_back(token);
tokens.push_back("*");
prevpos = pos + 1;
pos = pattern.find_first_of(WILDCARD, prevpos);
};
// Catch any remaining text
if (prevpos < pattern.size())
tokens.push_back(pattern.substr(prevpos));
return tokens;
}
/*
* Match input string against pattern
* Pattern may consist of special character * which
* can match 0 or more repetitions of any other character
*
* A single * wildcard can only match repetitions of a single
* character.
* e.g. haat == h*t
* hart != h*t
*/
bool match(const string& input, const string& pattern) {
// Basic checks first
if (input == pattern) return true;
if (input.empty() && pattern.empty()) return true;
if (input.empty() && pattern.size()) return false;
if (input.size() && pattern.empty()) return false;
// TODO implement special all wildcard match
if (pattern == string(&WILDCARD, pattern.size())) return false;
// Break pattern into tokens separated by wildcard char
// Then successively match the tokens against the input string
vector<string> tokens = tokenize(pattern);
string prevToken;
int wildcards = 0;
auto iter = input.begin();
for (auto token : tokens) {
if (token.front() == WILDCARD) {
++wildcards;
}
else {
if (string(iter, iter + token.size()) == token) {
// Straight forward match
iter += token.size();
}
else if (wildcards) {
while (wildcards--) {
// Consume widcard characters until repeating sequence
// ends or a match against the token is found
char activeChar = *iter;
while (activeChar == *iter) {
if (string(iter, iter + token.size()) == token) {
wildcards = 0;
break;
}
++iter;
}
}
// No more wildcards left so check that the token now matches
if (string(iter, iter + token.size()) != token) {
return false;
}
iter += token.size();
}
else {
// No match and no active wildcards
return false;
}
}
prevToken = token;
if (iter >= input.end()) break;
}
return true;
}
TEST_CASE("Tokenize", "[PatternMatch]") {
REQUIRE(tokenize("hello") == vector<string>({ "hello" }));
REQUIRE(tokenize("h*llo") == vector<string>({ "h", "*", "llo" }));
REQUIRE(tokenize("h*llo*") == vector<string>({ "h", "*", "llo", "*" }));
REQUIRE(tokenize("*") == vector<string>({ "*" }));
REQUIRE(tokenize("*ello") == vector<string>({ "*", "ello" }));
}
TEST_CASE("Match", "[PatternMatch]") {
REQUIRE(match("hello", "hello"));
REQUIRE(match("hello", "*hello"));
REQUIRE(match("hello", "hello*"));
REQUIRE(match("hello", "*ello"));
REQUIRE(match("hello", "*he*o"));
REQUIRE(match("hello", "*h**o"));
REQUIRE(match("hello", "*he*lo"));
REQUIRE(match("", ""));
REQUIRE_FALSE(match("hello", ""));
REQUIRE_FALSE(match("hello", "**"));
REQUIRE_FALSE(match("hello", "*h*lo"));
REQUIRE_FALSE(match("hello", "*hlo"));
}
| [
"matthewpeterbrown@gmail.com"
] | matthewpeterbrown@gmail.com |
0bcd9b5d0f52b28b1d93d6e0113396c21bd8e9c1 | a9587b2db016852133aa26ab088e7cfdce900468 | /builtin/mods/js-policy/src/BasePolicy.cpp | 6c3938375277496d24d126e552c6067d35054627 | [] | no_license | codehz/cobblestone | b3affb99bd5bc133297895648686321c1b267a44 | a9632e6e7647f4af7002c649b232822defd7475b | refs/heads/master | 2022-02-24T07:47:25.851356 | 2019-09-21T16:19:28 | 2019-09-21T16:19:28 | 198,330,525 | 18 | 1 | null | 2019-08-15T07:54:37 | 2019-07-23T01:46:55 | C | UTF-8 | C++ | false | false | 119 | cpp | #include <mods-js-policy/policy.h>
BasePolicy::BasePolicy(bool def)
: result(def) {}
BasePolicy::~BasePolicy() {} | [
"CodeHz@outlook.com"
] | CodeHz@outlook.com |
da40496ecead7df93cd4065db49039476de85ba5 | b4a8756b53c7892cbccaf84d30e806bc8b01659d | /persist.cpp | 5da06251ee1677e94ae2544c26c514e9638b76c8 | [] | no_license | AhmedSakrr/botnet_client-1 | 4a7d34c41c362fd0df9195b2e233ef526eedffe6 | 1fb2ce2ed29e50f94668828a67bee697827a5c2c | refs/heads/master | 2023-06-26T09:55:41.110888 | 2020-10-04T22:25:50 | 2020-10-04T22:25:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 755 | cpp | #include <windows.h>
#include <string>
#include <iostream>
#include "persist.h"
using namespace std;
bool check_run() {
HKEY hkey;
LONG open_status = RegOpenKeyEx(HKEY_CURRENT_USER, L"SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Run\\behenchod", 0, KEY_READ ,&hkey);
if (open_status == ERROR_SUCCESS) {
return true;
}
return false;
}
bool set_run() {
HKEY hkey;
wstring svc = L"C:\\\\behenchod.exe";
LONG create_status = RegCreateKey(HKEY_CURRENT_USER, L"SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Run", &hkey);
LONG set_status = RegSetValueEx(hkey, L"behenchod", 0, REG_SZ, (BYTE *)svc.c_str(), (svc.size() + 1) * sizeof(wchar_t));
if (create_status == ERROR_SUCCESS && set_status == ERROR_SUCCESS) {
return true;
}
return false;
}
| [
"utkarsh@windows"
] | utkarsh@windows |
857080cb4e0a783367e905fdb8dabd16c32740c2 | 5d471f9fb26379ba80f4aacced6d24f58a9b6faa | /OpenGLGame/Fence.h | 2d507b88b63c492cb44a66ac7f886c316705b35d | [] | no_license | Olverine/openGL | 9fc62c84bb65f263dd760db9a32a2b11cc7918aa | a0c4b6014b6847e6551e40679edf27460359017c | refs/heads/master | 2021-01-13T04:39:32.414593 | 2017-02-03T08:30:10 | 2017-02-03T08:30:10 | 79,445,906 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 158 | h | #pragma once
#include <Engine.h>
class Fence : public GameObject
{
public:
Fence(glm::vec2 size);
~Fence();
void Render();
static glm::vec2 GetSize();
}; | [
"oliver.david.norin@gmail.com"
] | oliver.david.norin@gmail.com |
626f3ccbd22223dd94e836f1879a973a50c494aa | 973422e8a0ea40474b46082bbb5a146fa762e19c | /★winApi/Win32_game전체소스/10강/BallGame00/Pattern.h | 4f6df73518f6da7d134e522bd41061673ab99ac8 | [] | no_license | YunHoseon/InhaStudy | 45e0e7671dc09b313a1b3b4281dead93d8f33633 | edde0627d335a2cf83dd369b6a3b0b96d6aa4461 | refs/heads/master | 2022-12-08T16:03:25.194855 | 2020-09-14T19:19:10 | 2020-09-14T19:19:10 | 273,371,294 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 790 | h | #pragma once
enum DIRECTION { TOP, RIGHT_TOP, RIGHT, RIGHT_DOWN, DOWN, LEFT_DOWN, LEFT, LEFT_TOP, STOP };
struct MOVE_INFO
{
DIRECTION nDirection; // 방향
float fVelocity; //이동 속도
int nAllDistance; // 이동 전체 거리
DWORD dwDelayTime; // STOP 대기시간
int nDestX, nDestY; // 최종 좌표
};
class CPattern
{
private:
int m_nMoveCount; // 이동 속성 개수
int m_nX0, m_nY0; // 초기 위치
MOVE_INFO *m_pMoveInfo; // 이동 개수
public:
BOOL Load(char *filename);
BOOL Save(char *filename);
void Release();
MOVE_INFO GetMoveInfo(int nIndex);
POINT GetInitXY();
int GetMoveCount();
void CreateMoveInfo(int nMoveCount);
void SetMoveInfo(int nIndex, MOVE_INFO sMoveInfo);
void SetInitXY(POINT xy);
public:
CPattern(void);
~CPattern(void);
};
| [
"hosun2776@gmail.com"
] | hosun2776@gmail.com |
6e58e8fba21fed6a13b67403b3f28db138a57bec | 5784d3a8f50efb6e03dffd546e95a01124f68029 | /linked list/pair_swap.cpp | 51710800dc405edeab78736f277e420956b9c9af | [] | no_license | Krish203018/cpp | 55ad98635416552d52222342491982ccad8a7f6a | 5c249a23af5208cae89c2ea2496ed51591b02ab8 | refs/heads/main | 2023-07-28T05:27:38.842291 | 2021-09-11T09:17:48 | 2021-09-11T09:17:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 990 | cpp | #include<bits/stdc++.h>
using namespace std;
class node
{
public:
int data;
node* next;
};
void push(node** head,int new_data)
{
node* new_node=new node();
new_node->data=new_data;
new_node->next=*head;
*head=new_node;
}
void swapping(node* head)
{
node* temp= head;
while(temp !=NULL&&temp->next!=NULL)
{
swap(temp->data,temp->next->data);
temp = temp->next->next;
}
}
void print(node* head)
{
while(head!=NULL)
{
cout<<head->data<<" ";
head=head->next;
}
}
int main()
{
node* start = NULL;
/* The constructed linked list is:
1->2->3->4->5 */
push(&start, 5);
push(&start, 4);
push(&start, 3);
push(&start, 2);
push(&start, 1);
cout << "Linked list "
<< "before calling pairWiseSwap()\n";
print(start);
swapping(start);
cout << "\nLinked list "
<< "after calling pairWiseSwap()\n";
print(start);
return 0;
}
| [
"mohit_203015@saitm.org"
] | mohit_203015@saitm.org |
267f01958b3c595a36caa5d644d3be678d6af0dd | eef566c763ed0f4e0826f5848b60c30fdef70f07 | /cpp/ae.hpp | 923b7b1ff9768916e26e19036de4001b348f9eaf | [] | no_license | dsh0416/Deep-Music-Autoencoder | 571eee5bf88a5cdea137b203eea312100163d299 | e1af78e3673160de4df6703bf295628a6e4a1def | refs/heads/master | 2021-01-24T05:53:55.320819 | 2016-06-02T17:17:03 | 2016-06-02T17:17:03 | 60,282,397 | 0 | 0 | null | 2016-06-02T17:06:25 | 2016-06-02T17:06:24 | null | UTF-8 | C++ | false | false | 3,508 | hpp | #ifndef _A_E_HPP_
#define _A_E_HPP_
#include <string>
#include <vector>
#include <unordered_map>
#include <cstdlib>
#include <fstream>
#include <eigen3/Eigen/Dense>
#include "ps.hpp"
#include "utils.hpp"
using namespace std;
using Eigen::MatrixXd;
using Eigen::ArrayXXd;
using Eigen::VectorXd;
namespace paracel{
class autoencoder: public paracel::paralg{
public:
autoencoder(paracel::Comm, string, string, string, vector<int>, int, string = "sgd", string = "sigmoid", int = 1, double = 0.01, bool = false, int = 0, bool = false, double = 0.001, double = 0.0001, double = 3., int = 1, int = 0, int = 0, bool = false, double = 0.30, double = 0.1); // TO BE COMPLETED
virtual ~autoencoder();
void downpour_sgd(int); // downpour stochastic gradient descent
void distribute_bgd(int); // conventional batch-gradient descent
void downpour_sgd_mibt(int); // downpour stochastic gradient descent and mini-batch involved
void local_parser(const vector<string> &, const char = ',', bool = false);
void local_dump_Mat(const MatrixXd &, const string filename, const char = ',');
void train(int);
void train(); // top function
void dump_mat(const MatrixXd &, const string) const;
void dump_result(int) const;
MatrixXd acti_func(const MatrixXd &) const;
ArrayXXd acti_func_der(const MatrixXd &) const;
vector<unordered_map<string, MatrixXd> > GetWgtBias() const;
// init
void ae_init(void);
// compute cost function
double ae_cost(int) const;
// back-propogation batch gradient compute
unordered_map<string, MatrixXd> ae_batch_grad(int) const;
// back-propogation stochastic gradient compute
unordered_map<string, MatrixXd> ae_stoc_grad(int, int) const;
// BP with Mini-batch
unordered_map<string, MatrixXd> ae_mibt_stoc_grad(int, vector<int>) const;
// for DAE
void corrupt_data();
// compatinility of paracel and MatrixXd
void _paracel_write(string key, MatrixXd & m);
MatrixXd _paracel_read(string key, int r, int c);
VectorXd _paracel_read(string key);
void _paracel_bupdate(string key, MatrixXd & m);
// IT SHOULD BE CLASS-INVARIANT!!!
// conversion between Eigen::MatrixXd and std::vector
MatrixXd vec_to_mat(const vector<vector<double> > &); // row ordered
VectorXd vec_to_mat(const vector<double> &); // column ordered
MatrixXd vec_to_mat(const vector<double> &, int); // column ordered
MatrixXd vec_to_mat(const vector<double> &, int, int); // column ordered
vector<double> Mat_to_vec(const MatrixXd &); // column ordered
private:
string input; // where you store data over layers
string output; // where you dump out results
protected:
int worker_id;
int rounds;
int n_lyr; // number of hidden layers
int mibt_size;
int read_batch;
int update_batch;
string learning_method;
string acti_func_type;
bool debug = false;
vector<double> loss_error;
vector<unordered_map<string, MatrixXd> > WgtBias;
MatrixXd data;
vector< vector<double> > samples;
vector<int> labels; // if necessary
double lamb; // weight decay
double sparsity_param; // sparse KL comparison
double beta; // sparse penalty
double alpha; // learning step size
vector<int> hidden_size;
int visible_size;
vector<int> layer_size; // combine hidden_size and layer_size together
// for DAE
private:
bool corrupt;
double dvt; // deviation of Gaussion noise
double foc; // fraction of corrupted neurons
}; // class
} // namespace paracel
#endif
| [
"zhaojunbo@intern.douban.com"
] | zhaojunbo@intern.douban.com |
24128462d31440fd5683fa4d0e0df9dc44329524 | 6c77cf237697f252d48b287ae60ccf61b3220044 | /aws-cpp-sdk-s3/source/model/GetBucketAclRequest.cpp | a6842a85ca731ec9be6157d636643be1d1a3e7a5 | [
"MIT",
"Apache-2.0",
"JSON"
] | permissive | Gohan/aws-sdk-cpp | 9a9672de05a96b89d82180a217ccb280537b9e8e | 51aa785289d9a76ac27f026d169ddf71ec2d0686 | refs/heads/master | 2020-03-26T18:48:43.043121 | 2018-11-09T08:44:41 | 2018-11-09T08:44:41 | 145,232,234 | 1 | 0 | Apache-2.0 | 2018-08-30T13:42:27 | 2018-08-18T15:42:39 | C++ | UTF-8 | C++ | false | false | 1,824 | cpp | /*
* Copyright 2010-2017 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.
*/
#include <aws/s3/model/GetBucketAclRequest.h>
#include <aws/core/utils/xml/XmlSerializer.h>
#include <aws/core/utils/memory/stl/AWSStringStream.h>
#include <aws/core/http/URI.h>
#include <aws/core/utils/memory/stl/AWSStringStream.h>
#include <utility>
using namespace Aws::S3::Model;
using namespace Aws::Utils::Xml;
using namespace Aws::Utils;
using namespace Aws::Http;
GetBucketAclRequest::GetBucketAclRequest() :
m_bucketHasBeenSet(false),
m_customizedAccessLogTagHasBeenSet(false)
{
}
Aws::String GetBucketAclRequest::SerializePayload() const
{
return "";
}
void GetBucketAclRequest::AddQueryStringParameters(URI& uri) const
{
Aws::StringStream ss;
if(!m_customizedAccessLogTag.empty())
{
// only accept customized LogTag which starts with "x-"
Aws::Map<Aws::String, Aws::String> collectedLogTags;
for(const auto& entry: m_customizedAccessLogTag)
{
if (!entry.first.empty() && !entry.second.empty() && entry.first.substr(0, 2) == "x-")
{
collectedLogTags.emplace(entry.first, entry.second);
}
}
if (!collectedLogTags.empty())
{
uri.AddQueryStringParameter(collectedLogTags);
}
}
}
| [
"henso@amazon.com"
] | henso@amazon.com |
f1ba6ea695284e12a684d26e6ae34354c54c9491 | d2249116413e870d8bf6cd133ae135bc52021208 | /MFC CodeGuru/controls/IE4Classes/DateTimeCtrl.cpp | 5b0c90e9c3bbb6130344ed514f956ba81c32bbfb | [] | no_license | Unknow-man/mfc-4 | ecbdd79cc1836767ab4b4ca72734bc4fe9f5a0b5 | b58abf9eb4c6d90ef01b9f1203b174471293dfba | refs/heads/master | 2023-02-17T18:22:09.276673 | 2021-01-20T07:46:14 | 2021-01-20T07:46:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 28,623 | cpp | #include "stdafx.h"
#include "DateTimeCtrl.h"
#include <math.h>
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// Helper functions
static BOOL GetAsSystemTime(const CTime& tm, SYSTEMTIME& timeDest)
{
struct tm* ptm = tm.GetLocalTm(NULL);
if (ptm == NULL)
return FALSE;
timeDest.wYear = (WORD) (1900 + ptm->tm_year);
timeDest.wMonth = (WORD) (1 + ptm->tm_mon);
timeDest.wDay = (WORD) ptm->tm_mday;
timeDest.wHour = (WORD) ptm->tm_hour;
timeDest.wMinute = (WORD) ptm->tm_min;
timeDest.wSecond = (WORD) ptm->tm_sec;
timeDest.wMilliseconds = 0;
return TRUE;
}
static BOOL GetAsSystemTime(const CTime* ptm, SYSTEMTIME& timeDest)
{
return GetAsSystemTime(*ptm, timeDest);
}
// Verifies will fail if the needed buffer size is too large
#define MAX_TIME_BUFFER_SIZE 128 // matches that in timecore.cpp
#define MIN_DATE (-657434L) // about year 100
#define MAX_DATE 2958465L // about year 9999
// Half a second, expressed in days
#define HALF_SECOND (1.0/172800.0)
// One-based array of days in year at month start
static int nMonthDays[13] =
{0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365};
static BOOL TmFromOleDate(DATE dtSrc, struct tm& tmDest)
{
// The legal range does not actually span year 0 to 9999.
if (dtSrc > MAX_DATE || dtSrc < MIN_DATE) // about year 100 to about 9999
return FALSE;
long nDays; // Number of days since Dec. 30, 1899
long nDaysAbsolute; // Number of days since 1/1/0
long nSecsInDay; // Time in seconds since midnight
long nMinutesInDay; // Minutes in day
long n400Years; // Number of 400 year increments since 1/1/0
long n400Century; // Century within 400 year block (0,1,2 or 3)
long n4Years; // Number of 4 year increments since 1/1/0
long n4Day; // Day within 4 year block
// (0 is 1/1/yr1, 1460 is 12/31/yr4)
long n4Yr; // Year within 4 year block (0,1,2 or 3)
BOOL bLeap4 = TRUE; // TRUE if 4 year block includes leap year
double dblDate = dtSrc; // tempory serial date
// If a valid date, then this conversion should not overflow
nDays = (long)dblDate;
// Round to the second
dblDate += ((dtSrc > 0.0) ? HALF_SECOND : -HALF_SECOND);
nDaysAbsolute = (long)dblDate + 693959L; // Add days from 1/1/0 to 12/30/1899
dblDate = fabs(dblDate);
nSecsInDay = (long)((dblDate - floor(dblDate)) * 86400.);
// Calculate the day of week (sun=1, mon=2...)
// -1 because 1/1/0 is Sat. +1 because we want 1-based
tmDest.tm_wday = (int)((nDaysAbsolute - 1) % 7L) + 1;
// Leap years every 4 yrs except centuries not multiples of 400.
n400Years = (long)(nDaysAbsolute / 146097L);
// Set nDaysAbsolute to day within 400-year block
nDaysAbsolute %= 146097L;
// -1 because first century has extra day
n400Century = (long)((nDaysAbsolute - 1) / 36524L);
// Non-leap century
if (n400Century != 0)
{
// Set nDaysAbsolute to day within century
nDaysAbsolute = (nDaysAbsolute - 1) % 36524L;
// +1 because 1st 4 year increment has 1460 days
n4Years = (long)((nDaysAbsolute + 1) / 1461L);
if (n4Years != 0)
n4Day = (long)((nDaysAbsolute + 1) % 1461L);
else
{
bLeap4 = FALSE;
n4Day = (long)nDaysAbsolute;
}
}
else
{
// Leap century - not special case!
n4Years = (long)(nDaysAbsolute / 1461L);
n4Day = (long)(nDaysAbsolute % 1461L);
}
if (bLeap4)
{
// -1 because first year has 366 days
n4Yr = (n4Day - 1) / 365;
if (n4Yr != 0)
n4Day = (n4Day - 1) % 365;
}
else
{
n4Yr = n4Day / 365;
n4Day %= 365;
}
// n4Day is now 0-based day of year. Save 1-based day of year, year number
tmDest.tm_yday = (int)n4Day + 1;
tmDest.tm_year = n400Years * 400 + n400Century * 100 + n4Years * 4 + n4Yr;
// Handle leap year: before, on, and after Feb. 29.
if (n4Yr == 0 && bLeap4)
{
// Leap Year
if (n4Day == 59)
{
/* Feb. 29 */
tmDest.tm_mon = 2;
tmDest.tm_mday = 29;
goto DoTime;
}
// Pretend it's not a leap year for month/day comp.
if (n4Day >= 60)
--n4Day;
}
// Make n4DaY a 1-based day of non-leap year and compute
// month/day for everything but Feb. 29.
++n4Day;
// Month number always >= n/32, so save some loop time */
for (tmDest.tm_mon = (n4Day >> 5) + 1;
n4Day > nMonthDays[tmDest.tm_mon]; tmDest.tm_mon++);
tmDest.tm_mday = (int)(n4Day - nMonthDays[tmDest.tm_mon-1]);
DoTime:
if (nSecsInDay == 0)
tmDest.tm_hour = tmDest.tm_min = tmDest.tm_sec = 0;
else
{
tmDest.tm_sec = (int)nSecsInDay % 60L;
nMinutesInDay = nSecsInDay / 60L;
tmDest.tm_min = (int)nMinutesInDay % 60;
tmDest.tm_hour = (int)nMinutesInDay / 60;
}
return TRUE;
}
static BOOL GetAsSystemTime(const COleDateTime& dtm, SYSTEMTIME& sysTime)
{
BOOL bRetVal = FALSE;
if (dtm.GetStatus() == COleDateTime::valid)
{
struct tm tmTemp;
if (TmFromOleDate(dtm, tmTemp))
{
sysTime.wYear = (WORD) tmTemp.tm_year;
sysTime.wMonth = (WORD) tmTemp.tm_mon;
sysTime.wDayOfWeek = (WORD) tmTemp.tm_wday;
sysTime.wDay = (WORD) tmTemp.tm_mday;
sysTime.wHour = (WORD) tmTemp.tm_hour;
sysTime.wMinute = (WORD) tmTemp.tm_min;
sysTime.wSecond = (WORD) tmTemp.tm_sec;
sysTime.wMilliseconds = 0;
bRetVal = TRUE;
}
}
return bRetVal;
}
static BOOL GetAsSystemTime(const COleDateTime* pdtm, SYSTEMTIME& sysTime)
{
return GetAsSystemTime(*pdtm, sysTime);
}
/////////////////////////////////////////////////////////////////////////////
// CDateTimeCtrl
CDateTimeCtrl::CDateTimeCtrl()
{
// initialize common controls
INITCOMMONCONTROLSEX icex;
icex.dwSize = sizeof(icex);
icex.dwICC = ICC_DATE_CLASSES;
VERIFY(InitCommonControlsEx(&icex));
}
BOOL CDateTimeCtrl::Create(DWORD dwStyle, const RECT& rect,
CWnd* pParentWnd, UINT nID)
{
CWnd* pWnd = this;
BOOL bCreated = pWnd->Create(DATETIMEPICK_CLASS, NULL, dwStyle,
rect, pParentWnd, nID);
return bCreated;
}
DWORD CDateTimeCtrl::GetRange(CTime* pMinTime, CTime* pMaxTime) const
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
DWORD dwResult = ::SendMessage(m_hWnd, DTM_GETRANGE, 0, (LPARAM) &sysTimes);
if (pMinTime != NULL)
{
if (dwResult & GDTR_MIN)
*pMinTime = CTime(sysTimes[0]);
}
if (pMaxTime != NULL)
{
if (dwResult & GDTR_MAX)
*pMaxTime = CTime(sysTimes[1]);
}
return dwResult;
}
DWORD CDateTimeCtrl::GetRange(COleDateTime* pMinTime,
COleDateTime* pMaxTime) const
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
DWORD dwResult = ::SendMessage(m_hWnd, DTM_GETRANGE, 0, (LPARAM) &sysTimes);
if (pMinTime != NULL)
{
if (dwResult & GDTR_MIN)
*pMinTime = COleDateTime(sysTimes[0]);
else
pMinTime->SetStatus(COleDateTime::null);
}
if (pMaxTime != NULL)
{
if (dwResult & GDTR_MAX)
*pMaxTime = COleDateTime(sysTimes[1]);
else
pMaxTime->SetStatus(COleDateTime::null);
}
return dwResult;
}
BOOL CDateTimeCtrl::SetRange(const CTime* pMinTime, const CTime* pMaxTime)
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
WPARAM wFlags = 0;
if (pMinTime != NULL && GetAsSystemTime(pMinTime, sysTimes[0]))
wFlags |= GDTR_MIN;
if (pMaxTime != NULL && GetAsSystemTime(pMaxTime, sysTimes[1]))
wFlags |= GDTR_MAX;
return (BOOL) ::SendMessage(m_hWnd, DTM_SETRANGE, wFlags, (LPARAM) &sysTimes);
}
BOOL CDateTimeCtrl::SetRange(const COleDateTime* pMinTime, const COleDateTime* pMaxTime)
{
ASSERT(::IsWindow(m_hWnd));
ASSERT(pMinTime == NULL || pMinTime->GetStatus() != COleDateTime::invalid);
ASSERT(pMaxTime == NULL || pMaxTime->GetStatus() != COleDateTime::invalid);
SYSTEMTIME sysTime[2];
WPARAM wFlags = 0;
if (pMinTime != NULL && pMinTime->GetStatus() != COleDateTime::null)
{
if (GetAsSystemTime(pMinTime, sysTime[0]))
wFlags |= GDTR_MIN;
}
if (pMaxTime != NULL && pMaxTime->GetStatus() != COleDateTime::null)
{
if (GetAsSystemTime(pMaxTime, sysTime[1]))
wFlags |= GDTR_MAX;
}
return (BOOL) ::SendMessage(m_hWnd, DTM_SETRANGE, wFlags, (LPARAM) &sysTime);
}
BOOL CDateTimeCtrl::SetTime(LPSYSTEMTIME pTimeNew /* = NULL */)
{
ASSERT(::IsWindow(m_hWnd));
WPARAM wParam = (pTimeNew == NULL) ? GDT_NONE : GDT_VALID;
return (BOOL) ::SendMessage(m_hWnd, DTM_SETSYSTEMTIME,
wParam, (LPARAM) pTimeNew);
}
BOOL CDateTimeCtrl::SetTime(const COleDateTime& timeNew)
{
BOOL bRetVal = FALSE;
// make sure the time isn't invalid
ASSERT(timeNew.GetStatus() != COleDateTime::invalid);
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTime;
WPARAM wParam = GDT_NONE;
if (timeNew.GetStatus() == COleDateTime::valid &&
GetAsSystemTime(timeNew, sysTime))
{
wParam = GDT_VALID;
}
bRetVal = (BOOL) ::SendMessage(m_hWnd,
DTM_SETSYSTEMTIME, wParam, (LPARAM) &sysTime);
return bRetVal;
}
BOOL CDateTimeCtrl::SetTime(const CTime* pTimeNew)
{
BOOL bRetVal = FALSE;
// make sure the time isn't invalid
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTime;
WPARAM wParam = GDT_NONE;
if (pTimeNew != NULL && GetAsSystemTime(pTimeNew, sysTime))
{
wParam = GDT_VALID;
}
bRetVal = (BOOL) ::SendMessage(m_hWnd,
DTM_SETSYSTEMTIME, wParam, (LPARAM) &sysTime);
return bRetVal;
}
BOOL CDateTimeCtrl::GetTime(COleDateTime& timeDest) const
{
SYSTEMTIME sysTime;
BOOL bRetVal = TRUE;
LRESULT result = ::SendMessage(m_hWnd, DTM_GETSYSTEMTIME, 0, (LPARAM) &sysTime);
if (result == GDT_VALID)
{
timeDest = COleDateTime(sysTime);
bRetVal = TRUE;
ASSERT(timeDest.GetStatus() == COleDateTime::valid);
}
else if (result == GDT_NONE)
{
timeDest.SetStatus(COleDateTime::null);
bRetVal = TRUE;
}
else
timeDest.SetStatus(COleDateTime::invalid);
return bRetVal;
}
DWORD CDateTimeCtrl::GetTime(CTime& timeDest) const
{
SYSTEMTIME sysTime;
DWORD dwResult = (DWORD)
::SendMessage(m_hWnd, DTM_GETSYSTEMTIME, 0, (LPARAM) &sysTime);
if (dwResult == GDT_VALID)
timeDest = CTime(sysTime);
return dwResult;
}
CDateTimeCtrl::~CDateTimeCtrl()
{
DestroyWindow();
}
/////////////////////////////////////////////////////////////////////////////
// CMonthCalCtrl
CMonthCalCtrl::CMonthCalCtrl()
{
// initialize common controls
INITCOMMONCONTROLSEX icex;
icex.dwSize = sizeof(icex);
icex.dwICC = ICC_DATE_CLASSES;
VERIFY(InitCommonControlsEx(&icex));
}
BOOL CMonthCalCtrl::Create(DWORD dwStyle, const RECT& rect,
CWnd* pParentWnd, UINT nID)
{
CWnd* pWnd = this;
BOOL bCreated = pWnd->Create(MONTHCAL_CLASS, NULL, dwStyle,
rect, pParentWnd, nID);
return bCreated;
}
BOOL CMonthCalCtrl::Create(DWORD dwStyle, const POINT& pt,
CWnd* pParentWnd, UINT nID)
{
BOOL bWasVisible = (dwStyle & WS_VISIBLE);
dwStyle &= ~WS_VISIBLE;
CRect rect(pt.x, pt.y, 0, 0);
BOOL bRetVal = FALSE;
if (Create(dwStyle, rect, pParentWnd, nID))
{
if (SizeMinReq())
{
if (bWasVisible)
ShowWindow(SW_SHOWNA);
bRetVal = TRUE;
}
else
DestroyWindow();
}
return bRetVal;
}
BOOL CMonthCalCtrl::SizeMinReq(BOOL bRepaint /* = TRUE */)
{
CRect rect;
BOOL bRetVal = FALSE;
if (GetMinReqRect(rect))
{
DWORD dwFlags = SWP_NOZORDER | SWP_NOREPOSITION | SWP_NOMOVE | SWP_NOACTIVATE;
if (!bRepaint)
dwFlags |= SWP_NOREDRAW;
SetWindowPos(NULL, 0, 0, rect.Width(), rect.Height(), dwFlags);
bRetVal = TRUE;
}
return bRetVal;
}
void CMonthCalCtrl::SetToday(const COleDateTime& refTime)
{
ASSERT_VALID(this);
// make sure the time isn't invalid
ASSERT(refTime.GetStatus() != COleDateTime::invalid);
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTime;
LPSYSTEMTIME pSysTime = NULL;
WPARAM wParam = GDT_NONE;
// if the passed time is null or out of range,
// we'll set the control to NULL
if (GetAsSystemTime(refTime, sysTime))
{
pSysTime = &sysTime;
wParam = GDT_VALID;
}
if (::IsWindow(m_hWnd))
::SendMessage(m_hWnd, MCM_SETTODAY, wParam, (LPARAM) pSysTime);
}
void CMonthCalCtrl::SetToday(const CTime* pDateTime)
{
ASSERT(::IsWindow(m_hWnd));
ASSERT_VALID(this);
// if the passed time is NULL, we'll set the
// control to NULL
WPARAM wParam = GDT_NONE;
LPSYSTEMTIME pSysTime = NULL;
SYSTEMTIME sysTime;
if (pDateTime != NULL && GetAsSystemTime(pDateTime, sysTime))
{
wParam = GDT_VALID;
pSysTime = &sysTime;
}
if (::IsWindow(m_hWnd))
::SendMessage(m_hWnd, MCM_SETTODAY, wParam, (LPARAM) pSysTime);
}
BOOL CMonthCalCtrl::SetCurSel(const COleDateTime& refTime)
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTime;
BOOL bRetVal = FALSE;
// if the passed time is null or out of range,
// we'll set the control to NULL
if (GetAsSystemTime(refTime, sysTime) &&
refTime.GetStatus() == COleDateTime::valid)
{
bRetVal = (BOOL)
::SendMessage(m_hWnd, MCM_SETCURSEL, 0, (LPARAM) &sysTime);
}
return bRetVal;
}
BOOL CMonthCalCtrl::SetCurSel(const CTime& refTime)
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTime;
BOOL bRetVal = FALSE;
if (GetAsSystemTime(refTime, sysTime))
{
bRetVal = (BOOL)
::SendMessage(m_hWnd, MCM_SETCURSEL, 0, (LPARAM) &sysTime);
}
return bRetVal;
}
BOOL CMonthCalCtrl::GetCurSel(COleDateTime& refTime) const
{
ASSERT(::IsWindow(m_hWnd));
// can't use this method on multiple selection controls
ASSERT(!(GetStyle() & MCS_MULTISELECT));
SYSTEMTIME sysTime;
BOOL bResult = (BOOL)
::SendMessage(m_hWnd, MCM_GETCURSEL, 0, (LPARAM) &sysTime);
if (bResult)
refTime = COleDateTime(sysTime);
return bResult;
}
BOOL CMonthCalCtrl::GetToday(COleDateTime& refTime) const
{
ASSERT(::IsWindow(m_hWnd));
// can't use this method on multiple selection controls
ASSERT(!(GetStyle() & MCS_MULTISELECT));
SYSTEMTIME sysTime;
BOOL bResult = (BOOL)
::SendMessage(m_hWnd, MCM_GETTODAY, 0, (LPARAM) &sysTime);
if (bResult)
refTime = COleDateTime(sysTime);
return bResult;
}
BOOL CMonthCalCtrl::GetCurSel(CTime& refTime) const
{
ASSERT(::IsWindow(m_hWnd));
// can't use this method on multiple selection controls
ASSERT(!(GetStyle() & MCS_MULTISELECT));
SYSTEMTIME sysTime;
BOOL bResult = (BOOL)
::SendMessage(m_hWnd, MCM_GETCURSEL, 0, (LPARAM) &sysTime);
if (bResult)
refTime = CTime(sysTime);
return bResult;
}
BOOL CMonthCalCtrl::GetToday(CTime& refTime) const
{
ASSERT(::IsWindow(m_hWnd));
// can't use this method on multiple selection controls
ASSERT(!(GetStyle() & MCS_MULTISELECT));
SYSTEMTIME sysTime;
BOOL bResult = (BOOL)
::SendMessage(m_hWnd, MCM_GETTODAY, 0, (LPARAM) &sysTime);
if (bResult)
refTime = CTime(sysTime);
return bResult;
}
CMonthCalCtrl::~CMonthCalCtrl()
{
DestroyWindow();
}
int CMonthCalCtrl::GetFirstDayOfWeek(BOOL* pbLocal /* = NULL */) const
{
ASSERT(::IsWindow(m_hWnd));
DWORD dwResult;
dwResult = (DWORD) ::SendMessage(m_hWnd, MCM_GETFIRSTDAYOFWEEK, 0, 0);
// set *pbLocal to reflect if the first day of week
// matches current locale setting
if (pbLocal)
*pbLocal = HIWORD(dwResult);
return LOWORD(dwResult);
}
BOOL CMonthCalCtrl::SetFirstDayOfWeek(int iDay, int* lpnOld /* = NULL */)
{
ASSERT(::IsWindow(m_hWnd));
DWORD dwResult;
dwResult = (DWORD) ::SendMessage(m_hWnd, MCM_SETFIRSTDAYOFWEEK, 0, (WPARAM) iDay);
if (lpnOld != NULL)
*lpnOld = LOWORD(dwResult);
return (BOOL) HIWORD(dwResult);
}
BOOL CMonthCalCtrl::SetDayState(int nMonths, LPMONTHDAYSTATE pStates)
{
ASSERT(::IsWindow(m_hWnd));
ASSERT(AfxIsValidAddress(pStates, nMonths * sizeof(MONTHDAYSTATE), FALSE));
return (BOOL) ::SendMessage(m_hWnd, MCM_SETDAYSTATE, (WPARAM) nMonths, (LPARAM) pStates);
}
BOOL CMonthCalCtrl::SetRange(const COleDateTime* pMinRange,
const COleDateTime* pMaxRange)
{
ASSERT(::IsWindow(m_hWnd));
ASSERT(pMinRange == NULL || pMinRange->GetStatus() != COleDateTime::invalid);
ASSERT(pMaxRange == NULL || pMaxRange->GetStatus() != COleDateTime::invalid);
SYSTEMTIME sysTimes[2];
WPARAM wFlags = 0;
if (pMinRange != NULL && pMinRange->GetStatus() != COleDateTime::null)
{
if (GetAsSystemTime(pMinRange, sysTimes[0]))
wFlags |= GDTR_MIN;
}
if (pMaxRange != NULL && pMaxRange->GetStatus() != COleDateTime::null)
{
if (GetAsSystemTime(pMaxRange, sysTimes[1]))
wFlags |= GDTR_MAX;
}
return (BOOL)
::SendMessage(m_hWnd, MCM_SETRANGE, wFlags, (LPARAM) &sysTimes);
}
BOOL CMonthCalCtrl::SetRange(const LPSYSTEMTIME pMinRange,
const LPSYSTEMTIME pMaxRange)
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
WPARAM wFlags = 0;
if (pMinRange != NULL)
{
memcpy(&sysTimes[0], pMinRange, sizeof(SYSTEMTIME));
wFlags |= GDTR_MIN;
}
if (pMaxRange != NULL)
{
memcpy(&sysTimes[1], pMaxRange, sizeof(SYSTEMTIME));
wFlags |= GDTR_MAX;
}
return (BOOL)
::SendMessage(m_hWnd, MCM_SETRANGE, wFlags, (LPARAM) &sysTimes);
}
DWORD CMonthCalCtrl::GetRange(COleDateTime* pMinRange,
COleDateTime* pMaxRange) const
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
DWORD dwRanges = (DWORD)
::SendMessage(m_hWnd, MCM_GETRANGE, 0, (LPARAM) &sysTimes);
if (dwRanges & GDTR_MIN && pMinRange)
*pMinRange = COleDateTime(sysTimes[0]);
if (dwRanges & GDTR_MAX && pMaxRange)
*pMaxRange = COleDateTime(sysTimes[1]);
return dwRanges;
}
DWORD CMonthCalCtrl::GetRange(LPSYSTEMTIME pMinRange,
LPSYSTEMTIME pMaxRange) const
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
DWORD dwRanges = (DWORD)
::SendMessage(m_hWnd, MCM_GETRANGE, 0, (LPARAM) &sysTimes);
if (dwRanges & GDTR_MIN && pMinRange)
memcpy(pMinRange, &sysTimes[0], sizeof(SYSTEMTIME));
if (dwRanges & GDTR_MAX && pMaxRange)
memcpy(pMaxRange, &sysTimes[1], sizeof(SYSTEMTIME));
return dwRanges;
}
BOOL CMonthCalCtrl::SetRange(const CTime* pMinRange, const CTime* pMaxRange)
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
WPARAM wFlags = 0;
if (pMinRange != NULL && GetAsSystemTime(pMinRange, sysTimes[0]))
wFlags |= GDTR_MIN;
if (pMaxRange != NULL && GetAsSystemTime(pMaxRange, sysTimes[1]))
wFlags |= GDTR_MAX;
return (BOOL)
::SendMessage(m_hWnd, MCM_SETRANGE, wFlags, (LPARAM) &sysTimes);
}
DWORD CMonthCalCtrl::GetRange(CTime* pMinRange, CTime* pMaxRange) const
{
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
DWORD dwRanges = (DWORD)
::SendMessage(m_hWnd, MCM_GETRANGE, 0, (LPARAM) &sysTimes);
if (dwRanges & GDTR_MIN && pMinRange)
*pMinRange = CTime(sysTimes[0]);
if (dwRanges & GDTR_MAX && pMaxRange)
*pMaxRange = CTime(sysTimes[1]);
return dwRanges;
}
int CMonthCalCtrl::GetMonthRange(COleDateTime& refMinRange,
COleDateTime& refMaxRange, DWORD dwFlags) const
{
ASSERT(::IsWindow(m_hWnd));
ASSERT(dwFlags == GMR_DAYSTATE || dwFlags == GMR_VISIBLE);
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
int nCount = (int) ::SendMessage(m_hWnd, MCM_GETMONTHRANGE,
(WPARAM) dwFlags, (LPARAM) &sysTimes);
refMinRange = COleDateTime(sysTimes[0]);
refMaxRange = COleDateTime(sysTimes[1]);
return nCount;
}
int CMonthCalCtrl::GetMonthRange(LPSYSTEMTIME pMinRange,
LPSYSTEMTIME pMaxRange, DWORD dwFlags) const
{
ASSERT(::IsWindow(m_hWnd));
ASSERT_POINTER(pMinRange, SYSTEMTIME);
ASSERT_POINTER(pMaxRange, SYSTEMTIME);
SYSTEMTIME sysTimes[2];
int nCount = (int) ::SendMessage(m_hWnd, MCM_GETMONTHRANGE,
(WPARAM) dwFlags, (LPARAM) &sysTimes);
memcpy(pMinRange, &sysTimes[0], sizeof(SYSTEMTIME));
memcpy(pMaxRange, &sysTimes[1], sizeof(SYSTEMTIME));
return nCount;
}
int CMonthCalCtrl::GetMonthRange(CTime& refMinRange, CTime& refMaxRange,
DWORD dwFlags) const
{
ASSERT(::IsWindow(m_hWnd));
ASSERT(dwFlags == GMR_DAYSTATE || dwFlags == GMR_VISIBLE);
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
int nCount = (int) ::SendMessage(m_hWnd, MCM_GETMONTHRANGE,
(WPARAM) dwFlags, (LPARAM) &sysTimes);
refMinRange = CTime(sysTimes[0]);
refMaxRange = CTime(sysTimes[1]);
return nCount;
}
BOOL CMonthCalCtrl::GetSelRange(LPSYSTEMTIME pMinRange,
LPSYSTEMTIME pMaxRange) const
{
ASSERT(m_hWnd != NULL);
ASSERT((GetStyle() & MCS_MULTISELECT));
ASSERT_POINTER(pMinRange, SYSTEMTIME);
ASSERT_POINTER(pMaxRange, SYSTEMTIME);
SYSTEMTIME sysTimes[2];
BOOL bReturn = (BOOL) ::SendMessage(m_hWnd, MCM_GETSELRANGE,
0, (LPARAM) &sysTimes);
if (bReturn)
{
memcpy(pMinRange, &sysTimes[0], sizeof(SYSTEMTIME));
memcpy(pMaxRange, &sysTimes[1], sizeof(SYSTEMTIME));
}
return bReturn;
}
BOOL CMonthCalCtrl::SetSelRange(const LPSYSTEMTIME pMinRange,
const LPSYSTEMTIME pMaxRange)
{
ASSERT(m_hWnd != NULL);
ASSERT((GetStyle() & MCS_MULTISELECT));
ASSERT_POINTER(pMinRange, SYSTEMTIME);
ASSERT_POINTER(pMaxRange, SYSTEMTIME);
SYSTEMTIME sysTimes[2];
memcpy(&sysTimes[0], pMinRange, sizeof(SYSTEMTIME));
memcpy(&sysTimes[1], pMaxRange, sizeof(SYSTEMTIME));
return (BOOL) ::SendMessage(m_hWnd, MCM_SETSELRANGE,
0, (LPARAM) &sysTimes);
}
BOOL CMonthCalCtrl::SetSelRange(const COleDateTime& refMinRange,
const COleDateTime& refMaxRange)
{
// control must have multiple select
ASSERT((GetStyle() & MCS_MULTISELECT));
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
BOOL bResult = FALSE;
if (refMinRange.GetStatus() == COleDateTime::valid &&
refMinRange.GetStatus() == COleDateTime::valid)
{
if (GetAsSystemTime(refMinRange, sysTimes[0]) &&
GetAsSystemTime(refMaxRange, sysTimes[1]))
{
bResult = (BOOL)
::SendMessage(m_hWnd, MCM_SETSELRANGE, 0, (LPARAM)sysTimes);
}
}
return bResult;
}
BOOL CMonthCalCtrl::GetSelRange(COleDateTime& refMinRange,
COleDateTime& refMaxRange) const
{
// control must have multiple select
ASSERT((GetStyle() & MCS_MULTISELECT));
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
BOOL bResult = (BOOL)
::SendMessage(m_hWnd, MCM_GETSELRANGE, 0, (LPARAM) &sysTimes);
if (bResult)
{
refMinRange = COleDateTime(sysTimes[0]);
refMaxRange = COleDateTime(sysTimes[1]);
}
return bResult;
}
BOOL CMonthCalCtrl::SetSelRange(const CTime& refMinRange,
const CTime& refMaxRange)
{
// control must have multiple select
ASSERT((GetStyle() & MCS_MULTISELECT));
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
BOOL bResult = FALSE;
if (GetAsSystemTime(refMinRange, sysTimes[0]) &&
GetAsSystemTime(refMaxRange, sysTimes[1]))
{
bResult = (BOOL)
::SendMessage(m_hWnd, MCM_SETSELRANGE, 0, (LPARAM)sysTimes);
}
return bResult;
}
BOOL CMonthCalCtrl::GetSelRange(CTime& refMinRange, CTime& refMaxRange) const
{
// control must have multiple select
ASSERT((GetStyle() & MCS_MULTISELECT));
ASSERT(::IsWindow(m_hWnd));
SYSTEMTIME sysTimes[2];
memset(sysTimes, 0, sizeof(sysTimes));
BOOL bResult = (BOOL)
::SendMessage(m_hWnd, MCM_GETSELRANGE, 0, (LPARAM) &sysTimes);
if (bResult)
{
refMinRange = CTime(sysTimes[0]);
refMaxRange = CTime(sysTimes[1]);
}
return bResult;
}
/////////////////////////////////////////////////////////////////////////////
// DDX_ routines
void AFXAPI DDX_DateTimeCtrl(CDataExchange* pDX, int nIDC, COleDateTime& value)
{
HWND hWndCtrl = pDX->PrepareCtrl(nIDC);
CDateTimeCtrl* pWnd = (CDateTimeCtrl*) CWnd::FromHandle(hWndCtrl);
if (pDX->m_bSaveAndValidate)
pWnd->GetTime(value);
else
pWnd->SetTime(value);
}
void AFXAPI DDX_DateTimeCtrl(CDataExchange* pDX, int nIDC, CTime& value)
{
HWND hWndCtrl = pDX->PrepareCtrl(nIDC);
CDateTimeCtrl* pWnd = (CDateTimeCtrl*) CWnd::FromHandle(hWndCtrl);
if (pDX->m_bSaveAndValidate)
pWnd->GetTime(value);
else
pWnd->SetTime(&value);
}
void AFXAPI DDX_MonthCalCtrl(CDataExchange* pDX, int nIDC,
COleDateTime& value)
{
HWND hWndCtrl = pDX->PrepareCtrl(nIDC);
CMonthCalCtrl* pWnd = (CMonthCalCtrl*) CWnd::FromHandle(hWndCtrl);
if (pDX->m_bSaveAndValidate)
pWnd->GetCurSel(value);
else
pWnd->SetCurSel(value);
}
void AFXAPI DDX_MonthCalCtrl(CDataExchange* pDX, int nIDC, CTime& value)
{
HWND hWndCtrl = pDX->PrepareCtrl(nIDC);
CMonthCalCtrl* pWnd = (CMonthCalCtrl*) CWnd::FromHandle(hWndCtrl);
if (pDX->m_bSaveAndValidate)
pWnd->GetCurSel(value);
else
pWnd->SetCurSel(value);
}
void AFXAPI DDV_MinMaxDateTime(CDataExchange* pDX, CTime& refValue,
const CTime* pMinRange, const CTime* pMaxRange)
{
ASSERT(pMinRange == NULL || pMaxRange == NULL || *pMinRange <= *pMaxRange);
CDateTimeCtrl* pWnd =
(CDateTimeCtrl*) CWnd::FromHandle(pDX->m_hWndLastControl);
if (!pDX->m_bSaveAndValidate)
{
if ( (pMinRange != NULL && *pMinRange > refValue) ||
(pMaxRange != NULL && *pMaxRange < refValue))
{
#ifdef _DEBUG
int nIDC = GetWindowLong(pDX->m_hWndLastControl, GWL_ID);
TRACE1("Warning: initial dialog data is out of range in control ID %d.\n", nIDC);
#endif
return; // don't stop now
}
}
pWnd->SetRange(pMinRange, pMaxRange);
}
void AFXAPI DDV_MinMaxDateTime(CDataExchange* pDX, COleDateTime& refValue,
const COleDateTime* pMinRange, const COleDateTime* pMaxRange)
{
ASSERT(pMinRange == NULL || pMaxRange == NULL || *pMinRange <= *pMaxRange);
CDateTimeCtrl* pWnd =
(CDateTimeCtrl*) CWnd::FromHandle(pDX->m_hWndLastControl);
if (!pDX->m_bSaveAndValidate)
{
if ( (pMinRange != NULL && *pMinRange > refValue) ||
(pMaxRange != NULL && *pMaxRange < refValue))
{
int nIDC = GetWindowLong(pDX->m_hWndLastControl, GWL_ID);
TRACE1("Warning: initial dialog data is out of range in control ID %d.\n", nIDC);
return; // don't stop now
}
}
pWnd->SetRange(pMinRange, pMaxRange);
}
void AFXAPI DDV_MinMaxMonth(CDataExchange* pDX, CTime& refValue,
const CTime* pMinRange, const CTime* pMaxRange)
{
ASSERT(pMinRange == NULL || pMaxRange == NULL || *pMinRange <= *pMaxRange);
CMonthCalCtrl* pWnd =
(CMonthCalCtrl*) CWnd::FromHandle(pDX->m_hWndLastControl);
if (!pDX->m_bSaveAndValidate)
{
if ( (pMinRange != NULL && *pMinRange > refValue) ||
(pMaxRange != NULL && *pMaxRange < refValue))
{
#ifdef _DEBUG
int nIDC = GetWindowLong(pDX->m_hWndLastControl, GWL_ID);
TRACE1("Warning: initial dialog data is out of range in control ID %d.\n", nIDC);
#endif
return; // don't stop now
}
}
pWnd->SetRange(pMinRange, pMaxRange);
}
void AFXAPI DDV_MinMaxMonth(CDataExchange* pDX, COleDateTime& refValue,
const COleDateTime* pMinRange, const COleDateTime* pMaxRange)
{
ASSERT(pMinRange == NULL || pMaxRange == NULL || *pMinRange <= *pMaxRange);
CMonthCalCtrl* pWnd =
(CMonthCalCtrl*) CWnd::FromHandle(pDX->m_hWndLastControl);
if (!pDX->m_bSaveAndValidate)
{
if ( (pMinRange != NULL && *pMinRange > refValue) ||
(pMaxRange != NULL && *pMaxRange < refValue))
{
#ifdef _DEBUG
int nIDC = GetWindowLong(pDX->m_hWndLastControl, GWL_ID);
TRACE1("Warning: initial dialog data is out of range in control ID %d.\n", nIDC);
#endif
return; // don't stop now
}
}
pWnd->SetRange(pMinRange, pMaxRange);
}
/////////////////////////////////////////////////////////////////////////////
IMPLEMENT_DYNAMIC(CDateTimeCtrl, CWnd)
IMPLEMENT_DYNAMIC(CMonthCalCtrl, CWnd)
/////////////////////////////////////////////////////////////////////////////
| [
"chenchao0632@163.com"
] | chenchao0632@163.com |
8b63bdb3f9ec18db51ed96a022b084ac51151c0f | 641fa8341d8c436ad24945bcbf8e7d7d1dd7dbb2 | /remoting/protocol/protocol_mock_objects.h | 9cf56b9895ca359207913e56e4d7c97725652f1a | [
"BSD-3-Clause"
] | permissive | massnetwork/mass-browser | 7de0dfc541cbac00ffa7308541394bac1e945b76 | 67526da9358734698c067b7775be491423884339 | refs/heads/master | 2022-12-07T09:01:31.027715 | 2017-01-19T14:29:18 | 2017-01-19T14:29:18 | 73,799,690 | 4 | 4 | BSD-3-Clause | 2022-11-26T11:53:23 | 2016-11-15T09:49:29 | null | UTF-8 | C++ | false | false | 8,839 | h | // Copyright (c) 2012 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.
#ifndef REMOTING_PROTOCOL_PROTOCOL_MOCK_OBJECTS_H_
#define REMOTING_PROTOCOL_PROTOCOL_MOCK_OBJECTS_H_
#include <cstdint>
#include <map>
#include <memory>
#include <string>
#include "base/location.h"
#include "base/macros.h"
#include "base/memory/ptr_util.h"
#include "base/single_thread_task_runner.h"
#include "base/values.h"
#include "net/base/ip_endpoint.h"
#include "remoting/proto/internal.pb.h"
#include "remoting/proto/video.pb.h"
#include "remoting/protocol/authenticator.h"
#include "remoting/protocol/channel_authenticator.h"
#include "remoting/protocol/client_stub.h"
#include "remoting/protocol/clipboard_stub.h"
#include "remoting/protocol/connection_to_client.h"
#include "remoting/protocol/host_stub.h"
#include "remoting/protocol/input_stub.h"
#include "remoting/protocol/pairing_registry.h"
#include "remoting/protocol/session.h"
#include "remoting/protocol/session_manager.h"
#include "remoting/protocol/transport.h"
#include "remoting/protocol/video_stub.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "third_party/webrtc/libjingle/xmllite/xmlelement.h"
namespace remoting {
namespace protocol {
class MockAuthenticator : public Authenticator {
public:
MockAuthenticator();
~MockAuthenticator() override;
MOCK_CONST_METHOD0(state, Authenticator::State());
MOCK_CONST_METHOD0(started, bool());
MOCK_CONST_METHOD0(rejection_reason, Authenticator::RejectionReason());
MOCK_CONST_METHOD0(GetAuthKey, const std::string&());
MOCK_CONST_METHOD0(CreateChannelAuthenticatorPtr, ChannelAuthenticator*());
MOCK_METHOD2(ProcessMessage,
void(const buzz::XmlElement* message,
const base::Closure& resume_callback));
MOCK_METHOD0(GetNextMessagePtr, buzz::XmlElement*());
std::unique_ptr<ChannelAuthenticator> CreateChannelAuthenticator()
const override {
return base::WrapUnique(CreateChannelAuthenticatorPtr());
}
std::unique_ptr<buzz::XmlElement> GetNextMessage() override {
return base::WrapUnique(GetNextMessagePtr());
}
private:
DISALLOW_COPY_AND_ASSIGN(MockAuthenticator);
};
class MockConnectionToClientEventHandler
: public ConnectionToClient::EventHandler {
public:
MockConnectionToClientEventHandler();
~MockConnectionToClientEventHandler() override;
MOCK_METHOD0(OnConnectionAuthenticating, void());
MOCK_METHOD0(OnConnectionAuthenticated, void());
MOCK_METHOD0(CreateMediaStreams, void());
MOCK_METHOD0(OnConnectionChannelsConnected, void());
MOCK_METHOD1(OnConnectionClosed, void(ErrorCode error));
MOCK_METHOD1(OnCreateVideoEncoder,
void(std::unique_ptr<VideoEncoder>* encoder));
MOCK_METHOD2(OnRouteChange,
void(const std::string& channel_name,
const TransportRoute& route));
private:
DISALLOW_COPY_AND_ASSIGN(MockConnectionToClientEventHandler);
};
class MockClipboardStub : public ClipboardStub {
public:
MockClipboardStub();
~MockClipboardStub() override;
MOCK_METHOD1(InjectClipboardEvent, void(const ClipboardEvent& event));
private:
DISALLOW_COPY_AND_ASSIGN(MockClipboardStub);
};
class MockCursorShapeChangeCallback {
public:
MockCursorShapeChangeCallback();
virtual ~MockCursorShapeChangeCallback();
MOCK_METHOD1(CursorShapeChangedPtr, void(CursorShapeInfo* info));
void CursorShapeChanged(std::unique_ptr<CursorShapeInfo> info);
private:
DISALLOW_COPY_AND_ASSIGN(MockCursorShapeChangeCallback);
};
class MockInputStub : public InputStub {
public:
MockInputStub();
~MockInputStub() override;
MOCK_METHOD1(InjectKeyEvent, void(const KeyEvent& event));
MOCK_METHOD1(InjectTextEvent, void(const TextEvent& event));
MOCK_METHOD1(InjectMouseEvent, void(const MouseEvent& event));
MOCK_METHOD1(InjectTouchEvent, void(const TouchEvent& event));
private:
DISALLOW_COPY_AND_ASSIGN(MockInputStub);
};
class MockHostStub : public HostStub {
public:
MockHostStub();
~MockHostStub() override;
MOCK_METHOD1(NotifyClientResolution,
void(const ClientResolution& resolution));
MOCK_METHOD1(ControlVideo, void(const VideoControl& video_control));
MOCK_METHOD1(ControlAudio, void(const AudioControl& audio_control));
MOCK_METHOD1(SetCapabilities, void(const Capabilities& capabilities));
MOCK_METHOD1(RequestPairing, void(const PairingRequest& pairing_request));
MOCK_METHOD1(DeliverClientMessage, void(const ExtensionMessage& message));
private:
DISALLOW_COPY_AND_ASSIGN(MockHostStub);
};
class MockClientStub : public ClientStub {
public:
MockClientStub();
~MockClientStub() override;
// ClientStub mock implementation.
MOCK_METHOD1(SetCapabilities, void(const Capabilities& capabilities));
MOCK_METHOD1(SetPairingResponse,
void(const PairingResponse& pairing_response));
MOCK_METHOD1(DeliverHostMessage, void(const ExtensionMessage& message));
MOCK_METHOD1(SetVideoLayout, void(const VideoLayout& layout));
// ClipboardStub mock implementation.
MOCK_METHOD1(InjectClipboardEvent, void(const ClipboardEvent& event));
// CursorShapeStub mock implementation.
MOCK_METHOD1(SetCursorShape, void(const CursorShapeInfo& cursor_shape));
private:
DISALLOW_COPY_AND_ASSIGN(MockClientStub);
};
class MockCursorShapeStub : public CursorShapeStub {
public:
MockCursorShapeStub();
~MockCursorShapeStub() override;
MOCK_METHOD1(SetCursorShape, void(const CursorShapeInfo& cursor_shape));
private:
DISALLOW_COPY_AND_ASSIGN(MockCursorShapeStub);
};
class MockVideoStub : public VideoStub {
public:
MockVideoStub();
~MockVideoStub() override;
MOCK_METHOD2(ProcessVideoPacketPtr,
void(const VideoPacket* video_packet,
const base::Closure& done));
void ProcessVideoPacket(std::unique_ptr<VideoPacket> video_packet,
const base::Closure& done) override {
ProcessVideoPacketPtr(video_packet.get(), done);
}
private:
DISALLOW_COPY_AND_ASSIGN(MockVideoStub);
};
class MockSession : public Session {
public:
MockSession();
~MockSession() override;
MOCK_METHOD1(SetEventHandler, void(Session::EventHandler* event_handler));
MOCK_METHOD0(error, ErrorCode());
MOCK_METHOD1(SetTransport, void(Transport*));
MOCK_METHOD0(jid, const std::string&());
MOCK_METHOD0(config, const SessionConfig&());
MOCK_METHOD1(Close, void(ErrorCode error));
private:
DISALLOW_COPY_AND_ASSIGN(MockSession);
};
class MockSessionManager : public SessionManager {
public:
MockSessionManager();
~MockSessionManager() override;
MOCK_METHOD1(AcceptIncoming, void(const IncomingSessionCallback&));
void set_protocol_config(
std::unique_ptr<CandidateSessionConfig> config) override {}
MOCK_METHOD2(ConnectPtr,
Session*(const std::string& host_jid,
Authenticator* authenticator));
MOCK_METHOD0(Close, void());
MOCK_METHOD1(set_authenticator_factory_ptr,
void(AuthenticatorFactory* factory));
std::unique_ptr<Session> Connect(
const std::string& host_jid,
std::unique_ptr<Authenticator> authenticator) override {
return base::WrapUnique(ConnectPtr(host_jid, authenticator.get()));
}
void set_authenticator_factory(
std::unique_ptr<AuthenticatorFactory> authenticator_factory) override {
set_authenticator_factory_ptr(authenticator_factory.release());
}
private:
DISALLOW_COPY_AND_ASSIGN(MockSessionManager);
};
// Simple delegate that caches information on paired clients in memory.
class MockPairingRegistryDelegate : public PairingRegistry::Delegate {
public:
MockPairingRegistryDelegate();
~MockPairingRegistryDelegate() override;
// PairingRegistry::Delegate implementation.
std::unique_ptr<base::ListValue> LoadAll() override;
bool DeleteAll() override;
protocol::PairingRegistry::Pairing Load(
const std::string& client_id) override;
bool Save(const protocol::PairingRegistry::Pairing& pairing) override;
bool Delete(const std::string& client_id) override;
private:
typedef std::map<std::string, protocol::PairingRegistry::Pairing> Pairings;
Pairings pairings_;
};
class SynchronousPairingRegistry : public PairingRegistry {
public:
explicit SynchronousPairingRegistry(std::unique_ptr<Delegate> delegate);
protected:
~SynchronousPairingRegistry() override;
// Runs tasks synchronously instead of posting them to |task_runner|.
void PostTask(const scoped_refptr<base::SingleThreadTaskRunner>& task_runner,
const tracked_objects::Location& from_here,
const base::Closure& task) override;
};
} // namespace protocol
} // namespace remoting
#endif // REMOTING_PROTOCOL_PROTOCOL_MOCK_OBJECTS_H_
| [
"xElvis89x@gmail.com"
] | xElvis89x@gmail.com |
41291a0ccd5f3e9e17ec6ef3d1c9829909932653 | 878d5503e8539f0dedf8842741b7479e6df8fa0d | /src/main.cpp | e72db454118763cc832ccdee190cd71fba96ebbc | [
"MIT"
] | permissive | clarisli/CarND-Path-Planning-Project | baeb38e87fd68f5626f73382b82c3f2389e56460 | 1ccee8be4e08fc5ca5914447b8d3c20e70126ebe | refs/heads/master | 2020-03-30T04:01:01.748734 | 2018-09-30T13:46:30 | 2018-09-30T13:46:30 | 150,720,096 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,529 | cpp | #include <fstream>
#include <math.h>
#include <uWS/uWS.h>
#include <chrono>
#include <iostream>
#include <thread>
#include <vector>
#include "Eigen-3.3/Eigen/Core"
#include "Eigen-3.3/Eigen/QR"
#include "json.hpp"
#include "spline.h"
using namespace std;
// for convenience
using json = nlohmann::json;
// For converting back and forth between radians and degrees.
constexpr double pi() { return M_PI; }
double deg2rad(double x) { return x * pi() / 180; }
double rad2deg(double x) { return x * 180 / pi(); }
// Checks if the SocketIO event has JSON data.
// If there is data the JSON object in string format will be returned,
// else the empty string "" will be returned.
string hasData(string s) {
auto found_null = s.find("null");
auto b1 = s.find_first_of("[");
auto b2 = s.find_first_of("}");
if (found_null != string::npos) {
return "";
} else if (b1 != string::npos && b2 != string::npos) {
return s.substr(b1, b2 - b1 + 2);
}
return "";
}
double distance(double x1, double y1, double x2, double y2)
{
return sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
}
int ClosestWaypoint(double x, double y, const vector<double> &maps_x, const vector<double> &maps_y)
{
double closestLen = 100000; //large number
int closestWaypoint = 0;
for(int i = 0; i < maps_x.size(); i++)
{
double map_x = maps_x[i];
double map_y = maps_y[i];
double dist = distance(x,y,map_x,map_y);
if(dist < closestLen)
{
closestLen = dist;
closestWaypoint = i;
}
}
return closestWaypoint;
}
int NextWaypoint(double x, double y, double theta, const vector<double> &maps_x, const vector<double> &maps_y)
{
int closestWaypoint = ClosestWaypoint(x,y,maps_x,maps_y);
double map_x = maps_x[closestWaypoint];
double map_y = maps_y[closestWaypoint];
double heading = atan2((map_y-y),(map_x-x));
double angle = fabs(theta-heading);
angle = min(2*pi() - angle, angle);
if(angle > pi()/4)
{
closestWaypoint++;
if (closestWaypoint == maps_x.size())
{
closestWaypoint = 0;
}
}
return closestWaypoint;
}
// Transform from Cartesian x,y coordinates to Frenet s,d coordinates
vector<double> getFrenet(double x, double y, double theta, const vector<double> &maps_x, const vector<double> &maps_y)
{
int next_wp = NextWaypoint(x,y, theta, maps_x,maps_y);
int prev_wp;
prev_wp = next_wp-1;
if(next_wp == 0)
{
prev_wp = maps_x.size()-1;
}
double n_x = maps_x[next_wp]-maps_x[prev_wp];
double n_y = maps_y[next_wp]-maps_y[prev_wp];
double x_x = x - maps_x[prev_wp];
double x_y = y - maps_y[prev_wp];
// find the projection of x onto n
double proj_norm = (x_x*n_x+x_y*n_y)/(n_x*n_x+n_y*n_y);
double proj_x = proj_norm*n_x;
double proj_y = proj_norm*n_y;
double frenet_d = distance(x_x,x_y,proj_x,proj_y);
//see if d value is positive or negative by comparing it to a center point
double center_x = 1000-maps_x[prev_wp];
double center_y = 2000-maps_y[prev_wp];
double centerToPos = distance(center_x,center_y,x_x,x_y);
double centerToRef = distance(center_x,center_y,proj_x,proj_y);
if(centerToPos <= centerToRef)
{
frenet_d *= -1;
}
// calculate s value
double frenet_s = 0;
for(int i = 0; i < prev_wp; i++)
{
frenet_s += distance(maps_x[i],maps_y[i],maps_x[i+1],maps_y[i+1]);
}
frenet_s += distance(0,0,proj_x,proj_y);
return {frenet_s,frenet_d};
}
// Transform from Frenet s,d coordinates to Cartesian x,y
vector<double> getXY(double s, double d, const vector<double> &maps_s, const vector<double> &maps_x, const vector<double> &maps_y)
{
int prev_wp = -1;
while(s > maps_s[prev_wp+1] && (prev_wp < (int)(maps_s.size()-1) ))
{
prev_wp++;
}
int wp2 = (prev_wp+1)%maps_x.size();
double heading = atan2((maps_y[wp2]-maps_y[prev_wp]),(maps_x[wp2]-maps_x[prev_wp]));
// the x,y,s along the segment
double seg_s = (s-maps_s[prev_wp]);
double seg_x = maps_x[prev_wp]+seg_s*cos(heading);
double seg_y = maps_y[prev_wp]+seg_s*sin(heading);
double perp_heading = heading-pi()/2;
double x = seg_x + d*cos(perp_heading);
double y = seg_y + d*sin(perp_heading);
return {x,y};
}
int main() {
uWS::Hub h;
// Load up map values for waypoint's x,y,s and d normalized normal vectors
vector<double> map_waypoints_x;
vector<double> map_waypoints_y;
vector<double> map_waypoints_s;
vector<double> map_waypoints_dx;
vector<double> map_waypoints_dy;
// Waypoint map to read from
string map_file_ = "../data/highway_map.csv";
// The max s value before wrapping around the track back to 0
double max_s = 6945.554;
ifstream in_map_(map_file_.c_str(), ifstream::in);
string line;
while (getline(in_map_, line)) {
istringstream iss(line);
double x;
double y;
float s;
float d_x;
float d_y;
iss >> x;
iss >> y;
iss >> s;
iss >> d_x;
iss >> d_y;
map_waypoints_x.push_back(x);
map_waypoints_y.push_back(y);
map_waypoints_s.push_back(s);
map_waypoints_dx.push_back(d_x);
map_waypoints_dy.push_back(d_y);
}
int lane = 1; //0-left, 1-middle, 2-right
double ref_vel = 0.0;
h.onMessage([&lane, &ref_vel, &map_waypoints_x,&map_waypoints_y,&map_waypoints_s,&map_waypoints_dx,&map_waypoints_dy](uWS::WebSocket<uWS::SERVER> ws, char *data, size_t length,
uWS::OpCode opCode) {
// "42" at the start of the message means there's a websocket message event.
// The 4 signifies a websocket message
// The 2 signifies a websocket event
//auto sdata = string(data).substr(0, length);
//cout << sdata << endl;
if (length && length > 2 && data[0] == '4' && data[1] == '2') {
auto s = hasData(data);
if (s != "") {
auto j = json::parse(s);
string event = j[0].get<string>();
if (event == "telemetry") {
// j[1] is the data JSON object
// Main car's localization Data
double car_x = j[1]["x"];
double car_y = j[1]["y"];
double car_s = j[1]["s"];
double car_d = j[1]["d"];
double car_yaw = j[1]["yaw"];
double car_speed = j[1]["speed"];
// Previous path data given to the Planner
auto previous_path_x = j[1]["previous_path_x"];
auto previous_path_y = j[1]["previous_path_y"];
// Previous path's end s and d values
double end_path_s = j[1]["end_path_s"];
double end_path_d = j[1]["end_path_d"];
// Sensor Fusion Data, a list of all other cars on the same side of the road.
auto sensor_fusion = j[1]["sensor_fusion"];
json msgJson;
vector<double> next_x_vals;
vector<double> next_y_vals;
// TODO: define a path made up of (x,y) points that the car will visit sequentially every .02 seconds
int prev_size = previous_path_x.size();
if (prev_size > 0)
{
car_s = end_path_s;
}
bool too_close = false;
bool car_on_right = false;
bool car_on_left = false;
for (int i = 0; i < sensor_fusion.size(); i++)
{
float d = sensor_fusion[i][6];
int car_lane = d/4;
double vx = sensor_fusion[i][3];
double vy = sensor_fusion[i][4];
double check_speed = sqrt(vx*vx + vy*vy);
double check_car_s = sensor_fusion[i][5];
check_car_s += ((double)prev_size*.02*check_speed);
bool is_close = (check_car_s > car_s) && ((check_car_s - car_s) < 30);
int lane_diff = car_lane - lane;
if (lane_diff == 0 && ((check_car_s > car_s) && ((check_car_s - car_s) < 30)))
{
too_close = true;
}
if (lane_diff < 0 && fabs(check_car_s - car_s) > 30)
{
car_on_left = true;
}
if (lane_diff > 0 && fabs(check_car_s - car_s) > 30)
{
car_on_right = true;
}
}
if(too_close)
{
ref_vel -= .224;
if (lane > 0 && !car_on_left)
{
lane--;
}
else if(lane < 2 && !car_on_right)
{
lane++;
}
}
else if(ref_vel < 49.5)
{
ref_vel += .244;
}
vector<double> ptsx;
vector<double> ptsy;
double ref_x = car_x;
double ref_y = car_y;
double ref_yaw = deg2rad(car_yaw);
if (prev_size < 2)
{
double prev_car_x = car_x - cos(car_yaw);
double prev_car_y = car_y - sin(car_yaw);
ptsx.push_back(prev_car_x);
ptsx.push_back(ref_x);
ptsy.push_back(prev_car_y);
ptsy.push_back(ref_y);
}
else
{
ref_x = previous_path_x[prev_size - 1];
ref_y = previous_path_y[prev_size - 1];
double ref_x_prev = previous_path_x[prev_size - 2];
double ref_y_prev = previous_path_y[prev_size - 2];
ref_yaw = atan2(ref_y - ref_y_prev, ref_x - ref_x_prev);
ptsx.push_back(ref_x_prev);
ptsx.push_back(ref_x);
ptsy.push_back(ref_y_prev);
ptsy.push_back(ref_y);
}
double target_d = 2+4*lane;
vector<double> next_wp0 = getXY(car_s + 30, target_d, map_waypoints_s, map_waypoints_x, map_waypoints_y);
vector<double> next_wp1 = getXY(car_s + 60, target_d, map_waypoints_s, map_waypoints_x, map_waypoints_y);
vector<double> next_wp2 = getXY(car_s + 90, target_d, map_waypoints_s, map_waypoints_x, map_waypoints_y);
ptsx.push_back(next_wp0[0]);
ptsx.push_back(next_wp1[0]);
ptsx.push_back(next_wp2[0]);
ptsy.push_back(next_wp0[1]);
ptsy.push_back(next_wp1[1]);
ptsy.push_back(next_wp2[1]);
for (int i = 0; i < ptsx.size(); i++)
{
double shift_x = ptsx[i] - ref_x;
double shift_y = ptsy[i] - ref_y;
ptsx[i] = (shift_x*cos(0-ref_yaw) - shift_y*sin(0-ref_yaw));
ptsy[i] = (shift_x*sin(0-ref_yaw) + shift_y*cos(0-ref_yaw));
}
tk::spline s;
s.set_points(ptsx, ptsy);
for(int i = 0; i < prev_size; i++)
{
next_x_vals.push_back(previous_path_x[i]);
next_y_vals.push_back(previous_path_y[i]);
}
double target_x = 30.0;
double target_y = s(target_x);
double target_dist = sqrt((target_x)*(target_x) + (target_y)*(target_y));
double x_add_on = 0;
for(int i = 0; i <= 50 - prev_size; i++)
{
double N = (target_dist/(.02*ref_vel/2.24)); // 2.24 convert mph to m/s
double x_point = x_add_on + (target_x)/N;
double y_point = s(x_point);
x_add_on = x_point;
double x_ref = x_point;
double y_ref = y_point;
x_point = (x_ref*cos(ref_yaw) - y_ref*sin(ref_yaw));
y_point = (x_ref*sin(ref_yaw) + y_ref*cos(ref_yaw));
x_point += ref_x;
y_point += ref_y;
next_x_vals.push_back(x_point);
next_y_vals.push_back(y_point);
}
// END
msgJson["next_x"] = next_x_vals;
msgJson["next_y"] = next_y_vals;
auto msg = "42[\"control\","+ msgJson.dump()+"]";
//this_thread::sleep_for(chrono::milliseconds(1000));
ws.send(msg.data(), msg.length(), uWS::OpCode::TEXT);
}
} else {
// Manual driving
std::string msg = "42[\"manual\",{}]";
ws.send(msg.data(), msg.length(), uWS::OpCode::TEXT);
}
}
});
// We don't need this since we're not using HTTP but if it's removed the
// program
// doesn't compile :-(
h.onHttpRequest([](uWS::HttpResponse *res, uWS::HttpRequest req, char *data,
size_t, size_t) {
const std::string s = "<h1>Hello world!</h1>";
if (req.getUrl().valueLength == 1) {
res->end(s.data(), s.length());
} else {
// i guess this should be done more gracefully?
res->end(nullptr, 0);
}
});
h.onConnection([&h](uWS::WebSocket<uWS::SERVER> ws, uWS::HttpRequest req) {
std::cout << "Connected!!!" << std::endl;
});
h.onDisconnection([&h](uWS::WebSocket<uWS::SERVER> ws, int code,
char *message, size_t length) {
ws.close();
std::cout << "Disconnected" << std::endl;
});
int port = 4567;
if (h.listen(port)) {
std::cout << "Listening to port " << port << std::endl;
} else {
std::cerr << "Failed to listen to port" << std::endl;
return -1;
}
h.run();
}
| [
"li.claris@gmail.com"
] | li.claris@gmail.com |
78328dad62e6d7417777fc79dab500c0ec72a552 | f5f35d054c2be925771f62f3ce15619ea1ddc27d | /Campion.ro/onigim.cpp | 235d3387da760a1c9366809e6de6c500166ca10f | [] | no_license | edionu97/Algorithms-DataStructures-ContestsSolutions | fd01f4b00a02c846c50b0316b261c09eb42495ed | a1438543a0ecc551645cdef19694f926532db158 | refs/heads/master | 2021-06-12T15:41:19.745300 | 2020-12-02T13:18:03 | 2020-12-02T13:18:03 | 128,730,131 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 862 | cpp | #include <iostream>
#include <fstream>
#include <algorithm>
#define lengh 1001
using namespace std;
ifstream f("onigim.in");
ofstream g("onigim.out");
short n,p[lengh],a[lengh],k,b[lengh],A,B,C;
void citire()
{f>>n>>k;
for(int i=1;i<=k;i++)f>>p[i];
for(int i=1;i<=n;i++){f>>a[i];b[i]=a[i];}
}
bool dcresc(short c,short d)
{return c>d;}
void sortare()
{sort(a+1,a+n+1,dcresc);}
int v[lengh ],x[lengh ];
void ad(short a[lengh ])
{int j=k,i=1;
while(j>=1&&i<=n)
{if(v[a[i]]==0)v[a[i]]=p[j--];
i++;
}
}
void verif(int nr)
{if(nr==p[k])A++;
else if(nr==p[k-1])B++;
else if(nr==p[k-2])C++;
}
void afisare(int n)
{short maxi=0;
sortare();
ad(a);
for(int i=1;i<=n;i++)
{g<<v[b[i]]<<' ';
verif(v[b[i]]);
x[v[b[i]]]++;
if(x[v[b[i]]]>maxi)maxi=x[v[b[i]]];
}
g<<'\n';
g<<A+B+C;
g<<'\n';
g<<maxi;
}
int main()
{citire();
afisare(n);
return 0;
}
| [
"onu_edy@yahoo.com"
] | onu_edy@yahoo.com |
3b8847aca5fd7c921a6ef25844c07be7e2331560 | 652d0577d5f9716423cf7f1aae116a7bfd190c6f | /Device_mbed/Example_Geiger/mbed/I2CSlave.h | 511998a120ed03a19ce2a8b541ab204086f5c0bc | [
"MIT"
] | permissive | LinkItONEDevGroup/LASS | 714cf74a07840161ce6a3cd9a9ac525a3d5d88d3 | f06bd202f37f2a8fafe932feabcb119a292f016e | refs/heads/master | 2023-04-30T09:03:36.609950 | 2023-04-27T00:03:26 | 2023-04-27T00:03:26 | 38,099,296 | 174 | 108 | MIT | 2021-02-05T10:09:21 | 2015-06-26T08:14:22 | C | UTF-8 | C++ | false | false | 4,036 | h | /* mbed Microcontroller Library
* Copyright (c) 2006-2013 ARM Limited
*
* 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 MBED_I2C_SLAVE_H
#define MBED_I2C_SLAVE_H
#include "platform.h"
#if DEVICE_I2CSLAVE
#include "i2c_api.h"
namespace mbed {
/** An I2C Slave, used for communicating with an I2C Master device
*
* @Note Synchronization level: Not protected
*
* Example:
* @code
* // Simple I2C responder
* #include <mbed.h>
*
* I2CSlave slave(p9, p10);
*
* int main() {
* char buf[10];
* char msg[] = "Slave!";
*
* slave.address(0xA0);
* while (1) {
* int i = slave.receive();
* switch (i) {
* case I2CSlave::ReadAddressed:
* slave.write(msg, strlen(msg) + 1); // Includes null char
* break;
* case I2CSlave::WriteGeneral:
* slave.read(buf, 10);
* printf("Read G: %s\n", buf);
* break;
* case I2CSlave::WriteAddressed:
* slave.read(buf, 10);
* printf("Read A: %s\n", buf);
* break;
* }
* for(int i = 0; i < 10; i++) buf[i] = 0; // Clear buffer
* }
* }
* @endcode
*/
class I2CSlave {
public:
enum RxStatus {
NoData = 0,
ReadAddressed = 1,
WriteGeneral = 2,
WriteAddressed = 3
};
/** Create an I2C Slave interface, connected to the specified pins.
*
* @param sda I2C data line pin
* @param scl I2C clock line pin
*/
I2CSlave(PinName sda, PinName scl);
/** Set the frequency of the I2C interface
*
* @param hz The bus frequency in hertz
*/
void frequency(int hz);
/** Checks to see if this I2C Slave has been addressed.
*
* @returns
* A status indicating if the device has been addressed, and how
* - NoData - the slave has not been addressed
* - ReadAddressed - the master has requested a read from this slave
* - WriteAddressed - the master is writing to this slave
* - WriteGeneral - the master is writing to all slave
*/
int receive(void);
/** Read from an I2C master.
*
* @param data pointer to the byte array to read data in to
* @param length maximum number of bytes to read
*
* @returns
* 0 on success,
* non-0 otherwise
*/
int read(char *data, int length);
/** Read a single byte from an I2C master.
*
* @returns
* the byte read
*/
int read(void);
/** Write to an I2C master.
*
* @param data pointer to the byte array to be transmitted
* @param length the number of bytes to transmite
*
* @returns
* 0 on success,
* non-0 otherwise
*/
int write(const char *data, int length);
/** Write a single byte to an I2C master.
*
* @data the byte to write
*
* @returns
* '1' if an ACK was received,
* '0' otherwise
*/
int write(int data);
/** Sets the I2C slave address.
*
* @param address The address to set for the slave (ignoring the least
* signifcant bit). If set to 0, the slave will only respond to the
* general call address.
*/
void address(int address);
/** Reset the I2C slave back into the known ready receiving state.
*/
void stop(void);
protected:
i2c_t _i2c;
};
} // namespace mbed
#endif
#endif
| [
"royedfa5229@gmail.com"
] | royedfa5229@gmail.com |
6a25480948bc7ad61089dc0d9bae257a323ef33b | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/drivers/wdm/capture/mini/atiwdm/crossbar/atixbar/wdmxbar.h | 22d40f5f78bc26c3f6670c4adcfc5d37dcd4aaf1 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 3,354 | h | //==========================================================================;
//
// WDMXBar.H
// WDM Analog/Video CrossBar MiniDriver.
// CWDMAVXBar Class definition.
// Copyright (c) 1996 - 1997 ATI Technologies Inc. All Rights Reserved.
//
//==========================================================================;
#ifndef _WDMXBAR_H_
#define _WDMXBAR_H_
#include "i2script.h"
#include "aticonfg.h"
#define KSPROPERTIES_AVXBAR_NUMBER_SET 1 // CrossBar with no TVAudio
#define KSPROPERTIES_AVXBAR_NUMBER_CROSSBAR ( KSPROPERTY_CROSSBAR_ROUTE + 1)
typedef struct
{
UINT AudioVideoPinType;
ULONG nRelatedPinNumber; // for all pins
ULONG nConnectedToPin; // for output pins only
PKSPIN_MEDIUM pMedium; // describes hardware connectivity
} XBAR_PIN_INFORMATION, * PXBAR_PIN_INFORMATION;
class CWDMAVXBar
{
public:
CWDMAVXBar ( PPORT_CONFIGURATION_INFORMATION pConfigInfo, CI2CScript * pCScript, PUINT puiError);
~CWDMAVXBar ();
PVOID operator new ( size_t size_t, PVOID pAllocation);
// Attributes
private:
// WDM global topology headers
GUID m_wdmAVXBarTopologyCategory;
KSTOPOLOGY m_wdmAVXBarTopology;
// WDM global property headers
KSPROPERTY_ITEM m_wdmAVXBarPropertiesCrossBar[KSPROPERTIES_AVXBAR_NUMBER_CROSSBAR];
KSPROPERTY_SET m_wdmAVXBarPropertySet[KSPROPERTIES_AVXBAR_NUMBER_SET];
// WDM global stream headers
HW_STREAM_HEADER m_wdmAVXBarStreamHeader;
// configuration properties
CATIHwConfiguration m_CATIConfiguration;
ULONG m_nNumberOfVideoInputs;
ULONG m_nNumberOfVideoOutputs;
ULONG m_nNumberOfAudioInputs;
ULONG m_nNumberOfAudioOutputs;
// power management configuration
DEVICE_POWER_STATE m_ulPowerState;
// pins information
PKSPIN_MEDIUM m_pXBarPinsMediumInfo;
PBOOL m_pXBarPinsDirectionInfo;
PXBAR_PIN_INFORMATION m_pXBarInputPinsInfo;
PXBAR_PIN_INFORMATION m_pXBarOutputPinsInfo;
// I2C provider properties
CI2CScript * m_pI2CScript;
// Implementation
public:
BOOL AdapterUnInitialize ( PHW_STREAM_REQUEST_BLOCK pSrb);
BOOL AdapterGetStreamInfo ( PHW_STREAM_REQUEST_BLOCK pSrb);
BOOL AdapterQueryUnload ( PHW_STREAM_REQUEST_BLOCK pSrb);
BOOL AdapterGetProperty ( PHW_STREAM_REQUEST_BLOCK pSrb);
BOOL AdapterSetProperty ( PHW_STREAM_REQUEST_BLOCK pSrb);
NTSTATUS AdapterCompleteInitialization ( PHW_STREAM_REQUEST_BLOCK pSrb);
NTSTATUS AdapterSetPowerState ( PHW_STREAM_REQUEST_BLOCK pSrb);
// the functions for asynchronous operations completion
void UpdateAudioConnectionAfterChange( void);
private:
void SetWDMAVXBarKSProperties ( void);
void SetWDMAVXBarKSTopology ( void);
};
#endif // _WDMXBAR_H_
| [
"seta7D5@protonmail.com"
] | seta7D5@protonmail.com |
7a57efe2e9220c42eb812ff9a9fed9b872be39c2 | 3fc4282d7c4b21e0ea7d39e9ae476a8815ed4812 | /src/kernelfile.cpp | 1e393e3f36a6337096e18ddadcdb5f74fdf7b119 | [] | no_license | ntrifunovic/ETF-OS2 | e27da2f2cdddd437c520c4f933a056f5255574f3 | cdff3d07f6f06221c1497ee4ab839e6b88800c5b | refs/heads/master | 2021-01-01T19:50:40.637355 | 2013-07-07T21:30:29 | 2013-07-07T21:30:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,448 | cpp | // File: kernelfile.cpp
#include "kernelfile.h"
#include "kernelfs.h"
#include "slobodniklasteri.h"
#include "entryiterator.h"
#include <windows.h>
#include <memory.h>
#include <algorithm>
using namespace std;
KernelFile::KernelFile(Partition* par, Entry _entry, KernelFS* _fs, string _fullName)
: entry(_entry), cluster(par, _entry.firstIndexCluster), fs(_fs), fullName(_fullName), dataPos(0), pos(0) {
}
KernelFile::~KernelFile() {
Cluster rootDir(cluster.particija, 0);
EntryIterator it(rootDir, 0);
while (!it.end() && !it.empty()) {
if(memcmp((*it).name, entry.name, FNAMELEN) == 0 && memcmp((*it).ext, entry.ext, FEXTLEN) == 0)
(*it).size = entry.size;
it++;
}
fs->opened[GetCurrentThreadId()].erase(fullName);
for(list< BankarInfo >::iterator it = fs->bankar_queue.begin(); it != fs->bankar_queue.end(); it++) {
if(fs->bankarMoze(it->first.first, it->first.second)) {
signal(it->second);
break;
}
}
}
char KernelFile::write(BytesCnt cnt, char* buffer) {
while(cnt > 0) {
if(cluster._->data[dataPos] == 0)
cluster._->data[dataPos] = SlobodniKlasteri::uzmi(cluster.particija);
Cluster data(cluster.particija, cluster._->data[dataPos]);
BytesCnt clusterPos = pos%ClusterSize;
BytesCnt cut = min(cnt, ClusterSize - clusterPos);
memcpy((char*)data._ + clusterPos, buffer, cut);
cnt -= cut;
pos += cut;
buffer += cut;
if(pos%ClusterSize == 0) {
dataPos++;
if(dataPos == IndexClusterDataSize) {
if(cluster._->next == 0)
cluster._->next = SlobodniKlasteri::uzmi(cluster.particija);
cluster++;
dataPos = 0;
}
}
}
entry.size = max(entry.size, pos);
return 1;
}
BytesCnt KernelFile::read(BytesCnt cnt, char* buffer) {
cnt = min(cnt, entry.size - pos);
while(cnt > 0) {
Cluster data(cluster.particija, cluster._->data[dataPos]);
BytesCnt clusterPos = pos%ClusterSize;
BytesCnt cut = min(cnt, ClusterSize - clusterPos);
memcpy(buffer, (char*)data._ + clusterPos, cut);
cnt -= cut;
pos += cut;
buffer += cut;
if(pos%ClusterSize == 0) {
dataPos++;
if(dataPos == IndexClusterDataSize) {
cluster++;
dataPos = 0;
}
}
}
return cnt;
}
char KernelFile::seek(BytesCnt cnt) {
if(cnt > entry.size)
return 0;
pos = cnt;
cluster = Cluster(cluster.particija, entry.firstIndexCluster);
while(cnt > ClusterSize*IndexClusterDataSize) {
cnt -= ClusterSize*IndexClusterDataSize;
cluster++;
}
dataPos = 0;
while(cnt > ClusterSize) {
cnt -= ClusterSize;
dataPos++;
}
return 1;
}
BytesCnt KernelFile::filePos() {
return pos;
}
char KernelFile::eof() {
return pos == entry.size ? 2 : 0;
}
BytesCnt KernelFile::getFileSize() {
return entry.size;
}
char KernelFile::truncate() {
entry.size = pos;
for(int i = dataPos + 1; i < IndexClusterDataSize && cluster._->data[i] != 0; i++) {
SlobodniKlasteri::dodaj(cluster.particija, cluster._->data[i]);
cluster._->data[i] = 0;
}
for(Cluster c(cluster.particija, cluster._->next); c.no != 0; c++) {
for(int i = 0; i < IndexClusterDataSize && c._->data[i] != 0; i++) {
SlobodniKlasteri::dodaj(c.particija, c._->data[i]);
}
}
cluster._->next = 0;
return 1;
} | [
"ntrifunovic@gmail.com"
] | ntrifunovic@gmail.com |
2b897362b62b4a045a89851ceda1160924343ca6 | e47d21d40be9bffd742bd0f4a2fe8a9ba68c7bd5 | /System/Data/SqlParameter.h | 5588c0a8251936eb4618befbf9a874ceb321ec78 | [] | no_license | pzhu1015/CPPSource | 8dffff1572abfd7e844c926bf6f17bada8601ad5 | 23c17f3632a2f1a9a1c233bf8cf97d37ce85b9e5 | refs/heads/master | 2023-01-27T22:07:41.227234 | 2020-12-06T12:36:51 | 2020-12-06T12:36:51 | 275,615,449 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,867 | h | ///////////////////////////////////////////////////////////////////
// Copyright 2020 Pengzhihu All Right Reserved
// FileName:
// Author: Pengzhihu
// Date: 2020-05-20
// Version: 1.0
// Description:
///////////////////////////////////////////////////////////////////
#ifndef SYSTEM_DATA_SQLPARAMETER_H
#define SYSTEM_DATA_SQLPARAMETER_H
#include "System/Data/DbParameter.h"
#include "System/Data/Ptrs.h"
#include <string>
namespace System
{
namespace Data
{
class SYSTEM_API SqlParameter : public DbParameter
{
public:
SqlParameter();
SqlParameter(const std::string & name, DataTypeEnum type, const _variant_t & value, ParameterDirectionEnum direction = ParameterDirectionEnum::adParamInput);
SqlParameter(const _ParameterPtr ¶m);
virtual ~SqlParameter();
virtual DataTypeEnum GetDbType() override;
virtual void SetDbType(DataTypeEnum type) override;
virtual bool IsNullable() override;
virtual std::string GetParameterName() override;
virtual void SetParameterName(const std::string &name) override;
virtual std::string GetSourceColumn() override;
virtual void SetSourceColumn() override;
virtual __int8 GetPrecision() override;
virtual void SetPrecision(char precision) override;
virtual __int8 GetScale() override;
virtual void SetScale(char scale) override;
virtual _variant_t GetValue() override;
virtual void SetValue(const _variant_t & value) override;
virtual ParameterDirectionEnum GetDirection() override;
virtual void SetDirection(ParameterDirectionEnum direction) override;
const _ParameterPtr &GetParameter() const;
static _ParameterPtr CreateParameter(const std::string & name, DataTypeEnum type, const _variant_t & value, ParameterDirectionEnum direction);
private:
SqlCommandPtr m_command;
_ParameterPtr m_parameter;
};
}
}
#endif // !SYSTEM_DATA_SQLPARAMETER_H
| [
"pzh@PZH"
] | pzh@PZH |
abe614afb4639767d3aea26d069d51669063cb5a | ea4d391f01e6e8c427bc63b73933a59c5929b947 | /Projects/finlib/xlw/XlfRef.cpp | 173b00e71a51751b8534eb383156cd5425581a9e | [] | no_license | alhunor/projects | 6091e53b621db610f9d0c65df73a884591b99ff0 | dd626aa855fd7f176c882737ffcad5c527015e01 | refs/heads/master | 2021-04-15T19:01:21.857954 | 2019-03-19T13:19:21 | 2019-03-19T13:19:21 | 33,770,346 | 0 | 1 | null | null | null | null | ISO-8859-1 | C++ | false | false | 2,133 | cpp | /*
Copyright (C) 1998, 1999, 2001, 2002, 2003, 2004 Jérôme Lecomte
Copyright (C) 2007, 2008 Eric Ehlers
This file is part of XLW, a free-software/open-source C++ wrapper of the
Excel C API - http://xlw.sourceforge.net/
XLW is free software: you can redistribute it and/or modify it under the
terms of the XLW license. You should have received a copy of the
license along with this program; if not, please email xlw-users@lists.sf.net
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the license for more details.
*/
/*!
\file XlfRef.cpp
\brief Implements the XlfRef class.
*/
// $Id: XlfRef.cpp 1280 2011-08-07 11:33:52Z adcockj $
#include <xlw/XlfRef.h>
#include <sstream>
namespace
{
std::string RowColToA1(RW row, COL col)
{
std::ostringstream ostr;
COL colLeft = col;
if(col > 26*26)
{
char colChar = 'A' + colLeft / (26 * 26) - 1;
colLeft %= (26 * 26);
ostr << colChar;
}
if(col > 26)
{
char colChar = 'A' + colLeft / 26 - 1;
colLeft %= 26;
ostr << colChar;
}
{
char colChar = 'A' + colLeft;
ostr << colChar;
}
ostr << row + 1;
return ostr.str();
}
}
namespace xlw
{
std::string XlfRef::GetTextA1()
{
std::string result = RowColToA1(rowbegin_, colbegin_);
if(colend_ > colbegin_ + 1 || rowend_ > rowbegin_ + 1)
{
result += ":";
result += RowColToA1(rowend_ - 1, colend_ - 1);
}
return result;
}
std::string XlfRef::GetTextR1C1()
{
std::ostringstream ostr;
ostr << "R" << rowbegin_ + 1 << "C" << colbegin_ + 1;
if(colend_ > colbegin_ + 1 || rowend_ > rowbegin_ + 1)
{
ostr << ":" << "R" << rowend_ << "C" << colend_;
}
return ostr.str();
}
}
| [
"alhunor@yahoo.com"
] | alhunor@yahoo.com |
31321efff0e7c4702a8744f0d89ccacf3c882d35 | 81de7d09d92e602d32055b5e84c12d07034e99ce | /DP(다이나믹 프로그래밍)/1915_가장 큰 정사각형.cpp | 046c43a832bb534bbe88bdbfe81d6dc59219157c | [] | no_license | newdeal123/BOJ | 13499fe476ae1aee2b3174e147b4fafbc071985b | 20a161e46018fc1baba1710f36d3d29fa3bf20db | refs/heads/master | 2021-08-08T15:41:57.601898 | 2021-06-30T14:41:14 | 2021-06-30T14:41:14 | 164,074,479 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,847 | cpp | //n×m의 0, 1로 된 배열이 있다.이 배열에서 1로 된 가장 큰 정사각형의 크기를 구하는 프로그램을 작성하시오.
//
//0 1 0 0
//0 1 1 1
//1 1 1 0
//0 0 1 0
//위와 같은 예제에서는 가운데의 2×2 배열이 가장 큰 정사각형이다.
//
//입력
//첫째 줄에 n, m(1 ≤ n, m ≤ 1, 000)이 주어진다.다음 n개의 줄에는 m개의 숫자로 배열이 주어진다.
//
//출력
//첫째 줄에 가장 큰 정사각형의 넓이를 출력한다.
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
#define MAX_N 1005
int map[MAX_N][MAX_N];
int cache[MAX_N][MAX_N];
int goY[3] = { 1,1,0 };
int goX[3] = { 0,1,1 };
int N, M;
//지금 좌표를 기준으로 검사한다
int isSquare(int y, int x, int size)
{
//cout << "test : isSquare(" << y << "," << x << "," << size << ")\n";
bool flag = true;
//기저사례1 : 맵 안에있는지 검사
if (y<1 || y>N || x<1 || x>M)
return 0;
//기저사례2 : 정사각형 검사후 0이있는지 검사
for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
if (map[y + i][x + j] != 1)
{
flag = false;
break;
}
int& ret = cache[y][x];
if (ret != -1)
return ret;
if (flag==true)
return ret= isSquare(y, x, size + 1) + 1;
else
return ret =0;
}
int main()
{
for (int i = 0; i < MAX_N; i++)
for (int j = 0; j < MAX_N; j++)
cache[i][j] = -1;
int str[MAX_N];
int count = 0;
cin >> N >> M;
for (int i = 1; i <= N; i++)
{
string s;
cin >> s;
for (int j = 1; j <= M; j++)
{
map[i][j] = s[j - 1] - 48;
// cout << "test : map" << map[i][j] << " ";
}
//cout << endl;
}
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
{
str[count] = isSquare(i, j, 1);
count++;
}
sort(str, str + count);
cout << str[count - 1] * str[count - 1];
} | [
"newdeal123@nate.com"
] | newdeal123@nate.com |
d0b064aaae128695a6888627ce2423c54229f517 | cc7661edca4d5fb2fc226bd6605a533f50a2fb63 | /System.Runtime.Serialization/IXmlMtomReaderInitializer.h | 1269f084880b2a15098445297664d31e4d56aa74 | [
"MIT"
] | permissive | g91/Rust-C-SDK | 698e5b573285d5793250099b59f5453c3c4599eb | d1cce1133191263cba5583c43a8d42d8d65c21b0 | refs/heads/master | 2020-03-27T05:49:01.747456 | 2017-08-23T09:07:35 | 2017-08-23T09:07:35 | 146,053,940 | 1 | 0 | null | 2018-08-25T01:13:44 | 2018-08-25T01:13:44 | null | UTF-8 | C++ | false | false | 115 | h | #pragma once
namespace System
{
namespace Xml
{
class IXmlMtomReaderInitializer
{
public:
}; // size = 0x0
}
| [
"info@cvm-solutions.co.uk"
] | info@cvm-solutions.co.uk |
e36f796ef657f4a21b18a21849d15ddc62243bc2 | 0e0303b367314c6d0f9539f9af99721ab4c0c5e7 | /gamelib/gamelib_world.cpp | 95b6cd5dfc447e696b756add678229e34f142638 | [
"MIT"
] | permissive | jmbyam/CS_game | cee4b792b634a3be60d0ae895e2b7a57f996a14e | c5da1f7aa2d37a1b38ba96e38b557ba79def665f | refs/heads/master | 2021-03-02T16:29:23.491602 | 2020-03-09T05:38:20 | 2020-03-09T05:38:20 | 245,883,760 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,425 | cpp | #include "pch.h"
#include <gamelib_actor.hpp>
#include <gamelib_locator.hpp>
#include <gamelib_world.hpp>
namespace GameLib {
namespace Tokens {
#define WORLD_TOKENS(ENUM) \
ENUM(WORLDSIZE) \
ENUM(WORLD) \
ENUM(DEFINE) \
ENUM(COLLIDE) \
ENUM(FLAGS)
#define ENUM_VAL(x) x,
#define ENUM_MAP(x) { #x, Tiles::x },
enum class Tiles { WORLD_TOKENS(ENUM_VAL) };
std::map<std::string, Tiles> worldTokens{ WORLD_TOKENS(ENUM_MAP) };
std::map<char, unsigned> charToTiles{};
std::map<char, unsigned> charToFlags{};
} // namespace Tokens
World::World() { resize(worldSizeX, worldSizeY); }
World::~World() {
tiles.clear();
collisionTiles.clear();
dynamicActors.clear();
staticActors.clear();
triggerActors.clear();
}
void World::resize(unsigned sizeX, unsigned sizeY) {
unsigned numTiles = sizeX * sizeY;
tiles.resize(numTiles);
worldSizeX = sizeX;
worldSizeY = sizeY;
collisionTiles.resize(numTiles * CollisionTileResolution);
}
void World::start(float t) {
for (auto a : triggerActors) {
a->makeTrigger();
a->beginPlay(t);
}
for (auto a : staticActors) {
a->makeStatic();
a->beginPlay(t);
}
for (auto a : dynamicActors) {
a->makeDynamic();
a->beginPlay(t);
}
}
void World::update(float deltaTime) {
for (auto& actor : triggerActors) {
if (!actor->active)
continue;
actor->update(deltaTime, *this);
}
for (auto actor : staticActors) {
if (!actor->active)
continue;
actor->update(deltaTime, *this);
}
for (auto actor : dynamicActors) {
if (!actor->active)
continue;
actor->update(deltaTime, *this);
}
}
void World::physics(float deltaTime) {
for (auto a : staticActors) {
a->preupdate();
}
for (auto a : dynamicActors) {
a->preupdate();
}
for (auto actor : staticActors) {
actor->physics(deltaTime, *this);
}
for (auto actor : dynamicActors) {
if (!actor->active)
continue;
actor->physics(deltaTime, *this);
}
auto box2d = Locator::getBox2D();
box2d->update(deltaTime);
for (auto a : staticActors) {
a->postupdate();
}
for (auto a : dynamicActors) {
a->postupdate();
}
}
void World::drawTiles(Graphics& graphics) { _draw(graphics); }
void World::draw(Graphics& graphics) {
for (auto actor : staticActors) {
if (!actor->active || !actor->visible)
continue;
actor->draw(graphics);
}
for (auto& actor : dynamicActors) {
if (!actor->active || !actor->visible)
continue;
actor->draw(graphics);
}
for (auto& actor : triggerActors) {
if (!actor->active || !actor->visible)
continue;
actor->draw(graphics);
}
}
void World::addDynamicActor(ActorPtr a) {
a->makeDynamic();
dynamicActors.push_back(a);
}
void World::addStaticActor(ActorPtr a) {
a->makeStatic();
staticActors.push_back(a);
}
void World::addTriggerActor(ActorPtr a) {
a->makeTrigger();
triggerActors.push_back(a);
}
void World::setTile(int x, int y, Tile tile) {
if (x >= worldSizeX || y >= worldSizeY)
return;
auto index = y * worldSizeX + x;
tiles[index] = std::move(tile);
}
Tile& World::getTile(int x, int y) {
static Tile t;
if (x >= worldSizeX || y >= worldSizeY)
return t;
auto index = y * worldSizeX + x;
return tiles[index];
}
const Tile& World::getTile(int x, int y) const {
static Tile t;
if (x >= worldSizeX || y >= worldSizeY)
return t;
auto index = y * worldSizeX + x;
return tiles[index];
}
int World::getCollisionTile(float x, float y) const {
int ix = (int)(CollisionTileResolution * x);
int iy = (int)(CollisionTileResolution * y);
ix = clamp<int>(ix, 0, collisionSizeX - 1);
iy = clamp<int>(iy, 0, collisionSizeY - 1);
int index = iy * collisionSizeX + ix;
return collisionTiles[index];
}
void World::setCollisionTile(float x, float y, int value) {
int ix = (int)(CollisionTileResolution * x);
int iy = (int)(CollisionTileResolution * y);
ix = clamp<int>(ix, 0, collisionSizeX - 1);
iy = clamp<int>(iy, 0, collisionSizeY - 1);
int index = iy * collisionSizeX + ix;
collisionTiles[index] = value;
}
std::istream& World::readCharStream(std::istream& s) {
std::string cmd;
s >> cmd;
std::transform(cmd.begin(), cmd.end(), cmd.begin(), ::toupper);
if (!Tokens::worldTokens.count(cmd))
return s;
Tokens::Tiles token = Tokens::worldTokens[cmd];
// ensure objects don't pass through
auto box2d = Locator::getBox2D();
char c;
unsigned val;
switch (token) {
case Tokens::Tiles::WORLDSIZE:
unsigned w, h;
s >> w;
s >> h;
resize(w, h);
break;
case Tokens::Tiles::WORLD:
int row;
s >> row;
for (int i = 0; i < worldSizeX; i++) {
char c;
s >> c;
unsigned tile = c;
if (Tokens::charToTiles.count(c)) {
tile = Tokens::charToTiles[tile];
}
setTile(i, row, Tile(tile, c));
unsigned flags = Tile::SOLID;
if (Tokens::charToFlags.count(c)) {
flags = Tokens::charToFlags[c];
}
getTile(i, row).flags = flags;
_addTileToPhysics(i, row);
}
break;
case Tokens::Tiles::FLAGS:
s >> c;
s >> val;
Tokens::charToFlags[c] = val;
break;
case Tokens::Tiles::DEFINE:
s >> c;
s >> val;
Tokens::charToTiles[c] = val;
break;
default: HFLOGWARN("cmd '%' not implemented", cmd.c_str());
}
return s;
}
std::ostream& World::writeCharStream(std::ostream& s) const {
// TODO: rows should be written out with characters representing background tiles
// Main Idea is to use a command with parameters
// Example:
// # tile is used to remap a character to a sprite index
// tile # 34
// tile A 35
// # actor define type char NAME
// # actor text TEXT
// actor define NPC a "Justine Shellock"
// actor state BossAlive
// actor text "Howdy, how are you?"
// actor text "Have you heard about the monolith?"
// actor state BossDead
// actor text "Oh thank you! Now I can go back to carpentry!"
// actor define NPC b "Samson Hallock"
// actor state BossAlive
// actor text "It arrived at midnight the day before"
// actor text "It makes us sad, can you destroy it?"
// actor state BossDead
// actor text "The Monolith is dead. We can not be at peace."
// actor state BossDead
// actor define BOSS B "Monolith"
// actor state BossAlive
// actor text "What? You think you can destroy me?!"
// actor text "Ha! Ha! Ha! Do your worst!"
// actor state BossDead
// actor text "Oh no! What a world!"
// # world N ... is the information for row N
// # the space character is the value 0, or no tile
// # the < character is the player start position
// # the > character is the player end position
// worldsize width height
// world 0 #######################
// world 1 # a #
// world 2 # AAAAA b #
// world 3 #< # AAAA B >#
// world 4 #######################
std::map<unsigned int, char> cellToChar;
for (auto& [k, v] : Tokens::charToTiles) {
s << "define " << k << " " << v;
cellToChar[v] = k;
}
s << "worldsize " << worldSizeX << " " << worldSizeY << "\n";
for (int y = 0; y < worldSizeY; ++y) {
s << "world " << std::setw(2) << y << " ";
for (int x = 0; x < worldSizeX; ++x) {
auto t = getTile(x, y);
if (cellToChar.count(t.spriteId)) {
s << cellToChar[t.spriteId];
} else {
s << (char)t.spriteId;
}
}
s << "\n";
}
return s;
}
void World::_draw(Graphics& g) {
for (int x = 0; x < worldSizeX; x++) {
for (int y = 0; y < worldSizeY; y++) {
GameLib::SPRITEINFO s;
s.position = { x * 32, y * 32 };
Tile& t = getTile(x, y);
g.draw(0, t.spriteId, s.position.x, s.position.y);
}
}
}
void World::_addTileToPhysics(int i, int j) {
auto tile = getTile(i, j);
if (!tile.solid())
return;
auto box2d = Locator::getBox2D();
tile.box2dId = box2d->initBody(b2_staticBody, { i + 0.5f, j + 0.5f }, { 0.45f, 0.45f }, 1.0f, 0.3f);
}
} // namespace GameLib
| [
"microwerx@outlook.com"
] | microwerx@outlook.com |
4af97fe17797464ee9328d25d3aaaa493afc8947 | 87aba51b1f708b47d78b5c4180baf731d752e26d | /Replication/DataFileSystem/PRODUCT_SOURCE_CODE/chromium/net/url_request/url_request_http_job.h | 4d0df3fa86a2ea8ff6b0ed5b28e615b566f5dea9 | [
"BSD-3-Clause"
] | permissive | jstavr/Architecture-Relation-Evaluator | 12c225941e9a4942e83eb6d78f778c3cf5275363 | c63c056ee6737a3d90fac628f2bc50b85c6bd0dc | refs/heads/master | 2020-12-31T05:10:08.774893 | 2016-05-14T16:09:40 | 2016-05-14T16:09:40 | 58,766,508 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,409 | h | // Copyright (c) 2012 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.
#ifndef NET_URL_REQUEST_URL_REQUEST_HTTP_JOB_H_
#define NET_URL_REQUEST_URL_REQUEST_HTTP_JOB_H_
#include <string>
#include <vector>
#include "base/compiler_specific.h"
#include "base/memory/scoped_ptr.h"
#include "base/memory/weak_ptr.h"
#include "base/time.h"
#include "net/base/auth.h"
#include "net/base/completion_callback.h"
#include "net/cookies/cookie_store.h"
#include "net/http/http_request_info.h"
#include "net/url_request/url_request_job.h"
#include "net/url_request/url_request_throttler_entry_interface.h"
namespace net {
class HttpResponseHeaders;
class HttpResponseInfo;
class HttpTransaction;
class URLRequestContext;
// A URLRequestJob subclass that is built on top of HttpTransaction. It
// provides an implementation for both HTTP and HTTPS.
class URLRequestHttpJob : public URLRequestJob {
public:
static URLRequestJob* Factory(URLRequest* request,
NetworkDelegate* network_delegate,
const std::string& scheme);
protected:
URLRequestHttpJob(URLRequest* request, NetworkDelegate* network_delegate);
// Shadows URLRequestJob's version of this method so we can grab cookies.
void NotifyHeadersComplete();
// Shadows URLRequestJob's method so we can record histograms.
void NotifyDone(const URLRequestStatus& status);
void DestroyTransaction();
void AddExtraHeaders();
void AddCookieHeaderAndStart();
void SaveCookiesAndNotifyHeadersComplete(int result);
void SaveNextCookie();
void FetchResponseCookies(std::vector<std::string>* cookies);
// Processes the Strict-Transport-Security header, if one exists.
void ProcessStrictTransportSecurityHeader();
// Processes the Public-Key-Pins header, if one exists.
void ProcessPublicKeyPinsHeader();
// |result| should be net::OK, or the request is canceled.
void OnHeadersReceivedCallback(int result);
void OnStartCompleted(int result);
void OnReadCompleted(int result);
void NotifyBeforeSendHeadersCallback(int result);
void RestartTransactionWithAuth(const AuthCredentials& credentials);
// Overridden from URLRequestJob:
virtual void SetUpload(UploadData* upload) OVERRIDE;
virtual void SetExtraRequestHeaders(
const HttpRequestHeaders& headers) OVERRIDE;
virtual void Start() OVERRIDE;
virtual void Kill() OVERRIDE;
virtual LoadState GetLoadState() const OVERRIDE;
virtual UploadProgress GetUploadProgress() const OVERRIDE;
virtual bool GetMimeType(std::string* mime_type) const OVERRIDE;
virtual bool GetCharset(std::string* charset) OVERRIDE;
virtual void GetResponseInfo(HttpResponseInfo* info) OVERRIDE;
virtual bool GetResponseCookies(std::vector<std::string>* cookies) OVERRIDE;
virtual int GetResponseCode() const OVERRIDE;
virtual Filter* SetupFilter() const OVERRIDE;
virtual bool IsSafeRedirect(const GURL& location) OVERRIDE;
virtual bool NeedsAuth() OVERRIDE;
virtual void GetAuthChallengeInfo(scoped_refptr<AuthChallengeInfo>*) OVERRIDE;
virtual void SetAuth(const AuthCredentials& credentials) OVERRIDE;
virtual void CancelAuth() OVERRIDE;
virtual void ContinueWithCertificate(X509Certificate* client_cert) OVERRIDE;
virtual void ContinueDespiteLastError() OVERRIDE;
virtual bool ReadRawData(IOBuffer* buf, int buf_size,
int* bytes_read) OVERRIDE;
virtual void StopCaching() OVERRIDE;
virtual void DoneReading() OVERRIDE;
virtual HostPortPair GetSocketAddress() const OVERRIDE;
virtual void NotifyURLRequestDestroyed() OVERRIDE;
HttpRequestInfo request_info_;
const HttpResponseInfo* response_info_;
std::vector<std::string> response_cookies_;
size_t response_cookies_save_index_;
// Auth states for proxy and origin server.
AuthState proxy_auth_state_;
AuthState server_auth_state_;
AuthCredentials auth_credentials_;
CompletionCallback start_callback_;
CompletionCallback notify_before_headers_sent_callback_;
bool read_in_progress_;
// An URL for an SDCH dictionary as suggested in a Get-Dictionary HTTP header.
GURL sdch_dictionary_url_;
scoped_ptr<HttpTransaction> transaction_;
// This is used to supervise traffic and enforce exponential
// back-off. May be NULL.
scoped_refptr<URLRequestThrottlerEntryInterface> throttling_entry_;
// Indicated if an SDCH dictionary was advertised, and hence an SDCH
// compressed response is expected. We use this to help detect (accidental?)
// proxy corruption of a response, which sometimes marks SDCH content as
// having no content encoding <oops>.
bool sdch_dictionary_advertised_;
// For SDCH latency experiments, when we are able to do SDCH, we may enable
// either an SDCH latency test xor a pass through test. The following bools
// indicate what we decided on for this instance.
bool sdch_test_activated_; // Advertising a dictionary for sdch.
bool sdch_test_control_; // Not even accepting-content sdch.
// For recording of stats, we need to remember if this is cached content.
bool is_cached_content_;
private:
enum CompletionCause {
ABORTED,
FINISHED
};
typedef base::RefCountedData<bool> SharedBoolean;
class HttpFilterContext;
class HttpTransactionDelegateImpl;
virtual ~URLRequestHttpJob();
void RecordTimer();
void ResetTimer();
virtual void UpdatePacketReadTimes() OVERRIDE;
void RecordPacketStats(FilterContext::StatisticSelector statistic) const;
void RecordCompressionHistograms();
bool IsCompressibleContent() const;
// Starts the transaction if extensions using the webrequest API do not
// object.
void StartTransaction();
void StartTransactionInternal();
void RecordPerfHistograms(CompletionCause reason);
void DoneWithRequest(CompletionCause reason);
// Callback functions for Cookie Monster
void DoLoadCookies();
void CheckCookiePolicyAndLoad(const CookieList& cookie_list);
void OnCookiesLoaded(
const std::string& cookie_line,
const std::vector<CookieStore::CookieInfo>& cookie_infos);
void DoStartTransaction();
// See the implementation for a description of save_next_cookie_running and
// callback_pending.
void OnCookieSaved(scoped_refptr<SharedBoolean> save_next_cookie_running,
scoped_refptr<SharedBoolean> callback_pending,
bool cookie_status);
// Some servers send the body compressed, but specify the content length as
// the uncompressed size. If this is the case, we return true in order
// to request to work around this non-adherence to the HTTP standard.
// |rv| is the standard return value of a read function indicating the number
// of bytes read or, if negative, an error code.
bool ShouldFixMismatchedContentLength(int rv) const;
// Returns the effective response headers, considering that they may be
// overridden by |override_response_headers_|.
HttpResponseHeaders* GetResponseHeaders() const;
// Override of the private interface of URLRequestJob.
virtual void OnDetachRequest() OVERRIDE;
base::Time request_creation_time_;
// Data used for statistics gathering. This data is only used for histograms
// and is not required. It is only gathered if packet_timing_enabled_ == true.
//
// TODO(jar): improve the quality of the gathered info by gathering most times
// at a lower point in the network stack, assuring we have actual packet
// boundaries, rather than approximations. Also note that input byte count
// as gathered here is post-SSL, and post-cache-fetch, and does not reflect
// true packet arrival times in such cases.
// Enable recording of packet arrival times for histogramming.
bool packet_timing_enabled_;
bool done_; // True when we are done doing work.
// The number of bytes that have been accounted for in packets (where some of
// those packets may possibly have had their time of arrival recorded).
int64 bytes_observed_in_packets_;
// The request time may not be available when we are being destroyed, so we
// snapshot it early on.
base::Time request_time_snapshot_;
// Since we don't save all packet times in packet_times_, we save the
// last time for use in histograms.
base::Time final_packet_time_;
// The start time for the job, ignoring re-starts.
base::TimeTicks start_time_;
scoped_ptr<HttpFilterContext> filter_context_;
base::WeakPtrFactory<URLRequestHttpJob> weak_factory_;
CompletionCallback on_headers_received_callback_;
// We allow the network delegate to modify a copy of the response headers.
// This prevents modifications of headers that are shared with the underlying
// layers of the network stack.
scoped_refptr<HttpResponseHeaders> override_response_headers_;
// Flag used to verify that |this| is not deleted while we are awaiting
// a callback from the NetworkDelegate. Used as a fail-fast mechanism.
// True if we are waiting a callback and
// NetworkDelegate::NotifyURLRequestDestroyed has not been called, yet,
// to inform the NetworkDelegate that it may not call back.
bool awaiting_callback_;
scoped_ptr<HttpTransactionDelegateImpl> http_transaction_delegate_;
DISALLOW_COPY_AND_ASSIGN(URLRequestHttpJob);
};
} // namespace net
#endif // NET_URL_REQUEST_URL_REQUEST_HTTP_JOB_H_
| [
"jstavr2@gmail.com"
] | jstavr2@gmail.com |
d63f9ed175ed6b093d351e1d90139db66165ed96 | 769b9c5405cccfa225a80f973729031f16a0028e | /Chemiluminescence_instrumentV3/standardBightWidget/standardbightwidget.cpp | 2687c9cfe129dddee1137b6696ebdd20bd55c25e | [] | no_license | 519984307/My_Chemiluminescence_Software | 70f571f8172b4ffae652671661f4461f57869dbb | 50ca24e83a14c27fc60791d240b71a62e9bd3506 | refs/heads/master | 2023-03-19T10:08:23.749209 | 2018-12-12T18:34:55 | 2018-12-12T18:34:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,754 | cpp | #include "standardbightwidget.h"
#include "QFont"
#include "data\util.h"
#include <QSqlQuery>
#include <QSqlError>
#include <QDebug>
#define Fuction_COEFFICIENT_COUNT 4 //函数系统个数
bool standardBightWidget::CurveDisplayFlag = false;
standardBightWidget::standardBightWidget(QWidget *parent):QWidget(parent)
{
//头图标初始化
titleInit();
BtnInit();
cruveGeneration = NULL;
windowLayout = new QHBoxLayout; //显示界面布局
mainlayout = new QVBoxLayout(this); //主界面
controlWidget = new standBight_controlWidget; //控制界面
DrawWidget = new standardBight_draweWidget; //绘图界面
windowLayout->addWidget(controlWidget);
windowLayout->addWidget(DrawWidget);
mainlayout->addSpacing(60);
mainlayout->addLayout(btnLayout);
mainlayout->addLayout(windowLayout);
connectInit();
}
/**
* @brief 窗口标题头初始化
*/
void standardBightWidget::titleInit()
{
titleIconLab = new QLabel(this); //头图标
titleIconLab->setPixmap(QPixmap(":/picture/standardPrograme/tile_icon.png"));
titleTextLab = new QLabel(titleIconLab); //标题文字
titleTextLab->setText(tr("标准曲线生成"));
QPalette pal;//按键字体颜色设置
pal.setColor(QPalette::WindowText, QColor(255, 255, 255, 255));
titleTextLab->setPalette(pal);
titleTextLab->setFont(QFont("windowTitle",15));
titleTextLab->setGeometry(75,13,150,40);
questionBtn = new QPushButton(titleIconLab); //问号按钮
questionBtn->setIconSize(QSize(46,45));
questionBtn->setIcon(QIcon(":/picture/standardPrograme/？btn.png"));
questionBtn->setFlat(true);
questionBtn->setGeometry(1600,1,45,45);
titleIconLab->setGeometry(0,0,1687,67);
}
/**
* @brief standardBightWidget::按钮初始化
*/
void standardBightWidget::BtnInit()
{
// QFont *font = new QFont("btnFont",15);
// saveBtn = new QPushButton; //保存按钮
// saveBtn->setIconSize(QSize(50,50));
// saveBtn->setIcon(QIcon(":/picture/standardBight/saveBtn.png"));
// saveBtn->setText(tr("保存"));
// saveBtn->setFixedSize(110,50);
// saveBtn->setFont(*font);
// saveBtn->setFlat(true);
saveBtn = new QPushButton();
saveBtn->setFlat(true);
saveBtn->setFocusPolicy(Qt::TabFocus);
saveBtn->setFixedSize(85,32);//图片的固定大小85 32
saveBtn->setStyleSheet("QPushButton{border-image: url(:/picture/standardBight/saveBtn-up.png);}"
"QPushButton:hover{border-image: url(:/picture/standardBight/saveBtn-up.png);}"
"QPushButton:pressed{border-image: url(:/picture/standardBight/saveBtn-down.png);}");
// quitBtn = new QPushButton; //退出按钮
// quitBtn->setIconSize(QSize(50,50));
// quitBtn->setIcon(QIcon(":/picture/standardBight/quitBtn.png"));
// quitBtn->setText(tr("退出"));
// quitBtn->setFixedSize(110,50);
// quitBtn->setFont(*font);
// quitBtn->setFlat(true);
quitBtn = new QPushButton();
quitBtn->setFlat(true);
quitBtn->setFocusPolicy(Qt::TabFocus);
quitBtn->setFixedSize(85,32);//图片的固定大小85 32
quitBtn->setStyleSheet("QPushButton{border-image: url(:/picture/standardBight/quitBtn-up.png);}"
"QPushButton:hover{border-image: url(:/picture/standardBight/quitBtn-up.png);}"
"QPushButton:pressed{border-image: url(:/picture/standardBight/quitBtn-down.png);}");
btnLayout = new QHBoxLayout; //按钮水平布局
btnLayout->addWidget(saveBtn);
btnLayout->addWidget(quitBtn);
btnLayout->addSpacing(1200);
}
/**
* @brief 绑定信号和槽初始化
*/
void standardBightWidget::connectInit()
{
connect(saveBtn,SIGNAL(clicked()),this,SLOT(saveBtnSlot()));
connect(quitBtn,SIGNAL(clicked()),this,SLOT(quitBtnSlot()));
connect(controlWidget->produceBightBtn,SIGNAL(clicked()),this,SLOT(createCurve()));
// connect(controlWidget->checkBoxBtn1,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn1Slot(int)));
// connect(controlWidget->checkBoxBtn2,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn2Slot(int)));
// connect(controlWidget->checkBoxBtn3,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn3Slot(int)));
// connect(controlWidget->checkBoxBtn4,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn4Slot(int)));
// connect(controlWidget->checkBoxBtn5,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn5Slot(int)));
// connect(controlWidget->checkBoxBtn6,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn6Slot(int)));
// connect(controlWidget->checkBoxBtn7,SIGNAL(stateChanged(int)),this,SLOT(checkBoxBtn7Slot(int)));
connect(controlWidget->radioBtn1,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
connect(controlWidget->radioBtn2,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
connect(controlWidget->radioBtn3,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
connect(controlWidget->radioBtn4,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
connect(controlWidget->radioBtn5,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
connect(controlWidget->radioBtn6,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
connect(controlWidget->radioBtn7,SIGNAL(clicked()),this,SLOT(radioBtnSlot()));
}
/**
* @brief 控制显示曲线
*/
void standardBightWidget::controlDisCurve()
{
if( !cruveGeneration ) return;
if( controlWidget->checkBoxBtn1->checkState() == Qt::Checked ){
cruveGeneration->setCruveVisible_Log_Logist(true);
}else{
cruveGeneration->setCruveVisible_Log_Logist(false);
}
if( controlWidget->checkBoxBtn2->checkState() == Qt::Checked ){
cruveGeneration->setCruveVisible_Duoxiangshi(true);
}else{
cruveGeneration->setCruveVisible_Duoxiangshi(false);
}
if( controlWidget->checkBoxBtn3->checkState() == Qt::Checked ){
cruveGeneration->setCruveVisible_Logistic(true);
}else{
cruveGeneration->setCruveVisible_Logistic(false);
}
if( controlWidget->checkBoxBtn5->checkState() == Qt::Checked ){
cruveGeneration->setCruveVisible_LogLinearFit(true);
}else{
cruveGeneration->setCruveVisible_LogLinearFit(false);
}
}
/**
* @brief 根据单选框设置重新生成曲线并显示函数和R^2值;
*/
void standardBightWidget::setFuctionString()
{
createCurve();
}
/**
* @brief standardBightWidget::保存和退出按钮信号槽
*/
void standardBightWidget::saveBtnSlot()
{
//保存标准曲线系数
QSqlQuery query;
if(!standardBightWidget::CurveDisplayFlag){
QMessageBox::critical(this,tr("提示!"),tr("当前参数没有生成，无法保存!"));
return;
}else{
standardBightWidget::CurveDisplayFlag = false;
//保存当前参数
double *coefficient;
int type; //拟合类型
if( controlWidget->radioBtn1->isChecked()){
type = LOGLOGISTIC;
coefficient = cruveGeneration->lr->getcoeff();
}else if( controlWidget->radioBtn2->isChecked()){
coefficient = cruveGeneration->duoxiangshi->getCoefficient();
type = DUOXIANGSHI;
}else if( controlWidget->radioBtn3->isChecked()){ // 四参数y = d+(a-d)/(1+(x/c)^b)
type = LOGISTIC;
coefficient = cruveGeneration->logistic->getCoefficient();
}else if( controlWidget->radioBtn4->isChecked()){
}else if( controlWidget->radioBtn5->isChecked()){
type = LOGLINEARFIT;
coefficient = cruveGeneration->linear_fit->getcoef();
coefficient[2] = cruveGeneration->linear_fit->F0;
}else if( controlWidget->radioBtn6->isChecked()){
}else if( controlWidget->radioBtn7->isChecked()){
}
// 查询数据库中是否存在该项目的曲线，如果存在 ，则选择是否覆盖？
query.exec("select ID,DEL_FLAG from cruve_parameter where REAGENT_CODE = " + controlWidget->strBarCode);
while(query.next())
{
QString id = query.value("ID").toString();
qDebug()<<"id------"<<id;
int flag = query.value("DEL_FLAG").toInt();
if(flag == 0){
if(QMessageBox::question(this,tr("提示"),tr("已存在该项目曲线,是否覆盖？")) == QMessageBox::Yes)
{
QSqlQuery query2;
query2.exec("UPDATE cruve_parameter SET DEL_FLAG = 1 where ID = " + id);
}else
{
return;
}
}
}
//保存标准点信息
controlWidget->saveStandData();
//点击哪个确认按钮将数据写入数据库cruve_parameter
//query.exec("insert into cruve_parameter values(NULL,'2',3,1.1,2.2,3.3,4.4,5.5,6.6,'2017-11-23 16:43:00','11','12','13','0')");
query.exec("insert into cruve_parameter values(?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?,?)");
// query.bindValue(0,__null); //第一列的数据 （第一列为主键，不用添加数据）
query.bindValue(1,controlWidget->strCateGory);
query.bindValue(2,controlWidget->strCateGoryCode);
query.bindValue(3,controlWidget->strProjectName);
query.bindValue(4,controlWidget->strProjectNameCode);
query.bindValue(5,controlWidget->strReagentType);
query.bindValue(6,controlWidget->strReagentTypeCode);
query.bindValue(7,controlWidget->strBarCode.remove(0,1));
query.bindValue(8,type);
query.bindValue(9,coefficient[0]);
query.bindValue(10,coefficient[1]);
query.bindValue(11,coefficient[2]);
query.bindValue(12,coefficient[3]);
query.bindValue(13,0.0);
query.bindValue(14,0.0);
query.bindValue(15,0);
query.bindValue(16,QDateTime::currentDateTime().toString("yyyy-MM-dd hh:mm:ss"));
query.bindValue(17,0);
query.bindValue(18,0);
query.bindValue(19,0);
if(!query.exec())
{
QMessageBox::critical(this,QObject::tr("错误代码:E0016"),query.lastError().text());
}else{
QMessageBox::information(this,tr("提示！"),tr("已成功保存！"));
return;
}
}
}
void standardBightWidget::quitBtnSlot()
{
if(standardBightWidget::CurveDisplayFlag){
if(QMessageBox::information(this,tr("提示!"),tr("当前参数没有保存，是否退出!"),QMessageBox::Ok,QMessageBox::Cancel) == QMessageBox::Ok){
emit quitOkSign();
}else return;
}else emit quitOkSign();
}
/**
* @brief 生成曲线，并显示曲线函数和拟合优度
*/
void standardBightWidget::createCurve()
{
//更改拟合曲线名称及拟合优度
double *coefficient;
QString coefficient_str; //曲线方程式
QString R_R_str; //曲线拟合优度
int count = 0; //勾选标准点数
QVector<double> C_Data = controlWidget->ReturnCheck_C_Data();
QVector<double> P_Data = controlWidget->ReturnCheck_P_Data();
if(C_Data.isEmpty()) return;
count = C_Data.count();
double x[count];
double y[count];
QVector<double>::iterator iter;
int i = 0;
int j = 0;
for(iter = C_Data.begin();iter!= C_Data.end();iter++){
x[i] = *iter;
i++;
}
for(iter = P_Data.begin();iter!= P_Data.end();iter++){
y[j] = *iter;
j++;
}
if(standardBightWidget::CurveDisplayFlag){
delete cruveGeneration;
}else standardBightWidget::CurveDisplayFlag = true;
int type = -1; //曲线拟合类型
if(controlWidget->radioBtn1->isChecked()) //logistic拟合
{
type = LOGLOGISTIC;
}
else if(controlWidget->radioBtn2->isChecked()) //多项式拟合
{
type = DUOXIANGSHI;
}
else if(controlWidget->radioBtn3->isChecked()) // 四参数y = d+(a-d)/(1+(x/c)^b)
{
type = LOGISTIC;
}
else if(controlWidget->radioBtn4->isChecked())
{
}
else if(controlWidget->radioBtn5->isChecked()) //对数线性拟合
{
type = LOGLINEARFIT;
}
else if(controlWidget->radioBtn6->isChecked())
{
}
else if(controlWidget->radioBtn7->isChecked())
{
}
//画曲线
cruveGeneration = new CruveGeneration(DrawWidget->drawWidget,x,y,count,Fuction_COEFFICIENT_COUNT,type);
cruveGeneration->show();
if(controlWidget->radioBtn1->isChecked()) //logistic拟合
{
coefficient = cruveGeneration->lr->getcoeff();
QString str = "y = %1/(1+(%2/%3-1)*e^(-%4*x))";
coefficient_str = str.arg(QString::number(coefficient[0],10,6),QString::number(coefficient[0],10,6),QString::number(coefficient[1],10,6),QString::number(coefficient[2],10,6));
R_R_str.append(QString::number(cruveGeneration->lr->getBestR(),10,6));
}
else if(controlWidget->radioBtn2->isChecked()) //多项式拟合
{
coefficient = cruveGeneration->duoxiangshi->getCoefficient();
coefficient_str.append("y = "+ QString::number(coefficient[0],10,6));
for(int i = 1;i < Fuction_COEFFICIENT_COUNT;i++){
if(coefficient[i] > 0){
coefficient_str.append("+"+QString::number(coefficient[i],10,6)+"x^"+QString::number(i));
}else{
coefficient_str.append(QString::number(coefficient[i],10,6)+"x^"+QString::number(i));
}
}
R_R_str.append(QString::number(cruveGeneration->duoxiangshi->getR(),10,6));
}
else if(controlWidget->radioBtn3->isChecked()) // 四参数y = d+(a-d)/(1+(x/c)^b)
{
coefficient = cruveGeneration->logistic->getCoefficient();
QString str = "y = (%1-%2)/(1+(x/%3)^%4)+%5";
coefficient_str = str.arg(QString::number(coefficient[0],10,6),QString::number(coefficient[3],10,6),QString::number(coefficient[2],10,6),QString::number(coefficient[1],10,6),QString::number(coefficient[3],10,6));
R_R_str.append(QString::number(cruveGeneration->logistic->getR(),10,6));
}
else if(controlWidget->radioBtn4->isChecked())
{
}
else if(controlWidget->radioBtn5->isChecked()) //对数线性拟合
{
coefficient = cruveGeneration->linear_fit->getcoef();
QString str = "y = %1+%2*x";
coefficient_str = str.arg(QString::number(coefficient[0],10,6),QString::number(coefficient[1],10,6));
R_R_str.append(QString::number(cruveGeneration->linear_fit->getR(),10,6));
}
else if(controlWidget->radioBtn6->isChecked())
{
}
else if(controlWidget->radioBtn7->isChecked())
{
}
//显示拟合曲线名称，和曲线拟合优度
DrawWidget->setfuctionLab(coefficient_str,R_R_str);
}
/**
* @brief 7个函数显示选择按钮槽
*/
void standardBightWidget::checkBoxBtn1Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
void standardBightWidget::checkBoxBtn2Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
void standardBightWidget::checkBoxBtn3Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
void standardBightWidget::checkBoxBtn4Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
void standardBightWidget::checkBoxBtn5Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
void standardBightWidget::checkBoxBtn6Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
void standardBightWidget::checkBoxBtn7Slot(int state)
{
if(state == Qt::Checked){
createCurve();
controlDisCurve();
}else if(state == Qt::Unchecked){
createCurve();
controlDisCurve();
}
}
/**
* @brief 显示曲线单选按钮
*/
void standardBightWidget::radioBtnSlot()
{
if(standardBightWidget::CurveDisplayFlag){
setFuctionString();
}
}
| [
"884428413@qq.com"
] | 884428413@qq.com |
b52de22006f66547541fea6213146fff345cb81e | dc281e94e9b0d9b895867ec296ca90889d384675 | /Geeks for geeks/Data-Structure/Array/Easy/The Optimal Selection.cpp | a41b2c2c7518ffd8c1f3ed97687cd28f526cbb81 | [] | no_license | shreyash184/c-codes | 70c494137c8a1224b0d688b22479667c6135a36d | 79a92ef066493d88afb1758d76e24d989e4c07c3 | refs/heads/master | 2023-02-02T12:32:32.018515 | 2020-05-01T04:28:09 | 2020-05-01T04:28:09 | 145,076,888 | 1 | 0 | null | 2023-02-01T11:52:36 | 2018-08-17T05:42:43 | C++ | UTF-8 | C++ | false | false | 316 | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
//code
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a, a+n);
int prod = 0;
for(int i=0;i<n;i++){
prod+=i*a[i];
}
cout<<prod<<endl;
}
return 0;
} | [
"shreyashchavhan8@gmail.com"
] | shreyashchavhan8@gmail.com |
8d04c9de62bf67ce7dab953b1d47a3ef64bda731 | 1c3dbc41112f6abbbf917e402a8970aad0ffe301 | /obelus/client/interfaces/interfaces.hpp | 8c08f22fdbded7b87358d15d3ea198143aea0827 | [
"MIT"
] | permissive | TurkLee/obelus-hack | 362a3f756af7d442cc8b4f784beebd1c356a31bd | 8e83eb89ef56788c1b9c5af66b815824d17f309d | refs/heads/main | 2023-06-15T22:45:31.427393 | 2021-07-08T09:21:39 | 2021-07-08T09:21:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,035 | hpp | #pragma once
#define NOMINMAX
#include <windows.h>
#undef NOMINMAX
#define FMT_HEADER_ONLY
#include "../../client/fmt/format.h"
#include "../../client/fmt/chrono.h"
#include <cstdint>
#include <string>
#include <stdexcept>
#include "i_base_client_dll.hpp"
#include "i_client_entity_list.hpp"
#include "iv_engine_client.hpp"
#include "i_client_state.hpp"
#include "i_panel.hpp"
#include "i_surface.hpp"
#include "c_global_vars_base.hpp"
#include "i_material_system.hpp"
#include "iv_model_info.hpp"
#include "iv_model_render.hpp"
#include "iv_debug_overlay.hpp"
#include "i_console.hpp"
#include "i_localize.hpp"
#include "i_game_event_manager.hpp"
#include "i_input.hpp"
#include "i_input_system.hpp"
#include "i_trace.hpp"
#include "i_render_view.hpp"
#include "glow_manager.hpp"
#include "i_player_movement.hpp"
#include "i_weapon_system.hpp"
using MemAllocFailHandler_t = std::size_t(__cdecl*)(std::size_t);
class IMemAlloc
{
public:
// Release versions
virtual void* Alloc(std::size_t nSize) = 0;
virtual void* Realloc(void* pMemory, std::size_t nSize) = 0;
virtual void Free(void* pMemory) = 0;
virtual void* Expand(void* pMemory, std::size_t nSize) = 0; // no longer supported
// Debug versions
virtual void* Alloc(std::size_t nSize, const char* szFileName, int nLine) = 0;
virtual void* Realloc(void* pMemory, std::size_t nSize, const char* szFileName, int nLine) = 0;
virtual void Free(void* pMemory, const char* szFileName, int nLine) = 0;
virtual void* Expand(void* pMemory, std::size_t nSize, const char* szFileName, int nLine) = 0; // no longer supported
// Returns size of a particular allocation
virtual std::size_t GetSize(void* pMemory) = 0;
};
using CreateInterfaceFn = void* (__cdecl*)(const char*, int*);
using InstantiateInterfaceFn = void* (__cdecl*)(void);
using DemoCustomDataCallbackFn = void(__cdecl*)(unsigned char*, std::size_t);
class CInterfaceRegister
{
public:
InstantiateInterfaceFn pCreateFn;
const char* szName;
CInterfaceRegister* pNext;
};
class customHook
{
public:
explicit customHook(void* ent)
{
base = reinterpret_cast<uintptr_t**>(ent);
}
template<typename function, typename original_function>
function apply(uint32_t index, original_function func)
{
auto old_func = base[index];
DWORD old;
VirtualProtect(&base[index], sizeof uintptr_t, PAGE_EXECUTE_READWRITE, &old);
base[index] = reinterpret_cast<uintptr_t*>(func);
VirtualProtect(&base[index], sizeof uintptr_t, old, &old);
return reinterpret_cast<function>(old_func);
}
private:
std::uintptr_t** base;
};
enum VGuiPanel_t
{
PANEL_ROOT = 0,
PANEL_GAMEUIDLL,
PANEL_CLIENTDLL,
PANEL_TOOLS,
PANEL_INGAMESCREENS,
PANEL_GAMEDLL,
PANEL_CLIENTDLL_TOOLS
};
class IEngineVGui {
public:
virtual ~IEngineVGui(void) {}
virtual uint32_t GetPanel(VGuiPanel_t type) = 0;
virtual bool IsGameUIVisible() = 0;
};
class CViewSetup {
public:
int m_x; // 0x0000
int m_old_x; // 0x0004
int m_y; // 0x0008
int m_old_y; // 0x000C
int m_width; // 0x0010
int m_old_width; // 0x0014
int m_height; // 0x0018
int m_old_height; // 0x001C
bool m_ortho; // 0x0020
float m_ortho_left; // 0x0024
float m_ortho_top; // 0x0028
float m_ortho_right; // 0x002C
float m_ortho_bottom; // 0x0030
bool m_custom_view_matrix; // 0x0034
matrix_t m_custom_matrix; // 0x0038
private:
PAD(0x48); // 0x0068
public:
float m_fov; // 0x00B0
float m_viewmodel_fov; // 0x00B4
vec3_t m_origin;
vec3_t m_angles;
float m_znear;
float m_zfar;
float m_znear_viewmodel;
float m_zfar_viewmodel;
float m_aspect_ratio;
float m_near_blur_depth;
float m_near_focus_depth;
float m_far_focus_depth;
float m_far_blur_depth;
float m_near_blur_radius;
float m_far_blur_radius;
int m_quality;
int m_motionblur_mode;
float m_shutter_time;
vec3_t m_shutter_open_pos;
vec3_t m_shutter_open_angles;
vec3_t m_shutter_close_pos;
vec3_t m_shutter_close_angles;
float m_offcenter_top;
float m_offcenter_bottom;
float m_offcenter_left;
float m_offcenter_right;
int m_edge_blur;
};
class CViewRender {
public:
// virtuals.
__forceinline const CViewSetup* GetPlayerViewSetup(int slot = -1) {
return utilities::GetMethod< const CViewSetup* (__thiscall*)(decltype(this), int) >(this, 12)(this, slot);
}
// members.
PAD(0x4);
CViewSetup m_view;
};
class IEngineSound
{
public:
virtual bool precachesound(const char* pSample, bool bPreload = false, bool bIsUISound = false) = 0;
virtual bool issoundprecached(const char* pSample) = 0;
};
namespace interfaces {
enum class interface_type { index, bruteforce };
template <typename T>
T* get_interface(const char*, const std::string&);
inline IBaseClientDll* client;
inline IInput* input;
inline IClientEntityList* entity_list;
inline IVEngineClient* engine;
inline IClientMode* clientmode;
inline IClientState* clientstate;
inline IPanel* panel;
inline ISurface* surface;
inline GlobalVarsBase* globals;
inline IMaterialSystem* material_system;
inline IVModelInfo* model_info;
inline IVModelRender* model_render;
inline IRenderView* render_view;
inline IEngineSound* engine_sound;
inline IVDebugOverlay* debug_overlay;
inline IConsole* console;
inline ILocalize* localize;
inline IGameEventManager2* event_manager;
inline IInputSystem* inputsystem;
inline IDirect3DDevice9* directx;
inline ITrace* trace_ray;
inline GlowManager* glow_manager;
inline IPlayerGameMovement* game_movement;
inline PlayerPrediction* prediction;
inline PlayerMoveHelper* move_helper;
inline IWeaponSystem* weapon_system;
inline IStudioRender* studio_render;
inline IMemAlloc* mem_alloc;
inline customHook* player_vtable;
inline IEngineVGui* engine_vgui;
inline CViewRender* view_render;
bool initialize();
}
| [
"46615969+monthyx1337@users.noreply.github.com"
] | 46615969+monthyx1337@users.noreply.github.com |
ce6c284095269d9bd8e3d2680762e9ca39949f53 | ba10da4be74ba4e472bbe4b51d411627fc07bdbf | /build/iOS/Preview/include/Fuse.Reactive.Equal.h | c3974c9c0eb96c9cea8fb259e7e4e2ca09001407 | [] | no_license | ericaglimsholt/gadden | 80f7c7b9c3c5c46c2520743dc388adbad549c679 | daef25c11410326f067c896c242436ff1cbd5df0 | refs/heads/master | 2021-07-03T10:07:58.451759 | 2017-09-05T18:11:47 | 2017-09-05T18:11:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,259 | h | // This file was generated based on '/Users/ericaglimsholt/Library/Application Support/Fusetools/Packages/Fuse.Reactive.Expressions/1.0.5/$.uno'.
// WARNING: Changes might be lost if you edit this file directly.
#pragma once
#include <Fuse.Reactive.IExpression.h>
#include <Fuse.Reactive.InfixOperator.h>
namespace g{namespace Fuse{namespace Reactive{struct Equal;}}}
namespace g{namespace Fuse{namespace Reactive{struct Expression;}}}
namespace g{
namespace Fuse{
namespace Reactive{
// public sealed class Equal :566
// {
::g::Fuse::Reactive::InfixOperator_type* Equal_typeof();
void Equal__ctor_3_fn(Equal* __this, ::g::Fuse::Reactive::Expression* left, ::g::Fuse::Reactive::Expression* right);
void Equal__Compute_fn(Equal* __this, uObject* left, uObject* right, uObject** __retval);
void Equal__New1_fn(::g::Fuse::Reactive::Expression* left, ::g::Fuse::Reactive::Expression* right, Equal** __retval);
void Equal__get_Symbol_fn(Equal* __this, uString** __retval);
struct Equal : ::g::Fuse::Reactive::InfixOperator
{
void ctor_3(::g::Fuse::Reactive::Expression* left, ::g::Fuse::Reactive::Expression* right);
static Equal* New1(::g::Fuse::Reactive::Expression* left, ::g::Fuse::Reactive::Expression* right);
};
// }
}}} // ::g::Fuse::Reactive
| [
"ericaglimsholt@hotmail.com"
] | ericaglimsholt@hotmail.com |
cba0173ff648649e0468e6bb71feaeb8db873072 | 888f821260b4bfda6df2ab4ba5c639fd16f30c94 | /codeforces/cfv1/D.cpp | dd2c69e3c302362fb96da4d050b4d43e5394a3c2 | [] | no_license | JustBeYou/infoarena | 1b8a6d32d039dc6e53f592003ce9ef1cfc79812e | f335d7f7a074255e60262c31d518b9ca86d5f30d | refs/heads/master | 2021-07-05T12:21:56.854223 | 2020-09-12T15:47:23 | 2020-09-12T15:47:23 | 179,277,917 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 345 | cpp | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef signed long long ll;
typedef unsigned int uint;
const int nmax = 10000;
ull sol;
ull n;
int main() {
//freopen("input", "r", stdin);
cin >> n;
for (ull i = 2; i < n; i++) {
sol += i * (i + 1) * 1ULL;
}
cout << sol << "\n";
return 0;
}
| [
"mihailferaru2000@gmail.com"
] | mihailferaru2000@gmail.com |
c9859454f07f464d7adc8283920e78e920869cce | cd91c991f2218b1b97a08125f160c497327ad00c | /activ.cpp | 2ce1470f80a8c63823b0cc4b68611c8ffd153797 | [] | no_license | pruvi007/SPOJ_CLASSICAL | fe74c1729227c6176102b318e46103fd548a9364 | be28e14bad9af12bc3c56e764f8ab14650c4bb99 | refs/heads/master | 2020-07-18T10:58:48.037574 | 2019-11-01T01:47:33 | 2019-11-01T01:47:33 | 206,233,688 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,436 | cpp | /*
*/
// solution by @pruvi007
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
struct myComp{
bool operator()(vector<ll> a,vector<ll> b)
{
return a[1] < b[1];
}
};
#define ll long long int
ll mod = 1e8;
int bs(vector<vector<ll> > &v,int l,int r,int x)
{
int ans = -1;
while(l<=r)
{
int mid = (l+r)/2;
if(v[mid][0] >= x)
{
ans = mid;
r = mid-1;
}
else
l = mid+1;
}
return ans;
}
int main()
{
int n;
while( cin >> n )
{
if( n == -1 )
break;
vector< vector<ll> > v(n);
for(int i=0;i<n;i++)
{
ll x,y;
cin >> x >> y;
v[i].push_back(x);
v[i].push_back(y);
}
sort( v.begin(),v.end(),myComp() );
// for(int i=0;i<n;i++)
// cout << v[i][0] << " " << v[i][1] << endl;
ll dp[n];
dp[n-1] = 1;
// for(int i=1;i<n;i++)
// {
// dp[i] = 1;
// for(int j=0;j<i;j++)
// {
// if( v[j][1]<=v[i][0] )
// dp[i] += dp[j];
// }
// }
for(int i= n-2;i>=0;i--)
{
dp[i] = (1+dp[i+1]%mod)%mod;
ll x = v[i][1];
ll idx = bs(v,i,n-1,x);
if(idx!=-1)
dp[i] = (dp[i]%mod+dp[idx]%mod)%mod;
}
ll sum = dp[0]%mod;
// for(int i=0;i<n;i++)
// sum += dp[i];
string ans = to_string(sum);
if( ans.length()<8 )
{
string t="";
int z = 8-ans.length();
for(int i=0;i<z;i++)
cout << '0';
cout << ans << endl;
}
else
{
for(int i=ans.length()-1;i>=8;i--)
cout << ans[i];
cout << endl;
}
}
} | [
"pruvi007@gmail.com"
] | pruvi007@gmail.com |
2f065e11e49cd70603f54422debc731b8135f808 | 895e1f0af56518c7956594f7c650211d9fc2467a | /labs/game_engine/prototypes/prototype_4/include/ext_voxel/VoxelBlock.h | 2fe56afdd0fc293aeed672a87f36ed44f32508c1 | [] | no_license | lythm/orb3d | b6061ebf839381a35aaeab8baf08a38fcfe03a71 | 2defcbf86ef7dd2a27fe7bdc89bf709ed8bf2a79 | refs/heads/master | 2016-09-15T15:55:19.069094 | 2013-07-12T17:09:29 | 2013-07-12T17:09:55 | 4,442,482 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 130 | h | #pragma once
namespace engine
{
class VoxelBlock
{
public:
VoxelBlock(void);
virtual ~VoxelBlock(void);
private:
};
} | [
"lythm780522@gmail.com"
] | lythm780522@gmail.com |
14ca2f4adc1a3514ae32a5f62427f7ac00ddbc19 | 44c64a65a1148728b9f33c1f8dd6c8de5b7af95e | /kernel/objects/aircraft_physless/aircraft_physless_view.h | 54446a47f02af308860b73b878b5ee0cd84459c4 | [] | no_license | wangfeilong321/test_osg | 0a36381f53095f47f79f807483ce75e3ec6572e5 | 0c20e55b870f5069665122ec8118a542607200d3 | refs/heads/master | 2021-01-14T13:07:11.522705 | 2015-12-30T18:38:32 | 2015-12-30T18:38:32 | 48,838,585 | 0 | 1 | null | 2015-12-31T07:04:14 | 2015-12-31T07:04:14 | null | WINDOWS-1251 | C++ | false | false | 7,396 | h | #pragma once
#include "common/aircraft.h"
#include "common/aircraft_fms.h"
//#include "objects/aircraft_physless.h"
#include "objects/nodes_management.h"
#include "aircraft_physless/aircraft_physless_common.h"
#include "common/test_msgs.h"
#include "aircraft_physless_state.h"
namespace aircraft_physless
{
struct craft_data
{
craft_data()
: settings_ (aircraft::settings_t())
, state_ (aircraft::state_t())
{
std::for_each(malfunctions_.begin(), malfunctions_.end(), [](bool& item){item = false;});
}
explicit craft_data(aircraft::settings_t const& settings, aircraft::state_t const& state)
: settings_ (settings)
, state_ (state)
{
std::for_each(malfunctions_.begin(), malfunctions_.end(), [](bool& item){item = false;});
}
protected:
aircraft::settings_t settings_;
array<bool, aircraft::MF_SIZE> malfunctions_;
aircraft::state_t state_; // Исключительно для задания начальных параметров
REFL_INNER(craft_data)
REFL_ENTRY(settings_ )
REFL_ENTRY(malfunctions_)
REFL_ENTRY(state_ )
REFL_END()
};
//////////////////////////////////////////////////////////////////////////
struct view
: kernel::base_view_presentation
, obj_data_holder<craft_data>
, aircraft::info
, aircraft::control
, aircraft::aircraft_ipo_control
{
static object_info_ptr create(kernel::object_create_t const& oc, dict_copt dict);
protected:
typedef
msg::contact_effect::contact_t
contact_t;
protected:
view( kernel::object_create_t const& oc, dict_copt dict );
public:
~view();
// base_presentation
protected:
void pre_update(double time) override;
// base_view_presentation
protected:
void on_object_created (object_info_ptr object) override ;
void on_object_destroying(object_info_ptr object) override ;
void on_child_appended (object_info_ptr child) override ;
void on_child_removing (object_info_ptr child) override ;
// info
protected:
geo_point_3 const& pos () const override;
point_3 dpos () const override;
cpr orien () const override;
aircraft::settings_t const & settings () const override;
#if 1
fpl::info_ptr get_fpl () const override;
#endif
bool has_assigned_fpl () const override;
transform_4 const& tow_point_transform() const override;
nodes_management::node_info_ptr root() const override;
nodes_management::node_info_ptr tow_point() const override;
bool malfunction(aircraft::malfunction_kind_t kind) const override;
optional<double> get_prediction_length() const override;
optional<double> get_proc_length() const override;
// control
protected:
void unassign_fpl() {};
void set_kind (std::string const& kind) override;
void set_turbulence (unsigned turb) override;
protected:
void set_state (state_t const& st) /*override*/;
void set_state (state_t const& st, bool sure);
// aircraft_ipo_control
protected:
void set_malfunction (aircraft::malfunction_kind_t kind, bool enabled) override;
void set_cmd_go_around(uint32_t cmd_id) override;
void set_cmd_holding (uint32_t cmd_id, fms::holding_t const &holding) override;
void set_cmd_course (uint32_t cmd_id, fms::course_modifier_t const &course) override;
void cancel_cmd (uint32_t cmd_id) override;
void set_responder_mode(atc::responder_mode mode) override;
void set_responder_type(atc::squawk_type stype) override;
void set_responder_code(unsigned code) override;
void set_responder_flag(unsigned flag, bool enable) override;
void restore_responder_code() override;
protected:
void set_parking_initial_position(std::string const &airport_name, std::string const &parking_name);
// fms_container
protected:
aircraft::aircraft_fms::info_ptr get_fms() const override;
protected:
virtual void on_settings_changed() {}
//virtual void on_fpl_changed();
//virtual void on_fms_changed();
//virtual void on_fms_state_changed();
//virtual void on_plan_changed();
virtual void on_atc_controls_changed() {}
virtual void on_ipo_controls_changed() {}
virtual void on_malfunction_changed (aircraft::malfunction_kind_t /*kind*/) {}
//virtual void on_assigned_fpl_changed();
virtual void on_new_contact_effect (double /*time*/, std::vector<contact_t> const& /*contacts*/){}
virtual void on_new_wheel_contact_effect(double /*time*/, point_3f /*vel*/, point_3f /*offset*/){}
private:
void on_provider_destroy();
double len_for_cmd() const;
// msg dispatching
private:
void on_settings (aircraft::settings_t const& m);
void on_fpl (optional<uint32_t> const& id);
void on_malfunction (msg::malfunction_msg const& m );
void on_contact_effect (msg::contact_effect const& eff );
void on_wheel_contact_effect(msg::wheel_contact_effect const& eff );
void on_traj_assign (msg::traj_assign_msg const & tr );
void on_local_meteo (msg::local_meteo_msg const& msg );
protected:
virtual void on_state (msg::state_msg const& msg); // fms
protected:
void set_fpl_initial_position();
//void update_atc_state();
nodes_management::manager_ptr get_nodes_manager() const { return nodes_manager_; }
private:
optional<double> last_len_calc_;
private:
nodes_management::manager_ptr nodes_manager_;
private:
scoped_connection fms_changed_connection_ ;
scoped_connection state_changed_connection_ ;
scoped_connection plan_changed_connection_ ;
protected:
transform_4 tow_point_transform_;
optional<double> proc_len_;
optional<double> prediction_len_;
void update_len(double time);
protected:
//////////////////////////////////////
fms::trajectory_ptr traj_;
meteo::local_params lp_;
/////////////////////////////////////
DECLARE_EVENT(state_changed, ()) ; // fms
state_t _state;
inline state_t const& get_state() const {return _state;}
private:
#if 0
tp_sys::control_ptr tp_sys_;
fms::tp::aircraft_ptr airc_tp_;
#endif
size_t providers_count_;
double max_pred_len_;
private:
boost::optional<unsigned> old_responder_code_ ;
private:
scoped_connection fpl_changed_conn_;
private:
std::vector< std::pair<double, std::string> > oldi_sequence_ ;
};
} // aircraft
| [
"yaroslav.tarasov@gmail.com"
] | yaroslav.tarasov@gmail.com |
ea9efe4cfc4fc5e62f6fcd1a4e8e9bcf9d293d6b | 01940d46f04f2b7be932cc2f9aedc19e8dc6d8cd | /Server/StaticNFrame/NFComm/NFNetPlugin/QiPaiNetPacketParse.cpp | cc6020c277fc1f0b280dd6b15666fb05602d47d4 | [] | no_license | xuebai5/StaticNFrame | 07861ff59c59826c92a4731042ecc35356488fa6 | 05421e35bdb81fdda01050cdb8549375d6ddacc8 | refs/heads/master | 2022-04-01T13:37:53.479759 | 2020-01-03T07:35:33 | 2020-01-03T07:35:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,108 | cpp | // -------------------------------------------------------------------------
// @FileName : QiPaiNetPacketParse.cpp
// @Author : GaoYi
// @Date : 2018/05/25
// @Email : 445267987@qq.com
// @Module : NFNetPlugin
//
// -------------------------------------------------------------------------
#include "QiPaiNetPacketParse.h"
#include "NFNetDefine.h"
#include "NFComm/NFPluginModule/NFLogMgr.h"
#pragma pack(push)
#pragma pack(1)
struct qipaiMsg
{
public:
qipaiMsg() : mSZ(0), mCmdID(0), mValue(0)
{
mHead[0] = 'h';
mHead[1] = 'e';
mHead[2] = 'a';
mHead[3] = 'd';
}
char mHead[4];
uint32_t mSZ;
uint16_t mCmdID;
uint16_t mValue;
};
#pragma pack(pop)
QiPaiNetPacketParse::QiPaiNetPacketParse()
{
}
int QiPaiNetPacketParse::DeCodeImpl(const char* strData, const uint32_t unLen, char*& outData, uint32_t& outLen, uint32_t& allLen, uint32_t& nMsgId, uint64_t& nValue)
{
if (strData == nullptr || unLen == 0) return 1;
qipaiMsg* packHead = nullptr;
if (unLen < static_cast<uint32_t>(sizeof(qipaiMsg)))
{
return 1;
}
packHead = (qipaiMsg*)strData; //-V519
uint32_t msgSize = packHead->mSZ;
uint16_t tmpMsgId = packHead->mCmdID;
uint16_t tmpValue = packHead->mValue;
if (sizeof(qipaiMsg) + msgSize >= MAX_RECV_BUFFER_SIZE) //-V560
{
NFLogError(NF_LOG_SYSTEMLOG, 0, "net server parse data failed, msgSize:{}, msgId:{}, value:{}", msgSize, tmpMsgId, tmpValue);
return -1;
}
if (sizeof(qipaiMsg) + msgSize > unLen)
{
return 1;
}
outData = const_cast<char*>(strData + sizeof(qipaiMsg));
outLen = msgSize;
nMsgId = tmpMsgId;
nValue = tmpValue;
allLen = sizeof(qipaiMsg) + msgSize;
return 0;
}
int QiPaiNetPacketParse::EnCodeImpl(const uint32_t unMsgID, const uint64_t nValue, const char* strData, const uint32_t unDataLen, NFBuffer& buffer)
{
qipaiMsg packHead;
packHead.mSZ = unDataLen;
packHead.mCmdID = (uint16_t)unMsgID;
packHead.mValue = (uint16_t)nValue;
buffer.PushData(&packHead, sizeof(qipaiMsg));
buffer.PushData(strData, unDataLen);
return unDataLen + sizeof(qipaiMsg);
}
| [
"445267987@qq.com"
] | 445267987@qq.com |
7a00de4c51f97c454cc6f32dbcdd319984ccade8 | 6ea6691636a1a5072f12efe0aad9d778d32f126c | /OGLplus_build/implement/oalplus/enums/context_attrib_def.ipp | 4d2195827f63e305e8f2f2ed9db3ed5bb42cc633 | [
"BSL-1.0"
] | permissive | pm990320/OpenGLLearning | 6c63234da5f00193bf3799ee4b97b16bd14cdc6b | d4f83a047dbfe816631d59ea1115176514d9fad6 | refs/heads/master | 2021-01-10T06:21:34.592102 | 2014-07-04T10:42:52 | 2014-07-04T10:42:52 | 54,271,323 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,574 | ipp | /*
* .file oalplus/enums/context_attrib_def.ipp
*
* Automatically generated header file. DO NOT modify manually,
* edit 'source/enums/oalplus/context_attrib.txt' instead.
*
* Copyright 2010-2013 Matus Chochlik. Distributed under the Boost
* Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#ifdef OALPLUS_LIST_NEEDS_COMMA
# undef OALPLUS_LIST_NEEDS_COMMA
#endif
#if defined ALC_FREQUENCY
# if OALPLUS_LIST_NEEDS_COMMA
OALPLUS_ENUM_CLASS_COMMA
# endif
# if defined Frequency
# pragma push_macro("Frequency")
# undef Frequency
OALPLUS_ENUM_CLASS_VALUE(Frequency, ALC_FREQUENCY)
# pragma pop_macro("Frequency")
# else
OALPLUS_ENUM_CLASS_VALUE(Frequency, ALC_FREQUENCY)
# endif
# ifndef OALPLUS_LIST_NEEDS_COMMA
# define OALPLUS_LIST_NEEDS_COMMA 1
# endif
#endif
#if defined ALC_REFRESH
# if OALPLUS_LIST_NEEDS_COMMA
OALPLUS_ENUM_CLASS_COMMA
# endif
# if defined Refresh
# pragma push_macro("Refresh")
# undef Refresh
OALPLUS_ENUM_CLASS_VALUE(Refresh, ALC_REFRESH)
# pragma pop_macro("Refresh")
# else
OALPLUS_ENUM_CLASS_VALUE(Refresh, ALC_REFRESH)
# endif
# ifndef OALPLUS_LIST_NEEDS_COMMA
# define OALPLUS_LIST_NEEDS_COMMA 1
# endif
#endif
#if defined ALC_SYNC
# if OALPLUS_LIST_NEEDS_COMMA
OALPLUS_ENUM_CLASS_COMMA
# endif
# if defined Sync
# pragma push_macro("Sync")
# undef Sync
OALPLUS_ENUM_CLASS_VALUE(Sync, ALC_SYNC)
# pragma pop_macro("Sync")
# else
OALPLUS_ENUM_CLASS_VALUE(Sync, ALC_SYNC)
# endif
# ifndef OALPLUS_LIST_NEEDS_COMMA
# define OALPLUS_LIST_NEEDS_COMMA 1
# endif
#endif
#if defined ALC_MONO_SOURCES
# if OALPLUS_LIST_NEEDS_COMMA
OALPLUS_ENUM_CLASS_COMMA
# endif
# if defined MonoSources
# pragma push_macro("MonoSources")
# undef MonoSources
OALPLUS_ENUM_CLASS_VALUE(MonoSources, ALC_MONO_SOURCES)
# pragma pop_macro("MonoSources")
# else
OALPLUS_ENUM_CLASS_VALUE(MonoSources, ALC_MONO_SOURCES)
# endif
# ifndef OALPLUS_LIST_NEEDS_COMMA
# define OALPLUS_LIST_NEEDS_COMMA 1
# endif
#endif
#if defined ALC_STEREO_SOURCES
# if OALPLUS_LIST_NEEDS_COMMA
OALPLUS_ENUM_CLASS_COMMA
# endif
# if defined StereoSources
# pragma push_macro("StereoSources")
# undef StereoSources
OALPLUS_ENUM_CLASS_VALUE(StereoSources, ALC_STEREO_SOURCES)
# pragma pop_macro("StereoSources")
# else
OALPLUS_ENUM_CLASS_VALUE(StereoSources, ALC_STEREO_SOURCES)
# endif
# ifndef OALPLUS_LIST_NEEDS_COMMA
# define OALPLUS_LIST_NEEDS_COMMA 1
# endif
#endif
#ifdef OALPLUS_LIST_NEEDS_COMMA
# undef OALPLUS_LIST_NEEDS_COMMA
#endif
| [
"patmenlove@gmail.com"
] | patmenlove@gmail.com |
3275cda122d653bc5c7ae4c4a8926910f0a608c7 | 4d02ae49de2caf1d35eafba92d482db4cfa5d790 | /C++PrimerPlus/chapter03/3-处理数据/3.14_typecast.cpp | 58c2af1fff8e5573b35d26b9b8b8afce9eef35fe | [] | no_license | fei0511/C--PrimerPLusCode | 29b13c0c0992a5c3d0b6dcf5374d73a423005a20 | 46989078c868e195140251afec5d3a8ed27ca3b8 | refs/heads/main | 2023-01-30T20:05:41.422115 | 2020-12-10T14:23:44 | 2020-12-10T14:23:44 | 315,538,707 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 632 | cpp | #include <iostream>
//功能：3.14 c++强制类型转换
//时间：2020年11月23日21:00:34
int main()
{
using namespace std;
int auks, bats, coots;
auks = 19.99 + 11.99;
bats = (int) 19.99 + (int) 11.99;
coots = int(19.99) + int(11.99);
cout << "auks = " << auks << ", bats = " << bats;
cout << ", coots = " << coots << endl;
char ch = 'Z';
cout << "The code for " << ch << " is ";
cout << int(ch) << endl;
cout << "Yes, the code is ";
cout << static_cast<int>(ch) << endl;
system("pause");
return 0;
}
/*
auks = 31, bats = 30, coots = 30
The code for Z is 90
Yes, the code is 90
请按任意键继续. . .
*/ | [
"1277051100@qq.com"
] | 1277051100@qq.com |
61c000b201e14555a7e930cb15011d97d6f8c29e | beba921f6880d9e2575139ab9bb34f49ad16f5ed | /game_main.cpp | 14c63462d28e16ded00a999de27a639162e5b3af | [] | no_license | KaiRusch/BulletHellGame | 8db09950ff881216a7242432c85162fc91dae984 | 53d076f0cca11451a4b2a4719466fa930c33d395 | refs/heads/master | 2021-01-20T13:47:30.867977 | 2016-01-17T22:46:30 | 2016-01-17T22:46:30 | 25,844,021 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,980 | cpp | #include "game_main.hpp"
Entity::Entity(vec2d position, vec2d dimensions, float radius, vec2d velocity, int sprite) : position(position), dimensions(dimensions), radius(radius), velocity(velocity), sprite(sprite), destroy(false), type(ENTITY)
{
}
void Entity::render(GameWindow *gameWindow)
{
gameWindow->render_sprite(sprite,(int)position.x,(int)position.y);
}
void Entity::update(float dt)
{
position += velocity * dt;
}
bool Entity::check_in_bounds(float x, float y, float w, float h)
{
if(position.x + dimensions.x < x)
{
return false;
}
if(position.x - dimensions.x > x + w)
{
return false;
}
if(position.y + dimensions.y < y)
{
return false;
}
if(position.y - dimensions.y > y + h)
{
return false;
}
return true;
}
Bullet::Bullet(vec2d position, vec2d dimensions, float radius, vec2d velocity, int sprite, int damage, int allegiance) : Entity(position,dimensions,radius,velocity,sprite), damage(damage), allegiance(allegiance)
{
this->type = this->type | BULLET;
}
Pickup::Pickup(vec2d position, vec2d dimensions, float radius, vec2d velocity, int sprite, int pickupType) : Entity(position,dimensions,radius,velocity,sprite), pickupType(pickupType)
{
this->type = this->type | PICKUP;
}
Spaceship::Spaceship(vec2d position, vec2d dimensions, float radius, vec2d velocity, int sprite, int health, int allegiance, std::vector<Entity *> *gameEntities) : Entity(position,dimensions,radius,velocity,sprite), health(health), allegiance(allegiance), gameEntities(gameEntities)
{
this->type = this->type | SPACESHIP;
}
void Spaceship::check_collisions(Quadtree *quadtree)
{
std::vector<Entity *> inRange = quadtree->get_in_range
(position.x-dimensions.x,position.y-dimensions.y,
2*dimensions.x, 2*dimensions.y);
for(int i = 0; i < inRange.size(); ++i)
{
if((inRange[i]->position - position).length() <= 20.0f)
{
if(inRange[i]->type & BULLET == BULLET)
{
Bullet *bullet = (Bullet*) inRange[i];
if(bullet->allegiance != allegiance)
{
bullet->destroy = true;
}
}
}
}
}
Player::Player(vec2d position, vec2d dimensions, float radius, int sprite, int health, int allegiance, std::vector<Entity *> *gameEntities) : Spaceship(position,dimensions,radius,vec2d(0.0f,0.0f),sprite,health,allegiance,gameEntities), delay(0.0f), firingMode(SINGLE_FIRE)
{
this->type = this->type | PLAYER;
}
int bulletSprite;
void Player::handle_input(KeyboardState *keyboardState)
{
velocity = vec2d(0.0f,0.0f);
if(keyboardState->left)
{
velocity.x -= 100.0f;
}
if(keyboardState->right)
{
velocity.x += 100.0f;
}
if(keyboardState->up)
{
velocity.y -= 100.0f;
}
if(keyboardState->down)
{
velocity.y += 100.0f;
}
if(keyboardState->space && delay > 0.08f)
{
if(firingMode == SINGLE_FIRE || firingMode == TRIPLE_FIRE)
{
Bullet *bullet = new Bullet(position + vec2d(0.0f,-10.0f),
vec2d(2.5f,2.5f),
2.5f,
vec2d(0.0f,-250.0f),bulletSprite,
1, GOOD);
gameEntities->push_back(bullet);
}
if(firingMode == DOUBLE_FIRE || firingMode == TRIPLE_FIRE)
{
Bullet *bullet1 = new Bullet(position + vec2d(20.0f,0.0f),
vec2d(2.5f,2.5f),
2.5f,
vec2d(0.0f,-250.0f),bulletSprite,
1, GOOD);
Bullet *bullet2 = new Bullet(position + vec2d(-20.0f,0.0f),
vec2d(2.5f,2.5f),
2.5f,
vec2d(0.0f,-250.0f),bulletSprite,
1, GOOD);
gameEntities->push_back(bullet1);
gameEntities->push_back(bullet2);
}
delay = 0.0f;
}
}
void Player::update(float dt)
{
delay += dt;
Spaceship::update(dt);
}
void Player::check_collisions(Quadtree *quadtree)
{
std::vector<Entity *> inRange = quadtree->get_in_range
(position.x-dimensions.x,position.y-dimensions.y,
2*dimensions.x, 2*dimensions.y);
for(int i = 0; i < inRange.size(); ++i)
{
if((inRange[i]->position - position).length()
<= this->radius + inRange[i]->radius
&& inRange[i] != this)
{
if((inRange[i]->type & BULLET) == BULLET)
{
Bullet *bullet = (Bullet*) inRange[i];
if(bullet->allegiance != allegiance)
{
destroy = true;
bullet->destroy = true;
}
}
if((inRange[i]->type & PICKUP) == PICKUP)
{
Pickup *pickup = (Pickup *) inRange[i];
pickup->destroy = true;
switch(pickup->pickupType)
{
case DOUBLE:
{
this->firingMode = DOUBLE_FIRE;
} break;
case TRIPLE:
{
this->firingMode = TRIPLE_FIRE;
} break;
}
}
}
}
}
void Player::keep_in_screen(float x, float y, float w, float h)
{
if(position.x - dimensions.x < x)
{
position.x = x + dimensions.x;
}
if(position.x + dimensions.x > x + w)
{
position.x = x + w - dimensions.x;
}
if(position.y - dimensions.y < y)
{
position.y = y + dimensions.y;
}
if(position.y + dimensions.y > y + h)
{
position.y = y + h - dimensions.y;
}
}
KeyboardState::KeyboardState() : left(false), right(false), up(false), down(false), space(false)
{
}
Game::Game()
{
gameWindow.init("The Quest Fork", 500, 500);
gameOver = false;
}
//----------------GAME LOOP------------------
void Game::handle_input()
{
SDL_Event event;
while(SDL_PollEvent(&event))
{
if(event.type == SDL_QUIT)
{
gameOver = true;
}
if(event.type == SDL_KEYDOWN)
{
switch(event.key.keysym.sym)
{
case SDLK_LEFT: keyboardState.left = true; break;
case SDLK_RIGHT: keyboardState.right = true; break;
case SDLK_SPACE: keyboardState.space = true; break;
case SDLK_UP: keyboardState.up = true; break;
case SDLK_DOWN: keyboardState.down = true; break;
}
}
if(event.type == SDL_KEYUP)
{
switch(event.key.keysym.sym)
{
case SDLK_LEFT: keyboardState.left = false; break;
case SDLK_RIGHT: keyboardState.right = false; break;
case SDLK_SPACE: keyboardState.space = false; break;
case SDLK_UP: keyboardState.up = false; break;
case SDLK_DOWN: keyboardState.down = false; break;
}
}
}
}
void Game::update(float dt)
{
std::vector<Entity *> tempEntities;
std::vector<Player *> playerEntities;
std::vector<Spaceship *> spaceshipEntities;
for(int i = 0; i < gameEntities.size(); ++i)
{
if(gameEntities[i]->check_in_bounds(-250,-250,1000,1000)
&& !gameEntities[i]->destroy)
{
tempEntities.push_back(gameEntities[i]);
if((gameEntities[i]->type & SPACESHIP) == SPACESHIP)
{
spaceshipEntities.push_back((Spaceship *)gameEntities[i]);
}
if((gameEntities[i]->type & PLAYER) == PLAYER)
{
playerEntities.push_back((Player *)gameEntities[i]);
}
}
else
{
delete(gameEntities[i]);
}
}
gameEntities = tempEntities;
//Handle player input
for(int i = 0; i < playerEntities.size(); ++i)
{
playerEntities[i]->handle_input(&keyboardState);
}
//Update all game entities
Quadtree quadtree = Quadtree(0,0,500,500);
for(int i = 0; i < gameEntities.size(); ++i)
{
gameEntities[i]->update(dt);
quadtree.insert(gameEntities[i]);
}
//Check for collisions of spaceships
for(int i = 0; i < spaceshipEntities.size(); ++i)
{
spaceshipEntities[i]->check_collisions(&quadtree);
}
//Keep player on screen
for(int i = 0; i < playerEntities.size(); ++i)
{
playerEntities[i]->keep_in_screen(0,0,500,500);
}
}
void Game::render()
{
gameWindow.render_clear();
for(int i = 0; i < gameEntities.size(); ++i)
{
gameEntities[i]->render(&gameWindow);
}
gameWindow.render_present();
}
void Game::run()
{
int spriteSheet = gameWindow.load_texture("sprite_sheet.png");
while(!gameOver)
{
handle_input();
update(gameWindow.get_dt());
std::cout << gameEntities.size() << " entitites\n";
render();
}
}
| [
"kai.rusch@gmail.com"
] | kai.rusch@gmail.com |
110b0bd4cd95c228e1e78f404cea31ea643c38d1 | 43b1903f35fa75bf6490bff605410d2d12f82382 | /Semester1ClassWork/Work4/T7 OrderBinTree/orderBinaryTree.h | e39ba10de1a42e0c52bd7221f741020b92c7a5ec | [] | no_license | Trouvaille0198/DataStructure | 1a1ad2f27055338c0edd588a170a9e84c2c3e791 | 6ce4a1c9e76dcbc2fc97568f46c5e4d4a38595b7 | refs/heads/main | 2023-06-01T11:44:04.411907 | 2021-06-17T10:16:43 | 2021-06-17T10:16:43 | 316,417,692 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 4,494 | h | //顺序二叉树
#include <bits/stdc++.h>
using namespace std;
template <class T>
class Node
{
public:
int Ref; //标记节点类型
T data;
Node() //默认构造
{
}
Node(int r, const T &t) //非完全二叉树的结点
{
Ref = r;
data = t;
}
Node(const T &t) //完全二叉树的结点
{
Ref = 0;
data = t;
}
Node operator=(Node *a)
{
Ref = a->Ref;
data = a->data;
}
};
template <class T>
void CreateNodeArray(Node<T> *&a)
{
Node<T> *List;
List = new Node<T>[10];
List[0] = new Node<T>(0, 0);
List[1] = new Node<T>(1, 1);
List[2] = new Node<T>(2, 2);
List[3] = new Node<T>(1, 3);
List[4] = new Node<T>(2, 4);
List[5] = new Node<T>(1, 5);
List[6] = new Node<T>(2, 6);
List[7] = new Node<T>(1, 7);
List[8] = new Node<T>(2, 8);
List[9] = new Node<T>(1, 9);
a = List;
}
template <class T>
class BinaryTree
{
protected:
int _nodeNum; //节点数
int _rankNum; //层数
Node<T> *_dataArray; //里面全是指针
int *_refArray;
public:
BinaryTree(int nodeNum, Node<T> *data); //完全二叉树
BinaryTree(int nodeNum, Node<T> *data, int rankNum); //非完全二叉树
void showper();
void Find(int i, int j);
void FindParent(int a, int b);
};
template <class T>
BinaryTree<T>::BinaryTree(int nodeNum, Node<T> *data) //创建完美二叉树
{
_nodeNum = nodeNum;
int rankNum = 0;
for (int j = 1; (nodeNum = nodeNum - j) > 0; j = j * 2)
// 计算层数
{
rankNum++;
}
rankNum++;
_rankNum = rankNum;
_dataArray = new Node<T>[_nodeNum];
for (int i = 0; i < _nodeNum; i++)
// 依次将元素放入数组
{
_dataArray[i] = data[i];
}
}
template <class T>
void BinaryTree<T>::showper()
{
int temp = 0;
for (int i = 0; i < _rankNum; i++)
{
if (i == 0)
{
cout << _dataArray[i].data << endl;
temp++;
}
else
{
if (temp > 0)
{
for (int j = 0; j < 2 * i; j++)
{ //决定每一层的输出个数
temp++;
cout << _dataArray[temp - 1].data << " ";
if (temp == _nodeNum)
{
break;
}
}
cout << endl;
}
}
}
}
template <class T> //寻找下标i j的共同祖先 输出下标位置
void BinaryTree<T>::Find(int a, int b) //使用完全二叉树
{
int ta = a, tb = b;
int ra, rb; //判断下标所在位置是左边还是右边
for (int i = 0; i < _rankNum; i++)
{
int j = 1;
for (int l = 0; l < i; l++)
{
j = j * 2;
}
ta = ta - j; //找下标在第几层
if (ta < 0)
{
ta = ta + j; //找到后返回到这一层对应的位置
if (ta < j / 2)
{ //若小于层数内所有点个数的一半，则在左边
ra = 1;
}
else
{ //否则在右边
ra = 2;
}
break;
}
}
for (int i = 0; i < _rankNum; i++)
{ //找另一个下标的位置
int j = 1;
for (int l = 0; l < i; l++)
{
j = j * 2;
}
tb = tb - j;
if (tb < 0)
{
tb = tb + j;
if (tb < j / 2)
{
rb = 1;
}
else
{
rb = 2;
}
break;
}
}
if (ra != rb)
{ //若左右不同，共同祖先一定是根
cout << "共同祖先: 0" << endl;
return;
}
if (a < b)
{ //若相同，一定是层数靠前的一个的父亲
cout << "共同祖先: " << (a - 1) / 2 << endl;
}
else
{
cout << "共同祖先:" << (b - 1) / 2 << endl;
}
}
template <class T>
void BinaryTree<T>::FindParent(int a, int b)
//寻找下标a,b的共同祖先 输出下标位置
{
a = a + 1;
b = b + 1;
while ((a) / 2 != (b) / 2)
{
if (a < b)
b /= 2;
else
a /= 2;
}
int result = a / 2 - 1;
if (result < 0)
cout << "共同祖先: " << 0 << endl;
else
cout << "共同祖先: " << result << endl;
} | [
"1375911011@qq.com"
] | 1375911011@qq.com |
8c322c0476c489ae22b97ebe4119652d2638dd0c | a586d503c0abcae6e61a62c78fff39806863ddad | /d08/ex03/PutChar.cpp | c7349361a9c787d8564f4d97ef7c359c8ed5df07 | [] | no_license | akolomoi/cpp_pool | b18952428e2f62172d79b50c5b0a1d496b72c6c1 | 7f372f9ac683dd3da740098d1c33aaddf26f764b | refs/heads/master | 2022-04-05T17:01:17.164350 | 2020-02-03T14:10:01 | 2020-02-03T14:10:01 | 237,979,179 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,137 | cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* PutChar.cpp :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: akolomoi <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/12/14 21:37:42 by akolomoi #+# #+# */
/* Updated: 2019/12/14 21:37:42 by akolomoi ### ########.fr */
/* */
/* ************************************************************************** */
#include <iostream>
#include "./PutChar.h"
PutChar::PutChar(void) {
_symbol = '*';
}
PutChar::~PutChar() {}
void PutChar::action(char **array)
{
std::cout << **array;
}
void PutChar::push_back(std::ifstream &file)
{
file.close();
}
| [
"akolomoi@e1r4p1.unit.ua"
] | akolomoi@e1r4p1.unit.ua |
f9debf30d8a82fed261834efb03578ac968c1888 | 10560f64e0936560e4621ae31475a9bb65b3ffcd | /source/qt_Kviewer/s4Kviewer.cpp | a039788ba4f55b1424aea1324fc4b50f3a797633 | [
"MIT"
] | permissive | chunyisong/s4 | c775e5789d61e5c0940e2f8c38162b2e3bc325b7 | e57f17e729050da09e051221d20dc384027e6f62 | refs/heads/master | 2022-11-21T00:52:31.763539 | 2020-07-19T13:51:37 | 2020-07-19T13:51:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,857 | cpp | #pragma warning(push)
# pragma warning(disable: 4189)
#include "qt_Kviewer/s4Kviewer.h"
#include "ui_s4Kviewer.h"
#include "common/s4logger.h"
#include "qt_common/Utils.h"
#include "qt_Kviewer/s4Kinstrument.h"
#include "jsonTypes/nw_load_instrument_t.h"
#include <QSplitter>
#include <QScrollArea>
#include <QFileDialog>
#include <QMessageBox>
#include <QMetaType>
#ifdef max
#undef max
#endif
using namespace std;
namespace S4 {
namespace QT {
CREATE_LOCAL_LOGGER("qt_Kviewer")
s4Kviewer::s4Kviewer(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::s4Kviewer)
{
ui->setupUi(this);
ui->centralwidget->setMouseTracking(true);
connect(ui->actionOpen, &QAction::triggered, this, &s4Kviewer::onOpen);
connect(ui->actionCallConsole, &QAction::triggered, this, &s4Kviewer::onCallConsole);
this->setMouseTracking(true);
_instrument_tab = new Kviewer_instrumentTab(this);
// _instrument_tab2 = new QTabWidget(this);
// _instrument_tab3 = new QTabWidget(this);
//pCLI = new cliparser(this);
//pCLI->setFocusPolicy(Qt::StrongFocus);
//pmyKwin = new s3qt::myKwin(this);
//connect(pmyKwin, SIGNAL(signal_getStkInfo(const std::string & , const struct s3qt::stkInfoReq_t& , s3qt::stkInfo_t*& )),
// &dataIF, SLOT(getInfo(const std::string & , const struct s3qt::stkInfoReq_t& , s3qt::stkInfo_t*& )));
//connect(pmyKwin, SIGNAL(signal_loadOrdres(const std::string &, const std::string & , const std::string & , s3qt::stkInfo_t*& )),
// &dataIF, SLOT(loadOrdres(const std::string &, const std::string &, const std::string &, s3qt::stkInfo_t*&)));
//connect(pCLI, SIGNAL(getData(std::string& , std::string& , std::string& )),
// pmyKwin, SLOT(getData(std::string& , std::string& , std::string& )));
//pmyKwin->getData(std::string("sz000997"), std::string(""), std::string(""));
QSplitter *splitterMain = new QSplitter(Qt::Vertical, 0); //新建主分割窗口，水平分割
if (!splitterMain->hasMouseTracking()) {
splitterMain->setMouseTracking(true);
}
QSplitter *splitterV1 = new QSplitter(Qt::Vertical, splitterMain);
// QSplitter *splitterV2 = new QSplitter(Qt::Vertical, splitterMain);
// QSplitter *splitterV3 = new QSplitter(Qt::Vertical, splitterMain);
splitterMain->setHandleWidth(1);
//splitterLeft->addWidget(pkBar);
splitterV1->addWidget(_instrument_tab);
if (!splitterV1->hasMouseTracking()) {
splitterV1->setMouseTracking(true);
}
// splitterV2->addWidget(_instrument_tab2);
// splitterV3->addWidget(_instrument_tab3);
QList<int> list;
list << 100;//v1
list << 50; //v2
list << 20; //v3
list << 20;
list << 20;
splitterMain->setSizes(list);
//创建滚动区域。
QScrollArea *scrollArea = new QScrollArea;
//把label控件放进滚动区域中.注意只能设置一个控件,一个一个控件往里面加,只会显示最后一个加入的控件.
scrollArea->setWidget(splitterMain);
//设置对齐格式.
scrollArea->setAlignment(Qt::AlignCenter);
//设置水平和垂直滚动条的策略.默认是如下策略.
//scrollArea->setHorizontalScrollBarPolicy(Qt::ScrollBarAlwaysOn);
//scrollArea->setVerticalScrollBarPolicy(Qt::ScrollBarAlwaysOn);
//设置是否自动调整部件的大小.默认是false.
scrollArea->setWidgetResizable(true);
scrollArea->resize(1200, 800);
button_last_trade = new QPushButton(scrollArea);
button_last_trade->setGeometry(QRect(50, 50, 25, 25)); // x, y, w, h
button_last_trade->setText("<");
connect(button_last_trade, SIGNAL(pressed(void)), this, SLOT(onButton_last_trade(void)));
button_next_trade = new QPushButton(scrollArea);
button_next_trade->setGeometry(QRect(75, 50, 25, 25)); // x, y, w, h
button_next_trade->setText(">");
connect(button_next_trade, SIGNAL(pressed(void)), this, SLOT(onButton_next_trade(void)));
//QHBoxLayout *layout = new QHBoxLayout(this);
//layout->addWidget(scrollArea);
//this->resize(600,600);
// this->setCentralWidget(splitterMain);
this->setCentralWidget(scrollArea);
resize(1200, 800);
_data_if = std::make_shared<S4::QT::s4qt_data_if>();
connect(this, SIGNAL(signal_getInfo(const std::string &, const struct S4::stkInfoReq_t&, class S4::stkInfo_t*&)),
_data_if.get(), SLOT(getInfo(const std::string &, const struct S4::stkInfoReq_t&, class S4::stkInfo_t*&)));
connect(this, SIGNAL(signal_loadOrdres(const std::string &, const std::string &, const std::string &, std::vector<S4::s4_history_trade_t>&)),
_data_if.get(), SLOT(loadOrdres(const std::string &, const std::string &, const std::string &, std::vector<S4::s4_history_trade_t>&)));
onCallConsole();
#ifndef NDEBUG
//S4::stkInfoReq_t _infoReq;
//_infoReq.endDate = _DOOMSDAY_;
//_infoReq.nbDay_preEndDate = std::numeric_limits<int>::max();
//S4::stkInfo_t* info;
//emit signal_getInfo("sz000997", _infoReq, info);
//if (info == nullptr) {
// FATAL("getInfo fail");
//}
//emit signal_getInfo("sh688004", _infoReq, info);
//if (info == nullptr) {
// FATAL("getInfo fail");
//}
//emit signal_getInfo("sh688001", _infoReq, info);
//if (info != nullptr) {
// FATAL("getInfo NG");
//}
////////////////
//emit signal_getInfo("sz002810", _infoReq, info);
//if (info == nullptr) {
// FATAL("getInfo NG");
//}
//std::vector<S4::s4_history_trade_t> history_trade_data;
//emit signal_loadOrdres("sz002810", "tdx_xyzq_history", "to20200531", history_trade_data);
//if (!history_trade_data.size()) {
// FATAL("loadOrdres fail");
//}
#endif // !NDEBUG
load("sz002810", "", "to20200531");
}
void s4Kviewer::onOpen()
{
QString path = QFileDialog::getOpenFileName(this, tr("Open S4 configure json"), "../worksapce", tr("Json files (*.json)"));
if (!Utils::fileCanBeOpened(path)) {
QMessageBox::warning(NULL, "warning", "file is not readable!", QMessageBox::Yes | QMessageBox::No, QMessageBox::Yes);
return;
}
if (!glb_conf::pInstance()->load(path.toStdString()))
{
QMessageBox::warning(NULL, "warning", "file format error!", QMessageBox::Yes | QMessageBox::No, QMessageBox::Yes);
return;
}
ui->statusbar->showMessage(path);
_data_if = std::make_shared<S4::QT::s4qt_data_if>();
connect(this, SIGNAL(signal_getInfo(const std::string&, const struct S4::stkInfoReq_t&, class S4::stkInfo_t*&)),
_data_if.get(), SLOT(getInfo(const std::string&, const struct S4::stkInfoReq_t&, class S4::stkInfo_t*&)));
connect(this, SIGNAL(signal_loadOrdres(const std::string&, const std::string&, const std::string&, std::vector<S4::s4_history_trade_t>&)),
_data_if.get(), SLOT(loadOrdres(const std::string&, const std::string&, const std::string&, std::vector<S4::s4_history_trade_t>&)));
onTcpSetup();
//onLoadConf();
}
void s4Kviewer::onCallConsole()
{
_console = new s4console(this);
connect(_console, SIGNAL(signal_load(const std::string&, const std::string&, const std::string&)),
this, SLOT(load(const std::string&, const std::string&, const std::string&)));
_console->setModal(false);
_console->show();
_console->setGeometry(this->x() + this->width(),
this->y(), 200, this->height());
}
void s4Kviewer::onTcpSetup()
{
_pTcp_json_client = std::make_shared<qt_tcp_json_client>(glb_conf::pInstance()->nw().db_viewer_port.c_str());
_pTcp_json_client->start();
qRegisterMetaType<std::shared_ptr<nlohmann::json>>("std::shared_ptr<nlohmann::json>");
qRegisterMetaType<std::shared_ptr<nlohmann::json>>("std::shared_ptr<nlohmann::json>&");
connect(_pTcp_json_client.get(), SIGNAL(signal_onRecv(const std::shared_ptr<nlohmann::json>&)),
this, SLOT(onTcpRecvJson(const std::shared_ptr<nlohmann::json>&)));
}
void s4Kviewer::load(const std::string& stkName, const std::string& stgName, const std::string& orderTblName)
{
S4::stkInfoReq_t infoReq;
S4::stkInfo_t* pInfo;
std::vector<S4::s4_history_trade_t> history_trade_data;
infoReq.endDate = _DOOMSDAY_;
infoReq.nbDay_preEndDate = std::numeric_limits<int>::max();
//infoReq.cyc_scope_list = vector<int>{ __CYC_S1__, __CYC_M1__, __CYC_L1__, __CYC_X1__ };
// infoReq.ma_scope_list = vector<int>{ 15,60 };
infoReq.ma_scope_list = vector<int>{5, 20, 60, 120};
emit signal_getInfo(stkName, infoReq, pInfo);
if (orderTblName.size() != 0) {
emit signal_loadOrdres(stkName, stgName, orderTblName, history_trade_data);
}
if (!pInfo) {
LCL_WARN("load nothing to show");
return;
}
_data_panel.infoReq = infoReq;
_data_panel.history = history_trade_data;
_data_panel.info = *pInfo;
showData();
}
void s4Kviewer::onButton_next_trade(void)
{
_instrument_tab->slot_next_trade(1);
}
void s4Kviewer::onButton_last_trade(void)
{
_instrument_tab->slot_next_trade(-1);
}
void s4Kviewer::onTcpRecvJson(const std::shared_ptr<nlohmann::json>& pJ)
{
LCL_INFO("RecvJson: {:}", pJ->dump(4));
int command = pJ->at("command").get<int>();
if (command == 1) {
nw_load_instrument_t command_load;
nw_load_instrument_t::from_json(*pJ, command_load);
load(command_load.mktCode, command_load.stgName, command_load.tableName);
}
else {
LCL_ERR("unknown command = {:}", command);
}
}
void s4Kviewer::showData()
{
_instrument_tab->addInstrument(_data_panel);
// Kinstrument* K = new Kinstrument(_instrument_tab);
// int i = _instrument_tab->addTab(K, _data_panel.info.name().c_str());
// _instrument_tab->setCurrentIndex(i);
// if (!hasMouseTracking()) {
// setMouseTracking(true);
// }
// if (!_instrument_tab->hasMouseTracking()) {
// _instrument_tab->setMouseTracking(true);
// }
// if (!K->hasMouseTracking()) {
// K->setMouseTracking(true);
// }
}
s4Kviewer::~s4Kviewer()
{
}
}
}
#pragma warning(pop) | [
"chinsaiki@outlook.com"
] | chinsaiki@outlook.com |
26d891a50fecde1c966367acef9ca8bd07433bb3 | 300de94b3294d23a31c3fb963a4ebd8796dbc36a | /sensor_msgs/PointCloud2.h | 99887ea8a4c8c6b5c265d7d287c651debe17101c | [] | no_license | uas-at-ucla-dependencies/sensor_msgs | 2ac6950a8b021da211cf4c4d8453a597d5985faa | 7926ae1b63c33e9207483253f2911e5551418afe | refs/heads/master | 2020-07-09T17:42:53.824301 | 2019-03-07T21:06:12 | 2019-03-07T21:06:12 | 204,037,375 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,863 | h | // Generated by gencpp from file sensor_msgs/PointCloud2.msg
// DO NOT EDIT!
#ifndef SENSOR_MSGS_MESSAGE_POINTCLOUD2_H
#define SENSOR_MSGS_MESSAGE_POINTCLOUD2_H
#include <string>
#include <vector>
#include <map>
#include <ros/types.h>
#include <ros/serialization.h>
#include <ros/builtin_message_traits.h>
#include <ros/message_operations.h>
#include <std_msgs/Header.h>
#include <sensor_msgs/PointField.h>
namespace sensor_msgs
{
template <class ContainerAllocator>
struct PointCloud2_
{
typedef PointCloud2_<ContainerAllocator> Type;
PointCloud2_()
: header()
, height(0)
, width(0)
, fields()
, is_bigendian(false)
, point_step(0)
, row_step(0)
, data()
, is_dense(false) {
}
PointCloud2_(const ContainerAllocator& _alloc)
: header(_alloc)
, height(0)
, width(0)
, fields(_alloc)
, is_bigendian(false)
, point_step(0)
, row_step(0)
, data(_alloc)
, is_dense(false) {
(void)_alloc;
}
typedef ::std_msgs::Header_<ContainerAllocator> _header_type;
_header_type header;
typedef uint32_t _height_type;
_height_type height;
typedef uint32_t _width_type;
_width_type width;
typedef std::vector< ::sensor_msgs::PointField_<ContainerAllocator> , typename ContainerAllocator::template rebind< ::sensor_msgs::PointField_<ContainerAllocator> >::other > _fields_type;
_fields_type fields;
typedef uint8_t _is_bigendian_type;
_is_bigendian_type is_bigendian;
typedef uint32_t _point_step_type;
_point_step_type point_step;
typedef uint32_t _row_step_type;
_row_step_type row_step;
typedef std::vector<uint8_t, typename ContainerAllocator::template rebind<uint8_t>::other > _data_type;
_data_type data;
typedef uint8_t _is_dense_type;
_is_dense_type is_dense;
typedef boost::shared_ptr< ::sensor_msgs::PointCloud2_<ContainerAllocator> > Ptr;
typedef boost::shared_ptr< ::sensor_msgs::PointCloud2_<ContainerAllocator> const> ConstPtr;
}; // struct PointCloud2_
typedef ::sensor_msgs::PointCloud2_<std::allocator<void> > PointCloud2;
typedef boost::shared_ptr< ::sensor_msgs::PointCloud2 > PointCloud2Ptr;
typedef boost::shared_ptr< ::sensor_msgs::PointCloud2 const> PointCloud2ConstPtr;
// constants requiring out of line definition
template<typename ContainerAllocator>
std::ostream& operator<<(std::ostream& s, const ::sensor_msgs::PointCloud2_<ContainerAllocator> & v)
{
ros::message_operations::Printer< ::sensor_msgs::PointCloud2_<ContainerAllocator> >::stream(s, "", v);
return s;
}
} // namespace sensor_msgs
namespace ros
{
namespace message_traits
{
// BOOLTRAITS {'IsFixedSize': False, 'IsMessage': True, 'HasHeader': True}
// {'std_msgs': ['/opt/ros/melodic/share/std_msgs/cmake/../msg'], 'geometry_msgs': ['/opt/ros/melodic/share/geometry_msgs/cmake/../msg'], 'sensor_msgs': ['/tmp/binarydeb/ros-melodic-sensor-msgs-1.12.7/msg']}
// !!!!!!!!!!! ['__class__', '__delattr__', '__dict__', '__doc__', '__eq__', '__format__', '__getattribute__', '__hash__', '__init__', '__module__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__', '__setattr__', '__sizeof__', '__str__', '__subclasshook__', '__weakref__', '_parsed_fields', 'constants', 'fields', 'full_name', 'has_header', 'header_present', 'names', 'package', 'parsed_fields', 'short_name', 'text', 'types']
template <class ContainerAllocator>
struct IsFixedSize< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
: FalseType
{ };
template <class ContainerAllocator>
struct IsFixedSize< ::sensor_msgs::PointCloud2_<ContainerAllocator> const>
: FalseType
{ };
template <class ContainerAllocator>
struct IsMessage< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct IsMessage< ::sensor_msgs::PointCloud2_<ContainerAllocator> const>
: TrueType
{ };
template <class ContainerAllocator>
struct HasHeader< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
: TrueType
{ };
template <class ContainerAllocator>
struct HasHeader< ::sensor_msgs::PointCloud2_<ContainerAllocator> const>
: TrueType
{ };
template<class ContainerAllocator>
struct MD5Sum< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
{
static const char* value()
{
return "1158d486dd51d683ce2f1be655c3c181";
}
static const char* value(const ::sensor_msgs::PointCloud2_<ContainerAllocator>&) { return value(); }
static const uint64_t static_value1 = 0x1158d486dd51d683ULL;
static const uint64_t static_value2 = 0xce2f1be655c3c181ULL;
};
template<class ContainerAllocator>
struct DataType< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
{
static const char* value()
{
return "sensor_msgs/PointCloud2";
}
static const char* value(const ::sensor_msgs::PointCloud2_<ContainerAllocator>&) { return value(); }
};
template<class ContainerAllocator>
struct Definition< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
{
static const char* value()
{
return "# This message holds a collection of N-dimensional points, which may\n\
# contain additional information such as normals, intensity, etc. The\n\
# point data is stored as a binary blob, its layout described by the\n\
# contents of the \"fields\" array.\n\
\n\
# The point cloud data may be organized 2d (image-like) or 1d\n\
# (unordered). Point clouds organized as 2d images may be produced by\n\
# camera depth sensors such as stereo or time-of-flight.\n\
\n\
# Time of sensor data acquisition, and the coordinate frame ID (for 3d\n\
# points).\n\
Header header\n\
\n\
# 2D structure of the point cloud. If the cloud is unordered, height is\n\
# 1 and width is the length of the point cloud.\n\
uint32 height\n\
uint32 width\n\
\n\
# Describes the channels and their layout in the binary data blob.\n\
PointField[] fields\n\
\n\
bool is_bigendian # Is this data bigendian?\n\
uint32 point_step # Length of a point in bytes\n\
uint32 row_step # Length of a row in bytes\n\
uint8[] data # Actual point data, size is (row_step*height)\n\
\n\
bool is_dense # True if there are no invalid points\n\
\n\
================================================================================\n\
MSG: std_msgs/Header\n\
# Standard metadata for higher-level stamped data types.\n\
# This is generally used to communicate timestamped data \n\
# in a particular coordinate frame.\n\
# \n\
# sequence ID: consecutively increasing ID \n\
uint32 seq\n\
#Two-integer timestamp that is expressed as:\n\
# * stamp.sec: seconds (stamp_secs) since epoch (in Python the variable is called 'secs')\n\
# * stamp.nsec: nanoseconds since stamp_secs (in Python the variable is called 'nsecs')\n\
# time-handling sugar is provided by the client library\n\
time stamp\n\
#Frame this data is associated with\n\
# 0: no frame\n\
# 1: global frame\n\
string frame_id\n\
\n\
================================================================================\n\
MSG: sensor_msgs/PointField\n\
# This message holds the description of one point entry in the\n\
# PointCloud2 message format.\n\
uint8 INT8 = 1\n\
uint8 UINT8 = 2\n\
uint8 INT16 = 3\n\
uint8 UINT16 = 4\n\
uint8 INT32 = 5\n\
uint8 UINT32 = 6\n\
uint8 FLOAT32 = 7\n\
uint8 FLOAT64 = 8\n\
\n\
string name # Name of field\n\
uint32 offset # Offset from start of point struct\n\
uint8 datatype # Datatype enumeration, see above\n\
uint32 count # How many elements in the field\n\
";
}
static const char* value(const ::sensor_msgs::PointCloud2_<ContainerAllocator>&) { return value(); }
};
} // namespace message_traits
} // namespace ros
namespace ros
{
namespace serialization
{
template<class ContainerAllocator> struct Serializer< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
{
template<typename Stream, typename T> inline static void allInOne(Stream& stream, T m)
{
stream.next(m.header);
stream.next(m.height);
stream.next(m.width);
stream.next(m.fields);
stream.next(m.is_bigendian);
stream.next(m.point_step);
stream.next(m.row_step);
stream.next(m.data);
stream.next(m.is_dense);
}
ROS_DECLARE_ALLINONE_SERIALIZER
}; // struct PointCloud2_
} // namespace serialization
} // namespace ros
namespace ros
{
namespace message_operations
{
template<class ContainerAllocator>
struct Printer< ::sensor_msgs::PointCloud2_<ContainerAllocator> >
{
template<typename Stream> static void stream(Stream& s, const std::string& indent, const ::sensor_msgs::PointCloud2_<ContainerAllocator>& v)
{
s << indent << "header: ";
s << std::endl;
Printer< ::std_msgs::Header_<ContainerAllocator> >::stream(s, indent + " ", v.header);
s << indent << "height: ";
Printer<uint32_t>::stream(s, indent + " ", v.height);
s << indent << "width: ";
Printer<uint32_t>::stream(s, indent + " ", v.width);
s << indent << "fields[]" << std::endl;
for (size_t i = 0; i < v.fields.size(); ++i)
{
s << indent << " fields[" << i << "]: ";
s << std::endl;
s << indent;
Printer< ::sensor_msgs::PointField_<ContainerAllocator> >::stream(s, indent + " ", v.fields[i]);
}
s << indent << "is_bigendian: ";
Printer<uint8_t>::stream(s, indent + " ", v.is_bigendian);
s << indent << "point_step: ";
Printer<uint32_t>::stream(s, indent + " ", v.point_step);
s << indent << "row_step: ";
Printer<uint32_t>::stream(s, indent + " ", v.row_step);
s << indent << "data[]" << std::endl;
for (size_t i = 0; i < v.data.size(); ++i)
{
s << indent << " data[" << i << "]: ";
Printer<uint8_t>::stream(s, indent + " ", v.data[i]);
}
s << indent << "is_dense: ";
Printer<uint8_t>::stream(s, indent + " ", v.is_dense);
}
};
} // namespace message_operations
} // namespace ros
#endif // SENSOR_MSGS_MESSAGE_POINTCLOUD2_H
| [
"comranmorsh@gmail.com"
] | comranmorsh@gmail.com |
98ff571fd75b0ebd6d54fa23bf8ea4a29f346bf1 | 08b8cf38e1936e8cec27f84af0d3727321cec9c4 | /data/crawl/squid/old_hunk_4886.cpp | 7040532ebf88f16fc3bb55f1acc37640f9fe6c98 | [] | no_license | ccdxc/logSurvey | eaf28e9c2d6307140b17986d5c05106d1fd8e943 | 6b80226e1667c1e0760ab39160893ee19b0e9fb1 | refs/heads/master | 2022-01-07T21:31:55.446839 | 2018-04-21T14:12:43 | 2018-04-21T14:12:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,981 | cpp | debug(9, 1) ("ftpTimeout: timeout in SENT_PASV state\n");
}
ftpFailed(ftpState, ERR_READ_TIMEOUT, 0);
/* ftpFailed closes ctrl.fd and frees ftpState */
}
static void
ftpListingStart(FtpStateData * ftpState)
{
StoreEntry *e = ftpState->entry;
wordlist *w;
char *dirup;
int i, j, k;
const char *title = ftpState->title_url.buf();
storeAppendPrintf(e, "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\" \"http://www.w3.org/TR/html4/loose.dtd\">\n");
storeAppendPrintf(e, "<!-- HTML listing generated by Squid %s -->\n",
version_string);
storeAppendPrintf(e, "<!-- %s -->\n", mkrfc1123(squid_curtime));
storeAppendPrintf(e, "<HTML><HEAD><TITLE>\n");
{
char *t = xstrdup(title);
rfc1738_unescape(t);
storeAppendPrintf(e, "FTP Directory: %s\n", html_quote(t));
xfree(t);
}
storeAppendPrintf(e, "</TITLE>\n");
storeAppendPrintf(e, "<STYLE type=\"text/css\"><!--BODY{background-color:#ffffff;font-family:verdana,sans-serif}--></STYLE>\n");
if (ftpState->flags.need_base_href)
storeAppendPrintf(e, "<BASE HREF=\"%s\">\n",
html_quote(ftpState->base_href.buf()));
storeAppendPrintf(e, "</HEAD><BODY>\n");
if (ftpState->cwd_message) {
storeAppendPrintf(e, "<PRE>\n");
for (w = ftpState->cwd_message; w; w = w->next)
storeAppendPrintf(e, "%s\n", html_quote(w->key));
storeAppendPrintf(e, "</PRE>\n");
storeAppendPrintf(e, "<HR noshade size=\"1px\">\n");
wordlistDestroy(&ftpState->cwd_message);
}
storeAppendPrintf(e, "<H2>\n");
storeAppendPrintf(e, "FTP Directory: ");
/* "ftp://" == 6 characters */
assert(ftpState->title_url.size() >= 6);
k = 6 + strcspn(&title[6], "/");
for (i = 6, j = 0; title[i]; j = i) {
storeAppendPrintf(e, "<A HREF=\"");
i += strcspn(&title[i], "/");
if (i > j) {
char *url = xstrdup(title);
url[i] = '\0';
storeAppendPrintf(e, "%s", html_quote(url + k));
storeAppendPrintf(e, "/");
storeAppendPrintf(e, "\">");
rfc1738_unescape(url + j);
storeAppendPrintf(e, "%s", html_quote(url + j));
safe_free(url);
storeAppendPrintf(e, "</A>");
}
storeAppendPrintf(e, "/");
if (title[i] == '/')
i++;
if (i == j) {
/* Error guard, or "assert" */
storeAppendPrintf(e, "ERROR: Failed to parse URL: %s\n",
html_quote(title));
debug(9, 0) ("Failed to parse URL: %s\n", title);
break;
}
}
storeAppendPrintf(e, "</H2>\n");
storeAppendPrintf(e, "<PRE>\n");
dirup = ftpHtmlifyListEntry("<internal-dirup>", ftpState);
storeAppend(e, dirup, strlen(dirup));
ftpState->flags.html_header_sent = 1;
}
static void
ftpListingFinish(FtpStateData * ftpState)
{
StoreEntry *e = ftpState->entry;
storeBuffer(e);
storeAppendPrintf(e, "</PRE>\n");
if (ftpState->flags.listformat_unknown && !ftpState->flags.tried_nlst) {
storeAppendPrintf(e, "<A HREF=\"%s/;type=d\">[As plain directory]</A>\n",
ftpState->flags.dir_slash ? rfc1738_escape_part(ftpState->old_filepath) : ".");
} else if (ftpState->typecode == 'D') {
const char *path = ftpState->flags.dir_slash ? ftpState->filepath : ".";
storeAppendPrintf(e, "<A HREF=\"%s/\">[As extended directory]</A>\n", html_quote(path));
}
storeAppendPrintf(e, "<HR noshade size=\"1px\">\n");
storeAppendPrintf(e, "<ADDRESS>\n");
storeAppendPrintf(e, "Generated %s by %s (%s)\n",
mkrfc1123(squid_curtime),
getMyHostname(),
visible_appname_string);
storeAppendPrintf(e, "</ADDRESS></BODY></HTML>\n");
}
static const char *Month[] =
| [
"993273596@qq.com"
] | 993273596@qq.com |
39bc4fb65fbd435aa6292c894f818582a4803bab | d4753b3c05f7b651c5d11e2e3d51c9fbcee156b4 | /handler.cpp | fc00c329a856635f098eb99caa930c49afb49df6 | [
"MIT"
] | permissive | Druggist/jukebox | d018d43ea27d75349b078b3b0287367efa33706d | a3916101d7d747c3c028fc2ee156cee196eb2d76 | refs/heads/master | 2021-09-20T03:18:39.621021 | 2018-08-02T10:55:31 | 2018-08-02T10:55:31 | 118,338,181 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 380 | cpp | #include "handler.h"
Handler::Handler(QObject *parent) : QObject(parent) {
jukebox = new(Jukebox);
connect(jukebox, SIGNAL (connectSuccess()), this, SLOT (runConcurrent()));
}
void Handler::runConcurrent() {
QFuture<void> future = QtConcurrent::run(jukebox, &Jukebox::receiveData);
jukebox->loadData();
}
void Handler::closing() {
jukebox->setExit(true);
}
| [
"m.najdora@gmail.com"
] | m.najdora@gmail.com |
f5e929adc0c25a708e77a5b89b5f5438acc0d3c7 | 7f9afe2669e3aa76f3b27d5bd4533db5d40eea50 | /Application/vendor/glm/detail/type_vec2.hpp | a687897bacb3cbe3408267e4cee092569c3e2677 | [
"MIT"
] | permissive | Atomnp/ComputerGraphicsProject | 88ba620e0a4210d49ff3d483c75dc1087020ad44 | 81b40fa4a003d429ed2228a77e068d48fb9f8155 | refs/heads/main | 2023-07-23T09:22:58.878551 | 2021-09-02T16:25:56 | 2021-09-02T16:25:56 | 433,399,414 | 1 | 0 | MIT | 2021-11-30T11:09:44 | 2021-11-30T11:09:43 | null | UTF-8 | C++ | false | false | 17,324 | hpp | /// @ref core
/// @file glm/detail/type_vec2.hpp
#pragma once
#include "qualifier.hpp"
#if GLM_CONFIG_SWIZZLE == GLM_SWIZZLE_OPERATOR
# include "_swizzle.hpp"
#elif GLM_CONFIG_SWIZZLE == GLM_SWIZZLE_FUNCTION
# include "_swizzle_func.hpp"
#endif
#include <cstddef>
namespace glm {
template<typename T, qualifier Q>
struct vec<2, T, Q> {
// -- Implementation detail --
typedef T value_type;
typedef vec<2, T, Q> type;
typedef vec<2, bool, Q> bool_type;
// -- Data --
# if GLM_SILENT_WARNINGS == GLM_ENABLE
# if GLM_COMPILER & GLM_COMPILER_GCC
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wpedantic"
# elif GLM_COMPILER & GLM_COMPILER_CLANG
# pragma clang diagnostic push
# pragma clang diagnostic ignored "-Wgnu-anonymous-struct"
# pragma clang diagnostic ignored "-Wnested-anon-types"
# elif GLM_COMPILER & GLM_COMPILER_VC
# pragma warning(push)
# pragma warning(disable: 4201) // nonstandard extension used : nameless struct/union
# endif
# endif
# if GLM_CONFIG_XYZW_ONLY
T x, y;
# elif GLM_CONFIG_ANONYMOUS_STRUCT == GLM_ENABLE
union
{
struct{ T x, y; };
struct{ T r, g; };
struct{ T s, t; };
typename detail::storage<2, T, detail::is_aligned<Q>::value>::type data;
# if GLM_CONFIG_SWIZZLE == GLM_SWIZZLE_OPERATOR
GLM_SWIZZLE2_2_MEMBERS(T, Q, x, y)
GLM_SWIZZLE2_2_MEMBERS(T, Q, r, g)
GLM_SWIZZLE2_2_MEMBERS(T, Q, s, t)
GLM_SWIZZLE2_3_MEMBERS(T, Q, x, y)
GLM_SWIZZLE2_3_MEMBERS(T, Q, r, g)
GLM_SWIZZLE2_3_MEMBERS(T, Q, s, t)
GLM_SWIZZLE2_4_MEMBERS(T, Q, x, y)
GLM_SWIZZLE2_4_MEMBERS(T, Q, r, g)
GLM_SWIZZLE2_4_MEMBERS(T, Q, s, t)
# endif
};
# else
union {
T x, r, s;
};
union {
T y, g, t;
};
# if GLM_CONFIG_SWIZZLE == GLM_SWIZZLE_FUNCTION
GLM_SWIZZLE_GEN_VEC_FROM_VEC2(T, Q)
# endif//GLM_CONFIG_SWIZZLE
# endif
# if GLM_SILENT_WARNINGS == GLM_ENABLE
# if GLM_COMPILER & GLM_COMPILER_CLANG
# pragma clang diagnostic pop
# elif GLM_COMPILER & GLM_COMPILER_GCC
# pragma GCC diagnostic pop
# elif GLM_COMPILER & GLM_COMPILER_VC
# pragma warning(pop)
# endif
# endif
// -- Component accesses --
/// Return the count of components of the vector
typedef length_t length_type;
GLM_FUNC_DECL static GLM_CONSTEXPR length_type length() { return 2; }
GLM_FUNC_DECL GLM_CONSTEXPR T &operator[](length_type i);
GLM_FUNC_DECL GLM_CONSTEXPR T const &operator[](length_type i) const;
// -- Implicit basic constructors --
GLM_FUNC_DECL GLM_CONSTEXPR vec() GLM_DEFAULT;
GLM_FUNC_DECL GLM_CONSTEXPR vec(vec const &v) GLM_DEFAULT;
template<qualifier P>
GLM_FUNC_DECL GLM_CONSTEXPR vec(vec<2, T, P> const &v);
// -- Explicit basic constructors --
GLM_FUNC_DECL GLM_CONSTEXPR explicit vec(T scalar);
GLM_FUNC_DECL GLM_CONSTEXPR vec(T x, T y);
// -- Conversion constructors --
template<typename U, qualifier P>
GLM_FUNC_DECL GLM_CONSTEXPR explicit vec(vec<1, U, P> const &v);
/// Explicit conversions (From section 5.4.1 Conversion and scalar constructors of GLSL 1.30.08 specification)
template<typename A, typename B>
GLM_FUNC_DECL GLM_CONSTEXPR vec(A x, B y);
template<typename A, typename B>
GLM_FUNC_DECL GLM_CONSTEXPR vec(vec<1, A, Q> const &x, B y);
template<typename A, typename B>
GLM_FUNC_DECL GLM_CONSTEXPR vec(A x, vec<1, B, Q> const &y);
template<typename A, typename B>
GLM_FUNC_DECL GLM_CONSTEXPR vec(vec<1, A, Q> const &x, vec<1, B, Q> const &y);
// -- Conversion vector constructors --
/// Explicit conversions (From section 5.4.1 Conversion and scalar constructors of GLSL 1.30.08 specification)
template<typename U, qualifier P>
GLM_FUNC_DECL GLM_CONSTEXPR GLM_EXPLICIT vec(vec<3, U, P> const &v);
/// Explicit conversions (From section 5.4.1 Conversion and scalar constructors of GLSL 1.30.08 specification)
template<typename U, qualifier P>
GLM_FUNC_DECL GLM_CONSTEXPR GLM_EXPLICIT vec(vec<4, U, P> const &v);
/// Explicit conversions (From section 5.4.1 Conversion and scalar constructors of GLSL 1.30.08 specification)
template<typename U, qualifier P>
GLM_FUNC_DECL GLM_CONSTEXPR GLM_EXPLICIT vec(vec<2, U, P> const &v);
// -- Swizzle constructors --
# if GLM_CONFIG_SWIZZLE == GLM_SWIZZLE_OPERATOR
template<int E0, int E1>
GLM_FUNC_DECL GLM_CONSTEXPR vec(detail::_swizzle<2, T, Q, E0, E1,-1,-2> const& that)
{
*this = that();
}
# endif//GLM_CONFIG_SWIZZLE == GLM_SWIZZLE_OPERATOR
// -- Unary arithmetic operators --
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator=(vec const &v) GLM_DEFAULT;
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator+=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator+=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator+=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator-=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator-=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator-=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator*=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator*=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator*=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator/=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator/=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator/=(vec<2, U, Q> const &v);
// -- Increment and decrement operators --
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator++();
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator--();
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator++(int);
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator--(int);
// -- Unary bit operators --
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator%=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator%=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator%=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator&=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator&=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator&=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator|=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator|=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator|=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator^=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator^=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator^=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator<<=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator<<=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator<<=(vec<2, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator>>=(U scalar);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator>>=(vec<1, U, Q> const &v);
template<typename U>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> &operator>>=(vec<2, U, Q> const &v);
};
// -- Unary operators --
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator+(vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator-(vec<2, T, Q> const &v);
// -- Binary operators --
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator+(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator+(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator+(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator+(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator+(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator-(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator-(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator-(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator-(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator-(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator*(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator*(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator*(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator*(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator*(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator/(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator/(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator/(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator/(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator/(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator%(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator%(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator%(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator%(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator%(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator&(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator&(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator&(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator&(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator&(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator|(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator|(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator|(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator|(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator|(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator^(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator^(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator^(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator^(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator^(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator<<(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator<<(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator<<(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator<<(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator<<(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator>>(vec<2, T, Q> const &v, T scalar);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator>>(vec<2, T, Q> const &v1, vec<1, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator>>(T scalar, vec<2, T, Q> const &v);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator>>(vec<1, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator>>(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, T, Q> operator~(vec<2, T, Q> const &v);
// -- Boolean operators --
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR bool operator==(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<typename T, qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR bool operator!=(vec<2, T, Q> const &v1, vec<2, T, Q> const &v2);
template<qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, bool, Q> operator&&(vec<2, bool, Q> const &v1, vec<2, bool, Q> const &v2);
template<qualifier Q>
GLM_FUNC_DECL GLM_CONSTEXPR vec<2, bool, Q> operator||(vec<2, bool, Q> const &v1, vec<2, bool, Q> const &v2);
}//namespace glm
#ifndef GLM_EXTERNAL_TEMPLATE
#include "type_vec2.inl"
#endif//GLM_EXTERNAL_TEMPLATE
| [
"ankitpaudel20000@gmail.com"
] | ankitpaudel20000@gmail.com |
2d46ae6adb1fb01d5164418d8fae7611e898c8e3 | e16ebb1320fb7b189f5843f041cc1f43e6067629 | /src/main.cpp | 20e1d744a3b010252ee51466965c914af4e0ca00 | [] | no_license | LuigiSouza/cg-2021-t4 | 8481fbf4b4cca476c22cd2bb3b77ded8ade2d976 | d68dbac5ca3b14bb002cdd1d69ab7f18f60d0213 | refs/heads/main | 2023-07-12T20:05:15.449776 | 2021-08-26T16:48:17 | 2021-08-26T16:48:17 | 395,843,577 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,515 | cpp | /*********************************************************************
// Canvas para desenho, criada sobre a API OpenGL. Nao eh necessario conhecimentos de OpenGL para usar.
// Autor: Cesar Tadeu Pozzer
// 05/2020
//
// Pode ser utilizada para fazer desenhos, animacoes, e jogos simples.
// Tem tratamento de mouse e teclado
// Estude o OpenGL antes de tentar compreender o arquivo gl_canvas.cpp
// Todos os arquivos do projeto devem ser .cpp
//
// Versao 2.0
//
// *********************************************************************/
// Luigi Perotti Souza - 201910462
/***********************************************************************
*
* Funções básicas implementadas:
*
- Modelagem de engrenagem tipo spur gear
- Animação (rotação)
- Visualização ortográfica e perspectiva (sob vários ângulos) em wireframe
- Parametrização do número de dentes e raios
/------------------------------------------------------------------------
*
* Funções extras implementadas:
*
- Engrenagem tipo spur gear com lado plano e curvo
- Edição livre de todos os parâmetros utilizados na engrenagem
- Interface para edição da engrenagem
- Rotação em diferentes ângulos com o mouse
- Sistema de FPS
************************************************************************/
#include <GL/glut.h>
#include <GL/freeglut_ext.h> //callback da wheel do mouse.
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <map>
#include "gl_canvas2d.h"
#include "Entities/Cam.h"
#include "Handles/HandleMouse.h"
#include "Interface/Interface.h"
#include "Interface/Frames.h"
int screenWidth = 1024, screenHeight = 768;
Mouse *mouse_state;
Interface *interface;
// Fps variables
Frames *fps;
/***********************************************************
*
* Load/Create Functions
*
************************************************************/
void dispose()
{
delete interface;
delete mouse_state;
delete fps;
exit(0);
}
/***********************************************************
*
* Update Functions
*
************************************************************/
void update()
{
interface->update();
mouse_state->update();
}
/***********************************************************
*
* Canvas Functions
*
************************************************************/
//funcao chamada continuamente. Deve-se controlar o que desenhar por meio de variaveis
//globais que podem ser setadas pelo metodo keyboard()
void render()
{
CV::clear(0, 0, 0);
update();
interface->render();
fps->render();
}
//funcao chamada toda vez que uma tecla for pressionada
void keyboard(int key)
{
if (interface->keyboard(key))
dispose();
}
//funcao chamada toda vez que uma tecla for liberada
void keyboardUp(int key)
{
}
//funcao para tratamento de mouse: cliques, movimentos e arrastos
void mouse(int button, int state, int wheel, int direction, int x, int y)
{
// printf("\nmouse %d %d %d %d %d %d", button, state, wheel, direction, x, y);
mouse_state->setX(x);
mouse_state->setY(y);
if (state != -2)
mouse_state->setPress(button);
}
int main(void)
{
CV::init(&screenWidth, &screenHeight, "3D Gears");
mouse_state = new Mouse();
interface = new Interface(&screenWidth, &screenHeight, mouse_state);
fps = new Frames(10, screenHeight - 20);
CV::run();
}
| [
"lpsouza@inf.ufsm.br"
] | lpsouza@inf.ufsm.br |
1e753f37c9f1d7a3123cd13789e353f97f55edc6 | 89dedd7f3c7acc81d12e2bcb2e716f9af9e5fa04 | /net/udp/udp_socket_posix.cc | d76de3252c5e8cafe75f99c0578389035caf939d | [
"BSD-3-Clause"
] | permissive | bino7/chromium | 8d26f84a1b6e38a73d1b97fea6057c634eff68cb | 4666a6bb6fdcb1114afecf77bdaa239d9787b752 | refs/heads/master | 2022-12-22T14:31:53.913081 | 2016-09-06T10:05:11 | 2016-09-06T10:05:11 | 67,410,510 | 1 | 3 | BSD-3-Clause | 2022-12-17T03:08:52 | 2016-09-05T10:11:59 | null | UTF-8 | C++ | false | false | 27,811 | cc | // Copyright (c) 2012 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 "net/udp/udp_socket_posix.h"
#include <errno.h>
#include <fcntl.h>
#include <net/if.h>
#include <netdb.h>
#include <netinet/in.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include "base/callback.h"
#include "base/debug/alias.h"
#include "base/files/file_util.h"
#include "base/logging.h"
#include "base/message_loop/message_loop.h"
#include "base/metrics/sparse_histogram.h"
#include "base/posix/eintr_wrapper.h"
#include "base/rand_util.h"
#include "base/trace_event/trace_event.h"
#include "net/base/io_buffer.h"
#include "net/base/ip_address.h"
#include "net/base/ip_endpoint.h"
#include "net/base/net_errors.h"
#include "net/base/network_activity_monitor.h"
#include "net/base/sockaddr_storage.h"
#include "net/log/net_log.h"
#include "net/socket/socket_descriptor.h"
#include "net/udp/udp_net_log_parameters.h"
#if defined(OS_ANDROID)
#include <dlfcn.h>
// This was added in Lollipop to dlfcn.h
#define RTLD_NOLOAD 4
#include "base/android/build_info.h"
#include "base/native_library.h"
#include "base/strings/utf_string_conversions.h"
#endif
namespace net {
namespace {
const int kBindRetries = 10;
const int kPortStart = 1024;
const int kPortEnd = 65535;
#if defined(OS_MACOSX)
// Returns IPv4 address in network order.
int GetIPv4AddressFromIndex(int socket, uint32_t index, uint32_t* address) {
if (!index) {
*address = htonl(INADDR_ANY);
return OK;
}
ifreq ifr;
ifr.ifr_addr.sa_family = AF_INET;
if (!if_indextoname(index, ifr.ifr_name))
return MapSystemError(errno);
int rv = ioctl(socket, SIOCGIFADDR, &ifr);
if (rv == -1)
return MapSystemError(errno);
*address = reinterpret_cast<sockaddr_in*>(&ifr.ifr_addr)->sin_addr.s_addr;
return OK;
}
#endif // OS_MACOSX
} // namespace
UDPSocketPosix::UDPSocketPosix(DatagramSocket::BindType bind_type,
const RandIntCallback& rand_int_cb,
net::NetLog* net_log,
const net::NetLog::Source& source)
: socket_(kInvalidSocket),
addr_family_(0),
is_connected_(false),
socket_options_(SOCKET_OPTION_MULTICAST_LOOP),
multicast_interface_(0),
multicast_time_to_live_(1),
bind_type_(bind_type),
rand_int_cb_(rand_int_cb),
read_watcher_(this),
write_watcher_(this),
read_buf_len_(0),
recv_from_address_(NULL),
write_buf_len_(0),
net_log_(BoundNetLog::Make(net_log, NetLog::SOURCE_UDP_SOCKET)),
bound_network_(NetworkChangeNotifier::kInvalidNetworkHandle) {
net_log_.BeginEvent(NetLog::TYPE_SOCKET_ALIVE,
source.ToEventParametersCallback());
if (bind_type == DatagramSocket::RANDOM_BIND)
DCHECK(!rand_int_cb.is_null());
}
UDPSocketPosix::~UDPSocketPosix() {
Close();
net_log_.EndEvent(NetLog::TYPE_SOCKET_ALIVE);
}
int UDPSocketPosix::Open(AddressFamily address_family) {
DCHECK(CalledOnValidThread());
DCHECK_EQ(socket_, kInvalidSocket);
addr_family_ = ConvertAddressFamily(address_family);
socket_ = CreatePlatformSocket(addr_family_, SOCK_DGRAM, 0);
if (socket_ == kInvalidSocket)
return MapSystemError(errno);
if (!base::SetNonBlocking(socket_)) {
const int err = MapSystemError(errno);
Close();
return err;
}
return OK;
}
void UDPSocketPosix::Close() {
DCHECK(CalledOnValidThread());
if (socket_ == kInvalidSocket)
return;
// Zero out any pending read/write callback state.
read_buf_ = NULL;
read_buf_len_ = 0;
read_callback_.Reset();
recv_from_address_ = NULL;
write_buf_ = NULL;
write_buf_len_ = 0;
write_callback_.Reset();
send_to_address_.reset();
bool ok = read_socket_watcher_.StopWatchingFileDescriptor();
DCHECK(ok);
ok = write_socket_watcher_.StopWatchingFileDescriptor();
DCHECK(ok);
PCHECK(IGNORE_EINTR(close(socket_)) == 0);
socket_ = kInvalidSocket;
addr_family_ = 0;
is_connected_ = false;
}
int UDPSocketPosix::GetPeerAddress(IPEndPoint* address) const {
DCHECK(CalledOnValidThread());
DCHECK(address);
if (!is_connected())
return ERR_SOCKET_NOT_CONNECTED;
if (!remote_address_.get()) {
SockaddrStorage storage;
if (getpeername(socket_, storage.addr, &storage.addr_len))
return MapSystemError(errno);
std::unique_ptr<IPEndPoint> address(new IPEndPoint());
if (!address->FromSockAddr(storage.addr, storage.addr_len))
return ERR_ADDRESS_INVALID;
remote_address_.reset(address.release());
}
*address = *remote_address_;
return OK;
}
int UDPSocketPosix::GetLocalAddress(IPEndPoint* address) const {
DCHECK(CalledOnValidThread());
DCHECK(address);
if (!is_connected())
return ERR_SOCKET_NOT_CONNECTED;
if (!local_address_.get()) {
SockaddrStorage storage;
if (getsockname(socket_, storage.addr, &storage.addr_len))
return MapSystemError(errno);
std::unique_ptr<IPEndPoint> address(new IPEndPoint());
if (!address->FromSockAddr(storage.addr, storage.addr_len))
return ERR_ADDRESS_INVALID;
local_address_.reset(address.release());
net_log_.AddEvent(
NetLog::TYPE_UDP_LOCAL_ADDRESS,
CreateNetLogUDPConnectCallback(local_address_.get(), bound_network_));
}
*address = *local_address_;
return OK;
}
int UDPSocketPosix::Read(IOBuffer* buf,
int buf_len,
const CompletionCallback& callback) {
return RecvFrom(buf, buf_len, NULL, callback);
}
int UDPSocketPosix::RecvFrom(IOBuffer* buf,
int buf_len,
IPEndPoint* address,
const CompletionCallback& callback) {
DCHECK(CalledOnValidThread());
DCHECK_NE(kInvalidSocket, socket_);
CHECK(read_callback_.is_null());
DCHECK(!recv_from_address_);
DCHECK(!callback.is_null()); // Synchronous operation not supported
DCHECK_GT(buf_len, 0);
int nread = InternalRecvFrom(buf, buf_len, address);
if (nread != ERR_IO_PENDING)
return nread;
if (!base::MessageLoopForIO::current()->WatchFileDescriptor(
socket_, true, base::MessageLoopForIO::WATCH_READ,
&read_socket_watcher_, &read_watcher_)) {
PLOG(ERROR) << "WatchFileDescriptor failed on read";
int result = MapSystemError(errno);
LogRead(result, NULL, 0, NULL);
return result;
}
read_buf_ = buf;
read_buf_len_ = buf_len;
recv_from_address_ = address;
read_callback_ = callback;
return ERR_IO_PENDING;
}
int UDPSocketPosix::Write(IOBuffer* buf,
int buf_len,
const CompletionCallback& callback) {
return SendToOrWrite(buf, buf_len, NULL, callback);
}
int UDPSocketPosix::SendTo(IOBuffer* buf,
int buf_len,
const IPEndPoint& address,
const CompletionCallback& callback) {
return SendToOrWrite(buf, buf_len, &address, callback);
}
int UDPSocketPosix::SendToOrWrite(IOBuffer* buf,
int buf_len,
const IPEndPoint* address,
const CompletionCallback& callback) {
DCHECK(CalledOnValidThread());
DCHECK_NE(kInvalidSocket, socket_);
CHECK(write_callback_.is_null());
DCHECK(!callback.is_null()); // Synchronous operation not supported
DCHECK_GT(buf_len, 0);
int result = InternalSendTo(buf, buf_len, address);
if (result != ERR_IO_PENDING)
return result;
if (!base::MessageLoopForIO::current()->WatchFileDescriptor(
socket_, true, base::MessageLoopForIO::WATCH_WRITE,
&write_socket_watcher_, &write_watcher_)) {
DVLOG(1) << "WatchFileDescriptor failed on write, errno " << errno;
int result = MapSystemError(errno);
LogWrite(result, NULL, NULL);
return result;
}
write_buf_ = buf;
write_buf_len_ = buf_len;
DCHECK(!send_to_address_.get());
if (address) {
send_to_address_.reset(new IPEndPoint(*address));
}
write_callback_ = callback;
return ERR_IO_PENDING;
}
int UDPSocketPosix::Connect(const IPEndPoint& address) {
DCHECK_NE(socket_, kInvalidSocket);
net_log_.BeginEvent(NetLog::TYPE_UDP_CONNECT,
CreateNetLogUDPConnectCallback(&address, bound_network_));
int rv = InternalConnect(address);
net_log_.EndEventWithNetErrorCode(NetLog::TYPE_UDP_CONNECT, rv);
is_connected_ = (rv == OK);
return rv;
}
int UDPSocketPosix::InternalConnect(const IPEndPoint& address) {
DCHECK(CalledOnValidThread());
DCHECK(!is_connected());
DCHECK(!remote_address_.get());
int rv = 0;
if (bind_type_ == DatagramSocket::RANDOM_BIND) {
// Construct IPAddress of appropriate size (IPv4 or IPv6) of 0s,
// representing INADDR_ANY or in6addr_any.
size_t addr_size = address.GetSockAddrFamily() == AF_INET
? IPAddress::kIPv4AddressSize
: IPAddress::kIPv6AddressSize;
rv = RandomBind(IPAddress::AllZeros(addr_size));
}
// else connect() does the DatagramSocket::DEFAULT_BIND
if (rv < 0) {
UMA_HISTOGRAM_SPARSE_SLOWLY("Net.UdpSocketRandomBindErrorCode", -rv);
return rv;
}
SockaddrStorage storage;
if (!address.ToSockAddr(storage.addr, &storage.addr_len))
return ERR_ADDRESS_INVALID;
rv = HANDLE_EINTR(connect(socket_, storage.addr, storage.addr_len));
if (rv < 0)
return MapSystemError(errno);
remote_address_.reset(new IPEndPoint(address));
return rv;
}
int UDPSocketPosix::Bind(const IPEndPoint& address) {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
DCHECK(!is_connected());
int rv = SetMulticastOptions();
if (rv < 0)
return rv;
rv = DoBind(address);
if (rv < 0)
return rv;
is_connected_ = true;
local_address_.reset();
return rv;
}
int UDPSocketPosix::BindToNetwork(
NetworkChangeNotifier::NetworkHandle network) {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
DCHECK(!is_connected());
if (network == NetworkChangeNotifier::kInvalidNetworkHandle)
return ERR_INVALID_ARGUMENT;
#if defined(OS_ANDROID)
// Android prior to Lollipop didn't have support for binding sockets to
// networks.
if (base::android::BuildInfo::GetInstance()->sdk_int() <
base::android::SDK_VERSION_LOLLIPOP) {
return ERR_NOT_IMPLEMENTED;
}
int rv;
// On Android M and newer releases use supported NDK API. On Android L use
// setNetworkForSocket from libnetd_client.so.
if (base::android::BuildInfo::GetInstance()->sdk_int() >=
base::android::SDK_VERSION_MARSHMALLOW) {
// See declaration of android_setsocknetwork() here:
// http://androidxref.com/6.0.0_r1/xref/development/ndk/platforms/android-M/include/android/multinetwork.h#65
// Function cannot be called directly as it will cause app to fail to load
// on pre-marshmallow devices.
typedef int (*MarshmallowSetNetworkForSocket)(int64_t netId, int socketFd);
static MarshmallowSetNetworkForSocket marshmallowSetNetworkForSocket;
// This is racy, but all racers should come out with the same answer so it
// shouldn't matter.
if (!marshmallowSetNetworkForSocket) {
base::FilePath file(base::GetNativeLibraryName("android"));
void* dl = dlopen(file.value().c_str(), RTLD_NOW);
marshmallowSetNetworkForSocket =
reinterpret_cast<MarshmallowSetNetworkForSocket>(
dlsym(dl, "android_setsocknetwork"));
}
if (!marshmallowSetNetworkForSocket)
return ERR_NOT_IMPLEMENTED;
rv = marshmallowSetNetworkForSocket(network, socket_);
if (rv)
rv = errno;
} else {
// NOTE(pauljensen): This does rely on Android implementation details, but
// they won't change because Lollipop is already released.
typedef int (*LollipopSetNetworkForSocket)(unsigned netId, int socketFd);
static LollipopSetNetworkForSocket lollipopSetNetworkForSocket;
// This is racy, but all racers should come out with the same answer so it
// shouldn't matter.
if (!lollipopSetNetworkForSocket) {
// Android's netd client library should always be loaded in our address
// space as it shims socket() which was used to create |socket_|.
base::FilePath file(base::GetNativeLibraryName("netd_client"));
// Use RTLD_NOW to match Android's prior loading of the library:
// http://androidxref.com/6.0.0_r5/xref/bionic/libc/bionic/NetdClient.cpp#37
// Use RTLD_NOLOAD to assert that the library is already loaded and
// avoid doing any disk IO.
void* dl = dlopen(file.value().c_str(), RTLD_NOW | RTLD_NOLOAD);
lollipopSetNetworkForSocket =
reinterpret_cast<LollipopSetNetworkForSocket>(
dlsym(dl, "setNetworkForSocket"));
}
if (!lollipopSetNetworkForSocket)
return ERR_NOT_IMPLEMENTED;
rv = -lollipopSetNetworkForSocket(network, socket_);
}
// If |network| has since disconnected, |rv| will be ENONET. Surface this as
// ERR_NETWORK_CHANGED, rather than MapSystemError(ENONET) which gives back
// the less descriptive ERR_FAILED.
if (rv == ENONET)
return ERR_NETWORK_CHANGED;
if (rv == 0)
bound_network_ = network;
return MapSystemError(rv);
#else
NOTIMPLEMENTED();
return ERR_NOT_IMPLEMENTED;
#endif
}
int UDPSocketPosix::SetReceiveBufferSize(int32_t size) {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
int rv = setsockopt(socket_, SOL_SOCKET, SO_RCVBUF,
reinterpret_cast<const char*>(&size), sizeof(size));
return rv == 0 ? OK : MapSystemError(errno);
}
int UDPSocketPosix::SetSendBufferSize(int32_t size) {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
int rv = setsockopt(socket_, SOL_SOCKET, SO_SNDBUF,
reinterpret_cast<const char*>(&size), sizeof(size));
return rv == 0 ? OK : MapSystemError(errno);
}
int UDPSocketPosix::SetDoNotFragment() {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
#if !defined(IP_PMTUDISC_DO)
return ERR_NOT_IMPLEMENTED;
#else
if (addr_family_ == AF_INET6) {
int val = IPV6_PMTUDISC_DO;
if (setsockopt(socket_, IPPROTO_IPV6, IPV6_MTU_DISCOVER, &val,
sizeof(val)) != 0) {
return MapSystemError(errno);
}
int v6_only = false;
socklen_t v6_only_len = sizeof(v6_only);
if (getsockopt(socket_, IPPROTO_IPV6, IPV6_V6ONLY, &v6_only,
&v6_only_len) != 0) {
return MapSystemError(errno);
}
if (v6_only)
return OK;
}
int val = IP_PMTUDISC_DO;
int rv = setsockopt(socket_, IPPROTO_IP, IP_MTU_DISCOVER, &val, sizeof(val));
return rv == 0 ? OK : MapSystemError(errno);
#endif
}
int UDPSocketPosix::AllowAddressReuse() {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
DCHECK(!is_connected());
int true_value = 1;
int rv = setsockopt(
socket_, SOL_SOCKET, SO_REUSEADDR, &true_value, sizeof(true_value));
return rv == 0 ? OK : MapSystemError(errno);
}
int UDPSocketPosix::SetBroadcast(bool broadcast) {
DCHECK_NE(socket_, kInvalidSocket);
DCHECK(CalledOnValidThread());
int value = broadcast ? 1 : 0;
int rv;
#if defined(OS_MACOSX)
// SO_REUSEPORT on OSX permits multiple processes to each receive
// UDP multicast or broadcast datagrams destined for the bound
// port.
rv = setsockopt(socket_, SOL_SOCKET, SO_REUSEPORT, &value, sizeof(value));
#else
rv = setsockopt(socket_, SOL_SOCKET, SO_BROADCAST, &value, sizeof(value));
#endif // defined(OS_MACOSX)
return rv == 0 ? OK : MapSystemError(errno);
}
void UDPSocketPosix::ReadWatcher::OnFileCanReadWithoutBlocking(int) {
TRACE_EVENT0("net",
"UDPSocketPosix::ReadWatcher::OnFileCanReadWithoutBlocking");
if (!socket_->read_callback_.is_null())
socket_->DidCompleteRead();
}
void UDPSocketPosix::WriteWatcher::OnFileCanWriteWithoutBlocking(int) {
if (!socket_->write_callback_.is_null())
socket_->DidCompleteWrite();
}
void UDPSocketPosix::DoReadCallback(int rv) {
DCHECK_NE(rv, ERR_IO_PENDING);
DCHECK(!read_callback_.is_null());
// since Run may result in Read being called, clear read_callback_ up front.
CompletionCallback c = read_callback_;
read_callback_.Reset();
c.Run(rv);
}
void UDPSocketPosix::DoWriteCallback(int rv) {
DCHECK_NE(rv, ERR_IO_PENDING);
DCHECK(!write_callback_.is_null());
// since Run may result in Write being called, clear write_callback_ up front.
CompletionCallback c = write_callback_;
write_callback_.Reset();
c.Run(rv);
}
void UDPSocketPosix::DidCompleteRead() {
int result =
InternalRecvFrom(read_buf_.get(), read_buf_len_, recv_from_address_);
if (result != ERR_IO_PENDING) {
read_buf_ = NULL;
read_buf_len_ = 0;
recv_from_address_ = NULL;
bool ok = read_socket_watcher_.StopWatchingFileDescriptor();
DCHECK(ok);
DoReadCallback(result);
}
}
void UDPSocketPosix::LogRead(int result,
const char* bytes,
socklen_t addr_len,
const sockaddr* addr) const {
if (result < 0) {
net_log_.AddEventWithNetErrorCode(NetLog::TYPE_UDP_RECEIVE_ERROR, result);
return;
}
if (net_log_.IsCapturing()) {
DCHECK(addr_len > 0);
DCHECK(addr);
IPEndPoint address;
bool is_address_valid = address.FromSockAddr(addr, addr_len);
net_log_.AddEvent(
NetLog::TYPE_UDP_BYTES_RECEIVED,
CreateNetLogUDPDataTranferCallback(
result, bytes,
is_address_valid ? &address : NULL));
}
NetworkActivityMonitor::GetInstance()->IncrementBytesReceived(result);
}
void UDPSocketPosix::DidCompleteWrite() {
int result =
InternalSendTo(write_buf_.get(), write_buf_len_, send_to_address_.get());
if (result != ERR_IO_PENDING) {
write_buf_ = NULL;
write_buf_len_ = 0;
send_to_address_.reset();
write_socket_watcher_.StopWatchingFileDescriptor();
DoWriteCallback(result);
}
}
void UDPSocketPosix::LogWrite(int result,
const char* bytes,
const IPEndPoint* address) const {
if (result < 0) {
net_log_.AddEventWithNetErrorCode(NetLog::TYPE_UDP_SEND_ERROR, result);
return;
}
if (net_log_.IsCapturing()) {
net_log_.AddEvent(
NetLog::TYPE_UDP_BYTES_SENT,
CreateNetLogUDPDataTranferCallback(result, bytes, address));
}
NetworkActivityMonitor::GetInstance()->IncrementBytesSent(result);
}
int UDPSocketPosix::InternalRecvFrom(IOBuffer* buf,
int buf_len,
IPEndPoint* address) {
int bytes_transferred;
int flags = 0;
SockaddrStorage storage;
bytes_transferred =
HANDLE_EINTR(recvfrom(socket_,
buf->data(),
buf_len,
flags,
storage.addr,
&storage.addr_len));
int result;
if (bytes_transferred >= 0) {
result = bytes_transferred;
if (address && !address->FromSockAddr(storage.addr, storage.addr_len))
result = ERR_ADDRESS_INVALID;
} else {
result = MapSystemError(errno);
}
if (result != ERR_IO_PENDING)
LogRead(result, buf->data(), storage.addr_len, storage.addr);
return result;
}
int UDPSocketPosix::InternalSendTo(IOBuffer* buf,
int buf_len,
const IPEndPoint* address) {
SockaddrStorage storage;
struct sockaddr* addr = storage.addr;
if (!address) {
addr = NULL;
storage.addr_len = 0;
} else {
if (!address->ToSockAddr(storage.addr, &storage.addr_len)) {
int result = ERR_ADDRESS_INVALID;
LogWrite(result, NULL, NULL);
return result;
}
}
int result = HANDLE_EINTR(sendto(socket_,
buf->data(),
buf_len,
0,
addr,
storage.addr_len));
if (result < 0)
result = MapSystemError(errno);
if (result != ERR_IO_PENDING)
LogWrite(result, buf->data(), address);
return result;
}
int UDPSocketPosix::SetMulticastOptions() {
if (!(socket_options_ & SOCKET_OPTION_MULTICAST_LOOP)) {
int rv;
if (addr_family_ == AF_INET) {
u_char loop = 0;
rv = setsockopt(socket_, IPPROTO_IP, IP_MULTICAST_LOOP,
&loop, sizeof(loop));
} else {
u_int loop = 0;
rv = setsockopt(socket_, IPPROTO_IPV6, IPV6_MULTICAST_LOOP,
&loop, sizeof(loop));
}
if (rv < 0)
return MapSystemError(errno);
}
if (multicast_time_to_live_ != IP_DEFAULT_MULTICAST_TTL) {
int rv;
if (addr_family_ == AF_INET) {
u_char ttl = multicast_time_to_live_;
rv = setsockopt(socket_, IPPROTO_IP, IP_MULTICAST_TTL,
&ttl, sizeof(ttl));
} else {
// Signed integer. -1 to use route default.
int ttl = multicast_time_to_live_;
rv = setsockopt(socket_, IPPROTO_IPV6, IPV6_MULTICAST_HOPS,
&ttl, sizeof(ttl));
}
if (rv < 0)
return MapSystemError(errno);
}
if (multicast_interface_ != 0) {
switch (addr_family_) {
case AF_INET: {
#if !defined(OS_MACOSX)
ip_mreqn mreq;
mreq.imr_ifindex = multicast_interface_;
mreq.imr_address.s_addr = htonl(INADDR_ANY);
#else
ip_mreq mreq;
int error = GetIPv4AddressFromIndex(socket_, multicast_interface_,
&mreq.imr_interface.s_addr);
if (error != OK)
return error;
#endif
int rv = setsockopt(socket_, IPPROTO_IP, IP_MULTICAST_IF,
reinterpret_cast<const char*>(&mreq), sizeof(mreq));
if (rv)
return MapSystemError(errno);
break;
}
case AF_INET6: {
uint32_t interface_index = multicast_interface_;
int rv = setsockopt(socket_, IPPROTO_IPV6, IPV6_MULTICAST_IF,
reinterpret_cast<const char*>(&interface_index),
sizeof(interface_index));
if (rv)
return MapSystemError(errno);
break;
}
default:
NOTREACHED() << "Invalid address family";
return ERR_ADDRESS_INVALID;
}
}
return OK;
}
int UDPSocketPosix::DoBind(const IPEndPoint& address) {
SockaddrStorage storage;
if (!address.ToSockAddr(storage.addr, &storage.addr_len))
return ERR_ADDRESS_INVALID;
int rv = bind(socket_, storage.addr, storage.addr_len);
if (rv == 0)
return OK;
int last_error = errno;
UMA_HISTOGRAM_SPARSE_SLOWLY("Net.UdpSocketBindErrorFromPosix", last_error);
#if defined(OS_CHROMEOS)
if (last_error == EINVAL)
return ERR_ADDRESS_IN_USE;
#elif defined(OS_MACOSX)
if (last_error == EADDRNOTAVAIL)
return ERR_ADDRESS_IN_USE;
#endif
return MapSystemError(last_error);
}
int UDPSocketPosix::RandomBind(const IPAddress& address) {
DCHECK(bind_type_ == DatagramSocket::RANDOM_BIND && !rand_int_cb_.is_null());
for (int i = 0; i < kBindRetries; ++i) {
int rv = DoBind(IPEndPoint(address,
rand_int_cb_.Run(kPortStart, kPortEnd)));
if (rv == OK || rv != ERR_ADDRESS_IN_USE)
return rv;
}
return DoBind(IPEndPoint(address, 0));
}
int UDPSocketPosix::JoinGroup(const IPAddress& group_address) const {
DCHECK(CalledOnValidThread());
if (!is_connected())
return ERR_SOCKET_NOT_CONNECTED;
switch (group_address.size()) {
case IPAddress::kIPv4AddressSize: {
if (addr_family_ != AF_INET)
return ERR_ADDRESS_INVALID;
#if !defined(OS_MACOSX)
ip_mreqn mreq;
mreq.imr_ifindex = multicast_interface_;
mreq.imr_address.s_addr = htonl(INADDR_ANY);
#else
ip_mreq mreq;
int error = GetIPv4AddressFromIndex(socket_, multicast_interface_,
&mreq.imr_interface.s_addr);
if (error != OK)
return error;
#endif
memcpy(&mreq.imr_multiaddr, group_address.bytes().data(),
IPAddress::kIPv4AddressSize);
int rv = setsockopt(socket_, IPPROTO_IP, IP_ADD_MEMBERSHIP,
&mreq, sizeof(mreq));
if (rv < 0)
return MapSystemError(errno);
return OK;
}
case IPAddress::kIPv6AddressSize: {
if (addr_family_ != AF_INET6)
return ERR_ADDRESS_INVALID;
ipv6_mreq mreq;
mreq.ipv6mr_interface = multicast_interface_;
memcpy(&mreq.ipv6mr_multiaddr, group_address.bytes().data(),
IPAddress::kIPv6AddressSize);
int rv = setsockopt(socket_, IPPROTO_IPV6, IPV6_JOIN_GROUP,
&mreq, sizeof(mreq));
if (rv < 0)
return MapSystemError(errno);
return OK;
}
default:
NOTREACHED() << "Invalid address family";
return ERR_ADDRESS_INVALID;
}
}
int UDPSocketPosix::LeaveGroup(const IPAddress& group_address) const {
DCHECK(CalledOnValidThread());
if (!is_connected())
return ERR_SOCKET_NOT_CONNECTED;
switch (group_address.size()) {
case IPAddress::kIPv4AddressSize: {
if (addr_family_ != AF_INET)
return ERR_ADDRESS_INVALID;
ip_mreq mreq;
mreq.imr_interface.s_addr = INADDR_ANY;
memcpy(&mreq.imr_multiaddr, group_address.bytes().data(),
IPAddress::kIPv4AddressSize);
int rv = setsockopt(socket_, IPPROTO_IP, IP_DROP_MEMBERSHIP,
&mreq, sizeof(mreq));
if (rv < 0)
return MapSystemError(errno);
return OK;
}
case IPAddress::kIPv6AddressSize: {
if (addr_family_ != AF_INET6)
return ERR_ADDRESS_INVALID;
ipv6_mreq mreq;
mreq.ipv6mr_interface = 0; // 0 indicates default multicast interface.
memcpy(&mreq.ipv6mr_multiaddr, group_address.bytes().data(),
IPAddress::kIPv6AddressSize);
int rv = setsockopt(socket_, IPPROTO_IPV6, IPV6_LEAVE_GROUP,
&mreq, sizeof(mreq));
if (rv < 0)
return MapSystemError(errno);
return OK;
}
default:
NOTREACHED() << "Invalid address family";
return ERR_ADDRESS_INVALID;
}
}
int UDPSocketPosix::SetMulticastInterface(uint32_t interface_index) {
DCHECK(CalledOnValidThread());
if (is_connected())
return ERR_SOCKET_IS_CONNECTED;
multicast_interface_ = interface_index;
return OK;
}
int UDPSocketPosix::SetMulticastTimeToLive(int time_to_live) {
DCHECK(CalledOnValidThread());
if (is_connected())
return ERR_SOCKET_IS_CONNECTED;
if (time_to_live < 0 || time_to_live > 255)
return ERR_INVALID_ARGUMENT;
multicast_time_to_live_ = time_to_live;
return OK;
}
int UDPSocketPosix::SetMulticastLoopbackMode(bool loopback) {
DCHECK(CalledOnValidThread());
if (is_connected())
return ERR_SOCKET_IS_CONNECTED;
if (loopback)
socket_options_ |= SOCKET_OPTION_MULTICAST_LOOP;
else
socket_options_ &= ~SOCKET_OPTION_MULTICAST_LOOP;
return OK;
}
int UDPSocketPosix::SetDiffServCodePoint(DiffServCodePoint dscp) {
if (dscp == DSCP_NO_CHANGE) {
return OK;
}
int rv;
int dscp_and_ecn = dscp << 2;
if (addr_family_ == AF_INET) {
rv = setsockopt(socket_, IPPROTO_IP, IP_TOS,
&dscp_and_ecn, sizeof(dscp_and_ecn));
} else {
rv = setsockopt(socket_, IPPROTO_IPV6, IPV6_TCLASS,
&dscp_and_ecn, sizeof(dscp_and_ecn));
}
if (rv < 0)
return MapSystemError(errno);
return OK;
}
void UDPSocketPosix::DetachFromThread() {
base::NonThreadSafe::DetachFromThread();
}
} // namespace net
| [
"bino.zh@gmail.com"
] | bino.zh@gmail.com |
26ed0ef3d6ecefb11d6a5c13be0a734c0cbe62d5 | cd8c2812140978b1d55a5ca4fcc9d523c5d0b8ec | /Matrix.cpp | 662e69e340da3357d4357715cb87fd063414372f | [] | no_license | Filatkin/Minimum-area-ellipse | d0dbb122cb50817d8964fe198c2f2bc4f3fed5f7 | 2e48bcbe0465fd25fd79768f021105ba92bc5a56 | refs/heads/master | 2023-04-03T11:31:05.825874 | 2021-04-06T20:41:21 | 2021-04-06T20:41:21 | 355,320,364 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,975 | cpp | #include <iostream>
#include "Matrix.hpp"
using namespace std;
Matrix::Matrix(unsigned int n_,unsigned int r_)
{
n=n_;
r=r_;
a=new double* [n];
for(unsigned int i=0;i<n;i++)
a[i]=new double [r];
}
Matrix::~Matrix()
{
for(unsigned int i=0;i<n;i++)
delete [] a[i];
delete [] a;
}
unsigned int Matrix::getN() const
{
return n;
}
unsigned int Matrix::getR() const
{
return r;
}
double Matrix::getValue(unsigned int i, unsigned int j) const
{
return a[i][j];
}
void Matrix::setValue(unsigned int i, unsigned int j, double value) const
{
a[i][j]=value;
}
Matrix Matrix::operator* (const double c) const
{
Matrix M=Matrix(n,r);
for(unsigned int i=0;i<n;i++)
for(unsigned int j=0;j<r;j++)
M.setValue(i,j,a[i][j]*c);
return M;
}
Matrix Matrix::operator+ (const Matrix& m) const
{
Matrix M=Matrix(n,r);
for(unsigned int i=0;i<n;i++)
for(unsigned int j=0;j<r;j++)
M.setValue(i,j,a[i][j]+m.getValue(i,j));
return M;
}
Matrix Matrix::operator- (const Matrix& m) const
{
Matrix M=Matrix(n,r);
for(unsigned int i=0;i<n;i++)
for(unsigned int j=0;j<r;j++)
M.setValue(i,j,a[i][j]-m.getValue(i,j));
return M;
}
Matrix Matrix::operator* (const Matrix& m)
{
Matrix M=Matrix(n,m.getR());
for(unsigned int i=0;i<n;i++)
{
for(unsigned int j=0;j<m.getR();j++)
{
double c;
c=0;
for(unsigned int k=0;k<r;k++)
{
c+=a[i][k]*m.getValue(k,j);
}
M.setValue(i,j,c);
}
}
return M;
}
Vector Matrix::operator* (const Vector& v)
{
Vector V=Vector(v.getN());
for(unsigned int i=0;i<n;i++)
{
double c;
c=0;
for(unsigned int k=0;k<v.getN();k++)
{
c+=a[i][k]*v.getValue(k);
}
V.setValue(i,c);
}
return V;
}
//Only for 3x3, and it's enough
double Matrix::det()
{
return a[0][0]*(a[1][1]*a[2][2]-a[1][2]*a[2][1])-a[0][1]*(a[1][0]*a[2][2]-a[2][0]*a[1][2])+a[0][2]*(a[1][0]*a[2][1]-a[1][1]*a[2][0]);
}
Matrix Matrix::operator=(const Matrix &m) const
{
Matrix M=Matrix(m.getN(),m.getR());
for(unsigned int i=0;i<m.getN();i++)
for(unsigned int j=0;j<m.getR();j++)
{
M.setValue(i,j,a[i][j]);
}
return M;
}
Matrix Matrix::transpose() const
{
Matrix M=Matrix(r,n);
for(unsigned int i=0;i<r;i++)
for(unsigned int j=0;j<n;j++)
{
M.setValue(i,j,a[j][i]);
}
return M;
}
//Only for 3x3 and 2x2, and it's enough
Matrix Matrix::inv()
{
double d=this->det();
Matrix m=Matrix(3,3);
m.setValue(0,0,(a[1][1]*a[2][2]-a[1][2]*a[2][1])/d);
m.setValue(0,1,-(a[1][0]*a[2][2]-a[1][2]*a[2][0])/d);
m.setValue(0,2,(a[1][0]*a[2][1]-a[2][0]*a[1][1])/d);
m.setValue(1,0,-(a[0][1]*a[2][2]-a[0][2]*a[2][1])/d);
m.setValue(1,1,(a[0][0]*a[2][2]-a[0][2]*a[2][0])/d);
m.setValue(1,2,-(a[0][0]*a[2][1]-a[0][1]*a[2][0])/d);
m.setValue(2,0,(a[0][1]*a[1][2]-a[1][1]*a[0][2])/d);
m.setValue(2,1,-(a[0][0]*a[1][2]-a[1][0]*a[0][2])/d);
m.setValue(2,2,(a[0][0]*a[1][1]-a[0][1]*a[1][0])/d);
return m.transpose();
}
Matrix Matrix::inv2()
{
double d=a[0][0]*a[1][1]-a[0][1]*a[1][0];
Matrix m=Matrix(2,2);
m.setValue(0,0,a[1][1]/d);
m.setValue(0,1,(-a[0][1])/d);
m.setValue(1,0,(-a[1][0])/d);
m.setValue(1,1,a[0][0]/d);
return m;
}
Vector Matrix::diag()
{
Vector v=Vector(n);
for(unsigned int i=0;i<n;i++)
{
v.setValue(i,a[i][i]);
}
return v;
}
Matrix operator* (double c, const Matrix& m)
{
Matrix M(m.getN(),m.getR());
for(unsigned int i=0;i<m.getN();i++)
for(unsigned int j=0;j<m.getR();j++)
M.setValue(i,j,c*m.getValue(i,j));
return M;
}
//Only for 2x2
ostream& operator<<(ostream& os, const Matrix& m)
{
os <<endl<< m.getValue(0,0) << " " << m.getValue(0,1) <<endl;
os << m.getValue(1,0) << " " << m.getValue(1,1) <<endl;
return os;
}
//Only for 2x2,it's enough
Matrix operator*(const Vector &v,const Matrix &m)
{
Matrix M=Matrix(2,2);
M.setValue(0,0,v.getValue(0)*m.getValue(0,0));
M.setValue(0,1,v.getValue(0)*m.getValue(0,1));
M.setValue(1,0,v.getValue(1)*m.getValue(0,0));
M.setValue(1,1,v.getValue(1)*m.getValue(0,1));
return M;
}
| [
"afil_0206_2_2@mail.ru"
] | afil_0206_2_2@mail.ru |
0fc0c22be9d31b8eeaff77a705b60f2a069466ce | e90c4fd02cc8667142f792fda003a59d4a7ca61c | /C++ Operating Systems/OS_Sim_Driver_1/OS_Sim_Driver_1/long-term_scheduler.h | c5c21559399eca86f27ce995b45fcc8da12c80c5 | [] | no_license | wpegg-dev/College-Work | a8bf1f31fcd8d028ff6d33520d6b555619ec8d71 | 3f6287627486c6c58c5f935cb779a48544c7e29c | refs/heads/master | 2016-09-15T22:39:51.112788 | 2015-06-25T03:26:21 | 2015-06-25T03:26:21 | 35,346,348 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,220 | h | /*Author: William Pegg
--Class: CS-3243 Spring 2012
--File Name: Long-term_scheduler.h
*/
#ifndef LONGSCHEDULER_H
#define LONGSCHEDULER_H
// tlj - moved to outside of class and added 'int' type specifier
const int processDataSIZE = 44;//tlj - added 'int'
class LongScheduler {
public:
int current_process;
//-----------------------------
//FUNCTIONS
//-----------------------------
//Default Constructor. starts the ready queue and current process value
LongScheduler();
//----------------------------------------------------------------------------------------
// Iterates through the newQueue and places processes into RAM and into the readyqueue
//----------------------------------------------------------------------------------------
void moveToRAM();
//----------------------------------------------------------
// Writes a process's cache from RAM back into the disk
//----------------------------------------------------------
void moveToDisk();
//----------------------------------------------------------------
// This function will move all the processes into the new queue
//----------------------------------------------------------------
void loadProcesses();
};
#endif; | [
"william.pegg.dev@gmail.com"
] | william.pegg.dev@gmail.com |
fa79fb0be2ece5eae35418044f21026f57f913e7 | aa2052049bad005796fb4120987b084e386c3dd8 | /Deanery/include/lab5.h | 75b011e3eed6cf6e821381c0ed84779a0bd2d651 | [] | no_license | VirtualRoyalty/Deanery-model | 058e4603622a0492e2af9c35040286e727cb674f | 4b7d78f3c90aeb8c6e1e1d27d7e3dae9607879c1 | refs/heads/master | 2020-04-21T04:52:35.261001 | 2019-02-06T09:15:21 | 2019-02-06T09:15:21 | 169,325,137 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,998 | h | #pragma once
#include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <ctime>
using namespace std;
class Group;
class Deanery;
class Student
{
friend Group;
friend Deanery;
private:
int id;
std::string fio;
std::vector <int> marks;
Group *group;
public:
Student(int _id, std::string _fio,int n_marks)
{
id = _id;
fio = _fio;
for (auto i = 0; i < n_marks; i++)
{
this->marks.push_back(rand() % 5 + 1);
}
}
void enroll_to(Group *_group)
{
this->group = _group;
}
void add_mark(int _mark)
{
marks.push_back(_mark);
}
double calc_progress()
{
double avrg=0;
for (auto i = 0; i < marks.size(); i++)
{
avrg += marks[i];
}
return (avrg / marks.size());
}
};
class Group
{
friend Deanery;
private:
std::string title;
std::vector<Student*> students;
Student *head;
public:
Group(std::string _title)
{
title = _title;
};
void enroll(Student &_student)
{
_student.group = this;
students.push_back(&_student);
cout << (&_student)->fio << " has been enrolled in " << this->title << endl;
}
Student * search(string _fio)
{
for (auto i =0; i < students.size(); i++)
{
if (this->students[i]->fio == _fio)
{
return students[i];
}
}
std::cout << "There is no " <<_fio<< " in "<<this->title<<" !"<< std::endl;
return NULL;
}
Student * election()
{
if (students.size() > 1)
{
int new_head = rand() % students.size();
this->head = students[new_head];
cout << this->head->fio << " is a new head of " << this->title << endl;
return this->head;
}
else
{
return NULL;
}
}
bool removal(Student *_student )
{
if (_student->group == this)
{
for (auto i = 0; i<this->students.size(); i++)
{
if (students[i]->id==_student->id)
{
std::cout << _student->fio << " is dissmised! " << std::endl;
students.erase(students.begin()+i);
if (_student == this->head)
{
this->election();
std::cout << "A new head of " << this->title << " is " <<this->head->fio<<std::endl;
}
return true;
}
}
}
else
{
std::cout << "There is no" << _student->fio <<" in " << this->title << " !" << std::endl;
return false;
}
}
double calc_avrg()
{
double avrg = 0;
for (auto i = 0; i < students.size(); i++)
{
avrg += (*students[i]).calc_progress();
}
return (avrg / students.size());
}
};
class Deanery
{
private:
vector<Student*> students;
vector<Group*> groups;
public:
Deanery(string _file)
{
srand(time(0));
ifstream file(_file);
if (!file)
{
cout << "Error in opening file for reading !" << endl;
return;
}
string buf;
int pos,id=0,n_marks=5;
Group *_group = NULL;
while(getline(file, buf))
{
if (buf.find("END")!=buf.npos)
{
for (auto i = 0; i < groups.size(); i++)
{
groups[i]->election();
cout << "The election of the head in a group #" << i+1 << endl;
}
cout << "END OF PROCCESS!" << endl;;
return;
}
if (buf.find("group") != buf.npos)
{
cout << "group making" << endl;
pos = buf.find("group");
_group=new Group(buf.substr(0, pos - 1));
groups.push_back(_group);
}
else
{
Student *_student=new Student(id, buf,n_marks);
(*_group).enroll(*_student);
this->students.push_back(_student);
id++;
}
}
return;
}
Group * searchGroup(string title)
{
for (auto i = 0; i < groups.size(); i++)
{
if (groups[i] -> title == title)
{
return groups[i];
}
}
return NULL;
}
bool transfer(string fio,Group *group)
{
Student * st=NULL;
for (auto i = 0; i < groups.size(); i++)
{
st = (*groups[i]).search(fio);
if (st != NULL)
{
break;
}
}
if (st == NULL)
{
cout << "There is no " << fio << " in the Deanery" << endl;
return false;
}
if (st->group == group)
{
cout << fio << "is already in" << st->group->title << endl;
return false;
}
else
{
cout <<fio << " is transfered from " << st->group->title << " to " << group->title << endl;
st->group->removal(st);
group->enroll(*st);
if (st == st->group->head)
{
st->group->election();
}
return true;
}
}
void checkProgress(double limit)
{
cout << endl << "THE LIST OF UDNDERACHIEVERS: (GPA below " <<limit<<")"<< endl<<endl;
for (auto i = 0; i < groups.size(); i++)
{
cout << groups[i]->title << ":" << endl;
int total = 0,counter=0,N;
N = groups[i]->students.size();
for (auto j = N-1; j >=0; j--)
{
counter++;
if ((groups[i]->students[j]->calc_progress())<= limit)
{
this->groups[i]->removal(groups[i]->students[j]);
total++;
}
}
cout << "Total: " << total << endl;
}
cout << endl << "THE END OF THE LIST. " << endl<<endl;
return;
}
void reelection()
{
for (auto i = 0; i < groups.size(); i++)
{
groups[i]->election();
}
}
void updateData(string _file)
{
ofstream fout(_file);
for (auto i = 0; i < groups.size(); i++)
{
fout << this->groups[i]->title<<" group"<<endl;
for (auto j = 0; j < groups[i]->students.size(); j++)
{
fout <<this-> groups[i]->students[j]->fio<<endl;
}
}
fout << "END";
fout.close();
}
void printStatics()
{
for (auto i = 0; i < this->groups.size(); i++)
{
cout <<endl<< "Group: "<<groups[i]->title <<" has "<<groups[i]->students.size()<<" students. The avrg progress is "<<groups[i]->calc_avrg()<<endl;
cout <<endl<< "The head of "<< groups[i]->title<<" is " << groups[i]->head->fio <<" with ID: "<< groups[i]->head->id<< endl<<endl;
for (auto j = 0;j < (this->groups[i]->students.size()); j++)
{
cout << "ID: " << this->groups[i]->students[j]->id << " avrg_mark: " << this->groups[i]->students[j]->calc_progress() << " " << groups[i]->students[j]->fio;
for (auto k = 0; k < (this->groups[i]->students[j]->marks.size()); k++)
{
cout << " " << this->groups[i]->students[j]->marks[k];
}
cout << endl;
}
}
}
};
| [
"vadikalperovich@mail.ru"
] | vadikalperovich@mail.ru |
b49782c8fb4f2d19d9cc71825442769266bfe1fe | 8c6437a1fb20b6d6f1a646bd064d2383a98d25a2 | /TCP/TCP_examples/tcpServer1/server.cpp | 09ec7cc39fc4da71064e3c869e376af3905acb2a | [] | no_license | GieYan/QT | c611d8ca7750c93371516908b2ae95fdf8afd87f | 5490a4cc15fefdaaf99c95674a8a32d84d708721 | refs/heads/master | 2021-01-19T06:32:22.494568 | 2016-06-23T13:22:02 | 2016-06-23T13:22:02 | 60,246,044 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,433 | cpp | #include "server.h"
#include "ui_server.h"
#include <QtNetwork>
Server::Server(QWidget *parent) :
QDialog(parent),
ui(new Ui::Server)
{
ui->setupUi(this);
connect(&tcpServer, SIGNAL(newConnection()),
this, SLOT(acceptConnection()));
}
Server::~Server()
{
delete ui;
}
// 开启监听
void Server::start()
{
if (!tcpServer.listen(QHostAddress::Any/*LocalHost*/, 6666)) {
qDebug() << tcpServer.errorString();
close();
return;
}
ui->startButton->setEnabled(false);
totalBytes = 0;
bytesReceived = 0;
fileNameSize = 0;
ui->serverStatusLabel->setText(tr("监听"));
ui->serverProgressBar->reset();
}
// 接收连接
void Server::acceptConnection()
{
tcpServerConnection = tcpServer.nextPendingConnection();
connect(tcpServerConnection, SIGNAL(readyRead()),
this, SLOT(updateServerProgress()));
connect(tcpServerConnection, SIGNAL(error(QAbstractSocket::SocketError)),
this, SLOT(displayError(QAbstractSocket::SocketError)));
ui->serverStatusLabel->setText(tr("接受连接"));
// 关闭服务器，不再进行监听
tcpServer.close();
}
// 接收文件并更新进度条
void Server::updateServerProgress()
{
QDataStream in(tcpServerConnection);
in.setVersion(QDataStream::Qt_4_0);
// 如果接收到的数据小于16个字节，保存到来的文件头结构
if (bytesReceived <= sizeof(qint64)*2) {
if((tcpServerConnection->bytesAvailable() >= sizeof(qint64)*2)
&& (fileNameSize == 0)) {
// 接收数据总大小信息和文件名大小信息
in >> totalBytes >> fileNameSize;
bytesReceived += sizeof(qint64) * 2;
}
if((tcpServerConnection->bytesAvailable() >= fileNameSize)
&& (fileNameSize != 0)) {
// 接收文件名，并建立文件
in >> fileName;
ui->serverStatusLabel->setText(tr("接收文件 %1 …")
.arg(fileName));
bytesReceived += fileNameSize;
localFile = new QFile(fileName);
if (!localFile->open(QFile::WriteOnly)) {
qDebug() << "server: open file error!";
return;
}
} else {
return;
}
}
// 如果接收的数据小于总数据，那么写入文件
if (bytesReceived < totalBytes) {
bytesReceived += tcpServerConnection->bytesAvailable();
inBlock = tcpServerConnection->readAll();
localFile->write(inBlock);
inBlock.resize(0);
}
ui->serverProgressBar->setMaximum(totalBytes);
ui->serverProgressBar->setValue(bytesReceived);
// 接收数据完成时
if (bytesReceived == totalBytes) {
tcpServerConnection->close();
localFile->close();
ui->startButton->setEnabled(true);
ui->serverStatusLabel->setText(tr("接收文件 %1 成功！")
.arg(fileName));
}
}
// 显示错误
void Server::displayError(QAbstractSocket::SocketError socketError)
{
qDebug() << tcpServerConnection->errorString();
tcpServerConnection->close();
ui->serverProgressBar->reset();
ui->serverStatusLabel->setText(tr("服务端就绪"));
ui->startButton->setEnabled(true);
}
// 开始监听按钮
void Server::on_startButton_clicked()
{
start();
}
| [
"ygleas125@163.com"
] | ygleas125@163.com |
9953cb3d896a63d7b752f823f43fee92f6565c80 | 7747a6d4a0e933ee28d2749b1b2bd30023d889f1 | /Audio.h | c49415b108f2af5f963ba1ccd014e894cfabdbf9 | [] | no_license | Mightted/testFFmpeg | 6cf8c6369356ad3445765675d0876f2808b86dcd | 40e0c16edd010ee10f4cf5cdb3e4729b22ff531d | refs/heads/master | 2023-03-31T13:05:03.972376 | 2021-03-31T16:45:48 | 2021-03-31T16:45:48 | 350,617,086 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 758 | h | //
// Created by xk on 2021/3/17.
//
#ifndef TESTFFMPEG_AUDIO_H
#define TESTFFMPEG_AUDIO_H
#include "AVCommon.h"
#include "AudioParams.h"
extern "C" {
#include "libswresample/swresample.h"
};
class Audio : public AVCommon {
public:
bool sdl_init(void *vs, void(*callback)(void *, uint8_t *, int));
void play() override;
bool do_swr();
static void playback(void *opaque, Uint8 *stream, int len);
bool need_update();
uint8_t *audio_buf = nullptr;
int audio_buf_index = -1;
int audio_buf_size = 0;
// bool need_next_frame = true;
private:
AudioParams params;
SDL_AudioDeviceID audio_dev;
struct SwrContext *swrContext = nullptr;
};
#endif //TESTFFMPEG_AUDIO_H
| [
"huangxiaoshen@castelbds.com"
] | huangxiaoshen@castelbds.com |
2fb557844f83ac9d400ca4039ec9b6113c645f3d | 0169482f88d6bb5ee7eb318182fdaef7b5c3d1ec | /tests/benchmarks/bench_ConvexPolyhedron2.cpp | 43d9fac5b4e208f05fe560a027c5b96c57b49fad | [] | no_license | sd-ot/sdot_pub | 9d4414474b9cc0d28c7a71f24a13ce9c1ae18fb2 | b3ff0bdbeab28e4158a74492d72756fe458f2229 | refs/heads/master | 2020-10-01T21:48:05.308199 | 2020-01-10T08:23:04 | 2020-01-10T08:23:04 | 227,631,501 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,687 | cpp | #include "../../src/sdot/Geometry/ConvexPolyhedron2.h"
#include "../../src/sdot/Support/StaticRange.h"
#include "../../src/sdot/Support/ASSERT.h"
#include "../../src/sdot/Support/Time.h"
#include "../../src/sdot/Support/P.h"
#include <fstream>
#include <map>
using namespace sdot;
// // nsmake cxx_name clang++
// // nsmake cpp_flag -march=skylake
//// nsmake cpp_flag -march=native
//// nsmake cpp_flag -ffast-math
//// nsmake cpp_flag -O3
struct Pc {
enum { store_the_normals = false };
enum { allow_ball_cut = false };
using TF = double;
using TI = std::size_t;
using CI = std::size_t;
using Pt = Point2<TF>;
struct Dirac {
TF weight;
Pt pos;
};
};
using Cp = ConvexPolyhedron2<Pc>;
using TF = Cp::TF;
using Pt = Cp::Pt;
//static __attribute__ ((noinline))
//double fake_cp_plane_cut( const Cut *cuts, std::size_t nb_cuts ) {
// double res = 0;
// for( std::size_t i = 0; i < nb_cuts; ++i )
// res += cuts[ i ].dir.x + cuts[ i ].dir.y + cuts[ i ].dist;
// return res;
//}
template<int Simd,int Switch>
void bench( std::vector<TF> xs, std::vector<TF> ys, std::vector<TF> ps, std::vector<Pc::Dirac *> ds, N<Simd>, N<Switch> ) {
constexpr int flags = ConvexPolyhedron::do_not_use_simd * ( Simd == 0 ) +
ConvexPolyhedron::do_not_use_switch * ( Switch == 0 );
// overhead
Cp cp;
TF sum = 0;
Cp::Box box{ { -1, -1 }, { 1, 1 } };
std::uint64_t t0 = 0, t1 = 0, nb_reps = 1280000;
RDTSC_START( t0 );
for( std::size_t rep = 0; rep < nb_reps; ++rep ) {
cp = box;
}
RDTSC_FINAL( t1 );
std::uint64_t overhead = t1 - t0;
// cuts
RDTSC_START( t0 );
for( std::size_t rep = 0; rep < nb_reps; ++rep ) {
cp = box;
cp.plane_cut( { xs.data(), ys.data() }, ps.data(), ds.data(), xs.size(), N<flags>() );
sum += cp.nb_nodes();
}
RDTSC_FINAL( t1 );
std::uint64_t dt = ( t1 - t0 - overhead ) / ( nb_reps * xs.size() );
P( sum, overhead, t1 - t0, dt );
P( cp );
}
int main() {
std::size_t nb_cuts = 120;
std::vector<TF> xs, ys, ps;
std::vector<Pc::Dirac *> ds;
for( std::size_t n = 0; n < nb_cuts; ++n ) {
TF th = ( random() % 8 ) * M_PI / 5;
xs.push_back( cos( th ) );
ys.push_back( sin( th ) );
ps.push_back( 10.0 / ( 11 + n ) + ( n % 2 ) );
ds.push_back( nullptr );
}
bench( xs, ys, ps, ds, /*simd*/ N<0>(), /*switch*/ N<0>() );
bench( xs, ys, ps, ds, /*simd*/ N<1>(), /*switch*/ N<0>() );
bench( xs, ys, ps, ds, /*simd*/ N<1>(), /*switch*/ N<1>() );
}
| [
"hugal.leclerc@gmail.com"
] | hugal.leclerc@gmail.com |
b2d7bb5aad1d143c737fe8ecc4d70e970b32e04f | a5364f0cc392899eeedc6d0fbc42c6ce5b3ad475 | /cpp01/ex07/Replace.cpp | 5ccb064e272233c963e6aa844741bef3a3a6d9a2 | [
"MIT"
] | permissive | ndeana-21/cpp | 47cb64e10a4e1644bc79056be30041c342a86aad | 98932eab0c1d57a715b6deb76c7a294c1e86f2fd | refs/heads/main | 2023-04-10T14:34:38.898985 | 2021-04-14T12:25:27 | 2021-04-14T12:25:27 | 319,647,953 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 993 | cpp | #include "Replace.hpp"
std::string Replace::find_and_replace(std::string str, const std::string find, const std::string replace) {
unsigned long pos = 0;
while ((pos = str.find(find, pos)) != std::string::npos) {
str.replace(pos, find.length(), replace);
pos += replace.length();
}
return (str);
}
void Replace::replace(const std::string filename, const std::string find, const std::string replace)
{
std::ifstream inputFile(filename.c_str());
std::ofstream outputFile;
std::string readline;
if (!inputFile.is_open()) {
std::cout << "Can`t open input file" << std::endl;
return ;
}
outputFile.open((filename + ".replace").c_str(), std::ios::trunc);
if (!outputFile.is_open()) {
inputFile.close();
std::cout << "Can`t open output file" << std::endl;
return ;
}
while (std::getline(inputFile, readline)) {
outputFile << find_and_replace(readline, find, replace);
if (!inputFile.eof())
outputFile << std::endl;
}
outputFile.close();
inputFile.close();
} | [
"n"
] | n |
31ec724f7fb0a4e389598f4e481b47f2f1c1feb0 | 41fd2e43649ccc2c9cdd6bbcddf159babdf36dba | /sail/sail/Load.cpp | caffdd465a519d1171011f0872318bccd94c0055 | [] | no_license | fredfeng/compass | 84d37183c11692da77b3c8cf7666c15a5b524390 | 3063df1a86e9473bbd62d52e9002743fd7e90c3b | refs/heads/master | 2020-04-10T11:57:17.616921 | 2015-03-10T16:54:21 | 2015-03-10T16:54:21 | 31,969,036 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,329 | cpp | /*
* Load.cpp
*
* Created on: Jun 29, 2008
* Author: isil
*/
#include "Load.h"
#include "Variable.h"
#include "node.h"
#include <sstream>
#include <assert.h>
#include "util.h"
namespace sail {
Load::Load(Variable* v1, Symbol* v2, int offset, string name,
il::node* original, int line) {
this->v1 = v1;
this->v2 = v2;
assert(original != NULL);
this->original = original;
this->inst_id = LOAD;
this->offset = offset;
this->name = name;
this->line = line;
}
Load::Load(Variable* v1, Symbol* v2, int offset, string name, int line){
this->v1 = v1;
this->v2 = v2;
this->original = NULL;
this->inst_id = LOAD;
this->offset = offset;
this->name = name;
this->line = line;
}
string Load::to_string() const
{
string res = v1->to_string();
res += " = ";
if(offset==0 && name == "") res += "*" + v2->to_string();
else if(name != "") res += v2->to_string()+"->" +name;
else res += "*(" + v2->to_string()+ "+" + int_to_string(offset)+")";
return res;
}
string Load::to_string(bool pp) const
{
string res = v1->to_string(pp);
res += " = ";
if(offset==0 && name == "") res += "*" + v2->to_string(pp);
else if(name != "") res += v2->to_string(pp)+"->" +name;
else res += "*(" + v2->to_string(pp)+ "+" + int_to_string(offset)+")";
res += "(off: " + int_to_string(offset) + ")";
res += "(type of LHS: " + v1->get_type()->to_string() +")";
//haiyan added to print line num.
if(pp)
{
string linenum;
if((this->line != -1)&&(this->line != 0))
{
stringstream ss;
ss << this->line;
linenum = ss.str();
res += "( line :" + linenum + " )";
}
}
return res;
}
/*
//haiyan added for load's field in dex
string Load::to_string(bool pp) const
{
string res = v1->to_string(pp);
res += " = ";
if(offset==0 && name == "") res += "*" + v2->to_string(pp);
else if(name != "") res += v2->to_string(pp)+"->" +name;
else res += v2->to_string(pp);
return res;
}
//haiyan end for load's field in dex
*/
Variable* Load::get_lhs()
{
return v1;
}
void Load::set_lhs(Variable* v)
{
this->v1 = v;
}
void Load::set_rhs(Symbol* s)
{
this->v2 = s;
}
Symbol* Load::get_rhs()
{
return v2;
}
bool Load::is_removable()
{
return v1->is_removable_temp();
}
int Load::get_offset()
{
return offset;
}
string& Load::get_field_name()
{
return name;
}
Load::~Load() {
}
}
| [
"fengyu8299@gmail.com"
] | fengyu8299@gmail.com |
a4eadd38a29401621283bbc0b6c2ec26c406f6dc | ed2cb932b6a6171cf7b5e338b2ef6c88d316a0e7 | /D2DFramework_v0.01/System/Application/DX2DApp.cpp | a86be14bb26b0bc978a408747f5c8661341b7004 | [] | no_license | wowangki/Study | 6d755f5fd8d1e7af9bd0294132f36ac274a7909e | 304bb957e0d56bc911a872e9fcf37087417a3b99 | refs/heads/master | 2020-09-07T20:39:09.171067 | 2020-01-07T15:39:20 | 2020-01-07T15:39:20 | 220,907,080 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 2,268 | cpp | #include "stdafx.h"
#include "DX2DApp.h"
DX2DApp::DX2DApp()
:
pWriteFactory(nullptr),
pDefaultBrush(nullptr),
pRenderTarget(nullptr),
pDirect2dFactory(nullptr)
{
}
bool DX2DApp::CreateFactory(void)
{
//FAILED = HRESULT
//성공시 S_OK 실패하면 E_FAIL
if (FAILED(D2D1CreateFactory(
D2D1_FACTORY_TYPE_SINGLE_THREADED,
&pDirect2dFactory)))
{
return false;
}
return true;
}
bool DX2DApp::CreateDirect2dResources(void)
{
RECT rc = { 0, 0,(LONG)AppDesc.width, (LONG)AppDesc.height };
D2D1_SIZE_U size = D2D1::SizeU(
rc.right - rc.left,
rc.bottom - rc.top
);
UINT CenterX =
(GetSystemMetrics(SM_CXSCREEN) - (UINT)AppDesc.width) / 2;
UINT CenterY =
(GetSystemMetrics(SM_CYSCREEN) - (UINT)AppDesc.height) / 2;
AdjustWindowRect(&rc, WS_OVERLAPPEDWINDOW, FALSE);
MoveWindow(AppDesc._hWnd, CenterX, CenterY,
rc.right - rc.left,
rc.bottom - rc.top, TRUE);
if (FAILED(
pDirect2dFactory->CreateHwndRenderTarget(
D2D1::RenderTargetProperties(),
D2D1::HwndRenderTargetProperties(AppDesc._hWnd, size),
&pRenderTarget)
))
return false;
if (FAILED(pRenderTarget->CreateSolidColorBrush(
D2D1::ColorF(D2D1::ColorF::Black), &pDefaultBrush
))) return false;
if (FAILED(DWriteCreateFactory(
DWRITE_FACTORY_TYPE_SHARED,
__uuidof(pWriteFactory),
reinterpret_cast<IUnknown**>(&pWriteFactory))))
return false;
return true;
}
void DX2DApp::OnResize(UINT width, UINT height)
{
pRenderTarget->Resize(D2D1::SizeU(width, height));
}
void DX2DApp::ChangeColor(const COLORREF & color, float opacity)
{
UINT col = (((BYTE)GetBValue(color)) |
((WORD)((BYTE)GetGValue(color))) << 8 |
(((DWORD)(BYTE)(GetRValue(color))) << 16));
pDefaultBrush->SetColor(ColorF(col, opacity));
}
void DX2DApp::ChangeColor(const D2D1_COLOR_F & color)
{
pDefaultBrush->SetColor(color);
}
void DX2DApp::Release(void)
{
SafeRelease(pWriteFactory);
SafeRelease(pDefaultBrush);
SafeRelease(pRenderTarget);
SafeRelease(pDirect2dFactory);
}
void DX2DApp::BeginDraw(void)
{
if (pRenderTarget) {
pRenderTarget->BeginDraw();
pRenderTarget->SetTransform(D2D1::Matrix3x2F::Identity());
pRenderTarget->Clear(D2D1::ColorF(D2D1::ColorF::Gray));
}
}
void DX2DApp::EndDraw(void)
{
if (pRenderTarget)
pRenderTarget->EndDraw();
}
| [
"wowangki@gmail.com"
] | wowangki@gmail.com |
b6e56c114ae340b67c304b18490829ec25d48d44 | e5f74db2b079783fbf923826e3ee0d061849a889 | /Code/GraphicsAnalyse/saveimagedialog.h | 211caa6ae0e2696a30dd049c18a14ec3d91e528d | [
"BSD-3-Clause"
] | permissive | sunhan01/FastCAE | 57b6ba145864978ffcc57dd4721a17d4b6c350f8 | 4e9e9aa1cc076bc3ba5d7823fb61e5b0a9dc2e72 | refs/heads/master | 2023-02-12T14:56:52.414267 | 2021-01-11T05:43:42 | 2021-01-11T05:43:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 923 | h | #ifndef SAVEIMAGEDIALOG_H
#define SAVEIMAGEDIALOG_H
#include <QDialog>
#include "global.h"
#include "qfiledialog.h"
namespace Ui {
class saveImageDialog;
}
class saveImageDialog : public QDialog
{
Q_OBJECT
public:
explicit saveImageDialog(QWidget *parent = 0);
~saveImageDialog();
saveImage_prop get_saveImage_prop_data() { return saveImage_prop_data; };
void setImageSize(QSize tep_size);
private slots:
void on_saveImage_checkBox_clicked(bool checked);
void on_imagePath_pushButton_clicked();
void on_savePOV_checkBox_clicked(bool checked);
void on_povPath_pushButton_clicked();
void on_save_pushButton_clicked();
void on_close_pushButton_clicked();
void on_wid_lineEdit_textChanged(const QString &arg1);
void on_hei_lineEdit_textChanged(const QString &arg1);
private:
Ui::saveImageDialog *ui;
saveImage_prop saveImage_prop_data;
};
#endif // SAVEIMAGEDIALOG_H
| [
"libaojunqd@foxmail.com"
] | libaojunqd@foxmail.com |
6266a2cf723a107ac2a0e9172c09697638c37363 | 1677771f5ad8a70d8b7fab274d316d52a6925309 | /게임 엔진 폴더/Windows Version Engine tamplate/tamplate/game.cpp | 0f82018e8e69151730337762c2e4c9d3bb07843b | [
"Apache-2.0",
"CC-BY-3.0"
] | permissive | CRY-D/M.J_Physical_GameStudio_Engine | 5b9c7579656404291196757c883b8f45c19d97cc | 929d3c57549bfa960c0dc139846caf3c8b81903e | refs/heads/master | 2021-06-01T02:22:49.747546 | 2016-07-18T18:34:54 | 2016-07-18T18:34:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,884 | cpp | #include "game.h"
Game::Game()
{
input = new Input();
paused = false;
graphics = NULL;
audio = NULL;
console = NULL;
messageDialog = NULL;
inputDialog = NULL;
fps = 100;
fpsOn = false;
initialized = false;
}
Game::~Game()
{
deleteAll();
ShowCursor(true);
}
LRESULT Game::messageHandler( HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam )
{
if(initialized)
{
switch( msg )
{
case WM_DESTROY:
PostQuitMessage(0);
return 0;
case WM_KEYDOWN: case WM_SYSKEYDOWN:
input->keyDown(wParam);
return 0;
case WM_KEYUP: case WM_SYSKEYUP:
input->keyUp(wParam);
return 0;
case WM_CHAR:
input->keyIn(wParam);
return 0;
case WM_MOUSEMOVE:
input->mouseIn(lParam);
return 0;
case WM_INPUT:
input->mouseRawIn(lParam);
return 0;
case WM_LBUTTONDOWN:
input->setMouseLButton(true);
input->mouseIn(lParam);
return 0;
case WM_LBUTTONUP:
input->setMouseLButton(false);
input->mouseIn(lParam);
return 0;
case WM_MBUTTONDOWN:
input->setMouseMButton(true);
input->mouseIn(lParam);
return 0;
case WM_MBUTTONUP:
input->setMouseMButton(false);
input->mouseIn(lParam);
return 0;
case WM_RBUTTONDOWN:
input->setMouseRButton(true);
input->mouseIn(lParam);
return 0;
case WM_RBUTTONUP:
input->setMouseRButton(false);
input->mouseIn(lParam);
return 0;
case WM_XBUTTONDOWN: case WM_XBUTTONUP:
input->setMouseXButton(wParam);
input->mouseIn(lParam);
return 0;
case WM_MOUSEWHEEL:
input->mouseWheelIn(wParam);
return 0;
case WM_DEVICECHANGE:
input->checkControllers();
return 0;
}
}
return DefWindowProc( hwnd, msg, wParam, lParam );
}
void Game::initialize(HWND hw)
{
hwnd = hw;
graphics = new Graphics();
graphics->initialize(hwnd, GAME_WIDTH, GAME_HEIGHT, FULLSCREEN);
input->initialize(hwnd, false);
console = new Console();
console->initialize(graphics, input);
console->print("---Console---");
console->getVisible();
messageDialog = new MessageDialog();
messageDialog->initialize(graphics, input, hwnd);
inputDialog = new InputDialog();
inputDialog->initialize(graphics, input, hwnd);
if(dxFont.initialize(graphics, gameNS::POINT_SIZE, false, false, gameNS::FONT) == false)
throw(GameError(gameErrorNS::FATAL_ERROR, "Failed to initialize DirectX font."));
dxFont.setFontColor(gameNS::FONT_COLOR);
audio = new Audio();
if (*WAVE_BANK != '\0' && *SOUND_BANK != '\0')
{
if( FAILED( hr = audio->initialize() ) )
{
if( hr == HRESULT_FROM_WIN32( ERROR_FILE_NOT_FOUND ) )
throw(GameError(gameErrorNS::FATAL_ERROR, "Failed to initialize sound system because media file not found."));
else
throw(GameError(gameErrorNS::FATAL_ERROR, "Failed to initialize sound system."));
}
}
if(QueryPerformanceFrequency(&timerFreq) == false)
throw(GameError(gameErrorNS::FATAL_ERROR, "Error initializing high resolution timer"));
QueryPerformanceCounter(&timeStart);
initialized = true;
}
void Game::renderGame()
{
const int BUF_SIZE = 20;
static char buffer[BUF_SIZE];
if (SUCCEEDED(graphics->beginScene()))
{
render();
graphics->spriteBegin();
if(fpsOn)
{
_snprintf_s(buffer, BUF_SIZE, "fps %d ", (int)fps);
dxFont.print(buffer,GAME_WIDTH-100,GAME_HEIGHT-28);
}
graphics->spriteEnd();
console->draw();
messageDialog->draw();
inputDialog->draw();
graphics->endScene();
}
handleLostGraphicsDevice();
graphics->showBackbuffer();
}
void Game::handleLostGraphicsDevice()
{
hr = graphics->getDeviceState();
if(FAILED(hr))
{
if(hr == D3DERR_DEVICELOST)
{
Sleep(100);
return;
}
else if(hr == D3DERR_DEVICENOTRESET)
{
releaseAll();
hr = graphics->reset();
if(FAILED(hr))
return;
resetAll();
}
else
return;
}
}
void Game::setDisplayMode(graphicsNS::DISPLAY_MODE mode)
{
releaseAll();
graphics->changeDisplayMode(mode);
resetAll();
}
void Game::run(HWND hwnd)
{
if(graphics == NULL)
return;
QueryPerformanceCounter(&timeEnd);
frameTime = (float)(timeEnd.QuadPart - timeStart.QuadPart ) / (float)timerFreq.QuadPart;
if (frameTime < MIN_FRAME_TIME)
{
sleepTime = (DWORD)((MIN_FRAME_TIME - frameTime)*1000);
timeBeginPeriod(1);
Sleep(sleepTime);
timeEndPeriod(1);
return;
}
if (frameTime > 0.0)
fps = (fps*0.99f) + (0.01f/frameTime);
if (frameTime > MAX_FRAME_TIME)
frameTime = MAX_FRAME_TIME;
timeStart = timeEnd;
if (!paused)
{
update();
ai();
collisions();
input->vibrateControllers(frameTime);
}
renderGame();
if (input->getCharIn() == CONSOLE_KEY)
{
input->clearCharIn();
console->showHide();
paused = console->getVisible();
}
consoleCommand();
input->readControllers();
messageDialog->update();
inputDialog->update();
audio->run();
if (input->wasKeyPressed(VK_PAUSE))
paused = !paused;
input->clear(inputNS::KEYS_PRESSED);
}
void Game::consoleCommand()
{
command = console->getCommand();
if(command == "")
return;
if (command == "help")
{
console->print("Console Commands:");
console->print("fps - toggle display of frames per second");
return;
}
if (command == "fps")
{
fpsOn = !fpsOn;
if(fpsOn)
console->print("fps On");
else
console->print("fps Off");
}
}
void Game::releaseAll()
{
safeOnLostDevice(inputDialog);
safeOnLostDevice(messageDialog);
safeOnLostDevice(console);
dxFont.onLostDevice();
return;
}
void Game::resetAll()
{
dxFont.onResetDevice();
safeOnResetDevice(console);
safeOnResetDevice(messageDialog);
safeOnResetDevice(inputDialog);
return;
}
void Game::deleteAll()
{
releaseAll();
safeDelete(audio);
safeDelete(graphics);
safeDelete(input);
safeDelete(console);
safeDelete(messageDialog);
safeDelete(inputDialog);
initialized = false;
} | [
"jrcright1004@gmail.com"
] | jrcright1004@gmail.com |
29bda7e0d487dc2411fc34468e90a4f3fb102f79 | 31406f420f019a191a74b9288a6e37dcd89e8e82 | /tools/node-hermes/third-party/libuv/test/test-get-memory.c | 2396939bcb155749a4b033516fd08fc366c21f7f | [
"CC-BY-4.0",
"MIT",
"LicenseRef-scancode-unknown-license-reference",
"BSD-3-Clause",
"ISC",
"BSD-2-Clause"
] | permissive | facebook/hermes | b1bf3cb60b5946450c7c9a421ac8dad7a675e0f5 | 440578b31ecce46fcc5ba2ad745ffd5712d63a35 | refs/heads/main | 2023-09-06T04:16:02.263184 | 2023-09-05T20:12:54 | 2023-09-05T20:12:54 | 154,201,259 | 8,449 | 593 | MIT | 2023-09-14T21:25:56 | 2018-10-22T19:13:00 | C++ | UTF-8 | C++ | false | false | 1,529 | c | /* Copyright Joyent, Inc. and other Node contributors. All rights reserved.
*
* 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 "uv.h"
#include "task.h"
TEST_IMPL(get_memory) {
uint64_t free_mem = uv_get_free_memory();
uint64_t total_mem = uv_get_total_memory();
printf("free_mem=%llu, total_mem=%llu\n",
(unsigned long long) free_mem,
(unsigned long long) total_mem);
ASSERT(free_mem > 0);
ASSERT(total_mem > 0);
ASSERT(total_mem > free_mem);
return 0;
}
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
893a01de2e8c55050499ca30d5dff19d6fe76de1 | 2f9a425e8f5d034da4d35c9f941ff609cb232883 | /poj/3061/POJ_3061_2464921_AC_31MS_472K.cpp | 913964a4ecb45d63965778c292c8a87fdccc8587 | [] | no_license | wangyongliang/nova | baac90cd8e7bdb03c6c5916fbab9675dabf49af5 | 86b00b1a12f1cc6291635f31a33e791f6fb19d1a | refs/heads/master | 2022-02-18T05:35:02.447764 | 2019-09-08T02:22:06 | 2019-09-08T02:22:06 | 10,247,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 936 | cpp | #include<stdio.h>
#define maxx 1000009
long s,n;
int a[maxx];
int check(int mid)
{
int sum=0,i;
int t;
if(mid<=0) return 0;
for(i=0;i<mid;i++) sum+=a[i];
t=0;
if(sum>=s) return 1;
for(;i<n;i++)
{
sum=sum+a[i]-a[i-mid];
if(sum>=s) return 1;
}
return 0;
}
int main()
{
long max,min,i,sum,mid;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%ld%ld",&n,&s);
min=-1;
max=99999999;
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
max=max>a[i]?a[i]:max;
min=min<a[i]?a[i]:min;
sum+=a[i];
}
if(sum<s) printf("0\n");
else
{
max=s/max+1;
min=s/min-1;
if(max>n) max=n;
if(min<0) min=0;
while(min<max)
{
mid=(max+min)/2;
if(check(mid))
{
max=mid;
}
else
{
min=mid+1;
}
mid=(min+max)/2;
}
if(check(min-1)) printf("%ld\n",min-1);
else printf("%ld\n",min);
}
}
return 0;
} | [
"wangyongliang.wyl@gmail.com"
] | wangyongliang.wyl@gmail.com |
e366e84eab7cd9335149cb6cce38dbb420a8bf47 | 5c06c80bf21f7bb84bf8bc3dfdf5040ff2878a24 | /project3/src/cliente.cpp | ad273028516323168b1e06486350bd3baa08a959 | [] | no_license | joe-stifler/projects-network-programming | 77663bf355addd1ed917a8d29d73f4925b2cacfa | bf9a527b84ca0872517948b50b5afb097a982698 | refs/heads/master | 2023-02-12T21:33:02.446778 | 2021-01-11T00:39:01 | 2021-01-11T00:39:01 | 326,373,476 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,113 | cpp | #include <socket.h>
#define MAXLINE 4096
int main(int argc, char **argv) {
char recvline[MAXLINE + 1];
/*
Verificamos se o usuário passou o número correto de parâmetros
*/
if (argc != 3) {
char error[MAXLINE + 1];
strcpy(error,"uso: ");
strcat(error,argv[0]);
strcat(error," <IPaddress>");
strcat(error," <Port>");
perror(error);
exit(1);
}
/*
constrói o socket de endereço, definindo conexão do
tipo internet (AF_INET), assim como a porta de conexão
com o servidor
*/
sock::SocketAddr servaddr(AF_INET, atoi(argv[2]));
/* seta o endereço ip do servidor */
servaddr.setInAddress((char *) argv[1]);
/* cria um novo socket para realizar as requisições */
int sockfd = sock::Socket(AF_INET, SOCK_STREAM, 0);
/* conecta o socket criado ao servidor */
sock::Connect(sockfd, &servaddr);
/*
converte informações de porta e ip do servidor que estavam no padrão da rede (big-endian),
para o padrão local (little-endian)
*/
char *server_data = sock::sock_ntop((struct sockaddr *) &servaddr.addr, sizeof(servaddr.addr));
/* printa informações de ip e porta do servidor */
if (server_data != NULL) printf("Dados do socket do servidor remoto = %s\n", server_data);
/* busca informações de porta e ip do usuário local (cliente) */
sock::SocketAddr clientaddr = sock::getLocalInfo(sockfd);
/*
converte informações de porta e ip do cliente que estavam no padrão
da rede (big-endian), para o padrão local (little-endian)
*/
char *user_data = sock::sock_ntop((struct sockaddr *) &clientaddr.addr, sizeof(clientaddr.addr));
/* printa os dados de IP e porta do usuário local (cliente) */
if (user_data != NULL) printf("Dados do socket do usuário local = %s\n", user_data);
/* fica recebendo continuamente comandos do servidor,
até que a string 'exit' seja recebida */
sock::FetchCommands(sockfd, recvline, MAXLINE);
/* fecha a conexão com o servidor */
sock::Close(sockfd);
return 0;
}
| [
"joseribeiro1017@gmail.com"
] | joseribeiro1017@gmail.com |
52bc93ebbee2ddf4e8e2f98c83d22a34852f0426 | 842722cb14d254ead0dedd0e47dc8dd15ad82630 | /Sources/Scenes/SceneStructure.hpp | e9dbec16a663f21a621c18f691d75afb2b54e19e | [
"MIT"
] | permissive | chrisengelsma/Acid | ef70977a5dd11669cc6f9009e60c9c2bdafc6b3b | b45f3a437584c3820c532c6391a8442c4a32fdee | refs/heads/master | 2020-07-16T04:00:03.969624 | 2019-08-17T05:23:04 | 2019-08-17T05:23:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,571 | hpp | #pragma once
#include "Physics/Rigidbody.hpp"
#include "Entity.hpp"
namespace acid
{
/**
* @brief Class that represents a structure of spatial objects.
*/
class ACID_EXPORT SceneStructure :
public NonCopyable
{
public:
SceneStructure();
Entity *GetEntity(const std::string &name) const;
/**
* Creates a new entity.
* @return The newly created entity.
*/
Entity *CreateEntity();
/**
* Creates a new entity from a prefab.
* @param filename The file to load the component data from.
* @return The newly created entity.
*/
Entity *CreateEntity(const std::string &filename);
/**
* Adds a new object to the spatial structure.
* @param object The object to add.
*/
void Add(Entity *object);
/**
* Adds a new object to the spatial structure.
* @param object The object to add.
*/
void Add(std::unique_ptr<Entity> object);
/**
* Removes an object from the spatial structure.
* @param object The object to remove.
*/
void Remove(Entity *object);
/**
* Moves an object to another spatial structure.
* @param object The object to move.
* @param structure The structure to move to.
*/
void Move(Entity *object, SceneStructure &structure);
/**
* Removes all objects from the spatial structure.
*/
void Clear();
/**
* Updates all of the entity.
*/
void Update();
/**
* Gets the size of this structure.
* @return The structures size.
*/
uint32_t GetSize() const { return static_cast<uint32_t>(m_objects.size()); }
/**
* Gets a set of all objects in the spatial structure.
* @return The list specified by of all objects.
*/
std::vector<Entity *> QueryAll();
/**
* Gets a set of all objects in a spatial objects contained in a frustum.
* @param range The frustum range of space being queried.
* @return The list of all object in range.
*/
std::vector<Entity *> QueryFrustum(const Frustum &range);
//std::vector<Entity *> QuerySphere(const Vector3 ¢re, const Vector3 &radius);
//std::vector<Entity *> QueryCube(const Vector3 &min, const Vector3 &max);
/**
* Returns a set of all components of a type in the spatial structure.
* @tparam T The components type to get.
* @param allowDisabled If disabled components will be included in this query.
* @return The list specified by of all components that match the type.
*/
template<typename T>
std::vector<T *> QueryComponents(const bool &allowDisabled = false)
{
std::vector<T *> components;
for (auto it{m_objects.begin()}; it != m_objects.end(); ++it)
{
for (const auto &component : (*it)->GetComponents<T>())
{
if (component != nullptr && (component->IsEnabled() || allowDisabled))
{
components.emplace_back(component);
}
}
}
return components;
}
/**
* Gets the first component of a type found in the spatial structure.
* @tparam T The component type to get.
* @param allowDisabled If disabled components will be included in this query.
* @return The first component of the type found.
*/
template<typename T>
T *GetComponent(const bool &allowDisabled = false)
{
for (auto it{m_objects.begin()}; it != m_objects.end(); ++it)
{
auto component{(*it)->GetComponent<T>()};
if (component != nullptr && (component->IsEnabled() || allowDisabled))
{
return component;
}
}
return nullptr;
}
/**
* If the structure contains the object.
* @param object The object to check for.
* @return If the structure contains the object.
*/
bool Contains(Entity *object);
private:
std::vector<std::unique_ptr<Entity>> m_objects;
};
}
| [
"mattparks5855@gmail.com"
] | mattparks5855@gmail.com |
bc329a5bd21b20a5eec230293400f4ebf79811b1 | 1be2a958aeca42a2cdfa364ddbae98579b588dd1 | /day05/ex02/PresidentialPardonForm.hpp | a869ec26fe065ed88c604b0752ec80e4f7a4dbd7 | [] | no_license | arnauze/Piscine-CPP | 3f87e8bb2576a268198a015d10666e3a24bcc24a | c4779a3fae3d27e9f5374ea4fd786421c5de3e96 | refs/heads/master | 2020-08-27T04:10:18.311488 | 2019-11-04T22:58:23 | 2019-11-04T22:58:23 | 217,240,743 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 799 | hpp | #ifndef PRESIDENTIALPARDONFORM_HPP
# define PRESIDENTIALPARDONFORM_HPP
# include "Form.hpp"
# include "Bureaucrat.hpp"
class Bureaucrat;
class PresidentialPardonForm : public Form {
public:
PresidentialPardonForm(void);
PresidentialPardonForm(std::string target);
~PresidentialPardonForm(void);
PresidentialPardonForm(PresidentialPardonForm const & form);
PresidentialPardonForm &operator=(PresidentialPardonForm const & form);
void execute(Bureaucrat const & bureaucrat) const;
void setTarget(std::string const & target);
std::string getTarget(void) const;
private:
std::string target;
};
#endif | [
"arnauze@gmail.com"
] | arnauze@gmail.com |
9d0089e97fc7daceb92e4fdc177c42164602ec9e | 2a63f87ab5700f2f26432023419ed702c4a217c8 | /render.cpp | 7d2ecb9969bf9568aed8094c895228d65f893485 | [] | no_license | NeilMcGuiness/The-Pulse | 1b46112fb2923ec8180f92ef0faa4522a974f12f | b780b4ea0fda6aef8478bee2dac995ebb3f99b2a | refs/heads/master | 2021-01-25T14:32:54.753860 | 2019-04-05T08:22:53 | 2019-04-05T08:22:53 | 123,705,850 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,661 | cpp | /*
______ __ ____ __
/_ __// /_ ___ / __ \ __ __ / /_____ ___
/ / / __ \ / _ \ / /_/ // / / // // ___// _ \
/ / / / / // __/ / ____// /_/ // /(__ )/ __/
/_/ /_/ /_/ \___/ /_/ \__,_//_//____/ \___/
Developed on the....
____ _____ _ _
| __ )| ____| | / \
| _ \| _| | | / _ \
| |_) | |___| |___ / ___ \
|____/|_____|_____/_/ \_\
//%%%%%%%%%%%%%%%%% Coded by Neil Robert Mcguiness in 2017-2018 %%%%%%%%%%%%%%%
*/
#include <Bela.h>
#include <Midi.h>
#include <stdlib.h>
#include <rtdk.h>
#include <cmath>
#include <fstream>
#include <OSCServer.h>
#include <WriteFile.h>
#define MAX_ONSETS 8
#define MAX_COARSE_ONSETS 4
#define TRACK_MODE 1
#define TAP_MODE 0
//LED variables
bool LEDstate = false;
bool onFlag = false;
int LEDTimeOut = 0;
//-------------------
// System Status variables
static int status=GPIO_LOW;
static int pulseMode;
//-------------------------
// Onset, timeout and BPM adjustment variables
bool trig = false;
bool enoughTrackTaps = false;
bool enoughCoarseTaps = false;
bool enoughTaps = false;
int timeOutsamples;
int timeOutCount = 0;
int digitalSampleRate;
int count;
int tapCount = 0;
int coarseTaps = 0;
int sampleInterval; // miliseconds for the clock pulse (24 PPQN = Pulses per quater note)
int bpmIncrement;
int frames; // frames to count through so that the Bpm can be incremented every quater note.
int tapIndex = 0;
int onsetInd = 0;
float lastTap = 0.f;
float now;
float timer;
float oneMs;
float bpm = 120;
float movingBPM;
float gSamplingPeriod = 0;
float taps[4];
float onsets[MAX_ONSETS];
//--------------------------------
// Switching Flags ################################
bool coarseOn = false;
bool trackOn = false;
//--------------------------------
///%%%%% SENSOR LOGGING VARIABLES %%%%%%%%%%%%%%%%%
float seconds = 0.f;
float input = 0.f;
int measuredSamps = 0;
//--------------------------------
// Coarse Tempo variables
bool resetFlag = false;
int timerIndex = 0;
int samplesSinceLastTap = 0;
float timerArray[MAX_COARSE_ONSETS];
float averageIOI;
float msSinceLastTap = 0;
// -------------------
// Tempo Adjustment variables
int durationAsEighthNotes;
float tempoThreshold = 0.9;
float tempoStdDev = 50;
float alpha = 0.7; // system responisiveness (how fast tempo changes are made), I' making this 1.0 for now.
// -------------------
// Phase Sync variables
int beatPos = -1; // initialising as -1 until enough taps are reached
int beatOffset = 0;
float syncThreshold;
float syncStdDev = 50; // beggining with 50 ms.
float beta = 1.0; // similar to alpha but for the sync process.
float syncDelta;
float discrepencies[MAX_ONSETS];
float mostRecentMidiClickTime = 0;
float closestMidiClickTime = 0;
// -------------------
// Probability Weights
float tempoWeights[16] = {0.9, 1.0, 0.1, 1.0, 0.1, 0.1, 0.1, 0.8, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0}; // Duration in eight notes (2 is a quater note, 4 is a half note etc.)
float syncWeights[8] = {1.0, 0.1, 1.0, 0.4, 1.0, 0.4, 1.0, 0.4}; // Eighth note beats in the bar.
// -------------------
// Standard Metrical Divisions (ms)
// *** Will be recalulated upon tempo changes ****
float eightNote;
float quarterNote;
float halfNote;
float wholeNote;
// &&&&&&&&&&&&&&& Functions &&&&&&&&&&&&&&&&&&&&&&&
void tempoTrack();
void tempoAdjust();
void syncAdjust();
void calculateStandardNoteDivisions(float newBpm);
float gaussianTempo (float error);
float gaussianSync (float discrepency);
void discrepencyCalculation(float timeNow);
//----------------------------------
// Midi variables
Midi midi;
const char* gMidiPort0 = "hw:1,0,0";
//----------------------------------
// &&&&&&&&&&&& SETUP %%%%%%%%%%%%%%%%%%%%%
bool setup(BelaContext *context, void *userData)
{
midi.readFrom(gMidiPort0);
midi.writeTo(gMidiPort0);
midi.enableParser(true);
oneMs = context->audioSampleRate / 1000.0;
digitalSampleRate = context->digitalSampleRate;
calculateStandardNoteDivisions(bpm);
for(int t = 0; t < 4; t ++) // Resetting the timer array to null.
{
timerArray[t] = 0.0;
}
if(context->analogFrames == 0)
{
rt_printf("Error: this example needs the analog I/O to be enabled\n");
return false;
}
if(context->audioOutChannels < 2 ||
context->analogOutChannels < 2)
{
printf("Error: for this project, you need at least 2 analog and audio output channels.\n");
return false;
}
gSamplingPeriod = 1.0 /context->audioSampleRate;
sampleInterval = ((60000 / bpm) / 24) * 44.1; // equation to determine the miliseconds needed per pulse.
// ...Because Midi clock needs 24 pulses per quaternote (PPQ)
// then I multiply by 44.1 to give the result in samples.
// midi_byte_t startByte = 250;
// midi.writeOutput(startByte);
pinMode(context, 0, P8_07, OUTPUT); // LED for TAP_MODE
pinMode(context, 0, P8_08, INPUT); // footswitch
pinMode(context, 0, P8_09, OUTPUT); // LED for TRACK_MODE
return true;
}
// %%%%%%% RENDER LOOP %%%%%%%%%%%%%%%%%%%%%
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
void render(BelaContext *context, void *userData)
{
for(unsigned int n = 0; n < context->analogFrames; n++)
{
float piezo = analogRead(context, n, 6); // reading the piezo value to detect Kick onsets..
samplesSinceLastTap++;
msSinceLastTap = (samplesSinceLastTap / context->audioSampleRate) * 1000.0;
seconds = context->audioFramesElapsed / context->audioSampleRate;
pulseMode = digitalRead(context, 0, P8_08); // Reading the state of the footswitch.
if(pulseMode == TAP_MODE)
{
if(coarseOn == false)
{
coarseOn = true;
coarseTaps = 0;
trackOn = false;
digitalWrite(context, n, P8_09, 0);
tapCount = 0;
enoughCoarseTaps = false;
}
}
else if(pulseMode == TRACK_MODE)
{
if(trackOn == false)
{
trackOn = true;
coarseOn = false;
digitalWrite(context, n, P8_07, 0);
}
}
if(trig == true)
{
timeOutCount++;
}
if(msSinceLastTap >= 4000.0 && resetFlag == false) // Been a long time since recent onset so will start the process of collecting onsets and comparing again.
{
resetFlag = true;
tapCount = 0;
timerIndex = 0;
beatPos = -1;
enoughTrackTaps = false;
enoughCoarseTaps = false;
enoughTaps = false;
status = GPIO_HIGH;
if(pulseMode == TAP_MODE)
{
digitalWrite(context, n, P8_07, status); //Switching LED back on to indicate no Tempo Tracking.
}
else if (pulseMode == TRACK_MODE)
{
digitalWrite(context, n, P8_09, status);
}
rt_printf("TOO LONG SINCE LAST TAP, RESET\n");
for(int t = 0; t < 4; t ++) // Resetting the timer array to null.
{
timerArray[t] = 0.0;
}
}
if(piezo > 0.3) // ONSET DETECTED.
{
if(trig == false) // if not already triggered.
{
msSinceLastTap = 0;
samplesSinceLastTap = 0;
trig = true;
resetFlag = false;
now = (context->audioFramesElapsed / context->audioSampleRate) * 1000; // getting the time NOW (* 1000 for ms?).
timer = now - lastTap; // working out difference between now and the last tap.
lastTap = now; // updating the last tap to THIS tap.
onsets[onsetInd] = now; // placing onset CPU time in ring buffer.
onsetInd = (onsetInd + 1) % MAX_ONSETS; // incrementing and wrapping around.
tapCount ++;
float summedIOI = 0.0;
int elapsedTaps = tapCount;
if(tapCount > MAX_COARSE_ONSETS)
{
elapsedTaps = MAX_COARSE_ONSETS;
}
timerArray[timerIndex] = timer;
timerIndex = (timerIndex + 1) % MAX_COARSE_ONSETS;
for(int i = 0; i < MAX_COARSE_ONSETS; i ++) // Obtaining average IOI time between quarter pulses.
{
summedIOI += timerArray[i];
}
averageIOI = summedIOI / elapsedTaps; // Calculating the Coarse BPM assesmnt at this stage.
if(tapCount >= 5) // If we have enough relevent recent onsets to compare to then we will execute the algorithm.
{
// execute the main algorithms.
if(pulseMode == TRACK_MODE)
{
syncAdjust();
tempoAdjust();
enoughTrackTaps = true;
}
else if (pulseMode == TAP_MODE)
{
bpm = 60000 / averageIOI;
sampleInterval = ((60000 / bpm) / 24) * 44.1;
calculateStandardNoteDivisions(bpm);
rt_printf("TAP ADJUSTMENT, BPM estimate = %f\n", bpm);
enoughCoarseTaps = true;
}
if(enoughTaps == false)
{
enoughTaps = true;
midi_byte_t startByte = 250;
midi.writeOutput(startByte);
rt_printf("MIDI START MESSAGE\n");
}
}
else if (tapCount < 5)
{
if(pulseMode == TRACK_MODE)
{
bpm = 60000 / timer; // or / timer?
sampleInterval = ((60000 / bpm) / 24) * 44.1;
calculateStandardNoteDivisions(bpm);
rt_printf("Coarse ADJUSTMENT, BPM estimate = %f\n", bpm);
}
}
} // End of piezo trigger brace.
} // End of piezo threshold brace.
if (piezo < 0.05) // Setting up for retriggering if fallen below the low threshold.
{
if (trig == true && timeOutCount > 5000 ) // if it has been triggered and Timeout is completed then untrigger it.
{
trig = false;
timeOutCount = 0;
}
}
}
for(unsigned int n=0; n<context->digitalFrames; n++) // LED handling section.
{
if(pulseMode == TRACK_MODE)
{
if(enoughTrackTaps) // If enough taps then we have a BPM estimate and can start tempo tracking.
{
if (onFlag) // This is triggered every quarter note (in the audio frames loop)
{
if(status == GPIO_LOW)
{
status=GPIO_HIGH; // Switch Light on to coincide with quarternote pulse.
digitalWrite(context, n, P8_09, status); //write the status to the LED
}
timeOutCount++;
if(timeOutCount == timeOutsamples)
{
status=GPIO_LOW; // Switch LED off after timeout phase.
digitalWrite(context, n, P8_09, status); //write the status to the LED
timeOutCount = 0;
onFlag = false;
}
}
}
else // If not enough taps then LED is steadily on just to show signs of life.
{
status = GPIO_HIGH; // Switch Light on to coincide with quarternote pulse.
digitalWrite(context, n, P8_09, status); //write the status to the LED
}
}
else if (pulseMode == TAP_MODE)
{
if(enoughCoarseTaps) // If enough taps then we have a BPM estimate and can start tempo tracking.
{
if (onFlag) // This is triggered every quarter note (in the audio frames loop)
{
if(status == GPIO_LOW)
{
status=GPIO_HIGH; // Switch Light on to coincide with quarternote pulse.
digitalWrite(context, n, P8_07, status); //write the status to the LED
}
timeOutCount++;
if(timeOutCount == timeOutsamples)
{
status=GPIO_LOW; // Switch LED off after timeout phase.
digitalWrite(context, n, P8_07, status); //write the status to the LED
timeOutCount = 0;
onFlag = false;
}
}
}
else // If not enough taps then LED is steadily on just to show signs of life.
{
status = GPIO_HIGH; // Switch Light on to coincide with quarternote pulse.
digitalWrite(context, n, P8_07, status); //write the status to the LED
}
}
}
for(unsigned int n = 0; n < context->audioFrames; n++)
{
count ++; // count up each sample.
if(!(count % (int)(oneMs * eightNote))) // Every EighthNote.
{
mostRecentMidiClickTime = (context->audioFramesElapsed / context->audioSampleRate) * 1000; // Getting the time NOW.
if(enoughTrackTaps)
{
beatPos ++;
if(beatPos > 7)
{
beatPos = 0;
}
}
}
if(!(count % sampleInterval)) // when the samplecount reaches the calculated number to represent a 24th of a quater pulse.
{
midi_byte_t clockPulse = 248; // Midi byte is set to decimal 248 (Midid devices recognise this as clock pulse)
midi.writeOutput(clockPulse); // Send the pulse to the device.
frames ++; // increment the number of frames
if (frames == 24) // when we've reached a whole quaternote
{
frames = 0;
onFlag = true;
}
}
}
}
// cleanup() is called once at the end, after the audio has stopped.
// Release any resources that were allocated in setup().
void cleanup(BelaContext *context, void *userData)
{
midi_byte_t stopByte = 252;
midi.writeOutput(stopByte);
}
// The main tempo tracking algorithm, called from the main thread when an onset is detected (with enough recent onsets to be relevent).
void tempoAdjust()
{
float IOIs[MAX_ONSETS];
float PEs[MAX_ONSETS];
float summedPEs = 0;
float PEsMean;
float PEsCumDifs = 0;
int periodDurations[MAX_ONSETS];
float accuracies[MAX_ONSETS];
int mostRecent;
float tempoDelta = 0.f;
float oldBpm;
if(onsetInd == 0)
{
mostRecent = MAX_ONSETS - 1;
}
else
{
mostRecent = (onsetInd - 1) % MAX_ONSETS;
}
for(int k = 0; k < MAX_ONSETS; k ++) // processing For Loop.
{
// Getting IOI between current and older onsets. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
int newIndex = (onsetInd + k) % MAX_ONSETS; // Logic to get the other onsets from oldest to newest.
IOIs[k] = onsets[mostRecent] - onsets[newIndex];
rt_printf("IOI[%d] = %f (now = %f) - ('Then' = %f) \n", k, IOIs[k],onsets[mostRecent], onsets[newIndex]);
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Classifying the IOI as a regular period Duration (in eighth notes) @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
periodDurations[k] = round(IOIs[k] / eightNote); // the round function gives us the closest regular duration that the IOI represents (in eigthnotes).
//@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
// Determining the Performance Error between the actual IOI and the regular duration it is closest to.
// &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
PEs[k] = IOIs[k] - (periodDurations[k] * eightNote);
summedPEs += PEs[k];
//&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
// Calculating overall accuracy **********************************************************
/* Accuracy is determined by feeding the performance error of the IOI (between current and kth previous onset)
Into a Gaussian window and then scaling this result with a weight dependent on the determined periodDuration */
if(periodDurations[k] < 16 && periodDurations[k] > 0)
{
accuracies[k] = gaussianTempo(PEs[k]) * tempoWeights[periodDurations[k] - 1]; // -1 because the first index of tempoWeights[] should represent 1 eighth note and not 0 eighth notes.
}
else
{
accuracies[k] = 0.f;
}
// *****************************************************************************************
rt_printf("periodDuration[%d] = %d PE[%d] = %f \n Accuracy[%d] = %f Gaussian result = %f Tempoweight[%d] = %.2f\n", k, periodDurations[k], k, PEs[k], k, accuracies[k], gaussianTempo(PEs[k]), periodDurations[k] -1, tempoWeights[periodDurations[k] - 1]);
} // End of processing For Loop
PEsMean = fabs(summedPEs / (MAX_ONSETS - 1));
// Finding Most accurate "winning" IOI. (minimum Performance error)
int win = 0; // This is the winningIndex.
float mostAccurate = accuracies[0];
for (int i = 0; i < MAX_ONSETS - 1; i++) // IS THE -1 NECESSARY?
{
if(accuracies[i] > mostAccurate && accuracies[i] <= 1.0 && periodDurations[i] != 0 && periodDurations[i] < 16) // Second part of condition is to ensure that the closest period duration is not 0.
{
mostAccurate = accuracies[i];
win = i;
}
PEsCumDifs += powf((PEs[i] - PEsMean), 2);
}
// rt_printf("Winning Onset = %d with accuracy %f\n", win, mostAccurate);
//Finally compare the most accuracies to the threshold and if its close enough then we update the tempo!
if (mostAccurate > tempoThreshold)
{
// This is how much the tempo needs to change and is determined by using the winning IOI data.
tempoDelta = alpha * gaussianTempo(PEs[win]) * tempoWeights[periodDurations[win] - 1] * (PEs[win] / (periodDurations[win]));
if (mostAccurate >= tempoThreshold + 0.1) // If most accurate is over the threshold AND the headroom then update the threshold.
{
tempoThreshold = tempoThreshold + (0.3 * (mostAccurate - tempoThreshold - 0.1));
if(tempoThreshold > 0.99)
{
tempoThreshold = 0.99;
}
}
}
else if (mostAccurate <= tempoThreshold) // If the most accurate is less than the threshold then we lower the threshold.
{
tempoThreshold *= 0.6;
if(tempoThreshold < 0.2)
{
tempoThreshold = 0.2;
}
tempoDelta = 0.f;
}
oldBpm = bpm;
bpm = bpm + ((tempoDelta * -1.0) + syncDelta); // This is where the Bpm/tempo is updated. If in sync then the syncDelta variable will be 0.
if(bpm < 60.f) // constraining the bpm extremes.
{
bpm = 60.f;
}
if(bpm > 240.f)
{
bpm = 240.f;
}
calculateStandardNoteDivisions(bpm);
sampleInterval = ((60000 / bpm) / 24) * 44.1; // Calculating how many samples for the Midi Pulse (24 pulses per quarterNote).
rt_printf("TRACK ADJUSTMENT Bpm = %f newBpm = %f\n", oldBpm, bpm);
rt_printf("Tempo Threshold = %f TempoStdDev = %f TempoDelta = %f\n", tempoThreshold, tempoStdDev,tempoDelta);
// // And the final parameter to update is the tempoStdDev which pivots around an equilibrium point of 0.7..
tempoStdDev = fabs(PEsCumDifs / PEsMean);
tempoStdDev = tempoStdDev * (1 + ((0.7 * tempoWeights[periodDurations[win]]) - mostAccurate));
if(tempoStdDev > 2000.0)
{
tempoStdDev = 2000.0;
}
} // End of Tempo Process.
void syncAdjust()
{
float discrepency;
float proximityToExpected;
float discrepencySum = 0;
float discrepencyMean = 0;
float discrepencyCumDifs = 0;
int newBeatPos = (beatPos + beatOffset) % sizeof(syncWeights);
discrepency = now - closestMidiClickTime;
discrepencies[onsetInd] = discrepency;
if (fabs(discrepency) < 100) // If within 100 ms of an expected Beat.
{
proximityToExpected = gaussianSync(discrepency) * syncWeights[newBeatPos];
// If the onset is close to the expected beat (but not so close!) then we syncronise.
if (proximityToExpected > syncThreshold && proximityToExpected < (syncThreshold + 0.1))
{
syncDelta = (((gaussianSync(discrepency) + beta) / (beta + 1)) * gaussianSync(discrepency) * syncWeights[newBeatPos] * discrepency);
}
else if (proximityToExpected > (syncThreshold + 0.1)) // We are close enough to the beat so no need for Sync.
{
syncDelta = 0; // reset the sync amount to 0 so that it does not affect the tempo adjustment.
// Raise the threshold.
syncThreshold = syncThreshold + (0.3 * (proximityToExpected - syncThreshold - 0.1));
// syncStdDev *= 0.9; // Narrowing the gaussian window (GUESSWORK VARIABLE AT THIS STAGE)
}
else if (proximityToExpected < syncThreshold)
{
// lower the threshold (closer to the threshold has a more dramatic effect)
syncThreshold = syncThreshold * (1 - gaussianSync(discrepency));
// syncStdDev *= 1.3; // Widening the gaussian window (GUESSWORK VARIABLE AT THIS STAGE)
}
}
for(int k = 0; k < MAX_ONSETS; k ++)
{
discrepencySum += discrepencies[k];
}
discrepencyMean = discrepencySum / MAX_ONSETS;
for(int k = 0; k < MAX_ONSETS; k ++)
{
discrepencyCumDifs += powf((discrepencies[k] - discrepencyMean), 2);
}
if (tapCount > MAX_ONSETS) // only update when we have a large enough dataset.
{
syncStdDev = discrepencyCumDifs/discrepencyMean;
}
}
void calculateStandardNoteDivisions(float newBpm)
{
quarterNote = 60000 / bpm;
eightNote = quarterNote / 2;
halfNote = quarterNote * 2;
wholeNote = quarterNote * 4;
timeOutsamples = ((digitalSampleRate / 1000) * quarterNote) / 4;
}
float gaussianSync (float discrepency)
{
float exponent = (std::pow((discrepency), 2) / (2 * syncStdDev)) * -1; // Don't need to square standardDev as the variance (squared StdDev) is calculated from dataset.
return std::exp(exponent);
}
float gaussianTempo (float error)
{
float exponent = (std::pow((error), 2) / (2 *tempoStdDev)) * -1;
return std::exp(exponent);
}
void discrepencyCalculation(float timeNow)
{
float timeElapsedSinceLastMidiClick = timeNow - mostRecentMidiClickTime;
if (timeElapsedSinceLastMidiClick > (eightNote / 2))
{
closestMidiClickTime = mostRecentMidiClickTime + eightNote;
beatOffset = 1;
}
else
{
closestMidiClickTime = mostRecentMidiClickTime;
beatOffset = 0;
}
}
// End Project -
//%%%%%%%%%%%%%%%%% Coded by Neil Robert Mcguiness in 2017-2018 %%%%%%%%%%%%%%% | [
"root@bela.(none)"
] | root@bela.(none) |
44f8e3e032f09e312324ff0b672f31649d1df38b | 576aeef2666d012417ea5ddd01e7e66f489dada0 | /Osipov_Vadim_301_Midpoint/Engine/Engine/Core/Physics/Implementation/SDLCollisionSystem.h | 94d6b779ae5978527b0e2244af7ede2446a9c71b | [] | no_license | aauVadim/2d_game_engine | 7af314a38e8bb9bd259275f976137968e90f7339 | 4cc0c9fe461767fc95a962b788c0adcdef35a3fe | refs/heads/master | 2022-12-19T11:17:15.540002 | 2020-09-28T22:05:24 | 2020-09-28T22:05:24 | 299,441,909 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 480 | h | #pragma once
#include "../PhysicsSystem.h"
#include <SDL.h>
class Object;
class SDLCollisionSystem : public PhysicsSystem
{
public:
virtual bool CheckObjectCollision(const Object* pLeft, const Object* pRight) override;
//Not Used
virtual void AddGOWithMovementComponent(MovementComponent*) override { }
virtual void Update() override { }
virtual bool CheckObjectCollision(int posX, int posY, int height, int width, const Object* pRight) override;
}; | [
"vadimosipov45@gmail.com"
] | vadimosipov45@gmail.com |
28142f28e19c013e37d0a8b60259043c55877a7c | e03b95d48cb4810f600ff67bfadbb7a0bfc04402 | /DataMgr.h | 257878af0b147da85e77e62cdae2f227607415c4 | [] | no_license | LeeHyunMyung/ProjectV | 7257e285e71f689d9c1f43c7a4be89188f83ebab | 0831e3f6a0c3d86fb743a9e31bcf5a2fd91f2772 | refs/heads/master | 2020-06-13T10:52:59.628637 | 2017-02-03T08:01:37 | 2017-02-03T08:01:37 | 75,389,455 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,321 | h |
#ifndef __C_DATA_MGR__
#define __C_DATA_MGR__
#include <iostream>
#include "CCSVParse.h"
#include "Unit.h"
using namespace std;
class DataMgr
{
private:
CCSVParse * mData;
DataMgr()
{
mData = new CCSVParse();
mData->openFile("UnitData.csv",DbData);
};
DataMgr(const DataMgr& other);
static DataMgr* instance;
string DbData[MAXUNIT_SZIE][PARAMETER_SIZE];
public:
static DataMgr* GetInstance()
{
if (instance == 0)
{
instance = new DataMgr();
}
return instance;
}
void SaveUnitData(Unit* unit)
{
for (int unitszie = 0; unitszie < MAXUNIT_SZIE; unitszie++)
{
if (DbData[unitszie][0] == "Empty")
{
for (int parametersize = 0; parametersize < PARAMETER_SIZE - 2; parametersize++)
{
DbData[unitszie][parametersize] = IntToString(unit->GetParameters()[parametersize]);
}
DbData[unitszie][PARAMETER_SIZE - 1] = '\n';
DbData[unitszie][PARAMETER_SIZE - 2] = '\r';
break;
}
}
mData->SaveDataBase("UnitData.csv", DbData);
}
void SaveUnitData()
{
mData->SaveDataBase("UnitData.csv", DbData);
}
string IntToString(int number)
{
std::ostringstream convStream;
convStream << number;
return convStream.str();
}
int StringToInt(string ctr)
{
return stoi(ctr);
}
};
DataMgr* DataMgr::instance = nullptr;
#endif
| [
"jun5640@gmail.com"
] | jun5640@gmail.com |
02f5721c519bd47a722069dc8837169edc54e03f | 948f4e13af6b3014582909cc6d762606f2a43365 | /testcases/juliet_test_suite/testcases/CWE127_Buffer_Underread/s01/CWE127_Buffer_Underread__CWE839_fgets_62a.cpp | c6049a20f7592c0868df5700c886475d19073558 | [] | no_license | junxzm1990/ASAN-- | 0056a341b8537142e10373c8417f27d7825ad89b | ca96e46422407a55bed4aa551a6ad28ec1eeef4e | refs/heads/master | 2022-08-02T15:38:56.286555 | 2022-06-16T22:19:54 | 2022-06-16T22:19:54 | 408,238,453 | 74 | 13 | null | 2022-06-16T22:19:55 | 2021-09-19T21:14:59 | null | UTF-8 | C++ | false | false | 3,373 | cpp | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE127_Buffer_Underread__CWE839_fgets_62a.cpp
Label Definition File: CWE127_Buffer_Underread__CWE839.label.xml
Template File: sources-sinks-62a.tmpl.cpp
*/
/*
* @description
* CWE: 127 Buffer Underread
* BadSource: fgets Read data from the console using fgets()
* GoodSource: Non-negative but less than 10
* Sinks:
* GoodSink: Ensure the array index is valid
* BadSink : Improperly check the array index by not checking to see if the value is negative
* Flow Variant: 62 Data flow: data flows using a C++ reference from one function to another in different source files
*
* */
#include "std_testcase.h"
namespace CWE127_Buffer_Underread__CWE839_fgets_62
{
#ifndef OMITBAD
/* bad function declaration */
void badSource(int &data);
void bad()
{
int data;
/* Initialize data */
data = -1;
badSource(data);
{
int buffer[10] = { 0 };
/* POTENTIAL FLAW: Attempt to access a negative index of the array
* This check does not check to see if the array index is negative */
if (data < 10)
{
printIntLine(buffer[data]);
}
else
{
printLine("ERROR: Array index is too big.");
}
}
}
#endif /* OMITBAD */
#ifndef OMITGOOD
/* goodG2B uses the GoodSource with the BadSink */
void goodG2BSource(int &data);
static void goodG2B()
{
int data;
/* Initialize data */
data = -1;
goodG2BSource(data);
{
int buffer[10] = { 0 };
/* POTENTIAL FLAW: Attempt to access a negative index of the array
* This check does not check to see if the array index is negative */
if (data < 10)
{
printIntLine(buffer[data]);
}
else
{
printLine("ERROR: Array index is too big.");
}
}
}
/* goodB2G uses the BadSource with the GoodSink */
void goodB2GSource(int &data);
static void goodB2G()
{
int data;
/* Initialize data */
data = -1;
goodB2GSource(data);
{
int buffer[10] = { 0 };
/* FIX: Properly validate the array index and prevent a buffer underread */
if (data >= 0 && data < (10))
{
printIntLine(buffer[data]);
}
else
{
printLine("ERROR: Array index is out-of-bounds");
}
}
}
void good()
{
goodG2B();
goodB2G();
}
#endif /* OMITGOOD */
} /* close namespace */
/* Below is the main(). It is only used when building this testcase on
its own for testing or for building a binary to use in testing binary
analysis tools. It is not used when compiling all the testcases as one
application, which is how source code analysis tools are tested. */
#ifdef INCLUDEMAIN
using namespace CWE127_Buffer_Underread__CWE839_fgets_62; /* so that we can use good and bad easily */
int main(int argc, char * argv[])
{
/* seed randomness */
srand( (unsigned)time(NULL) );
#ifndef OMITGOOD
printLine("Calling good()...");
good();
printLine("Finished good()");
#endif /* OMITGOOD */
#ifndef OMITBAD
printLine("Calling bad()...");
bad();
printLine("Finished bad()");
#endif /* OMITBAD */
return 0;
}
#endif
| [
"yzhang0701@gmail.com"
] | yzhang0701@gmail.com |
fb28eee32320386d9dfa35c104d267d5662d4723 | 83de818a52e07238737dcef330fc65345ae8a9d7 | /Projects/Aimbooster/src/Target.h | ec33edfeaca66faff124d6c4f981df61540e2931 | [] | no_license | Totomosic/BoltProjects | 223b89db4c7c29ca8e85bceab1d21cccc0a07728 | 2eb366dad3f9eca005a456368e8fabfdc086e051 | refs/heads/master | 2021-07-04T15:38:20.709386 | 2019-12-28T12:58:31 | 2019-12-28T12:58:31 | 224,946,235 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 458 | h | #pragma once
#include "BoltEngine.h"
using namespace Bolt;
namespace Aimbooster
{
class Target : public Component
{
public:
float Lifetime;
float StartingSize;
float MaxSize;
float CurrentTime;
float CurrentSize;
ObjectFactory* Factory;
bool Paused;
public:
Target(float lifetime, float maxSize, ObjectFactory* factory);
void Start() override;
void Update() override;
std::unique_ptr<Component> Clone() const override;
};
} | [
"jordan.thomas.morrison@gmail.com"
] | jordan.thomas.morrison@gmail.com |
c2789c924af245215a4f7e0381806f3ef72fdf49 | 0c9f69ca87a491732bbff480b5bbd932e5851b55 | /Leetcode/40/40/40.cpp | 6068bc50da6d9dfb1cf9d8080a78cd7c64971f00 | [] | no_license | FFFFFUNKYMUZIK/alg_practice | 3377a191d80471d6c9808b2180c0970d9d8a02db | e6e0bd5f9a583e6d7956666ea62e89b6fc64b121 | refs/heads/master | 2021-07-13T06:42:59.239925 | 2021-06-14T02:00:25 | 2021-06-14T02:00:25 | 248,436,575 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,989 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<vector<int>> ret;
void backtrack(vector<int>& cand, vector<int> candcnt, int s, vector<int>& bucket, int left) {
if (left == 0) {
ret.push_back(bucket);
}
for (int i = s; i < cand.size(); i++) {
if (left >= cand[i]) {
int cnt = 0;
while (left >= cand[i] && candcnt[i] > 0) {
cnt++;
bucket.push_back(cand[i]);
left -= cand[i];
candcnt[i]--;
backtrack(cand, candcnt, i + 1, bucket, left);
}
left += cnt * cand[i];
candcnt[i] += cnt;
while (cnt > 0) {
bucket.pop_back();
cnt--;
}
}
else {
break;
}
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>>().swap(ret);
vector<int> bucket;
sort(candidates.begin(), candidates.end());
vector<int> cand;
vector<int> candcnt;
int i = 0;
while (i < candidates.size()) {
int cnt = 1;
while (i < candidates.size() - 1 && candidates[i] == candidates[i + 1]) {
i++;
cnt++;
}
cand.push_back(candidates[i]);
candcnt.push_back(cnt);
i++;
}
backtrack(cand, candcnt, 0, bucket, target);
return ret;
}
};
int main()
{
Solution sol;
vector<vector<int>> ret;
vector<int> in;
int target;
in = vector<int>({10,1,2,7,6,1,5});
target = 8;
ret = sol.combinationSum2(in, target);
in = vector<int>({ 2,5,2,1,2 });
target = 5;
ret = sol.combinationSum2(in, target);
return 0;
}
| [
"pf7@naver.com"
] | pf7@naver.com |
6afb0c700213ef2e67519b3da05d938199415249 | 5cb369854f0cb24c351d0fc096fcb7d51642f4bb | /URI/Whose Turn Is It.cpp | 9c152dc81cca1dd66be6b21ac7cc56fefc35132d | [] | no_license | sebas095/Competitive-Programming | 3b0710bf76c04f274a67527888fc81dd6ddb9c6f | 0631caca5b10019f44212588ea16dbfc59c42f53 | refs/heads/master | 2021-05-24T00:56:51.945526 | 2020-07-07T06:46:42 | 2020-07-07T06:46:42 | 45,226,584 | 0 | 2 | null | 2016-10-28T16:26:50 | 2015-10-30T03:19:53 | C++ | UTF-8 | C++ | false | false | 534 | cpp | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl '\n'
using namespace std;
int main() {
fast;
int qt, n, m;
string name1, turn1, name2, turn2;
cin >> qt;
while (qt--) {
cin >> name1 >> turn1 >> name2 >> turn2;
cin >> n >> m;
n += m;
if (n & 1) {
if (turn1 == "IMPAR") cout << name1 << endl;
else cout << name2 << endl;
}
else {
if (turn1 == "PAR") cout << name1 << endl;
else cout << name2 << endl;
}
}
return 0;
}
| [
"sebas_tian_95@hotmail.com"
] | sebas_tian_95@hotmail.com |
cb34bcec7c2e6b8133a9035ac5dcc40fb52e3752 | 1df5dce64969b1cc0dbe3196768c6084b7e304e5 | /Chapter6_Singleton/Singleton.cpp | b88ac0179ad07e30f491f4dd570bfc87ae96be83 | [
"MIT"
] | permissive | sadrux/Modern-C-Design | 740f6752d71ab7191b5db120ae3c5b10b8aa3800 | 66eae3118dc56750312deb9d643d10ca7d97204a | refs/heads/master | 2020-04-13T15:47:18.903880 | 2017-06-18T21:48:05 | 2017-06-18T21:48:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,036 | cpp | #include "Singleton.h"
#include <assert.h>
template
<
class T,
template <class> class CreationPolicy,
template <class> class LifetimePolicy
>
T& SingletonHolder<T, CreationPolicy, LifetimePolicy>::Instance()
{
if (!m_instance)
{
//TODO: Thread guard
if (!m_instance)
{
if (m_destroyed)
{
LifetimePolicy<T>::OnDeadReference();
m_destroyed = false;
}
m_instance = CreationPolicy<T>::Create();
LifetimePolicy<T>::ScheduleDestruction(&DestorySingleton);
}
}
return m_instance;
}
template
<
class T,
template <class> class CreationPolicy,
template <class> class LifetimePolicy
>
void SingletonHolder<T, CreationPolicy, LifetimePolicy>::DestorySingleton()
{
assert(m_destroyed);
CreationPolicy<T>::Destroy(m_instance);
m_destroyed = true;
}
template
<
class T,
template <class> class C,
template <class> class L
>
T* SingletonHolder<T, C, L>::m_instance = 0;
template
<
class T,
template <class> class C,
template <class> class L
>
bool SingletonHolder<T, C, L>::m_destroyed = false;
| [
"zgarapetian@gmail.com"
] | zgarapetian@gmail.com |
301fa8d6579072678b4bce26a6d15b6505375605 | ddaafc09ff8d79dfdc8665a443d6332a73632e2e | /main_page.h | 73b0c1a35097956d56d959ecedee9ce050d6b5b9 | [] | no_license | alexman111/3DPoints-Visualization | 5e6d64f3ffdb808a935cafff5bc78cd5ecef5697 | e40595de35bb89c7872c55200ad9ed7d3bce7fe8 | refs/heads/master | 2022-11-20T15:18:18.143683 | 2020-07-26T06:36:00 | 2020-07-26T06:36:00 | 282,052,136 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 500 | h | #pragma once
#include <QWidget>
#include<QPushButton>
#include <QApplication>
#include <QVBoxLayout>
#include <QHBoxLayout>
#include <QGridLayout>
#include <QFileDialog>
#include <QLabel>
#include "points_generator.h"
#include "viewer.h"
class MainPage : public QWidget
{
Q_OBJECT
public:
MainPage(QWidget *parent = nullptr);
~MainPage();
private slots:
void OnGenerate();
void OnChoice();
void OnDraw();
private:
QString filename;
Viewer *v;
QLabel *lbl;
};
| [
"alexkrivosheev111@gmail.com"
] | alexkrivosheev111@gmail.com |
aab95ed1382e7f88ce0860691f81c16b479f0f01 | a4d846e8a149f5ab1b7f45d6f9538efab23756df | /Documentation/C - Code (MikroElektronika)/M - MBED Backups/1_Senior_Design/Click_BarGraph2/Click_BarGraph2.cpp | e10f0a20b0c9077472a8e0b00186daaa7e4ec343 | [] | no_license | ghsecuritylab/Click_Sensor_Hub_Senior_Design_Project | 3d7be2255ed2c9417d1e7088d75b627fe64a4e81 | 0dcc9b02602ace74e0211d2b1c4ccb8dd3cb6e6d | refs/heads/master | 2021-03-01T18:30:57.236386 | 2019-12-26T22:07:11 | 2019-12-26T22:07:11 | 245,805,975 | 0 | 0 | null | 2020-03-08T11:58:13 | 2020-03-08T11:58:12 | null | UTF-8 | C++ | false | false | 568 | cpp | #include "Click_BarGraph2.h"
Click_BarGraph2(SPI spi, DigitalOut cs, PwmOut){
SPI_Selections = spi;
ChipSelectForTesting = cs;
PWM_Selections pwm;
}
void Click_BarGraph2::setColors(int greenLEDs, int redLEDs){
long control_bargraph = (greenLEDs << 10) + redLEDs;
uint8_t byte0 = control_bargraph & 0xFF;
uint8_t byte1 = (control_bargraph >> 8) & 0xFF;
uint8_t byte2 = (control_bargraph >> 16) & 0xF;
pwm.write(1);
spi.write(byte0);
spi.write(byte1);
spi.write(byte2);
cs = 1;
wait(.5);
cs = 0;
} | [
"alfonso.delamorena.engineer@gmail.com"
] | alfonso.delamorena.engineer@gmail.com |
a7a7aef5d3bdc9c2be55b1462d7d9339cf039b17 | bef1fc9aaedcf39191cc8888ba232f610f47ee32 | /Templates/Verve/source/Verve/VActor/VActorAnimationController.h | b9051fc9c974c3d751d2bfb57bad48a9ec57dfba | [
"MIT"
] | permissive | RichardsGameStudio/Verve | d899ed767578361450433864cb4f8eefa0e38fe3 | 22a55d182f86e3d7684fdc52f628ca57837cac8a | refs/heads/master | 2021-01-18T05:29:53.065638 | 2014-01-06T09:47:13 | 2014-01-06T09:47:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,251 | h | //-----------------------------------------------------------------------------
// Verve
// Copyright (C) - Violent Tulip
//-----------------------------------------------------------------------------
#ifndef _VT_VACTORANIMATIONCONTROLLER_H_
#define _VT_VACTORANIMATIONCONTROLLER_H_
#ifndef _VT_TYPES_H_
#include "Types/VTypes.h"
#endif
#ifndef _VT_VACTORSTATETABLE_H_
#include "VActorStateTable.h"
#endif
#ifndef _TSSHAPEINSTANCE_H_
#include "ts/tsShapeInstance.h"
#endif
//-----------------------------------------------------------------------------
class VActor;
class VActorStateTable;
//-----------------------------------------------------------------------------
class VActorAnimationController
{
public:
struct sAnimationRef
{
U32 Index;
TSThread *Thread;
sAnimationRef( void ) :
Index( U32_MAX ),
Thread( NULL )
{
// Void.
}
};
protected:
VActor *mObject;
VActorStateTable mAnimationTable;
sAnimationRef mBaseAnimation;
public:
VActorAnimationController( void );
virtual ~VActorAnimationController( void );
// Initialisation Methods.
bool initAnimationTable( void );
bool initAnimation( sAnimationRef &pAnimation, const U32 &pIndex, const F32 &pPosition, const F32 &pTimeScale );
bool initAnimationThread( TSThread *&pThread, const U32 &pIndex, const F32 &pPosition, const F32 &pTimeScale );
bool initBaseAnimation( const U32 &pIndex, const F32 &pPosition, const F32 &pTimeScale );
// Accessor Methods.
bool isValidObject( void );
VActor *getObject( void );
void setObject( VActor *pObject );
const TSShape *getShape( void );
TSShapeInstance *getShapeInstance( void );
// Animation Methods.
virtual void update( const F32 &pDelta );
bool isAnimationSequence( const U32 &pIndex );
S32 getAnimationSequence( const U32 &pIndex );
U32 getAnimation( void );
void setAnimation( const U32 &pIndex );
};
#endif // _VT_VACTORANIMATIONCONTROLLER_H_ | [
"pdos00@gmail.com"
] | pdos00@gmail.com |
5140b80242efe7c29309e42182c90d3aaf66e79a | ffc35ec346d0db08de22fcf4554391859bcd5faf | /include/Nodes/ddNode.h | 24bf13264773c326b698bfbf60a0162652a5a0ed | [] | no_license | KarlaSalamun/GP_Scheduling | 3028eb1992e1be122c2539f79ff9bc025a6a0947 | 7c00ca8753bdce26e8e251b47c2b94be4e033eca | refs/heads/master | 2021-03-03T21:20:26.232778 | 2021-01-30T17:40:46 | 2021-01-30T17:40:46 | 245,987,553 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 899 | h | //
// Created by karla on 06. 03. 2020..
//
#ifndef GP_SCHEDULING_DDNODE_H
#define GP_SCHEDULING_DDNODE_H
#include "AbstractNode.h"
class ddNode : public AbstractNode {
public:
ddNode() : AbstractNode() {
is_terminal = true;
children_number = 0;
children.assign( children_number, nullptr );
name = "dd";
depth = 0;
}
void copy_node( AbstractNode *© ) override {
copy = new ddNode( *this );
}
double calculate_priority( Task *&task, std::vector<Task *> , std::vector<Task *> ) {
return task->get_abs_due_date();
}
void execute( void *ctx )
{
struct task_ctx *ctx_ = reinterpret_cast<struct task_ctx *>(ctx);
ctx_->task->set_priority( ctx_->task->get_abs_due_date() );
}
};
#endif //GP_SCHEDULING_DDNODE_H
| [
"karlasalamun9@gmail.com"
] | karlasalamun9@gmail.com |
21de11b9d9317d4b0ea769f308a0355739608dec | 3b2cd17dcca78fff39ef1481062bc255e049523d | /tutorials/Blasius/0/p | 3ae48bec665fcb891185cb98ebda315987ff7ea6 | [] | no_license | positroncascade/AeroFoamV1-2008 | 5d0101a3207e2b4de2a4e5bd3677a51d0f35152e | 205782b1fde0b22e54fe78901f02c0fbb325ce36 | refs/heads/master | 2021-01-09T04:46:57.960126 | 2017-07-10T06:19:35 | 2017-07-10T06:19:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,394 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 1.4.1 |
| \\ / A nd | Web: http://www.openfoam.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
// Field Dictionary
FoamFile
{
version 2.0;
format ascii;
root "";
case "";
instance "";
local "";
class volScalarField;
object p;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [1 -1 -2 0 0 0 0];
internalField uniform 101325;
boundaryField
{
inlet
{
type fixedValue;
value uniform 101325;
}
outlet
{
type zeroGradient;
}
bottom
{
type zeroGradient;
}
top
{
type zeroGradient;
}
defaultFaces
{
type empty;
}
}
// ************************************************************************* //
| [
"chengdi123000@gmail.com"
] | chengdi123000@gmail.com | |
a5977b667048dac9cdcb184dcc2401270c6c5474 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir35435/dir35536/dir38680/file38724.cpp | 3bc61f6d4e9339243cea9bc0f4e68a8bf11f0f1c | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | #ifndef file38724
#error "macro file38724 must be defined"
#endif
static const char* file38724String = "file38724"; | [
"tgeng@google.com"
] | tgeng@google.com |
8210034ae869d3cf871c8ffad29e937cea2cdf20 | 0e054f323f61559f86373b8c7b07539db152cf53 | /main.cpp | c7e3497e415fab55ab4db4a5a9db0f4b9ba62061 | [] | no_license | krzeszowska/struktury_danych_stl | f984e338771586f9d4db6af1fcf3e5f3ced9b047 | 37c1b60359271af38630780ec71f21c4c32e1402 | refs/heads/master | 2020-04-29T12:53:39.967025 | 2019-03-17T19:57:30 | 2019-03-17T19:57:30 | 176,153,171 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 988 | cpp | #include <iostream>
#include <list>
#include <stack>
#include <queue>
using namespace std;
template <typename Typ>
std::ostream& operator << (std::ostream& str, list<Typ>& obj){
for (int n : obj) {
str << n << '\n';
}
return str;
}
void testListy(){
list<int> lista;
lista.push_front(1);
lista.push_front(2);
lista.push_back(29);
list<int>::iterator i = lista.begin();
lista.insert(++++i,22);
lista.insert(----i,10);
lista.push_back(12);
lista.push_back(11);
lista.pop_front();
lista.pop_back();
lista.erase(i);
// cout << lista;
}
void testStosu(){
stack<int> stos;
stos.push(1);
stos.push(2);
stos.push(3);
stos.pop();
stos.pop();
}
void testKolejki(){
queue<int> kolejka;
kolejka.push(1);
kolejka.push(2);
kolejka.push(3);
kolejka.pop();
kolejka.pop();
}
int main()
{
testStosu();
testListy();
testKolejki();
return 0;
}
| [
"j.krzeszowska1306@gmail.com"
] | j.krzeszowska1306@gmail.com |
c32981d630148400312d82ac613fc63d5a90808c | ed5669151a0ebe6bcc8c4b08fc6cde6481803d15 | /test/magma-1.4.1/src/clahru.cpp | 501fe195ef3bb5a8d0567af14cf72b28d651a101 | [] | no_license | JieyangChen7/DVFS-MAGMA | 1c36344bff29eeb0ce32736cadc921ff030225d4 | e7b83fe3a51ddf2cad0bed1d88a63f683b006f54 | refs/heads/master | 2021-09-26T09:11:28.772048 | 2018-05-27T01:45:43 | 2018-05-27T01:45:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,717 | cpp | /*
-- MAGMA (version 1.4.1) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
December 2013
@generated c Tue Dec 17 13:18:36 2013
@author Stan Tomov
@author Mark Gates
*/
#include "common_magma.h"
#define PRECISION_c
extern "C" magma_int_t
magma_clahru(
magma_int_t n, magma_int_t ihi, magma_int_t k, magma_int_t nb,
magmaFloatComplex *A, magma_int_t lda,
magmaFloatComplex *dA, magmaFloatComplex *dY,
magmaFloatComplex *dV, magmaFloatComplex *dT,
magmaFloatComplex *dwork )
{
/* -- MAGMA (version 1.4.1) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
December 2013
Purpose
=======
CLAHRU is an auxiliary MAGMA routine that is used in CGEHRD to update
the trailing sub-matrices after the reductions of the corresponding
panels.
See further details below.
Arguments
=========
N (input) INTEGER
The order of the matrix A. N >= 0.
IHI (input) INTEGER
Last row to update. Same as IHI in cgehrd.
K (input) INTEGER
Number of rows of the matrix Am (see details below)
NB (input) INTEGER
Block size
A (output) COMPLEX array, dimension (LDA,N-K)
On entry, the N-by-(N-K) general matrix to be updated. The
computation is done on the GPU. After Am is updated on the GPU
only Am(1:NB) is transferred to the CPU - to update the
corresponding Am matrix. See Further Details below.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,N).
DA (input/output) COMPLEX array on the GPU, dimension
(N,N-K). On entry, the N-by-(N-K) general matrix to be updated.
On exit, the 1st K rows (matrix Am) of A are updated by
applying an orthogonal transformation from the right
Am = Am (I-V T V'), and sub-matrix Ag is updated by
Ag = (I - V T V') Ag (I - V T V(NB+1:)' )
where Q = I - V T V' represent the orthogonal matrix
(as a product of elementary reflectors V) used to reduce
the current panel of A to upper Hessenberg form. After Am
is updated Am(:,1:NB) is sent to the CPU.
See Further Details below.
DY (input/workspace) COMPLEX array on the GPU, dimension
(N, NB). On entry the (N-K)-by-NB Y = A V. It is used internally
as workspace, so its value is changed on exit.
DV (input/workspace) COMPLEX array on the GPU, dimension
(N, NB). On entry the (N-K)-by-NB matrix V of elementary reflectors
used to reduce the current panel of A to upper Hessenberg form.
The rest K-by-NB part is used as workspace. V is unchanged on
exit.
DT (input) COMPLEX array on the GPU, dimension (NB, NB).
On entry the NB-by-NB upper trinagular matrix defining the
orthogonal Hessenberg reduction transformation matrix for
the current panel. The lower triangular part are 0s.
DWORK (workspace) COMPLEX array on the GPU, dimension N*NB.
Further Details
===============
This implementation follows the algorithm and notations described in:
S. Tomov and J. Dongarra, "Accelerating the reduction to upper Hessenberg
form through hybrid GPU-based computing," University of Tennessee Computer
Science Technical Report, UT-CS-09-642 (also LAPACK Working Note 219),
May 24, 2009.
The difference is that here Am is computed on the GPU.
M is renamed Am, G is renamed Ag.
===================================================================== */
#define dA( i, j ) (dA + (i) + (j)*ldda)
magmaFloatComplex c_zero = MAGMA_C_ZERO;
magmaFloatComplex c_one = MAGMA_C_ONE;
magmaFloatComplex c_neg_one = MAGMA_C_NEG_ONE;
magma_int_t ldda = lda;
magmaFloatComplex *dYm = dV + ihi - k;
magma_int_t info = 0;
if (n < 0) {
info = -1;
} else if (ihi < 0 || ihi > n) {
info = -2;
} else if (k < 0 || k > n) {
info = -3;
} else if (nb < 1 || nb > n) {
info = -4;
} else if (lda < max(1,n)) {
info = -6;
}
if (info != 0) {
magma_xerbla( __func__, -(info) );
return info;
}
// top part of Y, above panel, hasn't been computed yet, so do that now
// Ym = Am V = A(0:k-1, 0:ihi-k-1) * V(0:ihi-k-1, 0:nb-1)
magma_cgemm( MagmaNoTrans, MagmaNoTrans, k, nb, ihi-k,
c_one, dA, ldda,
dV, ldda,
c_zero, dYm, ldda );
// -----
// on right, A := A Q = A - A V T V'
// Update Am = Am - Am V T V' = Am - Ym W', with W = V T'
// W = V T' = V(0:ihi-k-1, 0:nb-1) * T(0:nb-1, 0:nb-1)'
magma_cgemm( MagmaNoTrans, MagmaConjTrans, ihi-k, nb, nb,
c_one, dV, ldda,
dT, nb,
c_zero, dwork, ldda );
// Am = Am - Ym W' = A(0:k-1, 0:ihi-k-1) - Ym(0:k-1, 0:nb-1) * W(0:ihi-k-1, 0:nb-1)'
magma_cgemm( MagmaNoTrans, MagmaConjTrans, k, ihi-k, nb,
c_neg_one, dYm, ldda,
dwork, ldda,
c_one, dA, ldda );
// copy first nb columns of Am, A(0:k-1, 0:nb-1), to host
magma_cgetmatrix( k, nb, dA, ldda, A, lda );
// -----
// on right, A := A Q = A - A V T V'
// Update Ag = Ag - Ag V T V' = Ag - Y W'
// Ag = Ag - Y W' = A(k:ihi-1, nb:ihi-k-1) - Y(0:ihi-k-1, 0:nb-1) * W(nb:ihi-k-1, 0:nb-1)'
magma_cgemm( MagmaNoTrans, MagmaConjTrans, ihi-k, ihi-k-nb, nb,
c_neg_one, dY, ldda,
dwork + nb, ldda,
c_one, dA(k,nb), ldda );
// -----
// on left, A := Q' A = A - V T' V' A
// Ag2 = Ag2 - V T' V' Ag2 = W Yg, with W = V T' and Yg = V' Ag2
// Note that Ag is A(k:ihi, nb+1:ihi-k)
// while Ag2 is A(k:ihi, nb+1: n -k)
// Z = V(0:ihi-k-1, 0:nb-1)' * A(k:ihi-1, nb:n-k-1); Z is stored over Y
magma_cgemm( MagmaConjTrans, MagmaNoTrans, nb, n-k-nb, ihi-k,
c_one, dV, ldda,
dA(k,nb), ldda,
c_zero, dY, nb );
// Ag2 = Ag2 - W Z = A(k:ihi-1, nb:n-k-1) - W(nb:n-k-1, 0:nb-1) * Z(0:nb-1, nb:n-k-1)
magma_cgemm( MagmaNoTrans, MagmaNoTrans, ihi-k, n-k-nb, nb,
c_neg_one, dwork, ldda,
dY, nb,
c_one, dA(k,nb), ldda );
return 0;
}
| [
"cjy7117@gmail.com"
] | cjy7117@gmail.com |
d6ca90edf10521ab3ad0ed2a2404ddc7ae5a28f1 | c38ce56c083764ffec4885d86b1751df68732a38 | /tests/testview.cpp | 3257a8e458327b1030400374bb0a96162cd36a2e | [] | no_license | lel9/gpx-editor | 1c415d89a0b5572253c2b7d8ff935698683071a4 | a92c9ead285c6b535f59c7989fd68c9849c34266 | refs/heads/master | 2020-03-06T18:07:58.371001 | 2018-05-21T00:34:40 | 2018-05-21T00:34:40 | 127,000,851 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,353 | cpp | #include "testview.h"
TestView::TestView(const QVector<RouteData> routes, QVector<PointData> points) :
_routeData(routes), _pointData(points), _selectedRouteRow(0), _selectedPointRow(0)
{
}
TestView::TestView(const TestView &other) :
QObject()
{
_routeData = other._routeData;
_pointData = other._pointData;
_selectedPointRow = other._selectedPointRow;
_selectedRouteRow = other._selectedRouteRow;
_polyline = other._polyline;
_plotKeys = other._plotKeys;
_plotValues = other._plotValues;
}
TestView::~TestView()
{
}
int TestView::selectedRouteRow() const
{
return _selectedRouteRow;
}
int TestView::selectedPointRow() const
{
return _selectedPointRow;
}
QString TestView::polyline() const
{
return _polyline;
}
QVariant TestView::routeData(const TableIndex &index) const
{
switch (index.column())
{
case 0:
return _routeData[index.row()].name;
break;
case 1:
return _routeData[index.row()].distance;
break;
case 2:
return _routeData[index.row()].date;
break;
default:
break;
}
return QVariant();
}
QVariant TestView::pointData(const TableIndex &index) const
{
switch (index.column())
{
case 0:
return _pointData[index.row()].lat;
break;
case 1:
return _pointData[index.row()].lon;
break;
case 2:
return _pointData[index.row()].alt;
break;
default:
break;
}
return QVariant();
}
int TestView::routeViewRow() const
{
return _routeData.length();
}
int TestView::pointViewRow() const
{
return _pointData.length();
}
int TestView::routeViewColumn() const
{
return 3;
}
int TestView::pointViewColumn() const
{
return 3;
}
QVector<double> TestView::plotKeys() const
{
return _plotKeys;
}
QVector<double> TestView::plotValues() const
{
return _plotValues;
}
void TestView::setUndoEnabled(bool)
{
}
void TestView::setRedoEnabled(bool)
{
}
void TestView::addOperation(const QString &)
{
}
void TestView::removeOperation(int)
{
}
BaseView *TestView::copy()
{
TestView *view = new TestView(*this);
return view;
}
bool operator==(const TestView &first, const TestView &second)
{
if (first._routeData != second._routeData)
return false;
if (first._pointData != second._pointData)
return false;
if (first._polyline != second._polyline)
return false;
if (first._plotKeys != second._plotKeys)
return false;
if (first._plotValues != second._plotValues)
return false;
return true;
}
bool operator!=(const TestView &first, const TestView &second)
{
return !(first == second);
}
void TestView::setPolyline(const QString &polyline)
{
_polyline = polyline;
}
void TestView::setRouteViewSize(int rowCount, int columnCount)
{
Q_UNUSED(columnCount)
_routeData.resize(rowCount);
}
void TestView::setPointViewSize(int rowCount, int columnCount)
{
Q_UNUSED(columnCount)
_pointData.resize(rowCount);
}
void TestView::setRouteViewHeaders(const QStringList &)
{
}
void TestView::setPointViewHeaders(const QStringList &)
{
}
void TestView::updateRouteView(const TableIndex &index, const QVariant &data)
{
switch (index.column())
{
case 0:
_routeData[index.row()].name = data.toString();
break;
case 1:
_routeData[index.row()].distance = data.toDouble();
break;
case 2:
_routeData[index.row()].date = data.toDate();
break;
default:
break;
}
}
void TestView::updatePointView(const TableIndex &index, const QVariant &data)
{
switch (index.column())
{
case 0:
_pointData[index.row()].lat = data.toDouble();
break;
case 1:
_pointData[index.row()].lon = data.toDouble();
break;
case 2:
_pointData[index.row()].alt = data.toDouble();
break;
default:
break;
}
}
void TestView::setPlotData(const QVector<double> &keys, const QVector<double> &values)
{
_plotKeys = keys;
_plotValues = values;
}
void TestView::showErrorMessage(const QString &)
{
}
void TestView::setOperationResult(const QString &)
{
}
void TestView::selectRoute(int row)
{
_selectedRouteRow = row;
}
void TestView::selectPoint(int row)
{
_selectedPointRow = row;
}
| [
"olg-199774@mail.ru"
] | olg-199774@mail.ru |
c5c55ab949f256c4f4ecd0f26ea31e4e556eceef | c4e8971828dd46e049bb10f0a91e4c6e7b0a14f7 | /src/testApp.h | c814bbea1246b397e5650843bf9784d6029c2ca4 | [] | no_license | elzbth/kinect_body_map | 003c12e83fcaa3fee2a7135f0ee7a514eaf4491d | 67087dc0fe1e6b62835aa1be6ff674bea9f22efc | refs/heads/master | 2020-05-12T21:17:49.790107 | 2014-09-29T01:12:21 | 2014-09-29T01:12:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,124 | h | #pragma once
#include "ofMain.h"
#include "ofxOpenCv.h"
#include "ofxKinect.h"
// uncomment this to read from two kinects simultaneously
//#define USE_TWO_KINECTS
class testApp : public ofBaseApp {
public:
void setup();
void update();
void draw();
void exit();
void drawPointCloud();
void keyPressed(int key);
void mouseDragged(int x, int y, int button);
void mousePressed(int x, int y, int button);
void mouseReleased(int x, int y, int button);
void windowResized(int w, int h);
ofxKinect kinect;
#ifdef USE_TWO_KINECTS
ofxKinect kinect2;
#endif
ofxCvColorImage colorImg;
ofxCvGrayscaleImage grayImage; // grayscale depth image
ofxCvGrayscaleImage grayThreshNear; // the near thresholded image
ofxCvGrayscaleImage grayThreshFar; // the far thresholded image
ofxCvContourFinder contourFinder;
//images to load the projected image into
ofxCvColorImage proj_img;
ofImage fileImage;
//frame buffer to draw to
ofFbo fbo;
bool bThreshWithOpenCV;
bool bDrawPointCloud;
int nearThreshold;
int farThreshold;
int angle;
// used for viewing the point cloud
ofEasyCam easyCam;
};
| [
"ebeth314@gmail.com"
] | ebeth314@gmail.com |
e00d74e145f70cf9a2f0a3185d2ee02a6b775a1c | 0c268ff10b68c4a24023ca646bb46c5a125eb84c | /DataStructureClass_Code/SegmentTree_3.cpp | 04de8aaa319a6f330fd7701e1773af176f39cec5 | [] | no_license | TzeHimSung/AcmDailyTraining | 497b9fb77c282f2f240634050e38f395cf1bedbc | 2a69fa38118e43cbeca44cb99369e6e094663ec8 | refs/heads/master | 2023-03-21T21:39:02.752317 | 2021-03-14T03:41:00 | 2021-03-14T03:41:00 | 159,670,822 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,208 | cpp | //线段树 区间覆盖
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int minNum, maxNum, sumNum;
int setv;
};
const int maxn=1e4+10;
Node segT[maxn];
int n,numOfQuery;
int _min,_max,_sum;
void maintain(int curPos, int curL, int curR)
{
int lson=curPos*2, rson=curPos*2+1;
if (curR>curL)
{
segT[curPos].sumNum=segT[lson].sumNum+segT[rson].sumNum;
segT[curPos].minNum=min(segT[lson].minNum, segT[rson].minNum);
segT[curPos].maxNum=max(segT[lson].maxNum, segT[rson].maxNum);
}
if (segT[curPos].setv>=0)
{
segT[curPos].maxNum=segT[curPos].minNum=segT[curPos].setv;
segT[curPos].sumNum=(curR-curL+1)*segT[curPos].setv;
}
}
void pushdown(int curPos)
{
int lson=curPos*2, rson=curPos*2+1;
if (segT[curPos].setv>=0)
{
segT[lson].setv=segT[rson].setv=segT[curPos].setv;
segT[curPos].setv=-1;
}
}
void intervalCover(int curPos, int setVal, int curL, int curR, int qL, int qR)
{
int lson=curPos*2, rson=curPos*2+1;
if (qL<=curL && curR<=qR)
segT[curPos].setv=setVal;
else
{
pushdown(curPos);
int mid=curL+(curR-curL)/2;
if (qL<=mid) intervalCover(lson, setVal, curL, mid, qL, qR);
else maintain(lson, curL, mid);
if (mid<qR) intervalCover(rson, setVal, mid+1, curR, qL, qR);
else maintain(rson, mid+1, curR);
}
maintain(curPos, curL, curR);
}
void query(int curPos, int curL, int curR, int qL, int qR)
{
int lson=curPos*2, rson=curPos*2+1;
if (segT[curPos].setv>=0)
{
_min=min(_min, segT[curPos].setv);
_max=max(_max, segT[curPos].setv);
_sum=segT[curPos].setv*(min(curR,qR)-max(curL,qL)+1);
}
else if (qL<=curL && curR<=qR)
{
_min=min(_min, segT[curPos].minNum);
_max=max(_max, segT[curPos].maxNum);
_sum+=segT[curPos].sumNum;
}
else
{
int mid=curL+(curR-curL)/2;
if (qL<=mid) query(lson, curL, mid, qL, qR);
if (mid<qR) query(rson, mid+1, curR, qL, qR);
}
}
//建树
void build(int pos, int newVal, int curPos, int l, int r)
{
if (l==r)
{
segT[curPos].minNum=segT[curPos].maxNum=segT[curPos].sumNum=newVal;
segT[curPos].setv=-1;
return;
}
int mid=(l+r)/2;
if (pos<=mid) build(pos, newVal, 2*curPos, l, mid);
else build(pos, newVal, 2*curPos+1, mid+1, r);
segT[curPos].minNum=min(segT[2*curPos].minNum, segT[2*curPos+1].minNum);
segT[curPos].maxNum=max(segT[2*curPos].maxNum, segT[2*curPos+1].maxNum);
segT[curPos].sumNum=segT[2*curPos].sumNum+segT[2*curPos+1].sumNum;
segT[curPos].setv=-1;
}
int main()
{
cin>>n;
for (int i=1;i<=n;i++)
{
int x; cin>>x;
build(i,x,1,1,n);
}
cin>>numOfQuery;
while (numOfQuery--)
{
int op; cin>>op;
if (op==1)
{
int l,r,v; cin>>l>>r>>v;
intervalCover(1,v,1,n,l,r);
}
else
{
_sum=0, _min=INT_MAX, _max=INT_MIN;
int l,r; cin>>l>>r;
query(1,1,n,l,r);
cout<<_sum<<" "<<_min<<" "<<_max<<endl;
}
}
return 0;
} | [
"zxc98567@gmail.com"
] | zxc98567@gmail.com |
eaad959a3937830ddcb8f89fdaf9fd9d57f71fc5 | 50457fc28800b3cf2f25e06478f33981a1a626dc | /Codeforces/1285D.cpp | 38231f384f43f86544e65338a26fd44b0e53f058 | [] | no_license | h-sinha/CP-codes | 5b1ef5021b7fd180b518270ffdb12997dc8d367b | 937174c73d1c80114de4535a6908122158366ad4 | refs/heads/master | 2021-07-20T18:47:00.500294 | 2021-07-06T05:11:57 | 2021-07-06T05:11:57 | 159,954,721 | 2 | 2 | null | 2020-01-07T18:57:28 | 2018-12-01T14:51:44 | C++ | UTF-8 | C++ | false | false | 1,744 | cpp | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define DEBUG
#ifdef DEBUG
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define debug(...)
#endif
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define RFOR(i,a,b) for(int i=a;i>=b;--i)
#define ln "\n"
#define mp make_pair
#define pb push_back
#define sz(a) ll(a.size())
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define trace(c,x) for(auto &x:c)
#define pii pair<ll,ll>
typedef long long ll;
typedef long double ld;
typedef priority_queue<pii,std::vector<pii>,greater<pii> > revpr;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> pbds;
// ordered_set X
//K-th smallest
//*X.find_by_order(k-1)
//NO OF ELEMENTS < A
//X.order_of_key(A)
const int L=1e6+7;
ll n, po[L], a[L];
ll solve(std::vector<int> &v, ll bit)
{
if(bit<0)return 0;
std::vector<int> s,u;
trace(v, x)
{
if(a[x]&po[bit])s.pb(x);
else u.pb(x);
}
if(sz(s) == 0)return solve(u, bit-1);
if(sz(u) == 0)return solve(s, bit-1);
return po[bit] + min(solve(u,bit-1), solve(s, bit-1));
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
std::vector<int> v;
po[0] = 1;
FOR(i,1,31)po[i] = (po[i-1]<<1);
FOR(i,0,n)
{
cin >> a[i];
v.pb(i);
}
cout<<solve(v, 30);
return 0;
} | [
"harsh.26020@gmail.com"
] | harsh.26020@gmail.com |
17b83e7087fa816c8d6b0a6f54afbd77c938b6c4 | fd4103e6f5116c776249b00171d8639313f05bc1 | /Src/PartModelingEngine/PmeFeatureAPI.cpp | e66d1827c245c8dab7093398571e5447e080e3a7 | [] | no_license | Wanghuaichen/TransCAD | 481f3b4e54cc066dde8679617a5b32ac2041911b | 35ca89af456065925984492eb23a0543e3125bb8 | refs/heads/master | 2020-03-25T03:54:51.488397 | 2018-06-25T17:38:39 | 2018-06-25T17:38:39 | 143,367,529 | 2 | 1 | null | 2018-08-03T02:30:03 | 2018-08-03T02:30:03 | null | UTF-8 | C++ | false | false | 1,546 | cpp | #include "stdafx.h"
#include ".\PmeFeatureAPI.h"
#include ".\PmeFeature.h"
#include ".\PmeExceptionTest.h"
#include ".\PmeArgumentTypeException.h"
#include ".\PmeArgumentNullException.h"
#include ".\PmeHandleMacro.h"
void PmeFeatureAPI::GetName(PmeHFeature hFeature, CString & name)
{
PmeThrowExceptionIf<PmeArgumentNullException>(!hFeature);
PmeFeature * pFeature = PME_HANDLE2FEATURE(hFeature);
PmeThrowExceptionIf<PmeArgumentTypeException>(!pFeature->IsInstanceOf(PME_RUNTIME_TYPE(PmeFeature)));
name = pFeature->GetName();
}
void PmeFeatureAPI::GetPart(PmeHFeature hFeature, PmeHPart & hPart)
{
PmeThrowExceptionIf<PmeArgumentNullException>(!hFeature);
PmeFeature * pFeature = PME_HANDLE2FEATURE(hFeature);
PmeThrowExceptionIf<PmeArgumentTypeException>(!pFeature->IsInstanceOf(PME_RUNTIME_TYPE(PmeFeature)));
PmePart * pPart = pFeature->GetPart();
hPart = PME_PART2HANDLE(pPart);
}
void PmeFeatureAPI::GetType(PmeHFeature hFeature, PmeFeatureType & type)
{
PmeThrowExceptionIf<PmeArgumentNullException>(!hFeature);
PmeFeature * pFeature = PME_HANDLE2FEATURE(hFeature);
PmeThrowExceptionIf<PmeArgumentTypeException>(!pFeature->IsInstanceOf(PME_RUNTIME_TYPE(PmeFeature)));
type = pFeature->GetFeatureType();
}
void PmeFeatureAPI::SetName(PmeHFeature hFeature, CString name)
{
PmeThrowExceptionIf<PmeArgumentNullException>(!hFeature);
PmeFeature * pFeature = PME_HANDLE2FEATURE(hFeature);
PmeThrowExceptionIf<PmeArgumentTypeException>(!pFeature->IsInstanceOf(PME_RUNTIME_TYPE(PmeFeature)));
pFeature->SetName(name);
}
| [
"kyk5415@gmail.com"
] | kyk5415@gmail.com |
a28150e8153279bc536da0782f25f790f9bcc032 | 2915c16599e5a9ee6692d3e2a018b8a559a2c59d | /src/AF.h | f0c608fb75592a91c847eec47c5f9c65e49c754c | [
"MIT"
] | permissive | federicocerutti/ArgSemSAT | d627c657d03b296021757e77c10a0c0ea79550d4 | 4b5f30e0435f3bc23de6adaee97f20a4bc55074d | refs/heads/master | 2022-12-30T20:43:45.476791 | 2020-10-06T14:12:46 | 2020-10-06T14:12:46 | 255,847,336 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 797 | h | /**
* @file AF.h
* @author Mauro Vallati <m.vallati@hud.ac.uk>
* @copyright MIT
*/
#ifndef GRAPH_H_
#define GRAPH_H_
#include <map>
#include <fstream>
#include <iostream>
#include "Argument.h"
class SetArguments;
class SetArgumentsIterator;
extern bool debug;
using namespace std;
class AF
{
SetArguments *arguments;
//vector<pair<int, int> > raw_attacks;
//map<Argument *, SetArguments *> attacks;
//map<Argument *, SetArguments *> attackers;
string trim(string);
public:
AF();
virtual ~AF();
bool readFile(string file);
int numArgs();
Argument *getArgumentByName(string);
Argument *getArgumentByNumber(int position);
SetArguments *get_arguments() const;
SetArgumentsIterator begin();
SetArgumentsIterator end();
};
#include "SetArguments.h"
#endif /* GRAPH_H_ */
| [
"ceruttif@cardiff.ac.uk"
] | ceruttif@cardiff.ac.uk |
b088b6e162dd419fd163e37defb93e840dc4b215 | 4bba3838c668dd4846640a2aa9d4b1f717d15306 | /POJ Pekin University/2924 - Gauß in Elementary School.cpp | 5f188b0f2d11763a2eb92baf4a645d9354d82841 | [] | no_license | dnr2/maratona | 0189fa17b99663aeeb14f389b018865791325d04 | 65163739c645802ac38e605e5706551c3cdf302a | refs/heads/master | 2021-01-15T16:29:31.101196 | 2015-11-27T08:21:21 | 2015-11-27T08:21:21 | 12,200,323 | 22 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 972 | cpp | //http://poj.org/problem?id=2840
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <set>
#define FOR(i,n) for((i) = 0; (i) < (n); (i) ++)
#define FORC(i,j, n) for((i) = (j); (i) < (n); (i) ++)
#define PINT(i) printf("%d\n", (i));
#define P2INT(i,j) printf("%d %d\n", (i), (j));
#define SINT(i) scanf("%d", &(i));
#define S2INT(i, j) scanf("%d %d", &(i), &(j));
#define SSTR(s) scanf("%s", &(s));
using namespace std;
int n, m, i, j, k, len, z, resp, t;
int main(){
freopen("in.txt", "r", stdin );
freopen("out.txt", "w", stdout );
cin >> t;
long long a = 100, b = 200 , c, d;
FORC(i,1,t+1){
cin >> a;
cin >> b;
printf("Scenario #%d:\n", i);
c = a + b;
d = b - a + 1;
c = (c * d) / 2 ;
cout << c << endl << endl;
}
return 0;
}
| [
"dnr2@cin.ufpe.br"
] | dnr2@cin.ufpe.br |
2a69a6457075ec9698f2821f00428b63665ff8ee | b1be8471950a7d7a834d67b11b24d70aa7ece501 | /DemoFramework/FslUtil/OpenGLES2/include/FslUtil/OpenGLES2/TextureUtil.hpp | 33b353bcab42d692f01c14186a656b2540a579da | [
"GPL-1.0-or-later",
"JSON"
] | permissive | alexvonduar/gtec-demo-framework | 1b212d9b43094abdfeae61e0d2e8a258e5a97771 | 6f8a7e429d0e15242ba64eb4cb41bfc2dd7dc749 | refs/heads/master | 2021-06-15T13:25:02.498022 | 2021-03-26T06:11:43 | 2021-03-26T06:11:43 | 168,854,730 | 0 | 0 | BSD-3-Clause | 2019-03-25T23:59:42 | 2019-02-02T16:59:46 | C++ | UTF-8 | C++ | false | false | 5,474 | hpp | #ifndef FSLUTIL_OPENGLES2_TEXTUREUTIL_HPP
#define FSLUTIL_OPENGLES2_TEXTUREUTIL_HPP
/****************************************************************************************************************************************************
* Copyright 2020 NXP
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* * 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.
*
* * Neither the name of the NXP. 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 <FslBase/Math/Pixel/PxRectangle.hpp>
#include <FslBase/Math/Pixel/PxRectangleU.hpp>
#include <FslBase/Math/Pixel/PxSize2D.hpp>
#include <FslGraphics/NativeTextureArea.hpp>
#include <FslGraphics/TextureFlags.hpp>
#include <FslGraphics/TextureRectangle.hpp>
#include <cassert>
namespace Fsl
{
namespace GLES2
{
namespace TextureUtil
{
//! @brief Get the native texture area of the given textureRectangle
constexpr inline NativeTextureArea CalcTextureArea(const PxRectangleU& srcRect, const PxSize2D& textureSize)
{
return {srcRect.Left() == 0u ? 0.0f : srcRect.Left() / static_cast<float>(textureSize.Width()),
1.0f - (srcRect.Top() == 0u ? 0.0f : srcRect.Top() / static_cast<float>(textureSize.Height())),
srcRect.Right() == uint32_t(textureSize.Width()) ? 1.0f : srcRect.Right() / static_cast<float>(textureSize.Width()),
1.0f - (srcRect.Bottom() == uint32_t(textureSize.Height()) ? 1.0f : srcRect.Bottom() / static_cast<float>(textureSize.Height()))};
}
//! @brief Get the native texture area of the given textureRectangle
constexpr inline NativeTextureArea CalcTextureArea(const PxRectangle& srcRect, const PxSize2D& textureSize)
{
return {srcRect.Left() == 0 ? 0.0f : srcRect.Left() / static_cast<float>(textureSize.Width()),
1.0f - (srcRect.Top() == 0 ? 0.0f : srcRect.Top() / static_cast<float>(textureSize.Height())),
srcRect.Right() == textureSize.Width() ? 1.0f : srcRect.Right() / static_cast<float>(textureSize.Width()),
1.0f - (srcRect.Bottom() == textureSize.Height() ? 1.0f : srcRect.Bottom() / static_cast<float>(textureSize.Height()))};
}
//! @brief Get the native texture area of the given textureRectangle
constexpr inline NativeTextureArea CalcTextureArea(const PxRectangle& srcRect, const PxSize2D& textureSize, const int timesX, const int timesY)
{
assert(timesX == 1 || (timesX != 1 && (srcRect.Width() == 0 || srcRect.Width() == textureSize.Width())));
assert(timesY == 1 || (timesY != 1 && (srcRect.Height() == 0 || srcRect.Height() == textureSize.Height())));
assert(static_cast<float>(textureSize.Width()) >= 0.0f);
assert(static_cast<float>(textureSize.Height()) >= 0.0f);
return {srcRect.Left() == 0 ? 0.0f : srcRect.Left() / static_cast<float>(textureSize.Width()),
1.0f - (srcRect.Top() == 0 ? 0.0f : srcRect.Top() / static_cast<float>(textureSize.Height())),
srcRect.Right() == textureSize.Width() ? 1.0f * float(timesX) : srcRect.Right() / static_cast<float>(textureSize.Width()),
1.0f -
(srcRect.Bottom() == textureSize.Height() ? 1.0f * float(timesY) : srcRect.Bottom() / static_cast<float>(textureSize.Height()))};
}
//! @brief Get the native texture area of the given textureRectangle
constexpr inline NativeTextureArea CalcTextureArea(const TextureRectangle& textureRectangle)
{
return CalcTextureArea(textureRectangle.GetRectangle(), textureRectangle.GetTextureSize());
}
//! @brief Get the native texture area of the given textureRectangle
constexpr inline NativeTextureArea CalcTextureArea(const TextureRectangle& textureRectangle, const int timesX, const int timesY)
{
return CalcTextureArea(textureRectangle.GetRectangle(), textureRectangle.GetTextureSize(), timesX, timesY);
}
}
}
}
#endif
| [
"Rene.Thrane@nxp.com"
] | Rene.Thrane@nxp.com |
9600eb4068b861e869554caa03a5d6476d544cf6 | 5a77b5092acf817ac37a5fafd006feea434dd0d6 | /Doxygen_Graphviz/DesignPatternExample/品味Java的21種設計模式/dp_cpp/visitor/example2/Client.cpp | 782cfec46a8edc8825ef31a54b819ffee5387fb6 | [] | no_license | shihyu/MyTool | dfc94f507b848fb112483a635ef95e6a196c1969 | 3bfd1667ad86b3db63d82424cb4fa447cbe515af | refs/heads/master | 2023-05-27T19:09:10.538570 | 2023-05-17T15:58:18 | 2023-05-17T15:58:18 | 14,722,815 | 33 | 21 | null | null | null | null | UTF-8 | C++ | false | false | 1,173 | cpp | #include "Client.h"
namespace cn
{
namespace javass
{
namespace dp
{
namespace visitor
{
namespace example2
{
void Client::main(std::string args[])
{
//准备点测试数据
Collection<Customer*> *colCustomer = preparedTestData();
//循环对客户进行操作
for (Collection<Customer*>::const_iterator cm = colCustomer->begin(); cm != colCustomer->end(); ++cm)
{
//进行偏好分析
(*cm)->predilectionAnalyze();
//进行价值分析
(*cm)->worthAnalyze();
}
}
Collection<Customer*> *Client::preparedTestData()
{
Collection<Customer*> *colCustomer = std::vector<Customer*>();
//为了测试方便，准备点数据
Customer *cm1 = new EnterpriseCustomer();
cm1->setName("ABC集团");
colCustomer->add(cm1);
Customer *cm2 = new EnterpriseCustomer();
cm2->setName("CDE公司");
colCustomer->add(cm2);
Customer *cm3 = new PersonalCustomer();
cm3->setName("张三");
colCustomer->add(cm3);
return colCustomer;
}
}
}
}
}
}
| [
"jason_yao@htc.com"
] | jason_yao@htc.com |
fc8f2bd76181bf0a891060f548ed8b93d0e6e89f | d503e97009a2d612cc82ccce8ca31436f12d2fb3 | /include/Itinerary.h | e854071abdd0e1a73298b6ed607f646c9f402b7e | [] | no_license | katelynmiller/ParallelFinal | 34a2c0ab8d347e9264be6f08b55ed0e99cab54e4 | 8e94aac9bd98703075c8abe1452e297baba793e0 | refs/heads/master | 2020-06-25T13:33:24.832228 | 2019-08-08T22:00:34 | 2019-08-08T22:00:34 | 199,323,247 | 0 | 0 | null | 2019-08-08T22:00:36 | 2019-07-28T18:29:08 | C | UTF-8 | C++ | false | false | 364 | h | #ifndef ITINERARY_H
#define ITINERARY_H
class Itinerary
{
public:
Itinerary(int, int);
int get_passenger(int); //Change the return type to Passenger when it is made.
int get_station(int); //Change the return type to Station when it is made.
private:
int * stations;
int * passengers;
};
#endif // ITINERARY_H
| [
"stonisg@wit.edu"
] | stonisg@wit.edu |
73c6b9b49efe0e4c49a50e0c21ec48eac8ceb484 | 5286798f369775a6607636a7c97c87d2a4380967 | /thirdparty/cgal/CGAL-5.1/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h | f7763b3ad535b955d2feb8511a1657d45122d65f | [
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"LGPL-3.0-or-later",
"MIT",
"LicenseRef-scancode-free-unknown",
"GPL-3.0-only",
"LGPL-2.1-or-later",
"LicenseRef-scancode-proprietary-license",
"LicenseRef-scancode-unknown-license-reference",
"MIT-0",
"LGPL-3.0-only"
] | permissive | MelvinG24/dust3d | d03e9091c1368985302bd69e00f59fa031297037 | c4936fd900a9a48220ebb811dfeaea0effbae3ee | refs/heads/master | 2023-08-24T20:33:06.967388 | 2021-08-10T10:44:24 | 2021-08-10T10:44:24 | 293,045,595 | 0 | 0 | MIT | 2020-09-05T09:38:30 | 2020-09-05T09:38:29 | null | UTF-8 | C++ | false | false | 6,607 | h | // Copyright (c) 2005,2007,2009,2010,2011 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
//
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h $
// $Id: Arr_compute_zone_visitor.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Ophir Setter <ophirset@post.tau.ac.il>
//
#ifndef CGAL_ARR_COMPUTE_ZONE_VISITOR_H
#define CGAL_ARR_COMPUTE_ZONE_VISITOR_H
#include <CGAL/license/Arrangement_on_surface_2.h>
/*! \file
* Definition of the Arr_compute_zone_visitor class.
*/
namespace CGAL {
/*! \class
* A visitor class for Arrangement_zone_2, which outputs the
* zone of an x-monotone curve. Meaning, it output the arrangment's
* vertices, edges and faces that the x-monotone curve intersects.
* The class should be templated by an Arrangement_2 class, and by an
* output iterator of CGAL Objects, where we store all arrangement
* features the x-monotone curve intersects.
*/
template <class Arrangement_, class OutputIterator_>
class Arr_compute_zone_visitor
{
public:
typedef OutputIterator_ OutputIterator;
typedef Arrangement_ Arrangement_2;
typedef typename Arrangement_2::Vertex_handle Vertex_handle;
typedef typename Arrangement_2::Halfedge_handle Halfedge_handle;
typedef typename Arrangement_2::Face_handle Face_handle;
typedef typename Arrangement_2::Point_2 Point_2;
typedef typename Arrangement_2::X_monotone_curve_2 X_monotone_curve_2;
typedef std::pair<Halfedge_handle, bool> Result;
private:
const Halfedge_handle invalid_he; // Invalid halfedge.
const Vertex_handle invalid_v; // Invalid vertex.
OutputIterator& out_iter; // for outputing the zone objects.
// Its value type is CGAL::Object.
bool output_left; // Determines wheter we should
// output the left end point of a
// subcurve (to avoid outputing
// the same feature twice).
public:
/*! Constructor. */
Arr_compute_zone_visitor (OutputIterator& oi) :
invalid_he(),
invalid_v(),
out_iter (oi),
output_left (true)
{}
/*! Initialize the visitor. */
void init (Arrangement_2 *)
{
output_left = true;
}
/*!
* Handle the a subcurve located in the interior of a given face.
* \param cv The subcurve.
* \param face The face containing cv's interior.
* \param left_v The vertex that corresponds to the left endpoint of cv
* (or an invalid handle if no such arrangement vertex exists).
* \param left_he The halfedge that contains the left endpoint of cv
* (or an invalid handle if no such halfedge exists).
* \param right_v The vertex that corresponds to the right endpoint of cv
* (or an invalid handle if no such arrangement vertex exists).
* \param right_he The halfedge that contains the right endpoint of cv
* (or an invalid handle if no such halfedge exists).
* \return A handle to the halfedge obtained from the insertion of the
* subcurve into the arrangement.
*/
Result found_subcurve (const X_monotone_curve_2&,
Face_handle face,
Vertex_handle left_v, Halfedge_handle left_he,
Vertex_handle right_v, Halfedge_handle right_he)
{
if (output_left)
{
// Only the first subcurve should output the arrangement feature incident
// to its left endpoint. This way we avoid reporting the same feature
// twice.
if (left_v != invalid_v)
{
*out_iter = CGAL::make_object (left_v);
++out_iter;
}
else if (left_he != invalid_he)
{
*out_iter = CGAL::make_object (left_he);
++out_iter;
}
output_left = false;
}
// Report the face that contains the interior of the subcurve.
*out_iter = CGAL::make_object (face);
++out_iter;
// If the right endpoint of the subcurve is incident to an arrangement
// vertex or an arrangement edge, report this feature.
if (right_v != invalid_v)
{
*out_iter = CGAL::make_object(right_v);
++out_iter;
}
else if (right_he != invalid_he)
{
*out_iter = CGAL::make_object(right_he);
++out_iter;
}
// We did not modify the arrangement, so we return an invalid handle
// and a flag indicating that the zone-computation process should continue.
return (Result (invalid_he, false));
}
/*!
* Handle the a subcurve that overlaps a given edge.
* \param cv The overlapping subcurve.
* \param he The overlapped halfedge (directed from left to right).
* \param left_v The vertex that corresponds to the left endpoint of cv
* (or an invalid handle if no such arrangement vertex exists).
* \param right_v The vertex that corresponds to the right endpoint of cv
* (or an invalid handle if no such arrangement vertex exists).
* \return A handle to the halfedge obtained from the insertion of the
* overlapping subcurve into the arrangement.
*/
Result found_overlap (const X_monotone_curve_2&,
Halfedge_handle he,
Vertex_handle left_v, Vertex_handle right_v)
{
if (output_left)
{
// Only the first subcurve should output the arrangement feature incident
// to its left endpoint. This way we avoid reporting the same feature
// twice.
if (left_v != invalid_v)
{
*out_iter = CGAL::make_object (left_v);
++out_iter;
}
output_left = false;
}
// Report the arrangement edge the curve currently overlaps.
*out_iter = CGAL::make_object(he);
++out_iter;
// If the right endpoint of the overlapping subcurve is incident to an
// arrangement vertex, report this vertex as well.
if (right_v != invalid_v)
{
*out_iter = CGAL::make_object (right_v);
++out_iter;
}
// We did not modify the arrangement, so we return an invalid handle
// and a flag indicating that the zone-computation process should continue.
return (Result (invalid_he, false));
}
};
} //namespace CGAL
#endif
| [
"huxingyi@msn.com"
] | huxingyi@msn.com |
ed99b8954fc4faa2d56b8796bc91f8d3189c2eb0 | 6848723448cc22474863f6506f30bdbac2b6293e | /tools/mosesdecoder-master/mert/Data.h | 8bab23d631ee5db3938284a89e906d473afe83e7 | [
"LicenseRef-scancode-warranty-disclaimer",
"LGPL-2.1-only",
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"LGPL-2.1-or-later",
"LicenseRef-scancode-other-copyleft",
"GPL-2.0-only",
"Apache-2.0"
] | permissive | Pangeamt/nectm | 74b3052ba51f227cd508b89d3c565feccc0d2f4f | 6b84f048698f2530b9fdbb30695f2e2217c3fbfe | refs/heads/master | 2022-04-09T11:21:56.646469 | 2020-03-30T07:37:41 | 2020-03-30T07:37:41 | 250,306,101 | 1 | 0 | Apache-2.0 | 2020-03-26T16:05:11 | 2020-03-26T16:05:10 | null | UTF-8 | C++ | false | false | 2,586 | h | /*
* Data.h
* mert - Minimum Error Rate Training
*
* Created by Nicola Bertoldi on 13/05/08.
*
*/
#ifndef MERT_DATA_H_
#define MERT_DATA_H_
#include <vector>
#include <boost/shared_ptr.hpp>
#include "Util.h"
#include "FeatureData.h"
#include "ScoreData.h"
namespace MosesTuning
{
class Scorer;
typedef boost::shared_ptr<ScoreData> ScoreDataHandle;
typedef boost::shared_ptr<FeatureData> FeatureDataHandle;
// NOTE: there is no copy constructor implemented, so only the
// compiler synthesised shallow copy is available.
class Data
{
private:
Scorer* m_scorer;
std::string m_score_type;
std::size_t m_num_scores;
ScoreDataHandle m_score_data;
FeatureDataHandle m_feature_data;
SparseVector m_sparse_weights;
public:
explicit Data(Scorer* scorer, const std::string& sparseweightsfile="");
void clear() {
m_score_data->clear();
m_feature_data->clear();
}
ScoreDataHandle getScoreData() {
return m_score_data;
}
FeatureDataHandle getFeatureData() {
return m_feature_data;
}
Scorer* getScorer() {
return m_scorer;
}
std::size_t NumberOfFeatures() const {
return m_feature_data->NumberOfFeatures();
}
std::string Features() const {
return m_feature_data->Features();
}
void Features(const std::string &f) {
m_feature_data->Features(f);
}
void loadNBest(const std::string &file, bool oneBest=false);
void load(const std::string &featfile, const std::string &scorefile);
void save(const std::string &featfile, const std::string &scorefile, bool bin=false);
//ADDED BY TS
void removeDuplicates();
//END_ADDED
inline bool existsFeatureNames() const {
return m_feature_data->existsFeatureNames();
}
inline std::string getFeatureName(std::size_t idx) const {
return m_feature_data->getFeatureName(idx);
}
inline std::size_t getFeatureIndex(const std::string& name) const {
return m_feature_data->getFeatureIndex(name);
}
/**
* Create shard_count shards. If shard_size == 0, then the shards are non-overlapping
* and exhaust the data. If 0 < shard_size <= 1, then shards are chosen by sampling
* the data (with replacement) and shard_size is interpreted as the proportion
* of the total size.
*/
void createShards(std::size_t shard_count, float shard_size, const std::string& scorerconfig,
std::vector<Data>& shards);
// Helper functions for loadnbest();
void InitFeatureMap(const std::string& str);
void AddFeatures(const std::string& str,
int sentence_index);
};
}
#endif // MERT_DATA_H_
| [
"alexander.raginsky@gmail.com"
] | alexander.raginsky@gmail.com |
575477e5c72fd9169e07f5d891991930a32117ec | 199db94b48351203af964bada27a40cb72c58e16 | /lang/sw/gen/Bible3.h | 4b7df633678615576bb01216bffa9066d11cd4a6 | [] | no_license | mkoldaev/bible50cpp | 04bf114c1444662bb90c7e51bd19b32e260b4763 | 5fb1fb8bd2e2988cf27cfdc4905d2702b7c356c6 | refs/heads/master | 2023-04-05T01:46:32.728257 | 2021-04-01T22:36:06 | 2021-04-01T22:36:06 | 353,830,130 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 139,427 | h | #include <map>
#include <string>
class Bible3
{
struct sw1 { int val; const char *msg; };
struct sw2 { int val; const char *msg; };
struct sw3 { int val; const char *msg; };
struct sw4 { int val; const char *msg; };
struct sw5 { int val; const char *msg; };
struct sw6 { int val; const char *msg; };
struct sw7 { int val; const char *msg; };
struct sw8 { int val; const char *msg; };
struct sw9 { int val; const char *msg; };
struct sw10 { int val; const char *msg; };
struct sw11 { int val; const char *msg; };
struct sw12 { int val; const char *msg; };
struct sw13 { int val; const char *msg; };
struct sw14 { int val; const char *msg; };
struct sw15 { int val; const char *msg; };
struct sw16 { int val; const char *msg; };
struct sw17 { int val; const char *msg; };
struct sw18 { int val; const char *msg; };
struct sw19 { int val; const char *msg; };
struct sw20 { int val; const char *msg; };
struct sw21 { int val; const char *msg; };
struct sw22 { int val; const char *msg; };
struct sw23 { int val; const char *msg; };
struct sw24 { int val; const char *msg; };
struct sw25 { int val; const char *msg; };
struct sw26 { int val; const char *msg; };
struct sw27 { int val; const char *msg; };
public:
static void view1() {
struct sw1 poems[] = {
{1, "1 Bwana akamwita Musa, na kusema naye kutoka katika hema ya kukutania, akamwambia, "},
{2, "2 Nena na wana wa Israeli, uwaambie, Mtu wa kwenu atakapomtolea Bwana matoleo, mtatoa matoleo yenu katika wanyama wa mifugo, katika ng'ombe na katika kondoo. "},
{3, "3 Matoleo yake kwamba ni sadaka ya kuteketezwa ya ng'ombe, atatoa ng'ombe mume mkamilifu; ataleta mlangoni pa hema ya kukutania, ili akubaliwe mbele ya Bwana. "},
{4, "4 Kisha ataweka mkono wake juu ya kichwa cha hiyo sadaka ya kuteketezwa; nayo itakubaliwa kwa ajili yake, ili kufanya upatanisho kwa ajili yake. "},
{5, "5 Naye atamchinja huyo ng'ombe mbele ya Bwana; kisha wana wa Haruni, hao makuhani, wataileta karibu hiyo damu, na kuinyunyiza damu yake kando-kando katika madhabahu iliyo hapo mlangoni pa hema ya kukutania "},
{6, "6 Kisha atachuna sadaka ya kuteketeza na kuikata vipande vyake. "},
{7, "7 Kisha wana wa Haruni, watatia moto juu ya madhabahu, na kuzipanga kuni juu ya moto, "},
{8, "8 kisha wana wa Haruni, makuhani, watazipanga kuni zilizo juu ya moto uliopo juu ya madhabahu; "},
{9, "9 lakini matumbo yake, na miguu yake, ataiosha kwa maji; na huyo kuhani ataviteketeza vyote juu ya madhabahu, ili iwe sadaka ya kuteketezwa, dhabihu ya kusongezwa kwa njia ya moto, ya harufu ya kupendeza kwa Bwana. "},
{10, "10 Na matoleo yake kwamba ni katika kundi, katika kondoo, au katika mbuzi, kuwa sadaka ya kuteketezwa; atatoa mume mkamilifu. "},
{11, "11 Naye atamchinja hapo upande wa madhabahu ulioelekea kaskazini mbele za Bwana; na wana wa Haruni, hao makuhani, watainyunyiza damu yake juu ya madhabahu pande zote. "},
{12, "12 Kisha atamkata vipande vyake, pamoja na kichwa chake, na mafuta yake; kisha atavipanga vile vipande juu ya kuni zilizo juu ya madhabahu; "},
{13, "13 lakini matumbo yake, na miguu yake, ataosha kwa maji; na huyo kuhani atavisongeza vyote na kuviteketeza juu ya madhabahu; ni sadaka ya kuteketezwa, dhabihu ya kusongezwa kwa njia ya moto, ya harufu ya kupendeza kwa Bwana. "},
{14, "14 Na matoleo yake atakayomtolea Bwana kuwa sadaka ya kuteketezwa, kwamba ni katika ndege, ndipo atakapoleta matoleo yake katika hua au katika makinda ya njiwa. "},
{15, "15 Kisha kuhani atamleta karibu na madhabahu, naye atamkongonyoa kichwa, na kumteketeza kwa moto juu ya madhabahu; na damu yake itachuruzishwa kando ya madhabahu; "},
{16, "16 kisha atakiondoa kile kibofu chake, pamoja na taka zake, na kukitupa kando ya madhabahu upande wa mashariki, mahali pa majivu; "},
{17, "17 kisha atampasua na mabawa yake, lakini asimkate vipande viwili; kisha kuhani atamteketeza juu ya madhabahu, juu ya kuni zilizo juu ya moto; ni sadaka ya kuteketezwa, dhabihu ya kusongezwa kwa njia ya moto, ya harufu ya kupendeza kwa Bwana. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view2() {
struct sw2 poems[] = {
{1, "1 Na mtu atakapomtolea Bwana matoleo ya sadaka ya unga, matoleo yake yatakuwa ya unga mwembamba; naye ataumiminia mafuta, na kutia na ubani juu yake; "},
{2, "2 kisha atauleta kwa wana wa Haruni, hao makuhani; naye atatwaa konzi moja katika huo unga mwembamba, na katika mafuta yake, na huo ubani wote; kisha kuhani atauteketeza kuwa ndio ukumbusho wake juu ya madhabahu, ni kafara ya kusongezwa kwa njia ya moto, ya harufu ya kupendeza kwa Bwana; "},
{3, "3 na huo uliosalia wa ile sadaka ya unga utakuwa ni wa Haruni na wanawe; ni kitu kitakatifu sana katika sadaka zilizosongezwa kwa Bwana kwa njia ya moto. "},
{4, "4 Tena, utakapotoa matoleo ya sadaka ya unga uliookwa tanuuni, yatakuwa mikate isiyotiwa chachu, ya unga mwembamba uliokandwa na mafuta, au maandazi yasiyochachwa yaliyopakwa mafuta. "},
{5, "5 Tena matoleo yako kwamba ni sadaka ya unga wa kaangoni, yatakuwa ya unga mwembamba usiotiwa chachu, uliokandwa na mafuta. "},
{6, "6 Utaukata-kata vipande, na kutia mafuta juu yake; ni sadaka ya unga. "},
{7, "7 Tena matoleo yako kwamba ni sadaka ya unga ya chunguni, yataandaliwa kwa unga mwembamba pamoja na mafuta. "},
{8, "8 Nawe utamletea Bwana sadaka ya unga iliyofanywa ya vitu hivyo; nayo italetwa kwa kuhani, naye ndiye atakayeisongeza madhabahuni. "},
{9, "9 Kisha kuhani atatwaa humo huo ukumbusho wa sadaka ya unga, naye atauteketeza juu ya madhabahu; ni kafara ya kusongezwa kwa njia ya moto, ya harufu ya kupendeza kwa Bwana. "},
{10, "10 Na hicho kitakachosalia katika sadaka ya unga kitakuwa cha Haruni na wanawe; ni kitu kitakatifu sana katika sadaka zilizosongezwa kwa Bwana kwa njia ya moto. "},
{11, "11 Sadaka ya unga iwayo yote itakayosongezwa kwa Bwana isitiwe chachu kabisa; kwa kuwa hamtateketeza chachu, wala asali iwayo yote, kuwa ni sadaka ya kusongezwa kwa Bwana kwa njia ya moto. "},
{12, "12 Vitu hivyo mtavisongeza kwa Bwana kuwa ni malimbuko; lakini visifike juu ya madhabahu kuwa ni harufu ya kupendeza. "},
{13, "13 Tena, kila toleo la sadaka yako ya unga utalitia chumvi; wala usiiache sadaka yako ya unga kupungukiwa na chumvi ya agano la Mungu wako; utatoa chumvi pamoja na matoleo yako yote. "},
{14, "14 Nawe kwamba wamtolea Bwana sadaka ya unga ya malimbuko, utatoa hiyo ngano katika masuke yake iliyochomwa motoni, ngano iliyopondwa ya masuke mabichi, ndiyo utakayoleta kuwa sadaka ya unga ya malimbuko yako. "},
{15, "15 Nawe utatia mafuta juu yake, na kuweka ubani juu yake; ni sadaka ya unga. "},
{16, "16 Huyo kuhani atauteketeza ukumbusho wake, yaani, sehemu ya ngano iliyopondwa ya hiyo sadaka, na sehemu ya mafuta yake, pamoja na ule ubani wake wote; ni kafara ya kusongezwa kwa Bwana kwa njia ya moto. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view3() {
struct sw3 poems[] = {
{1, "1 Na matoleo yake kwamba ni sadaka za amani; kwamba asongeza katika ng'ombe, mume au mke, atamtoa huyo aliye mkamilifu mbele ya Bwana. "},
{2, "2 Naye ataweka mkono wake kichwani mwake huyo aliyemtoa, na kumchinja mlangoni pa hema ya kukutania; na wana wa Haruni, hao makuhani, watainyunyiza damu yake katika madhabahu pande zote. "},
{3, "3 Naye atasongeza katika sadaka hiyo ya amani, dhabihu kwa Bwana itakayofanywa kwa njia ya moto; yaani, mafuta yafunikayo matumbo, na mafuta yote yaliyo juu ya matumbo, "},
{4, "4 na figo zake mbili, na mafuta yaliyoshikamana nazo, yaliyo karibu na kiuno, na hicho kitambi kilicho katika ini, pamoja na hizo figo; hayo yote atayaondoa. "},
{5, "5 Na wana wa Haruni watayateketeza kwa moto juu ya madhabahu, juu ya sadaka ya kuteketezwa, iliyo katika kuni zilizo juu ya moto; ni dhabihu ya kusongezwa kwa njia ya moto, harufu ya kupendeza kwa Bwana. "},
{6, "6 Na matoleo yake kwa sadaka za amani atakayomchinjia Bwana, kwamba ni katika kundi la kondoo; mume au mke, atamtoa huyo aliye mkamilifu. "},
{7, "7 Kama akimtoa mwana-kondoo kuwa matoleo yake, ndipo atakapomtolea Bwana; "},
{8, "8 naye ataweka mkono wake kichwani mwake huyo aliyemsongeza, na kumchinja mlangoni pa hema ya kukutania; na wana wa Haruni watainyunyiza damu yake katika madhabahu pande zote. "},
{9, "9 Naye atasongeza katika sadaka hiyo ya amani dhabihu kwa Bwana, itakayofanywa kwa njia ya moto; yaani, mafuta yake, na mkia wenye mafuta mzima, atauondoa kwa kuukata hapo karibu na mfupa wa maungoni; na mafuta yafunikayo matumbo, na mafuta yote yaliyo katika matumbo, "},
{10, "10 na figo zake mbili, na mafuta yaliyoshikamana nazo, yaliyo karibu na kiuno chake, na kitambi kilicho katika ini, pamoja na hizo figo; hayo yote atayaondoa. "},
{11, "11 Naye kuhani atayateketeza kwa moto juu ya madhabahu; ni chakula cha dhabihu ya kusongezwa kwa Bwana kwa njia ya moto. "},
{12, "12 Na matoleo yake, kwamba ni mbuzi, ndipo atakapomtoa mbele za Bwana; "},
{13, "13 naye ataweka mkono wake kichwani mwake, na kumchinja hapo mbele ya hema ya kukutania; na wana wa Haruni watainyunyiza damu yake katika madhabahu pande zote. "},
{14, "14 Naye atasongeza katika sadaka hiyo matoleo yake, dhabihu kwa Bwana kwa njia ya moto; yaani, mafuta yafunikayo matumbo, na mafuta yote yaliyo katika matumbo, "},
{15, "15 na figo zake mbili, na mafuta yaliyoshikamana nazo, yaliyo karibu na kiuno chake, na kitambi kilicho katika ini pamoja na hizo figo mbili; hayo yote atayaondoa. "},
{16, "16 Naye kuhani atayateketeza kwa moto juu ya madhabahu; ni chakula cha dhabihu ya kusongezwa kwa njia ya moto, iwe harufu ya kupendeza; mafuta yote ni ya Bwana. "},
{17, "17 Neno hili litakuwa amri ya daima, katika vizazi vyenu vyote, ndani ya nyumba zenu zote, ya kwamba hamtakula mafuta wala damu kabisa. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view4() {
struct sw4 poems[] = {
{1, "1 Bwana akanena na Musa, na kumwambia, "},
{2, "2 Haya, nena na wana wa Israeli, uwaambie, Kama mtu ye yote akifanya dhambi pasipo kukusudia, katika neno lo lote ambalo Bwana amelizuilia lisifanywe, na kutenda neno lo lote la maneno hayo; "},
{3, "3 kama kuhani aliyetiwa mafuta akifanya dhambi, hata analeta hatia juu ya watu; ndipo na atoe kwa ajili ya dhambi yake aliyoifanya, na kumsongeza kwa Bwana ng'ombe mume mchanga mkamilifu, kuwa ni sadaka ya dhambi. "},
{4, "4 Naye atamleta huyo ng'ombe na kumweka mlangoni pa hiyo hema ya kukutania, mbele za Bwana; naye ataweka mkono wake kichwani mwake ng'ombe, na kumchinja huyo ng'ombe mbele za Bwana. "},
{5, "5 Kisha huyo kuhani aliyetiwa mafuta atatwaa baadhi ya damu ya huyo ng'ombe, na kuileta ndani ya hiyo hema ya kukutania; "},
{6, "6 kisha kuhani atatia kidole chake katika hiyo damu na kuinyunyiza damu mbele ya Bwana mara saba, mbele ya pazia la mahali patakatifu. "},
{7, "7 Kisha kuhani atatia baadhi ya hiyo damu juu ya pembe za madhabahu ya kufukizia uvumba mzuri mbele ya Bwana iliyo ndani ya hema ya kukutania; kisha damu yote ya huyo ng'ombe ataimwaga hapo chini ya madhabahu ya sadaka ya kuteketezwa, iliyoko mlangoni pa hema ya kukutania. "},
{8, "8 Kisha mafuta yote ya huyo ng'ombe wa sadaka ya dhambi atayaondoa; mafuta yote yafunikayo matumbo, na mafuta yote yaliyo katika matumbo, "},
{9, "9 na figo zake mbili, na mafuta yaliyoshikamana nazo, yaliyo karibu na kiuno chake, na kitambi kilicho katika ini, pamoja na hizo figo, hayo yote atayaondoa, "},
{10, "10 vile vile kama yanavyoondolewa katika ng'ombe wa kuchinjwa kwa sadaka za amani; kisha huyo kuhani atayateketeza juu ya madhabahu ya sadaka ya kuteketezwa. "},
{11, "11 Kisha ngozi yake ng'ombe, na nyama yake yote, pamoja na kichwa chake, na pamoja na miguu yake, na matumbo yake, na mavi yake, "},
{12, "12 maana, huyo ng'ombe mzima atamchukua nje ya marago hata mahali safi, hapo wamwagapo majivu, naye atamchoma moto juu ya kuni; atachomwa moto hapo majivu yamwagwapo. "},
{13, "13 Na kama mkutano mzima wa Israeli ukifanya dhambi, na jambo lenyewe likayafichamania macho ya huo mkutano, nao wamefanya mojawapo katika mambo yaliyozuiliwa na Bwana, kwamba wasiyafanye, nao wamepata hatia; "},
{14, "14 hapo itakapojulikana hiyo dhambi waliyoifanya, ndipo mkutano utatoa ng'ombe mume mchanga awe sadaka ya dhambi, na kumleta mbele ya hema ya kukutania. "},
{15, "15 Kisha wazee wa mkutano wataweka mikono yao kichwani mwake huyo ng'ombe mbele za Bwana; "},
{16, "16 kisha ng'ombe atachinjwa mbele za Bwana. Kisha kuhani aliyetiwa mafuta atatwaa katika damu ya huyo ng'ombe na kuileta ndani ya hema ya kukutania; "},
{17, "17 kisha kuhani atatia kidole chake katika hiyo damu, na kuinyunyiza mbele za Bwana, mbele ya pazia mara saba. "},
{18, "18 Kisha nyingine katika hiyo damu ataitia katika pembe za madhabahu iliyo mbele za Bwana, iliyoko ndani ya hema ya kukutania, kisha damu yote ataimwaga hapo chini ya madhabahu ya sadaka ya kuteketezwa, iliyo mlangoni pa hema ya kukutania. "},
{19, "19 Kisha atayaondoa mafuta yake yote na kuyateketeza juu ya madhabahu. "},
{20, "20 Ndivyo atakavyomfanyia huyo ng'ombe; kama alivyomfanyia huyo ng'ombe wa sadaka ya dhambi, atamfanyia na huyu vivyo; naye kuhani atawafanyia upatanisho, nao watasamehewa. "},
{21, "21 Kisha atamchukua huyo ng'ombe nje ya marago, na kumchoma moto vile vile kama alivyomchoma moto ng'ombe wa kwanza; ni sadaka ya dhambi kwa ajili ya mkutano. "},
{22, "22 Mtawala atakapofanya dhambi, na kutenda pasipo kukusudia neno lo lote katika hayo ambayo Bwana, Mungu wake, aliyazuilia yasifanywe, naye amepata hatia; "},
{23, "23 akijulishwa hiyo dhambi yake aliyoifanya, ataleta mbuzi awe matoleo yake, mume, mkamilifu; "},
{24, "24 kisha ataweka mkono wake kichwani mwake huyo mbuzi, na kumchinja hapo wachinjapo sadaka ya kuteketezwa mbele za Bwana; ni sadaka ya dhambi. "},
{25, "25 Kisha kuhani atatwaa katika damu ya hiyo sadaka ya dhambi kwa kidole chake, na kuitia katika pembe za madhabahu ya sadaka ya kuteketezwa, nayo damu yake ataimwaga hapo chini ya madhabahu ya kuteketeza. "},
{26, "26 Na mafuta yake yote atayateketeza juu ya madhabahu, kama alivyoyateketeza mafuta ya hizo sadaka za amani; naye kuhani atamfanyia upatanisho kwa ajili ya dhambi yake, naye atasamehewa. "},
{27, "27 Na mtu awaye yote katika watu wa nchi akifanya dhambi pasipo kukusudia, kwa kufanya neno lo lote katika hayo ambayo Bwana alizuilia yasifanywe, naye akapata hatia; "},
{28, "28 akijulishwa hiyo dhambi yake aliyoifanya, ndipo atakapoleta mbuzi mke mkamilifu, awe matoleo yake kwa ajili ya dhambi yake aliyoifanya. "},
{29, "29 Naye ataweka mkono wake kichwani mwake hiyo sadaka ya dhambi, na kumchinja sadaka ya dhambi mahali hapo pa sadaka ya kuteketezwa. "},
{30, "30 Kisha kuhani atatwaa katika hiyo damu yake kwa kidole chake, na kuitia katika pembe za madhabahu ya kuteketeza na damu yake yote ataimwaga chini ya madhabahu. "},
{31, "31 Kisha atayaondoa mafuta yake yote, kama vile mafuta yanavyoondolewa katika hizo sadaka za amani; kisha kuhani atayateketeza juu ya madhabahu, iwe harufu ya kupendeza kwa Bwana; na kuhani atafanya upatanisho kwa ajili yake, naye atasamehewa. "},
{32, "32 Naye akileta mwana-kondoo kuwa sadaka ya dhambi, ataleta wa kike mkamilifu. "},
{33, "33 Naye ataweka mkono wake kichwani mwake sadaka ya dhambi, kisha atamchinja awe sadaka ya dhambi, mahali hapo wachinjapo sadaka ya kuteketezwa. "},
{34, "34 Kisha kuhani atatwaa katika hiyo damu ya sadaka ya kuteketezwa kwa kidole chake na kuitia katika pembe za madhabahu ya sadaka ya kuteketezwa, kisha damu yake yote ataimwaga hapo chini ya madhabahu; "},
{35, "35 kisha atayaondoa mafuta yake yote, kama mafuta ya mwana-kondoo yalivyoondolewa katika hizo sadaka za amani; kisha kuhani atayateketeza juu ya madhabahu, kwa desturi ya hizo sadaka za Bwana zilizosongezwa kwa njia ya moto; na kuhani atamfanyia upatanisho kwa ajili ya hiyo dhambi yake aliyoifanya, naye atasamehewa. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view5() {
struct sw5 poems[] = {
{1, "1 Na mtu awaye yote akifanya dhambi, kwa kuwa ameisikia sauti yenye kuapisha, naye akawa ni shahidi, kwamba aliona au kujua, asipolifunua neno lile, ndipo atakapochukua uovu wake mwenyewe; "},
{2, "2 au kama mtu akigusa kitu kilicho najisi, kama ni mzoga wa mnyama wa nyikani aliye najisi, au kama ni mzoga wa mnyama wa mfugo aliye najisi, au kama ni mzoga wa mdudu aliye najisi, naye jambo hilo linamfichamania, akapata kuwa najisi, ndipo atakapochukua uovu wake; "},
{3, "3 au kama akiugusa uchafu wa binadamu, uchafu uwao wote ambao kwa huo amepata unajisi, na jambo hilo linamfichamania, hapo apatapo kulijua, ndipo atakapokuwa na hatia; "},
{4, "4 au, kama mtu akijiapisha, kwa kutamka haraka kwa midomo yake, kutenda uovu, au kutenda mema, neno lo lote mtu atakalolitamka kwa kiapo pasipo kufikiri, na neno hilo likamfichamania; hapo atakapolijua, ndipo atakapokuwa na hatia katika mambo hayo mojawapo; "},
{5, "5 kisha itakuwa, hapo atakapokuwa na hatia katika mambo hayo mojawapo, ndipo atakapoliungama jambo hilo alilolikosa; "},
{6, "6 naye atamletea Bwana sadaka yake ya hatia kwa ajili ya hiyo dhambi yake aliyoifanya, mwana-kondoo wa kike, au mbuzi mke, kutoka katika kundi lake, kuwa ni sadaka ya dhambi; kisha kuhani atamfanyia upatanisho kwa ajili ya hiyo dhambi yake. "},
{7, "7 Lakini asipomweza mwana-kondoo, ndipo atakapomletea Bwana hua wawili, au makinda mawili ya njiwa, kuwa ni sadaka yake ya hatia ya jambo hilo alilolikosa; mmoja wa hao ndege kwa sadaka ya dhambi, na wa pili kwa sadaka ya kuteketezwa. "},
{8, "8 Naye atawaleta kwa kuhani, atakayemsongeza kwanza yule wa sadaka ya dhambi, naye atamkongonyoa kichwa shingoni mwake, lakini asimpasue vipande viwili; "},
{9, "9 kisha baadhi ya damu ya hiyo sadaka ya dhambi atainyunyiza katika ubavu wa madhabahu; na damu iliyosalia itachuruzishwa hapo chini ya madhabahu; ni sadaka ya dhambi. "},
{10, "10 Kisha huyo ndege wa pili atamsongeza kuwa sadaka ya kuteketezwa, sawasawa na sheria; na kuhani atamfanyia upatanisho kwa ajili ya hiyo dhambi yake aliyoifanya, naye atasamehewa. "},
{11, "11 Lakini asipowaweza hua wawili, au makinda mawili ya njiwa, ndipo hapo atakapoleta matoleo yake kwa ajili ya neno hilo alilolikosa, sehemu ya kumi ya efa ya unga mwembamba, kuwa sadaka yake ya dhambi; asitie mafuta juu yake, wala ubani usitiwe juu yake; maana, ni sadaka ya dhambi. "},
{12, "12 Naye atamletea kuhani, na kuhani atatwaa konzi yake ya huo unga kuwa ukumbusho wake, na kuuteketeza juu ya madhabahu, juu ya sadaka zilizosongezwa kwa Bwana kwa njia ya moto; ni sadaka ya dhambi. "},
{13, "13 Na huyo kuhani atamfanyia upatanisho kwa ajili ya dhambi yake ambayo katika mambo hayo mojawapo amefanya dhambi, naye atasamehewa; na unga uliosalia utakuwa wa kuhani, kama hiyo sadaka ya unga ilivyokuwa. "},
{14, "14 Kisha Bwana akanena na Musa, na kumwambia, "},
{15, "15 Mtu awaye yote akiasi na kufanya dhambi naye hakukusudia, katika mambo matakatifu ya Bwana; ndipo atakapomletea Bwana sadaka yake ya hatia, kondoo mume mkamilifu katika kundi lake; sawasawa na hesabu utakayomwandikia katika shekeli za fedha, kwa shekeli ya mahali patakatifu, kuwa sadaka ya hatia; "},
{16, "16 naye atalipa kwa ajili ya hilo alilolikosa katika kitu kile kitakatifu, kisha ataongeza na sehemu ya tano, na kumpa kuhani; naye kuhani atafanya upatanisho kwa ajili yake kwa huyo kondoo mume wa sadaka ya hatia, naye atasamehewa. "},
{17, "17 Na kama mtu akifanya dhambi, na kutenda mambo hayo mojawapo ambayo Bwana alizuilia yasifanywe, ajapokuwa hakuyajua, ni mwenye hatia vivyo, naye atachukua uovu wake. "},
{18, "18 Naye ataleta kondoo mume wa kundi lake, mkamilifu, sawasawa na hesabu utakayomwandikia, kuwa sadaka ya hatia, amsongeze kwa huyo kuhani; na kuhani atamfanyia upatanisho kwa ajili ya jambo hilo alilolikosa pasipo kukusudia, asilijue, naye atasamehewa. "},
{19, "19 Ni sadaka ya hatia; hakika yake ni mwenye hatia mbele za Bwana. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view6() {
struct sw6 poems[] = {
{1, "1 Bwana akanena na Musa, na kumwambia, "},
{2, "2 Mtu awaye yote akifanya dhambi, na kuasi juu ya Bwana, akamdanganya mwenziwe katika jambo la amana, au la mapatano, au la kunyang'anya, au kumwonea mwenziwe; "},
{3, "3 au kuzumbua kitu kilichopotea na kutenda la uongo juu yake, na kuapa kwa uongo; katika mambo hayo yote mojawapo atakalolitenda mtu, na kufanya dhambi kwalo; "},
{4, "4 ndipo itakapokuwa, akiwa amefanya dhambi, na kupata hatia, atarudisha hicho alichokipata kwa kunyang'anya, au kitu kile alichokipata kwa kuonea, au ile amana aliyowekewa, au kitu kile kilichopotea alichokizumbua yeye, "},
{5, "5 au kitu cho chote ambacho amekiapia uongo; atakirudisha hata kwa utimilifu wake, kisha ataongeza na sehemu ya tano zaidi juu yake; naye atampa huyo mwenyewe, siku hiyo ambayo atakapohukumiwa kuwa mwenye hatia. "},
{6, "6 Kisha ataleta sadaka yake ya hatia kwa Bwana, ni kondoo mume wa katika kundi lake, mkamilifu, sawasawa na hesabu utakayomwandikia, kuwa sadaka ya hatia, na kumpa kuhani; "},
{7, "7 na huyo kuhani atafanya upatanisho kwa ajili yake mbele za Bwana, naye atasamehewa; katika jambo lo lote alifanyalo hata akapata kuwa mwenye hatia kwalo. "},
{8, "8 Bwana akanena na Musa na kumwambia, "},
{9, "9 Haya, mwagize Haruni na wanawe, uwaambie, Amri ya sadaka ya kuteketezwa ni hii; hiyo sadaka ya kuteketezwa itakuwa pale motoni juu ya madhabahu usiku wote hata asubuhi; na huo moto wa madhabahu utawaka juu yake usizimike. "},
{10, "10 Naye kuhani atavaa nguo yake ya kitani, na suruali zake za kitani atazivaa mwilini mwake; naye atayazoa majivu ambayo huo moto umeiteketezea sadaka juu ya madhabahu, kisha atayaweka kando ya madhabahu. "},
{11, "11 Kisha atayavua mavazi yake, na kuvaa mavazi mengine, kisha atayachukua yale majivu kwenda nayo nje ya marago hata mahali safi. "},
{12, "12 Na huo moto ulio madhabahuni atautunza uwake daima juu yake, usizimike; naye kuhani atateketeza kuni katika moto huo kila siku asubuhi; naye ataipanga sadaka ya kuteketezwa juu yake, naye atayateketeza mafuta ya sadaka za amani juu yake. "},
{13, "13 Moto utatunzwa uwake juu ya madhabahu daima; usizimike. "},
{14, "14 Na amri ya hiyo sadaka ya unga ni hii; wana wa Haruni wataisongeza mbele za Bwana, mbele ya madhabahu. "},
{15, "15 Naye atatwaa konzi yake katika huo unga, katika huo unga mwembamba wa sadaka ya unga, na katika mafuta yake, na ubani wote ulio juu ya sadaka ya unga, kisha atauteketeza juu ya madhabahu kuwa harufu ya kupendeza, kuwa ukumbusho wake kwa Bwana. "},
{16, "16 Na unga uliosalia Haruni na wanawe wataula; utaliwa pasipo kutiwa chachu, katika mahali patakatifu; katika ua wa hema ya kukutania ndipo watakapoula. "},
{17, "17 Hautaokwa na chachu. Nimewapa kuwa sehemu yao katika matoleo yangu yasongezwayo kwa njia ya moto; ni kitu kitakatifu sana, kama hiyo sadaka ya dhambi, na kama hiyo sadaka ya hatia. "},
{18, "18 Kila mwana mume miongoni mwa wana wa Haruni atakula katika huo, kuwa ni haki yao milele katika vizazi vyenu, katika matoleo ya Bwana yasongezwayo kwa njia ya moto; mtu awaye yote atakayevigusa atakuwa ni mtakatifu "},
{19, "19 Bwana akanena na Musa, na kumwambia, "},
{20, "20 Matoleo ya Haruni na wanawe watakayomtolea Bwana, katika siku atakayotiwa mafuta, ni haya; sehemu ya kumi ya efa ya unga mwembamba kuwa sadaka ya unga daima, nusu yake asubuhi, na nusu yake jioni. "},
{21, "21 Utaandaliwa kaangoni pamoja na mafuta; ukisha kulowama utauleta ndani; utasongeza hiyo sadaka ya unga vipande vilivyookwa, iwe harufu ya kupendeza kwa Bwana. "},
{22, "22 Na huyo kuhani aliyetiwa mafuta badala yake katika hao wanawe ataisongeza; itateketezwa kabisa kwa Bwana kwa amri ya milele. "},
{23, "23 Tena kila sadaka ya unga ya kuhani itateketezwa kabisa; isiliwe. "},
{24, "24 Bwana akanena na Musa, na kumwambia, "},
{25, "25 Nena na Haruni na wanawe, uwaambie, Amri ya hiyo sadaka ya dhambi ni hii; mahali hapo pachinjwapo sadaka ya kuteketezwa ndipo itakapochinjwa sadaka ya dhambi, mbele za Bwana; ni takatifu sana. "},
{26, "26 Huyo kuhani atakayeisongeza kwa ajili ya dhambi ndiye atakayeila; italiwa katika mahali patakatifu, katika ua wa hema ya kukutania. "},
{27, "27 Kila kitu kitakachoigusa nyama ya sadaka hiyo kitakuwa kitakatifu; tena itakapomwagika damu yake yo yote katika nguo yo yote, utaifua nguo hiyo iliyomwagiwa, katika mahali patakatifu. "},
{28, "28 Lakini hicho chombo cha udongo ambacho hiyo nyama ilipikwa ndani yake kitavunjwa; na kama ikipikwa katika chombo cha shaba, kitasuguliwa, na kuoshwa kwa maji. "},
{29, "29 Kila mwana mume miongoni mwa makuhani atakula katika hiyo; ni takatifu sana. "},
{30, "30 Wala haitaliwa sadaka ya dhambi yo yote, ambayo damu yake yo yote ililetwa ndani ya hema ya kukutania, ili kufanya upatanisho katika mahali patakatifu; itachomwa moto. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view7() {
struct sw7 poems[] = {
{1, "1 Na sheria ya hiyo sadaka ya hatia ni hii; ni takatifu sana. "},
{2, "2 Wataichinja sadaka ya hatia pale pale waichinjapo sadaka ya kuteketezwa; na damu yake atainyunyiza katika madhabahu pande zote. "},
{3, "3 Katika sadaka hiyo atasongeza mafuta yake yote; yaani, mkia wake wenye mafuta, na mafuta yafunikayo matumbo, "},
{4, "4 na figo zake mbili, na mafuta yaliyoshikamana nazo, yaliyo karibu na kiuno chake, na kitambi kilicho katika ini, pamoja na figo zake mbili, hayo yote atayaondoa; "},
{5, "5 na kuhani atayateketeza juu ya madhabahu, kuwa dhabihu kwa Bwana kwa njia ya moto; ni sadaka ya hatia. "},
{6, "6 Kila mtu mume miongoni mwa makuhani atakula katika sadaka hiyo; italiwa katika mahali patakatifu; ni takatifu sana. "},
{7, "7 Kama hiyo sadaka ya dhambi ilivyo, na sadaka ya hatia ni vivyo; sheria yake ni moja; huyo kuhani afanyaye upatanisho kwayo, ndiye atakayekuwa nayo. "},
{8, "8 Tena kuhani atakayesongeza sadaka ya kuteketezwa ya mtu awaye yote, huyo kuhani atatwaa awe nayo ngozi ya huyo mnyama wa sadaka ya kuteketezwa aliyemsongeza. "},
{9, "9 Na kila sadaka ya unga iliyookwa mekoni, na yote yaliyoandaliwa chunguni, au kaangoni, yote yatakuwa ya huyo kuhani aliyeyasongeza. "},
{10, "10 Na kila sadaka ya unga, kama umeandaliwa na mafuta, au kama ni mkavu, watautwaa wana wote wa Haruni kuutumia, kila mtu sawasawa. "},
{11, "11 Na sheria ya matoleo ya sadaka za amani, atakazosongeza mtu kwa Bwana, ni hii. "},
{12, "12 Kwamba aitoa kwa ajili ya shukrani, ndipo atakaposongeza pamoja na hiyo sadaka ya shukrani mikate isiyotiwa chachu, iliyoandaliwa na mafuta, na mikate ya kaki isiyochachwa iliyopakwa mafuta, na mikate ya unga mwembamba uliolowama mafuta. "},
{13, "13 Ataleta matoleo yake, pamoja na mikate iliyotiwa chachu, na pamoja na sadaka zake za amani, kwa ajili ya shukrani. "},
{14, "14 Na katika hayo atasongeza kimoja katika kila toleo kiwe sadaka ya kuinuliwa kwa Bwana; itakuwa ni ya kuhani atakayeinyunyiza hiyo damu ya sadaka za amani. "},
{15, "15 Na hiyo nyama ya sadaka zake za amani zilizochinjwa kwa ajili ya shukrani italiwa siku iyo hiyo ya matoleo yake; asisaze yo yote hata asubuhi. "},
{16, "16 Lakini kwamba hii sadaka ya matoleo yake ni nadhiri, au sadaka ya hiari, italiwa siku hiyo aliyoileta sadaka yake; kisha siku ya pili yake kitakachosalia kitaliwa; "},
{17, "17 lakini hicho kitakachosalia, katika hizo nyama za sadaka, hata siku ya tatu kitachomwa moto. "},
{18, "18 Tena kama nyama yo yote katika hiyo dhabihu yake ya sadaka za amani ikiliwa siku ya tatu, haitakubaliwa, wala haitahesabiwa kwake huyo mwenye kuisongeza; itakuwa ni machukizo, na mtu atakayeila atachukua uovu wake. "},
{19, "19 Tena nyama itakayogusa kitu kilicho najisi haitaliwa; itachomwa moto. Na katika hiyo nyama nyingine, kila mtu aliye safi ana ruhusa kuila; "},
{20, "20 lakini mtu huyo atakayekula katika nyama ya sadaka za amani, ambazo ni za Bwana, na unajisi wake akiwa nao juu yake, mtu huyo atakatiliwa mbali na watu wake. "},
{21, "21 Kisha mtu awaye yote atakapogusa kitu cho chote kilicho najisi, uchafu wa binadamu, au mnyama aliye najisi, au machukizo yo yote yaliyo najisi, kisha akala nyama ya dhabihu ya sadaka za amani, ambazo ni za Bwana, mtu huyo atakatiliwa mbali na watu wake. "},
{22, "22 Bwana akanena na Musa, na kumwambia, "},
{23, "23 Nena na wana wa Israeli, uwaambie, Msile mafuta yo yote, ya ng'ombe, wala ya kondoo, wala ya mbuzi. "},
{24, "24 Tena mafuta ya mnyama afaye mwenyewe, na mafuta ya mnyama aliyeraruliwa na wanyama, mna ruhusa kuyatumia kwa ajili ya matumizi mengine; lakini msiyale kabisa. "},
{25, "25 Kwani huyo mtu atakayekula mafuta ya mnyama, ambaye ni katika wanyama ambao watu husongeza sadaka kwa Bwana kwa moto, mtu huyo atakayekula mafuta hayo atakatiliwa mbali na watu wake. "},
{26, "26 Tena msiile damu yo yote, ama ya ndege, ama ya mnyama, katika nyumba zenu zote. "},
{27, "27 Mtu ye yote alaye damu, mtu huyo atakatiliwa mbali na watu wake. "},
{28, "28 Bwana akanena na Musa, na kumwambia, "},
{29, "29 Nena na wana wa Israeli uwaambie, Yeye asongezaye dhabihu yake ya sadaka za amani kwa Bwana, atamletea Bwana matoleo yake, kutoka katika ile dhabihu ya sadaka zake za amani; "},
{30, "30 mikono yake mwenyewe itamletea hizo sadaka za kusongezwa kwa moto; mafuta yake pamoja na kidari atayaleta, ili kwamba hicho kidari kitikiswe kuwa sadaka ya kutikiswa mbele ya Bwana. "},
{31, "31 Kuhani atayateketeza hayo mafuta juu ya madhabahu; lakini hicho kidari kitakuwa cha Haruni na cha wanawe. "},
{32, "32 Mguu wa nyuma wa upande wa kuume mtampa kuhani kuwa sadaka ya kuinuliwa kutoka katika hizo sadaka zenu za amani. "},
{33, "33 Katika wana wa Haruni, huyo atakayeisongeza damu ya sadaka za amani, na mafuta yake, yeye atapata mguu wa nyuma wa upande wa kuume kuwa sehemu yake. "},
{34, "34 Kwa maana, hicho kidari cha kutikiswa, na huo mguu wa kuinuliwa, nimevitwaa kwa wana wa Israeli, katika dhabihu zao za sadaka za amani, nami nimempa Haruni kuhani na wanawe, kuwa haki yao ya milele kutoka kwa wana wa Israeli. "},
{35, "35 Hii ndiyo sehemu ya Haruni, na sehemu ya wanawe, katika kutiwa mafuta kwao, katika hizo dhabihu zisongezwazo kwa Bwana kwa njia ya moto, siku hiyo aliyowaweka ili wamtumikie Bwana katika kazi ya ukuhani; "},
{36, "36 sehemu ambayo Bwana aliagiza wapewe na wana wa Israeli, siku hiyo aliyowatia mafuta. Ni haki yao ya milele katika vizazi vyao vyote. "},
{37, "37 Sheria ya sadaka ya kuteketezwa ni hii, na ya sadaka ya unga, na ya sadaka ya dhambi, na ya sadaka ya hatia, na ya kuwekwa wakfu, na ya sadaka za amani; "},
{38, "38 ambazo Bwana alimwagiza Musa katika mlima wa Sinai, siku hiyo aliyowaagiza wana wa Israeli wamtolee Bwana matoleo yao, huko katika jangwa la Sinai. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view8() {
struct sw8 poems[] = {
{1, "1 Bwana akanena na Musa, na kumwambia, "},
{2, "2 Mtwae Haruni, na wanawe pamoja naye, na yale mavazi, na mafuta ya kutia, na ng'ombe mume wa sadaka ya dhambi, na kondoo waume wawili, na kikapu cha mikate isiyotiwa chachu; "},
{3, "3 kisha ukutanishe mkutano wote hapo mlangoni pa hema ya kukutania. "},
{4, "4 Basi Musa akafanya kama alivyoambiwa na Bwana; na huo mkutano ulikutanishwa mlangoni pa hema ya kukutania. "},
{5, "5 Musa akawaambia mkutano, Neno aliloliagiza Bwana kwamba lifanywe, ni hili. "},
{6, "6 Basi Musa akawaleta Haruni na wanawe, akawaosha kwa maji. "},
{7, "7 Kisha akamvika Haruni ile kanzu, na kumfunga mshipi, na kumvika joho, na kumvika naivera, na kumfunga huo mshipi wa kazi ya mstadi wa naivera na kumfunga naivera kwa huo mshipi. "},
{8, "8 Kisha akamtia kile kifuko cha kifuani; akatia hizo Urimu na Thumimu katika hicho kifuko cha kifuani. "},
{9, "9 Akamvika na kile kilemba kichwani mwake; na juu ya kilemba, upande wa mbele, akakitia kile kipande cha dhahabu, hiyo taji takatifu; kama Bwana alivyomwagiza Musa. "},
{10, "10 Kisha Musa akatwaa hayo mafuta matakatifu ya kutia, akatia mafuta maskani, na vyote vilivyokuwamo, na kuvitakasa. "},
{11, "11 Kisha akanyunyiza hayo mafuta juu ya madhabahu mara saba, na kuitia mafuta madhabahu na vyombo vyake vyote, na birika na tako lake, ili kuvitakasa. "},
{12, "12 Kisha akamimina mafuta hayo ya kutia kichwani mwake Haruni, na kumtia mafuta, ili amtakase. "},
{13, "13 Kisha Musa akawaleta wana wa Haruni, na kuwavika kanzu, na kuwafunga mishipi, na kuwavika vilemba; kama Bwana alivyomwagiza Musa. "},
{14, "14 Kisha akamleta yule ng'ombe mume wa sadaka ya dhambi; na Haruni na wanawe wakaweka mikono yao katika kichwa cha huyo ng'ombe wa sadaka ya dhambi. "},
{15, "15 Kisha akamchinja; na Musa akaitwaa damu yake, akaitia katika pembe za madhabahu pande zote kwa kidole chake, akaitakasa madhabahu, kisha akaimwaga hiyo damu hapo chini ya madhabahu, na kuitakasa, ili afanye upatanisho kwa ajili yake. "},
{16, "16 Kisha akayatwaa mafuta yote yaliyokuwa katika matumbo yake, na kitambi kilichokuwa katika ini, na figo zake mbili, na mafuta yake, na Musa akayateketeza juu ya madhabahu. "},
{17, "17 Lakini huyo ng'ombe mwenyewe, na ngozi yake, na nyama yake, na mavi yake, akayachoma moto nje ya marago; vile vile kama Bwana alivyomwagiza Musa. "},
{18, "18 Kisha akamsongeza yule kondoo mume wa sadaka ya kuteketezwa; na Haruni na wanawe wakaweka mikono yao kichwani mwa huyo kondoo. "},
{19, "19 Kisha akamchinja; na Musa akainyunyiza damu yake katika madhabahu pande zote. "},
{20, "20 Kisha akamkata kondoo vipande vyake; na Musa akateketeza kichwa, na vile vipande, na mafuta. "},
{21, "21 Kisha akayaosha matumbo na miguu yake kwa maji; na Musa akamteketeza huyo kondoo wote juu ya madhabahu; ilikuwa ni sadaka ya kuteketezwa kuwa harufu ya kupendeza; ilikuwa ni sadaka iliyosongezwa kwa Bwana kwa njia ya moto; kama Bwana alivyomwagiza Musa. "},
{22, "22 Kisha akamsongeza kondoo mume wa pili, huyo kondoo wa kuwaweka wakfu; na Haruni na wanawe wakaweka mikono yao kichwani mwa huyo kondoo. "},
{23, "23 Kisha akamchinja; na Musa akatwaa katika damu yake, na kuitia katika ncha ya sikio la kuume la Haruni, na katika chanda chake cha gumba cha mkono wake wa kuume, na katika kidole cha gumba cha guu lake la kuume. "},
{24, "24 Kisha akawaleta wana wa Haruni, na Musa akaitia hiyo damu katika ncha za masikio ya kuume, na katika vyanda vya gumba vya mikono yao ya kuume, na katika vidole vya gumba vya maguu yao ya kuume; kisha Musa akainyunyiza hiyo damu katika madhabahu pande zote. "},
{25, "25 Kisha akayatwaa hayo mafuta, na mkia wenye mafuta, na mafuta yote yaliyokuwa katika matumbo, na kitambi cha ini, na figo mbili, na mafuta yake, na mguu wa nyuma wa upande wa kuume; "},
{26, "26 kisha katika kikapu cha mikate isiyotiwa chachu, kilichokuwa pale mbele za Bwana, akatwaa mkate mmoja usiochachwa, na mkate mmoja ulioandaliwa na mafuta na kaki moja nyembamba, akaiweka juu ya mafuta, na juu ya huo mguu wa nyuma wa upande wa kuume; "},
{27, "27 kisha akaweka vyote katika mikono ya Haruni, na katika mikono ya wanawe, na kuvitikisa huku na huku viwe sadaka ya kutikiswa mbele za Bwana. "},
{28, "28 Kisha Musa akavitwaa tena mikononi mwao, na kuviteketeza juu ya madhabahu, juu ya hiyo sadaka ya kuteketezwa vilikuwa vya kuwaweka wakfu, ni harufu nzuri; ilikuwa dhabihu iliyosongezwa kwa Bwana kwa moto. "},
{29, "29 Kisha Musa akakitwaa kile kidari, akakitikisa huku na huku, kiwe sadaka ya kutikiswa mbele za Bwana; ni sehemu ya Musa katika huyo kondoo mume wa kuwaweka wakfu; kama Bwana alivyomwagiza Musa. "},
{30, "30 Kisha Musa akatwaa baadhi ya mafuta ya kutia, na ya damu iliyokuwa pale juu ya madhabahu, na kumnyunyizia Haruni, katika mavazi yake, na wanawe, katika mavazi yao, pamoja naye; akamtakasa Haruni, na mavazi yake, na wanawe, na mavazi ya wanawe, pamoja naye. "},
{31, "31 Kisha Musa akawaambia huyo Haruni na wanawe, Tokoseni hiyo nyama mlangoni pa hema ya kukutania; mkaile pale pale, na hiyo mikate iliyo katika kile kikapu cha kuwaweka wakfu, kama nilivyoagizwa kusema, Haruni na wanawe wataila. "},
{32, "32 Nacho kitakachosalia katika hiyo nyama na mikate mtakichoma moto. "},
{33, "33 Wala msitoke nje mlangoni pa hema ya kukutania muda wa siku saba, hata siku za kuwekwa wakfu kwenu zitakapotimia; kwa kuwa atawaweka muda wa siku saba. "},
{34, "34 Vile vile kama vilivyotendeka siku ya leo, ni vivyo Bwana alivyoagiza kufanywa, ili kufanya upatanisho kwa ajili yenu. "},
{35, "35 Nanyi mtakaa mlangoni pa hema ya kukutania muda wa siku saba mchana na usiku, na kuulinda ulinzi wa Bwana ili kwamba msife; kwani ndivyo nilivyoagizwa. "},
{36, "36 Basi Haruni na wanawe wakafanya mambo hayo yote Bwana aliyoyaagiza kwa mkono wa Musa. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view9() {
struct sw9 poems[] = {
{1, "1 Basi ilikuwa siku ya nane, Musa akawaita Haruni na wanawe, pamoja na wazee wa Israeli; "},
{2, "2 akamwambia Haruni, Twaa wewe mwana-ng'ombe mume awe sadaka ya dhambi, na kondoo mume wa sadaka ya kuteketezwa, wakamilifu, ukawasongeze mbele ya Bwana. "},
{3, "3 Nawe utawaambia wana wa Israeli, ukisema, Twaeni mbuzi mume awe sadaka ya dhambi; na mwana-ng'ombe, na mwana-kondoo, wote wa mwaka wa kwanza, wakamilifu, kwa sadaka ya kuteketezwa; "},
{4, "4 na ng'ombe mume, na kondoo mume, kwa sadaka za amani, ili kuwachinja mbele za Bwana; na sadaka ya unga uliochanganywa na mafuta; kwa maana, Bwana hivi leo atawatokea. "},
{5, "5 Nao wakayaleta hayo yaliyoagizwa na Musa wakayaweka mbele ya hema ya kukutania; kisha mkutano wote ukakaribia wakasimama mbele za Bwana. "},
{6, "6 Kisha Musa akasema, Neno aliloliagiza Bwana kwamba mlifanye ni hili; na huo utukufu wa Bwana utawatokea. "},
{7, "7 Musa akamwambia Haruni, Ikaribie madhabahu, uitoe sadaka yako ya dhambi, na sadaka yako ya kuteketezwa, ukafanye upatanisho kwa ajili ya nafsi yako, na kwa ajili ya watu; nawe uitoe hiyo dhabihu ya watu, ukafanye upatanisho kwa ajili yao; kama Bwana alivyoagiza. "},
{8, "8 Basi Haruni akakaribia madhabahuni, akamchinja huyo mwana-ng'ombe wa sadaka ya dhambi, aliyekuwa kwa ajili ya nafsi yake. "},
{9, "9 Kisha wana wa Haruni wakamsongezea Haruni ile damu; naye akatia kidole chake katika damu, na kuitia katika pembe za madhabahu, kisha akaimwaga hiyo damu hapo chini ya madhabahu; "},
{10, "10 lakini mafuta, na figo, na kitambi kilichotoka katika ini ya hiyo sadaka ya dhambi, akaviteketeza juu ya madhabahu, kama Bwana alivyomwagiza Musa. "},
{11, "11 Na nyama, na ngozi akazichoma moto nje ya marago. "},
{12, "12 Naye akaichinja sadaka ya kuteketezwa; na wanawe Haruni wakamsongezea ile damu, naye akainyunyiza katika madhabahu pande zote. "},
{13, "13 Nao wakamletea sadaka ya kuteketezwa kipande kwa kipande, na kichwa; naye akaviteketeza juu ya madhabahu. "},
{14, "14 Kisha akaosha matumbo, na miguu na kuiteketeza juu ya hiyo sadaka ya kuteketezwa madhabahuni. "},
{15, "15 Kisha akaisongeza dhabihu ya watu, akamtwaa mbuzi wa sadaka ya dhambi aliyekuwa kwa hao watu, na kumchinja, na kumtoa kwa ajili ya dhambi kama yule wa kwanza. "},
{16, "16 Kisha akaisongeza sadaka ya kuteketezwa, na kuitoa sawasawa na sheria. "},
{17, "17 Kisha akaisongeza sadaka ya unga, na kutwaa konzi humo, na kuiteketeza juu ya madhabahu, pamoja na sadaka ya kuteketezwa ya asubuhi. "},
{18, "18 Huyo ng'ombe mume naye akamchinja, na huyo kondoo mume pia, dhabihu ya sadaka za amani, zilizokuwa kwa ajili ya watu; na wanawe Haruni wakamsongezea ile damu, naye akainyunyiza katika madhabahu pande zote, "},
{19, "19 na mafuta ya ng'ombe; na ya kondoo, mkia wake wa mafuta, na hayo yafunikayo matumbo, na figo zake, na kitambi cha ini; "},
{20, "20 nao wakayaweka hayo mafuta juu ya vidari, naye akayateketeza mafuta juu ya madhabahu; "},
{21, "21 na vile vidari, na mguu wa nyuma wa upande wa kuume, Haruni akavitikisa huku na huku viwe sadaka ya kutikiswa mbele ya Bwana; kama Musa alivyoagiza. "},
{22, "22 Kisha Haruni akainua mikono yake na kuielekeza kwa hao watu, akawabariki; kisha akashuka akisha isongeza sadaka ya dhambi, na sadaka ya kuteketezwa, na sadaka za amani. "},
{23, "23 Kisha Musa na Haruni wakaingia ndani ya hema ya kukutania, kisha wakatoka nje, na kuwabarikia watu; na huo utukufu wa Bwana ukawatokea watu wote. "},
{24, "24 Kisha moto ukatoka hapo mbele za Bwana, na kuiteketeza sadaka ya kuteketezwa, na yale mafuta juu ya madhabahu; watu wote walipouona huo moto wakapiga kelele wakainama kifudifudi. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view10() {
struct sw10 poems[] = {
{1, "1 Na Nadabu na Abihu, wana wa Haruni, wakatwaa kila mtu chetezo chake, wakatia moto ndani yake, wakatia na uvumba, nao wakatoa moto wa kigeni mbele ya Bwana, ambao yeye hakuwaagiza. "},
{2, "2 Kisha moto ukatoka hapo mbele za Bwana, nao ukawala, nao wakafa mbele za Bwana. "},
{3, "3 Ndipo Musa akamwambia Haruni, Jambo hili ni hilo Bwana alilolinena, akisema, Nitatakaswa mimi katika hao wanikaribiao, nami nitatukuzwa mbele ya watu hao wote. Haruni akanyamaza kimya. "},
{4, "4 Musa akawaita Mishaeli na Elisafani, wana wa Uzieli mjombaye Haruni, na kuwaambia, Njoni karibu, mwachukue hawa ndugu zenu, mkawaondoe hapa mbele ya maskani, mwende nao nje ya marago. "},
{5, "5 Basi wakaja karibu, na kuwachukua, hali wamevaa nguo zao, wakawachukua nje ya marago; kama Musa alivyosema. "},
{6, "6 Kisha Musa akamwambia Haruni na wanawe Eleazari na Ithamari, Msiache wazi nywele za vichwani mwenu, wala msiyararue mavao yenu; ili kwamba msife, tena asiukasirikie mkutano wote; lakini ndugu zenu, nyumba yote ya Israeli, na waomboleze kwa ajili ya hicho kichomo alichowasha Bwana. "},
{7, "7 Wala hamtatoka nje mlangoni mwa hema ya kukutania, msije mkafa; kwa sababu mafuta ya kutiwa ya Bwana ya juu yenu. Nao wakafanya kama hilo neno la Musa. "},
{8, "8 Kisha Bwana akanena na Haruni, na kumwambia, "},
{9, "9 Usinywe divai wala kileo cho chote, wewe, wala wanao pamoja nawe, hapo mwingiapo ndani ya hema ya kukutania, ili kwamba msife; amri hii itakuwa ni amri ya milele katika vizazi vyenu; "},
{10, "10 kisha, mpate kupambanua kati ya yaliyo matakatifu na hayo yaliyo ya siku zote, na kati ya yaliyo najisi na hayo yaliyo safi; "},
{11, "11 tena mpate kuwafundisha wana wa Israeli amri hizi zote ambazo Bwana amewaambia kwa mkono wa Musa. "},
{12, "12 Kisha Musa akanena na Haruni, na Eleazari, na Ithamari, hao wanawe waliobaki, Twaeni hiyo sadaka ya unga iliyosalia katika kafara za Bwana zilizotolewa kwa moto, mkaile pasipo kutiwa chachu, pale karibu na madhabahu; kwa kuwa ni takatifu sana; "},
{13, "13 nanyi mtaila katika mahali patakatifu, kwa sababu ni haki yako, na haki ya wanao, katika hizo kafara zisongezwazo kwa Bwana kwa moto; kwani ni hivyo nilivyoagizwa. "},
{14, "14 Na kidari cha kutikiswa, na mguu wa kuinuliwa, mtavila katika mahali palipo safi; wewe, na wanao, na binti zako pamoja nawe; kwa maana vimetolewa kuwa ni haki yako, na haki ya wanao, katika zile kafara za sadaka za amani za wana wa Israeli. "},
{15, "15 Mguu wa kuinuliwa, na kidari cha kutikiswa, Watavileta pamoja na dhabihu zisongezwazo kwa njia ya moto, za hayo mafuta ili kuvitikisa viwe sadaka ya kutikiswa mbele za Bwana; kisha vitakuwa ni vyako wewe, na vya wanao pamoja nawe, ni haki yenu milele, kama Bwana alivyoagiza. "},
{16, "16 Kisha Musa akamtafuta sana huyo mbuzi wa sadaka ya dhambi, naye, tazama, alikuwa amekwisha kuchomwa moto; naye akawakasirikia hao Eleazari na Ithamari, wana wa Haruni, hao waliobaki, akawaambia, "},
{17, "17 Kwa nini hamkula hiyo sadaka ya dhambi katika mahali patakatifu, kwa kuwa ni takatifu sana, naye amewapa ninyi ili kuuchukua uovu wa mkutano, na kuwafanyia upatanisho mbele za Bwana? "},
{18, "18 Angalieni, hiyo damu yake haikuletwa ndani ya mahali patakatifu; iliwapasa kuila ndani ya mahali patakatifu, kama nilivyowaagiza. "},
{19, "19 Haruni akamwambia Musa, Angalia, hivi leo wamesongeza sadaka yao ya dhambi, na sadaka yao ya kuteketezwa, mbele za Bwana; kisha mambo kama haya yamenipata; tena kama ningalikula hiyo sadaka ya dhambi hivi leo, je! Lingekuwa ni jambo la kupendeza mbele za macho ya Bwana? "},
{20, "20 Naye Musa aliposikia hayo, yakampendeza. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view11() {
struct sw11 poems[] = {
{1, "1 Bwana akanena na Musa na Haruni, na kuwaambia, "},
{2, "2 Neneni na wana wa Israeli, mkiwaambia, Wanyama hawa ndio wanyama wenye uhai mtakaowala, katika hayawani wote walio juu ya nchi. "},
{3, "3 Kila mnyama mwenye kwato katika miguu yake, mwenye miguu ya kupasuka kati, mwenye kucheua, katika hayawani, hao ndio mtakaowala. "},
{4, "4 Pamoja na hayo, wanyama hawa hamtawala katika wale wenye kucheua, na katika wale walio na kwato; ngamia, kwa sababu yuacheua lakini hana kwato, yeye ni najisi kwenu. "},
{5, "5 Na wibari, kwa sababu yeye hucheua lakini hana kwato, yeye ni najisi kwenu. "},
{6, "6 Na sungura, kwa sababu hucheua, lakini hana kwato, yeye ni najisi kwenu. "},
{7, "7 Na nguruwe, kwa sababu yeye anazo kwato, ni mwenye miguu iliyopasuka kati, lakini hacheui, yeye ni najisi kwenu. "},
{8, "8 Msiile nyama yao, wala msiiguse mizoga yao; hao ni najisi kwenu. "},
{9, "9 Katika hao wote walio ndani ya maji mtakula hawa; kila aliye na mapezi na magamba, ndani ya hayo maji, na ndani ya bahari, na ndani ya mito, mtakula hao. "},
{10, "10 Na hao wote wasio na mapezi na magamba, ndani ya bahari, na ndani ya mito, katika hao waendao majini, na katika wote wenye uhai, waliomo majini, hao ni machukizo kwenu, "},
{11, "11 watakuwa machukizo kwenu; msiile nyama yao, na mizoga yao itakuwa machukizo kwenu. "},
{12, "12 Kila asiye na mapezi wala magamba aliye ndani ya maji ni machukizo kwenu. "},
{13, "13 Kisha katika ndege hawa watakuwa ni machukizo kwenu; hawataliwa, ndio machukizo; tai, na furukombe, na kipungu; "},
{14, "14 na mwewe, na kozi kwa aina zake, "},
{15, "15 na kila kunguru kwa aina zake; "},
{16, "16 na mbuni, na kirukanjia, na dudumizi, na kipanga kwa aina zake; "},
{17, "17 na bundi, na mnandi, na bundi mkubwa; "},
{18, "18 na mumbi, na mwari, na mderi; "},
{19, "19 na korongo, na koikoi kwa aina zake, na hudihudi, na popo. "},
{20, "20 Tena vyote vitambaavyo vyenye mabawa viendavyo kwa miguu minne, hivi ni machukizo kwenu. "},
{21, "21 Pamoja na hayo, hivi vitambaavyo vyenye mabawa viendavyo kwa miguu minne ni halali kula, hao walio na miguu mirefu, ya kurukia juu ya nchi; "},
{22, "22 katika hao mna ruhusa kuwala; nzige kwa aina zake, na nzige kuu kwa aina zake, na panzi kwa aina zake, na parare kwa aina zake. "},
{23, "23 Lakini vyote vitambaavyo vyenye mabawa, vilivyo na miguu minne, ni machukizo kwenu. "},
{24, "24 Nanyi mtakuwa najisi kwa wanyama hao; kila atakayegusa mzoga wao atakuwa ni najisi hata jioni; "},
{25, "25 na mtu awaye yote atakayechukua cho chote cha mizoga yao atafua nguo zake, naye atakuwa najisi hata jioni. "},
{26, "26 Kila mnyama aliyepasuliwa ukwato, naye hana kwato mbili, wala hacheui, huyo ni najisi kwenu; kila agusaye wanyama hao atakuwa ni najisi. "},
{27, "27 Tena kila mnyama aendaye kwa vitanga vyake, katika hao wanyama wote waendao kwa miguu minne, hao ni najisi kwenu; awaye yote atakayegusa mizoga yao, atakuwa ni najisi hata jioni. "},
{28, "28 Na huyo atakayechukua mzoga wa wanyama hao atafua nguo zake, naye atakuwa ni najisi hata jioni; hao ni najisi kwenu "},
{29, "29 Tena katika vitu vile vitambaavyo, vitambaavyo juu ya nchi, hivi ni najisi kwenu; kicheche, na panya, na mjombakaka, kwa aina zake, "},
{30, "30 na guruguru na kenge, na mjusi na goromoe, na lumbwi. "},
{31, "31 Wanyama hao ndio walio najisi kwenu katika hao watambaao; awaye yote atakayewagusa, wakiisha kufa, atakuwa ni najisi hata jioni. "},
{32, "32 Tena kitu cho chote, wanyama hao mmojawapo atakachokiangukia, wakiisha kufa, kitakuwa ni najisi; kwamba ni chombo cha mti, au nguo, au ngozi, au gunia, chombo cho chote kitakachoangukiwa, ambacho ni chombo cha kufanyia kazi yo yote, lazima kitiwe ndani ya maji, nacho kitakuwa ni najisi hata jioni; ndipo kitakapokuwa ni safi. "},
{33, "33 Na kila chombo cha udongo, wanyama hao mmojawapo atakachokiangukia, kila kilichomo ndani yake kitakuwa ni najisi, na hicho chombo kitavunjwa. "},
{34, "34 Kila chakula kilichomo, ambacho ni kuliwa, hicho ambacho maji hutumiwa juu yake, kitakuwa ni najisi; na kila kinyweo ambacho ni cha kunywewa, kilichomo katika chombo kama hicho, kitakuwa ni najisi. "},
{35, "35 Na kila kitu kitakachoangukiwa na kipande cho chote cha mizoga yao kitakuwa najisi; kwamba ni tanuru, au meko ya vyungu, kitavunjwa vipande vipande; ni najisi vitu hivyo, navyo vitakuwa najisi kwenu. "},
{36, "36 Pamoja na hayo, chemchemi, au shimo, ambamo maji yakusanyika, vitakuwa ni safi; lakini hicho kitakachogusa mizoga yao kitakuwa ni najisi. "},
{37, "37 Na kipande cho chote cha mzoga kikiwa kimeangukia mbegu za kupandwa zitakazopandwa, zitakuwa safi. "},
{38, "38 Lakini kwamba hizo mbegu zilitiwa maji na cho chote cha mizoga yao kuziangukia, ni najisi kwenu. "},
{39, "39 Kama akifa mnyama awaye yote, ambaye mna ruhusa kumla, yeye anayeugusa mzoga wake atakuwa najisi hata jioni. "},
{40, "40 Na yeye atakayekula nyama ya mzoga wake atafua nguo zake, naye atakuwa najisi hata jioni; yeye atakayeuchukua mzoga wake atafua nguo zake, naye atakuwa ni najisi hata jioni. "},
{41, "41 Na kila kitu kitambaacho juu ya nchi ni machukizo; hakitaliwa. "},
{42, "42 Kila aendaye kwa tumbo lake, na kila aendaye kwa miguu minne, na kila aendaye kwa miguu mingi, maana, ni vyote vyenye kutambaa vitambaavyo juu ya nchi, hamtavila, kwa kuwa ni machukizo. "},
{43, "43 Msifanye nafsi zenu kuwa ni chukizo kwa kitu cho chote chenye kutambaa, kitambaacho, wala msifanye nafsi zenu kuwa ni najisi kwa vitu hivyo, mkajipatia uchafu kwa hivyo. "},
{44, "44 Kwa kuwa mimi ni Bwana, Mungu wenu; takaseni nafsi zenu basi; iweni watakatifu, kwa kuwa mimi ni Mtakatifu; wala msitie uchafu nafsi zenu kwa kitu kitambaacho cha aina yo yote, kiendacho juu ya nchi. "},
{45, "45 Kwa kuwa mimi ni Bwana niliyewaleta kutoka nchi ya Misri, ili kwamba niwe Mungu wenu; basi mtakuwa watakatifu, kwa kuwa mimi ni Mtakatifu. "},
{46, "46 Hii ndiyo sheria katika hao wanyama, na ndege, na kila kiumbe kilicho hai, kiendacho ndani ya maji, na kila kiumbe kitambaacho juu ya nchi; "},
{47, "47 ili kupambanua kati ya hao walio najisi na hao walio safi, na kati ya kiumbe kilicho hai ambacho chaliwa, na hicho kilicho hai ambacho hakiliwi. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view12() {
struct sw12 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Nena na hao wana wa Israeli, uwaambie, Mwanamke akitunga mimba na kuzaa mtoto mume, ndipo atakuwa yu najisi siku saba; kama katika siku za kutengwa kwake kwa ajili ya hedhi, ndivyo atakavyokuwa najisi. "},
{3, "3 Siku nane mtoto atatahiriwa govi ya zunga lake. "},
{4, "4 Na huyo mwanamke atakaa katika damu ya kutakata kwake siku thelathini na tatu; asiguse kitu kilicho kitakatifu, wala asiingie mahali patakatifu, hata siku hizo za kutakata kwake zitakapotimia. "},
{5, "5 Lakini kwamba amezaa mtoto mke ndipo atakuwa najisi juma mbili, kama katika kutengwa kwake; naye atakaa katika damu ya kutakata kwake muda wa siku sitini na sita. "},
{6, "6 Kisha hizo siku za kutakaswa kwake zitakapotimia, kwa ajili ya mwana, au kwa ajili ya binti, ataleta mwana-kondoo wa mwaka mmoja kuwa sadaka ya kuteketezwa na kinda la njiwa, au hua, kuwa sadaka ya dhambi, awalete mlangoni pa hema ya kukutania, na kumpa kuhani; "},
{7, "7 na yeye atawasongeza mbele za Bwana, na kufanya upatanisho kwa ajili yake; naye atatakasika na jicho la damu yake. Hii ndiyo amri yake huyo azaaye, kwamba ni mtoto mume au mke. "},
{8, "8 Kama mali yake huyo mwanamke haimfikilii mwana-kondoo, hapo ndipo atakapochukua hua wawili, au makinda mawili ya njiwa; mmoja kuwa sadaka ya kuteketezwa, na wa pili kuwa sadaka ya dhambi; naye kuhani atafanya upatanisho kwa ajili yake, naye atakuwa safi. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view13() {
struct sw13 poems[] = {
{1, "1 Kisha Bwana akanena na Musa na Haruni, na kuwaambia, "},
{2, "2 Mtu atakapokuwa na kivimbe katika ngozi ya mwili wake, au kikoko, au kipaku king'aacho, nalo likawa pigo la ukoma katika ngozi ya mwili wake, ndipo atakapoletwa kwa Haruni kuhani, au kwa wanawe, makuhani mmojawapo; "},
{3, "3 na huyo kuhani ataliangalia hilo pigo lililo katika ngozi ya mwili; na kwamba malaika yaliyo katika hilo pigo yamegeuka kuwa meupe, na hilo pigo kuonekana kwake limeingia ndani kuliko ile ngozi ya mwili wake, ni pigo la ukoma hilo; na kuhani atamwangalia na kusema kuwa yu mwenye unajisi. "},
{4, "4 Na hicho kipaku king'aacho, kwamba ni cheupe katika ngozi ya mwili wake, na kuonekana kwake si shimo la kuingia ndani kuliko ngozi, na malaika hayakugeuka kuwa meupe, ndipo kuhani atamweka mahali muda wa siku saba huyo aliye na hilo pigo; "},
{5, "5 kisha kuhani atamwangalia siku ya saba; naye akiona ya kuwa pigo limeshangaa, na pigo halikwendelea mbele katika ngozi yake, ndipo kuhani atamweka mahali muda wa siku saba tena; "},
{6, "6 kisha siku ya saba kuhani atamwangalia tena; na tazama, ikiwa hilo pigo limeanza kufifia, wala pigo halikwendelea mbele katika ngozi yake, ndipo kuhani atasema kuwa yu safi; ni kikoko; naye atazifua nguo zake, kisha atakuwa yu safi. "},
{7, "7 Lakini kwamba kikoko kimeenea katika ngozi yake baada ya kuonyesha nafsi yake kwa kuhani kwa kupata kutakaswa kwake ataonyesha nafsi yake tena kwa kuhani; "},
{8, "8 na kuhani ataangalia, na tazama ikiwa hicho kikoko kimeenea katika ngozi, ndipo kuhani atasema kuwa yu najisi; ni ukoma. "},
{9, "9 Pigo la ukoma litakapokuwa katika mtu, ndipo ataletwa kwa kuhani; "},
{10, "10 na kuhani ataangalia, na tazama, ikiwa pana kivimbe cheupe katika ngozi yake, na malaika yamegeuzwa kuwa meupe, tena ikiwa pana nyama mbichi iliyomea katika kile kivimbe, "},
{11, "11 ni ukoma wa zamani ulio katika ngozi ya mwili wake, na kuhani atasema kuwa yu najisi; hatamweka mahali, kwa kuwa yeye yuna unajisi. "},
{12, "12 Tena kwamba huo ukoma ukitokeza katika ngozi yake, na ukoma ukamwenea ngozi yote, tangu kichwa hata miguuni, kama aonavyo kuhani; "},
{13, "13 ndipo huyo kuhani ataangalia; na tazama, ikiwa ukoma umemwenea mwili wake wote, atasema kuwa yu safi huyo aliye na hilo pigo umegeuka kuwa mweupe wote; yeye ni safi. "},
{14, "14 Lakini po pote itakapoonekana nyama mbichi kwake mtu huyo, atakuwa yu najisi. "},
{15, "15 Kuhani ataiangalia hiyo nyama mbichi, naye atasema kuwa yu najisi; ile nyama mbichi ni najisi; ni ukoma. "},
{16, "16 Au kama hiyo nyama mbichi iligeuka tena, na kugeuzwa kuwa nyeupe, ndipo atamwendea kuhani, "},
{17, "17 na huyo kuhani atamwangalia; na tazama, ikiwa hilo pigo limegeuzwa kuwa jeupe, ndipo huyo kuhani atasema kuwa yu safi huyo aliyekuwa na pigo; yeye yu safi. "},
{18, "18 Tena mwili wa mtu utakapokuwa na jipu katika ngozi yake, nalo limepoa, "},
{19, "19 na mahali palipokuwa na lile jipu pana kivimbe cheupe, au kipaku king'aacho, cheupe lakini chekundu kidogo, ndipo atamwonyesha kuhani mahali hapo; "},
{20, "20 na kuhani ataangalia, na tazama, kwamba kumeonekana kuingia ndani kuliko ngozi yenyewe, na malaika yakiwa yamegeuka kuwa meupe, ndipo kuhani atasema kwamba yu najisi; ni pigo la ukoma limetokea katika hilo jipu. "},
{21, "21 Lakini kuhani akipaangalia, na tazama hamna malaika meupe ndani yake, wala hapana pa kuingia ndani kuliko ile ngozi, lakini paanza kufifia, ndipo kuhani atamweka mahali muda wa siku saba; "},
{22, "22 na kwamba pameenea katika ngozi, ndipo kuhani atasema kwamba yu najisi; hili ni pigo. "},
{23, "23 Lakini ikiwa kipaku hicho king'aacho kimeshangaa pale pale, wala hakienei, ni kovu ya jipu; na kuhani atasema kwamba yu safi. "},
{24, "24 Au mwili wa mtu ukiwa una mahali katika ngozi yake penye moto, na hiyo nyama iliyomea pale penye moto, kama kikiwa kipaku chekundu kidogo, au cheupe; "},
{25, "25 ndipo kuhani atapaangalia; na tazama, yakiwa malaika yaliyo katika kile kipaku yamegeuka kuwa meupe, na kwamba kumeonekana kuingia ndani kuliko ngozi yenyewe; ni ukoma, umetokea katika mahali penye moto; na kuhani atasema kwamba yu najisi; hili ni pigo la ukoma. "},
{26, "26 Lakini kuhani akipaangalia, na tazama, malaika meupe hamna katika hicho kipaku king'aacho, nacho hakikuingia ndani kuliko ngozi, lakini chafifia; ndipo kuhani atamweka mahali muda wa siku saba; "},
{27, "27 na kuhani atamwangalia siku ya saba; kama kimeenea katika ngozi, ndipo huyo kuhani atasema kwamba yu najisi; hili ni pigo la ukoma. "},
{28, "28 Na kama hicho kipaku kikishangaa pale pale, wala hakikuenea katika ngozi, lakini kimefifia; ni kufura kwake pale penye moto, na kuhani atasema kwamba yu safi; kwa kuwa ni kovu la kuwasha hili. "},
{29, "29 Tena mtu, mume au mke, akiwa na pigo juu ya kichwa, au katika ndevu zake, "},
{30, "30 ndipo kuhani ataliangalia hilo pigo; na tazama, kwamba kumeonekana kuingia ndani kuliko ngozi yenyewe, tena zikiwamo nywele za rangi ya manjano kisha nyembamba, ndipo kuhani atasema kwamba yu najisi, maana, ni kipwepwe, ni ukoma wa kichwa, au wa ndevu. "},
{31, "31 Tena kuhani akiliangalia lile pigo la kipwepwe, na tazama, kwamba kumeonekana si kuingia ndani kuliko ngozi yenyewe, wala hamna nywele nyeusi ndani yake, ndipo kuhani atamweka mahali huyo aliye na pigo la kipwepwe muda wa siku saba; "},
{32, "32 na siku ya saba kuhani ataliangalia hilo pigo; na ikiwa hicho kipwepwe hakikuenea, wala hamna nywele za rangi ya manjano ndani yake, na kwamba kipwepwe hakionekani kuingia ndani kuliko ngozi yenyewe, "},
{33, "33 ndipo huyo mtu atanyolewa, lakini hicho kipwepwe hatakinyoa; na kuhani atamweka mahali huyo aliye na kipwepwe muda wa siku saba tena; "},
{34, "34 na siku ya saba kuhani atakiangalia hicho kipwepwe, na tazama, ikiwa kipwepwe hakikuenea katika ngozi yake, wala hakionekani kuingia ndani kuliko ngozi; ndipo huyo kuhani atasema kwamba yu safi; naye atazifua nguo zake, naye atakuwa yu safi. "},
{35, "35 Lakini hicho kipwepwe kama kikienea katika ngozi yake baada ya kutakasika kwake; "},
{36, "36 ndipo kuhani atamwangalia; na ikiwa hicho kipwepwe kimeenea katika ngozi yake, kuhani hatatafuta hizo nywele za rangi ya manjano; yeye yu najisi. "},
{37, "37 Lakini akiona ya kuwa hicho kipwepwe kimeshangaa, na nywele nyeusi zimemea humo; hicho kipwepwe kimepoa, naye yu safi, na huyo kuhani atasema kwamba yu safi. "},
{38, "38 Mtu, mume au mke, atakapokuwa na vipaku ving'aavyo katika ngozi ya mwili, vipaku ving'aavyo vyeupe; "},
{39, "39 ndipo kuhani ataangalia; na tazama, ikiwa vile vipaku ving'aavyo vilivyo katika ngozi ya mwili wake ni vyeupe kidogo; ni mba hivyo, imetokea katika ngozi; yeye yu safi. "},
{40, "40 Kwamba nywele za mtu zimemtoka kichwani mwake, yeye ni mwenye upaa, yu safi. "},
{41, "41 Tena kwamba nywele za mtu zimemtoka kichwani upande wa mbele, yeye ni mwenye upaa wa kipaji; yu safi. "},
{42, "42 Lakini kwamba katika kile kichwa kilicho na upaa, au kile kipaji kilicho na upaa, laonekana pigo jeupe kisha jekundu kidogo; ni ukoma, unatokea katika kichwa chake cha upaa, au katika kipaji chake cha upaa. "},
{43, "43 Ndipo kuhani atamwangalia; na tazama, kivimbe cha pigo kikiwa cheupe na chekundu-chekundu, katika kichwa chake chenye upaa, au katika kipaji chake cha upaa, kama vile kuonekana kwa ukoma katika ngozi ya mwili; "},
{44, "44 yeye ni mtu mwenye ukoma, yu najisi; na kuhani hana budi atasema kuwa yu najisi; pigo lake li katika kichwa chake. "},
{45, "45 Kisha mwenye ukoma aliye na pigo ndani yake, nguo zake zitararuliwa, na nywele za kichwa chake zitaachwa wazi, naye atafunika mdomo wake wa juu, naye atapiga kelele, Ni najisi, ni najisi. "},
{46, "46 Siku zote ambazo pigo li ndani yake, yeye atakuwa mwenye unajisi; yeye yu najisi; atakaa peke yake; makazi yake yatakuwa nje ya marago. "},
{47, "47 Tena, vazi nalo ambalo pigo la ukoma li ndani yake, kwamba ni vazi la sufu, au kwamba ni la kitani; "},
{48, "48 likiwa limefumwa, au kusokotwa; likiwa ni la kitani au la sufu; kwamba ni katika ngozi, au kitu cho chote kilichofanywa cha ngozi; "},
{49, "49 hilo pigo likiwa la rangi ya majani au jekundu, katika vazi, au katika ngozi, au katika lililofumwa, au katika lililosokotwa, au katika kitu cho chote cha ngozi; ni pigo la ukoma, nalo ataonyeshwa kuhani; "},
{50, "50 na kuhani ataliangalia hilo pigo, naye atakiweka mahali kile kilicho na pigo muda wa siku saba; "},
{51, "51 kisha siku ya saba ataliangalia hilo pigo; kama pigo limeenea katika hilo lililofumwa, au katika hilo lililosokotwa, au katika ngozi, ijapokuwa hiyo ngozi ina matumizi yo yote; hilo pigo ni ukoma unaokula; vazi hilo ni najisi. "},
{52, "52 Naye atalichoma moto vazi hilo, kwamba ni lililofumwa au kwamba ni lililosokotwa, kama ni la sufu, au la kitani, au kitu cho chote cha ngozi, ambacho kina hilo pigo ndani yake; kwa maana, ni ukoma unaokula; vazi hilo litachomwa moto; "},
{53, "53 Na kama kuhani akitazama, na tazama, ikiwa hilo pigo halikuenea katika hilo vazi, wala katika hilo lililofumwa, wala katika hilo lililosokotwa, wala katika kitu cho chote cha ngozi; "},
{54, "54 ndipo kuhani ataamuru kwamba wakifue kitu kile kilicho na hilo pigo, naye atakiweka mahali muda wa siku saba tena; "},
{55, "55 kisha kuhani ataangalia, baada ya kuoshwa hilo pigo; na tazama, ikiwa hilo pigo halikugeuka rangi yake, wala halikuenea, li najisi; utakichoma moto; ni uharibifu likiwa lina upaa ndani au nje. "},
{56, "56 Huyo kuhani akiangalia, na tazama, ikiwa hilo pigo limeanza kufifia, baada ya kufuliwa kwake, ndipo atalirarua hilo pigo litoke katika vazi, au katika ngozi, au katika lililofumwa, au katika lililosokotwa; "},
{57, "57 kisha, likionekana li vivyo katika hilo vazi, katika lililofumwa, au katika lililosokotwa, au katika kitu cho chote cha ngozi, ni pigo lenye kuenea; nawe vazi hilo lenye pigo utalichoma moto. "},
{58, "58 Na hilo vazi, lililofumwa, au lililosokotwa, au kitu cho chote cha ngozi, utakalolifua, kama hilo pigo limetoka na kuliacha, ndipo litafuliwa mara ya pili, nalo litakuwa safi. "},
{59, "59 Na katika pigo la ukoma katika vazi la sufu, au la kitani, kama ni katika lililofumwa, au lililosokotwa, au katika kitu cho chote cha ngozi, sheria yake ni hiyo, kusema kwamba ni safi, au kusema kwamba ni najisi. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view14() {
struct sw14 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Hii ndiyo sheria ya mwenye ukoma, katika siku ya kutakaswa kwake; ataletwa kwa kuhani, "},
{3, "3 na huyo kuhani atatoka aende nje ya marago; na kuhani ataangalia, na tazama, ikiwa pigo la ukoma limepoa kwake huyo mwenye ukoma; "},
{4, "4 ndipo huyo kuhani ataagiza kwamba watwae kwa ajili yake atakayetakaswa ndege wawili walio hai, ambao ni safi, na mti wa mwerezi, na sufu nyekundu, na hisopo; "},
{5, "5 kisha kuhani ataagiza ndege mmoja achinjwe katika chombo cha udongo kilicho juu ya maji ya mtoni; "},
{6, "6 kisha huyo ndege aliye hai atamshika, na huo mti wa mwerezi, na hiyo sufu nyekundu, na hisopo, naye atavichovya hivyo, pamoja na yule ndege aliye hai, katika damu ya huyo ndege aliyechinjwa juu ya maji ya mtoni; "},
{7, "7 kisha atamnyunyizia huyo atakayetakaswa na ukoma mara saba, naye atasema kwamba yu safi, kisha atamwacha yule ndege aliye hai aende zake nyikani. "},
{8, "8 Naye huyo atakayetakaswa atazifua nguo zake, na kunyoa nywele zake zote, na kuoga katika maji, naye atakuwa safi; baada ya hayo ataingia ndani ya marago, lakini ataketi nje ya hema yake muda wa siku saba. "},
{9, "9 Kisha siku ya saba atanyoa nywele zote za kichwani mwake, na ndevu zake, na nyushi zake, nywele zake zote pia atazinyoa; kisha atazifua nguo zake, na kuoga mwili wake majini, naye atakuwa safi. "},
{10, "10 Kisha siku ya nane atachukua wana-kondoo wawili waume wakamilifu, na mwana-kondoo mmoja wa kike wa mwaka wa kwanza mkamilifu, na sehemu tatu za kumi za efa moja ya unga mwembamba kuwa sadaka ya unga, kuchanganywa na mafuta, na logi moja ya mafuta. "},
{11, "11 Kisha kuhani atakayemtakasa atamsimamisha huyo mtu atakayetakaswa, pamoja na vitu vile vyote, mbele za Bwana, mlangoni pa hema ya kukutania; "},
{12, "12 kisha kuhani atamshika mmoja katika hao wana-kondoo waume, na kumsongeza awe sadaka ya hatia, pamoja na hiyo logi ya mafuta, kisha atavitikisa kuwa ni sadaka ya kutikiswa mbele za Bwana; "},
{13, "13 kisha atamchinja huyo mwana-kondoo mahali hapo wachinjapo sadaka ya dhambi na sadaka ya kuteketezwa, ndani ya mahali patakatifu; kwa kuwa kama hiyo sadaka ya dhambi ilivyo ya kuhani, ni vivyo sadaka ya hatia; ni takatifu sana; "},
{14, "14 kisha huyo kuhani atatwaa katika hiyo damu ya sadaka ya hatia, naye kuhani ataitia katika ncha ya sikio la kuume la huyo atakayetakaswa, na katika chanda cha gumba cha mkono wake wa kuume, na katika kidole kikuu cha mguu wake wa kuume; "},
{15, "15 kisha kuhani atatwaa katika hiyo logi ya mafuta, na kuyamimina katika kitanga cha mkono wake mwenyewe wa kushoto; "},
{16, "16 kisha kuhani atatia kidole cha mkono wa kuume katika hayo mafuta, yaliyo katika mkono wake wa kushoto, naye atayanyunyiza hayo mafuta kwa kidole chake mara saba mbele za Bwana; "},
{17, "17 na katika yale mafuta yaliyobaki mkononi mwake kuhani atayatia katika ncha ya sikio la kuume la huyo atakayetakaswa, na katika chanda cha gumba cha mkono wake wa kuume, na katika kidole kikuu cha mguu wake wa kuume, juu ya damu ya sadaka ya hatia; "},
{18, "18 na mafuta yaliyobaki, yaliyo katika mkono wa kuhani, atayatia juu ya kichwa cha huyo atakayetakaswa; na kuhani atafanya upatanisho kwa ajili yake, mbele za Bwana. "},
{19, "19 Kisha kuhani atasongeza sadaka ya dhambi, na kufanya upatanisho kwa ajili yake huyo atakayetakaswa kwa sababu ya unajisi wake; kisha baadaye ataichinja sadaka ya kuteketezwa; "},
{20, "20 kisha kuhani ataisongeza hiyo sadaka ya kuteketezwa, na sadaka ya unga, juu ya madhabahu na kuhani atafanya upatanisho kwa ajili yake, naye atakuwa safi. "},
{21, "21 Tena kwamba ni maskini, naye hawezi kupata kiasi hicho, ndipo atatwaa mwana-kondoo mmoja wa kiume, awe sadaka ya hatia ya kutikiswa, ili kufanya upatanisho kwa ajili yake, na sehemu ya kumi ya efa ya unga mwembamba, uliochanganywa na mafuta kuwa sadaka ya unga, na logi ya mafuta; "},
{22, "22 na hua wawili, au makinda mawili ya njiwa, kama awezavyo kuwapata; huyo mmoja atakuwa sadaka ya dhambi, na wa pili atakuwa sadaka ya kuteketezwa. "},
{23, "23 Hata siku ya nane atawaleta kwa kuhani, mlangoni pa hema ya kukutania mbele za Bwana, kwa ajili ya kutakaswa kwake. "},
{24, "24 Na kuhani atamtwaa huyo mwana-kondoo wa sadaka ya hatia, na hiyo logi ya mafuta, naye kuhani atavitikisa viwe sadaka ya kutikiswa mbele za Bwana; "},
{25, "25 kisha atamchinja mwana-kondoo wa sadaka ya hatia, na kuhani atatwaa katika damu ya sadaka ya hatia, na kuitia katika ncha ya sikio la kuume la huyo atakayetakaswa, na katika chanda cha gumba cha mkono wake wa kuume, na katika kidole kikuu cha mguu wake wa kuume; "},
{26, "26 kisha kuhani atamimina sehemu ya hayo mafuta katika kitanga cha mkono wake mwenyewe wa kushoto; "},
{27, "27 kisha kuhani atanyunyiza baadhi ya hayo mafuta yaliyo katika mkono wake wa kushoto, kwa kidole chake cha mkono wa kuume mara saba mbele za Bwana; "},
{28, "28 kisha kuhani atatia mengine katika hayo mafuta yaliyo mkononi mwake katika ncha ya sikio la kuume la huyo atakayetakaswa, na katika chanda cha gumba cha mkono wake wa kuume, na katika kidole kikuu cha mguu wake wa kuume, juu ya mahali pale penye damu ya sadaka ya hatia; "},
{29, "29 na mafuta yaliyobaki katika mkono wa kuhani atayatia juu ya kichwa cha huyo atakayetakaswa, ili kufanya upatanisho kwa ajili yake mbele za Bwana. "},
{30, "30 Kisha atasongeza hao hua mmojawapo, au hao makinda ya njiwa mmojawapo, kadiri ya awezao kuwapata; "},
{31, "31 hata kadiri aliyoweza, mmoja kuwa sadaka ya dhambi, na wa pili kuwa sadaka ya kuteketezwa, pamoja na sadaka ya unga; na huyo kuhani atafanya upatanisho kwa ajili yake huyo atakayetakaswa mbele za Bwana. "},
{32, "32 Huyo ambaye ndani yake mna pigo la ukoma, ambaye hawezi kukipata hicho kipasacho kutakaswa kwake, sheria yake ni hiyo. "},
{33, "33 Bwana akanena na Musa na Haruni, na kuwaambia, "},
{34, "34 Hapo mtakapoingia nchi ya Kanaani, ambayo nawapa kuwa ni milki yenu, nami nitakapolitia pigo la ukoma katika nyumba ya nchi hiyo ya milki yenu; "},
{35, "35 ndipo mwenye nyumba hiyo atakwenda na kumwambia kuhani, akisema, Naona mimi ya kwamba pana kama pigo katika nyumba yangu; "},
{36, "36 ndipo kuhani ataagiza kwamba watoe vyote vilivyomo nyumbani, mbele ya kuhani hajaingia ndani kuliangalia hilo pigo, ili kwamba vyote vilivyomo nyumbani visiwekwe kuwa unajisi; kisha baadaye kuhani ataingia ndani ya nyumba hiyo aitazame; "},
{37, "37 naye ataliangalia hilo pigo, na tazama, likiwa pigo limo ndani ya kuta za nyumba, nalo lina mashimo-mashimo, rangi ya majani, au mekundu, na kuonekana kuingia ndani kuliko huo ukuta; "},
{38, "38 ndipo kuhani atatoka katika nyumba hiyo mpaka mlangoni pa nyumba, na kuifunga hiyo nyumba muda wa siku saba; "},
{39, "39 siku ya saba kuhani atakwenda tena, naye ataangalia; na tazama, likiwa pigo limeenea katika kuta za nyumba; "},
{40, "40 ndipo kuhani atawaambia wayatoe hayo mawe, yaliyo na pigo, na kuyatupa mahali penye uchafu nje ya mji; "},
{41, "41 naye atafanya kwamba hiyo nyumba ikwanguwe ndani pande zote, na chokaa watakayokwangua wataimwaga nje ya mji mahali palipo na uchafu; "},
{42, "42 kisha watatwaa mawe mengine, na kuyatia mahali pa mawe hayo; naye atatwaa chokaa nyingine, na kuipaka chokaa hiyo nyumba. "},
{43, "43 Na kama hilo pigo likirudi tena, na kutokea ndani ya nyumba, baada ya yeye kuyatoa hayo mawe, na baada ya kuikwangua nyumba, na baada ya kupakwa chokaa, "},
{44, "44 ndipo kuhani ataingia ndani na kuangalia, na tazama, likiwa pigo limeenea ndani ya hiyo nyumba, ni ukoma unaokula hiyo nyumba; ni katika unajisi. "},
{45, "45 Naye ataibomoa nyumba, mawe yake, na miti yake, na chokaa yote ya hiyo nyumba; naye atavichukua vyote nje ya mji hata mahali palipo na uchafu. "},
{46, "46 Tena mtu atakayeingia ndani ya hiyo nyumba wakati huo wote iliofungwa, atakuwa najisi hata jioni. "},
{47, "47 Na mtu alalaye ndani ya nyumba hiyo atazifua nguo zake, naye alaye chakula ndani ya nyumba hiyo atazifua nguo zake. "},
{48, "48 Tena kwamba kuhani akiingia ndani na kuangalia, na tazama, ikiwa pigo halikuenea katika hiyo nyumba, baada ya nyumba kupakwa chokaa; ndipo kuhani atasema kwamba hiyo nyumba i safi, maana, pigo limepoa. "},
{49, "49 Naye atatwaa ndege wawili, na mti wa mwerezi, na sufu nyekundu, na hisopo, kwa kuitakasa hiyo nyumba; "},
{50, "50 naye atamchinja mmojawapo wa ndege hao katika chombo cha udongo kilicho juu ya maji ya mtoni; "},
{51, "51 kisha atatwaa huo mti wa mwerezi, na hisopo, na sufu nyekundu, pamoja na huyo ndege aliye hai, na kuvichovya vyote katika damu ya huyo ndege aliyechinjwa, na katika hayo maji ya mtoni, na kuinyunyiza nyumba mara saba; "},
{52, "52 naye ataitakasa hiyo nyumba kwa damu ya ndege, na kwa maji ya mtoni, na kwa huyo ndege aliye hai, na kwa mti wa mwerezi, na kwa hisopo, na kwa sufu nyekundu; "},
{53, "53 lakini ndege aliye hai atamwacha atoke mle mjini aende nyikani; ndivyo atakavyofanya upatanisho kwa ajili ya hiyo nyumba; nayo itakuwa safi. "},
{54, "54 Hiyo ndiyo sheria ya pigo la ukoma ya kila aina, na ya kipwepwe; "},
{55, "55 na ya ukoma wa vazi, na ukoma wa nyumba; "},
{56, "56 na kivimbe, na kikoko na kipaku king'aacho; "},
{57, "57 ili kufunza itakapokuwa ni unajisi, na itakapokuwa ni safi; hiyo ndiyo sheria ya ukoma. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view15() {
struct sw15 poems[] = {
{1, "1 Kisha Bwana akanena na Musa na Haruni, na kuwaambia, "},
{2, "2 Haya, semeni na wana wa Israeli, mkawaambie, Mtu ye yote atakapokuwa na kisonono kimtokacho mwilini mwake, atakuwa najisi kwa ajili ya kisonono chake. "},
{3, "3 Na unajisi wake katika kisonono chake ni huu; kama mwili wake unachuruzika kisonono chake, au kama kisonono chake kimezuiwa mwilini mwake, ni unajisi wake. "},
{4, "4 Kitanda cho chote akilaliacho mwenye kisonono kitakuwa najisi; na kitu cho chote ambacho akiketia kitakuwa najisi. "},
{5, "5 Mtu ye yote atakayekigusa kitanda chake huyo, atazifua nguo zake, na kuoga mwili wake majini, naye atakuwa najisi hata jioni. "},
{6, "6 Na mtu atakayeketi katika kitu cho chote alichokiketia mwenye kisonono, atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{7, "7 Na mtu atakayegusa mwili wake mwenye kisonono atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{8, "8 Tena kama mwenye kisonono akimtemea mate mtu aliye safi; ndipo atazifua nguo zake, na kuoga majini, naye atakuwa yu najisi hata jioni. "},
{9, "9 Na tandiko lo lote atakalolipanda mwenye kisonono litakuwa najisi. "},
{10, "10 Mtu awaye yote atakayegusa kitu cho chote kilichokuwa chini yake huyo atakuwa najisi hata jioni; na mtu atakayevichukua vitu vile atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{11, "11 Na mtu ye yote atakayeguswa na mwenye kisonono, asipokuwa amenawa mikono yake majini, atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{12, "12 Na chombo cha udongo ambacho amekigusa mwenye kisonono, kitavunjwa-vunjwa; na kila chombo cha mti kitaoshwa majini. "},
{13, "13 Na huyo aliye na kisonono atakapotakaswa na kisonono chake, atajihesabia siku saba kwa kutakaswa kwake, naye atazifua nguo zake; naye ataoga mwili wake katika maji ya mtoni, naye atakuwa safi. "},
{14, "14 Na siku ya nane atajipatia hua wawili, au makinda mawili ya njiwa, naye atakwenda mbele za Bwana mlangoni pa hema ya kukutania, naye atampa kuhani hao ndege; "},
{15, "15 na kuhani atawasongeza, mmoja kuwa sadaka ya dhambi, na wa pili kuwa sadaka ya kuteketezwa; naye kuhani atafanya upatanisho mbele za Bwana kwa ajili ya kisonono chake. "},
{16, "16 Na mtu ye yote akitokwa na shahawa yake, ndipo ataoga mwili wake wote majini, naye atakuwa najisi hata jioni. "},
{17, "17 Na kila nguo, na kila ngozi, ambayo ina shahawa, itafuliwa kwa maji, nayo itakuwa najisi hata jioni. "},
{18, "18 Huyo mwanamke naye ambaye mtu mume amelala naye kwa shahawa, wote wawili wataoga majini, nao watakuwa najisi hata jioni. "},
{19, "19 Mwanamke ye yote, kama anatokwa na kitu, na kitu chake alichokuwa nacho mwilini mwake ni damu, ataketi katika kutengwa kwake muda wa siku saba; na mtu ye yote atakayemgusa atakuwa najisi hata jioni. "},
{20, "20 Na kitu cho chote akilaliacho katika kutengwa kwake kitakuwa najisi; na kila kitu ambacho akiketia kitakuwa najisi. "},
{21, "21 Mtu ye yote atakayekigusa kitanda chake huyo mwanamke atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{22, "22 Mtu ye yote atakayekigusa cho chote ambacho huyo mwanamke amekiketia atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{23, "23 Kwamba ni katika kitanda, au cho chote alichokikalia huyo mwanamke, atakapokigusa kitu hicho, atakuwa najisi hata jioni. "},
{24, "24 Na mtu ye yote atakayelala na mwanamke na unajisi ukawa juu yake, atakuwa najisi muda wa siku saba; na kila kitanda alichokilalia kitakuwa najisi. "},
{25, "25 Na mwanamke kama akitokwa na damu yake siku nyingi, nayo si katika majira ya kutengwa kwake, au kama anatoka damu kuzidi majira ya kutengwa kwake; siku hizo zote za kutoka damu ya unajisi wake, atakuwa kama alivyokuwa katika siku za kutengwa kwake; yeye yu najisi. "},
{26, "26 Kila kitanda akilaliacho katika siku zote za kutoka damu kitakuwa kama kitanda cha kutengwa kwake; na kila kitu atakachokilalia kitakuwa najisi, kama unajisi wa kutengwa kwake. "},
{27, "27 Na mtu ye yote atakayevigusa vitu vile atakuwa najisi, naye atazifua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni. "},
{28, "28 Lakini huyo mwanamke kwamba ametakaswa na kule kutoka damu kwake, ndipo atakapojihesabia siku saba, na baadaye atakuwa safi. "},
{29, "29 Siku ya nane atajipatia hua wawili, au makinda mawili ya njiwa, na kumletea kuhani, mlangoni pa hema ya kukutania. "},
{30, "30 Kuhani atamsongeza mmoja kuwa sadaka ya dhambi, na wa pili kuwa sadaka ya kuteketezwa; naye kuhani atafanya upatanisho kwa ajili yake mbele za Bwana, kwa ajili ya kutoka damu ya unajisi kwake. "},
{31, "31 Ni hivi mtakavyowatenga wana wa Israeli na unajisi wao; ili wasife katika unajisi wao, hapo watakapoitia unajisi maskani yangu iliyo katikati yao. "},
{32, "32 Hii ndiyo sheria ya mwenye kisonono, na ya mtu ambaye shahawa yake yamtoka, akawa na unajisi kwa hiyo; "},
{33, "33 na ya mwanamke ambaye yu katika kutengwa kwake, na ya mtu ambaye ana kisonono, kama ni mtu mume, kama ni mtu mke, na ya huyo alalaye na mwanamke mwenye unajisi. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view16() {
struct sw16 poems[] = {
{1, "1 Bwana akasema na Musa, baada ya kufa kwa hao wana wawili wa Haruni, walipokaribia mbele za Bwana, wakafa; "},
{2, "2 Bwana akamwambia Musa, Sema na Haruni ndugu yako, kwamba asiingie wakati wo wote katika mahali patakatifu ndani ya pazia, mbele ya kiti cha rehema, kilicho juu ya sanduku, asije akafa; maana, mimi nitaonekana katika lile wingu juu ya kiti cha rehema. "},
{3, "3 Haruni ataingia katika patakatifu na vitu hivi; ng'ombe mume mchanga kwa sadaka ya dhambi, na kondoo mume kwa sadaka ya kuteketezwa. "},
{4, "4 Ataivaa ile kanzu takatifu ya kitani, atakuwa na zile suruali za kitani mwilini mwake, atafungwa ule mshipi wa kitani, naye atavaa ile kofia ya kitani; hayo ndiyo mavazi matakatifu, naye ataoga mwili wake majini, na kuyavaa. "},
{5, "5 Kisha atatwaa mikononi mwa mkutano wa Waisraeli mbuzi waume wawili, kwa sadaka ya dhambi; na kondoo mume kwa sadaka ya kuteketezwa. "},
{6, "6 Na Haruni atamtoa yule ng'ombe wa sadaka ya dhambi, aliye kwa ajili ya nafsi yake, na kufanya upatanisho kwa ajili ya nafsi yake mwenyewe, na kwa ajili ya nyumba yake. "},
{7, "7 Kisha atawatwaa wale mbuzi wawili na kuwaweka mbele za Bwana mlangoni pa hema ya kukutania. "},
{8, "8 Na Haruni atapiga kura juu ya wale mbuzi wawili; kura moja kwa ajili ya Bwana; na kura ya pili kwa ajili ya Azazeli. "},
{9, "9 Na Haruni atamleta yule mbuzi aliyeangukiwa na kura kwa ajili ya Bwana, na kumtoa awe sadaka ya dhambi. "},
{10, "10 Bali yule mbuzi aliyeangukiwa na kura kwa ajili ya Azazeli atawekwa hai mbele za Bwana ili kumfanyia upatanisho, ili kumpeleka jangwani kwa ajili ya Azazeli. "},
{11, "11 Na Haruni atamsongeza ng'ombe wa sadaka ya dhambi, aliye kwa ajili ya nafsi yake, na kufanya upatanisho kwa ajili ya nafsi yake mwenyewe, na kwa ajili ya nyumba yake; naye atamchinja yule ng'ombe wa sadaka ya dhambi, aliye kwa ajili ya nafsi yake. "},
{12, "12 Kisha atatwaa chetezo kilichojaa makaa ya moto yatokayo katika madhabahu iliyo mbele za Bwana, na konzi mbili za uvumba mzuri uliopondwa sana, mikononi mwake, naye atauleta ndani ya pazia. "},
{13, "13 Kisha atatia ule uvumba juu ya moto mbele za Bwana, ili moshi wa ule uvumba ukisitiri kiti cha rehema kilicho juu ya ushuhuda, asije akafa. "},
{14, "14 Kisha atatwaa baadhi ya damu ya yule ng'ombe, na kuinyunyiza kwa kidole chake juu ya kiti cha rehema upande wa mashariki; na mbele ya kiti cha rehema atainyunyiza ile damu kwa kidole chake mara saba. "},
{15, "15 Kisha atamchinja yule mbuzi wa sadaka ya dhambi, aliye kwa ajili ya watu, na kuileta damu yake ndani ya pazia, na kwa damu hiyo atafanya vile vile kama alivyofanya kwa damu ya ng'ombe, na kuinyunyiza juu ya kiti cha rehema, na mbele ya kiti cha rehema, "},
{16, "16 naye atafanya upatanisho kwa ajili ya mahali patakatifu, kwa sababu ya mambo machafu ya wana wa Israeli, na kwa sababu ya makosa yao, naam, kwa ajili ya dhambi zao zote; naye atafanya vile vile kwa ajili ya hema ya kukutania, ikaayo pamoja nao katikati ya machafu yao. "},
{17, "17 Wala hapatakuwa na mtu katika hema ya kukutania, wakati aingiapo ili kufanya upatanisho katika patakatifu, hata atakapotoka nje, baada ya kufanya upatanisho kwa ajili ya nafsi yake mwenyewe, na kwa ajili ya nyumba yake, na kwa ajili ya mkutano wote wa Israeli. "},
{18, "18 Kisha atatoka na kuiendea madhabahu iliyo mbele za Bwana na kufanya upatanisho kwa ajili yake; atatwaa baadhi ya damu ya yule ng'ombe, na ya damu ya yule mbuzi, na kuitia juu ya pembe za madhabahu pande zote. "},
{19, "19 Tena atanyunyiza baadhi ya damu juu ya madhabahu kwa kidole chake mara saba, na kuitakasa, ili machafu yote ya wana wa Israeli yaitoke. "},
{20, "20 Naye akiisha kufanya upatanisho kwa ajili ya mahali patakatifu, na hema ya kukutania, na madhabahu, atamleta yule mbuzi aliye hai. "},
{21, "21 Na Haruni ataweka mikono yake miwili juu ya kichwa cha yule mbuzi aliye hai, na kuungama juu yake uovu wote wa wana wa Israeli, na makosa yao, naam, dhambi zao zote; naye ataziweka juu ya kichwa chake yule mbuzi, kisha atampeleka aende jangwani kwa mkono wa mtu aliye tayari. "},
{22, "22 Na yule mbuzi atachukua juu yake uovu wao wote, mpaka nchi isiyo watu; naye atamwacha mbuzi jangwani. "},
{23, "23 Na Haruni ataingia katika hema ya kukutania, naye atavua mavazi yake ya kitani, aliyoyavaa alipoingia katika patakatifu, atayaacha humo; "},
{24, "24 naye ataosha mwili wake kwa maji mahali patakatifu, na kuvaa nguo zake, na kutoka, na kusongeza sadaka ya kuteketezwa yake mwenyewe, na sadaka ya kuteketezwa ya watu, naye atafanya upatanisho kwa ajili ya nafsi yake, na kwa ajili ya watu. "},
{25, "25 Na mafuta ya sadaka ya dhambi atayateketeza juu ya madhabahu. "},
{26, "26 Na mtu yule amwachaye mbuzi wa Azazeli aende zake, ataosha nguo zake, na kuosha mwili wake kwa maji, na baadaye ataingia katika marago. "},
{27, "27 Na yule ng'ombe wa sadaka ya dhambi, na yule mbuzi wa sadaka ya dhambi, ambao damu yao ililetwa ndani ifanye ukumbusho katika patakatifu, watachukuliwa nje ya marago; nao watachoma moto ngozi zao, na nyama yao, na mavi yao. "},
{28, "28 Na yeye awachomaye moto atafua nguo zake, na kuosha mwili wake kwa maji, na baadaye ataingia maragoni. "},
{29, "29 Amri hii itakuwa amri ya milele kwenu; katika mwezi wa saba, siku ya kumi ya mwezi, mtajitaabisha roho zenu, msifanye kazi ya namna yo yote, mzalia na mgeni akaaye kati yenu. "},
{30, "30 Kwa maana siku hiyo upatanisho utafanywa kwa ajili yenu, ili kuwatakasa; nanyi mtatakaswa na dhambi zenu zote mbele za Bwana. "},
{31, "31 Ni Sabato ya raha ya makini kwenu nanyi mtajitaabisha roho zenu; ni amri ya milele. "},
{32, "32 Na kuhani atakayetiwa mafuta na kuwekwa wakfu badala ya baba yake, ataufanya huo upatanisho, naye atayavaa mavazi ya kitani, yaani, yale mavazi matakatifu. "},
{33, "33 Naye atafanya upatanisho kwa ajili ya patakatifu, naye atafanya upatanisho kwa ajili ya hema ya kukutania, na kwa ajili ya madhabahu; naye atafanya upatanisho kwa ajili ya makuhani, na kwa ajili ya watu wote wa kusanyiko. "},
{34, "34 Na amri hii itakuwa amri ya milele kwenu, ili kufanya upatanisho kwa ajili ya wana wa Israeli kwa sababu ya dhambi zao zote, mara moja kila mwaka. Naye akafanya vile vile kama Bwana alivyomwamuru Musa. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view17() {
struct sw17 poems[] = {
{1, "1 Bwana akamwambia Musa, akisema, "},
{2, "2 Sema na Haruni, na wanawe, na wana wote wa Israeli, ukawaambie; Neno hili ndilo aliloliamuru Bwana, akisema, "},
{3, "3 Mtu awaye yote wa nyumba ya Israeli atakayechinja ng'ombe, au mwana-kondoo, au mbuzi, ndani ya marago, au atakayemchinja nje ya marago, "},
{4, "4 wala hamleti mlangoni pa hema ya kukutania, ili amtoe kuwa matoleo kwa Bwana mbele ya hema ya Bwana; mtu huyo atahesabiwa kuwa ana hatia ya damu; amemwaga damu; na mtu huyo atakatiliwa mbali na watu wake; "},
{5, "5 ili kusudi wana wa Israeli walete sadaka zao, wazichinjazo mashambani, naam, wazilete kwa Bwana, mpaka mlango wa hema ya kukutania, kwa huyo kuhani, ili wazichinje ziwe sadaka za amani kwa Bwana. "},
{6, "6 Naye kuhani atainyunyiza damu yake juu ya madhabahu ya Bwana, mlangoni pa hema ya kukutania, na kuyateketeza mafuta yake, yawe harufu njema mbele za Bwana. "},
{7, "7 Wala hawatatoa tena sadaka zao kwa wale majini, ambao huwafuata ili wafanye uasherati nao. Sheria hii itakuwa sheria ya milele kwao, kizazi baada ya kizazi. "},
{8, "8 Nawe utawaambia, Mtu awaye yote katika nyumba ya Israeli, au miongoni mwa wageni, wanaokaa nao, atoaye sadaka ya kuteketezwa au dhabihu, "},
{9, "9 wala haileti mlangoni pa hema ya kukutania, ili aisongeze kwa Bwana basi mtu huyo atatengwa na watu wake. "},
{10, "10 Kisha mtu awaye yote wa nyumba ya Israeli, au miongoni mwa hao wageni wakaao kati yao, atakayekula damu, ya aina yo yote, nitakunja uso wangu juu ya mtu huyo alaye damu, nami nitamkatilia mbali na watu wake. "},
{11, "11 Kwa kuwa uhai wa mwili u katika hiyo damu; nami nimewapa ninyi hiyo damu juu ya madhabahu, ili kufanya upatanisho kwa ajili ya nafsi zenu; kwani ni hiyo damu ifanyayo upatanisho kwa sababu ya nafsi. "},
{12, "12 Kwa hiyo naliwaambia wana wa Israeli, Hapana mtu miongoni mwenu aliye na ruhusa kula damu, wala mgeni aketiye kati yenu asile damu. "},
{13, "13 Mtu ye yote aliye wa wana wa Israeli, au wa hao wageni wakaao kati yenu, ambaye amemshika mnyama, au ndege ambaye huliwa, katika kuwinda kwake; atamwaga damu yake, na kuifunika mchanga. "},
{14, "14 Kwa maana kuliko huo uhai wa mnyama, hiyo damu yake ni moja na uhai wake; kwa hiyo naliwaambia wana wa Israeli, Msile damu ya mnyama wa aina yo yote; kwa kuwa uhai wa wanyama wote ni katika hiyo damu yake; atakayeila awaye yote atakatiliwa mbali. "},
{15, "15 Tena kila mtu atakayekula nyamafu, au nyama aliyeraruliwa na wanyama, kama ni mzalia, kama ni mgeni, atafua nguo zake, na kuoga majini, naye atakuwa najisi hata jioni; ndipo atakapokuwa safi. "},
{16, "16 Lakini kwamba hazifui, wala haogi mwili, ndipo atakapochukua uovu wake. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view18() {
struct sw18 poems[] = {
{1, "1 Bwana akanena na Musa, na kumwambia, "},
{2, "2 Nena wewe na wana wa Israeli, uwaambie, Mimi ndimi Bwana, Mungu wenu. "},
{3, "3 Nanyi msifanye matendo kama yale ya nchi ya Misri mliyokaa; wala msifanye matendo kama yale ya nchi ya Kanaani, nitakayowapeleka; wala msiende katika amri zao hao. "},
{4, "4 Mtazifanya hukumu zangu, nanyi mtazishika amri zangu, ili mwenende katika hizo; mimi ndimi Bwana, Mungu wenu. "},
{5, "5 Kwa ajili ya hayo mtazishika amri zangu na hukumu zangu; ambazo mtu akizitumia ataishi kwa hizo; mimi ndimi Bwana. "},
{6, "6 Mtu ye yote aliye wa kwenu asimkaribie mwenziwe aliye wa jamaa yake ya karibu ili kumfunua utupu; mimi ndimi Bwana. "},
{7, "7 Utupu wa baba yako, wala utupu wa mama yako, usifunue, maana ndiye mama yako; usifunue utupu wake. "},
{8, "8 Utupu wa mke wa baba yako, usifunue; maana, ni utupu wa baba yako. "},
{9, "9 Utupu wa umbu lako, binti ya baba yako, au binti ya mama yako, kwamba alizaliwa nyumbani mwenu au kwamba alizaliwa kwengine, utupu wa hao usifunue. "},
{10, "10 Utupu wa binti ya mwanao mume, au wa binti ya binti yako, utupu wao hao usifunue; kwa kuwa ndio utupu wako mwenyewe. "},
{11, "11 Utupu wa binti ya mkewe baba yako, aliyezaliwa na baba yako, yeye ni umbu lako, usifunue utupu wake. "},
{12, "12 Usifunue utupu wa umbu lake baba yako; maana, yeye ni jamaa aliye karibu. "},
{13, "13 Usifunue utupu wa umbu la mama yako; maana, yeye ni jamaa ya mama yako ya karibu. "},
{14, "14 Usifunue utupu wa ndugu ya baba yako, usimkaribie mkewe huyo; yeye ni shangazi lako. "},
{15, "15 Usifunue utupu wa mkweo mwanamke; yeye ni mke wa mwanao; usifunue utupu wake huyo. "},
{16, "16 Usifunue utupu wa mke wa nduguyo; maana, ni utupu wa nduguyo. "},
{17, "17 Usifunue utupu wa mwanamke na binti yake; usimtwae binti ya mwanawe mume, au binti ya binti yake, ili kufunua utupu wake; hao ni jamaa ya karibu; ni uovu mkuu. "},
{18, "18 Wala usitwae mwanamke pamoja na nduguye, awe mtesi wake, na kufunua utupu wake, huyo wa pili atakapokuwa yu hai. "},
{19, "19 Nawe usimkaribie mwanamke kufunua utupu wake wakati wa kutengwa kwa ajili ya unajisi wake. "},
{20, "20 Usilale na mke wa mwenzio, ukajitia unajisi naye. "},
{21, "21 Nawe usitoe kizazi chako cho chote na kuwapisha kwa Moleki, wala usilinajisi jina la Mungu wako; mimi ndimi Bwana. "},
{22, "22 Usilale na mwanamume mfano wa kulala na mwanamke; ni machukizo. "},
{23, "23 Wala usilale na mnyama ye yote, ili kujitia unajisi kwake; wala mwanamke asisimame mbele ya mnyama ili kulala naye; ni uchafuko. "},
{24, "24 Msijitie unajisi katika mambo hayo hata mojawapo; kwa maana hizo taifa nitakazozitoa mbele zenu zimekuwa najisi kwa mambo hayo yote; "},
{25, "25 na hiyo nchi imekuwa najisi; kwa ajili ya hayo naipatiliza uovu wake juu yake, na hiyo nchi yatapika wenyeji wake na kuwatoa. "},
{26, "26 Kwa hiyo mtazishika amri zangu na hukumu zangu, wala msifanye machukizo hayo mojawapo; yeye aliye mzalia, wala mgeni aketiye kati yenu; "},
{27, "27 (kwa kuwa hao watu wa nchi wameyafanya machukizo haya yote, hao waliotangulia mbele zenu, na hiyo nchi imekuwa najisi;) "},
{28, "28 ili kwamba hiyo nchi isiwatapike na ninyi pia, hapo mtakapoitia unajisi, kama ilivyoitapika hiyo taifa iliyotangulia mbele yenu. "},
{29, "29 Kwani mtu awaye yote atakayefanya machukizo hayo mojawapo, nafsi hizo zitakazoyafanya zitakatiliwa mbali na watu wao. "},
{30, "30 Kwa ajili ya hayo yashikeni mausia yangu, ili kwamba msifanye kabisa desturi hizi zichukizazo mojawapo, zilizotangulia kufanywa mbele zenu, wala msijitie unajisi katika mambo hayo; mimi ndimi Bwana, Mungu wenu. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view19() {
struct sw19 poems[] = {
{1, "1 Bwana akanena na Musa, akamwambia, "},
{2, "2 Nena na mkutano wote wa wana wa Israeli, uwaambie, Mtakuwa watakatifu; kwa kuwa mimi Bwana, Mungu wenu, ni mtakatifu. "},
{3, "3 Kila mtu na amche mama yake, na baba yake, nanyi mtazitunza Sabato zangu; mimi ndimi Bwana, Mungu wenu. "},
{4, "4 Msigeuke kuandama sanamu, wala msijifanyizie miungu ya kusubu mimi ndimi Bwana, Mungu wenu. "},
{5, "5 Nanyi hapo mtakapomchinjia Bwana sadaka ya amani mtaisongeza ili kwamba mpate kukubaliwa. "},
{6, "6 Italiwa siku iyo hiyo mliyoichinja, na siku ya pili yake; na kama kitu cho chote katika sadaka hiyo kilisalia hata siku ya tatu kitachomwa moto. "},
{7, "7 Kwamba sadaka hiyo yaliwa hata kidogo siku ya tatu ni machukizo; haitakubaliwa; "},
{8, "8 lakini kila mtu atakayekula atauchukua uovu wake mwenyewe, kwa sababu amekinajisi kitu hicho kitakatifu cha Bwana; na nafsi hiyo itakatiliwa mbali na watu wake. "},
{9, "9 Na mtakapovuna mavuno ya nchi yenu, usivune kabisa kabisa pembe za shamba lako, wala usiyakusanye masazo ya mavuno yako; "},
{10, "10 wala usiyakusanye masazo ya mizabibu yako, wala usiyaokote matunda ya mizabibu yako yaliyopukutika; uyaache kwa ajili ya maskini na mgeni; mimi ndimi Bwana, Mungu wenu. "},
{11, "11 Msiibe, wala msidanganye, wala msiambiane uongo. "},
{12, "12 Msiape uongo kwa jina langu, hata ukalinajisi jina la Mungu wako; Mimi ndimi Bwana. "},
{13, "13 Usimdhulumu jirani yako, wala kumnyang'anya mali yake; ijara yake aliyeajiriwa isikae kwako usiku kucha hata asubuhi. "},
{14, "14 Usimlaani kiziwi, wala usitie kwazo mbele ya kipofu, bali umche Mungu wako; Mimi ndimi Bwana. "},
{15, "15 Msitende yasiyo haki katika hukumu, usimpendelee mtu maskini, wala kumstahi mwenye nguvu; bali utamhukumu jirani yako kwa haki. "},
{16, "16 Usiende huko na huko katikati ya watu wako, kama mchongezi; wala usisimame kinyume cha damu ya jirani yako; mimi ndimi Bwana. "},
{17, "17 Usimchukie ndugu yako moyoni mwako; ni lazima kumkemea jirani yako, wala usichukue dhambi kwa ajili yake. "},
{18, "18 Usifanye kisasi, wala kuwa na kinyongo juu ya wana wa watu wako; bali umpende jirani yako kama nafsi yako; Mimi ndimi Bwana. "},
{19, "19 Mtazishika amri zangu. Usiwaache wanyama wako wa mfugo wakazaana kwa namna mbalimbali; usipande shamba lako mbegu za namna mbili pamoja; wala usivae mwilini mwako nguo ya namna mbili zilizochanganywa pamoja. "},
{20, "20 Tena mtu ye yote alalaye na mwanamke aliye mjakazi, naye ameposwa na mume, wala hakukombolewa kwa lo lote, wala hakupewa uhuru; wataadhibiwa; hawatauawa, kwa sababu huyo mwanamke hakuwa huru. "},
{21, "21 Na huyo mume ataleta sadaka yake ya hatia aitoe kwa Bwana, hata mlangoni pa hema ya kukutania; kondoo mume kwa hiyo sadaka ya hatia. "},
{22, "22 Kisha huyo kuhani atafanya upatanisho kwa ajili yake, kwa huyo kondoo mume wa sadaka ya hatia mbele za Bwana, kwa ajili ya dhambi yake aliyoifanya; naye atasamehewa hiyo dhambi yake aliyoifanya. "},
{23, "23 Nanyi hapo mtakapoingia nchi ile, mkiwa mmepanda miti ya namna zote kwa ajili ya chakula, ndipo mtayahesabu matunda yake kama ni kutotahiriwa; muda wa miaka mitatu miti hiyo itakuwa kwenu kama kutotahiriwa; matunda yake hayataliwa. "},
{24, "24 Lakini mwaka wa nne matunda yake yote yatakuwa ni matakatifu, kwa ajili ya kumpa Bwana shukrani. "},
{25, "25 Na katika mwaka wa tano mtakula katika matunda yake, ili ipate kuwapa maongeo yake; mimi ndimi Bwana, Mungu wenu. "},
{26, "26 Msile kitu cho chote pamoja na damu yake; wala msifanye kuloga, wala kutumia utambuzi. "},
{27, "27 Msinyoe denge pembe za vichwani, wala msiharibu pembe za ndevu zenu. "},
{28, "28 Msichanje chale yo yote katika nyama ya miili yenu kwa ajili ya wafu, wala msiandike alama miilini mwenu; mimi ndimi Bwana. "},
{29, "29 Usimnajisi binti yako, ili kumfanya awe kahaba; isiwe hiyo nchi kuuandama ukahaba, na nchi kujawa na uovu mkuu. "},
{30, "30 Zishikeni Sabato zangu, mpaheshimu patakatifu pangu; mimi ndimi Bwana. "},
{31, "31 Msiwaendee wenye pepo, wala wachawi; msiwatafute; ili kutiwa unajisi na wao; Mimi ndimi Bwana, Mungu wenu. "},
{32, "32 Mwondokeeni mtu mwenye mvi; heshimuni uso wa mtu mzee; nawe mche Mungu wako, Mimi ndimi Bwana. "},
{33, "33 Na mgeni akikaa pamoja nawe katika nchi yako, usimdhulumu. "},
{34, "34 Mgeni akaaye pamoja nawe atakuwa kama mzalia kwenu; mpende kama nafsi yako; kwa maana ninyi mlikuwa wageni katika nchi ya Misri; Mimi ndimi Bwana, Mungu wenu. "},
{35, "35 Msifanye yasiyo haki katika hukumu, wala katika kupima, wala katika mizani, wala katika cheo. "},
{36, "36 Mizani ya haki, vipimo vya haki, efa ya haki, hini ya haki, ndivyo mtakavyokuwa navyo. Mimi ndimi Bwana, Mungu wenu, niliyewatoa katika nchi ya Misri. "},
{37, "37 Zishikeni sheria zangu, na hukumu zangu, na kuzitenda. Mimi ndimi Bwana. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view20() {
struct sw20 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Tena uwaambie wana wa Israeli, Mtu awaye yote miongoni mwa wana wa Israeli, au miongoni mwa wageni waketio katika Israeli, atakayetoa katika kizazi chake na kumpa Moleki, sharti atauawa; wenyeji wa nchi watampiga kwa mawe. "},
{3, "3 Mimi nami nitamkazia uso wangu mtu huyo, nami nitamkatilia mbali na watu wake; kwa kuwa ametoa katika kizazi chake na kumpa Moleki, ili kupatia unajisi patakatifu pangu, na kulinajisi jina langu takatifu. "},
{4, "4 Tena kama wenyeji wa nchi wakimfumbia macho mtu huyo kwa njia yo yote, hapo atoapo katika kizazi chake na kumpa Moleki, wasimwue; "},
{5, "5 ndipo mimi nitamkazia uso wangu mtu huyo, na jamaa zake, nami nitamkatilia mbali, na hao wote wamwandamao katika uzinifu, ili kufanya uzinifu pamoja na Moleki, watengwe mbali na watu wao. "},
{6, "6 Na mtu yule atakayewaendea wenye pepo, na wachawi, ili kuzini pamoja nao, nitakaza uso wangu juu ya mtu yule, nitamtenga na watu wake. "},
{7, "7 Jitakaseni basi, iweni watakatifu, kwa kuwa mimi ndimi Bwana, Mungu wenu. "},
{8, "8 Nanyi zishikeni sheria zangu, na kuzitenda; Mimi ndimi Bwana niwatakasaye ninyi. "},
{9, "9 Kwa maana kila mtu amlaaniye baba yake au mama yake hakika atauawa, amemlaani baba yake na mama yake; damu yake itakuwa juu yake. "},
{10, "10 Na mtu aziniye na mke wa mtu mwingine, naam, yeye aziniye na mke wa jirani yake, mtu mume aziniye, na mwanamke aziniye, hakika watauawa. "},
{11, "11 Na mtu mume atakayelala pamoja na mke wa baba yake amefunua utupu wa baba yake; wote wawili hakika watauawa; damu yao itakuwa juu yao. "},
{12, "12 Na mtu mume akilala na mkwewe mwanamke wote wawili hakika watauawa; wamefanya yaliyo uchafuko; damu yao itakuwa juu yao. "},
{13, "13 Tena mtu mume akilala pamoja na mtu mume, kama alalavyo na mtu mke, wote wawili wamefanya machukizo; hakika watauawa; damu yao itakuwa juu yao. "},
{14, "14 Tena mtu mume akimwoa mke pamoja na mama yake, ni uovu mkuu; watachomwa moto, yeye mume na hao wanawake pia; ili kwamba usiwe uovu kati yenu. "},
{15, "15 Tena mtu mume akilala na mnyama, hakika atauawa; nanyi mtamwua huyo mnyama. "},
{16, "16 Tena mwanamke akimkaribia mnyama ye yote, na kulala pamoja naye, mtamwua huyo mwanamke, na mnyama pia; hakika watauawa; damu yao itakuwa ni juu yao. "},
{17, "17 Tena mtu mume akimwoa umbu lake, binti ya baba yake, au binti ya mama yake, na kuuona utupu wake, na huyo mwanamke kauona utupu wake huyo mume; ni jambo la aibu; watakatiliwa mbali mbele ya macho ya wana wa watu wao; amefunua utupu wa umbu lake; naye atauchukua uovu wake. "},
{18, "18 Tena mtu mume akilala na mwanamke aliye na ugonjwa wake, na kufunua utupu wake; amelifunua jito la damu yake, naye mwanamke amefunua jito la damu yake; wote wawili watakatiliwa mbali na watu wao. "},
{19, "19 Usifunue utupu wa umbu la mama yako, wala umbu la baba yako; kwa kuwa huyo amefunua utupu wa jamaa yake ya karibu; watauchukua uovu wao. "},
{20, "20 Tena mtu mume akilala na mke wa mjomba wake, ameufunua utupu wa mjomba wake; watauchukua uovu wao; watakufa bila kuzaa mwana. "},
{21, "21 Tena mtu mume akimtwaa mke wa nduguye, ni uchafu; ameufunua utupu wa nduguye; hao watakuwa hawana wana. "},
{22, "22 Basi zishikeni amri zangu zote, na hukumu zangu zote, na kuzifanya; ili kwamba hiyo nchi, ambayo nawapeleka ninyi kukaa, isiwatapike. "},
{23, "23 Nanyi msiende kwa kuziandama desturi za taifa, niitoayo mbele yenu; kwa kuwa wao waliyafanya mambo hayo yote, na kwa ajili ya hayo niliwachukia. "},
{24, "24 Lakini mimi nimewaambia ninyi, Mtairithi nchi yao, nami nitawapa ninyi kuimiliki; nchi iliyojaa maziwa na asali; mimi ni Bwana, Mungu wenu, niliyewatenga ninyi na mataifa. "},
{25, "25 Kwa ajili ya hayo mtapambanua kati ya mnyama aliye safi na mnyama aliye najisi, na kati ya ndege aliye tohara na ndege aliye najisi; nanyi msizifanye nafsi zenu kuwa machukizo kwa njia ya mnyama, au kwa njia ya ndege, au kwa njia ya kitu cho chote ambacho nchi imejaa nacho, niliowatenga nanyi kuwa ni najisi. "},
{26, "26 Nanyi mtakuwa watakatifu kwangu mimi; kwa kuwa mimi Bwana ni mtakatifu nami nimewatenga ninyi na mataifa, ili kwamba mwe wangu. "},
{27, "27 Tena mtu mume au mtu mke aliye na pepo, au aliye mchawi, hakika atauawa; watawapiga kwa mawe; damu yao itakuwa juu yao. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view21() {
struct sw21 poems[] = {
{1, "1 Kisha Bwana akamwambia Musa, Nena na hao makuhani, wana wa Haruni, uwaambie, Mtu asijinajisi kwa ajili ya wafu katika watu wake; "},
{2, "2 isipokuwa ni kwa ajili ya jamaa yake wa karibu, kwa ajili ya mama yake, na kwa ajili baba yake, na kwa ajili ya mwanawe, na kwa ajili ya binti yake, na kwa ajili ya nduguye mwanamume; "},
{3, "3 na kwa ajili ya umbu lake aliye mwanamwali, aliye wa udugu kwake, ambaye hajaolewa na mume; ana ruhusa kujitia unajisi kwa ajili yake huyo. "},
{4, "4 Asijitie unajisi, ijapokuwa ni mkubwa katika watu wake, hata akajinajisi. "},
{5, "5 Wasijifanyie upaa kichwani, wala wasinyoe pembe za ndevu zao, wala wasichanje chale katika miili yao. "},
{6, "6 Watakuwa watakatifu kwa Mungu wao, wala wasilinajisi jina la Mungu wao; kwa kuwa wao ndio wasongezao sadaka za Bwana kwa njia ya moto, chakula cha Mungu wao; kwa ajili ya hayo watakuwa watakatifu. "},
{7, "7 Wasimwoe mwanamke aliye kahaba, au huyo aliye mwenye unajisi; wala wasimwoe mwanamke aliyeachwa na mumewe; kwa kuwa yeye kuhani ni mtakatifu kwa Mungu wake. "},
{8, "8 Kwa hiyo basi utamtakasa; kwa kuwa yeye husongeza chakula cha Mungu wako; atakuwa mtakatifu kwako wewe; kwa kuwa mimi Bwana niwatakasaye ninyi ni mtakatifu. "},
{9, "9 Na binti ya kuhani ye yote atakapojitia unajisi kwa ukahaba, amemtia unajisi baba yake; atachomwa moto. "},
{10, "10 Na yeye aliye kuhani mkuu katika nduguze, ambaye mafuta ya kutiwa yamemiminwa kichwani mwake, naye akawekwa wakfu ili ayavae hayo mavazi, yeye hataziacha wazi nywele za kichwa chake, wala hatazirarua nguo zake; "},
{11, "11 wala hataingia penye maiti, wala asijitie unajisi kwa ajili ya baba yake wala mama yake; "},
{12, "12 wala asitoke katika mahali patakatifu, wala asipatie unajisi mahali patakatifu pa Mungu wake; kwa kuwa utakaso wa hayo mafuta ya kutiwa ya Mungu wake u juu yake; mimi ndimi Bwana. "},
{13, "13 Naye atamwoa mwanamke katika ubikira wake. "},
{14, "14 Asitwae mjane, wala mwanamke aliyeachwa na mumewe, wala mwanamke mwenye unajisi, wala kahaba; lakini atamwoa mwanamwali katika watu wake mwenyewe. "},
{15, "15 Naye asiwatie unajisi kizazi chake katika watu wake; kwa kuwa mimi ndimi Bwana nimtakasaye. "},
{16, "16 Kisha Bwana akanena na Musa, na kumwambia, "},
{17, "17 Nena na Haruni, umwambie, Mtu awaye yote wa kizazi chako wewe katika vizazi vyao, aliye na kilema, asikaribie kusongeza chakula cha Mungu wake. "},
{18, "18 Kwa kuwa mtu awaye yote aliye na kilema hatakaribia; mtu kipofu, au kiwete, au mtu aliye na pua iliyoharibika, au aliye na kitu kilichozidi vimpasavyo mwili, "},
{19, "19 au mtu aliyevunjika mguu, au aliyevunjika mkono, "},
{20, "20 au aliye na kijongo, au aliye kibeti, au aliye na kilema cha jichoni, au aliye na upele, au mwenye buba, au aliyevunjika mapumbu; "},
{21, "21 mtu awaye yote wa kizazi cha Haruni kuhani aliye na kilema asikaribie kuzisongeza sadaka za Bwana kwa njia ya moto; ana kilema huyo asikaribie kusongeza chakula cha Mungu wake. "},
{22, "22 Atakula chakula cha Mungu wake, katika hicho kilicho kitakatifu sana, na hicho kilicho kitakatifu. "},
{23, "23 Lakini hataingia ndani ya pazia, wala asikaribie madhabahu, kwa sababu ana kilema; ili kwamba asipanajisi patakatifu pangu; kwa kuwa mimi ndimi Bwana niwatakasaye. "},
{24, "24 Basi Musa akanena na Haruni na wanawe, na wana wa Israeli wote. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view22() {
struct sw22 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Nena na Haruni na wanawe, ili wajitenge wenyewe na vitu vitakatifu vya wana wa Israeli ambavyo wanitakasia mimi, tena kwamba wasilinajisi jina langu takatifu; mimi ndimi Bwana. "},
{3, "3 Waambie, Mtu ye yote wa kizazi chenu chote katika vizazi vyenu, atakayevikaribia vile vitu vitakatifu, ambavyo wana wa Israeli wamtakasia Bwana, naye ana unajisi, mtu huyo atakatiliwa mbali asiwe mbele zangu; mimi ndimi Bwana. "},
{4, "4 Mtu ye yote wa kizazi cha Haruni aliye mwenye ukoma, au mwenye kisonono; yeye asile katika vitu vitakatifu, hata atakapokuwa safi. Tena mtu awaye yote atakayekinusa kitu kilicho na unajisi kwa sababu ya wafu, au mtu ambaye shahawa humtoka; "},
{5, "5 au mtu amgusaye mnyama atambaaye, wa kumpatia unajisi, au kwamba amgusa mtu wa kumpatia unajisi, kwa unajisi wo wote alio nao; "},
{6, "6 huyo mtu atakayegusa kitu cho chote namna hiyo atakuwa najisi hata jioni, naye hatakula katika vitu vitakatifu, asipooga mwili wake majini. "},
{7, "7 Jua likiisha kuchwa atakuwa safi; kisha baadaye atakula katika vitu vitakatifu, maana ni chakula chake. "},
{8, "8 Nyamafu au mnyama aliyeraruliwa na wanyama asile, asijitie unajisi kwa hiyo nyama; mimi ndimi Bwana. "},
{9, "9 Basi kwa hiyo watayashika mausia yangu, wasije wakachukua dhambi kwa hayo, nao wakafa humo, wakiyanajisi; mimi ndimi Bwana niwatakasaye. "},
{10, "10 Mgeni awaye yote asile katika kitu kitakatifu; mgeni wa kuhani akaaye kwake, au mtumishi aliyeajiriwa, asile katika kitu kitakatifu. "},
{11, "11 Lakini kwamba kuhani akinunua mtu ye yote, kwa kumnunua kwa fedha zake, yeye atakula katika hicho; na hao waliozaliwa nyumbani mwake watakula katika chakula chake. "},
{12, "12 Na binti ya kuhani kwamba ameolewa na mgeni, asile katika sadaka ya kuinuliwa katika vitu vile vitakatifu. "},
{13, "13 Lakini kwamba binti ya kuhani ni mjane, au kwamba ameachwa na mumewe, wala hana mtoto, kisha amerudi na kuketi katika nyumba ya baba yake, kama vile katika ujana wake, yeye atakula katika chakula cha baba yake; lakini mgeni awaye yote asile katika chakula hicho. "},
{14, "14 Tena kama mtu ye yote akila katika kitu kilicho kitakatifu pasipo kukijua, ndipo ataongeza sehemu ya tano juu ya kitu hicho, na kumpa kuhani kitu hicho kitakatifu. "},
{15, "15 Wala wasivinajisi vitu vitakatifu vya wana wa Israeli, wavisongezavyo kwa Bwana; "},
{16, "16 hata wakawatwika ule uovu uletao hatia, hapo walapo vitu vyao vitakatifu; kwa kuwa mimi ndimi Bwana niwatakasaye. "},
{17, "17 Kisha Bwana akanena na Musa, na kumwambia, "},
{18, "18 Nena na Haruni na wanawe, na wana wa israeli wote, uwaambie, Mtu ye yote wa nyumba ya Israeli, au wa wageni walio katika Israeli, atakayetoa matoleo yake, kama ni nadhiri zao mojawapo, au kama ni sadaka yo yote ya hiari, watakayomtolea Bwana kuwa sadaka ya kuteketezwa; "},
{19, "19 ili mpate kukubaliwa, mtaleta mume mkamilifu, katika ng'ombe, au katika kondoo, au katika mbuzi. "},
{20, "20 Lakini mnyama ye yote aliye na kilema msimtoe; kwa kuwa hatakubaliwa kwa ajili yenu. "},
{21, "21 Na mtu awaye yote atakayemtolea Bwana dhabihu katika sadaka za amani, ili kuondoa nadhiri, au sadaka ya moyo wa kupenda, katika ng'ombe, au katika kondoo, atakuwa mkamilifu, apate kukubaliwa; pasiwe na kilema ndani yake cho chote. "},
{22, "22 Kipofu, au aliyevunjika mahali, au kiwete au aliye na vidonda, au aliye na upele, au aliye na kikoko, hamtamtolea Bwana wanyama hao, wala msiwasongeze kwa Bwana kwa njia ya moto juu ya madhabahu. "},
{23, "23 Ng'ombe, au mwana-kondoo aliye na kitu kilichozidi, au aliyepungukiwa na kitu katika vitu vya mwilini mwake, mna ruhusa kutoa kuwa sadaka ya moyo wa kupenda; lakini kwa ajili ya nadhiri hatakubaliwa. "},
{24, "24 Mnyama aliyeumia mapumbu yake, au kusetwa, au kuvunjwa, au kukatwa, msimtolee Bwana; wala msifanye hivi katika nchi yenu. "},
{25, "25 Wala msisongeze chakula cha Mungu wenu katika wanyama hao mmojawapo kitokacho mkononi mwa mgeni; kwa sababu uharibifu wao u ndani yao, wana kilema ndani yao; hawatakubaliwa kwa ajili yenu. "},
{26, "26 Kisha Bwana akanena na Musa, na kumwambia, "},
{27, "27 Hapo ng'ombe, au kondoo, au mbuzi, akizaliwa, atakuwa pamoja na mamaye muda wa siku saba; na siku ya nane na baadaye atakubaliwa kuwa ni sadaka ya kutolewa kwa Bwana kwa njia ya moto. "},
{28, "28 Tena kama ni ng'ombe, au kama ni kondoo, msimchinje huyo na mwanawe wote wawili kwa siku moja. "},
{29, "29 Tena mtakapomchinjia Bwana dhabihu ya shukrani, mtamchinja ili mpate kukubaliwa. "},
{30, "30 Italiwa siku iyo hiyo; msisaze kitu chake hata asubuhi; mimi ndimi Bwana. "},
{31, "31 Kwa hiyo mtayashika maagizo yangu, na kuyafanya; mimi ndimi Bwana. "},
{32, "32 Wala msilinajisi jina langu takatifu; lakini nitatakaswa mimi katika wana wa Israeli; mimi ndimi Bwana niwatakasaye ninyi, "},
{33, "33 niliyewaleta mtoke nchi ya Misri, ili niwe Mungu wenu; mimi ndimi Bwana. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view23() {
struct sw23 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Nena na wana wa Israeli, na kuwaambia, Sikukuu za Bwana, ambazo mtazipigia mbiu kuwa ni makusanyiko matakatifu; hizi ni sikukuu zangu. "},
{3, "3 Mtafanya kazi siku sita; lakini siku ya saba ni Sabato ya kustarehe kabisa, kusanyiko takatifu; msifanye kazi ya namna yo yote; ni Sabato kwa Bwana katika makao yenu yote. "},
{4, "4 Sikukuu za Bwana ni hizi, ni makusanyiko matakatifu, ambayo mtayapigia mbiu kwa nyakati zake. "},
{5, "5 Mwezi wa kwanza, siku ya kumi na nne ya mwezi wakati wa jioni, ni pasaka ya Bwana. "},
{6, "6 Na siku ya kumi na tano ya mwezi ule ule ni sikukuu kwa Bwana ya mkate usiotiwa chachu; mtaila mikate isiyochachwa muda wa siku saba. "},
{7, "7 Siku ya kwanza mtakuwa na kusanyiko takatifu msifanye kazi yo yote ya utumishi. "},
{8, "8 Lakini mtasongeza sadaka kwa Bwana kwa njia ya moto siku saba; siku ya saba ni kusanyiko takatifu; msifanye kazi yo yote ya utumishi. "},
{9, "9 Kisha Bwana akanena na Musa, na kumwambia, "},
{10, "10 Nena na wana wa Israeli, uwaambie, Hapo mtakapokuwa mmekwisha ingia hiyo nchi niwapayo, na kuyavuna mavuno yake, ndipo mtakapomletea kuhani mganda wa malimbuko ya mavuno yenu; "},
{11, "11 naye atautikisa mganda mbele za Bwana ili kwamba ukubaliwe kwa ajili yenu; siku ya pili baada ya Sabato kuhani atautikisa. "},
{12, "12 Na siku hiyo mtakayoutikisa mganda, mtamsongeza mwana-kondoo wa kiume mkamilifu wa mwaka wa kwanza awe sadaka ya kuteketezwa kwa Bwana. "},
{13, "13 Na sadaka yake ya unga itakuwa sehemu za kumi mbili za efa za unga mwembamba uliochanganywa na mafuta, ni kafara iliyosongezwa kwa Bwana kwa moto kuwa harufu ya kupendeza; na sadaka yake ya kinywaji itakuwa ni divai, robo ya hini. "},
{14, "14 Nanyi msile mkate, wala bisi, wala masuke machanga, hata siku iyo hiyo, hata mtakapokuwa mmekwisha kuleta sadaka ya Mungu wenu; hii ni amri ya milele katika vizazi vyenu katika makao yenu yote. "},
{15, "15 Nanyi mtajihesabia tangu siku ya pili baada ya Sabato, tangu siku hiyo mliyouleta mganda wa sadaka ya kutikiswa; zitatimia Sabato saba; "},
{16, "16 hata siku ya pili ya hiyo Sabato ya saba mtahesabu siku hamsini; nanyi mtamsongezea Bwana sadaka ya unga mpya. "},
{17, "17 Mtatoa katika makao yenu mikate miwili ya kutikiswa, itakuwa ya sehemu za kumi mbili za efa; itakuwa ya unga mwembamba, itaokwa na chachu, iwe malimbuko kwa Bwana. "},
{18, "18 Nanyi, pamoja na hiyo mikate, mtasongeza wana-kondoo saba, walio wakamilifu, wa mwaka wa kwanza, na ng'ombe mume mmoja, na kondoo waume wawili; watakuwa sadaka ya kuteketezwa kwa Bwana, pamoja na sadaka yao ya unga, na sadaka zao za kinywaji, sadaka ya harufu ya kupendeza iliyosongezwa kwa Bwana kwa njia ya moto. "},
{19, "19 Nanyi mtasongeza mbuzi mume mmoja kuwa sadaka ya dhambi, na wana-kondoo wawili waume wa mwaka wa kwanza kuwa dhabihu ya sadaka za amani. "},
{20, "20 Kisha kuhani atawatikisa pamoja na hiyo mikate ya malimbuko kuwa sadaka ya kutikiswa mbele za Bwana, pamoja na wale wana-kondoo wawili; watakuwa watakatifu kwa Bwana, wawe wa huyo kuhani. "},
{21, "21 Nanyi mtapiga mbiu siku iyo hiyo; kutakuwa na kusanyiko takatifu kwenu; msifanye kazi yo yote ya utumishi; ni amri ya milele katika makao yenu yote, katika vizazi vyenu. "},
{22, "22 Nanyi hapo mtakapovuna mavuno ya nchi yenu, usivune kabisa kabisa pembe za shamba lako, wala msiyakusanye masazo ya mavuno yako; utayaacha kwa ajili ya huyo maskini, na mgeni; mimi ndimi Bwana, Mungu wenu. "},
{23, "23 Kisha Bwana akanena na Musa, na kumwambia, "},
{24, "24 Nena na wana wa Israeli, uwaambie, Mwezi wa saba, siku ya kwanza ya mwezi, kutakuwa na kustarehe kabisa kwenu, ni ukumbusho wa kuzipiga baragumu, ni kusanyiko takatifu. "},
{25, "25 Msifanye kazi yo yote ya utumishi; nanyi mtasongeza sadaka kwa Bwana kwa njia ya moto. "},
{26, "26 Kisha Bwana akanena na Musa, na kumwambia, "},
{27, "27 Lakini siku ya kumi ya mwezi huo wa saba ni siku ya upatanisho; itakuwa kusanyiko takatifu kwenu, nanyi mtazitesa nafsi zenu; nanyi mtasongeza sadaka kwa Bwana kwa njia ya moto. "},
{28, "28 Nanyi msifanye kazi yo yote siku hiyo; kwa kuwa ni siku ya upatanisho, ili kufanya upatanisho kwa ajili yenu mbele za Bwana, Mungu wenu. "},
{29, "29 Kwa kuwa mtu awaye yote asiyejitesa mwenyewe siku iyo hiyo, atakatiliwa mbali na watu wake. "},
{30, "30 Na mtu ye yote afanyaye kazi ya namna yo yote siku hiyo, mtu huyo nitamwangamiza atoke katika watu wake. "},
{31, "31 Msifanye kazi ya namna yo yote; ni amri ya milele katika vizazi vyenu, katika makao yenu yote. "},
{32, "32 Itakuwa kwenu sabato ya kustarehe kabisa, nanyi mtazitesa nafsi zenu; siku ya kenda ya mwezi wakati wa jioni, tangu jioni hata jioni, mtaishika hiyo Sabato yenu. "},
{33, "33 Kisha Bwana akanena na Musa, na kumwambia, "},
{34, "34 Nena na wana wa Israeli, uwaambie, Siku ya kumi na tano ya mwezi huo wa saba ni sikukuu ya vibanda muda wa siku saba kwa Bwana. "},
{35, "35 Siku ya kwanza kutakuwa na kusanyiko takatifu; msifanye kazi yo yote ya utumishi. "},
{36, "36 Mtamsongezea Bwana sadaka kwa moto siku saba; siku ya nane kutakuwa na kusanyiko takatifu kwenu; nanyi mtamsongezea Bwana sadaka kwa moto; ni mkutano wa makini huu; msifanye kazi yo yote ya utumishi. "},
{37, "37 Sikukuu za Bwana ni hizi, ambazo mtazipigia mbiu ya kuwa ni makusanyiko matakatifu, ili mmsongezee Bwana sadaka kwa moto, sadaka ya kuteketezwa, na sadaka ya unga, na dhabihu, na sadaka za kinywaji, kila sadaka kwa siku yake; "},
{38, "38 zaidi ya hizo Sabato za Bwana, na zaidi ya matoleo yenu, na zaidi ya hizo nadhiri zenu zote, na zaidi ya sadaka zenu za hiari, ambazo mwampa Bwana. "},
{39, "39 Lakini siku ya kumi na tano ya mwezi wa saba, hapo mtakapokuwa mmekwisha kuyachuma mavuno ya nchi, mtaweka sikukuu ya Bwana muda wa siku saba; siku ya kwanza kutakuwa na kustarehe kabisa, na siku ya nane kutakuwa na kustarehe kabisa. "},
{40, "40 Nanyi siku ya kwanza mtajipatia matunda ya miti mizuri, na makuti ya mitende, na matawi ya miti minene, na mierebi ya vijitoni; nanyi mtafurahi mbele za Bwana, Mungu wenu, muda wa siku saba. "},
{41, "41 Nanyi mtaishika kuwa sikukuu kwa Bwana muda wa siku saba katika mwaka; ni amri ya milele katika vizazi vyenu; mtaishika katika mwezi wa saba. "},
{42, "42 Mtakaa katika vibanda muda wa siku saba; wazalia wote wa Israeli watakaa katika vibanda; "},
{43, "43 ili vizazi vyenu vipate kujua ya kuwa niliwaketisha wana wa Israeli katika vibanda, hapo nilipowaleta kutoka nchi ya Misri; mimi ndimi Bwana Mungu wenu. "},
{44, "44 Naye Musa akawaambia wana wa Israeli hizo sikukuu za Bwana. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view24() {
struct sw24 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Waagize wana wa Israeli kwamba wakuletee mafuta ya zeituni safi ya kupondwa kwa ajili ya ile nuru, ili hiyo taa iwake daima. "},
{3, "3 Hapo nje ya pazia la ushahidi, ndani ya hema ya kukutania, Haruni ataitengeza tangu jioni hata asubuhi mbele za Bwana daima; ni amri ya milele katika vizazi vyenu. "},
{4, "4 Atazitengeza hizo taa katika kile kinara kilicho safi mbele za Bwana daima. "},
{5, "5 Nawe utatwaa unga mwembamba, na kuoka mikate kumi na miwili ya huo unga; sehemu za kumi mbili za efa, zitakuwa katika mkate mmoja. "},
{6, "6 Nawe iweke mistari miwili, mikate sita kwa kila mstari, juu ya hiyo meza safi, mbele za Bwana. "},
{7, "7 Nawe utatia ubani safi juu ya kila mstari, ili uwe ukumbusho kwa hiyo mikate, sadaka ya kusongezwa kwa Bwana kwa moto. "},
{8, "8 Kila siku ya Sabato ataipanga mbele za Bwana daima; ni kwa ajili ya wana wa Israeli, agano la milele. "},
{9, "9 Nayo itakuwa ya Haruni na wanawe; nao wataila katika mahali patakatifu; kwa sababu kwake ni takatifu sana katika sadaka zisongezwazo kwa Bwana kwa moto, kwa amri ya milele. "},
{10, "10 Ikawa mwana wa mwanamke wa Kiisraeli, ambaye babaye alikuwa Mmisri, akatokea kati ya wana wa Israeli; na huyo mwana wa mwanamke wa Kiisraeli, na Mwisraeli mmoja, wakapigana pamoja ndani ya marago; "},
{11, "11 kisha huyo mwana wa mwanamke wa Kiisraeli akalikufuru hilo Jina, na kuapiza; nao wakamleta kwa Musa. Na jina la mamaye alikuwa akiitwa Shelomithi, binti ya Dibri, wa kabila ya Dani. "},
{12, "12 Nao wakamtia kifungoni, ili wapate kuambiwa neno litakalotoka kinywani pa Bwana. "},
{13, "13 Na Bwana akasema na Musa, na kumwambia, "},
{14, "14 Mtoe huyo aliyeapiza nje ya marago; na wale wote waliomsikia na waweke mikono yao kichwani mwake, kisha mkutano wote na wamwue kwa kumpiga kwa mawe. "},
{15, "15 Nawe nena na wana wa Israeli na kuwaambia, Mtu awaye yote atakayemlaani Mungu wake atachukua dhambi yake. "},
{16, "16 Na yeye atakayelikufuru jina la Bwana hakika atauawa; mkutano wote watamwua kwa kumpiga kwa mawe; kama ni mgeni, kama ni mzalia, hapo atakapolikufuru jina la Bwana atauawa. "},
{17, "17 Na mtu ampigaye mtu hata akafa, lazima atauawa; "},
{18, "18 na atakayempiga mnyama hata akafa atalipa; uhai kwa uhai. "},
{19, "19 Na mtu akimtia mwenziwe kilema; vile vile kama alivyofanya, naye atafanyiwa vivyo; "},
{20, "20 jeraha kwa jeraha, jicho kwa jicho, jino kwa jino; vile vile kama alivyomtia mtu kilema, naye atalipwa vivyo. "},
{21, "21 Na mtu amwuaye mnyama atalipa; na yeye atakayemwua binadamu atauawa. "},
{22, "22 Mtakuwa na sheria moja tu, kwa huyo aliye mgeni, na kwa mzalia; kwa kuwa mimi ndimi Bwana, Mungu wenu. "},
{23, "23 Musa akanena na wana wa Israeli, nao wakamtoa huyo aliyeapiza nje ya marago, wakamwua kwa kumpiga kwa mawe. Wana wa Israeli wakafanya kama Bwana alivyomwagiza Musa. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view25() {
struct sw25 poems[] = {
{1, "1 Kisha Bwana akanena na Musa katika mlima wa Sinai, na kumwambia, "},
{2, "2 Nena na wana wa Israeli, uwaambie, Hapo mtakapoingia katika nchi niwapayo, ndipo hiyo nchi itashika Sabato kwa ajili ya Bwana. "},
{3, "3 Panda shamba lako miaka sita, na miaka sita lipelee shamba lako la mizabibu, na kuyachuma matunda yake; "},
{4, "4 lakini katika mwaka wa saba itakuwa ni Sabato ya kustarehe kabisa kwa ajili ya hiyo nchi, ni Sabato kwa Bwana; usipande shamba lako, wala usipelee shamba lako la mizabibu. "},
{5, "5 Hicho kimeacho chenyewe katika mavuno yako, usikivune, wala zabibu za mizabibu isiyopelewa usizitunde; utakuwa mwaka wa kustarehe kabisa kwa ajili ya hiyo nchi. "},
{6, "6 Na hiyo Sabato ya nchi itakuwa chakula kwenu; kwako wewe, na kwa mtumwa wako, na kwa mjakazi wako, na kwa mtumishi aliyeajiriwa, na kwa mgeni wako akaaye pamoja nawe; "},
{7, "7 na kwa hayawani wako, na kwa wanyama walio katika nchi yako; maongeo yote yatakuwa ni chakula chao. "},
{8, "8 Nawe utajihesabia Sabato saba za miaka, maana, miaka saba mara saba; zitakuwa ni siku za Sabato saba za miaka kwenu, maana miaka arobaini na kenda. "},
{9, "9 Ndipo utakapoipeleka pande zote hiyo baragumu yenye sauti kuu, siku ya kumi ya mwezi wa saba; katika siku hiyo ya upatanisho mtaipeleka baragumu katika nchi yenu yote. "},
{10, "10 Na mwaka wa hamsini mtautakasa, na kupiga mbiu ya kuachwa mahuru katika nchi yote kwa watu wote wanayokaa; itakuwa ni yubile kwenu, nanyi kila mtu atairudia milki yake mwenyewe, nanyi mtarejea kila mtu kwa jamaa yake. "},
{11, "11 Mwaka huo wa hamsini utakuwa ni yubile kwenu; msipande mbegu, wala msivune kitu hicho kimeacho chenyewe, wala msizitunde zabibu za mizabibu isiyopelewa. "},
{12, "12 Kwa kuwa ni yubile; utakuwa mwaka mtakatifu kwenu; mtakula maongeo yake yatokayo shambani. "},
{13, "13 Mwaka huo wa yubile mtairudia kila mtu milki yake. "},
{14, "14 Tena kama ukimwuzia jirani yako cho chote, au kununua cho chote mkononi mwa jirani yako, msidanganyane wenyewe kwa wenyewe; "},
{15, "15 kwa hesabu ya miaka iliyo baada ya yubile, ndivyo utakavyonunua kwa jirani yako, na kama hesabu ya miaka ya mavuno ndivyo atakavyokuuzia wewe. "},
{16, "16 Kama hesabu ya miaka ilivyo ni nyingi ndivyo utakavyoongeza bei yake, na kama hesabu ya miaka ilivyo ni chache ndivyo utakavyopunguza bei yake; kwani yeye akuuzia mavuno kama hesabu yake ilivyo. "},
{17, "17 Wala msidanganyane; lakini utamcha Mungu wako; kwa kuwa mimi ndimi Bwana, Mungu wenu. "},
{18, "18 Kwa sababu hii zitendeni amri zangu, mkazishike hukumu zangu, na kuzifanya; nanyi mtakaa katika hiyo nchi salama. "},
{19, "19 Nayo nchi itazaa matunda yake, nanyi mtakula na kushiba, na kuketi humo salama. "},
{20, "20 Na kama mkisema, Je! Mwaka wa saba tutakula nini? Angalieni hatutapanda mbegu, wala kukusanya maongeo yetu; "},
{21, "21 ndipo nitawaamria baraka yangu iwe juu yenu mwaka wa sita, nayo utazaa matunda hesabu ya miaka mitatu. "},
{22, "22 Na mwaka wa nane mtapanda mbegu, na kuyala yale matunda, akiba hiyo ya zamani, hata mwaka wa kenda, hata matunda yake yatakapoletwa ndani, mtakula hiyo akiba ya zamani. "},
{23, "23 Nayo nchi haitauzwa kabisa kabisa; kwani nchi ni yangu mimi; maana ninyi ni wageni na wasafiri wangu. "},
{24, "24 Nanyi mtatoa ukombozi kwa ajili ya nchi, katika nchi yote ya milki yenu. "},
{25, "25 Kwamba nduguyo amekuwa maskini, na kuuza sehemu ya milki yake, ndipo jamaa yake aliye karibu naye atakuja, naye ataikomboa ile aliyoiuza nduguye. "},
{26, "26 Na kama mtu hana atakayeikomboa, naye mwenyewe amepata mali na kujiona kuwa anayo ya kutosha kuikomboa; "},
{27, "27 ndipo na aihesabu hiyo miaka ya kuuzwa kwake, na kilichozidi kumrudishia huyo mtu aliyeinunua; naye atairejea milki yake. "},
{28, "28 Lakini asipoweza kujipatia mwenyewe, ndipo hiyo iliyouzwa itakaa mkononi mwake huyo aliyeinunua, hata mwaka wa yubile; na katika yubile itatoka, naye atairejea milki yake. "},
{29, "29 Tena kwamba mtu anauza nyumba ya kukaa, iliyo ndani ya mji wenye kuta, ndipo ana ruhusa kuikomboa katika mwaka mmoja mzima baada ya kuiuza; atakuwa na amri ya kuikomboa muda wa mwaka mzima. "},
{30, "30 Na kama haikukombolewa katika muda wa mwaka mzima, ndipo hiyo nyumba iliyo ndani ya mji wenye kuta itathibitishwa milele kuwa ya huyo aliyeinunua, katika vizazi vyake; nayo haitatoka katika yubile. "},
{31, "31 Lakini nyumba za vijiji, ambavyo havikuzingirwa na kuta, zitahesabiwa pamoja na mashamba ya nchi; nazo zina ruhusa ya kukombolewa, nazo zitatoka katika yubile. "},
{32, "32 Pamoja na hayo, miji ya Walawi, nyumba za miji ya milki yao, Walawi wana ruhusa ya kuzikomboa majira yo yote. "},
{33, "33 Tena kama mtu mmoja wa hao Walawi akikomboa, ndipo nyumba iliyouzwa, na mji wa milki yake, itatoka katika yubile; maana, hizo nyumba za miji ya Walawi ni milki yao kati ya wana wa Israeli. "},
{34, "34 Lakini konde la malisho ya miji yao lisiuzwe kwa kuwa ni milki yao ya daima. "},
{35, "35 Na ikiwa ndugu yako amekuwa maskini, na mkono wake umelegea kwako, ndipo utamsaidia, atakaa nawe kama mgeni, na msafiri. "},
{36, "36 Usitake riba kwake wala faida, bali mche Mungu wako, ili ndugu yako akae nawe. "},
{37, "37 Usimpe fedha yako upate riba, wala usimpe vyakula vyako kwa kujitakia faida. "},
{38, "38 Mimi ndimi Bwana, Mungu wako, niliyewatoa katika nchi ya Misri ili niwape nchi ya Kanaani, nipate kuwa Mungu wenu. "},
{39, "39 Tena kwamba nduguyo amekuwa maskini pamoja nawe, akajiuza kwako; usimtumikishe mfano wa mtumwa; "},
{40, "40 kwako wewe atakuwa mfano wa mtumishi aliyeajiriwa, au mfano wa msafiri; naye atatumika kwako hata mwaka wa yubile; "},
{41, "41 ndipo atakapotoka kwako aende zake, yeye na wanawe pamoja naye, naye atairejea jamaa yake mwenyewe, tena atairejea milki ya baba zake. "},
{42, "42 Kwa kuwa hao ni watumishi wangu, niliowaleta watoke nchi ya Misri; wasiuzwe mfano wa watumwa. "},
{43, "43 Usitawale juu yake kwa nguvu; ila umche Mungu wako. "},
{44, "44 Tena katika habari za watumwa wako na wajakazi wako, utakaokuwa nao; mataifa walio kando-kando yenu, katika hao mtanunua watumwa na wajakazi. "},
{45, "45 Tena katika wana wa wageni wakaao kati yenu mtajinunulia, na katika jamaa zao walio pamoja nanyi, waliowazaa katika nchi yenu; wao watakuwa milki yenu. "},
{46, "46 Nanyi mtawafanya kuwa urithi kwa watoto wenu baada yenu, wawe milki yao; siku zote mtatwaa watumwa wenu katika hao; lakini msitawale kwa nguvu juu ya ndugu zenu, hao wana wa Israeli, wenyewe kwa wenyewe. "},
{47, "47 Tena kama mgeni au mtu akaaye nawe akitajirika, na nduguyo amekuwa maskini karibu naye, akajiuza kwa huyo mgeni, au kwa huyo akaaye kwako, au kwa ukoo wa jamaa ya huyo mgeni; "},
{48, "48 baada ya kuuzwa aweza kukombolewa; mtu mmoja miongoni mwa ndugu zake ana ruhusa kumkomboa; "},
{49, "49 au mjomba wake, au mwana wa mjomba wake, ana ruhusa ya kumkomboa, au mtu awaye yote aliye karibu naye wa jamaa yake, ana ruhusa ya kumkomboa; au kwamba yeye mwenyewe amepata mali, ana ruhusa ya kujikomboa mwenyewe. "},
{50, "50 Naye atafanya hesabu na huyo aliyemnunua, tangu mwaka huo aliojiuza hata mwaka wa yubile; na ile bei ya kuuzwa kwake itakuwa kama hesabu ya hiyo miaka ilivyo; atakuwa pamoja naye kama majira ya mtumishi aliyeajiriwa yalivyo. "},
{51, "51 Kwamba ikali imesalia miaka mingi, kama hesabu yake ilivyo ndivyo atakavyolipa bei ya ukombozi wake, katika hiyo fedha ambayo alinunuliwa kwayo. "},
{52, "52 Tena kwamba imesalia miaka michache tu hata mwaka wa yubile, ndipo atafanya hesabu naye, kama hesabu ya miaka yake ilivyo, ndivyo atakavyolipa tena bei ya ukombozi wake. "},
{53, "53 Kama mtumishi aliyeajiriwa mwaka hata mwaka, ndivyo atakavyokuwa pamoja naye; asitawale juu yake kwa nguvu mbele ya macho yako. "},
{54, "54 Tena kwamba hakukombolewa kwa njia hizi mojawapo, ndipo atatoka katika mwaka wa yubile, yeye, na watoto wake pamoja naye. "},
{55, "55 Kwa kuwa wana wa Israeli ni watumishi; ni watumishi wangu niliowaleta watoke katika nchi ya Misri; mimi ndimi Bwana, Mungu wenu. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view26() {
struct sw26 poems[] = {
{1, "1 Msifanye sanamu yo yote, wala msijisimamishie sanamu ya kuchonga, wala mnara, wala msiweke jiwe lo lote lililochorwa katika nchi yenu ili kulisujudia; kwa kuwa mimi ndimi Bwana, Mungu wenu. "},
{2, "2 Zishikeni Sabato zangu, na kupastahi patakatifu pangu; mimi ndimi Bwana. "},
{3, "3 Kama mkienda katika amri zangu, na kuyashika maagizo yangu, na kuyafanya; "},
{4, "4 ndipo nitazinyesha mvua zenu kwa nyakati zake, na nchi itazaa maongeo yake, na miti ya mashambani itazaa matunda yake. "},
{5, "5 Tena kupura nafaka kwenu kutaendelea hata wakati wa kuvuna zabibu, na kuvuna zabibu kutaendelea hata wakati wa kupanda mbegu; nanyi mtakula chakula chenu na kushiba, na kuketi katika nchi yenu salama. "},
{6, "6 Nami nitawapa amani katika nchi, tena mtalala wala hapana atakayewatia hofu; nami nitawakomesha wanyama wabaya katika nchi yenu, wala hautapita upanga katika nchi yenu. "},
{7, "7 Nanyi mtawafukuza adui zenu, nao wataanguka mbele zenu kwa upanga. "},
{8, "8 Na watu watano wa kwenu watawafukuza watu mia, na watu mia wa kwenu watawafukuza watu elfu kumi; na adui zenu wataanguka mbele yenu kwa upanga. "},
{9, "9 Nami nitawaelekezea uso wangu, na kuwapa uzazi mwingi, na kuwaongeza; nami nitalithibitisha agano langu pamoja nanyi. "},
{10, "10 Nanyi mtakula akiba ya zamani mliyoiweka siku nyingi, tena hayo ya zamani mtayatoa, ili myaweke yaliyo mapya. "},
{11, "11 Nami nitaiweka maskani yangu kati yenu; wala roho yangu haitawachukia. "},
{12, "12 Nami nitakwenda kati yenu, nami nitakuwa Mungu wenu, nanyi mtakuwa watu wangu. "},
{13, "13 Mimi ndimi Bwana, Mungu wenu, niliyewaleta mtoke katika nchi ya Misri, ili msiwe watumwa wao; nami nimeivunja miti ya kongwa lenu, nikawaendesha mwende sawasawa. "},
{14, "14 Lakini msiponisikiza, wala hamtaki kuyafanya maagizo hayo yote; "},
{15, "15 nanyi mkizikataa amri zangu, na roho yenu ikichukia hukumu zangu, hata ikawa hamtaki kuyafanya maagizo yangu yote, bali mwalivunja agano langu; "},
{16, "16 mimi nami nitawatenda jambo hili; nitaamrisha uje juu yenu utisho, hata kifua kikuu na homa, zitakazoharibu macho yenu, na kuidhoofisha roho; nanyi mtapanda mbegu yenu bure, kwa kuwa adui zenu wataila. "},
{17, "17 Nami nitauelekeza uso wangu kinyume chenu, nanyi mtapigwa mbele ya adui zenu; hao wawachukiao watatawala juu yenu; nanyi mtakimbia wakati ambao hapana awafukuzaye. "},
{18, "18 Tena ikiwa baada ya hayo hamtaki kunisikiza, ndipo nitawaadhibu zaidi mara saba kwa ajili ya dhambi zenu. "},
{19, "19 Nami nitakivunja kiburi cha uwezo wenu; nami nitazifanya mbingu zenu kuwa kama chuma, na nchi yenu kuwa kama shaba; "},
{20, "20 na nguvu zenu mtazitumia bure; kwa kuwa nchi yenu haitazaa mazao yake, wala miti ya nchi haitazaa matunda yake. "},
{21, "21 Nanyi ikiwa mwaenenda kinyume changu, wala hamtaki kunisikiza; nitaleta mapigo mara saba zaidi juu yenu, kama dhambi zenu zilivyo. "},
{22, "22 Nami nitaleta wanyama wakali kati yenu, ambao watawanyang'anya watoto wenu, na kuwaharibu wanyama wenu wa kufugwa, na kuwapunguza muwe wachache hesabu yenu; na njia zenu zitakuwa ni ukiwa. "},
{23, "23 Tena kama hamtaki kurejezwa upya kwangu mimi kwa mambo haya, bali mwaendelea kunishikia kinyume; ndipo mimi nami nitaendelea kuwashikia ninyi kinyume; "},
{24, "24 nami nitawapiga, naam mimi, mara saba kwa ajili ya dhambi zenu. "},
{25, "25 Nami nitaleta upanga juu yenu, utakaopatiliza kisasi cha hilo agano; nanyi mtakutanishwa ndani ya miji yenu; nami nitaleta tauni kati yenu; nanyi mtatiwa mkononi mwa adui. "},
{26, "26 Hapo nitakapovunja tegemeo lenu la mkate, wanawake kumi wataoka mikate yenu katika tanuu moja, nao watawapa mikate yenu tena kwa kupima kwa mizani; nanyi mtakula, lakini hamtashiba. "},
{27, "27 Tena ikiwa baada ya hayo yote hamtaki kunisikiza, bali mwaenenda kwa kunishikia kinyume; "},
{28, "28 ndipo nami nitakwenda kwa kuwashikia ninyi kinyume katika ghadhabu yangu; nami nitawaadhibu mara saba kwa dhambi zenu. "},
{29, "29 Nanyi mtakula nyama ya miili ya wana wenu, na nyama ya miili ya binti zenu mtaila. "},
{30, "30 Nami nitapaharibu mahali penu palipoinuka, na kuziangusha sanamu zenu za jua, nami nitaitupa mizoga yenu juu ya mizoga ya sanamu zenu; na roho yangu itawachukia. "},
{31, "31 Nami nitaifanya miji yenu iwe maganjo, na mahali penu patakatifu nitapatia ukiwa; wala sitasikia harufu ya manukato yenu yapendezayo. "},
{32, "32 Nami nitaitia hiyo nchi ukiwa; na adui zenu watakaokaa huko wataistaajabia. "},
{33, "33 Nanyi nitawatapanya-tapanya katika mataifa, nami nitaufuta upanga nyuma yenu; na nchi yenu itakuwa ni ukiwa, na miji yenu maganjo. "},
{34, "34 Hapo ndipo nchi itakapozifurahia Sabato zake, wakati itakapokuwa hali ya ukiwa, nanyi mtakapokuwa katika nchi ya adui zenu; ndipo nchi itakapopumzika, na kuzifurahia Sabato zake. "},
{35, "35 Wakati wote itakapokuwa na ukiwa, itapumzika; ni hayo mapumziko ambayo haikuwa nayo katika Sabato zenu, hapo mlipokaa katika nchi hiyo. "},
{36, "36 Tena hao wa kwenu watakaobaki, nitawatilia woga mioyoni mwao, katika hizo nchi za adui zao; na sauti ya jani lililopeperushwa itawakimbiza; nao watakimbia, kama mtu akimbiavyo upanga; nao wataanguka hapo ambapo hapana afukuzaye. "},
{37, "37 Nao wataangukiana wenyewe kwa wenyewe, kama mbele ya upanga, hapo ambapo hapana afukuzaye; wala hamtakuwa na nguvu za kusimama mbele ya adui zenu. "},
{38, "38 Nanyi mtaangamia kati ya mataifa, na nchi ya adui zenu itawameza. "},
{39, "39 Na watu wa kwenu watakaobaki watafifia kwa ajili ya uovu wao, katika hizo nchi za adui zenu; tena watafifia kwa ajili ya uovu wa baba zao, pamoja nao. "},
{40, "40 Nao wataukiri uovu wao, na uovu wa baba zao, katika maasi yao waliyoasi juu yangu, tena ya kuwa kwa sababu wameendelea kunishikia kinyume, "},
{41, "41 mimi nami nimeendelea kuwashikia kinyume wao, na kuwatia katika nchi ya adui zao; lakini hapo, kama mioyo yao isiyokuwa tohara ikinyenyekea, nao wakubali adhabu ya uovu wao; "},
{42, "42 ndipo nitakapokumbuka agano langu pamoja na Yakobo, tena agano langu na Isaka, tena agano langu na Ibrahimu nitalikumbuka; nami nitaikumbuka nchi hiyo. "},
{43, "43 Nchi nayo itaachwa na wao, nayo itazifurahia Sabato zake, itakapokuwa ukiwa pasipokuwa na wao; nao wataikubali adhabu ya uovu wao; kwa sababu, naam, ni kwa sababu wamezikataa hukumu zangu, na roho zao zimezichukia amri zangu. "},
{44, "44 Lakini pamoja na hayo yote, watakapokuwa katika nchi ya adui zao, mimi, sitawatupa, wala sitawachukia, niwaangamize kabisa, na kulivunja agano langu pamoja nao; kwa kuwa mimi ndimi Bwana, Mungu wao; "},
{45, "45 lakini kwa ajili yao nitalikumbuka agano la baba zao, niliowaleta watoke katika nchi ya Misri mbele ya macho ya mataifa, ili kwamba niwe Mungu wao; mimi ndimi Bwana. "},
{46, "46 Hizi ni amri na hukumu na sheria, Bwana alizozifanya kati ya yeye na hao wana wa Israeli katika huo mlima wa Sinai kwa mkono wa Musa. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
static void view27() {
struct sw27 poems[] = {
{1, "1 Kisha Bwana akanena na Musa, na kumwambia, "},
{2, "2 Nena na wana wa Israeli, uwaambie, Hapo mtu atakapoondoa nadhiri, hizo nafsi za watu zitakuwa kwa Bwana, kama utakavyowahesabia wewe. "},
{3, "3 Na hesabu yako itakuwa kwa mtu mume, tokea aliye na umri wa miaka ishirini hata umri wa miaka sitini, hesabu yako itakuwa shekeli hamsini za fedha, kwa shekeli ya mahali patakatifu. "},
{4, "4 Kama ni mwanamke, hesabu yako itakuwa shekeli thelathini. "},
{5, "5 Tena akiwa mwenye umri wa miaka mitano hata umri wa miaka ishirini, ndipo hesabu yako itakuwa shekeli ishirini kwa mwanamume, na shekeli kumi kwa mwanamke. "},
{6, "6 Tena akiwa mwenye umri wa mwezi mmoja hata umri wa miaka mitano, ndipo hesabu yako itakuwa shekeli tano za fedha kwa mwanamume, na hesabu yako itakuwa shekeli tatu za fedha kwa mwanamke. "},
{7, "7 Tena akiwa mwenye umri wa miaka sitini na kuzidi; kama ni mwanamume, hesabu yako itakuwa shekeli kumi na tano, na kwa mwanamke shekeli kumi. "},
{8, "8 Lakini kwamba ni maskini zaidi ya kuhesabu kwako, ndipo atawekwa mbele ya kuhani, na huyo kuhani atamtia kima; kama uwezo wake huyo aliyeweka nadhiri ulivyo, ndivyo kuhani atakavyomtia kima. "},
{9, "9 Tena kama ni mnyama wa namna ambayo watu husongeza kuwa sadaka kwa Bwana, kila mmoja katika wanyama hao atakayetolewa kwa Bwana, na mtu ye yote, atakuwa ni mtakatifu. "},
{10, "10 Yeye hatamgeuza, wala kumbadili mwema kwa mbaya, au mbaya kwa mwema; kwamba atabadili mnyama kwa mnyama ye yote, ndipo mnyama huyo na yule waliobadiliwa wote wawili watakuwa watakatifu. "},
{11, "11 Na kama ni mnyama ye yote asiye safi, wa namna ambayo hawamsongezi kwa Bwana, basi atamweka huyo mnyama mbele ya kuhani; "},
{12, "12 na kuhani atamtia kima, akiwa mwema akiwa mbaya; kama wewe kuhani utakavyomtia kima, ndivyo itakavyokuwa. "},
{13, "13 Lakini kwamba ataka kumkomboa kweli, ndipo atakapoongeza sehemu ya tano juu ya hesabu yako. "},
{14, "14 Na mtu atakapoiweka nyumba yake iwe wakfu kwa Bwana ndipo kuhani ataihesabu kima chake hiyo nyumba, ikiwa njema ikiwa mbaya; kama kuhani atakavyoihesabu kima chake ndivyo itakavyokuwa. "},
{15, "15 Tena mtu huyo aliyeweka nyumba yake iwe wakfu kama akitaka kuikomboa, ndipo atakapoongeza sehemu ya tano ya hiyo fedha ya hesabu yako, nayo itakuwa mali yake. "},
{16, "16 Tena kama mtu akiweka wakfu kwa Bwana sehemu ya shamba la milki yake, ndipo hesabu yako itakuwa kama kule kupanda kwake kulivyo; kupanda kwake homeri moja ya mbegu ya shayiri, kutahesabiwa kuwa ni shekeli hamsini za fedha. "},
{17, "17 Kwamba anaweka shamba lake liwe wakfu tangu mwaka wa yubile, litasimama vivyo kama hesabu yako ilivyo. "},
{18, "18 Lakini akiliweka shamba lake wakfu baada ya yubile, ndipo kuhani atamhesabia hiyo fedha kama hesabu ya miaka iliyobaki hata mwaka wa yubile, na kuhesabiwa kwako kutapunguzwa. "},
{19, "19 Na kama yeye aliyeliweka shamba wakfu akitaka kulikomboa kweli, ndipo atakapoongeza sehemu ya tano ya hiyo fedha ya hesabu yako, nalo litathibitishwa kwake. "},
{20, "20 Lakini asipotaka kulikomboa shamba, au kama amemwuzia mtu mwingine hilo shamba, halitakombolewa tena kabisa; "},
{21, "21 ila hilo shamba litakuwa takatifu kwa Bwana litakapotoka katika yubile, kama ni shamba lililowekwa wakfu; litakuwa mali ya kuhani. "},
{22, "22 Tena kama akiweka wakfu kwa Bwana shamba ambalo amelinunua, ambalo si shamba la milki yake; "},
{23, "23 ndipo kuhani atamhesabia kima cha kuhesabu kwako hata mwaka wa yubile: naye atatoa siku hiyo kama hesabu yako, kuwa ni kitu kitakatifu kwa Bwana. "},
{24, "24 Mwaka wa yubile shamba hilo litarejea kwake huyo ambaye lilinunuliwa kwake, yaani, huyo ambaye nchi hiyo ni milki yake. "},
{25, "25 Na hesabu zako zote zitaandamana shekeli ya mahali patakatifu; gera ishirini zitakuwa shekeli moja. "},
{26, "26 Mzaliwa wa kwanza tu katika wanyama, aliyewekwa kuwa mzaliwa wa kwanza kwa Bwana, mtu awaye yote hatamweka kuwa mtakatifu; kama ni ng'ombe, kama ni kondoo, huyo ni wa Bwana. "},
{27, "27 Na kama ni wa mnyama asiye safi, ndipo atamkomboa kama hesabu yako ilivyo, naye ataongeza sehemu ya tano ya bei yake; au asipokombolewa, ndipo atauzwa kama hesabu yako ilivyo. "},
{28, "28 Pamoja na hayo, hakitauzwa wala kukombolewa kitu cho chote kilichowekwa wakfu, ambacho mtu amekiweka wakfu kwa Bwana, katika vitu vyote alivyo navyo, kama ni mtu, au mnyama, au kama ni shamba la milki yake; kila kitu kilichowekwa wakfu ni kitakatifu sana kwa Bwana. "},
{29, "29 Kila aliyewekwa wakfu, aliyewekwa wakfu na binadamu, hatakombolewa; sharti atauawa. "},
{30, "30 Tena zaka yote ya nchi, kama ni mbegu ya nchi, au kama ni matunda ya nchi, ni ya Bwana; ni takatifu kwa Bwana. "},
{31, "31 Na kama mtu akitaka kukomboa cho chote cha zaka yake, ataongeza sehemu yake ya tano juu yake. "},
{32, "32 Tena zaka yote ya ng'ombe, au ya kondoo, kila apitaye chini ya fimbo; sehemu ya kumi watakuwa ni watakatifu kwa Bwana. "},
{33, "33 Hataangalia kwamba ni mwema au kwamba ni mbaya, wala hatambadili; na kama akimbadili na yo yote, ndipo wote wawili, huyo na huyo waliobadiliwa watakuwa ni watakatifu; hatakombolewa. "},
{34, "34 Haya ndiyo maagizo, Bwana aliyomwagiza Musa kwa ajili ya wana wa Israeli katika mlima wa Sinai. "},
};
size_t npoems = sizeof poems / sizeof poems[0];size_t i;for (i=0; i < npoems; ++i) {printf("%s\n", poems[i].msg);}
}
}; | [
"max@mkoldaev.ru"
] | max@mkoldaev.ru |
51f5d96d1e00f304a29e8a7654b09d14b1660fce | 540608045e317050fee37e27456ead7160de99c5 | /algorithms/gcd.cpp | cd9eef22a9fc4395cc67c1d5db50fd7b00c4dbf2 | [] | no_license | yingkailiang/algorithms | 8122a18643b11179e8a225741df63f5092dc7521 | f9f99e63da8ba0160dc823ef3c21e172c94b3681 | refs/heads/master | 2020-03-25T15:53:03.494958 | 2014-01-04T20:59:28 | 2014-01-04T20:59:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | cpp | #include <iostream>
using namespace std;
//method to compute the great common digit of a and b like gcd(a,b)=d
int gcd(int a,int b)
{
if (b==0)
return a ;
else
return gcd(b ,a %b);
} //end func gcd
int main()
{
int a ;
int b ;
cout<<"input a,b :"<<endl;
cin>>a>>b;
cout<<"the great common digit of "<<a <<" and "<<b<<" is "<<gcd(a,b)<<endl;
return 1;
} //end func main
| [
"kailiangying@syr-138-032.syr.edu"
] | kailiangying@syr-138-032.syr.edu |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.