text
stringlengths 27
775k
|
|---|
import com.dfsek.tectonic.getGitHash
plugins {
java
`maven-publish`
}
val versionObj = Version("4", "2", "0", false)
allprojects {
version = versionObj
group = "com.dfsek.tectonic"
tasks.withType<JavaCompile>().configureEach {
options.isFork = true
options.isIncremental = true
}
tasks.withType<Test>().configureEach {
useJUnitPlatform()
maxHeapSize = "2G"
ignoreFailures = false
failFast = true
maxParallelForks = (Runtime.getRuntime().availableProcessors() - 1).takeIf { it > 0 } ?: 1
reports.html.required.set(false)
reports.junitXml.required.set(false)
}
apply(plugin = "maven-publish")
apply(plugin = "java-library")
repositories {
mavenCentral()
}
dependencies {
compileOnly("org.jetbrains:annotations:22.0.0")
testCompileOnly("org.jetbrains:annotations:22.0.0")
testImplementation("org.junit.jupiter:junit-jupiter-api:5.8.2")
testRuntimeOnly("org.junit.jupiter:junit-jupiter-engine:5.8.2")
}
java {
sourceCompatibility = JavaVersion.VERSION_1_8
targetCompatibility = JavaVersion.VERSION_1_8
}
@Suppress("UNUSED_VARIABLE")
val sourcesJar by tasks.registering(Jar::class) {
archiveClassifier.set("sources")
from(sourceSets.main.get().allSource)
}
configure<PublishingExtension> {
publications {
create<MavenPublication>("mavenJava") {
from(components["java"])
}
}
repositories {
val mavenUrl = "https://repo.codemc.io/repository/maven-releases/"
maven(mavenUrl) {
val mavenUsername: String? by project
val mavenPassword: String? by project
if (mavenUsername != null && mavenPassword != null) {
credentials {
username = mavenUsername
password = mavenPassword
}
}
}
}
}
}
/**
* Version class that does version stuff.
*/
@Suppress("MemberVisibilityCanBePrivate")
class Version(val major: String, val minor: String, val revision: String, val preRelease: Boolean = false) {
override fun toString(): String {
return if (!preRelease)
"$major.$minor.$revision"
else //Only use git hash if it's a prerelease.
"$major.$minor.$revision+${getGitHash()}"
}
}
|
#if !defined(BLOCKCHAIN_H)
#define BLOCKCHAIN_H
#include <stdbool.h>
#include "block.h"
typedef struct blockchain_t {
/**
* Tête de liste chaînée. Dernier block ajouté.
*/
Chain* head;
/**
* Difficulté de minage selon l'algorithme du nonce.
*/
int difficulty;
/**
* Taille de la blockchain.
*/
unsigned long length;
} Blockchain;
/**
* Génére un blockchain avec une difficulté de minage.
*/
Blockchain* createBlockchain(int difficulty);
/**
* Génére un blockchain avec une difficulté de minage.
*/
bool insert(Blockchain* blockchain, Block* newBlock, unsigned char* proof);
/**
* Mine et ajoute un block.
*/
unsigned long mine(Blockchain* blockchain, char* auteur, char* message);
/**
* Vérifie la validité de toute la chaîne.
*/
bool checkChainValidity(Blockchain*);
/**
* Supprime toute la chaîne et libère de la mémoire.
*/
void deleteBlockchain(Blockchain*);
/**
* Alloue de la mémoire et duplique toute la chaîne.
*/
Blockchain* duplicateBlockchain(Blockchain* source);
/**
* Affiche toute la chaîne.
*/
void printBlockchain(Blockchain* blockchain);
/**
* Affiche le dernier bloc.
*/
void printLastBlock(Blockchain* blockchain);
/**
* Affiche un bloc particulier en fonction du hash.
*/
void printBlockFromHash(Blockchain* blockchain, char hashString[65]);
/**
* Affiche un bloc particulier en fonction de l'index.
*/
void printBlockFromIndex(Blockchain* blockchain, unsigned long index);
#endif
|
class CampaignMonitor
# Provides access to the lists and campaigns associated with a client
class Base
attr_reader :result, :attributes, :cm_client
@@client=nil
def self.client
@@client
end
def self.client=(a)
@@client=a
end
def [](k)
if m=self.class.get_data_types[k]
@attributes[k].send(m)
else
@attributes[k]
end
end
def []=(k,v)
@attributes[k]=v
end
def initialize(*args)
@attributes={}
@cm_client=@@client
end
# id and name field stuff
inherited_property "id_field", "id"
inherited_property "name_field", "name"
inherited_property "data_types", {}
def id
@attributes[self.class.get_id_field]
end
def id=(v)
@attributes[self.class.get_id_field]=v
end
def name
@attributes[self.class.get_name_field]
end
end
end
|
#include "global.h"
#include "LifeMeterTime.h"
#include "ThemeManager.h"
#include "Song.h"
#include "Steps.h"
#include "ActorUtil.h"
#include "Course.h"
#include "Preference.h"
#include "StreamDisplay.h"
#include "GameState.h"
#include "StatsManager.h"
#include "PlayerState.h"
#include "MessageManager.h"
const float FULL_LIFE_SECONDS = 1.5f*60;
static ThemeMetric<float> METER_WIDTH ("LifeMeterTime","MeterWidth");
static ThemeMetric<float> METER_HEIGHT ("LifeMeterTime","MeterHeight");
static ThemeMetric<float> DANGER_THRESHOLD ("LifeMeterTime","DangerThreshold");
static ThemeMetric<float> INITIAL_VALUE ("LifeMeterTime","InitialValue");
static ThemeMetric<float> MIN_LIFE_TIME ("LifeMeterTime","MinLifeTime");
static const float g_fTimeMeterSecondsChangeInit[] =
{
+0.0f, // SE_CheckpointHit
+0.2f, // SE_W1
+0.0f, // SE_W2
-0.5f, // SE_W3
-1.0f, // SE_W4
-2.0f, // SE_W5
-4.0f, // SE_Miss
-2.0f, // SE_HitMine
-0.0f, // SE_CheckpointMiss
-0.0f, // SE_Held
-4.0f, // SE_LetGo
-0.0f, // SE_Missed
};
COMPILE_ASSERT( ARRAYLEN(g_fTimeMeterSecondsChangeInit) == NUM_ScoreEvent );
static void TimeMeterSecondsChangeInit( size_t /*ScoreEvent*/ i, RString &sNameOut, float &defaultValueOut )
{
sNameOut = "TimeMeterSecondsChange" + ScoreEventToString( (ScoreEvent)i );
defaultValueOut = g_fTimeMeterSecondsChangeInit[i];
}
static Preference1D<float> g_fTimeMeterSecondsChange( TimeMeterSecondsChangeInit, NUM_ScoreEvent );
LifeMeterTime::LifeMeterTime()
{
m_fLifeTotalGainedSeconds = 0;
m_fLifeTotalLostSeconds = 0;
m_pStream = NULL;
}
LifeMeterTime::~LifeMeterTime()
{
delete m_pStream;
}
void LifeMeterTime::Load( const PlayerState *pPlayerState, PlayerStageStats *pPlayerStageStats )
{
LifeMeter::Load( pPlayerState, pPlayerStageStats );
const RString sType = "LifeMeterTime";
m_sprBackground.Load( THEME->GetPathG(sType,"background") );
m_sprBackground->SetName( "Background" );
m_sprBackground->ZoomToWidth( METER_WIDTH );
m_sprBackground->ZoomToHeight( METER_HEIGHT );
this->AddChild( m_sprBackground );
m_quadDangerGlow.ZoomToWidth( METER_WIDTH );
m_quadDangerGlow.ZoomToHeight( METER_HEIGHT );
// hardcoded effects...
m_quadDangerGlow.SetEffectDiffuseShift( 1.0f, RageColor(1,0,0,0.8f), RageColor(1,0,0,0) );
m_quadDangerGlow.SetEffectClock( Actor::CLOCK_BGM_BEAT );
this->AddChild( &m_quadDangerGlow );
m_pStream = new StreamDisplay;
bool bExtra = GAMESTATE->IsAnExtraStage();
m_pStream->Load( bExtra ? "StreamDisplayExtra" : "StreamDisplay" );
this->AddChild( m_pStream );
RString sExtra = bExtra ? "extra " : "";
m_sprFrame.Load( THEME->GetPathG(sType,sExtra+"frame") );
m_sprFrame->SetName( "Frame" );
this->AddChild( m_sprFrame );
m_soundGainLife.Load( THEME->GetPathS(sType,"GainLife") );
}
void LifeMeterTime::OnLoadSong()
{
if( GetLifeSeconds() <= 0 && GAMESTATE->GetCourseSongIndex() > 0 )
return;
float fOldLife = m_fLifeTotalLostSeconds;
float fGainSeconds = 0;
if(GAMESTATE->IsCourseMode())
{
Course* pCourse = GAMESTATE->m_pCurCourse;
ASSERT( pCourse != NULL );
fGainSeconds= pCourse->m_vEntries[GAMESTATE->GetCourseSongIndex()].fGainSeconds;
}
else
{
// Placeholderish, at least this way it won't crash when someone tries it
// out in non-course mode. -Kyz
Song* song= GAMESTATE->m_pCurSong;
ASSERT(song != NULL);
float song_len= song->m_fMusicLengthSeconds;
Steps* steps= GAMESTATE->m_pCurSteps[m_pPlayerState->m_PlayerNumber];
ASSERT(steps != NULL);
RadarValues radars= steps->GetRadarValues(m_pPlayerState->m_PlayerNumber);
float scorable_things= radars[RadarCategory_TapsAndHolds] +
radars[RadarCategory_Lifts];
if(g_fTimeMeterSecondsChange[SE_Held] > 0.0f)
{
scorable_things+= radars[RadarCategory_Holds] +
radars[RadarCategory_Rolls];
}
// Calculate the amount of time to give for the player to need 80% W1.
float gainable_score_time= scorable_things * g_fTimeMeterSecondsChange[SE_W1];
fGainSeconds= song_len - (gainable_score_time * INITIAL_VALUE);
}
if( MIN_LIFE_TIME > fGainSeconds )
fGainSeconds = MIN_LIFE_TIME;
m_fLifeTotalGainedSeconds += fGainSeconds;
m_soundGainLife.Play(false);
SendLifeChangedMessage( fOldLife, TapNoteScore_Invalid, HoldNoteScore_Invalid );
}
void LifeMeterTime::ChangeLife( TapNoteScore tns )
{
if( GetLifeSeconds() <= 0 )
return;
float fMeterChange = 0;
switch( tns )
{
default:
FAIL_M(ssprintf("Invalid TapNoteScore: %i", tns));
case TNS_W1: fMeterChange = g_fTimeMeterSecondsChange[SE_W1]; break;
case TNS_W2: fMeterChange = g_fTimeMeterSecondsChange[SE_W2]; break;
case TNS_W3: fMeterChange = g_fTimeMeterSecondsChange[SE_W3]; break;
case TNS_W4: fMeterChange = g_fTimeMeterSecondsChange[SE_W4]; break;
case TNS_W5: fMeterChange = g_fTimeMeterSecondsChange[SE_W5]; break;
case TNS_Miss: fMeterChange = g_fTimeMeterSecondsChange[SE_Miss]; break;
case TNS_HitMine: fMeterChange = g_fTimeMeterSecondsChange[SE_HitMine]; break;
case TNS_CheckpointHit: fMeterChange = g_fTimeMeterSecondsChange[SE_CheckpointHit]; break;
case TNS_CheckpointMiss:fMeterChange = g_fTimeMeterSecondsChange[SE_CheckpointMiss]; break;
}
float fOldLife = m_fLifeTotalLostSeconds;
m_fLifeTotalLostSeconds -= fMeterChange;
SendLifeChangedMessage( fOldLife, tns, HoldNoteScore_Invalid );
}
void LifeMeterTime::ChangeLife( HoldNoteScore hns, TapNoteScore tns )
{
if( GetLifeSeconds() <= 0 )
return;
float fMeterChange = 0;
switch( hns )
{
default:
FAIL_M(ssprintf("Invalid HoldNoteScore: %i", hns));
case HNS_Held: fMeterChange = g_fTimeMeterSecondsChange[SE_Held]; break;
case HNS_LetGo: fMeterChange = g_fTimeMeterSecondsChange[SE_LetGo]; break;
case HNS_Missed: fMeterChange = g_fTimeMeterSecondsChange[SE_Missed]; break;
}
float fOldLife = m_fLifeTotalLostSeconds;
m_fLifeTotalLostSeconds -= fMeterChange;
SendLifeChangedMessage( fOldLife, tns, hns );
}
void LifeMeterTime::ChangeLife(float delta)
{
float old_life= m_fLifeTotalLostSeconds;
m_fLifeTotalLostSeconds-= delta;
SendLifeChangedMessage(old_life, TapNoteScore_Invalid, HoldNoteScore_Invalid);
}
void LifeMeterTime::SetLife(float value)
{
float old_life= m_fLifeTotalLostSeconds;
m_fLifeTotalLostSeconds= value;
SendLifeChangedMessage(old_life, TapNoteScore_Invalid, HoldNoteScore_Invalid);
}
void LifeMeterTime::HandleTapScoreNone()
{
// do nothing.
}
void LifeMeterTime::SendLifeChangedMessage( float fOldLife, TapNoteScore tns, HoldNoteScore hns )
{
Message msg( "LifeChanged" );
msg.SetParam( "Player", m_pPlayerState->m_PlayerNumber );
msg.SetParam( "TapNoteScore", LuaReference::Create(tns) );
msg.SetParam( "HoldNoteScore", LuaReference::Create(hns) );
msg.SetParam( "OldLife", fOldLife );
msg.SetParam( "Difference", fOldLife - m_fLifeTotalLostSeconds );
msg.SetParam( "LifeMeter", LuaReference::CreateFromPush(*this) );
MESSAGEMAN->Broadcast( msg );
}
bool LifeMeterTime::IsInDanger() const
{
return m_pStream->GetPercent() < DANGER_THRESHOLD;
}
bool LifeMeterTime::IsHot() const
{
return false;
}
bool LifeMeterTime::IsFailing() const
{
return GetLifeSeconds() <= 0;
}
void LifeMeterTime::Update( float fDeltaTime )
{
// update current stage stats so ScoreDisplayLifeTime can show the right thing
float fSecs = GetLifeSeconds();
fSecs = max( 0, fSecs );
m_pPlayerStageStats->m_fLifeRemainingSeconds = fSecs;
LifeMeter::Update( fDeltaTime );
m_pStream->SetPercent( GetLife() );
m_pStream->SetPassingAlpha( 0 );
m_pStream->SetHotAlpha( 0 );
if( m_pPlayerState->m_HealthState == HealthState_Danger )
m_quadDangerGlow.SetDiffuseAlpha( 1 );
else
m_quadDangerGlow.SetDiffuseAlpha( 0 );
}
float LifeMeterTime::GetLife() const
{
float fPercent = GetLifeSeconds() / FULL_LIFE_SECONDS;
CLAMP( fPercent, 0, 1 );
return fPercent;
}
float LifeMeterTime::GetLifeSeconds() const
{
return m_fLifeTotalGainedSeconds - (m_fLifeTotalLostSeconds + STATSMAN->m_CurStageStats.m_fStepsSeconds);
}
/*
* (c) 2001-2004 Chris Danford
* All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, and/or sell copies of the Software, and to permit persons to
* whom the Software is furnished to do so, provided that the above
* copyright notice(s) and this permission notice appear in all copies of
* the Software and that both the above copyright notice(s) and this
* permission notice appear in supporting documentation.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT
* OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
|
<?php
namespace Tests\Unit\Domain\Tab;
use Codderz\Yoko\Support\Collection;
use Src\Domain\Tab\Commands\CloseTab;
use Src\Domain\Tab\Events\DrinksOrdered;
use Src\Domain\Tab\Events\DrinksServed;
use Src\Domain\Tab\Events\FoodOrdered;
use Src\Domain\Tab\Events\FoodPrepared;
use Src\Domain\Tab\Events\FoodServed;
use Src\Domain\Tab\Events\TabClosed;
use Src\Domain\Tab\Events\TabOpened;
use Src\Domain\Tab\Exceptions\PaymentNotEnough;
use Src\Domain\Tab\Exceptions\TabHasOutstandingItems;
use Src\Domain\Tab\Exceptions\TabNotOpen;
use Src\Domain\Tab\TabAggregate;
class CloseTabTest extends TestCase
{
public function testCanCloseTabWithPaymentForDrinks()
{
$aggregate = TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
DrinksOrdered::of($this->aTabId, Collection::of([$this->drink1])),
DrinksServed::of($this->aTabId, Collection::of([$this->drink1->menuNumber]))
])
->closeTab(
CloseTab::of($this->aTabId, $this->drink1->price)
);
$this->assertReleasedEvents($aggregate, [
TabClosed::of($this->aTabId, $this->drink1->price, $this->drink1->price, 0.00)
]);
}
public function testCanCloseTabWithPaymentForFood()
{
$aggregate = TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
FoodOrdered::of($this->aTabId, Collection::of([$this->food1])),
FoodPrepared::of($this->aTabId, Collection::of([$this->food1->menuNumber])),
FoodServed::of($this->aTabId, Collection::of([$this->food1->menuNumber])),
])
->closeTab(
CloseTab::of($this->aTabId, $this->food1->price)
);
$this->assertReleasedEvents($aggregate, [
TabClosed::of($this->aTabId, $this->food1->price, $this->food1->price, 0.00)
]);
}
public function testCanCloseTabWithTip()
{
$amountValue = $this->drink1->price + $this->food1->price;
$aggregate = TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
DrinksOrdered::of($this->aTabId, Collection::of([$this->drink1])),
DrinksServed::of($this->aTabId, Collection::of([$this->drink1->menuNumber])),
FoodOrdered::of($this->aTabId, Collection::of([$this->food1])),
FoodPrepared::of($this->aTabId, Collection::of([$this->food1->menuNumber])),
FoodServed::of($this->aTabId, Collection::of([$this->food1->menuNumber]))
])
->closeTab(
CloseTab::of($this->aTabId, $amountValue + 2.00)
);
$this->assertReleasedEvents($aggregate, [
TabClosed::of($this->aTabId, $amountValue + 2.00, $amountValue, 2.00)
]);
}
public function testCanNotCloseTabWithNotEnoughPaymentForDrinks()
{
$this->expectExceptionObject(PaymentNotEnough::new());
TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
DrinksOrdered::of($this->aTabId, Collection::of([$this->drink1])),
DrinksServed::of($this->aTabId, Collection::of([$this->drink1->menuNumber]))
])
->closeTab(
CloseTab::of($this->aTabId, 0)
);
}
public function testCanNotCloseTabWithNotEnoughPaymentForFood()
{
$this->expectExceptionObject(PaymentNotEnough::new());
TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
FoodOrdered::of($this->aTabId, Collection::of([$this->food1])),
FoodPrepared::of($this->aTabId, Collection::of([$this->food1->menuNumber])),
FoodServed::of($this->aTabId, Collection::of([$this->food1->menuNumber])),
])
->closeTab(
CloseTab::of($this->aTabId, 0)
);
}
public function testCanNotCloseTabWithOutstandingDrinkItems()
{
$this->expectExceptionObject(TabHasOutstandingItems::new());
TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
DrinksOrdered::of($this->aTabId, Collection::of([$this->drink1])),
])
->closeTab(
CloseTab::of($this->aTabId, 0)
);
}
public function testCanNotCloseTabWithOutstandingFoodItems()
{
$this->expectExceptionObject(TabHasOutstandingItems::new());
TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
FoodOrdered::of($this->aTabId, Collection::of([$this->food1, $this->food2])),
])
->closeTab(
CloseTab::of($this->aTabId, 0)
);
}
public function testCanNotCloseTabWithPreparedFoodItems()
{
$this->expectExceptionObject(TabHasOutstandingItems::new());
TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
FoodOrdered::of($this->aTabId, Collection::of([$this->food1])),
FoodPrepared::of($this->aTabId, Collection::of([$this->food1->menuNumber])),
])
->closeTab(
CloseTab::of($this->aTabId, 0)
);
}
public function testCanNotCloseNotOpenedTab()
{
$this->expectExceptionObject(TabNotOpen::new());
TabAggregate::fromEvents()
->closeTab(
CloseTab::of($this->aTabId, $this->drink1->price + 1.00)
);
}
public function testCanNotCloseTabTwice()
{
$this->expectExceptionObject(TabNotOpen::new());
TabAggregate::fromEvents([
TabOpened::of($this->aTabId, $this->aTable, $this->aWaiter),
TabClosed::of($this->aTabId, 0, 0, 0),
])
->closeTab(
CloseTab::of($this->aTabId, 0)
);
}
}
|
; RUN: llc < %s -march=bfin -join-liveintervals=0 -verify-machineinstrs
; RUN: llc < %s -march=bfin -join-liveintervals=0 -verify-machineinstrs -regalloc=greedy
; Provoke an error in LowerSubregsPass::LowerExtract where the live range of a
; super-register is illegally extended.
define i16 @f(i16 %x1, i16 %x2, i16 %x3, i16 %x4) {
%y1 = add i16 %x1, 1
%y2 = add i16 %x2, 2
%y3 = add i16 %x3, 3
%y4 = add i16 %x4, 4
%z12 = add i16 %y1, %y2
%z34 = add i16 %y3, %y4
%p = add i16 %z12, %z34
ret i16 %p
}
|
enum PortStarboardEnum {
"PORT" = 1,
"STARBOARD" = 2,
}
export default PortStarboardEnum;
export const getStafPortStarboardValue = (
s: "PORT" | "STBD"
): PortStarboardEnum => {
if (s === "PORT") return PortStarboardEnum.PORT;
return PortStarboardEnum.STARBOARD;
};
|
-------------------
//unschedules the "update" method.
cc.director.getScheduler().unscheduleUpdateForTarget(this);
|
json.set! "expired", "This server does not cache search results. Please re-submit your search."
|
/*
* Copyright (c) 2019 InterDigital Communications, Inc
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import { connect } from 'react-redux';
import React, { Component } from 'react';
import { Button } from '@rmwc/button';
import { Icon } from '@rmwc/icon';
import {
MEEP_HELP_PAGE_EXEC_URL,
EXEC_STATE_DEPLOYED,
EXEC_BTN_SAVE_SCENARIO,
EXEC_BTN_DEPLOY,
EXEC_BTN_TERMINATE,
EXEC_BTN_EVENT,
EXEC_BTN_DASHBOARD
} from '../../meep-constants';
import {
scenarioPodsPending,
scenarioPodsTerminating,
scenarioPodsTerminated
} from '../../state/exec';
class ExecPageScenarioButtons extends Component {
constructor(props) {
super(props);
this.state = {};
}
canDeploy() {
return (
this.props.sandbox &&
this.props.podsTerminated &&
this.props.scenarioState.scenario !== EXEC_STATE_DEPLOYED
);
}
canTerminate() {
return (
this.props.sandbox &&
!this.props.podsTerminating &&
this.props.scenarioState.scenario === EXEC_STATE_DEPLOYED &&
this.props.okToTerminate
);
}
canSaveScenario() {
return (
this.props.sandbox &&
!this.props.podsPending &&
!this.props.podsTerminating &&
this.props.okToTerminate
);
}
canOpenDashCfg() {
return (
this.props.sandbox &&
!this.props.podsPending &&
!this.props.podsTerminating &&
this.props.okToTerminate
);
}
canOpenEventCfg() {
return (
this.props.sandbox &&
!this.props.podsPending &&
!this.props.podsTerminating &&
this.props.okToTerminate
);
}
render() {
return (
<div>
<Button
raised
style={styles.button}
onClick={this.props.onDeploy}
disabled={!this.canDeploy()}
data-cy={EXEC_BTN_DEPLOY}
>
DEPLOY
</Button>
<Button
raised
style={styles.button}
onClick={() => this.props.onSaveScenario()}
disabled={!this.canSaveScenario()}
data-cy={EXEC_BTN_SAVE_SCENARIO}
>
SAVE
</Button>
<Button
raised
style={styles.button}
onClick={this.props.onTerminate}
disabled={!this.canTerminate()}
data-cy={EXEC_BTN_TERMINATE}
>
TERMINATE
</Button>
<Button
raised
style={styles.buttonWithMargin}
onClick={this.props.onOpenEventCfg}
disabled={!this.canOpenEventCfg()}
data-cy={EXEC_BTN_EVENT}
>
EVENT
</Button>
<Button
raised
style={styles.button}
onClick={this.props.onOpenDashCfg}
disabled={!this.canOpenDashCfg()}
data-cy={EXEC_BTN_DASHBOARD}
>
DASHBOARD
</Button>
<Button
raised
style={styles.buttonWithMargin}
onClick={() => {
window.open(MEEP_HELP_PAGE_EXEC_URL,'_blank');
}}
>
<Icon
icon="help_outline"
iconOptions={{ strategy: 'ligature' }}
style={styles.icon}
/>
</Button>
</div>
);
}
}
const styles = {
button: {
color: 'white',
marginRight: 5
},
buttonWithMargin: {
color: 'white',
marginRight: 5,
marginLeft: 10
}
};
const mapStateToProps = state => {
return {
podsTerminated: scenarioPodsTerminated(state),
podsTerminating: scenarioPodsTerminating(state),
podsPending: scenarioPodsPending(state),
eventCreationMode: state.ui.eventCreationMode,
scenarioState: state.exec.state,
okToTerminate: state.exec.state.okToTerminate
};
};
const ConnectedExecPageScenarioButtons = connect(
mapStateToProps,
null
)(ExecPageScenarioButtons);
export default ConnectedExecPageScenarioButtons;
|
import React, { Component } from 'react';
import { connect } from 'react-redux';
import * as PropTypes from 'prop-types';
import SubmissionUploadComponent from '@/modules/shared/components/Tournament/SubmissionUpload';
import {
hideSubmissionModal,
uploadSubmission,
} from '@/modules/shared/ducks/submission';
import { createStructuredSelector } from 'reselect';
import {
submissionUploadTournamentSelector,
submissionUploadVisibleSelector,
} from '@/modules/shared/selectors/submissionUpload';
import { isLoggedIn } from '@/modules/shared/selectors/auth';
import { withRouter } from 'react-router-dom';
import { compose } from 'redux';
// eslint-disable-next-line react/prefer-stateless-function
class SubmissionUpload extends Component {
render() {
return (
<SubmissionUploadComponent
visible={this.props.visible}
hideModal={this.props.hideModal}
tournament={this.props.tournament}
isLoggedIn={this.props.isLoggedIn}
location={this.props.location}
onUpload={this.props.uploadSubmission}
/>
);
}
}
SubmissionUpload.propTypes = {
uploadSubmission: PropTypes.func.isRequired,
hideModal: PropTypes.func.isRequired,
tournament: PropTypes.object,
visible: PropTypes.bool.isRequired,
isLoggedIn: PropTypes.bool.isRequired,
location: PropTypes.object,
};
function mapDispatchToProps(dispatch) {
return {
uploadSubmission: (
fileList,
tournamentId,
maxSubmissionSize,
successCallback,
failureCallback,
progressCallback,
) =>
dispatch(
uploadSubmission(
fileList,
tournamentId,
maxSubmissionSize,
successCallback,
failureCallback,
progressCallback,
),
),
hideModal: () => dispatch(hideSubmissionModal()),
};
}
const mapStateToProps = createStructuredSelector({
visible: submissionUploadVisibleSelector,
tournament: submissionUploadTournamentSelector,
isLoggedIn,
});
export default compose(
withRouter,
connect(
mapStateToProps,
mapDispatchToProps,
),
)(SubmissionUpload);
|
---
layout: post
title: Matlab生成01随机矩阵
excerpt: ""
modified: 2014-05-08
tags: [技术]
comments: true
category: cn
image:
feature:
credit:
creditlink:
---
#### 举例
~~~ matlab
temp = randi([0 1],3,3);
matrix = tril(temp,-1)+triu(temp',0);
matrix=matrix-diag(diag(matrix))
~~~~
生成的是3*3的随机矩阵
|
$release = 'foo Version: bar'
$release = $release -replace "\s+Version:\s+", ""
Write-Host $release
|
subroutine z2jetsq(i1,i2,i3,i4,i5,i6,za,zb,msq)
c-----Author R.K. Ellis
c---Matrix element squared averaged over initial colors and spins
c q(-p1)+qbar(-p2) --> Gamma^* +g(p5) +g(p6)
c |
c --> l(p3)+a(p4)
c
c--all momenta incoming
implicit none
include 'constants.f'
include 'zprods_decl.f'
include 'mmsq_cs.f'
double complex qcd1LL(-1:1,-1:1),qcd2LL(-1:1,-1:1)
double complex qcd1LR(-1:1,-1:1),qcd2LR(-1:1,-1:1)
c double complex qcd1RL(-1:1,-1:1),qcd2RL(-1:1,-1:1)
c double complex qcd1RR(-1:1,-1:1),qcd2RR(-1:1,-1:1)
double complex qedLL(-1:1,-1:1),qedLR(-1:1,-1:1)
c double complex qedRL(-1:1,-1:1),qedRR(-1:1,-1:1)
double precision msq1(2,2),msq2(2,2),msqq(2,2),msq(2,2)
integer i1,i2,i3,i4,i5,i6,j,k,pq,pl
integer,parameter::pol(2)=(/-1,1/)
call subqcd(i1,i2,i3,i4,i5,i6,za,zb,qcd1LL)
call subqcd(i1,i2,i3,i4,i6,i5,za,zb,qcd2LL)
c call subqcd(i2,i1,i4,i3,i5,i6,za,zb,qcd1RR)
c call subqcd(i2,i1,i4,i3,i6,i5,za,zb,qcd2RR)
call subqcd(i1,i2,i4,i3,i5,i6,za,zb,qcd1LR)
call subqcd(i1,i2,i4,i3,i6,i5,za,zb,qcd2LR)
c call subqcd(i2,i1,i3,i4,i5,i6,za,zb,qcd1RL)
c call subqcd(i2,i1,i3,i4,i6,i5,za,zb,qcd2RL)
do j=1,2
do k=1,2
qedLL(pol(j),pol(k))=qcd1LL(pol(j),pol(k))+qcd2LL(pol(k),pol(j))
qedLR(pol(j),pol(k))=qcd1LR(pol(j),pol(k))+qcd2LR(pol(k),pol(j))
c qedRL(pol(j),pol(k))=qcd1RL(pol(j),pol(k))+qcd2RL(pol(k),pol(j))
c qedRR(pol(j),pol(k))=qcd1RR(pol(j),pol(k))+qcd2RR(pol(k),pol(j))
enddo
enddo
do pq=1,1
do pl=1,2
msq1(pq,pl)=0d0
msq2(pq,pl)=0d0
msqq(pq,pl)=0d0
enddo
enddo
C---sum over gluon polarizations
do j=1,2
do k=1,2
msq1(1,1)=msq1(1,1)+abs(qcd1LL(pol(j),pol(k)))**2
msq2(1,1)=msq2(1,1)+abs(qcd2LL(pol(j),pol(k)))**2
msqq(1,1)=msqq(1,1)+abs(qedLL(pol(j),pol(k)))**2
msq1(1,2)=msq1(1,2)+abs(qcd1LR(pol(j),pol(k)))**2
msq2(1,2)=msq2(1,2)+abs(qcd2LR(pol(j),pol(k)))**2
msqq(1,2)=msqq(1,2)+abs(qedLR(pol(j),pol(k)))**2
c msq1(2,1)=msq1(2,1)+abs(qcd1RL(pol(j),pol(k)))**2
c msq2(2,1)=msq2(2,1)+abs(qcd2RL(pol(j),pol(k)))**2
c msqq(2,1)=msqq(2,1)+abs(qedRL(pol(j),pol(k)))**2
c msq1(2,2)=msq1(2,2)+abs(qcd1RR(pol(j),pol(k)))**2
c msq2(2,2)=msq2(2,2)+abs(qcd2RR(pol(j),pol(k)))**2
c msqq(2,2)=msqq(2,2)+abs(qedRR(pol(j),pol(k)))**2
enddo
enddo
msq1(2,2)=msq1(1,1)
msq1(2,1)=msq1(1,2)
msq2(2,2)=msq2(1,1)
msq2(2,1)=msq2(1,2)
msqq(2,2)=msqq(1,1)
msqq(2,1)=msqq(1,2)
do pq=1,2
do pl=1,2
mmsq_cs(0,pq,pl)=-ninth*msqq(pq,pl)
mmsq_cs(1,pq,pl)=msq1(pq,pl)
mmsq_cs(2,pq,pl)=msq2(pq,pl)
msq(pq,pl)=mmsq_cs(2,pq,pl)+mmsq_cs(1,pq,pl)+mmsq_cs(0,pq,pl)
enddo
enddo
return
end
|
var updateChangedPackages = require("./updateChangedPackages");
var checkUpdatedPackages = require("../../utils/checkUpdatedPackages");
var npmPublishSemiAtomic = require("./npmPublishSemiAtomic");
var gitAddFile = require("../../utils/gitAddFile");
var readline = require("readline-sync");
var execSync = require("../../utils/execSync");
var semver = require("semver");
var chalk = require("chalk");
var fs = require("fs");
function userGetVersion(currentVersion) {
var input = readline.question("New version (Leave blank for patch version): ");
var ver = semver.valid(input);
if (!ver) {
ver = semver.inc(currentVersion, input || "patch");
}
if (ver) {
return ver;
} else {
console.log("Version provided is not valid semver.");
return userGetVersion(currentVersion);
}
}
function updateVersionFile(versionLoc, version) {
fs.writeFileSync(versionLoc, version, "utf8");
gitAddFile(versionLoc);
}
function gitCommit(message) {
// Use echo to allow multi\nline strings.
execSync("git commit -m \"$(echo \"" + message + "\")\"");
}
function gitAddTag(tag) {
execSync("git tag " + tag);
}
function gitCommitAndTagVersion(version) {
var tag = "v" + version;
gitCommit(tag);
gitAddTag(tag);
}
function gitRemoveTaggedVersion(version) {
console.error(chalk.red("Attempting to roll back tag creation."));
execSync("git tag -d v" + version);
}
function gitPushWithTags() {
execSync("git push --follow-tags");
}
function logChangedPackages(packages) {
console.log("Packages to be updated");
console.log(packages.map(function (pkg) {
return "- " + pkg.name;
}).join("\n"));
}
module.exports = function publishChangedPackages(currentVersion, versionLoc, packagesLoc, callback) {
var changedPackages = [];
var createdTag = false;
// Prompt the user for the version
var version = userGetVersion(currentVersion);
updateVersionFile(versionLoc, version);
console.log(version);
try {
// Find all changed packages to publish
changedPackages = checkUpdatedPackages(packagesLoc);
// Log them to the console
logChangedPackages(changedPackages);
// Go through all the changed packages and update their package.json deps.
updateChangedPackages(changedPackages, packagesLoc, version);
// Add a tag for the new version
gitCommitAndTagVersion(version);
createdTag = true;
npmPublishSemiAtomic(changedPackages, packagesLoc, version, function (err) {
if (err) return onError(err);
gitPushWithTags();
onSuccess();
});
} catch (err) {
onError(err);
}
function onSuccess() {
callback(null, version);
}
function onError(err) {
// If we got far along to create a tag, remove it.
if (createdTag) gitRemoveTaggedVersion(version);
callback(err);
}
}
|
require 'rails_helper'
feature 'doc auth self image step' do
include IdvStepHelper
include DocAuthHelper
include DocCaptureHelper
before do
allow(FeatureManagement).to receive(:document_capture_step_enabled?).and_return(false)
allow(Figaro.env).to receive(:liveness_checking_enabled).and_return('true')
complete_doc_capture_steps_before_capture_complete_step
allow_any_instance_of(DeviceDetector).to receive(:device_type).and_return('mobile')
end
it 'is on the correct page' do
expect(page).to have_current_path(idv_capture_doc_capture_selfie_step)
end
it 'proceeds to the next page with valid info and acuant token gets updated after selfie' do
expect(DocCapture.count).to eq(1)
expect(DocCapture.first.acuant_token).to_not be_present
attach_image
click_idv_continue
expect(DocCapture.first.acuant_token).to be_present
expect(page).to have_current_path(idv_capture_doc_capture_complete_step)
end
it 'restarts doc auth if the document cannot be authenticated' do
mock_general_doc_auth_client_error(:get_results)
attach_image
click_idv_continue
expect(page).to have_current_path(idv_capture_doc_mobile_front_image_step)
expect(page).to have_content(I18n.t('errors.doc_auth.general_error'))
end
it 'restarts doc auth if the selfie cannot be matched' do
DocAuth::Mock::DocAuthMockClient.mock_response!(
method: :post_selfie,
response: DocAuth::Response.new(
success: false,
errors: { results: I18n.t('errors.doc_auth.selfie') },
),
)
attach_image
click_idv_continue
expect(page).to have_current_path(idv_capture_doc_mobile_front_image_step)
expect(page).to have_content(t('errors.doc_auth.selfie'))
attach_image
click_idv_continue
expect(page).to have_current_path(idv_capture_doc_capture_mobile_back_image_step)
attach_image
click_idv_continue
expect(page).to have_current_path(idv_capture_doc_capture_selfie_step)
end
end
|
<?php defined('BASEPATH') or exit('No direct script access allowed');
class Home extends CI_Controller {
public function __construct() {
parent::__construct();
}
public function index() {
// Jika sudah login dan jika belum login
if ($this->session->userdata('email')) {
$user = $this->ModelUser->cekData(['email' => $this->session->userdata('email')])->row_array();
$data = [
'judul' => 'Pustaka Booking',
'user' => $user['nama'],
'buku' => $this->ModelBuku->getBuku()->result()
];
$this->load->view('templates/templates-user/header', $data);
$this->load->view('buku/daftarbuku', $data);
$this->load->view('templates/templates-user/modal');
$this->load->view('templates/templates-user/footer', $data);
} else {
$data = [
'judul' => 'Pustaka Booking | Katalog Buku',
'user' => 'Pengunjung',
'buku' => $this->ModelBuku->getBuku()->result()
];
$this->load->view('templates/templates-user/header', $data);
$this->load->view('buku/daftarbuku', $data);
$this->load->view('templates/templates-user/modal');
$this->load->view('templates/templates-user/footer', $data);
}
}
public function detailBuku($id = null) {
$user = $this->ModelUser->cekData(['email' => $this->session->userdata('email')])->row_array();
if ($this->session->userdata('email')) {
$data = [
'user' => $user['nama'],
'judul' => 'Detail Buku',
'buku' => $this->ModelBuku->joinKategoriBuku($id)->result()[0]
];
} else {
$data = [
'user' => 'Pengunjung',
'title' => 'Detail Buku',
'buku' => $this->ModelBuku->joinKategoriBuku($id)->result()[0]
];
}
$this->load->view('templates/templates-user/header', $data);
$this->load->view('buku/detail-buku', $data);
$this->load->view('templates/templates-user/modal');
$this->load->view('templates/templates-user/footer');
}
}
|
/*
* Copyright 2017 47 Degrees, LLC. <http://www.47deg.com>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package cards.nine.api.version2
object JsonImplicits {
import play.api.libs.json._
implicit val loginResponseReads = Json.reads[ApiLoginResponse]
implicit val installationResponseReads = Json.reads[InstallationResponse]
implicit val collectionAppReads = Json.reads[CollectionApp]
implicit val collectionReads = Json.reads[Collection]
implicit val collectionsResponseReads = Json.reads[CollectionsResponse]
implicit val packagesStatsReads = Json.reads[PackagesStats]
implicit val createCollectionResponseReads = Json.reads[CreateCollectionResponse]
implicit val updateCollectionResponseReads = Json.reads[UpdateCollectionResponse]
implicit val categorizedAppReads = Json.reads[CategorizedApp]
implicit val categorizedAppDetailReads = Json.reads[CategorizedAppDetail]
implicit val categorizeResponseReads = Json.reads[CategorizeResponse]
implicit val categorizeDetailResponseReads = Json.reads[CategorizeDetailResponse]
implicit val recommendationAppReads = Json.reads[NotCategorizedApp]
implicit val recommendationsResponseReads = Json.reads[RecommendationsResponse]
implicit val recommendationsByAppsResponseReads = Json.reads[RecommendationsByAppsResponse]
implicit val subscriptionsResponseReads = Json.reads[SubscriptionsResponse]
implicit val rankAppsCategoryResponseReads = Json.reads[RankAppsCategoryResponse]
implicit val rankAppsResponseReads = Json.reads[RankAppsResponse]
implicit val rankAppsByMomentResponseReads = Json.reads[RankAppsByMomentResponse]
implicit val rankWidgetsResponseReads = Json.reads[RankWidgetsResponse]
implicit val rankWidgetsWithMomentResponse = Json.reads[RankWidgetsWithMomentResponse]
implicit val rankWidgetsByMomentResponse = Json.reads[RankWidgetsByMomentResponse]
implicit val searchResponseReads = Json.reads[SearchResponse]
implicit val loginRequestWrites = Json.writes[ApiLoginRequest]
implicit val installationRequestWrites = Json.writes[InstallationRequest]
implicit val createCollectionRequestWrites = Json.writes[CreateCollectionRequest]
implicit val collectionUpdateInfoWrites = Json.writes[CollectionUpdateInfo]
implicit val updateCollectionRequestWrites = Json.writes[UpdateCollectionRequest]
implicit val categorizeRequestWrites = Json.writes[CategorizeRequest]
implicit val recommendationsRequestWrites = Json.writes[RecommendationsRequest]
implicit val recommendationsByAppsRequestWrites = Json.writes[RecommendationsByAppsRequest]
implicit val rankAppsRequestWrites = Json.writes[RankAppsRequest]
implicit val rankAppsByMomentRequestWrites = Json.writes[RankAppsByMomentRequest]
implicit val rankWidgetsByMomentRequest = Json.writes[RankWidgetsByMomentRequest]
implicit val searchRequestWrites = Json.writes[SearchRequest]
}
|
//
// OCSMessageModel.h
// onlineC
//
// Created by zyd on 2018/7/13.
//
#import "OCSModel.h"
@interface OCSMessageModel : OCSModel
// 文本内容
@property (copy, nonatomic) NSString *content;
// 展示页面时间
@property (copy, nonatomic) NSString *showTime;
// 坐席标识
@property (copy, nonatomic) NSString *empFlag;
// 图片路径
@property (copy, nonatomic) NSString *imgUrl;
@end
|
---
layout: publication
authors: "Mizumoto, I., R. Michino, Z. Iwai, R. Bhushan Gopaluni, Sirish L. Shah"
type: "paper"
order: 76
year: 2003
title: "Robust Adaptive Back-stepping Control Based on High-Gain Feedback and Its Application to a CSTR"
journal: "Trans. of the Japan Society of Mechanical Engineers"
pagenum: "143-150"
external_url: "https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=200902281511192308"
---
|
---
title: "Overview"
excerpt: "Development Information regarding LibrePhotos Frontend."
last_modified_at: 2020-01-18
category: 4
---
## Overview
The Front end, what everyone sees.
|
declare namespace Phaser {
interface IGameConfig {
scaleMode: number,
}
}
|
#region license
// Copyright (c) 2004, Rodrigo B. de Oliveira (rbo@acm.org)
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Rodrigo B. de Oliveira nor the names of its
// contributors may be used to endorse or promote products derived from this
// software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#endregion
namespace Boo.Lang.Compiler.Steps
{
using System;
using Boo.Lang.Compiler.Ast;
public class TransformCallableDefinitions : AbstractTransformerCompilerStep
{
override public void Run()
{
Visit(CompileUnit);
}
override public void OnMethod(Method node)
{
}
override public void OnClassDefinition(ClassDefinition node)
{
Visit(node.Members);
}
override public void OnCallableDefinition(CallableDefinition node)
{
if (null == node.ReturnType)
{
node.ReturnType = CodeBuilder.CreateTypeReference(TypeSystemServices.VoidType);
}
CompleteOmittedParameterType(node);
ClassDefinition cd = TypeSystemServices.CreateCallableDefinition(node.Name);
cd.LexicalInfo = node.LexicalInfo;
cd.GenericParameters = node.GenericParameters;
cd.Members.Add(CreateInvokeMethod(node));
cd.Members.Add(CreateBeginInvokeMethod(node));
cd.Members.Add(CreateEndInvokeMethod(node));
ReplaceCurrentNode(cd);
}
private void CompleteOmittedParameterType(CallableDefinition node)
{
ParameterDeclarationCollection parameters = node.Parameters;
if (0 == parameters.Count) return;
ParameterDeclaration last = parameters[-1];
foreach (ParameterDeclaration parameter in parameters)
{
if (null == parameter.Type)
{
if (parameters.VariableNumber && last == parameter)
{
parameter.Type = CodeBuilder.CreateTypeReference(TypeSystemServices.ObjectArrayType);
}
else
{
parameter.Type = CodeBuilder.CreateTypeReference(TypeSystemServices.ObjectType);
}
}
}
}
Method CreateInvokeMethod(CallableDefinition node)
{
Method method = CreateRuntimeMethod("Invoke", node.ReturnType);
method.Parameters = node.Parameters;
return method;
}
Method CreateBeginInvokeMethod(CallableDefinition node)
{
Method method = CreateRuntimeMethod("BeginInvoke",
CodeBuilder.CreateTypeReference(node.LexicalInfo, typeof(IAsyncResult)));
method.Parameters.ExtendWithClones(node.Parameters);
method.Parameters.Add(
new ParameterDeclaration("callback",
CodeBuilder.CreateTypeReference(node.LexicalInfo, typeof(AsyncCallback))));
method.Parameters.Add(
new ParameterDeclaration("asyncState",
CodeBuilder.CreateTypeReference(node.LexicalInfo, TypeSystemServices.ObjectType)));
return method;
}
Method CreateEndInvokeMethod(CallableDefinition node)
{
Method method = CreateRuntimeMethod("EndInvoke", node.ReturnType);
foreach(ParameterDeclaration p in node.Parameters)
{
if (p.IsByRef)
{
method.Parameters.Add(p.CloneNode());
}
}
method.Parameters.Add(
new ParameterDeclaration("asyncResult",
CodeBuilder.CreateTypeReference(node.LexicalInfo, typeof(IAsyncResult))));
return method;
}
Method CreateRuntimeMethod(string name, TypeReference returnType)
{
Method method = new Method();
method.Name = name;
method.ReturnType = returnType;
method.Modifiers = TypeMemberModifiers.Public|TypeMemberModifiers.Virtual;
method.ImplementationFlags = MethodImplementationFlags.Runtime;
return method;
}
}
}
|
export 'TextValidator.dart';
export 'CNPJ.dart';
export 'Ean13.dart';
export 'Phone.dart';
export 'Price.dart';
|
/*
* Public API Surface of ng-animations
*/
export * from './lib/attention-seekers/bounce';
export * from './lib/attention-seekers/flash';
export * from './lib/attention-seekers/head-shake';
export * from './lib/attention-seekers/jello';
export * from './lib/attention-seekers/pulse';
export * from './lib/attention-seekers/rubber-band';
export * from './lib/attention-seekers/shake';
export * from './lib/attention-seekers/swing';
export * from './lib/attention-seekers/tada';
export * from './lib/attention-seekers/wobble';
export * from './lib/bouncing-entrances/bounce-in';
export * from './lib/bouncing-entrances/bounce-in-down';
export * from './lib/bouncing-entrances/bounce-in-left';
export * from './lib/bouncing-entrances/bounce-in-right';
export * from './lib/bouncing-entrances/bounce-in-up';
export * from './lib/bouncing-exits/bounce-out';
export * from './lib/bouncing-exits/bounce-out-down';
export * from './lib/bouncing-exits/bounce-out-left';
export * from './lib/bouncing-exits/bounce-out-right';
export * from './lib/bouncing-exits/bounce-out-up';
export * from './lib/fading-entrances/fade-in';
export * from './lib/fading-entrances/fade-in-down';
export * from './lib/fading-entrances/fade-in-down-big';
export * from './lib/fading-entrances/fade-in-left';
export * from './lib/fading-entrances/fade-in-left-big';
export * from './lib/fading-entrances/fade-in-right';
export * from './lib/fading-entrances/fade-in-right-big';
export * from './lib/fading-entrances/fade-in-up';
export * from './lib/fading-entrances/fade-in-up-big';
export * from './lib/fading-exits/fade-out';
export * from './lib/fading-exits/fade-out-down';
export * from './lib/fading-exits/fade-out-down-big';
export * from './lib/fading-exits/fade-out-left';
export * from './lib/fading-exits/fade-out-left-big';
export * from './lib/fading-exits/fade-out-right';
export * from './lib/fading-exits/fade-out-right-big';
export * from './lib/fading-exits/fade-out-up';
export * from './lib/fading-exits/fade-out-up-big';
export * from './lib/flippers/flip';
export * from './lib/flippers/flip-in-x';
export * from './lib/flippers/flip-in-y';
export * from './lib/flippers/flip-out-x';
export * from './lib/flippers/flip-out-y';
export * from './lib/lightspeed/light-speed-in';
export * from './lib/lightspeed/light-speed-out';
export * from './lib/rotating-entrances/rotate-in';
export * from './lib/rotating-entrances/rotate-in-down-left';
export * from './lib/rotating-entrances/rotate-in-down-right';
export * from './lib/rotating-entrances/rotate-in-up-left';
export * from './lib/rotating-entrances/rotate-in-up-right';
export * from './lib/rotating-exits/rotate-out';
export * from './lib/rotating-exits/rotate-out-down-left';
export * from './lib/rotating-exits/rotate-out-down-right';
export * from './lib/rotating-exits/rotate-out-up-left';
export * from './lib/rotating-exits/rotate-out-up-right';
export * from './lib/sliding-entrances/slide-in-down';
export * from './lib/sliding-entrances/slide-in-left';
export * from './lib/sliding-entrances/slide-in-right';
export * from './lib/sliding-entrances/slide-in-up';
export * from './lib/sliding-exits/slide-out-down';
export * from './lib/sliding-exits/slide-out-left';
export * from './lib/sliding-exits/slide-out-right';
export * from './lib/sliding-exits/slide-out-up';
export * from './lib/specials/hinge';
export * from './lib/specials/jack-in-the-box';
export * from './lib/specials/roll-in';
export * from './lib/specials/roll-out';
export * from './lib/zooming-entrances/zoom-in';
export * from './lib/zooming-entrances/zoom-in-down';
export * from './lib/zooming-entrances/zoom-in-left';
export * from './lib/zooming-entrances/zoom-in-right';
export * from './lib/zooming-entrances/zoom-in-up';
export * from './lib/zooming-exits/zoom-out';
export * from './lib/zooming-exits/zoom-out-down';
export * from './lib/zooming-exits/zoom-out-left';
export * from './lib/zooming-exits/zoom-out-right';
export * from './lib/zooming-exits/zoom-out-up';
|
Don't make manual changes to files in the dist/ or platform/ directories.
Source code changes should be made in the mongodb-labs/gperftools repo.
Tweaks or reconfigurations of our third-party installation have to be
made in scripts/ or SConscript files, etc.
== contents ==
```
src/third_party/
gperftool-2.7/
dist/ # 'make distdir' snapshot of mongodb-labs/gperftools
platform/
linux_x86_64/ # per platform directories
include/ # headers used by consumers of gperftools
internal/ # headers used in the compile of gperftools
... # other platforms: $os_$arch
windows_x86_64/ # special case that's always regenerated, and always the same way.
scripts/
import.sh # regenerate the dist/ snapshot from git repo.
host_config.sh # generate platform headers dir for the host and windows_x86_64.
```
|
module.exports = {
extends: [
'ash-nazg/sauron-node', 'plugin:qunit/recommended'
],
parserOptions: {
ecmaVersion: 2018,
sourceType: 'module'
},
plugins: ['qunit'],
env: {
browser: true
},
settings: {
polyfills: [
'Array.isArray',
'ArrayBuffer',
'console',
'document.body',
'document.head',
'document.querySelector',
'document.querySelectorAll',
'Error',
'IDBKeyRange',
'JSON',
'location.origin',
'location.search',
'Number.isInteger',
'Number.isNaN',
'Object.create',
'Object.defineProperty',
'Object.defineProperties',
'Object.getOwnPropertyDescriptor',
'Object.entries',
'Object.keys',
'Object.setPrototypeOf',
'Object.values',
'Promise',
'Set',
'String.fromCodePoint',
'Symbol.hasInstance',
'Symbol.iterator',
'Symbol.toStringTag',
'Uint8Array'
],
jsdoc: {
additionalTagNames: {
// In case we need to extend
customTags: []
}
}
},
overrides: [
// Our Markdown rules (and used for JSDoc examples as well, by way of
// our use of `matchingFileName` in conjunction with
// `jsdoc/check-examples` within `ash-nazg`)
{
files: ['**/*.md'],
rules: {
'eol-last': ['off'],
'no-console': ['off'],
'no-undef': ['off'],
'no-unused-vars': ['warn', {varsIgnorePattern: 'setGlobalVars'}],
'padded-blocks': ['off'],
'import/unambiguous': ['off'],
'import/no-unresolved': ['off'],
'node/no-missing-require': ['off'],
'node/no-missing-import': ['off'],
'node/no-unsupported-features/es-syntax': 'off'
}
},
// Non-ESM Node files:
{
files: ['Gruntfile.js'],
globals: {
"require": "readonly",
"module": "readonly",
__dirname: "readonly"
},
rules: {
'strict': ['off']
}
},
// @core-js-bundle can provide
{
files: ['src/**'],
rules: {
'node/no-unsupported-features/es-builtins': 'off',
'node/no-unsupported-features/es-syntax': 'off'
}
},
// May need to support a lower browser version for test/development files, but
// not a lower Node version
{
files: ['test-support/**', 'tests-mocha/**', 'tests-qunit/**'],
// We want console in tests!
globals: {
"require": "readonly",
"exports": "readonly",
"module": "readonly",
__dirname: "readonly"
},
rules: {
'strict': 'off',
'no-console': 'off',
'object-shorthand': ['off'],
'prefer-destructuring': ['off'],
'require-unicode-regexp': ['off'],
'node/no-unsupported-features/es-syntax': 'off',
'node/no-unsupported-features/es-builtins': ['off'],
'node/no-unsupported-features/node-builtins': ['off'],
'unicorn/prefer-add-event-listener': ['off'],
'unicorn/no-array-instanceof': ['off']
}
}
],
rules: {
// This should definitely be enabled at some point
'jsdoc/require-jsdoc': 0,
indent: ['error', 4],
'consistent-this': ['error', 'me'],
// Disable until find time to address
'default-case': 0,
'func-name-matching': 0,
'import/extensions': 0,
'node/file-extension-in-import': 0,
'import/no-commonjs': 0,
'import/no-mutable-exports': 0,
'import/unambiguous': 0,
'max-len': 0,
'multiline-ternary': 0,
'no-console': 0,
'no-multi-spaces': 0,
'no-shadow': 0,
'no-sync': 0,
'prefer-rest-params': 0,
'require-jsdoc': 0,
'valid-jsdoc': 0,
'vars-on-top': 0,
'jsdoc/require-param': 0,
'jsdoc/require-param-type': 0,
'jsdoc/check-types': 0,
'jsdoc/check-param-names': 0,
'promise/prefer-await-to-callbacks': 0,
'promise/prefer-await-to-then': 0,
'node/prefer-promises/fs': 0,
'unicorn/no-fn-reference-in-iterator': 0,
'unicorn/no-unsafe-regex': 0,
'no-restricted-syntax': 0,
'prefer-named-capture-group': 0,
}
};
|
<?php
namespace Modules\Dosen\Http\Controllers;
use Auth;
use Illuminate\Http\Request;
use Illuminate\Http\Response;
use Illuminate\Routing\Controller;
use Illuminate\Support\Facades\DB;
class ProfileController extends Controller
{
/**
* Display a listing of the resource.
* @return Response
*/
public function index()
{
$user = Auth::user();
$user_id = $user['id'];
$data = DB::table('app-faculty_dosen')->where('dosen_id', $user_id)->get();
/**echo "<script type='text/javascript'>alert('$data');</script>";*/
return view('dosen::pages.profile.profile', ['data' => $data]);
}
/**
* Store a newly created resource in storage.
* @param Request $request
* @return Response
*/
public function store(Request $request)
{
$user = Auth::user();
$user_id = $user['id'];
$user_mail = $user['email'];
DB::table('app-faculty_dosen')->insert([
'dosen_id' => $user_id,
'name' => $request->nama,
'nip' => $request->nip,
'gender' => $request->gender,
'faculty' => $request->faculty,
'major' => $request->jurusan,
'phone' => $request->telepon,
'email' => $user_mail,
'address' => $request->alamat
]);
$profile = 1;
DB::table('users')->where('id', $user_id)->update([
'profile' => $profile
]);
return redirect("/dosen/profile");
}
/**
* Show the form for editing the specified resource.
* @param int $id
* @return Response
*/
public function edit()
{
$user = Auth::user();
$user_id = $user['id'];
$data = DB::table('app-faculty_dosen')->where('dosen_id', $user_id)->get();
return view('dosen::pages.profile.profile-edit', ['data' => $data]);
}
/**
* Update the specified resource in storage.
* @param Request $request
* @param int $id
* @return Response
*/
public function update(Request $request)
{
$user = Auth::user();
$user_id = $user['id'];
DB::table('app-faculty_dosen')->where('dosen_id', $user_id)->update([
'name' => $request->nama,
'nip' => $request->nip,
'gender' => $request->gender,
'faculty' => $request->faculty,
'major' => $request->jurusan,
'phone' => $request->telepon,
'email' => $request->email,
'address' => $request->alamat
]);
return redirect("/dosen/profile");
}
}
|
/*
* Copyright 2019 Daniel Hinojosa
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON INFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
package com.xyzcorp.typeclasses
import cats.*
import cats.implicits.*
import org.scalatest.*
import org.scalatest.funspec.AnyFunSpec
import org.scalatest.matchers.should.*
class SemigroupSpec extends AnyFunSpec with Matchers:
describe("Semigroup combines items") {
it("""uses the product method to combine the containers, here is an Option""") {
val result = Semigroup[String].combine("All", " Right")
result should be("All Right")
}
it("""can be brought into a method, to ensure that it applies to a signature""") {
def fact[F[_]: Foldable, A](xs: F[A])(using monoid: Monoid[A]): Option[A] =
xs.reduceLeftOption(monoid.combine)
given Monoid[Int] with
override def empty: Int = 0
override def combine(x: Int, y: Int): Int = x * y
fact(List(1, 2, 3, 4)) should be(Some(24))
}
}
|
using System;
using System.Collections.Generic;
using System.Text;
namespace Rin.Hubs.Payloads
{
public class RinServerInfoPayload
{
public string Version { get; set; }
public DateTimeOffset BuildDate { get; set; }
public string[] FeatureFlags { get; set; }
}
}
|
-- DATABASE AND SCHEMA
-- create database coolmovies with owner postgres;
\c coolmovies;
-- USERS
create table if not exists users
(
id uuid default gen_random_uuid() not null
constraint user_pk
primary key,
name varchar not null
);
alter table users owner to postgres;
create unique index if not exists user_id_uindex
on users (id);
-- MOVIE DIRECTORS
create table if not exists movie_directors
(
id uuid default gen_random_uuid() not null
constraint movie_director_pk
primary key,
name varchar not null,
age integer not null
);
alter table movie_directors owner to postgres;
create unique index if not exists movie_director_id_uindex
on movie_directors (id);
-- MOVIES
create table movies
(
id uuid default gen_random_uuid() not null
constraint movies_pk
primary key,
title varchar not null,
movie_director_id uuid not null
constraint movies_movie_director_id_fk
references movie_directors
on update cascade on delete cascade,
user_creator_id uuid not null
constraint movies_user_id_fk
references users
on update cascade on delete cascade,
release_date date not null
);
alter table movies owner to postgres;
create unique index if not exists movie_director_id_uindex
on movie_directors (id);
-- MOVIE REVIEWS
create table movie_reviews
(
id uuid default gen_random_uuid() not null
constraint movie_reviews_pk
primary key,
title varchar not null,
body text,
rating integer,
movie_id uuid not null
constraint movie_reviews_movies_id_fk
references movies
on update cascade on delete cascade,
user_reviewer_id uuid not null
constraint movie_reviews_users_id_fk
references users
on update cascade on delete cascade
);
alter table movie_reviews owner to postgres;
create unique index if not exists movie_review_id_uindex
on movie_reviews (id);
-- COMMENTS
create table if not exists comments
(
id uuid default gen_random_uuid() not null
constraint comment_pk
primary key,
user_id uuid not null
constraint comment_user_id_fk
references users
on update cascade on delete cascade,
title varchar,
body text,
movie_review_id uuid not null
constraint comments_movie_reviews_id_fk
references movie_reviews (id)
on update cascade on delete cascade
);
alter table comments owner to postgres;
-- FAKE CURRENT USER
create function "current_user"() returns users
stable
SET search_path = "$user", public
language sql
as
$$
select *
from users
order by name
limit 1;
$$;
alter function "current_user"() owner to postgres;
|
require 'spec_helper'
module Rockauth
describe PasswordsController do
let(:parsed_response) { JSON.parse(response.body).with_indifferent_access }
let(:client) { create(:client) }
let(:user) { create(:user) }
let(:password) { Faker::Internet.password }
describe 'POST forgot' do
context 'when configured without forgot always successful' do
before :each do
@forgot_password_success_config = Rockauth::Configuration.forgot_password_always_successful
Rockauth::Configuration.forgot_password_always_successful = false
end
after :each do
Rockauth::Configuration.forgot_password_always_successful = @forgot_password_success_config
end
it "sends an email to the user with reset instructions" do
expect do
post :forgot, user: { username: user.email }
end.to change { ActionMailer::Base.deliveries.length }.by 1
expect(ActionMailer::Base.deliveries.last.to).to match_array [user.email]
end
it "sends an email to the user with the appropriate subject" do
expect do
post :forgot, user: { username: user.email }
end.to change { ActionMailer::Base.deliveries.length }.by 1
expect(ActionMailer::Base.deliveries.last.subject).to eq I18n.t('rockauth.forgot_password_email_subject')
end
it "appropriately sets the password reset token for the user" do
expect do
post :forgot, user: { username: user.email }
end.to change { user.reload.password_reset_token }
end
it "appropriately sets the password reset token expiration for the user" do
expect do
post :forgot, user: { username: user.email }
end.to change { user.reload.password_reset_token_expires_at }
end
it "notifies the user of success" do
post :forgot, user: { username: user.email }
expect(response.status).to eq 200
expect(parsed_response).to have_key :meta
expect(parsed_response[:meta]).to have_key :message
end
context "when the username is not valid" do
it "does not send an email" do
expect do
post :forgot, user: { username: 'blarg' }
end.not_to change { ActionMailer::Base.deliveries.length }
end
it "informs users of the error" do
post :forgot, user: { username: 'blarg' }
expect(response.status).to eq 400
expect(parsed_response).to have_key :error
expect(parsed_response[:error]).to have_key :validation_errors
expect(parsed_response[:error][:validation_errors]).to have_key :username
end
end
end
context 'when configured with forgot always successful' do
before :each do
@forgot_password_success_config = Rockauth::Configuration.forgot_password_always_successful
Rockauth::Configuration.forgot_password_always_successful = true
end
after :each do
Rockauth::Configuration.forgot_password_always_successful = @forgot_password_success_config
end
it "sends an email to the user with reset instructions" do
expect do
post :forgot, user: { username: user.email }
end.to change { ActionMailer::Base.deliveries.length }.by 1
expect(ActionMailer::Base.deliveries.last.to).to match_array [user.email]
end
it "appropriately sets the password reset token for the user" do
expect do
post :forgot, user: { username: user.email }
end.to change { user.reload.password_reset_token }
end
it "appropriately sets the password reset token expiration for the user" do
expect do
post :forgot, user: { username: user.email }
end.to change { user.reload.password_reset_token_expires_at }
end
it "notifies the user of success" do
post :forgot, user: { username: user.email }
expect(response.status).to eq 200
expect(parsed_response).to have_key :meta
expect(parsed_response[:meta]).to have_key :message
end
context "when the username is not valid" do
it "does not send an email" do
expect do
post :forgot, user: { username: 'blarg' }
end.not_to change { ActionMailer::Base.deliveries.length }
end
it "does not inform users of the error" do
post :forgot, user: { username: 'blarg' }
expect(response.status).to eq 200
expect(parsed_response).to have_key :meta
expect(parsed_response[:meta]).to have_key :message
end
end
end
end
describe 'POST reset' do
before :each do
user.initiate_password_reset
end
it "allows updating of the users password" do
expect do
post :reset, user: { password_reset_token: user.password_reset_token, password: password }
end.to change { user.reload.password_digest }
end
it "invalidates the password reset token for the user" do
expect do
post :reset, user: { password_reset_token: user.password_reset_token, password: password }
end.to change { user.reload.password_reset_token }.to nil
end
end
end
end
|
package fr.poulpogaz.isekai.editor.ui.about;
import fr.poulpogaz.isekai.editor.pack.PackSprites;
import fr.poulpogaz.isekai.editor.utils.concurrent.Alarm;
import java.awt.*;
import java.awt.image.BufferStrategy;
import java.util.Random;
public class BackgroundPanel extends Canvas {
private static final int WIDTH = 512;
private static final int HEIGHT = 240;
private static final int CENTER_X = WIDTH / 2;
private static final int ATMOSPHERE_RADIUS = 170;
private static final int EARTH_RADIUS = 110;
private static final int N_STARS = 256;
private static final int MIN_SPEED = 8;
private static final int MAX_SPEED = 24;
private static final Color BACKGROUND_1 = new Color(23, 4, 50);
private static final Color BACKGROUND_2 = new Color(12, 34, 81);
private static final Color BACKGROUND_3 = new Color(18, 59, 147);
private static final Color BACKGROUND_4 = new Color(0, 107, 70);
private static final Color BACKGROUND_5 = new Color(47, 129, 54);
private static final Color BACKGROUND_6 = new Color(73, 146, 49);
private static final Color BACKGROUND_7 = new Color(100, 164, 44);
private static final float[] FRACTIONS = new float[] {0, 0.75f};
private static final Color[] COLORS = new Color[] {BACKGROUND_1, Color.WHITE};
private static final int FPS = 10;
private final Star[] stars = new Star[N_STARS];
private Alarm alarm;
public BackgroundPanel() {
setPreferredSize(new Dimension(WIDTH, HEIGHT));
}
@Override
public void addNotify() {
super.addNotify();
alarm = new Alarm("Renderer");
alarm.schedule(this::draw, 0, 1000 / FPS);
Random r = new Random();
for (int i = 0; i < stars.length; i++) {
Star star = new Star();
star.theta = r.nextDouble() * 2 * Math.PI;
star.distance = r.nextInt(WIDTH - ATMOSPHERE_RADIUS) + ATMOSPHERE_RADIUS;
star.size = r.nextInt(2) + 1;
double speed = r.nextDouble();
star.speed = Math.PI * 2 / ((MIN_SPEED + MAX_SPEED * speed) * FPS);
/**
* 1 -> tour en 4 * FPS -> speed = 2 pi / (4 * FPS * (1 - val) )
* 0.25 -> tour en 16 * FPS -> speed = 2 pi / (16 * FPS)
*/
stars[i] = star;
}
}
@Override
public void removeNotify() {
super.removeNotify();
if (alarm != null) {
alarm.shutdown();
alarm = null;
}
}
private void draw() {
BufferStrategy bs = getBufferStrategy();
if (bs == null) {
createBufferStrategy(2);
return;
}
Graphics2D g2d = (Graphics2D) bs.getDrawGraphics();
g2d.setRenderingHint(RenderingHints.KEY_ANTIALIASING, RenderingHints.VALUE_ANTIALIAS_ON);
g2d.setRenderingHint(RenderingHints.KEY_TEXT_ANTIALIASING, RenderingHints.VALUE_TEXT_ANTIALIAS_ON);
draw(g2d);
g2d.dispose();
bs.show();
}
private void draw(Graphics2D g2d) {
// draw background
g2d.setColor(BACKGROUND_1);
g2d.fillRect(0, 0, WIDTH, HEIGHT);
g2d.setColor(BACKGROUND_2);
fillCircle(g2d, ATMOSPHERE_RADIUS);
g2d.setColor(BACKGROUND_3);
fillCircle(g2d, (ATMOSPHERE_RADIUS + EARTH_RADIUS) / 2);
g2d.setColor(BACKGROUND_4);
fillCircle(g2d, EARTH_RADIUS);
g2d.setColor(BACKGROUND_5);
fillCircle(g2d, 3 * EARTH_RADIUS / 4);
g2d.setColor(BACKGROUND_6);
fillCircle(g2d, 2 * EARTH_RADIUS / 4);
g2d.setColor(BACKGROUND_7);
fillCircle(g2d, EARTH_RADIUS / 4);
// draw sprites
g2d.drawImage(PackSprites.getPlayer(), CENTER_X - 16, HEIGHT - EARTH_RADIUS - 28, 32, 32, null);
// draw stars
for (Star star : stars) {
int x = (int) (Math.cos(star.theta) * star.distance) + CENTER_X;
int y = (int) (Math.sin(star.theta) * -star.distance) + HEIGHT;
int arcStart = (int) Math.toDegrees(star.theta);
star.theta += star.speed;
int x2 = (int) (Math.cos(star.theta) * star.distance) + CENTER_X;
int y2 = (int) (Math.sin(star.theta) * -star.distance) + HEIGHT;
int arcEnd = (int) Math.toDegrees(star.speed);
int size = star.distance * 2;
g2d.setPaint(new LinearGradientPaint(x, y, x2, y2, FRACTIONS, COLORS));
g2d.drawArc(CENTER_X - star.distance, HEIGHT - star.distance,
size, size,
arcStart, arcEnd);
star.theta += star.speed;
}
g2d.setColor(getForeground());
Font font = g2d.getFont().deriveFont(36f);
g2d.setFont(font);
FontMetrics fm = g2d.getFontMetrics();
g2d.drawString("Isekai Editor", 30, (HEIGHT - fm.getHeight()) / 2 + fm.getAscent());
}
private void fillCircle(Graphics2D g2d, int rad) {
int size = rad * 2;
g2d.fillOval(CENTER_X - rad, HEIGHT - rad, size, size);
}
private static class Star {
public double theta;
public int distance;
public int size;
public double speed;
}
}
|
# Copyright 2009-2017 Ram Rachum.
# This program is distributed under the MIT license.
import re
def searchall(pattern, string, flags=0):
'''
Return all the substrings of `string` that match `pattern`.
Note: Currently returns only non-overlapping matches.
'''
if isinstance(pattern, str):
pattern = re.compile(pattern, flags=flags)
matches = []
start = 0
end = len(string)
while True:
match = pattern.search(string, start, end)
if match:
matches.append(match)
start = match.end()
else:
break
return matches
|
using RedisAdminUI.ServiceModel.Operations.Common;
namespace RedisAdminUI.ServiceInterface.Admin
{
public class EchoService : RedisServiceBase
{
public object Any(Echo request)
{
return new EchoResponse
{
Text = RedisNative.Echo(request.Text)
};
}
}
}
|
package pl.kamilszustak.justfit.ui.main.employee.details
import android.app.Application
import pl.kamilszustak.justfit.common.livedata.ResourceDataSource
import pl.kamilszustak.justfit.domain.model.employee.Employee
import pl.kamilszustak.justfit.domain.usecase.employee.GetEmployeeByIdUseCase
import pl.kamilszustak.justfit.ui.base.BaseViewModel
import javax.inject.Inject
class EmployeeDetailsViewModel @Inject constructor(
application: Application,
private val getEmployeeByIdUseCase: GetEmployeeByIdUseCase
) : BaseViewModel(application) {
val employeeResource: ResourceDataSource<Employee> = ResourceDataSource()
fun loadData(employeeId: Long) {
employeeResource.setFlowSource {
getEmployeeByIdUseCase(employeeId)
}
}
fun onRefresh() {
employeeResource.refresh()
}
}
|
self.__precacheManifest = [
{
"revision": "9c030026e8929adc6739",
"url": "/static/css/main.5ff331b9.chunk.css"
},
{
"revision": "9c030026e8929adc6739",
"url": "/static/js/main.5c41e030.chunk.js"
},
{
"revision": "42ac5946195a7306e2a5",
"url": "/static/js/runtime~main.a8a9905a.js"
},
{
"revision": "0655bfa5fd5ab0e65035",
"url": "/static/js/2.6a12aa79.chunk.js"
},
{
"revision": "70812eed80d7bdc0c774873e503a4093",
"url": "/static/media/books.70812eed.png"
},
{
"revision": "ae46a583e1418bd5beefb6dfed4e042c",
"url": "/index.html"
}
];
|
// Copyright 2016 Palantir Technologies, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package launchlib
import (
"testing"
"github.com/stretchr/testify/assert"
)
func TestParseStaticConfig(t *testing.T) {
for i, currCase := range []struct {
name string
data string
want StaticLauncherConfig
}{
{
name: "java static config",
data: `
configType: java
configVersion: 1
mainClass: mainClass
javaHome: javaHome
env:
SOME_ENV_VAR: /etc/profile
OTHER_ENV_VAR: /etc/redhat-release
classpath:
- classpath1
- classpath2
jvmOpts:
- jvmOpt1
- jvmOpt2
args:
- arg1
- arg2
`,
want: StaticLauncherConfig{
LauncherConfig: LauncherConfig{
ConfigType: "java",
ConfigVersion: 1,
},
Env: map[string]string{
"SOME_ENV_VAR": "/etc/profile",
"OTHER_ENV_VAR": "/etc/redhat-release",
},
Executable: "java",
Args: []string{"arg1", "arg2"},
JavaConfig: JavaConfig{
MainClass: "mainClass",
JavaHome: "javaHome",
Classpath: []string{"classpath1", "classpath2"},
JvmOpts: []string{"jvmOpt1", "jvmOpt2"},
},
},
},
{
name: "executable static config",
data: `
configType: executable
configVersion: 1
executable: /usr/bin/postgres
env:
SOME_ENV_VAR: /etc/profile
OTHER_ENV_VAR: /etc/redhat-release
args:
- arg1
- arg2
`,
want: StaticLauncherConfig{
LauncherConfig: LauncherConfig{
ConfigType: "executable",
ConfigVersion: 1,
},
Env: map[string]string{
"SOME_ENV_VAR": "/etc/profile",
"OTHER_ENV_VAR": "/etc/redhat-release",
},
Executable: "/usr/bin/postgres",
Args: []string{"arg1", "arg2"},
},
},
} {
got, _ := ParseStaticConfig([]byte(currCase.data))
assert.Equal(t, currCase.want, got, "Case %d: %s", i, currCase.name)
}
}
func TestParseCustomConfig(t *testing.T) {
for i, currCase := range []struct {
name string
data string
want CustomLauncherConfig
}{
{
name: "java custom config",
data: `
configType: java
configVersion: 1
env:
SOME_ENV_VAR: /etc/profile
OTHER_ENV_VAR: /etc/redhat-release
jvmOpts:
- jvmOpt1
- jvmOpt2
`,
want: CustomLauncherConfig{
LauncherConfig: LauncherConfig{
ConfigType: "java",
ConfigVersion: 1,
},
Env: map[string]string{
"SOME_ENV_VAR": "/etc/profile",
"OTHER_ENV_VAR": "/etc/redhat-release",
},
JvmOpts: []string{"jvmOpt1", "jvmOpt2"},
},
},
{
name: "java custom config without env",
data: `
configType: java
configVersion: 1
jvmOpts:
- jvmOpt1
- jvmOpt2
`,
want: CustomLauncherConfig{
LauncherConfig: LauncherConfig{
ConfigType: "java",
ConfigVersion: 1,
},
JvmOpts: []string{"jvmOpt1", "jvmOpt2"},
},
},
{
name: "java custom config with env placeholder v1",
data: `
configType: java
configVersion: 1
env:
SOME_ENV_VAR: '{{CWD}}/etc/profile'
jvmOpts:
- jvmOpt1
- jvmOpt2
`,
want: CustomLauncherConfig{
LauncherConfig: LauncherConfig{
ConfigType: "java",
ConfigVersion: 1,
},
Env: map[string]string{
"SOME_ENV_VAR": "{{CWD}}/etc/profile",
},
JvmOpts: []string{"jvmOpt1", "jvmOpt2"},
},
},
{
name: "executable custom config",
data: `
configType: executable
configVersion: 1
env:
SOME_ENV_VAR: /etc/profile
OTHER_ENV_VAR: /etc/redhat-release
`,
want: CustomLauncherConfig{
LauncherConfig: LauncherConfig{
ConfigType: "executable",
ConfigVersion: 1,
},
Env: map[string]string{
"SOME_ENV_VAR": "/etc/profile",
"OTHER_ENV_VAR": "/etc/redhat-release",
},
},
},
} {
got, _ := ParseCustomConfig([]byte(currCase.data))
assert.Equal(t, currCase.want, got, "Case %d: %s", i, currCase.name)
}
}
func TestParseStaticConfigFailures(t *testing.T) {
for i, currCase := range []struct {
name string
msg string
data string
}{
{
name: "bad YAML",
msg: `Failed to deserialize Static Launcher Config, please check the syntax of your configuration file`,
data: `
bad: yaml:
`,
},
{
name: "invalid config type",
msg: `Can handle configType\=\{.+\} only, found config`,
data: `
configType: config
configVersion: 1
executable: postgres
`,
},
{
name: "invalid config version",
msg: `Can handle configVersion\=\{1\} only, found 2`,
data: `
configType: executable
configVersion: 2
executable: postgres
`,
},
{
name: "invalid executable",
msg: `Can handle executable\=\{.+\} only, found /bin/rm`,
data: `
configType: executable
configVersion: 1
executable: /bin/rm
args:
- "-rf"
- "/"
`,
},
{
name: "missing executable",
msg: `Config type \"executable\" requires top-level \"executable:\" value`,
data: `
configType: executable
configVersion: 1
`,
},
{
name: "missing java main class and classpath",
msg: `(MainClass|Classpath): zero value`,
data: `
configType: java
configVersion: 1
`,
},
{
name: "missing java main class",
msg: `MainClass: zero value`,
data: `
configType: java
configVersion: 1
classpath:
- thing1
- thing2
`,
},
{
name: "missing java classpath",
msg: `Classpath: zero value`,
data: `
configType: java
configVersion: 1
mainClass: hello.world
`,
},
} {
_, err := ParseStaticConfig([]byte(currCase.data))
assert.NotEqual(t, err, nil, "Case %d: %s had no errors", i, currCase.name)
assert.Regexp(t, currCase.msg, err.Error(), "Case %d: %s had the wrong error message", i, currCase.name)
}
}
|
covers 'facets/enumargs'
test_case Enumerable::Arguments do
setup do
@PlusArray = Class.new do
include Enumerable::Argumentable
def initialize(arr)
@arr = arr
end
def each(n=0)
@arr.each{ |e| yield(e+n) }
end
end
end
method :collect do
test do
t = @PlusArray.new([1,2,3])
r = t.collect(4){ |e| e }
r.assert == [5,6,7]
end
end
#method :each_slice do
# test do
# t = PlusArray.new([1,2,3,4])
# a = []
# t.each_slice(2,4){ |e,f| a << [e,f] }
# a.assert == [[5,6],[7,8]]
# end
#end
#method :find do
# test do
# t = PlusArray.new([1,2,3,4])
# f = t.find(2, :ifnone=>lambda{:NOPE}) { |a| a == 10 }
# f.assert == :NOPE
# end
#end
method :grep do
end
method :to_a do
test do
t = @PlusArray.new([1,2,3])
t.to_a(4).assert == [5,6,7]
end
end
# TODO: These two methods have issues! Any way to fix?
skip do
method :min do
test do
t = @PlusArray.new([1,2,3])
# test is failing. min has a variable number
# of arguments which makes it's .arity = -1.
# given the way this works for arity -1
# the method always passes the single argument to
# the min method, and passes nothing to the each
# resulting it taking the X smallest values of the
# given and unchanged array
t.min(4).assert = 5 # returning [1,2,3]
end
end
method :max do
# test is failing. max has a variable number of arguments which makes it
# .arity = -1. given the way this works for arity -1 the method
# always passes the single argument to the max method, and passes nothing
# to the each resulting it taking the X largest values of the given and
# unchanged array
test do
t = @PlusArray.new([1,2,3])
t.max(4).assert == 7
end
end
end
method :include? do
test do
t = @PlusArray.new([1,2,3])
t.assert.include?(7,4)
end
end
method :select do
test do
t = @PlusArray.new([1,2,3])
r = t.select(4){ |x| x == 6 }
r.assert == [6]
end
end
method :reject do
test do
t = @PlusArray.new([1,2,3])
r = t.reject(4){ |x| x == 6 }
r.assert == [5,7]
end
end
end
|
// Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/ash/multi_user/multi_user_util.h"
#include <vector>
#include "base/strings/string_util.h"
#include "chrome/browser/browser_process.h"
#include "chrome/browser/profiles/profile.h"
#include "chrome/browser/profiles/profile_manager.h"
#include "google_apis/gaia/gaia_auth_util.h"
#if defined(OS_CHROMEOS)
#include "chrome/browser/ui/ash/multi_user/multi_user_window_manager.h"
#include "components/user_manager/user_manager.h"
#endif
namespace multi_user_util {
std::string GetUserIDFromProfile(Profile* profile) {
return GetUserIDFromEmail(profile->GetOriginalProfile()->GetProfileName());
}
std::string GetUserIDFromEmail(const std::string& email) {
// |email| and profile name could be empty if not yet logged in or guest mode.
return email.empty() ?
email : gaia::CanonicalizeEmail(gaia::SanitizeEmail(email));
}
Profile* GetProfileFromUserID(const std::string& user_id) {
// Unit tests can end up here without a |g_browser_process|.
if (!g_browser_process || !g_browser_process->profile_manager())
return NULL;
std::vector<Profile*> profiles =
g_browser_process->profile_manager()->GetLoadedProfiles();
std::vector<Profile*>::const_iterator profile_iterator = profiles.begin();
for (; profile_iterator != profiles.end(); ++profile_iterator) {
if (GetUserIDFromProfile(*profile_iterator) == user_id)
return *profile_iterator;
}
return NULL;
}
Profile* GetProfileFromWindow(aura::Window* window) {
#if defined(OS_CHROMEOS)
chrome::MultiUserWindowManager* manager =
chrome::MultiUserWindowManager::GetInstance();
// We might come here before the manager got created - or in a unit test.
if (!manager)
return NULL;
const std::string user_id = manager->GetUserPresentingWindow(window);
return user_id.empty() ? NULL :
multi_user_util::GetProfileFromUserID(user_id);
#else
return NULL;
#endif
}
bool IsProfileFromActiveUser(Profile* profile) {
#if defined(OS_CHROMEOS)
return GetUserIDFromProfile(profile) ==
user_manager::UserManager::Get()->GetActiveUser()->email();
#else
// In non Chrome OS configurations this will be always true since this only
// makes sense in separate desktop mode.
return true;
#endif
}
const std::string& GetCurrentUserId() {
#if defined(OS_CHROMEOS)
return user_manager::UserManager::Get()->GetActiveUser()->email();
#else
return base::EmptyString();
#endif
}
// Move the window to the current user's desktop.
void MoveWindowToCurrentDesktop(aura::Window* window) {
#if defined(OS_CHROMEOS)
chrome::MultiUserWindowManager::GetInstance()->ShowWindowForUser(
window,
GetCurrentUserId());
#endif
}
} // namespace multi_user_util
|
require 'i18n'
I18n.config.load_path += Dir[File.join(File.expand_path('../', __FILE__), 'locales', '*.{rb,yml}')]
I18n.config.available_locales = [:en, :nl, :de]
I18n.config.default_locale = :en
|
def find_active_record_object_by_id body
find_active_record_object body
end
def find_active_record_object body
object, oid = body.split('#')
object.strip!
object.capitalize!
oid.strip!
object.constantize.find(oid).inspect
end
def run_rake_task body #please don't run arbitrary system commands here
`#{body}`
end
def get_some_rest body
num = body.split(' ')[1]
sleep num.to_i
"That was a nice nap"
end
|
/*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
use std::str::FromStr;
use anyhow::{Context, Error, Result};
use kernel_cmdline::KernelCmdArgs;
use reqwest::Url;
use serde::{de, Deserialize, Deserializer};
use crate::kernel_cmdline::MetalosCmdline;
#[derive(Default, Debug, Deserialize, Clone)]
pub struct Config {
#[serde(default)]
pub event_backend: EventBackend,
}
impl Config {
/// Some config options can be overridden by the kernel cmdline. The default
/// values are first deserialized from the config file
/// (/etc/metalctl.toml), and then any args present on the kernel cmdline
/// are processed.
pub fn apply_kernel_cmdline_overrides(&mut self) -> Result<()> {
self.apply_overrides(MetalosCmdline::from_proc_cmdline()?)
}
fn apply_overrides(&mut self, cmdline: MetalosCmdline) -> Result<()> {
if let Some(uri) = cmdline.event_backend_base_uri {
self.event_backend.event_backend_base_uri = uri;
}
Ok(())
}
}
#[derive(Debug, PartialEq, Clone)]
pub struct EventBackendBaseUri(Url);
impl FromStr for EventBackendBaseUri {
type Err = Error;
fn from_str(s: &str) -> Result<Self> {
s.parse().map(Self).context("not valid url")
}
}
impl<'de> Deserialize<'de> for EventBackendBaseUri {
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
D: Deserializer<'de>,
{
let s = String::deserialize(deserializer)?;
FromStr::from_str(&s).map_err(de::Error::custom)
}
}
#[derive(Debug, Deserialize, Clone)]
pub struct EventBackend {
pub event_backend_base_uri: EventBackendBaseUri,
}
impl EventBackend {
pub fn event_backend_base_uri(&self) -> &Url {
&self.event_backend_base_uri.0
}
}
impl Default for EventBackend {
fn default() -> Self {
Self {
event_backend_base_uri: "https://metalos/sendEvent".parse().unwrap(),
}
}
}
#[cfg(test)]
mod tests {
use anyhow::Result;
use kernel_cmdline::KernelCmdArgs;
use super::{Config, MetalosCmdline};
#[test]
fn overrides() -> Result<()> {
let mut config = Config::default();
assert_eq!(
"https://metalos/sendEvent",
config.event_backend.event_backend_base_uri().to_string()
);
let cmdline = MetalosCmdline::from_kernel_args(
"metalos.event_backend_base_uri=\"https://event-host/sendEvent\"",
)?;
config.apply_overrides(cmdline)?;
assert_eq!(
"https://event-host/sendEvent",
config.event_backend.event_backend_base_uri().to_string()
);
Ok(())
}
}
|
#!/usr/bin/env bash
if [ "$#" -lt "1" ]; then
echo "Usage:
$0 -ct <token>
$0 -ct <token> --force -p <CSV list of pack IDs>
-ct, --circle-token The circleci token.
[-f, --force] Whether to trigger the force upload flow.
[-p, --packs] CSV list of pack IDs. Mandatory when the --force flag is on.
"
exit 1
fi
_bucket_upload="true"
# Parsing the user inputs.
while [[ "$#" -gt 0 ]]; do
case $1 in
-ct|--circle-token) _circle_token="$2"
shift
shift;;
-f|--force) _force=true
_bucket_upload=""
shift;;
-p|--packs) _packs="$2"
shift
shift;;
*) # unknown option.
shift;;
esac
done
if [ -z "$_circle_token" ]; then
echo "You must provide a circle token."
exit 1
fi
if [ -n "$_force" ] && [ -z "$_packs" ]; then
echo "You must provide a csv list of packs to force upload."
exit 1
fi
trigger_build_url="https://circleci.com/api/v2/project/github/demisto/content/pipeline"
post_data=$(cat <<-EOF
{
"branch": "master",
"parameters": {
"bucket_upload": "${_bucket_upload}",
"force_pack_upload": "${_force}",
"packs_to_upload": "${_packs}"
}
}
EOF
)
curl \
--header "Accept: application/json" \
--header "Content-Type: application/json" \
-k \
--data "${post_data}" \
--request POST ${trigger_build_url} \
--user "$_circle_token:"
|
package com.secretapp.backend.data.message.update
import scodec.bits.BitVector
@SerialVersionUID(1L)
case class RemovedDevice(userId: Int, keyHash: Long) extends SeqUpdateMessage {
val header = RemovedDevice.header
def userIds: Set[Int] = Set(userId)
def groupIds: Set[Int] = Set.empty
}
object RemovedDevice extends SeqUpdateMessageObject {
val header = 0x25
}
|
<?php
/**
* Created by PhpStorm.
* User: Administrator
* Date: 2017/11/14/014
* Time: 17:50
*/
namespace Larfree\Components\Base;
use Larfree\Components\Components;
class Edit extends Components
{
static public function component(&$path, &$config, $model)
{
parent::component($path, $config, $model);
//如果变量里面有 就用变量里面的
if (@$config['param']['readApi']) {
$config['config']['config']['readApi'] = $config['param']['readApi'];
}
if (@$config['param']['api']) {
$config['config']['config']['api'] = $config['param']['api'];
}
$readApi = $config['config']['config']['readApi'];
$readApi = self::compile($readApi, $config['param']);
$response = self::getJSON($readApi);
$config['config']['config']['api'] = self::compile($config['config']['config']['api'], $config['param']);
$config['data'] = $response;
}
}
|
package org.ostelco.prime
import com.palantir.docker.compose.DockerComposeRule
import com.palantir.docker.compose.connection.waiting.HealthChecks
import io.dropwizard.testing.DropwizardTestSupport
import io.dropwizard.testing.ResourceHelpers
import org.joda.time.Duration
import org.junit.AfterClass
import org.junit.Assert.assertNotNull
import org.junit.BeforeClass
import org.junit.ClassRule
import org.junit.Test
class TestPrimeConfig {
/**
* Do nothing.
* This test will just start and stop the server.
* It will validate config file in 'src/integration-tests/resources/config.yaml'
*/
@Test
fun test() {
assertNotNull(SUPPORT)
}
companion object {
private val SUPPORT:DropwizardTestSupport<PrimeConfiguration> =
DropwizardTestSupport(
PrimeApplication::class.java,
ResourceHelpers.resourceFilePath("config.yaml"))
@ClassRule
@JvmField
var docker: DockerComposeRule = DockerComposeRule.builder()
.file("src/integration-tests/resources/docker-compose.yaml")
.waitingForService("neo4j", HealthChecks.toHaveAllPortsOpen())
.waitingForService("neo4j",
HealthChecks.toRespond2xxOverHttp(7474) {
port -> port.inFormat("http://\$HOST:\$EXTERNAL_PORT/browser")
},
Duration.standardSeconds(20L))
.build()
@JvmStatic
@BeforeClass
fun beforeClass() {
SUPPORT.before()
}
@JvmStatic
@AfterClass
fun afterClass() {
SUPPORT.after()
}
}
}
|
# apache traffic server 启动脚本
在官方基础上增加archlinux支持，需要通过aur安装start-stop-daemon包
ats目录需要手动修改为自己的安装目录
## 安装start-stop-daemon包
wget http://developer.axis.com/download/distribution/apps-sys-utils-start-stop-daemon-IR1_9_18-2.tar.gz
tar zxf apps-sys-utils-start-stop-daemon-IR1_9_18-2.tar.gz
cd apps/sys-utils/start-stop-daemon-IR1_9_18-2/
cc start-stop-daemon.c -o start-stop-daemon
cp start-stop-daemon /usr/local/bin/start-stop-daemon
|
'use strict';
var angular = require('angular');
var template = require('./contributionActivity.html');
var activityService = require('../../services/activityService.js');
// sub components
var blogPostComponent = require('../../components/blogPost/blogPost');
module.exports = angular.module('myApp.components.contributionActivity', [
activityService.name,
blogPostComponent.name
])
.directive('myContributionActivity', function (
$sce
) {
return {
restrict: 'E',
template: template,
controller: 'MyContributionActivityCtrl',
replace: true,
scope: {
},
link: function (scope, elem, attrs, controller) {
scope._getEventSummary = function (eventModel) {
return $sce.trustAsHtml(eventModel.summary);
};
}
};
})
.controller('MyContributionActivityCtrl', function (
ActivityService,
$scope
) {
ActivityService.getActivity(true).then(_onActivityLoaded).catch(_onActivityLoadedError);
$scope.$on('$destroy', _onDestroyed);
/* ************************************
EVENT HANDLERS / PRIVATE METHODS
************************************ */
function _onActivityLoaded (data) {
$scope.activity = data.activity;
}
function _onActivityLoadedError (exception) {
$scope.errorMessage = 'Error fetching activity from APIs';
$scope.errorMessageDetails = (exception.message ? exception.message : '');
}
function _onDestroyed () {
}
});
|
import {Results} from "./execution-types.js"
import {recursivelyGenerateGraph} from "./graphing/recursively-generate-graph.js"
import {recursivelyCountFailures} from "./graphing/recursively-count-failures.js"
import {recursivelyAssertValidity} from "./graphing/recursively-assert-validity.js"
export function graph(results1: Results) {
recursivelyAssertValidity(results1)
const failCount = recursivelyCountFailures(results1)
const onlyShowErrors = failCount > 0
const {output, failSummary} = recursivelyGenerateGraph(results1, onlyShowErrors)
return output + (
failSummary.length > 0
? "\n\n" + failSummary.join("\n")
: ""
)
}
|
package com.goertek.commonlib.custom.fragment;
import com.goertek.commonlib.custom.BaseCustomFragment;
import com.goertek.commonlib.view.unit.UnitConstants;
/**
* 日期Fragment
*
* @author ww
* @version 1.0.0
* @since 2019/07/19
*/
public class DateFragment extends BaseCustomFragment {
public DateFragment() {
}
@Override
public String getLabel() {
return UnitConstants.LABEL_DATE;
}
@Override
protected int getSortNum() {
return UnitConstants.LABEL_DATE_SORT_NUM;
}
}
|
from enum import Enum
from . import directory
from .traversal import resolve, ResourceProxy
from ..model.data import Entries, Entry
from ..model.common.resource import Resource
class DataCardinality(Enum):
MANY = 1
MAYBE_ONE = 2
class Data:
def __init__(self, data, maybe_meta=None, maybe_jsonapi=None,
maybe_links=None, maybe_included=None):
self.data = data
self.maybe_meta = maybe_meta
self.maybe_jsonapi = maybe_jsonapi
self.maybe_links = maybe_links
self.maybe_included = maybe_included
self._directory = directory.mk(data, maybe_included)
self._cache_contents = None
either_entries_or_maybe_entry, = data
if type(either_entries_or_maybe_entry) is Entries:
self._cardinality = DataCardinality.MANY
elif type(either_entries_or_maybe_entry) in [Entry, type(None)]:
self._cardinality = DataCardinality.MAYBE_ONE
else:
msg = 'insanity: {0}'.format(str(either_entries_or_maybe_entry))
raise RuntimeError(msg)
def __iter__(self):
maybe_contents = self.produce_maybe_contents()
if maybe_contents:
if type(maybe_contents) is list:
return iter(maybe_contents)
else:
return iter([maybe_contents])
else:
return iter([])
def produce_maybe_contents(self):
# n.b. because self._cache_contents can be legitimately None when
# cardinality is one and maybe_entry is None, this cache strategy
# will fail repeatedly for that one case.
if self._cache_contents:
return self._cache_contents
else:
if self._cardinality == DataCardinality.MANY:
entries, = self.data
if type(entries) is not Entries:
raise RuntimeError('insanity: {0}'.format(str(entries)))
list_entries = directory.entries_to_list(entries)
list_resources = []
for entry in list_entries:
either_resource_or_resource_id, = entry
resource = \
resolve(self._directory, either_resource_or_resource_id)
list_resources.append(
ResourceProxy(self._directory, resource)
)
self._cache_contents = list_resources
return self._cache_contents
elif self._cardinality == DataCardinality.MAYBE_ONE:
maybe_entry, = self.data
if type(maybe_entry) is Entry:
either_resource_or_resource_id, = maybe_entry
resource = \
resolve(self._directory, either_resource_or_resource_id)
self._cache_contents = \
ResourceProxy(self._directory, resource)
return self._cache_contents
elif maybe_entry is None:
return None
else:
raise RuntimeError('insanity: {0}'.format(str(entry)))
else:
raise RuntimeError('insanity: {0}', str(self._cardinality))
class Errors:
def __init__(self, errors, maybe_meta=None, maybe_jsonapi=None,
maybe_links=None):
self.errors = errors
self.maybe_meta = maybe_meta
self.maybe_jsonapi = maybe_jsonapi
self.maybe_links = maybe_links
def produce_errors(self):
list_errors, = self.errors
return list_errors
def produce_maybe_meta(self):
return self.maybe_meta
def produce_maybe_jsonapi(self):
return self.maybe_jsonapi
def produce_maybe_links(self):
return self.maybe_links
class Meta:
def __init__(self, meta, maybe_jsonapi=None, maybe_links=None):
self.meta = meta
self.maybe_jsonapi = maybe_jsonapi
self.maybe_links = maybe_links
def produce_meta(self):
return self.meta
def produce_maybe_jsonapi(self):
return self.maybe_jsonapi
def produce_maybe_links(self):
return self.maybe_links
def mk_data(data, maybe_meta=None, maybe_jsonapi=None, maybe_links=None,
maybe_included=None):
return Data(data, maybe_meta, maybe_jsonapi, maybe_links, maybe_included)
def mk_errors(errors, maybe_meta=None, maybe_jsonapi=None, maybe_links=None):
return Errors(errors, maybe_meta, maybe_jsonapi, maybe_links)
def mk_meta(meta, maybe_jsonapi=None, maybe_links=None):
return Meta(meta, maybe_jsonapi, maybe_links)
|
#!/bin/bash
# :::: fzf Stuff ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
# fzf fuzzy completion:
if [[ "$DISTRO_IS" == "fedora" ]]; then
[ -f /usr/share/fzf/shell/key-bindings.bash ] && source /usr/share/fzf/shell/key-bindings.bash
export FZF_DEFAULT_COMMAND='fd --hidden --follow --exclude ".git"'
elif [[ "$DISTRO_IS" == "debian" ]]; then
[ -f /usr/share/doc/fzf/examples/key-bindings.bash ] && source /usr/share/doc/fzf/examples/key-bindings.bash
export FZF_DEFAULT_COMMAND='fdfind --hidden --follow --exclude ".git"'
elif [[ "$OSTYPE" == "darwin"* ]]; then
[ -f $HOME/.fzf.bash ] && source $HOME/.fzf.bash
export FZF_DEFAULT_COMMAND='fd --hidden --follow --exclude ".git"'
elif [[ "$OSTYPE" == "linux-android" ]]; then
source $PREFIX/share/fzf/completion.bash
export FZF_DEFAULT_COMMAND='fd --hidden --follow --exclude ".git"'
fi
# Override default fzf commands:
export FZF_CTRL_T_COMMAND=$FZF_DEFAULT_COMMAND
export FZF_ALT_C_COMMAND=$FZF_DEFAULT_COMMAND
_fzf_compgen_path() {
$FZF_DEFAULT_COMMAND "$1"
}
_fzf_compgen_dir() {
fd --type d --hidden --follow --exclude ".git" . "$1"
}
|
import { LOAD_DEPARTMENT, CREATE_DEPARTMENT } from "../action/department";
const initialState = {
departments: [],
code: "null",
};
export default (state = initialState, action) => {
switch (action.type) {
case CREATE_DEPARTMENT:
return {
...state,
departments: state.departments.push(action.data),
};
case LOAD_DEPARTMENT:
let departments = action.data;
// console.log(departments);
let output = [];
departments.forEach((d) => {
output.push(d);
});
return {
...state,
departments: output,
};
default:
return state;
}
};
|
namespace ExaLearn.Bl.DTO
{
public class AssessmentDTO
{
public int passedTestId { get; set; }
public int Essay { get; set; }
public int Speaking { get; set; }
}
}
|
org 0x7c00
setup:
push word 0
pop cs
push word 0
pop ds
push word 0
pop es
jmp start
print:
pusha
mov ah, 0Eh
mov bh, 0
.loop:
lodsb
cmp al, 0
je .end
int 10h
jmp .loop
.end:
popa
ret
getstring:
pusha
mov di, buffer
.loop:
xor ah, ah
int 16h
cmp al, 13
je .end
stosb
mov ah, 0x0E
mov bh, 0
int 10h
jmp .loop
.end:
xor al, al
stosb
popa
ret
.tmp db 0
start:
mov si, welcome
call print
.entrance:
mov si, entrancedesc
call print
cmp [has_key], 0
jne .entrance_rep
mov si, keyis
call print
.entrance_rep:
mov si, prompt
call print
call getstring
mov si, nl
call print
cmp dword [buffer], "take"
je .take_ent
cmp dword [buffer], "drop"
je .drop_ent
cmp dword [buffer], "desc"
je .entrance
cmp dword [buffer], "pack"
je .inventory
cmp dword [buffer], "plug"
je .plugh
cmp dword [buffer], "nort"
je .finish_bump
cmp dword [buffer], "sout"
je .finish_bump
cmp dword [buffer], "east"
je .bonk
cmp dword [buffer], "west"
je .bonk
.huh_ent:
mov si, what
call print
jmp .entrance_rep
.take_ent:
cmp word [buffer+5], "ke"
jne .huh_ent
cmp byte [buffer+7], "y"
jne .huh_ent
cmp [has_key], 0
jne .huh_ent
mov [has_key], 1
mov si, grabkey
call print
jmp .entrance_rep
.drop_ent:
cmp word [buffer+5], "ke"
jne .huh_ent
cmp byte [buffer+7], "y"
jne .huh_ent
cmp [has_key], 0
je .huh_ent
mov [has_key], 0
mov si, dropkey
call print
jmp .entrance_rep
.inventory:
mov si, inventory
cmp [has_key], 0
je .inventory_has_no
mov si, key
call print
mov si, nl
call print
jmp .entrance_rep
.inventory_has_no:
mov si, nothing
call print
mov si, nl
call print
jmp .entrance_rep
.plugh:
cmp byte [buffer+4], "h"
jne .entrance_rep
mov si, plugh
call print
jmp .entrance_rep
.finish_bump:
cmp byte [buffer+4], "h"
jne .huh_ent
.bonk:
mov si, bonk
call print
jmp .entrance_rep
welcome db "* Adventure512 *",13,10,13,10,0
entrancedesc db "Entrance",13,10,0
keyis db "A key is here.",13,10,0
bonk db "Ow!",13,10,0
grabkey db "You take the key.",13,10,0
dropkey db "You drop the key.",13,10,0
what db "???",0
inventory db "Inventory:",0
key db "key",0
nothing db "nothing",0
nl db 13,10,0
prompt db ">",0
plugh db "No cave here",13,10,0
has_key db 0
dw 0xAA55
buffer:
times (1024*1440-512) db 0
|
# -*- coding: utf-8 -*-
module SoftBankHealthCare
class Client
def initialize(params)
@api = ApiClient.new
@api.login params
refresh
end
def date=(v)
refresh v
end
def refresh(date = Date.today)
@summary = @api.home_summary(date)['root']
end
def weight
@summary['weight']
end
def body_fat
@summary['bodyfat']
end
def bmi
@summary['bmi']
end
def basal_metabolism
@summary['bmr']
end
def physical_age
@summary['bodyage']
end
def skeletal_muscle_level
@summary['muscle']
end
def bone_level
@summary['bone']
end
def visceral_fat_level
@summary['visceralfat']
end
def water_content
@summary['tbw']
end
end
end
|
# frozen_string_literal: true
$LOAD_PATH.unshift(File.expand_path("..", __FILE__))
require "validatr/version"
require "validatr/utils"
require "validatr/luhn"
require "validatr/damm"
require "validatr/verhoeff"
require "validatr/ext"
module Validatr
end
|
// Copyright (C) 2003-2011 Marc Duruflé
// Copyright (C) 2001-2011 Vivien Mallet
//
// This file is part of the linear-algebra library Seldon,
// http://seldon.sourceforge.net/.
//
// Seldon is free software; you can redistribute it and/or modify it under the
// terms of the GNU Lesser General Public License as published by the Free
// Software Foundation; either version 2.1 of the License, or (at your option)
// any later version.
//
// Seldon is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
// more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with Seldon. If not, see http://www.gnu.org/licenses/.
#ifndef SELDON_FILE_FUNCTIONS_MATRIX_COMPLEX_CXX
/*
Functions defined in this file:
(storage RowComplexSparse, ArrayRowComplexSparse, etc)
alpha.A + B -> B
Add(alpha, A, B)
alpha.M -> M
Mlt(alpha, M)
A = A(row_perm, col_perm)
ApplyPermutation(A, row_perm, col_perm)
A(row_perm, col_perm) = A
ApplyInversePermutation(A, row_perm, col_perm)
A = Drow * A * Dcol
ScaleMatrix(A, Drow, Dcol)
A = Drow * A
ScaleLeftMatrix(A, Drow)
A = A * Dcol
ScaleRightMatrix(A, Dcol)
*/
namespace Seldon
{
//! B = B + alpha A
template<class T0, class T1, class Allocator1, class T2, class Allocator2>
void AddMatrix(const T0& alpha,
const Matrix<T1, Symmetric,
ArrayRowSymComplexSparse, Allocator1>& A,
Matrix<T2, Symmetric, ArrayRowSymComplexSparse, Allocator2>& B)
{
int m = B.GetM(), n, ni;
Vector<T2> value(2*B.GetN());
IVect index(2*B.GetN());
for (int i = 0 ; i < m ; i++)
{
n = A.GetRealRowSize(i);
ni = A.GetImagRowSize(i);
for (int j = 0; j < n; j++)
{
value(j) = alpha*T2(A.ValueReal(i, j), 0);
index(j) = A.IndexReal(i, j);
}
for (int j = 0; j < ni; j++)
{
value(j+n) = alpha*T2(0, A.ValueImag(i, j));
index(j+n) = A.IndexImag(i, j);
}
B.AddInteractionRow(i, n+ni, index, value);
}
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1, class T2, class Allocator2>
void AddMatrix(const T0& alpha, const Matrix<T1, Symmetric,
ArrayRowSymComplexSparse, Allocator1>& A,
Matrix<T2, Symmetric, ArrayRowSymSparse, Allocator2>& B)
{
int m = B.GetM(), n;
Vector<T2, VectFull, Allocator2> value(B.GetN());
for (int i = 0 ; i < m ; i++)
{
n = A.GetRealRowSize(i);
for (int j = 0; j < n; j++)
value(j) = alpha*T1(A.ValueReal(i, j), 0);
B.AddInteractionRow(i, n, A.GetRealInd(i), value.GetData());
n = A.GetImagRowSize(i);
for (int j = 0; j < n; j++)
value(j) = alpha*T1(0, A.ValueImag(i, j));
B.AddInteractionRow(i, n, A.GetImagInd(i), value.GetData());
}
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1,
class T2, class Allocator2>
void AddMatrix(const T0& alpha, const Matrix<T1, General,
ArrayRowComplexSparse, Allocator1>& A,
Matrix<T2, General, ArrayRowSparse, Allocator2>& B)
{
int m = B.GetM(), n;
Vector<T2, VectFull, Allocator2> value(B.GetN());
for (int i = 0; i < m; i++)
{
n = A.GetRealRowSize(i);
for (int j = 0; j < n; j++)
value(j) = alpha*T1(A.ValueReal(i, j), 0);
B.AddInteractionRow(i, n, A.GetRealInd(i), value.GetData());
n = A.GetImagRowSize(i);
for (int j = 0; j < n; j++)
value(j) = alpha*T1(0, A.ValueImag(i, j));
B.AddInteractionRow(i, n, A.GetImagInd(i), value.GetData());
}
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1,
class T2, class Allocator2>
void AddMatrix(const T0& alpha, const Matrix<T1, General,
ArrayRowComplexSparse, Allocator1>& A,
Matrix<T2, General, ArrayRowComplexSparse, Allocator2>& B)
{
int m = B.GetM(), n, ni;
Vector<T2> value(2*B.GetN()); IVect index(2*B.GetN());
for (int i = 0 ; i < m ; i++)
{
n = A.GetRealRowSize(i);
ni = A.GetImagRowSize(i);
for (int j = 0; j < n; j++)
{
value(j) = alpha*T2(A.ValueReal(i, j), 0);
index(j) = A.IndexReal(i, j);
}
for (int j = 0; j < ni; j++)
{
value(n+j) = alpha*T2(0, A.ValueImag(i, j));
index(n+j) = A.IndexImag(i, j);
}
B.AddInteractionRow(i, n+ni, index, value);
}
}
//! C = C + complex(A,B)
template<class T0, class T1, class Prop1, class Allocator1,
class T2, class Prop2, class Allocator2,
class T3, class Prop3, class Allocator3>
void AddMatrix(const T0& alpha,
const Matrix<T1, Prop1, ArrayRowSymSparse, Allocator1>& A,
const Matrix<T2, Prop2, ArrayRowSymSparse, Allocator2>& B,
Matrix<T3, Prop3, ArrayRowSymComplexSparse, Allocator3>& C)
{
int m = B.GetM(), n, ni;
Vector<T3> value(2*B.GetN()); IVect index(2*B.GetN());
for (int i = 0 ; i < m ; i++)
{
n = A.GetRowSize(i);
ni = B.GetRowSize(i);
for (int j = 0; j < n; j++)
{
value(j) = alpha*T3(A.Value(i, j), 0);
index(j) = A.Index(i, j);
}
for (int j = 0; j < ni; j++)
{
value(n+j) = alpha*T3(0, B.Value(i, j));
index(n+j) = B.Index(i, j);
}
C.AddInteractionRow(i, n+ni, index, value);
}
}
//! C = C + complex(A,B)
template<class T0, class T1, class Prop1, class Allocator1,
class T2, class Prop2, class Allocator2,
class T3, class Prop3, class Allocator3>
void AddMatrix(const T0& alpha,
const Matrix<T1, Prop1, ArrayRowSparse, Allocator1>& A,
const Matrix<T2, Prop2, ArrayRowSparse, Allocator2>& B,
Matrix<T3, Prop3, ArrayRowComplexSparse, Allocator3>& C)
{
int m = B.GetM(), n, ni;
Vector<T3> value(2*B.GetN());
IVect index(2*B.GetN());
for (int i = 0 ; i < m ; i++)
{
n = A.GetRowSize(i);
ni = B.GetRowSize(i);
for (int j = 0; j < n; j++)
{
value(j) = alpha*T3(A.Value(i, j), 0);
index(j) = A.Index(i, j);
}
for (int j = 0; j < ni; j++)
{
value(n+j) = alpha*T3(0, B.Value(i, j));
index(n+j) = B.Index(i, j);
}
C.AddInteractionRow(i, n+ni, index, value);
}
}
template<class T, class Allocator>
void Add_csr_ptr(const T& alpha, long* ptr_A, int* ind_A, T* data_A,
long* ptr_B, int* ind_B, T* data_B, int m,
Vector<long>& Ptr,
Vector<int>& Ind,
Vector<T, VectFull, Allocator>& Val)
{
int i = 0;
long j = 0;
long k;
// A and B might have the same structure
// Loop over all non-zeros. If the structures of A and B differ at any
// time, the loop is broken and a different strategy is undertaken.
for (i = 0; i < m; i++)
if (ptr_A[i + 1] == ptr_B[i + 1])
{
for (j = ptr_A[i]; j < ptr_A[i + 1]; j++)
if (ind_A[j] == ind_B[j])
data_B[j] += alpha * data_A[j];
else
break;
if (j != ptr_A[i + 1])
break;
}
else
break;
// Success: A and B have the same structure.
if (i == m)
return;
// The addition is performed row by row in the following lines. Thus the
// additions already performed in the current line, if started, should be
// canceled.
for (k = ptr_A[i]; k < j; k++)
if (ind_A[k] == ind_B[k])
data_B[k] -= alpha * data_A[k];
// Number of non zero entries currently found.
long Nnonzero = ptr_A[i];
// counting the number of non-zero entries
long kb, jb(0), ka, ja(0);
for (int i2 = i; i2 < m; i2++)
{
kb = ptr_B[i2];
for (ka = ptr_A[i2]; ka < ptr_A[i2 + 1]; ka++)
{
ja = ind_A[ka];
while (kb < ptr_B[i2 + 1] && ind_B[kb] < ja)
{
kb++;
Nnonzero++;
}
if (kb < ptr_B[i2 + 1] && ja == ind_B[kb])
kb++;
Nnonzero++;
}
while (kb < ptr_B[i2 + 1])
{
kb++;
Nnonzero++;
}
}
// A and B do not have the same structure. An intermediate matrix will be
// needed. The first i rows have already been added. These computations
// are preserved in arrays Ptr, Ind Val.
Ptr.Reallocate(m+1); Ind.Reallocate(Nnonzero);
Val.Reallocate(Nnonzero);
for (int i2 = 0; i2 <= i; i2++)
Ptr(i2) = ptr_B[i2];
for (j = 0; j < ptr_B[i]; j++)
{
Ind(j) = ind_B[j];
Val(j) = data_B[j];
}
// Now deals with the remaining lines.
Nnonzero = ptr_A[i];
for (; i < m; i++)
{
kb = ptr_B[i];
if (kb < ptr_B[i + 1])
jb = ind_B[kb];
for (ka = ptr_A[i]; ka < ptr_A[i + 1]; ka++)
{
ja = ind_A[ka];
while (kb < ptr_B[i + 1] && jb < ja)
// For all elements in B that are before the ka-th element of A.
{
Ind(Nnonzero) = jb;
Val(Nnonzero) = data_B[kb];
kb++;
if (kb < ptr_B[i + 1])
jb = ind_B[kb];
Nnonzero++;
}
if (kb < ptr_B[i + 1] && ja == jb)
// The element in A is also in B.
{
Ind(Nnonzero) = jb;
Val(Nnonzero) = data_B[kb] + alpha * data_A[ka];
kb++;
if (kb < ptr_B[i + 1])
jb = ind_B[kb];
}
else
{
Ind(Nnonzero) = ja;
Val(Nnonzero) = alpha * data_A[ka];
}
Nnonzero++;
}
// The remaining elements from B.
while (kb < ptr_B[i + 1])
{
Ind(Nnonzero) = jb;
Val(Nnonzero) = data_B[kb];
kb++;
if (kb < ptr_B[i + 1])
jb = ind_B[kb];
Nnonzero++;
}
Ptr(i + 1) = Nnonzero;
}
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1,
class T2, class Allocator2>
void AddMatrix(const T0& alpha,
const Matrix<T1, Symmetric, RowSymComplexSparse, Allocator1>& A,
Matrix<T2, Symmetric, RowSymComplexSparse, Allocator2>& B)
{
Vector<int> IndReal, IndImag;
Vector<long> PtrReal, PtrImag;
Vector<typename ClassComplexType<T2>::Treal,
VectFull, Allocator2> DataReal, DataImag;
Add_csr_ptr(alpha, A.GetRealPtr(), A.GetRealInd(), A.GetRealData(),
B.GetRealPtr(), B.GetRealInd(), B.GetRealData(), B.GetM(),
PtrReal, IndReal, DataReal);
Add_csr_ptr(alpha, A.GetImagPtr(), A.GetImagInd(), A.GetImagData(),
B.GetImagPtr(), B.GetImagInd(), B.GetImagData(), B.GetM(),
PtrImag, IndImag, DataImag);
B.SetData(B.GetM(), B.GetN(), DataReal, PtrReal, IndReal,
DataImag, PtrImag, IndImag);
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1,
class T2, class Allocator2>
void AddMatrix(const T0& alpha,
const Matrix<T1, General, RowComplexSparse, Allocator1>& A,
Matrix<T2, General, RowComplexSparse, Allocator2>& B)
{
Vector<int> IndReal, IndImag;
Vector<long> PtrReal, PtrImag;
Vector<typename ClassComplexType<T2>::Treal,
VectFull, Allocator2> DataReal, DataImag;
Add_csr_ptr(alpha, A.GetRealPtr(), A.GetRealInd(), A.GetRealData(),
B.GetRealPtr(), B.GetRealInd(), B.GetRealData(), B.GetM(),
PtrReal, IndReal, DataReal);
Add_csr_ptr(alpha, A.GetImagPtr(), A.GetImagInd(), A.GetImagData(),
B.GetImagPtr(), B.GetImagInd(), B.GetImagData(), B.GetM(),
PtrImag, IndImag, DataImag);
B.SetData(B.GetM(), B.GetN(), DataReal, PtrReal, IndReal,
DataImag, PtrImag, IndImag);
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1,
class T2, class Allocator2>
void AddMatrix(const complex<T0>& alpha,
const Matrix<T1, Symmetric, RowSymComplexSparse, Allocator1>& A,
Matrix<T2, Symmetric, RowSymComplexSparse, Allocator2>& B)
{
if (imag(alpha) != T0(0))
throw Undefined("Add(Matrix<RowSymComplexSparse>)",
"Function not implemented for complex scalars");
Vector<int> IndReal, IndImag;
Vector<long> PtrReal, PtrImag;
Vector<typename ClassComplexType<T2>::Treal,
VectFull, Allocator2> DataReal, DataImag;
Add_csr_ptr(real(alpha), A.GetRealPtr(), A.GetRealInd(), A.GetRealData(),
B.GetRealPtr(), B.GetRealInd(), B.GetRealData(), B.GetM(),
PtrReal, IndReal, DataReal);
Add_csr_ptr(real(alpha), A.GetImagPtr(), A.GetImagInd(), A.GetImagData(),
B.GetImagPtr(), B.GetImagInd(), B.GetImagData(), B.GetM(),
PtrImag, IndImag, DataImag);
B.SetData(B.GetM(), B.GetN(), DataReal, PtrReal, IndReal,
DataImag, PtrImag, IndImag);
}
//! B = B + alpha A
template<class T0, class T1, class Allocator1,
class T2, class Allocator2>
void AddMatrix(const complex<T0>& alpha,
const Matrix<T1, General, RowComplexSparse, Allocator1>& A,
Matrix<T2, General, RowComplexSparse, Allocator2>& B)
{
if (imag(alpha) != T0(0))
throw Undefined("Add(Matrix<RowComplexSparse>)",
"Function not implemented for complex scalars");
Vector<int> IndReal, IndImag;
Vector<long> PtrReal, PtrImag;
Vector<typename ClassComplexType<T2>::Treal,
VectFull, Allocator2> DataReal, DataImag;
Add_csr_ptr(real(alpha), A.GetRealPtr(), A.GetRealInd(), A.GetRealData(),
B.GetRealPtr(), B.GetRealInd(), B.GetRealData(), B.GetM(),
PtrReal, IndReal, DataReal);
Add_csr_ptr(real(alpha), A.GetImagPtr(), A.GetImagInd(), A.GetImagData(),
B.GetImagPtr(), B.GetImagInd(), B.GetImagData(), B.GetM(),
PtrImag, IndImag, DataImag);
B.SetData(B.GetM(), B.GetN(), DataReal, PtrReal, IndReal,
DataImag, PtrImag, IndImag);
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const T0& alpha,
Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A)
{
for (int i = 0; i < A.GetM(); i++)
{
for (int j = 0; j < A.GetRealRowSize(i); j++)
A.ValueReal(i, j) *= alpha;
for (int j = 0; j < A.GetImagRowSize(i); j++)
A.ValueImag(i, j) *= alpha;
}
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const complex<T0>& alpha,
Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A)
{
if (imag(alpha) != T0(0))
throw Undefined("Mlt(Matrix<ArrayRowComplexSparse>)",
"Function not implemented for complex scalars");
for (int i = 0; i < A.GetM(); i++)
{
for (int j = 0; j < A.GetRealRowSize(i); j++)
A.ValueReal(i, j) *= real(alpha);
for (int j = 0; j < A.GetImagRowSize(i); j++)
A.ValueImag(i, j) *= real(alpha);
}
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const T0& alpha,
Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
for (int i = 0; i < A.GetM(); i++)
{
for (int j = 0; j < A.GetRealRowSize(i); j++)
A.ValueReal(i,j) *= alpha;
for (int j = 0; j < A.GetImagRowSize(i); j++)
A.ValueImag(i,j) *= alpha;
}
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const complex<T0>& alpha,
Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
if (imag(alpha) != T0(0))
throw Undefined("Mlt(Matrix<ArrayRowComplexSparse>)",
"Function not implemented for complex scalars");
for (int i = 0; i < A.GetM(); i++)
{
for (int j = 0; j < A.GetRealRowSize(i); j++)
A.ValueReal(i,j) *= real(alpha);
for (int j = 0; j < A.GetImagRowSize(i); j++)
A.ValueImag(i,j) *= real(alpha);
}
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const T0& alpha,
Matrix<T, Prop, RowComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal* data_A = A.GetRealData();
for (long i = 0; i < A.GetRealDataSize(); i++)
data_A[i] *= alpha;
data_A = A.GetImagData();
for (long i = 0; i < A.GetImagDataSize(); i++)
data_A[i] *= alpha;
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const complex<T0>& alpha,
Matrix<T, Prop, RowComplexSparse, Allocator>& A)
{
if (imag(alpha) != T0(0))
throw Undefined("Mlt(Matrix<RowComplexSparse>)",
"Function not implemented for complex scalars");
typename ClassComplexType<T>::Treal* data_A = A.GetRealData();
T0 alpha_r = real(alpha);
for (long i = 0; i < A.GetRealDataSize(); i++)
data_A[i] *= alpha_r;
data_A = A.GetImagData();
for (long i = 0; i < A.GetImagDataSize(); i++)
data_A[i] *= alpha_r;
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const T0& alpha,
Matrix<T, Prop, RowSymComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal* data_A = A.GetRealData();
for (long i = 0; i < A.GetRealDataSize(); i++)
data_A[i] *= alpha;
data_A = A.GetImagData();
for (long i = 0; i < A.GetImagDataSize(); i++)
data_A[i] *= alpha;
}
//! multiplication by a scalar
template<class T0, class T, class Prop, class Allocator>
void MltScalar(const complex<T0>& alpha,
Matrix<T, Prop, RowSymComplexSparse, Allocator>& A)
{
if (imag(alpha) != T0(0))
throw Undefined("Mlt(Matrix<RowSymComplexSparse>)",
"Function not implemented for complex scalars");
typename ClassComplexType<T>::Treal* data_A = A.GetRealData();
T0 alpha_r = real(alpha);
for (long i = 0; i < A.GetRealDataSize(); i++)
data_A[i] *= alpha_r;
data_A = A.GetImagData();
for (long i = 0; i < A.GetImagDataSize(); i++)
data_A[i] *= alpha_r;
}
//! Permutation of a general matrix stored by rows.
/*!
B(row_perm(i), col_perm(j)) = A(i,j) and A = B.
Equivalent Matlab operation: A(row_perm, col_perm) = A.
*/
template<class T, class Prop, class Allocator>
void ApplyInversePermutation(Matrix<T, Prop,
ArrayRowComplexSparse, Allocator>& A,
const IVect& row_perm, const IVect& col_perm)
{
int m = A.GetM();
IVect ind_tmp, iperm(m), rperm(m);
for (int i = 0; i < m; i++)
{
iperm(i) = i;
rperm(i) = i;
}
// A(rperm(i),:) will be the place where is the initial row i.
// Algorithm avoiding the allocation of another matrix.
for (int i = 0; i < m; i++)
{
// We get the index of row where the row initially placed on row i is.
int i2 = rperm(i);
// We get the new index of this row.
int i_ = row_perm(i);
// We fill ind_tmp of the permuted indices of columns of row i.
int nr = A.GetRealRowSize(i2);
ind_tmp.Reallocate(nr);
for (int j = 0; j < nr; j++)
ind_tmp(j) = col_perm(A.IndexReal(i2, j));
// We swap the two rows i and its destination row_perm(i).
A.SwapRealRow(i2, i_);
A.ReplaceRealIndexRow(i_, ind_tmp);
int ni = A.GetImagRowSize(i2);
ind_tmp.Reallocate(ni);
for (int j = 0; j < ni; j++)
ind_tmp(j) = col_perm(A.IndexImag(i2, j));
A.SwapImagRow(i2, i_);
A.ReplaceImagIndexRow(i_, ind_tmp);
// We update the indices iperm and rperm in order to keep in memory
// the place where the row row_perm(i) is.
int i_tmp = iperm(i_);
iperm(i_) = iperm(i2);
iperm(i2) = i_tmp;
rperm(iperm(i_)) = i_;
rperm(iperm(i2)) = i2;
// We assemble the row i.
A.AssembleRealRow(i_);
A.AssembleImagRow(i_);
}
}
//! Permutation of a symmetric matrix stored by rows.
/*!
B(row_perm(i),col_perm(j)) = A(i,j) and A = B.
Equivalent Matlab operation: A(row_perm, col_perm) = A.
*/
template<class T, class Prop, class Allocator>
void ApplyInversePermutation(Matrix<T, Prop,
ArrayRowSymComplexSparse, Allocator>& A,
const IVect& row_perm, const IVect& col_perm)
{
// It is assumed that the permuted matrix is still symmetric! For example,
// the user can provide row_perm = col_perm.
int m = A.GetM();
long nnz_real = A.GetRealDataSize(), nnz_imag = A.GetImagDataSize();
IVect IndRow(nnz_real), IndCol(nnz_real);
Vector<typename ClassComplexType<T>::Treal,
VectFull, Allocator> Val(nnz_real);
// First we convert the matrix in coordinate format and we permute the
// indices.
// IndRow -> indices of the permuted rows
// IndCol -> indices of the permuted columns
long k = 0;
for (int i = 0; i < m; i++)
{
for (int j = 0; j < A.GetRealRowSize(i); j++)
{
IndRow(k) = row_perm(i);
Val(k) = A.ValueReal(i,j);
IndCol(k) = col_perm(A.IndexReal(i, j));
if (IndCol(k) <= IndRow(k))
{
// We store only the superior part of the symmetric matrix.
int ind_tmp = IndRow(k);
IndRow(k) = IndCol(k);
IndCol(k) = ind_tmp;
}
k++;
}
}
// We sort by row number.
Sort(nnz_real, IndRow, IndCol, Val);
// A is filled.
k = 0;
for (int i = 0; i < m; i++)
{
long first_index = k;
// We get the size of the row i.
while (k < nnz_real && IndRow(k) <= i)
k++;
int size_row = k - first_index;
// If row not empty.
if (size_row > 0)
{
A.ReallocateRealRow(i, size_row);
k = first_index;
Sort(k, k+size_row-1, IndCol, Val);
for (int j = 0; j < size_row; j++)
{
A.IndexReal(i,j) = IndCol(k);
A.ValueReal(i,j) = Val(k);
k++;
}
}
else
A.ClearRealRow(i);
}
// Same procedure for imaginary part.
IndRow.Reallocate(nnz_imag);
IndCol.Reallocate(nnz_imag);
Val.Reallocate(nnz_imag);
// First we convert the matrix in coordinate format and we permute the
// indices.
// IndRow -> indices of the permuted rows
// IndCol -> indices of the permuted columns
k = 0;
for (int i = 0; i < m; i++)
{
for (int j = 0; j < A.GetImagRowSize(i); j++)
{
IndRow(k) = row_perm(i);
Val(k) = A.ValueImag(i,j);
IndCol(k) = col_perm(A.IndexImag(i,j));
if (IndCol(k) <= IndRow(k))
{
// We store only the superior part of the symmetric matrix.
int ind_tmp = IndRow(k);
IndRow(k) = IndCol(k);
IndCol(k) = ind_tmp;
}
k++;
}
}
// We sort by row number.
Sort(nnz_imag, IndRow, IndCol, Val);
// A is filled
k = 0;
for (int i = 0; i < m; i++)
{
long first_index = k;
// We get the size of the row i.
while (k < nnz_imag && IndRow(k) <= i)
k++;
int size_row = k - first_index;
// If row not empty.
if (size_row > 0)
{
A.ReallocateImagRow(i, size_row);
k = first_index;
Sort(k, k+size_row-1, IndCol, Val);
for (int j = 0; j < size_row; j++)
{
A.IndexImag(i,j) = IndCol(k);
A.ValueImag(i,j) = Val(k);
k++;
}
}
else
A.ClearImagRow(i);
}
}
//! Permutation of rows and columns of a matrix
/*!
B(i, j) = A(row_perm(i), col_perm(j)) and A = B.
Equivalent Matlab operation: A = A(row_perm, col_perm)
*/
template<class T, class Prop, class Allocator>
void ApplyPermutation(Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A,
const Vector<int>& row_perm,
const Vector<int>& col_perm)
{
Vector<int> inv_row_perm(row_perm.GetM());
Vector<int> inv_col_perm(col_perm.GetM());
for (int i = 0; i < row_perm.GetM(); i++)
inv_row_perm(row_perm(i)) = i;
for (int i = 0; i < col_perm.GetM(); i++)
inv_col_perm(col_perm(i)) = i;
ApplyInversePermutation(A, inv_row_perm, inv_col_perm);
}
//! Permutation of rows and columns of a matrix
/*!
B(i, j) = A(row_perm(i), row_perm(j)) and A = B.
Equivalent Matlab operation: A = A(row_perm, row_perm)
*/
template<class T, class Prop, class Allocator> void
ApplyPermutation(Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A,
const Vector<int>& row_perm,
const Vector<int>& col_perm)
{
Vector<int> inv_row_perm(row_perm.GetM());
for (int i = 0; i < row_perm.GetM(); i++)
inv_row_perm(row_perm(i)) = i;
ApplyInversePermutation(A, inv_row_perm, inv_row_perm);
}
//! Each row and column are scaled.
/*!
We compute diag(scale_left)*A*diag(scale_right).
*/
template<class Prop, class T1, class Allocator1,
class T2, class Allocator2, class T3, class Allocator3>
void ScaleMatrix(Matrix<T1, Prop,
ArrayRowSymComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale_left,
const Vector<T3, VectFull, Allocator3>& scale_right)
{
int m = A.GetM();
for (int i = 0; i < m; i++ )
{
for (int j = 0; j < A.GetRealRowSize(i); j++ )
A.ValueReal(i,j) *= scale_left(i) * scale_right(A.IndexReal(i, j));
for (int j = 0; j < A.GetImagRowSize(i); j++ )
A.ValueImag(i,j) *= scale_left(i) * scale_right(A.IndexImag(i, j));
}
}
//! Each row and column are scaled.
/*!
We compute diag(scale_left)*A*diag(scale_right).
*/
template<class Prop, class T1, class Allocator1,
class T2, class Allocator2, class T3, class Allocator3>
void ScaleMatrix(Matrix<T1, Prop, ArrayRowComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale_left,
const Vector<T3, VectFull, Allocator3>& scale_right)
{
int m = A.GetM();
for (int i = 0; i < m; i++ )
{
for (int j = 0; j < A.GetRealRowSize(i); j++ )
A.ValueReal(i,j) *= scale_left(i) * scale_right(A.IndexReal(i, j));
for (int j = 0; j < A.GetImagRowSize(i); j++ )
A.ValueImag(i,j) *= scale_left(i) * scale_right(A.IndexImag(i, j));
}
}
//! Each row is scaled.
/*!
We compute diag(S)*A where S = scale.
*/
template<class T1, class Allocator1,
class Prop, class T2, class Allocator2>
void ScaleLeftMatrix(Matrix<T1, Prop, ArrayRowComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale)
{
int m = A.GetM();
for (int i = 0; i < m; i++ )
{
for (int j = 0; j < A.GetRealRowSize(i); j++ )
A.ValueReal(i,j) *= scale(i);
for (int j = 0; j < A.GetImagRowSize(i); j++ )
A.ValueImag(i,j) *= scale(i);
}
}
//! Each column is scaled.
/*!
We compute A*diag(S) where S = scale.
*/
template<class T1, class Allocator1,
class Prop, class T2, class Allocator2>
void ScaleRightMatrix(Matrix<T1, Prop,
ArrayRowComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale)
{
int m = A.GetM();
for (int i = 0; i < m; i++ )
{
for (int j = 0; j < A.GetRealRowSize(i); j++ )
A.ValueReal(i,j) *= scale(A.IndexReal(i, j));
for (int j = 0; j < A.GetImagRowSize(i); j++ )
A.ValueImag(i,j) *= scale(A.IndexImag(i, j));
}
}
//! Each row and column are scaled.
/*!
We compute diag(scale_left)*A*diag(scale_right).
*/
template<class Prop, class T1, class Allocator1,
class T2, class Allocator2, class T3, class Allocator3>
void ScaleMatrix(Matrix<T1, Prop, RowSymComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale_left,
const Vector<T3, VectFull, Allocator3>& scale_right)
{
int m = A.GetM();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < m; i++ )
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
data_real[j] *= scale_left(i) * scale_right(ind_real[j]);
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
data_imag[j] *= scale_left(i) * scale_right(ind_imag[j]);
}
}
//! Each row and column are scaled.
/*!
We compute diag(scale_left)*A*diag(scale_right).
*/
template<class Prop, class T1, class Allocator1,
class T2, class Allocator2, class T3, class Allocator3>
void ScaleMatrix(Matrix<T1, Prop, RowComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale_left,
const Vector<T3, VectFull, Allocator3>& scale_right)
{
int m = A.GetM();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < m; i++ )
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++ )
data_real[j] *= scale_left(i) * scale_right(ind_real[j]);
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++ )
data_imag[j] *= scale_left(i) * scale_right(ind_imag[j]);
}
}
//! Each row is scaled.
/*!
We compute diag(S)*A where S = scale.
*/
template<class T1, class Allocator1,
class Prop, class T2, class Allocator2>
void ScaleLeftMatrix(Matrix<T1, Prop, RowComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale)
{
int m = A.GetM();
long* ptr_real = A.GetRealPtr();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < m; i++ )
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++ )
data_real[j] *= scale(i);
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++ )
data_imag[j] *= scale(i);
}
}
//! Each column is scaled.
/*!
We compute A*diag(S) where S = scale.
*/
template<class T1, class Allocator1,
class Prop, class T2, class Allocator2>
void ScaleRightMatrix(Matrix<T1, Prop, RowComplexSparse, Allocator1>& A,
const Vector<T2, VectFull, Allocator2>& scale)
{
int m = A.GetM();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < m; i++ )
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++ )
data_real[j] *= scale(ind_real[j]);
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++ )
data_imag[j] *= scale(ind_imag[j]);
}
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(const Matrix<T, General,
ArrayRowComplexSparse, Allocator>& A,
Matrix<T, General, ArrayRowComplexSparse, Allocator>& B)
{
B.Clear();
int m = A.GetM();
int n = A.GetN();
Vector<int> ptr_r(n), ptr_i(n);
B.Reallocate(n, m);
// For each column j, computes number of its non-zeroes and stores it in
// ptr_T[j].
ptr_r.Zero();
for (int i = 0; i < m; i++)
for (int j = 0; j < A.GetRealRowSize(i); j++)
ptr_r(A.IndexReal(i, j))++;
ptr_i.Zero();
for (int i = 0; i < m; i++)
for (int j = 0; j < A.GetImagRowSize(i); j++)
ptr_i(A.IndexImag(i, j))++;
for (int i = 0; i < n; i++)
{
B.ReallocateRealRow(i, ptr_r(i));
B.ReallocateImagRow(i, ptr_i(i));
}
// filling matrix B
ptr_r.Zero();
ptr_i.Zero();
for (int i = 0; i < m; i++)
{
for (int jp = 0; jp < A.GetRealRowSize(i); jp++)
{
int j = A.IndexReal(i, jp);
int k = ptr_r(j);
++ptr_r(j);
B.ValueReal(j, k) = A.ValueReal(i, jp);
B.IndexReal(j, k) = i;
}
for (int jp = 0; jp < A.GetImagRowSize(i); jp++)
{
int j = A.IndexImag(i, jp);
int k = ptr_i(j);
++ptr_i(j);
B.ValueImag(j, k) = A.ValueImag(i, jp);
B.IndexImag(j, k) = i;
}
}
// sorting numbers
B.Assemble();
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(const Matrix<T, General, RowComplexSparse, Allocator>& A,
Matrix<T, General, RowComplexSparse, Allocator>& B)
{
B.Clear();
int m = A.GetM();
int n = A.GetN();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = A.GetImagData();
Vector<int> ptr_r(n), ptr_i(n);
// For each column j, computes number of its non-zeroes and stores it in
// ptr_T[j].
ptr_r.Zero();
for (int i = 0; i < m; i++)
for (int j = ptr_real[i]; j < ptr_real[i+1]; j++)
ptr_r(ind_real[j])++;
ptr_i.Zero();
for (int i = 0; i < m; i++)
for (int j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
ptr_i(ind_imag[j])++;
typedef typename ClassComplexType<T>::Treal Treal;
Vector<Treal, VectFull, Allocator> ValReal(A.GetRealDataSize());
Vector<Treal, VectFull, Allocator> ValImag(A.GetImagDataSize());
Vector<long> PtrReal(n+1), PtrImag(n+1);
Vector<int> IndReal(A.GetRealDataSize()), IndImag(A.GetImagDataSize());
PtrReal(0) = 0; PtrImag(0) = 0;
for (int i = 0; i < n; i++)
{
PtrReal(i+1) = PtrReal(i) + ptr_r(i);
PtrImag(i+1) = PtrImag(i) + ptr_i(i);
}
// filling matrix B
ptr_r.Zero();
ptr_i.Zero();
for (int i = 0; i < m; i++)
{
for (long jp = ptr_real[i]; jp < ptr_real[i+1]; jp++)
{
int j = ind_real[jp];
int k = ptr_r(j);
ValReal(PtrReal(j) + k) = data_real[jp];
IndReal(PtrReal(j) + k) = i;
++ptr_r(j);
}
for (long jp = ptr_imag[i]; jp < ptr_imag[i+1]; jp++)
{
int j = ind_imag[jp];
int k = ptr_i(j);
ValImag(PtrImag(j) + k) = data_imag[jp];
IndImag(PtrImag(j) + k) = i;
++ptr_i(j);
}
}
// sorting numbers
for (int i = 0; i < n; i++)
{
Sort(PtrReal(i), PtrReal(i+1)-1, IndReal, ValReal);
Sort(PtrImag(i), PtrImag(i+1)-1, IndImag, ValImag);
}
B.SetData(n, m, ValReal, PtrReal, IndReal, ValImag, PtrImag, IndImag);
}
//! Returns the maximum (in absolute value) of a matrix.
/*!
\param[in] A matrix.
\return The maximum (in absolute value) of all elements of \a A.
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
MaxAbs(const Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal res(0);
for (int i = 0; i < A.GetM(); i++)
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int j = 0; j < A.GetRealRowSize(i); j++)
{
int k = A.IndexReal(i, j);
while ( ji < size_imag && A.IndexImag(i, ji) < k)
{
res = max(res, abs(A.ValueImag(i, ji)));
ji++;
}
if ( ji < size_imag && (A.IndexImag(i, ji) == k))
{
res = max(res, ComplexAbs(T(A.ValueReal(i, j),
A.ValueImag(i, ji))));
ji++;
}
else
res = max(res, abs(A.ValueReal(i, j)));
}
while (ji < size_imag)
{
res = max(res, abs(A.ValueImag(i, ji)));
ji++;
}
}
return res;
}
//! Returns the maximum (in absolute value) of a matrix.
/*!
\param[in] A matrix.
\return The maximum (in absolute value) of all elements of \a A.
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
MaxAbs(const Matrix<T, Prop, RowComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal res(0);
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < A.GetM(); i++)
{
long ji = ptr_imag[i];
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
int k = ind_real[j];
while ( ji < ptr_imag[i+1] && ind_imag[ji] < k)
{
res = max(res, abs(data_imag[ji]));
ji++;
}
if ( ji < ptr_imag[i+1] && (ind_imag[ji] == k))
{
res = max(res, ComplexAbs(T(data_real[j],
data_imag[ji])));
ji++;
}
else
res = max(res, abs(data_real[j]));
}
while (ji < ptr_imag[i+1])
{
res = max(res, abs(data_imag[ji]));
ji++;
}
}
return res;
}
//! Returns the 1-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_j \sum_i |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
Norm1(const Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A)
{
Vector<typename ClassComplexType<T>::Treal> sum(A.GetN());
sum.Fill(0);
for (int i = 0; i < A.GetM(); i++)
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int j = 0; j < A.GetRealRowSize(i); j++)
{
int k = A.IndexReal(i, j);
while ( ji < size_imag && A.IndexImag(i, ji) < k)
{
sum(A.IndexImag(i, ji)) += abs(A.ValueImag(i, ji));
ji++;
}
if ( ji < size_imag && (A.IndexImag(i, ji) == k))
{
sum(k) += ComplexAbs(T(A.ValueReal(i, j),
A.ValueImag(i, ji)));
ji++;
}
else
sum(k) += abs(A.ValueReal(i, j));
}
while (ji < size_imag)
{
sum(A.IndexImag(i, ji)) += abs(A.ValueImag(i, ji));
ji++;
}
}
return sum.GetNormInf();
}
//! Returns the 1-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_j \sum_i |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
Norm1(const Matrix<T, Prop, RowComplexSparse, Allocator>& A)
{
Vector<typename ClassComplexType<T>::Treal> sum(A.GetN());
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = A.GetImagData();
sum.Fill(0);
for (int i = 0; i < A.GetM(); i++)
{
long ji = ptr_imag[i];
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
int k = ind_real[j];
while ( ji < ptr_imag[i+1] && ind_imag[ji] < k)
{
sum(ind_imag[ji]) += abs(data_imag[ji]);
ji++;
}
if ( ji < ptr_imag[i+1] && (ind_imag[ji] == k))
{
sum(k) += ComplexAbs(T(data_real[j],
data_imag[ji]));
ji++;
}
else
sum(k) += abs(data_real[j]);
}
while (ji < ptr_imag[i+1])
{
sum(ind_imag[ji]) += abs(data_imag[ji]);
ji++;
}
}
return sum.GetNormInf();
}
//! Returns the infinity-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_i \sum_j |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
NormInf(const Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal res(0), sum;
for (int i = 0; i < A.GetM(); i++)
{
sum = 0;
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int j = 0; j < A.GetRealRowSize(i); j++)
{
int k = A.IndexReal(i, j);
while ( ji < size_imag && A.IndexImag(i, ji) < k)
{
sum += abs(A.ValueImag(i, ji));
ji++;
}
if ( ji < size_imag && (A.IndexImag(i, ji) == k))
{
sum += ComplexAbs(T(A.ValueReal(i, j),
A.ValueImag(i, ji)));
ji++;
}
else
sum += abs(A.ValueReal(i, j));
}
while (ji < size_imag)
{
sum += abs(A.ValueImag(i, ji));
ji++;
}
res = max(res, sum);
}
return res;
}
//! Returns the infinity-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_i \sum_j |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
NormInf(const Matrix<T, Prop, RowComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal res(0), sum;
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < A.GetM(); i++)
{
sum = 0;
long ji = ptr_imag[i];
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
int k = ind_real[j];
while ( ji < ptr_imag[i+1] && ind_imag[ji] < k)
{
sum += abs(data_imag[ji]);
ji++;
}
if ( ji < ptr_imag[i+1] && (ind_imag[ji] == k))
{
sum += ComplexAbs(T(data_real[j],
data_imag[ji]));
ji++;
}
else
sum += abs(data_real[j]);
}
while (ji < ptr_imag[i+1])
{
sum += abs(data_imag[ji]);
ji++;
}
res = max(res, sum);
}
return res;
}
//! Returns the maximum (in absolute value) of a matrix.
/*!
\param[in] A matrix.
\return The maximum (in absolute value) of all elements of \a A.
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
MaxAbs(const Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal res(0);
for (int i = 0; i < A.GetM(); i++)
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int j = 0; j < A.GetRealRowSize(i); j++)
{
int k = A.IndexReal(i, j);
while ( ji < size_imag && A.IndexImag(i, ji) < k)
{
res = max(res, abs(A.ValueImag(i, ji)));
ji++;
}
if ( ji < size_imag && (A.IndexImag(i, ji) == k))
{
res = max(res, ComplexAbs(T(A.ValueReal(i, j),
A.ValueImag(i, ji))));
ji++;
}
else
res = max(res, abs(A.ValueReal(i, j)));
}
while (ji < size_imag)
{
res = max(res, abs(A.ValueImag(i, ji)));
ji++;
}
}
return res;
}
//! Returns the maximum (in absolute value) of a matrix.
/*!
\param[in] A matrix.
\return The maximum (in absolute value) of all elements of \a A.
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
MaxAbs(const Matrix<T, Prop, RowSymComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal res(0);
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = A.GetImagData();
for (int i = 0; i < A.GetM(); i++)
{
long ji = ptr_imag[i];
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
int k = ind_real[j];
while ( ji < ptr_imag[i+1] && ind_imag[ji] < k)
{
res = max(res, abs(data_imag[ji]));
ji++;
}
if ( ji < ptr_imag[i+1] && (ind_imag[ji] == k))
{
res = max(res, ComplexAbs(T(data_real[j],
data_imag[ji])));
ji++;
}
else
res = max(res, abs(data_real[j]));
}
while (ji < ptr_imag[i+1])
{
res = max(res, abs(data_imag[ji]));
ji++;
}
}
return res;
}
//! Returns the 1-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_j \sum_i |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
Norm1(const Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal val;
Vector<typename ClassComplexType<T>::Treal> sum(A.GetN());
sum.Fill(0);
for (int i = 0; i < A.GetM(); i++)
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int j = 0; j < A.GetRealRowSize(i); j++)
{
int k = A.IndexReal(i, j);
while ( ji < size_imag && A.IndexImag(i, ji) < k)
{
val = abs(A.ValueImag(i, ji));
sum(A.IndexImag(i, ji)) += val;
if (A.IndexImag(i, ji) != i)
sum(i) += val;
ji++;
}
if ( ji < size_imag && (A.IndexImag(i, ji) == k))
{
val = ComplexAbs(T(A.ValueReal(i, j),
A.ValueImag(i, ji)));
sum(k) += val;
if (k != i)
sum(i) += val;
ji++;
}
else
{
val = abs(A.ValueReal(i, j));
sum(k) += val;
if (k != i)
sum(i) += val;
}
}
while (ji < size_imag)
{
val = abs(A.ValueImag(i, ji));
sum(A.IndexImag(i, ji)) += val;
if (A.IndexImag(i, ji) != i)
sum(i) += val;
ji++;
}
}
return sum.GetNormInf();
}
//! Returns the 1-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_j \sum_i |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
Norm1(const Matrix<T, Prop, RowSymComplexSparse, Allocator>& A)
{
Vector<typename ClassComplexType<T>::Treal> sum(A.GetN());
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = A.GetImagData();
sum.Fill(0);
typename ClassComplexType<T>::Treal val;
for (int i = 0; i < A.GetM(); i++)
{
long ji = ptr_imag[i];
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
int k = ind_real[j];
while ( ji < ptr_imag[i+1] && ind_imag[ji] < k)
{
val = abs(data_imag[ji]);
sum(ind_imag[ji]) += val;
if (ind_imag[ji] != i)
sum(i) += val;
ji++;
}
if ( ji < ptr_imag[i+1] && (ind_imag[ji] == k))
{
val = ComplexAbs(T(data_real[j],
data_imag[ji]));
sum(k) += val;
if (k != i)
sum(i) += val;
ji++;
}
else
{
val = abs(data_real[j]);
sum(k) += val;
if (k != i)
sum(i) += val;
}
}
while (ji < ptr_imag[i+1])
{
val = abs(data_imag[ji]);
sum(ind_imag[ji]) += val;
if (ind_imag[ji] != i)
sum(i) += val;
ji++;
}
}
return sum.GetNormInf();
}
//! Returns the infinity-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_i \sum_j |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
NormInf(const Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
return Norm1(A);
}
//! Returns the infinity-norm of a matrix.
/*!
\param[in] A matrix.
\return \f$ max_i \sum_j |A_{ij}| \f$
*/
template <class T, class Prop, class Allocator>
typename ClassComplexType<T>::Treal
NormInf(const Matrix<T, Prop, RowSymComplexSparse, Allocator>& A)
{
return Norm1(A);
}
//! A is replaced by its conjugate
template<class T, class Prop, class Allocator>
void Conjugate(Matrix<T, Prop, ArrayRowComplexSparse, Allocator>& A)
{
for (int i = 0; i < A.GetM(); i++)
for (int j = 0; j < A.GetImagRowSize(i); j++)
A.ValueImag(i, j) = -A.ValueImag(i, j);
}
//! A is replaced by its conjugate
template<class T, class Prop, class Allocator>
void Conjugate(Matrix<T, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
for (int i = 0; i < A.GetM(); i++)
for (int j = 0; j < A.GetImagRowSize(i); j++)
A.ValueImag(i, j) = -A.ValueImag(i, j);
}
//! A is replaced by its conjugate
template<class T, class Prop, class Allocator>
void Conjugate(Matrix<T, Prop, RowComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal* data = A.GetImagData();
for (long i = 0; i < A.GetImagDataSize(); i++)
data[i] = -data[i];
}
//! A is replaced by its conjugate
template<class T, class Prop, class Allocator>
void Conjugate(Matrix<T, Prop, RowSymComplexSparse, Allocator>& A)
{
typename ClassComplexType<T>::Treal* data = A.GetImagData();
for (long i = 0; i < A.GetImagDataSize(); i++)
data[i] = -data[i];
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(const Matrix<T, Symmetric,
ArrayRowSymComplexSparse, Allocator>& A,
Matrix<T, Symmetric,
ArrayRowSymComplexSparse, Allocator>& B)
{
B = A;
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(Matrix<T, General, ArrayRowComplexSparse, Allocator>& A)
{
Matrix<T, General, ArrayRowComplexSparse, Allocator> B(A);
Transpose(B, A);
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(Matrix<T, Symmetric, ArrayRowSymComplexSparse, Allocator>& A)
{
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(const Matrix<T, Symmetric,
RowSymComplexSparse, Allocator>& A,
Matrix<T, Symmetric,
RowSymComplexSparse, Allocator>& B)
{
B = A;
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(Matrix<T, General, RowComplexSparse, Allocator>& A)
{
Matrix<T, General, RowComplexSparse, Allocator> B(A);
Transpose(B, A);
}
//! Matrix transposition.
template<class T, class Allocator>
void Transpose(Matrix<T, Symmetric, RowSymComplexSparse, Allocator>& A)
{
}
//! drops non-zero entries below epsilon
template<class T, class Prop, class Allocator, class T0>
void RemoveSmallEntry(Matrix<T, Prop, RowComplexSparse, Allocator>& A,
const T0& epsilon)
{
// TO BE DONE
}
//! drops non-zero entries below epsilon
template<class T, class Prop, class Allocator, class T0>
void RemoveSmallEntry(Matrix<T, Prop, RowSymComplexSparse, Allocator>& A,
const T0& epsilon)
{
// TO BE DONE
}
//! clears several columns of a sparse matrix
/*!
\param[in] col_number numbers of the columns to be cleared
\param[inout] A sparse matrix where columns are erased
*/
template<class T1, class Prop, class Allocator>
void EraseCol(const IVect& col_number,
Matrix<T1, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
int m = col_number.GetM();
// index array to know fastly if it is a column to erase
IVect index(A.GetM()); index.Fill(-1);
for (int i = 0; i < m; i++)
index(col_number(i)) = i;
// first, we remove rows
for (int i = 0; i < A.GetM(); i++)
{
if (index(i) != -1)
{
A.ClearRealRow(i);
A.ClearImagRow(i);
}
}
// then columns
for (int i = 0; i < A.GetM(); i++)
{
bool something_to_remove = false;
for (int j = 0; j < A.GetRealRowSize(i); j++)
if (index(A.IndexReal(i,j)) != -1)
something_to_remove = true;
if (something_to_remove)
{
int nb = 0;
for (int j = 0; j < A.GetRealRowSize(i); j++)
if (index(A.IndexReal(i,j)) == -1)
{
A.IndexReal(i, nb) = A.IndexReal(i, j);
A.ValueReal(i, nb) = A.ValueReal(i, j);
nb++;
}
A.ResizeRealRow(i, nb);
}
something_to_remove = false;
for (int j = 0; j < A.GetImagRowSize(i); j++)
if (index(A.IndexImag(i,j)) != -1)
something_to_remove = true;
if (something_to_remove)
{
int nb = 0;
for (int j = 0; j < A.GetImagRowSize(i); j++)
if (index(A.IndexImag(i,j)) == -1)
{
A.IndexImag(i, nb) = A.IndexImag(i, j);
A.ValueImag(i, nb) = A.ValueImag(i, j);
nb++;
}
A.ResizeImagRow(i, nb);
}
}
}
//! clears several columns of a sparse matrix
/*!
\param[in] col_number numbers of the columns to be cleared
\param[inout] A sparse matrix where columns are erased
*/
template<class T1, class Prop, class Allocator>
void EraseCol(const IVect& col_number,
Matrix<T1, Prop, ArrayRowComplexSparse, Allocator>& A)
{
int m = col_number.GetM();
// index array to know fastly if it is a column to erase
IVect index(A.GetM()); index.Fill(-1);
for (int i = 0; i < m; i++)
index(col_number(i)) = i;
for (int i = 0; i < A.GetM(); i++)
{
bool something_to_remove = false;
for (int j = 0; j < A.GetRealRowSize(i); j++)
if (index(A.IndexReal(i,j)) != -1)
something_to_remove = true;
if (something_to_remove)
{
int nb = 0;
for (int j = 0; j < A.GetRealRowSize(i); j++)
if (index(A.IndexReal(i,j)) == -1)
{
A.IndexReal(i, nb) = A.IndexReal(i, j);
A.ValueReal(i, nb) = A.ValueReal(i, j);
nb++;
}
A.ResizeRealRow(i, nb);
}
something_to_remove = false;
for (int j = 0; j < A.GetImagRowSize(i); j++)
if (index(A.IndexImag(i,j)) != -1)
something_to_remove = true;
if (something_to_remove)
{
int nb = 0;
for (int j = 0; j < A.GetImagRowSize(i); j++)
if (index(A.IndexImag(i,j)) == -1)
{
A.IndexImag(i, nb) = A.IndexImag(i, j);
A.ValueImag(i, nb) = A.ValueImag(i, j);
nb++;
}
A.ResizeImagRow(i, nb);
}
}
}
//! clears several columns of a sparse matrix
/*!
\param[in] col_number numbers of the columns to be cleared
\param[inout] A sparse matrix where columns are erased
*/
template<class T1, class Prop, class Allocator>
void EraseCol(const IVect& col_number,
Matrix<T1, Prop, RowComplexSparse, Allocator>& A)
{
int m = A.GetM(), n = A.GetN();
long nnz_real = A.GetRealIndSize();
long nnz_imag = A.GetImagIndSize();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
Vector<bool> ColToKeep(n);
ColToKeep.Fill(true);
for (int i = 0; i < col_number.GetM(); i++)
ColToKeep(col_number(i)) = false;
for (long i = 0; i < A.GetRealIndSize(); i++)
if (!ColToKeep(ind_real[i]))
nnz_real--;
for (long i = 0; i < A.GetImagIndSize(); i++)
if (!ColToKeep(ind_imag[i]))
nnz_imag--;
if ((nnz_real == A.GetRealIndSize()) && (nnz_imag == A.GetImagIndSize()))
return;
Vector<long> PtrReal(m+1), PtrImag(m+1);
Vector<int> IndReal(m+1), IndImag(nnz_imag);
Vector<typename ClassComplexType<T1>::Treal,
VectFull, Allocator> ValReal(nnz_real), ValImag(nnz_imag);
PtrReal(0) = 0; PtrImag(0) = 0;
for (int i = 0; i < m; i++)
{
long jA = PtrReal(i); int size_row = 0;
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
if (ColToKeep(ind_real[j]))
{
IndReal(jA) = ind_real[j];
ValReal(jA) = data_real[j];
size_row++; jA++;
}
PtrReal(i+1) = PtrReal(i) + size_row;
jA = PtrImag(i); size_row = 0;
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
if (ColToKeep(ind_imag[j]))
{
IndImag(jA) = ind_imag[j];
ValImag(jA) = data_imag[j];
size_row++; jA++;
}
PtrImag(i+1) = PtrImag(i) + size_row;
}
A.SetData(m, n, ValReal, PtrReal, IndReal, ValImag, PtrImag, IndImag);
}
//! clears several columns of a sparse matrix
/*!
\param[in] col_number numbers of the columns to be cleared
\param[inout] A sparse matrix where columns are erased
*/
template<class T1, class Prop, class Allocator>
void EraseCol(const IVect& col_number,
Matrix<T1, Prop, RowSymComplexSparse, Allocator>& A)
{
int m = A.GetM(), n = A.GetN();
long nnz_real = A.GetRealIndSize();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long nnz_imag = A.GetImagIndSize();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
Vector<bool> ColToKeep(n);
ColToKeep.Fill(true);
for (int i = 0; i < col_number.GetM(); i++)
ColToKeep(col_number(i)) = false;
for (int i = 0; i < m; i++)
{
if (!ColToKeep(i))
{
nnz_real -= ptr_real[i+1] - ptr_real[i];
nnz_imag -= ptr_imag[i+1] - ptr_imag[i];
}
else
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
if (!ColToKeep(ind_real[j]))
nnz_real--;
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
if (!ColToKeep(ind_imag[j]))
nnz_imag--;
}
}
if ((nnz_real == A.GetRealIndSize()) && (nnz_imag == A.GetImagIndSize()))
return;
Vector<long> PtrReal(m+1), PtrImag(m+1);
Vector<int> IndReal(nnz_real), IndImag(nnz_imag);
Vector<typename ClassComplexType<T1>::Treal,
VectFull, Allocator> ValReal(nnz_real), ValImag(nnz_imag);
PtrReal(0) = 0; PtrImag(0) = 0;
for (int i = 0; i < m; i++)
{
long jA = PtrReal(i), size_row = 0;
if (ColToKeep(i))
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
if (ColToKeep(ind_real[j]))
{
IndReal(jA) = ind_real[j];
ValReal(jA) = data_real[j];
size_row++; jA++;
}
PtrReal(i+1) = PtrReal(i) + size_row;
jA = PtrImag(i); size_row = 0;
if (ColToKeep(i))
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
if (ColToKeep(ind_imag[j]))
{
IndImag(jA) = ind_imag[j];
ValImag(jA) = data_imag[j];
size_row++; jA++;
}
PtrImag(i+1) = PtrImag(i) + size_row;
}
A.SetData(m, n, ValReal, PtrReal, IndReal, ValImag, PtrImag, IndImag);
}
//! clears several rows of a sparse matrix
/*!
\param[in] col_number numbers of the rows to be cleared
\param[inout] A sparse matrix where rows are erased
*/
template<class T1, class Prop, class Allocator>
void EraseRow(const IVect& col_number,
Matrix<T1, Prop, ArrayRowSymComplexSparse, Allocator>& A)
{
EraseCol(col_number, A);
}
//! clears several rows of a sparse matrix
/*!
\param[in] col_number numbers of the rows to be cleared
\param[inout] A sparse matrix where rows are erased
*/
template<class T1, class Prop, class Allocator>
void EraseRow(const IVect& col_number,
Matrix<T1, Prop, ArrayRowComplexSparse, Allocator>& A)
{
for (int i = 0; i < col_number.GetM(); i++)
{
A.ClearRealRow(col_number(i));
A.ClearImagRow(col_number(i));
}
}
//! clears several rows of a sparse matrix
/*!
\param[in] col_number numbers of the rows to be cleared
\param[inout] A sparse matrix where rows are erased
*/
template<class T1, class Prop, class Allocator>
void EraseRow(const IVect& col_number,
Matrix<T1, Prop, RowComplexSparse, Allocator>& A)
{
int m = A.GetM(), n = A.GetN();
long nnz_real = A.GetRealIndSize();
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T1>::Treal* data_real = A.GetRealData();
long nnz_imag = A.GetImagIndSize();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T1>::Treal* data_imag = A.GetImagData();
Vector<bool> RowToKeep(m);
RowToKeep.Fill(true);
for (int i = 0; i < col_number.GetM(); i++)
RowToKeep(col_number(i)) = false;
for (int i = 0; i < m; i++)
if (!RowToKeep(i))
{
nnz_real -= ptr_real[i+1] - ptr_real[i];
nnz_imag -= ptr_imag[i+1] - ptr_imag[i];
}
Vector<long> PtrReal(m+1), PtrImag(m+1);
Vector<int> IndReal(nnz_real), IndImag(nnz_imag);
Vector<typename ClassComplexType<T1>::Treal,
VectFull, Allocator> ValReal(nnz_real), ValImag(nnz_imag);
PtrReal(0) = 0; PtrImag(0) = 0;
for (int i = 0; i < m; i++)
{
if (RowToKeep(i))
{
int size_row = ptr_real[i+1] - ptr_real[i];
for (int j = 0; j < size_row; j++)
{
IndReal(PtrReal(i) + j) = ind_real[ptr_real[i] + j];
ValReal(PtrReal(i) + j) = data_real[ptr_real[i] + j];
}
PtrReal(i+1) = PtrReal(i) + size_row;
size_row = ptr_imag[i+1] - ptr_imag[i];
for (int j = 0; j < size_row; j++)
{
IndImag(PtrImag(i) + j) = ind_imag[ptr_imag[i] + j];
ValImag(PtrImag(i) + j) = data_imag[ptr_imag[i] + j];
}
PtrImag(i+1) = PtrImag(i) + size_row;
}
else
{
PtrReal(i+1) = PtrReal(i);
PtrImag(i+1) = PtrImag(i);
}
}
A.SetData(m, n, ValReal, PtrReal, IndReal, ValImag, PtrImag, IndImag);
}
//! clears several rows of a sparse matrix
/*!
\param[in] col_number numbers of the rows to be cleared
\param[inout] A sparse matrix where rows are erased
*/
template<class T1, class Prop, class Allocator>
void EraseRow(const IVect& col_number,
Matrix<T1, Prop, RowSymComplexSparse, Allocator>& A)
{
EraseCol(col_number, A);
}
//! For each row of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale_left vector containing the sum of
the magnitudes of non-zero entries of each row
\param[in] mat given matrix
*/
template<class T>
void GetRowSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale_left,
const Matrix<T, Symmetric, ArrayRowSymComplexSparse> & mat)
{
int n = mat.GetM();
diagonal_scale_left.Reallocate(n);
diagonal_scale_left.Fill(0);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < mat.GetRealRowSize(i); j++)
{
diagonal_scale_left(i) += abs(mat.ValueReal(i,j));
if (i != mat.IndexReal(i,j))
diagonal_scale_left(mat.IndexReal(i,j))
+= abs(mat.ValueReal(i,j));
}
for (int j = 0; j < mat.GetImagRowSize(i); j++)
{
diagonal_scale_left(i) += abs(mat.ValueImag(i,j));
if (i != mat.IndexImag(i,j))
diagonal_scale_left(mat.IndexImag(i,j))
+= abs(mat.ValueImag(i,j));
}
}
}
//! For each row of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale_left vector containing the sum of
the magnitudes of non-zero entries of each row
\param[in] mat given matrix
*/
template<class T>
void GetRowSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale_left,
const Matrix<T, General, ArrayRowComplexSparse>& mat)
{
int n = mat.GetM();
diagonal_scale_left.Reallocate(n);
diagonal_scale_left.Fill(0);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < mat.GetRealRowSize(i); j++)
diagonal_scale_left(i) += abs(mat.ValueReal(i,j));
for (int j = 0; j < mat.GetImagRowSize(i); j++)
diagonal_scale_left(i) += abs(mat.ValueImag(i,j));
}
}
//! For each row of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale_left vector containing the sum of
the magnitudes of non-zero entries of each row
\param[in] mat given matrix
*/
template<class T>
void GetRowSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale_left,
const Matrix<T, Symmetric, RowSymComplexSparse> & mat)
{
int n = mat.GetM();
diagonal_scale_left.Reallocate(n);
diagonal_scale_left.Fill(0);
long* ptr_real = mat.GetRealPtr();
int* ind_real = mat.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = mat.GetRealData();
long* ptr_imag = mat.GetImagPtr();
int* ind_imag = mat.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = mat.GetImagData();
for (int i = 0; i < n; i++)
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
diagonal_scale_left(i) += abs(data_real[j]);
if (i != ind_real[j])
diagonal_scale_left(ind_real[j]) += abs(data_real[j]);
}
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
{
diagonal_scale_left(i) += abs(data_imag[j]);
if (i != ind_imag[j])
diagonal_scale_left(ind_imag[j]) += abs(data_imag[j]);
}
}
}
//! For each row of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale_left vector containing the sum of
the magnitudes of non-zero entries of each row
\param[in] mat given matrix
*/
template<class T>
void GetRowSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale_left,
const Matrix<T, General, RowComplexSparse>& mat)
{
int n = mat.GetM();
diagonal_scale_left.Reallocate(n);
diagonal_scale_left.Fill(0);
long* ptr_real = mat.GetRealPtr();
typename ClassComplexType<T>::Treal* data_real = mat.GetRealData();
long* ptr_imag = mat.GetImagPtr();
typename ClassComplexType<T>::Treal* data_imag = mat.GetImagData();
for (int i = 0; i < n; i++)
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
diagonal_scale_left(i) += abs(data_real[j]);
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
diagonal_scale_left(i) += abs(data_imag[j]);
}
}
//! For each column of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetColSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale,
const Matrix<T, Symmetric, ArrayRowSymComplexSparse> & mat)
{
GetRowSum(diagonal_scale, mat);
}
//! For each column of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetColSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale,
const Matrix<T, General, ArrayRowComplexSparse>& mat)
{
int n = mat.GetM();
diagonal_scale.Reallocate(mat.GetN());
diagonal_scale.Fill(0);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < mat.GetRealRowSize(i); j++)
diagonal_scale(mat.IndexReal(i, j)) += abs(mat.ValueReal(i,j));
for (int j = 0; j < mat.GetImagRowSize(i); j++)
diagonal_scale(mat.IndexImag(i, j)) += abs(mat.ValueImag(i,j));
}
}
//! For each column of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetColSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale,
const Matrix<T, Symmetric, RowSymComplexSparse> & mat)
{
GetRowSum(diagonal_scale, mat);
}
//! For each column of the matrix, computation of the sum of absolute values
/*!
\param[out] diagonal_scale vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetColSum(Vector<typename ClassComplexType<T>::Treal>& diagonal_scale,
const Matrix<T, General, RowComplexSparse>& mat)
{
int n = mat.GetM();
diagonal_scale.Reallocate(mat.GetN());
diagonal_scale.Fill(0);
long* ptr_real = mat.GetRealPtr();
int* ind_real = mat.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = mat.GetRealData();
long* ptr_imag = mat.GetImagPtr();
int* ind_imag = mat.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = mat.GetImagData();
for (int i = 0; i < n; i++)
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
diagonal_scale(ind_real[j]) += abs(data_real[j]);
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
diagonal_scale(ind_imag[j]) += abs(data_imag[j]);
}
}
//! For each row and column of the matrix,
//! computation of the sum of absolute values
/*!
\param[out] sum_row vector containing the sum of
the magnitudes of non-zero entries of each row
\param[out] sum_col vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetRowColSum(Vector<typename ClassComplexType<T>::Treal>& sum_row,
Vector<typename ClassComplexType<T>::Treal>& sum_col,
const Matrix<T, Symmetric, ArrayRowSymComplexSparse> & mat)
{
GetRowSum(sum_row, mat);
sum_col = sum_row;
}
//! For each row and column of the matrix,
//! computation of the sum of absolute values
/*!
\param[out] sum_row vector containing the sum of
the magnitudes of non-zero entries of each row
\param[out] sum_col vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetRowColSum(Vector<typename ClassComplexType<T>::Treal>& sum_row,
Vector<typename ClassComplexType<T>::Treal>& sum_col,
const Matrix<T, General, ArrayRowComplexSparse>& mat)
{
int n = mat.GetM();
sum_row.Reallocate(n);
sum_col.Reallocate(mat.GetN());
sum_row.Fill(0);
sum_col.Fill(0);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < mat.GetRealRowSize(i); j++)
{
sum_row(i) += abs(mat.ValueReal(i,j));
sum_col(mat.IndexReal(i, j)) += abs(mat.ValueReal(i,j));
}
for (int j = 0; j < mat.GetImagRowSize(i); j++)
{
sum_row(i) += abs(mat.ValueImag(i,j));
sum_col(mat.IndexImag(i, j)) += abs(mat.ValueImag(i,j));
}
}
}
//! For each row and column of the matrix,
//! computation of the sum of absolute values
/*!
\param[out] sum_row vector containing the sum of
the magnitudes of non-zero entries of each row
\param[out] sum_col vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetRowColSum(Vector<typename ClassComplexType<T>::Treal>& sum_row,
Vector<typename ClassComplexType<T>::Treal>& sum_col,
const Matrix<T, Symmetric, RowSymComplexSparse> & mat)
{
GetRowSum(sum_row, mat);
sum_col = sum_row;
}
//! For each row and column of the matrix,
//! computation of the sum of absolute values
/*!
\param[out] sum_row vector containing the sum of
the magnitudes of non-zero entries of each row
\param[out] sum_col vector containing the sum of
the magnitudes of non-zero entries of each column
\param[in] mat given matrix
*/
template<class T>
void GetRowColSum(Vector<typename ClassComplexType<T>::Treal>& sum_row,
Vector<typename ClassComplexType<T>::Treal>& sum_col,
const Matrix<T, General, RowComplexSparse>& mat)
{
int n = mat.GetM();
sum_row.Reallocate(n);
sum_col.Reallocate(mat.GetN());
sum_row.Fill(0);
sum_col.Fill(0);
long* ptr_real = mat.GetRealPtr();
int* ind_real = mat.GetRealInd();
typename ClassComplexType<T>::Treal* data_real = mat.GetRealData();
long* ptr_imag = mat.GetImagPtr();
int* ind_imag = mat.GetImagInd();
typename ClassComplexType<T>::Treal* data_imag = mat.GetImagData();
for (int i = 0; i < n; i++)
{
for (long j = ptr_real[i]; j < ptr_real[i+1]; j++)
{
sum_row(i) += abs(data_real[j]);
sum_col(ind_real[j]) += abs(data_real[j]);
}
for (long j = ptr_imag[i]; j < ptr_imag[i+1]; j++)
{
sum_row(i) += abs(data_imag[j]);
sum_col(ind_imag[j]) += abs(data_imag[j]);
}
}
}
//! extracts some rows/columns of a matrix
template<class T0, class Prop0, class Allocator0,
class T1, class Allocator1>
void CopySubMatrix(const Matrix<T0, Prop0,
ArrayRowComplexSparse, Allocator0>& A,
const IVect& row, const IVect& col,
Vector<int>& RowNum,
Vector<int>& ColNum,
Vector<complex<T1>, VectFull, Allocator1>& Value)
{
int m = A.GetM(), n = A.GetN();
if ((m <= 0) || (n <= 0) || (row.GetM() <= 0) || (col.GetM() <= 0))
{
RowNum.Clear(); ColNum.Clear(); Value.Clear();
return;
}
Vector<bool> RowKept(m), ColKept(n);
RowKept.Fill(false); ColKept.Fill(false);
for (int i = 0; i < row.GetM(); i++)
RowKept(row(i)) = true;
for (int i = 0; i < col.GetM(); i++)
ColKept(col(i)) = true;
// counting the number of non-zero elements to keep
long nnz = 0;
for (int i = 0; i < A.GetM(); i++)
if (RowKept(i))
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int jr = 0; jr < A.GetRealRowSize(i); jr++)
{
int jcol = A.IndexReal(i, jr);
while ((ji < size_imag) && (A.IndexImag(i, ji) < jcol))
{
if (ColKept(A.IndexImag(i, ji)))
nnz++;
ji++;
}
if ((ji < size_imag) && (A.IndexImag(i, ji) == jcol))
ji++;
if (ColKept(jcol))
nnz++;
}
while (ji < size_imag)
{
if (ColKept(A.IndexImag(i, ji)))
nnz++;
ji++;
}
}
RowNum.Reallocate(nnz);
ColNum.Reallocate(nnz);
Value.Reallocate(nnz);
nnz = 0;
// then filling the arrays RowNum, ColNum, Value
for (int i = 0; i < A.GetM(); i++)
if (RowKept(i))
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int jr = 0; jr < A.GetRealRowSize(i); jr++)
{
int jcol = A.IndexReal(i, jr);
while ((ji < size_imag) && (A.IndexImag(i, ji) < jcol))
{
if (ColKept(A.IndexImag(i, ji)))
{
RowNum(nnz) = i;
ColNum(nnz) = A.IndexImag(i, ji);
Value(nnz) = T0(0, A.ValueImag(i, ji));
nnz++;
}
ji++;
}
if ((ji < size_imag) && (A.IndexImag(i, ji) == jcol))
{
if (ColKept(jcol))
{
RowNum(nnz) = i;
ColNum(nnz) = jcol;
Value(nnz)
= T0(A.ValueReal(i, jr), A.ValueImag(i, ji));
nnz++;
}
ji++;
}
else
{
if (ColKept(jcol))
{
RowNum(nnz) = i;
ColNum(nnz) = jcol;
Value(nnz) = T0(A.ValueReal(i, jr), 0);
nnz++;
}
}
}
while (ji < size_imag)
{
if (ColKept(A.IndexImag(i, ji)))
{
RowNum(nnz) = i;
ColNum(nnz) = A.IndexImag(i, ji);
Value(nnz) = T0(0, A.ValueImag(i, ji));
nnz++;
}
ji++;
}
}
}
//! extracts some rows/columns of a matrix
template<class T0, class Prop0, class Allocator0,
class T1, class Allocator1>
void CopySubMatrix(const Matrix<T0, Prop0,
ArrayRowSymComplexSparse, Allocator0>& A,
const IVect& row, const IVect& col,
Vector<int>& RowNum,
Vector<int>& ColNum,
Vector<complex<T1>, VectFull, Allocator1>& Value)
{
int m = A.GetM(), n = A.GetN();
if ((m <= 0) || (n <= 0) || (row.GetM() <= 0) || (col.GetM() <= 0))
{
RowNum.Clear(); ColNum.Clear(); Value.Clear();
return;
}
Vector<bool> RowKept(m), ColKept(n);
RowKept.Fill(false); ColKept.Fill(false);
for (int i = 0; i < row.GetM(); i++)
RowKept(row(i)) = true;
for (int i = 0; i < col.GetM(); i++)
ColKept(col(i)) = true;
// counting the number of non-zero elements to keep
long nnz = 0;
for (int i = 0; i < A.GetM(); i++)
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int jr = 0; jr < A.GetRealRowSize(i); jr++)
{
int jcol = A.IndexReal(i, jr);
while ((ji < size_imag) && (A.IndexImag(i, ji) < jcol))
{
if (ColKept(A.IndexImag(i, ji)) && RowKept(i))
nnz++;
if (A.IndexImag(i, ji) != i)
if (RowKept(A.IndexImag(i, ji)) && ColKept(i))
nnz++;
ji++;
}
if ((ji < size_imag) && (A.IndexImag(i, ji) == jcol))
ji++;
if (ColKept(jcol) && RowKept(i))
nnz++;
if (jcol != i)
if (RowKept(jcol) && ColKept(i))
nnz++;
}
while (ji < size_imag)
{
if (ColKept(A.IndexImag(i, ji)) && RowKept(i))
nnz++;
if (A.IndexImag(i, ji) != i)
if (RowKept(A.IndexImag(i, ji)) && ColKept(i))
nnz++;
ji++;
}
}
RowNum.Reallocate(nnz);
ColNum.Reallocate(nnz);
Value.Reallocate(nnz);
nnz = 0;
for (int i = 0; i < A.GetM(); i++)
{
int ji = 0;
int size_imag = A.GetImagRowSize(i);
for (int jr = 0; jr < A.GetRealRowSize(i); jr++)
{
int jcol = A.IndexReal(i, jr);
while ((ji < size_imag) && (A.IndexImag(i, ji) < jcol))
{
if (ColKept(A.IndexImag(i, ji)) && RowKept(i))
{
RowNum(nnz) = i;
ColNum(nnz) = A.IndexImag(i, ji);
Value(nnz) = T0(0, A.ValueImag(i, ji));
nnz++;
}
if (A.IndexImag(i, ji) != i)
if (RowKept(A.IndexImag(i, ji)) && ColKept(i))
{
RowNum(nnz) = A.IndexImag(i, ji);
ColNum(nnz) = i;
Value(nnz) = T0(0, A.ValueImag(i, ji));
nnz++;
}
ji++;
}
if (ColKept(jcol) && RowKept(i))
{
RowNum(nnz) = i;
ColNum(nnz) = jcol;
if ((ji < size_imag) && (A.IndexImag(i, ji) == jcol))
Value(nnz)
= T0(A.ValueReal(i, jr), A.ValueImag(i, ji));
else
Value(nnz) = T0(A.ValueReal(i, jr), 0);
nnz++;
}
if (jcol != i)
if (RowKept(jcol) && ColKept(i))
{
RowNum(nnz) = jcol;
ColNum(nnz) = i;
if ((ji < size_imag) && (A.IndexImag(i, ji) == jcol))
Value(nnz)
= T0(A.ValueReal(i, jr), A.ValueImag(i, ji));
else
Value(nnz) = T0(A.ValueReal(i, jr), 0);
nnz++;
}
if ((ji < size_imag) && (A.IndexImag(i, ji) == jcol))
ji++;
}
while (ji < size_imag)
{
if (ColKept(A.IndexImag(i, ji)) && RowKept(i))
{
RowNum(nnz) = i;
ColNum(nnz) = A.IndexImag(i, ji);
Value(nnz) = T0(0, A.ValueImag(i, ji));
nnz++;
}
if (A.IndexImag(i, ji) != i)
if (RowKept(A.IndexImag(i, ji)) && ColKept(i))
{
RowNum(nnz) = A.IndexImag(i, ji);
ColNum(nnz) = i;
Value(nnz) = T0(0, A.ValueImag(i, ji));
nnz++;
}
ji++;
}
}
}
//! extracts some rows/columns of a matrix
template<class T0, class Prop0, class Allocator0,
class T1, class Allocator1>
void CopySubMatrix(const Matrix<T0, Prop0, RowComplexSparse, Allocator0>& A,
const IVect& row, const IVect& col,
Vector<int>& RowNum,
Vector<int>& ColNum,
Vector<complex<T1>, VectFull, Allocator1>& Value)
{
int m = A.GetM(), n = A.GetN();
if ((m <= 0) || (n <= 0) || (row.GetM() <= 0) || (col.GetM() <= 0))
{
RowNum.Clear(); ColNum.Clear(); Value.Clear();
return;
}
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T0>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T0>::Treal* data_imag = A.GetImagData();
Vector<bool> RowKept(m), ColKept(n);
RowKept.Fill(false); ColKept.Fill(false);
for (int i = 0; i < row.GetM(); i++)
RowKept(row(i)) = true;
for (int i = 0; i < col.GetM(); i++)
ColKept(col(i)) = true;
// counting the number of non-zero elements to keep
long nnz = 0;
for (int i = 0; i < m; i++)
if (RowKept(i))
{
long ji = ptr_imag[i];
for (long jr = ptr_real[i]; jr < ptr_real[i+1]; jr++)
{
int jcol = ind_real[jr];
while ((ji < ptr_imag[i+1]) && (ind_imag[ji] < jcol))
{
if (ColKept(ind_imag[ji]))
nnz++;
ji++;
}
if ((ji < ptr_imag[i+1]) && (ind_imag[ji] == jcol))
ji++;
if (ColKept(jcol))
nnz++;
}
while (ji < ptr_imag[i+1])
{
if (ColKept(ind_imag[ji]))
nnz++;
ji++;
}
}
RowNum.Reallocate(nnz);
ColNum.Reallocate(nnz);
Value.Reallocate(nnz);
nnz = 0;
// then filling the arrays RowNum, ColNum, Value
for (int i = 0; i < A.GetM(); i++)
if (RowKept(i))
{
long ji = ptr_imag[i];
for (long jr = ptr_real[i]; jr < ptr_real[i+1]; jr++)
{
int jcol = ind_real[jr];
while ((ji < ptr_imag[i+1]) && (ind_imag[ji] < jcol))
{
if (ColKept(ind_imag[ji]))
{
RowNum(nnz) = i;
ColNum(nnz) = ind_imag[ji];
Value(nnz) = T0(0, data_imag[ji]);
nnz++;
}
ji++;
}
if ((ji < ptr_imag[i+1]) && (ind_imag[ji] == jcol))
{
if (ColKept(jcol))
{
RowNum(nnz) = i;
ColNum(nnz) = jcol;
Value(nnz) = T0(data_real[jr], data_imag[ji]);
nnz++;
}
ji++;
}
else
{
if (ColKept(jcol))
{
RowNum(nnz) = i;
ColNum(nnz) = jcol;
Value(nnz) = T0(data_real[jr], 0);
nnz++;
}
}
}
while (ji < ptr_imag[i+1])
{
if (ColKept(ind_imag[ji]))
{
RowNum(nnz) = i;
ColNum(nnz) = ind_imag[ji];
Value(nnz) = T0(0, data_imag[ji]);
nnz++;
}
ji++;
}
}
}
//! extracts some rows/columns of a matrix
template<class T0, class Prop0, class Allocator0,
class T1, class Allocator1>
void CopySubMatrix(const Matrix<T0, Prop0,
RowSymComplexSparse, Allocator0>& A,
const IVect& row, const IVect& col,
Vector<int>& RowNum,
Vector<int>& ColNum,
Vector<complex<T1>, VectFull, Allocator1>& Value)
{
int m = A.GetM(), n = A.GetN();
if ((m <= 0) || (n <= 0) || (row.GetM() <= 0) || (col.GetM() <= 0))
{
RowNum.Clear(); ColNum.Clear(); Value.Clear();
return;
}
long* ptr_real = A.GetRealPtr();
int* ind_real = A.GetRealInd();
typename ClassComplexType<T0>::Treal* data_real = A.GetRealData();
long* ptr_imag = A.GetImagPtr();
int* ind_imag = A.GetImagInd();
typename ClassComplexType<T0>::Treal* data_imag = A.GetImagData();
Vector<bool> RowKept(m), ColKept(n);
RowKept.Fill(false); ColKept.Fill(false);
for (int i = 0; i < row.GetM(); i++)
RowKept(row(i)) = true;
for (int i = 0; i < col.GetM(); i++)
ColKept(col(i)) = true;
// counting the number of non-zero elements to keep
long nnz = 0;
for (int i = 0; i < m; i++)
{
long ji = ptr_imag[i];
for (long jr = ptr_real[i]; jr < ptr_real[i+1]; jr++)
{
int jcol = ind_real[jr];
while ((ji < ptr_imag[i+1]) && (ind_imag[ji] < jcol))
{
if (ColKept(ind_imag[ji]) && RowKept(i))
nnz++;
if (ind_imag[ji] != i)
if (RowKept(ind_imag[ji]) && ColKept(i))
nnz++;
ji++;
}
if ((ji < ptr_imag[i+1]) && (ind_imag[ji] == jcol))
ji++;
if (ColKept(jcol) && RowKept(i))
nnz++;
if (jcol != i)
if (RowKept(jcol) && ColKept(i))
nnz++;
}
while (ji < ptr_imag[i+1])
{
if (ColKept(ind_imag[ji]) && RowKept(i))
nnz++;
if (ind_imag[ji] != i)
if (RowKept(ind_imag[ji]) && ColKept(i))
nnz++;
ji++;
}
}
RowNum.Reallocate(nnz);
ColNum.Reallocate(nnz);
Value.Reallocate(nnz);
nnz = 0;
for (int i = 0; i < m; i++)
{
long ji = ptr_imag[i];
for (long jr = ptr_real[i]; jr < ptr_real[i+1]; jr++)
{
int jcol = ind_real[jr];
while ((ji < ptr_imag[i+1]) && (ind_imag[ji] < jcol))
{
if (ColKept(ind_imag[ji]) && RowKept(i))
{
RowNum(nnz) = i;
ColNum(nnz) = ind_imag[ji];
Value(nnz) = T0(0, data_imag[ji]);
nnz++;
}
if (ind_imag[ji] != i)
if (RowKept(ind_imag[ji]) && ColKept(i))
{
RowNum(nnz) = ind_imag[ji];
ColNum(nnz) = i;
Value(nnz) = T0(0, data_imag[ji]);
nnz++;
}
ji++;
}
if (ColKept(jcol) && RowKept(i))
{
RowNum(nnz) = i;
ColNum(nnz) = jcol;
if ((ji < ptr_imag[i+1]) && (ind_imag[ji] == jcol))
Value(nnz) = T0(data_real[jr], data_imag[ji]);
else
Value(nnz) = T0(data_real[jr], 0);
nnz++;
}
if (jcol != i)
if (RowKept(jcol) && ColKept(i))
{
RowNum(nnz) = jcol;
ColNum(nnz) = i;
if ((ji < ptr_imag[i+1]) && (ind_imag[ji] == jcol))
Value(nnz) = T0(data_real[jr], data_imag[ji]);
else
Value(nnz) = T0(data_real[jr], 0);
nnz++;
}
if ((ji < ptr_imag[i+1]) && (ind_imag[ji] == jcol))
ji++;
}
while (ji < ptr_imag[i+1])
{
if (ColKept(ind_imag[ji]) && RowKept(i))
{
RowNum(nnz) = i;
ColNum(nnz) = ind_imag[ji];
Value(nnz) = T0(0, data_imag[ji]);
nnz++;
}
if (ind_imag[ji] != i)
if (RowKept(ind_imag[ji]) && ColKept(i))
{
RowNum(nnz) = ind_imag[ji];
ColNum(nnz) = i;
Value(nnz) = T0(0, data_imag[ji]);
nnz++;
}
ji++;
}
}
}
}
#define SELDON_FILE_FUNCTIONS_MATRIX_COMPLEX_CXX
#endif
|
// Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
package common
//snippet-keyword:[secretsmanager]
//snippet-sourcetype:[snippet]
//snippet-sourcedate:[10/27/2021]
//snippet-sourceauthor:[gangwere]
import (
"context"
"github.com/aws/aws-sdk-go-v2/aws"
"github.com/aws/aws-sdk-go-v2/service/secretsmanager"
)
// This creates a secret and returns out its ARN
//snippet-start:[secretsmanager.go-v2.CreateSecret]
func CreateSecret(cfg aws.Config, name string, value string) (string, error) {
conn := secretsmanager.NewFromConfig(cfg)
result, err := conn.CreateSecret(context.TODO(), &secretsmanager.CreateSecretInput{
Name: aws.String(name),
// descriptions are optional
Description: aws.String("Example Secret for docs"),
// You must provide either SecretString or SecretBytes.
// Both is considered invalid.
SecretString: aws.String(value),
})
if err != nil {
return "", err
}
return *result.ARN, err
}
//snippet-end:[secretsmanager.go-v2.CreateSecret]
|
using FluentAssertions;
using Sequel.Core.Parser;
using Xunit;
namespace Sequel.Tests
{
public class LexerTest
{
[Theory]
[InlineData(TokenType.Assignment, " :=")]
[InlineData(TokenType.Command, @" \pgsql")]
[InlineData(TokenType.Comment, " --comment1\r\n")]
[InlineData(TokenType.CommentHint, " --+8\r\n")]
[InlineData(TokenType.CommentMultiline, " /* comment1 \r\n comment2 */")]
[InlineData(TokenType.Comparison, " NOT IN")]
[InlineData(TokenType.Keyword, " FROM")]
[InlineData(TokenType.Keyword, " LEFT JOIN")]
[InlineData(TokenType.Keyword, " END IF")]
[InlineData(TokenType.Keyword, " NOT NULL")]
[InlineData(TokenType.Keyword, " NULLS LAST")]
[InlineData(TokenType.Keyword, " UNION ALL")]
[InlineData(TokenType.Keyword, " GROUP BY")]
[InlineData(TokenType.Keyword, " ORDER BY")]
[InlineData(TokenType.Keyword, " HANDLER FOR")]
[InlineData(TokenType.Keyword, " LATERAL VIEW")]
[InlineData(TokenType.Keyword, " INLINE")]
[InlineData(TokenType.KeywordDDL, " CREATE OR REPLACE")]
[InlineData(TokenType.KeywordTZCast, " AT TIME ZONE 'Central European Standard Time'")]
[InlineData(TokenType.Name, " `pg_constraint`")]
[InlineData(TokenType.Name, " ´pg_constraint´")]
[InlineData(TokenType.Name, " @X1")]
[InlineData(TokenType.Name, "public.", "public", 0)]
[InlineData(TokenType.Name, ".v_table_constraints", "v_table_constraints")]
[InlineData(TokenType.Name, "COUNT(", "COUNT", 0)]
[InlineData(TokenType.NamePlaceholder, " ?")]
[InlineData(TokenType.NameBuiltin, " DOUBLE PRECISION")]
[InlineData(TokenType.Newline, " \r\n")]
[InlineData(TokenType.NumberFloat, " 12.07E-2")]
[InlineData(TokenType.NumberFloat, " 9.21")]
[InlineData(TokenType.NumberInteger, " 75")]
[InlineData(TokenType.NumberHexadecimal, " 0x23")]
[InlineData(TokenType.Literal, " $$\r\nDECLARE\r\nEND;\r\n$$")]
[InlineData(TokenType.Operator, " ||")]
[InlineData(TokenType.OperatorComparison, " NOT LIKE")]
[InlineData(TokenType.OperatorComparison, " =")]
[InlineData(TokenType.Punctuation, " ;")]
[InlineData(TokenType.Punctuation, " ::")]
[InlineData(TokenType.StringSingle, " 'Sequel'")]
[InlineData(TokenType.StringSymbol, " \"Sequel\"")]
[InlineData(TokenType.Whitespace, "/* comment1 comment2 */ ", " ")]
[InlineData(TokenType.Wildcard, " *")]
[InlineData(TokenType.KeywordDML, " insert")]
public void Should_get_tokens(TokenType tokenType, string sql, string? expected = null, int index = 1)
{
var tokens = Lexer.GetTokens(sql);
tokens.Count.Should().Be(2);
tokens[index].Type.Should().Be(tokenType);
tokens[index].Text.Should().Be(expected ?? sql.Substring(1));
}
}
}
|
<?php
include_once __DIR__ . '/_common.php';
bad_request_if(!array_key_exists('view', $_POST));
no_access_if_not_allowed('service*');
if ($_POST['view'] === '0')
{
exec_stmt("DELETE FROM grid_view_defaults WHERE grid='service/issues' AND user=? LIMIT 1",
array(1 => $_SESSION['user']->getId()));
set_flash('Zresetowano domyślny widok zgłoszeń na standardowy.');
go_to('service/');
}
bad_request_if(!is_valid_view_id($_POST['view']));
$view = fetch_one("SELECT name, creator, public FROM grid_views WHERE grid='service/issues' AND view=? LIMIT 1",
array(1 => $_POST['view']));
not_found_if(empty($view));
no_access_if(!$view->public && $_SESSION['user']->getId() != $view->creator);
exec_stmt("REPLACE INTO grid_view_defaults SET grid='service/issues', user=?, view=?",
array(1 => $_SESSION['user']->getId(), $_POST['view']));
set_flash(sprintf('Ustawiono domyślny widok zgłoszeń na <%s>.', $view->name));
go_to('service/');
|
{-# LANGUAGE FlexibleInstances, MultiParamTypeClasses, QuasiQuotes, OverloadedStrings #-}
module Main where
import Control.Monad (msum)
import Control.Monad.Trans
import Web.Plugins.Core
import MyPlugin
import ClckPlugin
import Happstack.Server
import Happstack.Server.HSP.HTML
import qualified Data.Text as Text
import qualified Data.Text.Lazy as LazyText
import DefaultTheme (theme)
import Theme (themeTemplate)
import Language.Haskell.HSX.QQ (hsx)
import HSP
import HSP.Monad
------------------------------------------------------------------------------
-- Main
------------------------------------------------------------------------------
main :: IO ()
main =
withPlugins () () $ \plugins ->
do initPlugin plugins "" clckPlugin
initPlugin plugins "" myPlugin
setTheme plugins (Just theme)
hooks <- getPostHooks plugins
sequence_ hooks
simpleHTTP nullConf (route plugins)
instance EmbedAsAttr (ServerPartT IO) (Attr LazyText.Text (IO Text.Text)) where
asAttr (n := v) =
do v' <- XMLGenT (liftIO v)
asAttr (n := v)
route plugins = msum
[ nullDir >> do
(Just clckShowFn) <- getPluginRouteFn plugins (pluginName clckPlugin)
(Just myShowFn) <- getPluginRouteFn plugins (pluginName myPlugin)
themeTemplate plugins "home" () [hsx|
<ul>
<li><a href=(myShowFn MyUrl [])>my plugin</a></li>
<li><a href=(clckShowFn ViewPage [])>clck plugin</a></li>
</ul> |]
, path $ \p -> do
ps <- fmap rqPaths askRq
r <- liftIO $ serve plugins p (map Text.pack ps)
case r of
(Left e) -> internalServerError $ toResponse e
(Right sp) -> sp
]
|
Title: Modular Lumbar Pack
Date: 2013-10-18 23:02
Author: Michael
Category: Design
Tags: Cordura
Slug: modular-lumbar-pack
Status: published
I hiked the Grand Canyon with a few friends a few years ago. We decided
to "hike" the canyon in a manner known as ["Rim to
Rim."](http://www.rimtorim.org/) We also decided to accomplish this task
in one day. 22 miles (give or take a half mile) and you get the idea. I
made this pack after the trip in the hopes that it would serve me (or
you, just ask for one) well for the next hike. Its modular design will
lend itself to the in the aid of compartmentalizing the aspects of any
hike.
{: class="image-process-large-photo" }
----
{: class="image-process-large-photo" }
----
{: class="image-process-large-photo" }
----
{: class="image-process-large-photo" }
----
{: class="image-process-large-photo" }
----
{: class="image-process-large-photo" }
----
Modular design lets you pick and choose the exact size of bag you need. Match the
conditions and/or logistic and technical parameters of any hike or
adventure.
- Modular - 3 packs in one
- Variety of wear options
- Durable construction
- MOLLE style attachment points on most surfaces
- Interior Pocket for Hydration Bladder
- Shell: 1000d Cordura
- Liner: None
- Strap: Padded Nylon webbing / Mesh
- YKK Zippers
|
using System;
using System.Collections.Generic;
using System.Threading.Tasks;
using Carts.Api.Requests.Carts;
using Carts.Carts.GettingCartAtVersion;
using Carts.Carts.GettingCartById;
using Carts.Carts.GettingCartHistory;
using Carts.Carts.GettingCarts;
using Carts.Carts.Products;
using Microsoft.AspNetCore.Mvc;
using Core.Commands;
using Core.Ids;
using Core.Queries;
namespace Carts.Api.Controllers
{
[Route("api/[controller]")]
public class CartsController: Controller
{
private readonly ICommandBus _commandBus;
private readonly IQueryBus _queryBus;
private readonly IIdGenerator _idGenerator;
public CartsController(
ICommandBus commandBus,
IQueryBus queryBus,
IIdGenerator idGenerator)
{
_commandBus = commandBus;
_queryBus = queryBus;
_idGenerator = idGenerator;
}
[HttpPost]
public async Task<IActionResult> InitializeCart([FromBody] InitializeCartRequest? request)
{
if (request == null)
{
throw new ArgumentNullException(nameof(request));
}
var cartId = _idGenerator.New();
var command = Carts.InitializingCart.InitializeCart.Create(
cartId,
request.ClientId
);
await _commandBus.Send(command);
return Created("api/Carts", cartId);
}
[HttpPost("{id:guid}/products")]
public async Task<IActionResult> AddProduct(Guid id, [FromBody] AddProductRequest? request)
{
if (request == null)
{
throw new ArgumentNullException(nameof(request));
}
var command = Carts.AddingProduct.AddProduct.Create(
id,
ProductItem.Create(
request.ProductItem?.ProductId,
request.ProductItem?.Quantity
)
);
await _commandBus.Send(command);
return Ok();
}
[HttpDelete("{id:guid}/products")]
public async Task<IActionResult> RemoveProduct(Guid id, [FromBody] RemoveProductRequest? request)
{
if (request == null)
{
throw new ArgumentNullException(nameof(request));
}
var command = Carts.RemovingProduct.RemoveProduct.Create(
id,
PricedProductItem.Create(
request.ProductItem?.ProductId,
request.ProductItem?.Quantity,
request.ProductItem?.UnitPrice
)
);
await _commandBus.Send(command);
return Ok();
}
[HttpPut("{id:guid}/confirmation")]
public async Task<IActionResult> ConfirmCart(Guid id)
{
var command = Carts.ConfirmingCart.ConfirmCart.Create(
id
);
await _commandBus.Send(command);
return Ok();
}
[HttpGet("{id:guid}")]
public Task<CartDetails> Get(Guid id)
=> _queryBus.Send<GetCartById, CartDetails>(GetCartById.Create(id));
[HttpGet]
public Task<IReadOnlyList<CartShortInfo>> Get([FromQuery] int pageNumber = 1, [FromQuery] int pageSize = 20)
=> _queryBus.Send<GetCarts, IReadOnlyList<CartShortInfo>>(GetCarts.Create(pageNumber, pageSize));
[HttpGet("{id:guid}/history")]
public Task<IReadOnlyList<CartHistory>> GetHistory(Guid id)
=> _queryBus.Send<GetCartHistory, IReadOnlyList<CartHistory>>(GetCartHistory.Create(id));
[HttpGet("{id:guid}/versions")]
public Task<CartDetails> GetVersion(Guid id, [FromQuery] GetCartAtVersion? query)
=>
query == null
? throw new ArgumentNullException(nameof(query))
: _queryBus.Send<GetCartAtVersion, CartDetails>(GetCartAtVersion.Create(id, query.Version));
}
}
|
from flask import Flask, request, jsonify
import jsonpickle
import logging
import av
import io
import os
import datetime
import shutil
from PIL import Image
from tqdm import tqdm
logging.basicConfig(
level=logging.DEBUG,
format='%(asctime)s.%(msecs)03d %(levelname)s %(module)s - %(funcName)s: %(message)s',
datefmt='%Y-%m-%d %H:%M:%S',
)
app = Flask(__name__)
shutil.rmtree('./TEMP/', ignore_errors=True)
@app.route("/", methods=["POST"])
def extract_frames():
"""
Receive everything in json!!!
"""
app.logger.debug(f"Creating a directory TEMP ...")
os.makedirs('./TEMP/', exist_ok=True)
CURRENT_TIME = datetime.datetime.now().strftime("%Y-%m-%d-%H-%M-%S")
app.logger.debug(f"Receiving data ...")
data = request.json
data = jsonpickle.decode(data)
video = data['video']
fps_max = data['fps_max']
width_max = data['width_max']
height_max = data['height_max']
app.logger.debug(f"fps_max: {fps_max}, width_max: {width_max}, "
f"height_max: {height_max}")
video = io.BytesIO(video)
container = av.open(video)
app.logger.info(f"{container} opened")
metadata = {}
fps_original = float(container.streams.video[0].average_rate)
every_N = int(round(fps_original / fps_max))
every_N = max(1, every_N)
app.logger.info(f"Every {every_N} th frame will be processed.")
frames = []
indexes = []
for idx, frame in enumerate(container.decode(video=0)):
if idx % every_N != 0:
continue
frame_save_path = f"./TEMP/{CURRENT_TIME}-{idx}.jpg"
indexes.append(idx)
app.logger.info(f"processing {idx} th frame ...")
image = frame.to_image()
app.logger.info(f"original width height {image.size}")
width_original, height_original = image.size
image.thumbnail(size=(width_max, height_max))
app.logger.info(f"resized to {image.size}")
frames.append(frame_save_path)
app.logger.debug(f"saving the frame at {frame_save_path} "
f"temporarily before sending ...")
image.save(frame_save_path)
container.close()
num_frames_original = idx + 1
num_frames = len(frames)
duration_seconds = num_frames_original / fps_original
metadata['num_frames_original'] = num_frames_original
metadata['num_frames'] = num_frames
metadata['duration_seconds'] = duration_seconds
metadata['fps_original'] = fps_original
metadata['fps'] = len(frames) / duration_seconds
metadata['width_original'] = width_original
metadata['height_original'] = height_original
metadata['width'], metadata['height'] = image.size
metadata['frame_idx_original'] = indexes
app.logger.info(f"metadata: {metadata}")
app.logger.debug(f"Adding compressed frames ...")
frames_binary = []
for frame_save_path in tqdm(frames):
with open(frame_save_path, 'rb') as stream:
frames_binary.append(stream.read())
response = {'frames': frames_binary,
'metadata': metadata}
response_pickled = jsonpickle.encode(response)
shutil.rmtree('./TEMP/', ignore_errors=True)
return response_pickled
if __name__ == '__main__':
app.run(host='0.0.0.0', port=10001)
|
using ATInternet;
using Microsoft.VisualStudio.TestPlatform.UnitTestFramework;
using System;
using System.Collections.Generic;
using System.Linq;
namespace TrackerTests
{
[TestClass]
public class OnAppAdTest : AbstractTest
{
Publisher pub;
Publisher pub1;
SelfPromotion selfP;
SelfPromotion selfP1;
Publishers pubs;
SelfPromotions selfPs;
[TestInitialize]
public new void setUp()
{
base.setUp();
pub = new Publisher(tracker);
pub1 = new Publisher(tracker);
selfP = new SelfPromotion(tracker);
selfP1 = new SelfPromotion(tracker);
pubs = new Publishers(tracker);
selfPs = new SelfPromotions(tracker);
}
[TestMethod]
public void initPublisherTest()
{
Assert.AreEqual(string.Empty, pub.CampaignId);
Assert.AreEqual(OnAppAdAction.View, pub.Action);
}
[TestMethod]
public void setEventPubInScreenTest()
{
pub.CampaignId = "test";
pub.SetEvent();
int index = 0;
Assert.AreEqual(2, tracker.buffer.volatileParameters.Count);
Assert.AreEqual("type", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("AT", tracker.buffer.volatileParameters[index++].value());
Assert.AreEqual("ati", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("PUB-test-------", tracker.buffer.volatileParameters[index++].value());
}
[TestMethod]
public void setEventPubTest()
{
tracker.SetParam("clic", "toto");
pub.CampaignId = "test";
pub.SetEvent();
int index = 1;
Assert.AreEqual(3, tracker.buffer.volatileParameters.Count);
Assert.AreEqual("type", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("AT", tracker.buffer.volatileParameters[index++].value());
Assert.AreEqual("ati", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("PUB-test-------", tracker.buffer.volatileParameters[index++].value());
}
[TestMethod]
public void setEventFullPubTest()
{
pub.CampaignId = "1";
pub.Creation = "2";
pub.Variant = "3";
pub.Format = "4";
pub.GeneralPlacement = "5";
pub.DetailedPlacement = "6";
pub.AdvertiserId = "7";
pub.Url = "8";
pub.Action = OnAppAdAction.Touch;
pub.SetEvent();
int index = 0;
Assert.AreEqual(2, tracker.buffer.volatileParameters.Count);
Assert.AreEqual("type", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("AT", tracker.buffer.volatileParameters[index++].value());
Assert.AreEqual("atc", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("PUB-1-2-3-4-5-6-7-8", tracker.buffer.volatileParameters[index++].value());
}
[TestMethod]
public void setEventPubsTest()
{
pub.CampaignId = "test";
pub.SetEvent();
pub1.SetEvent();
List<Tuple<Param,string>> paramS = new Builder(tracker).PrepareQuery();
Assert.AreEqual("ati", paramS.Last().Item1.key);
Assert.AreEqual("&ati=PUB-test-------,PUB--------", paramS.Last().Item2);
}
[TestMethod]
public void initSelfPromotionTest()
{
Assert.AreEqual(0, selfP.AdId);
Assert.AreEqual(OnAppAdAction.View, selfP.Action);
}
[TestMethod]
public void setEventSelfPInScreenTest()
{
selfP.AdId = 20;
selfP.SetEvent();
int index = 0;
Assert.AreEqual(2, tracker.buffer.volatileParameters.Count);
Assert.AreEqual("type", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("AT", tracker.buffer.volatileParameters[index++].value());
Assert.AreEqual("ati", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("INT-20-||", tracker.buffer.volatileParameters[index++].value());
}
[TestMethod]
public void setEventSelfPTest()
{
tracker.SetParam("clic", "toto");
selfP.AdId = 20;
selfP.SetEvent();
Assert.AreEqual(3, tracker.buffer.volatileParameters.Count);
Assert.AreEqual("ati", tracker.buffer.volatileParameters[2].key);
Assert.AreEqual("INT-20-||", tracker.buffer.volatileParameters[2].value());
}
[TestMethod]
public void setEventFullSelfPTest()
{
selfP.AdId = 1;
selfP.Format = "2";
selfP.ProductId = "3";
selfP.Action = OnAppAdAction.Touch;
selfP.SetEvent();
int index = 0;
Assert.AreEqual(2, tracker.buffer.volatileParameters.Count);
Assert.AreEqual("type", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("AT", tracker.buffer.volatileParameters[index++].value());
Assert.AreEqual("atc", tracker.buffer.volatileParameters[index].key);
Assert.AreEqual("INT-1-2||3", tracker.buffer.volatileParameters[index++].value());
}
[TestMethod]
public void setEventSelfPsTest()
{
selfP.AdId = 2;
selfP.SetEvent();
selfP1.SetEvent();
List<Tuple<Param, string>> paramS = new Builder(tracker).PrepareQuery();
Assert.AreEqual("ati", paramS.Last().Item1.key);
Assert.AreEqual("&ati=INT-2-%7C%7C,INT-0-%7C%7C", paramS.Last().Item2);
}
[TestMethod]
public void addPub()
{
Publisher pub = pubs.Add("test");
Assert.AreEqual(1, tracker.businessObjects.Count);
Assert.AreEqual("test", (tracker.businessObjects[pub.id] as Publisher).CampaignId);
}
[TestMethod]
public void addSelfP()
{
SelfPromotion selfP = selfPs.Add(9);
Assert.AreEqual(1, tracker.businessObjects.Count);
Assert.AreEqual(9, (tracker.businessObjects[selfP.id] as SelfPromotion).AdId);
}
}
}
|
import os
import random
import numpy as np
import torch
from pommerman import utility, constants
from pommerman.dqn.nets.recurrent_cnn import CommDRCNN, PreprocessingDRCNN
def load_trained_team(comm, team_dir, random_agent, resume_training):
assert team_dir is not None
# TODO: Add handling for random agent without bomb
if random_agent:
prefix = '10000-RandomAgent-'
else:
# Adapt prefix depending on number of episodes
prefix = '30000-Self-'
def get_kwargs(**kwargs):
return kwargs
# Relevant args for agents
agent_kwargs = get_kwargs(**{})
device = get_device()
# load trained team
team = []
optimizers = []
if comm:
for index in range(2):
action_model = CommDRCNN(constants.BOARD_SIZE, len(constants.Action))
comm_model = PreprocessingDRCNN(constants.BOARD_SIZE, constants.RADIO_VOCAB_SIZE + 1)
checkpoint = torch.load(os.path.join(team_dir, prefix + 'agent_' + str(index) + '.tar'))
action_model.load_state_dict(checkpoint['action_model_' + str(index)])
comm_model.load_state_dict(checkpoint['comm_model_' + str(index)])
if resume_training:
action_model.train()
comm_model.train()
else:
action_model.eval()
comm_model.eval()
agent_kwargs['action_model'] = action_model
agent_kwargs['comm_model'] = comm_model
team.insert(index, agent_kwargs)
if resume_training:
checkpoint = torch.load(os.path.join(team_dir, prefix + 'optimizers' + '.tar'))
optimizer_dict = checkpoint['optimizer']
comm_optimizer_dict = checkpoint['comm_optimizer']
optimizers.insert(0, optimizer_dict)
optimizers.insert(1, comm_optimizer_dict)
del checkpoint
else:
for index in range(2):
action_model = PreprocessingDRCNN(constants.BOARD_SIZE, len(constants.Action))
checkpoint = torch.load(os.path.join(team_dir, prefix + 'agent_' + str(index) + '.tar'))
action_model.load_state_dict(checkpoint['action_model_' + str(index)])
if resume_training:
action_model.train()
else:
action_model.eval()
agent_kwargs['action_model'] = action_model
team.insert(index, agent_kwargs)
if resume_training:
checkpoint = torch.load(os.path.join(team_dir, prefix + 'optimizers' + '.tar'))
optimizer_dict = checkpoint['optimizer']
optimizers.insert(0, optimizer_dict)
del checkpoint
return team, optimizers
def get_path_from_setting(_agents, result_path):
dict_name = "_".join(_agents[:2])
_dict = os.path.join(result_path, dict_name)
return _dict
def randomly_select_trained_team(comm):
# Path where trained models are located
home_directory = os.path.expanduser('~')
result_path = os.path.join(home_directory, 'dev/playground/models')
if comm is True:
path = os.path.join(result_path, 'comm_xp_results')
else:
path = os.path.join(result_path, 'xp_results')
# select random saved model for each round
dirs = [root for root, dirs, files in os.walk(path) if 'trial' in root]
team_dir = random.choice(dirs)
print('Randomly selected team: ' + team_dir)
return team_dir
def bombs_in_view_range(bombs_map):
ret = []
locations = np.where(bombs_map > 0)
for r, c in zip(locations[0], locations[1]):
ret.append({'position': (r, c)})
return not ret
def flames_in_view_range(board):
rows = board.shape[0]
cols = board.shape[1]
for r in range(0, rows):
for c in range(0, cols):
if utility.position_is_flames(board, (r, c)):
return True
return False
def enemies_in_view_range(board, enemies):
rows = board.shape[0]
cols = board.shape[1]
for r in range(0, rows):
for c in range(0, cols):
if utility.position_is_enemy(board, (r, c), enemies):
return True
return False
# Beginning of old dqn.utils
def init_hidden_states(batch_size, hidden_size):
h = torch.zeros(1, batch_size, hidden_size)
c = torch.zeros(1, batch_size, hidden_size)
return h, c
def preprocess_obs(obs):
board = np.array(obs['board'])
bomb_blast_strength = np.array(obs['bomb_blast_strength'])
bomb_life = np.array(obs['bomb_life'])
bomb_moving_direction = np.array(obs['bomb_moving_direction'])
flame_life = np.array(obs['flame_life'])
return np.dstack((board, bomb_blast_strength, bomb_life, bomb_moving_direction, flame_life))
def get_device():
return torch.device("cuda" if torch.cuda.is_available() else "cpu")
def split_sample(sample):
# batch: [[(s, a, r, n_s, d), (s, a, r, n_s, d)], [(s, a, r, n_s, d), (s, a, r, n_s, d)]]
s_a_n_s_batch, r_d_batch = [], []
# episode: [(s, a, r, n_s, d), (s, a, r, n_s, d)]
for episode in sample:
s_a_n_s_episode, r_d_episode = [], []
# experience: (s, a, r, n_s, d)
for experience in episode:
s_a_n_s_episode.append((experience[0], experience[1], experience[3]))
r_d_episode.append((experience[2], experience[4]))
s_a_n_s_batch.append(s_a_n_s_episode)
r_d_batch.append(r_d_episode)
return s_a_n_s_batch, r_d_batch
def get_arena_batch(r_d_batch, agent_indices):
# r is array
# r_d_batch: [[(r, d), (r, d)], [(r, d), (r, d)]]
arena_batch = []
# episode: [(r, d), (r, d)]
for episode in r_d_batch:
arena_episode = []
# experience: (r, d)
for experience in episode:
arena_episode.append(get_r_d_experience(experience[0], experience[1], agent_indices))
arena_batch.append(arena_episode)
return arena_batch
def get_agent_batch(s_a_n_s_batch, index):
# s, a, n_s are arrays
# s_a_n_s_batch: [[(s, a, n_s), (s, a, n_s)], [(s, a, n_s), (s, a, n_s)]]
agent_batch = []
# episode: [(s, a, n_s), (s, a, n_s)]
for episode in s_a_n_s_batch:
agent_episode = []
# experience: (s, a, n_s)
for experience in episode:
agent_episode.append(get_s_a_n_s_experience(experience[0], experience[1], experience[2], index))
agent_batch.append(agent_episode)
return agent_batch
def get_s_a_n_s_experience(state, actions, next_state, index):
agent_state = state[index]
agent_action = actions[index]
agent_next_state = next_state[index]
experience = (agent_state, agent_action, agent_next_state)
return experience
def get_r_d_experience(reward, done, agent_indices):
index_agent1 = agent_indices[0]
index_agent2 = agent_indices[1]
assert reward[index_agent1] == reward[index_agent2]
agent_reward = reward[index_agent1]
experience = (agent_reward, done)
return experience
|
package interpreter
import lox.LoxCallError
import lox.stringify
object LoxPrintFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
println(stringify(arguments[0]))
return null
}
override fun toString(): String {
return "<native function: print>"
}
}
object LoxClockFunction : LoxCallable {
override var arity: Int = 0
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
return System.currentTimeMillis().toDouble() / 1000.0
}
override fun toString(): String {
return "<native function: clock>"
}
}
object LoxReadLineFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
print(stringify(arguments[0]))
return readLine()
}
override fun toString(): String {
return "<native function: readline>"
}
}
object LoxIntFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
val loxError = LoxCallError("Can not convert argument to integer")
return when (val arg = arguments[0]) {
is Int -> arg
is Double -> arg.toInt()
is String -> arg.toIntOrNull() ?: throw loxError
else -> throw loxError
}
}
override fun toString(): String {
return "<native function: int>"
}
}
object LoxFloatFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
val loxError = LoxCallError("Can not convert argument to float")
return when (val arg = arguments[0]) {
is Int -> arg.toDouble()
is Double -> arg.toDouble()
is String -> arg.toDoubleOrNull() ?: throw loxError
else -> throw loxError
}
}
override fun toString(): String {
return "<native function: int>"
}
}
object LoxStrFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
return stringify(arguments[0])
}
override fun toString(): String {
return "<native function: str>"
}
}
object LoxTypeFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
return when (val arg = arguments[0]) {
is Int -> "<int>"
is Double -> "<float>"
is String -> "<str>"
is Boolean -> "<bool>"
is LoxClass -> arg.toString()
is LoxInstanceBase -> "<$arg>"
is LoxCallable -> arg.toString()
else -> "TODO" // Should not happen
}
}
override fun toString(): String {
return "<native function: type>"
}
}
object LoxLenFunction : LoxCallable {
override var arity: Int = 1
override fun call(interpreter: Interpreter<Any?>, arguments: List<Any?>): Any? {
return when (val arg = arguments[0]) {
is String -> arg.length
is LoxListInstance -> arg.list.size
else -> throw LoxCallError("Can't calculate length, not a valid argument")
}
}
override fun toString(): String {
return "<native function: str>"
}
}
|
use rome_formatter::{IndentStyle, LineWidth};
use rome_js_formatter::context::QuoteStyle;
use rome_service::settings;
use serde::{Deserialize, Serialize};
use serde_json::{Error, Value};
use tracing::{info, trace};
pub const CONFIGURATION_SECTION: &str = "rome";
#[derive(Debug, Default, Clone, Deserialize, Serialize, PartialEq, Eq)]
#[serde(rename_all = "camelCase")]
/// Specific settings for Rome formatter
pub struct FormatterWorkspaceSettings {
/// Allows to format code that might contain syntax errors
pub format_with_syntax_errors: bool,
/// The width of a single line, specified by the user
pub line_width: u16,
/// The indent style, specified by the user
pub indent_style: String,
/// The quote style, specified by the user
pub quote_style: String,
/// The number of spaces, specified by the user and applied only when using Spaces
pub space_quantity: u8,
}
#[derive(Debug, Default, Clone, Deserialize, Serialize, PartialEq, Eq)]
#[serde(rename_all = "camelCase")]
/// Settings for Rome Analysis
pub struct AnalysisWorkspaceSettings {
/// Allows rome to compute and publish diagnostics
pub enable_diagnostics: bool,
/// Allows rome to compute and provide code actions
pub enable_code_actions: bool,
}
#[derive(Debug, Default, Clone, Deserialize, Serialize, PartialEq, Eq)]
#[serde(rename_all = "camelCase")]
/// The settings applied to the workspace by the LSP
pub struct WorkspaceSettings {
/// Formatter settings
#[serde(default)]
pub formatter: FormatterWorkspaceSettings,
/// Analysis settings
#[serde(default)]
pub analysis: AnalysisWorkspaceSettings,
/// Unstable features enabled
#[serde(default)]
pub unstable: bool,
}
#[derive(Debug)]
pub(crate) struct Config {
settings: WorkspaceSettings,
}
impl Config {
pub(crate) fn new() -> Self {
Self {
settings: WorkspaceSettings::default(),
}
}
pub fn get_workspace_settings(&self) -> WorkspaceSettings {
self.settings.clone()
}
pub fn set_workspace_settings(&mut self, value: Value) -> Result<(), Error> {
let workspace_settings = serde_json::from_value(value)?;
self.settings = workspace_settings;
trace!(
"Correctly stored the settings coming from the client: {:?}",
self.settings
);
Ok(())
}
/// Convert the current configuration to an instance of [settings::WorkspaceSettings]
pub fn as_workspace_settings(&self) -> settings::WorkspaceSettings {
let mut settings = settings::WorkspaceSettings::default();
settings.format.format_with_errors = self.settings.formatter.format_with_syntax_errors;
let custom_ident_style: IndentStyle = self
.settings
.formatter
.indent_style
.parse()
.unwrap_or_default();
if custom_ident_style != IndentStyle::default() {
// merge settings with the ones provided by the editor
match custom_ident_style {
IndentStyle::Space(_) => {
settings.format.indent_style =
Some(IndentStyle::Space(self.settings.formatter.space_quantity));
}
IndentStyle::Tab => {
settings.format.indent_style = Some(custom_ident_style);
}
}
info!(
"Using user setting indent style: {:?}",
settings.format.indent_style
);
}
let custom_quote_style: QuoteStyle = self
.settings
.formatter
.quote_style
.parse()
.unwrap_or_default();
if custom_quote_style != QuoteStyle::default() {
settings.languages.javascript.format.quote_style = Some(custom_quote_style);
info!("Using user setting quote style: {}", custom_quote_style);
}
// apply the new line width only if they are different
let custom_line_width: LineWidth = self
.settings
.formatter
.line_width
.try_into()
.unwrap_or_default();
if custom_line_width != LineWidth::default() {
settings.format.line_width = Some(custom_line_width);
info!(
"Using user setting line width: {}",
custom_line_width.value()
);
}
settings
}
}
|
"""
Remove Item
There are several methods to remove items from a list:
"""
thislist = ["apple", "banana", "cherry"]
thislist.remove("banana")
print(thislist)
|
from __future__ import division, absolute_import, print_function
import numpy as np
import esutil
import matplotlib.pyplot as plt
from .fgcmUtilities import objFlagDict
from .sharedNumpyMemManager import SharedNumpyMemManager as snmm
class FgcmConnectivity(object):
"""
Class to check the star/observation connectivity.
parameters
----------
fgcmConfig: FgcmConfig
fgcmPars: FgcmPars
fgcmStars: FgcmStars
"""
def __init__(self, fgcmConfig, fgcmPars, fgcmStars):
self.fgcmLog = fgcmConfig.fgcmLog
self.fgcmLog.info('Initializing fgcmConnectivity')
self.fgcmPars = fgcmPars
self.fgcmStars = fgcmStars
self.plotPath = fgcmConfig.plotPath
self.outfileBaseWithCycle = fgcmConfig.outfileBaseWithCycle
self.bands = fgcmConfig.bands
def plotConnectivity(self):
"""
Make connectivity plots.
parameters
----------
None
"""
colors = ['r', 'b', 'm', 'c', 'k', 'g']
# get values
objID = snmm.getArray(self.fgcmStars.objIDHandle)
objFlag = snmm.getArray(self.fgcmStars.objFlagHandle)
objRA = snmm.getArray(self.fgcmStars.objRAHandle)
objDec = snmm.getArray(self.fgcmStars.objDecHandle)
objNGoodObs = snmm.getArray(self.fgcmStars.objNGoodObsHandle)
obsBandIndex = snmm.getArray(self.fgcmStars.obsBandIndexHandle)
obsObjIDIndex = snmm.getArray(self.fgcmStars.obsObjIDIndexHandle)
obsExpIndex = snmm.getArray(self.fgcmStars.obsExpIndexHandle)
obsFlag = snmm.getArray(self.fgcmStars.obsFlagHandle)
groupFlag = np.zeros((objID.size, len(self.bands)), dtype=np.int32)
mask = (objFlagDict['TOO_FEW_OBS'] |
objFlagDict['BAD_COLOR'] |
objFlagDict['VARIABLE'] |
objFlagDict['TEMPORARY_BAD_STAR'])
goodStars, = np.where((objFlag & mask) == 0)
for b, band in enumerate(self.bands):
# start with group 0
groupNumber = 0
# The nights that have been grouped are a unique set
groupedNights = set()
# Take one star, it's the group seed
groupFlag[goodStars[0], b] = 2**groupNumber
# Find all good (photometric) observations of stars in this band
goodObs, = np.where((obsBandIndex == b) & (self.fgcmPars.expFlag[obsExpIndex] == 0) &
((objFlag[obsObjIDIndex] & mask) == 0))
# Split into nights with a histogram
h, rev = esutil.stat.histogram(self.fgcmPars.expNightIndex[obsExpIndex[goodObs]],
min=0, max=self.fgcmPars.nCampaignNights, rev=True)
done = False
while not done:
# Start with all the stars that are in the current group
test, = np.where((groupFlag[obsObjIDIndex[goodObs], b] & (2**groupNumber)) > 0)
# Find the unique, extra list of nights which have the stars
nightIndices = np.unique(self.fgcmPars.expNightIndex[obsExpIndex[goodObs[test]]])
nightIndices = [nightIndex for nightIndex in nightIndices if nightIndex not in groupedNights]
if len(nightIndices) == 0:
# We're done with this group ...
# Check if we're totally done.
# Make sure we check if these stars have *any* good observations
# (e.g., extra bands)
testStars, = np.where((groupFlag[goodStars, b] == 0) &
(objNGoodObs[goodStars, b] > 0))
if testStars.size == 0:
# We have marked all the stars
done = True
else:
# Flag the first of these unmarked stars
# Increment the groupNumber
groupNumber += 1
# Flag the first seed star for the group
groupFlag[goodStars[testStars[0]], b] = 2**groupNumber
# Back to the beginning
continue
# Loop over all the nights that are connected
for nightIndex in nightIndices:
i1a = rev[rev[nightIndex]: rev[nightIndex + 1]]
groupFlag[obsObjIDIndex[goodObs[i1a]], b] |= 2**groupNumber
groupedNights.add(nightIndex)
# And do the plot of the different groups...
fig = plt.figure(figsize=(10, 6))
fig.clf()
ax = fig.add_subplot(111)
ax.set_rasterization_zorder(1.0)
for g in range(groupNumber + 1):
u, = np.where((groupFlag[:, b] & (2**groupNumber)) > 0)
u = np.random.choice(u, replace=False, size=np.min([u.size, 1000000]))
ax.plot(objRA[u], objDec[u], colors[g % (len(colors))] + ',', zorder=0.5)
ax.plot(objRA[u[0]], objDec[u[0]], colors[g % (len(colors))] + '.', label='Group %d' % (g))
ax.legend(markerscale=2.0)
ax.set_xlabel('RA')
ax.set_ylabel('Dec')
ax.set_title('%s band' % (band))
fig.savefig('%s/%s_connectivity_groups_%s.png' % (self.plotPath,
self.outfileBaseWithCycle,
band))
plt.close(fig)
|
from __future__ import absolute_import
from __future__ import unicode_literals
from mb.lib.memoize import memoize
class SomeClass:
def __init__(self):
self._x = 0
def _the_test(self, number):
self._x += 1
return number * self._x
@memoize
def TestCache1(self, number):
return self._the_test(number)
@memoize("self", "number")
def TestCache2(self, number, **kw):
tmp = self._the_test(kw["number2"])
return self._the_test(tmp - number)
def test_NoArgumentsPassed_UsesAllArgumentsForCache():
someClass = SomeClass()
assert someClass._the_test(5) == 5
assert someClass.TestCache1(5) == 10
assert someClass.TestCache1(5) == 10
def test_ArgumentsPassedToUseForCache_UsesArgumentsForCache():
someClass = SomeClass()
assert someClass.TestCache2(5, number2=10) == 10
assert someClass.TestCache2(5, number2=10) == 10
|
SUBROUTINE MHIGGSTREE_CPV(PAR,IFAIL)
c Tree-level Higgs masses.
c - The tree-level neutral Higgs squared-mass matrix MH02(i,j), (i,j=1..5;
c 1 -> hu, 2 -> hd, 3 -> hs, 4 -> cosb*au+sinb*ad, 5 -> as) and the
c tree-level charged-higgs squared mass MHC2 are stored in the common
c SQUHIMASSM, for further processing at the squark squared-scale QSTSB.
c - The tree-level (at the weak-scale) squared-masses for the charged
c Higgs, MHC, and neutral Higgses, MH0(i), (i=1..5), are stored
c (temporarily) in the common HISPEC, together with the rotation
c matrices XC(i,j), (i,j=1..2) for the charged-Higgs: beta angle,
c and XH(i,j), (i,j=1..5) for the neutral Higgses, as well as the
c heavy-doublet squared-mass MA2. These tree-level quantities shall
c be used for the implementation of the Higgs-loop contributions to
c the Higgs masses (mhiggsloop_gaugehiggs_CPV.f and
c mhiggsloop_pole_CPV.f), before being replaced by the loop-corrected
c quantities.
c - The tree-level contributions to the effective Z3-conserving parameters
c of the Higgs potential are stored in the common EFFPOTPAR.
c IF a tree-level squared-mass is found negative, IFAIL.NE.0.
IMPLICIT NONE
INTEGER I,J,IFAIL
DOUBLE PRECISION PAR(*)
DOUBLE PRECISION VALPH(5),VECPH(5,5),MHT2(5,5)
DOUBLE PRECISION G1Q,G2Q,GQ,ALSQ
DOUBLE PRECISION ZHU,ZHD,ZS,vuq,vdq,TANBQ
DOUBLE PRECISION l,k,Alcos1,Akcos2,muq,nuq
DOUBLE PRECISION tanb,cosb,sinb,vu,vd
DOUBLE PRECISION MH02(5,5),MHC2
DOUBLE PRECISION MHC,XC(2,2),MH0(5),XH(5,5),MA2
DOUBLE PRECISION lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
DOUBLE PRECISION phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
DOUBLE PRECISION XIFQ,XISQ,MUPQ,MSPQ,M3HQ
DOUBLE PRECISION phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
DOUBLE PRECISION Rm3,Im3,RAudt,IAudt,RxS,IxS,Rmsp,Imsp,RAst,IAst
DOUBLE PRECISION RlPMt,IlPMt,RlM,IlM,RAqs,IAqs,Rltqs,Iltqs
DOUBLE PRECISION DDCOS,DDSIN
COMMON/QGAUGE/G1Q,G2Q,GQ,ALSQ
COMMON/QHIGGS/ZHU,ZHD,ZS,vuq,vdq,TANBQ
COMMON/QPAR/l,k,Alcos1,Akcos2,muq,NUQ
COMMON/TBPAR/tanb,cosb,sinb,vu,vd
COMMON/SQUHIMASSM/MH02,MHC2
COMMON/HISPEC/MHC,XC,MH0,XH,MA2
COMMON/EFFPOTPAR/lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
COMMON/PHASES/phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
COMMON/QEXT/XIFQ,XISQ,MUPQ,MSPQ,M3HQ
COMMON/Z3VAUX/phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
COMMON/Z3VPOT/Rm3,Im3,RAudt,IAudt,RxS,IxS,Rmsp,Imsp,RAst,IAst,
. RlPMt,IlPMt,RlM,IlM,RAqs,IAqs,Rltqs,Iltqs
c A: Charged Higgs
c I- Squared mass
MHC2=((muq/vuq/vdq*(Alcos1+k/l*muq*DDCOS(phi0))+g2q/2.d0-l**2)
. +(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))/vuq/vdq)*(vu**2+vd**2) !/(ZHu*ZHd)
c II- Tree level input for radiative corrections
MHC=((muq/vuq/vdq*(Alcos1+k/l*muq*DDCOS(phi0))+g2q/2.d0-l**2)
. +(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))/vuq/vdq)*(vuq**2+vdq**2)
XC(1,1)=-vuq/dsqrt(vuq**2+vdq**2)
XC(1,2)=vdq/dsqrt(vuq**2+vdq**2)
XC(2,1)=vdq/dsqrt(vuq**2+vdq**2)
XC(2,2)=vuq/dsqrt(vuq**2+vdq**2)
IF(MHC.le.0.d0)then
c print*,higgspro
MHC=1d0
ENDIF
c B: Neutral states: diag(MH0(I)^2) = XH.MH02.XHt
c I- Squared mass-matrix
MH02(1,1)=muq*(Alcos1+k/l*muq*DDCOS(phi0))*vdq/vuq
. +(g1q+g2q)/2.d0*vuq**2
. +(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))*vdq/vuq
MH02(1,2)=-muq*(Alcos1+k/l*muq*DDCOS(phi0))
. +(2.d0*l**2-(g1q+g2q)/2.d0)*vuq*vdq
. -(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))
MH02(2,1)=MH02(1,2)
MH02(1,3)=-l*vdq*(Alcos1+2.d0*k/l*muq*DDCOS(phi0)
. +mupq*DDCOS(Phi01-phip))
. +2.d0*l*muq*vuq
MH02(3,1)=MH02(1,3)
MH02(1,4)=0.d0
MH02(4,1)=MH02(1,4)
MH02(1,5)=-3.d0*k*muq*vdq*DDSIN(phi0)
. -l*vdq/muq*(m3Hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF)
. +2d0*muq*mupq*DDSIN(phi01-phip))
MH02(5,1)=MH02(1,5)
MH02(2,2)=muq*(Alcos1+k/l*muq*DDCOS(phi0))*vuq/vdq
. +(g1q+g2q)/2.d0*vdq**2
. +(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))*vuq/vdq
MH02(2,3)=-l*vuq*(Alcos1+2.d0*k/l*muq*DDCOS(phi0)
. +mupq*DDCOS(Phi01-phip))
. +2.d0*l*muq*vdq
MH02(3,2)=MH02(2,3)
MH02(2,4)=0.d0
MH02(4,2)=MH02(2,4)
MH02(2,5)=-3.d0*k*muq*vuq*DDSIN(phi0)
. -l*vuq/muq*(m3Hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF)
. +2d0*muq*mupq*DDSIN(phi01-phip))
MH02(5,2)=MH02(2,5)
MH02(3,3)=l**2*vuq*vdq/muq*(Alcos1+mupq*DDCOS(phi01-phip))
. +k/l*muq*(Akcos2+4.d0*k/l*muq+3d0*mupq*DDCOS(phi02-phip))
. -l/muq*(xiSq*DDCOS(phiSq)+xIFq*mupq*DDCOS(phip-phIF))
MH02(3,4)=dsqrt(vu**2+vd**2)*(muq*k*DDSIN(phi0)
. -l/muq*(m3Hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF))) ! /dsqrt(Zs*ZHu*ZHd)
MH02(4,3)=MH02(3,4)
IF(k.ne.0d0)then
MH02(3,5)=4*l*k*vuq*vdq*DDSIN(phi0)
. +2d0*l/muq*(xiSq*DDSIN(phiSq)+xIFq*mupq*DDSIN(phip-phIF))
. +MSPq*DDSIN(phiSPq)+2d0*k*xIFq*DDSIN(phi02-phIF)
. +2d0*l**2*vuq*vdq/muq**2*(m3hq*DDSIN(phi3q)
. +l*xIFq*DDSIN(phi01-phIF)+2d0*muq*mupq*DDSIN(phi01-phip))
ELSE
MH02(3,5)=-MSPq*DDSIN(phiSPq)
ENDIF
MH02(5,3)=MH02(3,5)
MH02(4,4)=(muq*(Alcos1+k/l*muq*DDCOS(phi0))
. +m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))
. /vuq/vdq*(vu**2+vd**2) ! /(ZHu*ZHd)
MH02(4,5)=l*dsqrt(vu**2+vd**2)*(Alcos1
. -2.d0*k/l*muq*DDCOS(phi0)-mupq*DDCOS(Phi01-phip)) ! /dsqrt(Zs*ZHu*ZHd)
MH02(5,4)=MH02(4,5)
MH02(5,5)=-k/l*muq*(3.d0*Akcos2+mupq*DDCOS(phi02-phip))
. +l**2*vuq*vdq/muq*(Alcos1+4.d0*k/l*muq*DDCOS(phi0)
. +mupq*DDCOS(phi01-phip))
. -l/muq*(xiSq*DDCOS(phiSq)+xIFq*mupq*DDCOS(phip-phIF))
. -2d0*(MSPq*DDCOS(phiSPq)+2d0*k*xIFq*DDCOS(phi02-phIF))
c print*,'MH02_1*',MH02(1,1),MH02(1,2),MH02(1,3),MH02(1,4),MH02(1,5)
c print*,'MH02_2*',MH02(2,1),MH02(2,2),MH02(2,3),MH02(2,4),MH02(2,5)
c print*,'MH02_3*',MH02(3,1),MH02(3,2),MH02(3,3),MH02(3,4),MH02(3,5)
c print*,'MH02_4*',MH02(4,1),MH02(4,2),MH02(4,3),MH02(4,4),MH02(4,5)
c print*,'MH02_5*',MH02(5,1),MH02(5,2),MH02(5,3),MH02(5,4),MH02(5,5)
cUE:
c WRITE(0,*)"MH02 =",
c . MH02(1,1),MH02(2,2),MH02(3,3),MH02(1,2),MH02(1,3),MH02(2,3)
c II- Tree level input for radiative corrections
MA2=(muq*(Alcos1+k/l*muq*DDCOS(phi0))
. +m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))
. /vuq/vdq*(vu**2+vd**2)/(ZHu*ZHd)
MHT2(1,1)=muq*(Alcos1+k/l*muq*DDCOS(phi0))*vdq/vuq
. +(g1q+g2q)/2.d0*vuq**2
. +(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))*vdq/vuq
MHT2(1,2)=-muq*(Alcos1+k/l*muq*DDCOS(phi0))
. +(2.d0*l**2-(g1q+g2q)/2.d0)*vuq*vdq
. -(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))
MHT2(2,1)=MHT2(1,2)
MHT2(1,3)=-l*vdq*(Alcos1+2.d0*k/l*muq*DDCOS(phi0)
. +mupq*DDCOS(Phi01-phip))
. +2.d0*l*muq*vuq
MHT2(3,1)=MHT2(1,3)
MHT2(1,4)=0.d0
MHT2(4,1)=MHT2(1,4)
MHT2(1,5)=-3.d0*k*muq*vdq*DDSIN(phi0)
. -l*vdq/muq*(m3Hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF)
. +2d0*muq*mupq*DDSIN(phi01-phip))
MHT2(5,1)=MHT2(1,5)
MHT2(2,2)=muq*(Alcos1+k/l*muq*DDCOS(phi0))*vuq/vdq
. +(g1q+g2q)/2.d0*vdq**2
. +(m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))*vuq/vdq
MHT2(2,3)=-l*vuq*(Alcos1+2.d0*k/l*muq*DDCOS(phi0)
. +mupq*DDCOS(Phi01-phip))
. +2.d0*l*muq*vdq
MHT2(3,2)=MHT2(2,3)
MHT2(2,4)=0.d0
MHT2(4,2)=MHT2(2,4)
MHT2(2,5)=-3.d0*k*muq*vuq*DDSIN(phi0)
. -l*vuq/muq*(m3Hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF)
. +2d0*muq*mupq*DDSIN(phi01-phip))
MHT2(5,2)=MHT2(2,5)
MHT2(3,3)=l**2*vuq*vdq/muq*(Alcos1+mupq*DDCOS(phi01-phip))
. +k/l*muq*(Akcos2+4.d0*k/l*muq+3d0*mupq*DDCOS(phi02-phip))
. -l/muq*(xiSq*DDCOS(phiSq)+xIFq*mupq*DDCOS(phip-phIF))
MHT2(3,4)=dsqrt(vuq**2+vdq**2)*(muq*k*DDSIN(phi0)
. -l/muq*(m3Hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF)))
MHT2(4,3)=MHT2(3,4)
IF(k.ne.0d0)then
MHT2(3,5)=4*l*k*vuq*vdq*DDSIN(phi0)
. +2d0*l/muq*(xiSq*DDSIN(phiSq)+xIFq*mupq*DDSIN(phip-phIF))
. +MSPq*DDSIN(phiSPq)+2d0*k*xIFq*DDSIN(phi02-phIF)
. +2d0*l**2*vuq*vdq/muq**2*(m3hq*DDSIN(phi3q)
. +l*xIFq*DDSIN(phi01-phIF)+2d0*muq*mupq*DDSIN(phi01-phip))
ELSE
MHT2(3,5)=-MSPq*DDSIN(phiSPq)
ENDIF
MHT2(5,3)=MHT2(3,5)
MHT2(4,4)=(muq*(Alcos1+k/l*muq*DDCOS(phi0))
. +m3Hq*DDCOS(phi3q)+l*xIFQ*DDCOS(phi01-phIF)
. +muq*mupq*DDCOS(phi01-phip))
. /vuq/vdq*(vuq**2+vdq**2)
MHT2(4,5)=l*(Alcos1-2.d0*k/l*muq*DDCOS(phi0)
. -mupq*DDCOS(Phi01-phip))*dsqrt(vuq**2+vdq**2)
MHT2(5,4)=MHT2(4,5)
MHT2(5,5)=-k/l*muq*(3.d0*Akcos2+mupq*DDCOS(phi02-phip))
. +l**2*vuq*vdq/muq*(Alcos1+4.d0*k/l*muq*DDCOS(phi0)
. +mupq*DDCOS(phi01-phip))
. -l/muq*(xiSq*DDCOS(phiSq)+xIFq*mupq*DDCOS(phip-phIF))
. -2d0*(MSPq*DDCOS(phiSPq)+2d0*k*xIFq*DDCOS(phi02-phIF))
CALL DIAGN(5,MHT2,VALPH,VECPH,1.d-10)
CALL SORTNA(5,VALPH,VECPH)
cUE:
c write(*,*) "In mhiggstree_CPV: MH02 off-diag:",
c . MH02(1,4),MH02(2,4),MH02(3,4)
c . ,MH02(1,5),MH02(2,5),MH02(3,5)
c write(*,*) "In mhiggstree_CPV: MH02 4-5:",
c . MH02(4,4),MH02(5,5),MH02(4,5)
c write(*,*) "In mhiggstree_CPV: VALPH:",VALPH
DO I=1,5
IF(VALPH(I).le.0d0)then
VALPH(I)=1d0
ENDIF
MH0(I)=VALPH(I)
DO J=1,5
XH(I,J)=VECPH(J,I)
ENDDO
ENDDO
c C: Parameters of the Effective Potential
lu=(g1q+g2q)/4.d0
ld=(g1q+g2q)/4.d0
l3=(-g1q+g2q)/4.d0
l4=l**2-g2q/2.d0
Rel5=0.d0
Iml5=0.d0
Rel6=0.d0
Iml6=0.d0
Rel7=0.d0
Iml7=0.d0
RAud=l*Alcos1
RAS=k*Akcos2
K2=k**2
lPu=l**2
lPd=l**2
RlPM=k*l*DDCOS(Phi0)
IlPM=k*l*DDSIN(Phi0)
Rm3=m3hq*DDCOS(phi3q)+l*xIFq*DDCOS(phi01-phIF)
Im3=m3hq*DDSIN(phi3q)+l*xIFq*DDSIN(phi01-phIF)
RAudt=l*mupq*DDCOS(phi01-phip)
IAudt=l*mupq*DDSIN(phi01-phip)
RxS=xiSq*DDCOS(phiSq)+mupq*xIFq*DDCOS(phip-phIF)
IxS=xiSq*DDSIN(phiSq)+mupq*xIFq*DDSIN(phip-phIF)
Rmsp=mspq*DDCOS(phiSPq)+2d0*k*xIFq*DDCOS(phi02-phIF)
Imsp=mspq*DDSIN(phiSPq)+2d0*k*xIFq*DDSIN(phi02-phIF)
RAst=k*mupq*DDCOS(phi02-phip)
IAst=k*mupq*DDSIN(phi02-phip)
RlPMt=0d0
IlPMt=0d0
RlM=0d0
IlM=0d0
RAqs=0d0
IAqs=0d0
Rltqs=0d0
Iltqs=0d0
c print*,'mHc',dsqrt(mHc2)
c print*,'mH01',MH0(1)
c print*,'mH02',MH0(2)
c print*,'mH03',MH0(3)
c print*,'mH04',MH0(4)
c print*,'mH05',MH0(5)
c print*,'XH1*',XH(1,1),XH(1,2),XH(1,3),XH(1,4),XH(1,5)
c print*,'XH2*',XH(2,1),XH(2,2),XH(2,3),XH(2,4),XH(2,5)
c print*,'XH3*',XH(3,1),XH(3,2),XH(3,3),XH(3,4),XH(3,5)
c print*,'XH4*',XH(4,1),XH(4,2),XH(4,3),XH(4,4),XH(4,5)
c print*,'XH5*',XH(5,1),XH(5,2),XH(5,3),XH(5,4),XH(5,5)
620 RETURN
END
************************************************************************************************
SUBROUTINE MHIGGSLOOP_SFERM_CPV(PAR)
c One-loop corrections to the Higgs potential + leading 2-loop
c - SM-fermions + Sfermions contribution
c - The 1-loop + leading 2-loop corrections from SM-fermions and sfermions
c to the parameters of the effective Higgs potential are added and stored
c in the common EFFPOTPAR.
c - The corresponding corrections to the squared-mass matrices of the
c neutral-Higgs states, as well as the charged one, are added to MH0(i,j)
c or MHC2 and stored within the common SQUHIMASSM.
IMPLICIT NONE
INTEGER I,J
DOUBLE PRECISION PAR(*)
DOUBLE PRECISION Pi,aux,Ytau,fsf1,fsf2,fsf3,fsf5,fsf6,fsf7,s
DOUBLE PRECISION dTdh(5),dRdh(5),R2,Rhh(5,5)
DOUBLE PRECISION QSTSB
DOUBLE PRECISION ZHU,ZHD,ZS,vuq,vdq,TANBQ
DOUBLE PRECISION tanb,cosb,sinb,vu,vd
DOUBLE PRECISION Ytq,Ybq,MTOPQ,MBOTQ
DOUBLE PRECISION mt,mb,mtau,mmu,mel,MS,MC,MBP,MPI,MSTRANGE
DOUBLE PRECISION G1Q,G2Q,GQ,ALSQ
DOUBLE PRECISION phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
DOUBLE PRECISION MSQ3,MSU3,MSD3,AT,AB
DOUBLE PRECISION MSQ1,MSU1,MSD1
DOUBLE PRECISION l,k,Alcos1,Akcos2,muq,nuq
DOUBLE PRECISION MST2(2),UT(2,2,2),MSB2(2),UB(2,2,2),MSL2(2),
. UTAU(2,2,2),MSNT2
DOUBLE PRECISION MSU2(2),MSD2(2),MSE2(2),MSNE2,MSMU2(2),
. UMU(2,2,2)
DOUBLE PRECISION MSL3,MSE3,MSL1,MSE1,ATAU,AMU
DOUBLE PRECISION MH02(5,5),MHC2
DOUBLE PRECISION MHC,XC(2,2),MH0(5),XH(5,5),MA2
DOUBLE PRECISION lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
DOUBLE PRECISION Rm3,Im3,RAudt,IAudt,RxS,IxS,Rmsp,Imsp,RAst,IAst,
. RlPMt,IlPMt,RlM,IlM,RAqs,IAqs,Rltqs,Iltqs
DOUBLE PRECISION MHuS,MHdS,MSS
DOUBLE PRECISION IAL,IAK,IXIS
DOUBLE PRECISION DDCOS,DDSIN
COMMON/STSBSCALE/QSTSB
COMMON/QHIGGS/ZHU,ZHD,ZS,vuq,vdq,TANBQ
COMMON/TBPAR/tanb,cosb,sinb,vu,vd
COMMON/QQUARK/Ytq,Ybq,MTOPQ,MBOTQ
COMMON/SMFERM/mt,mb,mtau,mmu,mel,MS,MC,MBP,MPI,MSTRANGE
COMMON/QGAUGE/G1Q,G2Q,GQ,ALSQ
COMMON/PHASES/phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
COMMON/RADCOR2/MSQ3,MSU3,MSD3,AT,AB
COMMON/SQUPAR/MSQ1,MSU1,MSD1
COMMON/QPAR/l,k,Alcos1,Akcos2,muq,NUQ
COMMON/SFERM3SPEC/MST2,UT,MSB2,UB,MSL2,UTAU,MSNT2
COMMON/SFERM1SPEC/MSU2,MSD2,MSE2,MSNE2,MSMU2,UMU
COMMON/SLEPPAR/MSL3,MSE3,MSL1,MSE1,ATAU,AMU
COMMON/SQUHIMASSM/MH02,MHC2
COMMON/HISPEC/MHC,XC,MH0,XH,MA2
COMMON/EFFPOTPAR/lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
COMMON/Z3VPOT/Rm3,Im3,RAudt,IAudt,RxS,IxS,Rmsp,Imsp,RAst,IAst,
. RlPMt,IlPMt,RlM,IlM,RAqs,IAqs,Rltqs,Iltqs
COMMON/MH2TREE/MHuS,MHdS,MSS
COMMON/IMALAK/IAL,IAK,IXIS
PI=4d0*DATAN(1d0)
c A: Corrections to the neutral mass-matrix / 3rd generation
c I - Tops/Stops
c a) Tops
aux=4.d0*Ytq**4*vuq**2*dlog(mtopq**2/QSTSB)
MH02(1,1)=MH02(1,1)-3.d0/16.d0/Pi**2*aux
c b) Stops
DO I=1,5
dTdh(I)=0.d0
dRdh(I)=0.d0
DO J=1,5
Rhh(I,J)=0.d0
ENDDO
ENDDO
R2=(MSQ3-MSU3+(5.d0/3.d0*g1q-g2q)/4.d0*
. (vuq**2-vdq**2))**2+4.d0*Ytq**2*(At**2*vuq**2
. +muq**2*vdq**2-2.d0*muq*At*vuq*vdq*DDCOS(PhiAt+Phi01))
dTdh(1)=4.d0*(Ytq**2-(g1q+g2q)/8.d0)*vuq
dTdh(2)=(g1q+g2q)/2.d0*vdq
dRdh(1)=8.d0*Ytq**2*At*(vuq*At-muq*vdq*DDCOS(PhiAt+Phi01))
. +(5.d0/3.d0*g1q-g2q)*vuq*
. (MSQ3-MSU3+(5.d0/3.d0*g1q-g2q)/4.d0*(vuq**2-vdq**2))
dRdh(2)=8.d0*Ytq**2*muq*(vdq*muq-At*vuq*DDCOS(PhiAt+Phi01))
. -(5.d0/3.d0*g1q-g2q)*vdq*
. (MSQ3-MSU3+(5.d0/3.d0*g1q-g2q)/4.d0*(vuq**2-vdq**2))
dRdh(3)=-8.d0*Ytq**2*l*vdq*(At*vuq*DDCOS(PhiAt+Phi01)-muq*vdq)
dRdh(4)=8.d0*Ytq**2*muq*dsqrt(vu**2+vd**2)*At*DDSIN(PhiAt+Phi01)
dRdh(5)=8.d0*Ytq**2*l*vuq*vdq*At*DDSIN(PhiAt+Phi01)
Rhh(1,1)=4.d0*(((5.d0/3.d0*g1q-g2q)/4.d0*vuq)**2
. +Ytq**2*muq*At*vdq/vuq*DDCOS(PhiAt+Phi01))
Rhh(2,2)=4.d0*((5.d0/3.d0*g1q-g2q)/4.d0*vdq)**2
. +4.d0*Ytq**2*muq*At*vuq/vdq*DDCOS(PhiAt+Phi01)
Rhh(1,2)=-4.d0*(((5.d0/3.d0*g1q-g2q)/4.d0)**2*vuq*vdq
. +Ytq**2*muq*At*DDCOS(PhiAt+Phi01))
Rhh(2,1)=Rhh(1,2)
Rhh(3,3)=4.d0*Ytq**2*l**2/muq*vuq*vdq*At*DDCOS(PhiAt+Phi01)
Rhh(1,3)=-4.d0*Ytq**2*l*vdq*At*DDCOS(PhiAt+Phi01)
Rhh(3,1)=Rhh(1,3)
Rhh(2,3)=4.d0*Ytq**2*l*(2.d0*muq*vdq-vuq*At*DDCOS(PhiAt+Phi01))
Rhh(3,2)=Rhh(2,3)
Rhh(4,4)=4.d0*Ytq**2*muq*At*DDCOS(PhiAt+Phi01)
. /vdq/vuq*(vu**2+vd**2)
Rhh(5,5)=4.d0*Ytq**2*l**2/muq*vdq*vuq*At*DDCOS(PhiAt+Phi01)
Rhh(4,5)=4.d0*Ytq**2*l*At*DDCOS(PhiAt+Phi01)*dsqrt(vu**2+vd**2)
Rhh(5,4)=Rhh(4,5)
DO I=1,5
DO J=I,5
aux=2.d0*Rhh(I,J)*Fsf1(MST2(1),MST2(2),QSTSB)
. +dTdh(I)*dTdh(J)*dlog(MST2(1)*MST2(2)/QSTSB**2)
. +(dTdh(I)*dRdh(J)+dTdh(J)*dRdh(I))/2.d0
. *dlog(MST2(2)/MST2(1))/dsqrt(R2)
. +dRdh(I)*dRdh(J)*Fsf2(MST2(1),MST2(2),QSTSB)/(4.d0*R2)
MH02(I,J)=MH02(I,J)+3.d0/128.d0/Pi**2*aux
MH02(J,I)=MH02(I,J)
ENDDO
ENDDO
c II- Bottoms/Sbottoms
c a) Bottoms
aux=4.d0*Ybq**4*vdq**2*dlog(mbotq**2/QSTSB)
MH02(2,2)=MH02(2,2)-3.d0/16.d0/Pi**2*aux
c b) Sbottoms
DO I=1,5
dTdh(I)=0.d0
dRdh(I)=0.d0
DO J=1,5
Rhh(I,J)=0.d0
ENDDO
ENDDO
R2=(MSQ3-MSD3+(-1.d0/3.d0*g1q+g2q)/4.d0*
. (vuq**2-vdq**2))**2+4.d0*Ybq**2*(Ab**2*vdq**2+muq**2*vuq**2
. -2.d0*muq*Ab*vuq*vdq*DDCOS(PhiAb+Phi01))
dTdh(1)=(g1q+g2q)/2.d0*vuq
dTdh(2)=4.d0*(Ybq**2-(g1q+g2q)/8.d0)*vdq
dRdh(1)=8.d0*Ybq**2*(vuq*muq**2-muq*Ab*vdq*DDCOS(PhiAb+Phi01))
. +(-1.d0/3.d0*g1q+g2q)*vuq*
. (MSQ3-MSD3+(-1.d0/3.d0*g1q+g2q)/4.d0*(vuq**2-vdq**2))
dRdh(2)=8.d0*Ybq**2*(vdq*Ab**2-muq*Ab*vuq*DDCOS(PhiAb+Phi01))
. -(-1.d0/3.d0*g1q+g2q)*vdq*
. (MSQ3-MSD3+(-1.d0/3.d0*g1q+g2q)/4.d0*(vuq**2-vdq**2))
dRdh(3)=8.d0*Ybq**2*l
. *(muq*vuq**2-Ab*vuq*vdq*DDCOS(PhiAb+Phi01))
dRdh(4)=8.d0*Ybq**2*muq*Ab*DDSIN(PhiAb+Phi01)*dsqrt(vu**2+vd**2)
dRdh(5)=8.d0*Ybq**2*l*vuq*vdq*Ab*DDSIN(PhiAb+Phi01)
Rhh(1,1)=4.d0*(((-1.d0/3.d0*g1q+g2q)/4.d0*vuq)**2
. +Ybq**2*muq*Ab*vdq/vuq*DDCOS(PhiAb+Phi01))
Rhh(2,2)=4.d0*(((-1.d0/3.d0*g1q+g2q)/4.d0*vdq)**2
. +Ybq**2*muq*Ab*vuq/vdq*DDCOS(PhiAb+Phi01))
Rhh(1,2)=-4.d0*(((-1.d0/3.d0*g1q+g2q)/4.d0)**2*vuq*vdq
. +Ybq**2*muq*Ab*DDCOS(PhiAb+Phi01))
Rhh(2,1)=Rhh(1,2)
Rhh(3,3)=4.d0*Ybq**2*l**2/muq*vuq*vdq*Ab*DDCOS(PhiAb+Phi01)
Rhh(1,3)=4.d0*Ybq**2*l*(2.d0*muq*vuq-vdq*Ab*DDCOS(PhiAb+Phi01))
Rhh(3,1)=Rhh(1,3)
Rhh(2,3)=-4.d0*Ybq**2*l*vuq*Ab*DDCOS(PhiAb+Phi01)
Rhh(3,2)=Rhh(2,3)
Rhh(4,4)=4.d0*Ybq**2*muq*Ab*DDCOS(PhiAb+Phi01)
. /vdq/vuq*(vu**2+vd**2)
Rhh(5,5)=4.d0*Ybq**2*l**2/muq*vdq*vuq*Ab*DDCOS(PhiAb+Phi01)
Rhh(4,5)=4.d0*Ybq**2*l*Ab*DDCOS(PhiAb+Phi01)*dsqrt(vu**2+vd**2)
Rhh(5,4)=Rhh(4,5)
DO I=1,5
DO J=I,5
aux=2.d0*Rhh(I,J)*Fsf1(MSB2(1),MSB2(2),QSTSB)
. +dTdh(I)*dTdh(J)*dlog(MSB2(1)*MSB2(2)/QSTSB**2)
. +(dTdh(I)*dRdh(J)+dTdh(J)*dRdh(I))/2.d0
. *dlog(MSB2(2)/MSB2(1))/dsqrt(R2)
. +dRdh(I)*dRdh(J)*Fsf2(MSB2(1),MSB2(2),QSTSB)/(4.d0*R2)
MH02(I,J)=MH02(I,J)+3.d0/128.d0/Pi**2*aux
MH02(J,I)=MH02(I,J)
ENDDO
ENDDO
c III- Taus/Staus
Ytau=mtau/vdq
c a) Taus
aux=4.d0*Ytau**4*vdq**2*dlog(mtau**2/QSTSB)
MH02(2,2)=MH02(2,2)-1.d0/16.d0/Pi**2*aux
c b) Staus
DO I=1,5
dTdh(I)=0.d0
dRdh(I)=0.d0
DO J=1,5
Rhh(I,J)=0.d0
ENDDO
ENDDO
R2=(MSL3-MSE3+(-3.d0*g1q+g2q)/4.d0*(vuq**2-vdq**2)
. )**2+4.d0*Ytau**2*(Atau**2*vdq**2+muq**2*vuq**2
. -2.d0*muq*Atau*vuq*vdq*DDCOS(PhiAtau+Phi01))
dTdh(1)=(g1q+g2q)/2.d0*vuq
dTdh(2)=4.d0*(Ytau**2-(g1q+g2q)/8.d0)*vdq
dRdh(1)=8.d0*Ytau**2*(vuq*muq**2-muq*Atau*vdq*
. DDCOS(PhiAtau+Phi01))+vuq*(-3.d0*g1q+g2q)*
. (MSL3-MSE3+(-3.d0*g1q+g2q)/4.d0*(vuq**2-vdq**2))
dRdh(2)=8.d0*Ytau**2*(Atau**2*vdq-muq*Atau*vuq*
. DDCOS(PhiAtau+Phi01))-vdq*(-3.d0*g1q+g2q)*
. (MSL3-MSE3+(-3.d0*g1q+g2q)/4.d0*(vuq**2-vdq**2))
dRdh(3)=8.d0*Ytau**2*l*(muq*vuq**2-Atau*vuq*vdq*
. DDCOS(PhiAtau+Phi01))
dRdh(4)=8.d0*Ytau**2*muq*Atau*DDSIN(PhiAtau+Phi01)
. *dsqrt(vu**2+vd**2)
dRdh(5)=8.d0*Ytau**2*l*vuq*vdq*Atau*DDSIN(PhiAtau+Phi01)
Rhh(1,1)=4.d0*(((-3.d0*g1q+g2q)/4.d0*vuq)**2
. +Ytau**2*muq*Atau*vdq/vuq*DDCOS(PhiAtau+Phi01))
Rhh(2,2)=4.d0*(((-3.d0*g1q+g2q)/4.d0*vdq)**2
. +Ytau**2*muq*Atau*vuq/vdq*DDCOS(PhiAtau+Phi01))
Rhh(1,2)=-4.d0*(((-3.d0*g1q+g2q)/4.d0)**2*vuq*vdq
. +Ytau**2*muq*Atau*DDCOS(PhiAtau+Phi01))
Rhh(2,1)=Rhh(1,2)
Rhh(3,3)=4.d0*Ytau**2*l**2/muq*vuq*vdq*Atau*DDCOS(PhiAtau+Phi01)
Rhh(1,3)=4.d0*Ytau**2*l*(2.d0*muq*vuq-vdq*Atau*
. DDCOS(PhiAtau+Phi01))
Rhh(3,1)=Rhh(1,3)
Rhh(2,3)=-4.d0*Ytau**2*l*vuq*Atau*DDCOS(PhiAtau+Phi01)
Rhh(3,2)=Rhh(2,3)
Rhh(4,4)=4.d0*Ytau**2*muq*Atau*DDCOS(PhiAtau+Phi01)
. /vdq/vuq*(vu**2+vd**2)
Rhh(5,5)=4.d0*Ytau**2*l**2/muq*vdq*vuq*Atau
. *DDCOS(PhiAtau+Phi01)
Rhh(4,5)=4.d0*Ytau**2*l*Atau*DDCOS(PhiAtau+Phi01)
. *dsqrt(vu**2+vd**2)
Rhh(5,4)=Rhh(4,5)
DO I=1,5
DO J=I,5
aux=2.d0*Rhh(I,J)*Fsf1(MSL2(1),MSL2(2),QSTSB)
. +dTdh(I)*dTdh(J)*dlog(MSL2(1)*MSL2(2)/QSTSB**2)
. +(dTdh(I)*dRdh(J)+dTdh(J)*dRdh(I))/2.d0
. *dlog(MSL2(2)/MSL2(1))/dsqrt(R2)
. +dRdh(I)*dRdh(J)*Fsf2(MSL2(1),MSL2(2),QSTSB)/(4.d0*R2)
MH02(I,J)=MH02(I,J)+1.d0/128.d0/Pi**2*aux
MH02(J,I)=MH02(I,J)
ENDDO
ENDDO
c IV- Sneutrinos
aux=1.d0/32.d0/Pi**2*((-g1q-g2q)/2.d0)**2*dlog(MSNT2/QSTSB)
MH02(1,1)=MH02(1,1)+aux*vuq**2
MH02(2,2)=MH02(2,2)+aux*vdq**2
MH02(1,2)=MH02(1,2)-aux*vuq*vdq
MH02(2,1)=MH02(1,2)
c B: Corrections to the eff. parameters /3rd generation
c I- Stops/Sbottoms
lu=lu+6.d0/32.d0/Pi**2*(
. (Ytq**2-g1q/3.d0)**2*dlog(MSU3/QSTSB)
. +(g1q/6.d0)**2*dlog(MSD3/QSTSB)
. +(Ytq**4+Ytq**2/2.d0*(g1q/3.d0-g2q)+2.d0*(g1q/12.d0)**2
. +2.d0*(g2q/4.d0)**2)*dlog(MSQ3/QSTSB)
. +2.d0*Ytq**2*AT**2*(Ytq**2-g1q/3.d0)*Fsf3(MSQ3,MSU3)
. +2.d0*Ybq**2*g1q/6.d0*muq**2*Fsf3(MSQ3,MSD3)
. +2.d0*Ytq**2*AT**2*(Ytq**2+g1q/12.d0-g2q/4.d0)
. *Fsf3(MSU3,MSQ3)
. +2.d0*Ybq**2*(g1q/3.d0+g2q)/4.d0*muq**2*Fsf3(MSD3,MSQ3)
. +(Ytq*AT)**4*Fsf7(MSQ3,MSU3)+(Ybq*muq)**4*Fsf7(MSQ3,MSD3))
ld=ld+6.d0/32.d0/Pi**2*
. ((g1q/3.d0)**2*dlog(MSU3/QSTSB)
. +(Ybq**2-g1q/6.d0)**2*dlog(MSD3/QSTSB)
. +(Ybq**4-Ybq**2/2.d0*(g1q/3.d0+g2q)+2.d0*(g1q/12.d0)**2
. +2.d0*(g2q/4.d0)**2)*dlog(MSQ3/QSTSB)
. +2.d0*Ytq**2*g1q/3.d0*muq**2*Fsf3(MSQ3,MSU3)
. +2.d0*Ybq**2*(Ybq**2-g1q/6.d0)*Ab**2*Fsf3(MSQ3,MSD3)
. -2.d0*Ytq**2*(g1q/3.d0-g2q)/4.d0*muq**2*Fsf3(MSU3,MSQ3)
. +2.d0*Ybq**2*(Ybq**2-g1q/12.d0-g2q/4.d0)*Ab**2
. *Fsf3(MSD3,MSQ3)
. +(Ytq*muq)**4*Fsf7(MSQ3,MSU3)+(Ybq*AB)**4*Fsf7(MSQ3,MSD3))
l3=l3+6.d0/32.d0/Pi**2*
. ((Ytq**2-g1q/3.d0)*g1q/3.d0*dlog(MSU3/QSTSB)
. +(Ybq**2-g1q/6.d0)*g1q/6.d0*dlog(MSD3/QSTSB)
. +(Ytq**2*Ybq**2-Ytq**2/4.d0*(g1q/3.d0+g2q)+Ybq**2/4.d0
. *(g1q/3.d0-g2q)-2.d0*(g1q/12.d0)**2
. +2.d0*(g2q/4.d0)**2)*dlog(MSQ3/QSTSB)
. +Ytq**2*((Ytq**2-g1q/3.d0)*muq**2+g1q/3.d0*At**2)
. *Fsf3(MSQ3,MSU3)
. +Ybq**2*((Ybq**2-g1q/6.d0)*muq**2+g1q/6.d0*Ab**2)
. *Fsf3(MSQ3,MSD3)
. +Ytq**2*((Ybq**2-g1q/12.d0-g2q/4.d0)*At**2
. +(g1q/3.d0+g2q)/4.d0*muq**2)*Fsf3(MSU3,MSQ3)
. +Ybq**2*((Ytq**2+g1q/12.d0-g2q/4.d0)*Ab**2-(g1q/3.d0-g2q)
. *muq**2/4.d0)*Fsf3(MSD3,MSQ3)
. +Ytq**2*Ybq**2*Fsf1(MSU3,MSD3,QSTSB)
. +2.d0*Ytq**2*Ybq**2*(At*Ab*DDCOS(PhiAt-PhiAb)-muq**2)
. *Fsf5(MSU3,MSD3,MSQ3)+Ytq**4*At**2*muq**2*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab**2*muq**2*Fsf7(MSQ3,MSD3)+Ytq**2*Ybq**2*
. (At**2*Ab**2-2.d0*At*Ab*muq**2*DDCOS(PhiAt-PhiAb)+muq**4)
. *Fsf6(MSU3,MSD3,MSQ3))
l4=l4+6.d0/32.d0/Pi**2*
. (-(Ytq**2-g2q/2.d0)*(Ybq**2-g2q/2.d0)*dlog(MSQ3/QSTSB)
. +Ytq**2*((Ytq**2-g2q/2.d0)*muq**2-(Ybq**2-g2q/2.d0)*At**2)
. *Fsf3(MSU3,MSQ3)
. +Ybq**2*((Ybq**2-g2q/2.d0)*muq**2-(Ytq**2-g2q/2.d0)*Ab**2)
. *Fsf3(MSD3,MSQ3)
. -Ytq**2*Ybq**2*Fsf1(MSU3,MSD3,QSTSB)
. -2.d0*Ytq**2*Ybq**2*(At*Ab*DDCOS(PhiAt-PhiAb)-muq**2)
. *Fsf5(MSU3,MSD3,MSQ3)+Ytq**4*At**2*muq**2*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab**2*muq**2*Fsf7(MSQ3,MSD3)-Ytq**2*Ybq**2*
. (At**2*Ab**2-2.d0*At*Ab*muq**2*DDCOS(PhiAt-PhiAb)+muq**4)
. *Fsf6(MSU3,MSD3,MSQ3))
Rel5=Rel5+6.d0/32.d0/Pi**2*muq**2*
. (Ytq**4*At**2*DDCOS(2.d0*(PhiAt+Phi01))*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab**2*DDCOS(2.d0*(PhiAb+Phi01))*Fsf7(MSQ3,MSD3))
Iml5=Iml5+6/32.d0/Pi**2*muq**2*
. (Ytq**4*At**2*DDSIN(2.d0*(PhiAt+Phi01))*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab**2*DDSIN(2.d0*(PhiAb+Phi01))*Fsf7(MSQ3,MSD3))
Rel6=Rel6+6.d0/32.d0/Pi**2*muq*
. (Ytq**2*At*(Ytq**2-g1q/3.d0)*DDCOS(PhiAt+Phi01)
. *Fsf3(MSQ3,MSU3)
. +Ybq**2*Ab*g1q/6.d0*DDCOS(PhiAb+Phi01)*Fsf3(MSQ3,MSD3)
. +Ytq**2*At*(Ytq**2+g1q/12.d0-g2q/4.d0)*DDCOS(PhiAt+Phi01)
. *Fsf3(MSU3,MSQ3)
. +Ybq**2*Ab*(g1q/3.d0+g2q)/4.d0*DDCOS(PhiAb+Phi01)
. *Fsf3(MSD3,MSQ3)
. +Ytq**4*At**3*DDCOS(PhiAt+Phi01)*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab*muq**2*DDCOS(PhiAb+Phi01)*Fsf7(MSQ3,MSD3))
Iml6=Iml6+6.d0/32.d0/Pi**2*muq*
. (Ytq**2*At*(Ytq**2-g1q/3.d0)*DDSIN(PhiAt+Phi01)
. *Fsf3(MSQ3,MSU3)
. +Ybq**2*Ab*g1q/6.d0*DDSIN(PhiAb+Phi01)*Fsf3(MSQ3,MSD3)
. +Ytq**2*At*(Ytq**2+g1q/12.d0-g2q/4.d0)*DDSIN(PhiAt+Phi01)
. *Fsf3(MSU3,MSQ3)
. +Ybq**2*Ab*(g1q/3.d0+g2q)/4.d0*DDSIN(PhiAb+Phi01)
. *Fsf3(MSD3,MSQ3)
. +Ytq**4*At**3*DDSIN(PhiAt+Phi01)*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab*muq**2*DDSIN(PhiAb+Phi01)*Fsf7(MSQ3,MSD3))
Rel7=Rel7+6.d0/32.d0/Pi**2*muq*
. (Ytq**2*At*g1q/3.d0*DDCOS(PhiAt+Phi01)*Fsf3(MSQ3,MSU3)
. +Ybq**2*Ab*(Ybq**2-g1q/6.d0)*DDCOS(PhiAb+Phi01)
. *Fsf3(MSQ3,MSD3)
. -Ytq**2*At*(g1q/3.d0-g2q)/4.d0*DDCOS(PhiAt+Phi01)
. *Fsf3(MSU3,MSQ3)
. +Ybq**2*Ab*(Ybq**2-g1q/12.d0-g2q/4.d0)*DDCOS(PhiAb+Phi01)
. *Fsf3(MSD3,MSQ3)
. +Ytq**4*At*muq**2*DDCOS(PhiAt+Phi01)*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab**3*DDCOS(PhiAb+Phi01)*Fsf7(MSQ3,MSD3))
Iml7=Iml7+6.d0/32.d0/Pi**2*muq*
. (Ytq**2*At*g1q/3.d0*DDSIN(PhiAt+Phi01)*Fsf3(MSQ3,MSU3)
. +Ybq**2*Ab*(Ybq**2-g1q/6.d0)*DDSIN(PhiAb+Phi01)
. *Fsf3(MSQ3,MSD3)
. -Ytq**2*At*(g1q/3.d0-g2q)/4.d0*DDSIN(PhiAt+Phi01)
. *Fsf3(MSU3,MSQ3)
. +Ybq**2*Ab*(Ybq**2-g1q/12.d0-g2q/4.d0)*DDSIN(PhiAb+Phi01)
. *Fsf3(MSD3,MSQ3)
. +Ytq**4*At*muq**2*DDSIN(PhiAt+Phi01)*Fsf7(MSQ3,MSU3)
. +Ybq**4*Ab**3*DDSIN(PhiAb+Phi01)*Fsf7(MSQ3,MSD3))
RAud=RAud+6.d0*l/32.d0/Pi**2*
. (Ytq**2*At*DDCOS(PhiAt+Phi01)*Fsf1(MSQ3,MSU3,QSTSB)
. +Ybq**2*Ab*DDCOS(PhiAb+Phi01)*Fsf1(MSQ3,MSD3,QSTSB))
lPu=lPu+6.d0/32.d0/Pi**2*Ybq**2*l**2*Fsf1(MSQ3,MSU3,QSTSB)
lPd=lPd+6.d0/32.d0/Pi**2*Ytq**2*l**2*Fsf1(MSQ3,MSU3,QSTSB)
s=muq/l
c II- Staus/Sneutrinos
lu=lu+2.d0/32.d0/Pi**2*(
. (g1q/2.d0)**2*dlog(MSE3/QSTSB)
. +2.d0*((g1q/4.d0)**2+(g2q/4.d0)**2)*dlog(MSL3/QSTSB)
. +2.d0*Ytau**2*g1q/2.d0*muq**2*Fsf3(MSL3,MSE3)
. +2.d0*Ytau**2*(-g1q+g2q)/4.d0*muq**2*Fsf3(MSE3,MSL3)
. +(Ytau*muq)**4*Fsf7(MSL3,MSE3))
ld=ld+2.d0/32.d0/Pi**2*(
. (Ytau**2-g1q/2.d0)**2*dlog(MSE3/QSTSB)
. +(Ytau**4+Ytau**2/2.d0*(g1q-g2q)+2.d0*(g1q/4.d0)**2
. +2.d0*(g2q/4.d0)**2)*dlog(MSL3/QSTSB)
. +2.d0*Ytau**2*(Ytau**2-g1q/2.d0)*Atau**2*Fsf3(MSL3,MSE3)
. +2.d0*Ytau**2*(Ytau**2+g1q/4.d0-g2q/4.d0)*Atau**2
. *Fsf3(MSE3,MSL3)
. +(Ytau*Atau)**4*Fsf7(MSL3,MSE3))
l3=l3+2.d0/32.d0/Pi**2*(
. (Ytau**2-g1q/2.d0)*g1q/2.d0*dlog(MSE3/QSTSB)
. -(Ytau**2+g1q/2.d0-g2q/2.d0)/4.d0*(g1q+g2q)*dlog(MSL3/QSTSB)
. +Ytau**2*((Ytau**2-g1q/2.d0)*muq**2+g1q/2.d0*Atau**2)
. *Fsf3(MSL3,MSE3)
. +Ytau**2*(g1q+g2q)/4.d0*(muq**2-Atau**2)
. *Fsf3(MSE3,MSL3)
. +Ytau**4*Atau**2*muq**2*Fsf7(MSL3,MSE3))
l4=l4+2.d0/32.d0/Pi**2*(
. g2q/2.d0*(Ytau**2-g2q/2.d0)*dlog(MSL3/QSTSB)
. +Ytau**2*((Ytau**2-g2q/2.d0)*muq**2+g2q/2.d0*Atau**2)
. *Fsf3(MSE3,MSL3)
. +Ytau**4*Atau**2*muq**2*Fsf7(MSL3,MSE3))
Rel5=Rel5+2.d0/32.d0/Pi**2*muq**2*Ytau**4*Atau**2
. *DDCOS(2.d0*(PhiAtau+Phi01))*Fsf7(MSL3,MSE3)
Iml5=Iml5+2.d0/32.d0/Pi**2*muq**2*Ytau**4*Atau**2
. *DDSIN(2.d0*(PhiAtau+Phi01))*Fsf7(MSL3,MSE3)
Rel6=Rel6+2.d0/32.d0/Pi**2*muq*Ytau**2*Atau*
. DDCOS(PhiAtau+Phi01)*(g1q/2.d0*Fsf3(MSL3,MSE3)
. +(-g1q+g2q)/4.d0*Fsf3(MSE3,MSL3)
. +Ytau**2*muq**2*Fsf7(MSL3,MSE3))
Iml6=Iml6+2.d0/32.d0/Pi**2*muq*Ytau**2*Atau*
. DDSIN(PhiAtau+Phi01)*(g1q/2.d0*Fsf3(MSL3,MSE3)
. +(-g1q+g2q)/4.d0*Fsf3(MSE3,MSL3)
. +Ytau**2*muq**2*Fsf7(MSL3,MSE3))
Rel7=Rel7+2.d0/32.d0/Pi**2*muq*Ytau**2*Atau*
. DDCOS(PhiAtau+Phi01)*((Ytau**2-g1q/2.d0)*Fsf3(MSL3,MSE3)
. +(Ytau**2+g1q/4.d0-g2q/4.d0)*Fsf3(MSE3,MSL3)
. +Ytau**2*Atau**2*Fsf7(MSL3,MSE3))
Iml7=Iml7+2.d0/32.d0/Pi**2*muq*Ytau**2*Atau*
. DDSIN(PhiAtau+Phi01)*((Ytau**2-g1q/2.d0)*Fsf3(MSL3,MSE3)
. +(Ytau**2+g1q/4.d0-g2q/4.d0)*Fsf3(MSE3,MSL3)
. +Ytau**2*Atau**2*Fsf7(MSL3,MSE3))
RAud=RAud+2.d0*l*Ytau**2*Atau/32.d0/Pi**2*
. DDCOS(PhiAtau+Phi01)*Fsf1(MSL3,MSE3,QSTSB)
lPu=lPu+2.d0/32.d0/Pi**2*l**2*Ytau**2*Fsf1(MSL3,MSE3,QSTSB)
c Minimization conditions
MHuS=MHuS
. +3d0*mtopq**4/vuq**2*(dlog(mtopq**2/QSTSB)-1d0)/8d0/Pi**2
. -(3d0*(Ytq**2-(g1q+g2q)/8d0)
. *(MST2(1)*(dlog(MST2(1)/QSTSB)-1d0)
. +MST2(2)*(dlog(MST2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MST2(1),MST2(2),QSTSB)
. *(Ytq**2*AT*(AT-muq*vdq/vuq*DDCOS(PhiAT+Phi01))
. +(5d0/3d0*g1q-g2q)/8d0
. *(MSQ3-MSU3+(5d0/3d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. +3d0*(g1q+g2q)/8d0
. *(MSB2(1)*(dlog(MSB2(1)/QSTSB)-1d0)
. +MSB2(2)*(dlog(MSB2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MSB2(1),MSB2(2),QSTSB)
. *(Ybq**2*muq*(muq-AB*vdq/vuq*DDCOS(PhiAB+Phi01))
. +(g1q/3+g2q)/8d0
. *(MSQ3-MSD3-(g1q/3d0+g2q)/4d0*(vuq**2-vdq**2)))
. +(g1q+g2q)/8d0
. *(MSL2(1)*(dlog(MSL2(1)/QSTSB)-1d0)
. +MSL2(2)*(dlog(MSL2(2)/QSTSB)-1d0))
. +Fsf1(MSL2(1),MSL2(2),QSTSB)
. *((mtau/vd)**2*muq*(muq-ATAU*vdq/vuq*DDCOS(PhiATAU+Phi01))
. +(2d0*g1q-g2q)/8d0
. *(MSL3-MSE3-(2d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. -(g1q+g2q)/8d0*MSNT2*(dlog(MSNT2/QSTSB)-1d0))/16d0/Pi**2
MHdS=MHdS
. +(3d0*mbotq**4/vdq**2*(dlog(mbotq**2/QSTSB)-1d0)
. +(mtau/vd)**4*vdq**2*(dlog(mtau**2/QSTSB)-1d0))/8d0/Pi**2
. -(3d0*(g1q+g2q)/8d0
. *(MST2(1)*(dlog(MST2(1)/QSTSB)-1d0)
. +MST2(2)*(dlog(MST2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MST2(1),MST2(2),QSTSB)
. *(Ytq**2*muq*(muq-AT*vuq/vdq*DDCOS(PhiAT+Phi01))
. -(5d0/3d0*g1q-g2q)/8d0
. *(MSQ3-MSU3+(5d0/3d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. +3d0*(Ybq**2-(g1q+g2q)/8d0)
. *(MSB2(1)*(dlog(MSB2(1)/QSTSB)-1d0)
. +MSB2(2)*(dlog(MSB2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MSB2(1),MSB2(2),QSTSB)
. *(Ybq**2*AB*(AB-muq*vuq/vdq*DDCOS(PhiAB+Phi01))
. -(g1q/3+g2q)/8d0
. *(MSQ3-MSD3-(g1q/3d0+g2q)/4d0*(vuq**2-vdq**2)))
. +((mtau/vd)**2-(g1q+g2q)/8d0)
. *(MSL2(1)*(dlog(MSL2(1)/QSTSB)-1d0)
. +MSL2(2)*(dlog(MSL2(2)/QSTSB)-1d0))
. +Fsf1(MSL2(1),MSL2(2),QSTSB)
. *((mtau/vd)**2*ATAU*(ATAU-muq*vuq/vdq*DDCOS(PhiATAU+Phi01))
. -(2d0*g1q-g2q)/8d0
. *(MSL3-MSE3-(2d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. +(g1q+g2q)/8d0*MSNT2*(dlog(MSNT2/QSTSB)-1d0))/16d0/Pi**2
MSS=MSS
. -(3d0*Fsf1(MST2(1),MST2(2),QSTSB)
. *Ytq**2*l**2*vdq*(vdq-AT*vuq/muq)
. +3d0*Fsf1(MSB2(1),MSB2(2),QSTSB)
. *Ybq**2*l**2*vuq*(vuq-AB*vdq/muq*DDCOS(PhiAB+Phi01))
. +Fsf1(MSL2(1),MSL2(2),QSTSB)
. *(mtau/vd)**2*l**2*vuq
. *(vuq-ATAU*vdq/muq*DDCOS(PhiATAU+Phi01)))/16d0/Pi**2
IAl=IAl
. -(3d0*Fsf1(MST2(1),MST2(2),QSTSB)
. *Ytq**2*AT*DDSIN(PhiAT+Phi01)
. +3d0*Fsf1(MSB2(1),MSB2(2),QSTSB)
. *Ybq**2*AB*DDSIN(PhiAB+Phi01)
. +Fsf1(MSL2(1),MSL2(2),QSTSB)
. *(mtau/vd)**2*ATAU*DDSIN(PhiATAU+Phi01))/16d0/Pi**2
c C: Corrections to the neutral mass-matrix / 1st & 2nd generations
aux=2.d0/32.d0/Pi**2*(
. 3.d0*((g1q/3.d0-g2q)/2.d0)**2*dlog(MSU2(1)/QSTSB)
. +3.d0*((-4.d0*g1q/3.d0)/2.d0)**2*dlog(MSU2(2)/QSTSB)
. +3.d0*((g1q/3.d0+g2q)/2.d0)**2*dlog(MSD2(1)/QSTSB)
. +3.d0*((2.d0*g1q/3.d0)/2.d0)**2*dlog(MSD2(2)/QSTSB)
. +((-g1q+g2q)/2.d0)**2*dlog(MSE2(1)/QSTSB)
. +((2.d0*g1q)/2.d0)**2*dlog(MSE2(2)/QSTSB)
. +((-g1q-g2q)/2.d0)**2*dlog(MSNE2/QSTSB))
MH02(1,1)=MH02(1,1)+aux*vuq**2
MH02(2,2)=MH02(2,2)+aux*vdq**2
MH02(1,2)=MH02(1,2)-aux*vuq*vdq
MH02(2,1)=MH02(1,2)
c D: Corrections to the eff. parameters / 1st & 2nd generations
c I- Squarks
lu=lu+12.d0/32.d0/Pi**2*(
. (g1q/3.d0)**2*dlog(MSU1/QSTSB)
. +(g1q/6.d0)**2*dlog(MSD1/QSTSB)
. +2.d0*((g1q/12.d0)**2+(g2q/4.d0)**2)*dlog(MSQ1/QSTSB))
ld=ld+12.d0/32.d0/Pi**2*(
. (g1q/3.d0)**2*dlog(MSU1/QSTSB)
. +(g1q/6.d0)**2*dlog(MSD1/QSTSB)
. +2.d0*((g1q/12.d0)**2+(g2q/4.d0)**2)*dlog(MSQ1/QSTSB))
l3=l3+12.d0/32.d0/Pi**2*(
. -(g1q/3.d0)**2*dlog(MSU1/QSTSB)
. -(g1q/6.d0)**2*dlog(MSD1/QSTSB)
. +2.d0*(-(g1q/12.d0)**2+(g2q/4.d0)**2)*dlog(MSQ1/QSTSB))
l4=l4-12.d0/32.d0/Pi**2*(g2q/2.d0)**2*dlog(MSQ1/QSTSB)
! Rel5=Rel5+0.d0
! Iml5=Iml5+0.d0
! Rel6=Rel6+0.d0
! Iml6=Iml6+0.d0
! Rel7=Rel7+0.d0
! Iml7=Iml7+0.d0
! RAud=RAud+0.d0
c II- 2HDM parameters 1st/2nd gen sleptons
lu=lu+4.d0/32.d0/Pi**2*(
. (g1q/2.d0)**2*dlog(MSE1/QSTSB)
. +2.d0*((g1q/4.d0)**2+(g2q/4.d0)**2)*dlog(MSL1/QSTSB))
ld=ld+4.d0/32.d0/Pi**2*(
. (g1q/2.d0)**2*dlog(MSE1/QSTSB)
. +2.d0*((g1q/4.d0)**2+(g2q/4.d0)**2)*dlog(MSL1/QSTSB))
l3=l3+4.d0/32.d0/Pi**2*(
. -(g1q/2.d0)**2*dlog(MSE1/QSTSB)
. -2.d0*((g1q/4.d0)**2-(g2q/4.d0)**2)*dlog(MSL1/QSTSB))
l4=l4-4.d0/32.d0/Pi**2*(g2q/2.d0)**2*dlog(MSL1/QSTSB)
! Rel5=Rel5+0.d0
! Iml5=Iml5+0.d0
! Rel6=Rel6+0.d0
! Iml6=Iml6+0.d0
! Rel7=Rel7+0.d0
! Iml7=Iml7+0.d0
! RAud=RAud+0.d0
c Minimization conditions
MHuS=MHuS+2d0*
. (-3d0*(g1q+g2q)/8d0
. *(MSU2(1)*(dlog(MSU2(1)/QSTSB)-1d0)
. +MSU2(2)*(dlog(MSU2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MSU2(1),MSU2(2),QSTSB)
. *((5d0/3d0*g1q-g2q)/8d0
. *(MSQ1-MSU1+(5d0/3d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. +3d0*(g1q+g2q)/8d0
. *(MSD2(1)*(dlog(MSD2(1)/QSTSB)-1d0)
. +MSD2(2)*(dlog(MSD2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MSD2(1),MSD2(2),QSTSB)
. *((g1q/3+g2q)/8d0
. *(MSQ1-MSD1-(g1q/3d0+g2q)/4d0*(vuq**2-vdq**2)))
. +(g1q+g2q)/8d0
. *(MSE2(1)*(dlog(MSE2(1)/QSTSB)-1d0)
. +MSE2(2)*(dlog(MSE2(2)/QSTSB)-1d0))
. +Fsf1(MSE2(1),MSE2(2),QSTSB)
. *((2d0*g1q-g2q)/8d0
. *(MSL1-MSE1-(2d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. -(g1q+g2q)/8d0*MSNE2*(dlog(MSNE2/QSTSB)-1d0))/16d0/Pi**2
MHdS=MHdS+2d0*
. (-3d0*(g1q+g2q)/8d0
. *(MSU2(1)*(dlog(MSU2(1)/QSTSB)-1d0)
. +MSU2(2)*(dlog(MSU2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MSU2(1),MSU2(2),QSTSB)
. *(-(5d0/3d0*g1q-g2q)/8d0
. *(MSQ1-MSU1+(5d0/3d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. +3d0*(Ybq**2-(g1q+g2q)/8d0)
. *(MSD2(1)*(dlog(MSD2(1)/QSTSB)-1d0)
. +MSD2(2)*(dlog(MSD2(2)/QSTSB)-1d0))
. +3d0*Fsf1(MSD2(1),MSD2(2),QSTSB)
. *(-(g1q/3+g2q)/8d0
. *(MSQ1-MSD1-(g1q/3d0+g2q)/4d0*(vuq**2-vdq**2)))
. -(g1q+g2q)/8d0
. *(MSE2(1)*(dlog(MSE2(1)/QSTSB)-1d0)
. +MSE2(2)*(dlog(MSE2(2)/QSTSB)-1d0))
. +Fsf1(MSE2(1),MSE2(2),QSTSB)
. *(-(2d0*g1q-g2q)/8d0
. *(MSL1-MSE1-(2d0*g1q-g2q)/4d0*(vuq**2-vdq**2)))
. +(g1q+g2q)/8d0*MSNE2*(dlog(MSNE2/QSTSB)-1d0))/16d0/Pi**2
c E: Leading 2-loop corrections (Lead. Log Approx.)
aux=3.d0/256.d0/Pi**4*
. Ytq**4*((dlog(QSTSB/mtopq**2))**2
. *(64.d0*Pi*ALSQ+4.d0/3.d0*g1q-3.d0*sinb**2*Ytq**2
. +3.d0*cosb**2*Ybq**2)+
. ((dlog(MA2/mtopq**2))**2-(dlog(QSTSB/mtopq**2))**2)
. *(3.d0*cosb**2*Ytq**2+(3.d0*cosb**2+1.d0)*Ybq**2))
R2=3.d0/256.d0/Pi**4*
. Ybq**4*(dlog(QSTSB/mtopq**2)**2
. *(64.d0*Pi*ALSQ-2.d0/3.d0*g1q+3.d0*sinb**2*Ytq**2
. -3.d0*cosb**2*Ybq**2)+
. (dlog(MA2/mtopq**2)**2-dlog(QSTSB/mtopq**2)**2)
. *(3.d0*sinb**2*Ybq**2+(3.d0*sinb**2+1.d0)*Ytq**2))
MH02(1,1)=MH02(1,1)+2.d0*aux*vuq**2
MH02(2,2)=MH02(2,2)+2.d0*R2*vdq**2
lu=lu+aux
ld=ld+R2
c Minimization conditions
MHuS=MHuS-aux*vuq**2
MHdS=MHdS-R2*vdq**2
c s=muq/l
c print*,'MH02_1*',(RAud+RlPM*s)*s*vdq/vuq+2.d0*lu*vuq**2
c c +Rel7*vdq**3/vuq-3.d0*Rel6*vuq*vdq,
c c -(RAud+RlPM*s)*s+2.d0*(l3+l4+Rel5)*vuq*vdq
c c -3.d0*(Rel6*vuq**2+Rel7*vdq**2),
c c -(RAud+2.d0*RlPM*s)*vdq+2.d0*lPU*s*vuq,
c c (2.d0*Iml6*vuq-Iml5*vdq)*dsqrt(vu**2+vd**2),
c c (-Iml5*vuq*vdq+2.d0*Iml6*vuq**2-3.d0*IlPM*s**2)*vdq/s
c print*,'MH02_2*',-(RAud+RlPM*s)*s+2.d0*(l3+l4+Rel5)*vuq*vdq
c c -3.d0*(Rel6*vuq**2+Rel7*vdq**2),
c c (RAud+RlPM*s)*s*vuq/vdq+2.d0*ld*vdq**2+Rel6*vuq**3/vdq
c c -3.d0*Rel7*vdq*vuq,
c c -(RAud+2.d0*RlPM*s)*vuq+2.d0*lPD*s*vdq,
c c (2.d0*Iml7*vdq-Iml5*vuq)*dsqrt(vu**2+vd**2),
c c (-Iml5*vuq*vdq+2.d0*Iml7*vdq**2-3.d0*IlPM*s**2)*vuq/s
c print*,'MH02_3*',-(RAud+2.d0*RlPM*s)*vdq+2.d0*lPU*s*vuq,
c c -(RAud+2.d0*RlPM*s)*vuq+2.d0*lPD*s*vdq,
c c (RAs+4*K2*s)*s+RAud*vuq*vdq/s,
c c (IlPM*s**2-Iml5*vuq*vdq)*dsqrt(vu**2+vd**2)/s,
c c (4.d0*IlPM*s**2-Iml5*vuq*vdq)*vuq*vdq/s**2
c print*,'MH02_4*',(2.d0*Iml6*vuq-Iml5*vdq)*dsqrt(vu**2+vd**2),
c c (2.d0*Iml7*vdq-Iml5*vuq)*dsqrt(vu**2+vd**2),
c c (IlPM*s**2-Iml5*vuq*vdq)*dsqrt(vu**2+vd**2)/s,
c c ((RAud+RlPM*s)*s-2.d0*Rel5*vuq*vdq+Rel6*vuq**2+Rel7*vdq**2)
c c *(vu**2+vd**2)/vuq/vdq/(ZHu*ZHd),
c c (RAud-2.d0*RlPM*s)*dsqrt(vu**2+vd**2)/dsqrt(Zs*ZHu*ZHd)
c print*,'MH02_5*',(-Iml5*vuq*vdq+2.d0*Iml6*vuq**2
c c -3.d0*IlPM*s**2)*vdq/s,(-Iml5*vuq*vdq+2.d0*Iml7*vdq**2
c c -3.d0*IlPM*s**2)*vuq/s,(4.d0*IlPM*s**2-Iml5*vuq*vdq)
c c *vuq*vdq/s**2,(RAud-2.d0*RlPM*s)
c c *dsqrt(vu**2+vd**2),-3.d0*RAs*s+(RAud+4.d0*RlPM*s)*vu*vd/s
c F: Corrections to the charged-Higgs mass
aux=-3.d0*Ytq**2*Ybq**2*(vu**2+vd**2)/(8.d0*Pi**2)
. *Fsf1(mtopq**2,mbotq**2,QSTSB)
MHC2=(Rm3+(RAud+RAudt+(RlPM+RlPMt+RlM)*muq/l)*muq/l
. -(l4+Rel5)*vuq*vdq+Rel6*vuq**2+Rel7*vdq**2+aux)
. *(vu**2+vd**2)/vuq/vdq !/(ZHu*ZHd)
c print*,'MH02_1*',MH02(1,1),MH02(1,2),MH02(1,3),MH02(1,4),MH02(1,5)
c print*,'MH02_2*',MH02(2,1),MH02(2,2),MH02(2,3),MH02(2,4),MH02(2,5)
c print*,'MH02_3*',MH02(3,1),MH02(3,2),MH02(3,3),MH02(3,4),MH02(3,5)
c print*,'MH02_4*',MH02(4,1),MH02(4,2),MH02(4,3),MH02(4,4)
c c /(ZHu*ZHd),MH02(4,5)/dsqrt(Zs*ZHu*ZHd)
c print*,'MH02_5*',MH02(5,1),MH02(5,2),MH02(5,3),MH02(5,4),MH02(5,5)
c print*,'MHC2',MHC2 !/(ZHu*ZHd)
RETURN
END
DOUBLE PRECISION function Fsf1(x,y,z)
c ->Fsf1(m1^2,m2^2,Q^2)
IMPLICIT NONE
DOUBLE PRECISION x,y,z,aux
IF(min(x,y).ge.1.d-10)THEN
IF(dabs(x-y).ge.1.d-10)THEN
aux=(y*dlog(y/z)-x*dlog(x/z))/(y-x)-1.d0
ELSE
aux=dlog(x/z)
ENDIF
ELSEIF(min(x,y).le.1.d-10)THEN
aux=dlog(Max(x,y)/z)-1.d0
ENDIF
Fsf1=aux
RETURN
END
************************************************************************************************
SUBROUTINE MHIGGSLOOP_INOS_CPV(PAR)
c One-loop corrections to the Higgs potential
c - chargino + neutralino contribution
c - The one-loop corrections from charginos/neutralinos to the parameters
c of the effective Higgs potential are added and stored in the common
c EFFPOTPAR.
c - The corresponding corrections to the squared-mass matrices of the Higgs
c states are added and recorded in the common SQUHIMASSM.
IMPLICIT NONE
INTEGER I,J
DOUBLE PRECISION PAR(*)
DOUBLE PRECISION Pi,aux,Mbi2,Mwi2,Mhi2,Msi2
DOUBLE PRECISION fsf0,fsf1,fsf2,fsf3,fsf4,fsf5,fsf6,fsf7
DOUBLE PRECISION ludchi,l34chi,l4chi,Rel5chi,Iml5chi,Rel67chi,
. Iml67chi
DOUBLE PRECISION Rm3chi,Im3chi,RAudchi,RAudtchi,IAudtchi,RlPMchi,
. IlPMchi,RlPMtchi,IlPMtchi,RlMchi,IlMchi,RAqschi,IAqschi,Rltqschi,
. Iltqschi,lPqschi
DOUBLE PRECISION dM2dHs,RdAuddHs,IdAuddHs,RdlPMdHs,IdlPMdHs
DOUBLE PRECISION QSTSB
DOUBLE PRECISION ZHU,ZHD,ZS,vuq,vdq,TANBQ
DOUBLE PRECISION tanb,cosb,sinb,vu,vd
DOUBLE PRECISION G1Q,G2Q,GQ,ALSQ
DOUBLE PRECISION mur,M1r,M2r,msi
DOUBLE PRECISION phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
DOUBLE PRECISION l,k,Alcos1,Akcos2,muq,nuq
DOUBLE PRECISION MH02(5,5),MHC2
DOUBLE PRECISION lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
DOUBLE PRECISION XIF,XIS,MUP,MSP,M3H
DOUBLE PRECISION phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
DOUBLE PRECISION Rm3,Im3,RAudt,IAudt,RxS,IxS,Rmsp,Imsp,Ast,IAst
DOUBLE PRECISION RlPMt,IlPMt,RlM,IlM,RAqs,IAqs,Rltqs,Iltqs
DOUBLE PRECISION MHuS,MHdS,MSS
DOUBLE PRECISION IAL,IAK,IXIS
DOUBLE PRECISION DDCOS,DDSIN
COMMON/STSBSCALE/QSTSB
COMMON/QHIGGS/ZHU,ZHD,ZS,vuq,vdq,TANBQ
COMMON/TBPAR/tanb,cosb,sinb,vu,vd
COMMON/QGAUGE/G1Q,G2Q,GQ,ALSQ
COMMON/GAUGINOPAR/mur,M1r,M2r,msi
COMMON/PHASES/phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
COMMON/QPAR/l,k,Alcos1,Akcos2,muq,NUQ
COMMON/SQUHIMASSM/MH02,MHC2
COMMON/EFFPOTPAR/lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
COMMON/SUSYEXT/XIF,XIS,MUP,MSP,M3H
COMMON/Z3VAUX/phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
COMMON/Z3VPOT/Rm3,Im3,RAudt,IAudt,RxS,IxS,Rmsp,Imsp,Ast,IAst,
. RlPMt,IlPMt,RlM,IlM,RAqs,IAqs,Rltqs,Iltqs
COMMON/MH2TREE/MHuS,MHdS,MSS
COMMON/IMALAK/IAL,IAK,IXIS
PI=4d0*DATAN(1d0)
Mbi2=M1r**2
Mwi2=M2r**2
Mhi2=mur**2
Msi2=msi**2
c I- Pure singlet corrections
aux=4.d0*(2.d0*l*mur)**2*dlog(Mhi2/QSTSB)
. +(4d0*k*(mupsi*DDCOS(phi02-phip)+ks2si))**2*dlog(Msi2/QSTSB)
. -4d0*k*mupsi*DDCOS(Phi02-phiP)*l/muq*Msi2*(dlog(Msi2/QSTSB)-1d0)
MH02(3,3)=MH02(3,3)-1.d0/32.d0/Pi**2*aux
aux=(4d0*k*mupsi*DDSIN(phi02-phip))**2*dlog(Msi2/QSTSB)
. -4d0*k*mupsi*DDCOS(Phi02-phiP)*l/muq*Msi2*(dlog(Msi2/QSTSB)-1d0)
MH02(5,5)=MH02(5,5)-1.d0/32.d0/Pi**2*aux
IF(k.ne.0d0)then
aux=16d0*k**2*mupsi*DDSIN(Phi02-phiP)
. *(mupsi*DDCOS(phi02-phip)+ks2si)*dlog(Msi2/QSTSB)
. +4d0*k*mupsi*DDSIN(Phi02-phiP)*l/muq*Msi2*(dlog(Msi2/QSTSB)-1d0)
else
aux=0d0
endif
MH02(3,5)=MH02(3,5)-1.d0/32.d0/Pi**2*aux
MH02(5,3)=MH02(5,3)-1.d0/32.d0/Pi**2*aux
c Minimization conditions
MSS=MSS+(l*mur)**2*(dlog(Mhi2/QSTSB)-1d0)/4d0/Pi**2
. +k*(2d0*k+l*mupsi/muq)*Msi2*(dlog(Msi2/QSTSB)-1d0)/8d0/Pi**2
aux=k*mupsi*DDSIN(phi02-phiP)/8d0/Pi**2
. *Msi2*(dlog(Msi2/QSTSB)-1d0)
IF(k.ne.0d0)THEN
IAk=IAk+(l/muq)**2/k*aux
ELSE
IXIS=IXIS+aux*(muq/l)**2
ENDIF
c II- Corrections to the O(v^2) parameters of the potential
RAudchi=2.d0*l/32.d0/Pi**2*(
. g1q*M1r*DDCOS(PhiM1+Phi01)*Fsf1(Mbi2,Mhi2,QSTSB)
. +3.d0*g2q*M2r*DDCOS(PhiM2+Phi01)*Fsf1(Mwi2,Mhi2,QSTSB))
RlPMchi=-4.d0*ks2si*l**4/32.d0/Pi**2/muq
. *DDCOS(Phi0)*Fsf1(Mhi2,Msi2,QSTSB)
IlPMchi=-4.d0*ks2si*l**4/32.d0/Pi**2/muq
. *DDSIN(Phi0)*Fsf1(Mhi2,Msi2,QSTSB)
c differentiating coefficients wrt singlet fields
aux=(2.d0*l**2+g1q+3.d0*g2q)*(2.d0*l*mur)*dlog(Mhi2/QSTSB)
. +2.d0*l**2*(2d0*ks2si**2)*dlog(Msi2/QSTSB)*l/mur
. +g1q*(2.d0*l*mur)*(fSF1(Mbi2,Mhi2,QSTSB)
. +(Mbi2+Mhi2)*fSF3(Mbi2,Mhi2))
. +3.d0*g2q*(2.d0*l*mur)*(fSF1(Mwi2,Mhi2,QSTSB)
. +(Mwi2+Mhi2)*fSF3(Mwi2,Mhi2))
. +2.d0*l**2*(2.d0*l*mur)*(fSF1(Msi2,Mhi2,QSTSB)
. +(Msi2+Mhi2)*fSF3(Msi2,Mhi2))
. +2.d0*l**2*(2d0*ks2si**2)*l/mur*(fSF1(Msi2,Mhi2,QSTSB)
. +(Msi2+Mhi2)*fSF3(Mhi2,Msi2))
dM2dHs=-1.d0/32.d0/Pi**2*aux*mur/muq
aux=g1q*M1r*DDCOS(PhiM1+Phi01)*(2.d0*l*mur)*fSF3(Mbi2,Mhi2)
. +3.d0*g2q*M2r*DDCOS(PhiM2+Phi01)*(2.d0*l*mur)*fSF3(Mwi2,Mhi2)
RdAuddHs=2.d0/32.d0/Pi**2*l*aux
aux=g1q*M1r*DDSIN(PhiM1+Phi01)*(2.d0*l*mur)*fSF3(Mbi2,Mhi2)
. +3.d0*g2q*M2r*DDSIN(PhiM2+Phi01)*(2.d0*l*mur)*fSF3(Mwi2,Mhi2)
IdAuddHs=2.d0/32.d0/Pi**2*l*aux
aux=(2.d0*l*mur)*fSF3(Msi2,Mhi2)
. +(4.d0*k*msi)*fSF3(Mhi2,Msi2)
RdlPMdHs=-8.d0/32.d0/Pi**2*k*l**3*DDCOS(Phi01-Phi02)*aux
IdlPMdHs=-8.d0/32.d0/Pi**2*k*l**3*DDSIN(Phi01-Phi02)*aux
aux=Max(dabs(XIS),dabs(MSP),dabs(XIF),dabs(MUP),dabs(M3H))
IF(aux.ge.1d-4)THEN
RlPMchi=g1q*M1r*DDCOS(PhiM1+Phi01)*Mhi2**2*FSF4(Mbi2,Mhi2)
. +3d0*g2q*M2r*DDCOS(PhiM2+Phi01)*Mhi2**2*FSF4(Mwi2,Mhi2)
. -4d0*l**2*(ks2si*DDCOS(Phi0)*FSF1(Msi2,Mhi2,QSTSB)
. +Mhi2*(mupsi*DDCOS(Phi01-phiP)+2d0*ks2si*DDCOS(Phi0))
. *FSF3(Msi2,Mhi2)
. +ks2si*(DDCOS(Phi0)*(2d0*Msi2-mupsi**2)-ks2si*mupsi
. *DDCOS(Phi01-phiP))*FSF3(Mhi2,Msi2)
. +Mhi2**2*(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))/2d0
. *FSF4(Msi2,Mhi2)
. +ks2si**2*(mupsi*DDCOS(Phi0+phiP-Phi02)+ks2si*DDCOS(Phi0))
. *Msi2/2d0*FSF4(Mhi2,Msi2)
. +ks2si*Mhi2*Msi2*DDCOS(phi0)*FSF7(Msi2,Mhi2))
RlPMchi=RlPMchi*l**2/muq/32d0/Pi**2
IlPMchi=g1q*M1r*DDSIN(PhiM1+Phi01)*Mhi2**2*FSF4(Mbi2,Mhi2)
. +3d0*g2q*M2r*DDSIN(PhiM2+Phi01)*Mhi2**2*FSF4(Mwi2,Mhi2)
. -4d0*l**2*(ks2si*DDSIN(Phi0)*FSF1(Msi2,Mhi2,QSTSB)
. +Mhi2*(mupsi*DDSIN(Phi01-phiP)+2d0*ks2si*DDSIN(Phi0))
. *FSF3(Msi2,Mhi2)
. +ks2si*(DDSIN(Phi0)*(2d0*Msi2-mupsi**2)-ks2si*mupsi
. *DDSIN(Phi01-phiP))*FSF3(Mhi2,Msi2)
. +Mhi2**2*(mupsi*DDSIN(Phi01-phiP)+ks2si*DDSIN(Phi0))/2d0
. *FSF4(Msi2,Mhi2)
. +ks2si**2*(mupsi*DDSIN(Phi0+phiP-Phi02)+ks2si*DDSIN(Phi0))
. *Msi2/2d0*FSF4(Mhi2,Msi2)
. +ks2si*Mhi2*Msi2*DDSIN(phi0)*FSF7(Msi2,Mhi2))
IlPMchi=IlPMchi*l**2/muq/32d0/Pi**2
RlPMtchi=g1q*M1r*DDCOS(PhiM1+Phi01)*Mhi2
. *(2d0*FSF3(Mbi2,Mhi2)+Mhi2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDCOS(PhiM2+Phi01)*Mhi2
. *(2d0*FSF3(Mwi2,Mhi2)+Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(Mhi2**2*(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))
. *FSF4(Msi2,Mhi2)
. +ks2si**2*(mupsi**3*DDCOS(Phi0+3d0*(Phi02-phiP))
. +3d0*ks2si*mupsi**2*DDCOS(Phi0+2d0*(Phi02-phiP))
. +3d0*ks2si**2*mupsi*DDCOS(Phi01-phiP)+ks2si**3*DDCOS(Phi0))
. *FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi**2*DDCOS(Phi0+2d0*(Phi02-phiP))
. +2d0*mupsi*ks2si*DDCOS(Phi01-phiP)
. +ks2si**2*DDCOS(phi0))*FSF7(Msi2,Mhi2))
RlPMtchi=RlPMtchi*l**2/muq/32d0/Pi**2
IlPMtchi=g1q*M1r*DDSIN(PhiM1+Phi01)*Mhi2
. *(2d0*FSF3(Mbi2,Mhi2)+Mhi2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDSIN(PhiM2+Phi01)*Mhi2
. *(2d0*FSF3(Mwi2,Mhi2)+Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(Mhi2**2*(mupsi*DDSIN(Phi01-phiP)+ks2si*DDSIN(Phi0))
. *FSF4(Msi2,Mhi2)
. +ks2si**2*(mupsi**3*DDSIN(Phi0+3d0*(Phi02-phiP))
. +3d0*ks2si*mupsi**2*DDSIN(Phi0+2d0*(Phi02-phiP))
. +3d0*ks2si**2*mupsi*DDSIN(Phi01-phiP)+ks2si**3*DDSIN(Phi0))
. *FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi**2*DDSIN(Phi0+2d0*(Phi02-phiP))
. +2d0*mupsi*ks2si*DDSIN(Phi01-phiP)
. +ks2si**2*DDSIN(phi0))*FSF7(Msi2,Mhi2))
IlPMtchi=IlPMtchi*l**2/muq/32d0/Pi**2
RlMchi=g1q*M1r*DDCOS(PhiM1+Phi01)*Mhi2
. *(2d0*FSF3(Mbi2,Mhi2)+Mhi2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDCOS(PhiM2+Phi01)*Mhi2
. *(2d0*FSF3(Mwi2,Mhi2)+Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(Mhi2*(2d0*mupsi*DDCOS(Phi01-phiP)+3d0*ks2si
. *DDCOS(Phi0))*FSF3(Msi2,Mhi2)
. +ks2si*(mupsi**2*DDCOS(Phi0+2d0*(Phi02-phiP))
. +4d0*ks2si*mupsi*DDCOS(Phi01-phiP)+3d0*ks2si**2*DDCOS(Phi0))
. *FSF3(Mhi2,Msi2)
. +(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))
. *(Mhi2**2*FSF4(Msi2,Mhi2)+ks2si**2*Msi2*FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *FSF7(Msi2,Mhi2)))
RlMchi=2d0*RlMchi*l**2/muq/32d0/Pi**2
IlMchi=g1q*M1r*DDSIN(PhiM1+Phi01)*Mhi2
. *(2d0*FSF3(Mbi2,Mhi2)+Mhi2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDSIN(PhiM2+Phi01)*Mhi2
. *(2d0*FSF3(Mwi2,Mhi2)+Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(Mhi2*(2d0*mupsi*DDSIN(Phi01-phiP)+3d0*ks2si
. *DDSIN(Phi0))*FSF3(Msi2,Mhi2)
. +ks2si*(mupsi**2*DDSIN(Phi0+2d0*(Phi02-phiP))
. +4d0*ks2si*mupsi*DDSIN(Phi01-phiP)+3d0*ks2si**2*DDSIN(Phi0))
. *FSF3(Mhi2,Msi2)
. +(mupsi*DDSIN(Phi01-phiP)+ks2si*DDSIN(Phi0))
. *(Mhi2**2*FSF4(Msi2,Mhi2)+ks2si**2*Msi2*FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *FSF7(Msi2,Mhi2)))
IlMchi=2d0*IlMchi*l**2/muq/32d0/Pi**2
RAudchi=g1q*M1r*DDCOS(PhiM1+Phi01)*(FSF1(Mbi2,Mhi2,QSTSB)
. -3d0*Mhi2*FSF3(Mbi2,Mhi2)-2d0*Mhi2**2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDCOS(PhiM2+Phi01)*(FSF1(Mwi2,Mhi2,QSTSB)
. -3d0*Mhi2*FSF3(Mwi2,Mhi2)-2d0*Mhi2**2*FSF4(Mwi2,Mhi2))
. +2d0*l**2*(Mhi2*(mupsi*DDCOS(Phi01-phiP)+2d0*ks2si
. *DDCOS(Phi0))*FSF3(Msi2,Mhi2)
. +2d0*ks2si**2*(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))
. *FSF3(Mhi2,Msi2)
. +2d0*Mhi2**2*(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))
. *FSF4(Msi2,Mhi2)
. +2d0*ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(mupsi**2*DDCOS(Phi0+2d0*(Phi02-phiP))
. +2d0*mupsi*ks2si*DDCOS(Phi01-phiP)+ks2si**2*DDCOS(Phi0))
. *FSF4(Mhi2,Msi2)
. +ks2si*Mhi2*(3d0*(mupsi**2*DDCOS(Phi0+2d0*(Phi02-phiP))
. +2d0*mupsi*ks2si*DDCOS(Phi01-phiP)+ks2si**2*DDCOS(Phi0))
. +Msi2*DDCOS(Phi0))*FSF7(Msi2,Mhi2))
RAudchi=2d0*RAudchi*l/32d0/Pi**2
RAudtchi=-g1q*M1r*DDCOS(PhiM1+Phi01)*Mhi2
. *(FSF3(Mbi2,Mhi2)+2d0*Mhi2*FSF4(Mbi2,Mhi2))
. -3d0*g2q*M2r*DDCOS(PhiM2+Phi01)*Mhi2
. *(FSF3(Mwi2,Mhi2)+2d0*Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(mupsi*DDCOS(Phi01-phiP)*FSF1(Msi2,Mhi2,QSTSB)
. -3d0*Mhi2*(mupsi*DDCOS(Phi01-phiP)+2d0*ks2si*DDCOS(Phi0))
. *FSF3(Msi2,Mhi2)
. -2d0*ks2si*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(mupsi*DDCOS(Phi01-phiP)+3d0*ks2si*DDCOS(Phi0))
. *FSF3(Mhi2,Msi2)
. -2d0*Mhi2**2*(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))
. *FSF4(Msi2,Mhi2)
. -2d0*ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)*Msi2*DDCOS(Phi0)
. *FSF4(Mhi2,Msi2)
. -ks2si*Mhi2*(mupsi**2*DDCOS(Phi0+2d0*(Phi02-phiP))
. +2d0*mupsi*ks2si*DDCOS(Phi01-phiP)+ks2si**2*DDCOS(Phi0)
. +3d0*Msi2*DDCOS(Phi0))*FSF7(Msi2,Mhi2))
RAudtchi=2d0*RAudtchi*l/32d0/Pi**2
IAudtchi=-g1q*M1r*DDSIN(PhiM1+Phi01)*Mhi2
. *(FSF3(Mbi2,Mhi2)+2d0*Mhi2*FSF4(Mbi2,Mhi2))
. -3d0*g2q*M2r*DDSIN(PhiM2+Phi01)*Mhi2
. *(FSF3(Mwi2,Mhi2)+2d0*Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(mupsi*DDSIN(Phi01-phiP)*FSF1(Msi2,Mhi2,QSTSB)
. -3d0*Mhi2*(mupsi*DDSIN(Phi01-phiP)+2d0*ks2si*DDSIN(Phi0))
. *FSF3(Msi2,Mhi2)
. -2d0*ks2si*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(mupsi*DDSIN(Phi01-phiP)+3d0*ks2si*DDSIN(Phi0))
. *FSF3(Mhi2,Msi2)
. -2d0*Mhi2**2*(mupsi*DDSIN(Phi01-phiP)+ks2si*DDSIN(Phi0))
. *FSF4(Msi2,Mhi2)
. -2d0*ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)*Msi2*DDSIN(Phi0)
. *FSF4(Mhi2,Msi2)
. -ks2si*Mhi2*(mupsi**2*DDSIN(Phi0+2d0*(Phi02-phiP))
. +2d0*mupsi*ks2si*DDSIN(Phi01-phiP)+ks2si**2*DDSIN(Phi0)
. +3d0*Msi2*DDSIN(Phi0))*FSF7(Msi2,Mhi2))
IAudtchi=2d0*IAudtchi*l/32d0/Pi**2
Rm3chi=g1q*M1r*DDCOS(PhiM1+Phi01)*Mhi2
. *(FSF3(Mbi2,Mhi2)+2d0*Mhi2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDCOS(PhiM2+Phi01)*Mhi2
. *(FSF3(Mwi2,Mhi2)+2d0*Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(Mhi2*(mupsi*DDCOS(Phi01-phiP)+3d0*ks2si*DDCOS(Phi0))
. *FSF3(Msi2,Mhi2)
. +ks2si**2*(2d0*mupsi*DDCOS(Phi01-phiP)
. +mupsi*DDCOS(Phi0+phiP-Phi02)+3d0*ks2si*DDCOS(Phi0))
. *FSF3(Mhi2,Msi2)
. +2d0*(mupsi*DDCOS(Phi01-phiP)+ks2si*DDCOS(Phi0))
. *(Mhi2**2*FSF4(Msi2,Mhi2)
. +ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)**2*FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *FSF7(Msi2,Mhi2)))
Rm3chi=2d0*Rm3chi*muq/32d0/Pi**2
Im3chi=g1q*M1r*DDSIN(PhiM1+Phi01)*Mhi2
. *(FSF3(Mbi2,Mhi2)+2d0*Mhi2*FSF4(Mbi2,Mhi2))
. +3d0*g2q*M2r*DDSIN(PhiM2+Phi01)*Mhi2
. *(FSF3(Mwi2,Mhi2)+2d0*Mhi2*FSF4(Mwi2,Mhi2))
. -2d0*l**2*(Mhi2*(mupsi*DDSIN(Phi01-phiP)+3d0*ks2si*DDSIN(Phi0))
. *FSF3(Msi2,Mhi2)
. +ks2si**2*(2d0*mupsi*DDSIN(Phi01-phiP)
. +mupsi*DDSIN(Phi0+phiP-Phi02)+3d0*ks2si*DDSIN(Phi0))
. *FSF3(Mhi2,Msi2)
. +2d0*(mupsi*DDSIN(Phi01-phiP)+ks2si*DDSIN(Phi0))
. *(Mhi2**2*FSF4(Msi2,Mhi2)
. +ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)**2*FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *FSF7(Msi2,Mhi2)))
Im3chi=2d0*Im3chi*muq/32d0/Pi**2
RAqschi=-2d0*(2d0*l**2+g1q+3d0*g2q)*Mhi2
. +2d0*l**2*ks2si*(mupsi*DDCOS(Phi02-phiP)*dlog(Msi2/QSTSB)
. -2d0*ks2si*(mupsi*DDCOS(Phi02-phiP)+ks2si)**2/Msi2)
. -2d0*g1q*Mhi2**2*(2d0*FSF3(Mbi2,Mhi2)
. +(Mbi2+Mhi2)*FSF4(Mbi2,Mhi2))
. -6d0*g2q*Mhi2**2*(2d0*FSF3(Mwi2,Mhi2)
. +(Mwi2+Mhi2)*FSF4(Mwi2,Mhi2))
. +2d0*l**2*(ks2si*mupsi*DDCOS(Phi02-phiP)
. *(FSF1(Msi2,Mhi2,QSTSB)+(Msi2+Mhi2)*FSF3(Mhi2,Msi2))
. -2d0*ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)**2
. *(2d0*FSF3(Mhi2,Msi2)
. +(Msi2+Mhi2)*FSF4(Mhi2,Msi2))
. -2d0*Mhi2**2*(2d0*FSF3(Msi2,Mhi2)+(Msi2+Mhi2)*FSF4(Msi2,Mhi2))
. -4d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(FSF3(Mhi2,Msi2)+FSF3(Msi2,Mhi2)
. +(Msi2+Mhi2)*FSF7(Msi2,Mhi2)))
RAqschi=-RAqschi*l/muq/32d0/Pi**2
IAqschi=2d0*l**2*ks2si*mupsi*DDSIN(Phi02-phiP)*(dlog(Msi2/QSTSB)
. -2d0*ks2si*(mupsi*DDCOS(Phi02-phiP)+ks2si)/Msi2)
. +2d0*l**2*mupsi*DDSIN(Phi02-phiP)*(ks2si
. *(FSF1(Msi2,Mhi2,QSTSB)+(Msi2+Mhi2)*FSF3(Mhi2,Msi2))
. -2d0*ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(2d0*FSF3(Mhi2,Msi2)+(Msi2+Mhi2)*FSF4(Mhi2,Msi2))
. -2d0*ks2si*Mhi2*(FSF3(Mhi2,Msi2)+FSF3(Msi2,Mhi2)
. +(Msi2+Mhi2)*FSF7(Msi2,Mhi2)))
IAqschi=-IAqschi*l/muq/32d0/Pi**2
Rltqschi=(2d0*l**2+g1q+3d0*g2q)*Mhi2/2d0
. +l**2*ks2si**2*(mupsi**2*DDCOS(2d0*(Phi02-phiP))
. +2d0*ks2si*mupsi*DDCOS(Phi02-phiP)+ks2si**2)/Msi2
. +g1q*Mhi2**2/2d0*(2d0*FSF3(Mbi2,Mhi2)
. +(Mbi2+Mhi2)*FSF4(Mbi2,Mhi2))
. +3d0*g2q*Mhi2**2/2d0*(2d0*FSF3(Mwi2,Mhi2)
. +(Mwi2+Mhi2)*FSF4(Mwi2,Mhi2))
. +l**2*(ks2si**2*(mupsi**2*DDCOS(2d0*(Phi02-phiP))
. +2d0*ks2si*mupsi*DDCOS(Phi02-phiP)+ks2si**2)
. *(2d0*FSF3(Mhi2,Msi2)+(Msi2+Mhi2)*FSF4(Mhi2,Msi2))
. +Mhi2**2*(2d0*FSF3(Msi2,Mhi2)+(Msi2+Mhi2)*FSF4(Msi2,Mhi2))
. +2d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(FSF3(Mhi2,Msi2)+FSF3(Msi2,Mhi2)
. +(Msi2+Mhi2)*FSF7(Msi2,Mhi2)))
Rltqschi=-Rltqschi*(l/muq)**2/32d0/Pi**2
Iltqschi=2d0*l**2*ks2si**2/Msi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. +l**2*(2d0*ks2si**2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *(2d0*FSF3(Mhi2,Msi2)+(Msi2+Mhi2)*FSF4(Mhi2,Msi2))
. +2d0*ks2si*Mhi2*(FSF3(Mhi2,Msi2)+FSF3(Msi2,Mhi2)
. +(Msi2+Mhi2)*FSF7(Msi2,Mhi2)))
Iltqschi=-Iltqschi*(l/muq)**2/32d0/Pi**2
. *mupsi*DDSIN(Phi02-phiP)
lPqschi=(2d0*l**2+g1q+3d0*g2q)*Mhi2*(dlog(Mhi2/QSTSB)+1d0)
. +2d0*l**2*ks2si**2*(dlog(Msi2/QSTSB)+1d0)
. +g1q*Mhi2*(FSF1(Mbi2,Mhi2,QSTSB)
. +(Mbi2+3d0*Mhi2)*FSF3(Mbi2,Mhi2)
. +Mhi2*(Mbi2+Mhi2)*FSF4(Mbi2,Mhi2))
. +3d0*g2q*Mhi2*(FSF1(Mwi2,Mhi2,QSTSB)
. +(Mwi2+3d0*Mhi2)*FSF3(Mwi2,Mhi2)
. +Mhi2*(Mwi2+Mhi2)*FSF4(Mwi2,Mhi2))
. +2d0*l**2*((Mhi2+ks2si**2)*FSF1(Msi2,Mhi2,QSTSB)
. +Mhi2*(Msi2+3d0*Mhi2+2d0*ks2si
. *(mupsi*DDCOS(Phi02-phiP)+ks2si))*FSF3(Msi2,Mhi2)
. +(ks2si**2*(3d0*Msi2+Mhi2)+2d0*Mhi2*ks2si
. *(mupsi*DDCOS(Phi02-phiP)+ks2si))*FSF3(Mhi2,Msi2)
. +(Msi2+Mhi2)*(Mhi2**2*FSF4(Msi2,Mhi2)
. +ks2si**2*Msi2*FSF4(Mhi2,Msi2)
. +2d0*ks2si*Mhi2*(mupsi*DDCOS(Phi02-phiP)+ks2si)
. *FSF7(Msi2,Mhi2)))
lPqschi=-lPqschi*(l/muq)**2/32d0/Pi**2
ENDIF
c III- Corrections to the O(v^4) parameters of the potential
ludchi=-1.d0/32.d0/Pi**2*(
. g1q**2/2.d0*dlog(Mbi2/QSTSB)
. +5.d0*g2q**2/2.d0*dlog(Mwi2/QSTSB)
. +(2.d0*l**4+(5.d0*g2q**2+g1q**2+2.d0*g1q*g2q)/2.d0)
. *dlog(Mhi2/QSTSB)
. +2.d0*l**4*dlog(Msi2/QSTSB)
. +g1q*g2q*Fsf1(Mbi2,Mwi2,QSTSB)
. +g1q**2*(Mbi2+Mhi2)*Fsf3(Mhi2,Mbi2)
. +g1q*(2.d0*l**2*Mhi2+(g1q+g2q)*Mbi2)*Fsf3(Mbi2,Mhi2)
. +g2q**2*(Mwi2+5.d0*Mhi2)*Fsf3(Mhi2,Mwi2)
. +g2q*(2.d0*l**2*Mhi2+(g1q+5.d0*g2q)*Mwi2)*Fsf3(Mwi2,Mhi2)
. +4.d0*l**4*(Mhi2+Msi2)*Fsf3(Mhi2,Msi2)
. +2.d0*l**2*(8.d0*k**2+g1q+g2q)*Mhi2*Fsf3(Msi2,Mhi2)
. +2.d0*g1q*g2q*(M1r*M2r*DDCOS(PhiM1-PhiM2)+Mhi2)
. *Fsf5(Mhi2,Mbi2,Mwi2)
. +g1q**2/2.d0*(Mbi2+Mhi2)**2*Fsf7(Mbi2,Mhi2)
. +g2q**2/2.d0*(5.d0*Mwi2**2+5.d0*Mhi2**2+2.d0*Mwi2*Mhi2)
. *Fsf7(Mwi2,Mhi2)
. +2.d0*l**4*(Mhi2+Msi2)**2*Fsf7(Msi2,Mhi2)
. +g1q*g2q*(Mbi2*Mwi2+Mhi2**2+2.d0*M1r*M2r*Mhi2
. *DDCOS(PhiM1-PhiM2))*Fsf6(Mbi2,Mwi2,Mhi2)
. +2.d0*g1q*l**2*Mhi2*(Mbi2+Msi2+2.d0*M1r*(mupsi*DDCOS(PhiM1+phiP)
. +ks2si*DDCOS(PhiM1+Phi02)))*Fsf6(Mbi2,Msi2,Mhi2)
. +2.d0*g2q*l**2*Mhi2*(Mwi2+Msi2+2.d0*M2r*(mupsi*DDCOS(PhiM2+phiP)
. +ks2si*DDCOS(PhiM2+Phi02)))*Fsf6(Mwi2,Msi2,Mhi2))
l34chi=-1.d0/32.d0/Pi**2*(
. g1q**2/2.d0*dlog(Mbi2/QSTSB)
. +g2q**2/2.d0*dlog(Mwi2/QSTSB)
. +(2.d0*l**4+(g2q+g1q)**2/2.d0)*dlog(Mhi2/QSTSB)
. +2.d0*l**4*dlog(Msi2/QSTSB)
. +g1q*g2q*Fsf1(Mbi2,Mwi2,QSTSB)
. +g1q**2*(Mbi2+Mhi2)*Fsf3(Mhi2,Mbi2)
. +g1q*((g1q+g2q)*Mbi2-2.d0*(l**2-g1q-g2q)*Mhi2)*Fsf3(Mbi2,Mhi2)
. +g2q**2*(5.d0*Mwi2+Mhi2)*Fsf3(Mhi2,Mwi2)
. +g2q*((g1q+g2q)*Mwi2-2.d0*(l**2-g1q-3.d0*g2q)*Mhi2)
. *Fsf3(Mwi2,Mhi2)
. +4.d0*l**4*(Mhi2+Msi2)*Fsf3(Mhi2,Msi2)
. +2.d0*l**2*(l**2*(2.d0*Msi2+4.d0*Mhi2)-(g1q+g2q)*Mhi2)
. *Fsf3(Msi2,Mhi2)
. +2.d0*g1q*g2q*(M1r*M2r*DDCOS(PhiM1-PhiM2)+Mhi2)
. *Fsf5(Mhi2,Mbi2,Mwi2)
. +g1q**2/2.d0*(Mbi2**2+Mhi2**2+6.d0*Mbi2*Mhi2)*Fsf7(Mbi2,Mhi2)
. +g2q**2/2.d0*(Mwi2**2+Mhi2**2+22.d0*Mwi2*Mhi2)
. *Fsf7(Mwi2,Mhi2)
. +2.d0*l**4*(Mhi2**2+Msi2**2+6.d0*Mhi2*Msi2)*Fsf7(Msi2,Mhi2)
. +g1q*g2q*(Mbi2*Mwi2+Mhi2**2+2.d0*Mhi2*
. (Mbi2+Mwi2+M1r*M2r*DDCOS(PhiM1-PhiM2)))*Fsf6(Mbi2,Mwi2,Mhi2)
. -2.d0*g1q*l**2*Mhi2*(Mbi2+Msi2+2.d0*M1r*(mupsi*DDCOS(PhiM1+phiP)
. +ks2si*DDCOS(PhiM1+Phi02)))*Fsf6(Mbi2,Msi2,Mhi2)
. -2.d0*g2q*l**2*Mhi2*(Mwi2+Msi2+2.d0*M2r*(mupsi*DDCOS(PhiM2+phiP)
. +ks2si*DDCOS(PhiM2+Phi02)))*Fsf6(Mwi2,Msi2,Mhi2))
l4chi=-1.d0/32.d0/Pi**2*(
. -2.d0*g2q**2*(dlog(Mwi2/QSTSB)+dlog(Mhi2/QSTSB))
. +2.d0*g1q*g2q*(Fsf1(Mbi2,Mwi2,QSTSB)+dlog(Mhi2/QSTSB))
. +2.d0*g1q*(g2q*Mbi2+(g1q-g2q)*Mhi2)*Fsf3(Mbi2,Mhi2)
. +4.d0*g2q**2*(Mwi2-Mhi2)*Fsf3(Mhi2,Mwi2)
. +2.d0*g2q*((g1q-2.d0*g2q)*Mwi2-(2.d0*l**2+g1q-3.d0*g2q)
. *Mhi2)*Fsf3(Mwi2,Mhi2)
. +4.d0*l**2*(2.d0*l**2-g2q)*Mhi2*Fsf3(Msi2,Mhi2)
. +4.d0*g1q*g2q*(M1r*M2r*DDCOS(PhiM1-PhiM2)+Mhi2)
. *Fsf5(Mhi2,Mbi2,Mwi2)
. +2.d0*g1q**2*Mbi2*Mhi2*Fsf7(Mbi2,Mhi2)
. +2.d0*g2q**2*(-Mwi2**2-Mhi2**2+5.d0*Mwi2*Mhi2)*Fsf7(Mwi2,Mhi2)
. +8.d0*l**4*Mhi2*Msi2*Fsf7(Msi2,Mhi2)
. +2.d0*g1q*g2q*(Mbi2*Mwi2+Mhi2**2-Mhi2*(Mbi2+Mwi2
. -2.d0*M1r*M2r*DDCOS(PhiM1-PhiM2)))*Fsf6(Mbi2,Mwi2,Mhi2)
. -4.d0*g2q*l**2*Mhi2*((Mwi2+Msi2)+2.d0*M2r*(mupsi*
. DDCOS(PhiM2+phiP)+ks2si*DDCOS(PhiM2+Phi02)))
.*Fsf6(Mwi2,Msi2,Mhi2))
Rel5chi=-2.d0/32.d0/Pi**2*Mhi2*(
. g1q**2*Mbi2*DDCOS(2.d0*(PhiM1+Phi01))*Fsf7(Mbi2,Mhi2)
. +3.d0*g2q**2*Mwi2*DDCOS(2.d0*(PhiM2+Phi01))*Fsf7(Mwi2,Mhi2)
. +2.d0*g1q*g2q*M1r*M2r*DDCOS(PhiM1+PhiM2+2.d0*Phi01)
. *Fsf6(Mbi2,Mwi2,Mhi2)
. +4.d0*l**4*(mupsi**2*DDCOS(2.d0*(Phi01-Phip))
. +2d0*mupsi*ks2si*DDCOS(2.d0*Phi01-phiP-Phi02)
. +ks2si**2*DDCOS(2.d0*(Phi01-Phi02)))
.*Fsf7(Msi2,Mhi2))
Iml5chi=-2.d0/32.d0/Pi**2*Mhi2*(
. g1q**2*Mbi2*DDSIN(2.d0*(PhiM1+Phi01))*Fsf7(Mbi2,Mhi2)
. +3.d0*g2q**2*Mwi2*DDSIN(2.d0*(PhiM2+Phi01))*Fsf7(Mwi2,Mhi2)
. +2.d0*g1q*g2q*M1r*M2r*DDSIN(PhiM1+PhiM2+2.d0*Phi01)
. *Fsf6(Mbi2,Mwi2,Mhi2)
. +4.d0*l**4*(mupsi**2*DDSIN(2.d0*(Phi01-Phip))
. +2d0*mupsi*ks2si*DDSIN(2.d0*Phi01-phiP-Phi02)
. +ks2si**2*DDSIN(2.d0*(Phi01-Phi02)))
.*Fsf7(Msi2,Mhi2))
Rel67chi=-1.d0/32.d0/Pi**2*(
. -g1q**2*M1r*mur*DDCOS(PhiM1+Phi01)*Fsf3(Mhi2,Mbi2)
. -g1q*(g1q+g2q)*M1r*mur*DDCOS(PhiM1+Phi01)*Fsf3(Mbi2,Mhi2)
. -3.d0*g2q**2*M2r*mur*DDCOS(PhiM2+Phi01)*Fsf3(Mhi2,Mwi2)
. -g2q*(g1q+3.d0*g2q)*M2r*mur*DDCOS(PhiM2+Phi01)
. *Fsf3(Mwi2,Mhi2)
. +4.d0*l**4*mur*(mupsi*DDCOS(Phi01-phip)+ks2si*DDCOS(Phi01-Phi02))
. *(Fsf3(Mhi2,Msi2)+Fsf3(Msi2,Mhi2))
. -g1q*g2q*mur*(M1r*DDCOS(PhiM1+Phi01)+M2r*DDCOS(PhiM2+Phi01))
. *Fsf5(Mhi2,Mbi2,Mwi2)
. -g1q**2*M1r*mur*DDCOS(PhiM1+Phi01)*(Mbi2+Mhi2)
. *Fsf7(Mbi2,Mhi2)
. -3.d0*g2q**2*M2r*mur*DDCOS(PhiM2+Phi01)*(Mwi2+Mhi2)
. *Fsf7(Mwi2,Mhi2)
. +4.d0*l**4*mur*(mupsi*DDCOS(Phi01-phip)+ks2si*DDCOS(Phi01-Phi02))
. *(Mhi2+Msi2)*Fsf7(Msi2,Mhi2)
. -g1q*g2q*mur*(M1r*(Mwi2+Mhi2)*DDCOS(PhiM1+Phi01)
. +M2r*(Mbi2+Mhi2)*DDCOS(PhiM2+Phi01))
. *Fsf6(Mbi2,Mwi2,Mhi2))
Iml67chi=-1.d0/32.d0/Pi**2*(
. -g1q**2*M1r*mur*DDSIN(PhiM1+Phi01)*Fsf3(Mhi2,Mbi2)
. -g1q*(g1q+g2q)*M1r*mur*DDSIN(PhiM1+Phi01)*Fsf3(Mbi2,Mhi2)
. -3.d0*g2q**2*M2r*mur*DDSIN(PhiM2+Phi01)*Fsf3(Mhi2,Mwi2)
. -g2q*(g1q+3.d0*g2q)*M2r*mur*DDSIN(PhiM2+Phi01)
. *Fsf3(Mwi2,Mhi2)
. +4.d0*l**4*mur*(mupsi*DDSIN(Phi01-phip)+ks2si*DDSIN(Phi01-Phi02))
. *(Fsf3(Mhi2,Msi2)+Fsf3(Msi2,Mhi2))
. -g1q*g2q*mur*(M1r*DDSIN(PhiM1+Phi01)+M2r*DDSIN(PhiM2+Phi01))
. *Fsf5(Mhi2,Mbi2,Mwi2)
. -g1q**2*M1r*mur*DDSIN(PhiM1+Phi01)*(Mbi2+Mhi2)
. *Fsf7(Mbi2,Mhi2)
. -3.d0*g2q**2*M2r*mur*DDSIN(PhiM2+Phi01)*(Mwi2+Mhi2)
. *Fsf7(Mwi2,Mhi2)
. +4.d0*l**4*mur*(mupsi*DDSIN(Phi01-phip)+ks2si*DDSIN(Phi01-Phi02))
. *(Mhi2+Msi2)*Fsf7(Msi2,Mhi2)
. -g1q*g2q*mur*(M1r*(Mwi2+Mhi2)*DDSIN(PhiM1+Phi01)
. +M2r*(Mbi2+Mhi2)*DDSIN(PhiM2+Phi01))
. *Fsf6(Mbi2,Mwi2,Mhi2))
aux=Max(dabs(XIS),dabs(MSP),dabs(XIF),dabs(MUP),dabs(M3H))
IF(aux.le.1d-4)THEN
c IV- Corrections to the neutral Higgs mass-matrix
aux=2.d0*ludchi*vuq**2+((RAudchi+RlPMchi*muq/l)*muq/l
. +Rel67chi*(vdq**2-3.d0*vuq**2))*vdq/vuq
MH02(1,1)=MH02(1,1)+aux
aux=2.d0*ludchi*vdq**2+((RAudchi+RlPMchi*muq/l)*muq/l
. +Rel67chi*(vuq**2-3.d0*vdq**2))*vuq/vdq
MH02(2,2)=MH02(2,2)+aux
aux=-((RAudchi+RlPMchi*muq/l)*muq/l+3.d0*Rel67chi
. *(vuq**2+vdq**2))+2.d0*(l34chi+Rel5chi)*vuq*vdq
MH02(1,2)=MH02(1,2)+aux
MH02(2,1)=MH02(2,1)+aux
aux=-(RAudchi+2.d0*RlPMchi*muq/l)*vdq+dM2dHs*vuq
. -(RdAuddHs+RdlPMdHs*muq/l)*vdq*muq/l+l*vdq/muq*
. (2.d0*Rel5chi*vuq*vdq-Rel67chi*(3.d0*vuq**2+vdq**2))
MH02(1,3)=MH02(1,3)+aux
MH02(3,1)=MH02(3,1)+aux
aux=-(RAudchi+2.d0*RlPMchi*muq/l)*vuq+dM2dHs*vdq
. -(RdAuddHs+RdlPMdHs*muq/l)*vuq*muq/l+l*vuq/muq*
. (2.d0*Rel5chi*vuq*vdq-Rel67chi*(vuq**2+3.d0*vdq**2))
MH02(2,3)=MH02(2,3)+aux
MH02(3,2)=MH02(3,2)+aux
MH02(3,3)=MH02(3,3)+l/muq*vuq*vdq*(
. RAudchi-2.d0*l/muq*RdAuddHs-4.d0*(l/muq)**2*RdlPMdHs)
aux=(RAudchi+RlPMchi*muq/l)*muq/l-2.d0*Rel5chi*vuq*vdq
. +Rel67chi*(vuq**2+vdq**2)
MH02(4,4)=MH02(4,4)+aux*(vu**2+vd**2)/vuq/vdq
aux=(RAudchi-2.d0*RlPMchi*muq/l)
. -(2.d0*Rel5chi*vuq*vdq-Rel67chi*(vuq**2+vdq**2))*l/muq
MH02(4,5)=MH02(4,5)+aux*dsqrt(vu**2+vd**2)
MH02(5,4)=MH02(5,4)+aux*dsqrt(vu**2+vd**2)
aux=(RAudchi+4.d0*RlPMchi*muq/l)*vuq*vdq*l/muq
MH02(5,5)=MH02(5,5)+aux
aux=(2.d0*Iml67chi*vuq-Iml5chi*vdq)
MH02(1,4)=MH02(1,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,1)=MH02(4,1)+aux*dsqrt(vu**2+vd**2)
aux=(2.d0*Iml67chi*vdq-Iml5chi*vuq)
MH02(2,4)=MH02(2,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,2)=MH02(4,2)+aux*dsqrt(vu**2+vd**2)
aux=-3.d0*IlPMchi*muq/l
. -(Iml5chi*vuq*vdq-2.d0*Iml67chi*vuq**2)*l/muq
MH02(1,5)=MH02(1,5)+aux*vdq
MH02(5,1)=MH02(5,1)+aux*vdq
aux=-3.d0*IlPMchi*muq/l
. -(Iml5chi*vuq*vdq-2.d0*Iml67chi*vdq**2)*l/muq
MH02(2,5)=MH02(2,5)+aux*vuq
MH02(5,2)=MH02(5,2)+aux*vuq
aux=IlPMchi*muq/l-Iml5chi*vuq*vdq*l/muq
MH02(3,4)=MH02(3,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,3)=MH02(4,3)+aux*dsqrt(vu**2+vd**2)
IF(k.ne.0d0)then
aux=(4.d0*IlPMchi-Iml5chi*vuq*vdq/(muq/l)**2)*vuq*vdq
else
aux=-2d0*(IlPMchi+Iml5chi*vuq*vdq/(muq/l)**2)*vuq*vdq
endif
MH02(3,5)=MH02(3,5)+aux
MH02(5,3)=MH02(5,3)+aux
c V- Corrections to the charged-Higgs mass
aux=(RAudchi+RlPMchi*muq/l)*muq/l-(l4chi+Rel5chi)*vuq*vdq
. +Rel67chi*(vuq**2+vdq**2)
MHC2=MHC2+aux*(vu**2+vd**2)/vuq/vdq
c VI- Inclusion in the corrected parameters
lu=lu+ludchi
ld=ld+ludchi
l3=l3+l34chi-l4chi
l4=l4+l4chi
Rel5=Rel5+Rel5chi
Iml5=Iml5+Iml5chi
Rel6=Rel6+Rel67chi
Iml6=Iml6+Iml67chi
Rel7=Rel7+Rel67chi
Iml7=Iml7+Iml67chi
RAud=RAud+RAudchi
RlPM=RlPM+RlPMchi
IlPM=IlPM+IlPMchi
lPu=lPu+l*dM2dHs/(2.d0*muq)
lPd=lPd+l*dM2dHs/(2.d0*muq)
c minimization conditions
aux=g1q*fSF0(Mbi2,QSTSB)+3d0*fSF0(Mwi2,QSTSB)
. +(2d0*l**2+g1q+3d0*g2q)*fSF0(Mhi2,QSTSB)
. +2d0*l**2*fSF0(Msi2,QSTSB)
. +g1q*(Mbi2+Mhi2)*fSF1(Mbi2,Mhi2,QSTSB)
. +3d0*g2q*(Mwi2+Mhi2)*fSF1(Mwi2,Mhi2,QSTSB)
. +2d0*l**2*(Msi2+Mhi2)*fSF1(Msi2,Mhi2,QSTSB)
MHuS=MHuS+aux/32d0/Pi**2
. +((RAudchi+RlPMchi*muq/l)*muq/l+Rel67chi*(3d0*vuq**2+vdq**2))
. *vdq/vuq
. -(ludchi*vuq**2+(l34chi+Rel5chi)*vdq**2)
MHdS=MHdS+aux/32d0/Pi**2
. +((RAudchi+RlPMchi*muq/l)*muq/l+Rel67chi*(3d0*vuq**2+vdq**2))
. *vdq/vuq
. -(ludchi*vuq**2+(l34chi+Rel5chi)*vdq**2)
MSS=MSS
. -l*dM2dHs/(2.d0*muq)*(vuq**2+vdq**2)
. +l*vuq*vdq/muq*(RAudchi+RdAuddHs*muq/l+2d0*RlPMchi*muq/l)
aux=g1q*M1r*DDSIN(PhiM1+phi01)*fSF1(Mbi2,Mhi2,QSTSB)
. +3d0*g2q*M2r*DDSIN(phiM2+phi01)*fSF1(Mwi2,Mhi2,QSTSB)
IAl=IAl-aux/16d0/Pi**2-IlPMchi*muq/l**2
. +(Iml5chi*vuq*vdq-Iml67chi*(vuq**2+vdq**2))/muq
ELSE
c with violation of Z3
c IVbis- Corrections to the neutral Higgs mass-matrix
aux=2.d0*ludchi*vuq**2
. +((RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi+Rel67chi*(vdq**2-3.d0*vuq**2))*vdq/vuq
MH02(1,1)=MH02(1,1)+aux
aux=2.d0*ludchi*vdq**2
. +((RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi+Rel67chi*(vuq**2-3.d0*vdq**2))*vuq/vdq
MH02(2,2)=MH02(2,2)+aux
aux=2.d0*(l34chi+Rel5chi)*vuq*vdq
. -((RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi+3.d0*Rel67chi*(vuq**2+vdq**2))
MH02(1,2)=MH02(1,2)+aux
MH02(2,1)=MH02(2,1)+aux
aux=2d0*(RAqschi+(lPqschi+2d0*Rltqschi)*muq/l)*vuq
. -(RAudchi+RAudtchi+2.d0*(RlPMchi+RlPMtchi+RlMchi)*muq/l)*vdq
MH02(1,3)=MH02(1,3)+aux
MH02(3,1)=MH02(3,1)+aux
aux=2d0*(RAqschi+(lPqschi+2d0*Rltqschi)*muq/l)*vdq
. -(RAudchi+RAudtchi+2.d0*(RlPMchi+RlPMtchi+RlMchi)*muq/l)*vuq
MH02(2,3)=MH02(2,3)+aux
MH02(3,2)=MH02(3,2)+aux
MH02(3,3)=MH02(3,3)
. +l/muq*(vuq*vdq*(RAudchi+RAudtchi)-RAqschi*(vuq**2+vdq**2))
aux=(RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi-2.d0*Rel5chi*vuq*vdq+Rel67chi*(vuq**2+vdq**2)
MH02(4,4)=MH02(4,4)+aux*(vu**2+vd**2)/vuq/vdq
aux=(RAudchi-RAudtchi+2.d0*(RlPMtchi-RlPMchi)*muq/l)
MH02(4,5)=MH02(4,5)+aux*dsqrt(vu**2+vd**2)
MH02(5,4)=MH02(5,4)+aux*dsqrt(vu**2+vd**2)
aux=((RAudchi+RAudtchi+4.d0*(RlPMtchi+RlPMchi)*muq/l)*vuq*vdq
. -(RAqschi+4d0*Rltqschi*muq/l)*(vuq**2+vdq**2))*l/muq
MH02(5,5)=MH02(5,5)+aux
aux=(2.d0*Iml67chi*vuq-Iml5chi*vdq)
MH02(1,4)=MH02(1,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,1)=MH02(4,1)+aux*dsqrt(vu**2+vd**2)
aux=(2.d0*Iml67chi*vdq-Iml5chi*vuq)
MH02(2,4)=MH02(2,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,2)=MH02(4,2)+aux*dsqrt(vu**2+vd**2)
aux=-(IAqschi+2d0*Iltqschi*muq/l)*vuq
. -(Im3chi*l/muq
. +2d0*IAudtchi+(3.d0*IlPMchi-IlPMtchi+IlMchi)*muq/l)*vdq
MH02(1,5)=MH02(1,5)+aux
MH02(5,1)=MH02(5,1)+aux
aux=-(IAqschi+2d0*Iltqschi*muq/l)*vdq
. -(Im3chi*l/muq
. +2d0*IAudtchi+(3.d0*IlPMchi-IlPMtchi+IlMchi)*muq/l)*vuq
MH02(2,5)=MH02(2,5)+aux
MH02(5,2)=MH02(5,2)+aux
aux=(IlPMchi+IlPMtchi+IlMchi)*muq/l-Im3chi*l/muq
MH02(3,4)=MH02(3,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,3)=MH02(4,3)+aux*dsqrt(vu**2+vd**2)
IF(k.ne.0d0)then
aux=2d0*(Im3chi*(l/muq)**2+2.d0*IAudtchi*l/muq
. +(2d0*IlPMchi+IlMchi))*vuq*vdq
. +2d0*(IAqschi*l/muq+Iltqschi)*(vuq**2+vdq**2)
else
aux=-2d0*(IlPMchi*vuq*vdq+Iltqschi*(vuq**2+vdq**2))
endif
MH02(3,5)=MH02(3,5)+aux
MH02(5,3)=MH02(5,3)+aux
c Vbis- Corrections to the charged-Higgs mass
aux=(RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi-(l4chi+Rel5chi)*vuq*vdq+Rel67chi*(vuq**2+vdq**2)
MHC2=MHC2+aux*(vu**2+vd**2)/vuq/vdq !/(ZHu*ZHd)
c VIbis- Inclusion in the corrected parameters
lu=lu+ludchi
ld=ld+ludchi
l3=l3+l34chi-l4chi
l4=l4+l4chi
Rel5=Rel5+Rel5chi
Iml5=Iml5+Iml5chi
Rel6=Rel6+Rel67chi
Iml6=Iml6+Iml67chi
Rel7=Rel7+Rel67chi
Iml7=Iml7+Iml67chi
Rm3=Rm3+Rm3chi
Im3=Im3+Im3chi
RAud=RAud+RAudchi
RAudt=RAudt+RAudtchi
IAudt=IAudt+IAudtchi
RlPM=RlPM+RlPMchi
IlPM=IlPM+IlPMchi
RlPMt=RlPMt+RlPMtchi
IlPMt=IlPMt+IlPMtchi
RlM=RlM+RlMchi
IlM=IlM+IlMchi
lPu=lPu+lPqschi
lPd=lPd+lPqschi
RAqs=RAqschi
IAqs=IAqschi
Rltqs=Rltqschi
Iltqs=Iltqschi
c minimization conditions
aux=g1q*fSF0(Mbi2,QSTSB)+3d0*fSF0(Mwi2,QSTSB)
. +(2d0*l**2+g1q+3d0*g2q)*fSF0(Mhi2,QSTSB)
. +2d0*l**2*fSF0(Msi2,QSTSB)
. +g1q*(Mbi2+Mhi2)*fSF1(Mbi2,Mhi2,QSTSB)
. +3d0*g2q*(Mwi2+Mhi2)*fSF1(Mwi2,Mhi2,QSTSB)
. +2d0*l**2*(Msi2+Mhi2)*fSF1(Msi2,Mhi2,QSTSB)
MHuS=MHuS+aux/32d0/Pi**2
. +((RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi+Rel67chi*(3d0*vuq**2+vdq**2))*vdq/vuq
. -(ludchi*vuq**2+(l34chi+Rel5chi)*vdq**2)
MHdS=MHdS+aux/32d0/Pi**2
. +((RAudchi+RAudtchi+(RlPMchi+RlPMtchi+RlMchi)*muq/l)*muq/l
. +Rm3chi+Rel67chi*(3d0*vuq**2+vdq**2))*vdq/vuq
. -(ludchi*vuq**2+(l34chi+Rel5chi)*vdq**2)
MSS=MSS
. -(RAqschi*l/muq+(lPqschi+2d0*Rltqschi))*(vuq**2+vdq**2)
. +l*vuq*vdq/muq
. *(RAudchi+RAudtchi+2d0*(RlPMchi+RlPMtchi+RlMchi)*muq/l)
aux=g1q*M1r*DDSIN(PhiM1+phi01)*fSF1(Mbi2,Mhi2,QSTSB)
. +3d0*g2q*M2r*DDSIN(phiM2+phi01)*fSF1(Mwi2,Mhi2,QSTSB)
IAl=IAl-aux/16d0/Pi**2-(IlPMchi+IlPMtchi+IlMchi)*muq/l**2
. -Im3chi/muq-IAudt/l
. +(Iml5chi*vuq*vdq-Iml67chi*(vuq**2+vdq**2))/muq
aux=-l*aux/16d0/Pi**2-(IlPMchi+IlPMtchi+IlMchi)*muq/l
. -l*Im3chi/muq-IAudt
. +l*(Iml5chi*vuq*vdq-Iml67chi*(vuq**2+vdq**2))/muq
. -(IAudtchi+2d0*(IlPMchi-IlPMtchi)*muq/l)*vuq*vdq*(l/muq)**2
c -(IAqschi+2d0*Iltqschi*muq/l)*(vuq**2+vdq**2)*(l/muq)**2
IF(k.ne.0d0)THEN
IAk=IAk+aux/k
ELSE
IXIS=IXIS+aux*(muq/l)**2
ENDIF
ENDIF
c print*,'MH02_1*',MH02(1,1),MH02(1,2),MH02(1,3),MH02(1,4),MH02(1,5)
c print*,'MH02_2*',MH02(2,1),MH02(2,2),MH02(2,3),MH02(2,4),MH02(2,5)
c print*,'MH02_3*',MH02(3,1),MH02(3,2),MH02(3,3),MH02(3,4),MH02(3,5)
c print*,'MH02_4*',MH02(4,1),MH02(4,2),MH02(4,3),MH02(4,4)
c c /(ZHu*ZHd),MH02(4,5)/dsqrt(Zs*ZHu*ZHd)
c print*,'MH02_5*',MH02(5,1),MH02(5,2),MH02(5,3),MH02(5,4),MH02(5,5)
c print*,'MHC2',MHC2
RETURN
END
************************************************************************************************
SUBROUTINE MHIGGSLOOP_GAUGEHIGGS_CPV(PAR)
c One-loop corrections to the Higgs potential
c - EW gauge + Higgs contribution
c - The gauge and Higgs contributions to the Higgs squared-mass matrices
c are computed (from 0-momentum self - tadpole) in the Feynmann gauge
c and added to the quantities stored in SQUHIMASSP.
c - The corresponding contributions to the Z3-conserving parameters of the
c effective Higgs potential are deduced from `inverting the system'
c and added to the quantities stored in EFFPOTPAR.
IMPLICIT NONE
INTEGER I,J,M,N
DOUBLE PRECISION PAR(*),fSF0,fSF1
DOUBLE PRECISION Pi,aux,MW2,MZ2,MHT2(6),MHTC(2),XHT(6,6)
DOUBLE PRECISION dMH0(5,5),dMHC,sinbq,cosbq,gRH0HpHm(5,2,2),
. gIH0HpHm(5,2,2),gHHH(6,6,6),gpHHH(6,6,6),gHHHH(6,6,6),XHG(6,6)
DOUBLE PRECISION PIS111(6,6,6),PIS122(6,6,6),PIS133(6,6,6),
. PIS144(6,6,6),PIS155(6,6,6),PIS166(6,6,6),PIS211(6,6,6),
. PIS222(6,6,6),PIS233(6,6,6),PIS244(6,6,6),PIS255(6,6,6),
. PIS266(6,6,6),PIS311(6,6,6),PIS322(6,6,6),PIS333(6,6,6),
. PIS344(6,6,6),PIS355(6,6,6),PIS366(6,6,6),PIS312(6,6,6),
. PIS345(6,6,6),PIS156(6,6,6),PIS256(6,6,6),PIS346(6,6,6),
. PIS356(6,6,6),PIS513(6,6,6),PIS423(6,6,6),PIS612(6,6,6),
. PIS456(6,6,6),PIS433(6,6,6),PIS613(6,6,6),PIS466(6,6,6),
. PIS533(6,6,6),PIS623(6,6,6),PIS566(6,6,6),PIS666(6,6,6),
. PIS633(6,6,6),PIS246(6,6,6)
DOUBLE PRECISION PISS1111(6,6,6),PISS1122(6,6,6),
. PISS1133(6,6,6),PISS1144(6,6,6),PISS1155(6,6,6),
. PISS1166(6,6,6),PISS2222(6,6,6),PISS2233(6,6,6),
. PISS2244(6,6,6),PISS2255(6,6,6),PISS2266(6,6,6),
. PISS3333(6,6,6),PISS3344(6,6,6),PISS3355(6,6,6),
. PISS3366(6,6,6),PISS4444(6,6,6),PISS4455(6,6,6),
. PISS4466(6,6,6),PISS5555(6,6,6),PISS5566(6,6,6),
. PISS6666(6,6,6),PISS1233(6,6,6),PISS1266(6,6,6),
. PISS1356(6,6,6),PISS1335(6,6,6),PISS1236(6,6,6),
. PISS3345(6,6,6),PISS2346(6,6,6),PISS2334(6,6,6),
. PISS4566(6,6,6),PISS1566(6,6,6),PISS2466(6,6,6),
. PISS3456(6,6,6)
DOUBLE PRECISION RASH,K2H,RAudH,RlPMH,IlPMH,lPuH,lPdH,
. luH,ldH,l3H,l4H,Il5H,Il6H,Il7H
DOUBLE PRECISION QSTSB
DOUBLE PRECISION ZHU,ZHD,ZS,vuq,vdq,TANBQ
DOUBLE PRECISION tanb,cosb,sinb,vu,vd
DOUBLE PRECISION G1Q,G2Q,GQ,ALSQ
DOUBLE PRECISION phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
DOUBLE PRECISION l,k,Alcos1,Akcos2,muq,nuq
DOUBLE PRECISION MH02(5,5),MHC2
DOUBLE PRECISION MHC,XC(2,2),MH0(5),XH(5,5),MA2
DOUBLE PRECISION XIF,XIS,MUP,MSP,M3H
DOUBLE PRECISION XIFQ,XISQ,MUPQ,MSPQ,M3HQ
DOUBLE PRECISION phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
DOUBLE PRECISION lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
DOUBLE PRECISION MHuS,MHdS,MSS
DOUBLE PRECISION IAL,IAK,IXIS
DOUBLE PRECISION DDCOS,DDSIN
COMMON/STSBSCALE/QSTSB
COMMON/QHIGGS/ZHU,ZHD,ZS,vuq,vdq,TANBQ
COMMON/TBPAR/tanb,cosb,sinb,vu,vd
COMMON/QGAUGE/G1Q,G2Q,GQ,ALSQ
COMMON/PHASES/phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
COMMON/QPAR/l,k,Alcos1,Akcos2,muq,NUQ
COMMON/SQUHIMASSM/MH02,MHC2
COMMON/HISPEC/MHC,XC,MH0,XH,MA2
COMMON/SUSYEXT/XIF,XIS,MUP,MSP,M3H
COMMON/QEXT/XIFQ,XISQ,MUPQ,MSPQ,M3HQ
COMMON/Z3VAUX/phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
COMMON/EFFPOTPAR/lu,ld,l3,l4,Rel5,Iml5,Rel6,Iml6,Rel7,Iml7,RAud,
. RAS,K2,lPu,lPd,RlPM,IlPM
COMMON/MH2TREE/MHuS,MHdS,MSS
COMMON/IMALAK/IAL,IAK,IXIS
PI=4d0*DATAN(1d0)
c Masses and rotation matrices
MW2=g2q/2.d0*(vuq**2+vdq**2)
MZ2=(g1q+g2q)/2.d0*(vuq**2+vdq**2)
MHTC(1)=MW2
MHTC(2)=MHC
DO I=1,5
MHT2(I)=MH0(I)
ENDDO
MHT2(6)=MZ2
sinbq=vuq/dsqrt(vuq**2+vdq**2)
cosbq=vdq/dsqrt(vuq**2+vdq**2)
DO I=1,5
XHT(I,1)=XH(I,1)
XHT(I,2)=XH(I,2)
XHT(I,3)=XH(I,3)
XHT(I,4)=XH(I,4)*cosbq
XHT(I,5)=XH(I,4)*sinbq
XHT(I,6)=XH(I,5)
ENDDO
DO J=1,6
XHT(6,J)=0.d0
ENDDO
XHT(6,4)=-sinbq
XHT(6,5)=cosbq
DO I=1,6
DO J=1,6
XHG(I,J)=0.d0
IF(I.eq.J)XHG(I,J)=1.d0
ENDDO
ENDDO
c Couplings
aux=0.d0
DO M=1,2
DO N=1,2
gRH0HpHm(1,M,N)=((g1q+g2q)/2.d0*vuq*XC(M,1)*XC(N,1)
. +(g2q-g1q)/2.d0*vuq*XC(M,2)*XC(N,2)
. -(l**2-g2q/2.d0)*vdq*(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1)))
. /dsqrt(2.d0)
gIH0HpHm(1,M,N)=0.d0
gRH0HpHm(2,M,N)=((g2q-g1q)/2.d0*vdq*XC(M,1)*XC(N,1)
. +(g2q+g1q)/2.d0*vdq*XC(M,2)*XC(N,2)
. -(l**2-g2q/2.d0)*vuq*(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1)))
. /dsqrt(2.d0)
gIH0HpHm(2,M,N)=0.d0
gRH0HpHm(3,M,N)=(2.d0*l*muq*(XC(M,1)*XC(N,1)+XC(M,2)*XC(N,2))
. +l*(Alcos1+2.d0*k/l*muq*DDCOS(Phi0)
. +MUPQ*DDCOS(Phi01-phiP))
. *(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1)))/dsqrt(2.d0)
gIH0HpHm(3,M,N)=-(k*muq*DDSIN(Phi0)
. +(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))*l/muq)
. *(XC(M,1)*XC(N,2)-XC(M,2)*XC(N,1))/dsqrt(2.d0)
gRH0HpHm(4,M,N)=0.d0
gIH0HpHm(4,M,N)=-(l**2-g2q/2.d0)*(vuq*sinbq+vdq*cosbq)
. *(XC(M,1)*XC(N,2)-XC(M,2)*XC(N,1))/dsqrt(2.d0)
gRH0HpHm(5,M,N)=(3.d0*k*muq*DDSIN(Phi0)+2d0*l
. *MUPQ*DDSIN(Phi01-phiP)
. +(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))*l/muq)
. *(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1))/dsqrt(2.d0)
gIH0HpHm(5,M,N)=-l*(Alcos1-2.d0*k/l*muq*DDCOS(Phi0)
. +MUPQ*DDCOS(Phi01-PhiP))
. *(XC(M,1)*XC(N,2)-XC(M,2)*XC(N,1))/dsqrt(2.d0)
ENDDO
ENDDO
c PIS(A,B,C,I,J,M)=XHT(I,A)*XHT(J,B)*XHT(M,C)
c c +XHT(I,A)*XHT(M,B)*XHT(J,C)+XHT(J,A)*XHT(I,B)*XHT(M,C)
c c +XHT(J,A)*XHT(M,B)*XHT(I,C)+XHT(M,A)*XHT(J,B)*XHT(I,C)
c c +XHT(M,A)*XHT(I,B)*XHT(J,C)
DO I=1,6
DO J=1,6
DO M=1,6
PIS111(I,J,M)=6.d0*XHG(I,1)*XHT(J,1)*XHT(M,1)
PIS122(I,J,M)=2.d0*(XHG(I,1)*XHT(J,2)*XHT(M,2)
. +XHG(I,2)*XHT(J,1)*XHT(M,2)+XHG(I,2)*XHT(J,2)*XHT(M,1))
PIS133(I,J,M)=2.d0*(XHG(I,1)*XHT(J,3)*XHT(M,3)
. +XHG(I,3)*XHT(J,1)*XHT(M,3)+XHG(I,3)*XHT(J,3)*XHT(M,1))
PIS144(I,J,M)=2.d0*(XHG(I,1)*XHT(J,4)*XHT(M,4)
. +XHG(I,4)*XHT(J,1)*XHT(M,4)+XHG(I,4)*XHT(J,4)*XHT(M,1))
PIS155(I,J,M)=2.d0*(XHG(I,1)*XHT(J,5)*XHT(M,5)
. +XHG(I,5)*XHT(J,1)*XHT(M,5)+XHG(I,5)*XHT(J,5)*XHT(M,1))
PIS166(I,J,M)=2.d0*(XHG(I,1)*XHT(J,6)*XHT(M,6)
. +XHG(I,6)*XHT(J,1)*XHT(M,6)+XHG(I,6)*XHT(J,6)*XHT(M,1))
PIS211(I,J,M)=2.d0*(XHG(I,2)*XHT(J,1)*XHT(M,1)
. +XHG(I,1)*XHT(J,2)*XHT(M,1)+XHG(I,1)*XHT(J,1)*XHT(M,2))
PIS222(I,J,M)=6.d0*XHG(I,2)*XHT(J,2)*XHT(M,2)
PIS233(I,J,M)=2.d0*(XHG(I,2)*XHT(J,3)*XHT(M,3)
. +XHG(I,3)*XHT(J,2)*XHT(M,3)+XHG(I,3)*XHT(J,3)*XHT(M,2))
PIS244(I,J,M)=2.d0*(XHG(I,2)*XHT(J,4)*XHT(M,4)
. +XHG(I,4)*XHT(J,2)*XHT(M,4)+XHG(I,4)*XHT(J,4)*XHT(M,2))
PIS255(I,J,M)=2.d0*(XHG(I,2)*XHT(J,5)*XHT(M,5)
. +XHG(I,5)*XHT(J,2)*XHT(M,5)+XHG(I,5)*XHT(J,5)*XHT(M,2))
PIS266(I,J,M)=2.d0*(XHG(I,2)*XHT(J,6)*XHT(M,6)
. +XHG(I,6)*XHT(J,2)*XHT(M,6)+XHG(I,6)*XHT(J,6)*XHT(M,2))
PIS311(I,J,M)=2.d0*(XHG(I,3)*XHT(J,1)*XHT(M,1)
. +XHG(I,1)*XHT(J,3)*XHT(M,1)+XHG(I,1)*XHT(J,1)*XHT(M,3))
PIS322(I,J,M)=2.d0*(XHG(I,3)*XHT(J,2)*XHT(M,2)
. +XHG(I,2)*XHT(J,3)*XHT(M,2)+XHG(I,2)*XHT(J,2)*XHT(M,3))
PIS333(I,J,M)=6.d0*XHG(I,3)*XHT(J,3)*XHT(M,3)
PIS344(I,J,M)=2.d0*(XHG(I,3)*XHT(J,4)*XHT(M,4)
. +XHG(I,4)*XHT(J,3)*XHT(M,4)+XHG(I,4)*XHT(J,4)*XHT(M,3))
PIS355(I,J,M)=2.d0*(XHG(I,3)*XHT(J,5)*XHT(M,5)
. +XHG(I,5)*XHT(J,3)*XHT(M,5)+XHG(I,5)*XHT(J,5)*XHT(M,3))
PIS366(I,J,M)=2.d0*(XHG(I,3)*XHT(J,6)*XHT(M,6)
. +XHG(I,6)*XHT(J,3)*XHT(M,6)+XHG(I,6)*XHT(J,6)*XHT(M,3))
PIS312(I,J,M)=XHG(I,3)*XHT(J,1)*XHT(M,2)
. +XHG(I,3)*XHT(J,2)*XHT(M,1)+XHG(I,1)*XHT(J,3)*XHT(M,2)
. +XHG(I,1)*XHT(J,2)*XHT(M,3)+XHG(I,2)*XHT(J,1)*XHT(M,3)
. +XHG(I,2)*XHT(J,3)*XHT(M,1)
PIS345(I,J,M)=XHG(I,3)*XHT(J,4)*XHT(M,5)
. +XHG(I,3)*XHT(J,5)*XHT(M,4)+XHG(I,4)*XHT(J,3)*XHT(M,5)
. +XHG(I,4)*XHT(J,5)*XHT(M,3)+XHG(I,5)*XHT(J,4)*XHT(M,3)
. +XHG(I,5)*XHT(J,3)*XHT(M,4)
PIS156(I,J,M)=XHG(I,1)*XHT(J,5)*XHT(M,6)
. +XHG(I,1)*XHT(J,6)*XHT(M,5)+XHG(I,5)*XHT(J,1)*XHT(M,6)
. +XHG(I,5)*XHT(J,6)*XHT(M,1)+XHG(I,6)*XHT(J,5)*XHT(M,1)
. +XHG(I,6)*XHT(J,1)*XHT(M,5)
PIS256(I,J,M)=XHG(I,2)*XHT(J,5)*XHT(M,6)
. +XHG(I,2)*XHT(J,6)*XHT(M,5)+XHG(I,5)*XHT(J,2)*XHT(M,6)
. +XHG(I,5)*XHT(J,6)*XHT(M,2)+XHG(I,6)*XHT(J,5)*XHT(M,2)
. +XHG(I,6)*XHT(J,2)*XHT(M,5)
PIS346(I,J,M)=XHG(I,3)*XHT(J,4)*XHT(M,6)
. +XHG(I,3)*XHT(J,6)*XHT(M,4)+XHG(I,4)*XHT(J,3)*XHT(M,6)
. +XHG(I,4)*XHT(J,6)*XHT(M,3)+XHG(I,6)*XHT(J,4)*XHT(M,3)
. +XHG(I,6)*XHT(J,3)*XHT(M,4)
PIS356(I,J,M)=XHG(I,3)*XHT(J,5)*XHT(M,6)
. +XHG(I,3)*XHT(J,6)*XHT(M,5)+XHG(I,5)*XHT(J,3)*XHT(M,6)
. +XHG(I,5)*XHT(J,6)*XHT(M,3)+XHG(I,6)*XHT(J,5)*XHT(M,3)
. +XHG(I,6)*XHT(J,3)*XHT(M,5)
PIS513(I,J,M)=XHG(I,5)*XHT(J,1)*XHT(M,3)
. +XHG(I,5)*XHT(J,3)*XHT(M,1)+XHG(I,1)*XHT(J,5)*XHT(M,3)
. +XHG(I,1)*XHT(J,3)*XHT(M,5)+XHG(I,3)*XHT(J,1)*XHT(M,5)
. +XHG(I,3)*XHT(J,5)*XHT(M,1)
PIS423(I,J,M)=XHG(I,4)*XHT(J,2)*XHT(M,3)
. +XHG(I,4)*XHT(J,3)*XHT(M,2)+XHG(I,2)*XHT(J,4)*XHT(M,3)
. +XHG(I,2)*XHT(J,3)*XHT(M,4)+XHG(I,3)*XHT(J,2)*XHT(M,4)
. +XHG(I,3)*XHT(J,4)*XHT(M,2)
PIS612(I,J,M)=XHG(I,6)*XHT(J,1)*XHT(M,2)
. +XHG(I,6)*XHT(J,2)*XHT(M,1)+XHG(I,1)*XHT(J,6)*XHT(M,2)
. +XHG(I,1)*XHT(J,2)*XHT(M,6)+XHG(I,6)*XHT(J,1)*XHT(M,2)
. +XHG(I,6)*XHT(J,2)*XHT(M,1)
PIS456(I,J,M)=XHG(I,4)*XHT(J,5)*XHT(M,6)
. +XHG(I,4)*XHT(J,6)*XHT(M,5)+XHG(I,5)*XHT(J,4)*XHT(M,6)
. +XHG(I,5)*XHT(J,6)*XHT(M,4)+XHG(I,6)*XHT(J,5)*XHT(M,4)
. +XHG(I,6)*XHT(J,4)*XHT(M,5)
PIS433(I,J,M)=2.d0*(XHG(I,4)*XHT(J,3)*XHT(M,3)
. +XHG(I,3)*XHT(J,4)*XHT(M,3)+XHG(I,3)*XHT(J,3)*XHT(M,4))
PIS613(I,J,M)=XHG(I,6)*XHT(J,1)*XHT(M,3)
. +XHG(I,6)*XHT(J,3)*XHT(M,1)+XHG(I,1)*XHT(J,6)*XHT(M,3)
. +XHG(I,1)*XHT(J,3)*XHT(M,6)+XHG(I,3)*XHT(J,1)*XHT(M,6)
. +XHG(I,3)*XHT(J,6)*XHT(M,1)
PIS466(I,J,M)=2.d0*(XHG(I,4)*XHT(J,6)*XHT(M,6)
. +XHG(I,6)*XHT(J,4)*XHT(M,6)+XHG(I,6)*XHT(J,6)*XHT(M,4))
PIS533(I,J,M)=2.d0*(XHG(I,5)*XHT(J,3)*XHT(M,3)
. +XHG(I,3)*XHT(J,5)*XHT(M,3)+XHG(I,3)*XHT(J,3)*XHT(M,5))
PIS623(I,J,M)=XHG(I,6)*XHT(J,2)*XHT(M,3)
. +XHG(I,6)*XHT(J,3)*XHT(M,2)+XHG(I,2)*XHT(J,6)*XHT(M,3)
. +XHG(I,2)*XHT(J,3)*XHT(M,6)+XHG(I,3)*XHT(J,2)*XHT(M,6)
. +XHG(I,3)*XHT(J,6)*XHT(M,2)
PIS566(I,J,M)=2.d0*(XHG(I,5)*XHT(J,6)*XHT(M,6)
. +XHG(I,6)*XHT(J,5)*XHT(M,6)+XHG(I,6)*XHT(J,6)*XHT(M,5))
PIS666(I,J,M)=6.d0*XHG(I,6)*XHT(J,6)*XHT(M,6)
PIS633(I,J,M)=2.d0*(XHG(I,6)*XHT(J,3)*XHT(M,3)
. +XHG(I,3)*XHT(J,6)*XHT(M,3)+XHG(I,3)*XHT(J,3)*XHT(M,6))
PIS246(I,J,M)=XHG(I,2)*XHT(J,4)*XHT(M,6)
. +XHG(I,2)*XHT(J,6)*XHT(M,4)+XHG(I,4)*XHT(J,2)*XHT(M,6)
. +XHG(I,4)*XHT(J,6)*XHT(M,2)+XHG(I,6)*XHT(J,4)*XHT(M,2)
. +XHG(I,6)*XHT(J,2)*XHT(M,4)
IF(k.ne.0d0)then
gHHH(I,J,M)=((g1q+g2q)/4.d0*(vuq*(PIS111(I,J,M)
. +PIS144(I,J,M)-PIS122(I,J,M)-PIS155(I,J,M))+vdq*
. (PIS222(I,J,M)+PIS255(I,J,M)-PIS211(I,J,M)-PIS244(I,J,M)))
. +l*muq*(PIS311(I,J,M)+PIS344(I,J,M)+PIS322(I,J,M)
. +PIS355(I,J,M))
. +l**2*vuq*(PIS122(I,J,M)+PIS155(I,J,M)
. +PIS133(I,J,M)+PIS166(I,J,M))+l**2*vdq*(PIS211(I,J,M)
. +PIS244(I,J,M)+PIS233(I,J,M)+PIS266(I,J,M))
. -l*Alcos1*(PIS312(I,J,M)-PIS345(I,J,M)-PIS156(I,J,M)
. -PIS246(I,J,M))
. +k/3.d0*Akcos2*(PIS333(I,J,M)-3.d0*PIS366(I,J,M))
. +2.d0*k**2*muq/l*(PIS333(I,J,M)+PIS366(I,J,M))
. -k*DDCOS(Phi0)*(2.d0*muq*(PIS312(I,J,M)-PIS345(I,J,M)
. +PIS156(I,J,M)+PIS246(I,J,M))+l*vdq*(PIS133(I,J,M)
. -PIS166(I,J,M)+2.d0*PIS346(I,J,M))+l*vuq*(PIS233(I,J,M)
. -PIS266(I,J,M)+2.d0*PIS356(I,J,M)))
. +k*DDSIN(Phi0)*(muq*(PIS513(I,J,M)+PIS423(I,J,M)
. -3.d0*PIS612(I,J,M)+3.d0*PIS456(I,J,M))+l*vdq*
. (PIS433(I,J,M)-2.d0*PIS613(I,J,M)-PIS466(I,J,M))
. +l*vuq*(PIS533(I,J,M)-2.d0*PIS623(I,J,M)
. -PIS566(I,J,M))
. +l*vuq*vdq/muq*(3.d0*PIS633(I,J,M)-PIS666(I,J,M)))
. -l*MUPQ*DDCOS(Phi01-phiP)*(PIS312(I,J,M)-PIS345(I,J,M)
. +PIS156(I,J,M)+PIS246(I,J,M))
. +k*MUPQ*DDCOS(Phi02-phiP)*(PIS333(I,J,M)+PIS366(I,J,M))
. -l/muq*(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))
. *(PIS612(I,J,M)+PIS423(I,J,M)+PIS513(I,J,M)-PIS456(I,J,M)
. +vuq*vdq*l**2/muq**2*(PIS633(I,J,M)-PIS666(I,J,M)/3d0))
. -2d0*l*MUPQ*DDSIN(Phi01-phiP)*(PIS612(I,J,M)
. +vuq*vdq*l**2/muq**2*(PIS666(I,J,M)/3d0-PIS633(I,J,M)))
. -4d0/3d0*k*MUPQ*DDSIN(Phi02-phiP)*PIS666(I,J,M)
. -l/muq*(l/muq*(XISQ*DDSIN(phiSQ)+XIFQ*MUPQ*DDSIN(PhiP-phIF))
. +MSPQ*DDSIN(PhiSPQ))*(PIS666(I,J,M)/3d0-PIS633(I,J,M))
. )/dsqrt(2.d0)
else
gHHH(I,J,M)=((g1q+g2q)/4.d0*(vuq*(PIS111(I,J,M)
. +PIS144(I,J,M)-PIS122(I,J,M)-PIS155(I,J,M))+vdq*
. (PIS222(I,J,M)+PIS255(I,J,M)-PIS211(I,J,M)-PIS244(I,J,M)))
. +l*muq*(PIS311(I,J,M)+PIS344(I,J,M)+PIS322(I,J,M)
. +PIS355(I,J,M))
. +l**2*vuq*(PIS122(I,J,M)+PIS155(I,J,M)
. +PIS133(I,J,M)+PIS166(I,J,M))+l**2*vdq*(PIS211(I,J,M)
. +PIS244(I,J,M)+PIS233(I,J,M)+PIS266(I,J,M))
. -l*Alcos1*(PIS312(I,J,M)-PIS345(I,J,M)-PIS156(I,J,M)
. -PIS246(I,J,M))
. -l*MUPQ*DDCOS(Phi01-phiP)*(PIS312(I,J,M)-PIS345(I,J,M)
. +PIS156(I,J,M)+PIS246(I,J,M))
. -l/muq*(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))
. *(PIS612(I,J,M)+PIS423(I,J,M)+PIS513(I,J,M)-PIS456(I,J,M))
. -2d0*l*MUPQ*DDSIN(Phi01-phiP)*PIS612(I,J,M)
. )/dsqrt(2.d0)
endif
c PISS(A,B,C,D,I,J,M,N)=XHT(I,A)*XHT(J,B)*XHT(N,C)*XHT(M,D)
c c +XHT(I,A)*XHT(J,B)*XHT(M,C)*XHT(N,D)
c c +XHT(I,A)*XHT(N,B)*XHT(J,C)*XHT(M,D)
c c +XHT(I,A)*XHT(N,B)*XHT(M,C)*XHT(J,D)
c c +XHT(I,A)*XHT(M,B)*XHT(N,C)*XHT(J,D)
c c +XHT(I,A)*XHT(M,B)*XHT(J,C)*XHT(N,D)
c c +XHT(J,A)*XHT(I,B)*XHT(N,C)*XHT(M,D)
c c +XHT(J,A)*XHT(I,B)*XHT(M,C)*XHT(N,D)
c c +XHT(J,A)*XHT(N,B)*XHT(I,C)*XHT(M,D)
c c +XHT(J,A)*XHT(N,B)*XHT(M,C)*XHT(I,D)
c c +XHT(J,A)*XHT(M,B)*XHT(I,C)*XHT(N,D)
c c +XHT(J,A)*XHT(M,B)*XHT(N,C)*XHT(I,D)
c c +XHT(N,A)*XHT(I,B)*XHT(J,C)*XHT(M,D)
c c +XHT(N,A)*XHT(I,B)*XHT(M,C)*XHT(J,D)
c c +XHT(N,A)*XHT(J,B)*XHT(I,C)*XHT(M,D)
c c +XHT(N,A)*XHT(J,B)*XHT(M,C)*XHT(I,D)
c c +XHT(N,A)*XHT(M,B)*XHT(I,C)*XHT(J,D)
c c +XHT(N,A)*XHT(M,B)*XHT(J,C)*XHT(I,D)
c c +XHT(M,A)*XHT(I,B)*XHT(J,C)*XHT(N,D)
c c +XHT(M,A)*XHT(I,B)*XHT(N,C)*XHT(J,D)
c c +XHT(M,A)*XHT(J,B)*XHT(I,C)*XHT(N,D)
c c +XHT(M,A)*XHT(J,B)*XHT(N,C)*XHT(I,D)
c c +XHT(M,A)*XHT(N,B)*XHT(I,C)*XHT(J,D)
c c +XHT(M,A)*XHT(N,B)*XHT(J,C)*XHT(I,D)
PISS1111(I,J,M)=24d0*XHG(I,1)*XHG(J,1)*XHT(M,1)*XHT(M,1)
PISS1122(I,J,M)=4.d0*(XHG(I,1)*XHG(J,1)*XHT(M,2)*XHT(M,2)
. +XHG(I,2)*XHG(J,2)*XHT(M,1)*XHT(M,1)
. +2.d0*(XHG(I,1)*XHG(J,2)+XHG(I,2)*XHG(J,1))
. *XHT(M,1)*XHT(M,2))
PISS1133(I,J,M)=4.d0*(XHG(I,1)*XHG(J,1)*XHT(M,3)*XHT(M,3)
. +XHG(I,3)*XHG(J,3)*XHT(M,1)*XHT(M,1)
. +2.d0*(XHG(I,1)*XHG(J,3)+XHG(I,3)*XHG(J,1))
. *XHT(M,1)*XHT(M,3))
PISS1144(I,J,M)=4.d0*(XHG(I,1)*XHG(J,1)*XHT(M,4)*XHT(M,4)
. +XHG(I,4)*XHG(J,4)*XHT(M,1)*XHT(M,1)
. +2.d0*(XHG(I,1)*XHG(J,4)+XHG(I,4)*XHG(J,1))
. *XHT(M,1)*XHT(M,4))
PISS1155(I,J,M)=4.d0*(XHG(I,1)*XHG(J,1)*XHT(M,5)*XHT(M,5)
. +XHG(I,5)*XHG(J,5)*XHT(M,1)*XHT(M,1)
. +2.d0*(XHG(I,1)*XHG(J,5)+XHG(I,5)*XHG(J,1))
. *XHT(M,1)*XHT(M,5))
PISS1166(I,J,M)=4.d0*(XHG(I,1)*XHG(J,1)*XHT(M,6)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,1)*XHT(M,1)
. +2.d0*(XHG(I,1)*XHG(J,6)+XHG(I,6)*XHG(J,1))
. *XHT(M,1)*XHT(M,6))
PISS2222(I,J,M)=24d0*XHG(I,2)*XHG(J,2)*XHT(M,2)*XHT(M,2)
PISS2233(I,J,M)=4.d0*(XHG(I,2)*XHG(J,2)*XHT(M,3)*XHT(M,3)
. +XHG(I,3)*XHG(J,3)*XHT(M,2)*XHT(M,2)
. +2.d0*(XHG(I,2)*XHG(J,3)+XHG(I,3)*XHG(J,2))
. *XHT(M,2)*XHT(M,3))
PISS2244(I,J,M)=4.d0*(XHG(I,2)*XHG(J,2)*XHT(M,4)*XHT(M,4)
. +XHG(I,4)*XHG(J,4)*XHT(M,2)*XHT(M,2)
. +2.d0*(XHG(I,2)*XHG(J,4)+XHG(I,4)*XHG(J,2))
. *XHT(M,2)*XHT(M,4))
PISS2255(I,J,M)=4.d0*(XHG(I,2)*XHG(J,2)*XHT(M,5)*XHT(M,5)
. +XHG(I,5)*XHG(J,5)*XHT(M,2)*XHT(M,2)
. +2.d0*(XHG(I,2)*XHG(J,5)+XHG(I,5)*XHG(J,2))
. *XHT(M,2)*XHT(M,5))
PISS2266(I,J,M)=4.d0*(XHG(I,2)*XHG(J,2)*XHT(M,6)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,2)*XHT(M,2)
. +2.d0*(XHG(I,2)*XHG(J,6)+XHG(I,6)*XHG(J,2))
. *XHT(M,2)*XHT(M,6))
PISS3333(I,J,M)=24d0*XHG(I,3)*XHG(J,3)*XHT(M,3)*XHT(M,3)
PISS3344(I,J,M)=4.d0*(XHG(I,3)*XHG(J,3)*XHT(M,4)*XHT(M,4)
. +XHG(I,4)*XHG(J,4)*XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,3)*XHG(J,4)+XHG(I,4)*XHG(J,3))
. *XHT(M,3)*XHT(M,4))
PISS3355(I,J,M)=4.d0*(XHG(I,3)*XHG(J,3)*XHT(M,5)*XHT(M,5)
. +XHG(I,5)*XHG(J,5)*XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,3)*XHG(J,5)+XHG(I,5)*XHG(J,3))
. *XHT(M,3)*XHT(M,5))
PISS3366(I,J,M)=4.d0*(XHG(I,3)*XHG(J,3)*XHT(M,6)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,3)*XHG(J,6)+XHG(I,6)*XHG(J,3))
. *XHT(M,3)*XHT(M,6))
PISS4444(I,J,M)=24d0*XHG(I,4)*XHG(J,4)*XHT(M,4)*XHT(M,4)
PISS4455(I,J,M)=4.d0*(XHG(I,4)*XHG(J,4)*XHT(M,5)*XHT(M,5)
. +XHG(I,5)*XHG(J,5)*XHT(M,4)*XHT(M,4)
. +2.d0*(XHG(I,4)*XHG(J,5)+XHG(I,5)*XHG(J,4))
. *XHT(M,4)*XHT(M,5))
PISS4466(I,J,M)=4.d0*(XHG(I,4)*XHG(J,4)*XHT(M,6)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,4)*XHT(M,4)
. +2.d0*(XHG(I,4)*XHG(J,6)+XHG(I,6)*XHG(J,4))
. *XHT(M,4)*XHT(M,6))
PISS5555(I,J,M)=24d0*XHG(I,5)*XHG(J,5)*XHT(M,5)*XHT(M,5)
PISS5566(I,J,M)=4.d0*(XHG(I,5)*XHG(J,5)*XHT(M,6)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,5)*XHT(M,5)
. +2.d0*(XHG(I,5)*XHG(J,6)+XHG(I,6)*XHG(J,5))
. *XHT(M,5)*XHT(M,6))
PISS6666(I,J,M)=24d0*XHG(I,6)*XHG(J,6)*XHT(M,6)*XHT(M,6)
PISS1233(I,J,M)=2.d0*((XHG(I,1)*XHG(J,2)+XHG(I,2)*XHG(J,1))
. *XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,1)*XHG(J,3)*XHT(M,2)*XHT(M,3)
. +XHG(I,3)*XHG(J,1)*XHT(M,2)*XHT(M,3)
. +XHG(I,2)*XHG(J,3)*XHT(M,1)*XHT(M,3)
. +XHG(I,3)*XHG(J,2)*XHT(M,1)*XHT(M,3)
. +XHG(I,3)*XHG(J,3)*XHT(M,1)*XHT(M,2)))
PISS1266(I,J,M)=2.d0*((XHG(I,1)*XHG(J,2)+XHG(I,2)*XHG(J,1))
. *XHT(M,6)*XHT(M,6)
. +2.d0*(XHG(I,1)*XHG(J,6)*XHT(M,2)*XHT(M,6)
. +XHG(I,6)*XHG(J,1)*XHT(M,2)*XHT(M,6)
. +XHG(I,2)*XHG(J,6)*XHT(M,1)*XHT(M,6)
. +XHG(I,6)*XHG(J,2)*XHT(M,1)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,1)*XHT(M,2)))
PISS3345(I,J,M)=2.d0*((XHG(I,4)*XHG(J,5)+XHG(I,5)*XHG(J,4))
. *XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,4)*XHG(J,3)*XHT(M,5)*XHT(M,3)
. +XHG(I,3)*XHG(J,4)*XHT(M,5)*XHT(M,3)
. +XHG(I,5)*XHG(J,3)*XHT(M,4)*XHT(M,3)
. +XHG(I,3)*XHG(J,5)*XHT(M,4)*XHT(M,3)
. +XHG(I,3)*XHG(J,3)*XHT(M,4)*XHT(M,5)))
PISS1335(I,J,M)=2.d0*((XHG(I,1)*XHG(J,5)+XHG(I,5)*XHG(J,1))
. *XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,1)*XHG(J,3)*XHT(M,5)*XHT(M,3)
. +XHG(I,3)*XHG(J,1)*XHT(M,5)*XHT(M,3)
. +XHG(I,5)*XHG(J,3)*XHT(M,1)*XHT(M,3)
. +XHG(I,3)*XHG(J,5)*XHT(M,1)*XHT(M,3)
. +XHG(I,3)*XHG(J,3)*XHT(M,1)*XHT(M,5)))
PISS2334(I,J,M)=2.d0*((XHG(I,4)*XHG(J,2)+XHG(I,2)*XHG(J,4))
. *XHT(M,3)*XHT(M,3)
. +2.d0*(XHG(I,4)*XHG(J,3)*XHT(M,2)*XHT(M,3)
. +XHG(I,3)*XHG(J,4)*XHT(M,2)*XHT(M,3)
. +XHG(I,2)*XHG(J,3)*XHT(M,4)*XHT(M,3)
. +XHG(I,3)*XHG(J,2)*XHT(M,4)*XHT(M,3)
. +XHG(I,3)*XHG(J,3)*XHT(M,4)*XHT(M,2)))
PISS4566(I,J,M)=2.d0*((XHG(I,4)*XHG(J,5)+XHG(I,5)*XHG(J,4))
. *XHT(M,6)*XHT(M,6)
. +2.d0*(XHG(I,4)*XHG(J,6)*XHT(M,5)*XHT(M,6)
. +XHG(I,6)*XHG(J,4)*XHT(M,5)*XHT(M,6)
. +XHG(I,5)*XHG(J,6)*XHT(M,4)*XHT(M,6)
. +XHG(I,6)*XHG(J,5)*XHT(M,4)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,4)*XHT(M,5)))
PISS1566(I,J,M)=2.d0*((XHG(I,1)*XHG(J,5)+XHG(I,5)*XHG(J,1))
. *XHT(M,6)*XHT(M,6)
. +2.d0*(XHG(I,1)*XHG(J,6)*XHT(M,5)*XHT(M,6)
. +XHG(I,6)*XHG(J,1)*XHT(M,5)*XHT(M,6)
. +XHG(I,5)*XHG(J,6)*XHT(M,1)*XHT(M,6)
. +XHG(I,6)*XHG(J,5)*XHT(M,1)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,1)*XHT(M,5)))
PISS2466(I,J,M)=2.d0*((XHG(I,4)*XHG(J,2)+XHG(I,2)*XHG(J,4))
. *XHT(M,6)*XHT(M,6)
. +2.d0*(XHG(I,4)*XHG(J,6)*XHT(M,2)*XHT(M,6)
. +XHG(I,6)*XHG(J,4)*XHT(M,2)*XHT(M,6)
. +XHG(I,2)*XHG(J,6)*XHT(M,4)*XHT(M,6)
. +XHG(I,6)*XHG(J,2)*XHT(M,4)*XHT(M,6)
. +XHG(I,6)*XHG(J,6)*XHT(M,4)*XHT(M,2)))
PISS1356(I,J,M)=2.d0*(XHG(I,1)*XHG(J,3)*XHT(M,5)*XHT(M,6)
. +XHG(I,1)*XHT(M,3)*XHG(J,5)*XHT(M,6)
. +XHG(I,1)*XHT(M,3)*XHT(M,5)*XHG(J,6)
. +XHG(J,1)*XHG(I,3)*XHT(M,5)*XHT(M,6)
. +XHG(J,1)*XHT(M,3)*XHG(I,5)*XHT(M,6)
. +XHG(J,1)*XHT(M,3)*XHT(M,5)*XHG(I,6)
. +XHT(M,1)*XHG(I,3)*XHG(J,5)*XHT(M,6)
. +XHT(M,1)*XHG(I,3)*XHT(M,5)*XHG(J,6)
. +XHT(M,1)*XHG(J,3)*XHG(I,5)*XHT(M,6)
. +XHT(M,1)*XHG(J,3)*XHT(M,5)*XHG(I,6)
. +XHT(M,1)*XHT(M,3)*XHG(I,5)*XHG(J,6)
. +XHT(M,1)*XHT(M,3)*XHG(J,5)*XHG(I,6))
PISS1236(I,J,M)=2.d0*(XHG(I,1)*XHG(J,2)*XHT(M,3)*XHT(M,6)
. +XHG(I,1)*XHT(M,2)*XHG(J,3)*XHT(M,6)
. +XHG(I,1)*XHT(M,2)*XHT(M,3)*XHG(J,6)
. +XHG(J,1)*XHG(I,2)*XHT(M,3)*XHT(M,6)
. +XHG(J,1)*XHT(M,2)*XHG(I,3)*XHT(M,6)
. +XHG(J,1)*XHT(M,2)*XHT(M,3)*XHG(I,6)
. +XHT(M,1)*XHG(I,2)*XHG(J,3)*XHT(M,6)
. +XHT(M,1)*XHG(I,2)*XHT(M,3)*XHG(J,6)
. +XHT(M,1)*XHG(J,2)*XHG(I,3)*XHT(M,6)
. +XHT(M,1)*XHG(J,2)*XHT(M,3)*XHG(I,6)
. +XHT(M,1)*XHT(M,2)*XHG(I,3)*XHG(J,6)
. +XHT(M,1)*XHT(M,2)*XHG(J,3)*XHG(I,6))
PISS2346(I,J,M)=2.d0*(XHG(I,2)*XHG(J,3)*XHT(M,4)*XHT(M,6)
. +XHG(I,2)*XHT(M,3)*XHG(J,4)*XHT(M,6)
. +XHG(I,2)*XHT(M,3)*XHT(M,4)*XHG(J,6)
. +XHG(J,2)*XHG(I,3)*XHT(M,4)*XHT(M,6)
. +XHG(J,2)*XHT(M,3)*XHG(I,4)*XHT(M,6)
. +XHG(J,2)*XHT(M,3)*XHT(M,4)*XHG(I,6)
. +XHT(M,2)*XHG(I,3)*XHG(J,4)*XHT(M,6)
. +XHT(M,2)*XHG(I,3)*XHT(M,4)*XHG(J,6)
. +XHT(M,2)*XHG(J,3)*XHG(I,4)*XHT(M,6)
. +XHT(M,2)*XHG(J,3)*XHT(M,4)*XHG(I,6)
. +XHT(M,2)*XHT(M,3)*XHG(I,4)*XHG(J,6)
. +XHT(M,2)*XHT(M,3)*XHG(J,4)*XHG(I,6))
PISS3456(I,J,M)=2.d0*(XHG(I,3)*XHG(J,4)*XHT(M,5)*XHT(M,6)
. +XHG(I,3)*XHT(M,4)*XHG(J,5)*XHT(M,6)
. +XHG(I,3)*XHT(M,4)*XHT(M,5)*XHG(J,6)
. +XHG(J,3)*XHG(I,4)*XHT(M,5)*XHT(M,6)
. +XHG(J,3)*XHT(M,4)*XHG(I,5)*XHT(M,6)
. +XHG(J,3)*XHT(M,4)*XHT(M,5)*XHG(I,6)
. +XHT(M,3)*XHG(I,4)*XHG(J,5)*XHT(M,6)
. +XHT(M,3)*XHG(I,4)*XHT(M,5)*XHG(J,6)
. +XHT(M,3)*XHG(J,4)*XHG(I,5)*XHT(M,6)
. +XHT(M,3)*XHG(J,4)*XHT(M,5)*XHG(I,6)
. +XHT(M,3)*XHT(M,4)*XHG(I,5)*XHG(J,6)
. +XHT(M,3)*XHT(M,4)*XHG(J,5)*XHG(I,6))
gHHHH(I,J,M)=((g1q+g2q)/8.d0*(PISS1111(I,J,M)
. +PISS2222(I,J,M)-2.d0*PISS1122(I,J,M)
. +PISS4444(I,J,M)+PISS5555(I,J,M)
. -2.d0*PISS4455(I,J,M)+2.d0*PISS1144(I,J,M)
. +2.d0*PISS2255(I,J,M)-2.d0*PISS1155(I,J,M)
. -2.d0*PISS2244(I,J,M))
. +l**2*(PISS1122(I,J,M)+PISS1133(I,J,M)
. +PISS2233(I,J,M)+PISS4455(I,J,M)
. +PISS4466(I,J,M)+PISS5566(I,J,M)
. +PISS1155(I,J,M)+PISS2244(I,J,M)
. +PISS1166(I,J,M)+PISS2266(I,J,M)
. +PISS3344(I,J,M)+PISS3355(I,J,M))
. -2.d0*k*l*DDCOS(Phi0)*(PISS1233(I,J,M)
. +PISS4566(I,J,M)-PISS3345(I,J,M)
. -PISS1266(I,J,M)+2.d0*PISS1356(I,J,M)
. +2.d0*PISS2346(I,J,M))
. +k**2*(PISS3333(I,J,M)+PISS6666(I,J,M)
. +2.d0*PISS3366(I,J,M))
. +2.d0*k*l*DDSIN(Phi0)*(PISS1335(I,J,M)
. +PISS2334(I,J,M)-2.d0*PISS1236(I,J,M)
. -PISS1566(I,J,M)-PISS2466(I,J,M)
. +2.d0*PISS3456(I,J,M)))/4.d0
ENDDO
ENDDO
ENDDO
************************************************************************************************
c A: Gauge contributions in the potential approach
c I- Neutral mass-matrix
aux=2.d0*g2q**2*dlog(MW2/QSTSB)
. +(g1q+g2q)**2*dlog(MZ2/QSTSB)
MH02(1,1)=MH02(1,1)+3.d0/64.d0/Pi**2*aux*vuq**2
MH02(2,2)=MH02(2,2)+3.d0/64.d0/Pi**2*aux*vdq**2
MH02(1,2)=MH02(1,2)+3.d0/64.d0/Pi**2*aux*vuq*vdq
MH02(2,1)=MH02(2,1)+3.d0/64.d0/Pi**2*aux*vuq*vdq
c II- Charged Higgs mass
aux=-2.d0*g1q*g2q*(dlog(MZ2/QSTSB)-1.d0)
MHC2=MHC2+3.d0/64.d0/Pi**2*aux*(vu**2+vd**2)
c minimization equations
MHuS=MHuS
. -3d0*g2q*MW2*(dlog(MW2/QSTSB)-1d0)/32d0/Pi**2
. -3d0*(g1q+g2q)*MZ2*(dlog(MZ2/QSTSB)-1d0)/64d0/Pi**2
MHdS=MHdS
. -3d0*g2q*MW2*(dlog(MW2/QSTSB)-1d0)/32d0/Pi**2
. -3d0*(g1q+g2q)*MZ2*(dlog(MZ2/QSTSB)-1d0)/64d0/Pi**2
c B: Higgs contributions
DO I=1,5
DO J=1,5
dMH0(I,J)=0.d0
ENDDO
ENDDO
c I- Higgs/Gauge loop contribution
c + (Remainder from the gauge contribution in the Feynman gauge)
c a) (W,charged Higgs) loops
aux=(2.d0*MHTC(2)-MW2)*fSF1(MHTC(2),MW2,QSTSB)
. -fSF0(MHTC(2),QSTSB)+fSF0(MW2,QSTSB)
dMH0(1,1)=dMH0(1,1)+g2q*aux/32.d0/Pi**2*cosbq**2
dMH0(2,2)=dMH0(2,2)+g2q*aux/32.d0/Pi**2*sinbq**2
dMH0(1,2)=dMH0(1,2)-g2q*aux/32.d0/Pi**2*sinbq*cosbq
dMH0(2,1)=dMH0(2,1)-g2q*aux/32.d0/Pi**2*sinbq*cosbq
dMH0(4,4)=dMH0(4,4)+g2q*aux/32.d0/Pi**2
c b) (Z,neutral Higgs) loops
aux=0.d0
DO M=1,5
aux=aux+((2.d0*MHT2(M)-MZ2)*fSF1(MHT2(M),MZ2,QSTSB)
. -fSF0(MHT2(M),QSTSB)+fSF0(MZ2,QSTSB))*XHT(M,4)**2
ENDDO
dMH0(1,1)=dMH0(1,1)+(g1q+g2q)*aux/64.d0/Pi**2
aux=0.d0
DO M=1,5
aux=aux+((2.d0*MHT2(M)-MZ2)*fSF1(MHT2(M),MZ2,QSTSB)
. -fSF0(MHT2(M),QSTSB)+fSF0(MZ2,QSTSB))*XHT(M,5)**2
ENDDO
dMH0(2,2)=dMH0(2,2)+(g1q+g2q)*aux/64.d0/Pi**2
aux=0.d0
DO M=1,5
aux=aux-((2.d0*MHT2(M)-MZ2)*fSF1(MHT2(M),MZ2,QSTSB)
. -fSF0(MHT2(M),QSTSB)+fSF0(MZ2,QSTSB))*XHT(M,4)*XHT(M,5)
ENDDO
dMH0(1,2)=dMH0(1,2)+(g1q+g2q)*aux/64.d0/Pi**2
dMH0(2,1)=dMH0(2,1)+(g1q+g2q)*aux/64.d0/Pi**2
aux=0.d0
DO M=1,5
aux=aux+((2.d0*MHT2(M)-MZ2)*fSF1(MHT2(M),MZ2,QSTSB)
. -fSF0(MHT2(M),QSTSB)+fSF0(MZ2,QSTSB))
. *(cosbq*XHT(M,1)-sinbq*XHT(M,2))**2
ENDDO
dMH0(4,4)=dMH0(4,4)+(g1q+g2q)*aux/64.d0/Pi**2
aux=0.d0
DO M=1,5
aux=aux-((2.d0*MHT2(M)-MZ2)*fSF1(MHT2(M),MZ2,QSTSB)
. -fSF0(MHT2(M),QSTSB)+fSF0(MZ2,QSTSB))
. *XHT(M,4)*(cosbq*XHT(M,1)-sinbq*XHT(M,2))
ENDDO
dMH0(1,4)=dMH0(1,4)+(g1q+g2q)*aux/64.d0/Pi**2
dMH0(4,1)=dMH0(4,1)+(g1q+g2q)*aux/64.d0/Pi**2
aux=0.d0
DO M=1,5
aux=aux+((2.d0*MHT2(M)-MZ2)*fSF1(MHT2(M),MZ2,QSTSB)
. -fSF0(MHT2(M),QSTSB)+fSF0(MZ2,QSTSB))
. *XHT(M,5)*(cosbq*XHT(M,1)-sinbq*XHT(M,2))
ENDDO
dMH0(2,4)=dMH0(2,4)+(g1q+g2q)*aux/64.d0/Pi**2
dMH0(4,2)=dMH0(4,2)+(g1q+g2q)*aux/64.d0/Pi**2
c II- Charged Higgs loop contribution
c a) A0 loop - Tadpole
aux=0.d0
DO M=1,2
aux=aux-fSF0(MHTC(M),QSTSB)
. *(l**2-g2q/2.d0)*vdq/vuq*XC(M,1)*XC(M,2)
ENDDO
dMH0(1,1)=dMH0(1,1)+aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux-fSF0(MHTC(M),QSTSB)
. *(l**2-g2q/2.d0)*vuq/vdq*XC(M,1)*XC(M,2)
ENDDO
dMH0(2,2)=dMH0(2,2)+aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)
. *(l**2-g2q/2.d0)*XC(M,1)*XC(M,2)
ENDDO
dMH0(1,2)=dMH0(1,2)+aux/16.d0/Pi**2
dMH0(2,1)=dMH0(2,1)+aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux-fSF0(MHTC(M),QSTSB)
. *(l**2-g2q/2.d0)/sinbq/cosbq*XC(M,1)*XC(M,2)
ENDDO
dMH0(4,4)=dMH0(4,4)+aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)
. *l**2*(Alcos1+MUPQ*DDCOS(phi01-phiP))/muq*XC(M,1)*XC(M,2)
ENDDO
dMH0(3,3)=dMH0(3,3)+aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)
. *l**2/muq*(Alcos1+4.d0*k/l*muq*DDCOS(Phi0))*XC(M,1)*XC(M,2)
ENDDO
dMH0(5,5)=dMH0(5,5)+aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+4.d0*fSF0(MHTC(M),QSTSB)
. *k*l*DDSIN(Phi0)*XC(M,1)*XC(M,2)
ENDDO
dMH0(3,5)=dMH0(3,5)+aux/16.d0/Pi**2
dMH0(5,3)=dMH0(5,3)+aux/16.d0/Pi**2
c minimization conditions
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)
. *((g1q+g2q)/4d0*XC(M,1)*XC(M,1)
. +(-g1q+g2q)/4d0*XC(M,2)*XC(M,2)
. -(l**2-g2q/2.d0)*vdq/vuq*XC(M,1)*XC(M,2))
ENDDO
MHuS=MHuS-aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)
. *((g1q+g2q)/4d0*XC(M,2)*XC(M,2)
. +(-g1q+g2q)/4d0*XC(M,1)*XC(M,1)
. -(l**2-g2q/2.d0)*vuq/vdq*XC(M,1)*XC(M,2))
ENDDO
MHdS=MHdS-aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)
. *(l**2*(XC(M,1)*XC(M,1)+XC(M,2)*XC(M,2))
. +l**2/muq*(Alcos1+MUPQ*DDCOS(phi01-phiP)
. +2d0*k/l*muq*DDCOS(phi0))*XC(M,1)*XC(M,2))
ENDDO
MSS=MSS-aux/16.d0/Pi**2
aux=0.d0
DO M=1,2
aux=aux+fSF0(MHTC(M),QSTSB)*XC(M,1)*XC(M,2)
. *(l/muq*(M3HQ*DDSIN(phi3q)+l*XIFQ*DDSIN(phi01-phiF))
. +3d0*k*muq*DDSIN(phi0)+2d0*l*MUPQ*DDSIN(phi01-phiP))
ENDDO
IF(k.ne.0d0)THEN
IAk=IAk+aux/k*(l/muq)**2/16.d0/Pi**2
ELSE
IXIS=IXIS+aux/16.d0/Pi**2
ENDIF
c b) B0 loop
DO I=1,5
DO J=1,5
DO M=1,2
DO N=1,2
aux=-(gRH0HpHm(I,M,N)*gRH0HpHm(J,M,N)+gIH0HpHm(I,M,N)*
. gIH0HpHm(J,M,N))*fSF1(MHTC(M),MHTC(N),QSTSB)
dMH0(I,J)=dMH0(I,J)+aux/16.d0/Pi**2
ENDDO
ENDDO
ENDDO
ENDDO
c III- Neutral Higgs loop contribution
c a) A0 loop
DO I=1,3
DO J=1,3
aux=0.d0
DO M=1,6
aux=aux-gHHHH(I,J,M)*fSF0(MHT2(M),QSTSB)
ENDDO
dMH0(I,J)=dMH0(I,J)+aux/32.d0/Pi**2
ENDDO
ENDDO
aux=0.d0
DO M=1,6
aux=aux-(cosbq**2*gHHHH(4,4,M)+sinbq**2*gHHHH(5,5,M)
. +sinbq*cosbq*(gHHHH(4,5,M)+gHHHH(5,4,M)))
. *fSF0(MHT2(M),QSTSB)
ENDDO
dMH0(4,4)=dMH0(4,4)+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
aux=aux-gHHHH(6,6,M)*fSF0(MHT2(M),QSTSB)
ENDDO
dMH0(5,5)=dMH0(5,5)+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
aux=aux-(cosbq*gHHHH(4,6,M)+sinbq*gHHHH(5,6,M))
. *fSF0(MHT2(M),QSTSB)
ENDDO
dMH0(4,5)=dMH0(4,5)+aux/32.d0/Pi**2
dMH0(5,4)=dMH0(5,4)+aux/32.d0/Pi**2
DO I=1,3
aux=0.d0
DO M=1,6
aux=aux-(cosbq*gHHHH(4,I,M)+sinbq*gHHHH(5,I,M))
. *fSF0(MHT2(M),QSTSB)
ENDDO
dMH0(4,I)=dMH0(4,I)+aux/32.d0/Pi**2
dMH0(I,4)=dMH0(I,4)+aux/32.d0/Pi**2
ENDDO
DO I=1,3
aux=0.d0
DO M=1,6
aux=aux-gHHHH(6,I,M)*fSF0(MHT2(M),QSTSB)
ENDDO
dMH0(5,I)=dMH0(5,I)+aux/32.d0/Pi**2
dMH0(I,5)=dMH0(I,5)+aux/32.d0/Pi**2
ENDDO
c b) Tadpoles
aux=0.d0
DO M=1,6
aux=aux-gHHH(1,M,M)*fSF0(MHT2(M),QSTSB)/dsqrt(2.d0)/vuq
ENDDO
dMH0(1,1)=dMH0(1,1)-aux/32.d0/Pi**2
dMH0(4,4)=dMH0(4,4)-aux/32.d0/Pi**2*cosbq**2
MHuS=MHuS+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
aux=aux-gHHH(2,M,M)*fSF0(MHT2(M),QSTSB)/dsqrt(2.d0)/vdq
ENDDO
dMH0(2,2)=dMH0(2,2)-aux/32.d0/Pi**2
dMH0(4,4)=dMH0(4,4)-aux/32.d0/Pi**2*sinbq**2
MHdS=MHdS+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
aux=aux-gHHH(3,M,M)*fSF0(MHT2(M),QSTSB)/dsqrt(2.d0)*l/muq
ENDDO
dMH0(3,3)=dMH0(3,3)-aux/32.d0/Pi**2
dMH0(5,5)=dMH0(5,5)-aux/32.d0/Pi**2
MSS=MSS+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
aux=aux-gHHH(4,M,M)*fSF0(MHT2(M),QSTSB)/dsqrt(2.d0)/vdq
ENDDO
dMH0(1,4)=dMH0(1,4)-aux/32.d0/Pi**2*sinbq
dMH0(4,1)=dMH0(4,1)-aux/32.d0/Pi**2*sinbq
dMH0(2,4)=dMH0(2,4)-aux/32.d0/Pi**2*cosbq
dMH0(4,2)=dMH0(4,2)-aux/32.d0/Pi**2*cosbq
dMH0(1,5)=dMH0(1,5)-aux/32.d0/Pi**2*vdq*l/muq
dMH0(5,1)=dMH0(5,1)-aux/32.d0/Pi**2*vdq*l/muq
dMH0(2,5)=dMH0(2,5)-aux/32.d0/Pi**2*vuq*l/muq
dMH0(5,2)=dMH0(5,2)-aux/32.d0/Pi**2*vuq*l/muq
dMH0(3,4)=dMH0(3,4)-aux/32.d0/Pi**2*l/muq
. *dsqrt(vuq**2+vdq**2)
dMH0(4,3)=dMH0(4,3)-aux/32.d0/Pi**2*l/muq
. *dsqrt(vuq**2+vdq**2)
dMH0(3,5)=dMH0(3,5)+2.d0*aux/32.d0/Pi**2*vuq*vdq*(l/muq)**2
dMH0(5,3)=dMH0(5,3)+2.d0*aux/32.d0/Pi**2*vuq*vdq*(l/muq)**2
IAl=IAl+aux/32.d0/Pi**2/muq
aux=0.d0
DO M=1,6
aux=aux-gHHH(6,M,M)*fSF0(MHT2(M),QSTSB)/dsqrt(2.d0)*l/muq
ENDDO
dMH0(3,5)=dMH0(3,5)-2.d0*aux/32.d0/Pi**2
dMH0(5,3)=dMH0(5,3)-2.d0*aux/32.d0/Pi**2
IF(k.ne.0d0)THEN
IAk=IAk-aux/32d0/Pi**2/k*(l/muq)**2
ELSE
IXIS=IXIS-aux/32d0/Pi**2
ENDIF
c c) B0 loop
DO I=1,3
DO J=1,3
aux=0.d0
DO M=1,6
DO N=1,6
aux=aux-gHHH(I,M,N)*gHHH(J,N,M)
. *fSF1(MHT2(M),MHT2(N),QSTSB)
ENDDO
ENDDO
dMH0(I,J)=dMH0(I,J)+aux/32.d0/Pi**2
ENDDO
ENDDO
aux=0.d0
DO M=1,6
DO N=1,6
aux=aux-(gHHH(4,M,N)*gHHH(4,N,M)*cosbq**2
. +gHHH(5,M,N)*gHHH(5,N,M)*sinbq**2+sinbq*cosbq*
. (gHHH(4,M,N)*gHHH(5,N,M)+gHHH(5,M,N)*gHHH(4,N,M)))
. *fSF1(MHT2(M),MHT2(N),QSTSB)
ENDDO
ENDDO
dMH0(4,4)=dMH0(4,4)+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
DO N=1,6
aux=aux-gHHH(6,M,N)*gHHH(6,N,M)
. *fSF1(MHT2(M),MHT2(N),QSTSB)
ENDDO
ENDDO
dMH0(5,5)=dMH0(5,5)+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
DO N=1,6
aux=aux-(cosbq*gHHH(4,M,N)+sinbq*gHHH(5,M,N))
. *gHHH(6,N,M)*fSF1(MHT2(M),MHT2(N),QSTSB)
ENDDO
ENDDO
dMH0(4,5)=dMH0(4,5)+aux/32.d0/Pi**2
dMH0(5,4)=dMH0(5,4)+aux/32.d0/Pi**2
DO I=1,3
aux=0.d0
DO M=1,6
DO N=1,6
aux=aux-(cosbq*gHHH(4,M,N)+sinbq*gHHH(5,M,N))
. *gHHH(I,N,M)*fSF1(MHT2(M),MHT2(N),QSTSB)
ENDDO
ENDDO
dMH0(4,I)=dMH0(4,I)+aux/32.d0/Pi**2
dMH0(I,4)=dMH0(I,4)+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
DO N=1,6
aux=aux-gHHH(6,M,N)*gHHH(I,N,M)
. *fSF1(MHT2(M),MHT2(N),QSTSB)
ENDDO
ENDDO
dMH0(5,I)=dMH0(5,I)+aux/32.d0/Pi**2
dMH0(I,5)=dMH0(I,5)+aux/32.d0/Pi**2
ENDDO
c IV- Corrections to the charged-Higgs mass
c a) Higgs/gauge loop
c (+ remainder from gauge contr. in the Feynman gauge)
aux=-g2q*fSF0(MW2,QSTSB)
. -(g1q-g2q)**2/2.d0/(g1q+g2q)*fSF0(MZ2,QSTSB)
dMHC=aux/32.d0/Pi**2
aux=0.d0
DO M=1,5
aux=aux+g2q*(cosbq**2*(XHT(M,1)**2+XHT(M,4)**2)
. +sinbq**2*(XHT(M,2)**2+XHT(M,5)**2)
. -2.d0*sinbq*cosbq*(XHT(M,1)*XHT(M,2)-XHT(M,4)*XHT(M,5)))
. *((2.d0*MHT2(M)-MW2)*fSF1(MW2,MHT2(M),QSTSB)
. -fSF0(MHT2(M),QSTSB)+2.d0*fSF0(MW2,QSTSB))
ENDDO
dMHC=dMHC+aux/64.d0/Pi**2
aux=g1q*g2q/(g1q+g2q)*fSF0(MHTC(2),QSTSB)
dMHC=dMHC+aux/16.d0/Pi**2
aux=(g1q-g2q)**2/(g1q+g2q)/4.d0
. *((2.d0*MHTC(2)-MZ2)*fSF1(MZ2,MHTC(2),QSTSB)
. -fSF0(MHTC(2),QSTSB)+2.d0*fSF0(MZ2,QSTSB))
dMHC=dMHC+aux/16.d0/Pi**2
c b) Charged Higgs A0 loop - Tadpole
aux=0.d0
DO M=1,2
aux=aux-(l**2*(cosbq*XC(M,2)+sinbq*XC(M,1))**2
. +(g1q+g2q)/4.d0*((2.d0*cosbq**2-sinbq**2)*XC(M,1)**2
. +(2.d0*sinbq**2-cosbq**2)*XC(M,2)**2-2.d0*sinbq*cosbq
. *XC(M,1)*XC(M,2))
. +(l**2-g2q/2.d0)*(cosbq**4+sinbq**4)/sinbq/cosbq
. *XC(M,1)*XC(M,2)
. -(g2q+g1q*(cosbq**2-sinbq**2)*(XC(M,1)**2-XC(M,2)**2))/4.d0)
. *fSF0(MHTC(M),QSTSB)
ENDDO
dMHC=dMHC+aux/16.d0/Pi**2
c c) Neutral Higgs A0 loop - Tadpole
aux=0.d0
DO M=1,6
aux=aux-((g2q+g1q*(cosbq**2-sinbq**2))/4.d0
. *(XHT(M,1)**2+XHT(M,4)**2)
. +(g2q-g1q*(cosbq**2-sinbq**2))/4.d0
. *(XHT(M,2)**2+XHT(M,5)**2)
. -(2.d0*l**2-g2q)*(XHT(M,1)*XHT(M,2)-XHT(M,4)*XHT(M,5))
. *sinbq*cosbq
. +l*(l+2.d0*k*DDCOS(Phi0)*sinbq*cosbq)*XHT(M,3)**2
. +l*(l-2.d0*k*DDCOS(Phi0)*sinbq*cosbq)*XHT(M,6)**2
. +4.d0*k*l*DDSIN(Phi0)*sinbq*cosbq*XHT(M,3)*XHT(M,6))
. *fSF0(MHT2(M),QSTSB)
ENDDO
dMHC=dMHC+aux/32.d0/Pi**2
aux=0.d0
DO M=1,6
aux=aux-(gHHH(1,M,M)/vuq*cosbq**2+gHHH(2,M,M)/vdq*sinbq**2)
. *fSF0(MHT2(M),QSTSB)/dsqrt(2.d0)
ENDDO
dMHC=dMHC-aux/32.d0/Pi**2
c d) B0 loop
aux=0.d0
DO M=1,2
DO N=1,6
DO I=1,5
DO J=1,5
aux=aux-XHT(N,I)*XHT(N,J)*(gRH0HpHm(I,M,2)*gRH0HpHm(J,2,M)
. +gIH0HpHm(I,M,2)*gIH0HpHm(J,2,M))*fSF1(MHT2(N),MHTC(M),QSTSB)
ENDDO
ENDDO
ENDDO
ENDDO
dMHC=dMHC+aux/16/Pi**2
c print*,'dMH0_1*',dMH0(1,1),dMH0(1,2),dMH0(1,3),dMH0(1,4),
c c dMH0(1,5)
c print*,'dMH0_2*',dMH0(2,1),dMH0(2,2),dMH0(2,3),dMH0(2,4),
c c dMH0(2,5)
c print*,'dMH0_3*',dMH0(3,1),dMH0(3,2),dMH0(3,3),dMH0(3,4),
c c dMH0(3,5)
c print*,'dMH0_4*',dMH0(4,1),dMH0(4,2),dMH0(4,3),dMH0(4,4),
c c dMH0(4,5)
c print*,'dMH0_5*',dMH0(5,1),dMH0(5,2),dMH0(5,3),dMH0(5,4),
c c dMH0(5,5)
c print*,'dMHC',dMHC
aux=Max(dabs(XIS),dabs(MSP),dabs(XIF),dabs(MUP),dabs(M3H))
IF(aux.le.1d-4)THEN
c Z3-conserving version
c V- Reconstruction of the Z3-conserving parameters
c (-sign because we computed self-tadpole and dm2=-that)
RASH=l/muq*(dMH0(5,5)-vuq*vdq*l/muq*(2.d0*l/muq*sinbq*cosbq
. *dMH0(4,4)-dMH0(4,5)/dsqrt(vuq**2+vdq**2)))/3.d0
K2H=-(l/muq)**2*(dMH0(3,3)+dMH0(5,5)/3.d0
. -4.d0/3.d0*vuq*vdq*sinbq*cosbq*(l/muq)**2*dMH0(4,4))/4.d0
RAudH=-(2.d0*l/muq*sinbq*cosbq*dMH0(4,4)
. +dMH0(4,5)/dsqrt(vuq**2+vdq**2))/3.d0
RlPMH=-l/muq*(l/muq*sinbq*cosbq*dMH0(4,4)
. -dMH0(4,5)/dsqrt(vuq**2+vdq**2))/3.d0
IlPMH=-(dMH0(3,5)/vuq/vdq-dMH0(3,4)*l/muq/dsqrt(vuq**2+vdq**2))
. /3.d0
lPuH=-l/muq*(dMH0(1,3)+cosbq/3.d0*(-dMH0(4,5)
. +4.d0*vuq*cosbq*l/muq*dMH0(4,4)))/2.d0/vuq
lPdH=-l/muq*(dMH0(2,3)+sinbq/3.d0*(-dMH0(4,5)
. +4.d0*vuq*cosbq*l/muq*dMH0(4,4)))/2.d0/vdq
luH=-(dMH0(1,1)-cosbq**2*dMH0(4,4))/2.d0/vuq**2
ldH=-(dMH0(2,2)-sinbq**2*dMH0(4,4))/2.d0/vdq**2
l3H=-(dMH0(1,2)+sinbq*cosbq*(2.d0*dMHC-dMH0(4,4)))/2.d0/vuq/vdq
l4H=-(dMH0(4,4)-dMHC)/(vuq**2+vdq**2)
Il5H=-(l/muq)**2/vuq/vdq*(dMH0(3,5)/vuq/vdq
. -4.d0*dMH0(3,4)*l/muq/dsqrt(vuq**2+vdq**2))/3.d0
Il6H=-(dMH0(1,4)/dsqrt(vuq**2+vdq**2)+Il5H*vdq)/2.d0/vuq
Il7H=-(dMH0(2,4)/dsqrt(vuq**2+vdq**2)+Il5H*vuq)/2.d0/vdq
RAS=RAS+RASH
K2=K2+K2H
RAud=RAud+RAudH
RlPM=RlPM+RlPMH
IlPM=IlPM+IlPMH
lPu=lPu+lPuH
lPd=lPd+lPdH
lu=lu+luH
ld=ld+ldH
l3=l3+l3H
l4=l4+l4H
Iml5=Iml5+Il5H
Iml6=Iml6+Il6H
Iml7=Iml7+Il7H
c VI- Inclusion of the corrections to the Higgs mass
aux=2.d0*luH*vuq**2+(RAudH+RlPMH*muq/l)*muq/l*vdq/vuq
MH02(1,1)=MH02(1,1)+aux
aux=2.d0*ldH*vdq**2+(RAudH+RlPMH*muq/l)*muq/l*vuq/vdq
MH02(2,2)=MH02(2,2)+aux
aux=-(RAudH+RlPMH*muq/l)*muq/l+2.d0*(l3H+l4H)*vuq*vdq
MH02(1,2)=MH02(1,2)+aux
MH02(2,1)=MH02(2,1)+aux
aux=-(RAudH+2.d0*RlPMH*muq/l)*vdq+2.d0*lPuH*vuq*muq/l
MH02(1,3)=MH02(1,3)+aux
MH02(3,1)=MH02(3,1)+aux
aux=-(RAudH+2.d0*RlPMH*muq/l)*vuq+2.d0*lPdH*vdq*muq/l
MH02(2,3)=MH02(2,3)+aux
MH02(3,2)=MH02(3,2)+aux
MH02(3,3)=MH02(3,3)+(RASH+4.d0*K2H*muq/l)*muq/l
. +l/muq*vuq*vdq*RAudH
aux=(RAudH+RlPMH*muq/l)*muq/l
MH02(4,4)=MH02(4,4)+aux*(vu**2+vd**2)/vuq/vdq
aux=(RAudH-2.d0*RlPMH*muq/l)
MH02(4,5)=MH02(4,5)+aux*dsqrt(vu**2+vd**2)
MH02(5,4)=MH02(5,4)+aux*dsqrt(vu**2+vd**2)
aux=-3.d0*muq/l*RASH
. +(RAudH+4.d0*RlPMH*muq/l)*vuq*vdq*l/muq
MH02(5,5)=MH02(5,5)+aux
aux=(2.d0*Il6H*vuq-Il5H*vdq)
MH02(1,4)=MH02(1,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,1)=MH02(4,1)+aux*dsqrt(vu**2+vd**2)
aux=(2.d0*Il7H*vdq-Il5H*vuq)
MH02(2,4)=MH02(2,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,2)=MH02(4,2)+aux*dsqrt(vu**2+vd**2)
aux=-3.d0*IlPMH*muq/l
. -(Il5H*vuq*vdq-2.d0*Il6H*vuq**2)*l/muq
MH02(1,5)=MH02(1,5)+aux*vdq
MH02(5,1)=MH02(5,1)+aux*vdq
aux=-3.d0*IlPMH*muq/l
. -(Il5H*vuq*vdq-2.d0*Il7H*vdq**2)*l/muq
MH02(2,5)=MH02(2,5)+aux*vuq
MH02(5,2)=MH02(5,2)+aux*vuq
aux=IlPMH*muq/l-Il5H*vuq*vdq*l/muq
MH02(3,4)=MH02(3,4)+aux*dsqrt(vu**2+vd**2)
MH02(4,3)=MH02(4,3)+aux*dsqrt(vu**2+vd**2)
aux=(4.d0*IlPMH-Il5H*vuq*vdq/(muq/l)**2)*vuq*vdq
MH02(3,5)=MH02(3,5)+aux
MH02(5,3)=MH02(5,3)+aux
aux=(RAudH+RlPMH*muq/l)*muq/l-l4H*vuq*vdq
MHC2=MHC2+aux*(vu**2+vd**2)/vuq/vdq
ELSE
c Z3-violating version
c Vbis- Inclusion of the corrections to the Higgs mass
MH02(1,1)=MH02(1,1)-dMH0(1,1)
MH02(2,2)=MH02(2,2)-dMH0(2,2)
MH02(1,2)=MH02(1,2)-dMH0(1,2)
MH02(2,1)=MH02(2,1)-dMH0(2,1)
MH02(1,3)=MH02(1,3)-dMH0(1,3)
MH02(3,1)=MH02(3,1)-dMH0(3,1)
MH02(2,3)=MH02(2,3)-dMH0(2,3)
MH02(3,2)=MH02(3,2)-dMH0(3,2)
MH02(3,3)=MH02(3,3)-dMH0(3,3)
MH02(4,4)=MH02(4,4)-dMH0(4,4)*(vu**2+vd**2)/(vuq**2+vdq**2)
MH02(4,5)=MH02(4,5)-dMH0(4,5)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(5,4)=MH02(5,4)-dMH0(5,4)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(5,5)=MH02(5,5)-dMH0(5,5)
MH02(1,4)=MH02(1,4)-dMH0(1,4)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(4,1)=MH02(4,1)-dMH0(4,1)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(2,4)=MH02(2,4)-dMH0(2,4)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(4,2)=MH02(4,2)-dMH0(4,2)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(1,5)=MH02(1,5)-dMH0(1,5)
MH02(5,1)=MH02(5,1)-dMH0(5,1)
MH02(2,5)=MH02(2,5)-dMH0(2,5)
MH02(5,2)=MH02(5,2)-dMH0(5,2)
MH02(3,4)=MH02(3,4)-dMH0(3,4)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(4,3)=MH02(4,3)-dMH0(4,3)
. *dsqrt((vu**2+vd**2)/(vuq**2+vdq**2))
MH02(3,5)=MH02(3,5)-dMH0(3,5)
MH02(5,3)=MH02(5,3)-dMH0(5,3)
MHC2=MHC2-dMHC*(vu**2+vd**2)/(vuq**2+vdq**2)
c VIbis- Effective potential parameters (under construction)
ENDIF
c print*,'MH02_1*',MH02(1,1),MH02(1,2),MH02(1,3),MH02(1,4),MH02(1,5)
c print*,'MH02_2*',MH02(2,1),MH02(2,2),MH02(2,3),MH02(2,4),MH02(2,5)
c print*,'MH02_3*',MH02(3,1),MH02(3,2),MH02(3,3),MH02(3,4),MH02(3,5)
c print*,'MH02_4*',MH02(4,1),MH02(4,2),MH02(4,3),MH02(4,4)
c c /(ZHu*ZHd),MH02(4,5)/dsqrt(Zs*ZHu*ZHd)
c print*,'MH02_5*',MH02(5,1),MH02(5,2),MH02(5,3),MH02(5,4),MH02(5,5)
c print*,'MHC2',MHC2 !/(ZHu*ZHd)
RETURN
END
************************************************************************************************
SUBROUTINE MHIGGSLOOP_POLE_CPV(PAR,IFAIL)
c One-loop corrections to the Higgs potential
c - DRbar-masses and pole corrections
c - The corrected squared-mass matrices in the Higgs sector (stored in
c the common SQUHIMASSM) are rescaled according to the wave-function
c renormalization factors (see init_CPV.f) and diagonalized.
c - Momentum-depENDent (pole) corrections are added to the squared-mass
c eigenvalues.
c - The pole-corrected squared-masses for the charged-Higgs, MHC2, and
c neutral-Higgs, MH0(i), (i=1..5), replace their tree-level counterparts
c in the common HISPEC. Same thing for the rotation matrices XC and XH.
c This concludes the calculation of the radiative corrections to the Higgs
c squared masses. IF a squared-mass becomes negative, IFAIL.NE.0.
c The trilinear Higgs-Sfermion couplings have also been computed
c meanwhile, and they are stored in the common HISFCOUP.
IMPLICIT NONE
INTEGER I,J,M,N,IFAIL
DOUBLE PRECISION PAR(*)
DOUBLE PRECISION aux,Pi,VALPH(5),VECPH(5,5),NMB0,fSF0,fSF1
DOUBLE PRECISION muH2,MW2,MZ2,sinbq,cosbq,MHT2(6),XHT(6,6)
DOUBLE PRECISION MHTC(2),Ytau,gRHSS,gIHSS,XHG(5,6),DELT(2,2)
DOUBLE PRECISION PIS111,PIS122,PIS133,PIS144,PIS155,PIS166,
. PIS211,PIS222,PIS233,PIS244,PIS255,PIS266,PIS311,PIS322,
. PIS333,PIS344,PIS355,PIS366,PIS312,PIS345,PIS156,PIS256,
. PIS346,PIS356,PIS513,PIS423,PIS612,PIS456,PIS433,PIS613,
. PIS466,PIS533,PIS623,PIS566,PIS666,PIS633,PIS246,gHSS
DOUBLE PRECISION QSTSB
DOUBLE PRECISION G1Q,G2Q,GQ,ALSQ
DOUBLE PRECISION tanb,cosb,sinb,vu,vd
DOUBLE PRECISION l,k,Alcos1,Akcos2,muq,nuq
DOUBLE PRECISION ZHU,ZHD,ZS,vuq,vdq,TANBQ
DOUBLE PRECISION mt,mb,mtau,mmu,mel,MS,MC,MBP,MPI,MSTRANGE
DOUBLE PRECISION Ytq,Ybq,MTOPQ,MBOTQ
DOUBLE PRECISION mur,M1r,M2r,msi
DOUBLE PRECISION phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
DOUBLE PRECISION MST2(2),UT(2,2,2),MSB2(2),UB(2,2,2),MSL2(2),
. UTAU(2,2,2),MSNT2
DOUBLE PRECISION MSU2(2),MSD2(2),MSE2(2),MSNE2,MSMU2(2),
. UMU(2,2,2)
DOUBLE PRECISION MSQ3,MSU3,MSD3,AT,AB
DOUBLE PRECISION MSL3,MSE3,MSL1,MSE1,ATAU,AMU
DOUBLE PRECISION MHC,XC(2,2),MH0T(5),XH0(5,5),MA2
DOUBLE PRECISION MH02(5,5),MHC2
DOUBLE PRECISION MH0(5),XH(5,5)
DOUBLE PRECISION GRHSTST(5,2,2),GRHSBSB(5,2,2),GRHSLSL(5,2,2),
. GRHSUSU(5,2,2),GRHSDSD(5,2,2),GRHSESE(5,2,2),GRHSNSN(5)
DOUBLE PRECISION GIHSTST(5,2,2),GIHSBSB(5,2,2),GIHSLSL(5,2,2)
DOUBLE PRECISION GRHCSTSB(2,2),GRHCSNSL(2),GRHCSUSD(2,2),
. GRHCSNSE(2),GIHCSTSB(2,2),GIHCSNSL(2)
DOUBLE PRECISION XIF,XIS,MUP,MSP,M3H
DOUBLE PRECISION XIFQ,XISQ,MUPQ,MSPQ,M3HQ
DOUBLE PRECISION phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
DOUBLE PRECISION DDCOS,DDSIN
COMMON/STSBSCALE/QSTSB
COMMON/QGAUGE/G1Q,G2Q,GQ,ALSQ
COMMON/TBPAR/tanb,cosb,sinb,vu,vd
COMMON/QPAR/l,k,Alcos1,Akcos2,muq,NUQ
COMMON/QHIGGS/ZHU,ZHD,ZS,vuq,vdq,TANBQ
COMMON/SMFERM/mt,mb,mtau,mmu,mel,MS,MC,MBP,MPI,MSTRANGE
COMMON/QQUARK/Ytq,Ybq,MTOPQ,MBOTQ
COMMON/GAUGINOPAR/mur,M1r,M2r,msi
COMMON/PHASES/phi01,phi02,phi0,phiM1,phiM2,phiM3,
. phiAT,phiAB,phiATAU,phiAC,phiAS,phiAMU
COMMON/HISPEC/MHC,XC,MH0T,XH0,MA2
COMMON/SFERM3SPEC/MST2,UT,MSB2,UB,MSL2,UTAU,MSNT2
COMMON/SFERM1SPEC/MSU2,MSD2,MSE2,MSNE2,MSMU2,UMU
COMMON/RADCOR2/MSQ3,MSU3,MSD3,AT,AB
COMMON/SLEPPAR/MSL3,MSE3,MSL1,MSE1,ATAU,AMU
COMMON/SQUHIMASSM/MH02,MHC2
COMMON/HISFCOUP/GRHSTST,GRHSBSB,GRHSLSL,GRHSUSU,GRHSDSD,
. GRHSESE,GRHSNSN,GIHSTST,GIHSBSB,GIHSLSL,GRHCSTSB,GRHCSNSL,
. GRHCSUSD,GRHCSNSE,GIHCSTSB,GIHCSNSL
COMMON/SUSYEXT/XIF,XIS,MUP,MSP,M3H
COMMON/QEXT/XIFQ,XISQ,MUPQ,MSPQ,M3HQ
COMMON/Z3VAUX/phIF,phiP,phi3,phiS,phiSP,phi3q,phiSq,phiSPq,
. mupsi,ks2si
COMMON/HIGGSMS/muH2
PI=4d0*DATAN(1d0)
DELT(1,1)=1.d0
DELT(1,2)=0.d0
DELT(2,1)=0.d0
DELT(2,2)=1.d0
c A: Higgs DRbar masses
c I- Rescaling (Wave-function renorm.)
MH02(1,1)=MH02(1,1)/ZHU
MH02(1,2)=MH02(1,2)/dsqrt(ZHU*ZHD)
MH02(2,1)=MH02(1,2)
MH02(1,3)=MH02(1,3)/dsqrt(ZHU*ZS)
MH02(3,1)=MH02(1,3)
MH02(1,4)=MH02(1,4)/dsqrt(ZHD)/ZHU
MH02(4,1)=MH02(1,4)
MH02(1,5)=MH02(1,5)/dsqrt(ZHU*ZS)
MH02(5,1)=MH02(1,5)
MH02(2,2)=MH02(2,2)/ZHD
MH02(2,3)=MH02(2,3)/dsqrt(ZHD*ZS)
MH02(3,2)=MH02(2,3)
MH02(2,4)=MH02(2,4)/dsqrt(ZHU)/ZHD
MH02(4,2)=MH02(2,4)
MH02(2,5)=MH02(2,5)/dsqrt(ZHD*ZS)
MH02(5,2)=MH02(2,5)
MH02(3,3)=MH02(3,3)/ZS
MH02(3,4)=MH02(3,4)/dsqrt(ZHU*ZHD*ZS)
MH02(4,3)=MH02(3,4)
MH02(3,5)=MH02(3,5)/ZS
MH02(5,3)=MH02(3,5)
MH02(4,4)=MH02(4,4)/(ZHU*ZHD)
MH02(4,5)=MH02(4,5)/dsqrt(ZHU*ZHD*ZS)
MH02(5,4)=MH02(4,5)
MH02(5,5)=MH02(5,5)/ZS
MHC2=MHC2/(ZHU*ZHD)
c II- Diagonalization of the neutral sector
CALL DIAGN(5,MH02,VALPH,VECPH,1.d-10)
CALL SORTNA(5,VALPH,VECPH)
DO I=1,5
MH0(I)=VALPH(I)
DO J=1,5
XH(I,J)=VECPH(J,I)
ENDDO
ENDDO
DO I=1,5
IF(MH0(I).le.0.d0)THEN
IFAIL=1
GOTO 621
ENDIF
ENDDO
c B: Pole corrections to the neutral states
MW2=g2q/2.d0*(vuq**2+vdq**2)
MZ2=(g1q+g2q)/2.d0*(vuq**2+vdq**2)
Ytau=mtau/vdq
sinbq=vuq/dsqrt(vuq**2+vdq**2)
cosbq=vdq/dsqrt(vuq**2+vdq**2)
MHTC(1)=MW2
MHTC(2)=MHC
DO I=1,5
MHT2(I)=MH0T(I)
XHT(I,1)=XH0(I,1)
XHT(I,2)=XH0(I,2)
XHT(I,3)=XH0(I,3)
XHT(I,4)=XH0(I,4)*cosbq
XHT(I,5)=XH0(I,4)*sinbq
XHT(I,6)=XH0(I,5)
ENDDO
MHT2(6)=MZ2
DO J=1,6
XHT(6,J)=0.d0
ENDDO
XHT(6,4)=-sinbq
XHT(6,5)=cosbq
DO I=1,5
XHG(I,1)=XH(I,1)/dsqrt(ZHU)
XHG(I,2)=XH(I,2)/dsqrt(ZHD)
XHG(I,3)=XH(I,3)/dsqrt(ZS)
XHG(I,4)=XH(I,4)*cosb/dsqrt(ZHU)
XHG(I,5)=XH(I,4)*sinb/dsqrt(ZHD)
XHG(I,6)=XH(I,5)/dsqrt(ZS)
ENDDO
DO I=1,5
aux=0.d0
c I- SM Fermions
aux=aux-3.d0*Ytq**2*((XHG(I,1)**2+XHG(I,4)**2)
. *MH0(I)*(NMB0(MH0(I),mtopq**2,mtopq**2,QSTSB)
. -NMB0(muH2,mtopq**2,mtopq**2,QSTSB))
. -4.d0*mtopq**2*(NMB0(MH0(I),mtopq**2,mtopq**2,QSTSB)
. +fSF1(mtopq**2,mtopq**2,QSTSB))*XHG(I,1)**2)
. -3.d0*Ybq**2*((XHG(I,2)**2+XHG(I,5)**2)
. *MH0(I)*(NMB0(MH0(I),mbotq**2,mbotq**2,QSTSB)
. -NMB0(muH2,mbotq**2,mbotq**2,QSTSB))
. -4.d0*mbotq**2*(NMB0(MH0(I),mbotq**2,mbotq**2,QSTSB)
. +fSF1(mbotq**2,mbotq**2,QSTSB))*XHG(I,2)**2)
. -(mtau/vdq)**2*((XHG(I,2)**2+XHG(I,5)**2)
. *MH0(I)*(NMB0(MH0(I),mtau**2,mtau**2,QSTSB)
. -NMB0(muH2,mtau**2,mtau**2,QSTSB))
. -4.d0*mtau**2*(NMB0(MH0(I),mtau**2,mtau**2,QSTSB)
. +fSF1(mtau**2,mtau**2,QSTSB))*XHG(I,2)**2)
c II- Gauginos/Higgsinos
aux=aux-g1q/2d0*(MH0(I)*(NMB0(MH0(I),mur**2,M1r**2,QSTSB)
. -NMB0(muH2,mur**2,M1r**2,QSTSB))
. -(mur**2+M1r**2)*(NMB0(MH0(I),mur**2,M1r**2,QSTSB)
. +fSF1(mur**2,M1r**2,QSTSB)))
. *(XHG(I,1)**2+XHG(I,2)**2+XHG(I,4)**2+XHG(I,5)**2)
. -3.d0*g2q/2d0*(MH0(I)*(NMB0(MH0(I),mur**2,M2r**2,QSTSB)
. -NMB0(muH2,mur**2,M2r**2,QSTSB))
. -(mur**2+M2r**2)*(NMB0(MH0(I),mur**2,M2r**2,QSTSB)
. +fSF1(mur**2,M2r**2,QSTSB)))
. *(XHG(I,1)**2+XHG(I,2)**2+XHG(I,4)**2+XHG(I,5)**2)
. -l**2*(MH0(I)*(NMB0(MH0(I),mur**2,msi**2,QSTSB)
. -NMB0(muH2,mur**2,msi**2,QSTSB))
. -(mur**2+msi**2)*
. (NMB0(MH0(I),mur**2,msi**2,QSTSB)
. +fSF1(mur**2,msi**2,QSTSB)))
. *(XHG(I,1)**2+XHG(I,2)**2+XHG(I,4)**2+XHG(I,5)**2)
. -2.d0*(l**2*(MH0(I)*(NMB0(MH0(I),mur**2,mur**2,QSTSB)
. -NMB0(muH2,mur**2,mur**2,QSTSB))
. -2.d0*mur**2*(NMB0(MH0(I),mur**2,mur**2,QSTSB)
. +fSF1(mur**2,mur**2,QSTSB)))
. +k**2*(MH0(I)*
. (NMB0(MH0(I),msi**2,msi**2,QSTSB)
. -NMB0(muH2,msi**2,msi**2,QSTSB))
. -2.d0*msi**2*(NMB0(MH0(I),msi**2,msi**2,QSTSB)
. +fSF1(msi**2,msi**2,QSTSB)))
. )*(XHG(I,3)**2+XHG(I,6)**2)
c III- Gauge
aux=aux
. +MH0(I)*(g2q*(NMB0(MH0(I),MW2,MW2,QSTSB)
. -NMB0(muH2,MW2,MW2,QSTSB))
. +(g1q+g2q)/2.d0*(NMB0(MH0(I),MZ2,MZ2,QSTSB)
. -NMB0(muH2,MZ2,MZ2,QSTSB)))*sinb**2
. *(XHG(I,1)**2+XHG(I,4)**2)!+XHG(I,2)**2+XHG(I,5)**2
. -MH0(I)*(g2q*NMB0(MH0(I),MW2,MW2,QSTSB)
. +(g1q+g2q)/2.d0*NMB0(MH0(I),MZ2,MZ2,QSTSB))
. *(0d0*(XHG(I,1)**2+XHG(I,4))-cosb**2*(XHG(I,2)**2+XHG(I,5))
. -2.d0*sinb*cosb*(XHG(I,1)*XHG(I,2)-XHG(I,4)*XHG(I,5)))
. -3.d0*(g2q*MW2*(NMB0(MH0(I),MW2,MW2,QSTSB)+fSF1(MW2,MW2,QSTSB))
. +(g1q+g2q)/2.d0*MZ2
. *(NMB0(MH0(I),MZ2,MZ2,QSTSB)+fSF1(MZ2,MZ2,QSTSB)))
. *(sinb**2*(XHG(I,1)**2+XHG(I,4))+cosb**2*(XHG(I,2)**2+XHG(I,5))
. +2.d0*sinb*cosb*(XHG(I,1)*XHG(I,2)-XHG(I,4)*XHG(I,5)))
aux=aux+g2q*((MH0(I)+MHC-MW2/2.d0)*NMB0(MH0(I),MHC,MW2,QSTSB)
. +(MHC-MW2/2.d0)*fSF1(MHC,MW2,QSTSB))
. *(cosb**2*(XHG(I,1)**2+XHG(I,4))+sinb**2*(XHG(I,2)**2+XHG(I,5))
. -2.d0*sinb*cosb*(XHG(I,1)*XHG(I,2)-XHG(I,4)*XHG(I,5)))
DO J=1,5
aux=aux+(g1q+g2q)/2.d0*((MH0(I)+MH0T(J)-MZ2/2.d0)
. *NMB0(MH0(I),MH0T(J),MZ2,QSTSB)
. +(MH0T(J)-MZ2/2.d0)*fSF1(MH0T(J),MZ2,QSTSB))
. *(XHG(I,4)*XHT(J,1)-XHG(I,1)*XHT(J,4)
. +XHG(I,2)*XHT(J,5)-XHG(I,5)*XHT(J,2))**2
ENDDO
c IV- Higgs
DO M=1,2
DO N=1,2
gRHSS=(XHG(I,1)*((g1q+g2q)/2.d0*vuq*XC(M,1)*XC(N,1)
. +(g2q-g1q)/2.d0*vuq*XC(M,2)*XC(N,2)
. -(l**2-g2q/2.d0)*vdq*(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1)))
. +XHG(I,2)*((g2q-g1q)/2.d0*vdq*XC(M,1)*XC(N,1)
. +(g2q+g1q)/2.d0*vdq*XC(M,2)*XC(N,2)
. -(l**2-g2q/2.d0)*vuq*(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1)))
. +XHG(I,3)*(l*(Alcos1+2.d0*k/l*muq*DDCOS(Phi0)
. +MUPQ*DDCOS(Phi01-phiP))
. *(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1))
. +2.d0*l*muq*(XC(M,1)*XC(N,1)+XC(M,2)*XC(N,2)))
. +XHG(I,6)*(3.d0*k*muq*DDSIN(Phi0)
. +2d0*l*MUPQ*DDSIN(Phi01-phiP)
. +(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))*l/muq)
. *(XC(M,1)*XC(N,2)+XC(M,2)*XC(N,1))
. )/dsqrt(2.d0)
gIHSS=-(XHG(I,3)*(k*muq*DDSIN(Phi0)
. +(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))*l/muq)
. *(XC(M,1)*XC(N,2)-XC(M,2)*XC(N,1))
. +(l**2-g2q/2.d0)*(vuq*XHG(I,5)+vdq*XHG(I,5))
. *(XC(M,1)*XC(N,2)-XC(M,2)*XC(N,1))
. +XHG(I,6)*l*(Alcos1-2.d0*k/l*muq*DDCOS(Phi0)
. +MUPQ*DDCOS(Phi01-PhiP))
. *(XC(M,1)*XC(N,2)-XC(M,2)*XC(N,1))
. )/dsqrt(2.d0)
aux=aux-(gRHSS*gRHSS+gIHSS*gIHSS)*
. (NMB0(MH0(I),MHTC(M),MHTC(N),QSTSB)+fSF1(MHTC(M),MHTC(N),QSTSB))
ENDDO
ENDDO
DO M=1,6
DO N=1,6
PIS111=6.d0*XHG(I,1)*XHT(M,1)*XHT(N,1)
PIS122=2.d0*(XHG(I,1)*XHT(M,2)*XHT(N,2)
. +XHG(I,2)*XHT(M,1)*XHT(N,2)+XHG(I,2)*XHT(M,2)*XHT(N,1))
PIS133=2.d0*(XHG(I,1)*XHT(M,3)*XHT(N,3)
. +XHG(I,3)*XHT(M,1)*XHT(N,3)+XHG(I,3)*XHT(M,3)*XHT(N,1))
PIS144=2.d0*(XHG(I,1)*XHT(M,4)*XHT(N,4)
. +XHG(I,4)*XHT(M,1)*XHT(N,4)+XHG(I,4)*XHT(M,4)*XHT(N,1))
PIS155=2.d0*(XHG(I,1)*XHT(M,5)*XHT(N,5)
. +XHG(I,5)*XHT(M,1)*XHT(N,5)+XHG(I,5)*XHT(M,5)*XHT(N,1))
PIS166=2.d0*(XHG(I,1)*XHT(M,6)*XHT(N,6)
. +XHG(I,6)*XHT(M,1)*XHT(N,6)+XHG(I,6)*XHT(M,6)*XHT(N,1))
PIS211=2.d0*(XHG(I,2)*XHT(M,1)*XHT(N,1)
. +XHG(I,1)*XHT(M,2)*XHT(N,1)+XHG(I,1)*XHT(M,1)*XHT(N,2))
PIS222=6.d0*XHG(I,2)*XHT(M,2)*XHT(N,2)
PIS233=2.d0*(XHG(I,2)*XHT(M,3)*XHT(N,3)
. +XHG(I,3)*XHT(M,2)*XHT(N,3)+XHG(I,3)*XHT(M,3)*XHT(N,2))
PIS244=2.d0*(XHG(I,2)*XHT(M,4)*XHT(N,4)
. +XHG(I,4)*XHT(M,2)*XHT(N,4)+XHG(I,4)*XHT(M,4)*XHT(N,2))
PIS255=2.d0*(XHG(I,2)*XHT(M,5)*XHT(N,5)
. +XHG(I,5)*XHT(M,2)*XHT(N,5)+XHG(I,5)*XHT(M,5)*XHT(N,2))
PIS266=2.d0*(XHG(I,2)*XHT(M,6)*XHT(N,6)
. +XHG(I,6)*XHT(M,2)*XHT(N,6)+XHG(I,6)*XHT(M,6)*XHT(N,2))
PIS311=2.d0*(XHG(I,3)*XHT(M,1)*XHT(N,1)
. +XHG(I,1)*XHT(M,3)*XHT(N,1)+XHG(I,1)*XHT(M,1)*XHT(N,3))
PIS322=2.d0*(XHG(I,3)*XHT(M,2)*XHT(N,2)
. +XHG(I,2)*XHT(M,3)*XHT(N,2)+XHG(I,2)*XHT(M,2)*XHT(N,3))
PIS333=6.d0*XHG(I,3)*XHT(M,3)*XHT(N,3)
PIS344=2.d0*(XHG(I,3)*XHT(M,4)*XHT(N,4)
. +XHG(I,4)*XHT(M,3)*XHT(N,4)+XHG(I,4)*XHT(M,4)*XHT(N,3))
PIS355=2.d0*(XHG(I,3)*XHT(M,5)*XHT(N,5)
. +XHG(I,5)*XHT(M,3)*XHT(N,5)+XHG(I,5)*XHT(M,5)*XHT(N,3))
PIS366=2.d0*(XHG(I,3)*XHT(M,6)*XHT(N,6)
. +XHG(I,6)*XHT(M,3)*XHT(N,6)+XHG(I,6)*XHT(M,6)*XHT(N,3))
PIS312=XHG(I,3)*XHT(M,1)*XHT(N,2)
. +XHG(I,3)*XHT(M,2)*XHT(N,1)+XHG(I,1)*XHT(M,3)*XHT(N,2)
. +XHG(I,1)*XHT(M,2)*XHT(N,3)+XHG(I,2)*XHT(M,1)*XHT(N,3)
. +XHG(I,2)*XHT(M,3)*XHT(N,1)
PIS345=XHG(I,3)*XHT(M,4)*XHT(N,5)
. +XHG(I,3)*XHT(M,5)*XHT(N,4)+XHG(I,4)*XHT(M,3)*XHT(N,5)
. +XHG(I,4)*XHT(M,5)*XHT(N,3)+XHG(I,5)*XHT(M,4)*XHT(N,3)
. +XHG(I,5)*XHT(M,3)*XHT(N,4)
PIS156=XHG(I,1)*XHT(M,5)*XHT(N,6)
. +XHG(I,1)*XHT(M,6)*XHT(N,5)+XHG(I,5)*XHT(M,1)*XHT(N,6)
. +XHG(I,5)*XHT(M,6)*XHT(N,1)+XHG(I,6)*XHT(M,5)*XHT(N,1)
. +XHG(I,6)*XHT(M,1)*XHT(N,5)
PIS256=XHG(I,2)*XHT(M,5)*XHT(N,6)
. +XHG(I,2)*XHT(M,6)*XHT(N,5)+XHG(I,5)*XHT(M,2)*XHT(N,6)
. +XHG(I,5)*XHT(M,6)*XHT(N,2)+XHG(I,6)*XHT(M,5)*XHT(N,2)
. +XHG(I,6)*XHT(M,2)*XHT(N,5)
PIS346=XHG(I,3)*XHT(M,4)*XHT(N,6)
. +XHG(I,3)*XHT(M,6)*XHT(N,4)+XHG(I,4)*XHT(M,3)*XHT(N,6)
. +XHG(I,4)*XHT(M,6)*XHT(N,3)+XHG(I,6)*XHT(M,4)*XHT(N,3)
. +XHG(I,6)*XHT(M,3)*XHT(N,4)
PIS356=XHG(I,3)*XHT(M,5)*XHT(N,6)
. +XHG(I,3)*XHT(M,6)*XHT(N,5)+XHG(I,5)*XHT(M,3)*XHT(N,6)
. +XHG(I,5)*XHT(M,6)*XHT(N,3)+XHG(I,6)*XHT(M,5)*XHT(N,3)
. +XHG(I,6)*XHT(M,3)*XHT(N,5)
PIS513=XHG(I,5)*XHT(M,1)*XHT(N,3)
. +XHG(I,5)*XHT(M,3)*XHT(N,1)+XHG(I,1)*XHT(M,5)*XHT(N,3)
. +XHG(I,1)*XHT(M,3)*XHT(N,5)+XHG(I,3)*XHT(M,1)*XHT(N,5)
. +XHG(I,3)*XHT(M,5)*XHT(N,1)
PIS423=XHG(I,4)*XHT(M,2)*XHT(N,3)
. +XHG(I,4)*XHT(M,3)*XHT(N,2)+XHG(I,2)*XHT(M,4)*XHT(N,3)
. +XHG(I,2)*XHT(M,3)*XHT(N,4)+XHG(I,3)*XHT(M,2)*XHT(N,4)
. +XHG(I,3)*XHT(M,4)*XHT(N,2)
PIS612=XHG(I,6)*XHT(M,1)*XHT(N,2)
. +XHG(I,6)*XHT(M,2)*XHT(N,1)+XHG(I,1)*XHT(M,6)*XHT(N,2)
. +XHG(I,1)*XHT(M,2)*XHT(N,6)+XHG(I,6)*XHT(M,1)*XHT(N,2)
. +XHG(I,6)*XHT(M,2)*XHT(N,1)
PIS456=XHG(I,4)*XHT(M,5)*XHT(N,6)
. +XHG(I,4)*XHT(M,6)*XHT(N,5)+XHG(I,5)*XHT(M,4)*XHT(N,6)
. +XHG(I,5)*XHT(M,6)*XHT(N,4)+XHG(I,6)*XHT(M,5)*XHT(N,4)
. +XHG(I,6)*XHT(M,4)*XHT(N,5)
PIS433=2.d0*(XHG(I,4)*XHT(M,3)*XHT(N,3)
. +XHG(I,3)*XHT(M,4)*XHT(N,3)+XHG(I,3)*XHT(M,3)*XHT(N,4))
PIS613=XHG(I,6)*XHT(M,1)*XHT(N,3)
. +XHG(I,6)*XHT(M,3)*XHT(N,1)+XHG(I,1)*XHT(M,6)*XHT(N,3)
. +XHG(I,1)*XHT(M,3)*XHT(N,6)+XHG(I,3)*XHT(M,1)*XHT(N,6)
. +XHG(I,3)*XHT(M,6)*XHT(N,1)
PIS466=2.d0*(XHG(I,4)*XHT(M,6)*XHT(N,6)
. +XHG(I,6)*XHT(M,4)*XHT(N,6)+XHG(I,6)*XHT(M,6)*XHT(N,4))
PIS533=2.d0*(XHG(I,5)*XHT(M,3)*XHT(N,3)
. +XHG(I,3)*XHT(M,5)*XHT(N,3)+XHG(I,3)*XHT(M,3)*XHT(N,5))
PIS623=XHG(I,6)*XHT(M,2)*XHT(N,3)
. +XHG(I,6)*XHT(M,3)*XHT(N,2)+XHG(I,2)*XHT(M,6)*XHT(N,3)
. +XHG(I,2)*XHT(M,3)*XHT(N,6)+XHG(I,3)*XHT(M,2)*XHT(N,6)
. +XHG(I,3)*XHT(M,6)*XHT(N,2)
PIS566=2.d0*(XHG(I,5)*XHT(M,6)*XHT(N,6)
. +XHG(I,6)*XHT(M,5)*XHT(N,6)+XHG(I,6)*XHT(M,6)*XHT(N,5))
PIS666=6.d0*XHG(I,6)*XHT(M,6)*XHT(N,6)
PIS633=2.d0*(XHG(I,6)*XHT(M,3)*XHT(N,3)
. +XHG(I,3)*XHT(M,6)*XHT(N,3)+XHG(I,3)*XHT(M,3)*XHT(N,6))
PIS246=XHG(I,2)*XHT(M,4)*XHT(N,6)
. +XHG(I,2)*XHT(M,6)*XHT(N,4)+XHG(I,4)*XHT(M,2)*XHT(N,6)
. +XHG(I,4)*XHT(M,6)*XHT(N,2)+XHG(I,6)*XHT(M,4)*XHT(N,2)
. +XHG(I,6)*XHT(M,2)*XHT(N,4)
IF(k.ne.0d0)then
gHSS=((g1q+g2q)/4.d0*(vuq*(PIS111+PIS144-PIS122-PIS155)
. +vdq*(PIS222+PIS255-PIS211-PIS244))
. +l*muq*(PIS311+PIS344+PIS322+PIS355)
. +l**2*vuq*(PIS122+PIS155+PIS133+PIS166)
. +l**2*vdq*(PIS211+PIS244+PIS233+PIS266)
. -l*Alcos1*(PIS312-PIS345-PIS156-PIS246)
. +k/3.d0*Akcos2*(PIS333-3.d0*PIS366)
. +2.d0*k**2*muq/l*(PIS333+PIS366)
. -k*DDCOS(Phi0)*(2.d0*muq*(PIS312-PIS345+PIS156+PIS246)
. +l*vdq*(PIS133-PIS166+2.d0*PIS346)
. +l*vuq*(PIS233-PIS266+2.d0*PIS356))
. +k*DDSIN(Phi0)*(muq*(PIS513+PIS423-3.d0*PIS612+3.d0*PIS456)
. +l*vdq*(PIS433-2.d0*PIS613-PIS466)
. +l*vuq*(PIS533-2.d0*PIS623-PIS566)
. +l*vuq*vdq/muq*(3.d0*PIS633-PIS666))
. -l*MUPQ*DDCOS(Phi01-phiP)*(PIS312-PIS345+PIS156+PIS246)
. +k*MUPQ*DDCOS(Phi02-phiP)*(PIS333+PIS366)
. -l/muq*(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))
. *(PIS612+PIS423+PIS513-PIS456
. +vuq*vdq*l**2/muq**2*(PIS633-PIS666/3d0))
. -2d0*l*MUPQ*DDSIN(Phi01-phiP)*(PIS612
. +vuq*vdq*l**2/muq**2*(PIS666/3d0-PIS633))
. -4d0/3d0*k*MUPQ*DDSIN(Phi02-phiP)*PIS666
. -l/muq*(l/muq*(XISQ*DDSIN(phiSQ)+XIFQ*MUPQ*DDSIN(PhiP-phIF))
. +MSPQ*DDSIN(PhiSPQ))*(PIS666/3d0-PIS633))/dsqrt(2.d0)
else
gHSS=((g1q+g2q)/4.d0*(vuq*(PIS111+PIS144-PIS122-PIS155)
. +vdq*(PIS222+PIS255-PIS211-PIS244))
. +l*muq*(PIS311+PIS344+PIS322+PIS355)
. +l**2*vuq*(PIS122+PIS155+PIS133+PIS166)
. +l**2*vdq*(PIS211+PIS244+PIS233+PIS266)
. -l*Alcos1*(PIS312-PIS345-PIS156-PIS246)
. -l*MUPQ*DDCOS(Phi01-phiP)*(PIS312-PIS345+PIS156+PIS246)
. -l/muq*(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))
. *(PIS612+PIS423+PIS513-PIS456)
. -2d0*l*MUPQ*DDSIN(Phi01-phiP)*PIS612)/dsqrt(2.d0)
endif
aux=aux-gHSS**2*(NMB0(MH0(I),MHT2(M),MHT2(N),QSTSB)
. +fSF1(MHT2(M),MHT2(N),QSTSB))/2.d0
ENDDO
ENDDO
c V- Sfermions
DO M=1,2
DO N=1,2
gRHSS=dsqrt(2.d0)*(UT(M,1,1)*UT(N,1,1)+UT(M,1,2)*UT(N,1,2))
. *(Ytq**2*vuq*XHG(I,1)+(g1q/3.d0-g2q)/4.d0
. *(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +dsqrt(2.d0)*(UT(M,2,1)*UT(N,2,1)+UT(M,2,2)*UT(N,2,2))
. *(Ytq**2*vuq*XHG(I,1)-g1q/3.d0*(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +Ytq/dsqrt(2.d0)*(AT*(DDCOS(PhiAT)*XHG(I,1)
. -DDSIN(PhiAT)*XHG(I,4))
. -DDCOS(Phi01)*(muq*XHG(I,2)+l*vdq*XHG(I,3))
. +DDSIN(Phi01)*(muq*XHG(I,5)+l*vdq*XHG(I,6)))
. *(UT(M,1,1)*UT(N,2,1)+UT(M,2,1)*UT(N,1,1)
. +UT(M,1,2)*UT(N,2,2)+UT(M,2,2)*UT(N,1,2))
. +Ytq/dsqrt(2.d0)*(AT*(DDSIN(PhiAT)*XHG(I,1)
. +DDCOS(PhiAT)*XHG(I,4))
. +DDSIN(Phi01)*(muq*XHG(I,2)+l*vdq*XHG(I,3))
. +DDCOS(Phi01)*(muq*XHG(I,5)+l*vdq*XHG(I,6)))
. *(UT(M,2,1)*UT(N,1,2)-UT(M,2,2)*UT(N,1,1)
. +UT(M,1,2)*UT(N,2,1)-UT(M,1,1)*UT(N,2,2))
gIHSS=dsqrt(2.d0)*(UT(M,1,2)*UT(N,1,1)-UT(M,1,1)*UT(N,1,2))
. *(Ytq**2*vuq*XHG(I,1)+(g1q/3.d0-g2q)/4.d0
. *(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +dsqrt(2.d0)*(UT(M,2,2)*UT(N,2,1)-UT(M,2,1)*UT(N,2,2))
. *(Ytq**2*vuq*XHG(I,1)-g1q/3.d0*(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +Ytq/dsqrt(2.d0)*(AT*(DDCOS(PhiAT)*XHG(I,1)
. -DDSIN(PhiAT)*XHG(I,4))
. -DDCOS(Phi01)*(muq*XHG(I,2)+l*vdq*XHG(I,3))
. +DDSIN(Phi01)*(muq*XHG(I,5)+l*vdq*XHG(I,6)))
. *(UT(M,2,2)*UT(N,1,1)-UT(M,2,1)*UT(N,1,2)
. +UT(M,1,2)*UT(N,2,1)-UT(M,1,1)*UT(N,2,2))
. +Ytq/dsqrt(2.d0)*(AT*(DDSIN(PhiAT)*XHG(I,1)
. +DDCOS(PhiAT)*XHG(I,4))
. +DDSIN(Phi01)*(muq*XHG(I,2)+l*vdq*XHG(I,3))
. +DDCOS(Phi01)*(muq*XHG(I,5)+l*vdq*XHG(I,6)))
. *(UT(M,2,1)*UT(N,1,1)-UT(M,1,1)*UT(N,2,1)
. +UT(M,2,2)*UT(N,1,2)-UT(M,1,2)*UT(N,2,2))
aux=aux-3.d0*(gRHSS**2+gIHSS**2)
. *(NMB0(MH0(I),MST2(M),MST2(N),QSTSB)+fSF1(MST2(M),MST2(N),QSTSB))
gRHSTST(I,M,N)=gRHSS
gIHSTST(I,M,N)=gIHSS
gRHSS=dsqrt(2.d0)*(UB(M,1,1)*UB(N,1,1)+UB(M,1,2)*UB(N,1,2))
. *(Ybq**2*vdq*XHG(I,2)+(g1q/3.d0+g2q)/4.d0
. *(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +dsqrt(2.d0)*(UB(M,2,1)*UB(N,2,1)+UB(M,2,2)*UB(N,2,2))
. *(Ybq**2*vdq*XHG(I,2)+g1q/6.d0*(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +Ybq/dsqrt(2.d0)*(AB*(DDCOS(PhiAB)*XHG(I,2)
. -DDSIN(PhiAB)*XHG(I,5))
. -DDCOS(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDSIN(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UB(M,1,1)*UB(N,2,1)+UB(M,2,1)*UB(N,1,1)
. +UB(M,1,2)*UB(N,2,2)+UB(M,2,2)*UB(N,1,2))
. +Ybq/dsqrt(2.d0)*(AB*(DDSIN(PhiAB)*XHG(I,2)
. +DDCOS(PhiAB)*XHG(I,5))
. +DDSIN(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDCOS(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UB(M,2,1)*UB(N,1,2)-UB(M,2,2)*UB(N,1,1)
. +UB(M,1,2)*UB(N,2,1)-UB(M,1,1)*UB(N,2,2))
gIHSS=dsqrt(2.d0)*(UB(M,1,2)*UB(N,1,1)-UB(M,1,1)*UB(N,1,2))
. *(Ybq**2*vdq*XHG(I,2)+(g1q/3.d0+g2q)/4.d0
. *(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +dsqrt(2.d0)*(UB(M,2,2)*UB(N,2,1)-UB(M,2,1)*UB(N,2,2))
. *(Ybq**2*vdq*XHG(I,2)+g1q/6.d0*(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +Ybq/dsqrt(2.d0)*(AB*(DDCOS(PhiAB)*XHG(I,2)
. -DDSIN(PhiAB)*XHG(I,5))
. -DDCOS(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDSIN(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UB(M,2,2)*UB(N,1,1)-UB(M,2,1)*UB(N,1,2)
. +UB(M,1,2)*UB(N,2,1)-UB(M,1,1)*UB(N,2,2))
. +Ybq/dsqrt(2.d0)*(AB*(DDSIN(PhiAB)*XHG(I,2)
. +DDCOS(PhiAB)*XHG(I,5))
. +DDSIN(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDCOS(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UB(M,2,1)*UB(N,1,1)-UB(M,1,1)*UB(N,2,1)
. +UB(M,2,2)*UB(N,1,2)-UB(M,1,2)*UB(N,2,2))
aux=aux-3.d0*(gRHSS**2+gIHSS**2)
. *(NMB0(MH0(I),MSB2(M),MSB2(N),QSTSB)+fSF1(MSB2(M),MSB2(N),QSTSB))
gRHSBSB(I,M,N)=gRHSS
gIHSBSB(I,M,N)=gIHSS
gRHSS=dsqrt(2.d0)*
. (UTAU(M,1,1)*UTAU(N,1,1)+UTAU(M,1,2)*UTAU(N,1,2))
. *(Ytau**2*vdq*XHG(I,2)+(-g1q+g2q)/4.d0
. *(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +dsqrt(2.d0)*
. (UTAU(M,2,1)*UTAU(N,2,1)+UTAU(M,2,2)*UTAU(N,2,2))
. *(Ytau**2*vdq*XHG(I,2)+g1q/2.d0*(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +Ytau/dsqrt(2.d0)*
. (ATAU*(DDCOS(PhiATAU)*XHG(I,2)
. -DDSIN(PhiATAU)*XHG(I,5))
. -DDCOS(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDSIN(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UTAU(M,1,1)*UTAU(N,2,1)+UTAU(M,2,1)*UTAU(N,1,1)
. +UTAU(M,1,2)*UTAU(N,2,2)+UTAU(M,2,2)*UTAU(N,1,2))
. +Ytau/dsqrt(2.d0)*
. (ATAU*(DDSIN(PhiATAU)*XHG(I,2)
. +DDCOS(PhiATAU)*XHG(I,5))
. +DDSIN(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDCOS(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UTAU(M,2,1)*UTAU(N,1,2)-UTAU(M,2,2)*UTAU(N,1,1)
. +UTAU(M,1,2)*UTAU(N,2,1)-UTAU(M,1,1)*UTAU(N,2,2))
gIHSS=dsqrt(2.d0)*
. (UTAU(M,1,2)*UTAU(N,1,1)-UTAU(M,1,1)*UTAU(N,1,2))
. *(Ytau**2*vdq*XHG(I,2)+(-g1q+g2q)/4.d0
. *(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +dsqrt(2.d0)*(UTAU(M,2,2)*UTAU(N,2,1)-UTAU(M,2,1)*UTAU(N,2,2))
. *(Ytau**2*vdq*XHG(I,2)+g1q/2.d0*(vuq*XHG(I,1)-vdq*XHG(I,2)))
. +Ytau/dsqrt(2.d0)*
. (ATAU*(DDCOS(PhiATAU)*XHG(I,2)-DDSIN(PhiATAU)*XHG(I,5))
. -DDCOS(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDSIN(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UTAU(M,2,2)*UTAU(N,1,1)-UTAU(M,2,1)*UTAU(N,1,2)
. +UTAU(M,1,2)*UTAU(N,2,1)-UTAU(M,1,1)*UTAU(N,2,2))
. +Ytau/dsqrt(2.d0)*
. (ATAU*(DDSIN(PhiATAU)*XHG(I,2)+DDCOS(PhiATAU)*XHG(I,5))
. +DDSIN(Phi01)*(muq*XHG(I,1)+l*vuq*XHG(I,3))
. +DDCOS(Phi01)*(muq*XHG(I,4)+l*vuq*XHG(I,6)))
. *(UTAU(M,2,1)*UTAU(N,1,1)-UTAU(M,1,1)*UTAU(N,2,1)
. +UTAU(M,2,2)*UTAU(N,1,2)-UTAU(M,1,2)*UTAU(N,2,2))
aux=aux-(gRHSS**2+gIHSS**2)
. *(NMB0(MH0(I),MSL2(M),MSL2(N),QSTSB)+fSF1(MSL2(M),MSL2(N),QSTSB))
gRHSLSL(I,M,N)=gRHSS
gIHSLSL(I,M,N)=gIHSS
gRHSS=dsqrt(2.d0)*DELT(M,1)*DELT(N,1)*
. (g1q/3.d0-g2q)/4.d0*(vuq*XHG(I,1)-vdq*XHG(I,2))
. +dsqrt(2.d0)*DELT(M,2)*DELT(N,2)*
. (-g1q/3.d0)*(vuq*XHG(I,1)-vdq*XHG(I,2))
aux=aux-6.d0*gRHSS**2
. *(NMB0(MH0(I),MSU2(M),MSU2(N),QSTSB)+fSF1(MSU2(M),MSU2(N),QSTSB))
gRHSUSU(I,M,N)=gRHSS
gRHSS=dsqrt(2.d0)*DELT(M,1)*DELT(N,1)*
. (g1q/3.d0+g2q)/4.d0*(vuq*XHG(I,1)-vdq*XHG(I,2))
. +dsqrt(2.d0)*DELT(M,2)*DELT(N,2)*
. g1q/6.d0*(vuq*XHG(I,1)-vdq*XHG(I,2))
aux=aux-6.d0*gRHSS**2
. *(NMB0(MH0(I),MSD2(M),MSD2(N),QSTSB)+fSF1(MSD2(M),MSD2(N),QSTSB))
gRHSDSD(I,M,N)=gRHSS
gRHSS=dsqrt(2.d0)*DELT(M,1)*DELT(N,1)*
. (-g1q+g2q)/4.d0*(vuq*XHG(I,1)-vdq*XHG(I,2))
. +dsqrt(2.d0)*DELT(M,2)*DELT(N,2)*
. g1q/2.d0*(vuq*XHG(I,1)-vdq*XHG(I,2))
aux=aux-2.d0*gRHSS**2
. *(NMB0(MH0(I),MSE2(M),MSE2(N),QSTSB)+fSF1(MSE2(M),MSE2(N),QSTSB))
gRHSESE(I,M,N)=gRHSS
ENDDO
ENDDO
gRHSS=-dsqrt(2.d0)*(g1q+g2q)/4.d0*(vuq*XHG(I,1)-vdq*XHG(I,2))
aux=aux-gRHSS**2
. *(NMB0(MH0(I),MSNT2,MSNT2,QSTSB)+fSF1(MSNT2,MSNT2,QSTSB))
aux=aux-2.d0*gRHSS**2
. *(NMB0(MH0(I),MSNE2,MSNE2,QSTSB)+fSF1(MSNE2,MSNE2,QSTSB))
gRHSNSN(I)=gRHSS
c VI- Inclusion of the pole corrections
MH0(I)=MH0(I)
. +aux/16.d0/Pi**2
IF(MH0(I).le.0.d0)THEN
IFAIL=1
GOTO 621
ENDIF
ENDDO
c C: Pole corrections to the charged state
aux=0.d0
c I- SM fermions
aux=aux-3.d0*(Ytq**2*cosb**2+Ybq**2*sinb**2)
. *(MHC2*NMB0(MHC2,mtopq**2,mbotq**2,QSTSB)
. -(mtopq**2+mbotq**2)*(NMB0(MHC2,mtopq**2,mbotq**2,QSTSB)
. +fSF1(mtopq**2,mbotq**2,QSTSB)))
. +3.d0*MHC2*(Ytq**2*cosb**2*NMB0(muH2,mtopq**2,mtopq**2,QSTSB)
. +Ybq**2*sinb**2*NMB0(muH2,mbotq**2,mbotq**2,QSTSB))
. +4.d0*mtopq*mbotq*Ytq*Ybq*sinb*cosb*
. (NMB0(MHC2,mtopq**2,mbotq**2,QSTSB)
. +fSF1(mtopq**2,mbotq**2,QSTSB))
. -Ytau**2*sinb**2*(MHC2*(NMB0(MHC2,0.d0,mtau**2,QSTSB)
. -NMB0(muH2,mtau**2,mtau**2,QSTSB))
. -mtau**2*(NMB0(MHC2,0,mtau**2,QSTSB)+fSF1(0.d0,mtau**2,QSTSB)))
c II- Higgsinos/gauginos
aux=aux-g1q/2.d0*(MHC2*(NMB0(MHC2,mur**2,M1r**2,QSTSB)
. -NMB0(muH2,mur**2,M1r**2,QSTSB))
. -(mur**2+M1r**2)*(NMB0(MHC2,mur**2,M1r**2,QSTSB)
. +fSF1(mur**2,M1r**2,QSTSB)))
. -3.d0*g2q/2.d0*(MHC2*(NMB0(MHC2,mur**2,M2r**2,QSTSB)
. -NMB0(muH2,mur**2,M2r**2,QSTSB))
. -(mur**2+M2r**2)*(NMB0(MHC2,mur**2,M2r**2,QSTSB)
. +fSF1(mur**2,M2r**2,QSTSB)))
. -l**2*(MHC2*(NMB0(MHC2,mur**2,msi**2,QSTSB)
. -NMB0(muH2,mur**2,msi**2,QSTSB))
. -(mur**2+msi**2)
. *(NMB0(MHC2,mur**2,msi**2,QSTSB)
. +fSF1(mur**2,msi**2,QSTSB)))
c III- Gauge
aux=aux-MHC2*(g2q*NMB0(muH2,MW2,MW2,QSTSB)
. +(g1q+g2q)/2.d0*NMB0(muH2,MZ2,MZ2,QSTSB))*sinb**2*cosb**2
c IV- Higgs
DO M=1,5
aux=aux+g2q/4.d0*(cosbq**2*(XHT(M,1)**2+XHT(M,4)**2)
. +sinbq**2*(XHT(M,2)**2+XHT(M,5)**2)
. -2.d0*sinbq*cosbq*(XHT(M,1)*XHT(M,2)-XHT(M,4)*XHT(M,5)))
. *(2.d0*MHC2*NMB0(MHC2,MW2,MH0T(M),QSTSB)+(2.d0*MHT2(M)-MW2)
. *(NMB0(MHC2,MW2,MH0T(M),QSTSB)+fSF1(MW2,MH0T(M),QSTSB)))
ENDDO
aux=aux+g1q*g2q/(g1q+g2q)*(2.d0*MHC2*NMB0(MHC2,0.d0,MHC,QSTSB)
. +(fSF0(MHC,QSTSB)-NMB0(MHC2,0.d0,MHC,QSTSB)))
aux=aux+(g1q-g2q)**2/(g1q+g2q)/4.d0*(
. 2.d0*MHC2*NMB0(MHC2,MZ2,MHC,QSTSB)+(2.d0*MHC-MZ2)*
. (NMB0(MHC2,MZ2,MHC,QSTSB)+fSF1(MZ2,MHC,QSTSB)))
DO M=1,2
DO N=1,5
gRHSS=(XHT(N,1)*((g1q+g2q)/2.d0*vuq*XC(M,1)*cosb
. +(g2q-g1q)/2.d0*vuq*XC(M,2)*sinb
. -(l**2-g2q/2.d0)*vdq*(XC(M,1)*sinb+XC(M,2)*cosb))
. +XHT(N,2)*((g2q-g1q)/2.d0*vdq*XC(M,1)*cosb
. +(g2q+g1q)/2.d0*vdq*XC(M,2)*sinb
. -(l**2-g2q/2.d0)*vuq*(XC(M,1)*sinb+XC(M,2)*cosb))
. +XHT(N,3)*(l*(Alcos1+2.d0*k/l*muq*DDCOS(Phi0)
. +MUPQ*DDCOS(Phi01-phiP))
. +2.d0*l*muq*(XC(M,1)*cosb+XC(M,2)*sinb)
. *(XC(M,1)*sinb+XC(M,2)*cosb))
. +XHT(N,5)*(3.d0*k*muq*DDSIN(Phi0)
. +2d0*l*MUPQ*DDSIN(Phi01-phiP)
. +(M3HQ*DDSIN(phi3Q)+l*XIFQ*DDSIN(Phi01-phIF))*l/muq)
. *(XC(M,1)*sinb+XC(M,2)*cosb)
. )/dsqrt(2.d0)
gIHSS=-(XHT(N,3)*k*muq*DDSIN(Phi0)
. *(XC(M,1)*sinb-XC(M,2)*cosb)
. +XHT(N,4)*(l**2-g2q/2.d0)*(vuq*sinbq+vdq*cosbq)
. *(XC(M,1)*sinb-XC(M,2)*cosb)
. +XHT(N,5)*l*(Alcos1-2.d0*k/l*muq*DDCOS(Phi0)
. +MUPQ*DDCOS(Phi01-PhiP))
. *(XC(M,1)*sinb-XC(M,2)*cosb)
. )/dsqrt(2.d0)
aux=aux-(gRHSS**2+gIHSS**2)*
. (NMB0(MHC2,MH0(N),MHTC(M),QSTSB)+fSF1(MH0(N),MHTC(M),QSTSB))
ENDDO
ENDDO
c V- Sfermions
DO M=1,2
DO N=1,2
gRHSS=-(Ytq**2+Ybq**2-g2q)*dsqrt(vuq**2+vdq**2)*sinb*cosb
. *(UT(M,1,1)*UB(N,1,1)+UT(M,1,2)*UB(N,1,2))
. -Ytq*Ybq*dsqrt(vuq**2+vdq**2)
. *(UT(M,2,1)*UB(N,2,1)+UT(M,2,2)*UB(N,2,2))
. -Ytq*(AT*DDCOS(PhiAT)*cosb+muq*DDCOS(Phi01)*sinb)
. *(UT(M,2,1)*UB(N,1,1)+UT(M,2,2)*UB(N,1,2))
. +Ytq*(AT*DDSIN(PhiAT)*cosb-muq*DDSIN(Phi01)*sinb)
. *(UT(M,2,2)*UB(N,1,1)-UT(M,2,1)*UB(N,1,2))
. -Ybq*(AB*DDCOS(PhiAB)*sinb+muq*DDCOS(Phi01)*cosb)
. *(UT(M,1,1)*UB(N,2,1)+UT(M,1,2)*UB(N,2,2))
. +Ybq*(AB*DDSIN(PhiAB)*sinb-muq*DDSIN(Phi01)*cosb)
. *(UT(M,1,1)*UB(N,2,2)-UT(M,1,2)*UB(N,2,1))
gIHSS=-(Ytq**2+Ybq**2-g2q)*dsqrt(vuq**2+vdq**2)*sinb*cosb
. *(UT(M,1,2)*UB(N,1,1)-UT(M,1,1)*UB(N,1,2))
. -Ytq*Ybq*dsqrt(vuq**2+vdq**2)
. *(UT(M,2,2)*UB(N,2,1)-UT(M,2,1)*UB(N,2,2))
. -Ytq*(AT*DDCOS(PhiAT)*cosb+muq*DDCOS(Phi01)*sinb)
. *(UT(M,2,2)*UB(N,1,1)-UT(M,2,1)*UB(N,1,2))
. -Ytq*(AT*DDSIN(PhiAT)*cosb-muq*DDSIN(Phi01)*sinb)
. *(UT(M,2,1)*UB(N,1,1)+UT(M,2,2)*UB(N,1,2))
. +Ybq*(AB*DDCOS(PhiAB)*sinb+muq*DDCOS(Phi01)*cosb)
. *(UT(M,1,1)*UB(N,2,2)-UT(M,1,2)*UB(N,2,1))
. +Ybq*(AB*DDSIN(PhiAB)*sinb-muq*DDSIN(Phi01)*cosb)
. *(UT(M,1,1)*UB(N,2,1)+UT(M,1,2)*UB(N,2,2))
aux=aux-3.d0*(gRHSS**2+gIHSS**2)*
. (NMB0(MHC2,MST2(M),MSB2(N),QSTSB)
. +fSF1(MST2(M),MSB2(N),QSTSB))
gRHCSTSB(M,N)=gRHSS
gIHCSTSB(M,N)=gIHSS
gRHSS=g2q*dsqrt(vuq**2+vdq**2)*sinb*cosb*DELT(M,1)*DELT(N,1)
aux=aux-6.d0*gRHSS**2*
. (NMB0(MHC2,MSU2(M),MSD2(N),QSTSB)
. +fSF1(MSU2(M),MSD2(N),QSTSB))
gRHCSUSD(M,N)=gRHSS
ENDDO
gRHSS=-(Ytau**2-g2q)*dsqrt(vuq**2+vdq**2)*sinb*cosb
. *UTAU(M,1,1)
. -Ytau*(ATAU*DDCOS(PhiATAU)*sinb+muq*DDCOS(Phi01)*cosb)
. *UTAU(M,2,1)
. +Ytau*(ATAU*DDSIN(PhiATAU)*sinb-muq*DDSIN(Phi01)*cosb)
. *UTAU(M,2,2)
gIHSS=(Ytau**2-g2q)*dsqrt(vuq**2+vdq**2)*sinb*cosb
. *UTAU(M,1,2)
. +Ytau*(ATAU*DDCOS(PhiATAU)*sinb+muq*DDCOS(Phi01)*cosb)
. *UTAU(M,2,2)
. +Ytau*(ATAU*DDSIN(PhiATAU)*sinb-muq*DDCOS(Phi01)*cosb)
. *UTAU(M,2,1)
aux=aux-(gRHSS**2+gIHSS**2)*
. (NMB0(MHC2,MSNT2,MSL2(M),QSTSB)
. +fSF1(MSNT2,MSL2(M),QSTSB))
gRHCSNSL(M)=gRHSS
gIHCSNSL(M)=gIHSS
gRHSS=g2q*dsqrt(vuq**2+vdq**2)*sinb*cosb*DELT(M,1)
aux=aux-2.d0*gRHSS**2*
. (NMB0(MHC2,MSNE2,MSE2(M),QSTSB)
. +fSF1(MSNE2,MSE2(M),QSTSB))
gRHCSNSE(M)=gRHSS
ENDDO
c VI- Inclusion of the pole corrections
MHC2=MHC2+aux/16.d0/Pi**2
IF(MHC2.le.0.d0)THEN
IFAIL=4
GOTO 621
ENDIF
MHC=MHC2
MH0T=MH0
XH0=XH
c print*,dsqrt(MH0(1)),dsqrt(MH0(2)),dsqrt(MH0(3)),dsqrt(MH0(4)),
c c dsqrt(MH0(5)),dsqrt(MHC2)
621 RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf0(x,z)
c ->Fsf0(m^2,Q^2)
IMPLICIT NONE
DOUBLE PRECISION x,z,aux
aux=x*(dlog(x/z)-1.d0)
Fsf0=aux
RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf2(x,y,z)
c ->Fsf2(m1^2,m2^2,m3^2)
IMPLICIT NONE
DOUBLE PRECISION x,y,z,aux
IF(dabs(x-y).ge.1.d-10)THEN
aux=(x+y)/(y-x)*dlog(x/y)+2.d0
ELSE
aux=0.d0
ENDIF
Fsf2=aux
RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf3(x,z)
c ->Fsf3(m1^2,m2^2)
IMPLICIT NONE
DOUBLE PRECISION x,z,aux
IF(dabs(x-z).ge.1.d-10)THEN
aux=(x*dlog(x/z)+z-x)/(z-x)**2
ELSE
aux=1.d0/2.d0/x
ENDIF
Fsf3=aux
RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf4(x,z)
c ->Fsf4(m1^2,m2^2)
IMPLICIT NONE
DOUBLE PRECISION x,z,aux
IF(dabs(x-z).ge.1.d-10)THEN
aux=(2d0*x*z*dlog(x/z)+z**2-x**2)/(x-z)**3/z
ELSE
aux=-1.d0/3.d0/x**2
ENDIF
Fsf4=aux
RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf5(x,y,z)
c ->Fsf5(m1^2,m2^2,m3^2)
IMPLICIT NONE
DOUBLE PRECISION x,y,z,aux,Fsf3
IF(dabs(x-z).ge.1.d-10.and.dabs(y-z).ge.1.d-10)THEN
IF(dabs(x-y).ge.1.d-10)THEN
aux=(x*y*dlog(x/y)-x*z*dlog(x/z)+y*z*dlog(y/z))
. /((x-y)*(x-z)*(y-z))
ELSE
aux=Fsf3(z,y)
ENDIF
ELSEIF(dabs(x-z).le.1.d-10.and.dabs(y-z).ge.1.d-10)THEN
aux=Fsf3(y,z)
ELSE
aux=Fsf3(x,z)
ENDIF
Fsf5=aux
RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf6(x,y,z)
c ->Fsf6(m1^2,m2^2,m3^2)
IMPLICIT NONE
DOUBLE PRECISION x,y,z,aux,Fsf7
IF(dabs(x-z).ge.1.d-10.and.dabs(y-z).ge.1.d-10)THEN
IF(dabs(x-y).ge.1.d-10)THEN
aux=x*dlog(x/z)/(x-y)/(x-z)**2
. +y*dlog(y/z)/(y-x)/(y-z)**2
. +1.d0/(x-z)/(y-z)
ELSE
aux=Fsf7(x,z)
ENDIF
ELSEIF(dabs(x-z).le.1.d-10.and.dabs(y-x).ge.1.d-10)THEN
aux=(2.d0*x*y*dlog(x/y)+y**2-x**2)/(2.d0*x*(x-y)**3)
ELSEIF(dabs(y-z).le.1.d-10.and.dabs(x-y).ge.1.d-10)THEN
aux=(2.d0*x*y*dlog(x/y)+y**2-x**2)/(2.d0*y*(x-y)**3)
ELSE
aux=-1/6.d0/x**2
ENDIF
Fsf6=aux
RETURN
END
************************************************************************************************
DOUBLE PRECISION function Fsf7(x,z)
c ->Fsf7(m1^2,m2^2)
IMPLICIT NONE
DOUBLE PRECISION x,z,aux
IF(dabs(x-z).ge.1.d-10)THEN
aux=(x*(dlog(z/x)+2.d0)-z*(dlog(x/z)+2.d0))/(x-z)**3
ELSE
aux=-1.d0/6.d0/x**2
ENDIF
Fsf7=aux
RETURN
END
|
using Juce.CoreUnity.PointerCallback;
using Juce.CoreUnity.UI;
using UnityEngine;
using UnityEngine.EventSystems;
namespace Playground.Content.Meta.UI.StageEnd
{
public class StageEndUIView : UIView
{
[Header("References")]
[SerializeField] private PointerCallbacks playAgainPointerCallbacks = default;
[SerializeField] private TMPro.TextMeshProUGUI currentPointsText = default;
[SerializeField] private TMPro.TextMeshProUGUI bestPointsText = default;
[SerializeField] private TMPro.TextMeshProUGUI currentCoinsText = default;
private StageEndUIViewModel viewModel;
private void Awake()
{
playAgainPointerCallbacks.OnClick += OnPlayAgainPointerCallbacksClick;
}
public void Init(StageEndUIViewModel viewModel)
{
this.viewModel = viewModel;
viewModel.BestPointsVariable.OnChange += (string value) =>
{
bestPointsText.text = value;
};
viewModel.CurrentPointsVariable.OnChange += (string value) =>
{
currentPointsText.text = value;
};
}
private void OnPlayAgainPointerCallbacksClick(
PointerCallbacks pointerCallbacks,
PointerEventData pointerEventData
)
{
viewModel.OnPlayAgainEvent.Execute(this, pointerEventData);
}
}
}
|
using Microsoft.Win32;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
public class Antis
{
public static bool TaskManager()
{
try
{
RegistryKey objRegistryKey = Registry.CurrentUser.CreateSubKey(
@"Software\Microsoft\Windows\CurrentVersion\Policies\System");
if (objRegistryKey.GetValue("DisableTaskMgr") == null)
objRegistryKey.SetValue("DisableTaskMgr", "1");
else
objRegistryKey.DeleteValue("DisableTaskMgr");
objRegistryKey.Close();
return true;
}
catch { return false; }
}
public static bool CMD()
{
try
{
RegistryKey objRegKey = Registry.CurrentUser.CreateSubKey(
@"Software\Policies\Microsoft\Windows\System");
if (objRegKey.GetValue("DisableCMD") == null)
objRegKey.SetValue("DisableCMD", "1");
else
objRegKey.DeleteValue("DisableCMD");
objRegKey.Close();
return true;
}
catch { return false; }
}
public static bool Regedit()
{
try
{
RegistryKey oRegKey = Registry.CurrentUser.CreateSubKey(
@"Software\Policies\Microsoft\Windows\System");
if (oRegKey.GetValue("DisableRegistryTools") == null)
oRegKey.SetValue("DisableRegistryTools", "1");
else
oRegKey.DeleteValue("DisableRegistryTools");
oRegKey.Close();
return true;
}
catch { return false; }
}
public static bool folderOptions()
{
try
{
RegistryKey fRegKey = Registry.CurrentUser.CreateSubKey(
@"Software\Microsoft\Windows\CurrentVersion\Explorer\Advanced");
if (fRegKey.GetValue("Hidden") == null)
fRegKey.SetValue("Hidden", "1");
else
fRegKey.DeleteValue("Hidden");
fRegKey.Close();
return true;
}
catch { return false; }
}
}
|
----functions----
CREATE OR REPLACE FUNCTION istore_length(bigistore)
RETURNS integer
LANGUAGE c
IMMUTABLE STRICT
AS 'istore', $function$bigistore_length$function$;
----
CREATE OR REPLACE FUNCTION istore_length(istore)
RETURNS integer
LANGUAGE c
IMMUTABLE STRICT
AS 'istore', $function$istore_length$function$;
|
# frozen_string_literal: true
module Simulator
module Unit
class FetchUnit < Base
def self.get(state)
@get ||= new(state)
end
def execute
accept if peek.nil?
instruction = peek
return nil if instruction.nil?
instruction.out_clock_cycles['IF'] = state.clock_cycle
return nil if Stage::Decode.get(state).busy?
remove
state.memory.busy = false
state.program_counter += 1
instruction
end
def accept
return nil if busy?
instruction = fetch_next
return if instruction.nil?
end
def fetch_next
i_cache = Cache::ICache.get(state)
i_cache.burn_clock_cycle if i_cache.busy?
instruction = i_cache.fetch(state.program_counter)
return nil if instruction.nil?
add(instruction)
instruction.in_clock_cycles['IF'] = state.clock_cycle
instruction
end
def parse_config
@clock_cycles_required = Cache::ICache.get(state).cache_time_required
@clock_cycles_pending = state.configuration.i_cache
end
end
end
end
|
<?php
// This file was auto-generated from sdk-root/src/data/email/2010-12-01/waiters-1.json
return [ 'waiters' => [ '__default__' => [ 'interval' => 3, 'max_attempts' => 20, ], 'IdentityExists' => [ 'operation' => 'GetIdentityVerificationAttributes', 'success_type' => 'output', 'success_path' => 'VerificationAttributes[].VerificationStatus', 'success_value' => true, ], ],];
|
package calclavia.api.resonantinduction.mechanical;
import java.util.List;
import net.minecraft.entity.Entity;
/**
* An interface applied to the tile entity of a conveyor belt
*
* @Author DarkGuardsman
*/
public interface IBelt
{
/**
* Used to get a list of entities the belt exerts an effect upon.
*
* @return list of entities in the belts are of effect
*/
public List<Entity> getAffectedEntities();
/**
* Adds and entity to the ignore list so its not moved has to be done every 20 ticks
*
* @param entity
*/
public void ignoreEntity(Entity entity);
}
|
import React, { Component } from 'react';
import PostActions from './PostActions';
import PostComments from './PostComments';
import PostDescription from './PostDescription';
export default class Post extends Component {
constructor(props) {
super(props);
this.state = {
commentsShown: false,
editMode: false
};
this.toggleComments = this.toggleComments.bind(this);
this.toggleEditMode = this.toggleEditMode.bind(this);
this.handleEdit = this.handleEdit.bind(this);
}
toggleComments(e) {
e.preventDefault();
const {commentsShown} = this.state;
if (!this.props.post.comments) {
this.props.fetchComments(this.props.post.id);
}
this.setState({commentsShown: !commentsShown})
}
toggleEditMode() {
this.setState((prevState) => ({editMode: !prevState.editMode}));
}
handleEdit(title, body) {
this.props.editPost({...this.props.post, body, title});
this.toggleEditMode();
}
render() {
const {title, body, id} = this.props.post;
const {commentsShown, editMode} = this.state;
return (
<div>
<div className="post">
<PostDescription editMode={editMode}
title={title}
body={body}
submitEdit={this.handleEdit}/>
<PostActions postId={id}
editMode={editMode}
commentsShown={commentsShown}
toggleComments={this.toggleComments}
deletePost={this.props.deletePost}
toggleEditMode={this.toggleEditMode}/>
</div>
{commentsShown && <PostComments {...this.props.post}/>}
</div>
);
}
}
|
# frozen_string_literal: true
require 'spec_helper'
RSpec.describe Trav3::REST, :vcr do
let(:t) { build :travis }
describe '#get' do
it 'happy path' do
expect(t.owner).to be_an_instance_of(Trav3::Success)
end
it 'not happy path' do
expect(
t.send(:get, "#{t.send(:without_repo)}/example_fail_1234")
).to be_an_instance_of(Trav3::RequestError)
end
end
describe '#delete' do
it 'not happy path' do
expect(
t.send(:delete, "#{t.send(:without_repo)}/example_fail_1234")
).to be_an_instance_of(Trav3::RequestError)
end
end
describe '#patch' do
it 'not happy path' do
expect(
t.send(:patch, "#{t.send(:without_repo)}/example_fail_1234", a: :b)
).to be_an_instance_of(Trav3::RequestError)
end
end
describe '#create' do
it 'not happy path' do
expect(
t.send(:create, "#{t.send(:without_repo)}/example_fail_1234", a: :b)
).to be_an_instance_of(Trav3::RequestError)
end
end
end
|
using Acquaintance.Nets;
using Acquaintance.PubSub;
using FluentAssertions;
using NUnit.Framework;
using System;
using System.Collections.Generic;
using System.Threading;
namespace Acquaintance.Tests.Nets
{
[TestFixture]
public class NetTests
{
[Test]
public void Transform_Pipeline_Simple()
{
string output = null;
var builder = new NetBuilder();
var resetEvent = new ManualResetEvent(false);
builder.AddNode<string>("capitalize", b => b
.ReadInput()
.Transform(s => s.ToUpperInvariant()));
builder.AddNode<string>("exclaim", b => b
.ReadOutputFrom("capitalize")
.Transform(s => s + "!!!"));
builder.AddNode<string>("save string", b => b
.ReadOutputFrom("exclaim")
.Handle(s =>
{
output = s;
resetEvent.Set();
}));
var target = builder.BuildNet();
target.Inject("test");
resetEvent.WaitOne(1000).Should().BeTrue();
output.Should().Be("TEST!!!");
}
[Test]
public void Transform_Pipeline_SimpleNodeRef()
{
string output = null;
var builder = new NetBuilder();
var resetEvent = new ManualResetEvent(false);
var n1 = builder.AddNode<string>("capitalize", b => b
.ReadInput()
.Transform(s => s.ToUpperInvariant()));
var n2 = builder.AddNode<string>("exclaim", b => b
.ReadOutputFrom(n1)
.Transform(s => s + "!!!"));
builder.AddNode<string>("save string", b => b
.ReadOutputFrom(n2)
.Handle(s =>
{
output = s;
resetEvent.Set();
}));
var target = builder.BuildNet();
target.Inject("test");
resetEvent.WaitOne(1000).Should().BeTrue();
output.Should().Be("TEST!!!");
}
[Test]
public void Transform_Pipeline_OnCondition()
{
string output = string.Empty;
var builder = new NetBuilder();
var resetEvent = new ManualResetEvent(false);
builder.AddNode<string>("capitalize", b => b
.ReadInput()
.Transform(s => s.ToUpperInvariant())
.OnCondition(s => s == "test"));
builder.AddNode<string>("exclaim", b => b
.ReadOutputFrom("capitalize")
.Transform(s => s + "!!!"));
builder.AddNode<string>("save string", b => b
.ReadOutputFrom("exclaim")
.Handle(s =>
{
output += s;
resetEvent.Set();
}));
var target = builder.BuildNet();
target.Inject("other");
target.Inject("test");
resetEvent.WaitOne(1000).Should().BeTrue();
output.Should().Be("TEST!!!");
}
[Test]
public void TransformMany_Pipeline_Simple()
{
var results = new List<int>();
var builder = new NetBuilder();
builder.AddNode<int>("increment", b => b
.ReadInput()
.TransformMany(i => new[] { i + 1, i + 4 }));
builder.AddNode<int>("multiply", b => b
.ReadOutputFrom("increment")
.TransformMany(i => new[] { i * 2, i * 3 }));
builder.AddNode<int>("save", b => b
.ReadOutputFrom("multiply")
.Handle(s =>
{
results.Add(s);
})
.OnDedicatedThread());
var target = builder.BuildNet();
target.Inject(1);
Thread.Sleep(1000);
results.Should().BeEquivalentTo(4, 6, 10, 15);
}
[Test]
public void Handle_Pipeline_Simple()
{
string output = "";
var builder = new NetBuilder();
var resetEvent = new ManualResetEvent(false);
builder.AddNode<string>("capitalize", b => b
.ReadInput()
.Handle(s => output += s.ToUpperInvariant()));
builder.AddNode<string>("exclaim", b => b
.ReadOutputFrom("capitalize")
.Handle(s =>
{
output += s + "!!!";
resetEvent.Set();
}));
var target = builder.BuildNet();
target.Inject("test");
resetEvent.WaitOne(1000).Should().BeTrue();
output.Should().Be("TESTtest!!!");
}
[Test]
public void Handle_Errors_Simple()
{
string output = "";
var builder = new NetBuilder();
var resetEvent = new ManualResetEvent(false);
builder.AddNode<string>("throws", b => b
.ReadInput()
.Handle(s => throw new Exception("throws")));
builder.AddErrorNode<string>("save", b => b
.ReadOutputFrom("throws")
.Handle(s =>
{
output = "caught error " + s.Error.Message;
resetEvent.Set();
}));
var target = builder.BuildNet();
target.Inject("test");
resetEvent.WaitOne(1000).Should().BeTrue();
output.Should().Be("caught error throws");
}
[Test]
public void Pipeline_OnDedicatedThreads()
{
int receivedMessages = 0;
var outputs = new HashSet<string>();
var builder = new NetBuilder();
builder.AddNode<string>("add thread id", b => b
.ReadInput()
.Transform(s => s + Thread.CurrentThread.ManagedThreadId)
.OnDedicatedThreads(4));
builder.AddNode<string>("output", b => b
.ReadOutputFrom("add thread id")
.Handle(s =>
{
receivedMessages++;
if (!outputs.Contains(s))
outputs.Add(s);
})
.OnDedicatedThread());
var target = builder.BuildNet();
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
target.Inject("thread:");
Thread.Sleep(1000);
receivedMessages.Should().Be(10);
outputs.Count.Should().BeGreaterThan(1);
}
private class TestHandler : ISubscriptionHandler<int>
{
public void Handle(Envelope<int> message)
{
Value = message.Payload;
}
public int Value { get; private set; }
}
[Test]
public void Handle_Stateful()
{
var handler = new TestHandler();
var builder = new NetBuilder();
var resetEvent = new ManualResetEvent(false);
builder.AddNode<int>("handler", b => b
.ReadInput()
.Handle(handler));
builder.AddNode<int>("set", b => b
.ReadOutputFrom("handler")
.Handle(i => resetEvent.Set()));
var target = builder.BuildNet();
target.Inject(1);
resetEvent.WaitOne(1000).Should().BeTrue();
handler.Value.Should().Be(1);
}
}
}
|
package com.raycoarana.plaayer.car.main.viewmodel
import com.raycoarana.plaayer.R
import com.raycoarana.plaayer.car.core.Navigator
import com.raycoarana.plaayer.car.main.domain.AppSection
import com.raycoarana.plaayer.core.ResourceProvider
import javax.inject.Inject
class CarViewModel @Inject constructor(
private val navigator: Navigator,
private val resourceProvider: ResourceProvider,
main: MainViewModel
) {
val menuItems: List<SectionItemViewModel> = listOf(Pair(getDashboardTitle(), AppSection.DASHBOARD))
.plus(main.items.map { Pair(it.title, it.appSection) })
.map { SectionItemViewModel(navigator, it.first, it.second) }
fun onCreate() {
navigator.navigateToSection(getDashboardTitle(), AppSection.DASHBOARD)
}
private fun getDashboardTitle() = resourceProvider.getString(R.string.section_dashboard_title)
}
|
/*
* shidao
* SupperManagerFunctionImpl.java
* 2015年10月31日
*/
package com.yizhuoyan.shidao.platform.support.function;
import com.yizhuoyan.common.dao.support.SelectLikePo;
import com.yizhuoyan.common.util.KeyValueMap;
import com.yizhuoyan.common.util.validatation.ParameterObjectValidator;
import com.yizhuoyan.shidao.platform.dao.SystemFunctionalityDao;
import com.yizhuoyan.shidao.platform.dao.SystemRoleDao;
import com.yizhuoyan.shidao.platform.dao.SystemUserDao;
import com.yizhuoyan.shidao.platform.po.SysRolePo;
import com.yizhuoyan.shidao.entity.SystemFunctionalityEntity;
import com.yizhuoyan.shidao.entity.SystemRoleEntity;
import com.yizhuoyan.shidao.entity.SystemUserEntity;
import com.yizhuoyan.shidao.platform.function.SystemRoleManageFunction;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import java.util.List;
import java.util.Objects;
import static com.yizhuoyan.common.util.AssertThrowUtil.assertFalse;
import static com.yizhuoyan.common.util.AssertThrowUtil.assertNotNull;
import static com.yizhuoyan.common.util.PlatformUtil.trim;
import static com.yizhuoyan.common.util.PlatformUtil.uuid12;
import static com.yizhuoyan.common.util.validatation.ParameterValidator.$;
/**
* @author root@yizhuoyan.com
*/
@Service
public class SystemRoleManageFunctionImpl extends AbstractFunctionSupport implements SystemRoleManageFunction {
@Autowired
protected SystemUserDao userDao;
@Autowired
protected SystemRoleDao roleDao;
@Autowired
protected SystemFunctionalityDao functionalityDao;
@Override
public SystemRoleEntity addRole(SysRolePo po) throws Exception {
ParameterObjectValidator.throwIfFail(po);
// 代号不能重复
String code = po.getCode();
assertFalse("already-exist", roleDao.exist("code", code), code);
SystemRoleEntity model = new SystemRoleEntity();
model.setId(uuid12());
model.setCode(code);
model.setName(po.getName());
model.setRemark(po.getRemark());
this.roleDao.insert(model);
return model;
}
@Override
public SystemRoleEntity checkRoleDetail(String id) throws Exception {
id = $("id", id);
SystemRoleEntity model = this.roleDao.select("id", id);
return model;
}
@Override
public SystemRoleEntity modifyRole(String id, SysRolePo po) throws Exception {
id = $("id", id);
ParameterObjectValidator.throwIfFail(po);
// 旧数据
SystemRoleEntity old = this.roleDao.select("id", id);
assertNotNull("not-exist.id", old, id);
KeyValueMap needUpdateMap = new KeyValueMap(4);
// 1.代号
String newCode = po.getCode();
if (!old.getCode().equals(newCode)) {
//不能重复
assertFalse("already-exist.code", functionalityDao.exist("code", newCode), newCode);
old.setCode(newCode);
needUpdateMap.put("code", newCode);
}
//2.名称
String newName = po.getName();
if (!po.getName().equals(newName)) {
old.setName(newName);
needUpdateMap.put("name", newName);
}
//3.备注
String newRemark = po.getRemark();
if (!Objects.equals(newRemark, po.getRemark())) {
old.setRemark(newRemark);
needUpdateMap.put("remark", newRemark);
}
this.roleDao.update(id, needUpdateMap);
return old;
}
@Override
public List<SystemRoleEntity> listRole(String key)
throws Exception {
key = trim(key);
List<SystemRoleEntity> list = this.roleDao.selectsByLike(
SelectLikePo.of("code,name,remark",key)
.setOrderBy("code"));
return list;
}
@Override
public List<SystemFunctionalityEntity> listSystemFunctionalityOfRole(String roleId)
throws Exception {
roleId=$("roleId",roleId);
List<SystemFunctionalityEntity> list = this.functionalityDao.selectByRoleId(roleId);
return list;
}
@Override
public void grantSystemFunctionalitysToRole(String roleId, String... functionalityIds)
throws Exception {
roleId=$("roleId",roleId);
// 先清空
this.roleDao.disjoinOnFunctionality(roleId);
// 再添加
for (String mId : functionalityIds) {
mId = trim(mId);
if (mId != null) {
this.roleDao.joinOnFunctionality(roleId, mId);
}
}
}
@Override
public List<SystemUserEntity> listUserOfRole(String roleId)
throws Exception {
roleId=$("roleId",roleId);
List<SystemUserEntity> list = this.userDao.selectByRoleId(roleId);
return list;
}
@Override
public void deleteSystemRole(String id) throws Exception {
id = $("id", id);
SystemRoleEntity r = roleDao.select("id", id);
assertNotNull("not-exist.id", r,id);
//删除角色和功能关联关系
roleDao.disjoinOnFunctionality(id);
//删除角色和用户关联关系
roleDao.disjoinOnUser(id);
//删除角色
roleDao.delete("id", id);
}
}
|
use std::cmp::{min, Ordering};
use std::error;
use std::io;
use std::str::FromStr;
fn read_line() -> Result<String, io::Error> {
let mut result = String::new();
io::stdin().read_line(&mut result)?;
Ok(result)
}
fn read_array<T: FromStr>() -> Result<Vec<T>, Box<dyn error::Error>>
where T::Err: error::Error + 'static
{
let result = read_line()?.trim().split(' ').map(&str::parse).collect::<Result<Vec<T>, _>>()?;
Ok(result)
}
fn swaps_with_selection_sort<F: Fn(usize, &usize) -> Ordering>(mut arr: Vec<usize>, by: F) -> usize {
let mut result = 0;
for i in 0..arr.len() - 1 {
let idx_to_swap = &arr[i..arr.len()]
.iter()
.enumerate()
.min_by(|(_, &a), (_, b)| by(a, b))
.map(|(idx, _)| i + idx)
.expect("min or max always exists");
if *idx_to_swap != i {
arr.swap(i, *idx_to_swap);
result += 1;
}
}
result
}
fn solution(arr: Vec<usize>) -> usize {
let asc_sort_result = swaps_with_selection_sort(arr.to_owned(), |a, b| a.cmp(b));
let desc_sort_result = swaps_with_selection_sort(arr, |a, b| a.cmp(b).reverse());
min(asc_sort_result, desc_sort_result)
}
fn main() -> Result<(), Box<dyn error::Error>> {
read_line()?;
let arr: Vec<usize> = read_array()?;
let result = solution(arr);
println!("{}", result);
Ok(())
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_input_0() {
let input = vec![7, 15, 12, 3];
assert_eq!(solution(input), 2);
}
#[test]
fn test_input_1() {
let input = vec![2, 5, 3, 1];
assert_eq!(solution(input), 2);
}
#[test]
fn test_case_1() {
let input = vec![3, 4, 2, 5, 1];
assert_eq!(solution(input), 2);
}
}
|
package com.imooc.o2o.util;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
public class FTPTransferUtil {
private static Logger logger = LoggerFactory.getLogger(PropertiesUtil.class);
private static String ftpIp = PropertiesUtil.getProperties("ftp.server.ip");
private static String ftpPort= PropertiesUtil.getProperties("ftp.server.port");
private static String ftpUser= PropertiesUtil.getProperties("ftp.server.user");
private static String ftpPassword= PropertiesUtil.getProperties("ftp.server.password");
public class FTPClient{
private String ip;
private int port;
private String user;
private String pwd;
private FTPClient ftpClient;
}
}
|
<?php
require_once 'phing/Task.php';
require_once('PEAR/PackageFileManager2.php');
/**
* Task to run phpDocumentor for PRADO API docs.
*/
class PradoPearTask extends Task
{
private $pkgdir;
private $channel;
private $version;
private $state;
private $category;
private $package;
private $summary;
private $pkgdescription;
private $notes;
private $license;
function setPkgdir($value)
{
$this->pkgdir=$value;
}
function setChannel($value)
{
$this->channel=$value;
}
function setVersion($value)
{
$this->version=$value;
}
function setState($value)
{
$this->state=$value;
}
function setCategory($value)
{
$this->category=$value;
}
function setPackage($value)
{
$this->package=$value;
}
function setSummary($value)
{
$this->summary=$value;
}
function setPkgdescription($value)
{
$this->pkgdescription=$value;
}
function setNotes($value)
{
$this->notes=$value;
}
function setLicense($value)
{
$this->license=$value;
}
/**
* Main entrypoint of the task
*/
function main()
{
$pkg = new PEAR_PackageFileManager2();
$e = $pkg->setOptions(
array(
'baseinstalldir' => 'prado',
'packagedirectory' => $this->pkgdir,
'pathtopackagefile' => $this->pkgdir,
'filelistgenerator' => 'file',
'simpleoutput' => true,
'ignore' => array(),
'dir_roles' =>
array(
'docs' => 'doc',
'examples' => 'doc',
'framework' => 'php',
'framework/js' => 'doc',
'framework/3rdParty' => 'doc',
),
'exceptions' =>
array(
'requirements.php' => 'doc',
),
)
);
// PEAR error checking
if (PEAR::isError($e))
die($e->getMessage());
$pkg->setPackage($this->package);
$pkg->setSummary($this->summary);
$pkg->setDescription($this->pkgdescription);
$pkg->setChannel($this->channel);
$pkg->setReleaseStability($this->state);
$pkg->setAPIStability($this->state);
$pkg->setReleaseVersion($this->version);
$pkg->setAPIVersion($this->version);
$pkg->setLicense($this->license);
$pkg->setNotes($this->notes);
$pkg->setPackageType('php');
$pkg->setPhpDep('5.0.0');
$pkg->setPearinstallerDep('1.4.2');
$pkg->addRelease();
$pkg->addMaintainer('lead','qxue','Qiang (Charlie) Xue','qiang.xue@gmail.com');
$test = $pkg->generateContents();
$e = $pkg->writePackageFile();
if (PEAR::isError($e))
echo $e->getMessage();
}
}
?>
|
package me.panpf.sketch.sample.bean
import com.google.gson.annotations.SerializedName
class TenorSearchResponse(@SerializedName("results") val dataList: List<TenorData>?)
class TenorData(@SerializedName("media") private val media: List<TenorMedia>?) {
val gifMedia: TenorMediaData?
get() = media?.get(0)?.gifMedia
val tinyGifMedia: TenorMediaData?
get() = media?.get(0)?.tinyGifMedia
}
class TenorMedia(@SerializedName("gif") val gifMedia: TenorMediaData, @SerializedName("tinygif") val tinyGifMedia: TenorMediaData)
class TenorMediaData(@SerializedName("url") val url: String
, @SerializedName("dims") private val dims: Array<Int>
, @SerializedName("preview") val preview: String
, @SerializedName("size") val size: Long) {
val width: Int
get() = dims[0]
val height: Int
get() = dims[1]
}
|
require 'bundler/setup'
Bundler.require :test
require 'psych/e'
FIXTURES_ROOT = File.expand_path("fixtures", __dir__)
SUPPORT_ROOT = File.expand_path("support", __dir__)
Dir["#{__dir__}/support/**/*.rb"].each {|file| require file }
RSpec.configure do |c|
c.include Helpers
c.include CustomMatchers
c.filter_run_excluding broken: true
end
|
--add new columns
ALTER TABLE user_project ADD created_time TIMESTAMP NOT NULL DEFAULT '2017-001-01 00:00:00';
ALTER TABLE user_project ADD updated_time TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP;
ALTER TABLE user_organization ADD created_time TIMESTAMP NOT NULL DEFAULT '2017-001-01 00:00:00';
ALTER TABLE user_organization ADD updated_time TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP;
ALTER TABLE user_skill ADD created_time TIMESTAMP NOT NULL DEFAULT '2017-001-01 00:00:00';
ALTER TABLE user_skill ADD updated_time TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP;
ALTER TABLE project_skill ADD created_time TIMESTAMP NOT NULL DEFAULT '2017-001-01 00:00:00';
ALTER TABLE project_skill ADD updated_time TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP;
|
import os
import numpy as np
import torch
from torch.utils.data import Dataset
import random
def load_sleep_data(data_path='preprocessed'):
data = []
labels = []
for file in os.listdir(data_path):
if not file.endswith('.npz'):
continue
path = os.path.join(data_path, file)
loaded = np.load(path)
data.append(loaded['x'])
labels.append(loaded['y'])
return data, labels
class BatchedSleepDataset(Dataset):
def __init__(self, data, labels, minibatch_size=20):
self.data = data
self.labels = labels
self.minibatch_size = minibatch_size
self.reshuffle()
def reshuffle(self):
self.shifts = []
self.cur_lens = []
self.total_len = 0
for subj_data in self.data:
max_skip = 5 * self.minibatch_size + subj_data.shape[0] % self.minibatch_size
cur_skip = random.randint(0, max_skip)
self.shifts.append(cur_skip)
cur_len = (subj_data.shape[0] - cur_skip) // self.minibatch_size
self.cur_lens.append(cur_len)
self.total_len += cur_len
def __len__(self):
return self.total_len
def __getitem__(self, index):
subj_idx = len(self.data) - 1
for idx, subj_data in enumerate(self.data):
cur_len = self.cur_lens[idx]
if index >= cur_len:
index -= cur_len
else:
subj_idx = idx
break
start_idx = self.shifts[subj_idx] + index * self.minibatch_size
item_data = self.data[subj_idx][start_idx:start_idx + self.minibatch_size]
item_labels = self.labels[subj_idx][start_idx:start_idx + self.minibatch_size]
return torch.tensor(item_data, dtype=torch.float).unsqueeze(1), \
torch.tensor(item_labels, dtype=torch.long).unsqueeze(1)
class SleepDataset(Dataset):
def __init__(self, data, labels):
self.data = data
self.labels = labels
def __len__(self):
return len(self.data)
def __getitem__(self, index):
return torch.tensor(self.data[index], dtype=torch.float).unsqueeze(1), \
torch.tensor(self.labels[index], dtype=torch.long).unsqueeze(1)
def load_split_sleep_dataset(data_path='preprocessed', minibatch_size=20):
data, labels = load_sleep_data(data_path)
train_size = round(len(data) - 8)
data_train, labels_train = data[:train_size], labels[:train_size]
data_test, labels_test = data[train_size:], labels[train_size:]
return BatchedSleepDataset(data_train, labels_train, minibatch_size), SleepDataset(data_test, labels_test)
|
import { createBrowserHistory } from 'history';
import { getFromLocalStorage, setToLocalStorage } from '../services/local-storage.service';
import { USER_TOKENS, AUTH_ERRORS } from '../configs';
import { regenerateUserTokenPairs } from '../redux/user/user.operations';
export const history = createBrowserHistory();
const { ACCESS_TOKEN, REFRESH_TOKEN } = USER_TOKENS;
const refreshAuthToken = async () => {
let isRegenerateTokens = false;
const refreshToken = getFromLocalStorage(REFRESH_TOKEN);
if (refreshToken) {
const newTokenPair = await regenerateUserTokenPairs(refreshToken);
if (newTokenPair?.message !== AUTH_ERRORS.REFRESH_TOKEN_IS_NOT_VALID) {
setToLocalStorage(ACCESS_TOKEN, newTokenPair.token);
setToLocalStorage(REFRESH_TOKEN, newTokenPair.refreshToken);
isRegenerateTokens = true;
}
}
return isRegenerateTokens;
};
export default refreshAuthToken;
|
# this file imports some js-native components for use in reactive-ruby
# note that assigning a symbol to constants is a bit hacky but whatever.
# the alternative would be to use e.g. :Spinner everywhere
React::API.import_native_component(:Spinner, `Spinner`)
Spinner = :Spinner
|
#pragma once
#include "VulkanResources.h"
#include "RenderResource.h"
enum struct TextureSource
{
Checker,
ColorGradient
};
struct RenderTextureResource : RenderResourceBase
{
RenderTextureResource(ResourceManagerBase& manager) : RenderResourceBase(manager) {}
TextureSource source = TextureSource::Checker;
RenderBufferHandle stagingBuffer;
ImageHandle image;
ImageViewHandle view;
};
typedef ResourceHandle<RenderTextureResource> RenderTextureHandle;
class VulkanContext;
class RenderTextureManager : public ResourceManager<RenderTextureResource>
{
public:
RenderTextureManager(VulkanContext* context);
RenderTextureHandle loadTexture(TextureSource source);
private:
VulkanContext* vCtx = nullptr;
};
|
<?php
use Illuminate\Support\Facades\Route;
/*
|--------------------------------------------------------------------------
| Web Routes
|--------------------------------------------------------------------------
|
| Here is where you can register web routes for your application. These
| routes are loaded by the RouteServiceProvider within a group which
| contains the "web" middleware group. Now create something great!
|
*/
Route::get('/', function () {
return view('welcome');
});
Auth::routes();
Route::get('/home', 'HomeController@index')->name('home');
#################### Headline Controller ####################
Route::get('headline/{business}/{emotion}', 'HeadlineController@keyword_page');
Route::get('headline/{business}/{emotion}/{keyword}', 'HeadlineController@list_headline');
Route::post('headline/findnow', 'HeadlineController@find_now');
#################### Headline Controller ####################
#################### Admin Controller ####################
Route::get('admin/login','AdminController@loginform');
Route::get('admin/dashboard', 'AdminController@index');
// Check authentictaion
Route::post('admin/check-login', 'AdminController@checklogin');
#################### Admin Controller ####################
#################### Admin Headline Controller ####################
Route::get('admin/headline/create', 'AdminHeadlineController@create_headline');
Route::get('admin/headline/emotion', 'AdminHeadlineController@add_emotion');
Route::get('admin/headline/business', 'AdminHeadlineController@add_business');
Route::get('admin/headline/keywords', 'AdminHeadlineController@add_keywords');
// Store
Route::post('admin/headline/emotion/store', 'AdminHeadlineController@store_emotion');
Route::post('admin/headline/business/store', 'AdminHeadlineController@store_business');
Route::post('admin/headline/keyword/store', 'AdminHeadlineController@store_keywords');
Route::post('admin/headline/headline/store', 'AdminHeadlineController@store_headline');
#################### Admin Headline Controller ####################
|
module TransactionService::API
class Process
TxProcessStore = TransactionService::Store::TransactionProcess
def get(community_id:, process_id: nil)
if process_id.nil?
Result::Success.new(TxProcessStore.get_all(community_id: community_id))
else
Maybe(TxProcessStore.get(community_id: community_id, process_id: process_id))
.map { |res| Result::Success.new(res) }
.or_else(Result::Error.new("Cannot find transaction process for community_id: #{community_id} and process_id: #{process_id}"))
end
end
def create(community_id:, process:, author_is_seller:)
Maybe(TxProcessStore.create(
community_id: community_id,
opts: {process: process, author_is_seller: author_is_seller}))
.map { |m| Result::Success.new(m) }
.or_else(Result::Error.new("Failed to create new transaction process."))
end
end
end
|
package com.ymy.web.beans
import com.google.gson.annotations.SerializedName
import com.ymy.core.user.YmyUserManager
import com.ymy.web.WebUrlConstant
data class WebEnvs(
@SerializedName("baseUrl")
val baseUrl: String = "",
@SerializedName("quick_url")
val quickUrl: String = WebUrlConstant.quickWebBaseUrl,
@SerializedName("h5_url")
val h5Url: String = WebUrlConstant.hybridWebUrl,
@SerializedName("javaUrl")
val javaUrl: String = "",
@SerializedName("company_alias")
val companyAlias: String = YmyUserManager.user.companyName,
@SerializedName("company_id")
val companyId: String = YmyUserManager.user.companyId.toString(),
@SerializedName("companyId")
val company_Id: String = YmyUserManager.user.companyId.toString(),
@SerializedName("companyName")
val companyName: String = YmyUserManager.user.companyName,
@SerializedName("mapid")
val mapid: String = YmyUserManager.mapId,
@SerializedName("token")
val token: String = YmyUserManager.token,
@SerializedName("userID")
val userID: String = YmyUserManager.user.userId,
@SerializedName("platform")
val platform: String = "",
)
|
'use strict';
var bootstrap = module.exports;
var http = require('http');
var express = require('express');
var bodyParser = require('body-parser');
var getRawBody = require('raw-body');
var signatureVerify = require('../lib/express');
var TEST_MASTER_KEY = 'jj4tA4PDmEhYGBkUNwvfNzMW703D9nRGtp4U9S5b5nM';
bootstrap.TEST_MASTER_KEY = TEST_MASTER_KEY;
bootstrap.createHttpServer = function(verifier, done, cb) {
var bp = bodyParser.json({
verify: function(req, res, buf) {
req.rawBody = buf;
},
});
// Test server instance
var server = http.createServer(function(req, res) {
// Run the verifier on the inbound request
return bp(req, res, function(err) {
if (err) {
res.statusCode = 500;
return res.end();
}
verifier.test(req)
.then(function() {
// If it succeeds, end the request
// status=200
req.resume();
res.end();
})
.catch(function(err) {
// If it fails, return the message
// status=400|401
res.statusCode = err.statusCode;
res.end(err.reason);
});
});
});
// Fail the test case on server error
server.on('error', done);
// Listen on 3000, to match mock signed request
server.listen(3000, function(err) {
cb(err, server);
});
};
bootstrap.createExpressServer = function(cb) {
var app = express();
app.use(bodyParser.json({
verify: signatureVerify.appendRawBody,
}));
app.all('*', signatureVerify.middleware({
autoRespond: false,
masterKey: TEST_MASTER_KEY,
}), function(req, res) {
if (req.manifoldInvalidSignature) {
var err = req.manifoldInvalidSignature;
res.statusCode = err.statusCode;
return res.end(err.reason);
}
res.end();
});
var server = app.listen(3000, function(err) {
cb(err, server);
});
};
bootstrap.sendRequest = function(opts, cb) {
var req = http.request(opts);
var body = JSON.stringify(opts.body)+"\n";
req.write(body);
req.on('response', function(res) {
getRawBody(res, { encoding: true }, function(err, txt) {
cb(err, res, txt);
});
});
};
|
// This file is auto generated
// Use `npm run code-generate:images` to update this file
export type ImageAssets = Readonly<
Record<
| 'autoBattleSwitchOff'
| 'cancelButton'
| 'closeButton'
| 'cloverButton'
| 'cloverPage'
| 'continueButtonBlue'
| 'continueButtonRed'
| 'enemyLegend'
| 'ex'
| 'exWhite'
| 'findTeam'
| 'giveUpButtonBlue'
| 'giveUpButtonWhite'
| 'levelSelect'
| 'levelSelectBeginner'
| 'levelSelectExpert'
| 'levelSelectMaster'
| 'levelSelectStandard'
| 'loadingText'
| 'lv29Button'
| 'menuButton'
| 'nextBattleBlue'
| 'nextText'
| 'noContinueButton'
| 'not4pplStart'
| 'okButton'
| 'presentButton'
| 'presentPrice0'
| 'presentPrice1500'
| 'presentPrice15000'
| 'presentPrice4000'
| 'presentPrice8000'
| 'rareItem'
| 'repeatBattleButton'
| 'repeatWithStaminaButton'
| 'retryButtonBlue'
| 'retryButtonRed'
| 'startBattleButton'
| 'stillStartButton'
| 'stillStartButtonRed'
| 'supportSelectButton'
| 'supportSkillAvailable'
| 'tapButton'
| 'teamReadyButton'
| 'transformGaugeFull'
| 'x0',
Image
>
>;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.