text stringlengths 4 6.14k |
|---|
/**
* @file
* @ingroup crConfigDemoSlave2
*
* Default implementation of the Application Shutdown Procedure of <code>CrFwAppShutdownProc.h</code>.
* The implementation of this procedure is one of the adaptation points of the
* CORDET Framework.
* This file provides a default implementation which is primarily intended to
* support testing.
* It is expected that applications will provide their own implementation.
* Application will therefore normally replace this file with their own file
* providing their application-specific implementation of the Application Shutdown Procedure.
*
* This implementation defines a dummy procedure as in the figure below.
* @image html DummyApp.png
* @author Vaclav Cechticky <vaclav.cechticky@pnp-software.com>
* @author Alessandro Pasetti <pasetti@pnp-software.com>
* @copyright P&P Software GmbH, 2013, All Rights Reserved
*
* This file is part of the CORDET Framework.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* For information on alternative licensing, please contact P&P Software GmbH.
*/
#include <stdlib.h>
/* Include FW Profile Files */
#include "FwPrDCreate.h"
#include "FwPrConfig.h"
#include "FwPrCore.h"
#include "FwPrConstants.h"
/* Include Framework Files */
#include "CrFwConstants.h"
#include "AppStartUp/CrFwAppResetProc.h"
#include "UtilityFunctions/CrFwUtilityFunctions.h"
/** The singleton instance of the Application Shutdown Procedure */
FwPrDesc_t shutdownPrDesc;
/*-----------------------------------------------------------------------------------------*/
FwPrDesc_t CrFwAppSmGetAppShutdownProc() {
const FwPrCounterS1_t nOfANodes = 1; /* Number of action nodes */
const FwPrCounterS1_t nOfDNodes = 0; /* Number of decision nodes */
const FwPrCounterS1_t nOfFlows = 2; /* Number of control flows */
const FwPrCounterS1_t nOfActions = 1; /* Number of actions */
const FwPrCounterS1_t nOfGuards = 1; /* Number of guards */
const FwPrCounterS1_t N1 = 1; /* Identifier of first action node */
if (shutdownPrDesc != NULL)
return shutdownPrDesc;
/* Create the initialization procedure */
shutdownPrDesc = FwPrCreate(nOfANodes, nOfDNodes, nOfFlows, nOfActions, nOfGuards);
/* Configure the initialization procedure */
FwPrAddActionNode(shutdownPrDesc, N1, &CrFwPrEmptyAction);
FwPrAddFlowIniToAct(shutdownPrDesc, N1, NULL);
FwPrAddFlowActToFin(shutdownPrDesc, N1, &CrFwWaitOnePrCycle);
return shutdownPrDesc;
}
|
/*
** This file is part of libyuni, a cross-platform C++ framework (http://libyuni.org).
**
** This Source Code Form is subject to the terms of the Mozilla Public License
** v.2.0. If a copy of the MPL was not distributed with this file, You can
** obtain one at http://mozilla.org/MPL/2.0/.
**
** gitlab: https://gitlab.com/libyuni/libyuni/
** github: https://github.com/libyuni/libyuni/ {mirror}
*/
#pragma once
#include "../yuni.h"
namespace Yuni
{
namespace VM
{
//! Instruction
typedef uint8 InstructionType;
//! Operand
typedef uint8 RegisterType;
} // namespace VM
} // namespace Yuni
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/*
* This file is part of the libetonyek project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#ifndef PAG1PARSERSTATE_H_INCLUDED
#define PAG1PARSERSTATE_H_INCLUDED
#include "IWORKXMLParserState.h"
#include "PAGTypes.h"
namespace libetonyek
{
class PAG1Parser;
class PAGCollector;
struct PAG1Dictionary;
class PAG1ParserState : public IWORKXMLParserState
{
// not copyable
PAG1ParserState(const PAG1ParserState &);
PAG1ParserState &operator=(const PAG1ParserState &);
public:
PAG1ParserState(PAG1Parser &parser, PAGCollector &collector, PAG1Dictionary &dict);
PAGCollector &getCollector();
PAG1Dictionary &getDictionary();
public:
PAGFootnoteState m_footnoteState;
private:
PAGCollector &m_collector;
PAG1Dictionary &m_dict;
};
}
#endif // PAG1PARSERSTATE_H_INCLUDED
/* vim:set shiftwidth=2 softtabstop=2 expandtab: */
|
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef H_SLIB_UTIL_EXPR_RESOLVER_H
#define H_SLIB_UTIL_EXPR_RESOLVER_H
#include "slib/lang/Object.h"
#include "slib/lang/String.h"
#include "slib/collections/Map.h"
namespace slib {
namespace expr {
class Resolver : virtual public Object {
public:
virtual ~Resolver() override;
static constexpr Class _class = RESOLVERCLASS;
virtual Class const& getClass() const override {
return RESOLVERCLASS;
}
/**
* Resolves a variable
*
* @param key variable name
* @return variable value or nullptr if not defined
*/
virtual SPtr<Object> getVar(String const& key) const = 0;
};
class MapResolver : public Resolver {
private:
SPtr<Map<String, Object>> _map;
public:
MapResolver(SPtr<Map<String, Object>> map)
:_map(map) {}
virtual ~MapResolver() override;
virtual SPtr<Object> getVar(const String &key) const override {
return _map->get(key);
}
};
} // namespace expr
} // namespace slib
#endif // H_SLIB_UTIL_EXPR_RESOLVER_H
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/** @brief Hindsight input implementation @file */
#include "hs_input.h"
#include <errno.h>
#include <luasandbox/util/heka_message.h>
#include <luasandbox/lauxlib.h>
#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include "hs_logger.h"
#include "hs_util.h"
static const char g_module[] = "input_reader";
bool hs_open_file(hs_input *hsi, const char *subdir, unsigned long long id)
{
char fqfn[HS_MAX_PATH];
int ret = snprintf(fqfn, sizeof(fqfn), "%s/%s/%llu.log", hsi->path, subdir,
id);
if (ret < 0 || ret > (int)sizeof(fqfn) - 1) {
hs_log(NULL, g_module, 0, "%s file: %llu.log: fully qualiifed path is"
" greater than %zu", hsi->name, hsi->cp.id, sizeof(fqfn));
exit(EXIT_FAILURE);
}
if (hsi->fn && strcmp(hsi->fn, fqfn) == 0) return true;
FILE *fh = fopen(fqfn, "re");
if (fh) {
if (setvbuf(fh, NULL, _IONBF, 0)) {
exit(EXIT_FAILURE);
}
if (hsi->cp.id == id && hsi->cp.offset) {
hs_log(NULL, g_module, 7, "%s opened file: %s offset: %zu", hsi->name,
fqfn,
hsi->cp.offset);
if (fseek(fh, hsi->cp.offset, SEEK_SET)) {
hs_log(NULL, g_module, 2, "%s file: %s invalid offset: %zu error: %d",
hsi->name,
fqfn,
hsi->cp.offset,
ferror(fh));
}
} else {
hs_log(NULL, g_module, 7, "%s opened file: %s", hsi->name, fqfn);
}
if (hsi->fh) {
fclose(hsi->fh);
}
if (hsi->cp.id != id) {
hsi->cp.id = id;
hsi->cp.offset = 0;
}
if (ret >= (int)hsi->fn_size) {
free(hsi->fn);
hsi->fn_size = (size_t)(ret + 1);
hsi->fn = malloc(hsi->fn_size);
if (!hsi->fn) {
hs_log(NULL, g_module, 2, "%s file: %s malloc failed", hsi->name,
fqfn);
exit(EXIT_FAILURE);
}
}
strcpy(hsi->fn, fqfn);
hsi->fh = fh;
return true;
}
return false;
}
size_t hs_read_file(hs_input *hsi)
{
lsb_input_buffer *ib = &hsi->ib;
size_t need;
if (ib->msglen) {
need = ib->msglen + (size_t)ib->buf[ib->scanpos + 1] + LSB_HDR_FRAME_SIZE
- (ib->readpos - ib->scanpos);
} else {
need = ib->scanpos + ib->size - ib->readpos;
}
if (lsb_expand_input_buffer(ib, need)) {
hs_log(NULL, g_module, 0, "%s buffer reallocation failed", hsi->name);
exit(EXIT_FAILURE);
}
size_t nread = fread(ib->buf + ib->readpos,
1,
ib->size - ib->readpos,
hsi->fh);
hsi->cp.offset += nread;
ib->readpos += nread;
return nread;
}
void hs_init_input(hs_input *hsi, size_t max_message_size, const char *path,
const char *name)
{
hsi->fh = NULL;
hsi->fn = NULL;
hsi->fn_size = 0;
hsi->cp.id = 0;
hsi->cp.offset = 0;
if (strlen(path) > HS_MAX_PATH - 30) {
hs_log(NULL, g_module, 0, "path too long");
exit(EXIT_FAILURE);
}
hsi->path = malloc(strlen(path) + 1);
if (!hsi->path) {
hs_log(NULL, g_module, 0, "path malloc failed");
exit(EXIT_FAILURE);
}
strcpy(hsi->path, path);
hsi->name = malloc(strlen(name) + 1);
if (!hsi->name) {
hs_log(NULL, g_module, 0, "name malloc failed");
exit(EXIT_FAILURE);
}
strcpy(hsi->name, name);
lsb_init_input_buffer(&hsi->ib, max_message_size);
}
void hs_free_input(hs_input *hsi)
{
if (hsi->fh) fclose(hsi->fh);
hsi->fh = NULL;
free(hsi->path);
hsi->path = NULL;
free(hsi->name);
hsi->name = NULL;
free(hsi->fn);
hsi->fn = NULL;
lsb_free_input_buffer(&hsi->ib);
}
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef mozilla_dom_idbcursor_h__
#define mozilla_dom_idbcursor_h__
#include "IndexedDatabase.h"
#include "js/RootingAPI.h"
#include "mozilla/Attributes.h"
#include "mozilla/dom/IDBCursorBinding.h"
#include "mozilla/dom/indexedDB/Key.h"
#include "nsCycleCollectionParticipant.h"
#include "nsWrapperCache.h"
class nsPIDOMWindowInner;
namespace mozilla {
class ErrorResult;
namespace dom {
class IDBIndex;
class IDBObjectStore;
class IDBRequest;
class IDBTransaction;
class OwningIDBObjectStoreOrIDBIndex;
namespace indexedDB {
class BackgroundCursorChild;
}
class IDBCursor final
: public nsISupports
, public nsWrapperCache
{
public:
typedef indexedDB::Key Key;
typedef indexedDB::StructuredCloneReadInfo StructuredCloneReadInfo;
enum Direction
{
NEXT = 0,
NEXT_UNIQUE,
PREV,
PREV_UNIQUE,
// Only needed for IPC serialization helper, should never be used in code.
DIRECTION_INVALID
};
private:
enum Type
{
Type_ObjectStore,
Type_ObjectStoreKey,
Type_Index,
Type_IndexKey,
};
indexedDB::BackgroundCursorChild* mBackgroundActor;
RefPtr<IDBRequest> mRequest;
RefPtr<IDBObjectStore> mSourceObjectStore;
RefPtr<IDBIndex> mSourceIndex;
// mSourceObjectStore or mSourceIndex will hold this alive.
IDBTransaction* mTransaction;
JS::Heap<JSObject*> mScriptOwner;
// These are cycle-collected!
JS::Heap<JS::Value> mCachedKey;
JS::Heap<JS::Value> mCachedPrimaryKey;
JS::Heap<JS::Value> mCachedValue;
Key mKey;
Key mSortKey;
Key mPrimaryKey;
StructuredCloneReadInfo mCloneInfo;
const Type mType;
const Direction mDirection;
bool mHaveCachedKey : 1;
bool mHaveCachedPrimaryKey : 1;
bool mHaveCachedValue : 1;
bool mRooted : 1;
bool mContinueCalled : 1;
bool mHaveValue : 1;
public:
static already_AddRefed<IDBCursor>
Create(indexedDB::BackgroundCursorChild* aBackgroundActor,
const Key& aKey,
StructuredCloneReadInfo&& aCloneInfo);
static already_AddRefed<IDBCursor>
Create(indexedDB::BackgroundCursorChild* aBackgroundActor,
const Key& aKey);
static already_AddRefed<IDBCursor>
Create(indexedDB::BackgroundCursorChild* aBackgroundActor,
const Key& aKey,
const Key& aSortKey,
const Key& aPrimaryKey,
StructuredCloneReadInfo&& aCloneInfo);
static already_AddRefed<IDBCursor>
Create(indexedDB::BackgroundCursorChild* aBackgroundActor,
const Key& aKey,
const Key& aSortKey,
const Key& aPrimaryKey);
static Direction
ConvertDirection(IDBCursorDirection aDirection);
void
AssertIsOnOwningThread() const
#ifdef DEBUG
;
#else
{ }
#endif
nsPIDOMWindowInner*
GetParentObject() const;
void
GetSource(OwningIDBObjectStoreOrIDBIndex& aSource) const;
IDBCursorDirection
GetDirection() const;
void
GetKey(JSContext* aCx,
JS::MutableHandle<JS::Value> aResult,
ErrorResult& aRv);
void
GetPrimaryKey(JSContext* aCx,
JS::MutableHandle<JS::Value> aResult,
ErrorResult& aRv);
void
GetValue(JSContext* aCx,
JS::MutableHandle<JS::Value> aResult,
ErrorResult& aRv);
void
Continue(JSContext* aCx, JS::Handle<JS::Value> aKey, ErrorResult& aRv);
void
ContinuePrimaryKey(JSContext* aCx,
JS::Handle<JS::Value> aKey,
JS::Handle<JS::Value> aPrimaryKey,
ErrorResult& aRv);
void
Advance(uint32_t aCount, ErrorResult& aRv);
already_AddRefed<IDBRequest>
Update(JSContext* aCx, JS::Handle<JS::Value> aValue, ErrorResult& aRv);
already_AddRefed<IDBRequest>
Delete(JSContext* aCx, ErrorResult& aRv);
void
Reset();
void
Reset(Key&& aKey, StructuredCloneReadInfo&& aValue);
void
Reset(Key&& aKey);
void
Reset(Key&& aKey, Key&& aSortKey, Key&& aPrimaryKey, StructuredCloneReadInfo&& aValue);
void
Reset(Key&& aKey, Key&& aSortKey, Key&& aPrimaryKey);
void
ClearBackgroundActor()
{
AssertIsOnOwningThread();
mBackgroundActor = nullptr;
}
NS_DECL_CYCLE_COLLECTING_ISUPPORTS
NS_DECL_CYCLE_COLLECTION_SCRIPT_HOLDER_CLASS(IDBCursor)
// nsWrapperCache
virtual JSObject*
WrapObject(JSContext* aCx, JS::Handle<JSObject*> aGivenProto) override;
private:
IDBCursor(Type aType,
indexedDB::BackgroundCursorChild* aBackgroundActor,
const Key& aKey);
~IDBCursor();
#ifdef ENABLE_INTL_API
// Checks if this is a locale aware cursor (ie. the index's sortKey is unset)
bool
IsLocaleAware() const;
#endif
void
DropJSObjects();
bool
IsSourceDeleted() const;
};
} // namespace dom
} // namespace mozilla
#endif // mozilla_dom_idbcursor_h__
|
/**
* @file clock.h
*
* Clock interfaces to be implemented by a Legato framework adaptor.
*
* Copyright (C) Sierra Wireless Inc.
*/
#ifndef FA_CLK_H_INCLUDE_GUARD
#define FA_CLK_H_INCLUDE_GUARD
#include "legato.h"
//--------------------------------------------------------------------------------------------------
/**
* Sets the timezone file
*
* @return
* - LE_OK if the time is correctly set
* - LE_FAULT if an error occurred
*/
//--------------------------------------------------------------------------------------------------
le_result_t fa_clk_SetTimezoneFile
(
const int32_t timezoneOffsetSeconds, ///< [IN] Timezone offset in seconds
const uint8_t dstOffsetHours ///< [IN] Daylight savings adjustment in hours
);
#endif /* FA_CLK_H_INCLUDE_GUARD */
|
/* * This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#pragma once
#include <string>
#include <memory>
namespace influxdb {
namespace api {
class line;
class simple_db {
struct impl;
std::unique_ptr<impl> pimpl;
public:
simple_db(std::string const& url, std::string const& name);
~simple_db();
public:
void create();
void drop();
void insert(line const& lines);
void with_authentication(std::string const& username, std::string const& password);
};
}
}
|
#ifndef VIM_PANELS_H
#define VIM_PANELS_H
#include <nspireio2.h>
#include <stdbool.h>
#include "vim_lines.h"
#define X_FIELDS \
X(nio_console, left, 10, 32, 0, 0, WHITE, BLACK) \
X(nio_console, center, 54, 32, 12, 0, BLACK, WHITE) \
X(nio_console, bottom, 54, 2, 0, 231, 7, BLACK)
extern char* active_mode;
extern nio_console* active_panel;
typedef struct {
#define X(type, panel, cols, rows, offx, offy, fg, bg) type panel;
/*
There are three separate panels:
left_panel: line numbers, error markers
bottom_panel: commands
center_panel: main text body
*/
X_FIELDS
#undef X
} Panels;
void vim_Init(Panels*, Lines*);
void vim_CleanUpPanels(Panels*);
void vim_DrawPanels(Panels*);
void vim_InitPanels(Panels*);
bool vim_ExecCommand(Panels*, Lines*);
void vim_ChangeMode(char*, Panels*);
char* vim_GetMode();
char* vim_BuildPath(char*);
void vim_SaveFile(char*, nio_console*);
void vim_LoadFile(char*, Panels*, Lines*);
nio_console* vim_GetActivePanel();
#endif |
/*
* Copyright (C) 1998, 2000-2007, 2010, 2011, 2012, 2013 SINTEF Digital,
* Applied Mathematics, Norway.
*
* Contact information: E-mail: tor.dokken@sintef.no
* SINTEF Digital, Department of Mathematics and Cybernetics,
* P.O. Box 124 Blindern,
* 0314 Oslo, Norway.
*
* This file is part of SISL.
*
* SISL is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* SISL 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public
* License along with SISL. If not, see
* <http://www.gnu.org/licenses/>.
*
* In accordance with Section 7(b) of the GNU Affero General Public
* License, a covered work must retain the producer line in every data
* file that is created or manipulated using SISL.
*
* Other Usage
* You can be released from the requirements of the license by purchasing
* a commercial license. Buying such a license is mandatory as soon as you
* develop commercial activities involving the SISL library without
* disclosing the source code of your own applications.
*
* This file may be used in accordance with the terms contained in a
* written agreement between you and SINTEF Digital.
*/
#include "sisl-copyright.h"
/*
*
* $Id: s6scpr.c,v 1.2 2001-03-19 15:59:02 afr Exp $
*
*/
#define S6SCPR
#include "sislP.h"
#if defined(SISLNEEDPROTOTYPES)
double
s6scpr(double e1[],double e2[],int idim)
#else
double s6scpr(e1,e2,idim)
double e1[];
double e2[];
int idim;
#endif
/*
*********************************************************************
*
* PURPOSE : To make the scalar product of two vectors
*
* INPUT : e1 - The first vector in the scalar product
* e2 - The second vector in the scalar product
* idim - Number of dimensions in the space the vectors lie
*
* OUTPUT : s6scpr - The value of the scalar product
*
* METHOD : The scalar product is calculated according to the definition
*-
* CALLS :
*
* WRITTEN BY : Tor Dokken, SI, Oslo, Norway. 1988-may-03
*
*********************************************************************
*/
{
register int ki;
register double tsum=DZERO;
for (ki=0;ki<idim;ki++)
tsum += e1[ki]*e2[ki];
return(tsum);
}
|
// OCC_BaseDoc.h: interface for the OCC_BaseDoc class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_OCC_BASEDOC_H__2E048CC8_38F9_11D7_8611_0060B0EE281E__INCLUDED_)
#define AFX_OCC_BASEDOC_H__2E048CC8_38F9_11D7_8611_0060B0EE281E__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include <stdafx.h>
class OCC_BaseDoc : public CDocument
{
public:
OCC_BaseDoc();
virtual ~OCC_BaseDoc();
};
#endif // !defined(AFX_OCC_BASEDOC_H__2E048CC8_38F9_11D7_8611_0060B0EE281E__INCLUDED_)
|
/**
******************************************************************************
* @file PWR/PWR_STOP/Src/stm32f4xx_it.c
* @author MCD Application Team
* @version V1.2.5
* @date 29-January-2016
* @brief Main Interrupt Service Routines.
* This file provides template for all exceptions handler and
* peripherals interrupt service routine.
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT(c) 2016 STMicroelectronics</center></h2>
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of STMicroelectronics nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************
*/
/* Includes ------------------------------------------------------------------*/
#include "main.h"
#include "stm32f4xx_it.h"
/** @addtogroup STM32F4xx_HAL_Examples
* @{
*/
/** @addtogroup PWR_STOP
* @{
*/
/* Private typedef -----------------------------------------------------------*/
/* Private define ------------------------------------------------------------*/
/* Private macro -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* RTC handler declared in "main.c" file */
extern RTC_HandleTypeDef RTCHandle;
/* Private function prototypes -----------------------------------------------*/
/* Private functions ---------------------------------------------------------*/
/******************************************************************************/
/* Cortex-M4 Processor Exceptions Handlers */
/******************************************************************************/
/**
* @brief This function handles NMI exception.
* @param None
* @retval None
*/
void NMI_Handler(void)
{
}
/**
* @brief This function handles Hard Fault exception.
* @param None
* @retval None
*/
void HardFault_Handler(void)
{
/* Go to infinite loop when Hard Fault exception occurs */
while (1)
{
}
}
/**
* @brief This function handles Memory Manage exception.
* @param None
* @retval None
*/
void MemManage_Handler(void)
{
/* Go to infinite loop when Memory Manage exception occurs */
while (1)
{
}
}
/**
* @brief This function handles Bus Fault exception.
* @param None
* @retval None
*/
void BusFault_Handler(void)
{
/* Go to infinite loop when Bus Fault exception occurs */
while (1)
{
}
}
/**
* @brief This function handles Usage Fault exception.
* @param None
* @retval None
*/
void UsageFault_Handler(void)
{
/* Go to infinite loop when Usage Fault exception occurs */
while (1)
{
}
}
/**
* @brief This function handles SVCall exception.
* @param None
* @retval None
*/
void SVC_Handler(void)
{
}
/**
* @brief This function handles Debug Monitor exception.
* @param None
* @retval None
*/
void DebugMon_Handler(void)
{
}
/**
* @brief This function handles PendSVC exception.
* @param None
* @retval None
*/
void PendSV_Handler(void)
{
}
/**
* @brief This function handles SysTick Handler.
* @param None
* @retval None
*/
void SysTick_Handler(void)
{
HAL_SYSTICK_IRQHandler();
}
/******************************************************************************/
/* STM32F4xx Peripherals Interrupt Handlers */
/* Add here the Interrupt Handler for the used peripheral(s) (PPP), for the */
/* available peripheral interrupt handler's name please refer to the startup */
/* file (startup_stm32f4xx.s). */
/******************************************************************************/
/**
* @brief This function handles RTC Auto wake-up interrupt request.
* @param None
* @retval None
*/
void RTC_WKUP_IRQHandler(void)
{
HAL_RTCEx_WakeUpTimerIRQHandler(&RTCHandle);
}
/**
* @brief This function handles External lines 15 to 10 interrupt request.
* @param None
* @retval None
*/
void EXTI15_10_IRQHandler(void)
{
HAL_GPIO_EXTI_IRQHandler(KEY_BUTTON_PIN);
}
/**
* @brief This function handles PPP interrupt request.
* @param None
* @retval None
*/
/*void PPP_IRQHandler(void)
{
}*/
/**
* @}
*/
/**
* @}
*/
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
|
/*
* Copyright (C) 2016-2019 Fanout, Inc.
*
* This file is part of Pushpin.
*
* $FANOUT_BEGIN_LICENSE:AGPL$
*
* Pushpin is free software: you can redistribute it and/or modify it under
* the terms of the GNU Affero General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option)
* any later version.
*
* Pushpin 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 Affero General Public License for
* more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Alternatively, Pushpin may be used under the terms of a commercial license,
* where the commercial license agreement is provided with the software or
* contained in a written agreement between you and Fanout. For further
* information use the contact form at <https://fanout.io/enterprise/>.
*
* $FANOUT_END_LICENSE$
*/
#ifndef FILTER_H
#define FILTER_H
#include <QString>
#include <QStringList>
#include <QHash>
class Filter
{
public:
enum SendAction
{
Send,
Drop
};
enum Targets
{
MessageDelivery = 0x01,
MessageContent = 0x02,
ProxyContent = 0x04,
};
class Context
{
public:
QHash<QString, QString> prevIds;
QHash<QString, QString> subscriptionMeta;
QHash<QString, QString> publishMeta;
};
Filter(const QString &name = QString());
virtual ~Filter();
const QString & name() const { return name_; }
const Context & context() const { return context_; }
QString errorMessage() const { return errorMessage_; }
void setContext(const Context &context) { context_ = context; }
virtual SendAction sendAction() const;
// return null array on error
virtual QByteArray update(const QByteArray &data);
virtual QByteArray finalize();
QByteArray process(const QByteArray &data);
static Filter *create(const QString &name);
static QStringList names();
static Targets targets(const QString &name);
protected:
void setError(const QString &s) { errorMessage_ = s; }
private:
QString name_;
Context context_;
QString errorMessage_;
};
#endif
|
/*
* Generated by util/mkerr.pl DO NOT EDIT
* Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the OpenSSL license (the "License"). You may not use
* this file except in compliance with the License. You can obtain a copy
* in the file LICENSE in the source distribution or at
* https://www.openssl.org/source/license.html
*/
#include "internal/cryptlib.h"
#pragma hdrstop
#include <openssl/err.h>
#include <openssl/dsaerr.h>
#ifndef OPENSSL_NO_ERR
static const ERR_STRING_DATA DSA_str_functs[] = {
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSAPARAMS_PRINT, 0), "DSAparams_print"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSAPARAMS_PRINT_FP, 0), "DSAparams_print_fp"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_BUILTIN_PARAMGEN, 0),
"dsa_builtin_paramgen"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_BUILTIN_PARAMGEN2, 0),
"dsa_builtin_paramgen2"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_DO_SIGN, 0), "DSA_do_sign"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_DO_VERIFY, 0), "DSA_do_verify"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_METH_DUP, 0), "DSA_meth_dup"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_METH_NEW, 0), "DSA_meth_new"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_METH_SET1_NAME, 0), "DSA_meth_set1_name"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_NEW_METHOD, 0), "DSA_new_method"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_PARAM_DECODE, 0), "dsa_param_decode"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_PRINT_FP, 0), "DSA_print_fp"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_PRIV_DECODE, 0), "dsa_priv_decode"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_PRIV_ENCODE, 0), "dsa_priv_encode"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_PUB_DECODE, 0), "dsa_pub_decode"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_PUB_ENCODE, 0), "dsa_pub_encode"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_SIGN, 0), "DSA_sign"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_SIGN_SETUP, 0), "DSA_sign_setup"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_DSA_SIG_NEW, 0), "DSA_SIG_new"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_OLD_DSA_PRIV_DECODE, 0),
"old_dsa_priv_decode"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_PKEY_DSA_CTRL, 0), "pkey_dsa_ctrl"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_PKEY_DSA_CTRL_STR, 0), "pkey_dsa_ctrl_str"},
{ERR_PACK(ERR_LIB_DSA, DSA_F_PKEY_DSA_KEYGEN, 0), "pkey_dsa_keygen"},
{0, NULL}
};
static const ERR_STRING_DATA DSA_str_reasons[] = {
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_BAD_Q_VALUE), "bad q value"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_BN_DECODE_ERROR), "bn decode error"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_BN_ERROR), "bn error"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_DECODE_ERROR), "decode error"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_INVALID_DIGEST_TYPE),
"invalid digest type"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_INVALID_PARAMETERS), "invalid parameters"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_MISSING_PARAMETERS), "missing parameters"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_MISSING_PRIVATE_KEY),
"missing private key"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_MODULUS_TOO_LARGE), "modulus too large"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_NO_PARAMETERS_SET), "no parameters set"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_PARAMETER_ENCODING_ERROR),
"parameter encoding error"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_Q_NOT_PRIME), "q not prime"},
{ERR_PACK(ERR_LIB_DSA, 0, DSA_R_SEED_LEN_SMALL),
"seed_len is less than the length of q"},
{0, NULL}
};
#endif
int ERR_load_DSA_strings(void)
{
#ifndef OPENSSL_NO_ERR
if(ERR_func_error_string(DSA_str_functs[0].error) == NULL) {
ERR_load_strings_const(DSA_str_functs);
ERR_load_strings_const(DSA_str_reasons);
}
#endif
return 1;
}
|
/**
* Zillians MMO
* Copyright (C) 2007-2010 Zillians.com, Inc.
* For more information see http://www.zillians.com
*
* Zillians MMO is the library and runtime for massive multiplayer online game
* development in utility computing model, which runs as a service for every
* developer to build their virtual world running on our GPU-assisted machines.
*
* This is a close source library intended to be used solely within Zillians.com
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
* AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/**
* @date Aug 10, 2011 sdk - Initial version created.
*/
#ifndef ZILLIANS_LANGUAGE_TREE_IMPORT_H_
#define ZILLIANS_LANGUAGE_TREE_IMPORT_H_
#include "language/tree/ASTNode.h"
#include "language/tree/basic/Identifier.h"
namespace zillians { namespace language { namespace tree {
/**
* Package is used to represent the hierarchical structure of a program.
* Every ASTNode, except Package and Program, must be contained by a Package.
*/
struct Import : public ASTNode
{
friend class boost::serialization::access;
DEFINE_VISITABLE();
DEFINE_HIERARCHY(Import, (Import)(ASTNode));
explicit Import(Identifier* ns) : alias(NULL), ns(ns)
{
BOOST_ASSERT(ns && "null identifier for import node is not allowed");
ns->parent = this;
}
explicit Import(Identifier* alias, Identifier* ns) : alias(alias), ns(ns)
{
BOOST_ASSERT(alias && "null identifier for import node is not allowed");
BOOST_ASSERT(ns && "null identifier for import node is not allowed");
alias->parent = this;
ns->parent = this;
}
virtual bool isEqualImpl(const ASTNode& rhs, ASTNodeSet& visited) const
{
BEGIN_COMPARE()
COMPARE_MEMBER(alias);
COMPARE_MEMBER(ns);
END_COMPARE()
}
virtual bool replaceUseWith(const ASTNode& from, const ASTNode& to, bool update_parent = true)
{
BEGIN_REPLACE()
REPLACE_USE_WITH(alias)
REPLACE_USE_WITH(ns)
END_REPLACE()
}
virtual ASTNode* clone() const
{
if(alias)
return new Import(cast<Identifier>(alias->clone()), cast<Identifier>(ns->clone()));
else
return new Import(cast<Identifier>(ns->clone()));
}
template<typename Archive>
void serialize(Archive& ar, const unsigned int version)
{
UNUSED_ARGUMENT(version);
ar & boost::serialization::base_object<ASTNode>(*this);
ar & alias;
ar & ns;
}
Identifier* alias;
Identifier* ns;
protected:
Import() { }
};
} } }
#endif /* ZILLIANS_LANGUAGE_TREE_IMPORT_H_ */
|
/************************************************************************
This file is part of Freekick.
Freekick is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Freekick 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with Freekick. If not, see <http://www.gnu.org/licenses/>.
Copyright Antti Salonen, 2008
**************************************************************************/
#ifndef FREEKICK_MATCH_MESSAGES_PLAYERCONTROLREQUESTMESSAGE_H
#define FREEKICK_MATCH_MESSAGES_PLAYERCONTROLREQUESTMESSAGE_H
#include <boost/regex.hpp>
#include "ListParameterMessage.h"
namespace freekick
{
namespace match
{
namespace messages
{
class PlayerControlRequestMessage : public ListParameterMessage
{
public:
PlayerControlRequestMessage(PlayerID plid)
: ListParameterMessage(plid)
{
}
PlayerControlRequestMessage(const std::set<PlayerID>& plids)
: ListParameterMessage(plids)
{
}
PlayerControlRequestMessage(std::string& msg)
: ListParameterMessage(msg, c_pl_cont_req)
{
}
virtual ~PlayerControlRequestMessage() { }
const std::string toString() const
{
return listParamString(c_pl_cont_req);
}
};
}
}
}
#endif
|
/*
* ion/ioncore/mplexpholder.h
*
* Copyright (c) Tuomo Valkonen 2005-2009.
*
* See the included file LICENSE for details.
*/
#ifndef ION_IONCORE_MPLEXPHOLDER_H
#define ION_IONCORE_MPLEXPHOLDER_H
#include "common.h"
#include "pholder.h"
#include "mplex.h"
#include "attach.h"
#include "framedpholder.h"
DECLCLASS(WMPlexPHolder){
WPHolder ph;
WMPlex *mplex;
WFramedPHolder *recreate_pholder; /* only on first of list */
WLListNode *after;
WMPlexPHolder *next, *prev;
WMPlexAttachParams param;
};
/* If 'either_st' is set, it is used, otherwise 'or_param', is used.
*/
extern WMPlexPHolder *create_mplexpholder(WMPlex *mplex,
WStacking *either_st,
WMPlexAttachParams *or_param);
extern bool mplexpholder_init(WMPlexPHolder *ph,
WMPlex *mplex,
WStacking *either_st,
WMPlexAttachParams *or_param);
extern void mplexpholder_deinit(WMPlexPHolder *ph);
extern WRegion *mplexpholder_do_attach(WMPlexPHolder *ph, int flags,
WRegionAttachData *data);
extern bool mplexpholder_do_goto(WMPlexPHolder *ph);
extern bool mplexpholder_stale(WMPlexPHolder *ph);
extern WRegion *mplexpholder_do_target(WMPlexPHolder *ph);
extern bool mplexpholder_move(WMPlexPHolder *ph, WMPlex *mplex,
WMPlexPHolder *after,
WLListNode *or_after);
extern void mplexpholder_do_unlink(WMPlexPHolder *ph, WMPlex *mplex);
extern void mplex_move_phs(WMPlex *mplex, WLListNode *node,
WMPlexPHolder *after,
WLListNode *or_after);
extern void mplex_move_phs_before(WMPlex *mplex, WLListNode *node);
extern void mplex_migrate_phs(WMPlex *src, WMPlex *dst);
extern void mplex_flatten_phs(WMPlex *mplex);
extern WMPlexPHolder *mplex_managed_get_pholder(WMPlex *mplex,
WRegion *mgd);
extern WPHolder *mplex_get_rescue_pholder_for(WMPlex *mplex,
WRegion *mgd);
#endif /* ION_IONCORE_MPLEXPHOLDER_H */
|
/*
* This file is part of clr-boot-manager.
*
* Copyright © 2016-2017 Intel Corporation
*
* clr-boot-manager is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1
* of the License, or (at your option) any later version.
*/
#pragma once
#include "bootman.h"
#if UINTPTR_MAX == 0xffffffffffffffff
#define DEFAULT_EFI_BLOB "BOOTX64.EFI"
#else
#define DEFAULT_EFI_BLOB "BOOTIA32.EFI"
#endif
typedef bool (*boot_loader_init)(const BootManager *);
typedef bool (*boot_loader_install_kernel)(const BootManager *, const Kernel *);
typedef const char *(*boot_loader_get_kernel_destination)(const BootManager *);
typedef bool (*boot_loader_remove_kernel)(const BootManager *, const Kernel *);
typedef bool (*boot_loader_set_default_kernel)(const BootManager *, const Kernel *kernel);
typedef bool (*boot_loader_needs_update)(const BootManager *);
typedef bool (*boot_loader_needs_install)(const BootManager *);
typedef bool (*boot_loader_install)(const BootManager *);
typedef bool (*boot_loader_update)(const BootManager *);
typedef bool (*boot_loader_remove)(const BootManager *);
typedef void (*boot_loader_destroy)(const BootManager *);
typedef int (*boot_loader_caps)(const BootManager *);
typedef enum {
BOOTLOADER_CAP_MIN = 1 << 0,
BOOTLOADER_CAP_UEFI = 1 << 1, /**<Bootloader supports UEFI */
BOOTLOADER_CAP_GPT = 1 << 2, /**<Bootloader supports GPT boot partition */
BOOTLOADER_CAP_LEGACY = 1 << 3, /**<Bootloader supports legacy boot */
BOOTLOADER_CAP_MAX = 1 << 4
} BootLoaderCapability;
/**
* Virtual BootLoader provider
*/
typedef struct BootLoader {
const char *name; /**<Name of the implementation */
boot_loader_init init; /**<Init function */
boot_loader_get_kernel_destination
get_kernel_destination; /**<Get location where bootloader expects the kernels to reside */
boot_loader_install_kernel install_kernel; /**<Install a given kernel */
boot_loader_remove_kernel remove_kernel; /**<Remove a given kernel */
boot_loader_set_default_kernel set_default_kernel; /**<Set the default kernel */
boot_loader_needs_update needs_update; /**<Check if an update is required */
boot_loader_needs_install needs_install; /**<Check if an install is required */
boot_loader_install install; /**<Install this bootloader */
boot_loader_update update; /**<Update this bootloader */
boot_loader_remove remove; /**<Remove this bootloader from the disk */
boot_loader_destroy destroy; /**<Perform necessary cleanups */
boot_loader_caps get_capabilities; /**<Check capabilities */
} BootLoader;
#define __cbm_export__ __attribute__((visibility("default")))
/*
* Editor modelines - https://www.wireshark.org/tools/modelines.html
*
* Local variables:
* c-basic-offset: 8
* tab-width: 8
* indent-tabs-mode: nil
* End:
*
* vi: set shiftwidth=8 tabstop=8 expandtab:
* :indentSize=8:tabSize=8:noTabs=true:
*/
|
// The libMesh Finite Element Library.
// Copyright (C) 2002-2017 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef LIBMESH_MAPPED_SUBDOMAIN_PARTITIONER_H
#define LIBMESH_MAPPED_SUBDOMAIN_PARTITIONER_H
// Local Includes
#include "libmesh/partitioner.h"
#include "libmesh/auto_ptr.h" // libmesh_make_unique
namespace libMesh
{
/**
* The \p MappedSubdomainPartitioner partitions the elements based on their
* subdomain ids. The user must set up the values in the public
* subdomain_to_proc map in order to specify which subdomains should
* be partitioned onto which processors. More than one subdomain can
* be partitioned onto a given processor, but every subdomain must be
* assigned to exactly 1 processor.
*
* \author John W. Peterson
* \date 2017
* \brief Partitions elements based on user-defined mapping from subdomain ids -> processor ids.
*/
class MappedSubdomainPartitioner : public Partitioner
{
public:
/**
* Constructor.
*/
MappedSubdomainPartitioner () {}
/**
* \returns A copy of this partitioner wrapped in a smart pointer.
*/
virtual std::unique_ptr<Partitioner> clone () const libmesh_override
{
return libmesh_make_unique<MappedSubdomainPartitioner>();
}
/**
* Before calling partition() or partition_range(), the user must
* assign all the Mesh subdomains to certain processors by adding
* them to this std::map. For example:
* subdomain_to_proc[1] = 0;
* subdomain_to_proc[2] = 0;
* subdomain_to_proc[3] = 0;
* subdomain_to_proc[4] = 1;
* subdomain_to_proc[5] = 1;
* subdomain_to_proc[6] = 2;
* Would partition the mesh onto three processors, with subdomains
* 1, 2, and 3 on processor 0, subdomains 4 and 5 on processor 1,
* and subdomain 6 on processor 2.
*/
std::map<subdomain_id_type, processor_id_type> subdomain_to_proc;
/**
* Called by the SubdomainPartitioner to partition elements in the range (it, end).
*/
virtual void partition_range(MeshBase & mesh,
MeshBase::element_iterator it,
MeshBase::element_iterator end,
const unsigned int n) libmesh_override;
protected:
/**
* Partition the \p MeshBase into \p n subdomains.
*/
virtual void _do_partition (MeshBase & mesh,
const unsigned int n) libmesh_override;
};
} // namespace libMesh
#endif // LIBMESH_MAPPED_SUBDOMAIN_PARTITIONER_H
|
/*
Copyright 2001 to 2004. The Battle Grounds Team and Contributors
This file is part of the Battle Grounds Modification for Half-Life.
The Battle Grounds Modification for Half-Life is free software;
you can redistribute it and/or modify it under the terms of the
GNU Lesser General Public License as published by the Free
Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
The Battle Grounds Modification for Half-Life is distributed in
the hope that it will be useful, but WITHOUT ANY WARRANTY; without
even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE. See the GNU Lesser General Public License
for more details.
You should have received a copy of the GNU Lesser General Public
License along with The Battle Grounds Modification for Half-Life;
if not, write to the Free Software Foundation, Inc., 59 Temple Place,
Suite 330, Boston, MA 02111-1307 USA
You must obey the GNU General Public License in all respects for
all of the code used other than code distributed with the Half-Life
SDK developed by Valve. If you modify this file, you may extend this
exception to your version of the file, but you are not obligated to do so.
If you do not wish to do so, delete this exception statement from your
version.
*/
/***
*
* Copyright (c) 1996-2002, Valve LLC. All rights reserved.
*
* This product contains software technology licensed from Id
* Software, Inc. ("Id Technology"). Id Technology (c) 1996 Id Software, Inc.
* All Rights Reserved.
*
* Use, distribution, and modification of this source code and/or resulting
* object code is restricted to non-commercial enhancements to products from
* Valve LLC. All other use, distribution, or modification is prohibited
* without written permission from Valve LLC.
*
****/
#ifndef TALKMONSTER_H
#define TALKMONSTER_H
class CTalkMonster : public CBaseMonster
{
public:
static float g_talkWaitTime;
};
#endif //TALKMONSTER_H
|
/* user_settings.h : custom configuration for wolfcrypt/wolfSSL */
#ifndef USER_SETTINGS_H
#define USER_SETTINGS_H
#ifdef __cplusplus
extern "C" {
#endif
/* System */
#ifndef WOLFSSL_RIOT_OS
#define WOLFSSL_RIOT_OS 1
#endif
#include <random.h>
#define CUSTOM_RAND_GENERATE random_uint32
#define CUSTOM_RAND_TYPE uint32_t
#define NO_WRITEV
#define NO_DEV_RANDOM
#define NO_FILESYSTEM
#define NO_WOLFSSL_MEMORY
#define NO_MAIN_DRIVER
#define NO_SIG_WRAPPER
#define NO_OLD_RNGNAME
/* Uncomment the next two lines to enable wolfSSL debug */
// #define DEBUG_WOLFSSL
// #define WOLFSSL_LOG_PRINTF
/* Single precision math */
#define WOLFSSL_SP_MATH
#define WOLFSSL_SP_SMALL
#define SP_WORD_SIZE 32
#define WOLFSSL_SP
/* GNRC support enabled if not
* using sockets
*/
#ifndef MODULE_WOLFSSL_SOCKET
#define WOLFSSL_GNRC
#define WOLFSSL_USER_IO
#else
#include <sys/socket.h>
#endif
/* Select wolfcrypt only / +wolfssl
* at compile time (via USEMODULE)
*/
#ifndef MODULE_WOLFSSL_TLS
#ifndef MODULE_WOLFSSL_TLS13
#define WOLFCRYPT_ONLY
#else
#define NO_OLD_TLS
#define HAVE_TLS_EXTENSIONS
#define HAVE_AES_DECRYPT
#define HAVE_AESGCM
#define GCM_SMALL
#define HAVE_AESCCM
#define WOLFSSL_AES_COUNTER
#define WOLFSSL_AES_DIRECT
#endif
#else
#define HAVE_TLS_EXTENSIONS
#endif
/* Align on 32-bit (exc. native,
* don't modify default alignment.)
*/
#ifndef BOARD_NATIVE
#define WOLFSSL_GENERAL_ALIGNMENT 4
#endif
/* ARM-specific optimizations */
#ifdef CPU_ARM
#define TFM_ARM
#endif
/* defined somewhere else */
#ifndef __mips__
int strncasecmp(const char *s1, const char * s2, unsigned int sz);
#endif
#define SINGLE_THREADED
/* Global settings */
#define SMALL_SESSION_CACHE
#define WOLFSSL_DH_CONST
#define WORD64_AVAILABLE
#define TFM_TIMING_RESISTANT
#define USE_CERT_BUFFERS_2048
#define NO_RC4
/* Modules */
#undef WC_NO_RNG
#ifndef MODULE_WOLFCRYPT_RANDOM
#define WC_NO_RNG
#endif
#undef WOLFSSL_DTLS
#ifdef MODULE_WOLFSSL_DTLS
#define WOLFSSL_DTLS
#endif
#undef HAVE_FFDHE_2048
#ifdef MODULE_WOLFCRYPT_FFDHE_2048
#define HAVE_FFDHE_2048
#endif
#undef HAVE_CHACHA
#ifdef MODULE_WOLFCRYPT_CHACHA
#define HAVE_CHACHA
#endif
#undef HAVE_POLY1305
#ifdef MODULE_WOLFCRYPT_POLY1305
#define HAVE_POLY1305
#define HAVE_ONE_TIME_AUTH
#endif
#undef HAVE_CURVE25519
#ifdef MODULE_WOLFCRYPT_CURVE25519
#define HAVE_CURVE25519
#define CURVE25519_SMALL
#endif
#undef HAVE_ED25519
#ifdef MODULE_WOLFCRYPT_ED25519
#define HAVE_ED25519
#define ED25519_SMALL
#endif
#undef NO_AES
#undef NO_CODING
#undef NO_CMAC
#ifndef MODULE_WOLFCRYPT_AES
#define NO_AES
#endif
#ifndef MODULE_WOLFCRYPT_CMAC
#define NO_CMAC
#endif
#ifndef MODULE_WOLFCRYPT_CODING
#define NO_CODING
#endif
#ifndef MODULE_WOLFCRYPT_ASN
#define NO_ASN
#endif
#ifndef MODULE_WOLFCRYPT_HMAC
#define NO_HMAC
#endif
#undef NO_SHA
#ifndef MODULE_WOLFCRYPT_SHA
#define NO_SHA
#else
#define USE_SLOW_SHA
#define USE_SLOW_SHA2
#endif
#undef HAVE_SHA512
#undef HAVE_SHA384
#undef WOLFSSL_SHA384
#undef WOLFSSL_SHA512
#ifdef MODULE_WOLFCRYPT_SHA512
#define HAVE_SHA384
#define HAVE_SHA512
#define WOLFSSL_SHA384
#define WOLFSSL_SHA512
#define USE_SLOW_SHA512
#endif
#undef WOLFSSL_SHA3
#ifdef MODULE_WOLFCRYPT_SHA3
#define WOLFSSL_SHA3
#endif
#undef HAVE_ECC
#ifdef MODULE_WOLFCRYPT_ECC
#define HAVE_ECC
#define FP_ECC
#define WOLFSSL_HAVE_SP_ECC
#define WOLFSSL_HAVE_SP_ECC
#define ECC_TIMING_RESISTANT
#define HAVE_SUPPORTED_CURVES
#endif
#undef HAVE_BLAKE2B
#ifdef MODULE_WOLFCRYPT_BLAKE2B
#define HAVE_BLAKE2B
#endif
#undef HAVE_CAMELLIA
#ifdef MODULE_WOLFCRYPT_CAMELLIA
#define HAVE_CAMELLIA
#endif
#undef HAVE_IDEA
#ifdef MODULE_WOLFCRYPT_IDEA
#define HAVE_IDEA
#endif
#undef HAVE_HC128
#ifdef MODULE_WOLFCRYPT_HC128
#define HAVE_HC128
#endif
#undef HAVE_PKCS7
#ifdef MODULE_WOLFCRYPT_PKCS7
#define HAVE_PKCS7
#endif
#undef NO_PKCS12
#ifndef MODULE_WOLFCRYPT_PKCS12
#define NO_PKCS12
#endif
#undef NO_PWDBASED
#ifndef MODULE_WOLFCRYPT_PWDBASED
#define NO_PWDBASED
#endif
#undef WOLFSSL_STATIC_PSK
#ifdef MODULE_WOLFSSL_PSK
#define WOLFSSL_STATIC_PSK
#endif
#undef HAVE_LIBZ
#ifdef MODULE_WOLFCRYPT_COMPRESS
#define HAVE_LIBZ
#endif
#ifdef MODULE_WOLFCRYPT_RSA
#define HAVE_RSA
#define RSA_LOW_MEM
#define WC_RSA_BLINDING
#define WOLFSSL_STATIC_RSA
#define WOLFSSL_HAVE_SP_DH
#define WOLFSSL_HAVE_SP_RSA
#else
#define NO_RSA
#endif
#undef NO_DES3
#ifndef MODULE_WOLFCRYPT_DES3
#define NO_DES3
#endif
#undef NO_DH
#ifndef MODULE_WOLFCRYPT_DH
#define NO_DH
#endif
#undef NO_DSA
#ifndef MODULE_WOLFCRYPT_DSA
#define NO_DSA
#endif
#undef WOLFSSL_MD2
#ifdef MODULE_WOLFSSL_MD2
#define WOLFSSL_MD2
#endif
#undef NO_MD4
#ifndef MODULE_WOLFCRYPT_MD4
#define NO_MD4
#endif
#undef NO_RABBIT
#ifndef MODULE_WOLFCRYPT_RABBIT
#define NO_RABBIT
#endif
#undef NO_MD5
#ifndef MODULE_WOLFCRYPT_MD5
#define NO_MD5
#endif
#undef WOLFSSL_RIPEMD
#ifdef MODULE_WOLFCRYPT_RIPEMD
#define WOLFSSL_RIPEMD
#endif
#undef NO_SIG_WRAPPER
#ifndef MODULE_WOLFCRYPT_SIGNATURE
#define NO_SIG_WRAPPER
#endif
#undef HAVE_SRP
#ifdef MODULE_WOLFCRYPT_SRP
#define HAVE_SRP
#endif
#undef HAVE_OCSP
#ifdef MODULE_WOLFSSL_OCSP
#define HAVE_OCSP
#endif
#undef HAVE_CRL
#ifdef MODULE_WOLFSSL_CRL
#define HAVE_CRL
#endif
#undef HAVE_TLS13
#ifdef MODULE_WOLFSSL_TLS13
#define HAVE_TLS13
#define WOLFSSL_TLS13
#define BUILD_TLS_AES_128_GCM_SHA256
#endif
#ifdef __cplusplus
}
#endif
/* The following defines should prevent declaration of name-colliding "Aes"
* structure on SAML21, SAME54 platform code
*
* TODO: avoid pulling in all vendor files through cpu_conf.h
*/
#define _SAML21_AES_COMPONENT_
#define _SAMD51_AES_COMPONENT_
#define _SAME54_AES_COMPONENT_
#define _SAMR34_AES_COMPONENT_
#endif /* USER_SETTINGS_H */
|
/*
* The Spread Toolkit.
*
* The contents of this file are subject to the Spread Open-Source
* License, Version 1.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.spread.org/license/
*
* or in the file ``license.txt'' found in this distribution.
*
* Software distributed under the License is distributed on an AS IS basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Creators of Spread are:
* Yair Amir, Michal Miskin-Amir, Jonathan Stanton.
*
* Copyright (C) 1993-2004 Spread Concepts LLC <spread@spreadconcepts.com>
*
* All Rights Reserved.
*
* Major Contributor(s):
* ---------------
* Cristina Nita-Rotaru crisn@cs.purdue.edu - group communication security.
* Theo Schlossnagle jesus@omniti.com - Perl, skiplists, autoconf.
* Dan Schoenblum dansch@cnds.jhu.edu - Java interface.
* John Schultz jschultz@cnds.jhu.edu - contribution to process group membership.
*
*/
#ifndef INC_STATUS
#define INC_STATUS
#include "arch.h"
#include "scatter.h"
typedef struct dummy_status{
int32 sec;
int32 state;
int32 gstate;
int32 packet_sent;
int32 packet_recv;
int32 packet_delivered;
int32 retrans;
int32 u_retrans;
int32 s_retrans;
int32 b_retrans;
int32 aru;
int32 my_aru;
int32 highest_seq;
int32 token_hurry;
int32 token_rounds;
int32 my_id;
int32 leader_id;
int32 message_delivered;
int16 membership_changes;
int16 num_procs;
int16 num_segments;
int16 window;
int16 personal_window;
int16 num_sessions;
int16 num_groups;
int16 major_version;
int16 minor_version;
int16 patch_version;
} status;
#undef ext
#ifndef status_ext
#define ext extern
#else
#define ext
#endif
ext status GlobalStatus;
void Stat_init();
void Stat_handle_message( sys_scatter *scat );
#endif /* INC_STATUS */
|
#include <net-snmp/net-snmp-config.h>
#include <net-snmp/version.h>
/* expose ONLY for benefit of grandfathered code */
#ifndef UCD_COMPATIBLE
static
#endif
const char *NetSnmpVersionInfo = "5.4.4";
const char *
netsnmp_get_version()
{
return NetSnmpVersionInfo;
}
|
#include "lie.h"
object Diagram(grp) object grp;
{ register index i,j,k,r; index offset=0; simpgrp* gk; Printf("\n");
/* Repeat over simple components: */
for (k=0; k<grp->g.ncomp; k++,offset+=r)
{ gk=Liecomp(grp,k); r=gk->lierank;
if(r<12)
switch (gk->lietype)
{ case 'A':
for (i=1; i<=r-1; i++) Printf("O---"); Printf("O\n");
for (i=1; i<=r; i++) Printf("%-4ld",offset+i); Printf("\n");
break; case 'B':
for (i=1; i<=r-2; i++) Printf("O---"); Printf("O=>=O\n");
for (i=1; i<=r; i++) Printf("%-4ld",offset+i); Printf("\n");
break; case 'C':
for (i=1; i<=r-2; i++) Printf("O---"); Printf("O=<=O\n");
for (i=1; i<=r; i++) Printf("%-4ld",offset+i); Printf("\n");
break; case 'D':
for (j=0; j<3; j++)
{ for (i=1; i<=4*(r-3); i++) Printf(" ");
if (j) Printf("|\n"); else Printf("O %ld\n",(long)(offset+r-1));
}
for (i=2; i<r; i++) Printf("O---"); Printf("O\n");
for (i=1; i<=r-2; i++) Printf("%-4ld",offset+i);
Printf("%ld\n",(long)(offset+r));
break; case 'E':
Printf(" O %ld\n |\n |\n",(long)(offset+2));
for (i=2; i<=r-1; i++) Printf("O---"); Printf("O\n");
for (i=1; i<=r; i++) if (i!=2) Printf("%-4ld",offset+i); Printf("\n");
break; case 'F':
Printf("O---O=>=O---O\n");
for (i=1; i<=4; i++) Printf("%-4ld",offset+i); Printf("\n");
break; case 'G':
Printf(" 3\nO=<=O\n%-4ld%ld\n",(long)(offset+1),(long)(offset+2));
}
else /* r>=12 */
{ char t=gk->lietype;
if (t=='D') for (i=0; i<3; i++)
{ for (j=32; --j>=0; ) Printf(" ");
if (i) Printf("|\n"); else Printf("O %ld\n",(long)(offset+r-1));
}
Printf("O---O---O---O-- . . . --O---O---O%sO\n"
, t=='B' ? "=>=" : t=='C' ? "=<=" : "---");
for (i=1; i<=4; i++) Printf("%-4ld",offset+i);
for (i=0; i<8; i++) Printf(" ");
for (i=r-(t=='D'?4:3); i<=r; i++) if (t!='D' || i!=r-1)
Printf("%-4ld",offset+i);
Printf("\n");
}
Printf("%c%ld\n\n",gk->lietype,(long)(gk->lierank));
} /* End repeat over components */
if (grp->g.toraldim)
{ if (grp->g.ncomp)
Printf("With %ld-dimensional central torus.\n\n",(long)grp->g.toraldim);
else Printf ("A %ld-dimensional torus.\n\n",(long)grp->g.toraldim);
}
else if (grp->g.ncomp==0) Printf("Trivial group.\n\n");
return (object)NULL;
}
|
/******************************************************************************
* Copyright (c) 2014-2016 Leandro T. C. Melo (ltcmelo@gmail.com)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
* USA
*****************************************************************************/
/*--------------------------*/
/*--- The UaiSo! Project ---*/
/*--------------------------*/
#ifndef UAISO_BINDERTEST_H__
#define UAISO_BINDERTEST_H__
#include "Semantic/Binder.h"
#include "Parsing/Lexeme.h"
#include "Parsing/LexemeMap.h"
#include <string>
namespace uaiso {
class Factory;
class Program;
class Binder::BinderTest final : public Test
{
public:
TEST_RUN(BinderTest
// Go
, &BinderTest::GoTestCase1
// Python
, &BinderTest::PyTestCase1
, &BinderTest::PyTestCase2
, &BinderTest::PyTestCase3
, &BinderTest::PyTestCase4
, &BinderTest::PyTestCase5
, &BinderTest::PyTestCase6
, &BinderTest::PyTestCase7
, &BinderTest::PyTestCase8
, &BinderTest::PyTestCase9
, &BinderTest::PyTestCase10
, &BinderTest::PyTestCase11
, &BinderTest::PyTestCase12
)
//--- Go ---//
void GoTestCase1();
//--- Python ---//
void PyVerifyBasicCode(const Program* prog);
void PyTestCase1();
void PyTestCase2();
void PyTestCase3();
void PyTestCase4();
void PyTestCase5();
void PyTestCase6();
void PyTestCase7();
void PyTestCase8();
void PyTestCase9();
void PyTestCase10();
void PyTestCase11();
void PyTestCase12();
std::unique_ptr<Program> core(std::unique_ptr<Factory> factory,
const std::string& code,
const std::string& fullFileName);
void reset() override
{
lexs_.clear();
}
LexemeMap lexs_;
};
} // namespace uaiso
#endif
|
/****************************************************************************
**
** Copyright (C) 1992-2009 Nokia. All rights reserved.
**
** This file is part of Qt Jambi.
**
** ** $BEGIN_LICENSE$
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** $END_LICENSE$
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
****************************************************************************/
#ifndef TYPEPARSER_H
#define TYPEPARSER_H
#include <QList>
#include <QString>
#include <QStringList>
#include <QStack>
class Scanner;
class TypeParser {
public:
struct Info {
Info() : is_reference(false), is_constant(false), is_busted(false), indirections(0) { }
QStringList qualified_name;
/**
* List of different parts of “array”, or [foo]
*/
QStringList arrays;
QList<Info> template_instantiations;
uint is_reference : 1;
uint is_constant : 1;
/**
* If the type is not supported / valid
*/
uint is_busted : 1;
uint indirections : 5;
QString toString() const;
QString instantiationName() const; //private?
};
/**
* Loops through the text token by token and returns the data
*/
static Info parse(const QString &str);
private:
static void parseIdentifier(Scanner &scanner, QStack<Info *> &stack, QString &array, bool in_array, bool &colon_prefix);
};
#endif // TYPEPARSER_H
|
/**
* @file GroupsSBMLError.h
* @brief Definition of the GroupsSBMLError class.
* @author SBMLTeam
*
* <!--------------------------------------------------------------------------
* This file is part of libSBML. Please visit http://sbml.org for more
* information about SBML, and the latest version of libSBML.
*
* Copyright (C) 2019 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. University of Heidelberg, Heidelberg, Germany
*
* Copyright (C) 2013-2018 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. EMBL European Bioinformatics Institute (EMBL-EBI), Hinxton, UK
* 3. University of Heidelberg, Heidelberg, Germany
*
* Copyright (C) 2009-2013 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. EMBL European Bioinformatics Institute (EMBL-EBI), Hinxton, UK
*
* Copyright (C) 2006-2008 by the California Institute of Technology,
* Pasadena, CA, USA
*
* Copyright (C) 2002-2005 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. Japan Science and Technology Agency, Japan
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by the
* Free Software Foundation. A copy of the license agreement is provided in the
* file named "LICENSE.txt" included with this software distribution and also
* available online as http://sbml.org/software/libsbml/license.html
* ------------------------------------------------------------------------ -->
*/
#ifndef GroupsSBMLError_H__
#define GroupsSBMLError_H__
LIBSBML_CPP_NAMESPACE_BEGIN
BEGIN_C_DECLS
/**
* @enum GroupsSBMLErrorCode_t
* Codes for all SBML-level errors and warnings from the 'groups' package.
*
* These are distinguished from other SBML error codes by having a number
* between 4000000 and 4099999.
*
* @copydetails doc_sbml_error_code_ranges
*/
typedef enum
{
GroupsUnknown = 4010100
, GroupsNSUndeclared = 4010101
, GroupsElementNotInNs = 4010102
, GroupsDuplicateComponentId = 4010301
, GroupsIdSyntaxRule = 4010302
, GroupsAttributeRequiredMissing = 4020101
, GroupsAttributeRequiredMustBeBoolean = 4020102
, GroupsAttributeRequiredMustHaveValue = 4020103
, GroupsModelAllowedElements = 4020201
, GroupsModelEmptyLOElements = 4020202
, GroupsModelLOGroupsAllowedCoreElements = 4020203
, GroupsModelLOGroupsAllowedCoreAttributes = 4020204
, GroupsGroupAllowedCoreAttributes = 4020301
, GroupsGroupAllowedCoreElements = 4020302
, GroupsGroupAllowedAttributes = 4020303
, GroupsGroupAllowedElements = 4020304
, GroupsGroupKindMustBeGroupKindEnum = 4020305
, GroupsGroupNameMustBeString = 4020306
, GroupsGroupEmptyLOElements = 4020307
, GroupsGroupLOMembersAllowedCoreElements = 4020308
, GroupsGroupLOMembersAllowedCoreAttributes = 4020309
, GroupsGroupLOMembersAllowedAttributes = 4020310
, GroupsLOMembersNameMustBeString = 4020311
, GroupsMemberAllowedCoreAttributes = 4020401
, GroupsMemberAllowedCoreElements = 4020402
, GroupsMemberAllowedAttributes = 4020403
, GroupsMemberNameMustBeString = 4020404
, GroupsMemberIdRefMustBeSBase = 4020405
, GroupsMemberMetaIdRefMustBeSBase = 4020406
} GroupsSBMLErrorCode_t;
END_C_DECLS
LIBSBML_CPP_NAMESPACE_END
#endif /* !GroupsSBMLError_H__ */
|
/* Test of case and normalization insensitive comparison of Unicode strings.
Copyright (C) 2009-2012 Free Software Foundation, Inc.
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 3 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, see <http://www.gnu.org/licenses/>. */
/* Written by Bruno Haible <bruno@clisp.org>, 2009. */
static void
test_ascii (int (*my_casecmp) (const UNIT *, size_t, const UNIT *, size_t, const char *, uninorm_t, int *),
uninorm_t nf)
{
/* Empty string. */
{
int cmp;
ASSERT (my_casecmp (NULL, 0, NULL, 0, NULL, nf, &cmp) == 0);
ASSERT (cmp == 0);
}
{
static const UNIT input[] = { 'x', 'y' };
int cmp;
ASSERT (my_casecmp (input, SIZEOF (input), NULL, 0, NULL, nf, &cmp) == 0);
ASSERT (cmp == 1);
ASSERT (my_casecmp (NULL, 0, input, SIZEOF (input), NULL, nf, &cmp) == 0);
ASSERT (cmp == -1);
ASSERT (my_casecmp (input, SIZEOF (input), input, SIZEOF (input), NULL, nf, &cmp) == 0);
ASSERT (cmp == 0);
}
/* Normal lexicographic order. */
{
static const UNIT input1[] = { 'A', 'm', 'e', 'r', 'i', 'c', 'a' };
static const UNIT input2[] = { 'A', 'm', 'i', 'g', 'o' };
int cmp;
ASSERT (my_casecmp (input1, SIZEOF (input1), input2, SIZEOF (input2), NULL, nf, &cmp) == 0);
ASSERT (cmp == -1);
ASSERT (my_casecmp (input2, SIZEOF (input2), input1, SIZEOF (input1), NULL, nf, &cmp) == 0);
ASSERT (cmp == 1);
}
/* Shorter and longer strings. */
{
static const UNIT input1[] = { 'R', 'e', 'a', 'g', 'a', 'n' };
static const UNIT input2[] = { 'R', 'e', 'a', 'g', 'a', 'n', 'o', 'm', 'i', 'c', 's' };
int cmp;
ASSERT (my_casecmp (input1, SIZEOF (input1), input2, SIZEOF (input2), NULL, nf, &cmp) == 0);
ASSERT (cmp == -1);
ASSERT (my_casecmp (input2, SIZEOF (input2), input1, SIZEOF (input1), NULL, nf, &cmp) == 0);
ASSERT (cmp == 1);
}
}
|
/******************************************************************************
* This file is part of the Gluon Development Platform
* Copyright (c) 2012 Laszlo Papp <djszapi@archlinux.us>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef QGITCONFIG_H
#define QGITCONFIG_H
#include <libqgit2_export.h>
#include <QtCore/QVariant>
struct git_config;
namespace LibQGit2
{
class QGitRepository;
/**
* @brief Represents the git configuration file.
*
* @ingroup LibQGit2
* @{
*/
class LIBQGIT2_EXPORT QGitConfig
{
public:
/**
* Default constructor to create a new configuration object.
*
* @param cfg when given, the instance is used instead of creating a new one
*/
QGitConfig(git_config *cfg = 0);
QGitConfig(const QGitConfig &other);
virtual ~QGitConfig();
/**
* Appends a config file with the given access priority.
*
* @param path the absolute path to the config file
* @param priority the access priority; values with higher priority are accessed first
*
* @return true on success
*/
bool append(const QString &path, int priority);
/**
* Reads a single value from the configuration.
*
* @return the value as QVariant or an empty QVariant instance
*/
QVariant value(const QString &key, const QVariant &defaultValue = QVariant()) const;
/**
* Writes a value in the configuration with the highest priority.
*
* @param key the name of the value to write
* @param value the value
*
* @todo handle the QVariant type correctly
*/
void setValue(const QString &key, const QVariant &value);
/**
* Remove a value from the configuration.
*
* @param key the name for the value to remove
*/
void remove(const QString &key);
public:
/**
* Searches for the global configuration file located in $HOME.
* @see git_config_find_global
*/
static QString findGlobal();
/**
* Searches for the system configuration file.
* @see git_config_find_system
*/
static QString findSystem();
private:
git_config * d; //!< internal pointer to the libgit2 config instance
};
/**@}*/
}
#endif // QGITCONFIG_H
|
/******************************************************************************
* This file is part of the Gluon Development Platform
* Copyright (c) 2011 Shantanu Tushar <shaan7in@gmail.com>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef GLUON_CREATOR_DISTRIBUTIONDOCKPLUGIN_H
#define GLUON_CREATOR_DISTRIBUTIONDOCKPLUGIN_H
#include <creator/dockplugin.h>
namespace GluonCreator
{
class DistributionDockPlugin : public DockPlugin
{
Q_OBJECT
GLUON_DOCK_PLUGIN( metadata.json )
public:
DistributionDockPlugin( QObject* parent=0, const QList< QVariant >& params=QList<QVariant>() );
~DistributionDockPlugin();
protected:
QDockWidget* createDock( KXmlGuiWindow* parent );
};
}
#endif // GLUON_CREATOR_DISTRIBUTIONDOCKPLUGIN_H
|
#ifndef oxygenpaneddata_h
#define oxygenpaneddata_h
/*
* this file is part of the oxygen gtk engine
* SPDX-FileCopyrightText: 2010 Hugo Pereira Da Costa <hugo.pereira@free.fr>
*
* SPDX-License-Identifier: LGPL-2.0-or-later
*/
#include "oxygensignal.h"
#include <gtk/gtk.h>
namespace Oxygen
{
class PanedData
{
public:
//! constructor
PanedData( void ):
_cursorLoaded( false ),
_cursor( 0L )
{}
//! destructor
virtual ~PanedData( void )
{
disconnect( 0L );
if( _cursor ) gdk_cursor_unref( _cursor );
}
//! setup connections
void connect( GtkWidget* );
//! disconnect
void disconnect( GtkWidget* );
protected:
//! update cursor
virtual void updateCursor( GtkWidget* );
//! realization hook
static void realizeEvent( GtkWidget*, gpointer );
private:
//! realization signal
Signal _realizeId;
//! cursor
bool _cursorLoaded;
GdkCursor* _cursor;
};
}
#endif
|
/* $Id: runtime.h,v 1.1 2000/04/23 14:55:20 ktk Exp $ */
//ÉÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍ»
//º runtime.h º
//º Avoid problems using the runtime library functions º
//º º
//º MODIFICATION HISTORY º
//º DATE PROGRAMMER COMMENT º
//º 03-26-97 Rich Jerant Creation How did we ever do without thisº
//º Nothing pretty here just prototypes for º
//º most of the functions in runtime.lib º
//º º
//ÈÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍͼ
#ifndef RUNTIME_INCLUDED
#define RUNTIME_INCLUDED
int toupper(int c);
char *strncpy(char *dst, const char *src, int n);
char __far *_fstrncpy(char __far *dst, const char __far *src, int n);
int _fstrnicmp(const char __far *string1, const char __far *string2, int n);
#endif
|
//
// libavg - Media Playback Engine.
// Copyright (C) 2003-2021 Ulrich von Zadow
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// Current versions can be found at www.libavg.de
//
#ifndef _FilterConvol_H
#define _FilterConvol_H
#include "../api.h"
#include "Filter.h"
#include "Pixel8.h"
#include "Pixel24.h"
#include "Pixel32.h"
#include <iostream>
namespace avg {
// Filter that applies a 3x3 kernel to the bitmap.
template<class Pixel>
class AVG_API FilterConvol : public Filter
{
public:
FilterConvol(float *Mat,int n,int m, int offset=0);
virtual ~FilterConvol();
virtual BitmapPtr apply(BitmapPtr pBmpSource);
private:
void convolveLine(const unsigned char* pSrc, unsigned char* pDest,
int lineLen, int stride, int offset = 0) const;
int m_N;
int m_M;
int m_Offset;
float *m_Mat;
};
template <class Pixel>
void FilterConvol<Pixel>::convolveLine(const unsigned char* pSrc, unsigned char* pDest,
int lineLen, int stride, int offset) const
{
Pixel * pSrcPixel = (Pixel *)pSrc;
Pixel * pDestPixel = (Pixel *)pDest;
for (int x=0; x<lineLen; ++x) {
float NewR = 0;
float NewG = 0;
float NewB = 0;
for (int i=0; i<m_N; i++) {
for (int j=0; j<m_N; j++) {
unsigned char * pLineStart = (unsigned char *)pSrcPixel+i*stride;
Pixel SrcPixel = *((Pixel *)pLineStart+j);
NewR += SrcPixel.getR()*m_Mat[m_N*i+j];
NewG += SrcPixel.getG()*m_Mat[m_N*i+j];
NewB += SrcPixel.getB()*m_Mat[m_N*i+j];
}
}
*pDestPixel = Pixel((unsigned char)(NewR+offset), (unsigned char)(NewG+offset),
(unsigned char)(NewB+offset));
pSrcPixel++;
pDestPixel++;
}
}
template <>
void FilterConvol<Pixel8>::convolveLine(const unsigned char* pSrc, unsigned char* pDest,
int lineLen, int stride, int offset) const
{
Pixel8 * pSrcPixel = (Pixel8 *)pSrc;
Pixel8 * pDestPixel = (Pixel8 *)pDest;
for (int x=0; x<lineLen; ++x) {
float New = 0;
for (int i=0; i<m_N; i++) {
for (int j=0; j<m_N; j++) {
unsigned char * pLineStart = (unsigned char *)pSrcPixel+i*stride;
Pixel8 SrcPixel = *((Pixel8 *)pLineStart+j);
New += SrcPixel.get()*m_Mat[m_N*i+j];
}
}
*pDestPixel = Pixel8((unsigned char)(New+offset));
pSrcPixel++;
pDestPixel++;
}
}
template <class Pixel>
FilterConvol<Pixel>::FilterConvol(float *Mat, int n, int m, int offset)
: Filter(),
m_N(n),
m_M(m),
m_Offset(offset)
{
m_Mat = new float[n*m];
for (int y=0; y<n; y++) {
for (int x=0; x<m; x++) {
m_Mat[m_N*y+x] = Mat[m_N*y+x];
}
}
}
template <class Pixel>
FilterConvol<Pixel>::~FilterConvol()
{
delete[] m_Mat;
}
template <class Pixel>
BitmapPtr FilterConvol<Pixel>::apply(BitmapPtr pBmpSource)
{
IntPoint NewSize(pBmpSource->getSize().x-m_N+1, pBmpSource->getSize().y-m_M+1);
BitmapPtr pNewBmp(new Bitmap(NewSize, pBmpSource->getPixelFormat(),
pBmpSource->getName()+"_filtered"));
for (int y = 0; y < NewSize.y; y++) {
const unsigned char * pSrc = pBmpSource->getPixels()+y*pBmpSource->getStride();
unsigned char * pDest = pNewBmp->getPixels()+y*pNewBmp->getStride();
convolveLine(pSrc, pDest, NewSize.x, pBmpSource->getStride(), m_Offset);
}
return pNewBmp;
}
}
#endif
|
/*
* libvirt-gconfig-storage-permissions.h: libvirt storage permissions configuration
*
* Copyright (C) 2011 Red Hat, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library. If not, see
* <http://www.gnu.org/licenses/>.
*
* Author: Christophe Fergeau
*/
#if !defined(__LIBVIRT_GCONFIG_H__) && !defined(LIBVIRT_GCONFIG_BUILD)
#error "Only <libvirt-gconfig/libvirt-gconfig.h> can be included directly."
#endif
#pragma once
G_BEGIN_DECLS
#define GVIR_CONFIG_TYPE_STORAGE_PERMISSIONS (gvir_config_storage_permissions_get_type ())
#define GVIR_CONFIG_STORAGE_PERMISSIONS(obj) (G_TYPE_CHECK_INSTANCE_CAST ((obj), GVIR_CONFIG_TYPE_STORAGE_PERMISSIONS, GVirConfigStoragePermissions))
#define GVIR_CONFIG_STORAGE_PERMISSIONS_CLASS(klass) (G_TYPE_CHECK_CLASS_CAST ((klass), GVIR_CONFIG_TYPE_STORAGE_PERMISSIONS, GVirConfigStoragePermissionsClass))
#define GVIR_CONFIG_IS_STORAGE_PERMISSIONS(obj) (G_TYPE_CHECK_INSTANCE_TYPE ((obj), GVIR_CONFIG_TYPE_STORAGE_PERMISSIONS))
#define GVIR_CONFIG_IS_STORAGE_PERMISSIONS_CLASS(klass) (G_TYPE_CHECK_CLASS_TYPE ((klass), GVIR_CONFIG_TYPE_STORAGE_PERMISSIONS))
#define GVIR_CONFIG_STORAGE_PERMISSIONS_GET_CLASS(obj) (G_TYPE_INSTANCE_GET_CLASS ((obj), GVIR_CONFIG_TYPE_STORAGE_PERMISSIONS, GVirConfigStoragePermissionsClass))
typedef struct _GVirConfigStoragePermissions GVirConfigStoragePermissions;
typedef struct _GVirConfigStoragePermissionsPrivate GVirConfigStoragePermissionsPrivate;
typedef struct _GVirConfigStoragePermissionsClass GVirConfigStoragePermissionsClass;
struct _GVirConfigStoragePermissions
{
GVirConfigObject parent;
GVirConfigStoragePermissionsPrivate *priv;
/* Do not add fields to this struct */
};
struct _GVirConfigStoragePermissionsClass
{
GVirConfigObjectClass parent_class;
gpointer padding[20];
};
GType gvir_config_storage_permissions_get_type(void);
GVirConfigStoragePermissions *gvir_config_storage_permissions_new(void);
GVirConfigStoragePermissions *gvir_config_storage_permissions_new_from_xml(const gchar *xml,
GError **error);
guint gvir_config_storage_permissions_get_group(GVirConfigStoragePermissions *perms);
void gvir_config_storage_permissions_set_group(GVirConfigStoragePermissions *perms,
guint group);
const char *gvir_config_storage_permissions_get_label(GVirConfigStoragePermissions *perms);
void gvir_config_storage_permissions_set_label(GVirConfigStoragePermissions *perms,
const char *label);
guint gvir_config_storage_permissions_get_mode(GVirConfigStoragePermissions *perms);
void gvir_config_storage_permissions_set_mode(GVirConfigStoragePermissions *perms,
guint mode);
guint gvir_config_storage_permissions_get_owner(GVirConfigStoragePermissions *perms);
void gvir_config_storage_permissions_set_owner(GVirConfigStoragePermissions *perms,
guint owner);
G_END_DECLS
|
/**
* @file Testcase.h
*
* @class Model::Project
*
* @copyright (c) 2014, Robert Wloch
* @license LGPL v2.1
*
* @brief Model element representing a testcase class of a library.
* @details A testcase has a collection of testruns.
*
* @author Robert Wloch, robert@rowlo.de
*************************************************************************************************/
#ifndef TESTCASE_H
#define TESTCASE_H
#include <QString>
#include <QSharedPointer>
#include <QMap>
#include <Model/Testrun.h>
namespace Model
{
class Testcase
{
public:
Testcase();
Testcase(const Testcase &other);
Testcase& withTlogPath(const QString &tlogPath, const int startLine, const int endLine);
QString getTlogPath() const;
Testcase& withName(const QString &name);
QString getName() const;
int getTlogStartLine() const;
int getTlogEndLine() const;
void addTestrun(QSharedPointer<Testrun> testrun);
QSharedPointer<Testrun> getTestrun(qint64 timestamp);
void deleteTestrun(qint64 timestamp);
QList<QSharedPointer<Testrun> > getTestruns() const;
int getTestrunsCount() const;
private:
QString m_tlogPath;
QString m_name;
int m_tlogStartLine;
int m_tlogEndLine;
QMap<qint64, QSharedPointer<Testrun> > m_testruns;
};
} // namespace Model
#endif // TESTCASE_H
|
/* Swfdec
* Copyright (C) 2007 Benjamin Otte <otte@gnome.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301 USA
*/
#ifndef _SWFDEC_AS_FUNCTION_H_
#define _SWFDEC_AS_FUNCTION_H_
#include <swfdec/swfdec_as_object.h>
#include <swfdec/swfdec_as_types.h>
#include <swfdec/swfdec_script.h>
G_BEGIN_DECLS
typedef struct _SwfdecAsFunctionClass SwfdecAsFunctionClass;
#define SWFDEC_TYPE_AS_FUNCTION (swfdec_as_function_get_type())
#define SWFDEC_IS_AS_FUNCTION(obj) (G_TYPE_CHECK_INSTANCE_TYPE ((obj), SWFDEC_TYPE_AS_FUNCTION))
#define SWFDEC_IS_AS_FUNCTION_CLASS(klass) (G_TYPE_CHECK_CLASS_TYPE ((klass), SWFDEC_TYPE_AS_FUNCTION))
#define SWFDEC_AS_FUNCTION(obj) (G_TYPE_CHECK_INSTANCE_CAST ((obj), SWFDEC_TYPE_AS_FUNCTION, SwfdecAsFunction))
#define SWFDEC_AS_FUNCTION_CLASS(klass) (G_TYPE_CHECK_CLASS_CAST ((klass), SWFDEC_TYPE_AS_FUNCTION, SwfdecAsFunctionClass))
#define SWFDEC_AS_FUNCTION_GET_CLASS(obj) (G_TYPE_INSTANCE_GET_CLASS ((obj), SWFDEC_TYPE_AS_FUNCTION, SwfdecAsFunctionClass))
/* FIXME: do two obejcts, one for scripts and one for native? */
struct _SwfdecAsFunction {
/*< private >*/
SwfdecAsObject object;
};
struct _SwfdecAsFunctionClass {
SwfdecAsObjectClass object_class;
/* call this function - see swfdec_as_function_call_full() for meaning of arguments */
void (* call) (SwfdecAsFunction * function,
SwfdecAsObject * thisp,
gboolean construct,
SwfdecAsObject * super_reference,
guint n_args,
const SwfdecAsValue * args,
SwfdecAsValue * return_value);
};
GType swfdec_as_function_get_type (void);
void swfdec_as_function_call_full (SwfdecAsFunction * function,
SwfdecAsObject * thisp,
gboolean construct,
SwfdecAsObject * super_reference,
guint n_args,
const SwfdecAsValue * args,
SwfdecAsValue * return_value);
#define swfdec_as_function_call(function, thisp, n_args, args, return_value) G_STMT_START{ \
SwfdecAsObject *__thisp = (thisp); \
swfdec_as_function_call_full (function, __thisp, FALSE, \
__thisp ? __thisp->prototype : SWFDEC_AS_OBJECT (function)->prototype, \
n_args, args, return_value); \
}G_STMT_END
G_END_DECLS
#endif
|
/********************************************************************************
** Form generated from reading UI file 'querywidget_mobiles.ui'
**
** Created by: Qt User Interface Compiler version 4.8.6
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
********************************************************************************/
#ifndef UI_QUERYWIDGET_MOBILES_H
#define UI_QUERYWIDGET_MOBILES_H
#include <QtCore/QVariant>
#include <QtGui/QAction>
#include <QtGui/QApplication>
#include <QtGui/QButtonGroup>
#include <QtGui/QComboBox>
#include <QtGui/QHeaderView>
#include <QtGui/QMainWindow>
#include <QtGui/QTabWidget>
#include <QtGui/QTextBrowser>
#include <QtGui/QVBoxLayout>
#include <QtGui/QWidget>
QT_BEGIN_NAMESPACE
class Ui_QueryWidget
{
public:
QWidget *centralwidget;
QVBoxLayout *verticalLayout_2;
QTabWidget *tabWidget;
QWidget *tab_1;
QVBoxLayout *verticalLayout;
QTextBrowser *inputTextEdit;
QWidget *tab_2;
QVBoxLayout *verticalLayout_3;
QComboBox *defaultQueries;
QTextBrowser *queryTextEdit;
QWidget *tab_3;
QVBoxLayout *verticalLayout_4;
QTextBrowser *outputTextEdit;
void setupUi(QMainWindow *QueryWidget)
{
if (QueryWidget->objectName().isEmpty())
QueryWidget->setObjectName(QString::fromUtf8("QueryWidget"));
QueryWidget->resize(453, 583);
centralwidget = new QWidget(QueryWidget);
centralwidget->setObjectName(QString::fromUtf8("centralwidget"));
verticalLayout_2 = new QVBoxLayout(centralwidget);
verticalLayout_2->setObjectName(QString::fromUtf8("verticalLayout_2"));
tabWidget = new QTabWidget(centralwidget);
tabWidget->setObjectName(QString::fromUtf8("tabWidget"));
tabWidget->setTabsClosable(false);
tab_1 = new QWidget();
tab_1->setObjectName(QString::fromUtf8("tab_1"));
verticalLayout = new QVBoxLayout(tab_1);
verticalLayout->setObjectName(QString::fromUtf8("verticalLayout"));
inputTextEdit = new QTextBrowser(tab_1);
inputTextEdit->setObjectName(QString::fromUtf8("inputTextEdit"));
inputTextEdit->setTextInteractionFlags(Qt::NoTextInteraction);
inputTextEdit->setOpenLinks(false);
verticalLayout->addWidget(inputTextEdit);
tabWidget->addTab(tab_1, QString());
tab_2 = new QWidget();
tab_2->setObjectName(QString::fromUtf8("tab_2"));
verticalLayout_3 = new QVBoxLayout(tab_2);
verticalLayout_3->setObjectName(QString::fromUtf8("verticalLayout_3"));
defaultQueries = new QComboBox(tab_2);
defaultQueries->setObjectName(QString::fromUtf8("defaultQueries"));
verticalLayout_3->addWidget(defaultQueries);
queryTextEdit = new QTextBrowser(tab_2);
queryTextEdit->setObjectName(QString::fromUtf8("queryTextEdit"));
queryTextEdit->setTextInteractionFlags(Qt::NoTextInteraction);
queryTextEdit->setOpenLinks(false);
verticalLayout_3->addWidget(queryTextEdit);
tabWidget->addTab(tab_2, QString());
tab_3 = new QWidget();
tab_3->setObjectName(QString::fromUtf8("tab_3"));
verticalLayout_4 = new QVBoxLayout(tab_3);
verticalLayout_4->setObjectName(QString::fromUtf8("verticalLayout_4"));
outputTextEdit = new QTextBrowser(tab_3);
outputTextEdit->setObjectName(QString::fromUtf8("outputTextEdit"));
outputTextEdit->setTextInteractionFlags(Qt::NoTextInteraction);
outputTextEdit->setOpenLinks(false);
verticalLayout_4->addWidget(outputTextEdit);
tabWidget->addTab(tab_3, QString());
verticalLayout_2->addWidget(tabWidget);
QueryWidget->setCentralWidget(centralwidget);
retranslateUi(QueryWidget);
tabWidget->setCurrentIndex(0);
QMetaObject::connectSlotsByName(QueryWidget);
} // setupUi
void retranslateUi(QMainWindow *QueryWidget)
{
QueryWidget->setWindowTitle(QApplication::translate("QueryWidget", "Recipes XQuery Example", 0, QApplication::UnicodeUTF8));
tabWidget->setTabText(tabWidget->indexOf(tab_1), QApplication::translate("QueryWidget", "Input Document", 0, QApplication::UnicodeUTF8));
tabWidget->setTabText(tabWidget->indexOf(tab_2), QApplication::translate("QueryWidget", "Query selection", 0, QApplication::UnicodeUTF8));
tabWidget->setTabText(tabWidget->indexOf(tab_3), QApplication::translate("QueryWidget", "Ouput Document", 0, QApplication::UnicodeUTF8));
} // retranslateUi
};
namespace Ui {
class QueryWidget: public Ui_QueryWidget {};
} // namespace Ui
QT_END_NAMESPACE
#endif // UI_QUERYWIDGET_MOBILES_H
|
/*
* fsu-resolution-filter.h - Header for FsuResolutionFilter
*
* Copyright (C) 2010 Collabora Ltd.
* @author: Youness Alaoui <youness.alaoui@collabora.co.uk>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef __FSU_RESOLUTION_FILTER_H__
#define __FSU_RESOLUTION_FILTER_H__
#include <gst/filters/fsu-filter.h>
G_BEGIN_DECLS
#define FSU_TYPE_RESOLUTION_FILTER \
(fsu_resolution_filter_get_type())
#define FSU_RESOLUTION_FILTER(obj) \
(G_TYPE_CHECK_INSTANCE_CAST ((obj), \
FSU_TYPE_RESOLUTION_FILTER, \
FsuResolutionFilter))
#define FSU_RESOLUTION_FILTER_CLASS(klass) \
(G_TYPE_CHECK_CLASS_CAST ((klass), \
FSU_TYPE_RESOLUTION_FILTER, \
FsuResolutionFilterClass))
#define FSU_IS_RESOLUTION_FILTER(obj) \
(G_TYPE_CHECK_INSTANCE_TYPE ((obj), \
FSU_TYPE_RESOLUTION_FILTER))
#define FSU_IS_RESOLUTION_FILTER_CLASS(klass) \
(G_TYPE_CHECK_CLASS_TYPE ((klass), \
FSU_TYPE_RESOLUTION_FILTER))
#define FSU_RESOLUTION_FILTER_GET_CLASS(obj) \
(G_TYPE_INSTANCE_GET_CLASS ((obj), \
FSU_TYPE_RESOLUTION_FILTER, \
FsuResolutionFilterClass))
typedef struct _FsuResolutionFilter FsuResolutionFilter;
typedef struct _FsuResolutionFilterClass FsuResolutionFilterClass;
typedef struct _FsuResolutionFilterPrivate FsuResolutionFilterPrivate;
struct _FsuResolutionFilterClass
{
FsuFilterClass parent_class;
};
/**
* FsuResolutionFilter:
*
* A video resolution filter
*/
struct _FsuResolutionFilter
{
FsuFilter parent;
/*< private >*/
FsuResolutionFilterPrivate *priv;
};
GType fsu_resolution_filter_get_type (void) G_GNUC_CONST;
FsuResolutionFilter *fsu_resolution_filter_new (guint width,
guint height);
FsuResolutionFilter *fsu_resolution_filter_new_range (guint min_width,
guint min_height,
guint max_width,
guint max_height);
G_END_DECLS
#endif /* __FSU_RESOLUTION_FILTER_H__ */
|
/**
* @file fsfloaterteleporthistory.h
* @brief Class for the standalone teleport history in Firestorm
*
* $LicenseInfo:firstyear=2012&license=viewerlgpl$
* Phoenix Firestorm Viewer Source Code
* Copyright (c) 2012 Ansariel Hiller @ Second Life
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation;
* version 2.1 of the License only.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* The Phoenix Firestorm Project, Inc., 1831 Oakwood Drive, Fairmont, Minnesota 56031-3225 USA
* http://www.firestormviewer.org
* $/LicenseInfo$
*/
#ifndef FS_FLOATERTELEPORTHISTORY_H
#define FS_FLOATERTELEPORTHISTORY_H
#include "llfloater.h"
class LLFilterEditor;
class LLTeleportHistoryPanel;
class FSFloaterTeleportHistory : public LLFloater
{
public:
FSFloaterTeleportHistory(const LLSD& seed);
virtual ~FSFloaterTeleportHistory();
BOOL postBuild();
void resetFilter();
private:
void onFilterEdit(const std::string& search_string, bool force_filter);
LLTeleportHistoryPanel* mHistoryPanel;
LLFilterEditor* mFilterEditor;
};
#endif // FS_FLOATERTELEPORTHISTORY_H
|
#include <stdlib.h>
#include <fcntl.h>
#include <unistd.h>
#include "libopalevents-1.0/libopalevents.h"
#include "test.h"
#include "test_fns.h"
int main(int argc, char *argv[])
{
TEST the_t = {
.name = "basic test",
.t = &test_parse_basic,
.cookie = (void *) -22,
.r = { "", "" },
.i = { "test_parse_000.raw" }
};
return test_main(the_t);
}
|
/*
* StarPU
* Copyright (C) Université Bordeaux 1, CNRS 2008-2010 (see AUTHORS file)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2.1 of the License, or (at
* your option) any later version.
*
* 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 Lesser General Public License in COPYING.LGPL for more details.
*/
#include <pthread.h>
#include <common/config.h>
#include <core/sched_policy.h>
#include <datawizard/datastats.h>
#include <common/fxt.h>
#include "copy_driver.h"
#include "memalloc.h"
static starpu_mem_node_descr descr;
static pthread_key_t memory_node_key;
void _starpu_init_memory_nodes(void)
{
/* there is no node yet, subsequent nodes will be
* added using _starpu_register_memory_node */
descr.nnodes = 0;
pthread_key_create(&memory_node_key, NULL);
unsigned i;
for (i = 0; i < STARPU_MAXNODES; i++)
descr.nodes[i] = STARPU_UNUSED;
_starpu_init_mem_chunk_lists();
_starpu_init_data_request_lists();
pthread_rwlock_init(&descr.conditions_rwlock, NULL);
descr.total_condition_count = 0;
}
void _starpu_deinit_memory_nodes(void)
{
_starpu_deinit_data_request_lists();
_starpu_deinit_mem_chunk_lists();
pthread_key_delete(memory_node_key);
}
void _starpu_set_local_memory_node_key(unsigned *node)
{
pthread_setspecific(memory_node_key, node);
}
unsigned _starpu_get_local_memory_node(void)
{
unsigned *memory_node;
memory_node = pthread_getspecific(memory_node_key);
/* in case this is called by the programmer, we assume the RAM node
is the appropriate memory node ... so we return 0 XXX */
if (STARPU_UNLIKELY(!memory_node))
return 0;
return *memory_node;
}
inline starpu_mem_node_descr *_starpu_get_memory_node_description(void)
{
return &descr;
}
inline starpu_node_kind _starpu_get_node_kind(uint32_t node)
{
return descr.nodes[node];
}
unsigned _starpu_get_memory_nodes_count(void)
{
return descr.nnodes;
}
unsigned _starpu_register_memory_node(starpu_node_kind kind)
{
unsigned nnodes;
/* ATOMIC_ADD returns the new value ... */
nnodes = STARPU_ATOMIC_ADD(&descr.nnodes, 1);
descr.nodes[nnodes-1] = kind;
STARPU_TRACE_NEW_MEM_NODE(nnodes-1);
/* for now, there is no condition associated to that newly created node */
descr.condition_count[nnodes-1] = 0;
return (nnodes-1);
}
/* TODO move in a more appropriate file !! */
/* Register a condition variable associated to worker which is associated to a
* memory node itself. */
void _starpu_memory_node_register_condition(pthread_cond_t *cond, pthread_mutex_t *mutex, unsigned nodeid)
{
unsigned cond_id;
unsigned nconds_total, nconds;
pthread_rwlock_wrlock(&descr.conditions_rwlock);
/* we only insert the queue if it's not already in the list */
nconds = descr.condition_count[nodeid];
for (cond_id = 0; cond_id < nconds; cond_id++)
{
if (descr.conditions_attached_to_node[nodeid][cond_id].cond == cond)
{
STARPU_ASSERT(descr.conditions_attached_to_node[nodeid][cond_id].mutex == mutex);
/* the condition is already in the list */
pthread_rwlock_unlock(&descr.conditions_rwlock);
return;
}
}
/* it was not found locally */
descr.conditions_attached_to_node[nodeid][cond_id].cond = cond;
descr.conditions_attached_to_node[nodeid][cond_id].mutex = mutex;
descr.condition_count[nodeid]++;
/* do we have to add it in the global list as well ? */
nconds_total = descr.total_condition_count;
for (cond_id = 0; cond_id < nconds_total; cond_id++)
{
if (descr.conditions_all[cond_id].cond == cond)
{
/* the queue is already in the global list */
pthread_rwlock_unlock(&descr.conditions_rwlock);
return;
}
}
/* it was not in the global list either */
descr.conditions_all[nconds_total].cond = cond;
descr.conditions_all[nconds_total].mutex = mutex;
descr.total_condition_count++;
pthread_rwlock_unlock(&descr.conditions_rwlock);
}
unsigned starpu_worker_get_memory_node(unsigned workerid)
{
struct starpu_worker_s *worker = _starpu_get_worker_struct(workerid);
return worker->memory_node;
}
|
/*
* Copyright 2012, valabau
*
* 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.
*
*
* thot-printer.h
*
* Created on: 15/03/2012
* Author: valabau
*/
#ifndef openlat_THOT_PRINTER_H_
#define openlat_THOT_PRINTER_H_
#include <fst/shortest-distance.h>
namespace openlat {
template<class Arc>
float ThotWeight(const typename Arc::Weight &weight) {
return -weight.Value();
}
template<class Arc>
typename Arc::StateId SwapStateId(const typename Arc::StateId id, const typename Arc::StateId id1, const typename Arc::StateId id2) {
if (id == id1) return id2;
else if (id == id2) return id1;
return id;
}
template<class Arc>
void PrintThot(const fst::Fst<Arc> &fst, std::ostream &out) {
typedef typename Arc::StateId StateId;
typedef typename Arc::Weight Weight;
out << "# Generated by openlat thot-printer\n";
for (fst::StateIterator<fst::Fst<Arc> > siter(fst); !siter.Done(); siter.Next()) {
if (fst.Final(siter.Value()) != Weight::Zero()) { out << siter.Value() << " "; }
}
out << "\n";
const fst::SymbolTable *syms = fst.InputSymbols();
// print first start state and replace state 0 with start id
StateId start = fst.Start();
StateId idzero = 0;
{
for (fst::ArcIterator< fst::Fst<Arc> > aiter(fst, start); !aiter.Done(); aiter.Next()) {
const Arc &arc = aiter.Value();
out << idzero << " " << SwapStateId<Arc>(arc.nextstate, idzero, start) << " " << ThotWeight<Arc>(arc.weight) << " ";
if (arc.ilabel == 0) {
out << "!NULL";
}
else if (syms != 0) {
out << syms->Find(arc.ilabel);
}
else {
out << arc.ilabel;
}
out << "\n";
}
}
for (fst::StateIterator<fst::Fst<Arc> > siter(fst); !siter.Done(); siter.Next()) {
if (siter.Value() != start) {
StateId s = SwapStateId<Arc>(siter.Value(), idzero, start);
for (fst::ArcIterator< fst::Fst<Arc> > aiter(fst, siter.Value()); !aiter.Done(); aiter.Next()) {
const Arc &arc = aiter.Value();
out << s << " " << SwapStateId<Arc>(arc.nextstate, idzero, start) << " " << ThotWeight<Arc>(arc.weight) << " ";
if (arc.ilabel == 0) {
out << "!NULL";
}
else if (syms != 0) {
out << syms->Find(arc.ilabel);
}
else {
out << arc.ilabel;
}
out << "\n";
}
}
}
}
template<class Arc>
void AddStartAndEndSymbols(fst::MutableFst<Arc> *fst, const char *start_symbol = 0, const char *end_symbol = 0) {
typedef typename Arc::StateId StateId;
typedef typename Arc::Weight Weight;
if (start_symbol == 0 and end_symbol == 0) return;
fst::SymbolTable *isyms = fst->MutableInputSymbols();
fst::SymbolTable *osyms = fst->MutableOutputSymbols();
if (start_symbol) {
typename Arc::Label istart = isyms->AddSymbol(start_symbol);
typename Arc::Label ostart = osyms->AddSymbol(start_symbol);
StateId old_start = fst->Start();
StateId new_start = fst->AddState();
fst->SetStart(new_start);
fst->AddArc(new_start, Arc(istart, ostart, Weight::One(), old_start));
}
if (end_symbol) {
typename Arc::Label iend = isyms->AddSymbol(end_symbol);
typename Arc::Label oend = osyms->AddSymbol(end_symbol);
StateId new_end = fst->AddState();
fst->SetFinal(new_end, Weight::One());
for (fst::StateIterator<fst::Fst<Arc> > siter(*fst); !siter.Done(); siter.Next()) {
StateId s = siter.Value();
if (fst->Final(s) != Weight::Zero()) {
fst->AddArc(s, Arc(iend, oend, fst->Final(s), new_end));
fst->SetFinal(s, Weight::Zero());
}
}
}
}
}
#endif /* openlat_THOT_PRINTER_H_ */
|
#ifndef LATTICELIBRARY_LINEARDISTANCETOCENTER_H
#define LATTICELIBRARY_LINEARDISTANCETOCENTER_H
#include "intensityworkset.h"
namespace LatticeLib {
/**
* Class for linear approximation of the distance, in the range \f$[-0.5,0.5]\f$, between an element center and the intersecting surface of a fuzzy object.
*/
template<class intensityTemplate>
class LinearDistanceToCenter : public DistanceToElementCenter {
public:
/**
* Implements DistanceToElementCenter::compute().
*
* Approximates the distance, in the range \f$[-0.5,0.5]\f$, between an element center and the intersecting surface of a fuzzy object by \f$distance = 0.5 - coverage\f$.
*
* Parameter | in/out | Comment
* :--------- | :------ | :-------
* inputImage | INPUT | %Image containing the specified element.
* elementIndex | INPUT | Element for which to compute the distance.
* labelIndex | INPUT | Label (band) index for the specified element.
*/
double compute(IntensityWorkset<intensityTemplate> inputImage, int elementIndex, int labelIndex) const {
double minValue = inputImage.getMinIntensity();
double maxValue = inputImage.getMaxIntensity();
double range = maxIntensity - minIntensity;
intensityTemplate intensity = MIN(maxValue, MAX(minValue, inputImage.getImage()(elementIndex, labelIndex)));
double coverage = (double(intensity) - minValue) / range;
double scaleFactor = cbrt(1 / inputImage.getImage().getDensity());
return (0.5 - coverage) * scaleFactor;
}
};
}
#endif //LATTICELIBRARY_LINEARDISTANCETOCENTER_H
|
/* SPDX-License-Identifier: LGPL-2.1-only */
/*
* Copyright (c) 2013 Sassano Systems LLC <joe@sassanosystems.com>
*/
#ifndef NETLINK_IDIAGNL_MEMINFO_H_
#define NETLINK_IDIAGNL_MEMINFO_H_
#include <netlink/netlink.h>
#ifdef __cplusplus
extern "C" {
#endif /* __cplusplus */
extern struct nl_object_ops idiagnl_meminfo_obj_ops;
extern struct idiagnl_meminfo *idiagnl_meminfo_alloc(void);
extern void idiagnl_meminfo_get(struct idiagnl_meminfo *);
extern void idiagnl_meminfo_put(struct idiagnl_meminfo *);
extern uint32_t idiagnl_meminfo_get_rmem(const struct idiagnl_meminfo *);
extern uint32_t idiagnl_meminfo_get_wmem(const struct idiagnl_meminfo *);
extern uint32_t idiagnl_meminfo_get_fmem(const struct idiagnl_meminfo *);
extern uint32_t idiagnl_meminfo_get_tmem(const struct idiagnl_meminfo *);
extern void idiagnl_meminfo_set_rmem(struct idiagnl_meminfo *, uint32_t);
extern void idiagnl_meminfo_set_wmem(struct idiagnl_meminfo *, uint32_t);
extern void idiagnl_meminfo_set_fmem(struct idiagnl_meminfo *, uint32_t);
extern void idiagnl_meminfo_set_tmem(struct idiagnl_meminfo *, uint32_t);
#ifdef __cplusplus
}
#endif /* __cplusplus */
#endif /* NETLINK_IDIAGNL_MEMINFO_H_ */
|
#ifndef FILE_WRITER_STREAM_H
#define FILE_WRITER_STREAM_H
#include "core/core_base.h"
#include "filestream.h"
class CORE_API FileWriterStream : public FileStream
{
public:
FileWriterStream(File& file);
protected:
// overrides
virtual void writeBytes(const void* pbuffer, int size);
};
#endif // FILE_WRITER_STREAM_H
|
/*
Copyright 2013-2021 Paul Colby
This file is part of QtAws.
QtAws is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
QtAws is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the QtAws. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QTAWS_ATTACHDISKRESPONSE_H
#define QTAWS_ATTACHDISKRESPONSE_H
#include "lightsailresponse.h"
#include "attachdiskrequest.h"
namespace QtAws {
namespace Lightsail {
class AttachDiskResponsePrivate;
class QTAWSLIGHTSAIL_EXPORT AttachDiskResponse : public LightsailResponse {
Q_OBJECT
public:
AttachDiskResponse(const AttachDiskRequest &request, QNetworkReply * const reply, QObject * const parent = 0);
virtual const AttachDiskRequest * request() const Q_DECL_OVERRIDE;
protected slots:
virtual void parseSuccess(QIODevice &response) Q_DECL_OVERRIDE;
private:
Q_DECLARE_PRIVATE(AttachDiskResponse)
Q_DISABLE_COPY(AttachDiskResponse)
};
} // namespace Lightsail
} // namespace QtAws
#endif
|
/*
* The libuna header wrapper
*
* Copyright (C) 2014-2022, Joachim Metz <joachim.metz@gmail.com>
*
* Refer to AUTHORS for acknowledgements.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 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 Lesser General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#if !defined( _LIBSIGSCAN_LIBUNA_H )
#define _LIBSIGSCAN_LIBUNA_H
#include <common.h>
/* Define HAVE_LOCAL_LIBUNA for local use of libuna
*/
#if defined( HAVE_LOCAL_LIBUNA )
#include <libuna_base16_stream.h>
#include <libuna_base32_stream.h>
#include <libuna_base64_stream.h>
#include <libuna_byte_stream.h>
#include <libuna_unicode_character.h>
#include <libuna_url_stream.h>
#include <libuna_utf16_stream.h>
#include <libuna_utf16_string.h>
#include <libuna_utf32_stream.h>
#include <libuna_utf32_string.h>
#include <libuna_utf7_stream.h>
#include <libuna_utf8_stream.h>
#include <libuna_utf8_string.h>
#include <libuna_types.h>
#else
/* If libtool DLL support is enabled set LIBUNA_DLL_IMPORT
* before including libuna.h
*/
#if defined( _WIN32 ) && defined( DLL_IMPORT )
#define LIBUNA_DLL_IMPORT
#endif
#include <libuna.h>
#endif /* defined( HAVE_LOCAL_LIBUNA ) */
#endif /* !defined( _LIBSIGSCAN_LIBUNA_H ) */
|
#pragma once
#include "ID3.h"
class ID3Handler
{
bool received = false;
ID3 id3Data;
public:
ID3Handler();
~ID3Handler();
void Receive(ID3 id3);
bool HasReceived();
ID3 GetID3data();
};
|
/* *\
** _____ __ _____ __ ____ **
** / ___/ / / /____/ / / / \ FieldKit **
** / ___/ /_/ /____/ / /__ / / / (c) 2009, field.io **
** /_/ /____/ /____/ /_____/ http://www.field.io **
\* */
/* created October 27, 2009 */
#ifndef CV_BLOB_DETECTOR_H
#define CV_BLOB_DETECTOR_H
#include <OpenCV/cvcompat.h>
#include "CVFrameProcessor.h"
#include "Blob.h"
namespace field
{
//
// OpenCV Blob Detector
//
class CVBlobDetector : public CVFrameProcessor
{
#pragma mark -- public --
public:
// ---------------------------------------------------------------------------------------
// Constants
// ---------------------------------------------------------------------------------------
enum Image {
IMAGE_INPUT,
IMAGE_INPUT_RESIZED,
IMAGE_SRC32F,
IMAGE_DST32F,
IMAGE_SRC8U,
IMAGE_DST8U,
IMAGE_BG
};
enum StageName { STAGE_INPUT,
STAGE_WARP,
STAGE_BACKGROUND,
STAGE_DIFFERENCE,
STAGE_THRESHOLD,
STAGE_DILATE,
STAGE_ERODE,
STAGE_CONTOUR,
STAGE_DETECTION,
STAGE_TRACKING,
STAGE_MAX
};
enum Mode { MODE_8U,
MODE_32F
};
// ---------------------------------------------------------------------------------------
// Public Methods
// ---------------------------------------------------------------------------------------
CVBlobDetector();
~CVBlobDetector();
int init();
int update(Camera *camera);
int deinit();
// getters
Blob** getBlobs();
int getBlobCount() { return blobCount; };
// setters
void setCameraSource(int source) { cameraSource = source; };
void setWarp(float sx1, float sy1,
float sx2, float sy2,
float sx3, float sy3,
float sx4, float sy4);
#pragma mark -- protected --
protected:
// ---------------------------------------------------------------------------------------
// Fields
// ---------------------------------------------------------------------------------------
int cameraSource;
// only used for drawing the blobs
CvFont font;
// references to the 8U or 32F image variants
// depends on the image mode
IplImage* srcImage;
IplImage* dstImage;
IplImage* srcImage8U;
IplImage* dstImage8U;
IplImage* srcImage32F;
IplImage* dstImage32F;
// image mode
Mode mode;
// warp
CvMat* warpMatrix;
bool warpEnabled;
// flags
bool doResetBackground;;
bool useAdaptiveTresholding;
// blobs, contours & finger
CvMemStorage *contourStorage;
CvSeq *contourFirst;
CvPoint center;
Blob **foundBlobs;
Blob **trackedBlobs;
int blobCount;
// ---------------------------------------------------------------------------------------
// Helper & Utiltiy Methods
// ---------------------------------------------------------------------------------------
// contours
void findContours();
void drawContours();
// blobs
void findBlobs();
void trackBlobs();
void drawBlobs(int stage, Blob* blobs[]);
// helpers
void setMode(Mode mode); // sets the image format during the analysis process
void swap();
#pragma mark -- private --
private:
int err;
};
};
#endif |
/**************************************************************************
Lightspark, a free flash player implementation
Copyright (C) 2009-2013 Alessandro Pignotti (a.pignotti@sssup.it)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
**************************************************************************/
#ifndef SCRIPTING_FLASH_MEDIA_PNGENCODEROPTIONS_H
#define SCRIPTING_FLASH_MEDIA_PNGENCODEROPTIONS_H 1
#include "asobject.h"
namespace lightspark
{
class PNGEncoderOptions: public ASObject
{
public:
PNGEncoderOptions(Class_base* c):ASObject(c){}
static void sinit(Class_base* c);
ASFUNCTION_ATOM(_constructor);
ASPROPERTY_GETTER_SETTER(bool, fastCompression);
};
}
#endif /* SCRIPTING_FLASH_MEDIA_PNGENCODEROPTIONS_H */
|
//
// Created by Kishor Rana on 07/01/2017.
//
#ifndef SYSCOMPILER_ARRAYNODE_H
#define SYSCOMPILER_ARRAYNODE_H
#include "../Node.h"
class ArrayNode: public Node {
public:
ArrayNode();
virtual ~ArrayNode();
bool parse(Parser &parser);
void accept(Visitor &visitor);
void print();
};
#endif //SYSCOMPILER_ARRAYNODE_H
|
// Created file "Lib\src\PortableDeviceGuids\guids"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(GUID_ACDC_POWER_SOURCE, 0x5d3e9a59, 0xe9d5, 0x4b00, 0xa6, 0xbd, 0xff, 0x34, 0xff, 0x51, 0x65, 0x48);
|
// Created file "Lib\src\wmcodecdspuuid\guids"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(PPM_PERFSTATES_DATA_GUID, 0x5708cc20, 0x7d40, 0x4bf4, 0xb4, 0xaa, 0x2b, 0x01, 0x33, 0x8d, 0x01, 0x26);
|
/**
* Meanwhile Protocol Plugin for Messages
* Adds Lotus Sametime support to Purple using the Apple Messages
*
* Copyright (C) 2012 Chris Parker <mrcsparker@gmail.com>
*
* SametimeServicePlugin is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* SametimeServicePlugin is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with SametimeServicePlugin. If not, see <http://www.gnu.org/licenses/>.
*/
#import <Foundation/Foundation.h>
#import <CoreFoundation/CFSocket.h>
#import <IMServicePlugIn/IMServicePlugIn.h>
#import <glib.h>
#include <mw_cipher.h>
#include <mw_common.h>
//#include <mw_error.h>
#include <mw_service.h>
#include <mw_session.h>
#include <mw_srvc_aware.h>
#include <mw_srvc_conf.h>
#include <mw_srvc_ft.h>
#include <mw_srvc_im.h>
#include <mw_srvc_place.h>
#include <mw_srvc_resolve.h>
#include <mw_srvc_store.h>
#include <mw_st_list.h>
struct MeanwhileClient
{
/** The actual meanwhile session */
struct mwSession *session;
/** Session handler */
struct mwSessionHandler sessionHandler;
/** Aware service */
struct mwServiceAware *serviceAware;
/** Aware handler */
struct mwAwareHandler awareHandler;
/** Aware List Handler */
struct mwAwareListHandler awareListHandler;
/** The aware list */
struct mwAwareList *awareList;
/** Aware service */
struct mwServiceIm *serviceIm;
/** Aware handler */
struct mwImHandler imHandler;
/** Resolve service */
struct mwServiceResolve *serviceResolve;
/** Storage service, for contact list */
struct mwServiceStorage *serviceStorage;
/** The socket connecting to the server */
CFSocketRef sock;
void *application;
};
@interface SametimeServicePlugin : NSObject <
IMServicePlugIn,
IMServicePlugInChatRoomSupport,
IMServicePlugInGroupListSupport,
IMServicePlugInInstantMessagingSupport,
IMServicePlugInPresenceSupport>
{
struct MeanwhileClient *client;
}
@property (assign) id <
IMServiceApplication,
IMServiceApplicationChatRoomSupport,
IMServiceApplicationGroupListSupport,
IMServiceApplicationInstantMessagingSupport> application;
@property (retain) NSDictionary *accountSettings;
@end
|
/*
Copyright 2013-2021 Paul Colby
This file is part of QtAws.
QtAws is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
QtAws is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the QtAws. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QTAWS_DELETEDISCOVERERREQUEST_H
#define QTAWS_DELETEDISCOVERERREQUEST_H
#include "schemasrequest.h"
namespace QtAws {
namespace Schemas {
class DeleteDiscovererRequestPrivate;
class QTAWSSCHEMAS_EXPORT DeleteDiscovererRequest : public SchemasRequest {
public:
DeleteDiscovererRequest(const DeleteDiscovererRequest &other);
DeleteDiscovererRequest();
virtual bool isValid() const Q_DECL_OVERRIDE;
protected:
virtual QtAws::Core::AwsAbstractResponse * response(QNetworkReply * const reply) const Q_DECL_OVERRIDE;
private:
Q_DECLARE_PRIVATE(DeleteDiscovererRequest)
};
} // namespace Schemas
} // namespace QtAws
#endif
|
/********************************************************************************
**
** Copyright (C) 2016-2021 Pavel Pavlov.
**
**
** This file is part of SprintTimer.
**
** SprintTimer is free software: you can redistribute it and/or modify
** it under the terms of the GNU Lesser General Public License as published by
** the Free Software Foundation, either version 3 of the License, or
** (at your option) any later version.
**
** SprintTimer is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
** GNU Lesser General Public License for more details.
**
** You should have received a copy of the GNU Lesser General Public License
** along with SprintTimer. If not, see <http://www.gnu.org/licenses/>.
**
*********************************************************************************/
#include "core/DataExporter.h"
#include "gmock/gmock.h"
namespace mocks {
template <typename T>
class DataExporterMock : public sprint_timer::DataExporter<T> {
public:
MOCK_METHOD(void,
exportData,
(const std::vector<T>&,
sprint_timer::DataFormat,
sprint_timer::SinkType),
(override));
};
} // namespace mocks
|
/**********************************************************
DO NOT EDIT
This file was generated from stone specification "team"
www.prokarpaty.net
***********************************************************/
#pragma once
#include "dropbox/endpoint/ApiUtil.h"
namespace dropboxQt{
namespace team{
class MembersListContinueArg{
/**
field: cursor: Indicates from what point to get the next set of
members.
*/
public:
MembersListContinueArg(){};
MembersListContinueArg(const QString& arg){ m_cursor = arg; };
public:
/**
Indicates from what point to get the next set of members.
*/
QString cursor()const{return m_cursor;};
MembersListContinueArg& setCursor(const QString& arg){m_cursor=arg;return *this;};
public:
operator QJsonObject ()const;
virtual void fromJson(const QJsonObject& js);
virtual void toJson(QJsonObject& js)const;
virtual QString toString(bool multiline = true)const;
class factory{
public:
static std::unique_ptr<MembersListContinueArg> create(const QByteArray& data);
static std::unique_ptr<MembersListContinueArg> create(const QJsonObject& js);
};
protected:
/**
Indicates from what point to get the next set of members.
*/
QString m_cursor;
};//MembersListContinueArg
}//team
}//dropboxQt
|
/*
* Copyright (c) 2001-2004 Swedish Institute of Computer Science.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*
* This file is part of the lwIP TCP/IP stack.
*/
/*
* This is the interface to the platform specific serial IO module
* It needs to be implemented by those platforms which need SLIP or PPP
*/
#ifndef __SIO_H__
#define __SIO_H__
#include "lwip/arch.h"
#ifdef __cplusplus
extern "C" {
#endif
/* If you want to define sio_fd_t elsewhere or differently,
define this in your cc.h file. */
#ifndef __sio_fd_t_defined
typedef void *sio_fd_t;
#endif
/* The following functions can be defined to something else in your cc.h file
or be implemented in your custom sio.c file. */
#ifndef sio_open
/**
* Opens a serial device for communication.
*
* @param devnum device number
* @return handle to serial device if successful, NULL otherwise
*/
sio_fd_t sio_open(uint8_t devnum);
#endif
#ifndef sio_send
/**
* Sends a single character to the serial device.
*
* @param c character to send
* @param fd serial device handle
*
* @note This function will block until the character can be sent.
*/
void sio_send(uint8_t c, sio_fd_t fd);
#endif
#ifndef sio_recv
/**
* Receives a single character from the serial device.
*
* @param fd serial device handle
*
* @note This function will block until a character is received.
*/
uint8_t sio_recv(sio_fd_t fd);
#endif
#ifndef sio_read
/**
* Reads from the serial device.
*
* @param fd serial device handle
* @param data pointer to data buffer for receiving
* @param len maximum length (in bytes) of data to receive
* @return number of bytes actually received - may be 0 if aborted by sio_read_abort
*
* @note This function will block until data can be received. The blocking
* can be cancelled by calling sio_read_abort().
*/
uint32_t sio_read(sio_fd_t fd, uint8_t *data, uint32_t len);
#endif
#ifndef sio_tryread
/**
* Tries to read from the serial device. Same as sio_read but returns
* immediately if no data is available and never blocks.
*
* @param fd serial device handle
* @param data pointer to data buffer for receiving
* @param len maximum length (in bytes) of data to receive
* @return number of bytes actually received
*/
uint32_t sio_tryread(sio_fd_t fd, uint8_t *data, uint32_t len);
#endif
#ifndef sio_write
/**
* Writes to the serial device.
*
* @param fd serial device handle
* @param data pointer to data to send
* @param len length (in bytes) of data to send
* @return number of bytes actually sent
*
* @note This function will block until all data can be sent.
*/
uint32_t sio_write(sio_fd_t fd, uint8_t *data, uint32_t len);
#endif
#ifndef sio_read_abort
/**
* Aborts a blocking sio_read() call.
*
* @param fd serial device handle
*/
void sio_read_abort(sio_fd_t fd);
#endif
#ifdef __cplusplus
}
#endif
#endif /* __SIO_H__ */
|
#ifndef __k3dTimer_h__
#define __k3dTimer_h__
#pragma once
namespace k3d {
class K3D_API Timer {
public:
enum Precision
{
NanoSecond,
MicroSecond
};
explicit Timer(Precision precision = MicroSecond);
~Timer();
void ResetTimer();
int64 MicrosecElapsed();
void BeginTimer();
int64 EndTimer();
float GetFrameRate() { return m_FrameRate; }
void Update();
void EnableTimer(bool enable);
Timer* CreateNewTimer();
private:
static const int CMAX_PREFRAMES = 60;
Precision m_Precision;
int m_TimerId;
std::function<void()> TimerFunction;
uint64 m_BaseTime;
uint64 m_LastTime;
uint64 m_OffSetTime;
uint64 m_CurrentTime;
uint64 m_PreFrameTime[CMAX_PREFRAMES];
float m_FrameRate;
bool m_Enabled;
};
}
#endif
|
/*****************************************************************************
Copyright (c) 2010, Intel Corp.
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 Intel 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.
******************************************************************************
* Contents: Native high-level C interface to LAPACK function ctzrzf
* Author: Intel Corporation
* Generated October, 2010
*****************************************************************************/
#include "lapacke.h"
#include "lapacke_utils.h"
lapack_int LAPACKE_ctzrzf( int matrix_order, lapack_int m, lapack_int n,
lapack_complex_float* a, lapack_int lda,
lapack_complex_float* tau )
{
lapack_int info = 0;
lapack_int lwork = -1;
lapack_complex_float* work = NULL;
lapack_complex_float work_query;
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
LAPACKE_xerbla( "LAPACKE_ctzrzf", -1 );
return -1;
}
#ifndef LAPACK_DISABLE_NAN_CHECK
/* Optionally check input matrices for NaNs */
if( LAPACKE_cge_nancheck( matrix_order, m, n, a, lda ) ) {
return -4;
}
#endif
/* Query optimal working array(s) size */
info = LAPACKE_ctzrzf_work( matrix_order, m, n, a, lda, tau, &work_query,
lwork );
if( info != 0 ) {
goto exit_level_0;
}
lwork = LAPACK_C2INT( work_query );
/* Allocate memory for work arrays */
work = (lapack_complex_float*)
LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
if( work == NULL ) {
info = LAPACK_WORK_MEMORY_ERROR;
goto exit_level_0;
}
/* Call middle-level interface */
info = LAPACKE_ctzrzf_work( matrix_order, m, n, a, lda, tau, work, lwork );
/* Release memory and exit */
LAPACKE_free( work );
exit_level_0:
if( info == LAPACK_WORK_MEMORY_ERROR ) {
LAPACKE_xerbla( "LAPACKE_ctzrzf", info );
}
return info;
}
|
/*
Copyright 2013-2021 Paul Colby
This file is part of QtAws.
QtAws is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
QtAws is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the QtAws. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QTAWS_UPDATECONFIGURATIONTEMPLATEREQUEST_P_H
#define QTAWS_UPDATECONFIGURATIONTEMPLATEREQUEST_P_H
#include "elasticbeanstalkrequest_p.h"
#include "updateconfigurationtemplaterequest.h"
namespace QtAws {
namespace ElasticBeanstalk {
class UpdateConfigurationTemplateRequest;
class UpdateConfigurationTemplateRequestPrivate : public ElasticBeanstalkRequestPrivate {
public:
UpdateConfigurationTemplateRequestPrivate(const ElasticBeanstalkRequest::Action action,
UpdateConfigurationTemplateRequest * const q);
UpdateConfigurationTemplateRequestPrivate(const UpdateConfigurationTemplateRequestPrivate &other,
UpdateConfigurationTemplateRequest * const q);
private:
Q_DECLARE_PUBLIC(UpdateConfigurationTemplateRequest)
};
} // namespace ElasticBeanstalk
} // namespace QtAws
#endif
|
/*
RExOS - embedded RTOS
Copyright (c) 2011-2019, RExOS team
All rights reserved.
author: Alexey E. Kramarenko (alexeyk13@yandex.ru)
*/
#include "wavegen.h"
#if (WAVEGEN_SINE)
static inline void wave_gen_sine(SAMPLE* buf, unsigned int cnt, SAMPLE amplitude)
{
#error Not implemented
}
#endif //WAVEGEN_SINE
#if (WAVEGEN_TRIANGLE)
static inline void wave_gen_triangle(SAMPLE* buf, unsigned int cnt, SAMPLE amplitude)
{
int i;
for (i = 0; i < (cnt >> 1); ++i)
buf[i] = buf[cnt - i - 1] = (((amplitude * i) << 2) + 1) >> 1;
buf[cnt << 1] = amplitude;
}
#endif //WAVEGEN_TRIANGLE
#if (WAVEGEN_SQUARE)
static inline void wave_gen_square(SAMPLE* buf, unsigned int cnt, SAMPLE amplitude)
{
int i;
for (i = 0; i < (cnt >> 1); ++i)
{
buf[i] = 0;
buf[cnt - i - 1] = amplitude;
}
buf[cnt << 1] = amplitude;
}
#endif //WAVEGEN_SQUARE
void wave_gen(SAMPLE* buf, unsigned int cnt, DAC_WAVE_TYPE wave_type, SAMPLE amplitude)
{
switch (wave_type)
{
#if (WAVEGEN_SINE)
case DAC_WAVE_SINE:
wave_gen_sine(buf, cnt, amplitude);
break;
#endif //WAVEGEN_SINE
#if (WAVEGEN_TRIANGLE)
case DAC_WAVE_TRIANGLE:
wave_gen_triangle(buf, cnt, amplitude);
break;
#endif //WAVEGEN_TRIANGLE
#if (WAVEGEN_SQUARE)
case DAC_WAVE_SQUARE:
wave_gen_square(buf, cnt, amplitude);
break;
#endif //WAVEGEN_SQUARE
default:
error(ERROR_NOT_SUPPORTED);
}
}
|
// Created file "Lib\src\Uuid\propkeys"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(PKEY_Document_ByteCount, 0xd5cdd502, 0x2e9c, 0x101b, 0x93, 0x97, 0x08, 0x00, 0x2b, 0x2c, 0xf9, 0xae);
|
/*
Copyright 2013-2021 Paul Colby
This file is part of QtAws.
QtAws is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
QtAws is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the QtAws. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QTAWS_DISABLERULERESPONSE_P_H
#define QTAWS_DISABLERULERESPONSE_P_H
#include "cloudwatcheventsresponse_p.h"
namespace QtAws {
namespace CloudWatchEvents {
class DisableRuleResponse;
class DisableRuleResponsePrivate : public CloudWatchEventsResponsePrivate {
public:
explicit DisableRuleResponsePrivate(DisableRuleResponse * const q);
void parseDisableRuleResponse(QXmlStreamReader &xml);
private:
Q_DECLARE_PUBLIC(DisableRuleResponse)
Q_DISABLE_COPY(DisableRuleResponsePrivate)
};
} // namespace CloudWatchEvents
} // namespace QtAws
#endif
|
// Created file "Lib\src\sensorsapi\sensorsapi"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(SENSOR_DATA_TYPE_ORIENTATION_GUID, 0x1637d8a2, 0x4248, 0x4275, 0x86, 0x5d, 0x55, 0x8d, 0xe8, 0x4a, 0xed, 0xfd);
|
#pragma once
#include "IMediaType.h"
#include "topo.h"
topo_API IMediaType *createWaveFormat(IMediaType::Type type,
const IMediaType::WaveFormat &detail);
topo_API IMediaType *createVideoInfo(IMediaType::Type type,
const IMediaType::VideoInfo &detail);
topo_API IMediaType *createVideoCodec(IMediaType::Type type,
const IMediaType::VideoCodec &detail);
|
/****************************************************************************************************************/
/* */
/* OpenNN: Open Neural Networks Library
*/
/* www.intelnics.com/opennn
*/
/* */
/* M E A N S Q U A R E D E R R O R T E S T C L A S S H E A D E R
*/
/* */
/* Roberto Lopez
*/
/* Intelnics - The artificial intelligence company
*/
/* robertolopez@intelnics.com
*/
/* */
/****************************************************************************************************************/
#ifndef __MEANSQUAREDERRORTEST_H__
#define __MEANSQUAREDERRORTEST_H__
// Unit testing includes
#include "unit_testing.h"
using namespace OpenNN;
class MeanSquaredErrorTest : public UnitTesting {
#define STRING(x) #x
#define TOSTRING(x) STRING(x)
#define LOG __FILE__ ":" TOSTRING(__LINE__) "\n"
public:
// GENERAL CONSTRUCTOR
explicit MeanSquaredErrorTest(void);
// DESTRUCTOR
virtual ~MeanSquaredErrorTest(void);
// METHODS
// Constructor and destructor methods
void test_constructor(void);
void test_destructor(void);
// Get methods
// Set methods
// Objective methods
void test_calculate_performance(void);
void test_calculate_generalization_performance(void);
void test_calculate_gradient(void);
void test_calculate_Hessian(void);
// Objective terms methods
void test_calculate_performance_terms(void);
void test_calculate_Jacobian_terms(void);
// Serialization methods
void test_to_XML(void);
void test_from_XML(void);
// Unit testing methods
void run_test_case(void);
};
#endif
// OpenNN: Open Neural Networks Library.
// Copyright (C) 2005-2014 Roberto Lopez
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
#include <stdio.h>
int gcd( int a , int b){
if(a == 0)
return b;
if( b==0)
return a;
return gcd( b, a % b);
}//gcd(int, int)
int main(){
int a = 20;
int b = 100;
int result = gcd(a,b);
printf("%d\n",result);
printf("%d\n",sizeof(int));
return 0;
}
|
// Created file "Lib\src\mfuuid\X64\guids"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(MFT_PROCESS_LOCAL_Attribute, 0x543186e4, 0x4649, 0x4e65, 0xb5, 0x88, 0x4a, 0xa3, 0x52, 0xaf, 0xf3, 0x79);
|
// Created file "Lib\src\Uuid\X64\propkeys"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(PKEY_PropList_FileOperationPrompt, 0xc9944a21, 0xa406, 0x48fe, 0x82, 0x25, 0xae, 0xc7, 0xe2, 0x4c, 0x21, 0x1b);
|
// Created file "Lib\src\Svcguid\iid"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(IID_IServiceThreadPoolConfig, 0x186d89bc, 0xf277, 0x4bcc, 0x80, 0xd5, 0x4d, 0xf7, 0xb8, 0x36, 0xef, 0x4a);
|
/*
Copyright (C) 2007 <SWGEmu>
This File is part of Core3.
This program is free software; you can redistribute
it and/or modify it under the terms of the GNU Lesser
General Public License as published by the Free Software
Foundation; either version 2 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 Lesser General Public License for
more details.
You should have received a copy of the GNU Lesser General
Public License along with this program; if not, write to
the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Linking Engine3 statically or dynamically with other modules
is making a combined work based on Engine3.
Thus, the terms and conditions of the GNU Lesser General Public License
cover the whole combination.
In addition, as a special exception, the copyright holders of Engine3
give you permission to combine Engine3 program with free software
programs or libraries that are released under the GNU LGPL and with
code included in the standard release of Core3 under the GNU LGPL
license (or modified versions of such code, with unchanged license).
You may copy and distribute such a system following the terms of the
GNU LGPL for Engine3 and the licenses of the other code concerned,
provided that you include the source code of that other code when
and as the GNU LGPL requires distribution of source code.
Note that people who make modified versions of Engine3 are not obligated
to grant this special exception for their modified versions;
it is their choice whether to do so. The GNU Lesser General Public License
gives permission to release a modified version without this exception;
this exception also makes it possible to release a modified version
which carries forward this exception.
*/
#ifndef CHATPERSISTENTMESSAGETOCLIENT_H_
#define CHATPERSISTENTMESSAGETOCLIENT_H_
//Mail defaults status to N (new) and current time
#include "engine/engine.h"
class ChatPersistentMessageToClient : public BaseMessage {
public:
ChatPersistentMessageToClient(const String& sender, uint32 mailid, uint8 type, UnicodeString& subject
, UnicodeString& body, uint32 timestamp = 0, char status = 'N') : BaseMessage() {
insertShort(0x02);
insertInt(0x08485E17); // CRC
insertAscii(sender.toCharArray());
insertAscii("SWG");
insertAscii(""); //galaxy
insertInt(mailid);
insertByte(type);
if (type == 0x00)
insertUnicode(body);
else
insertInt(0);
insertUnicode(subject);
insertInt(0); //sequence?
insertByte(status); // status 'N' 'U' or 'R'
if (timestamp == 0) {
Time systemTime;
timestamp = systemTime.getMiliTime() / 1000;
}
insertInt(timestamp);
insertInt(0x00);
}
};
#endif /*CHATPERSISTENTMESSAGETOCLIENT_H_*/
|
/* Copyright (C) 2014 David Zanetti
*
* This file is part of libkakapo.
*
* libkakapo is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3 of the
* License.
*
* libkakapo is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with libkapapo.
*
* If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef KAKAPO_H_INCLUDED
#define KAKAPO_H_INCLUDED
#ifdef __cplusplus
extern "C" {
#endif
/** \file
* \brief Various functions related to the Kakapo development board.
*
* This contains various useful setup functions and other interfaces
* specific to the Kakapo dev board.
*
* These functions are not required for other boards, but you may wish
* to use a similar initalisation method.
*/
/** \brief Initalise Kakapo hardware
*
* Applies the following configuration:
* - System clock set up to match F_CPU if set to 2MHz or 32MHz.
* - Internal RC oscilators use DFLL off watch crystal for stablity.
* - Pins PE2 and PE3 (which have LEDs) are set as outputs.
* - Enables all interrupt levels and global interrupt flag.
*/
void kakapo_init(void);
#ifdef __cplusplus
}
#endif
#endif // KAKAPO_H_INCLUDED
|
#include <QtSql>
#include <string>
#include <poppler/qt4/poppler-qt4.h>
#include<config.h>
#include<dialoginfo.h>
#ifndef LOGIC_H
#define LOGIC_H
class Connection : public QSqlDatabase{
private:
QString login;
QString password;
DialogInfo *dialoginfo;
public:
QByteArray file;
QSqlDatabase db;
Connection(QByteArray & ba, int &nr, const Config &knf);
Connection();
QSqlDatabase getDb();
QSqlQuery query;
QString response;
QStringList responses;
int id;
QStringList writeL();
int strona;
QByteArray getFile();
};
#endif // LOGIC_H
|
//============================================================================
// I B E X
// File : ibex_CtcEmpty.h
// Author : Gilles Chabert
// Copyright : IMT Atlantique (France)
// License : See the LICENSE file
// Created : May 14, 2012
// Last Update : May 14, 2012
//============================================================================
#ifndef __IBEX_CTC_EMPTY_H__
#define __IBEX_CTC_EMPTY_H__
#include "ibex_Ctc.h"
#include "ibex_Pdc.h"
#include "ibex_PdcYes.h"
namespace ibex {
/**
* \ingroup contractor
*
* \brief Empty contractor
*
* This contractor contracts any box to the empty box (and
* raises an EmptyBoxException) iff the predicate returns
* YES on this box. Otherwise, nothing happens.
*
*/
class CtcEmpty : public Ctc {
public:
/**
* \brief Build the contractor for n-dimentional box.
*/
CtcEmpty(int n);
/**
* \brief Build the contractor for the predicate \a pdc.
*/
CtcEmpty(Pdc& pdc, bool own=false);
/**
* \brief Contract a box.
*/
void contract(IntervalVector& box);
/**
* \brief Contract a box.
*/
virtual void contract(IntervalVector& box, ContractContext& context);
/**
* \brief Delete this.
*/
~CtcEmpty();
/**
* \brief The predicate.
*/
Pdc& pdc;
private:
bool own_pdc;
};
} // end namespace ibex
#endif // __IBEX_CTC_EMPTY_H__
|
/*
** $Id: lmem.h,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
** Interface to Memory Manager
** See Copyright Notice in lua.h
*/
#ifndef lmem_h
#define lmem_h
#include <stddef.h>
#include "llimits.h"
#include "lua.h"
#define MEMERRMSG "not enough memory"
NAMESPACE_LUA_BEGIN
#define luaM_reallocv(L,b,on,n,e) \
((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ? /* +1 to avoid warnings */ \
luaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \
luaM_toobig(L))
#define luaM_freemem(L, b, s) luaM_realloc_(L, (b), (s), 0)
#define luaM_free(L, b) luaM_realloc_(L, (b), sizeof(*(b)), 0)
#define luaM_freearray(L, b, n, t) luaM_reallocv(L, (b), n, 0, sizeof(t))
#define luaM_malloc(L,t) luaM_realloc_(L, NULL, 0, (t))
#define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t)))
#define luaM_newvector(L,n,t) \
cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
#define luaM_growvector(L,v,nelems,size,t,limit,e) \
if ((nelems)+1 > (size)) \
((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
#define luaM_reallocvector(L, v,oldn,n,t) \
((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
size_t size);
LUAI_FUNC void *luaM_toobig (lua_State *L);
LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
size_t size_elem, int limit,
const char *errormsg);
#if LUA_MEMORY_STATS
#ifdef _DEBUG
#define luaM_setname(L, name) \
(L)->allocName = (name)
#define luaM_setnameif(L, name) \
if (!(L)->allocName) (L)->allocName = (name)
#else /* !_DEBUG */
#define luaM_setname(L, name)
#define luaM_setnameif(L, name)
#endif /* _DEBUG */
#endif /* LUA_MEMORY_STATS */
NAMESPACE_LUA_END
#endif
|
#pragma once
#include "arrayvar.h"
class ArrayElement :
public ArrayVar
{
public:
ArrayElement(void);
~ArrayElement(void);
string cout_AddressCode(int mem_address, string reg);
int reserveMemoryBlock();
};
|
/*
* The internal libcerror header
*
* Copyright (C) 2008-2015, Joachim Metz <joachim.metz@gmail.com>
*
* Refer to AUTHORS for acknowledgements.
*
* This software is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This software 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 Lesser General Public License
* along with this software. If not, see <http://www.gnu.org/licenses/>.
*/
#if !defined( _PYOLECF_LIBCERROR_H )
#define _PYOLECF_LIBCERROR_H
#include <common.h>
/* Define HAVE_LOCAL_LIBCERROR for local use of libcerror
*/
#if defined( HAVE_LOCAL_LIBCERROR )
#include <libcerror_definitions.h>
#include <libcerror_error.h>
#include <libcerror_system.h>
#include <libcerror_types.h>
#else
/* If libtool DLL support is enabled set LIBCERROR_DLL_IMPORT
* before including libcerror.h
*/
#if defined( _WIN32 ) && defined( DLL_IMPORT )
#define LIBCERROR_DLL_IMPORT
#endif
#include <libcerror.h>
#endif
#endif
|
#pragma once
#include "PicosElement.h"
#include <vector>
#include "types.h"
#include "StructDefinitions.h"
// function [picos,pol]=polarityanalysis(picos) MATLAB
// Note that the argument picos is passed in and then returned, which implies this function
// will modify this argument. In C++, no need to be so tedious. Just pass the argument by
// reference and the function can make change to it naturally.
// pol in MATLAB will be returned
int polarityanalysis(PicosStructArray& picos);
|
/*
* Copyright (C) 2008-2011 Nicolas Bourdaud <nicolas.bourdaud@gmail.com>
* Copyright (C) 2018-2020 Mindmaze Holdings SA
*
* This file is part of the rtfilter library
*
* The rtfilter library is free software: you can redistribute it and/or
* modify it under the terms of the version 3 of the GNU Lesser General
* Public License as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef COMMON_FILTERS_H
#define COMMON_FILTERS_H
#warning "This header has been deprecated, and will be removed in a subsequent\
rtfilter release. Please only include <rtfilter.h>."
#include <rtfilter.h>
#endif /* COMMON_FILTERS_H */
|
/*
Copyright 2013-2021 Paul Colby
This file is part of QtAws.
QtAws is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
QtAws is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the QtAws. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QTAWS_LISTTAGSFORRESOURCERESPONSE_H
#define QTAWS_LISTTAGSFORRESOURCERESPONSE_H
#include "efsresponse.h"
#include "listtagsforresourcerequest.h"
namespace QtAws {
namespace EFS {
class ListTagsForResourceResponsePrivate;
class QTAWSEFS_EXPORT ListTagsForResourceResponse : public EfsResponse {
Q_OBJECT
public:
ListTagsForResourceResponse(const ListTagsForResourceRequest &request, QNetworkReply * const reply, QObject * const parent = 0);
virtual const ListTagsForResourceRequest * request() const Q_DECL_OVERRIDE;
protected slots:
virtual void parseSuccess(QIODevice &response) Q_DECL_OVERRIDE;
private:
Q_DECLARE_PRIVATE(ListTagsForResourceResponse)
Q_DISABLE_COPY(ListTagsForResourceResponse)
};
} // namespace EFS
} // namespace QtAws
#endif
|
//{{NO_DEPENDENCIES}}
// Microsoft Visual C++ generated include file.
// Used by VirtualAutorunDisabler.rc
//
#define IDS_PROJNAME 100
#define IDR_VIRTUALAUTORUNDISABLER 101
#define IDR_VIRTUALAUTORUNDISABLINGMONITOR 102
// Next default values for new objects
//
#ifdef APSTUDIO_INVOKED
#ifndef APSTUDIO_READONLY_SYMBOLS
#define _APS_NEXT_RESOURCE_VALUE 201
#define _APS_NEXT_COMMAND_VALUE 32768
#define _APS_NEXT_CONTROL_VALUE 201
#define _APS_NEXT_SYMED_VALUE 103
#endif
#endif
|
/*
Copyright 2013-2021 Paul Colby
This file is part of QtAws.
QtAws is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
QtAws is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the QtAws. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QTAWS_SEARCHADDRESSBOOKSREQUEST_H
#define QTAWS_SEARCHADDRESSBOOKSREQUEST_H
#include "alexaforbusinessrequest.h"
namespace QtAws {
namespace AlexaForBusiness {
class SearchAddressBooksRequestPrivate;
class QTAWSALEXAFORBUSINESS_EXPORT SearchAddressBooksRequest : public AlexaForBusinessRequest {
public:
SearchAddressBooksRequest(const SearchAddressBooksRequest &other);
SearchAddressBooksRequest();
virtual bool isValid() const Q_DECL_OVERRIDE;
protected:
virtual QtAws::Core::AwsAbstractResponse * response(QNetworkReply * const reply) const Q_DECL_OVERRIDE;
private:
Q_DECLARE_PRIVATE(SearchAddressBooksRequest)
};
} // namespace AlexaForBusiness
} // namespace QtAws
#endif
|
// Created file "Lib\src\Uuid\X64\imapi2uuid"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(LIBID_IMAPI2, 0x2735412f, 0x7f64, 0x5b0f, 0x8f, 0x00, 0x5d, 0x77, 0xaf, 0xbe, 0x26, 0x1e);
|
// Copyright (c) 2009 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// 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 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
//
// Author(s) : Manuel Caroli <Manuel.Caroli@sophia.inria.fr>
#ifndef CGAL_PERIODIC_3_TRIANGULATION_REMOVE_TRAITS_3_H
#define CGAL_PERIODIC_3_TRIANGULATION_REMOVE_TRAITS_3_H
#include <CGAL/basic.h>
#include <CGAL/triangulation_assertions.h>
#include <CGAL/Periodic_3_offset_3.h>
namespace CGAL {
template < class Traits_, class Predicate_ >
class Point_offset_adaptor {
typedef Traits_ Traits;
typedef Predicate_ Predicate;
typedef typename Traits::Point_3 Point;
public:
typedef typename Predicate::result_type result_type;
Point_offset_adaptor(const Predicate & pred) : _pred(pred) {}
result_type operator()(const Point& p0, const Point& p1) const {
return _pred(p0.first, p1.first,
p0.second, p1.second);
}
result_type operator()(const Point& p0, const Point& p1,
const Point& p2) const {
return _pred(p0.first, p1.first, p2.first,
p0.second, p1.second, p2.second);
}
result_type operator()(const Point& p0, const Point& p1,
const Point& p2, const Point& p3) const {
return _pred(p0.first, p1.first, p2.first, p3.first,
p0.second, p1.second, p2.second, p3.second);
}
result_type operator()(const Point& p0, const Point& p1,
const Point& p2, const Point& p3, const Point& p4) const {
return _pred(p0.first, p1.first, p2.first, p3.first, p4.first,
p0.second, p1.second, p2.second, p3.second, p4.second);
}
private:
Predicate _pred;
};
template < class P3DTTraits, class Off = typename CGAL::Periodic_3_offset_3 >
class Periodic_3_triangulation_remove_traits_3 : public P3DTTraits::K
{
public:
typedef P3DTTraits PT;
typedef typename P3DTTraits::K Base;
typedef Off Offset;
typedef Periodic_3_triangulation_remove_traits_3< PT,Offset > Self;
typedef typename PT::RT RT;
typedef typename PT::FT FT;
typedef typename PT::Point_3 Bare_point;
typedef std::pair<Bare_point,Offset> Point_3;
typedef typename PT::Iso_cuboid_3 Iso_cuboid_3;
Periodic_3_triangulation_remove_traits_3(const Iso_cuboid_3& domain)
: _pt() {
_pt.set_domain(domain);
}
// Triangulation traits
typedef Point_offset_adaptor<Self, typename PT::Compare_xyz_3>
Compare_xyz_3;
typedef Point_offset_adaptor<Self, typename PT::Coplanar_orientation_3>
Coplanar_orientation_3;
typedef Point_offset_adaptor<Self, typename PT::Orientation_3>
Orientation_3;
// Delaunay Triangulation traits
typedef Point_offset_adaptor<Self,
typename PT::Coplanar_side_of_bounded_circle_3>
Coplanar_side_of_bounded_circle_3;
typedef Point_offset_adaptor<Self, typename PT::Side_of_oriented_sphere_3>
Side_of_oriented_sphere_3;
typedef Point_offset_adaptor<Self, typename PT::Compare_distance_3>
Compare_distance_3;
// Operations
Compare_xyz_3
compare_xyz_3_object() const {
return Compare_xyz_3(_pt.compare_xyz_3_object());
}
Coplanar_orientation_3
coplanar_orientation_3_object() const {
return Coplanar_orientation_3(_pt.coplanar_orientation_3_object());
}
Orientation_3
orientation_3_object() const {
return Orientation_3(_pt.orientation_3_object());
}
Coplanar_side_of_bounded_circle_3
coplanar_side_of_bounded_circle_3_object() const {
return Coplanar_side_of_bounded_circle_3(_pt.coplanar_side_of_bounded_circle_3_object());
}
Side_of_oriented_sphere_3
side_of_oriented_sphere_3_object() const {
return Side_of_oriented_sphere_3(_pt.side_of_oriented_sphere_3_object());
}
Compare_distance_3
compare_distance_3_object() const {
return Compare_distance_3(_pt.compare_distance_3_object());
}
public:
PT _pt;
};
} //namespace CGAL
#endif // CGAL_PERIODIC_3_TRIANGULATION_REMOVE_TRAITS_3_H
|
/****
* Sming Framework Project - Open Source framework for high efficiency native ESP8266 development.
* Created 2015 by Skurydin Alexey
* http://github.com/SmingHub/Sming
* All files of the Sming Core are provided under the LGPL v3 license.
*
* HttpClient.h
*
* Modified: 2017 - Slavey Karadzhov <slav@attachix.com>
*
****/
/** @defgroup httpclient HTTP client
* @brief Provides HTTP/S client
* @ingroup tcpclient
* @{
*/
#pragma once
#include "TcpClient.h"
#include "Http/HttpCommon.h"
#include "Http/HttpRequest.h"
#include "Http/HttpClientConnection.h"
#include "Data/Stream/LimitedMemoryStream.h"
#include <SimpleTimer.h>
class HttpClient
{
public:
/**
* @brief HttpClient destructor
* @note DON'T call cleanup.
* If you want to free all resources from HttpClients the correct sequence will be to
* 1. Delete all instances of HttpClient
* 2. Call the static method HttpClient::cleanup();
*/
virtual ~HttpClient()
{
}
/* High-Level Methods */
bool sendRequest(const Url& url, RequestCompletedDelegate requestComplete)
{
return send(createRequest(url)->setMethod(HTTP_GET)->onRequestComplete(requestComplete));
}
bool sendRequest(const HttpMethod method, const Url& url, const HttpHeaders& headers,
RequestCompletedDelegate requestComplete)
{
return send(createRequest(url)->setMethod(method)->setHeaders(headers)->onRequestComplete(requestComplete));
}
bool sendRequest(const HttpMethod method, const Url& url, const HttpHeaders& headers, const String& body,
RequestCompletedDelegate requestComplete)
{
return send(createRequest(url)->setMethod(method)->setHeaders(headers)->setBody(body)->onRequestComplete(
requestComplete));
}
bool sendRequest(const HttpMethod method, const Url& url, const HttpHeaders& headers, String&& body,
RequestCompletedDelegate requestComplete) noexcept
{
return send(createRequest(url)
->setMethod(method)
->setHeaders(headers)
->setBody(std::move(body))
->onRequestComplete(requestComplete));
}
/**
* @brief Queue request to download content as string (in memory)
* @param url URL from which the content will be fetched
* @param requestComplete Completion callback
* @param maxLength maximum bytes to store in memory. If the response is bigger than `maxLength` then the rest bytes will be discarded.
* Use this parameter wisely as setting the value too high may consume all available RAM resulting in
* device restart and Denial-Of-Service
*/
bool downloadString(const Url& url, RequestCompletedDelegate requestComplete,
size_t maxLength = NETWORK_SEND_BUFFER_SIZE)
{
return send(createRequest(url)
->setMethod(HTTP_GET)
->setResponseStream(new LimitedMemoryStream(maxLength))
->onRequestComplete(requestComplete));
}
bool downloadFile(const Url& url, RequestCompletedDelegate requestComplete = nullptr)
{
return downloadFile(url, nullptr, requestComplete);
}
/**
* @brief Queue request to download a file
* @param url Source of file data
* @param saveFileName Path to save file to. Optional: specify nullptr to use name from url
* @param requestComplete Completion callback
*/
bool downloadFile(const Url& url, const String& saveFileName, RequestCompletedDelegate requestComplete = nullptr);
/* Low Level Methods */
/*
* @brief This method queues a request and sends it, once it is connected to the remote server.
* @param HttpRequest* request The request object will be freed inside of the method.
* Do not try to reuse it outside of the send method as it will lead to unpredicted results
*
* @retval bool true if the request was queued, false otherwise.
*
*/
bool send(HttpRequest* request);
/** @brief Helper function to create a new request on a URL
* @param url
* @retval HttpRequest*
*/
HttpRequest* createRequest(const Url& url)
{
return new HttpRequest(url);
}
/**
* @brief Use this method to clean all object pools
*/
static void cleanup()
{
httpConnectionPool.clear();
}
protected:
String getCacheKey(const Url& url)
{
return url.Host + ':' + url.getPort();
}
protected:
using HttpConnectionPool = ObjectMap<String, HttpClientConnection>;
static HttpConnectionPool httpConnectionPool;
private:
static SimpleTimer cleanUpTimer;
static void cleanInactive();
};
/** @} */
|
#ifndef THERMOMETER_HH_
#define THERMOMETER_HH_
/**
* @file Thermometer.h
* @author Dipl.-Inf. Falk Schilling <falk.schilling.de@ieee.org>
* @copyright LGPLv3
*/
#include "IThermometer.h"
/**
* @class Thermometer
* @brief A flexible and simple to use software asset modelling a thermometer.
* @details Uses the MVC compound pattern to select the driver at runtime.
*/
class Thermometer
{
//! the data model of the thermometer
class IThermometer* m_model;
public:
/**
* @brief Policy for construction of a sensor with protocol autodetection
* @tparam protocol type of the sensor
*/
template< typename Port >
Thermometer( Port &, IThermometer::Type );
//! cleanup
~Thermometer();
/**
* @brief triggers updates of the thermometer
*/
void update();
/**
* @brief gets the data model with read only access
*/
const class IThermometer & getModel() const;
/**
* @brief selects the sensor driver to use
* @tparam the protocol type of the sensor
*/
template< typename Port >
void setModel( Port &, IThermometer::Type );
/**
* @brief selects the displaying unit
*/
void setUnit( IThermometer::Unit );
/**
* @brief adds a view to a given thermometer
*/
void addView( IView<IThermometer> & );
/**
* @brief removes a view from a given thermometer
*/
void delView( IView<IThermometer> & );
};
#endif //THERMOMETER_HH_
|
/*
* libgeek - The GeekProjects utility suite
* Copyright (C) 2014, 2015, 2016 GeekProjects.com
*
* This file is part of libgeek.
*
* libgeek is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* libgeek is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with libgeek. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __LIBGEEK_GFX_DRAWABLE_H_
#define __LIBGEEK_GFX_DRAWABLE_H_
#include <stdint.h>
#include <string>
#include <geek/core-maths.h>
namespace Geek
{
namespace Gfx
{
class Drawable;
class Surface;
enum Corner
{
TOP_LEFT,
TOP_RIGHT,
BOTTOM_RIGHT,
BOTTOM_LEFT
};
class Drawable
{
private:
bool saveJPEG(struct jpeg_compress_struct* cinfo);
protected:
uint32_t m_width;
uint32_t m_height;
uint32_t m_bytesPerPixel;
uint32_t m_dpiX;
uint32_t m_dpiY;
uint8_t* m_drawingBuffer;
uint32_t m_drawingBufferLength;
public:
Drawable(uint32_t width, uint32_t height);
virtual ~Drawable();
static inline uint32_t getBytesPerPixel() { return 4; }
inline uint32_t getWidth() const { return m_width; }
inline uint32_t getHeight() const { return m_height; }
inline uint32_t getDpiX() const { return m_dpiX; }
inline uint32_t getDpiY() const { return m_dpiY; }
Geek::Rect getRect() const { return {0, 0, (int32_t)m_width, (int32_t)m_height}; }
bool intersects(int x, int y) const { return (x >=0 && x < (int)m_width && y >= 0 && y < (int)m_height); }
virtual uint8_t* getDrawingBuffer() const { return m_drawingBuffer; }
inline uint32_t getOffset(int32_t x, int32_t y) const
{
return (((getWidth() * y) + x) * getBytesPerPixel());
}
inline uint32_t getStride() const
{
return getWidth() * getBytesPerPixel();
}
virtual bool clear(uint32_t c);
virtual void darken();
virtual bool drawPixel(int32_t x, int32_t y, uint32_t c);
virtual bool drawLine(int32_t x1, int32_t y1, int32_t x2, int32_t y2, uint32_t c);
virtual bool drawRectFilled(int32_t x, int32_t y, uint32_t w, uint32_t h, uint32_t c);
virtual bool drawRect(int32_t x, int32_t y, uint32_t w, uint32_t h, uint32_t c);
virtual bool drawGrad(int32_t x, int32_t y, uint32_t w, uint32_t h, uint32_t c1, uint32_t c2);
virtual bool blit(uint8_t* destBuffer, int32_t x, int32_t y, uint8_t* data, uint32_t w, uint32_t h, uint32_t bbp, bool alpha = false);
virtual bool blit(int32_t x, int32_t y, uint8_t* data, uint32_t w, uint32_t h, uint32_t bbp, bool alpha = false);
virtual bool blit(int32_t x, int32_t y, Surface* surface, bool forceAlpha = false);
virtual bool blit(int32_t destX, int32_t destY, Surface* surface, int viewX, int viewY, int viewW, int viewH, bool forceAlpha = false);
virtual bool drawCorner(int32_t x, int32_t y, Corner corner, uint32_t r, uint32_t c);
virtual bool drawRectRounded(int32_t x, int32_t y, uint32_t w, uint32_t h, uint32_t r, uint32_t c);
virtual bool drawRectFilledRounded(int32_t x, int32_t y, uint32_t w, uint32_t h, uint32_t r, uint32_t c);
virtual bool drawGradRounded(int32_t x, int32_t y, uint32_t w, uint32_t h, uint32_t r, uint32_t c1, uint32_t c2);
virtual bool drawCircle(int32_t x, int32_t y, uint32_t r, uint32_t c);
virtual bool drawCircleFilled(int32_t x, int32_t y, uint32_t r, uint32_t c);
virtual bool blit(
uint8_t* destBuffer,
int32_t x,
int32_t y,
uint8_t* srcData,
uint32_t srcWidth,
uint32_t srcHeight,
uint32_t bytesPerPixel,
int32_t viewX,
int32_t viewY,
uint32_t viewWidth,
uint32_t viewHeight,
bool forceAlpha = false);
virtual uint32_t getPixel(int32_t x, int32_t y);
virtual bool savePNG(std::string path);
virtual bool savePNG(int fd);
virtual bool saveJPEG(uint8_t** buffer, unsigned long* bufferLength);
virtual bool saveJPEG(std::string path);
virtual bool saveJPEG(int fd);
};
} // ::Geek::Gfx
} // ::Geek
#endif
|
/* drawer.c
*
* * ***************************************************************
* ** PARTS OF THIS MODULE ARE BASED ON THE puppybits PROJECT: **
* ** http://code.google.com/p/puppybits/ **
* *****************************************************************
*
* Created on: 30.01.2012
* Author: Florian Gopp (go.goflo@gmail.com)
*/
#include "drawer.h"
#include <math.h>
#include <stdio.h>
#include "video.h"
static void drawer_set_color(RastPort *rp, unsigned int rgb) {
rp->color = ((rgb & 0xf80000) >> 8) | ((rgb & 0xfc00) >> 5) | ((rgb & 0xf8) >> 3);
}
static void drawer_move_to(RastPort *rp, int x, int y) {
rp->x = x;
rp->y = y;
rp->point = ((unsigned char *) rp->bitmap->data) + x * 2
+ y * rp->bitmap->stride;
}
void drawer_draw_pixel(RastPort *rp, unsigned int color, int x, int y) {
drawer_set_color(rp, color);
drawer_move_to(rp, x, y);
*((unsigned short *) rp->point) = rp->color;
}
void drawer_draw_rect(RastPort *rp, unsigned int color, int x, int y, int w, int h) {
int i, j;
unsigned short *outp;
drawer_move_to(rp, x, y);
drawer_set_color(rp, color);
outp = rp->point;
if (w + rp->x > rp->bitmap->width) {
w = rp->bitmap->width - rp->x;
}
if (h + rp->y > rp->bitmap->height) {
h = rp->bitmap->height - rp->y;
}
for (j = 0; j < h; j++) {
for (i = 0; i < w; i++) {
outp[i] = rp->color;
}
outp = (unsigned short *) ((char *) outp + rp->bitmap->stride);
}
}
void drawer_draw_ellipse(RastPort *rp, unsigned int color, int x, int y, int a, int b) {
int dx = 0, dy = b;
long a2 = a * a, b2 = b * b;
long err = b2 - (2 * b - 1) * a2, e2;
do {
drawer_draw_line(rp, color, x + dx, y + dy, x + dx, y - dy);
drawer_draw_line(rp, color, x - dx, y + dy, x - dx, y - dy);
e2 = 2 * err;
if (e2 < ((2 * dx + 1) * b2)) {
dx++;
err += (2 * dx + 1) * b2;
}
if (e2 > (-(2 * dy - 1) * a2)) {
dy--;
err -= (2 * dy - 1) * a2;
}
} while (dy >= 0);
while (dx++ < a) {
drawer_draw_line(rp, color, x - dx, y, x + dx, y);
}
}
// see: http://de.wikipedia.org/wiki/Bresenham-Algorithmus
void drawer_draw_line(RastPort *rp, unsigned int color, int x, int y, int x_end, int y_end) {
int dx = abs(x_end - x);
int dy = -abs(y_end - y);
int sy = -1, sx = -1, e2;
int err = dx + dy;
// go to start point
drawer_move_to(rp, x, y);
drawer_set_color(rp, color);
if (y < y_end) {
sy = 1;
}
if (x < x_end) {
sx = 1;
}
for(;;){
drawer_move_to(rp, x, y);
// set pixel
*((unsigned short *) rp->point) = rp->color;
if (x == x_end && y == y_end) {
break;
}
e2 = 2*err;
if (e2 > dy) {
err += dy;
x += sx;
}
if (e2 < dx) {
err += dx;
y += sy;
}
}
}
static void drawer_draw_char(RastPort *rp, unsigned int c, int scale) {
int i, j, s;
int w, h;
unsigned short *outp;
unsigned const char *inp;
// check if character is valid for the used font
if (c < rp->romfont->first || c > rp->romfont->last) {
return;
}
// get dimension of character
w = rp->romfont->width;
h = rp->romfont->height;
c = (c - rp->romfont->first) * w;
outp = ((unsigned short *)rp->point) - rp->romfont->baseline*scale*rp->bitmap->stride;
inp = rp->romfont->bitmap + c;
for (j=0;j<h;j++) {
for (s=0;s<scale;s++) {
for (i=0;i<w*scale;i++) {
unsigned int b = inp[i/scale];
if (b) {
outp[i] = rp->color;
}
}
outp = (unsigned short *)((char *)outp + rp->bitmap->stride);
}
inp += rp->romfont->stride;
}
rp->point = ((unsigned short *)rp->point) + w*scale;
rp->x += w*scale;
}
void drawer_draw_string(RastPort *rp, unsigned int color, int x, int y, const char *s, int scale) {
unsigned int c;
drawer_move_to(rp, x, y);
drawer_set_color(rp, color);
while ((c = *s++)) {
if (c == '\n') {
if (y + 20 > rp->bitmap->height*scale) {
drawer_move_to(rp, x, 20);
} else {
drawer_move_to(rp, x, y + rp->romfont->lineheight*scale);
}
} else {
drawer_draw_char(rp, c, scale);
}
}
}
void drawer_draw_triangle(RastPort *rp, unsigned int color, int x, int y, int xh, int yh) {
int h, w, i = 0, len, cur_len;
int x_start, y_start;
if (x == xh) {
// north or south arrow
len = y - yh;
len = abs(len);
y_start = yh;
while (len > 0) {
cur_len = y > yh ? y_start+len : y_start-len;
drawer_draw_line(rp, color, x-i, y_start, x-i, cur_len);
drawer_draw_line(rp, color, x+i, y_start, x+i, cur_len);
len--;
i++;
}
} else if (y == yh) {
// east or west arrow
len = x - xh;
len = abs(len);
x_start = xh;
while (len > 0) {
cur_len = x > xh ? x_start+len : x_start-len;
drawer_draw_line(rp, color, x_start, y-i, cur_len, y-i);
drawer_draw_line(rp, color, x_start, y+i, cur_len, y+i);
len--;
i++;
}
} else {
drawer_draw_string(rp, color, x, y, "baaam", 2);
}
}
|
/*--------------------------------------------------------------------
(C) Copyright 2006-2011 Barcelona Supercomputing Center
Centro Nacional de Supercomputacion
This file is part of Mercurium C/C++ source-to-source compiler.
See AUTHORS file in the top level directory for information
regarding developers and contributors.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 3 of the License, or (at your option) any later version.
Mercurium C/C++ source-to-source compiler is distributed in the hope
that it will be useful, but WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the GNU Lesser General Public License for more
details.
You should have received a copy of the GNU Lesser General Public
License along with Mercurium C/C++ source-to-source compiler; if
not, write to the Free Software Foundation, Inc., 675 Mass Ave,
Cambridge, MA 02139, USA.
--------------------------------------------------------------------*/
/*
<testinfo>
test_generator=06_phases_hlt.dg/mercurium
test_compile_fail=yes
</testinfo>
*/
void f(int i, int j)
{
#pragma hlt block factors(20)
for (i = 0; i < 100 && j > 20; i++, j--)
{
}
}
|
#include "intlist.h"
/* acyclic(x) and l[x]==_l and data(x) */
intlist sentinel(intlist x, int m) {
intlist xi = x;
while (xi != NULL && xi->data <= m) {
xi = xi->next;
}
return xi;
}
|
// This file is part of VSTGUI. It is subject to the license terms
// in the LICENSE file found in the top-level directory of this
// distribution and at http://github.com/steinbergmedia/vstgui/LICENSE
#ifndef __uidialogcontroller__
#define __uidialogcontroller__
#include "../uidescription.h"
#if VSTGUI_LIVE_EDITING
#include "../delegationcontroller.h"
#include "../../lib/cframe.h"
#include "../../lib/iviewlistener.h"
#include "../../lib/copenglview.h"
#include <string>
#include <list>
namespace VSTGUI {
//----------------------------------------------------------------------------------------------------
class UIDialogController : public CBaseObject,
public DelegationController,
public IKeyboardHook,
public ViewListenerAdapter
{
public:
UIDialogController (IController* baseController, CFrame* frame);
~UIDialogController () override = default;
void run (UTF8StringPtr templateName, UTF8StringPtr dialogTitle, UTF8StringPtr button1, UTF8StringPtr button2, IController* controller, UIDescription* description);
static IdStringPtr kMsgDialogButton1Clicked;
static IdStringPtr kMsgDialogButton2Clicked;
static IdStringPtr kMsgDialogShow;
protected:
void valueChanged (CControl* pControl) override;
IControlListener* getControlListener (UTF8StringPtr controlTagName) override;
CView* verifyView (CView* view, const UIAttributes& attributes, const IUIDescription* description) override;
CMessageResult notify (CBaseObject* sender, IdStringPtr message) override;
void viewSizeChanged (CView* view, const CRect& oldSize) override;
void viewRemoved (CView* view) override;
void close ();
void layoutButtons ();
void collectOpenGLViews (CViewContainer* container);
void setOpenGLViewsVisible (bool state);
int32_t onKeyDown (const VstKeyCode& code, CFrame* frame) override;
int32_t onKeyUp (const VstKeyCode& code, CFrame* frame) override;
CFrame* frame;
ModalViewSession* modalSession {nullptr};
SharedPointer<CBaseObject> dialogController;
UIDescription* dialogDescription;
SharedPointer<CControl> button1;
SharedPointer<CControl> button2;
CPoint sizeDiff;
std::string templateName;
std::string dialogTitle;
std::string dialogButton1;
std::string dialogButton2;
#if VSTGUI_OPENGL_SUPPORT
std::list<SharedPointer<COpenGLView> > openglViews;
#endif
enum {
kButton1Tag,
kButton2Tag,
kTitleTag
};
};
} // namespace
#endif // VSTGUI_LIVE_EDITING
#endif // __uidialogcontroller__
|
// Created file "Lib\src\Uuid\X64\netcfgn_i"
typedef struct _GUID
{
unsigned long Data1;
unsigned short Data2;
unsigned short Data3;
unsigned char Data4[8];
} GUID;
#define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
extern const GUID name = { l, w1, w2, { b1, b2, b3, b4, b5, b6, b7, b8 } }
DEFINE_GUID(IID_INetCfgComponentNotifyGlobal, 0x932238e2, 0xbea1, 0x11d0, 0x92, 0x98, 0x00, 0xc0, 0x4f, 0xc9, 0x9d, 0xcf);
|
/*
Copyright (C) 2010 Gaetan Guidet
This file is part of ofxpp.
ofxpp is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at
your option) any later version.
ofxpp is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
USA.
*/
/** \file booleanparameter.h
* Boolean parameter descriptor and instance classes.
*/
#ifndef __ofx_parameter_boolean_h__
#define __ofx_parameter_boolean_h__
#include <ofx/parameter.h>
namespace ofx {
//! Boolean parameter descriptor class.
class BooleanParameterDescriptor : public ValueParameterDescriptor {
public:
BooleanParameterDescriptor();
BooleanParameterDescriptor(Host *h, OfxPropertySetHandle hdl);
BooleanParameterDescriptor(const BooleanParameterDescriptor &rhs);
virtual ~BooleanParameterDescriptor();
BooleanParameterDescriptor& operator=(const BooleanParameterDescriptor &rhs);
// properties
//! Get default value.
bool defaultValue();
//! Set default value.
void defaultValue(bool v);
};
//! Boolean parameter instance class.
class BooleanParameter : public ValueParameter {
public:
BooleanParameter();
BooleanParameter(Host *h, OfxParamHandle hdl);
BooleanParameter(const BooleanParameter &rhs);
virtual ~BooleanParameter();
BooleanParameter& operator=(const BooleanParameter &rhs);
// properties
//! Get default value.
bool defaultValue();
// suite
//! Get current value.
bool getValue() throw(Exception);
//! Get value at given time.
bool getValueAtTime(Time t) throw(Exception);
//! Set current value.
void setValue(bool v) throw(Exception);
//! Set value at given time.
void setValueAtTime(Time t, bool v) throw(Exception);
};
}
#endif
|
/* mpfr_set_ui_2exp -- set a MPFR number from a machine unsigned integer with
a shift
Copyright 2004, 2006-2021 Free Software Foundation, Inc.
Contributed by the AriC and Caramba projects, INRIA.
This file is part of the GNU MPFR Library.
The GNU MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The GNU MPFR Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MPFR Library; see the file COPYING.LESSER. If not, see
https://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
#define MPFR_NEED_LONGLONG_H
#include "mpfr-impl.h"
MPFR_HOT_FUNCTION_ATTR int
mpfr_set_ui_2exp (mpfr_ptr x, unsigned long i, mpfr_exp_t e, mpfr_rnd_t rnd_mode)
{
MPFR_SET_POS (x);
if (MPFR_UNLIKELY (i == 0))
{
MPFR_SET_ZERO (x);
MPFR_RET (0);
}
else
{
#ifdef MPFR_LONG_WITHIN_LIMB
mp_size_t xn;
int cnt, nbits;
mp_limb_t *xp;
int inex = 0;
/* Early underflow/overflow checking is necessary to avoid
integer overflow or errors due to special exponent values. */
if (MPFR_UNLIKELY (e < __gmpfr_emin - (mpfr_exp_t)
(sizeof (unsigned long) * CHAR_BIT + 1)))
return mpfr_underflow (x, rnd_mode == MPFR_RNDN ?
MPFR_RNDZ : rnd_mode, i < 0 ? -1 : 1);
if (MPFR_UNLIKELY (e >= __gmpfr_emax))
return mpfr_overflow (x, rnd_mode, i < 0 ? -1 : 1);
MPFR_ASSERTD (i == (mp_limb_t) i);
/* Position of the highest limb */
xn = (MPFR_PREC (x) - 1) / GMP_NUMB_BITS;
count_leading_zeros (cnt, (mp_limb_t) i);
MPFR_ASSERTD (cnt < GMP_NUMB_BITS); /* OK since i != 0 */
xp = MPFR_MANT(x);
xp[xn] = ((mp_limb_t) i) << cnt;
/* Zero the xn lower limbs. */
MPN_ZERO(xp, xn);
nbits = GMP_NUMB_BITS - cnt;
e += nbits; /* exponent _before_ the rounding */
/* round if MPFR_PREC(x) smaller than length of i */
if (MPFR_UNLIKELY (MPFR_PREC (x) < nbits) &&
MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, 0,
MPFR_PREC (x), rnd_mode, &inex)))
{
e++;
xp[xn] = MPFR_LIMB_HIGHBIT;
}
MPFR_EXP (x) = e;
return mpfr_check_range (x, inex, rnd_mode);
#else
/* if a long does not fit into a limb, we use mpfr_set_z_2exp */
mpz_t z;
int inex;
mpz_init_set_ui (z, i);
inex = mpfr_set_z_2exp (x, z, e, rnd_mode);
mpz_clear (z);
return inex;
#endif
}
}
|
// Currently the same thing as part1 lol
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#define CHILDREN_COUNT 5
#define INIT_VALUE 0
typedef struct pipe
{
int value;
} Pipe;
typedef struct process
{
int pid;
Pipe* pPipe;
} Process;
Process* forkSimulated(Process* parent);
void childFunction(Process* process);
int myRead(Pipe * thePipe);
void myWrite(int value, Pipe * thePipe);
int iGlobalVariable = 0;
int iPidCounter = 0;
int main()
{
Process* children[CHILDREN_COUNT];
Pipe * thePipe = (Pipe*)malloc(sizeof(pipe));
thePipe->value = iGlobalVariable;
// The parent process, won't do anything but fork
Process* parent = (Process*)malloc(sizeof(Process));
parent->pid = iPidCounter;
parent->pPipe = thePipe;
for (int i = 0; i < CHILDREN_COUNT; i++)
{
iPidCounter++;
children[i] = forkSimulated(parent);
}
int i = 0;
while(myRead(thePipe) < 100)
{
childFunction(children[0]);
childFunction(children[1]);
childFunction(children[2]);
childFunction(children[3]);
childFunction(children[4]);
}
myWrite(iGlobalVariable,parent->pPipe);
for (int i = 0; i < CHILDREN_COUNT; i++)
{
if (children[i])
{
free(children[i]);
}
}
free(thePipe);
return 0;
}
Process* forkSimulated(Process* parent)
{
Process* child = (Process*)malloc(sizeof(Process));
child->pid = parent->pid + iPidCounter;
child->pPipe = parent->pPipe;
return child;
}
void childFunction(Process* process)
{
int i;
i = myRead(process->pPipe);
i++;
printf("Child with process ID: %d. Incremented Global to %d\n",process->pid, i);
myWrite(i, process->pPipe);
}
int myRead(Pipe * thePipe)
{
return thePipe->value;
}
void myWrite(int value, Pipe * thePipe)
{
thePipe->value = value;
}
|
#ifndef hyp_trig_h
#define hyp_trig_h
void show_hyp_trig_menu();
#endif
// |
#ifndef _core_ieee_std_1003dot1_errors_BadMessage
#define _core_ieee_std_1003dot1_errors_BadMessage ::core_system::Error::BadMessage
namespace core_ieee_std_1003dot1_errors {
struct BadMessage {
};
}
#endif
|
#ifndef _EVAS_GL_CORE_H
#define _EVAS_GL_CORE_H
#define EVAS_GL_NO_GL_H_CHECK 1
#include "Evas_GL.h"
typedef void *EVGLNative_Display;
typedef void *EVGLNative_Window;
typedef void *EVGLNative_Surface;
typedef void *EVGLNative_Context;
typedef struct _EVGL_Engine EVGL_Engine;
typedef struct _EVGL_Interface EVGL_Interface;
typedef struct _EVGL_Surface EVGL_Surface;
typedef struct _EVGL_Native_Window EVGL_Native_Window;
typedef struct _EVGL_Context EVGL_Context;
typedef struct _EVGL_Resource EVGL_Resource;
typedef struct _EVGL_Cap EVGL_Cap;
typedef struct _EVGL_Surface_Cap EVGL_Surface_Cap;
typedef struct _EVGL_Surface_Format EVGL_Surface_Format;
EVGL_Engine *evgl_engine_init(void *eng_data, EVGL_Interface *efunc);
void evgl_engine_shutdown(void *eng_data);
void *evgl_surface_create(void *eng_data, Evas_GL_Config *cfg, int w, int h);
int evgl_surface_destroy(void *eng_data, EVGL_Surface *sfc);
void *evgl_context_create(void *eng_data, EVGL_Context *share_ctx);
int evgl_context_destroy(void *eng_data, EVGL_Context *ctx);
int evgl_make_current(void *eng_data, EVGL_Surface *sfc, EVGL_Context *ctx);
const char *evgl_string_query(int name);
void *evgl_proc_address_get(const char *name);
int evgl_native_surface_get(EVGL_Surface *sfc, Evas_Native_Surface *ns);
Evas_GL_API *evgl_api_get();
int evgl_direct_rendered();
void evgl_direct_override_get(int *override, int *force_off);
void evgl_direct_info_set(int win_w, int win_h, int rot,
int img_x, int img_y, int img_w, int img_h,
int clip_x, int clip_y, int clip_w, int clip_h);
void evgl_direct_info_clear();
void evgl_direct_partial_info_set(int pres);
void evgl_direct_partial_info_clear();
void evgl_direct_partial_render_start();
void evgl_direct_partial_render_end();
#endif //_EVAS_GL_CORE_H
|
// UseOleEdit.h : main header file for the USEOLEEDIT application
//
#if !defined(AFX_USEOLEEDIT_H__ED31171E_06EF_4A26_BCA8_51FD602EED9D__INCLUDED_)
#define AFX_USEOLEEDIT_H__ED31171E_06EF_4A26_BCA8_51FD602EED9D__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#ifndef __AFXWIN_H__
#error include 'stdafx.h' before including this file for PCH
#endif
#include "resource.h" // main symbols
/////////////////////////////////////////////////////////////////////////////
// CUseOleEditApp:
// See UseOleEdit.cpp for the implementation of this class
//
class CUseOleEditApp : public CWinApp
{
public:
CUseOleEditApp();
// Overrides
// ClassWizard generated virtual function overrides
//{{AFX_VIRTUAL(CUseOleEditApp)
public:
virtual BOOL InitInstance();
//}}AFX_VIRTUAL
// Implementation
//{{AFX_MSG(CUseOleEditApp)
// NOTE - the ClassWizard will add and remove member functions here.
// DO NOT EDIT what you see in these blocks of generated code !
//}}AFX_MSG
DECLARE_MESSAGE_MAP()
};
/////////////////////////////////////////////////////////////////////////////
//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
#endif // !defined(AFX_USEOLEEDIT_H__ED31171E_06EF_4A26_BCA8_51FD602EED9D__INCLUDED_)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.