miguel.horta/commandergenius
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Added Enigma game

Browse Source
This commit is contained in:
pelya
2010-10-13 17:30:44 +03:00
parent 8bd2d39dfe
commit bf7d3f22c6
308 changed files with 92986 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1256
project/jni/application/enigma/lib-src/oxydlib/Bitmap.cpp Normal file
View File

File diff suppressed because it is too large Load Diff

97
project/jni/application/enigma/lib-src/oxydlib/Bitmap.h Normal file
View File

@@ -0,0 +1,97 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef BITMAP_H
#define BITMAP_H
#include "VecUtils.h"
#include <string>
namespace OxydLib {
using std::string;
class Palette
{
public:
Palette();
~Palette();
int getNumColors() const;
void setNumColors(int numColors);
void getColor(int nColor,
unsigned int *pRed,
unsigned int *pGreen,
unsigned int *pBlue) const;
void setColor(int nColor,
unsigned int red,
unsigned int green,
unsigned int blue);
private:
std::vector<unsigned int> m_colors;
};
class Bitmap
{
public:
Bitmap();
~Bitmap();
void clear();
int getBitDepth() const { return m_bitDepth; }
void setBitDepth(int bitDepth) { m_bitDepth = bitDepth; }
unsigned char getPixel(int x, int y) const;
void setPixel(int x, int y, unsigned char pixelVal);
int getBit(int x, int y, int bitNum) const;
void setBit(int x, int y, int bitNum, int bitVal);
private:
int m_bitDepth;
ByteVec m_pixels;
};
// Both parseBitmap and unparseBitmap work with 16-color palettes,
// regardless of the bit depth of the bitmap.
bool parseBitmap(const ByteVec &in,
Bitmap *pBitmap,
Palette *pPalette,
string *pMsg = 0);
bool unparseBitmap(const Bitmap &bitmap,
const Palette &palette,
ByteVec *pOut,
string *pMsg = 0);
// The palette passed to bitmapToPPM should have 2^(bit depth of bitmap)
// colors.
void bitmapToPPM(const Bitmap &bitmap,
const Palette &palette,
ByteVec *pOut);
void bitPlaneToPPM(const Bitmap &bitmap,
int nBitPlane,
ByteVec *pOut);
}
#endif

340
project/jni/application/enigma/lib-src/oxydlib/COPYING Normal file
View File

@@ -0,0 +1,340 @@
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.

612
project/jni/application/enigma/lib-src/oxydlib/DatFile.cpp Normal file
View File

