zoukankan      html  css  js  c++  java
  • 子组件传递给父组件数据

    来自书籍《vue.js实战》
    子组件使用$emit()触发事件,父组件用v-on来监听子组件事件
    $emit('自定义事件名',传给父组件的数据)
    <!DOCTYPE html>
    <html lang="en">
    <head>
        <meta charset="UTF-8">
        <meta name="viewport" content="width=device-width, initial-scale=1.0">
        <title>Document</title>
        <script src="https://cdn.jsdelivr.net/npm/vue/dist/vue.js"></script>
    </head>
    </head>
    <body>
        <div id="app">
            <p>总数:{{total}}</p>
            <my-component @increase1="handleGetTotal" @reduce="handleGetTotal"></my-component>
        </div>
        <script>
            Vue.component('my-component',{
                template:'
                <div>
                <button @click="handleIncrease">+1</button>
                <button @click="handleReduce">-1</button>
                </div>',
                data:function(){
                    return {
                        counter:0
                    }
                },
                methods:{
                    handleIncrease:function(){
                        this.counter++;
                        this.$emit('increase1',this.counter);
                    },
                    handleReduce:function(){
                        this.counter--;
                        this.$emit('reduce',this.counter);
                    }
                }
            }
            );
            var v=new Vue({
                el:"#app",
                data:{
                    total:0
                },
                methods:{
                    handleGetTotal:function(total){
                        this.total=total
                    }
                }
            });
        </script>
    </body>
    </html>
  • 相关阅读:
    GCJ 2015-Qualification-A Standing Ovation 难度:0
    CF 103E Buying Sets 最大权闭合子图,匹配 难度:4
    HDU 1560 DNA sequence A* 难度:1
    蓝桥杯练习系统 矩阵翻硬币 大数,牛顿迭代法 难度:2
    Operating System Concepts with java 项目: Shell Unix 和历史特点
    HDU 2181 哈密顿绕行世界问题 dfs 难度:1
    HDU 3533 Escape bfs 难度:1
    HDU 3567 Eight II 打表,康托展开,bfs,g++提交可过c++不可过 难度:3
    POJ 1011 Sticks dfs,剪枝 难度:2
    UVALive 5905 Pool Construction 最小割,s-t割性质 难度:3
  • 原文地址:https://www.cnblogs.com/kukai/p/12907699.html
Copyright © 2011-2022 走看看