zoukankan      html  css  js  c++  java
  • masonry框架的使用之-多个视图的均匀等间距分布

    __weak typeof(self) weakSelf = self; //对self进行weak化,否则造成循环引用无法释放controller

    UIView * tempView = [[UIView alloc]init];
    NSInteger count = 10;//设置一排view的个数
    NSInteger margin = 10;//设置相隔距离
    NSInteger height = 50;//设置view的高度
    for (int i = 0; i < count; i ++) {
    UIView * view = [[UIView alloc]init];
    view.backgroundColor = [UIColor brownColor];
    [self.view addSubview:view];
    if (i == 0) {
    [view mas_makeConstraints:^(MASConstraintMaker *make) {
    make.left.equalTo(weakSelf.view).offset(margin);
    make.centerY.equalTo(weakSelf.view);
    make.height.mas_equalTo(height);
    }];
    }
    else if (i == count – 1){
    [view mas_makeConstraints:^(MASConstraintMaker *make) {
    make.right.equalTo(weakSelf.view).offset(-margin);
    make.left.equalTo(tempView.mas_right).offset(margin);
    make.centerY.equalTo(tempView);
    make.height.equalTo(tempView);
    make.width.equalTo(tempView);
    }];
    }
    else{
    [view mas_makeConstraints:^(MASConstraintMaker *make) {
    make.left.equalTo(tempView.mas_right).offset(margin);
    make.centerY.equalTo(tempView);
    make.height.equalTo(tempView);
    make.width.equalTo(tempView);
    }];
    }
    tempView = view;
    [view layoutIfNeeded];
    }

  • 相关阅读:
    正则表达式---用户验证
    最短路 Dijkstra
    最短路 Dijkstra+堆优化
    LCIS(最长公共上升子序列)
    最小生成树 Kruskal
    网络流 最大流
    网络流 最小费用最大流
    树链剖分
    树状数组
    双重Hash
  • 原文地址:https://www.cnblogs.com/Jordandan/p/4929611.html
Copyright © 2011-2022 走看看