zoukankan      html  css  js  c++  java
  • CRM2011 Javascript判断用户是否拥有某种Role

    function UserHasRole(roleName)
    {
    var serverUrl = Xrm.Page.context.getServerUrl();

    var oDataEndpointUrl = serverUrl + "/XRMServices/2011/OrganizationData.svc/";
    oDataEndpointUrl += "RoleSet?$top=1&$filter=Name eq '" + roleName + "'";

    var service = GetRequestObject();

    if (service != null)
    {
    service.open("GET", oDataEndpointUrl, false);
    service.setRequestHeader("X-Requested-Width", "XMLHttpRequest");
    service.setRequestHeader("Accept", "application/json, text/javascript, */*");
    service.send(null);

    var requestResults = eval('(' + service.responseText + ')').d;

    if (requestResults != null && requestResults.results.length == 1)
    {
    var role = requestResults.results[0];

    var id = role.RoleId;

    var currentUserRoles = Xrm.Page.context.getUserRoles();

    for (var i = 0; i < currentUserRoles.length; i++)
    {
    var userRole = currentUserRoles[i];

    if (GuidsAreEqual(userRole, id))
    {
    return true;
    }
    }
    }
    }

    return false;
    }

    function GetRequestObject()
    {
    if (window.XMLHttpRequest)
    {
    return new window.XMLHttpRequest;
    }
    else
    {
    try
    {
    return new ActiveXObject("MSXML2.XMLHTTP.3.0");
    }
    catch (ex)
    {
    return null;
    }
    }
    }

    function GuidsAreEqual(guid1, guid2)
    {
    var isEqual = false;

    if (guid1 == null || guid2 == null)
    {
    isEqual = false;
    }
    else
    {
    isEqual = guid1.replace(/[{}]/g, "").toLowerCase() == guid2.replace(/[{}]/g, "").toLowerCase();
    }

    return isEqual;
    }

    应用:

    var isManager=UserHasRole("Manager");
    if(isManager)
    {
    //Do something
    }
    else
    {
    //Do something
    }



  • 相关阅读:
    HDU 5115 Dire Wolf (区间DP)
    HDU 4283 You Are the One(区间DP(最优出栈顺序))
    ZOJ 3469 Food Delivery(区间DP好题)
    LightOJ 1422 Halloween Costumes(区间DP)
    POJ 1651 Multiplication Puzzle(区间DP)
    NYOJ 石子合并(一)(区间DP)
    POJ 2955 Brackets(括号匹配一)
    POJ 1141 Brackets Sequence(括号匹配二)
    ZOJ 3537 Cake(凸包+区间DP)
    Graham求凸包模板
  • 原文地址:https://www.cnblogs.com/nixjojo/p/2387408.html
Copyright © 2011-2022 走看看