@@ -0,0 +1,612 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include "DatFile.h"
#include "VecUtils.h"
#include <stdio.h>
#include <algorithm>
namespace OxydLib {
using namespace std;
namespace
{
unsigned char levelShifts[OxydVersion_Count][16] =
{{0x45, 0x23, 0xEA, 0xB9, 0x11, 0xF1, 0x9F, 0x5A,
0x33, 0x3E, 0x0F, 0xB4, 0x41, 0x56, 0xAF, 0xAA},
{0x45, 0x23, 0xEA, 0xB9, 0x11, 0xF1, 0x9F, 0x5A,
0x33, 0x3E, 0x0F, 0xB4, 0x41, 0x56, 0xAF, 0xAA},
{0x45, 0x23, 0xEA, 0xB9, 0x11, 0xF1, 0x9F, 0x5A,
0x33, 0x3E, 0x0F, 0xB4, 0x41, 0x56, 0xAF, 0xAA},
{0xAA, 0xE1, 0x82, 0x34, 0xAF, 0x24, 0x72, 0x42,
0x37, 0x3E, 0x83, 0x98, 0x22, 0xFF, 0x2F, 0x31},
{0x45, 0x23, 0xEA, 0xB9, 0x11, 0xF1, 0x9F, 0x5A,
0x33, 0x3E, 0x0F, 0xB4, 0x41, 0x56, 0xAF, 0xAA}};
void unshiftBytes(ByteVec *pVec, OxydVersion ver)
{
for (int nByte = 0; nByte < (int)pVec->size(); nByte++) {
(*pVec)[nByte] =
(int((*pVec)[nByte]) + 256 - levelShifts[ver][nByte % 16]) % 256;
}
}
void shiftBytes(ByteVec *pVec, OxydVersion ver)
{
for (int nByte = 0; nByte < (int)pVec->size(); nByte++) {
(*pVec)[nByte] =
(int((*pVec)[nByte]) + levelShifts[ver][nByte % 16]) % 256;
}
}
void unscrambleChunkTableData(ByteVec::iterator it)
{
unsigned int val = getInt4(it);
unsigned int valPrime = 0xffffffff &
~(((val & 0x1fffffff) << 3) +
((val & 0xe0000000) >> 29));
putInt4(it, valPrime);
}
void scrambleChunkTableData(ByteVec::iterator it)
{
unsigned int val = getInt4(it);
unsigned int valPrime = 0xffffffff &
~(((val & 0xfffffff8) >> 3) +
((val & 0x00000007) << 29));
putInt4(it, valPrime);
}
}
DatFile::DatFile()
{
clear();
}
DatFile::~DatFile()
{
}
void DatFile::clear()
{
m_bInit = false;
m_ver = OxydVersion_Oxyd1;
m_credits.clear();
m_codes.clear();
m_levels.clear();
m_levels.resize(200);
m_chunks.clear();
}
void DatFile::getChunkNames(set<string> *pChunkNames) const
{
pChunkNames->clear();
ChunkMap::const_iterator iter = m_chunks.begin();
ChunkMap::const_iterator end = m_chunks.end();
for (; iter != end; ++iter) {
pChunkNames->insert(iter->first);
}
}
void DatFile::addChunk(const string &chunkName)
{
m_chunks[chunkName];
}
void DatFile::removeChunk(const string &chunkName)
{
m_chunks.erase(chunkName);
}
const ByteVec *DatFile::getChunk(const string &chunkName) const
{
ChunkMap::const_iterator iter = m_chunks.find(chunkName);
if (iter == m_chunks.end()) {
return 0;
} else {
return &iter->second;
}
}
ByteVec *DatFile::getChunkForWrite(const string &chunkName)
{
ChunkMap::iterator iter = m_chunks.find(chunkName);
if (iter == m_chunks.end()) {
return 0;
} else {
return &iter->second;
}
}
namespace
{
bool uncompressChunk(const ByteVec &in,
ByteVec *pOut,
string *pMsg)
{
string msg;
if (!pMsg) {
pMsg = &msg;
}
ByteVec &out = *pOut;
int compressedSize = in.size();
int uncompressedSize = out.size();
if (compressedSize == uncompressedSize) {
copy(in.begin(), in.end(), out.begin());
} else {
unsigned char keyByte = 0;
int curBit = 0;
int curIn = 0;
int curOut = 0;
int szIn = in.size();
int szOut = out.size();
while (curOut < szOut) {
if (curBit == 0) {
if (curIn + 1 > szIn) {
pMsg->assign("Not enough compressed data reading key byte.");
return false;
}
keyByte = in[curIn];
curIn++;
}
if (keyByte & (1 << curBit)) {
if (curIn + 1 > szIn) {
pMsg->assign("Not enough compressed data reading literal byte.");
return false;
}
unsigned char literalByte = in[curIn];
curIn++;
out[curOut] = literalByte;
curOut++;
} else {
if (curIn + 2 > szIn) {
pMsg->assign("Not enough compressed data reading compressed byte.");
return false;
}
unsigned char b1 = in[curIn];
curIn++;
unsigned char b2 = in[curIn];
curIn++;
int outBytes = ((int)(b2 & 0x0f)) + 3;
if (curOut + outBytes > szOut) {
pMsg->assign("Too much uncompressed data.");
return false;
}
int offset = ((int)b1) + ((((int)b2) & 0xf0) << 4);
offset = ((offset + 0x12) & 0x0fff);
offset |= (curOut & ~0x0fff);
if (offset >= curOut) {
offset -= 0x1000;
}
if (offset + outBytes < 0) {
pMsg->assign("Referencing data unnecessarily far before beginning of output.");
return false;
}
for (int i = 0; i < outBytes; i++) {
if (offset < 0) {
out[curOut] = 0x20;
} else {
out[curOut] = out[offset];
}
curOut++;
offset++;
}
}
curBit = ((curBit + 1) & 0x7);
}
if (curIn < szIn) {
pMsg->assign("Too much compressed data while uncompressing chunk.");
return false;
}
while (curBit != 0) {
if (keyByte & (1 << curBit)) {
pMsg->assign("Extra bit in compressed chunk key byte is not 0.");
return false;
}
curBit = ((curBit + 1) & 0x7);
}
}
return true;
}
}
bool parseDatFile(const ByteVec &in,
OxydVersion ver,
DatFile *pDatFile,
string *pMsg)
{
string msg;
if (!pMsg) {
pMsg = &msg;
}
pDatFile->clear();
pDatFile->setVersion(ver);
int sz = in.size();
int cur = 0;
if (cur + 600 + 4 + 4 + 400 > sz) {
pMsg->assign("File too small for header.");
return false;
}
ByteVec *pCredits = pDatFile->getCreditsForWrite();
pCredits->resize(600);
copy(in.begin() + cur, in.begin() + cur + 600, pCredits->begin());
cur += 600;
int levelSkip = getInt4(in.begin() + cur);
cur += 4;
if (levelSkip < (4 + 4 + 400)) {
pMsg->assign("Level skip value is too small.");
return false;
}
ByteVec *pCodes = pDatFile->getCodesForWrite();
pCodes->resize(4);
copy(in.begin() + cur, in.begin() + cur + 4, pCodes->begin());
cur += 4;
vector<int> levelSizes;
levelSizes.resize(200);
int levelSizeTotal = 0;
int nLevel;
for (nLevel = 0; nLevel < 200; nLevel++) {
int levelSize = getInt2(in.begin() + cur);
cur += 2;
levelSizes[nLevel] = levelSize;
levelSizeTotal += levelSize;
}
if (levelSkip != 4 + 4 + 400 + levelSizeTotal) {
pMsg->assign("Level skip value does not correspond to sum of level sizes.");
return false;
}
if (cur + levelSizeTotal > sz) {
pMsg->assign("File too small for levels.");
return false;
}
for (nLevel = 0; nLevel < 200; nLevel++) {
ByteVec *pLevelData = pDatFile->getLevelForWrite(nLevel);
pLevelData->resize(levelSizes[nLevel]);
copy(in.begin() + cur,
in.begin() + cur + levelSizes[nLevel],
pLevelData->begin());
unshiftBytes(pLevelData, ver);
cur += levelSizes[nLevel];
}
// Chunks
if (cur + 2 > sz) {
pMsg->assign("Not enough data reading number of chunks.");
return false;
}
int numChunks = getInt2(in.begin() + cur);
cur += 2;
if (cur + (24 * numChunks) > sz) {
pMsg->assign("Not enough data reading chunk table.");
return false;
}
vector<int> chunkCompressedSizes, chunkUncompressedSizes, chunkOffsets;
vector<string> chunkNames;
chunkCompressedSizes.resize(numChunks);
chunkUncompressedSizes.resize(numChunks);
chunkOffsets.resize(numChunks);
chunkNames.resize(numChunks);
int nChunk;
for (nChunk = 0; nChunk < numChunks; nChunk++) {
ByteVec chunkTableEntry;
chunkTableEntry.resize(24);
copy(in.begin() + cur, in.begin() + cur + 24,
chunkTableEntry.begin());
cur += 24;
for (int i = 0; i < 24; i += 4) {
unscrambleChunkTableData(chunkTableEntry.begin() + i);
}
chunkCompressedSizes[nChunk] = getInt4(chunkTableEntry.begin() + 0);
chunkUncompressedSizes[nChunk] = getInt4(chunkTableEntry.begin() + 4);
chunkOffsets[nChunk] = getInt4(chunkTableEntry.begin() + 8);
string &chunkName = chunkNames[nChunk];
for (int nChar = 0; nChar < 12; nChar++) {
char ch = chunkTableEntry[12 + nChar];
if ((int)chunkName.size() == nChar) {
if (ch != 0x00) {
chunkName.append(1, ch);
}
} else {
if (ch != 0x00) {
pMsg->assign("Chunk name has non-null byte after null byte.");
return false;
}
}
}
if (pDatFile->getChunk(chunkName)) {
pMsg->assign("Duplicate chunk name.");
return false;
}
pDatFile->addChunk(chunkName);
}
int chunkOffset = 2 + (24 * numChunks);
for (nChunk = 0; nChunk < numChunks; nChunk++) {
if (chunkOffset != chunkOffsets[nChunk]) {
pMsg->assign("Unexpected chunk starting point.");
return false;
}
int compressedSize = chunkCompressedSizes[nChunk];
if (cur + compressedSize > sz) {
pMsg->assign("Not enough data reading chunk.");
return false;
}
ByteVec compressedChunk;
compressedChunk.resize(compressedSize);
copy(in.begin() + cur, in.begin() + cur + compressedSize,
compressedChunk.begin());
cur += compressedSize;
chunkOffset += compressedSize;
const string &chunkName = chunkNames[nChunk];
int uncompressedSize = chunkUncompressedSizes[nChunk];
ByteVec &uncompressedChunk = *pDatFile->getChunkForWrite(chunkName);
uncompressedChunk.resize(uncompressedSize);
if (!uncompressChunk(compressedChunk, &uncompressedChunk, pMsg)) {
return false;
}
}
if (cur < sz) {
pMsg->assign("Extra data after reading chunks.");
return false;
}
pDatFile->setInit(true);
return true;
}
namespace
{
bool compressChunk(const ByteVec &in,
ByteVec *pOut,
string *pMsg)
{
string msg;
if (!pMsg) {
pMsg = &msg;
}
ByteVec out;
// We could do some real compression here instead.
out.resize(in.size());
copy(in.begin(), in.end(), out.begin());
pOut->resize(out.size());
copy(out.begin(), out.end(), pOut->begin());
return true;
}
}
bool unparseDatFile(const DatFile &datFile,
ByteVec *pOut,
string *pMsg)
{
string msg;
if (!pMsg) {
pMsg = &msg;
}
if (!datFile.getInit()) {
pMsg->assign("DatFile not initialized.");
return false;
}
ByteVec out;
out.clear();
int cur = 0;
out.resize(out.size() + 600 + 4 + 4 + 400);
const ByteVec &credits = datFile.getCredits();
if (credits.size() != 600) {
pMsg->assign("Credits must be 600 bytes.");
return false;
}
copy(credits.begin(), credits.end(), out.begin() + cur);
cur += 600;
int levelSizeTotal = 0;
int nLevel;
for (nLevel = 0; nLevel < 200; nLevel++) {
levelSizeTotal += datFile.getLevel(nLevel).size();
}
putInt4(out.begin() + cur, 4 + 4 + 400 + levelSizeTotal);
cur += 4;
const ByteVec &codes = datFile.getCodes();
if (codes.size() != 4) {
pMsg->assign("Codes must be 4 bytes.");
return false;
}
copy(codes.begin(), codes.end(), out.begin() + cur);
cur += 4;
for (nLevel = 0; nLevel < 200; nLevel++) {
putInt2(out.begin() + cur, datFile.getLevel(nLevel).size());
cur += 2;
}
out.resize(out.size() + levelSizeTotal);
for (nLevel = 0; nLevel < 200; nLevel++) {
const ByteVec &level = datFile.getLevel(nLevel);
ByteVec encodedLevel;
encodedLevel.resize(level.size());
copy(level.begin(), level.end(),
encodedLevel.begin());
shiftBytes(&encodedLevel, datFile.getVersion());
copy(encodedLevel.begin(), encodedLevel.end(),
out.begin() + cur);
cur += level.size();
}
// Chunks
set<string> chunkNameSet;
datFile.getChunkNames(&chunkNameSet);
int numChunks = chunkNameSet.size();
vector<string> chunkNames;
vector<ByteVec> compressedChunks;
chunkNames.resize(numChunks);
compressedChunks.resize(numChunks);
int nChunk = 0;
set<string>::const_iterator chunkIter = chunkNameSet.begin();
set<string>::const_iterator chunkEnd = chunkNameSet.end();
for (; chunkIter != chunkEnd; ++chunkIter) {
const string &chunkName = *chunkIter;
chunkNames[nChunk] = chunkName;
if (!compressChunk(*datFile.getChunk(chunkName),
&compressedChunks[nChunk],
pMsg)) {
return false;
}
nChunk++;
}
out.resize(out.size() + 2 + (24 * numChunks));
putInt2(out.begin() + cur, numChunks);
cur += 2;
int chunkOffset = 2 + (24 * numChunks);
for (nChunk = 0; nChunk < numChunks; nChunk++) {
ByteVec chunkTableEntry;
chunkTableEntry.resize(24);
const string &chunkName = chunkNames[nChunk];
int uncompressedSize = datFile.getChunk(chunkName)->size();
int compressedSize = compressedChunks[nChunk].size();
putInt4(chunkTableEntry.begin(), compressedSize);
putInt4(chunkTableEntry.begin() + 4, uncompressedSize);
putInt4(chunkTableEntry.begin() + 8, chunkOffset);
if (chunkName.size() > 12) {
pMsg->assign("Chunk name too long.");
return false;
}
for (int nChar = 0; nChar < 12; nChar++) {
char ch = 0x00;
if (nChar < (int)chunkName.size()) {
ch = chunkName[nChar];
}
chunkTableEntry[12 + nChar] = ch;
}
for (int i = 0; i < 24; i += 4) {
scrambleChunkTableData(chunkTableEntry.begin() + i);
}
copy(chunkTableEntry.begin(), chunkTableEntry.end(), out.begin() + cur);
cur += 24;
chunkOffset += compressedSize;
}
for (nChunk = 0; nChunk < numChunks; nChunk++) {
const ByteVec &compressedChunk = compressedChunks[nChunk];
int compressedSize = compressedChunk.size();
out.resize(out.size() + compressedSize);
copy(compressedChunk.begin(),
compressedChunk.end(),
out.begin() + cur);
cur += compressedSize;
}
if (cur != (int)out.size()) {
pMsg->assign("Error computing size of unparsed data file.");
return false;
}
pOut->clear();
pOut->resize(out.size());
copy(out.begin(), out.end(), pOut->begin());
return true;
}
}

