Aegisub/aegisub/src/utils.h

146 lines
3.8 KiB
C
Raw Normal View History

// Copyright (c) 2005-2009, Rodrigo Braz Monteiro, Niels Martin Hansen
2006-01-16 22:02:54 +01:00
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of the Aegisub Group 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.
//
// Aegisub Project http://www.aegisub.org/
2006-01-16 22:02:54 +01:00
//
// $Id$
/// @file utils.h
/// @see utils.cpp
/// @ingroup utility
///
2006-01-16 22:02:54 +01:00
#pragma once
///////////
// Headers
#ifndef AGI_PRE
#include <stdint.h>
#include <utility>
#include <vector>
#include <wx/icon.h>
#include <wx/menuitem.h>
#endif
/// DOCME
typedef std::vector<std::pair<int,int> > IntPairVector;
2006-01-16 22:02:54 +01:00
///////////////////////
// Function prototypes
2006-04-13 08:35:55 +02:00
#ifndef __LINUX__
int64_t abs64(int64_t input);
#endif
2006-01-16 22:02:54 +01:00
int CountMatches(wxString parent,wxString child);
wxString MakeRelativePath(wxString path,wxString reference);
wxString DecodeRelativePath(wxString path,wxString reference);
wxString PrettyFloat(wxString src);
wxString PrettyFloatF(float src);
wxString PrettyFloatD(double src);
wxString AegiFloatToString(double value);
wxString AegiIntegerToString(int value);
wxString PrettySize(int bytes);
wxMenuItem *AppendBitmapMenuItem (wxMenu* parentMenu,int id,wxString text,wxString help,wxBitmap bmp,int pos=-1);
int SmallestPowerOf2(int x);
void GetWordBoundaries(const wxString text,IntPairVector &results,int start=0,int end=-1);
bool IsWhitespace(wchar_t c);
bool StringEmptyOrWhitespace(const wxString &str);
int AegiStringToInt(const wxString &str,int start=0,int end=-1);
int AegiStringToFix(const wxString &str,size_t decimalPlaces,int start=0,int end=-1);
wxIcon BitmapToIcon(wxBitmap bmp);
void RestartAegisub();
2006-01-16 22:02:54 +01:00
//////////
// Macros
#ifndef MIN
/// DOCME
2006-01-16 22:02:54 +01:00
#define MIN(a,b) ((a)<(b))?(a):(b)
#endif
#ifndef MAX
/// DOCME
2006-01-16 22:02:54 +01:00
#define MAX(a,b) ((a)>(b))?(a):(b)
#endif
#ifndef MID
/// DOCME
#define MID(a,b,c) MAX((a),MIN((b),(c)))
2006-01-16 22:02:54 +01:00
#endif
#ifndef FORCEINLINE
#ifdef __VISUALC__
/// DOCME
#define FORCEINLINE __forceinline
#else
/// DOCME
#define FORCEINLINE inline
// __attribute__((always_inline)) gives me errors on g++ ~amz
#endif
#endif
/// @brief Inlines
/// @param a
/// @param b
///
static inline void IntSwap(int &a,int &b) {
int c = a;
a = b;
b = c;
}
/// @brief Code taken from http://bob.allegronetwork.com/prog/tricks.html#clamp Clamp integer to range
/// @param x
/// @param min
/// @param max
///
static FORCEINLINE int ClampSignedInteger32(int x,int min,int max) {
x -= min;
x &= (~x) >> 31;
x += min;
x -= max;
x &= x >> 31;
x += max;
return x;
}