zoukankan      html  css  js  c++  java
  • sqlservice 查询该字段的值是否为数字、不包含a-z字母、获取中文的首字母

    select zjm from xskh where guid_yw='e6ee44f3-98ab-4446-bd9b-db2e525d3b24'
     and zjm not like  '%[ABCDEFGHIJKLMNOPQRSTUVWXYZ]%'--不包含a-z字母
     

     select * from xskh where (ISNUMERIC(aname_long)=1 or isnull(aname_long,'')='')--ISNUMERIC 函数是判断该字段的值是否为数字是=1不是=0 ,但不能判断特殊字符如#、*

    ----------------------获取中文的首字母------
    create function [dbo].[fun_getPY](@str nvarchar(4000)) 
    returns nvarchar(4000) 
    as 
    begin 
    declare @word nchar(1),@PY nvarchar(4000) 
    set @PY='' 
    while len(@str)>0 
    begin 
    set @word=left(@str,1) 
    --如果非汉字字符,返回原字符 
    set @PY=@PY+(case when unicode(@word) between 19968 and 19968+20901 
    then (select top 1 PY from ( 
    select 'A' as PY,N'驁' as word 
    union all select 'B',N'簿' 
    union all select 'C',N'錯' 
    union all select 'D',N'鵽' 
    union all select 'E',N'樲' 
    union all select 'F',N'鰒' 
    union all select 'G',N'腂' 
    union all select 'H',N'夻' 
    union all select 'J',N'攈' 
    union all select 'K',N'穒' 
    union all select 'L',N'鱳' 
    union all select 'M',N'旀' 
    union all select 'N',N'桛' 
    union all select 'O',N'漚' 
    union all select 'P',N'曝' 
    union all select 'Q',N'囕' 
    union all select 'R',N'鶸' 
    union all select 'S',N'蜶' 
    union all select 'T',N'籜' 
    union all select 'W',N'鶩' 
    union all select 'X',N'鑂' 
    union all select 'Y',N'韻' 
    union all select 'Z',N'咗' 
    ) T 
    where word>=@word collate Chinese_PRC_CS_AS_KS_WS 
    order by PY ASC) else @word end) 
    set @str=right(@str,len(@str)-1) 
    end 
    return @PY 
    end

    GO

  • 相关阅读:
    奇异值分解(SVD)详解
    深度学习中常用的优化方法
    一年了,走了一些弯路,是时候回归了,介绍下深度学习中常见的降低过拟合的方法
    softmax与logistic关系
    Java [Leetcode 387]First Unique Character in a String
    Java [Leetcode 384]Shuffle an Array
    Java [Leetcode 167]Two Sum II
    用stack实现min stack
    bootstrap, boosting, bagging 几种方法的联系
    一道常被人轻视的前端JS面试题
  • 原文地址:https://www.cnblogs.com/qgc88/p/3340617.html
Copyright © 2011-2022 走看看