Generate random alphanumeric string in Swift

前端 未结 22 846
暖寄归人
暖寄归人 2020-11-27 09:51

How can I generate a random alphanumeric string in Swift?

相关标签:
22条回答
  • 2020-11-27 10:12

    SWIFT 4

    Using RandomNumberGenerator for better performance as Apple recommendation

    Usage: String.random(20) Result: CifkNZ9wy9jBOT0KJtV4

    extension String{
       static func random(length:Int)->String{
            let letters = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
            var randomString = ""
    
            while randomString.utf8.count < length{
                let randomLetter = letters.randomElement()
                randomString += randomLetter?.description ?? ""
            }
            return randomString
        }
    }
    
    0 讨论(0)
  • 2020-11-27 10:15
    func randomString(length: Int) -> String {
        // whatever letters you want to possibly appear in the output (unicode handled properly by Swift)
        let letters = "abcABC012你好吗                                                                    
    0 讨论(0)
  • 2020-11-27 10:17

    Swift:

    let randomString = NSUUID().uuidString
    
    0 讨论(0)
  • 2020-11-27 10:18
    func randomUIDString(_ wlength: Int) -> String {
    
        let letters : NSString = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
        var randomString = ""
    
        for _ in 0 ..< wlength {
            let length = UInt32 (letters.length)
            let rand = arc4random_uniform(length)
            randomString = randomString.appendingFormat("%C", letters.character(at: Int(rand)));
        }
    
        return randomString
    }
    
    0 讨论(0)
  • 2020-11-27 10:20

    The problem with responses to "I need random strings" questions (in whatever language) is practically every solution uses a flawed primary specification of string length. The questions themselves rarely reveal why the random strings are needed, but I would challenge you rarely need random strings of length, say 8. What you invariably need is some number of unique strings, for example, to use as identifiers for some purpose.

    There are two leading ways to get strictly unique strings: deterministically (which is not random) and store/compare (which is onerous). What do we do? We give up the ghost. We go with probabilistic uniqueness instead. That is, we accept that there is some (however small) risk that our strings won't be unique. This is where understanding collision probability and entropy are helpful.

    So I'll rephrase the invariable need as needing some number of strings with a small risk of repeat. As a concrete example, let's say you want to generate a potential of 5 million IDs. You don't want to store and compare each new string, and you want them to be random, so you accept some risk of repeat. As example, let's say a risk of less than 1 in a trillion chance of repeat. So what length of string do you need? Well, that question is underspecified as it depends on the characters used. But more importantly, it's misguided. What you need is a specification of the entropy of the strings, not their length. Entropy can be directly related to the probability of a repeat in some number of strings. String length can't.

    And this is where a library like EntropyString can help. To generate random IDs that have less than 1 in a trillion chance of repeat in 5 million strings using EntropyString:

    import EntropyString
    
    let random = Random()
    let bits = Entropy.bits(for: 5.0e6, risk: 1.0e12)
    random.string(bits: bits)
    

    "Rrrj6pN4d6GBrFLH4"

    EntropyString uses a character set with 32 characters by default. There are other predefined characters sets, and you can specify your own characters as well. For example, generating IDs with the same entropy as above but using hex characters:

    import EntropyString
    
    let random = Random(.charSet16)
    let bits = Entropy.bits(for: 5.0e6, risk: 1.0e12)
    random.string(bits: bits)
    

    "135fe71aec7a80c02dce5"

    Note the difference in string length due to the difference in total number of characters in the character set used. The risk of repeat in the specified number of potential strings is the same. The string lengths are not. And best of all, the risk of repeat and the potential number of strings is explicit. No more guessing with string length.

    0 讨论(0)
  • 2020-11-27 10:21

    Swift 2.2 Version

    // based on https://gist.github.com/samuel-mellert/20b3c99dec168255a046
    // which is based on https://gist.github.com/szhernovoy/276e69eb90a0de84dd90
    // Updated to work on Swift 2.2
    
    func randomString(length: Int) -> String {
        let charactersString = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
        let charactersArray : [Character] = Array(charactersString.characters)
    
        var string = ""
        for _ in 0..<length {
            string.append(charactersArray[Int(arc4random()) % charactersArray.count])
        }
    
        return string
    }
    

    Basically call this method that will generate a random string the length of the integer handed to the function. To change the possible characters just edit the charactersString string. Supports unicode characters too.

    https://gist.github.com/gingofthesouth/54bea667b28a815b2fe33a4da986e327

    0 讨论(0)
提交回复
热议问题