 import Foundation
 
 /// Generic implementation of a First In First Out (FIFO) queue collection.
-public struct MCTQueue<T : CustomStringConvertible> : CustomStringConvertible, SequenceType {
+public struct MCTQueue<Element : CustomStringConvertible> : CustomStringConvertible, SequenceType {
     
     // MARK: - Properties
     
     /// Underlying container (array) representation of queue.
-    private var items = [T]()
+    private var items = [Element]()
     
     /// The number of elements in the queue.
     public var size: Int {

    
    - returns: The last element of the queue, if it exists.
    */
    public func back() -> T? {
        if empty { return nil }
        
        return items[size - 1]

    
    - parameter newObject: Element to push onto the queue.
    */
    public mutating func push(newObject: Element) {
        items.append(newObject)
    }
    
