-
重写form里的action
protected override void Render(System.Web.UI.HtmlTextWriter writer)
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
{
if(writer is System.Web.UI.Html32TextWriter)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{ writer=new FormFixerHtml32TextWriter(writer.InnerWriter);}
else
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{ writer=new FormFixerHtmlTextWriter(writer.InnerWriter);}
base.Render(writer);
}
internal class FormFixerHtml32TextWriter:System.Web.UI.Html32TextWriter
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
{
private string _url;
internal FormFixerHtml32TextWriter(TextWriter writer):base(writer)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
_url=HttpContext.Current.Request.RawUrl;
}
public override void WriteAttribute(string name, string value, bool fEncode)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
if(_url!=null&&string.Compare(name,"action",true)==0)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
value=_url;
}
base.WriteAttribute (name, value, fEncode);
}
}
![](/Images/OutliningIndicators/None.gif)
internal class FormFixerHtmlTextWriter:System.Web.UI.HtmlTextWriter
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
{
private string _url;
internal FormFixerHtmlTextWriter(TextWriter writer):base(writer)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
_url=HttpContext.Current.Request.RawUrl;
}
public override void WriteAttribute(string name, string value, bool fEncode)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
if(_url!=null&& string.Compare(name,"action",true)==0)
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
value=_url;
}
base.WriteAttribute (name, value, fEncode);
}
}
![](/Images/OutliningIndicators/None.gif)
-
相关阅读:
[BZOJ1193][HNOI2006]马步距离 大范围贪心小范围爆搜
[BZOJ2223][BZOJ3524][Poi2014]Couriers 主席树
[BZOJ1069][SCOI2007]最大土地面积 凸包+旋转卡壳
旋转卡壳 求凸多边形中面积最大的四边形
[BZOJ2815][ZJOI2012]灾难 灭绝树+拓扑排序+lca
[BZOJ2599][IOI2011]Race 点分治
[BZOJ1455]罗马游戏 左偏树+并查集
[BZOJ1295][SCOI2009]最长距离 最短路+枚举
[LintCode] Climbing Stairs
[Codeforces] MultiSet
-
原文地址:https://www.cnblogs.com/songafeng/p/129012.html
Copyright © 2020-2023
润新知