Baumstumpf (31.12.2011), CrY2011 (01.01.2012), d3nni (28.01.2012), DnL (02.03.2012), Extraordinaire (31.12.2011), GXC1 (31.12.2011), Invicible (28.01.2012), Manipulate (28.01.2012), Quarktasche (25.01.2012), rVs14 (31.12.2011), Superlowbubx1337 (03.01.2012), ViiRuZx3 (31.12.2011)
Thema: [0.2d] KNDeKaDeNz.Client
-
31.12.2011, 14:34 #1
- Registriert seit
- 19.12.2011
- Beiträge
- 356
Thanked 164 Times in 101 Posts[0.2d] KNDeKaDeNz.Client
Weiterentwicklung wurde gestoppt!
Spoiler:Geändert von DeKaDeNz (30.01.2012 um 13:01 Uhr)
-
The Following 13 Users Say Thank You to DeKaDeNz For This Useful Post:
-
31.12.2011, 14:38 #2
AW: [BETA-v0.1b] KNDeKaDeNz.Client
Schön, dass sich Leute noch Gedanken machen
Wobei ich mir eine andere Methode als hosts Manipulierung wünschen würde...„Es sind nicht unsere Fähigkeiten, die zeigen, wer wir wirklich sind, es sind unsere Entscheidungen.“
- Albus Dumbledore, Harry Potter 2
/guestchat registerGuest
-
-
31.12.2011, 14:42 #3
- Registriert seit
- 19.12.2011
- Beiträge
- 356
Thanked 164 Times in 101 PostsAW: [BETA-v0.1b] KNDeKaDeNz.Client
Es stimmt. Ich wollte es aber möglichst Plattformunabhänigig halten und es für Mono auch kompilieren. Um Linux etc zu supporten. Da fällt WinPCAP nunmal raus. Und was das hooken der Sockets angeht, so müsste ich entweder für jede JavaVersion eine Version schreiben oder halt für jedes Betriebssystem und ggf. deren Versionen.
Geändert von DeKaDeNz (31.12.2011 um 14:44 Uhr)
-
31.12.2011, 14:52 #4
AW: [BETA-v0.1b] KNDeKaDeNz.Client
-
31.12.2011, 14:55 #5
- Registriert seit
- 19.12.2011
- Beiträge
- 356
Thanked 164 Times in 101 PostsAW: [BETA-v0.1b] KNDeKaDeNz.Client
pcap ist aber nicht für jede linux distro kompiliert. Dann müsste man es ggf. noch für jede Linux Distro kompilieren und dann kommt es am Ende auch dazu dass ich 1000 anbieten muss.
Aber ja ich habe absolut keine Ahnung^^
Und es gibt ja auch noch MAC.
Letztendlich bleibt es Geschmackssache. Ich habe es nunmal per hosts gemacht.
-
31.12.2011, 15:09 #6
AW: [BETA-v0.1b] KNDeKaDeNz.Client
Okay. Andere Sache. Technisch gesehen: Du musst doch eigentlich auf die KLib/Whatever zugreifen um die Huffmannkomprimierung zu decomprimieren, oder? Die En-/Decodierung sollte ja bekannt sein. Oder bin ich da nicht mehr auf dem aktuellen Stand?
„Es sind nicht unsere Fähigkeiten, die zeigen, wer wir wirklich sind, es sind unsere Entscheidungen.“
- Albus Dumbledore, Harry Potter 2
/guestchat registerGuest
-
31.12.2011, 15:11 #7
- Registriert seit
- 19.12.2011
- Beiträge
- 356
Thanked 164 Times in 101 PostsAW: [BETA-v0.1b] KNDeKaDeNz.Client
Jap, derzeit läuft es noch über die KNLib. Werde aber sobald ich Zeit dafür habe, die Komprimierung und Decomprimierung versuchen zu rekonstruieren.
-
31.12.2011, 15:15 #8
AW: [BETA-v0.1b] KNDeKaDeNz.Client
Gute Arbeit. Ich hab kein Problem mit der manuellen Host-Manipulation. Bin schon gespannt, was man noch von dir lesen wird.
-
31.12.2011, 15:16 #9
- Registriert seit
- 19.12.2011
- Beiträge
- 356
Thanked 164 Times in 101 PostsAW: [BETA-v0.1b] KNDeKaDeNz.Client
Später wird es das Programm auch fragen ob es die selber setzen soll. Habe es aber erstmal draussen gelassen damit die User auch ein bisschen denken dürfen.
-
31.12.2011, 15:18 #10
AW: [BETA-v0.1b] KNDeKaDeNz.Client
Lizenz:
- MiBot Project License -
Copyrighted by www.MiBot.us
THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS CREATIVE COMMONS PUBLIC LICENSE ("CCPL" OR "LICENSE"). THE WORK IS PROTECTED BY COPYRIGHT AND/OR OTHER APPLICABLE LAW. ANY USE OF THE WORK OTHER THAN AS AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS PROHIBITED.
BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED HERE, YOU ACCEPT AND AGREE TO BE BOUND BY THE TERMS OF THIS LICENSE. TO THE EXTENT THIS LICENSE MAY BE CONSIDERED TO BE A CONTRACT, THE LICENSOR GRANTS YOU THE RIGHTS CONTAINED HERE IN CONSIDERATION OF YOUR ACCEPTANCE OF SUCH TERMS AND CONDITIONS.
1. Definitions
1. "Adaptation" means a work based upon the Work, or upon the Work and other pre-existing works, such as a translation, adaptation, derivative work, arrangement of music or other alterations of a literary or artistic work, or phonogram or performance and includes cinematographic adaptations or any other form in which the Work may be recast, transformed, or adapted including in any form recognizably derived from the original, except that a work that constitutes a Collection will not be considered an Adaptation for the purpose of this License. For the avoidance of doubt, where the Work is a musical work, performance or phonogram, the synchronization of the Work in timed-relation with a moving image ("synching") will be considered an Adaptation for the purpose of this License.
2. "Collection" means a collection of literary or artistic works, such as encyclopedias and anthologies, or performances, phonograms or broadcasts, or other works or subject matter other than works listed in Section 1(g) below, which, by reason of the selection and arrangement of their contents, constitute intellectual creations, in which the Work is included in its entirety in unmodified form along with one or more other contributions, each constituting separate and independent works in themselves, which together are assembled into a collective whole. A work that constitutes a Collection will not be considered an Adaptation (as defined above) for the purposes of this License.
3. "Distribute" means to make available to the public the original and copies of the Work or Adaptation, as appropriate, through sale or other transfer of ownership.
4. "License Elements" means the following high-level license attributes as selected by Licensor and indicated in the title of this License: Attribution, Noncommercial, ShareAlike.
5. "Licensor" means the individual, individuals, entity or entities that offer(s) the Work under the terms of this License.
6. "Original Author" means, in the case of a literary or artistic work, the individual, individuals, entity or entities who created the Work or if no individual or entity can be identified, the publisher; and in addition (i) in the case of a performance the actors, singers, musicians, dancers, and other persons who act, sing, deliver, declaim, play in, interpret or otherwise perform literary or artistic works or expressions of folklore; (ii) in the case of a phonogram the producer being the person or legal entity who first fixes the sounds of a performance or other sounds; and, (iii) in the case of broadcasts, the organization that transmits the broadcast.
7. "Work" means the literary and/or artistic work offered under the terms of this License including without limitation any production in the literary, scientific and artistic domain, whatever may be the mode or form of its expression including digital form, such as a book, pamphlet and other writing; a lecture, address, sermon or other work of the same nature; a dramatic or dramatico-musical work; a choreographic work or entertainment in dumb show; a musical composition with or without words; a cinematographic work to which are assimilated works expressed by a process analogous to cinematography; a work of drawing, painting, architecture, sculpture, engraving or lithography; a photographic work to which are assimilated works expressed by a process analogous to photography; a work of applied art; an illustration, map, plan, sketch or three-dimensional work relative to geography, topography, architecture or science; a performance; a broadcast; a phonogram; a compilation of data to the extent it is protected as a copyrightable work; or a work performed by a variety or circus performer to the extent it is not otherwise considered a literary or artistic work.
8. "You" means an individual or entity exercising rights under this License who has not previously violated the terms of this License with respect to the Work, or who has received express permission from the Licensor to exercise rights under this License despite a previous violation.
9. "Publicly Perform" means to perform public recitations of the Work and to communicate to the public those public recitations, by any means or process, including by wire or wireless means or public digital performances; to make available to the public Works in such a way that members of the public may access these Works from a place and at a place individually chosen by them; to perform the Work to the public by any means or process and the communication to the public of the performances of the Work, including by public digital performance; to broadcast and rebroadcast the Work by any means including signs, sounds or images.
10. "Reproduce" means to make copies of the Work by any means including without limitation by sound or visual recordings and the right of fixation and reproducing fixations of the Work, including storage of a protected performance or phonogram in digital form or other electronic medium.
2. Fair Dealing Rights. Nothing in this License is intended to reduce, limit, or restrict any uses free from copyright or rights arising from limitations or exceptions that are provided for in connection with the copyright protection under copyright law or other applicable laws.
3. License Grant. Subject to the terms and conditions of this License, Licensor hereby grants You a worldwide, royalty-free, non-exclusive, perpetual (for the duration of the applicable copyright) license to exercise the rights in the Work as stated below:
1. to Reproduce the Work, to incorporate the Work into one or more Collections, and to Reproduce the Work as incorporated in the Collections;
2. to create and Reproduce Adaptations provided that any such Adaptation, including any translation in any medium, takes reasonable steps to clearly label, demarcate or otherwise identify that changes were made to the original Work. For example, a translation could be marked "The original work was translated from English to Spanish," or a modification could indicate "The original work has been modified.";
3. to Distribute and Publicly Perform the Work including as incorporated in Collections; and,
4. to Distribute and Publicly Perform Adaptations.
The above rights may be exercised in all media and formats whether now known or hereafter devised. The above rights include the right to make such modifications as are technically necessary to exercise the rights in other media and formats. Subject to Section 8(f), all rights not expressly granted by Licensor are hereby reserved, including but not limited to the rights described in Section 4(e).
4. Restrictions. The license granted in Section 3 above is expressly made subject to and limited by the following restrictions:
1. You may Distribute or Publicly Perform the Work only under the terms of this License. You must include a copy of, or the Uniform Resource Identifier (URI) for, this License with every copy of the Work You Distribute or Publicly Perform. You may not offer or impose any terms on the Work that restrict the terms of this License or the ability of the recipient of the Work to exercise the rights granted to that recipient under the terms of the License. You may not sublicense the Work. You must keep intact all notices that refer to this License and to the disclaimer of warranties with every copy of the Work You Distribute or Publicly Perform. When You Distribute or Publicly Perform the Work, You may not impose any effective technological measures on the Work that restrict the ability of a recipient of the Work from You to exercise the rights granted to that recipient under the terms of the License. This Section 4(a) applies to the Work as incorporated in a Collection, but this does not require the Collection apart from the Work itself to be made subject to the terms of this License. If You create a Collection, upon notice from any Licensor You must, to the extent practicable, remove from the Collection any credit as required by Section 4(d), as requested. If You create an Adaptation, upon notice from any Licensor You must, to the extent practicable, remove from the Adaptation any credit as required by Section 4(d), as requested.
2. You may Distribute or Publicly Perform an Adaptation only under: (i) the terms of this License; (ii) a later version of this License with the same License Elements as this License; (iii) a Creative Commons jurisdiction license (either this or a later license version) that contains the same License Elements as this License (e.g., Attribution-NonCommercial-ShareAlike 3.0 US) ("Applicable License"). You must include a copy of, or the URI, for Applicable License with every copy of each Adaptation You Distribute or Publicly Perform. You may not offer or impose any terms on the Adaptation that restrict the terms of the Applicable License or the ability of the recipient of the Adaptation to exercise the rights granted to that recipient under the terms of the Applicable License. You must keep intact all notices that refer to the Applicable License and to the disclaimer of warranties with every copy of the Work as included in the Adaptation You Distribute or Publicly Perform. When You Distribute or Publicly Perform the Adaptation, You may not impose any effective technological measures on the Adaptation that restrict the ability of a recipient of the Adaptation from You to exercise the rights granted to that recipient under the terms of the Applicable License. This Section 4(b) applies to the Adaptation as incorporated in a Collection, but this does not require the Collection apart from the Adaptation itself to be made subject to the terms of the Applicable License.
3. You may not exercise any of the rights granted to You in Section 3 above in any manner that is primarily intended for or directed toward commercial advantage or private monetary compensation. The exchange of the Work for other copyrighted works by means of digital file-sharing or otherwise shall not be considered to be intended for or directed toward commercial advantage or private monetary compensation, provided there is no payment of any monetary compensation in con-nection with the exchange of copyrighted works.
4. If You Distribute, or Publicly Perform the Work or any Adaptations or Collections, You must, unless a request has been made pursuant to Section 4(a), keep intact all copyright notices for the Work and provide, reasonable to the medium or means You are utilizing: (i) the name of the Original Author (or pseudonym, if applicable) if supplied, and/or if the Original Author and/or Licensor designate another party or parties (e.g., a sponsor institute, publishing entity, journal) for attribution ("Attribution Parties") in Licensor's copyright notice, terms of service or by other reasonable means, the name of such party or parties; (ii) the title of the Work if supplied; (iii) to the extent reasonably practicable, the URI, if any, that Licensor specifies to be associated with the Work, unless such URI does not refer to the copyright notice or licensing information for the Work; and, (iv) consistent with Section 3(b), in the case of an Adaptation, a credit identifying the use of the Work in the Adaptation (e.g., "French translation of the Work by Original Author," or "Screenplay based on original Work by Original Author"). The credit required by this Section 4(d) may be implemented in any reasonable manner; provided, however, that in the case of a Adaptation or Collection, at a minimum such credit will appear, if a credit for all contributing authors of the Adaptation or Collection appears, then as part of these credits and in a manner at least as prominent as the credits for the other contributing authors. For the avoidance of doubt, You may only use the credit required by this Section for the purpose of attribution in the manner set out above and, by exercising Your rights under this License, You may not implicitly or explicitly assert or imply any connection with, sponsorship or endorsement by the Original Author, Licensor and/or Attribution Parties, as appropriate, of You or Your use of the Work, without the separate, express prior written permission of the Original Author, Licensor and/or Attribution Parties.
5.
For the avoidance of doubt:
1. Non-waivable Compulsory License Schemes. In those jurisdictions in which the right to collect royalties through any statutory or compulsory licensing scheme cannot be waived, the Licensor reserves the exclusive right to collect such royalties for any exercise by You of the rights granted under this License;
2. Waivable Compulsory License Schemes. In those jurisdictions in which the right to collect royalties through any statutory or compulsory licensing scheme can be waived, the Licensor reserves the exclusive right to collect such royalties for any exercise by You of the rights granted under this License if Your exercise of such rights is for a purpose or use which is otherwise than noncommercial as permitted under Section 4(c) and otherwise waives the right to collect royalties through any statutory or compulsory licensing scheme; and,
3. Voluntary License Schemes. The Licensor reserves the right to collect royalties, whether individually or, in the event that the Licensor is a member of a collecting society that administers voluntary licensing schemes, via that society, from any exercise by You of the rights granted under this License that is for a purpose or use which is otherwise than noncommercial as permitted under Section 4(c).
6. Except as otherwise agreed in writing by the Licensor or as may be otherwise permitted by applicable law, if You Reproduce, Distribute or Publicly Perform the Work either by itself or as part of any Adaptations or Collections, You must not distort, mutilate, modify or take other derogatory action in relation to the Work which would be prejudicial to the Original Author's honor or reputation. Licensor agrees that in those jurisdictions (e.g. Japan), in which any exercise of the right granted in Section 3(b) of this License (the right to make Adaptations) would be deemed to be a distortion, mutilation, modification or other derogatory action prejudicial to the Original Author's honor and reputation, the Licensor will waive or not assert, as appropriate, this Section, to the fullest extent permitted by the applicable national law, to enable You to reasonably exercise Your right under Section 3(b) of this License (right to make Adaptations) but not otherwise.
5. Representations, Warranties and Disclaimer
UNLESS OTHERWISE MUTUALLY AGREED TO BY THE PARTIES IN WRITING AND TO THE FULLEST EXTENT PERMITTED BY APPLICABLE LAW, LICENSOR OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE WORK, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS, WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION OF IMPLIED WARRANTIES, SO THIS EXCLUSION MAY NOT APPLY TO YOU.
6. Limitation on Liability. EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE LAW, IN NO EVENT WILL LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
7. Termination
1. This License and the rights granted hereunder will terminate automatically upon any breach by You of the terms of this License. Individuals or entities who have received Adaptations or Collections from You under this License, however, will not have their licenses terminated provided such individuals or entities remain in full compliance with those licenses. Sections 1, 2, 5, 6, 7, and 8 will survive any termination of this License.
2. Subject to the above terms and conditions, the license granted here is perpetual (for the duration of the applicable copyright in the Work). Notwithstanding the above, Licensor reserves the right to release the Work under different license terms or to stop distributing the Work at any time; provided, however that any such election will not serve to withdraw this License (or any other license that has been, or is required to be, granted under the terms of this License), and this License will continue in full force and effect unless terminated as stated above.
8. Miscellaneous
1. Each time You Distribute or Publicly Perform the Work or a Collection, the Licensor offers to the recipient a license to the Work on the same terms and conditions as the license granted to You under this License.
2. Each time You Distribute or Publicly Perform an Adaptation, Licensor offers to the recipient a license to the original Work on the same terms and conditions as the license granted to You under this License.
3. If any provision of this License is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this License, and without further action by the parties to this agreement, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable.
4. No term or provision of this License shall be deemed waived and no breach consented to unless such waiver or consent shall be in writing and signed by the party to be charged with such waiver or consent.
5. This License constitutes the entire agreement between the parties with respect to the Work licensed here. There are no understandings, agreements or representations with respect to the Work not specified here. Licensor shall not be bound by any additional provisions that may appear in any communication from You. This License may not be modified without the mutual written agreement of the Licensor and You.
6. The rights granted under, and the subject matter referenced, in this License were drafted utilizing the terminology of the Berne Convention for the Protection of Literary and Artistic Works (as amended on September 28, 1979), the Rome Convention of 1961, the WIPO Copyright Treaty of 1996, the WIPO Performances and Phonograms Treaty of 1996 and the Universal Copyright Convention (as revised on July 24, 1971). These rights and subject matter take effect in the relevant jurisdiction in which the License terms are sought to be enforced according to the corresponding provisions of the implementation of those treaty provisions in the applicable national law. If the standard suite of rights granted under applicable copyright law includes additional rights not granted under this License, such additional rights are deemed to be included in the License; this License is not intended to restrict the license of any rights under applicable law.
-------------------------------------------------------------------------------------------------------------------------------------
Copyright:
You can use german or english Copyright. The Copyright must be visible and good readable (size: 13 points, color: red) at any time in your work.
German:
- Dieses Projekt basiert auf dem MiBot Projekt von www.MiBot.us -
English:
- This project is based on the MiBot project from www.MiBot.us -
-------------------------------------------------------------------------------------------------------------------------------------
Here you can find a german summary of this license:
http://creativecommons.org/licenses/...sa/3.0/deed.de
PHP-Code:using System;
using System.Text;
using System.Collections.Generic;
/************************************************************************
* MiBot Library
*
* Date: 2009/03/30
* Autor: MiBot Devteam
*
* http://www.mibot.us
*
* You have to read and agree to the License.txt of this project.
************************************************************************/
namespace MiBotLogic.Protocol
{
/// <summary>
/// Klasse zur Komprimierung von empfangenen Byte Arrays
/// </summary>
public class Compression
{
// Hier wird der Binaerbaum für einen schnellen Zugriff gespeichert.
// Der Binärbaum enthält ein Stringpaar. D.h., es passt immer exakt ein
// String zu einem anderen. Der erste String enthält den Zugriffsindex,
// der zweite String den dazu passenden Teilstring.
Dictionary<string, string> _BinaryTree = new Dictionary<string, string>();
private int _CreateBinaryTreeHelper;
private byte[] _CompressedByteArray;
private int _IntToByteArrayHelper;
private int _ByteCounter;
/// <summary>
/// Klasse zur Komprimierung von Strings
/// </summary>
/// <param name="HuffmanString">Der Binärbaum-String</param>
public Compression( String HuffmannString ) {
_CompressedByteArray = new byte[65535];
_IntToByteArrayHelper = 0;
_ByteCounter = 0;
CreateBinaryTree( HuffmannString );
}
private void FillByteArray() {
int countBytes = _ByteCounter;
if ( _IntToByteArrayHelper != 0 )
while ( countBytes == _ByteCounter )
IntToByte( 134217856 ); // Diese Zahl kann sich jederzeit ändern
}
/// <summary>
/// Diese Funktion füllt das Byte Array, anhand eines Integers aus dem Binärbaum.
/// </summary>
/// <param name="toCompress">Integer aus dem Binärbaum</param>
private void IntToByte( int toCompress ) {
int byteCalcHelper = toCompress >> 24;
int byteCalc = toCompress - ( byteCalcHelper << 24 );
if ( _IntToByteArrayHelper != 0 && byteCalcHelper > 0 ) {
byteCalcHelper += _IntToByteArrayHelper - 8;
byteCalc <<= _IntToByteArrayHelper;
_CompressedByteArray[_ByteCounter++] += (byte) ( ( byteCalc % 256 ) ); // Dies macht aus dem Integer ein SByte (signed Byte)
byteCalc >>= 8;
_IntToByteArrayHelper = 0;
}
for ( ; byteCalcHelper > 0; byteCalcHelper -= 8 ) {
_CompressedByteArray[_ByteCounter++] = (byte) ( ( byteCalc % 256 ) ); // Dies macht aus dem Integer ein SByte (signed Byte)
byteCalc = byteCalc >> 8;
}
if ( byteCalcHelper < 0 ) {
_ByteCounter--;
_IntToByteArrayHelper = byteCalcHelper + 8;
}
}
/// <summary>
/// Hilft den Binärbaum zu errechnen.
/// Exakt die gleiche Methode befindet sich in Decompression.cs
/// und heisst dort SetTreeWay().
/// </summary>
/// <param name="TreeWay">Integer für den "Weg!"</param>
/// <param name="TreeDepth">Tiefe des Binärbaums</param>
/// <returns>Integer um den Weg des Binärbaums zu berechnen</returns>
private int SetTreeWay( int TreeWay, int TreeDepth ) {
int retInteger = 0;
int calcHelper = 1;
// <- "Baumtiefe" ->
// 12 = 2042
// 11 = 1024
// 10 = 512
// 9 = 256
// 8 = 128
// 2 ^ (j - 1)
int treeRoute = (int) ( Math.Pow( 2, TreeDepth - 1 ) );
for ( ; TreeDepth > 0; TreeDepth-- ) {
if ( ( TreeWay & calcHelper ) != 0 )
retInteger += treeRoute;
calcHelper <<= 1;
treeRoute >>= 1;
}
// Gibt eine Zahl zurück, an der der Baumweg berechnet werden kann
return retInteger;
}
/// <summary>
/// Komprimiert einen String und gibt das entsprechende Byte Array zurück.
/// </summary>
/// <param name="StringToCompress">String der komprimiert werden soll</param>
/// <returns>Komprimiertes Byte Array</returns>
public byte[] Compress( String StringToCompress ) {
// In diesem StringBuilder wird der temporäre String zum kodieren gebildet.
// Der Loop läuft so lange, wie die Zeichenfolge im Binärbaum vorhanden ist.
// Die Buchstaben werden immer einzeln angehängt.
StringBuilder tempStringBuilder = new StringBuilder();
// Hilft beim berechnen des Byte Arrays, welches am Ende zurückgegeben wird
byte[] returnByteCalc = null;
_IntToByteArrayHelper = 0;
_ByteCounter = 0;
int huffmanStringLength = StringToCompress.Length;
for ( int huffmanStringIndex = 0; huffmanStringIndex < huffmanStringLength; ) {
int huffmanStringIndexHelper = huffmanStringIndex + 1;
do {
// Wenn der komplette String durchlaufen ist wird die Schleife unterbrochen
if ( huffmanStringIndex >= huffmanStringLength )
break;
// Sucht den passenden Integer für einen String.
// Der String wird erzeugt, in dem immer 1 Zeichen dazugemacht wird und getestet wird
// ob diese Zeichenfolge im Dictionary vorhanden ist.
int charToCompress = StringToCompress[huffmanStringIndex];
if ( charToCompress < 256 ) { // Checkt ob das Zeichen ein Asciizeichen ist: '\u0100' == 256
tempStringBuilder.Append( StringToCompress[huffmanStringIndex] );
if ( _BinaryTree.ContainsKey( tempStringBuilder.ToString() ) ) {
huffmanStringIndexHelper = huffmanStringIndex + 1;
} else {
tempStringBuilder.Remove( tempStringBuilder.Length - 1, 1 );
break;
}
huffmanStringIndex++;
continue;
}
huffmanStringIndexHelper = huffmanStringIndex + 1;
huffmanStringIndex++;
} while ( true );
// Zum passenden String wurde ein Integer aus dem Dictionary geladen.
// Dieser wird an eine Methode übergeben und dort dann in ein Byte Array
// sinnvoll übertragen.
huffmanStringIndex = huffmanStringIndexHelper;
IntToByte( Convert.ToInt32( _BinaryTree[tempStringBuilder.ToString()] ) );
tempStringBuilder = new StringBuilder();
}
// Bereitet das Byte Array vor, welches am Schluss zurückgegeben wird und versendet
// werden kann.
FillByteArray();
int byteArrayCalc = 0;
if ( returnByteCalc != null )
byteArrayCalc = returnByteCalc.Length;
byte[] returnByte = new byte[_ByteCounter + byteArrayCalc];
if ( returnByteCalc != null ) {
Array.Copy( returnByteCalc, 0, returnByte, 0, byteArrayCalc );
}
Array.Copy( _CompressedByteArray, 0, returnByte, byteArrayCalc, _ByteCounter );
return returnByte;
}
/// <summary>
/// Erzeugt den Binärbaum in einem Dictionary für einen sauberen, einfachen, schnellen Zugriff
/// </summary>
/// <param name="HuffmanString">Der Binärbaum-String</param>
private void CreateBinaryTree( String HuffmanString ) {
// Die Stringlänge des Huffman-Strings, wird hier in einer Integer Variable definiert.
// Dies hat den Sinn, dass man nur ein mal die Funktion HuffmanString.Length aufrufen muss (performance...)
int huffmanStringLength = HuffmanString.Length;
int binaryTreeWay = 1;
int calcHelper = 0; // Weiss nicht wofür, kann 0 sein und was weiss ich nicht alles....
int leafLength; // Die Länge eines Strings von einem Blatt.
for ( int huffmanStringIndex = 0; huffmanStringIndex < huffmanStringLength; huffmanStringIndex += leafLength + 1 ) {
// In dieser Schleife werden die einzelnen Blätter des Binärbaums angelegt.
// Das Zeichen, welches hier eingelesen wird, gibt die Länge des Strings im Blatt an.
// Der Ascii-Wert des Zeichens stimmt mit der länge überein...
leafLength = HuffmanString[huffmanStringIndex];
if ( leafLength == 255 ) {
// Wenn die Ascii-Wertung des aktuellen Zeichens im String "255" beträgt, wird es anders behandelt.
// Wieso das so ist, weiss ich mal wieder nicht.
leafLength = HuffmanString[huffmanStringIndex + 1] * 256 + HuffmanString[huffmanStringIndex + 2];
huffmanStringIndex += 2;
}
// Dies gibt die Tiefe des Zweiges/Astes im Binärbaum an.
int binaryTreeDepth = leafLength % 21;
// Dies ist nun die eigentliche Länge des Strings im Blatt.
leafLength = leafLength / 21 + 1;
// Hier wird nun der eigentliche "Weg" im Binärbaum "errechnet".
// Dies funktioniert durch "binaryTreeWay" und die Tiefe, die später an eine
// weitere Funktion übergeben werden.
if ( ( binaryTreeWay & 1 ) == 0 ) {
// Wenn binaryTreeWay grade ist
binaryTreeWay++;
for ( ; calcHelper < binaryTreeDepth; calcHelper++ )
binaryTreeWay <<= 1;
} else {
// Wenn binaryTreeWay ungrade ist
while ( ( binaryTreeWay & 1 ) == 1 ) {
// So lange binaryTreeWay ungrade ist, wird 1 bit um rechts verschoben
binaryTreeWay >>= 1;
calcHelper--;
}
binaryTreeWay++;
for ( ; calcHelper < binaryTreeDepth; calcHelper++ )
// So lange calcHelper kleiner als binaryTreeDepth ist, wird binaryTreeWay um 1 nach
// links geshiftet
binaryTreeWay <<= 1;
}
int retTreeWay = SetTreeWay( binaryTreeWay, binaryTreeDepth ) + ( binaryTreeDepth << 24 );
String replaceString = HuffmanString.Substring( huffmanStringIndex + 1, leafLength );
if ( !_BinaryTree.ContainsKey( replaceString ) ) {
_BinaryTree.Add( replaceString, retTreeWay.ToString() );
}
if ( _CreateBinaryTreeHelper == 0 && binaryTreeDepth > 8 )
_CreateBinaryTreeHelper = SetTreeWay( binaryTreeWay >> binaryTreeDepth - 8, 8 ) + 0x8000000;
}
}
}
}
PHP-Code:using System;
using System.Text;
using System.Collections.Generic;
/************************************************************************
* MiBot Library
*
* Date: 2009/03/30
* Autor: MiBot Devteam
*
* http://www.mibot.us
*
* You have to read and agree to the License.txt of this project.
************************************************************************/
namespace MiBotLogic.Protocol
{
/// <summary>
/// Klasse zur Dekomprimierung von empfangenen Byte Arrays
/// </summary>
public class Decompression
{
// Hier wird der Binaerbaum für einen schnellen Zugriff gespeichert.
// Der Binärbaum enthält ein Stringpaar. D.h., es passt immer exakt ein
// String zu einem anderen. Der erste String enthält die "koordinaten" für
// die Knotenpunkte (also den Weg). Der String besteht aus einer Reihe von
// 1 und 0.
Dictionary<string, string> _BinaryTree = new Dictionary<string, string>();
// Dieser String dient dem Aufbau eines jeden Zweiges des Binärbaums.
StringBuilder _BinaryTreeHelper = new StringBuilder();
/// <summary>
/// Klasse zur Dekomprimierung von empfangenen Byte Arrays
/// </summary>
/// <param name="HuffmanString">Der Binärbaum-String</param>
public Decompression( String HuffmanString ) {
CreateBinaryTree( HuffmanString ); // Der Binärbaum wird erstellt
}
/// <summary>
/// Erzeugt den Binärbaum in einem Dictionary für einen sauberen, einfachen, schnellen Zugriff
/// </summary>
/// <param name="HuffmanString">Der Binärbaum-String</param>
private void CreateBinaryTree( String HuffmanString ) {
// Die Stringlänge des Huffman-Strings, wird hier in einer Integer Variable definiert.
// Dies hat den Sinn, dass man nur ein mal die Funktion HuffmanString.Length aufrufen muss (performance...)
int huffmanStringLength = HuffmanString.Length;
int binaryTreeWay = 1;
int calcHelper = 0; // Weiss nicht wofür, kann 0 sein und was weiss ich nicht alles....
int leafLength; // Die Länge eines Strings von einem Blatt.
for ( int huffmanStringIndex = 0; huffmanStringIndex < huffmanStringLength; huffmanStringIndex += leafLength + 1 ) {
// In dieser Schleife werden die einzelnen Blätter des Binärbaums angelegt.
// Das Zeichen, welches hier eingelesen wird, gibt die Länge des Strings im Blatt an.
// Der Ascii-Wert des Zeichens stimmt mit der länge überein...
leafLength = HuffmanString[huffmanStringIndex];
if ( leafLength == 255 ) {
// Wenn die Ascii-Wertung des aktuellen Zeichens im String "255" beträgt, wird es anders behandelt.
// Wieso das so ist, weiss ich mal wieder nicht.
leafLength = HuffmanString[huffmanStringIndex + 1] * 256 + HuffmanString[huffmanStringIndex + 2];
huffmanStringIndex += 2;
}
// Dies gibt die Tiefe des Zweiges/Astes im Binärbaum an.
int binaryTreeDepth = leafLength % 21;
// Dies ist nun die eigentliche Länge des Strings im Blatt.
leafLength = leafLength / 21 + 1;
// Hier wird nun der eigentliche "Weg" im Binärbaum "errechnet".
// Dies funktioniert durch "binaryTreeWay" und die Tiefe, die später an eine
// weitere Funktion übergeben werden.
if ( ( binaryTreeWay & 1 ) == 0 ) {
// Wenn binaryTreeWay grade ist
binaryTreeWay++;
for ( ; calcHelper < binaryTreeDepth; calcHelper++ )
binaryTreeWay <<= 1;
} else {
// Wenn binaryTreeWay ungrade ist
while ( ( binaryTreeWay & 1 ) == 1 ) {
// So lange binaryTreeWay ungrade ist, wird 1 bit um rechts verschoben
binaryTreeWay >>= 1;
calcHelper--;
}
binaryTreeWay++;
for ( ; calcHelper < binaryTreeDepth; calcHelper++ )
// So lange calcHelper kleiner als binaryTreeDepth ist, wird binaryTreeWay um 1 nach
// links geshiftet
binaryTreeWay <<= 1;
}
CreateBinaryLeaf( HuffmanString.Substring( huffmanStringIndex + 1, leafLength ), SetTreeWay( binaryTreeWay, binaryTreeDepth ), binaryTreeDepth );
}
}
/// <summary>
/// Hilft den Binärbaum zu errechnen.
/// Exakt die gleiche Methode befindet sich in Compression.cs
/// und heisst dort SetTreeWay().
/// </summary>
/// <param name="TreeWay">Integer für den "Weg!"</param>
/// <param name="TreeDepth">Tiefe des Binärbaums</param>
/// <returns>Integer um den Weg des Binärbaums zu berechnen</returns>
private int SetTreeWay( int TreeWay, int TreeDepth ) {
int retInteger = 0;
int calcHelper = 1;
// <- "Baumtiefe" ->
// 12 = 2048
// 11 = 1024
// 10 = 512
// 9 = 256
// 8 = 128
// 2 ^ (j - 1)
int treeRoute = (int) ( Math.Pow( 2, TreeDepth - 1 ) );
for ( ; TreeDepth > 0; TreeDepth-- ) {
if ( ( TreeWay & calcHelper ) != 0 )
retInteger += treeRoute;
calcHelper <<= 1;
treeRoute >>= 1;
}
// Gibt eine Zahl zurück, an der der Baumweg berechnet werden kann
return retInteger;
}
/// <summary>
/// Erzeugt ein "Blatt" im Binärbaum.
/// </summary>
/// <param name="replaceString">Wert des Blattes</param>
/// <param name="Way">Der Weg zum Blatt</param>
/// <param name="Depth">Tiefe bis zum Blatt</param>
private void CreateBinaryLeaf( String replaceString, int Way, int Depth ) {
// i & 1 = bitweiser Und (&) Operator
// -> i&1 = 1 -> ungrade Zahl, erstes bit ist gesetzt
// -> i&1 = 0 -> grade Zahl, erstes bit nicht gesetzt
// D.h. entweder eine 1 oder eine 0 wird angehängt
// -> Aufbau einer Verzweigung am Binärbaum
if ( Depth == 0 ) {
// Der Zweig ist "am Ende" und wird gespeichert
_BinaryTree.Add( _BinaryTreeHelper.ToString(), replaceString );
_BinaryTreeHelper = new StringBuilder();
return;
}
_BinaryTreeHelper.Append( Way & 1 );
CreateBinaryLeaf( replaceString, Way >> 1, Depth - 1 );
}
/// <summary>
/// Dekomprimiert ein empfangenes Byte Array und gibt den dekomprimierten String zurück.
/// </summary>
/// <param name="compressedByteArray">Komprimiertes Byte Array</param>
/// <returns>Dekomprimierter String</returns>
public string Decompress( byte[] compressedByteArray ) {
// Es werden Referenzen und keine globalen Deklarationen benutzt,
// da Referenzen laut Tests in diesem Fall eine bessere Performance haben.
// Die Variablen werden von einer HelperFunktion benötigt.
int runPointer = 0;
int bytePointer = 0;
bool endOfString = false;
if ( compressedByteArray == null ) {
return string.Empty;
}
// In diesem StringBuilder wird der dekomprimierte String gespeichert/erzeugt
StringBuilder decompressedStringBuilder = new StringBuilder( ( compressedByteArray.Length * 100 ) / 60 );
// Dieser String speichert die dekomprimierten Teilstrings
String replaceString;
// Dieser StringBuilder beinhaltet den Weg im Binärbaum.
_BinaryTreeHelper = new StringBuilder();
do {
// Diese "Endlosschleife" dekomprimiert das komplette erhaltene Byte Array.
// Wenn das Byte Array fertig durchlaufen/dekomprimiert ist,
// wird die Variable endOfString auf true gesetzt und der dekomprimierte
// String zurückgegeben.
if ( endOfString ) {
// Gebe den dekomprimierten String zurück
return decompressedStringBuilder.ToString();
}
// Es wird 1 oder 0 für den Knotenpunkt an den StringBuilder angehängt
_BinaryTreeHelper.Append( FindTreeWay( ref bytePointer, ref runPointer, ref endOfString, ref compressedByteArray ) );
// Es wird versucht den dekomprimierten String aus dem Binärbaum
// zu laden.
if ( _BinaryTree.TryGetValue( _BinaryTreeHelper.ToString(), out replaceString ) ) {
// Wenn für den Weg (_BinaryTreeHelper) ein Wert hinterlegt wurde,
// so ist dies der dekomprimierte Wert. Deshalb wird dieser
// dann in eine Variable geladen.
if ( replaceString == "\\\\\\" ) {
// Ehrlichgesagt, weiss ich nicht wann ein "\\\\\\" geschickt wird,
// bzw. wieso :)
int i = 0;
for ( int j = 0; j < 16; j++ ) {
// Wer weiss, wieso dieser Loop hier drinnen ist, sagt es mir bitte ;)
i += FindTreeWay( ref bytePointer, ref runPointer, ref endOfString, ref compressedByteArray ) << j;
}
// "i" wird in ein Zeichen umgewandelt und an den dekomprimierten String angehängt
decompressedStringBuilder.Append( (char) i );
} else {
// Der dekomprimierte Teilstring wird an den dekomprimierten String angehängt
decompressedStringBuilder.Append( replaceString );
}
_BinaryTreeHelper = new StringBuilder();
}
} while ( true );
}
/// <summary>
/// Hilfsfunktion zum Dekomprimieren. Hilft die einzelnen Bytes zu dekomprimieren.
/// Es wird mit referenzparametern gearbeitet, da sie in diesem Fall mehr performance bringen.
/// </summary>
/// <param name="bytePointer">Eine Art Pointer, der auf das aktuelle Byte im Bytearray zeigt.</param>
/// <param name="runPointer">Mehr oder weniger eine "Laufvariable"</param>
/// <param name="endOfString">Sofern das Ende des Strings erreicht ist, wird die Variable für einen Break auf true gesetzt.</param>
/// <param name="byteArray">Das Byte Array</param>
/// <returns></returns>
private int FindTreeWay( ref int bytePointer, ref int runPointer, ref bool endOfString, ref byte[] byteArray ) {
// Rückgabeinteger
int retInteger = 0;
if ( ( byteArray[bytePointer] & 1 << runPointer ) != 0 )
retInteger = 1;
runPointer++;
if ( runPointer > 7 ) {
runPointer = 0;
bytePointer++;
// String zu Ende? -> endOfString wird auf true gesetzt
endOfString = bytePointer == byteArray.Length;
}
return retInteger;
}
}
}
„Es sind nicht unsere Fähigkeiten, die zeigen, wer wir wirklich sind, es sind unsere Entscheidungen.“
- Albus Dumbledore, Harry Potter 2
/guestchat registerGuest
-
Ähnliche Themen
-
Frage Knuddels Client
Von Borussia Dortmund im Forum Knuddels BotsAntworten: 1Letzter Beitrag: 14.03.2012, 20:44 -
[BETA] FiftyBot Plugin für KNDeKaDeNz.Client
Von DeKaDeNz im Forum Knuddels Fifty! BotsAntworten: 5Letzter Beitrag: 02.03.2012, 23:58 -
BingoBot Plugin für KNDeKaDeNz.Client
Von DeKaDeNz im Forum Sonstige Knuddels Bots/SoftwareAntworten: 17Letzter Beitrag: 30.01.2012, 11:06 -
BotControll Plugin für KNDeKaDeNz.Client
Von DeKaDeNz im Forum Sonstige Knuddels Bots/SoftwareAntworten: 5Letzter Beitrag: 22.01.2012, 21:59
Diese Seite nutzt Cookies, um das Nutzererlebnis zu verbessern. Klicken Sie hier, um das Cookie-Tracking zu deaktivieren.