84
project/jni/application/enigma/lib-src/oxydlib/DatFile.h Normal file
View File

@@ -0,0 +1,84 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef DATFILE_H
#define DATFILE_H
#include "VecUtils.h"
#include "OxydVersion.h"
#include <string>
#include <set>
#include <map>
namespace OxydLib {
class DatFile
{
public:
DatFile();
~DatFile();
void clear();
bool getInit() const { return m_bInit; }
void setInit(bool bInit) { m_bInit = bInit; }
OxydVersion getVersion() const { return m_ver; }
void setVersion(OxydVersion ver) { m_ver = ver; }
const ByteVec &getCredits() const { return m_credits; }
ByteVec *getCreditsForWrite() { return &m_credits; }
const ByteVec &getCodes() const { return m_codes; }
ByteVec *getCodesForWrite() { return &m_codes; }
const ByteVec &getLevel(int nLevel) const { return m_levels[nLevel]; }
ByteVec *getLevelForWrite(int nLevel) { return &m_levels[nLevel]; }
void getChunkNames(std::set<std::string> *pChunkNames) const;
void addChunk(const std::string &chunkName);
void removeChunk(const std::string &chunkName);
const ByteVec *getChunk(const std::string &chunkName) const;
ByteVec *getChunkForWrite(const std::string &chunkName);
private:
bool m_bInit;
OxydVersion m_ver;
ByteVec m_credits;
ByteVec m_codes;
std::vector<ByteVec> m_levels;
typedef std::map<std::string, ByteVec> ChunkMap;
ChunkMap m_chunks;
};
bool parseDatFile(const ByteVec &in,
OxydVersion ver,
DatFile *pDatFile,
std::string *pMsg = 0);
bool unparseDatFile(const DatFile &datFile,
ByteVec *pOut,
std::string *pMsg = 0);
}
#endif

