interlace /source/library/Interlace/Amf/AmfTraits.cs

Language C# Lines 106
MD5 Hash e5c4ba108f09e6c7202138e941d3e062 Estimated Cost $1,433 (why?)
Repository https://bitbucket.org/VahidN/interlace.git View Raw File View Project SPDX
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
#region Using Directives and Copyright Notice

// Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of the Computer Consultancy Pty Ltd nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
// ARE DISCLAIMED. IN NO EVENT SHALL COMPUTER CONSULTANCY PTY LTD BE LIABLE 
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.

using System;
using System.Collections.Generic;
using System.Text;

#endregion

namespace Interlace.Amf
{
    public enum AmfTraitsKind
    {
        Static,
        Dynamic,
        Externalizable
    }

    public class AmfTraits
    {
        readonly string _className;
        readonly AmfTraitsKind _kind;
        readonly string[] _memberNames;

        public AmfTraits(string className, AmfTraitsKind kind, string[] memberNames)
        {
            _className = className;
            _kind = kind;
            _memberNames = memberNames;
        }

        public string ClassName
        {
            get { return _className; }
        }

        public AmfTraitsKind Kind
        { 	 
           get { return _kind; }
        }

        public string[] MemberNames
        { 	 
           get { return _memberNames; }
        }

        public override bool Equals(object obj)
        {
            AmfTraits rhs = obj as AmfTraits;

            if (_className != rhs._className) return false;
            if (_kind != rhs._kind) return false;

            if ((_memberNames == null) != (rhs._memberNames == null)) return false;

            if (_memberNames == null) return true;

            if (_memberNames.Length != rhs._memberNames.Length) return false;

            for (int i = 0; i < _memberNames.Length; i++)
            {
                if (!object.Equals(_memberNames[i], rhs._memberNames[i])) return false;
            }

            return true;
        }

        public override int GetHashCode()
        {
            int hashCode = _className.GetHashCode() ^ _kind.GetHashCode();

            foreach (string memberName in _memberNames)
            {
                hashCode ^= memberName.GetHashCode();
            }

            return hashCode;
        }
    }
}
Back to Top