zoukankan      html  css  js  c++  java
  • GCD多线程使用

    - (void)showTaped
    {
        /*
         dispatch_get_global_queue
         dispatch_get_main_queue
         dispatch_queue_create
         dispatch_get_current_queue
         dispatch_queue_get_label
         dispatch_set_target_queue
         dispatch_main
         */
        
        //卡UI
    //    dispatch_async(dispatch_get_main_queue(), ^{
    //        [self testRun1000W];
    //    });
        
        
        //不卡UI
    //    dispatch_async(dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0), ^{
    //        [self testRun1000W];
    //    });
        
        
        //卡UI 已弃用
    //    dispatch_async(dispatch_get_current_queue(), ^{
    //        [self testRun1000W];
    //    });
        
        
        //在主线程中不能调用此方法
    //    dispatch_async(dispatch_main(), ^{
    //        
    //    });
        
        
        //卡,直接不打印
    //    dispatch_sync(dispatch_get_main_queue(), ^{
    //        [self testRun1000W];
    //    });
        
        
    //    //卡UI
    //    dispatch_sync(dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0), ^{
    //        [self testRun1000W];
    //    });
        
        
        //并行 不卡UI
    //    dispatch_queue_t searQuene = dispatch_queue_create("sear", DISPATCH_QUEUE_SERIAL);
    //    dispatch_async(searQuene, ^{
    //        [self testRun1000W];
    //    });
    //    //[searQuene release];
        
        //并行,卡UI
    //    dispatch_sync(searQuene, ^{
    //        [self testRun1000W];
    //    });
    //    
    //    dispatch_release(searQuene);
        
        
        
        
        //串行,不卡UI
    //    dispatch_queue_t connuQuene = dispatch_queue_create("con", DISPATCH_QUEUE_CONCURRENT);
    ////    dispatch_async(connuQuene, ^{
    ////        [self testRun1000W];
    ////    });
    //    
    //    //串行,卡UI
    //    dispatch_sync(connuQuene, ^{
    //        [self testRun1000W];
    //    });
    //    
    //    dispatch_release(connuQuene);
        
    
        
    }
    
    - (void)testRun1000W
    {
        for (int i = 0; i < 10000; i++) {
            NSLog(@"%d ",i);
        }
    }
  • 相关阅读:
    10. Regular Expression Matching
    9. Palindrome Number (考虑负数的情况)
    8. String to Integer (整数的溢出)
    7. Reverse Integer (整数的溢出)
    LeetCode Minimum Size Subarray Sum
    LeetCode Course Schedule II
    Linux 文件缓存 (一)
    LeetCode Tries Prefix Tree
    Linux : lsof 命令
    LeetCode Binary Tree Right Side View
  • 原文地址:https://www.cnblogs.com/cocoajin/p/3291742.html
Copyright © 2011-2022 走看看