Skip to content

Instantly share code, notes, and snippets.

View myawesomehub's full-sized avatar
💛
Exploring

Mohammad Yasir myawesomehub

💛
Exploring
View GitHub Profile
let pass = NSPredicate(format: "SELF MATCHES %@ ", "^(?=.*[a-z])(?=.*[$@$#!%*?&])(?=.*[A-Z]).{6,}$")
pass.evaluate(with: "SomStrin&&") // true
pass.evaluate(with: "nononnsdf") // false
func isValidEmail(_ email: String) -> Bool {
let emailCode = "[A-Z0-9a-z._%+-]+@[A-Za-z0-9.-]+\\.[A-Za-z]{2,64}"
let emailPredicate = NSPredicate(format:"SELF MATCHES %@", emailCode)
return emailPredicate.evaluate(with: email)
}
var todaysTimeStamp = 1621429320
var today : Date = Date(timeIntervalSince1970: todaysTimeStamp )
let now = Date()
let olderDate = Date(timeIntervalSinceNow: -10000)
var order = Calendar.current.compare(now, to: olderDate, toGranularity: .day)
switch order {
case .orderedDescending:
print("DESCENDING")
case .orderedAscending:
func singUp(){
Auth.auth().createUser(withEmail: email, password: password) { (result, error) in
guard error == nil else {
print(error!.localizedDescription)
return
}
print("WE have Signed Up")
}
}
import Foundation
class WeatherManager : ObservableObject {
@Published var tempText : Double = 0.0
@Published var conditionImage : Int = 0
@Published var cityName = ""
let weatherURL = "https://api.openweathermap.org/data/2.5/weather?appid={YOUR API KEY}&units=metric"
struct WeatherData : Codable {
let name : String
let main : Main
let weather : [Weather]
}
struct Main : Codable {
let temp : Double
}
@myawesomehub
myawesomehub / quicksort.swift
Created April 27, 2021 15:12
Quick Sort Algorithm
var myarray4 = [4,6,2,7,7,3,5]
func quickSort(array: inout [Int], startIndex: Int, endIndex: Int) {
if startIndex >= endIndex {
return
}
let pivot = partition(array: &array, startIndex: startIndex, endIndex: endIndex)
quickSort(array: &array, startIndex: startIndex, endIndex: pivot-1)
quickSort(array: &array, startIndex: pivot+1, endIndex: endIndex)
@myawesomehub
myawesomehub / mergesort.swift
Created April 27, 2021 14:50
Merge sort algorithm
var array2 = [4,2,2,5,7,2,1,9,3]
func merge(left:[Int],right:[Int]) -> [Int] {
var mergedList = [Int]()
var l = left
var r = right
while l.count > 0 && r.count > 0 {
if l.first! < r.first! {
@myawesomehub
myawesomehub / insertionsort.swift
Created April 27, 2021 14:36
Insertion sort in swift
var array1 = [3,4,1,6,7,2,5,5]
for i in 1..<array1.count {
let a = array1[i]
var b = i-1
while b >= 0 && array1[b] > a {
array1[b+1] = array1[b]
b -= 1