• angularjs 测试样品


    ...

    <!DOCTYPE html>
    <html>
    
    <head>
      <meta charset="utf-8">
      <script src="https://cdn.staticfile.org/angular.js/1.4.6/angular.min.js"></script>
      <style>
        #hulnum {
          /* 这块是阿贾写的 */
           300px;
          position: fixed;
          top: 50%;
          left: 50%;
          border: rgba(0, 0, 0, 0.1) solid 1px;
          transform: translate(-50%, -50%);
          text-align: center;
          line-height: 300px;
          box-shadow: 2px 4px 10px 0px rgb(0 0 0 / 30%);
          border-radius: 8px;
        }
      </style>
    </head>
    
    <body>
    
      <div ng-app="myApp" ng-controller="myCtrl">
        <div id="hulnum">
          <h1>{{lnum}}</h1>
        </div>
        <p id="hu">pp</p>
    
        <ul>
          <li ng-repeat="x in names">{{x}}</li>
        </ul>
    
      </div>
    
      <script>
        var range = [];
        for (var i = 0; i < 5000; i++) {
          range.push(i);
        }
        var app = angular.module('myApp', []);
        app.controller('myCtrl', function ($scope, $interval) {
          $scope.lnum = document.documentElement.scrollTop;
          $scope.names = range;
          $interval(function () {
            $scope.lnum = document.documentElement.scrollTop;
          }, 500);
        }
        );
      </script>
    
    </body>
    
    </html>
    

    效果...

      

      

  • 相关阅读:
    C
    A
    枚举子集的几种方法
    Codeforces Round #476 (Div. 2) [Thanks, Telegram!] ABCDE
    wannafly挑战赛14
    2018西安电子科大同步赛
    概率dp学习记录
    xcoj 1103 插线板(树链刨分求最大子段和)
    bzoj 2286(虚树+树形dp) 虚树模板
    bzoj3012(Trie)
  • 原文地址:https://www.cnblogs.com/eiguleo/p/15830360.html
Copyright © 2020-2023  润新知