zoukankan      html  css  js  c++  java
  • angularjs中 $watch 和$on 2种监听的区别?

    1.$watch简单使用

    $watch是一个scope函数,用于监听模型变化,当你的模型部分发生变化时它会通知你。

    $watch(watchExpression, listener, objectEquality);

    每个参数的说明如下:

    1. watchExpression:监听的对象,它可以是一个angular表达式如'name',或函数如function(){return $scope.name}。

    2. listener:当watchExpression变化时会被调用的函数或者表达式,它接收3个参数:newValue(新值), oldValue(旧值), scope(作用域的引用)

    3. objectEquality:是否深度监听,如果设置为true,它告诉Angular检查所监控的对象中每一个属性的变化. 如果你希望监控数组的个别元素或者对象的属性而不是一个普通的值, 那么你应该使用它

    $watch可以监听多个模型的变化

    <body ng-app="app" ng-controller="first">
            <button ng-click="name='a'">1</button>
            <button ng-click="name='b'">2</button>
            <button ng-click="name='c'">3</button>
            <button ng-click="type=2">4</button>
            <button ng-click="type=3">5</button>
            <p>{{name}}</p>
        </body>
        <script type="text/javascript">
            var app = angular.module("app", []);
            app.controller("first", function($scope) {
                $scope.name = 'q';
                $scope.type = 1;
    
                function te() {
                    console.log($scope.name+" "+ $scope.type);
                }
                $scope.$watch('name+type', function(newValue, oldValue) {                 //2个参数为 一个为新值,一个为旧值
                    te();
                });
            })
        </script>
    

     

    2.$on的用法

    $on是一个scope函数,用于监听事件的变化,当你的事件发生时它会通知你。

    module.controller('freefedCtrl',['$scope',function($scope){
             //监听directiveClick事件
             $scope.$on('directiveClick',function(event,param){
                   console.log( param );    // 打印结果 {title : '我是来自指令子级作用域'}
             });
    
             $scope.change = function(title){
                  var result = '请注意接收父级广播';
                  //向子级作用域广播parentBroadcast事件
                  $scope.$broadcast('parentBroadcast',{msg : result});
             };
      }]);
    

      

  • 相关阅读:
    [LeetCode] 1072. Flip Columns For Maximum Number of Equal Rows
    [LeetCode] 1730. Shortest Path to Get Food
    [LeetCode] 1005. Maximize Sum Of Array After K Negations
    [LeetCode] 1286. Iterator for Combination
    [LeetCode] 390. Elimination Game
    [LeetCode] 1940. Longest Common Subsequence Between Sorted Arrays
    [LeetCode] 794. Valid TicTacToe State
    [LeetCode] 1162. As Far from Land as Possible
    [LeetCode] 2022. Convert 1D Array Into 2D Array
    [LeetCode] LeetCode 2021勋章
  • 原文地址:https://www.cnblogs.com/8080zh/p/9288107.html
Copyright © 2011-2022 走看看