81
project/jni/application/enigma/lib-src/oxydlib/FileUtils.cpp Normal file
View File

@@ -0,0 +1,81 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include "FileUtils.h"
#include <stdio.h>
namespace OxydLib {
using namespace std;
bool readFile(const string &fileName, ByteVec *pBuf)
{
pBuf->clear();
FILE *inFile = fopen(fileName.c_str(), "rb");
if (!inFile) {
return false;
}
while (!feof(inFile)) {
unsigned char tmpBuf[65536];
int count = fread(tmpBuf,
sizeof(unsigned char),
65536,
inFile);
if (count == 0) {
fclose(inFile);
return false;
}
int ii;
for (ii = 0; ii < count; ii++) {
pBuf->push_back(tmpBuf[ii]);
}
}
fclose(inFile);
return true;
}
bool writeFile(const string &fileName, const ByteVec &data)
{
FILE *outFile = fopen(fileName.c_str(), "wb");
if (!outFile) {
return false;
}
int count = fwrite(&data[0], //.begin(),
sizeof(unsigned char),
data.size(),
outFile);
if (count != (int)data.size()) {
fclose(outFile);
return false;
}
fclose(outFile);
return true;
}
}

34
project/jni/application/enigma/lib-src/oxydlib/FileUtils.h Normal file
View File

