zoukankan      html  css  js  c++  java
  • DAL设计

    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;
    using System.Threading.Tasks;

    namespace LC.DAL
    {
    using IDAL;
    using Entity;
    public class VIPUsersDAL : IVIPUsers
    {
    public int Add(VIPUsers t)
    {
    using (EFDbContext dbContext = new EFDbContext())
    {
    dbContext.Entry(t).State = System.Data.Entity.EntityState.Added;
    var result = dbContext.SaveChanges();
    return result;
    }
    }

    public int Delete(int Id)
    {
    using (EFDbContext dbContext = new EFDbContext())
    {
    var t = dbContext.VIPUsers.Find(Id);
    dbContext.Entry(t).State = System.Data.Entity.EntityState.Deleted;
    var result = dbContext.SaveChanges();
    return result;
    }
    }

    public List<VIPUsers> Query()
    {
    using (EFDbContext dbContext = new EFDbContext())
    {
    var result = dbContext.VIPUsers.ToList();
    return result;
    }
    }

    public VIPUsers QueryById(int Id)
    {
    using (EFDbContext dbContext = new EFDbContext())
    {
    var result = dbContext.VIPUsers.Find(Id);
    return result;
    }
    }

    public int Update(VIPUsers t)
    {
    using (EFDbContext dbContext = new EFDbContext())
    {
    dbContext.Entry(t).State = System.Data.Entity.EntityState.Modified;
    var result = dbContext.SaveChanges();
    return result;
    }
    }
    }
    }

  • 相关阅读:
    马拦过河卒
    最小生成树 kruskal算法
    链表,关键是结构体的快排
    Shortest Prefixes 字典树
    串的匹配
    A Beautiful Meadow
    Tiling
    邻接矩阵的宽度遍历
    邻接矩阵的深度遍历
    Form1.frm
  • 原文地址:https://www.cnblogs.com/mamingyuan/p/10002847.html
Copyright © 2011-2022 走看看