# This W3Schools lesson was very helpful. 
# https://www.w3schools.com/python/python_lists_comprehension.asp
# I can also do a documentation drop on you if you're more curious about this stuff. 
# The instructors have only skimmed the surface of the available data structures in Python.
# Here you go: https://docs.python.org/3/tutorial/datastructures.html

# Let's start simple. All the numbers from 0 to 99.

numbers = [i for i in range(100)]

print("Numbers:", numbers)

# List comprehension can be used to filter lists!!!

evenNumbers = [i for i in numbers if i % 2 == 0]

print("Evens:", evenNumbers)

# Can also perform operations on each item in a list.
# See example for changing all these numbers back to the integers

convertedNumbers = [ int(i/2) for i in evenNumbers]


print("Back to integers:", convertedNumbers)


# I've created an equivalent to the head function and the tail function using list comprehension.
# These list the first 10 elements in a list and the last 10 elements in the list, respectively.
# You can replace the list name with your desired list and you're off!!!

headNumbers = [i for i in numbers if i < 10]
print("Head:", headNumbers)

tailNumbers = [i for i in numbers if i > (len(numbers) - 11)]
print("Tail:", tailNumbers)

# Question 1: What do you notice about the set, and why is this in the tech talk?

my_set = set([1, 2, 3, 2, 1])
print(my_set)  
# The set contains only unique entries.

# Question 2 about the lover album. What data structures are there?

lover_album = {
    "title": "Lover",
    "artist": "Taylor Swift",
    "year": 2019,
    "genre": ["Pop", "Synth-pop"],
    "tracks": {
        1: "I Forgot That You Existed",
        2: "Cruel Summer",
        3: "Lover",
        4: "The Man",
        5: "The Archer",
        6: "I Think He Knows",
        7: "Miss Americana & The Heartbreak Prince",
        8: "Paper Rings",
        9: "Cornelia Street",
        10: "Death By A Thousand Cuts",
        11: "London Boy",
        12: "Soon You'll Get Better (feat. Dixie Chicks)",
        13: "False God",
        14: "You Need To Calm Down",
        15: "Afterglow",
        16: "Me! (feat. Brendon Urie of Panic! At The Disco)",
        17: "It's Nice To Have A Friend",
        18: "Daylight"
    }
}

# What data structures do you see?
# Data structures include lists, integers, strings, and dictionaries.
#

# Printing the dictionary
print(lover_album)




# CODE BLOCK 3

print(lover_album.get('tracks'))
# or
print(lover_album['tracks'])


# CODE BLOCK 4

print(lover_album.get('tracks')[4])
# or
print(lover_album['tracks'][4])


# CODE BLOCK 5

lover_album["producer"] = set(['Taylor Swift', 'Jack Antonoff', 'Joel Little', 'Taylor Swift', 'Louis Bell', 'Frank Dukes'])

# What can you change to make sure there are no duplicate producers?
# Use set notation!!!
#

# Printing the dictionary
print(lover_album)



# CODE BLOCK 6

lover_album["tracks"].update({19: "All Of The Girls You Loved Before"})

# How would add an additional genre to the dictionary, like electropop? 
lover_album["genre"].append("Lyrical Music")
# 

# Printing the dictionary
print(lover_album)

# CODE BLOCK 7
# These were helpful for a few of my purposes.
# https://stackoverflow.com/questions/32796452/printing-a-list-separated-with-commas-without-a-trailing-comma
# https://stackoverflow.com/questions/493386/how-to-print-without-a-newline-or-space
# https://www.w3schools.com/python/python_conditions.asp



for k,v in lover_album.items(): # iterate using a for loop for key and value
	if str(type(v)) == "<class 'list'>" or str(type(v)) == "<class 'set'>":
		print(str(k) + ": ", end=''); print(*v, sep=", ")
	elif str(type(v)) == "<class 'dict'>":
		print()
		print(str(k) + ":")
		for key, value in v.items():
			print(str(key) + ". " + str(value))
		print()
	else:
		print(str(k) + ": " + str(v))

# Write your own code to print tracks in readable format
# Success! (above)
#





# CODE BLOCK 8

def search():
    search = input("What would you like to know about the album?")
    if lover_album.get(search.lower()) == None:
        print("Invalid Search")
    else:
        print(lover_album.get(search.lower()))

#search()

# This is a very basic code segment, how can you improve upon this code?
#
#

# The album of my choice. No lyrics. A solid portion of songs
# these days have garbage lyrics (profanity, questionable topics, etc.).
# For a song to even be considered my favorite, it shouldn't have lyrics.
# That way, I can appreciate the beauty of the music without worrying about what's being said.
# So yep, I don't have a favorite Taylor Swift song.
# https://en.wikipedia.org/wiki/December_(George_Winston_album)

piano_album = {
    "title": "December",
    "artist": "George Winston",
    "year": 1982,
    "genre": ["Christmas", "Ambient", "New Age", "Folk"],
    "notes": "Lots of piano stuff with classics. No lyrics!",
    "Top Billboard Rank": 54,
    "tracks": {
        1: "Thanksgiving",
        2: "Jesus, Jesus, Rest Your Head",
        3: "Joy",
        4: "Prelude",
        5: "Carol of the Bells",
        6: "Night, Part One: Snow",
        7: "Night, Part Two: Midnight",
        8: "Night, Part Three: Ministrels",
        9: "Variations on the Kanon by Johann Pachelbel",
        10: "The Holly and the Ivy",
        11: "Some Children See Him",
        12: "Peace"
    }
}

print(piano_album)

# Anyways, I thought it would be a good idea to alphabetize all the tracks.
# This was essentially a sorting exercise. Merge sort proved to be a bit ambitious, so
# I decided to go with an insertion sort. We'll probably be coming back to this later.
# I could have just as easily done something like "the track with the longest name" using length
# on each string. Anyways...


print("Here are the alphabetized tracks:")
trackList = []


for key, value in piano_album.items():
	#print(key, value)
	if str(type(value)) == "<class 'dict'>":
		for track, song in value.items():
			trackList.append(song)
            
#print(trackList)
            
# I'll decide to do an insertion sort since it seems simpler.
# Geeks for Geeks also says it's better for smaller data (like this one)
# https://www.geeksforgeeks.org/insertion-sort/
# I'll be blunt and say I just took the pseudocode
# and converted it to Python.
# Essentially, if one element is greater than the previous element,
# they are swapped and the previous pair is examined.
# This is basically a refined version of bubble sort.
# Don't use these on large datasets.
# The geeks for geeks article on merge sort suggested that for the
# lists smaller than 43 elements that insertion sort be used since
# it will be faster for those smaller pieces...
# https://www.geeksforgeeks.org/merge-sort/

for i in range (0 , len(trackList)):
	j = i
	while j > 0 and trackList[j-1] > trackList[j]:
		trackList[j-1], trackList[j] = trackList[j], trackList[j-1]
		j = j - 1
        
print(*trackList, sep="\n")