@@ -0,0 +1,34 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef FILEUTILS_H
#define FILEUTILS_H
#include "VecUtils.h"
#include <string>
namespace OxydLib {
using std::string;
bool readFile(const string &fileName, ByteVec *pBuffer);
bool writeFile(const string &fileName, const ByteVec &data);
}
#endif

2978
project/jni/application/enigma/lib-src/oxydlib/Level.cpp Normal file
View File

File diff suppressed because it is too large Load Diff

482
project/jni/application/enigma/lib-src/oxydlib/Level.h Normal file
View File

@@ -0,0 +1,482 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef LEVEL_H
#define LEVEL_H
#include "VecUtils.h"
#include <string>
#include <set>
#include <map>
namespace OxydLib {
// using std::string;
// using std::set;
// using std::map;
enum Language
{
Language_Invalid = -1,
Language_First = 0,
Language_German = Language_First,
Language_English,
Language_French,
Language_International,
Language_Count,
Language_Last = Language_Count - 1
};
enum GameMode
{
GameMode_Invalid = -1,
GameMode_First = 0,
GameMode_Hard = GameMode_First,
GameMode_Easy,
GameMode_Count,
GameMode_Last = GameMode_Count - 1
};
enum GridType
{
GridType_Invalid = -1,
GridType_First = 0,
GridType_Surfaces = GridType_First,
GridType_Pieces,
GridType_Objects,
GridType_Count,
GridType_Last = GridType_Count - 1
};
enum MarbleType
{
MarbleType_Invalid = -1,
MarbleType_First = 0,
MarbleType_Black = MarbleType_First,
MarbleType_White,
MarbleType_Meditation,
MarbleType_Horse,
MarbleType_Jack,
MarbleType_LifeSpitter,
MarbleType_DynamiteHolder,
MarbleType_Rotor, /* Oxyd 1 */
MarbleType_Bug, /* Oxyd 1 */
MarbleType_Count,
MarbleType_Last = MarbleType_Count - 1
};
class Marble
{
public:
Marble();
~Marble();
MarbleType getMarbleType() const { return m_marbleType; }
void setMarbleType(MarbleType marbleType) { m_marbleType = marbleType; }
unsigned int getX() const { return m_x; }
void setX(unsigned int x) { m_x = x; }
unsigned int getY() const { return m_y; }
void setY(unsigned int y) { m_y = y; }
const std::string &getData(GameMode gameMode) const { return m_data[gameMode]; }
std::string *getDataForWrite(GameMode gameMode) { return &m_data[gameMode]; }
private:
MarbleType m_marbleType;
unsigned int m_x;
unsigned int m_y;
std::string m_data[GameMode_Count];
};
class RubberBand
{
public:
RubberBand();
~RubberBand();
int getNaturalLength() const { return m_naturalLength; }
void setNaturalLength(int naturalLength) { m_naturalLength = naturalLength; }
int getForce() const { return m_force; }
void setForce(int force) { m_force = force; }
int getFirstEndMarble() const { return m_firstEndMarble; }
void setFirstEndMarble(int nMarble) { m_firstEndMarble = nMarble; }
bool isSecondEndMarble() const { return m_bSecondEndIsMarble; }
int getSecondEndMarble() const { return m_secondEndMarble; }
void setSecondEndMarble(int nMarble);
unsigned int getSecondEndPieceX() const { return m_secondEndPieceX; }
unsigned int getSecondEndPieceY() const { return m_secondEndPieceY; }
void setSecondEndPiece(unsigned int x, unsigned int y);
bool operator == (const RubberBand &other) const;
bool operator != (const RubberBand &other) const;
private:
int m_naturalLength;
int m_force;
int m_firstEndMarble;
bool m_bSecondEndIsMarble;
int m_secondEndMarble;
unsigned int m_secondEndPieceX;
unsigned int m_secondEndPieceY;
};
class Block
{
public:
Block();
Block(unsigned int x, unsigned int y);
~Block();
unsigned int getX() const { return m_x; }
void setX(unsigned int x) { m_x = x; }
unsigned int getY() const { return m_y; }
void setY(unsigned int y) { m_y = y; }
bool operator < (const Block &other) const;
bool operator == (const Block &other) const;
bool operator != (const Block &other) const;
private:
unsigned int m_x;
unsigned int m_y;
};
enum Direction
{
Direction_Invalid = -1,
Direction_First = 0,
Direction_Up = Direction_First,
Direction_Down,
Direction_Left,
Direction_Right,
Direction_Count,
Direction_Last = Direction_Count - 1
};
class ScrambleItem
{
public:
ScrambleItem();
ScrambleItem(unsigned int x, unsigned int y, Direction dir);
~ScrambleItem();
unsigned int getX() const { return m_x; }
void setX(unsigned int x) { m_x = x; }
unsigned int getY() const { return m_y; }
void setY(unsigned int y) { m_y = y; }
Direction getDir() const { return m_dir; }
void setDir(Direction dir) { m_dir = dir; }
private:
unsigned int m_x;
unsigned int m_y;
Direction m_dir;
};
class Laser
{
public:
Laser();
Laser(Direction dir, bool bOn);
~Laser();
Direction getDir() const { return m_dir; }
void setDir(Direction dir) { m_dir = dir; }
bool getOn() const { return m_bOn; }
void setOn(bool bOn) { m_bOn = bOn; }
bool operator == (const Laser &other) const;
bool operator != (const Laser &other) const;
private:
Direction m_dir;
bool m_bOn;
};
class Oscillator
{
public:
Oscillator();
Oscillator(unsigned int period, bool bOn);
~Oscillator();
unsigned int getPeriod() const { return m_period; }
void setPeriod(unsigned int period) { m_period = period; }
bool getOn() const { return m_bOn; }
void setOn(bool bOn) { m_bOn = bOn; }
bool operator == (const Oscillator &other) const;
bool operator != (const Oscillator &other) const;
private:
unsigned int m_period;
bool m_bOn;
};
typedef std::map<Block, Oscillator> OscillatorMap;
class SignalLocation
{
public:
SignalLocation();
SignalLocation(unsigned int x, unsigned int y, GridType gridType);
~SignalLocation();
unsigned int getX() const { return m_x; }
void setX(unsigned int x) { m_x = x; }
unsigned int getY() const { return m_y; }
void setY(unsigned int y) { m_y = y; }
GridType getGridType() const { return m_gridType; }
void setGridType(GridType gridType) { m_gridType = gridType; }
bool operator < (const SignalLocation &other) const;
bool operator == (const SignalLocation &other) const;
bool operator != (const SignalLocation &other) const
{ return !(*this == other); }
private:
unsigned int m_x;
unsigned int m_y;
GridType m_gridType;
};
class Grid
{
public:
Grid();
Grid(int width, int height);
~Grid();
unsigned int getWidth() const { return m_width; }
unsigned int getHeight() const { return m_height; }
private:
friend class Level;
void resize(unsigned int width, unsigned int height);
public:
unsigned char get(unsigned int x, unsigned int y) const;
void set(unsigned int x, unsigned int y, unsigned char val);
private:
unsigned int m_width;
unsigned int m_height;
ByteVec m_data;
};
class Level
{
public:
Level();
~Level();
void clear();
bool getInit() const { return m_bInit; }
void setInit(bool bInit) { m_bInit = bInit; }
bool isEmpty() const { return m_bEmpty; }
void setEmpty(bool bEmpty) { m_bEmpty = bEmpty; }
unsigned int getWidth() const { return m_width; }
unsigned int getHeight() const { return m_height; }
void resize(unsigned int width, unsigned int height);
bool getMeditation() const { return m_bMeditation; }
void setMeditation(bool bMeditation) { m_bMeditation = bMeditation; }
bool getHarmlessMeditationMarbles() const
{ return m_bHarmlessMeditationMarbles; }
void setHarmlessMeditationMarbles(bool bHarmlessMeditationMarbles)
{ m_bHarmlessMeditationMarbles = bHarmlessMeditationMarbles; }
size_t getNumMarbles() const { return m_marbles.size(); }
void setNumMarbles(int num) { m_marbles.resize(num); }
const Marble &getMarble(int nMarble) const { return m_marbles[nMarble]; }
Marble *getMarbleForWrite(int nMarble) { return &m_marbles[nMarble]; }
int getNumRubberBands(GameMode gameMode) const;
const RubberBand &getRubberBand(GameMode gameMode, int nRubberBand) const;
RubberBand *getRubberBandForWrite(GameMode gameMode, int nRubberBand);
void addRubberBand(GameMode gameMode,
const RubberBand &rubberBand,
int nRubberBand = -1);
void removeRubberBand(GameMode gameMode, int nRubberBand);
int getBlackRubberBandPieceNaturalLength(GameMode gameMode) const;
void setBlackRubberBandPieceNaturalLength(GameMode gameMode,
int naturalLength);
int getBlackRubberBandPieceForce(GameMode gameMode) const;
void setBlackRubberBandPieceForce(GameMode gameMode, int force);
int getWhiteRubberBandPieceNaturalLength(GameMode gameMode) const;
void setWhiteRubberBandPieceNaturalLength(GameMode gameMode,
int naturalLength);
int getWhiteRubberBandPieceForce(GameMode gameMode) const;
void setWhiteRubberBandPieceForce(GameMode gameMode, int force);
int getRubberBandObjectNaturalLength(GameMode gameMode) const;
void setRubberBandObjectNaturalLength(GameMode gameMode, int naturalLength);
int getRubberBandObjectForce(GameMode gameMode) const;
void setRubberBandObjectForce(GameMode gameMode, int force);
int getBlackRubberBandObjectMarble() const;
void setBlackRubberBandObjectMarble(int nMarble);
int getWhiteRubberBandObjectMarble() const;
void setWhiteRubberBandObjectMarble(int nMarble);
bool getRequireMagicPiece() const
{ return m_bRequireMagicPiece; }
void setRequireMagicPiece(bool bRequireMagicPiece)
{ m_bRequireMagicPiece = bRequireMagicPiece; }
bool getScrolling() const { return m_bScrolling; }
void setScrolling(bool bScrolling) { m_bScrolling = bScrolling; }
bool getReset(GameMode gameMode) const
{ return m_bReset[gameMode]; }
void setReset(GameMode gameMode, bool bReset)
{ m_bReset[gameMode] = bReset; }
bool getWalkThroughPuzzle() const
{ return m_bWalkThroughPuzzle; }
void setWalkThroughPuzzle(bool bWalkThroughPuzzle)
{ m_bWalkThroughPuzzle = bWalkThroughPuzzle; }
int getFlatForce(GameMode gameMode) const
{ return m_flatForce[gameMode]; }
void setFlatForce(GameMode gameMode, int flatForce)
{ m_flatForce[gameMode] = flatForce; }
int getSlopeForce(GameMode gameMode) const
{ return m_slopeForce[gameMode]; }
void setSlopeForce(GameMode gameMode, int slopeForce)
{ m_slopeForce[gameMode] = slopeForce; }
int getFriction(GameMode gameMode) const
{ return m_friction[gameMode]; }
void setFriction(GameMode gameMode, int friction)
{ m_friction[gameMode] = friction; }
int getNumScrambleItems() const;
const ScrambleItem &getScrambleItem(int nScrambleItem) const;
ScrambleItem *getScrambleItemForWrite(int nScrambleItem);
void addScrambleItem(const ScrambleItem &scrambleItem,
int nScrambleItem = -1);
void removeScrambleItem(int nScrambleItem);
const Laser &getLaser(int nLaser) const;
void setLaser(int nLaser, const Laser &laser);
const OscillatorMap &getOscillators(GameMode gameMode) const;
OscillatorMap *getOscillatorsForWrite(GameMode gameMode);
const std::string &getNoteText(int nNote, Language lang) const;
void setNoteText(int nNote, Language lang, const std::string &noteText);
const Grid &getGrid(GridType gridType) const { return m_grids[gridType]; }
Grid *getGridForWrite(GridType gridType) { return &m_grids[gridType]; }
const std::vector<std::string> &getSpecialItems() const { return m_specialItems; }
std::vector<std::string> *getSpecialItemsForWrite() { return &m_specialItems; }
void getSenders(std::set<SignalLocation> *pSenders) const;
int getNumRecipients(const SignalLocation &sender) const;
const SignalLocation &getRecipient(const SignalLocation &sender,
int nRecipient) const;
void setRecipient(const SignalLocation &sender,
int nRecipient,
const SignalLocation &recipient);
void addRecipient(const SignalLocation &sender,
const SignalLocation &recipient,
int nRecipient = -1);
void removeRecipient(const SignalLocation &sender,
int nRecipient);
private:
bool m_bInit;
bool m_bEmpty;
unsigned int m_width;
unsigned int m_height;
bool m_bMeditation;
bool m_bHarmlessMeditationMarbles;
std::vector<Marble> m_marbles;
std::vector<RubberBand> m_rubberBands[GameMode_Count];
int m_blackRubberBandPieceNaturalLength[GameMode_Count];
int m_blackRubberBandPieceForce[GameMode_Count];
int m_whiteRubberBandPieceNaturalLength[GameMode_Count];
int m_whiteRubberBandPieceForce[GameMode_Count];
int m_rubberBandObjectNaturalLength[GameMode_Count];
int m_rubberBandObjectForce[GameMode_Count];
int m_blackRubberBandObjectMarble;
int m_whiteRubberBandObjectMarble;
bool m_bRequireMagicPiece;
bool m_bScrolling;
bool m_bReset[GameMode_Count];
bool m_bWalkThroughPuzzle;
int m_flatForce[GameMode_Count];
int m_slopeForce[GameMode_Count];
int m_friction[GameMode_Count];
std::vector<ScrambleItem> m_scrambleItems;
Laser m_lasers[3];
OscillatorMap m_oscillators[GameMode_Count];
std::string m_noteText[2][Language_Count];
Grid m_grids[GridType_Count];
std::vector<std::string> m_specialItems;
typedef std::map<SignalLocation, std::vector<SignalLocation> > SignalMap;
SignalMap m_signals;
};
bool parseNumberList(const std::string &str, std::vector<int> *pNumberList);
bool parseLevel(const ByteVec &in, Level *pLevel, std::string *pMsg = 0);
bool unparseLevel(const Level &level, ByteVec *pOut, std::string *pMsg = 0);
}
#endif

