+ Vector swizzling (thx Simen Kjaeraas)
- alloc.d * small fix in KeyCode enum git-svn-id: https://sfml.svn.sourceforge.net/svnroot/sfml/branches/sfml2@1586 4e206d99-4929-0410-ac5d-dfc041789085
This commit is contained in:
parent
61dc7e0100
commit
643ff2b38a
@ -1,84 +0,0 @@
|
|||||||
/*
|
|
||||||
* DSFML - SFML Library wrapper for the D programming language.
|
|
||||||
* Copyright (C) 2008 Julien Dagorn (sirjulio13@gmail.com)
|
|
||||||
* Copyright (C) 2010 Andreas Hollandt
|
|
||||||
*
|
|
||||||
* This software is provided 'as-is', without any express or
|
|
||||||
* implied warranty. In no event will the authors be held
|
|
||||||
* liable for any damages arising from the use of this software.
|
|
||||||
*
|
|
||||||
* Permission is granted to anyone to use this software for any purpose,
|
|
||||||
* including commercial applications, and to alter it and redistribute
|
|
||||||
* it freely, subject to the following restrictions:
|
|
||||||
*
|
|
||||||
* 1. The origin of this software must not be misrepresented;
|
|
||||||
* you must not claim that you wrote the original software.
|
|
||||||
* If you use this software in a product, an acknowledgment
|
|
||||||
* in the product documentation would be appreciated but
|
|
||||||
* is not required.
|
|
||||||
*
|
|
||||||
* 2. Altered source versions must be plainly marked as such,
|
|
||||||
* and must not be misrepresented as being the original software.
|
|
||||||
*
|
|
||||||
* 3. This notice may not be removed or altered from any
|
|
||||||
* source distribution.
|
|
||||||
*/
|
|
||||||
|
|
||||||
module dsfml.system.alloc;
|
|
||||||
|
|
||||||
version (Tango)
|
|
||||||
{
|
|
||||||
public import tango.core.Memory;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
public import core.memory;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
struct GC
|
|
||||||
{
|
|
||||||
static void* malloc(uint size)
|
|
||||||
{
|
|
||||||
return std.c.stdlib.malloc(size);
|
|
||||||
}
|
|
||||||
|
|
||||||
static void free(void* ptr)
|
|
||||||
{
|
|
||||||
std.c.stdlib.free(ptr);
|
|
||||||
}
|
|
||||||
|
|
||||||
static void addRange(void* ptr, uint size)
|
|
||||||
{
|
|
||||||
std.gc.addRange(ptr, ptr + size);
|
|
||||||
}
|
|
||||||
|
|
||||||
static void removeRange(void* ptr)
|
|
||||||
{
|
|
||||||
std.gc.removeRange(ptr);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Template for native non-GCed allocation for interaction between C and D threads.
|
|
||||||
*/
|
|
||||||
template Alloc()
|
|
||||||
{
|
|
||||||
new (uint size)
|
|
||||||
{
|
|
||||||
void* p = GC.malloc(size);
|
|
||||||
if (!p)
|
|
||||||
assert(0, "Memory allocation failed");
|
|
||||||
|
|
||||||
GC.addRange(p, size);
|
|
||||||
return p;
|
|
||||||
}
|
|
||||||
|
|
||||||
delete(void* p)
|
|
||||||
{
|
|
||||||
GC.removeRange(p);
|
|
||||||
GC.free(p);
|
|
||||||
}
|
|
||||||
}
|
|
@ -145,6 +145,7 @@ struct Vector(T, int dim)
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// operations with a scalar
|
/// operations with a scalar
|
||||||
|
// TODO: make this usable with arbitrary scalars (not only Vector element type T), including necessary checks etc.
|
||||||
typeof(this) opBinary(string op)(T s)
|
typeof(this) opBinary(string op)(T s)
|
||||||
{
|
{
|
||||||
Vector res = void;
|
Vector res = void;
|
||||||
@ -326,6 +327,32 @@ struct Vector(T, int dim)
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// swizzling
|
||||||
|
@property Vector!(T,n.length) opDispatch(string n)() const
|
||||||
|
if (allCharsValid(n,"xyzw"[0..dim]))
|
||||||
|
{
|
||||||
|
static if (n.length == 2) return
|
||||||
|
Vector!(T,n.length)(cell[n[0]-'x'], cell[n[1]-'x']);
|
||||||
|
static if (n.length == 3) return
|
||||||
|
Vector!(T,n.length)(cell[n[0]-'x'], cell[n[1]-'x'], cell[n[2]-'x']);
|
||||||
|
static if (n.length == 4) return
|
||||||
|
Vector!(T,n.length)(cell[n[0]-'x'], cell[n[1]-'x'], cell[n[2]-'x'], cell[n[3]-'x']);
|
||||||
|
}
|
||||||
|
|
||||||
|
// helper function
|
||||||
|
static private bool allCharsValid( string s, string valid )
|
||||||
|
{
|
||||||
|
foreach ( e1; s )
|
||||||
|
{
|
||||||
|
bool b = false;
|
||||||
|
foreach (e2; valid)
|
||||||
|
b |= e1 == e2;
|
||||||
|
if (!b)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
///
|
///
|
||||||
bool isUnit()
|
bool isUnit()
|
||||||
{
|
{
|
||||||
@ -373,6 +400,9 @@ unittest
|
|||||||
|
|
||||||
assert(v+w == Vector3f(0.5f, 3.f, 0.f));
|
assert(v+w == Vector3f(0.5f, 3.f, 0.f));
|
||||||
assert(v-w == Vector3f(2.5f, -1.f, 1.f));
|
assert(v-w == Vector3f(2.5f, -1.f, 1.f));
|
||||||
|
|
||||||
|
auto r = v.xy;
|
||||||
|
writeln(r);
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -26,7 +26,6 @@
|
|||||||
module dsfml.window.context;
|
module dsfml.window.context;
|
||||||
|
|
||||||
import dsfml.system.common;
|
import dsfml.system.common;
|
||||||
import dsfml.window.common;
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
*
|
*
|
||||||
|
@ -108,7 +108,7 @@ enum KeyCode
|
|||||||
Insert,
|
Insert,
|
||||||
Delete,
|
Delete,
|
||||||
Add,
|
Add,
|
||||||
Substract,
|
Subtract,
|
||||||
Multiply,
|
Multiply,
|
||||||
Divide,
|
Divide,
|
||||||
Left,
|
Left,
|
||||||
|
Loading…
x
Reference in New Issue
Block a user