import os
import sys
import argparse
import json
import csv
import getpass
import string
import random
import re

from datetime import datetime
import ldap
import requests
from requests.packages.urllib3.exceptions import InsecureRequestWarning
requests.packages.urllib3.disable_warnings(InsecureRequestWarning)
from requests.auth import HTTPBasicAuth
import validators

import ipdb

# ldap functions
def get_ldap_group_members(ldap_group, user, passwrd, DOMAIN, DOMAIN_SEARCH_BASE):
    #DOMAIN_GROUP, DOMAIN_USER, DOMAIN_PASS, DOMAIN, DOMAIN_SEARCH_BASE
    '''
    Input a user name and search the directory
    '''
    #---- Setting up the Connection
    #account used for binding - Avoid putting these in version control
    bindDN = str(user)
    bindPass = passwrd

    #set some tuneables for the LDAP library.
    ldap.set_option(ldap.OPT_X_TLS_REQUIRE_CERT, ldap.OPT_X_TLS_ALLOW)
    #ldap.set_option(ldap.OPT_X_TLS_CACERTFILE, CACERTFILE)
    
    conn = ldap.initialize('ldaps://'+str(DOMAIN))
    conn.protocol_version = 3
    conn.set_option(ldap.OPT_REFERRALS, 0)

    #authenticate the connection so that you can make additional queries
    try:
        result = conn.simple_bind_s(bindDN, bindPass) 
    except ldap.INVALID_CREDENTIALS:
        result = "Invalid credentials for %s" % user
        sys.exit()

    #build query in the form of (uid=user)
    ldap_query = '(cn=' + ldap_group + ')'

    query_result = []  
    lencount = True
    range_start = 0
    total_active_students_count = 0
    
    while lencount:
        #print(len(query_result))
        range_end = range_start + 1499
        member_range = ['member;range=' + str(range_start) + '-' + str(range_end)]
        #print(member_range)
        ldap_info = conn.search_s(str(DOMAIN_SEARCH_BASE), ldap.SCOPE_SUBTREE, filterstr=ldap_query, attrlist=member_range)
        member_range = next(iter(ldap_info[0][1].keys()))
        ldap_objects = ldap_info[0][1][member_range]
        print("\n")
        for ldap_object in ldap_objects:
            decoded_member_string = ldap_object.decode("utf-8")
            member_cn = re.split('=|,', decoded_member_string)[1]
            print(f"User number: {total_active_students_count} in {ldap_group}: {member_cn}")
            query_result.append(member_cn)
            total_active_students_count = total_active_students_count + 1
        
        if len(ldap_objects) == 1500:
            lencount = True
            range_start += 1500
            range_end += 1500
        
        else:
            lencount = False
        
    print(f"TOTAL USERS IN ActiveStudents: {total_active_students_count}")
    return query_result


def main():
    user = input("Enter a UNT bind username: ") + "@students.ad.unt.edu"
    passwrd = getpass.getpass(prompt='Enter UNT bind password: ', stream=None)
    get_ldap_group_members("ActiveStudents", user, passwrd, "students.ad.unt.edu", "DC=students,DC=ad,DC=unt,DC=edu")


if __name__ == "__main__":
    main()

bytes_data = b'Hello, World!'
string_data = bytes_data.decode('utf-8')
print("String:", string_data)

#Sets
U = {0,1,2,3,4,5,6,7,8,9}
P = {1,2,3,4}
Q = {4,5,6}
R = {3,4,6,8,9}

def set2bits(xs,us) :
    bs=[]
    for x in us :
        if x in xs :
            bs.append(1)
        else:
            bs.append(0)
    assert len(us) == len(bs)
    return bs

def union(set1,set2) :
    finalSet = set()
    bitList1 = set2bits(set1, U)
    bitList2 = set2bits(set2, U)

    for i in range(len(U)) :
        if(bitList1[i] or bitList2[i]) :
            finalSet.add(i)

    return finalSet

def intersection(set1,set2) :
    finalSet = set()
    bitList1 = set2bits(set1, U)
    bitList2 = set2bits(set2, U)

    for i in range(len(U)) :
        if(bitList1[i] and bitList2[i]) :
            finalSet.add(i)

    return finalSet

def compliment(set1) :
    finalSet = set()
    bitList = set2bits(set1, U)

    for i in range(len(U)) :
        if(not bitList[i]) :
            finalSet.add(i)

    return finalSet

def implication(a,b):
    return union(compliment(a), b)

###########################################################################################
######################         Problems 1-6         #######################################
###########################################################################################

#p \/ (q /\ r) = (p \/ q) /\ (p \/ r)
def prob1():
    return union(P, intersection(Q,R)) == intersection(union(P,Q), union(P,R))

#p /\ (q \/ r) = (p /\ q) \/ (p /\ r)
def prob2():
    return intersection(P, union(Q,R)) == union(intersection(P,Q), intersection(P,R))

#~(p /\ q) = ~p \/ ~q
def prob3():
    return compliment(intersection(P,R)) == union(compliment(P), compliment(R))

#~(p \/ q) = ~p /\ ~q
def prob4():
    return compliment(union(P,Q)) == intersection(compliment(P), compliment(Q))

#(p=>q) = (~q => ~p)
def prob5():
    return implication(P,Q) == implication(compliment(Q), compliment(P))

#(p => q) /\ (q => r)  =>  (p => r)
def prob6():
    return implication(intersection(implication(P,Q), implication(Q,R)), implication(P,R))


print("Problem 1: ", prob1())
print("Problem 2: ", prob2())
print("Problem 3: ", prob3())
print("Problem 4: ", prob4())
print("Problem 5: ", prob5())
print("Problem 6: ", prob6())

'''
Problem 1:  True
Problem 2:  True
Problem 3:  True
Problem 4:  True
Problem 5:  True
Problem 6:  {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
'''

def max_n(lst, n = 1):
  return sorted(lst, reverse = True)[:n]

max_n([1, 2, 3]) # [3]
max_n([1, 2, 3], 2) # [3, 2]

from math import pi

def rads_to_degrees(rad):
  return (rad * 180.0) / pi

rads_to_degrees(pi / 2) # 90.0

print(“Hello World”)