41
project/jni/application/enigma/lib-src/oxydlib/OxydVersion.h Normal file
View File

@@ -0,0 +1,41 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef OXYDVERSION_H
#define OXYDVERSION_H
namespace OxydLib {
enum OxydVersion
{
OxydVersion_Invalid = -1,
OxydVersion_First = 0,
OxydVersion_Oxyd1 = OxydVersion_First,
OxydVersion_OxydMagnum,
OxydVersion_OxydMagnumGold,
OxydVersion_PerOxyd,
OxydVersion_OxydExtra,
OxydVersion_Count,
OxydVersion_Last = OxydVersion_Count - 1
};
}
#endif

27
project/jni/application/enigma/lib-src/oxydlib/README Normal file
View File

@@ -0,0 +1,27 @@
General information
-------------------
OxydLib is a C++ library for reading and writing the data files
used by the Oxyd series of games by Dongleware. It is still a
work in progress. Some parts of the data files aren't properly
handled yet.
OxydLib was written by Jeremy Sawicki (jeremy AT sawicki DOT us).
Copying
-------
OxydLib is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
OxydLib 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 OxydLib; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

4
project/jni/application/enigma/lib-src/oxydlib/README.enigma Normal file
View File

@@ -0,0 +1,4 @@
This directory contains a slightly modified version of Jeremy Sawicki's
oxydlib. The original version can be downloaded from
http://www.sawicki.us/oxyd/.

79
project/jni/application/enigma/lib-src/oxydlib/VecUtils.cpp Normal file
View File

@@ -0,0 +1,79 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include "VecUtils.h"
namespace OxydLib {
unsigned int getInt2(ByteVec::const_iterator it)
{
return (((unsigned int)(*it)) << 8) |
(((unsigned int)(*(it + 1))));
}
unsigned int getInt4(ByteVec::const_iterator it)
{
return (((unsigned int)(*it)) << 24) |
(((unsigned int)(*(it + 1))) << 16) |
(((unsigned int)(*(it + 2))) << 8) |
(((unsigned int)(*(it + 3))));
}
void putInt2(ByteVec::iterator it, unsigned int ii)
{
*it = (unsigned char)((ii & 0xff00) >> 8);
*(it + 1) = (unsigned char)((ii & 0x00ff));
}
void putInt4(ByteVec::iterator it, unsigned int ii)
{
*it = (unsigned char)((ii & 0xff000000) >> 24);
*(it + 1) = (unsigned char)((ii & 0x00ff0000) >> 16);
*(it + 2) = (unsigned char)((ii & 0x0000ff00) >> 8);
*(it + 3) = (unsigned char)((ii & 0x000000ff));
}
unsigned int getInt2Reversed(ByteVec::const_iterator it)
{
return (((unsigned int)(*it))) |
(((unsigned int)(*(it + 1))) << 8);
}
unsigned int getInt4Reversed(ByteVec::const_iterator it)
{
return (((unsigned int)(*it))) |
(((unsigned int)(*(it + 1))) << 8) |
(((unsigned int)(*(it + 2))) << 16) |
(((unsigned int)(*(it + 3))) << 24);
}
void putInt2Reversed(ByteVec::iterator it, unsigned int ii)
{
*it = (unsigned char)((ii & 0x00ff));
*(it + 1) = (unsigned char)((ii & 0xff00) >> 8);
}
void putInt4Reversed(ByteVec::iterator it, unsigned int ii)
{
*it = (unsigned char)((ii & 0x000000ff));
*(it + 1) = (unsigned char)((ii & 0x0000ff00) >> 8);
*(it + 2) = (unsigned char)((ii & 0x00ff0000) >> 16);
*(it + 3) = (unsigned char)((ii & 0xff000000) >> 24);
}
}

42
project/jni/application/enigma/lib-src/oxydlib/VecUtils.h Normal file
View File

@@ -0,0 +1,42 @@
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib 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 OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#ifndef VECUTILS_H
#define VECUTILS_H
#include <vector>
namespace OxydLib {
typedef std::vector<unsigned char> ByteVec;
unsigned int getInt2(ByteVec::const_iterator it);
unsigned int getInt4(ByteVec::const_iterator it);
void putInt2(ByteVec::iterator it, unsigned int ii);
void putInt4(ByteVec::iterator it, unsigned int ii);
unsigned int getInt2Reversed(ByteVec::const_iterator it);
unsigned int getInt4Reversed(ByteVec::const_iterator it);
void putInt2Reversed(ByteVec::iterator it, unsigned int ii);
void putInt4Reversed(ByteVec::iterator it, unsigned int ii);
}
#endif